| blob | 4798aae1fbb3482200d59800acbcb71f65a8da28 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2022 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 cp_expr cp_parser_identifier
2232 static cp_expr cp_parser_string_literal
2234 static cp_expr cp_parser_userdef_char_literal
2236 static tree cp_parser_userdef_string_literal
2238 static cp_expr cp_parser_userdef_numeric_literal
2241 /* Basic concepts [gram.basic] */
2245 /* Expressions [gram.expr] */
2247 static cp_expr cp_parser_primary_expression
2249 static cp_expr cp_parser_id_expression
2251 static cp_expr cp_parser_unqualified_id
2253 static tree cp_parser_nested_name_specifier_opt
2255 static tree cp_parser_nested_name_specifier
2257 static tree cp_parser_qualifying_entity
2259 static cp_expr cp_parser_postfix_expression
2261 static tree cp_parser_postfix_open_square_expression
2263 static tree cp_parser_postfix_dot_deref_expression
2268 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2270 static void cp_parser_pseudo_destructor_name
2272 static cp_expr cp_parser_unary_expression
2274 static enum tree_code cp_parser_unary_operator
2276 static tree cp_parser_has_attribute_expression
2278 static tree cp_parser_new_expression
2282 static tree cp_parser_new_type_id
2290 static tree cp_parser_delete_expression
2292 static cp_expr cp_parser_cast_expression
2294 static cp_expr cp_parser_binary_expression
2296 static tree cp_parser_question_colon_clause
2299 static cp_expr cp_parser_assignment_expression
2301 static enum tree_code cp_parser_assignment_operator_opt
2303 static cp_expr cp_parser_expression
2305 static cp_expr cp_parser_constant_expression
2307 static cp_expr cp_parser_builtin_offsetof
2309 static cp_expr cp_parser_lambda_expression
2311 static void cp_parser_lambda_introducer
2313 static bool cp_parser_lambda_declarator_opt
2315 static void cp_parser_lambda_body
2318 /* Statements [gram.stmt.stmt] */
2320 static void cp_parser_statement
2322 static void cp_parser_label_for_labeled_statement
2324 static tree cp_parser_expression_statement
2326 static tree cp_parser_compound_statement
2328 static void cp_parser_statement_seq_opt
2330 static tree cp_parser_selection_statement
2332 static tree cp_parser_condition
2334 static tree cp_parser_iteration_statement
2336 static bool cp_parser_init_statement
2338 static tree cp_parser_for
2340 static tree cp_parser_c_for
2342 static tree cp_parser_range_for
2344 static void do_range_for_auto_deduction
2346 static tree cp_parser_perform_range_for_lookup
2348 static tree cp_parser_range_for_member_function
2350 static tree cp_parser_jump_statement
2352 static void cp_parser_declaration_statement
2355 static tree cp_parser_implicitly_scoped_statement
2357 static void cp_parser_already_scoped_statement
2360 /* State of module-declaration parsing. */
2361 enum module_parse
2362 {
2365 _MP_UNUSED,
2375 };
2377 static module_parse cp_parser_module_declaration
2379 static void cp_parser_import_declaration
2382 /* Declarations [gram.dcl.dcl] */
2384 static void cp_parser_declaration_seq_opt
2386 static void cp_parser_declaration
2388 static void cp_parser_toplevel_declaration
2390 static void cp_parser_block_declaration
2392 static void cp_parser_simple_declaration
2394 static void cp_parser_decl_specifier_seq
2396 static tree cp_parser_storage_class_specifier_opt
2398 static tree cp_parser_function_specifier_opt
2400 static tree cp_parser_type_specifier
2403 static tree cp_parser_simple_type_specifier
2405 static tree cp_parser_placeholder_type_specifier
2407 static tree cp_parser_type_name
2409 static tree cp_parser_nonclass_name
2411 static tree cp_parser_elaborated_type_specifier
2413 static tree cp_parser_enum_specifier
2415 static void cp_parser_enumerator_list
2417 static void cp_parser_enumerator_definition
2419 static tree cp_parser_namespace_name
2421 static void cp_parser_namespace_definition
2423 static void cp_parser_namespace_body
2425 static tree cp_parser_qualified_namespace_specifier
2427 static void cp_parser_namespace_alias_definition
2429 static bool cp_parser_using_declaration
2431 static void cp_parser_using_directive
2433 static void cp_parser_using_enum
2435 static tree cp_parser_alias_declaration
2437 static void cp_parser_asm_definition
2439 static void cp_parser_linkage_specification
2441 static void cp_parser_static_assert
2443 static tree cp_parser_decltype
2445 static tree cp_parser_decomposition_declaration
2448 /* Declarators [gram.dcl.decl] */
2450 static tree cp_parser_init_declarator
2460 static enum tree_code cp_parser_ptr_operator
2462 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2464 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2466 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2468 static tree cp_parser_tx_qualifier_opt
2470 static tree cp_parser_late_return_type_opt
2472 static tree cp_parser_declarator_id
2474 static tree cp_parser_type_id
2476 static tree cp_parser_template_type_arg
2479 static tree cp_parser_type_id_1
2481 static void cp_parser_type_specifier_seq
2483 static tree cp_parser_parameter_declaration_clause
2485 static tree cp_parser_parameter_declaration_list
2489 static tree cp_parser_default_argument
2491 static void cp_parser_function_body
2493 static tree cp_parser_initializer
2495 static cp_expr cp_parser_initializer_clause
2497 static cp_expr cp_parser_braced_list
2502 static void cp_parser_ctor_initializer_opt_and_function_body
2505 static tree cp_parser_late_parsing_omp_declare_simd
2508 static tree cp_parser_late_parsing_oacc_routine
2511 static tree synthesize_implicit_template_parm
2513 static tree finish_fully_implicit_template
2515 static void abort_fully_implicit_template
2518 /* Classes [gram.class] */
2520 static tree cp_parser_class_name
2522 static tree cp_parser_class_specifier
2524 static tree cp_parser_class_head
2526 static enum tag_types cp_parser_class_key
2528 static void cp_parser_type_parameter_key
2530 static void cp_parser_member_specification_opt
2532 static void cp_parser_member_declaration
2534 static tree cp_parser_pure_specifier
2536 static tree cp_parser_constant_initializer
2539 /* Derived classes [gram.class.derived] */
2541 static tree cp_parser_base_clause
2543 static tree cp_parser_base_specifier
2546 /* Special member functions [gram.special] */
2548 static tree cp_parser_conversion_function_id
2550 static tree cp_parser_conversion_type_id
2554 static void cp_parser_ctor_initializer_opt
2556 static void cp_parser_mem_initializer_list
2558 static tree cp_parser_mem_initializer
2560 static tree cp_parser_mem_initializer_id
2563 /* Overloading [gram.over] */
2565 static cp_expr cp_parser_operator_function_id
2567 static cp_expr cp_parser_operator
2570 /* Templates [gram.temp] */
2572 static void cp_parser_template_declaration
2574 static tree cp_parser_template_parameter_list
2576 static tree cp_parser_template_parameter
2578 static tree cp_parser_type_parameter
2580 static tree cp_parser_template_id
2582 static tree cp_parser_template_id_expr
2584 static tree cp_parser_template_name
2586 static tree cp_parser_template_argument_list
2588 static tree cp_parser_template_argument
2590 static void cp_parser_explicit_instantiation
2592 static void cp_parser_explicit_specialization
2595 /* Exception handling [gram.except] */
2597 static tree cp_parser_try_block
2599 static void cp_parser_function_try_block
2601 static void cp_parser_handler_seq
2603 static void cp_parser_handler
2605 static tree cp_parser_exception_declaration
2607 static tree cp_parser_throw_expression
2609 static tree cp_parser_exception_specification_opt
2611 static tree cp_parser_type_id_list
2613 static tree cp_parser_noexcept_specification_opt
2616 /* GNU Extensions */
2618 static tree cp_parser_asm_specification_opt
2620 static tree cp_parser_asm_operand_list
2622 static tree cp_parser_asm_clobber_list
2624 static tree cp_parser_asm_label_list
2626 static bool cp_next_tokens_can_be_attribute_p
2628 static bool cp_next_tokens_can_be_gnu_attribute_p
2630 static bool cp_next_tokens_can_be_std_attribute_p
2632 static bool cp_nth_tokens_can_be_std_attribute_p
2634 static bool cp_nth_tokens_can_be_gnu_attribute_p
2636 static bool cp_nth_tokens_can_be_attribute_p
2638 static tree cp_parser_attributes_opt
2640 static tree cp_parser_gnu_attributes_opt
2642 static tree cp_parser_gnu_attribute_list
2644 static tree cp_parser_std_attribute
2646 static tree cp_parser_std_attribute_spec
2648 static tree cp_parser_std_attribute_spec_seq
2650 static size_t cp_parser_skip_std_attribute_spec_seq
2652 static size_t cp_parser_skip_attributes_opt
2654 static bool cp_parser_extension_opt
2656 static void cp_parser_label_declaration
2659 /* Concept Extensions */
2661 static tree cp_parser_concept_definition
2663 static tree cp_parser_constraint_expression
2665 static tree cp_parser_requires_clause_opt
2667 static tree cp_parser_requires_expression
2669 static tree cp_parser_requirement_parameter_list
2671 static tree cp_parser_requirement_body
2673 static tree cp_parser_requirement_seq
2675 static tree cp_parser_requirement
2677 static tree cp_parser_simple_requirement
2679 static tree cp_parser_compound_requirement
2681 static tree cp_parser_type_requirement
2683 static tree cp_parser_nested_requirement
2686 /* Transactional Memory Extensions */
2688 static tree cp_parser_transaction
2690 static tree cp_parser_transaction_expression
2692 static void cp_parser_function_transaction
2694 static tree cp_parser_transaction_cancel
2697 /* Coroutine extensions. */
2699 static tree cp_parser_yield_expression
2702 /* Contracts */
2704 static void cp_parser_late_contract_condition
2708 pragma_external,
2709 pragma_member,
2710 pragma_objc_icode,
2711 pragma_stmt,
2712 pragma_compound
2713 };
2714 static bool cp_parser_pragma
2717 /* Objective-C++ Productions */
2719 static tree cp_parser_objc_message_receiver
2721 static tree cp_parser_objc_message_args
2723 static tree cp_parser_objc_message_expression
2725 static cp_expr cp_parser_objc_encode_expression
2727 static tree cp_parser_objc_defs_expression
2729 static tree cp_parser_objc_protocol_expression
2731 static tree cp_parser_objc_selector_expression
2733 static cp_expr cp_parser_objc_expression
2735 static bool cp_parser_objc_selector_p
2737 static tree cp_parser_objc_selector
2739 static tree cp_parser_objc_protocol_refs_opt
2741 static void cp_parser_objc_declaration
2743 static tree cp_parser_objc_statement
2745 static bool cp_parser_objc_valid_prefix_attributes
2747 static void cp_parser_objc_at_property_declaration
2749 static void cp_parser_objc_at_synthesize_declaration
2751 static void cp_parser_objc_at_dynamic_declaration
2753 static tree cp_parser_objc_struct_declaration
2756 /* Utility Routines */
2758 static cp_expr cp_parser_lookup_name
2760 static tree cp_parser_lookup_name_simple
2762 static tree cp_parser_maybe_treat_template_as_class
2764 static bool cp_parser_check_declarator_template_parameters
2766 static bool cp_parser_check_template_parameters
2768 static cp_expr cp_parser_simple_cast_expression
2770 static tree cp_parser_global_scope_opt
2772 static bool cp_parser_constructor_declarator_p
2774 static tree cp_parser_function_definition_from_specifiers_and_declarator
2776 static tree cp_parser_function_definition_after_declarator
2778 static bool cp_parser_template_declaration_after_export
2780 static void cp_parser_perform_template_parameter_access_checks
2782 static tree cp_parser_single_declaration
2784 static cp_expr cp_parser_functional_cast
2786 static tree cp_parser_save_member_function_body
2788 static tree cp_parser_save_nsdmi
2790 static tree cp_parser_enclosed_template_argument_list
2792 static void cp_parser_save_default_args
2794 static void cp_parser_late_parsing_for_member
2796 static tree cp_parser_late_parse_one_default_arg
2798 static void cp_parser_late_parsing_nsdmi
2800 static void cp_parser_late_parsing_default_args
2802 static tree cp_parser_sizeof_operand
2804 static cp_expr cp_parser_trait
2806 static bool cp_parser_declares_only_class_p
2808 static void cp_parser_set_storage_class
2810 static void cp_parser_set_decl_spec_type
2812 static void set_and_check_decl_spec_loc
2815 static bool cp_parser_friend_p
2817 static void cp_parser_required_error
2823 static bool cp_parser_token_starts_function_definition_p
2825 static bool cp_parser_next_token_starts_class_definition_p
2827 static bool cp_parser_next_token_ends_template_argument_p
2829 static bool cp_parser_nth_token_starts_template_argument_list_p
2831 static enum tag_types cp_parser_token_is_class_key
2833 static enum tag_types cp_parser_token_is_type_parameter_key
2836 static void cp_parser_check_class_key
2838 static void cp_parser_check_access_in_redeclaration
2840 static bool cp_parser_optional_template_keyword
2842 static void cp_parser_pre_parsed_nested_name_specifier
2844 static bool cp_parser_cache_group
2846 static tree cp_parser_cache_defarg
2848 static void cp_parser_parse_tentatively
2850 static void cp_parser_commit_to_tentative_parse
2852 static void cp_parser_commit_to_topmost_tentative_parse
2854 static void cp_parser_abort_tentative_parse
2856 static bool cp_parser_parse_definitely
2860 static bool cp_parser_uncommitted_to_tentative_parse_p
2862 static void cp_parser_error
2864 static void cp_parser_name_lookup_error
2866 static bool cp_parser_simulate_error
2868 static bool cp_parser_check_type_definition
2870 static void cp_parser_check_for_definition_in_return_type
2872 static void cp_parser_check_for_invalid_template_id
2874 static bool cp_parser_non_integral_constant_expression
2876 static void cp_parser_diagnose_invalid_type_name
2878 static bool cp_parser_parse_and_diagnose_invalid_type_name
2880 static int cp_parser_skip_to_closing_parenthesis
2882 static void cp_parser_skip_to_end_of_statement
2884 static void cp_parser_consume_semicolon_at_end_of_statement
2886 static void cp_parser_skip_to_end_of_block_or_statement
2888 static bool cp_parser_skip_to_closing_brace
2890 static bool cp_parser_skip_entire_template_parameter_list
2892 static void cp_parser_require_end_of_template_parameter_list
2894 static bool cp_parser_skip_to_end_of_template_parameter_list
2896 static void cp_parser_skip_to_pragma_eol
2898 static bool cp_parser_error_occurred
2900 static bool cp_parser_allow_gnu_extensions_p
2902 static bool cp_parser_is_pure_string_literal
2904 static bool cp_parser_is_string_literal
2906 static bool cp_parser_is_keyword
2908 static tree cp_parser_make_typename_type
2912 static bool cp_parser_compound_literal_p
2914 static bool cp_parser_array_designator_p
2916 static bool cp_parser_init_statement_p
2918 static bool cp_parser_skip_up_to_closing_square_bracket
2920 static bool cp_parser_skip_to_closing_square_bracket
2924 // -------------------------------------------------------------------------- //
2925 // Unevaluated Operand Guard
2926 //
2927 // Implementation of an RAII helper for unevaluated operand parsing.
2929 {
2932 }
2935 {
2938 }
2940 // -------------------------------------------------------------------------- //
2941 // Tentative Parsing
2943 /* Returns nonzero if we are parsing tentatively. */
2947 {
2949 }
2951 /* Returns nonzero if TOKEN is a string literal. */
2953 static bool
2955 {
2961 }
2963 /* Returns nonzero if TOKEN is a string literal
2964 of a user-defined string literal. */
2966 static bool
2968 {
2975 }
2977 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2979 static bool
2981 {
2983 }
2985 /* Helper function for cp_parser_error.
2986 Having peeked a token of kind TOK1_KIND that might signify
2987 a conflict marker, peek successor tokens to determine
2988 if we actually do have a conflict marker.
2989 Specifically, we consider a run of 7 '<', '=' or '>' characters
2990 at the start of a line as a conflict marker.
2991 These come through the lexer as three pairs and a single,
2992 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2993 If it returns true, *OUT_LOC is written to with the location/range
2994 of the marker. */
2996 static bool
2999 {
3010 /* It must be at the start of the line. */
3015 /* We have a conflict marker. Construct a location of the form:
3016 <<<<<<<
3017 ^~~~~~~
3018 with start == caret, finishing at the end of the marker. */
3023 }
3025 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
3026 RT_CLOSE_PAREN. */
3030 {
3032 {
3040 }
3041 }
3043 /* Attempt to convert TOKEN_DESC from a required_token to an
3044 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
3046 static enum cpp_ttype
3048 {
3050 {
3071 /* Use CPP_EOF as a "no completions possible" code. */
3073 }
3074 }
3077 /* Subroutine of cp_parser_error and cp_parser_required_error.
3079 Issue a diagnostic of the form
3080 FILE:LINE: MESSAGE before TOKEN
3081 where TOKEN is the next token in the input stream. MESSAGE
3082 (specified by the caller) is usually of the form "expected
3083 OTHER-TOKEN".
3085 This bypasses the check for tentative passing, and potentially
3086 adds material needed by cp_parser_required_error.
3088 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
3089 suggesting insertion of the missing token.
3091 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
3092 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
3093 location. */
3095 static void
3097 required_token missing_token_desc,
3098 location_t matching_location)
3099 {
3101 /* This diagnostic makes more sense if it is tagged to the line
3102 of the token we just peeked at. */
3106 {
3111 }
3113 /* If this is actually a conflict marker, report it as such. */
3117 {
3118 location_t loc;
3120 {
3123 /* Consume tokens until the end of the source line. */
3125 {
3139 }
3141 }
3142 }
3144 auto_diagnostic_group d;
3151 {
3152 /* Potentially supply a fix-it hint, suggesting to add the
3153 missing token immediately after the *previous* token.
3154 This may move the primary location within richloc. */
3158 prev_token_loc);
3160 /* If matching_location != UNKNOWN_LOCATION, highlight it.
3161 Attempt to consolidate diagnostics by printing it as a
3162 secondary range within the main diagnostic. */
3164 added_matching_location
3166 }
3168 /* If we were parsing a string-literal and there is an unknown name
3169 token right after, then check to see if that could also have been
3170 a literal string by checking the name against a list of known
3171 standard string literal constants defined in header files. If
3172 there is one, then add that as an hint to the error message. */
3173 name_hint h;
3177 {
3184 token_name,
3185 header_hint));
3186 }
3188 /* Actually emit the error. */
3190 /* Because c_parser_error does not understand
3191 CPP_KEYWORD, keywords are treated like
3192 identifiers. */
3197 {
3198 /* If we weren't able to consolidate matching_location, then
3199 print it as a secondary diagnostic. */
3204 }
3205 }
3207 /* If not parsing tentatively, issue a diagnostic of the form
3208 FILE:LINE: MESSAGE before TOKEN
3209 where TOKEN is the next token in the input stream. MESSAGE
3210 (specified by the caller) is usually of the form "expected
3211 OTHER-TOKEN". */
3213 static void
3215 {
3218 }
3220 /* Issue an error about name-lookup failing. NAME is the
3221 IDENTIFIER_NODE DECL is the result of
3222 the lookup (as returned from cp_parser_lookup_name). DESIRED is
3223 the thing that we hoped to find. */
3225 static void
3227 tree name,
3228 tree decl,
3229 name_lookup_error desired,
3230 location_t location)
3231 {
3232 /* If name lookup completely failed, tell the user that NAME was not
3233 declared. */
3235 {
3248 else
3250 }
3252 {
3254 {
3271 }
3272 }
3274 {
3276 {
3286 name);
3290 }
3291 }
3292 else
3293 {
3295 {
3308 }
3309 }
3310 }
3312 /* If we are parsing tentatively, remember that an error has occurred
3313 during this tentative parse. Returns true if the error was
3314 simulated; false if a message should be issued by the caller. */
3316 static bool
3318 {
3320 {
3323 }
3325 }
3327 /* This function is called when a type is defined. If type
3328 definitions are forbidden at this point, an error message is
3329 issued. */
3331 static bool
3333 {
3334 /* If types are forbidden here, issue a message. */
3336 {
3337 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3338 or %qs in the message need to be interpreted. */
3342 }
3344 }
3346 /* This function is called when the DECLARATOR is processed. The TYPE
3347 was a type defined in the decl-specifiers. If it is invalid to
3348 define a type in the decl-specifiers for DECLARATOR, an error is
3349 issued. TYPE_LOCATION is the location of TYPE and is used
3350 for error reporting. */
3352 static void
3355 {
3356 /* [dcl.fct] forbids type definitions in return types.
3357 Unfortunately, it's not easy to know whether or not we are
3358 processing a return type until after the fact. */
3366 {
3371 type);
3372 }
3373 }
3375 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3376 "<" in any valid C++ program. If the next token is indeed "<",
3377 issue a message warning the user about what appears to be an
3378 invalid attempt to form a template-id. LOCATION is the location
3379 of the type-specifier (TYPE) */
3381 static void
3383 tree type,
3385 location_t location)
3386 {
3390 {
3396 {
3399 else
3401 }
3402 else
3404 /* Remember the location of the invalid "<". */
3407 /* Consume the "<". */
3409 /* Parse the template arguments. */
3411 /* Permanently remove the invalid template arguments so that
3412 this error message is not issued again. */
3415 }
3416 }
3418 /* If parsing an integral constant-expression, issue an error message
3419 about the fact that THING appeared and return true. Otherwise,
3420 return false. In either case, set
3421 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3423 static bool
3425 non_integral_constant thing)
3426 {
3429 {
3431 {
3434 {
3437 "ISO C++ forbids using a floating-point literal "
3442 "enumeration type cannot appear in a "
3533 }
3537 }
3538 }
3540 }
3542 /* Emit a diagnostic for an invalid type name. This function commits
3543 to the current active tentative parse, if any. (Otherwise, the
3544 problematic construct might be encountered again later, resulting
3545 in duplicate error messages.) LOCATION is the location of ID. */
3547 static void
3549 location_t location)
3550 {
3553 /* Try to lookup the identifier. */
3560 /* If the lookup was ambiguous, an error will already have
3561 been issued. */
3563 /* If the lookup found a template-name, it means that the user forgot
3564 to specify an argument list. Emit a useful error message. */
3566 {
3567 auto_diagnostic_group d;
3570 decl);
3575 }
3579 /* Something like 'unsigned A a;' */
3582 {
3583 /* Issue an error message. */
3584 auto_diagnostic_group d;
3585 name_hint hint;
3589 {
3595 }
3596 else
3598 /* If we're in a template class, it's possible that the user was
3599 referring to a type from a base class. For example:
3601 template <typename T> struct A { typedef T X; };
3602 template <typename T> struct B : public A<T> { X x; };
3604 The user should have said "typename A<T>::X". */
3613 {
3616 id);
3619 id);
3620 else
3623 }
3640 {
3643 {
3647 {
3648 /* Go from a particular instantiation of the
3649 template (which will have an empty TYPE_FIELDs),
3650 to the main version. */
3656 {
3661 }
3662 }
3663 }
3664 found:;
3665 }
3666 }
3667 /* Here we diagnose qualified-ids where the scope is actually correct,
3668 but the identifier does not resolve to a valid type name. */
3670 {
3672 {
3673 auto_diagnostic_group d;
3674 name_hint hint;
3683 {
3686 "%qE in namespace %qE does not name a template"
3689 else
3693 }
3695 {
3698 "%qE in namespace %qE does not name a template"
3701 else
3703 "%qE in namespace %qE does not name a template"
3706 }
3707 else
3708 {
3711 "%qE in namespace %qE does not name a type"
3714 else
3718 }
3721 }
3724 {
3725 /* A<T>::A<T>() */
3726 auto_diagnostic_group d;
3732 }
3735 {
3740 "need %<typename%> before %<%T::%D::%E%> because "
3744 id,
3747 else
3751 }
3753 {
3754 auto_diagnostic_group d;
3766 else
3772 }
3773 else
3775 }
3776 }
3778 /* Check for a common situation where a type-name should be present,
3779 but is not, and issue a sensible error message. Returns true if an
3780 invalid type-name was detected.
3782 The situation handled by this function are variable declarations of the
3783 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3784 Usually, `ID' should name a type, but if we got here it means that it
3785 does not. We try to emit the best possible error message depending on
3786 how exactly the id-expression looks like. */
3788 static bool
3790 {
3791 tree id;
3794 /* Avoid duplicate error about ambiguous lookup. */
3796 {
3800 }
3809 /* If the next token is a (, this is a function with no explicit return
3810 type, i.e. constructor, destructor or conversion op. */
3813 {
3816 }
3820 /* Emit a diagnostic for the invalid type. */
3822 out:
3823 /* If we aren't in the middle of a declarator (i.e. in a
3824 parameter-declaration-clause), skip to the end of the declaration;
3825 there's no point in trying to process it. */
3829 }
3831 /* Consume tokens up to, and including, the next non-nested closing `)'.
3832 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3833 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3834 found an unnested token of that type. */
3836 static int
3839 cpp_ttype or_ttype,
3841 {
3852 {
3855 /* Have we found what we're looking for before the closing paren? */
3861 {
3865 /* FALLTHRU */
3867 /* If we've run out of tokens, then there is no closing `)'. */
3870 /* This is good for lambda expression capture-lists. */
3880 /* This matches the processing in skip_to_end_of_statement. */
3900 {
3904 }
3914 condop_depth--;
3920 /* FALLTHROUGH */
3923 /* We fell into a pragma. Skip it, and continue. */
3929 }
3931 /* Consume the token. */
3933 }
3934 }
3936 /* Consume tokens up to, and including, the next non-nested closing `)'.
3937 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3938 are doing error recovery. Returns -1 if OR_COMMA is true and we
3939 found an unnested token of that type. */
3941 static int
3946 {
3950 }
3952 /* Consume tokens until we reach the end of the current statement.
3953 Normally, that will be just before consuming a `;'. However, if a
3954 non-nested `}' comes first, then we stop before consuming that. */
3956 static void
3958 {
3961 /* Unwind generic function template scope if necessary. */
3966 {
3970 {
3974 /* FALLTHRU */
3976 /* If we've run out of tokens, stop. */
3980 /* If the next token is a `;', we have reached the end of the
3981 statement. */
3987 /* If this is a non-nested '}', stop before consuming it.
3988 That way, when confronted with something like:
3990 { 3 + }
3992 we stop before consuming the closing '}', even though we
3993 have not yet reached a `;'. */
3997 /* If it is the closing '}' for a block that we have
3998 scanned, stop -- but only after consuming the token.
3999 That way given:
4001 void f g () { ... }
4002 typedef int I;
4004 we will stop after the body of the erroneously declared
4005 function, but before consuming the following `typedef'
4006 declaration. */
4008 {
4011 }
4021 /* FALLTHROUGH */
4024 /* We fell into a pragma. Skip it, and continue or return. */
4032 }
4034 /* Consume the token. */
4036 }
4037 }
4039 /* This function is called at the end of a statement or declaration.
4040 If the next token is a semicolon, it is consumed; otherwise, error
4041 recovery is attempted. */
4043 static void
4045 {
4046 /* Look for the trailing `;'. */
4048 {
4049 /* If there is additional (erroneous) input, skip to the end of
4050 the statement. */
4052 /* If the next token is now a `;', consume it. */
4055 }
4056 }
4058 /* Skip tokens until we have consumed an entire block, or until we
4059 have consumed a non-nested `;'. */
4061 static void
4063 {
4066 /* Unwind generic function template scope if necessary. */
4071 {
4075 {
4079 /* FALLTHRU */
4081 /* If we've run out of tokens, stop. */
4085 /* Stop if this is an unnested ';'. */
4091 /* Stop if this is an unnested '}', or closes the outermost
4092 nesting level. */
4093 nesting_depth--;
4101 /* Nest. */
4102 nesting_depth++;
4108 /* FALLTHROUGH */
4111 /* Skip it, and continue or return. */
4119 }
4121 /* Consume the token. */
4123 }
4124 }
4126 /* Skip tokens until a non-nested closing curly brace is the next
4127 token, or there are no more tokens. Return true in the first case,
4128 false otherwise. */
4130 static bool
4132 {
4136 {
4140 {
4144 /* FALLTHRU */
4146 /* If we've run out of tokens, stop. */
4150 /* If the next token is a non-nested `}', then we have reached
4151 the end of the current block. */
4157 /* If it the next token is a `{', then we are entering a new
4158 block. Consume the entire block. */
4164 }
4166 /* Consume the token. */
4168 }
4169 }
4171 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
4172 parameter is the PRAGMA token, allowing us to purge the entire pragma
4173 sequence. PRAGMA_TOK can be NULL, if we're speculatively scanning
4174 forwards (not error recovery). */
4176 static void
4178 {
4181 do
4182 {
4183 /* The preprocessor makes sure that a PRAGMA_EOL token appears
4184 before an EOF token, even when the EOF is on the pragma line.
4185 We should never get here without being inside a deferred
4186 pragma. */
4189 }
4193 {
4197 {
4199 /* Put the current source position back where it was before this
4200 lexer was pushed. */
4202 }
4203 }
4204 }
4206 /* Require pragma end of line, resyncing with it as necessary. The
4207 arguments are as for cp_parser_skip_to_pragma_eol. */
4209 static void
4211 {
4217 {
4219 /* Put the current source position back where it was before this
4220 lexer was pushed. */
4222 }
4223 }
4225 /* This is a simple wrapper around make_typename_type. When the id is
4226 an unresolved identifier node, we can provide a superior diagnostic
4227 using cp_parser_diagnose_invalid_type_name. */
4229 static tree
4231 location_t id_location)
4232 {
4233 tree result;
4235 {
4241 }
4243 }
4245 /* This is a wrapper around the
4246 make_{pointer,ptrmem,reference}_declarator functions that decides
4247 which one to call based on the CODE and CLASS_TYPE arguments. The
4248 CODE argument should be one of the values returned by
4249 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
4250 appertain to the pointer or reference. */
4254 cp_cv_quals cv_qualifiers,
4256 tree attributes)
4257 {
4264 else
4274 }
4276 /* Create a new C++ parser. */
4280 {
4281 /* Initialize the binops_by_token so that we can get the tree
4282 directly from the token. */
4290 /* For now, we always accept GNU extensions. */
4293 /* The `>' token is a greater-than operator, not the end of a
4294 template-id. */
4299 /* We are not parsing a constant-expression. */
4304 /* Local variable names are not forbidden. */
4307 /* We are not processing an `extern "C"' declaration. */
4310 /* We are not processing a declarator. */
4313 /* We are not processing a template-argument-list. */
4316 /* We are not in an iteration statement. */
4319 /* We are not in a switch statement. */
4322 /* We are not parsing a type-id inside an expression. */
4325 /* String literals should be translated to the execution character set. */
4328 /* We are not parsing a function body. */
4331 /* We can correct until told otherwise. */
4334 /* The unparsed function queue is empty. */
4337 /* There are no classes being defined. */
4340 /* No template parameters apply. */
4343 /* Special parsing data structures. */
4347 /* Not declaring an implicit function template. */
4353 /* Allow constrained-type-specifiers. */
4356 /* We haven't yet seen an 'extern "C"'. */
4360 }
4362 /* Create a cp_lexer structure which will emit the tokens in CACHE
4363 and push it onto the parser's lexer stack. This is used for delayed
4364 parsing of in-class method bodies and default arguments, and should
4365 not be confused with tentative parsing. */
4366 static void
4368 {
4373 /* Move the current source position to that of the first token in the
4374 new lexer. */
4376 }
4378 /* Pop the top lexer off the parser stack. This is never used for the
4379 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
4380 static void
4382 {
4387 /* Put the current source position back where it was before this
4388 lexer was pushed. */
4390 }
4392 /* Lexical conventions [gram.lex] */
4394 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
4395 identifier. */
4397 static cp_expr
4399 {
4402 /* Look for the identifier. */
4404 /* Return the value. */
4407 else
4409 }
4411 /* Parse a sequence of adjacent string constants. Returns a
4412 TREE_STRING representing the combined, nul-terminated string
4413 constant. If TRANSLATE is true, translate the string to the
4414 execution character set. If WIDE_OK is true, a wide string is
4415 invalid here.
4417 C++98 [lex.string] says that if a narrow string literal token is
4418 adjacent to a wide string literal token, the behavior is undefined.
4419 However, C99 6.4.5p4 says that this results in a wide string literal.
4420 We follow C99 here, for consistency with the C front end.
4422 This code is largely lifted from lex_string() in c-lex.cc.
4424 FUTURE: ObjC++ will need to handle @-strings here. */
4425 static cp_expr
4428 {
4429 tree value;
4437 tree string_tree;
4443 {
4446 }
4451 {
4455 }
4456 else
4457 {
4460 }
4463 /* Try to avoid the overhead of creating and destroying an obstack
4464 for the common case of just one string. */
4467 {
4475 {
4479 }
4480 else
4484 }
4485 else
4486 {
4492 do
4493 {
4495 count++;
4500 {
4503 {
4506 }
4509 {
4514 }
4516 }
4517 else
4521 {
4525 {
4529 "concatenation of string literals with "
4531 }
4532 }
4541 {
4545 }
4546 else
4547 {
4551 }
4552 }
4555 /* A string literal built by concatenation has its caret=start at
4556 the start of the initial string, and its finish at the finish of
4557 the final string literal. */
4561 }
4564 {
4567 }
4571 {
4575 {
4579 }
4582 {
4590 else
4602 }
4607 {
4612 else
4614 }
4615 }
4616 else
4617 /* cpp_interpret_string has issued an error. */
4621 {
4624 }
4627 }
4629 /* Look up a literal operator with the name and the exact arguments. */
4631 static tree
4633 {
4639 {
4643 {
4650 {
4660 }
4664 /* May be this should be sufficient_parms_p instead,
4665 depending on how exactly should user-defined literals
4666 work in presence of default arguments on the literal
4667 operator parameters. */
4670 }
4671 }
4674 }
4676 /* Parse a user-defined char constant. Returns a call to a user-defined
4677 literal operator taking the character as an argument. */
4679 static cp_expr
4681 {
4689 /* Build up a call to the user-defined operator */
4690 /* Lookup the name we got back from the id-expression. */
4691 releasing_vec args;
4695 {
4699 }
4702 }
4704 /* A subroutine of cp_parser_userdef_numeric_literal to
4705 create a char... template parameter pack from a string node. */
4707 static tree
4709 {
4710 tree charvec;
4717 /* Fill in CHARVEC with all of the parameters. */
4720 {
4729 }
4731 /* Build the argument packs. */
4737 }
4739 /* A subroutine of cp_parser_userdef_numeric_literal to
4740 create a char... template parameter pack from a string node. */
4742 static tree
4744 {
4745 tree charvec;
4756 /* First template parm is character type. */
4759 /* Fill in CHARVEC with all of the parameters. */
4766 /* Build the argument packs. */
4772 }
4774 /* Parse a user-defined numeric constant. returns a call to a user-defined
4775 literal operator. */
4777 static cp_expr
4779 {
4789 /* Look for a literal operator taking the exact type of numeric argument
4790 as the literal value. */
4791 releasing_vec args;
4795 {
4797 tf_warning_or_error);
4800 {
4803 long_long_unsigned_type_node);
4804 }
4805 else
4806 {
4810 long_double_type_node);
4814 }
4817 }
4819 /* If the numeric argument didn't work, look for a raw literal
4820 operator taking a const char* argument consisting of the number
4821 in string format. */
4826 {
4828 tf_warning_or_error);
4830 }
4832 /* If the raw literal didn't work, look for a non-type template
4833 function with parameter pack char.... Call the function with
4834 template parameter characters representing the number. */
4838 {
4841 {
4843 num_string);
4845 }
4848 tf_warning_or_error);
4850 }
4852 /* In C++14 the standard library defines complex number suffixes that
4853 conflict with GNU extensions. Prefer them if <complex> is #included. */
4863 {
4867 {
4868 /* No <complex>, so pedwarn and use GNU semantics. */
4871 }
4872 }
4874 bool complained
4881 {
4883 "(from %<<complex>%>) to enable the C++14 user-defined literal "
4888 }
4895 else
4896 {
4897 /* Use the built-in semantics. */
4898 tree type;
4900 {
4903 else
4905 }
4913 }
4916 /* Avoid repeated diagnostics. */
4919 }
4921 /* Parse a user-defined string constant. Returns a call to a user-defined
4922 literal operator taking a character pointer and the length of the string
4923 as arguments. */
4925 static tree
4927 {
4933 tree decl;
4935 /* Build up a call to the user-defined operator. */
4936 /* Lookup the name we got back from the id-expression. */
4937 releasing_vec args;
4944 tf_warning_or_error);
4946 /* Look for a suitable template function, either (C++20) with a single
4947 parameter of class type, or (N3599) with typename parameter CharT and
4948 parameter pack CharT... */
4952 {
4953 /* Use resolve_nondeduced_context to try to choose one form of template
4954 or the other. */
4961 else
4962 {
4967 }
4971 tf_warning_or_error);
4972 }
4977 }
4980 /* Basic concepts [gram.basic] */
4982 /* Parse a translation-unit.
4984 translation-unit:
4985 declaration-seq [opt] */
4987 static void
4989 {
4992 /* Create the declarator obstack. */
4994 /* Create the error declarator. */
4996 /* Create the empty parameter list. */
4998 UNKNOWN_LOCATION);
4999 /* Remember where the base of the declarator obstack lies. */
5011 /* Parse until EOF. */
5013 {
5016 /* If we're entering or exiting a region that's implicitly
5017 extern "C", modify the lang context appropriately. This is
5018 so horrible. Please die. */
5021 {
5025 else
5027 }
5033 {
5034 /* Top-level module declarations are ok, and change the
5035 portion of file we're in. Top-level import declarations
5036 are significant for the import portions. */
5041 {
5044 }
5046 {
5047 mp_state
5050 }
5052 {
5057 }
5058 else
5062 {
5065 {
5068 "global module fragment contents must be"
5070 }
5071 }
5072 }
5074 /* This relies on the ordering of module_parse values. */
5076 /* We're no longer in the import portion of a named module. */
5082 {
5085 /* If the next token is now a `;', consume it. */
5088 }
5089 else
5091 }
5093 /* Get rid of the token array; we don't need it any more. */
5097 /* The EOF should have reset this. */
5100 /* Make sure the declarator obstack was fully cleaned up. */
5103 }
5105 /* Return the appropriate tsubst flags for parsing, possibly in N3276
5106 decltype context. */
5110 {
5115 }
5117 /* We're about to parse a collection of statements. If we're currently
5118 parsing tentatively, set up a firewall so that any nested
5119 cp_parser_commit_to_tentative_parse won't affect the current context. */
5121 static cp_token_position
5123 {
5130 }
5132 /* We've finished parsing the collection of statements. Wrap up the
5133 firewall and replace the relevant tokens with the parsed form. */
5135 static void
5137 tree expr)
5138 {
5142 /* Finish the firewall level. */
5144 /* And remember the result of the parse for when we try again. */
5150 }
5152 /* Like the above functions, but let the user modify the tokens. Used by
5153 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
5154 later parses, so it makes sense to localize the effects of
5155 cp_parser_commit_to_tentative_parse. */
5157 struct tentative_firewall
5158 {
5163 {
5164 /* If we're currently parsing tentatively, start a committed level as a
5165 firewall and then an inner tentative parse. */
5167 {
5171 }
5172 }
5175 {
5177 {
5178 /* Finish the inner tentative parse and the firewall, propagating any
5179 uncommitted error state to the outer tentative parse. */
5185 }
5186 }
5187 };
5189 /* Some tokens naturally come in pairs e.g.'(' and ')'.
5190 This class is for tracking such a matching pair of symbols.
5191 In particular, it tracks the location of the first token,
5192 so that if the second token is missing, we can highlight the
5193 location of the first token when notifying the user about the
5194 problem. */
5197 class token_pair
5198 {
5200 /* token_pair's ctor. */
5203 /* If the next token is the opening symbol for this pair, consume it and
5204 return true.
5205 Otherwise, issue an error and return false.
5206 In either case, record the location of the opening token. */
5209 {
5213 }
5215 /* Consume the next token from PARSER, recording its location as
5216 that of the opening token within the pair. */
5219 {
5224 }
5226 /* If the next token is the closing symbol for this pair, consume it
5227 and return it.
5228 Otherwise, issue an error, highlighting the location of the
5229 corresponding opening token, and return NULL. */
5232 {
5235 m_open_loc);
5236 }
5241 location_t m_open_loc;
5242 };
5244 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
5246 struct matching_paren_traits
5247 {
5252 };
5254 /* "matching_parens" is a token_pair<T> class for tracking matching
5255 pairs of parentheses. */
5259 /* Traits for token_pair<T> for tracking matching pairs of braces. */
5261 struct matching_brace_traits
5262 {
5267 };
5269 /* "matching_braces" is a token_pair<T> class for tracking matching
5270 pairs of braces. */
5275 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
5276 enclosing parentheses. */
5278 static cp_expr
5280 {
5283 /* Consume the '('. */
5285 matching_parens parens;
5287 /* Start the statement-expression. */
5289 /* Parse the compound-statement. */
5291 /* Finish up. */
5293 /* Consume the ')'. */
5301 }
5303 /* Expressions [gram.expr] */
5305 /* Parse a fold-operator.
5307 fold-operator:
5308 - * / % ^ & | = < > << >>
5309 = -= *= /= %= ^= &= |= <<= >>=
5310 == != <= >= && || , .* ->*
5312 This returns the tree code corresponding to the matched operator
5313 as an int. When the current token matches a compound assignment
5314 operator, the resulting tree code is the negative value of the
5315 non-assignment operator. */
5317 static int
5319 {
5321 {
5361 }
5362 }
5364 /* Returns true if CODE indicates a binary expression, which is not allowed in
5365 the LHS of a fold-expression. More codes will need to be added to use this
5366 function in other contexts. */
5368 static bool
5370 {
5372 {
5405 }
5406 }
5408 /* If the next token is a suitable fold operator, consume it and return as
5409 the function above. */
5411 static int
5413 {
5419 }
5421 /* Parse a fold-expression.
5423 fold-expression:
5424 ( ... folding-operator cast-expression)
5425 ( cast-expression folding-operator ... )
5426 ( cast-expression folding operator ... folding-operator cast-expression)
5428 Note that the '(' and ')' are matched in primary expression. */
5430 static cp_expr
5432 {
5433 cp_id_kind pidk;
5435 // Left fold.
5437 {
5443 {
5446 }
5453 }
5458 {
5461 }
5464 {
5467 }
5470 /* The operands of a fold-expression are cast-expressions, so binary or
5471 conditional expressions are not allowed. We check this here to avoid
5472 tentative parsing. */
5484 // Right fold.
5489 {
5492 }
5495 // Binary left or right fold.
5500 }
5502 /* Parse a primary-expression.
5504 primary-expression:
5505 literal
5506 this
5507 ( expression )
5508 id-expression
5509 lambda-expression (C++11)
5511 GNU Extensions:
5513 primary-expression:
5514 ( compound-statement )
5515 __builtin_va_arg ( assignment-expression , type-id )
5516 __builtin_offsetof ( type-id , offsetof-expression )
5518 C++ Extensions:
5519 __has_nothrow_assign ( type-id )
5520 __has_nothrow_constructor ( type-id )
5521 __has_nothrow_copy ( type-id )
5522 __has_trivial_assign ( type-id )
5523 __has_trivial_constructor ( type-id )
5524 __has_trivial_copy ( type-id )
5525 __has_trivial_destructor ( type-id )
5526 __has_virtual_destructor ( type-id )
5527 __is_abstract ( type-id )
5528 __is_base_of ( type-id , type-id )
5529 __is_class ( type-id )
5530 __is_empty ( type-id )
5531 __is_enum ( type-id )
5532 __is_final ( type-id )
5533 __is_literal_type ( type-id )
5534 __is_pod ( type-id )
5535 __is_polymorphic ( type-id )
5536 __is_std_layout ( type-id )
5537 __is_trivial ( type-id )
5538 __is_union ( type-id )
5540 Objective-C++ Extension:
5542 primary-expression:
5543 objc-expression
5545 literal:
5546 __null
5548 ADDRESS_P is true iff this expression was immediately preceded by
5549 "&" and therefore might denote a pointer-to-member. CAST_P is true
5550 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5551 true iff this expression is a template argument.
5553 Returns a representation of the expression. Upon return, *IDK
5554 indicates what kind of id-expression (if any) was present. */
5556 static cp_expr
5563 {
5566 /* Assume the primary expression is not an id-expression. */
5569 /* Peek at the next token. */
5572 {
5573 /* literal:
5574 integer-literal
5575 character-literal
5576 floating-literal
5577 string-literal
5578 boolean-literal
5579 pointer-literal
5580 user-defined-literal */
5592 {
5596 }
5597 /* Floating-point literals are only allowed in an integral
5598 constant expression if they are cast to an integral or
5599 enumeration type. */
5605 {
5606 /* CAST_P will be set even in invalid code like "int(2.7 +
5607 ...)". Therefore, we have to check that the next token
5608 is sure to end the cast. */
5610 {
5615 enumerator-definition. */
5617 /* The curly brace at the end of an enum-specifier. */
5619 /* The end of a statement. */
5621 /* The end of the cast-expression. */
5623 /* The end of an array bound. */
5625 /* The closing ">" in a template-argument-list. */
5628 /* C++0x only: A ">>" treated like two ">" tokens,
5629 in a template-argument-list. */
5634 }
5636 /* If we are within a cast, then the constraint that the
5637 cast is to an integral or enumeration type will be
5638 checked at that point. If we are not within a cast, then
5639 this code is invalid. */
5642 }
5663 /* ??? Should wide strings be allowed when parser->translate_strings_p
5664 is false (i.e. in attributes)? If not, we can kill the third
5665 argument to cp_parser_string_literal. */
5672 /* If we see `( { ' then we are looking at the beginning of
5673 a GNU statement-expression. */
5676 {
5677 /* Statement-expressions are not allowed by the standard. */
5681 /* And they're not allowed outside of a function-body; you
5682 cannot, for example, write:
5684 int i = ({ int j = 3; j + 1; });
5686 at class or namespace scope. */
5689 {
5691 "statement-expressions are not allowed outside "
5697 }
5698 else
5700 }
5701 /* Otherwise it's a normal parenthesized expression. */
5702 {
5703 cp_expr expr;
5708 /* Consume the `('. */
5709 matching_parens parens;
5711 /* Within a parenthesized expression, a `>' token is always
5712 the greater-than operator. */
5713 saved_greater_than_is_operator_p
5718 /* Left fold expression. */
5720 else
5721 /* Parse the parenthesized expression. */
5726 {
5731 "fold-expressions only available with %<-std=c++17%> "
5733 }
5734 else
5735 /* Let the front end know that this expression was
5736 enclosed in parentheses. This matters in case, for
5737 example, the expression is of the form `A::B', since
5738 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5739 not. */
5742 /* DR 705: Wrapping an unqualified name in parentheses
5743 suppresses arg-dependent lookup. We want to pass back
5744 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5745 (c++/37862), but none of the others. */
5749 /* The `>' token might be the end of a template-id or
5750 template-parameter-list now. */
5751 parser->greater_than_is_operator_p
5754 /* Consume the `)'. */
5766 }
5769 {
5771 {
5772 /* We might have an Objective-C++ message. */
5775 /* If that works out, we're done ... */
5778 /* ... else, fall though to see if it's a lambda. */
5779 }
5781 /* Don't warn about a failed tentative parse. */
5786 }
5790 /* We have an Objective-C++ string literal. */
5797 {
5798 /* These two are the boolean literals. */
5806 /* The `__null' literal. */
5811 /* The `nullptr' literal. */
5816 /* Recognize the `this' keyword. */
5820 {
5824 }
5825 /* Pointers cannot appear in constant-expressions. */
5830 /* The `operator' keyword can be the beginning of an
5831 id-expression. */
5838 {
5839 non_integral_constant name;
5841 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5842 __func__ are the names of variables -- but they are
5843 treated specially. Therefore, they are handled here,
5844 rather than relying on the generic id-expression logic
5845 below. Grammatically, these names are id-expressions.
5847 Consume the token. */
5851 {
5863 }
5868 /* Look up the name. */
5870 }
5873 {
5874 tree expression;
5875 tree type;
5876 location_t type_location;
5877 location_t start_loc
5879 /* The `__builtin_va_arg' construct is used to handle
5880 `va_arg'. Consume the `__builtin_va_arg' token. */
5882 /* Look for the opening `('. */
5883 matching_parens parens;
5885 /* Now, parse the assignment-expression. */
5887 /* Look for the `,'. */
5890 /* Parse the type-id. */
5891 {
5894 }
5895 /* Look for the closing `)'. */
5896 location_t finish_loc
5899 /* Using `va_arg' in a constant-expression is not
5900 allowed. */
5902 NIC_VA_ARG))
5904 /* Construct a location of the form:
5905 __builtin_va_arg (v, int)
5906 ~~~~~~~~~~~~~~~~~~~~~^~~~
5907 with the caret at the type, ranging from the start of the
5908 "__builtin_va_arg" token to the close paren. */
5909 location_t combined_loc
5912 }
5917 #define DEFTRAIT_EXPR(CODE, NAME, ARITY) \
5918 case RID_##CODE:
5920 #undef DEFTRAIT_EXPR
5923 // C++ concepts
5927 /* Objective-C++ expressions. */
5937 "%<omp_all_memory%> may only be used in OpenMP "
5945 {
5950 }
5951 /* FALLTHRU */
5955 }
5957 /* An id-expression can start with either an identifier, a
5958 `::' as the beginning of a qualified-id, or the "operator"
5959 keyword. */
5964 {
5965 id_expression:
5966 cp_expr id_expression;
5967 cp_expr decl;
5973 /* Parse the id-expression. */
5974 id_expression
5991 /* If we have a template-id, then no further lookup is
5992 required. If the template-id was for a template-class, we
5993 will sometimes have a TYPE_DECL at this point. */
5997 /* Look up the name. */
5998 else
5999 {
6000 tree ambiguous_decls;
6002 /* If we already know that this lookup is ambiguous, then
6003 we've already issued an error message; there's no reason
6004 to check again. */
6007 {
6010 }
6013 none_type,
6014 template_p,
6019 /* If the lookup was ambiguous, an error will already have
6020 been issued. */
6024 /* In Objective-C++, we may have an Objective-C 2.0
6025 dot-syntax for classes here. */
6030 {
6031 tree component;
6038 component);
6039 /* Build a location of the form:
6040 expr.component
6041 ~~~~~^~~~~~~~~
6042 with caret at the start of the component name (at
6043 input_location), ranging from the start of the id_expression
6044 to the end of the component name. */
6045 location_t combined_loc
6050 }
6052 /* In Objective-C++, an instance variable (ivar) may be preferred
6053 to whatever cp_parser_lookup_name() found.
6054 Call objc_lookup_ivar. To avoid exposing cp_expr to the
6055 rest of c-family, we have to do a little extra work to preserve
6056 any location information in cp_expr "decl". Given that
6057 objc_lookup_ivar is implemented in "c-family" and "objc", we
6058 have a trip through the pure "tree" type, rather than cp_expr.
6059 Naively copying it back to "decl" would implicitly give the
6060 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
6061 store an EXPR_LOCATION. Hence we only update "decl" (and
6062 hence its location_t) if we get back a different tree node. */
6064 id_expression);
6068 /* If name lookup gives us a SCOPE_REF, then the
6069 qualifying scope was dependent. */
6071 {
6072 /* At this point, we do not know if DECL is a valid
6073 integral constant expression. We assume that it is
6074 in fact such an expression, so that code like:
6076 template <int N> struct A {
6077 int a[B<N>::i];
6078 };
6080 is accepted. At template-instantiation time, we
6081 will check that B<N>::i is actually a constant. */
6083 }
6084 /* Check to see if DECL is a local variable in a context
6085 where that is forbidden. */
6088 /* DR 2082 permits local variables in unevaluated contexts
6089 within a default argument. */
6091 {
6099 }
6100 }
6102 decl = (finish_id_expression
6104 idk,
6109 template_arg_p,
6114 /* Build a location for an id-expression of the form:
6115 ::ns::id
6116 ~~~~~~^~
6117 or:
6118 id
6119 ^~
6120 i.e. from the start of the first token to the end of the final
6121 token, with the caret at the start of the unqualified-id. */
6125 location_t combined_loc
6130 }
6132 /* Anything else is an error. */
6136 }
6137 }
6145 {
6148 }
6150 /* Complain about missing template keyword when naming a dependent
6151 member template. */
6153 static void
6155 {
6162 "expected %qs keyword before dependent "
6165 }
6167 /* Parse an id-expression.
6169 id-expression:
6170 unqualified-id
6171 qualified-id
6173 qualified-id:
6174 :: [opt] nested-name-specifier template [opt] unqualified-id
6175 :: identifier
6176 :: operator-function-id
6177 :: template-id
6179 Return a representation of the unqualified portion of the
6180 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
6181 a `::' or nested-name-specifier.
6183 Often, if the id-expression was a qualified-id, the caller will
6184 want to make a SCOPE_REF to represent the qualified-id. This
6185 function does not do this in order to avoid wastefully creating
6186 SCOPE_REFs when they are not required.
6188 If TEMPLATE_KEYWORD_P is true, then we have just seen the
6189 `template' keyword.
6191 If CHECK_DEPENDENCY_P is false, then names are looked up inside
6192 uninstantiated templates.
6194 If *TEMPLATE_P is non-NULL, it is set to true iff the
6195 `template' keyword is used to explicitly indicate that the entity
6196 named is a template.
6198 If DECLARATOR_P is true, the id-expression is appearing as part of
6199 a declarator, rather than as part of an expression. */
6201 static cp_expr
6208 {
6212 /* Assume the `template' keyword was not used. */
6216 /* Look for the optional `::' operator. */
6217 global_scope_p
6218 = (!template_keyword_p
6223 /* Look for the optional nested-name-specifier. */
6224 nested_name_specifier_p
6227 check_dependency_p,
6229 declarator_p,
6230 template_keyword_p)
6236 /* Peek at the next token. */
6239 /* If there is a nested-name-specifier, then we are looking at
6240 the first qualified-id production. */
6242 {
6243 tree saved_object_scope;
6244 tree saved_qualifying_scope;
6246 /* See if the next token is the `template' keyword. */
6250 /* Name lookup we do during the processing of the
6251 unqualified-id might obliterate SCOPE. */
6254 /* Process the final unqualified-id. */
6256 check_dependency_p,
6257 declarator_p,
6259 /* Restore the SAVED_SCOPE for our caller. */
6263 }
6264 /* Otherwise, if we are in global scope, then we are looking at one
6265 of the other qualified-id productions. */
6267 {
6268 /* If it's an identifier, and the next token is not a "<", then
6269 we can avoid the template-id case. This is an optimization
6270 for this common case. */
6272 && !cp_parser_nth_token_starts_template_argument_list_p
6277 /* Try a template-id. */
6281 declarator_p);
6282 /* If that worked, we're done. */
6286 /* Peek at the next token. (Changes in the token buffer may
6287 have invalidated the pointer obtained above.) */
6291 {
6298 {
6301 }
6302 /* Fall through. */
6307 }
6308 }
6309 else
6310 {
6315 declarator_p,
6316 optional_p);
6317 }
6320 && warn_missing_template_keyword
6321 && !template_keyword_p
6322 /* Don't warn if we're looking inside templates. */
6323 && check_dependency_p
6324 /* In a template argument list a > could be closing
6325 the enclosing targs. */
6328 /* Don't confuse an ill-formed constructor declarator for a missing
6329 template keyword in a return type. */
6333 OPT_Wmissing_template_keyword))
6334 {
6337 /* An operator after the > suggests that the > ends a
6338 template-id; a name or literal suggests that the > is an
6339 operator. */
6343 }
6346 }
6348 /* Parse an unqualified-id.
6350 unqualified-id:
6351 identifier
6352 operator-function-id
6353 conversion-function-id
6354 ~ class-name
6355 template-id
6357 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
6358 keyword, in a construct like `A::template ...'.
6360 Returns a representation of unqualified-id. For the `identifier'
6361 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
6362 production a BIT_NOT_EXPR is returned; the operand of the
6363 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
6364 other productions, see the documentation accompanying the
6365 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
6366 names are looked up in uninstantiated templates. If DECLARATOR_P
6367 is true, the unqualified-id is appearing as part of a declarator,
6368 rather than as part of an expression. */
6370 static cp_expr
6376 {
6379 /* Peek at the next token. */
6383 {
6385 {
6386 tree id;
6388 /* We don't know yet whether or not this will be a
6389 template-id. */
6391 /* Try a template-id. */
6393 check_dependency_p,
6394 declarator_p);
6395 /* If it worked, we're done. */
6398 /* Otherwise, it's an ordinary identifier. */
6400 }
6404 check_dependency_p,
6405 declarator_p);
6408 {
6409 tree type_decl;
6410 tree qualifying_scope;
6411 tree object_scope;
6412 tree scope;
6416 /* Consume the `~' token. */
6418 /* Parse the class-name. The standard, as written, seems to
6419 say that:
6421 template <typename T> struct S { ~S (); };
6422 template <typename T> S<T>::~S() {}
6424 is invalid, since `~' must be followed by a class-name, but
6425 `S<T>' is dependent, and so not known to be a class.
6426 That's not right; we need to look in uninstantiated
6427 templates. A further complication arises from:
6429 template <typename T> void f(T t) {
6430 t.T::~T();
6431 }
6433 Here, it is not possible to look up `T' in the scope of `T'
6434 itself. We must look in both the current scope, and the
6435 scope of the containing complete expression.
6437 Yet another issue is:
6439 struct S {
6440 int S;
6441 ~S();
6442 };
6444 S::~S() {}
6446 The standard does not seem to say that the `S' in `~S'
6447 should refer to the type `S' and not the data member
6448 `S::S'. */
6450 /* DR 244 says that we look up the name after the "~" in the
6451 same scope as we looked up the qualifying name. That idea
6452 isn't fully worked out; it's more complicated than that. */
6457 /* Check for invalid scopes. */
6459 {
6463 }
6465 {
6469 scope);
6474 }
6476 {
6482 }
6488 /* Create a location with caret == start at the tilde,
6489 finishing at the end of the peeked token, e.g:
6490 ~token
6491 ^~~~~~. */
6492 location_t loc
6495 /* If the name is of the form "X::~X" it's OK even if X is a
6496 typedef. */
6505 {
6508 }
6510 /* ~auto means the destructor of whatever the object is. */
6512 {
6515 "%<~auto%> only available with "
6519 }
6521 /* DR 2237 (C++20 only): A simple-template-id is no longer valid as the
6522 declarator-id of a constructor or destructor. */
6525 {
6529 }
6531 /* If there was an explicit qualification (S::~T), first look
6532 in the scope given by the qualification (i.e., S).
6534 Note: in the calls to cp_parser_class_name below we pass
6535 typename_type so that lookup finds the injected-class-name
6536 rather than the constructor. */
6540 {
6545 typename_type,
6548 declarator_p);
6551 }
6552 /* In "N::S::~S", look in "N" as well. */
6554 {
6559 type_decl
6563 typename_type,
6566 declarator_p);
6569 }
6570 /* In "p->S::~T", look in the scope given by "*p" as well. */
6572 {
6577 type_decl
6581 typename_type,
6584 declarator_p);
6587 }
6588 /* Look in the surrounding context. */
6590 {
6596 type_decl
6600 typename_type,
6603 declarator_p);
6606 {
6607 /* We couldn't find a type with this name. If we're parsing
6608 tentatively, fail and try something else. */
6610 {
6613 }
6614 /* Otherwise, accept it and check for a match at instantiation
6615 time. */
6620 }
6621 }
6622 /* If an error occurred, assume that the name of the
6623 destructor is the same as the name of the qualifying
6624 class. That allows us to keep parsing after running
6625 into ill-formed destructor names. */
6631 /* Check that destructor name and scope match. */
6633 {
6640 }
6642 /* [class.dtor]
6644 A typedef-name that names a class shall not be used as the
6645 identifier in the declarator for a destructor declaration. */
6652 type_decl);
6655 }
6659 {
6660 cp_expr id;
6662 /* This could be a template-id, so we try that first. */
6664 /* Try a template-id. */
6667 declarator_p);
6668 /* If that worked, we're done. */
6671 /* We still don't know whether we're looking at an
6672 operator-function-id or a conversion-function-id. */
6674 /* Try an operator-function-id. */
6676 /* If that didn't work, try a conversion-function-id. */
6681 }
6682 /* Fall through. */
6689 }
6690 }
6692 /* Check [temp.names]/5: A name prefixed by the keyword template shall
6693 be a template-id or the name shall refer to a class template or an
6694 alias template. */
6696 static void
6698 {
6708 /* Alias templates are also OK. */
6715 name);
6716 }
6718 /* Parse an (optional) nested-name-specifier.
6720 nested-name-specifier: [C++98]
6721 class-or-namespace-name :: nested-name-specifier [opt]
6722 class-or-namespace-name :: template nested-name-specifier [opt]
6724 nested-name-specifier: [C++0x]
6725 type-name ::
6726 namespace-name ::
6727 nested-name-specifier identifier ::
6728 nested-name-specifier template [opt] simple-template-id ::
6730 PARSER->SCOPE should be set appropriately before this function is
6731 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6732 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6733 in name lookups.
6735 Sets PARSER->SCOPE to the class (TYPE) or namespace
6736 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6737 it unchanged if there is no nested-name-specifier. Returns the new
6738 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6740 If CHECK_DEPENDENCY_P is FALSE, names are looked up in dependent scopes.
6742 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6743 part of a declaration and/or decl-specifier. */
6745 static tree
6752 {
6757 /* Remember where the nested-name-specifier starts. */
6760 {
6763 }
6766 {
6767 tree new_scope;
6768 tree old_scope;
6769 tree saved_qualifying_scope;
6771 /* Spot cases that cannot be the beginning of a
6772 nested-name-specifier. */
6775 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6776 the already parsed nested-name-specifier. */
6778 {
6779 /* Grab the nested-name-specifier and continue the loop. */
6781 /* If we originally encountered this nested-name-specifier
6782 with CHECK_DEPENDENCY_P set to true, we will not have
6783 resolved TYPENAME_TYPEs, so we must do so here. */
6785 && !check_dependency_p
6787 {
6792 }
6795 }
6797 /* Spot cases that cannot be the beginning of a
6798 nested-name-specifier. On the second and subsequent times
6799 through the loop, we look for the `template' keyword. */
6801 ;
6802 /* A template-id can start a nested-name-specifier. */
6804 ;
6805 /* DR 743: decltype can be used in a nested-name-specifier. */
6807 ;
6808 else
6809 {
6810 /* If the next token is not an identifier, then it is
6811 definitely not a type-name or namespace-name. */
6814 /* If the following token is neither a `<' (to begin a
6815 template-id), nor a `::', then we are not looking at a
6816 nested-name-specifier. */
6822 /* name:name is a valid sequence in an Objective C message. */
6824 {
6828 "found %<:%> in nested-name-specifier, "
6831 }
6834 && !cp_parser_nth_token_starts_template_argument_list_p
6837 }
6839 /* The nested-name-specifier is optional, so we parse
6840 tentatively. */
6843 /* Look for the optional `template' keyword, if this isn't the
6844 first time through the loop. */
6846 {
6848 /* DR1710: "In a qualified-id used as the name in
6849 a typename-specifier, elaborated-type-specifier, using-declaration,
6850 or class-or-decltype, an optional keyword template appearing at
6851 the top level is ignored." */
6853 && typename_keyword_p
6856 }
6858 /* Save the old scope since the name lookup we are about to do
6859 might destroy it. */
6862 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6863 look up names in "X<T>::I" in order to determine that "Y" is
6864 a template. So, if we have a typename at this point, we make
6865 an effort to look through it. */
6867 && !check_dependency_p
6868 && !typename_keyword_p
6873 /* Parse the qualifying entity. */
6874 new_scope
6876 typename_keyword_p,
6877 template_keyword_p,
6878 check_dependency_p,
6879 type_p,
6880 is_declaration);
6881 /* Look for the `::' token. */
6884 /* If we found what we wanted, we keep going; otherwise, we're
6885 done. */
6887 {
6890 /* Restore the OLD_SCOPE since it was valid before the
6891 failed attempt at finding the last
6892 class-or-namespace-name. */
6896 /* If the next token is a decltype, and the one after that is a
6897 `::', then the decltype has failed to resolve to a class or
6898 enumeration type. Give this error even when parsing
6899 tentatively since it can't possibly be valid--and we're going
6900 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6901 won't get another chance.*/
6905 {
6911 dtype);
6914 /* As below. */
6917 }
6921 {
6922 /* If we have a non-type template-id followed by ::, it can't
6923 possibly be valid. */
6928 {
6931 {
6938 else
6941 }
6942 else
6943 {
6949 else
6950 {
6951 /* Variable template. */
6955 }
6956 }
6963 /* As below. */
6967 }
6968 }
6972 /* If the next token is an identifier, and the one after
6973 that is a `::', then any valid interpretation would have
6974 found a class-or-namespace-name. */
6980 {
6983 {
6985 {
6986 tree decl;
6987 tree ambiguous_decls;
6990 none_type,
6999 decl);
7001 {
7002 // cp_parser_lookup_name has the same diagnostic,
7003 // thus make sure to emit it at most once.
7006 {
7011 }
7013 }
7014 else
7015 {
7017 cp_parser_name_lookup_error
7020 else
7021 cp_parser_name_lookup_error
7024 }
7025 }
7028 /* Treat this as a successful nested-name-specifier
7029 due to:
7031 [basic.lookup.qual]
7033 If the name found is not a class-name (clause
7034 _class_) or namespace-name (_namespace.def_), the
7035 program is ill-formed. */
7037 }
7039 }
7041 }
7042 /* We've found one valid nested-name-specifier. */
7044 /* Name lookup always gives us a DECL. */
7047 /* Uses of "template" must be followed by actual templates. */
7050 /* If it is a class scope, try to complete it; we are about to
7051 be looking up names inside the class. */
7053 /* Since checking types for dependency can be expensive,
7054 avoid doing it if the type is already complete. */
7056 /* Do not try to complete dependent types. */
7058 {
7060 /* If it is a typedef to current class, use the current
7061 class instead, as the typedef won't have any names inside
7062 it yet. */
7066 }
7067 /* Make sure we look in the right scope the next time through
7068 the loop. */
7070 }
7072 /* If parsing tentatively, replace the sequence of tokens that makes
7073 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
7074 token. That way, should we re-parse the token stream, we will
7075 not have to repeat the effort required to do the parse, nor will
7076 we issue duplicate error messages. */
7078 {
7082 /* Reset the contents of the START token. */
7084 /* Retrieve any deferred checks. Do not pop this access checks yet
7085 so the memory will not be reclaimed during token replacing below. */
7094 /* Purge all subsequent tokens. */
7096 }
7102 }
7104 /* Parse a nested-name-specifier. See
7105 cp_parser_nested_name_specifier_opt for details. This function
7106 behaves identically, except that it will an issue an error if no
7107 nested-name-specifier is present. */
7109 static tree
7115 {
7116 tree scope;
7118 /* Look for the nested-name-specifier. */
7120 typename_keyword_p,
7121 check_dependency_p,
7122 type_p,
7123 is_declaration);
7124 /* If it was not present, issue an error message. */
7126 {
7129 }
7132 }
7134 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
7135 this is either a class-name or a namespace-name (which corresponds
7136 to the class-or-namespace-name production in the grammar). For
7137 C++0x, it can also be a type-name that refers to an enumeration
7138 type or a simple-template-id.
7140 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
7141 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
7142 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
7143 TYPE_P is TRUE iff the next name should be taken as a class-name,
7144 even the same name is declared to be another entity in the same
7145 scope.
7147 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
7148 specified by the class-or-namespace-name. If neither is found the
7149 ERROR_MARK_NODE is returned. */
7151 static tree
7158 {
7159 tree saved_scope;
7160 tree saved_qualifying_scope;
7161 tree saved_object_scope;
7162 tree scope;
7166 /* DR 743: decltype can appear in a nested-name-specifier. */
7168 {
7172 {
7175 }
7179 }
7181 /* Before we try to parse the class-name, we must save away the
7182 current PARSER->SCOPE since cp_parser_class_name will destroy
7183 it. */
7187 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
7188 there is no need to look for a namespace-name. */
7189 only_class_p = template_keyword_p
7194 typename_keyword_p,
7195 template_keyword_p,
7197 check_dependency_p,
7199 is_declaration,
7202 /* If that didn't work, try for a namespace-name. */
7204 {
7205 /* Restore the saved scope. */
7209 /* If we are not looking at an identifier followed by the scope
7210 resolution operator, then this is not part of a
7211 nested-name-specifier. (Note that this function is only used
7212 to parse the components of a nested-name-specifier.) */
7217 }
7220 }
7222 /* Return true if we are looking at a compound-literal, false otherwise. */
7224 static bool
7226 {
7229 /* Skip tokens until the next token is a closing parenthesis.
7230 If we find the closing `)', and the next token is a `{', then
7231 we are looking at a compound-literal. */
7232 bool compound_literal_p
7237 /* Roll back the tokens we skipped. */
7241 }
7243 /* Return true if EXPR is the integer constant zero or a complex constant
7244 of zero, without any folding, but ignoring location wrappers. */
7246 bool
7248 {
7251 }
7253 /* Parse a postfix-expression.
7255 postfix-expression:
7256 primary-expression
7257 postfix-expression [ expression ]
7258 postfix-expression ( expression-list [opt] )
7259 simple-type-specifier ( expression-list [opt] )
7260 typename :: [opt] nested-name-specifier identifier
7261 ( expression-list [opt] )
7262 typename :: [opt] nested-name-specifier template [opt] template-id
7263 ( expression-list [opt] )
7264 postfix-expression . template [opt] id-expression
7265 postfix-expression -> template [opt] id-expression
7266 postfix-expression . pseudo-destructor-name
7267 postfix-expression -> pseudo-destructor-name
7268 postfix-expression ++
7269 postfix-expression --
7270 dynamic_cast < type-id > ( expression )
7271 static_cast < type-id > ( expression )
7272 reinterpret_cast < type-id > ( expression )
7273 const_cast < type-id > ( expression )
7274 typeid ( expression )
7275 typeid ( type-id )
7277 GNU Extension:
7279 postfix-expression:
7280 ( type-id ) { initializer-list , [opt] }
7282 This extension is a GNU version of the C99 compound-literal
7283 construct. (The C99 grammar uses `type-name' instead of `type-id',
7284 but they are essentially the same concept.)
7286 If ADDRESS_P is true, the postfix expression is the operand of the
7287 `&' operator. CAST_P is true if this expression is the target of a
7288 cast.
7290 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
7291 class member access expressions [expr.ref].
7293 Returns a representation of the expression. */
7295 static cp_expr
7299 {
7301 location_t loc;
7307 /* Peek at the next token. */
7312 /* Some of the productions are determined by keywords. */
7315 {
7320 {
7321 tree type;
7322 cp_expr expression;
7326 /* All of these can be handled in the same way from the point
7327 of view of parsing. Begin by consuming the token
7328 identifying the cast. */
7331 /* New types cannot be defined in the cast. */
7333 parser->type_definition_forbidden_message
7336 /* Look for the opening `<'. */
7338 /* Parse the type to which we are casting. */
7342 NULL);
7344 /* Look for the closing `>'. */
7346 /* Restore the old message. */
7349 bool saved_greater_than_is_operator_p
7353 /* And the expression which is being cast. */
7354 matching_parens parens;
7358 RT_CLOSE_PAREN);
7362 parser->greater_than_is_operator_p
7365 /* Only type conversions to integral or enumeration types
7366 can be used in constant-expressions. */
7369 {
7372 }
7374 /* Construct a location e.g. :
7375 reinterpret_cast <int *> (expr)
7376 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
7377 ranging from the start of the "*_cast" token to the final closing
7378 paren, with the caret at the start. */
7382 {
7384 postfix_expression
7386 tf_warning_or_error);
7389 postfix_expression
7391 tf_warning_or_error);
7394 postfix_expression
7396 tf_warning_or_error);
7399 postfix_expression
7401 tf_warning_or_error);
7405 }
7406 }
7410 {
7411 tree type;
7415 /* Consume the `typeid' token. */
7417 /* Look for the `(' token. */
7418 matching_parens parens;
7420 /* Types cannot be defined in a `typeid' expression. */
7422 parser->type_definition_forbidden_message
7424 /* We can't be sure yet whether we're looking at a type-id or an
7425 expression. */
7427 /* Try a type-id first. */
7432 /* Look for the `)' token. Otherwise, we can't be sure that
7433 we're not looking at an expression: consider `typeid (int
7434 (3))', for example. */
7436 /* If all went well, simply lookup the type-id. */
7439 /* Otherwise, fall back to the expression variant. */
7440 else
7441 {
7442 tree expression;
7444 /* Look for an expression. */
7446 /* Compute its typeid. */
7448 /* Look for the `)' token. */
7450 }
7451 /* Restore the saved message. */
7453 /* `typeid' may not appear in an integral constant expression. */
7457 /* Construct a location e.g. :
7458 typeid (expr)
7459 ^~~~~~~~~~~~~
7460 ranging from the start of the "typeid" token to the final closing
7461 paren, with the caret at the start. */
7463 {
7464 location_t typeid_loc
7468 }
7469 }
7473 {
7474 tree type;
7475 /* The syntax permitted here is the same permitted for an
7476 elaborated-type-specifier. */
7483 }
7491 {
7499 {
7502 }
7508 {
7511 postfix_expression
7513 else
7514 {
7518 }
7524 tf_warning_or_error);
7525 else
7526 {
7530 }
7538 else
7539 {
7543 }
7548 postfix_expression
7552 postfix_expression
7555 else
7556 {
7560 }
7565 {
7569 }
7570 else
7571 {
7572 postfix_expression
7574 }
7579 }
7581 }
7584 {
7585 tree expression;
7586 tree type;
7587 /* Consume the `__builtin_convertvector' token. */
7589 /* Look for the opening `('. */
7590 matching_parens parens;
7592 /* Now, parse the assignment-expression. */
7594 /* Look for the `,'. */
7596 location_t type_location
7598 /* Parse the type-id. */
7599 {
7602 }
7603 /* Look for the closing `)'. */
7605 postfix_expression
7607 tf_warning_or_error);
7609 }
7612 {
7613 tree expression;
7614 tree type;
7615 /* Consume the `__builtin_bit_cast' token. */
7617 /* Look for the opening `('. */
7618 matching_parens parens;
7620 location_t type_location
7622 /* Parse the type-id. */
7623 {
7626 }
7627 /* Look for the `,'. */
7629 /* Now, parse the assignment-expression. */
7631 /* Look for the closing `)'. */
7633 postfix_expression
7635 tf_warning_or_error);
7637 }
7640 {
7641 tree type;
7643 /* If the next thing is a simple-type-specifier, we may be
7644 looking at a functional cast. We could also be looking at
7645 an id-expression. So, we try the functional cast, and if
7646 that doesn't work we fall back to the primary-expression. */
7648 /* Look for the simple-type-specifier. */
7652 CP_PARSER_FLAGS_NONE);
7654 /* Parse the cast itself. */
7656 postfix_expression
7658 /* If that worked, we're done. */
7662 /* If the functional-cast didn't work out, try a
7663 compound-literal. */
7666 {
7671 matching_parens parens;
7674 /* Avoid calling cp_parser_type_id pointlessly, see comment
7675 in cp_parser_cast_expression about c++/29234. */
7678 else
7679 {
7680 /* Parse the type. */
7686 }
7688 /* If things aren't going well, there's no need to
7689 keep going. */
7691 {
7693 /* Parse the brace-enclosed initializer list. */
7696 }
7697 /* If that worked, we're definitely looking at a
7698 compound-literal expression. */
7700 {
7701 /* Warn the user that a compound literal is not
7702 allowed in standard C++. */
7705 /* For simplicity, we disallow compound literals in
7706 constant-expressions. We could
7707 allow compound literals of integer type, whose
7708 initializer was a constant, in constant
7709 expressions. Permitting that usage, as a further
7710 extension, would not change the meaning of any
7711 currently accepted programs. (Of course, as
7712 compound literals are not part of ISO C++, the
7713 standard has nothing to say.) */
7715 NIC_NCC))
7716 {
7719 }
7720 /* Form the representation of the compound-literal. */
7721 postfix_expression
7726 }
7727 }
7729 /* It must be a primary-expression. */
7730 postfix_expression
7733 decltype_p,
7735 }
7737 }
7739 /* Note that we don't need to worry about calling build_cplus_new on a
7740 class-valued CALL_EXPR in decltype when it isn't the end of the
7741 postfix-expression; unary_complex_lvalue will take care of that for
7742 all these cases. */
7744 /* Keep looping until the postfix-expression is complete. */
7746 {
7750 /* It is not a Koenig lookup function call. */
7751 postfix_expression
7754 /* Peek at the next token. */
7758 {
7761 {
7763 "two consecutive %<[%> shall "
7766 }
7767 postfix_expression
7769 postfix_expression,
7771 decltype_p);
7780 /* postfix-expression ( expression-list [opt] ) */
7781 {
7793 tree stripped_expression
7795 is_builtin_constant_p
7798 {
7799 /* The whole point of __builtin_constant_p is to allow
7800 non-constant expressions to appear as arguments. */
7801 saved_integral_constant_expression_p
7803 saved_non_integral_constant_expression_p
7806 }
7807 args = (cp_parser_parenthesized_expression_list
7814 {
7815 parser->integral_constant_expression_p
7817 parser->non_integral_constant_expression_p
7819 }
7822 {
7825 }
7827 /* Function calls are not permitted in
7828 constant-expressions. */
7831 NIC_FUNC_CALL))
7832 {
7836 }
7841 {
7843 /* In C++20, we may need to perform ADL for a template
7844 name. */
7847 {
7849 {
7852 postfix_expression
7854 complain);
7855 }
7856 else
7857 postfix_expression
7859 }
7860 /* We do not perform argument-dependent lookup if
7861 normal lookup finds a non-function, in accordance
7862 with the expected resolution of DR 218. */
7865 {
7866 /* Do not do argument dependent lookup if regular
7867 lookup finds a member function or a block-scope
7868 function declaration. [basic.lookup.argdep]/3 */
7872 {
7878 {
7881 }
7882 }
7885 {
7888 postfix_expression
7890 complain);
7891 }
7892 }
7893 }
7895 /* Temporarily set input_location to the combined location
7896 with call expression range, as e.g. build_out_target_exprs
7897 called from convert_default_arg relies on input_location,
7898 so updating it only when the call is fully built results
7899 in inconsistencies between location handling in templates
7900 and outside of templates. */
7903 close_paren_loc);
7907 {
7917 {
7919 postfix_expression
7921 }
7923 {
7924 postfix_expression
7925 = (build_new_method_call
7931 complain));
7932 }
7933 else
7934 postfix_expression
7938 complain);
7939 }
7943 postfix_expression = (build_offset_ref_call_from_tree
7945 complain));
7947 /* A call to a static class member, or a namespace-scope
7948 function. */
7949 postfix_expression
7952 koenig_p,
7953 complain);
7954 else
7955 /* All other function calls. */
7956 postfix_expression
7959 koenig_p,
7960 complain);
7965 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7969 }
7974 /* postfix-expression . template [opt] id-expression
7975 postfix-expression . pseudo-destructor-name
7976 postfix-expression -> template [opt] id-expression
7977 postfix-expression -> pseudo-destructor-name */
7979 /* Consume the `.' or `->' operator. */
7982 postfix_expression
7984 postfix_expression,
7991 /* postfix-expression ++ */
7992 /* Consume the `++' token. */
7994 /* Generate a representation for the complete expression. */
7995 postfix_expression
7997 POSTINCREMENT_EXPR);
7998 /* Increments may not appear in constant-expressions. */
8006 /* postfix-expression -- */
8007 /* Consume the `--' token. */
8009 /* Generate a representation for the complete expression. */
8010 postfix_expression
8012 POSTDECREMENT_EXPR);
8013 /* Decrements may not appear in constant-expressions. */
8024 return is_member_access
8025 ? postfix_expression
8027 else
8029 }
8030 }
8031 }
8033 /* Helper function for cp_parser_parenthesized_expression_list and
8034 cp_parser_postfix_open_square_expression. Parse a single element
8035 of parenthesized expression list. */
8037 static cp_expr
8041 {
8045 /* Parse the next assignment-expression. */
8047 {
8048 /* A braced-init-list. */
8054 }
8056 {
8062 }
8063 else
8066 /* If we have an ellipsis, then this is an expression expansion. */
8069 {
8070 /* Consume the `...'. */
8073 /* Build the argument pack. */
8075 }
8077 }
8079 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
8080 by cp_parser_builtin_offsetof. We're looking for
8082 postfix-expression [ expression ]
8083 postfix-expression [ braced-init-list ] (C++11)
8084 postfix-expression [ expression-list[opt] ] (C++23)
8086 FOR_OFFSETOF is set if we're being called in that context, which
8087 changes how we deal with integer constant expressions. */
8089 static tree
8091 tree postfix_expression,
8094 {
8100 /* Consume the `[' token. */
8106 /* Parse the index expression. */
8107 /* ??? For offsetof, there is a question of what to allow here. If
8108 offsetof is not being used in an integral constant expression context,
8109 then we *could* get the right answer by computing the value at runtime.
8110 If we are in an integral constant expression context, then we might
8111 could accept any constant expression; hard to say without analysis.
8112 Rather than open the barn door too wide right away, allow only integer
8113 constant expressions here. */
8116 else
8117 {
8122 {
8124 {
8125 cp_expr expr
8127 /*cast_p=*/
8129 /*allow_exp_p=*/
8131 /*non_cst_p=*/
8132 NULL);
8139 else
8142 /* If the next token isn't a `,', then we are done. */
8147 {
8150 }
8152 /* Otherwise, consume the `,' and keep going. */
8154 }
8157 }
8159 {
8164 }
8165 else
8169 }
8173 /* Look for the closing `]'. */
8176 /* Build the ARRAY_REF. */
8179 tf_warning_or_error
8182 /* When not doing offsetof, array references are not permitted in
8183 constant-expressions. */
8189 }
8191 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
8192 dereference of incomplete type, returns true if error_mark_node should
8193 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
8194 and *DEPENDENT_P. */
8196 bool
8199 {
8200 /* In a template, be permissive by treating an object expression
8201 of incomplete type as dependent (after a pedwarn). */
8202 diagnostic_t kind = (processing_template_decl
8206 {
8218 /* Don't emit any diagnostic for OVERLOADs. */
8222 /* Avoid clobbering e.g. DECLs. */
8226 }
8238 {
8241 }
8243 }
8245 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
8246 by cp_parser_builtin_offsetof. We're looking for
8248 postfix-expression . template [opt] id-expression
8249 postfix-expression . pseudo-destructor-name
8250 postfix-expression -> template [opt] id-expression
8251 postfix-expression -> pseudo-destructor-name
8253 FOR_OFFSETOF is set if we're being called in that context. That sorta
8254 limits what of the above we'll actually accept, but nevermind.
8255 TOKEN_TYPE is the "." or "->" token, which will already have been
8256 removed from the stream. */
8258 static tree
8261 cp_expr postfix_expression,
8263 location_t location)
8264 {
8265 tree name;
8271 /* If this is a `->' operator, dereference the pointer. */
8274 tf_warning_or_error);
8275 /* Check to see whether or not the expression is type-dependent and
8276 not the current instantiation. */
8278 /* The identifier following the `->' or `.' is not qualified. */
8284 /* Enter the scope corresponding to the type of the object
8285 given by the POSTFIX_EXPRESSION. */
8287 {
8289 /* According to the standard, no expression should ever have
8290 reference type. Unfortunately, we do not currently match
8291 the standard in this respect in that our internal representation
8292 of an expression may have reference type even when the standard
8293 says it does not. Therefore, we have to manually obtain the
8294 underlying type here. */
8296 /* The type of the POSTFIX_EXPRESSION must be complete. */
8297 /* Unlike the object expression in other contexts, *this is not
8298 required to be of complete type for purposes of class member
8299 access (5.2.5) outside the member function body. */
8303 {
8309 }
8312 {
8313 /* Let the name lookup machinery know that we are processing a
8314 class member access expression. */
8316 /* If something went wrong, we want to be able to discern that case,
8317 as opposed to the case where there was no SCOPE due to the type
8318 of expression being dependent. */
8321 /* If the SCOPE was erroneous, make the various semantic analysis
8322 functions exit quickly -- and without issuing additional error
8323 messages. */
8326 }
8327 }
8330 {
8332 /* If we don't have a (type-dependent) object of class type, use
8333 typeof to figure out the type of the object. */
8337 }
8339 /* Assume this expression is not a pseudo-destructor access. */
8342 /* If the SCOPE is a scalar type, then, if this is a valid program,
8343 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
8344 is type dependent, it can be pseudo-destructor-name or something else.
8345 Try to parse it as pseudo-destructor-name first. */
8347 {
8348 tree s;
8349 tree type;
8352 /* Parse the pseudo-destructor-name. */
8361 {
8363 postfix_expression
8366 }
8367 }
8370 {
8371 /* If the SCOPE is not a scalar type, we are looking at an
8372 ordinary class member access expression, rather than a
8373 pseudo-destructor-name. */
8376 /* Parse the id-expression. */
8377 name = (cp_parser_id_expression
8384 /* In general, build a SCOPE_REF if the member name is qualified.
8385 However, if the name was not dependent and has already been
8386 resolved; there is no need to build the SCOPE_REF. For example;
8388 struct X { void f(); };
8389 template <typename T> void f(T* t) { t->X::f(); }
8391 Even though "t" is dependent, "X::f" is not and has been resolved
8392 to a BASELINK; there is no need to include scope information. */
8394 /* But we do need to remember that there was an explicit scope for
8395 virtual function calls. */
8399 /* If the name is a template-id that names a type, we will get a
8400 TYPE_DECL here. That is invalid code. */
8402 {
8405 }
8406 else
8407 {
8409 {
8411 {
8415 }
8416 else
8419 name,
8420 template_p);
8424 }
8426 adjust_result_of_qualified_name_lookup
8428 postfix_expression
8430 template_p,
8431 tf_warning_or_error);
8432 /* Build a location e.g.:
8433 ptr->access_expr
8434 ~~~^~~~~~~~~~~~~
8435 where the caret is at the deref token, ranging from
8436 the start of postfix_expression to the end of the access expr. */
8437 location_t combined_loc
8440 }
8441 }
8443 /* We no longer need to look up names in the scope of the object on
8444 the left-hand side of the `.' or `->' operator. */
8447 /* Outside of offsetof, these operators may not appear in
8448 constant-expressions. */
8450 && (cp_parser_non_integral_constant_expression
8455 }
8457 /* Parse a parenthesized expression-list.
8459 expression-list:
8460 assignment-expression
8461 expression-list, assignment-expression
8463 attribute-list:
8464 expression-list
8465 identifier
8466 identifier, expression-list
8468 CAST_P is true if this expression is the target of a cast.
8470 ALLOW_EXPANSION_P is true if this expression allows expansion of an
8471 argument pack.
8473 WRAP_LOCATIONS_P is true if expressions within this list for which
8474 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
8475 their source locations.
8477 Returns a vector of trees. Each element is a representation of an
8478 assignment-expression. NULL is returned if the ( and or ) are
8479 missing. An empty, but allocated, vector is returned on no
8480 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
8481 if we are parsing an attribute list for an attribute that wants a
8482 plain identifier argument, normal_attr for an attribute that wants
8483 an expression, or non_attr if we aren't parsing an attribute list. If
8484 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
8485 not all of the expressions in the list were constant.
8486 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
8487 will be written to with the location of the closing parenthesis. If
8488 an error occurs, it may or may not be written to. */
8498 {
8502 /* Assume all the expressions will be constant. */
8506 matching_parens parens;
8512 /* Within a parenthesized expression, a `>' token is always
8513 the greater-than operator. */
8514 saved_greater_than_is_operator_p
8520 /* Consume expressions until there are no more. */
8523 {
8524 /* At the beginning of attribute lists, check to see if the
8525 next token is an identifier. */
8531 else
8532 expr
8534 allow_expansion_p,
8535 non_constant_p);
8540 /* Add it to the list. We add error_mark_node
8541 expressions to the list, so that we can still tell if
8542 the correct form for a parenthesized expression-list
8543 is found. That gives better errors. */
8549 /* After the first item, attribute lists look the same as
8550 expression lists. */
8553 get_comma:;
8554 /* If the next token isn't a `,', then we are done. */
8558 /* Otherwise, consume the `,' and keep going. */
8560 }
8566 {
8569 skip_comma:;
8570 /* We try and resync to an unnested comma, as that will give the
8571 user better diagnostics. */
8579 {
8580 parser->greater_than_is_operator_p
8583 }
8584 }
8586 parser->greater_than_is_operator_p
8590 }
8592 /* Parse a pseudo-destructor-name.
8594 pseudo-destructor-name:
8595 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
8596 :: [opt] nested-name-specifier template template-id :: ~ type-name
8597 :: [opt] nested-name-specifier [opt] ~ type-name
8599 If either of the first two productions is used, sets *SCOPE to the
8600 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
8601 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
8602 or ERROR_MARK_NODE if the parse fails. */
8604 static void
8606 tree object,
8609 {
8612 /* Handle ~auto. */
8616 {
8619 "%<~auto%> only available with "
8626 }
8628 /* Assume that things will not work out. */
8631 /* Look for the optional `::' operator. */
8633 /* Look for the optional nested-name-specifier. */
8634 nested_name_specifier_p
8641 /* Now, if we saw a nested-name-specifier, we might be doing the
8642 second production. */
8645 {
8646 /* Consume the `template' keyword. */
8648 /* Parse the template-id. */
8652 class_type,
8654 /* Look for the `::' token. */
8656 }
8657 /* If the next token is not a `~', then there might be some
8658 additional qualification. */
8660 {
8661 /* At this point, we're looking for "type-name :: ~". The type-name
8662 must not be a class-name, since this is a pseudo-destructor. So,
8663 it must be either an enum-name, or a typedef-name -- both of which
8664 are just identifiers. So, we peek ahead to check that the "::"
8665 and "~" tokens are present; if they are not, then we can avoid
8666 calling type_name. */
8670 {
8673 }
8675 /* Look for the type-name. */
8680 /* Look for the `::' token. */
8682 }
8683 else
8686 /* Look for the `~'. */
8689 /* Once we see the ~, this has to be a pseudo-destructor. */
8693 /* Look for the type-name again. We are not responsible for
8694 checking that it matches the first type-name. */
8696 }
8698 /* Parse a unary-expression.
8700 unary-expression:
8701 postfix-expression
8702 ++ cast-expression
8703 -- cast-expression
8704 await-expression
8705 unary-operator cast-expression
8706 sizeof unary-expression
8707 sizeof ( type-id )
8708 alignof ( type-id ) [C++0x]
8709 new-expression
8710 delete-expression
8712 GNU Extensions:
8714 unary-expression:
8715 __extension__ cast-expression
8716 __alignof__ unary-expression
8717 __alignof__ ( type-id )
8718 alignof unary-expression [C++0x]
8719 __real__ cast-expression
8720 __imag__ cast-expression
8721 && identifier
8722 sizeof ( type-id ) { initializer-list , [opt] }
8723 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
8724 __alignof__ ( type-id ) { initializer-list , [opt] }
8726 ADDRESS_P is true iff the unary-expression is appearing as the
8727 operand of the `&' operator. CAST_P is true if this expression is
8728 the target of a cast.
8730 Returns a representation of the expression. */
8732 static cp_expr
8735 {
8739 /* Peek at the next token. */
8741 /* Some keywords give away the kind of expression. */
8743 {
8747 {
8750 {
8758 /* Consume the token. */
8760 /* Parse the operand. */
8763 /* Construct a location e.g. :
8764 alignof (expr)
8765 ^~~~~~~~~~~~~~
8766 with start == caret at the start of the "alignof"/"sizeof"
8767 token, with the endpoint at the final closing paren. */
8768 location_t compound_loc
8774 else
8775 {
8776 /* ISO C++ defines alignof only with types, not with
8777 expressions. So pedwarn if alignof is used with a non-
8778 type expression. However, __alignof__ is ok. */
8781 "ISO C++ does not allow %<alignof%> "
8786 }
8787 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8788 SIZEOF_EXPR with the original operand. */
8790 {
8792 {
8794 {
8797 error_mark_node));
8799 }
8800 else
8805 }
8806 }
8811 }
8823 {
8824 /* The saved value of the PEDANTIC flag. */
8826 tree expr;
8828 /* Save away the PEDANTIC flag. */
8830 /* Parse the cast-expression. */
8832 /* Restore the PEDANTIC flag. */
8836 }
8840 {
8841 tree expression;
8843 /* Consume the `__real__' or `__imag__' token. */
8845 /* Parse the cast-expression. */
8847 /* Create the complete representation. */
8852 tf_warning_or_error);
8853 }
8861 {
8862 tree expr;
8871 matching_parens parens;
8875 parser->type_definition_forbidden_message
8878 saved_integral_constant_expression_p
8880 saved_non_integral_constant_expression_p
8884 saved_greater_than_is_operator_p
8896 parser->greater_than_is_operator_p
8899 parser->integral_constant_expression_p
8901 parser->non_integral_constant_expression_p
8908 /* Construct a location of the form:
8909 noexcept (expr)
8910 ^~~~~~~~~~~~~~~
8911 with start == caret, finishing at the close-paren. */
8912 location_t noexcept_loc
8916 noexcept_loc);
8917 }
8920 {
8921 tree expr;
8924 /* Consume the `co_await' token. */
8926 /* Parse its cast-expression. */
8931 /* Handle [expr.await]. */
8933 }
8937 }
8938 }
8940 /* Look for the `:: new' and `:: delete', which also signal the
8941 beginning of a new-expression, or delete-expression,
8942 respectively. If the next token is `::', then it might be one of
8943 these. */
8945 {
8948 /* See if the token after the `::' is one of the keywords in
8949 which we're interested. */
8951 /* If it's `new', we have a new-expression. */
8954 /* Similarly, for `delete'. */
8957 }
8959 /* Look for a unary operator. */
8961 /* The `++' and `--' operators can be handled similarly, even though
8962 they are not technically unary-operators in the grammar. */
8964 {
8969 /* Handle the GNU address-of-label extension. */
8972 {
8973 tree identifier;
8974 tree expression;
8977 /* Consume the '&&' token. */
8979 /* Look for the identifier. */
8981 /* Construct a location of the form:
8982 &&label
8983 ^~~~~~~
8984 with caret==start at the "&&", finish at the end of the label. */
8985 location_t combined_loc
8987 /* Create an expression representing the address. */
8990 NIC_ADDR_LABEL))
8993 }
8994 }
8996 {
8997 cp_expr cast_expression;
9003 /* Consume the operator token. */
9007 /* Parse the cast-expression. */
9008 cast_expression
9013 pidk);
9015 /* Make a location:
9016 OP_TOKEN CAST_EXPRESSION
9017 ^~~~~~~~~~~~~~~~~~~~~~~~~
9018 with start==caret at the operator token, and
9019 extending to the end of the cast_expression. */
9022 /* Now, build an appropriate representation. */
9024 {
9029 complain);
9030 /* TODO: build_x_indirect_ref does not always honor the
9031 location, so ensure it is set. */
9037 /* Fall through. */
9040 cast_expression,
9042 /* TODO: build_x_unary_op does not always honor the location,
9043 so ensure it is set. */
9051 /* Fall through. */
9053 /* Immediately fold negation of a constant, unless the constant is 0
9054 (since -0 == 0) or it would overflow. */
9056 {
9057 tree stripped_expr
9062 {
9065 stripped_expr);
9067 {
9070 }
9071 }
9072 }
9073 /* Fall through. */
9082 }
9086 non_constant_p))
9090 }
9094 decltype_p,
9095 pidk);
9096 }
9098 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
9099 unary-operator, the corresponding tree code is returned. */
9101 static enum tree_code
9103 {
9105 {
9126 }
9127 }
9129 /* Parse a __builtin_has_attribute([expr|type], attribute-spec) expression.
9130 Returns a representation of the expression. */
9132 static tree
9134 {
9137 /* Consume the __builtin_has_attribute token. */
9140 matching_parens parens;
9144 /* Types cannot be defined in a `sizeof' expression. Save away the
9145 old message. */
9149 parser->type_definition_forbidden_message
9151 parser->type_definition_forbidden_message_arg
9154 /* The restrictions on constant-expressions do not apply inside
9155 sizeof expressions. */
9156 bool saved_integral_constant_expression_p
9158 bool saved_non_integral_constant_expression_p
9162 /* Do not actually evaluate the expression. */
9168 /* We can't be sure yet whether we're looking at a type-id or an
9169 expression. */
9174 /* Look for the type-id. */
9180 /* If the type-id production did not work out, then we must be
9181 looking at an expression. */
9187 /* Go back to evaluating expressions. */
9191 /* And restore the old one. */
9194 parser->integral_constant_expression_p
9196 parser->non_integral_constant_expression_p
9199 /* Consume the comma if it's there. */
9201 {
9205 }
9207 /* Parse the attribute specification. */
9211 {
9217 else
9218 {
9219 /* Fold constant expressions used in attributes first. */
9222 /* Finally, see if OPER has been declared with ATTR. */
9224 }
9227 }
9228 else
9229 {
9232 }
9234 /* Construct a location e.g. :
9235 __builtin_has_attribute (oper, attr)
9236 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
9237 with start == caret at the start of the built-in token,
9238 and with the endpoint at the final closing paren. */
9239 location_t compound_loc
9246 }
9248 /* Parse a new-expression.
9250 new-expression:
9251 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
9252 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
9254 Returns a representation of the expression. */
9256 static tree
9258 {
9261 tree type;
9264 tree ret;
9268 /* Look for the optional `::' operator. */
9269 global_scope_p
9273 /* Look for the `new' operator. */
9275 /* There's no easy way to tell a new-placement from the
9276 `( type-id )' construct. */
9278 /* Look for a new-placement. */
9280 /* If that didn't work out, there's no new-placement. */
9282 {
9286 }
9288 /* If the next token is a `(', then we have a parenthesized
9289 type-id. */
9291 {
9295 /* Consume the `('. */
9296 matching_parens parens;
9299 /* Parse the type-id. */
9300 parser->type_definition_forbidden_message
9302 {
9305 }
9308 /* Look for the closing `)'. */
9311 /* There should not be a direct-new-declarator in this production,
9312 but GCC used to allowed this, so we check and emit a sensible error
9313 message for this case. */
9315 {
9321 }
9322 }
9323 /* Otherwise, there must be a new-type-id. */
9324 else
9327 /* If the next token is a `(' or '{', then we have a new-initializer. */
9332 else
9335 /* A new-expression may not appear in an integral constant
9336 expression. */
9339 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
9340 of a new-type-id or type-id of a new-expression, the new-expression shall
9341 contain a new-initializer of the form ( assignment-expression )".
9342 Additionally, consistently with the spirit of DR 1467, we want to accept
9343 'new auto { 2 }' too. */
9349 {
9351 "initialization of new-expression for type %<auto%> "
9354 }
9355 else
9356 {
9357 /* Construct a location e.g.:
9358 ptr = new int[100]
9359 ^~~~~~~~~~~~
9360 with caret == start at the start of the "new" token, and the end
9361 at the end of the final token we consumed. */
9364 /* Create a representation of the new-expression. */
9367 }
9375 }
9377 /* Parse a new-placement.
9379 new-placement:
9380 ( expression-list )
9382 Returns the same representation as for an expression-list. */
9386 {
9389 /* Parse the expression-list. */
9390 expression_list = (cp_parser_parenthesized_expression_list
9399 }
9401 /* Parse a new-type-id.
9403 new-type-id:
9404 type-specifier-seq new-declarator [opt]
9406 Returns the TYPE allocated. If the new-type-id indicates an array
9407 type, *NELTS is set to the number of elements in the last array
9408 bound; the TYPE will not include the last array bound. */
9410 static tree
9412 {
9413 cp_decl_specifier_seq type_specifier_seq;
9419 /* The type-specifier sequence must not contain type definitions.
9420 (It cannot contain declarations of new types either, but if they
9421 are not definitions we will catch that because they are not
9422 complete.) */
9424 parser->type_definition_forbidden_message
9426 /* Parse the type-specifier-seq. */
9431 /* Restore the old message. */
9437 /* Parse the new-declarator. */
9440 /* Determine the number of elements in the last array dimension, if
9441 any. */
9443 /* Skip down to the last array dimension. */
9448 {
9451 }
9456 {
9459 }
9462 {
9471 else
9473 }
9476 }
9478 /* Parse an (optional) new-declarator.
9480 new-declarator:
9481 ptr-operator new-declarator [opt]
9482 direct-new-declarator
9484 Returns the declarator. */
9488 {
9491 cp_cv_quals cv_quals;
9493 /* We don't know if there's a ptr-operator next, or not. */
9495 /* Look for a ptr-operator. */
9497 /* If that worked, look for more new-declarators. */
9499 {
9502 /* Parse another optional declarator. */
9505 declarator = cp_parser_make_indirect_declarator
9509 }
9511 /* If the next token is a `[', there is a direct-new-declarator. */
9516 }
9518 /* Parse a direct-new-declarator.
9520 direct-new-declarator:
9521 [ expression ]
9522 direct-new-declarator [constant-expression]
9524 */
9528 {
9533 {
9534 tree expression;
9537 /* Look for the opening `['. */
9543 else
9545 /* The standard requires that the expression have integral
9546 type. DR 74 adds enumeration types. We believe that the
9547 real intent is that these expressions be handled like the
9548 expression in a `switch' condition, which also allows
9549 classes with a single conversion to integral or
9550 enumeration type. */
9552 {
9553 expression
9555 expression,
9558 {
9560 "expression in new-declarator must have integral "
9563 }
9564 }
9566 /* Look for the closing `]'. */
9569 /* Add this bound to the declarator. */
9572 /* If the next token is not a `[', then there are no more
9573 bounds. */
9577 }
9580 }
9582 /* Parse a new-initializer.
9584 new-initializer:
9585 ( expression-list [opt] )
9586 braced-init-list
9588 Returns a representation of the expression-list. */
9592 {
9596 {
9597 tree t;
9604 }
9605 else
9606 expression_list = (cp_parser_parenthesized_expression_list
9612 }
9614 /* Parse a delete-expression.
9616 delete-expression:
9617 :: [opt] delete cast-expression
9618 :: [opt] delete [ ] cast-expression
9620 Returns a representation of the expression. */
9622 static tree
9624 {
9627 tree expression;
9630 /* Look for the optional `::' operator. */
9631 global_scope_p
9635 /* Look for the `delete' keyword. */
9637 /* See if the array syntax is in use. */
9639 {
9640 /* Consume the `[' token. */
9642 /* Look for the `]' token. */
9644 /* Remember that this is the `[]' construct. */
9646 }
9647 else
9650 /* Parse the cast-expression. */
9653 /* A delete-expression may not appear in an integral constant
9654 expression. */
9658 /* Construct a location e.g.:
9659 delete [ ] ptr
9660 ^~~~~~~~~~~~~~
9661 with caret == start at the start of the "delete" token, and
9662 the end at the end of the final token we consumed. */
9669 }
9671 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
9672 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
9673 0 otherwise. */
9675 static int
9677 {
9680 {
9722 /* In ((type ()) () the last () isn't a valid cast-expression,
9723 so the whole must be parsed as postfix-expression. */
9728 /* '[' may start a primary-expression in obj-c++ and in C++11,
9729 as a lambda-expression, eg, '(void)[]{}'. */
9736 /* '++' and '--' may or may not start a cast-expression:
9738 struct T { void operator++(int); };
9739 void f() { (T())++; }
9741 vs
9743 int a;
9744 (int)++a; */
9749 }
9750 }
9752 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
9753 in the order: const_cast, static_cast, reinterpret_cast.
9755 Don't suggest dynamic_cast.
9757 Return the first legal cast kind found, or NULL otherwise. */
9761 {
9762 tree trial;
9764 /* Reuse the parser logic by attempting to build the various kinds of
9765 cast, with "complain" disabled.
9766 Identify the first such cast that is valid. */
9768 /* Don't attempt to run such logic within template processing. */
9772 /* First try const_cast. */
9777 /* If that fails, try static_cast. */
9782 /* Finally, try reinterpret_cast. */
9784 tf_none);
9788 /* No such cast possible. */
9790 }
9792 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
9793 suggesting how to convert a C-style cast of the form:
9795 (DST_TYPE)ORIG_EXPR
9797 to a C++-style cast.
9799 The primary range of RICHLOC is asssumed to be that of the original
9800 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
9801 of the parens in the C-style cast. */
9803 static void
9806 tree dst_type)
9807 {
9808 /* This function is non-trivial, so bail out now if the warning isn't
9809 going to be emitted. */
9813 /* Try to find a legal C++ cast, trying them in order:
9814 const_cast, static_cast, reinterpret_cast. */
9819 /* Replace the open paren with "CAST_SUGGESTION<". */
9820 pretty_printer pp;
9825 /* Replace the close paren with "> (". */
9828 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
9830 }
9833 /* Parse a cast-expression.
9835 cast-expression:
9836 unary-expression
9837 ( type-id ) cast-expression
9839 ADDRESS_P is true iff the unary-expression is appearing as the
9840 operand of the `&' operator. CAST_P is true if this expression is
9841 the target of a cast.
9843 Returns a representation of the expression. */
9845 static cp_expr
9848 {
9849 /* If it's a `(', then we might be looking at a cast. */
9851 {
9857 /* There's no way to know yet whether or not this is a cast.
9858 For example, `(int (3))' is a unary-expression, while `(int)
9859 3' is a cast. So, we resort to parsing tentatively. */
9861 /* Types may not be defined in a cast. */
9863 parser->type_definition_forbidden_message
9865 /* Consume the `('. */
9866 matching_parens parens;
9871 /* A very tricky bit is that `(struct S) { 3 }' is a
9872 compound-literal (which we permit in C++ as an extension).
9873 But, that construct is not a cast-expression -- it is a
9874 postfix-expression. (The reason is that `(struct S) { 3 }.i'
9875 is legal; if the compound-literal were a cast-expression,
9876 you'd need an extra set of parentheses.) But, if we parse
9877 the type-id, and it happens to be a class-specifier, then we
9878 will commit to the parse at that point, because we cannot
9879 undo the action that is done when creating a new class. So,
9880 then we cannot back up and do a postfix-expression.
9882 Another tricky case is the following (c++/29234):
9884 struct S { void operator () (); };
9886 void foo ()
9887 {
9888 ( S()() );
9889 }
9891 As a type-id we parse the parenthesized S()() as a function
9892 returning a function, groktypename complains and we cannot
9893 back up in this case either.
9895 Therefore, we scan ahead to the closing `)', and check to see
9896 if the tokens after the `)' can start a cast-expression. Otherwise
9897 we are dealing with an unary-expression, a postfix-expression
9898 or something else.
9900 Yet another tricky case, in C++11, is the following (c++/54891):
9902 (void)[]{};
9904 The issue is that usually, besides the case of lambda-expressions,
9905 the parenthesized type-id cannot be followed by '[', and, eg, we
9906 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
9907 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
9908 we don't commit, we try a cast-expression, then an unary-expression.
9910 Save tokens so that we can put them back. */
9913 /* We may be looking at a cast-expression. */
9916 cast_expression
9919 /* Roll back the tokens we skipped. */
9921 /* If we aren't looking at a cast-expression, simulate an error so
9922 that the call to cp_parser_error_occurred below returns true. */
9925 else
9926 {
9929 /* Look for the type-id. */
9931 /* Look for the closing `)'. */
9936 }
9938 /* Restore the saved message. */
9941 /* At this point this can only be either a cast or a
9942 parenthesized ctor such as `(T ())' that looks like a cast to
9943 function returning T. */
9945 {
9946 /* Only commit if the cast-expression doesn't start with
9947 '++', '--', or '[' in C++11. */
9955 pidk);
9958 {
9959 /* Warn about old-style casts, if so requested. */
9964 {
9970 }
9972 /* Only type conversions to integral or enumeration types
9973 can be used in constant-expressions. */
9976 NIC_CAST))
9979 /* Perform the cast. */
9980 /* Make a location:
9981 (TYPE) EXPR
9982 ^~~~~~~~~~~
9983 with start==caret at the open paren, extending to the
9984 end of "expr". */
9986 open_paren_loc,
9990 }
9991 }
9992 else
9994 }
9996 /* If we get here, then it's not a cast, so it must be a
9997 unary-expression. */
10000 }
10002 /* Parse a binary expression of the general form:
10004 pm-expression:
10005 cast-expression
10006 pm-expression .* cast-expression
10007 pm-expression ->* cast-expression
10009 multiplicative-expression:
10010 pm-expression
10011 multiplicative-expression * pm-expression
10012 multiplicative-expression / pm-expression
10013 multiplicative-expression % pm-expression
10015 additive-expression:
10016 multiplicative-expression
10017 additive-expression + multiplicative-expression
10018 additive-expression - multiplicative-expression
10020 shift-expression:
10021 additive-expression
10022 shift-expression << additive-expression
10023 shift-expression >> additive-expression
10025 relational-expression:
10026 shift-expression
10027 relational-expression < shift-expression
10028 relational-expression > shift-expression
10029 relational-expression <= shift-expression
10030 relational-expression >= shift-expression
10032 GNU Extension:
10034 relational-expression:
10035 relational-expression <? shift-expression
10036 relational-expression >? shift-expression
10038 equality-expression:
10039 relational-expression
10040 equality-expression == relational-expression
10041 equality-expression != relational-expression
10043 and-expression:
10044 equality-expression
10045 and-expression & equality-expression
10047 exclusive-or-expression:
10048 and-expression
10049 exclusive-or-expression ^ and-expression
10051 inclusive-or-expression:
10052 exclusive-or-expression
10053 inclusive-or-expression | exclusive-or-expression
10055 logical-and-expression:
10056 inclusive-or-expression
10057 logical-and-expression && inclusive-or-expression
10059 logical-or-expression:
10060 logical-and-expression
10061 logical-or-expression || logical-and-expression
10063 All these are implemented with a single function like:
10065 binary-expression:
10066 simple-cast-expression
10067 binary-expression <token> binary-expression
10069 CAST_P is true if this expression is the target of a cast.
10071 The binops_by_token map is used to get the tree codes for each <token> type.
10072 binary-expressions are associated according to a precedence table. */
10074 #define TOKEN_PRECEDENCE(token) \
10075 (((token->type == CPP_GREATER \
10076 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
10077 && !parser->greater_than_is_operator_p) \
10078 ? PREC_NOT_OPERATOR \
10079 : binops_by_token[token->type].prec)
10081 static cp_expr
10087 {
10088 cp_parser_expression_stack stack;
10091 cp_parser_expression_stack_entry current;
10092 cp_expr rhs;
10096 tree overload;
10098 /* Parse the first expression. */
10109 {
10110 /* Get an operator token. */
10116 {
10118 "%<>>%> operator is treated"
10122 }
10127 /* This is a fold-expression; handle it later. */
10130 /* Popping an entry off the stack means we completed a subexpression:
10131 - either we found a token which is not an operator (`>' where it is not
10132 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
10133 will happen repeatedly;
10134 - or, we found an operator which has lower priority. This is the case
10135 where the recursive descent *ascends*, as in `3 * 4 + 5' after
10136 parsing `3 * 4'. */
10138 {
10141 else
10143 }
10145 get_rhs:
10150 /* We used the operator token. */
10153 /* For "false && x" or "true || x", x will never be executed;
10154 disable warnings while evaluating it. */
10159 {
10162 }
10164 /* Extract another operand. It may be the RHS of this expression
10165 or the LHS of a new, higher priority expression. */
10170 /* Get another operator token. Look up its precedence to avoid
10171 building a useless (immediately popped) stack entry for common
10172 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
10179 {
10180 /* ... and prepare to parse the RHS of the new, higher priority
10181 expression. Since precedence levels on the stack are
10182 monotonically increasing, we do not have to care about
10183 stack overflows. */
10192 pop:
10194 /* If the stack is not empty, we have parsed into LHS the right side
10195 (`4' in the example above) of an expression we had suspended.
10196 We can use the information on the stack to recover the LHS (`3')
10197 from the stack together with the tree code (`MULT_EXPR'), and
10198 the precedence of the higher level subexpression
10199 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
10200 which will be used to actually build the additive expression. */
10205 }
10207 /* Undo the disabling of warnings done above. */
10209 {
10212 }
10217 /* Avoid warning for !!x == y. */
10222 /* Avoid warning for !b == y where b is boolean. */
10226 /* Avoid warning for !!b == y where b is boolean. */
10235 /* Don't warn for named "xor" (as opposed to '^'). */
10239 check_for_xor_used_as_pow
10251 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
10252 ERROR_MARK for everything that is not a binary expression.
10253 This makes warn_about_parentheses miss some warnings that
10254 involve unary operators. For unary expressions we should
10255 pass the correct tree_code unless the unary expression was
10256 surrounded by parentheses.
10257 */
10261 {
10264 else
10265 {
10268 current.lhs
10271 == tcc_comparison
10275 }
10276 }
10277 else
10278 {
10284 /* TODO: build_x_binary_op doesn't always honor the location. */
10286 }
10289 /* If the binary operator required the use of an overloaded operator,
10290 then this expression cannot be an integral constant-expression.
10291 An overloaded operator can be used even if both operands are
10292 otherwise permissible in an integral constant-expression if at
10293 least one of the operands is of enumeration type. */
10297 NIC_OVERLOADED))
10299 }
10302 }
10304 static cp_expr
10309 {
10312 }
10314 /* Parse the `? expression : assignment-expression' part of a
10315 conditional-expression. The LOGICAL_OR_EXPR is the
10316 logical-or-expression that started the conditional-expression.
10317 Returns a representation of the entire conditional-expression.
10319 This routine is used by cp_parser_assignment_expression
10320 and cp_parser_conditional_expression.
10322 ? expression : assignment-expression
10324 GNU Extensions:
10326 ? : assignment-expression */
10328 static tree
10330 {
10332 cp_expr assignment_expr;
10336 /* Consume the `?' token. */
10341 {
10344 /* Implicit true clause. */
10346 c_inhibit_evaluation_warnings +=
10349 }
10350 else
10351 {
10354 /* Parse the expression. */
10355 c_inhibit_evaluation_warnings +=
10358 c_inhibit_evaluation_warnings +=
10362 }
10364 /* The next token should be a `:'. */
10366 /* Parse the assignment-expression. */
10368 c_inhibit_evaluation_warnings -=
10371 /* Make a location:
10372 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
10373 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
10374 with the caret at the "?", ranging from the start of
10375 the logical_or_expr to the end of the assignment_expr. */
10380 /* Build the conditional-expression. */
10382 expr,
10383 assignment_expr,
10384 tf_warning_or_error);
10385 }
10387 /* Parse a conditional-expression.
10389 conditional-expression:
10390 logical-or-expression
10391 logical-or-expression ? expression : assignment-expression
10393 GNU Extensions:
10395 logical-or-expression ? : assignment-expression */
10397 static cp_expr
10399 {
10402 /* If the next token is a `?' then we're actually looking at
10403 a conditional-expression; otherwise we're done. */
10407 }
10409 /* Parse an assignment-expression.
10411 assignment-expression:
10412 conditional-expression
10413 logical-or-expression assignment-operator assignment_expression
10414 throw-expression
10415 yield-expression
10417 CAST_P is true if this expression is the target of a cast.
10418 DECLTYPE_P is true if this expression is the operand of decltype.
10420 Returns a representation for the expression. */
10422 static cp_expr
10425 {
10426 cp_expr expr;
10428 /* If the next token is the `throw' keyword, then we're looking at
10429 a throw-expression. */
10432 /* If the next token is the `co_yield' keyword, then we're looking at
10433 a yield-expression. */
10436 /* Otherwise, it must be that we are looking at a
10437 logical-or-expression. */
10438 else
10439 {
10440 /* Parse the binary expressions (logical-or-expression). */
10442 decltype_p,
10444 /* If the next token is a `?' then we're actually looking at a
10445 conditional-expression. */
10448 else
10449 {
10452 /* If it's an assignment-operator, we're using the second
10453 production. */
10454 enum tree_code assignment_operator
10457 {
10460 /* Parse the right-hand side of the assignment. */
10467 /* An assignment may not appear in a
10468 constant-expression. */
10470 NIC_ASSIGNMENT))
10472 /* Build the assignment expression. Its default
10473 location:
10474 LHS = RHS
10475 ~~~~^~~~~
10476 is the location of the '=' token as the
10477 caret, ranging from the start of the lhs to the
10478 end of the rhs. */
10483 assignment_operator,
10486 /* TODO: build_x_modify_expr doesn't honor the location,
10487 so we must set it here. */
10489 }
10490 }
10491 }
10494 }
10496 /* Parse an (optional) assignment-operator.
10498 assignment-operator: one of
10499 = *= /= %= += -= >>= <<= &= ^= |=
10501 GNU Extension:
10503 assignment-operator: one of
10504 <?= >?=
10506 If the next token is an assignment operator, the corresponding tree
10507 code is returned, and the token is consumed. For example, for
10508 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
10509 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
10510 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
10511 operator, ERROR_MARK is returned. */
10513 static enum tree_code
10515 {
10519 /* Peek at the next token. */
10523 {
10569 /* Nothing else is an assignment operator. */
10571 }
10573 /* An operator followed by ... is a fold-expression, handled elsewhere. */
10578 /* If it was an assignment operator, consume it. */
10583 }
10585 /* Parse an expression.
10587 expression:
10588 assignment-expression
10589 expression , assignment-expression
10591 CAST_P is true if this expression is the target of a cast.
10592 DECLTYPE_P is true if this expression is the immediate operand of decltype,
10593 except possibly parenthesized or on the RHS of a comma (N3276).
10594 WARN_COMMA_P is true if a comma should be diagnosed.
10596 Returns a representation of the expression. */
10598 static cp_expr
10601 {
10606 {
10607 cp_expr assignment_expression;
10609 /* Parse the next assignment-expression. */
10610 assignment_expression
10613 /* We don't create a temporary for a call that is the immediate operand
10614 of decltype or on the RHS of a comma. But when we see a comma, we
10615 need to create a temporary for a call on the LHS. */
10620 assignment_expression
10624 /* If this is the first assignment-expression, we can just
10625 save it away. */
10628 else
10629 {
10630 /* Create a location with caret at the comma, ranging
10631 from the start of the LHS to the end of the RHS. */
10639 }
10640 /* If the next token is not a comma, or we're in a fold-expression, then
10641 we are done with the expression. */
10645 /* Consume the `,'. */
10648 {
10649 /* [depr.comma.subscript]: A comma expression appearing as
10650 the expr-or-braced-init-list of a subscripting expression
10651 is deprecated. A parenthesized comma expression is not
10652 deprecated. */
10654 "top-level comma expression in array subscript "
10657 }
10659 /* A comma operator cannot appear in a constant-expression. */
10662 }
10665 }
10667 /* Parse a constant-expression.
10669 constant-expression:
10670 conditional-expression
10672 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
10673 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
10674 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
10675 is false, NON_CONSTANT_P should be NULL. If ALLOW_NON_CONSTANT_P is
10676 greater than 1, this isn't really a constant-expression, only a
10677 potentially constant-evaluated expression. If STRICT_P is true,
10678 only parse a conditional-expression, otherwise parse an
10679 assignment-expression. See below for rationale. */
10681 static cp_expr
10686 {
10690 cp_expr expression;
10692 /* It might seem that we could simply parse the
10693 conditional-expression, and then check to see if it were
10694 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
10695 one that the compiler can figure out is constant, possibly after
10696 doing some simplifications or optimizations. The standard has a
10697 precise definition of constant-expression, and we must honor
10698 that, even though it is somewhat more restrictive.
10700 For example:
10702 int i[(2, 3)];
10704 is not a legal declaration, because `(2, 3)' is not a
10705 constant-expression. The `,' operator is forbidden in a
10706 constant-expression. However, GCC's constant-folding machinery
10707 will fold this operation to an INTEGER_CST for `3'. */
10709 /* Save the old settings. */
10711 saved_allow_non_integral_constant_expression_p
10714 /* We are now parsing a constant-expression. */
10716 parser->allow_non_integral_constant_expression_p
10720 /* A manifestly constant-evaluated expression is evaluated even in an
10721 unevaluated operand. */
10724 /* Although the grammar says "conditional-expression", when not STRICT_P,
10725 we parse an "assignment-expression", which also permits
10726 "throw-expression" and the use of assignment operators. In the case
10727 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
10728 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
10729 actually essential that we look for an assignment-expression.
10730 For example, cp_parser_initializer_clauses uses this function to
10731 determine whether a particular assignment-expression is in fact
10732 constant. */
10735 else
10737 /* Restore the old settings. */
10738 parser->integral_constant_expression_p
10740 parser->allow_non_integral_constant_expression_p
10743 {
10744 /* Require an rvalue constant expression here; that's what our
10745 callers expect. Reference constant expressions are handled
10746 separately in e.g. cp_parser_template_argument. */
10755 }
10758 parser->non_integral_constant_expression_p
10762 }
10764 /* Parse __builtin_offsetof.
10766 offsetof-expression:
10767 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
10769 offsetof-member-designator:
10770 id-expression
10771 | offsetof-member-designator "." id-expression
10772 | offsetof-member-designator "[" expression "]"
10773 | offsetof-member-designator "->" id-expression */
10775 static cp_expr
10777 {
10779 tree type;
10780 cp_expr expr;
10781 cp_id_kind dummy;
10783 location_t finish_loc;
10785 /* We're about to accept non-integral-constant things, but will
10786 definitely yield an integral constant expression. Save and
10787 restore these values around our local parsing. */
10793 /* Consume the "__builtin_offsetof" token. */
10795 /* Consume the opening `('. */
10796 matching_parens parens;
10798 /* Parse the type-id. */
10800 {
10802 parser->type_definition_forbidden_message
10806 }
10807 /* Look for the `,'. */
10811 /* Build the (type *)null that begins the traditional offsetof macro. */
10812 tree object_ptr
10816 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
10820 {
10823 {
10825 /* offsetof-member-designator "[" expression "]" */
10831 /* offsetof-member-designator "->" identifier */
10834 /* FALLTHRU */
10837 /* offsetof-member-designator "." identifier */
10845 /* Consume the ")" token. */
10851 /* Error. We know the following require will fail, but
10852 that gives the proper error message. */
10857 }
10858 }
10860 success:
10861 /* Make a location of the form:
10862 __builtin_offsetof (struct s, f)
10863 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
10864 with caret at the type-id, ranging from the start of the
10865 "_builtin_offsetof" token to the close paren. */
10867 /* The result will be an INTEGER_CST, so we need to explicitly
10868 preserve the location. */
10871 failure:
10877 }
10879 /* Parse a builtin trait expression or type. */
10881 static cp_expr
10883 {
10884 cp_trait_kind kind;
10891 {
10892 #define DEFTRAIT(TCC, CODE, NAME, ARITY) \
10893 case RID_##CODE: \
10894 kind = CPTK_##CODE; \
10895 binary = (ARITY == 2); \
10896 variadic = (ARITY == -1); \
10897 type = (TCC == tcc_type); \
10898 break;
10900 #undef DEFTRAIT
10903 }
10905 /* Get location of initial token. */
10908 /* Consume the token. */
10911 matching_parens parens;
10914 {
10917 }
10923 {
10926 {
10929 }
10933 }
10935 {
10937 {
10941 {
10944 }
10948 }
10950 }
10955 /* Construct a location of the form:
10956 __is_trivially_copyable(_Tp)
10957 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10958 with start == caret, finishing at the close-paren. */
10961 /* Complete the trait expression, which may mean either processing
10962 the trait expr now or saving it for template instantiation. */
10964 {
10972 else
10974 }
10975 }
10977 /* Parse a lambda expression.
10979 lambda-expression:
10980 lambda-introducer lambda-declarator [opt] compound-statement
10981 lambda-introducer < template-parameter-list > requires-clause [opt]
10982 lambda-declarator [opt] compound-statement
10984 Returns a representation of the expression. */
10986 static cp_expr
10988 {
10990 tree type;
10998 {
10999 /* C++20 allows lambdas in unevaluated context, but one in the type of a
11000 non-type parameter is nonsensical.
11002 Distinguish a lambda in the parameter type from a lambda in the
11003 default argument by looking at local_variables_forbidden_p, which is
11004 only set in default arguments. */
11006 {
11011 }
11012 }
11014 {
11016 {
11018 "lambda-expression in unevaluated context"
11021 }
11023 }
11025 {
11027 {
11031 }
11033 }
11035 /* We may be in the middle of deferred access check. Disable
11036 it now. */
11050 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
11053 /* Now that we've started the type, add the capture fields for any
11054 explicit captures. */
11057 {
11058 /* Inside the class, surrounding template-parameter-lists do not apply. */
11059 unsigned int saved_num_template_parameter_lists
11063 bool fully_implicit_function_template_p
11067 bool auto_is_implicit_function_template_parm_p
11078 /* The body of a lambda in a discarded statement is not discarded. */
11082 /* Similarly the body of a lambda in immediate function context is not
11083 in immediate function context. */
11087 /* By virtue of defining a local class, a lambda expression has access to
11088 the private variables of enclosing classes. */
11101 {
11104 }
11106 /* The capture list was built up in reverse order; fix that now. */
11121 parser->fully_implicit_function_template_p
11125 parser->auto_is_implicit_function_template_parm_p
11127 }
11129 /* This field is only used during parsing of the lambda. */
11132 /* This lambda shouldn't have any proxies left at this point. */
11134 /* And now that we're done, push proxies for an enclosing lambda. */
11137 /* Update the lambda expression to a range. */
11144 else
11152 }
11154 /* Parse the beginning of a lambda expression.
11156 lambda-introducer:
11157 [ lambda-capture [opt] ]
11159 LAMBDA_EXPR is the current representation of the lambda expression. */
11161 static void
11163 {
11164 /* Need commas after the first capture. */
11167 /* Eat the leading `['. */
11170 /* Record default capture mode. "[&" "[=" "[&," "[=," */
11180 {
11186 }
11191 {
11193 tree capture_id;
11194 tree capture_init_expr;
11198 enum capture_kind_type
11199 {
11200 BY_COPY,
11201 BY_REFERENCE
11202 };
11206 {
11209 }
11213 else
11216 /* Possibly capture `this'. */
11218 {
11223 "explicit by-copy capture of %<this%> "
11224 "with by-copy capture default only available with "
11230 this_identifier);
11231 else
11236 }
11238 /* Possibly capture `*this'. */
11241 {
11245 "%<*this%> capture only available with "
11252 this_identifier);
11253 else
11258 }
11260 /* But reject `&this'. */
11263 {
11269 }
11271 /* Remember whether we want to capture as a reference or not. */
11273 {
11276 }
11281 {
11285 "pack init-capture only available with "
11289 }
11291 /* Early C++20 drafts had ...& instead of &...; be forgiving. */
11294 {
11299 }
11301 /* Get the identifier. */
11306 /* Would be nice to have a cp_parser_skip_to_closing_x for general
11307 delimiters, but I modified this to stop on unnested ']' as well. It
11308 was already changed to stop on unnested '}', so the
11309 "closing_parenthesis" name is no more misleading with my change. */
11310 {
11316 }
11318 /* Find the initializer for this capture. */
11322 {
11324 /* An explicit initializer exists. */
11327 "lambda capture initializers "
11333 {
11336 }
11339 }
11340 else
11341 {
11344 /* Turn the identifier into an id-expression. */
11345 capture_init_expr
11350 {
11353 }
11356 {
11359 capture_init_expr);
11364 }
11367 {
11370 capture_init_expr))
11374 }
11376 capture_init_expr
11377 = finish_id_expression
11379 capture_init_expr,
11393 {
11398 {
11399 /* If what follows is an initializer, the second '...' is
11400 invalid. But for cases like [...xs...], the first one
11401 is invalid. */
11408 }
11409 }
11410 }
11414 {
11419 capture_id);
11423 "capture of %qD redundant with by-reference capture "
11425 }
11427 /* Check for duplicates.
11428 Optimize for the zero or one explicit captures cases and only create
11429 the hash_set after adding second capture. */
11437 else
11438 {
11441 }
11445 else
11448 explicit_init_p);
11450 /* If there is any qualification still in effect, clear it
11451 now; we will be starting fresh with the next capture. */
11455 }
11458 }
11460 /* Parse the (optional) middle of a lambda expression.
11462 lambda-declarator:
11463 ( parameter-declaration-clause ) lambda-specifiers requires-clause [opt]
11464 lambda-specifiers (C++23)
11466 lambda-specifiers:
11467 decl-specifier-seq [opt] noexcept-specifier [opt]
11468 attribute-specifier-seq [opt] trailing-return-type [opt]
11470 LAMBDA_EXPR is the current representation of the lambda expression. */
11472 static bool
11474 {
11475 /* 5.1.1.4 of the standard says:
11476 If a lambda-expression does not include a lambda-declarator, it is as if
11477 the lambda-declarator were ().
11478 This means an empty parameter list, no attributes, and no exception
11479 specification. */
11490 cp_decl_specifier_seq lambda_specs;
11492 /* A lambda op() is const unless explicitly 'mutable'. */
11495 /* The template-parameter-list is optional, but must begin with
11496 an opening angle if present. */
11498 {
11501 "lambda templates are only available with "
11505 "lambda templates are only available with "
11513 /* We may have a constrained generic lambda; parse the requires-clause
11514 immediately after the template-parameter-list and combine with any
11515 shorthand constraints present. */
11518 {
11523 }
11525 /* We just processed one more parameter list. */
11527 }
11529 /* Committee discussion supports allowing attributes here. */
11532 /* The parameter-declaration-clause is optional (unless
11533 template-parameter-list was given), but must begin with an
11534 opening parenthesis if present. */
11536 {
11537 matching_parens parens;
11542 /* Parse parameters. */
11543 param_list
11544 = cp_parser_parameter_declaration_clause
11547 /* Default arguments shall not be specified in the
11548 parameter-declaration-clause of a lambda-declarator. */
11553 OPT_Wc__14_extensions,
11558 }
11562 /* In the decl-specifier-seq of the lambda-declarator, each
11563 decl-specifier shall either be mutable or constexpr. */
11567 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
11571 {
11573 "parameter declaration before lambda declaration "
11574 "specifiers only optional with %<-std=c++2b%> or "
11577 }
11580 {
11583 }
11585 {
11590 else
11591 {
11594 }
11595 }
11599 {
11601 "parameter declaration before lambda transaction "
11602 "qualifier only optional with %<-std=c++2b%> or "
11605 }
11607 /* Parse optional exception specification. */
11608 exception_spec
11612 {
11614 "parameter declaration before lambda exception "
11615 "specification only optional with %<-std=c++2b%> or "
11618 }
11620 /* GCC 8 accepted attributes here, and this is the place for standard C++11
11621 attributes that appertain to the function type. */
11624 else
11627 /* Parse optional trailing return type. */
11629 {
11632 "parameter declaration before lambda trailing "
11633 "return type only optional with %<-std=c++2b%> or "
11637 }
11639 /* Also allow GNU attributes at the very end of the declaration, the usual
11640 place for GNU attributes. */
11645 {
11646 /* Parse optional trailing requires clause. */
11649 /* The function parameters must be in scope all the way until after the
11650 trailing-return-type in case of decltype. */
11652 }
11654 /* Create the function call operator.
11656 Messing with declarators like this is no uglier than building up the
11657 FUNCTION_DECL by hand, and this is less likely to get out of sync with
11658 other code. */
11659 {
11660 cp_decl_specifier_seq return_type_specs;
11662 tree fco;
11669 {
11673 else
11675 "lambda only available with %<-std=c++17%> or "
11677 }
11682 {
11686 }
11694 VIRT_SPEC_UNSPECIFIED,
11695 REF_QUAL_NONE,
11696 tx_qual,
11697 exception_spec,
11698 return_type,
11699 trailing_requires_clause,
11700 std_attrs,
11701 UNKNOWN_LOCATION);
11704 declarator,
11707 {
11711 /* Give the object parameter a different name. */
11714 }
11716 {
11720 }
11730 }
11731 }
11733 /* Parse the body of a lambda expression, which is simply
11735 compound-statement
11737 but which requires special handling.
11738 LAMBDA_EXPR is the current representation of the lambda expression. */
11740 static void
11742 {
11744 unsigned char local_variables_forbidden_p
11748 /* The body of a lambda-expression is not a subexpression of the enclosing
11749 expression. */
11750 cp_evaluated ev;
11754 else
11755 /* Still increment function_depth so that we don't GC in the
11756 middle of an expression. */
11764 /* Clear this in case we're in the middle of a default argument. */
11768 {
11773 /* Originally C++11 required us to peek for 'return expr'; and
11774 process it specially here to deduce the return type. N3638
11775 removed the need for that. */
11779 }
11786 else
11788 }
11790 /* Statements [gram.stmt.stmt] */
11792 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
11794 static void
11796 {
11800 /* A concept is never expanded normally. */
11806 }
11808 struct cp_omp_attribute_data
11809 {
11812 c_omp_directive_kind kind;
11813 };
11815 /* Handle omp::directive and omp::sequence attributes in ATTRS
11816 (if any) at the start of a statement or in attribute-declaration. */
11818 static tree
11820 {
11831 {
11832 cnt++;
11834 {
11840 {
11842 "mixing OpenMP directives with attribute and pragma "
11846 }
11849 {
11857 else
11860 }
11866 {
11868 "unknown OpenMP directive name in %<omp::directive%>"
11871 }
11874 {
11875 /* ordered is C_OMP_DIR_CONSTRUCT only if it doesn't contain
11876 depend/doacross clause. */
11889 }
11891 {
11892 /* error with at(execution) clause is C_OMP_DIR_STANDALONE. */
11896 paren_depth++;
11898 paren_depth--;
11909 {
11912 }
11913 }
11918 }
11919 cp_omp_attribute_data v = {};
11922 }
11923 else
11936 {
11941 }
11942 else
11943 {
11945 {
11948 }
11949 }
11952 {
11954 "OpenMP construct among %<omp::directive%> attributes"
11955 " requires all %<omp::directive%> attributes on the"
11958 }
11960 {
11962 "multiple OpenMP standalone directives among"
11963 " %<omp::directive%> attributes must be all within the"
11966 }
11972 {
11974 "standalone OpenMP directives in %<omp::directive%> attribute"
11977 }
11979 {
11983 {
11985 "mixing OpenMP directives with attribute and pragma "
11988 }
11989 }
11993 tokens++;
11998 {
12005 cp_token tok = {};
12013 tok = {};
12018 }
12019 cp_token tok = {};
12031 /* Move the current source position to that of the first token in the
12032 new lexer. */
12035 }
12037 /* True if and only if the name is one of the contract types. */
12039 static bool
12041 {
12045 }
12047 /* Handle omp::directive and omp::sequence attributes in *PATTRS
12048 (if any) at the start or after declaration-id of a declaration. */
12050 static void
12054 {
12065 {
12067 {
12074 {
12082 else
12085 }
12095 {
12097 {
12100 }
12102 {
12104 "mixing OpenMP directives with attribute and "
12107 }
12108 }
12109 }
12110 }
12113 {
12118 else
12121 }
12126 {
12135 }
12137 }
12139 /* Parse a statement.
12141 statement:
12142 labeled-statement
12143 expression-statement
12144 compound-statement
12145 selection-statement
12146 iteration-statement
12147 jump-statement
12148 declaration-statement
12149 try-block
12151 C++11:
12153 statement:
12154 labeled-statement
12155 attribute-specifier-seq (opt) expression-statement
12156 attribute-specifier-seq (opt) compound-statement
12157 attribute-specifier-seq (opt) selection-statement
12158 attribute-specifier-seq (opt) iteration-statement
12159 attribute-specifier-seq (opt) jump-statement
12160 declaration-statement
12161 attribute-specifier-seq (opt) try-block
12163 init-statement:
12164 expression-statement
12165 simple-declaration
12166 alias-declaration
12168 TM Extension:
12170 statement:
12171 atomic-statement
12173 IN_COMPOUND is true when the statement is nested inside a
12174 cp_parser_compound_statement.
12176 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12177 is a (possibly labeled) if statement which is not enclosed in braces
12178 and has an else clause. This is used to implement -Wparentheses.
12180 CHAIN is a vector of if-else-if conditions.
12182 Note that this version of parsing restricts assertions to be attached to
12183 empty statements. */
12185 static void
12189 {
12195 /* A copy of IN_COMPOUND which is set to false after seeing a label.
12196 This matters for certain pragmas. */
12199 restart:
12202 /* There is no statement yet. */
12209 /* In obj-c++, seeing '[[' might be the either the beginning of
12210 c++11 attributes, or a nested objc-message-expression. So
12211 let's parse the c++11 attributes tentatively. */
12217 {
12220 }
12223 /* Peek at the next token. */
12226 /* If we have contracts, check that they're valid in this context. */
12228 {
12236 /* Check that assertions are null statements. */
12240 }
12246 {
12250 {
12277 }
12283 {
12285 std_attrs);
12287 }
12288 }
12291 /* Remember the location of the first token in the statement. */
12295 /* If this is a keyword, then that will often determine what kind of
12296 statement we have. */
12298 {
12302 {
12305 /* Looks like a labeled-statement with a case label.
12306 Parse the label, and then use tail recursion to parse
12307 the statement. */
12335 /* Objective-C++ exception-handling constructs. */
12351 /* This must be a namespace alias definition. */
12353 {
12354 /* Attributes should be parsed as part of the
12355 declaration, so let's un-parse them. */
12358 }
12376 /* It might be a keyword like `int' that can start a
12377 declaration-statement. */
12379 }
12380 }
12382 {
12383 /* If the next token is a `:', then we are looking at a
12384 labeled-statement. */
12387 {
12388 /* Looks like a labeled-statement with an ordinary label.
12389 Parse the label, and then use tail recursion to parse
12390 the statement. */
12394 /* If there's no statement, it's not a labeled-statement, just
12395 a label. That's allowed in C++23, but only if we're at the
12396 end of a compound-statement. */
12399 {
12403 "label at end of compound statement only available "
12406 }
12410 }
12411 }
12412 /* Anything that starts with a `{' must be a compound-statement. */
12414 {
12417 }
12418 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
12419 a statement all its own. */
12421 {
12422 do_pragma:;
12425 /* Only certain OpenMP pragmas are attached to statements, and thus
12426 are considered statements themselves. All others are not. In
12427 the context of a compound, accept the pragma as a "statement" and
12428 return so that we can check for a close brace. Otherwise we
12429 require a real statement and must go back and read one. */
12437 {
12439 {
12446 }
12449 }
12457 }
12459 {
12462 }
12464 /* Everything else must be a declaration-statement or an
12465 expression-statement. Try for the declaration-statement
12466 first, unless we are looking at a `;', in which case we know that
12467 we have an expression-statement. */
12469 {
12471 {
12473 /* Attributes should be parsed as part of the declaration,
12474 so let's un-parse them. */
12479 /* Try to parse the declaration-statement. */
12482 /* If that worked, we're done. */
12485 /* It didn't work, restore the post-attribute position. */
12487 {
12490 {
12495 i++;
12497 {
12503 /* Don't handle OpenMP attribs on keywords that
12504 always start a declaration statement but don't
12505 accept attribute before it and therefore
12506 the tentative cp_parser_declaration_statement
12507 fails to parse because of that. */
12512 }
12515 {
12517 std_attrs
12518 = cp_parser_handle_statement_omp_attributes
12524 }
12525 }
12526 }
12527 }
12528 /* All preceding labels have been parsed at this point. */
12534 /* Look for an expression-statement instead. */
12538 attrs_loc);
12540 /* Handle [[fallthrough]];. */
12542 {
12543 /* The next token after the fallthrough attribute is ';'. */
12545 {
12546 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
12548 IFN_FALLTHROUGH,
12551 }
12552 else
12556 }
12558 /* Handle [[assert: ...]]; */
12560 {
12561 /* Add the assertion as a statement in the current block. */
12565 }
12566 }
12568 /* Set the line number for the statement. */
12572 /* Allow "[[fallthrough]];" or "[[assume(cond)]];", but warn otherwise. */
12575 OPT_Wattributes,
12577 }
12579 /* Append ATTR to attribute list ATTRS. */
12581 tree
12583 {
12589 }
12591 /* Parse the label for a labeled-statement, i.e.
12593 label:
12594 attribute-specifier-seq[opt] identifier :
12595 attribute-specifier-seq[opt] case constant-expression :
12596 attribute-specifier-seq[opt] default :
12598 labeled-statement:
12599 label statement
12601 GNU Extension:
12602 case constant-expression ... constant-expression : statement
12604 When a label is parsed without errors, the label is added to the
12605 parse tree by the finish_* functions, so this function doesn't
12606 have to return the label. */
12608 static void
12610 {
12615 /* The next token should be an identifier. */
12619 {
12622 }
12624 /* Remember whether this case or a user-defined label is allowed to fall
12625 through to. */
12630 {
12632 {
12636 /* Consume the `case' token. */
12638 /* Parse the constant-expression. */
12645 {
12646 /* Consume the `...' token. */
12652 /* We don't need to emit warnings here, as the common code
12653 will do this for us. */
12654 }
12655 else
12659 {
12662 {
12665 }
12666 }
12667 else
12670 expr);
12671 }
12675 /* Consume the `default' token. */
12679 {
12682 {
12685 }
12686 }
12687 else
12692 /* Anything else must be an ordinary label. */
12697 }
12699 /* Require the `:' token. */
12702 /* An ordinary label may optionally be followed by attributes.
12703 However, this is only permitted if the attributes are then
12704 followed by a semicolon. This is because, for backward
12705 compatibility, when parsing
12706 lab: __attribute__ ((unused)) int i;
12707 we want the attribute to attach to "i", not "lab". */
12710 {
12711 tree attrs;
12715 /* And fallthrough always binds to the expression-statement. */
12720 ;
12721 else
12723 }
12729 }
12731 /* Parse an expression-statement.
12733 expression-statement:
12734 expression [opt] ;
12736 Returns the new EXPR_STMT -- or NULL_TREE if the expression
12737 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
12738 indicates whether this expression-statement is part of an
12739 expression statement. */
12741 static tree
12743 {
12748 /* There might be attribute fallthrough. */
12751 /* If the next token is a ';', then there is no expression
12752 statement. */
12754 {
12758 {
12761 }
12762 }
12766 /* Handle [[fallthrough]];. */
12768 {
12769 /* The next token after the fallthrough attribute is ';'. */
12771 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
12774 else
12778 }
12780 /* Allow "[[fallthrough]];", but warn otherwise. */
12785 /* Give a helpful message for "A<T>::type t;" and the like. */
12788 {
12795 {
12796 /* A::A a; */
12801 }
12802 }
12804 /* Consume the final `;'. */
12809 /* This is the final expression statement of a statement
12810 expression. */
12816 }
12818 /* Parse a compound-statement.
12820 compound-statement:
12821 { statement-seq [opt] label-seq [opt] }
12823 label-seq:
12824 label
12825 label-seq label
12827 GNU extension:
12829 compound-statement:
12830 { label-declaration-seq [opt] statement-seq [opt] }
12832 label-declaration-seq:
12833 label-declaration
12834 label-declaration-seq label-declaration
12836 Returns a tree representing the statement. */
12838 static tree
12841 {
12842 tree compound_stmt;
12843 matching_braces braces;
12845 /* Consume the `{'. */
12852 /* Begin the compound-statement. */
12854 /* If the next keyword is `__label__' we have a label declaration. */
12857 /* Parse an (optional) statement-seq. */
12860 /* Consume the `}'. */
12863 /* Finish the compound-statement. */
12867 }
12869 /* Parse an (optional) statement-seq.
12871 statement-seq:
12872 statement
12873 statement-seq [opt] statement */
12875 static void
12877 {
12878 /* Scan statements until there aren't any more. */
12880 {
12883 /* If we are looking at a `}', then we have run out of
12884 statements; the same is true if we have reached the end
12885 of file, or have stumbled upon a stray '@end'. */
12892 /* If we are in a compound statement and find 'else' then
12893 something went wrong. */
12895 {
12898 else
12899 {
12902 }
12903 }
12905 /* Parse the statement. */
12907 }
12908 }
12910 /* Return true if this is the C++20 version of range-based-for with
12911 init-statement. */
12913 static bool
12915 {
12918 /* Save tokens so that we can put them back. */
12921 /* There has to be an unnested ; followed by an unnested :. */
12924 CPP_SEMICOLON,
12928 /* We found the semicolon, eat it now. */
12931 /* Now look for ':' that is not nested in () or {}. */
12934 CPP_COLON,
12937 out:
12938 /* Roll back the tokens we skipped. */
12942 }
12944 /* Return true if we're looking at (init; cond), false otherwise. */
12946 static bool
12948 {
12949 /* Save tokens so that we can put them back. */
12952 /* Look for ';' that is not nested in () or {}. */
12955 CPP_SEMICOLON,
12958 /* Roll back the tokens we skipped. */
12962 }
12964 /* Parse a selection-statement.
12966 selection-statement:
12967 if ( init-statement [opt] condition ) statement
12968 if ( init-statement [opt] condition ) statement else statement
12969 switch ( init-statement [opt] condition ) statement
12971 Returns the new IF_STMT or SWITCH_STMT.
12973 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12974 is a (possibly labeled) if statement which is not enclosed in
12975 braces and has an else clause. This is used to implement
12976 -Wparentheses.
12978 CHAIN is a vector of if-else-if conditions. This is used to implement
12979 -Wduplicated-cond. */
12981 static tree
12984 {
12987 token_indent_info guard_tinfo;
12992 /* Peek at the next token. */
12996 /* See what kind of keyword it is. */
12999 {
13002 {
13003 tree statement;
13004 tree condition;
13009 RID_CONSTEXPR))
13010 {
13015 "%<if constexpr%> only available with "
13017 }
13020 {
13022 RID_CONSTEVAL))
13026 RID_CONSTEVAL))
13027 {
13030 }
13031 }
13033 {
13037 "%<if consteval%> only available with "
13048 {
13051 }
13057 {
13058 location_t before_loc
13064 }
13068 /* If the next token is `else', parse the else-clause. */
13070 RID_ELSE))
13071 {
13075 /* Consume the `else' keyword. */
13081 {
13085 }
13089 guard_tinfo);
13092 {
13093 location_t before_loc
13098 }
13101 }
13105 {
13109 }
13113 }
13115 /* Look for the `('. */
13116 matching_parens parens;
13118 {
13121 }
13123 /* Begin the selection-statement. */
13125 {
13128 }
13129 else
13132 /* Parse the optional init-statement. */
13134 {
13135 tree decl;
13138 OPT_Wc__17_extensions,
13139 "init-statement in selection statements only available "
13142 /* A non-empty init-statement can have arbitrary side
13143 effects. */
13146 }
13148 /* Parse the condition. */
13150 /* Look for the `)'. */
13156 {
13160 /* Add the condition. */
13167 /* Parse the then-clause. */
13171 /* Outside a template, the non-selected branch of a constexpr
13172 if is a 'discarded statement', i.e. unevaluated. */
13177 {
13180 }
13183 guard_tinfo);
13190 {
13194 }
13196 /* If the next token is `else', parse the else-clause. */
13198 RID_ELSE))
13199 {
13203 {
13206 }
13208 guard_tinfo
13210 /* Consume the `else' keyword. */
13213 {
13215 RID_IF)
13217 {
13218 /* We've got "if (COND) else if (COND2)". Start
13219 the condition chain and add COND as the first
13220 element. */
13224 {
13225 /* Wrap it in a NOP_EXPR so that we can set the
13226 location of the condition. */
13228 condition);
13231 }
13232 }
13234 RID_IF))
13235 /* This is if-else without subsequent if. Zap the
13236 condition chain; we would have already warned at
13237 this point. */
13239 }
13241 /* Parse the else-clause. */
13247 /* If we are currently parsing a then-clause, then
13248 IF_P will not be NULL. We set it to true to
13249 indicate that this if statement has an else clause.
13250 This may trigger the Wparentheses warning below
13251 when we get back up to the parent if statement. */
13256 {
13260 }
13261 }
13262 else
13263 {
13264 /* This if statement does not have an else clause. If
13265 NESTED_IF is true, then the then-clause has an if
13266 statement which does have an else clause. We warn
13267 about the potential ambiguity. */
13270 "suggest explicit braces to avoid ambiguous"
13273 /* We don't need the condition chain anymore. */
13275 }
13277 /* Now we're all done with the if-statement. */
13279 }
13280 else
13281 {
13285 /* Add the condition. */
13288 /* Parse the body of the switch-statement. */
13294 guard_tinfo);
13298 /* Now we're all done with the switch-statement. */
13300 }
13303 }
13309 }
13310 }
13312 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
13313 If we have seen at least one decl-specifier, and the next token is not
13314 a parenthesis (after "int (" we might be looking at a functional cast)
13315 neither we are dealing with a concept-check expression then we must be
13316 looking at a declaration. */
13318 static void
13321 {
13330 }
13332 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
13333 The declarator shall not specify a function or an array. Returns
13334 TRUE if the declarator is valid, FALSE otherwise. */
13336 static bool
13339 location_t loc)
13340 {
13344 {
13349 else
13357 }
13358 else
13360 }
13362 /* Parse a condition.
13364 condition:
13365 expression
13366 type-specifier-seq declarator = initializer-clause
13367 type-specifier-seq declarator braced-init-list
13369 GNU Extension:
13371 condition:
13372 type-specifier-seq declarator asm-specification [opt]
13373 attributes [opt] = assignment-expression
13375 Returns the expression that should be tested. */
13377 static tree
13379 {
13380 cp_decl_specifier_seq type_specifiers;
13384 /* Try the declaration first. */
13386 /* New types are not allowed in the type-specifier-seq for a
13387 condition. */
13389 parser->type_definition_forbidden_message
13391 /* Parse the type-specifier-seq. */
13393 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
13396 /* Restore the saved message. */
13399 /* Gather the attributes that were provided with the
13400 decl-specifiers. */
13405 /* If all is well, we might be looking at a declaration. */
13407 {
13408 tree decl;
13409 tree asm_specification;
13410 tree attributes;
13415 /* Parse the declarator. */
13417 CP_PARSER_FLAGS_NONE,
13423 /* Parse the attributes. */
13425 /* Parse the asm-specification. */
13427 /* If the next token is not an `=' or '{', then we might still be
13428 looking at an expression. For example:
13430 if (A(a).x)
13432 looks like a decl-specifier-seq and a declarator -- but then
13433 there is no `=', so this is an expression. */
13438 /* If we did see an `=' or '{', then we are looking at a declaration
13439 for sure. */
13441 {
13442 tree pushed_scope;
13449 /* Create the declaration. */
13456 /* Parse the initializer. */
13458 {
13462 }
13464 {
13465 /* Consume the `='. */
13469 }
13470 else
13471 {
13474 }
13478 /* Process the initializer. */
13481 asm_specification,
13482 flags);
13488 }
13489 }
13490 /* If we didn't even get past the declarator successfully, we are
13491 definitely not looking at a declaration. */
13492 else
13495 /* Otherwise, we are looking at an expression. */
13497 }
13499 /* Parses a for-statement or range-for-statement until the closing ')',
13500 not included. */
13502 static tree
13504 {
13508 /* Begin the for-statement. */
13511 /* Maybe parse the optional init-statement in a range-based for loop. */
13513 /* Checked for diagnostic purposes only. */
13515 {
13516 tree dummy;
13519 {
13521 OPT_Wc__20_extensions,
13522 "range-based %<for%> loops with initializer only "
13525 }
13526 }
13528 /* Parse the initialization. */
13534 else
13536 }
13538 static tree
13541 {
13542 /* Normal for loop */
13545 tree stmt;
13548 /* The init-statement has already been parsed in
13549 cp_parser_init_statement, so no work is needed here. */
13552 /* If there's a condition, process it. */
13556 {
13560 }
13562 {
13566 }
13568 /* Look for the `;'. */
13571 /* If there's an expression, process it. */
13577 }
13579 /* Tries to parse a range-based for-statement:
13581 range-based-for:
13582 decl-specifier-seq declarator : expression
13584 The decl-specifier-seq declarator and the `:' are already parsed by
13585 cp_parser_init_statement. If processing_template_decl it returns a
13586 newly created RANGE_FOR_STMT; if not, it is converted to a
13587 regular FOR_STMT. */
13589 static tree
13592 {
13599 /* Get the range declaration momentarily out of the way so that
13600 the range expression doesn't clash with it. */
13602 {
13604 {
13606 /* For decomposition declaration get all of the corresponding
13607 declarations out of the way. */
13611 {
13617 {
13623 }
13624 }
13625 }
13627 {
13632 }
13633 }
13636 {
13639 }
13640 else
13643 /* Put the range declaration(s) back into scope. */
13645 {
13649 }
13651 /* finish_omp_for has its own code for the following, so just
13652 return the range_expr instead. */
13656 /* If in template, STMT is converted to a normal for-statement
13657 at instantiation. If not, it is done just ahead. */
13659 {
13669 /* do_auto_deduction doesn't mess with template init-lists. */
13672 decomp_cnt);
13673 }
13674 else
13675 {
13679 unroll);
13680 }
13682 }
13684 /* Subroutine of cp_convert_range_for: given the initializer expression,
13685 builds up the range temporary. */
13687 static tree
13689 {
13690 /* Find out the type deduced by the declaration
13691 `auto &&__range = range_expr'. */
13696 /* Create the __range variable. */
13703 }
13705 /* Used by cp_parser_range_for in template context: we aren't going to
13706 do a full conversion yet, but we still need to resolve auto in the
13707 type of the for-range-declaration if present. This is basically
13708 a shortcut version of cp_convert_range_for. */
13710 static void
13713 {
13716 {
13719 iter_type = (cp_parser_perform_range_for_lookup
13722 {
13724 iter_type);
13727 tf_warning_or_error);
13730 tf_warning_or_error,
13731 adc_variable_type);
13734 }
13735 }
13736 }
13738 /* Warns when the loop variable should be changed to a reference type to
13739 avoid unnecessary copying. I.e., from
13741 for (const auto x : range)
13743 where range returns a reference, to
13745 for (const auto &x : range)
13747 if this version doesn't make a copy.
13749 This function also warns when the loop variable is initialized with
13750 a value of a different type resulting in a copy:
13752 int arr[10];
13753 for (const double &x : arr)
13755 DECL is the RANGE_DECL; EXPR is the *__for_begin expression.
13756 This function is never called when processing_template_decl is on. */
13758 static void
13760 {
13772 {
13775 {
13776 auto_diagnostic_group d;
13778 "loop variable %qD of type %qT binds to a temporary "
13781 {
13783 TYPE_QUAL_CONST);
13788 }
13789 }
13791 }
13795 /* Since small trivially copyable types are cheap to copy, we suppress the
13796 warning for them. 64B is a common size of a cache line. */
13802 /* If we can initialize a reference directly, suggest that to avoid the
13803 copy. */
13806 {
13807 auto_diagnostic_group d;
13811 {
13815 }
13816 }
13817 }
13819 /* Converts a range-based for-statement into a normal
13820 for-statement, as per the definition.
13822 for (RANGE_DECL : RANGE_EXPR)
13823 BLOCK
13825 should be equivalent to:
13827 {
13828 auto &&__range = RANGE_EXPR;
13829 for (auto __begin = BEGIN_EXPR, __end = END_EXPR;
13830 __begin != __end;
13831 ++__begin)
13832 {
13833 RANGE_DECL = *__begin;
13834 BLOCK
13835 }
13836 }
13838 If RANGE_EXPR is an array:
13839 BEGIN_EXPR = __range
13840 END_EXPR = __range + ARRAY_SIZE(__range)
13841 Else if RANGE_EXPR has a member 'begin' or 'end':
13842 BEGIN_EXPR = __range.begin()
13843 END_EXPR = __range.end()
13844 Else:
13845 BEGIN_EXPR = begin(__range)
13846 END_EXPR = end(__range);
13848 If __range has a member 'begin' but not 'end', or vice versa, we must
13849 still use the second alternative (it will surely fail, however).
13850 When calling begin()/end() in the third alternative we must use
13851 argument dependent lookup, but always considering 'std' as an associated
13852 namespace. */
13854 tree
13858 {
13866 /* If an error happened previously do nothing or else a lot of
13867 unhelpful errors would be issued. */
13869 else
13870 {
13871 tree range_temp;
13875 /* Can't bind a reference to an array of runtime bound. */
13877 else
13878 {
13883 LOOKUP_ONLYCONVERTING);
13885 }
13888 }
13890 /* The new for initialization statement. */
13892 iter_type);
13898 LOOKUP_ONLYCONVERTING);
13908 LOOKUP_ONLYCONVERTING);
13912 /* The new for condition. */
13919 /* The new increment expression. */
13922 tf_warning_or_error);
13928 /* The declaration is initialized with *__begin inside the loop body. */
13933 LOOKUP_ONLYCONVERTING);
13940 }
13942 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
13943 We need to solve both at the same time because the method used
13944 depends on the existence of members begin or end.
13945 Returns the type deduced for the iterator expression. */
13947 static tree
13949 {
13951 {
13954 }
13957 {
13962 }
13964 {
13965 /* If RANGE is an array, we will use pointer arithmetic. */
13968 range,
13972 }
13973 else
13974 {
13975 /* If it is not an array, we must do a bit of magic. */
13985 tf_warning_or_error);
13988 tf_warning_or_error);
13991 {
13992 /* Use the member functions. */
13995 }
13996 else
13997 {
13998 /* Use global functions with ADL. */
13999 releasing_vec vec;
14004 tf_warning_or_error);
14006 tf_warning_or_error);
14008 tf_warning_or_error);
14010 tf_warning_or_error);
14011 }
14013 /* Last common checks. */
14015 {
14016 /* If one of the expressions is an error do no more checks. */
14019 }
14022 /* Can happen, when, eg, in a template context, Koenig lookup
14023 can't resolve begin/end (c++/58503). */
14025 else
14026 {
14028 /* The unqualified type of the __begin and __end temporaries should
14029 be the same, as required by the multiple auto declaration. */
14031 {
14038 /* P0184R0 allows __begin and __end to have different types,
14039 but make sure they are comparable so we can give a better
14041 else
14045 }
14047 }
14048 }
14049 }
14051 /* Helper function for cp_parser_perform_range_for_lookup.
14052 Builds a tree for RANGE.IDENTIFIER(). */
14054 static tree
14056 {
14064 releasing_vec vec;
14068 tf_warning_or_error);
14070 }
14072 /* Parse an iteration-statement.
14074 iteration-statement:
14075 while ( condition ) statement
14076 do statement while ( expression ) ;
14077 for ( init-statement condition [opt] ; expression [opt] )
14078 statement
14080 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
14082 static tree
14085 {
14088 tree statement;
14090 token_indent_info guard_tinfo;
14092 /* Peek at the next token. */
14099 /* Remember whether or not we are already within an iteration
14100 statement. */
14103 /* See what kind of keyword it is. */
14106 {
14108 {
14109 tree condition;
14111 /* Begin the while-statement. */
14113 /* Look for the `('. */
14114 matching_parens parens;
14116 /* Parse the condition. */
14119 /* Look for the `)'. */
14121 /* Parse the dependent statement. */
14127 /* We're done with the while-statement. */
14129 }
14133 {
14134 tree expression;
14136 /* Begin the do-statement. */
14138 /* Parse the body of the do-statement. */
14145 /* Look for the `while' keyword. */
14147 /* Look for the `('. */
14148 matching_parens parens;
14150 /* Parse the expression. */
14152 /* We're done with the do-statement. */
14154 /* Look for the `)'. */
14156 /* Look for the `;'. */
14158 }
14162 {
14163 /* Look for the `('. */
14164 matching_parens parens;
14169 /* Look for the `)'. */
14172 /* Parse the body of the for-statement. */
14179 /* We're done with the for-statement. */
14181 }
14188 }
14191 }
14193 /* Parse an init-statement or the declarator of a range-based-for.
14194 Returns true if a range-based-for declaration is seen.
14196 init-statement:
14197 expression-statement
14198 simple-declaration
14199 alias-declaration */
14201 static bool
14203 {
14204 /* If the next token is a `;', then we have an empty
14205 expression-statement. Grammatically, this is also a
14206 simple-declaration, but an invalid one, because it does not
14207 declare anything. Therefore, if we did not handle this case
14208 specially, we would issue an error message about an invalid
14209 declaration. */
14211 {
14215 /* A colon is used in range-based for. */
14218 /* We're going to speculatively look for a declaration, falling back
14219 to an expression, if necessary. */
14223 {
14229 OPT_Wc__23_extensions,
14230 "alias-declaration in init-statement only "
14232 }
14233 else
14234 /* Parse the declaration. */
14237 decl);
14240 {
14241 /* It is a range-for, consume the ':'. */
14246 OPT_Wc__11_extensions,
14247 "range-based %<for%> loops only available with "
14249 }
14251 /* The ';' is not consumed yet because we told
14252 cp_parser_simple_declaration not to. */
14257 /* If the tentative parse failed, then we shall need to look for an
14258 expression-statement. */
14259 }
14260 /* If we are here, it is an expression-statement. */
14263 }
14265 /* Parse a jump-statement.
14267 jump-statement:
14268 break ;
14269 continue ;
14270 return expression [opt] ;
14271 return braced-init-list ;
14272 coroutine-return-statement;
14273 goto identifier ;
14275 GNU extension:
14277 jump-statement:
14278 goto * expression ;
14280 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
14282 static tree
14284 {
14290 /* Peek at the next token. */
14295 /* See what kind of keyword it is. */
14298 {
14302 {
14319 }
14325 {
14329 /* Fall through. */
14339 }
14345 {
14346 tree expr;
14350 {
14354 }
14357 else
14358 /* If the next token is a `;', then there is no
14359 expression. */
14361 /* Build the return-statement, check co-return first, since type
14362 deduction is not valid there. */
14367 else
14369 /* Look for the final `;'. */
14371 }
14378 {
14382 }
14384 /* Create the goto-statement. */
14386 {
14387 /* Issue a warning about this use of a GNU extension. */
14389 /* Consume the '*' token. */
14391 /* Parse the dependent expression. */
14393 }
14394 else
14396 /* Look for the final `;'. */
14403 }
14406 }
14408 /* Parse a declaration-statement.
14410 declaration-statement:
14411 block-declaration */
14413 static void
14415 {
14418 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
14421 /* Parse the block-declaration. */
14424 /* Free any declarators allocated. */
14426 }
14428 /* Some dependent statements (like `if (cond) statement'), are
14429 implicitly in their own scope. In other words, if the statement is
14430 a single statement (as opposed to a compound-statement), it is
14431 none-the-less treated as if it were enclosed in braces. Any
14432 declarations appearing in the dependent statement are out of scope
14433 after control passes that point. This function parses a statement,
14434 but ensures that is in its own scope, even if it is not a
14435 compound-statement.
14437 If IF_P is not NULL, *IF_P is set to indicate whether the statement
14438 is a (possibly labeled) if statement which is not enclosed in
14439 braces and has an else clause. This is used to implement
14440 -Wparentheses.
14442 CHAIN is a vector of if-else-if conditions. This is used to implement
14443 -Wduplicated-cond.
14445 Returns the new statement. */
14447 static tree
14451 {
14452 tree statement;
14455 token_indent_info body_tinfo
14461 /* Mark if () ; with a special NOP_EXPR. */
14463 {
14474 }
14475 /* if a compound is opened, we simply parse the statement directly. */
14478 /* If the token is not a `{', then we must take special action. */
14479 else
14480 {
14481 /* Create a compound-statement. */
14483 /* Parse the dependent-statement. */
14486 /* Finish the dummy compound-statement. */
14488 }
14490 token_indent_info next_tinfo
14499 /* Return the statement. */
14501 }
14503 /* For some dependent statements (like `while (cond) statement'), we
14504 have already created a scope. Therefore, even if the dependent
14505 statement is a compound-statement, we do not want to create another
14506 scope. */
14508 static void
14511 {
14512 /* If the token is a `{', then we must take special action. */
14514 {
14515 token_indent_info body_tinfo
14521 token_indent_info next_tinfo
14530 }
14531 else
14532 {
14533 /* Avoid calling cp_parser_compound_statement, so that we
14534 don't create a new scope. Do everything else by hand. */
14535 matching_braces braces;
14537 /* If the next keyword is `__label__' we have a label declaration. */
14540 /* Parse an (optional) statement-seq. */
14543 }
14544 }
14546 /* Modules */
14548 /* Parse a module-name,
14549 identifier
14550 module-name . identifier
14551 header-name
14553 Returns a pointer to module object, NULL. */
14557 {
14560 {
14564 }
14569 {
14572 }
14575 {
14577 {
14580 }
14591 }
14594 }
14596 /* Named module-declaration
14597 __module ; PRAGMA_EOL
14598 __module private ; PRAGMA_EOL (unimplemented)
14599 [__export] __module module-name attr-spec-seq-opt ; PRAGMA_EOL
14600 */
14602 static module_parse
14605 {
14606 /* We're a pseudo pragma. */
14611 {
14615 }
14618 {
14619 /* Start global module fragment. */
14624 }
14629 {
14637 {
14640 }
14641 else
14643 "private module fragment only permitted in purview"
14645 }
14647 {
14648 /* Neither the first declaration, nor in a GMF. */
14651 skip_eol:
14653 }
14654 else
14655 {
14665 }
14668 }
14670 /* Import-declaration
14671 [__export] __import module-name attr-spec-seq-opt ; PRAGMA_EOL */
14673 static void
14676 {
14677 /* We're a pseudo pragma. */
14682 {
14685 note_lexer:
14687 " disambiguation, to prevent this being considered a"
14689 skip_eol:
14691 }
14693 {
14696 }
14697 else
14698 {
14711 {
14712 /* Module-purview imports must not be from source inclusion
14713 [cpp.import]/7 */
14722 }
14725 }
14726 }
14728 /* export-declaration.
14730 export declaration
14731 export { declaration-seq-opt } */
14733 static void
14735 {
14754 {
14761 }
14762 else
14763 {
14764 /* Explicitly check if the next tokens might be a
14765 module-directive line, so we can give a clearer error message
14766 about why the directive will be rejected. */
14773 }
14776 }
14778 /* Declarations [gram.dcl.dcl] */
14780 /* Parse an optional declaration-sequence. TOP_LEVEL is true, if this
14781 is the top-level declaration sequence. That affects whether we
14782 deal with module-preamble.
14784 declaration-seq:
14785 declaration
14786 declaration-seq declaration */
14788 static void
14790 {
14792 {
14798 else
14800 }
14801 }
14803 /* Parse a declaration.
14805 declaration:
14806 block-declaration
14807 function-definition
14808 template-declaration
14809 explicit-instantiation
14810 explicit-specialization
14811 linkage-specification
14812 namespace-definition
14814 C++17:
14815 deduction-guide
14817 modules:
14818 (all these are only allowed at the outermost level, check
14819 that semantically, for better diagnostics)
14820 module-declaration
14821 module-export-declaration
14822 module-import-declaration
14823 export-declaration
14825 GNU extension:
14827 declaration:
14828 __extension__ declaration */
14830 static void
14832 {
14835 /* Check for the `__extension__' keyword. */
14837 {
14838 /* Parse the qualified declaration. */
14840 /* Restore the PEDANTIC flag. */
14844 }
14846 /* Try to figure out what kind of declaration is present. */
14852 {
14854 /* A declaration consisting of a single semicolon is invalid
14855 * before C++11. Allow it unless we're being pedantic. */
14859 }
14863 CPP_SEMICOLON))
14864 {
14869 {
14872 std_attrs);
14874 {
14877 {
14879 CPP_PRAGMA));
14881 }
14883 }
14884 }
14892 }
14894 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
14899 /* Conditionally, allow attributes to precede a linkage specification. */
14901 {
14909 {
14911 /* We might have already been here. */
14913 {
14921 }
14924 }
14925 else
14926 {
14929 }
14930 }
14931 /* If we already had some attributes, and we've added more, then prepend.
14932 Otherwise attributes just contains any that we just read. */
14934 {
14938 }
14940 /* If the next token is `extern' and the following token is a string
14941 literal, then we have a linkage specification. */
14945 /* If the next token is `template', then we have either a template
14946 declaration, an explicit instantiation, or an explicit
14947 specialization. */
14949 {
14950 /* `template <>' indicates a template specialization. */
14954 /* `template <' indicates a template declaration. */
14957 /* Anything else must be an explicit instantiation. */
14958 else
14960 }
14961 /* If the next token is `export', it's new-style modules or
14962 old-style template. */
14964 {
14967 else
14969 }
14971 {
14976 // In module purview this will be ill-formed.
14982 else
14984 }
14985 /* If the next token is `extern', 'static' or 'inline' and the one
14986 after that is `template', we have a GNU extended explicit
14987 instantiation directive. */
14994 /* If the next token is `namespace', check for a named or unnamed
14995 namespace definition. */
15004 /* An unnamed namespace definition. */
15008 /* An inline (associated) namespace definition. */
15012 /* Objective-C++ declaration/definition. */
15019 /* At this point we may have a template declared by a concept
15020 introduction. */
15025 else
15026 /* Try to parse a block-declaration, or a function-definition. */
15029 /* Free any declarators allocated. */
15031 }
15033 /* Parse a namespace-scope declaration. */
15035 static void
15037 {
15041 /* A top-level declaration can consist solely of a #pragma. A
15042 nested declaration cannot, so this is done here and not in
15043 cp_parser_declaration. (A #pragma at block scope is
15044 handled in cp_parser_statement.) */
15046 else
15047 /* Parse the declaration itself. */
15049 }
15051 /* Parse a block-declaration.
15053 block-declaration:
15054 simple-declaration
15055 asm-definition
15056 namespace-alias-definition
15057 using-declaration
15058 using-directive
15060 GNU Extension:
15062 block-declaration:
15063 __extension__ block-declaration
15065 C++0x Extension:
15067 block-declaration:
15068 static_assert-declaration
15070 If STATEMENT_P is TRUE, then this block-declaration is occurring as
15071 part of a declaration-statement. */
15073 static void
15076 {
15079 /* Check for the `__extension__' keyword. */
15081 {
15082 /* Parse the qualified declaration. */
15084 /* Restore the PEDANTIC flag. */
15088 }
15090 /* Peek at the next token to figure out which kind of declaration is
15091 present. */
15095 /* If the next keyword is `asm', we have an asm-definition. */
15097 {
15101 }
15102 /* If the next keyword is `namespace', we have a
15103 namespace-alias-definition. */
15106 /* If the next keyword is `using', we have a
15107 using-declaration, a using-directive, or an alias-declaration. */
15109 {
15114 /* If the token after `using' is `namespace', then we have a
15115 using-directive. */
15121 /* If the second token after 'using' is '=', then we have an
15122 alias-declaration. */
15128 /* Otherwise, it's a using-declaration. */
15129 else
15132 }
15133 /* If the next keyword is `__label__' we have a misplaced label
15134 declaration. */
15136 {
15140 /* If the next token is now a `;', consume it. */
15143 }
15144 /* If the next token is `static_assert' we have a static assertion. */
15147 /* If the next tokens after attributes is `using namespace', then we have
15148 a using-directive. */
15151 RID_USING)
15153 RID_NAMESPACE))
15154 {
15158 }
15159 /* Anything else must be a simple-declaration. */
15160 else
15163 }
15165 /* Parse a simple-declaration.
15167 simple-declaration:
15168 decl-specifier-seq [opt] init-declarator-list [opt] ;
15169 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
15170 brace-or-equal-initializer ;
15172 init-declarator-list:
15173 init-declarator
15174 init-declarator-list , init-declarator
15176 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
15177 function-definition as a simple-declaration.
15179 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15180 parsed declaration if it is an uninitialized single declarator not followed
15181 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15182 if present, will not be consumed. */
15184 static void
15188 {
15189 cp_decl_specifier_seq decl_specifiers;
15198 /* Defer access checks until we know what is being declared; the
15199 checks for names appearing in the decl-specifier-seq should be
15200 done as if we were in the scope of the thing being declared. */
15203 /* Parse the decl-specifier-seq. We have to keep track of whether
15204 or not the decl-specifier-seq declares a named class or
15205 enumeration type, since that is the only case in which the
15206 init-declarator-list is allowed to be empty.
15208 [dcl.dcl]
15210 In a simple-declaration, the optional init-declarator-list can be
15211 omitted only when declaring a class or enumeration, that is when
15212 the decl-specifier-seq contains either a class-specifier, an
15213 elaborated-type-specifier, or an enum-specifier. */
15215 CP_PARSER_FLAGS_OPTIONAL,
15218 /* We no longer need to defer access checks. */
15221 cp_omp_declare_simd_data odsd;
15227 /* In a block scope, a valid declaration must always have a
15228 decl-specifier-seq. By not trying to parse declarators, we can
15229 resolve the declaration/expression ambiguity more quickly. */
15232 {
15235 }
15237 /* If the next two tokens are both identifiers, the code is
15238 erroneous. The usual cause of this situation is code like:
15240 T t;
15242 where "T" should name a type -- but does not. */
15245 {
15246 /* If parsing tentatively, we should commit; we really are
15247 looking at a declaration. */
15249 /* Give up. */
15251 }
15255 /* Look for C++17 decomposition declaration. */
15263 {
15264 tree decl
15266 maybe_range_for_decl,
15269 /* The next token should be either a `,' or a `;'. */
15271 /* If it's a `;', we are done. */
15275 {
15279 }
15280 /* Anything else is an error. */
15281 else
15282 {
15283 /* If we have already issued an error message we don't need
15284 to issue another one. */
15289 /* Skip tokens until we reach the end of the statement. */
15291 /* If the next token is now a `;', consume it. */
15295 }
15296 }
15297 else
15300 tree last_type;
15302 /* NULL_TREE if both variable and function declaration are allowed,
15303 error_mark_node if function declaration are not allowed and
15304 a FUNCTION_DECL that should be diagnosed if it is followed by
15305 variable declarations. */
15306 tree auto_function_declaration;
15309 auto_specifier_p
15313 /* Keep going until we hit the `;' at the end of the simple
15314 declaration. */
15317 CPP_SEMICOLON))
15318 {
15321 tree decl;
15325 {
15326 /* If we are processing next declarator, comma is expected */
15331 {
15335 }
15336 }
15337 else
15340 /* Parse the init-declarator. */
15342 CP_PARSER_FLAGS_NONE,
15345 function_definition_allowed_p,
15347 declares_class_or_enum,
15349 maybe_range_for_decl,
15352 /* If an error occurred while parsing tentatively, exit quickly.
15353 (That usually happens when in the body of a function; each
15354 statement is treated as a declaration-statement until proven
15355 otherwise.) */
15360 {
15361 /* If the init-declarator-list contains more than one
15362 init-declarator, they shall all form declarations of
15363 variables. */
15365 auto_function_declaration
15369 {
15371 "non-variable %qD in declaration with more than one "
15376 }
15377 }
15381 {
15385 {
15386 /* If the list of declarators contains more than one declarator,
15387 the type of each declared variable is determined as described
15388 above. If the type deduced for the template parameter U is not
15389 the same in each deduction, the program is ill-formed. */
15394 }
15395 else
15397 }
15399 /* Handle function definitions specially. */
15401 {
15402 /* If the next token is a `,', then we are probably
15403 processing something like:
15405 void f() {}, *p;
15407 which is erroneous. */
15409 {
15412 "mixing"
15414 }
15415 /* Otherwise, we're done with the list of declarators. */
15416 else
15417 {
15421 }
15422 }
15425 /* The next token should be either a `,' or a `;'. */
15427 /* If it's a `,', there are more declarators to come. */
15430 /* If it's a `;', we are done. */
15434 {
15439 }
15440 /* Anything else is an error. */
15441 else
15442 {
15443 /* If we have already issued an error message we don't need
15444 to issue another one. */
15449 /* Skip tokens until we reach the end of the statement. */
15451 /* If the next token is now a `;', consume it. */
15455 }
15456 /* After the first time around, a function-definition is not
15457 allowed -- even if it was OK at first. For example:
15459 int i, f() {}
15461 is not valid. */
15463 }
15465 /* Issue an error message if no declarators are present, and the
15466 decl-specifier-seq does not itself declare a class or
15467 enumeration: [dcl.dcl]/3. */
15469 {
15471 {
15475 /* Ensure an error is issued anyway when finish_decltype_type,
15476 called via cp_parser_decl_specifier_seq, returns a class or
15477 an enumeration (c++/51786). */
15480 }
15481 /* Perform any deferred access checks. */
15483 }
15485 /* Consume the `;'. */
15486 finish:
15490 {
15496 }
15498 done:
15501 }
15503 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
15504 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
15505 initializer ; */
15507 static tree
15512 {
15517 /* Parse the identifier-list. */
15521 {
15529 }
15533 {
15539 else
15540 {
15543 }
15544 }
15548 "structured bindings only available with "
15551 tree pushed_scope;
15558 NULL_TREE);
15565 cp_expr e;
15566 cp_decl_specifier_seq decl_specs;
15571 {
15575 else
15576 {
15579 }
15580 tree elt_pushed_scope;
15586 {
15587 /* Ensure we've diagnosed redeclaration if we aren't creating
15588 a new VAR_DECL. */
15591 }
15592 else
15596 }
15599 {
15602 }
15606 {
15614 || (is_direct_init
15617 {
15621 }
15624 {
15629 }
15630 }
15632 {
15634 /* Ensure DECL_VALUE_EXPR is created for all the decls but
15635 the underlying DECL. */
15637 }
15643 {
15646 }
15649 }
15651 /* Names of storage classes. */
15654 cp_storage_class_name[] = {
15656 };
15658 /* Parse a decl-specifier-seq.
15660 decl-specifier-seq:
15661 decl-specifier-seq [opt] decl-specifier
15662 decl-specifier attribute-specifier-seq [opt] (C++11)
15664 decl-specifier:
15665 storage-class-specifier
15666 type-specifier
15667 function-specifier
15668 friend
15669 typedef
15671 GNU Extension:
15673 decl-specifier:
15674 attributes
15676 Concepts Extension:
15678 decl-specifier:
15679 concept
15681 Set *DECL_SPECS to a representation of the decl-specifier-seq.
15683 The parser flags FLAGS is used to control type-specifier parsing.
15685 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
15686 flags:
15688 1: one of the decl-specifiers is an elaborated-type-specifier
15689 (i.e., a type declaration)
15690 2: one of the decl-specifiers is an enum-specifier or a
15691 class-specifier (i.e., a type definition)
15693 */
15695 static void
15697 cp_parser_flags flags,
15700 {
15704 cp_decl_spec ds;
15706 /* Clear DECL_SPECS. */
15709 /* Assume no class or enumeration type is declared. */
15712 /* Keep reading specifiers until there are no more to read. */
15714 {
15719 /* Peek at the next token. */
15722 /* Save the first token of the decl spec list for error
15723 reporting. */
15726 /* Handle attributes. */
15729 {
15730 /* Parse the attributes. */
15733 /* In a sequence of declaration specifiers, c++11 attributes
15734 appertain to the type that precede them. In that case
15735 [dcl.spec]/1 says:
15737 The attribute-specifier-seq affects the type only for
15738 the declaration it appears in, not other declarations
15739 involving the same type.
15741 But for now let's force the user to position the
15742 attribute either at the beginning of the declaration or
15743 after the declarator-id, which would clearly mean that it
15744 applies to the declarator. */
15746 {
15748 /* The c++11 attribute is at the beginning of the
15749 declaration. It appertains to the entity being
15751 else
15752 {
15754 {
15757 }
15759 {
15760 /* This is an attribute following a
15761 class-specifier. */
15766 }
15767 else
15768 {
15769 decl_specs->std_attributes
15773 }
15775 }
15776 }
15778 decl_specs->attributes
15783 }
15784 /* Assume we will find a decl-specifier keyword. */
15786 /* If the next token is an appropriate keyword, we can simply
15787 add it to the list. */
15789 {
15790 /* decl-specifier:
15791 friend
15792 constexpr
15793 constinit */
15796 {
15801 }
15802 else
15803 {
15805 /* Consume the token. */
15807 }
15832 /* Warn for concept as a decl-specifier. We'll rewrite these as
15833 concept declarations later. */
15835 {
15840 else
15843 }
15845 /* In C++20 a concept definition is just 'concept name = expr;'
15846 Support that syntax as a TS extension by pretending we've seen
15847 the 'bool' specifier. */
15851 {
15855 }
15858 /* function-specifier:
15859 inline
15860 virtual
15861 explicit */
15868 /* decl-specifier:
15869 typedef */
15872 /* Consume the token. */
15878 /* A constructor declarator cannot appear in a typedef. */
15880 /* The "typedef" keyword can only occur in a declaration; we
15881 may as well commit at this point. */
15885 {
15895 }
15898 /* storage-class-specifier:
15899 auto
15900 register
15901 static
15902 extern
15903 mutable
15905 GNU Extension:
15906 thread */
15909 {
15910 /* Consume the token. */
15913 /* Complain about `auto' as a storage specifier, if
15914 we're complaining about C++0x compatibility. */
15918 "%<auto%> changes meaning in C++11; "
15921 /* Set the storage class anyway. */
15923 token);
15924 }
15925 else
15926 /* C++0x auto type-specifier. */
15934 /* Consume the token. */
15937 token);
15940 /* Consume the token. */
15946 /* We did not yet find a decl-specifier yet. */
15949 }
15961 {
15967 "%qD only valid in lambda with %<-std=c++23%> or "
15969 }
15974 /* Constructors are a special case. The `S' in `S()' is not a
15975 decl-specifier; it is the beginning of the declarator. */
15976 constructor_p
15977 = (!found_decl_spec
15978 && constructor_possible_p
15979 && (cp_parser_constructor_declarator_p
15981 ds_friend))));
15983 /* If we don't have a DECL_SPEC yet, then we must be looking at
15984 a type-specifier. */
15986 {
15989 tree type_spec;
15994 type_spec
15996 decl_specs,
16002 /* If this type-specifier referenced a user-defined type
16003 (a typedef, class-name, etc.), then we can't allow any
16004 more such type-specifiers henceforth.
16006 [dcl.spec]
16008 The longest sequence of decl-specifiers that could
16009 possibly be a type name is taken as the
16010 decl-specifier-seq of a declaration. The sequence shall
16011 be self-consistent as described below.
16013 [dcl.type]
16015 As a general rule, at most one type-specifier is allowed
16016 in the complete decl-specifier-seq of a declaration. The
16017 only exceptions are the following:
16019 -- const or volatile can be combined with any other
16020 type-specifier.
16022 -- signed or unsigned can be combined with char, long,
16023 short, or int.
16025 -- ..
16027 Example:
16029 typedef char* Pc;
16030 void g (const int Pc);
16032 Here, Pc is *not* part of the decl-specifier seq; it's
16033 the declarator. Therefore, once we see a type-specifier
16034 (other than a cv-qualifier), we forbid any additional
16035 user-defined types. We *do* still allow things like `int
16036 int' to be considered a decl-specifier-seq, and issue the
16037 error message later. */
16040 /* A constructor declarator cannot follow a type-specifier. */
16042 {
16050 }
16051 }
16053 /* If we still do not have a DECL_SPEC, then there are no more
16054 decl-specifiers. */
16059 {
16063 "standard attributes must precede the decl-specifiers to "
16064 "apply to the declaration, or follow them to apply to "
16066 }
16069 /* After we see one decl-specifier, further decl-specifiers are
16070 always optional. */
16072 }
16074 /* Don't allow a friend specifier with a class definition. */
16079 }
16081 /* Parse an (optional) storage-class-specifier.
16083 storage-class-specifier:
16084 auto
16085 register
16086 static
16087 extern
16088 mutable
16090 GNU Extension:
16092 storage-class-specifier:
16093 thread
16095 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
16097 static tree
16099 {
16101 {
16105 /* Fall through for C++98. */
16113 /* Consume the token. */
16118 }
16119 }
16121 /* Parse an (optional) function-specifier.
16123 function-specifier:
16124 inline
16125 virtual
16126 explicit
16128 C++20 Extension:
16129 explicit(constant-expression)
16131 Returns an IDENTIFIER_NODE corresponding to the keyword used.
16132 Updates DECL_SPECS, if it is non-NULL. */
16134 static tree
16137 {
16140 {
16146 /* 14.5.2.3 [temp.mem]
16148 A member function template shall not be virtual. */
16152 else
16157 {
16159 /* If we see '(', it's C++20 explicit(bool). */
16160 tree expr;
16162 {
16163 matching_parens parens;
16166 /* New types are not allowed in an explicit-specifier. */
16169 parser->type_definition_forbidden_message
16174 "%<explicit(bool)%> only available with %<-std=c++20%> "
16177 /* Parse the constant-expression. */
16180 /* Restore the saved message. */
16183 }
16184 else
16185 /* The explicit-specifier explicit without a constant-expression is
16186 equivalent to the explicit-specifier explicit(true). */
16189 /* [dcl.fct.spec]
16190 "the constant-expression, if supplied, shall be a contextually
16191 converted constant expression of type bool." */
16193 /* We could evaluate it -- mark the decl as appropriate. */
16199 /* The expression was value-dependent. Remember it so that we can
16200 substitute it later. */
16203 }
16207 }
16209 /* Consume the token. */
16211 }
16213 /* Parse a linkage-specification.
16215 linkage-specification:
16216 extern string-literal { declaration-seq [opt] }
16217 extern string-literal declaration */
16219 static void
16221 {
16222 tree linkage;
16224 /* Look for the `extern' keyword. */
16225 cp_token *extern_token
16228 /* Look for the string-literal. */
16232 /* Transform the literal into an identifier. If the literal is a
16233 wide-character string, or contains embedded NULs, then we can't
16234 handle it as the user wants. */
16238 {
16240 /* Assume C++ linkage. */
16242 }
16243 else
16246 /* We're now using the new linkage. */
16251 /* Preserve the location of the innermost linkage specification,
16252 tracking the locations of nested specifications via a local. */
16253 location_t saved_location
16255 /* Construct a location ranging from the start of the "extern" to
16256 the end of the string-literal, with the caret at the start, e.g.:
16257 extern "C" {
16258 ^~~~~~~~~~
16259 */
16260 parser->innermost_linkage_specification_location
16265 /* If the next token is a `{', then we're using the first
16266 production. */
16268 {
16272 /* Consume the `{' token. */
16273 matching_braces braces;
16275 /* Parse the declarations. */
16277 /* Look for the closing `}'. */
16279 }
16280 /* Otherwise, there's just one declaration. */
16281 else
16282 {
16285 saved_in_unbraced_linkage_specification_p
16289 parser->in_unbraced_linkage_specification_p
16291 }
16293 /* We're done with the linkage-specification. */
16297 /* Restore location of parent linkage specification, if any. */
16299 }
16301 /* Parse a static_assert-declaration.
16303 static_assert-declaration:
16304 static_assert ( constant-expression , string-literal ) ;
16305 static_assert ( constant-expression ) ; (C++17)
16307 If MEMBER_P, this static_assert is a class member. */
16309 static void
16311 {
16312 cp_expr condition;
16313 location_t token_loc;
16314 tree message;
16317 /* Peek at the `static_assert' token so we can keep track of exactly
16318 where the static assertion started. */
16321 /* Look for the `static_assert' keyword. */
16323 RT_STATIC_ASSERT))
16326 /* We know we are in a static assertion; commit to any tentative
16327 parse. */
16331 /* Parse the `(' starting the static assertion condition. */
16332 matching_parens parens;
16335 /* Parse the constant-expression. Allow a non-constant expression
16336 here in order to give better diagnostics in finish_static_assert. */
16337 condition =
16343 {
16346 "%<static_assert%> without a message "
16348 /* Eat the ')' */
16353 }
16354 else
16355 {
16356 /* Parse the separating `,'. */
16359 /* Parse the string-literal message. */
16364 /* A `)' completes the static assertion. */
16370 }
16372 /* A semicolon terminates the declaration. */
16375 /* Get the location for the static assertion. Use that of the
16376 condition if available, otherwise, use that of the "static_assert"
16377 token. */
16382 /* Complete the static assertion, which may mean either processing
16383 the static assert now or saving it for template instantiation. */
16386 }
16388 /* Parse the expression in decltype ( expression ). */
16390 static tree
16393 {
16395 tree expr;
16397 /* First, try parsing an id-expression. */
16408 {
16411 cp_id_kind idk;
16415 /* Lookup the name we got back from the id-expression. */
16420 /* A template without args is not a complete id-expression. */
16429 {
16430 /* Complete lookup of the id-expression. */
16431 expr = (finish_id_expression
16444 /* We found an id-expression, but it was something that we
16445 should not have found. This is an error, not something
16446 we can recover from, so note that we found an
16447 id-expression and we'll recover as gracefully as
16448 possible. */
16450 }
16455 /* We have an id-expression. */
16457 }
16460 {
16461 /* Abort the id-expression parse. */
16464 /* Parsing tentatively, again. */
16467 /* Parse a class member access. */
16475 /* We have an id-expression. */
16477 }
16480 /* We have parsed the complete id-expression or member access. */
16482 else
16483 {
16484 /* Abort our attempt to parse an id-expression or member access
16485 expression. */
16488 /* Parse a full expression. */
16491 }
16494 }
16496 /* Parse a `decltype' type. Returns the type.
16498 decltype-specifier:
16499 decltype ( expression )
16500 C++14:
16501 decltype ( auto ) */
16503 static tree
16505 {
16510 {
16511 /* Already parsed. */
16514 }
16516 /* Look for the `decltype' token. */
16520 /* Parse the opening `('. */
16521 matching_parens parens;
16525 /* Since we're going to preserve any side-effects from this parse, set up a
16526 firewall to protect our callers from cp_parser_commit_to_tentative_parse
16527 in the expression. */
16530 /* If in_declarator_p, a reparse as an expression might succeed (60361).
16531 Otherwise, commit now for better diagnostics. */
16542 {
16543 /* decltype (auto) */
16546 {
16548 "%<decltype(auto)%> type specifier only available with "
16551 }
16552 }
16553 else
16554 {
16555 /* decltype (expression) */
16557 /* Types cannot be defined in a `decltype' expression. Save away the
16558 old message and set the new one. */
16560 parser->type_definition_forbidden_message
16563 /* The restrictions on constant-expressions do not apply inside
16564 decltype expressions. */
16565 bool saved_integral_constant_expression_p
16567 bool saved_non_integral_constant_expression_p
16571 /* Within a parenthesized expression, a `>' token is always
16572 the greater-than operator. */
16573 bool saved_greater_than_is_operator_p
16577 /* Don't synthesize an implicit template type parameter here. This
16578 could happen with C++23 code like
16580 void f(decltype(new auto{0}));
16582 where we want to deduce the auto right away so that the parameter
16583 is of type 'int *'. */
16587 /* Do not actually evaluate the expression. */
16590 /* Do not warn about problems with the expression. */
16596 /* Go back to evaluating expressions. */
16600 /* The `>' token might be the end of a template-id or
16601 template-parameter-list now. */
16602 parser->greater_than_is_operator_p
16605 /* Restore the old message and the integral constant expression
16606 flags. */
16608 parser->integral_constant_expression_p
16610 parser->non_integral_constant_expression_p
16612 }
16614 /* Parse to the closing `)'. */
16616 {
16620 }
16622 /* If we got a parse error while tentative, bail out now. */
16624 {
16627 }
16630 /* Build auto. */
16632 else
16634 tf_warning_or_error);
16636 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
16637 it again. */
16654 }
16656 /* Special member functions [gram.special] */
16658 /* Parse a conversion-function-id.
16660 conversion-function-id:
16661 operator conversion-type-id
16663 Returns an IDENTIFIER_NODE representing the operator. */
16665 static tree
16667 {
16668 tree type;
16669 tree saved_scope;
16670 tree saved_qualifying_scope;
16671 tree saved_object_scope;
16674 /* Look for the `operator' token. */
16677 /* When we parse the conversion-type-id, the current scope will be
16678 reset. However, we need that information in able to look up the
16679 conversion function later, so we save it here. */
16683 /* We must enter the scope of the class so that the names of
16684 entities declared within the class are available in the
16685 conversion-type-id. For example, consider:
16687 struct S {
16688 typedef int I;
16689 operator I();
16690 };
16692 S::operator I() { ... }
16694 In order to see that `I' is a type-name in the definition, we
16695 must be in the scope of `S'. */
16698 /* Parse the conversion-type-id. */
16700 /* Leave the scope of the class, if any. */
16703 /* Restore the saved scope. */
16707 /* If the TYPE is invalid, indicate failure. */
16711 }
16713 /* Parse a conversion-type-id:
16715 conversion-type-id:
16716 type-specifier-seq conversion-declarator [opt]
16718 Returns the TYPE specified. */
16720 static tree
16722 {
16723 tree attributes;
16724 cp_decl_specifier_seq type_specifiers;
16726 tree type_specified;
16729 /* Parse the attributes. */
16733 parser->type_definition_forbidden_message
16736 /* Parse the type-specifiers. DR 2413 clarifies that `typename' is
16737 optional in conversion-type-id. */
16745 /* If that didn't work, stop. */
16748 /* Parse the conversion-declarator. */
16756 /* Don't give this error when parsing tentatively. This happens to
16757 work because we always parse this definitively once. */
16760 {
16762 {
16765 }
16769 }
16772 }
16774 /* Parse an (optional) conversion-declarator.
16776 conversion-declarator:
16777 ptr-operator conversion-declarator [opt]
16779 */
16783 {
16786 cp_cv_quals cv_quals;
16788 /* We don't know if there's a ptr-operator next, or not. */
16790 /* Try the ptr-operator. */
16793 /* If it worked, look for more conversion-declarators. */
16795 {
16798 /* Parse another optional declarator. */
16801 declarator = cp_parser_make_indirect_declarator
16805 }
16808 }
16810 /* Parse an (optional) ctor-initializer.
16812 ctor-initializer:
16813 : mem-initializer-list */
16815 static void
16817 {
16818 /* If the next token is not a `:', then there is no
16819 ctor-initializer. */
16821 {
16822 /* Do default initialization of any bases and members. */
16826 }
16828 /* Consume the `:' token. */
16830 /* And the mem-initializer-list. */
16832 }
16834 /* Parse a mem-initializer-list.
16836 mem-initializer-list:
16837 mem-initializer ... [opt]
16838 mem-initializer ... [opt] , mem-initializer-list */
16840 static void
16842 {
16847 /* Let the semantic analysis code know that we are starting the
16848 mem-initializer-list. */
16853 /* Loop through the list. */
16855 {
16856 tree mem_initializer;
16859 /* Parse the mem-initializer. */
16861 /* If the next token is a `...', we're expanding member initializers. */
16867 {
16868 /* Consume the `...'. */
16872 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
16873 can be expanded but members cannot. */
16876 {
16881 }
16883 /* Construct the pack expansion type. */
16886 }
16889 {
16893 }
16894 /* Look for a target constructor. */
16898 {
16901 {
16905 }
16907 }
16908 /* Add it to the list, unless it was erroneous. */
16910 {
16913 }
16914 /* If the next token is not a `,', we're done. */
16917 /* Consume the `,' token. */
16919 }
16921 /* Perform semantic analysis. */
16924 }
16926 /* Parse a mem-initializer.
16928 mem-initializer:
16929 mem-initializer-id ( expression-list [opt] )
16930 mem-initializer-id braced-init-list
16932 GNU extension:
16934 mem-initializer:
16935 ( expression-list [opt] )
16937 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
16938 class) or FIELD_DECL (for a non-static data member) to initialize;
16939 the TREE_VALUE is the expression-list. An empty initialization
16940 list is represented by void_list_node. */
16942 static tree
16944 {
16945 tree mem_initializer_id;
16946 tree expression_list;
16947 tree member;
16950 /* Find out what is being initialized. */
16952 {
16956 }
16957 else
16958 {
16962 }
16968 {
16975 }
16976 else
16977 {
16989 }
17002 /* We can't attach the source location of this initializer directly to
17003 the list node, so we instead attach it to a dummy EMPTY_CLASS_EXPR
17004 within the TREE_TYPE of the list node. */
17005 location_t loc
17012 }
17014 /* Parse a mem-initializer-id.
17016 mem-initializer-id:
17017 :: [opt] nested-name-specifier [opt] class-name
17018 decltype-specifier (C++11)
17019 identifier
17021 Returns a TYPE indicating the class to be initialized for the first
17022 production (and the second in C++11). Returns an IDENTIFIER_NODE
17023 indicating the data member to be initialized for the last production. */
17025 static tree
17027 {
17031 tree id;
17035 /* `typename' is not allowed in this context ([temp.res]). */
17037 {
17039 "keyword %<typename%> not allowed in this context (a qualified "
17042 }
17043 /* Look for the optional `::' operator. */
17044 global_scope_p
17048 /* Look for the optional nested-name-specifier. The simplest way to
17049 implement:
17051 [temp.res]
17053 The keyword `typename' is not permitted in a base-specifier or
17054 mem-initializer; in these contexts a qualified name that
17055 depends on a template-parameter is implicitly assumed to be a
17056 type name.
17058 is to assume that we have seen the `typename' keyword at this
17059 point. */
17060 nested_name_specifier_p
17069 /* If there is a `::' operator or a nested-name-specifier, then we
17070 are definitely looking for a class-name. */
17075 typename_type,
17079 /* Otherwise, we could also be looking for an ordinary identifier. */
17082 /* Try a decltype-specifier. */
17084 else
17085 /* Otherwise, try a class-name. */
17089 none_type,
17093 /* If we found one, we're done. */
17096 /* Otherwise, look for an ordinary identifier. */
17098 }
17100 /* Overloading [gram.over] */
17102 /* Parse an operator-function-id.
17104 operator-function-id:
17105 operator operator
17107 Returns an IDENTIFIER_NODE for the operator which is a
17108 human-readable spelling of the identifier, e.g., `operator +'. */
17110 static cp_expr
17112 {
17114 /* Look for the `operator' keyword. */
17117 /* And then the name of the operator itself. */
17119 }
17121 /* Return an identifier node for a user-defined literal operator.
17122 The suffix identifier is chained to the operator name identifier. */
17124 tree
17126 {
17127 tree identifier;
17135 }
17137 /* Parse an operator.
17139 operator:
17140 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
17141 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
17142 || ++ -- , ->* -> () []
17144 GNU Extensions:
17146 operator:
17147 <? >? <?= >?=
17149 Returns an IDENTIFIER_NODE for the operator which is a
17150 human-readable spelling of the identifier, e.g., `operator +'. */
17152 static cp_expr
17154 {
17159 /* Peek at the next token. */
17164 /* Figure out which operator we have. */
17169 {
17171 {
17172 /* The keyword should be either `new', `delete' or `co_await'. */
17179 else
17182 /* Consume the `new', `delete' or co_await token. */
17185 /* Peek at the next token. */
17187 /* If it's a `[' token then this is the array variant of the
17188 operator. */
17191 {
17192 /* Consume the `[' token. */
17194 /* Look for the `]' token. */
17199 }
17202 }
17365 /* Consume the `?'. */
17367 /* Look for the matching `:'. */
17373 {
17374 /* Consume the `('. */
17375 matching_parens parens;
17377 /* Look for the matching `)'. */
17384 }
17387 /* Consume the `['. */
17389 /* Look for the matching `]'. */
17400 /* FALLTHRU */
17409 {
17410 cp_expr str;
17411 tree string_tree;
17417 /* Consume the string. */
17423 {
17427 }
17428 else
17429 {
17431 /* Look for the suffix identifier. */
17434 {
17437 }
17439 {
17443 }
17444 else
17445 {
17448 }
17449 }
17454 {
17457 }
17460 {
17463 }
17465 {
17468 }
17469 /* Generate a location of the form:
17470 "" _suffix_identifier
17471 ^~~~~~~~~~~~~~~~~~~~~
17472 with caret == start at the start token, finish at the end of the
17473 suffix identifier. */
17474 location_t combined_loc
17477 }
17480 /* Anything else is an error. */
17482 }
17484 /* If we have selected an identifier, we need to consume the
17485 operator token. */
17487 {
17491 }
17492 /* Otherwise, no valid operator name was present. */
17493 else
17494 {
17497 }
17501 }
17503 /* Parse a template-declaration.
17505 template-declaration:
17506 export [opt] template < template-parameter-list > declaration
17508 If MEMBER_P is TRUE, this template-declaration occurs within a
17509 class-specifier.
17511 The grammar rule given by the standard isn't correct. What
17512 is really meant is:
17514 template-declaration:
17515 export [opt] template-parameter-list-seq
17516 decl-specifier-seq [opt] init-declarator [opt] ;
17517 export [opt] template-parameter-list-seq
17518 function-definition
17520 template-parameter-list-seq:
17521 template-parameter-list-seq [opt]
17522 template < template-parameter-list >
17524 Concept Extensions:
17526 template-parameter-list-seq:
17527 template < template-parameter-list > requires-clause [opt]
17529 requires-clause:
17530 requires logical-or-expression */
17532 static void
17534 {
17535 /* Check for `export'. */
17537 {
17538 /* Consume the `export' token. */
17540 /* Warn that this use of export is deprecated. */
17545 else
17547 }
17550 }
17552 /* Parse a template-parameter-list.
17554 template-parameter-list:
17555 template-parameter
17556 template-parameter-list , template-parameter
17558 Returns a TREE_LIST. Each node represents a template parameter.
17559 The nodes are connected via their TREE_CHAINs. */
17561 static tree
17563 {
17566 /* Don't create wrapper nodes within a template-parameter-list,
17567 since we don't want to have different types based on the
17568 spelling location of constants and decls within them. */
17569 auto_suppress_location_wrappers sentinel;
17573 /* The loop below parses the template parms. We first need to know
17574 the total number of template parms to be able to compute proper
17575 canonical types of each dependent type. So after the loop, when
17576 we know the total number of template parms,
17577 end_template_parm_list computes the proper canonical types and
17578 fixes up the dependent types accordingly. */
17580 {
17581 tree parameter;
17584 location_t parm_loc;
17586 /* Parse the template-parameter. */
17591 /* Add it to the list. */
17594 parm_loc,
17595 parameter,
17596 is_non_type,
17597 is_parameter_pack);
17598 else
17599 {
17602 }
17604 /* If the next token is not a `,', we're done. */
17607 /* Otherwise, consume the `,' token. */
17609 }
17612 }
17614 /* Parse a introduction-list.
17616 introduction-list:
17617 introduced-parameter
17618 introduction-list , introduced-parameter
17620 introduced-parameter:
17621 ...[opt] identifier
17623 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
17624 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
17625 WILDCARD_DECL will also have DECL_NAME set and token location in
17626 DECL_SOURCE_LOCATION. */
17628 static tree
17630 {
17634 {
17643 /* Build placeholder. */
17651 /* If the next token is not a `,', we're done. */
17654 /* Otherwise, consume the `,' token. */
17656 }
17658 /* Convert the vec into a TREE_VEC. */
17661 tree parm;
17667 }
17669 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
17670 is an abstract declarator. */
17674 {
17679 }
17681 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
17682 is an abstract declarator. */
17686 {
17690 else
17692 }
17694 /* Returns true if TYPE would declare a constrained constrained-parameter. */
17698 {
17703 }
17705 /* Returns true if PARM declares a constrained-parameter. */
17709 {
17711 }
17713 /* Check that the type parameter is only a declarator-id, and that its
17714 type is not cv-qualified. */
17716 bool
17719 {
17724 {
17727 }
17729 /* Don't allow cv-qualified type parameters. */
17732 {
17735 }
17738 }
17740 /* Finish parsing/processing a template type parameter and checking
17741 various restrictions. */
17745 tree id,
17747 {
17750 else
17752 }
17754 static tree
17756 {
17757 /* FIXME: This should probably be copied, and we may need to adjust
17758 the template parameter depths. */
17768 }
17770 /* Finish parsing/processing a template template parameter by borrowing
17771 the template parameter list from the prototype parameter. */
17773 static tree
17775 tree proto,
17776 tree id,
17778 {
17782 }
17784 /* Create a new non-type template parameter from the given PARM
17785 declarator. */
17787 static tree
17790 {
17796 }
17798 /* Build a constrained template parameter based on the PARMDECL
17799 declarator. The type of PARMDECL is the constrained type, which
17800 refers to the prototype template parameter that ultimately
17801 specifies the type of the declared parameter. */
17803 static tree
17807 {
17813 /* Build the parameter. Return an error if the declarator was invalid. */
17814 tree parm;
17819 parmdecl);
17820 else
17825 /* Finish the parameter decl and create a node attaching the
17826 default argument and constraint. */
17831 }
17833 /* Returns true if the parsed type actually represents the declaration
17834 of a type template-parameter. */
17836 static bool
17838 {
17841 }
17843 /* Returns true if the parsed type actually represents the declaration of
17844 a template template-parameter. */
17846 static bool
17848 {
17851 }
17853 /* Parse a default argument for a type template-parameter.
17854 Note that diagnostics are handled in cp_parser_template_parameter. */
17856 static tree
17858 {
17861 /* Consume the `=' token. */
17866 /* Tell cp_parser_lambda_expression this is a default argument. */
17870 /* Parse the default-argument. */
17873 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
17874 NULL);
17878 {
17882 }
17885 }
17887 /* Parse a default argument for a template template-parameter. */
17889 static tree
17891 {
17896 /* Consume the `='. */
17898 /* Parse the id-expression. */
17900 /* save token before parsing the id-expression, for error
17901 reporting */
17903 tree default_argument
17911 /* If the id-expression was a template-id that refers to
17912 a template-class, we already have the declaration here,
17913 so no further lookup is needed. */
17914 ;
17915 else
17916 /* Look up the name. */
17917 default_argument
17919 none_type,
17925 /* See if the default argument is valid. */
17929 }
17931 /* Parse a template-parameter.
17933 template-parameter:
17934 type-parameter
17935 parameter-declaration
17937 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
17938 the parameter. The TREE_PURPOSE is the default value, if any.
17939 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
17940 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
17941 set to true iff this parameter is a parameter pack. */
17943 static tree
17946 {
17949 tree parm;
17951 /* Assume it is a type parameter or a template parameter. */
17953 /* Assume it not a parameter pack. */
17955 /* Peek at the next token. */
17957 /* If it is `template', we have a type-parameter. */
17960 /* If it is `class' or `typename' we do not know yet whether it is a
17961 type parameter or a non-type parameter. Consider:
17963 template <typename T, typename T::X X> ...
17965 or:
17967 template <class C, class D*> ...
17969 Here, the first parameter is a type parameter, and the second is
17970 a non-type parameter. We can tell by looking at the token after
17971 the identifier -- if it is a `,', `=', or `>' then we have a type
17972 parameter. */
17974 {
17975 /* Peek at the token after `class' or `typename'. */
17977 /* If it's an ellipsis, we have a template type parameter
17978 pack. */
17981 /* If it's an identifier, skip it. */
17984 /* Now, see if the token looks like the end of a template
17985 parameter. */
17990 }
17992 /* Otherwise, it is a non-type parameter or a constrained parameter.
17994 [temp.param]
17996 When parsing a default template-argument for a non-type
17997 template-parameter, the first non-nested `>' is taken as the end
17998 of the template parameter-list rather than a greater-than
17999 operator. */
18000 parameter_declarator
18002 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
18009 /* If the parameter declaration is marked as a parameter pack, set
18010 *IS_PARAMETER_PACK to notify the caller. */
18015 {
18016 /* Can happen in some cases of erroneous input (c++/34892). */
18018 /* Consume the `...' for better error recovery. */
18020 }
18022 /* The parameter may have been constrained type parameter. */
18025 parameter_declarator,
18026 is_non_type);
18028 // Now we're sure that the parameter is a non-type parameter.
18039 }
18041 /* Parse a type-parameter.
18043 type-parameter:
18044 class identifier [opt]
18045 class identifier [opt] = type-id
18046 typename identifier [opt]
18047 typename identifier [opt] = type-id
18048 template < template-parameter-list > class identifier [opt]
18049 template < template-parameter-list > class identifier [opt]
18050 = id-expression
18052 GNU Extension (variadic templates):
18054 type-parameter:
18055 class ... identifier [opt]
18056 typename ... identifier [opt]
18058 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
18059 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
18060 the declaration of the parameter.
18062 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
18064 static tree
18066 {
18068 tree parameter;
18070 /* Look for a keyword to tell us what kind of parameter this is. */
18076 {
18079 {
18080 tree identifier;
18081 tree default_argument;
18083 /* If the next token is an ellipsis, we have a template
18084 argument pack. */
18086 {
18087 /* Consume the `...' token. */
18092 }
18094 /* If the next token is an identifier, then it names the
18095 parameter. */
18098 else
18101 /* Create the parameter. */
18104 /* If the next token is an `=', we have a default argument. */
18106 {
18107 default_argument
18110 /* Template parameter packs cannot have default
18111 arguments. */
18113 {
18116 "template parameter pack %qD cannot have a "
18118 else
18120 "template parameter packs cannot have "
18123 }
18126 }
18127 else
18130 /* Create the combined representation of the parameter and the
18131 default argument. */
18133 }
18137 {
18138 tree identifier;
18139 tree default_argument;
18141 /* Look for the `<'. */
18143 /* Parse the template-parameter-list. */
18145 /* Look for the `>'. */
18148 /* If template requirements are present, parse them. */
18150 {
18155 }
18157 /* Look for the `class' or 'typename' keywords. */
18159 /* If the next token is an ellipsis, we have a template
18160 argument pack. */
18162 {
18163 /* Consume the `...' token. */
18168 }
18169 /* If the next token is an `=', then there is a
18170 default-argument. If the next token is a `>', we are at
18171 the end of the parameter-list. If the next token is a `,',
18172 then we are at the end of this parameter. */
18176 {
18178 /* Treat invalid names as if the parameter were nameless. */
18181 }
18182 else
18185 /* Create the template parameter. */
18187 identifier);
18189 /* If the next token is an `=', then there is a
18190 default-argument. */
18192 {
18193 default_argument
18196 /* Template parameter packs cannot have default
18197 arguments. */
18199 {
18202 "template parameter pack %qD cannot "
18204 identifier);
18205 else
18209 }
18210 }
18211 else
18214 /* Create the combined representation of the parameter and the
18215 default argument. */
18217 }
18223 }
18226 }
18228 /* Parse a template-id.
18230 template-id:
18231 template-name < template-argument-list [opt] >
18233 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
18234 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
18235 returned. Otherwise, if the template-name names a function, or set
18236 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
18237 names a class, returns a TYPE_DECL for the specialization.
18239 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
18240 uninstantiated templates. */
18242 static tree
18248 {
18249 tree templ;
18250 tree arguments;
18251 tree template_id;
18256 /* If the next token corresponds to a template-id, there is no need
18257 to reparse it. */
18261 {
18264 }
18266 /* Avoid performing name lookup if there is no possibility of
18267 finding a template-id. */
18270 && !cp_parser_nth_token_starts_template_argument_list_p
18272 {
18275 }
18277 /* Remember where the template-id starts. */
18283 /* Parse the template-name. */
18286 check_dependency_p,
18287 is_declaration,
18288 tag_type,
18291 /* Push any access checks inside the firewall we're about to create. */
18297 /* Since we're going to preserve any side-effects from this parse, set up a
18298 firewall to protect our callers from cp_parser_commit_to_tentative_parse
18299 in the template arguments. */
18303 /* If we find the sequence `[:' after a template-name, it's probably
18304 a digraph-typo for `< ::'. Substitute the tokens and check if we can
18305 parse correctly the argument list. */
18312 {
18314 /* Change `:' into `::'. */
18316 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
18317 CPP_LESS. */
18320 /* Parse the arguments. */
18323 {
18324 /* If we couldn't parse an argument list, then we revert our changes
18325 and return simply an error. Maybe this is not a template-id
18326 after all. */
18331 }
18332 /* Otherwise, emit an error about the invalid digraph, but continue
18333 parsing because we got our argument list. */
18336 {
18339 "%<<:%> is an alternate spelling for %<[%>."
18342 {
18344 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
18347 }
18348 }
18349 }
18350 else
18351 {
18352 /* Look for the `<' that starts the template-argument-list. */
18354 {
18357 }
18358 /* Parse the arguments. */
18363 && !template_keyword_p
18366 {
18367 /* This didn't go well. */
18369 {
18370 /* C++20 says that "function-name < a;" is now ill-formed. */
18372 {
18375 "operand of %<<%> is ill-formed in C++20; wrap the "
18377 }
18378 else
18379 /* We expect "f<targs>" to be followed by "(args)". */
18383 /* Purge all subsequent tokens. */
18385 }
18386 else
18390 }
18391 }
18393 /* Set the location to be of the form:
18394 template-name < template-argument-list [opt] >
18395 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
18396 with caret == start at the start of the template-name,
18397 ranging until the closing '>'. */
18398 location_t combined_loc
18401 /* Check for concepts autos where they don't belong. We could
18402 identify types in some cases of identifier TEMPL, looking ahead
18403 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
18404 types. We reject them in functions, but if what we have is an
18405 identifier, even with none_type we can't conclude it's NOT a
18406 type, we have to wait for template substitution. */
18409 /* Build a representation of the specialization. */
18412 TEMPLATE_ID_EXPR,
18416 {
18417 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
18418 template (rather than some instantiation thereof) only if
18419 is not nested within some other construct. For example, in
18420 "template <typename T> void f(T) { A<T>::", A<T> is just an
18421 instantiation of A. */
18422 bool entering_scope
18425 template_id
18427 }
18429 {
18430 /* The caller will decide whether this is a concept check or type
18431 constraint. */
18434 }
18436 {
18440 }
18443 {
18444 /* Some type template in dependent scope. */
18447 TEMPLATE_ID_EXPR,
18450 }
18451 else
18452 {
18453 /* If it's not a class-template or a template-template, it should be
18454 a function-template. */
18460 }
18462 /* If parsing tentatively, replace the sequence of tokens that makes
18463 up the template-id with a CPP_TEMPLATE_ID token. That way,
18464 should we re-parse the token stream, we will not have to repeat
18465 the effort required to do the parse, nor will we issue duplicate
18466 error messages about problems during instantiation of the
18467 template. */
18469 /* Don't do this if we had a parse error in a declarator; re-parsing
18470 might succeed if a name changes meaning (60361). */
18474 {
18475 /* Reset the contents of the START_OF_ID token. */
18479 /* Retrieve any deferred checks. Do not pop this access checks yet
18480 so the memory will not be reclaimed during token replacing below. */
18487 /* Purge all subsequent tokens. */
18490 /* ??? Can we actually assume that, if template_id ==
18491 error_mark_node, we will have issued a diagnostic to the
18492 user, as opposed to simply marking the tentative parse as
18493 failed? */
18496 }
18500 }
18502 /* Like cp_parser_template_id, called in non-type context. */
18504 static tree
18509 {
18514 /* We didn't check the arguments in cp_parser_template_id; do that now. */
18517 }
18519 /* Parse a template-name.
18521 template-name:
18522 identifier
18524 The standard should actually say:
18526 template-name:
18527 identifier
18528 operator-function-id
18530 A defect report has been filed about this issue.
18532 A conversion-function-id cannot be a template name because they cannot
18533 be part of a template-id. In fact, looking at this code:
18535 a.operator K<int>()
18537 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
18538 It is impossible to call a templated conversion-function-id with an
18539 explicit argument list, since the only allowed template parameter is
18540 the type to which it is converting.
18542 If TEMPLATE_KEYWORD_P is true, then we have just seen the
18543 `template' keyword, in a construction like:
18545 T::template f<3>()
18547 In that case `f' is taken to be a template-name, even though there
18548 is no way of knowing for sure.
18550 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
18551 name refers to a set of overloaded functions, at least one of which
18552 is a template, or an IDENTIFIER_NODE with the name of the template,
18553 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
18554 names are looked up inside uninstantiated templates. */
18556 static tree
18563 {
18564 tree identifier;
18565 tree decl;
18568 /* If the next token is `operator', then we have either an
18569 operator-function-id or a conversion-function-id. */
18571 {
18572 /* We don't know whether we're looking at an
18573 operator-function-id or a conversion-function-id. */
18575 /* Try an operator-function-id. */
18577 /* If that didn't work, try a conversion-function-id. */
18579 {
18582 }
18583 }
18584 /* Look for the identifier. */
18585 else
18588 /* If we didn't find an identifier, we don't have a template-id. */
18592 /* If the name immediately followed the `template' keyword, then it
18593 is a template-name. However, if the next token is not `<', then
18594 we do not treat it as a template-name, since it is not being used
18595 as part of a template-id. This enables us to handle constructs
18596 like:
18598 template <typename T> struct S { S(); };
18599 template <typename T> S<T>::S();
18601 correctly. We would treat `S' as a template -- if it were `S<T>'
18602 -- but we do not if there is no `<'. */
18606 {
18607 /* In a declaration, in a dependent context, we pretend that the
18608 "template" keyword was present in order to improve error
18609 recovery. For example, given:
18611 template <typename T> void f(T::X<int>);
18613 we want to treat "X<int>" as a template-id. */
18615 && !template_keyword_p
18617 && check_dependency_p
18619 /* Do not do this for dtors (or ctors), since they never
18620 need the template keyword before their name. */
18622 {
18625 /* Explain what went wrong. */
18627 identifier);
18630 /* If parsing tentatively, find the location of the "<" token. */
18633 /* Parse the template arguments so that we can issue error
18634 messages about them. */
18637 /* Skip tokens until we find a good place from which to
18638 continue parsing. */
18643 /* If parsing tentatively, permanently remove the
18644 template argument list. That will prevent duplicate
18645 error messages from being issued about the missing
18646 "template" keyword. */
18653 }
18655 /* If the "template" keyword is present, then there is generally
18656 no point in doing name-lookup, so we just return IDENTIFIER.
18657 But, if the qualifying scope is non-dependent then we can
18658 (and must) do name-lookup normally. */
18660 {
18666 {
18667 /* We're optimizing away the call to cp_parser_lookup_name, but
18668 we still need to do this. */
18672 }
18673 }
18674 }
18676 /* cp_parser_lookup_name clears OBJECT_TYPE. */
18680 /* Look up the name. */
18682 tag_type,
18685 check_dependency_p,
18691 /* 13.3 [temp.names] A < is interpreted as the delimiter of a
18692 template-argument-list if it follows a name that is not a
18693 conversion-function-id and
18694 - that follows the keyword template or a ~ after a nested-name-specifier or
18695 in a class member access expression, or
18696 - for which name lookup finds the injected-class-name of a class template
18697 or finds any declaration of a template, or
18698 - that is an unqualified name for which name lookup either finds one or
18699 more functions or finds nothing, or
18700 - that is a terminal name in a using-declarator (9.9), in a declarator-id
18701 (9.3.4), or in a type-only context other than a nested-name-specifier
18702 (13.8). */
18704 /* Handle injected-class-name. */
18707 /* If DECL is a template, then the name was a template-name. */
18709 {
18712 {
18714 tree attr;
18717 else
18720 {
18723 }
18726 {
18729 }
18730 }
18731 }
18732 else
18733 {
18734 /* Look through an overload set for any templates. */
18742 /* "an unqualified name for which name lookup either finds one or more
18743 functions or finds nothing". */
18746 && !scope
18749 {
18750 /* The "more functions" case. Just use the OVERLOAD as normally.
18751 We don't use is_overloaded_fn here to avoid considering
18752 BASELINKs. */
18754 /* Name lookup found one function. */
18756 /* Name lookup found nothing. */
18759 }
18761 /* "that follows the keyword template"..."in a type-only context" */
18769 {
18770 /* The name does not name a template. */
18773 }
18776 /* cp_parser_template_id can only handle some TYPE_DECLs. */
18779 /* Repeat the lookup at instantiation time. */
18781 }
18784 }
18786 /* Parse a template-argument-list.
18788 template-argument-list:
18789 template-argument ... [opt]
18790 template-argument-list , template-argument ... [opt]
18792 Returns a TREE_VEC containing the arguments. */
18794 static tree
18796 {
18801 /* Don't create location wrapper nodes within a template-argument-list. */
18802 auto_suppress_location_wrappers sentinel;
18806 /* Even if the template-id appears in an integral
18807 constant-expression, the contents of the argument list do
18808 not. */
18814 /* Parse the arguments. */
18816 do
18817 {
18819 /* Consume the comma. */
18822 /* Parse the template-argument. */
18825 /* If the next token is an ellipsis, we're expanding a template
18826 argument pack. */
18828 {
18830 {
18834 }
18835 /* Consume the `...' token. */
18838 /* Make the argument into a TYPE_PACK_EXPANSION or
18839 EXPR_PACK_EXPANSION. */
18841 }
18844 }
18859 }
18861 /* Parse a template-argument.
18863 template-argument:
18864 assignment-expression
18865 type-id
18866 id-expression
18868 The representation is that of an assignment-expression, type-id, or
18869 id-expression -- except that the qualified id-expression is
18870 evaluated, so that the value returned is either a DECL or an
18871 OVERLOAD.
18873 Although the standard says "assignment-expression", it forbids
18874 throw-expressions or assignments in the template argument.
18875 Therefore, we use "conditional-expression" instead. */
18877 static tree
18879 {
18880 tree argument;
18886 cp_id_kind idk;
18888 /* There's really no way to know what we're looking at, so we just
18889 try each alternative in order.
18891 [temp.arg]
18893 In a template-argument, an ambiguity between a type-id and an
18894 expression is resolved to a type-id, regardless of the form of
18895 the corresponding template-parameter.
18897 Therefore, we try a type-id first. */
18900 /* If there was no error parsing the type-id but the next token is a
18901 '>>', our behavior depends on which dialect of C++ we're
18902 parsing. In C++98, we probably found a typo for '> >'. But there
18903 are type-id which are also valid expressions. For instance:
18905 struct X { int operator >> (int); };
18906 template <int V> struct Foo {};
18907 Foo<X () >> 5> r;
18909 Here 'X()' is a valid type-id of a function type, but the user just
18910 wanted to write the expression "X() >> 5". Thus, we remember that we
18911 found a valid type-id, but we still try to parse the argument as an
18912 expression to see what happens.
18914 In C++0x, the '>>' will be considered two separate '>'
18915 tokens. */
18919 /* Similarly for >= which
18920 cp_parser_next_token_ends_template_argument_p treats for
18921 diagnostics purposes as mistyped > =, but can be valid
18922 after a type-id. */
18924 {
18927 }
18928 else
18929 {
18930 /* If the next token isn't a `,' or a `>', then this argument wasn't
18931 really finished. This means that the argument is not a valid
18932 type-id. */
18935 /* If that worked, we're done. */
18938 }
18939 /* We're still not sure what the argument will be. */
18941 /* Try a template. */
18949 /* If the next token isn't a `,' or a `>', then this argument wasn't
18950 really finished. */
18954 {
18955 /* Figure out what is being referred to. If the id-expression
18956 was for a class template specialization, then we will have a
18957 TYPE_DECL at this point. There is no need to do name lookup
18958 at this point in that case. */
18961 none_type,
18970 }
18972 {
18978 }
18979 /* It must be a non-type argument. In C++17 any constant-expression is
18980 allowed. */
18984 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
18986 -- an integral constant-expression of integral or enumeration
18987 type; or
18989 -- the name of a non-type template-parameter; or
18991 -- the name of an object or function with external linkage...
18993 -- the address of an object or function with external linkage...
18995 -- a pointer to member... */
18996 /* Look for a non-type template parameter. */
18998 {
19010 }
19012 /* If the next token is "&", the argument must be the address of an
19013 object or function with external linkage. */
19016 {
19019 }
19020 /* See if we might have an id-expression. */
19027 {
19030 address_p,
19037 else
19038 {
19039 tree probe;
19042 {
19043 /* Strip the dereference temporarily. */
19046 }
19048 /* If we're in a template, we represent a qualified-id referring
19049 to a static data member as a SCOPE_REF even if the scope isn't
19050 dependent so that we can check access control later. */
19055 {
19056 /* A variable without external linkage might still be a
19057 valid constant-expression, so no error is issued here
19058 if the external-linkage check fails. */
19061 }
19063 /* All overloaded functions are allowed; if the external
19064 linkage test does not pass, an error will be issued
19065 later. */
19066 ;
19070 /* A pointer-to-member. */
19071 ;
19073 ;
19074 else
19078 {
19082 else
19085 }
19086 }
19087 }
19088 /* If the argument started with "&", there are no other valid
19089 alternatives at this point. */
19091 {
19094 }
19096 general_expr:
19097 /* If the argument wasn't successfully parsed as a type-id followed
19098 by '>>', the argument can only be a constant expression now.
19099 Otherwise, we try parsing the constant-expression tentatively,
19100 because the argument could really be a type-id. */
19106 else
19107 {
19108 /* In C++20, we can encounter a braced-init-list. */
19111 {
19114 }
19116 /* With C++17 generalized non-type template arguments we need to handle
19117 lvalue constant expressions, too. */
19120 }
19128 /* We did our best to parse the argument as a non type-id, but that
19129 was the only alternative that matched (albeit with a '>' after
19130 it). We can assume it's just a typo from the user, and a
19131 diagnostic will then be issued. */
19133 }
19135 /* Parse an explicit-instantiation.
19137 explicit-instantiation:
19138 template declaration
19140 Although the standard says `declaration', what it really means is:
19142 explicit-instantiation:
19143 template decl-specifier-seq [opt] declarator [opt] ;
19145 Things like `template int S<int>::i = 5, int S<double>::j;' are not
19146 supposed to be allowed. A defect report has been filed about this
19147 issue.
19149 GNU Extension:
19151 explicit-instantiation:
19152 storage-class-specifier template
19153 decl-specifier-seq [opt] declarator [opt] ;
19154 function-specifier template
19155 decl-specifier-seq [opt] declarator [opt] ; */
19157 static void
19159 {
19161 cp_decl_specifier_seq decl_specifiers;
19166 /* Look for an (optional) storage-class-specifier or
19167 function-specifier. */
19169 {
19170 extension_specifier
19173 extension_specifier
19176 }
19178 /* Look for the `template' keyword. */
19180 /* Let the front end know that we are processing an explicit
19181 instantiation. */
19183 /* [temp.explicit] says that we are supposed to ignore access
19184 control while processing explicit instantiation directives. */
19186 /* Parse a decl-specifier-seq. */
19188 CP_PARSER_FLAGS_OPTIONAL,
19192 cp_omp_declare_simd_data odsd;
19198 /* If there was exactly one decl-specifier, and it declared a class,
19199 and there's no declarator, then we have an explicit type
19200 instantiation. */
19202 {
19205 /* Turn access control back on for names used during
19206 template instantiation. */
19211 }
19212 else
19213 {
19215 tree decl;
19217 /* Parse the declarator. */
19218 declarator
19220 CP_PARSER_FLAGS_NONE,
19231 {
19234 "explicit instantiation shall not use"
19238 "explicit instantiation shall not use"
19242 "explicit instantiation shall not use"
19247 /* Turn access control back on for names used during
19248 template instantiation. */
19250 /* Do the explicit instantiation. */
19252 }
19253 else
19254 {
19256 /* Skip the body of the explicit instantiation. */
19258 }
19259 }
19260 /* We're done with the instantiation. */
19266 }
19268 /* Parse an explicit-specialization.
19270 explicit-specialization:
19271 template < > declaration
19273 Although the standard says `declaration', what it really means is:
19275 explicit-specialization:
19276 template <> decl-specifier [opt] init-declarator [opt] ;
19277 template <> function-definition
19278 template <> explicit-specialization
19279 template <> template-declaration */
19281 static void
19283 {
19286 /* Look for the `template' keyword. */
19288 /* Look for the `<'. */
19290 /* Look for the `>'. */
19292 /* We have processed another parameter list. */
19295 /* [temp]
19297 A template ... explicit specialization ... shall not have C
19298 linkage. */
19301 {
19305 /* Give it C++ linkage to avoid confusing other parts of the
19306 front end. */
19308 }
19310 /* Let the front end know that we are beginning a specialization. */
19312 {
19313 /* If the next keyword is `template', we need to figure out
19314 whether or not we're looking a template-declaration. */
19316 {
19321 else
19323 }
19324 else
19325 /* Parse the dependent declaration. */
19331 }
19333 /* We're done with the specialization. */
19336 /* For the erroneous case of a template with C linkage, we pushed an
19337 implicit C++ linkage scope; exit that scope now. */
19341 /* We're done with this parameter list. */
19343 }
19345 /* Preserve the attributes across a garbage collect (by making it a GC
19346 root), which can occur when parsing a member function. */
19350 /* Parse a type-specifier.
19352 type-specifier:
19353 simple-type-specifier
19354 class-specifier
19355 enum-specifier
19356 elaborated-type-specifier
19357 cv-qualifier
19359 GNU Extension:
19361 type-specifier:
19362 __complex__
19364 Returns a representation of the type-specifier. For a
19365 class-specifier, enum-specifier, or elaborated-type-specifier, a
19366 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
19368 The parser flags FLAGS is used to control type-specifier parsing.
19370 If IS_DECLARATION is TRUE, then this type-specifier is appearing
19371 in a decl-specifier-seq.
19373 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
19374 class-specifier, enum-specifier, or elaborated-type-specifier, then
19375 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
19376 if a type is declared; 2 if it is defined. Otherwise, it is set to
19377 zero.
19379 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
19380 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
19381 is set to FALSE. */
19383 static tree
19385 cp_parser_flags flags,
19390 {
19396 /* Assume this type-specifier does not declare a new type. */
19399 /* And that it does not specify a cv-qualifier. */
19402 /* Peek at the next token. */
19405 /* If we're looking at a keyword, we can use that to guide the
19406 production we choose. */
19409 {
19414 /* Look for the enum-specifier. */
19416 /* If that worked, we're done. */
19418 {
19423 type_spec,
19424 token,
19427 }
19428 else
19431 /* Any of these indicate either a class-specifier, or an
19432 elaborated-type-specifier. */
19439 /* Parse tentatively so that we can back up if we don't find a
19440 class-specifier. */
19444 /* Look for the class-specifier. */
19449 /* If that worked, we're done. */
19451 {
19456 type_spec,
19457 token,
19460 }
19462 /* Fall through. */
19463 elaborated_type_specifier:
19464 /* We're declaring (not defining) a class or enum. */
19468 /* Fall through. */
19470 /* Look for an elaborated-type-specifier. */
19471 type_spec
19472 = (cp_parser_elaborated_type_specifier
19475 is_declaration));
19478 type_spec,
19479 token,
19502 /* The `__complex__' keyword is a GNU extension. */
19508 }
19510 /* Handle simple keywords. */
19512 {
19514 {
19517 }
19519 }
19521 /* If we do not already have a type-specifier, assume we are looking
19522 at a simple-type-specifier. */
19524 decl_specs,
19525 flags);
19527 /* If we didn't find a type-specifier, and a type-specifier was not
19528 optional in this context, issue an error message. */
19530 {
19533 }
19536 }
19538 /* Parse a simple-type-specifier.
19540 simple-type-specifier:
19541 :: [opt] nested-name-specifier [opt] type-name
19542 :: [opt] nested-name-specifier template template-id
19543 char
19544 wchar_t
19545 bool
19546 short
19547 int
19548 long
19549 signed
19550 unsigned
19551 float
19552 double
19553 void
19555 C++11 Extension:
19557 simple-type-specifier:
19558 auto
19559 decltype ( expression )
19560 char16_t
19561 char32_t
19562 __underlying_type ( type-id )
19564 C++17 extension:
19566 nested-name-specifier(opt) template-name
19568 GNU Extension:
19570 simple-type-specifier:
19571 __int128
19572 __typeof__ unary-expression
19573 __typeof__ ( type-id )
19574 __typeof__ ( type-id ) { initializer-list , [opt] }
19576 Concepts Extension:
19578 simple-type-specifier:
19579 constrained-type-specifier
19581 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
19582 appropriately updated. */
19584 static tree
19587 cp_parser_flags flags)
19588 {
19593 /* Peek at the next token. */
19596 /* If we're looking at a keyword, things are easy. */
19598 {
19636 {
19639 /* Check if the alternate "__intN__" form has been used instead of
19640 "__intN". */
19644 }
19666 CASE_RID_FLOATN_NX:
19681 {
19682 /* The 'auto' might be the placeholder return type for a function decl
19683 with trailing return type. */
19692 {
19694 {
19701 }
19704 {
19707 }
19710 }
19714 {
19717 }
19720 {
19723 }
19724 else
19728 {
19731 "use of %<auto%> in lambda parameter declaration "
19732 "only available with "
19734 }
19737 "use of %<auto%> in parameter declaration "
19738 "only available with "
19742 "use of %<auto%> in parameter declaration "
19744 }
19745 else
19750 /* Since DR 743, decltype can either be a simple-type-specifier by
19751 itself or begin a nested-name-specifier. Parsing it will replace
19752 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
19753 handling below decide what to do. */
19759 /* Consume the `typeof' token. */
19761 /* Parse the operand to `typeof'. */
19763 /* If it is not already a TYPE, take its type. */
19769 token,
19774 #define DEFTRAIT_TYPE(CODE, NAME, ARITY) \
19775 case RID_##CODE:
19777 #undef DEFTRAIT_TYPE
19781 token,
19788 }
19790 /* If token is an already-parsed decltype not followed by ::,
19791 it's a simple-type-specifier. */
19794 {
19797 {
19799 token,
19801 /* Remember that we are handling a decltype in order to
19802 implement the resolution of DR 1510 when the argument
19803 isn't instantiation dependent. */
19805 }
19808 }
19810 /* If the type-specifier was for a built-in type, we're done. */
19812 {
19813 /* Record the type. */
19820 type,
19821 token,
19826 /* Consume the token. */
19832 /* There is no valid C++ program where a non-template type is
19833 followed by a "<". That usually indicates that the user thought
19834 that the type was a template. */
19839 }
19841 /* The type-specifier must be a user-defined type. */
19843 {
19849 /* Don't gobble tokens or issue error messages if this is an
19850 optional type-specifier. */
19854 /* Remember current tentative parsing state -- if we know we need
19855 a type, we can give better diagnostics here. */
19860 /* Look for the optional `::' operator. */
19861 global_p
19865 /* Look for the nested-name specifier. */
19866 qualified_p
19873 /* If we have seen a nested-name-specifier, and the next token
19874 is `template', then we are using the template-id production. */
19877 {
19878 /* Look for the template-id. */
19882 none_type,
19884 /* If the template-id did not name a type, we are out of
19885 luck. */
19887 {
19888 /* ...unless we pretend we have seen 'typename'. */
19892 else
19893 {
19896 }
19897 }
19898 }
19899 /* DR 1812: A < following a qualified-id in a typename-specifier
19900 could safely be assumed to begin a template argument list, so
19901 the template keyword should be optional. */
19903 && qualified_p
19904 && typename_p
19906 {
19912 none_type,
19914 /* This is handled below, so back off. */
19925 }
19927 /* Otherwise, look for a type-name. */
19929 {
19937 }
19940 {
19941 /* Try for a type-constraint with template arguments. We check
19942 decl_specs here to avoid trying this for a functional cast. */
19949 none_type,
19952 {
19957 /* Perhaps it's a concept-check expression. */
19959 }
19960 else
19965 }
19968 {
19969 /* Try class template argument deduction or type-constraint without
19970 template arguments. */
19974 {
19975 location_t loc
19978 none_type,
19990 else
19991 {
19996 }
19997 }
19998 else
20000 }
20002 /* If it didn't work out, we don't have a TYPE. */
20007 /* Keep track of all name-lookups performed in class scopes. */
20009 && !global_p
20010 && !qualified_p
20017 token,
20019 }
20021 /* If we didn't get a type-name, issue an error message. */
20023 {
20026 }
20029 {
20030 /* See if TYPE is an Objective-C type, and if so, parse and
20031 accept any protocol references following it. Do this before
20032 the cp_parser_check_for_invalid_template_id() call, because
20033 Objective-C types can be followed by '<...>' which would
20034 enclose protocol names rather than template arguments, and so
20035 everything is fine. */
20038 {
20042 /* Clobber the "unqualified" type previously entered into
20043 DECL_SPECS with the new, improved protocol-qualified version. */
20048 }
20050 /* There is no valid C++ program where a non-template type is
20051 followed by a "<". That usually indicates that the user
20052 thought that the type was a template. */
20054 none_type,
20056 }
20059 }
20061 /* Parse the remainder of a placholder-type-specifier.
20063 placeholder-type-specifier:
20064 type-constraint_opt auto
20065 type-constraint_opt decltype(auto)
20067 The raw form of the constraint is parsed in cp_parser_simple_type_specifier
20068 and passed as TMPL. This function converts TMPL to an actual type-constraint,
20069 parses the placeholder type, and performs some contextual syntactic analysis.
20071 LOC provides the location of the template name.
20073 TENTATIVE is true if the type-specifier parsing is tentative; in that case,
20074 don't give an error if TMPL isn't a valid type-constraint, as the template-id
20075 might actually be a concept-check,
20077 Note that the Concepts TS allows the auto or decltype(auto) to be
20078 omitted in a constrained-type-specifier. */
20080 static tree
20083 {
20089 /* Get the arguments as written for subsequent analysis. */
20092 {
20095 }
20096 else
20097 /* A concept-name with no arguments can't be an expression. */
20102 /* Get the concept and prototype parameter for the constraint. */
20109 /* As per the standard, require auto or decltype(auto), except in some
20110 cases (template parameter lists, -fconcepts-ts enabled). */
20113 {
20117 {
20119 matching_parens parens;
20123 }
20124 }
20126 /* A type constraint constrains a contextually determined type or type
20127 parameter pack. However, the Concepts TS does allow concepts
20128 to introduce non-type and template template parameters. */
20130 {
20133 {
20135 {
20138 }
20140 }
20141 }
20143 /* In a template parameter list, a type-parameter can be introduced
20144 by type-constraints alone. */
20146 {
20147 /* In a default argument we may not be creating new parameters. */
20149 {
20150 /* If this assert turns out to be false, do error() instead. */
20153 }
20155 }
20157 /* Diagnose issues placeholder issues. */
20161 {
20163 /* Perhaps it's a concept-check expression (c++/91073). */
20170 /* Fall through. This is an error of omission. */
20171 }
20173 {
20174 /* A trailing return type only allows type-constraints. */
20177 }
20179 /* In a parameter-declaration-clause, a placeholder-type-specifier
20180 results in an invented template parameter. */
20182 {
20184 {
20190 }
20193 }
20195 /* Determine if the type should be deduced using template argument
20196 deduction or decltype deduction. Note that the latter is always
20197 used for type-constraints in trailing return types. */
20202 /* Otherwise, this is the type of a variable or return type. */
20205 else
20207 }
20209 /* Parse a type-name.
20211 type-name:
20212 class-name
20213 enum-name
20214 typedef-name
20215 simple-template-id [in c++0x]
20217 enum-name:
20218 identifier
20220 typedef-name:
20221 identifier
20223 Concepts:
20225 type-name:
20226 concept-name
20227 partial-concept-id
20229 concept-name:
20230 identifier
20232 Returns a TYPE_DECL for the type. */
20234 static tree
20236 {
20237 tree type_decl;
20239 /* We can't know yet whether it is a class-name or not. */
20241 /* Try a class-name. */
20243 typename_keyword_p,
20245 none_type,
20249 /* If it's not a class-name, keep looking. */
20251 {
20253 /* It must be a typedef-name or an enum-name. */
20257 /* It is either a simple-template-id representing an
20258 instantiation of an alias template... */
20262 none_type,
20264 /* Note that this must be an instantiation of an alias template
20265 because [temp.names]/6 says:
20267 A template-id that names an alias template specialization
20268 is a type-name.
20270 Whereas [temp.names]/7 says:
20272 A simple-template-id that names a class template
20273 specialization is a class-name.
20275 With concepts, this could also be a partial-concept-id that
20276 declares a non-type template parameter. */
20281 else
20285 /* ... Or a typedef-name or an enum-name. */
20287 }
20290 }
20292 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
20293 or a concept-name.
20295 enum-name:
20296 identifier
20298 typedef-name:
20299 identifier
20301 concept-name:
20302 identifier
20304 Returns a TYPE_DECL for the type. */
20306 static tree
20308 {
20309 tree type_decl;
20310 tree identifier;
20317 /* Look up the type-name. */
20324 {
20325 /* See if this is an Objective-C type. */
20330 }
20332 /* Issue an error if we did not find a type-name. */
20334 /* In Objective-C, we have the complication that class names are
20335 normally type names and start declarations (eg, the
20336 "NSObject" in "NSObject *object;"), but can be used in an
20337 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
20338 is an expression. So, a classname followed by a dot is not a
20339 valid type-name. */
20342 {
20347 }
20348 /* Remember that the name was used in the definition of the
20349 current class so that we can check later to see if the
20350 meaning would have been different after the class was
20351 entirely defined. */
20357 }
20359 /* Parse an elaborated-type-specifier. Note that the grammar given
20360 here incorporates the resolution to DR68.
20362 elaborated-type-specifier:
20363 class-key :: [opt] nested-name-specifier [opt] identifier
20364 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
20365 enum-key :: [opt] nested-name-specifier [opt] identifier
20366 typename :: [opt] nested-name-specifier identifier
20367 typename :: [opt] nested-name-specifier template [opt]
20368 template-id
20370 GNU extension:
20372 elaborated-type-specifier:
20373 class-key attributes :: [opt] nested-name-specifier [opt] identifier
20374 class-key attributes :: [opt] nested-name-specifier [opt]
20375 template [opt] template-id
20376 enum attributes :: [opt] nested-name-specifier [opt] identifier
20378 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
20379 declared `friend'. If IS_DECLARATION is TRUE, then this
20380 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
20381 something is being declared.
20383 Returns the TYPE specified. */
20385 static tree
20389 {
20391 tree identifier;
20394 tree globalscope;
20397 /* For class and enum types the location of the class-key or enum-key. */
20399 /* For a scoped enum, the 'class' or 'struct' keyword id. */
20402 /* See if we're looking at the `enum' keyword. */
20404 {
20405 /* Consume the `enum' token. */
20407 /* Remember that it's an enumeration type. */
20409 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
20410 enums) is used here. */
20414 {
20422 /* Consume the `struct' or `class' and parse it anyway. */
20424 /* Create a combined location for the whole scoped-enum-key. */
20426 }
20427 else
20430 /* Parse the attributes. */
20432 }
20433 /* Or, it might be `typename'. */
20435 RID_TYPENAME))
20436 {
20437 /* Consume the `typename' token. */
20439 /* Remember that it's a `typename' type. */
20441 }
20442 /* Otherwise it must be a class-key. */
20443 else
20444 {
20449 /* Parse the attributes. */
20451 }
20453 /* Look for the `::' operator. */
20456 /* Look for the nested-name-specifier. */
20457 tree nested_name_specifier;
20459 {
20460 nested_name_specifier
20465 is_declaration);
20468 }
20469 else
20470 /* Even though `typename' is not present, the proposed resolution
20471 to Core Issue 180 says that in `class A<T>::B', `B' should be
20472 considered a type-name, even if `A<T>' is dependent. */
20473 nested_name_specifier
20478 is_declaration);
20479 /* For everything but enumeration types, consider a template-id.
20480 For an enumeration type, consider only a plain identifier. */
20482 {
20484 tree decl;
20486 /* Allow the `template' keyword. */
20488 /* If we didn't see `template', we don't know if there's a
20489 template-id or not. */
20492 /* The `template' keyword must follow a nested-name-specifier. */
20494 {
20498 }
20500 /* Parse the template-id. */
20504 tag_type,
20505 is_declaration);
20506 /* If we didn't find a template-id, look for an ordinary
20507 identifier. */
20509 ;
20510 /* We can get here when cp_parser_template_id, called by
20511 cp_parser_class_name with tag_type == none_type, succeeds
20512 and caches a BASELINK. Then, when called again here,
20513 instead of failing and returning an error_mark_node
20514 returns it (see template/typename17.C in C++11).
20515 ??? Could we diagnose this earlier? */
20517 {
20520 }
20521 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
20522 in effect, then we must assume that, upon instantiation, the
20523 template will correspond to a class. */
20527 typename_type,
20529 /* If the `typename' keyword is in effect and DECL is not a type
20530 decl, then type is non existent. */
20532 ;
20534 {
20538 /* If the next token is a semicolon, this must be a specialization,
20539 instantiation, or friend declaration. Check the scope while we
20540 still know whether or not we had a nested-name-specifier. */
20545 }
20548 }
20551 {
20556 {
20559 }
20561 /* For a `typename', we needn't call xref_tag. */
20567 /* Template parameter lists apply only if we are not within a
20568 function parameter list. */
20569 bool template_parm_lists_apply
20578 /* Look up a qualified name in the usual way. */
20580 {
20581 tree decl;
20582 tree ambiguous_decls;
20585 tag_type,
20592 /* If the lookup was ambiguous, an error will already have been
20593 issued. */
20597 /* If we are parsing friend declaration, DECL may be a
20598 TEMPLATE_DECL tree node here. However, we need to check
20599 whether this TEMPLATE_DECL results in valid code. Consider
20600 the following example:
20602 namespace N {
20603 template <class T> class C {};
20604 }
20605 class X {
20606 template <class T> friend class N::C; // #1, valid code
20607 };
20608 template <class T> class Y {
20609 friend class N::C; // #2, invalid code
20610 };
20612 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
20613 name lookup of `N::C'. We see that friend declaration must
20614 be template for the code to be valid. Note that
20615 processing_template_decl does not work here since it is
20616 always 1 for the above two cases. */
20618 decl = (cp_parser_maybe_treat_template_as_class
20623 {
20625 identifier,
20628 }
20631 {
20635 allow_template);
20639 }
20641 /* Forward declarations of nested types, such as
20643 class C1::C2;
20644 class C1::C2::C3;
20646 are invalid unless all components preceding the final '::'
20647 are complete. If all enclosing types are complete, these
20648 declarations become merely pointless.
20650 Invalid forward declarations of nested types are errors
20651 caught elsewhere in parsing. Those that are pointless arrive
20652 here. */
20660 }
20661 else
20662 {
20663 /* An elaborated-type-specifier sometimes introduces a new type and
20664 sometimes names an existing type. Normally, the rule is that it
20665 introduces a new type only if there is not an existing type of
20666 the same name already in scope. For example, given:
20668 struct S {};
20669 void f() { struct S s; }
20671 the `struct S' in the body of `f' is the same `struct S' as in
20672 the global scope; the existing definition is used. However, if
20673 there were no global declaration, this would introduce a new
20674 local class named `S'.
20676 An exception to this rule applies to the following code:
20678 namespace N { struct S; }
20680 Here, the elaborated-type-specifier names a new type
20681 unconditionally; even if there is already an `S' in the
20682 containing scope this declaration names a new type.
20683 This exception only applies if the elaborated-type-specifier
20684 forms the complete declaration:
20686 [class.name]
20688 A declaration consisting solely of `class-key identifier ;' is
20689 either a redeclaration of the name in the current scope or a
20690 forward declaration of the identifier as a class name. It
20691 introduces the name into the current scope.
20693 We are in this situation precisely when the next token is a `;'.
20695 An exception to the exception is that a `friend' declaration does
20696 *not* name a new type; i.e., given:
20698 struct S { friend struct T; };
20700 `T' is not a new type in the scope of `S'.
20702 Also, `new struct S' or `sizeof (struct S)' never results in the
20703 definition of a new type; a new type can only be declared in a
20704 declaration context. */
20706 TAG_how how;
20709 /* Friends have special name lookup rules. */
20713 CPP_SEMICOLON))
20714 /* This is a `class-key identifier ;' */
20716 else
20720 (template_parm_lists_apply
20723 /* An unqualified name was used to reference this type, so
20724 there were no qualifying templates. */
20734 }
20735 }
20740 /* Allow attributes on forward declarations of classes. */
20742 {
20753 {
20757 }
20760 else
20762 "attributes ignored on elaborated-type-specifier that is "
20764 }
20768 else
20769 {
20770 /* Diagnose class/struct/union mismatches. IS_DECLARATION is false
20771 for alias definition. */
20775 decl_class);
20777 /* Indicate whether this class was declared as a `class' or as a
20778 `struct'. */
20781 }
20783 /* A "<" cannot follow an elaborated type specifier. If that
20784 happens, the user was probably trying to form a template-id. */
20789 }
20791 /* Parse an enum-specifier.
20793 enum-specifier:
20794 enum-head { enumerator-list [opt] }
20795 enum-head { enumerator-list , } [C++0x]
20797 enum-head:
20798 enum-key identifier [opt] enum-base [opt]
20799 enum-key nested-name-specifier identifier enum-base [opt]
20801 enum-key:
20802 enum
20803 enum class [C++0x]
20804 enum struct [C++0x]
20806 enum-base: [C++0x]
20807 : type-specifier-seq
20809 opaque-enum-specifier:
20810 enum-key identifier enum-base [opt] ;
20812 GNU Extensions:
20813 enum-key attributes[opt] identifier [opt] enum-base [opt]
20814 { enumerator-list [opt] }attributes[opt]
20815 enum-key attributes[opt] identifier [opt] enum-base [opt]
20816 { enumerator-list, }attributes[opt] [C++0x]
20818 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
20819 if the token stream isn't an enum-specifier after all. */
20821 static tree
20823 {
20824 tree identifier;
20826 tree prev_scope;
20828 tree attributes;
20839 /* Parse tentatively so that we can back up if we don't find a
20840 enum-specifier. */
20843 /* Caller guarantees that the current token is 'enum', an identifier
20844 possibly follows, and the token after that is an opening brace.
20845 If we don't have an identifier, fabricate an anonymous name for
20846 the enumeration being defined. */
20849 /* Parse the "class" or "struct", which indicates a scoped
20850 enumeration type in C++0x. */
20853 {
20857 /* Consume the `struct' or `class' token. */
20861 }
20865 /* Clear the qualification. */
20870 /* Figure out in what scope the declaration is being placed. */
20876 nested_name_specifier
20884 {
20885 tree name;
20889 enum_type,
20894 input_location);
20896 {
20899 {
20900 /* Are template enums allowed in ISO? */
20904 /* ignore a typename reference, for it will be solved by name
20905 in start_enum. */
20907 }
20908 }
20911 else
20912 {
20917 }
20918 }
20919 else
20920 {
20923 else
20924 {
20930 }
20931 }
20934 /* Check for the `:' that denotes a specified underlying type in C++0x.
20935 Note that a ':' could also indicate a bitfield width, however. */
20937 {
20938 cp_decl_specifier_seq type_specifiers;
20940 /* Consume the `:'. */
20943 auto tdf
20947 /* Parse the type-specifier-seq. */
20953 /* At this point this is surely not elaborated type specifier. */
20962 /* If that didn't work, stop. */
20964 {
20970 }
20971 }
20973 /* Look for the `{' but don't consume it yet. */
20975 {
20977 {
20983 }
20984 /* An opaque-enum-specifier must have a ';' here. */
20987 {
20993 }
20994 }
21000 {
21002 {
21006 }
21009 }
21011 /* Issue an error message if type-definitions are forbidden here. */
21014 else
21015 /* Create the new type. We do this before consuming the opening
21016 brace so the enum will be recorded as being on the line of its
21017 tag (or the 'enum' keyword, if there is no tag). */
21021 /* If the next token is not '{' it is an opaque-enum-specifier or an
21022 elaborated-type-specifier. */
21024 {
21029 {
21030 /* The following catches invalid code such as:
21031 enum class S<int>::E { A, B, C }; */
21039 {
21043 nested_name_specifier);
21045 }
21048 {
21050 "%qT for enum declaration does not name a class "
21053 }
21054 /* If that scope does not contain the scope in which the
21055 class was originally declared, the program is invalid. */
21057 nested_name_specifier))
21058 {
21061 "declaration of %qD in namespace %qD which does not "
21064 else
21066 "declaration of %qD in %qD which does not "
21070 }
21071 /* If that scope is the scope where the declaration is being placed
21072 the program is invalid. */
21076 {
21080 }
21081 }
21086 /* Consume the opening brace. */
21087 matching_braces braces;
21094 {
21098 }
21099 else
21100 {
21106 }
21110 /* If the next token is not '}', then there are some enumerators. */
21112 {
21114 /* Don't warn for enum {} a; here. */
21118 }
21119 else
21120 {
21121 /* We've seen a '{' so we know we're in an enum-specifier.
21122 Commit to any tentative parse to get syntax errors. */
21125 }
21127 /* Consume the final '}'. */
21132 }
21133 else
21134 {
21135 /* If a ';' follows, then it is an opaque-enum-specifier
21136 and additional restrictions apply. */
21138 {
21145 }
21146 }
21148 /* Look for trailing attributes to apply to this enumeration, and
21149 apply them if appropriate. */
21151 {
21154 trailing_attr,
21156 }
21158 /* Finish up the enumeration. */
21160 {
21165 }
21168 {
21170 {
21173 }
21176 }
21178 }
21180 /* Parse an enumerator-list. The enumerators all have the indicated
21181 TYPE.
21183 enumerator-list:
21184 enumerator-definition
21185 enumerator-list , enumerator-definition */
21187 static void
21189 {
21191 {
21192 /* Parse an enumerator-definition. */
21195 /* If the next token is not a ',', we've reached the end of
21196 the list. */
21199 /* Otherwise, consume the `,' and keep going. */
21201 /* If the next token is a `}', there is a trailing comma. */
21203 {
21208 }
21209 }
21210 }
21212 /* Parse an enumerator-definition. The enumerator has the indicated
21213 TYPE.
21215 enumerator-definition:
21216 enumerator
21217 enumerator = constant-expression
21219 enumerator:
21220 identifier
21222 GNU Extensions:
21224 enumerator-definition:
21225 enumerator attributes [opt]
21226 enumerator attributes [opt] = constant-expression */
21228 static void
21230 {
21231 tree identifier;
21232 tree value;
21233 location_t loc;
21235 /* Save the input location because we are interested in the location
21236 of the identifier and not the location of the explicit value. */
21239 /* Look for the identifier. */
21244 /* Parse any specified attributes. */
21247 /* If the next token is an '=', then there is an explicit value. */
21249 {
21250 /* Consume the `=' token. */
21252 /* Parse the value. */
21254 }
21255 else
21258 /* If we are processing a template, make sure the initializer of the
21259 enumerator doesn't contain any bare template parameter pack. */
21261 {
21262 /* In a lambda it should work, but doesn't currently. */
21264 {
21267 }
21268 }
21272 /* Create the enumerator. */
21274 }
21276 /* Parse a namespace-name.
21278 namespace-name:
21279 original-namespace-name
21280 namespace-alias
21282 Returns the NAMESPACE_DECL for the namespace. */
21284 static tree
21286 {
21287 tree identifier;
21288 tree namespace_decl;
21292 /* Get the name of the namespace. */
21297 /* Look up the identifier in the currently active scope. Look only
21298 for namespaces, due to:
21300 [basic.lookup.udir]
21302 When looking up a namespace-name in a using-directive or alias
21303 definition, only namespace names are considered.
21305 And:
21307 [basic.lookup.qual]
21309 During the lookup of a name preceding the :: scope resolution
21310 operator, object, function, and enumerator names are ignored.
21312 (Note that cp_parser_qualifying_entity only calls this
21313 function if the token after the name is the scope resolution
21314 operator.) */
21316 none_type,
21322 /* If it's not a namespace, issue an error. */
21325 {
21327 {
21328 auto_diagnostic_group d;
21329 name_hint hint;
21333 identifier,
21336 {
21342 }
21343 else
21345 identifier);
21346 }
21347 else
21350 }
21353 }
21355 /* Parse a namespace-definition.
21357 namespace-definition:
21358 named-namespace-definition
21359 unnamed-namespace-definition
21361 named-namespace-definition:
21362 original-namespace-definition
21363 extension-namespace-definition
21365 original-namespace-definition:
21366 namespace identifier { namespace-body }
21368 extension-namespace-definition:
21369 namespace original-namespace-name { namespace-body }
21371 unnamed-namespace-definition:
21372 namespace { namespace-body } */
21374 static void
21376 {
21377 tree identifier;
21387 {
21390 }
21392 /* Look for the `namespace' keyword. */
21393 cp_token* token
21396 /* Parse any specified attributes before the identifier. */
21400 {
21404 RID_INLINE);
21406 {
21410 "definitions only available with %<-std=c++20%> or "
21413 }
21416 {
21421 "standard attributes on namespaces must precede "
21424 /* Parse any attributes specified after the identifier. */
21426 }
21429 {
21430 /* Don't forget that the innermost namespace might have been
21431 marked as inline. Use |= because we cannot overwrite
21432 IS_INLINE in case the outermost namespace is inline, but
21433 there are no nested inlines. */
21436 }
21440 "nested namespace definitions only available with "
21443 /* Nested namespace names can create new namespaces (unlike
21444 other qualified-ids). */
21449 else
21452 }
21464 /* Start the namespace. */
21471 /* Look for the `{' to validate starting the namespace. */
21472 matching_braces braces;
21474 {
21475 /* Parse the body of the namespace. */
21478 /* Look for the final `}'. */
21480 }
21485 /* Pop the nested namespace definitions. */
21488 }
21490 /* Parse a namespace-body.
21492 namespace-body:
21493 declaration-seq [opt] */
21495 static void
21497 {
21499 }
21501 /* Parse a namespace-alias-definition.
21503 namespace-alias-definition:
21504 namespace identifier = qualified-namespace-specifier ; */
21506 static void
21508 {
21509 tree identifier;
21510 tree namespace_specifier;
21514 /* Look for the `namespace' keyword. */
21516 /* Look for the identifier. */
21520 /* Look for the `=' token. */
21523 {
21525 /* Skip the definition. */
21530 }
21532 /* Look for the qualified-namespace-specifier. */
21533 namespace_specifier
21536 /* Look for the `;' token. */
21539 /* Register the alias in the symbol table. */
21541 }
21543 /* Parse a qualified-namespace-specifier.
21545 qualified-namespace-specifier:
21546 :: [opt] nested-name-specifier [opt] namespace-name
21548 Returns a NAMESPACE_DECL corresponding to the specified
21549 namespace. */
21551 static tree
21553 {
21554 /* Look for the optional `::'. */
21558 /* Look for the optional nested-name-specifier. */
21566 }
21568 /* Subroutine of cp_parser_using_declaration. */
21570 static tree
21572 {
21575 {
21576 /* Create the USING_DECL. */
21585 /* Add it to the list of members in this class. */
21587 }
21588 else
21591 }
21593 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
21594 access declaration.
21596 using-declaration:
21597 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
21598 using :: unqualified-id ;
21600 access-declaration:
21601 qualified-id ;
21603 */
21605 static bool
21608 {
21612 tree identifier;
21613 tree qscope;
21618 {
21621 }
21622 else
21623 {
21624 /* Look for the `using' keyword. */
21627 again:
21628 /* Peek at the next token. */
21630 /* See if it's `typename'. */
21632 {
21633 /* Remember that we've seen it. */
21635 /* Consume the `typename' token. */
21637 }
21638 }
21640 /* Look for the optional global scope qualification. */
21641 global_scope_p
21646 /* If we saw `typename', or didn't see `::', then there must be a
21647 nested-name-specifier present. */
21649 {
21655 {
21658 }
21659 }
21660 /* Otherwise, we could be in either of the two productions. In that
21661 case, treat the nested-name-specifier as optional. */
21662 else
21674 /* Something has already gone wrong; there's no need to parse
21675 further. Since an error has occurred, the return value of
21676 cp_parser_parse_definitely will be false, as required. */
21680 /* Parse the unqualified-id. */
21688 {
21693 }
21695 {
21699 "pack expansion in using-declaration only available "
21702 }
21704 /* The function we call to handle a using-declaration is different
21705 depending on what scope we are in. */
21707 ;
21710 /* [namespace.udecl]
21712 A using declaration shall not name a template-id. */
21715 else
21716 {
21720 {
21723 }
21724 }
21728 {
21732 "comma-separated list in using-declaration only available "
21735 }
21737 /* Look for the final `;'. */
21742 "access declarations are deprecated "
21743 "in favour of using-declarations; "
21747 }
21749 /* C++20 using enum declaration.
21751 using-enum-declaration :
21752 using elaborated-enum-specifier ; */
21754 static void
21756 {
21759 /* Using cp_parser_elaborated_type_specifier rejects typedef-names, which
21760 breaks one of the motivating examples in using-enum-5.C.
21761 cp_parser_simple_type_specifier seems to be closer to what we actually
21762 want, though that hasn't been properly specified yet. */
21764 /* Consume 'enum'. */
21770 tree type = (cp_parser_simple_type_specifier
21777 {
21780 }
21784 /* The elaborated-enum-specifier shall not name a dependent type and the type
21785 shall have a reachable enum-specifier. */
21799 {
21801 auto_diagnostic_group g;
21805 ;
21808 else
21810 }
21812 /* A using-enum-declaration introduces the enumerator names of the named
21813 enumeration as if by a using-declaration for each enumerator. */
21817 }
21819 /* Parse an alias-declaration.
21821 alias-declaration:
21822 using identifier attribute-specifier-seq [opt] = type-id */
21824 static tree
21826 {
21830 cp_decl_specifier_seq decl_specs;
21834 /* Look for the `using' keyword. */
21835 cp_token *using_token
21857 /* Now we are going to parse the type-id of the declaration. */
21859 /*
21860 [dcl.type]/3 says:
21862 "A type-specifier-seq shall not define a class or enumeration
21863 unless it appears in the type-id of an alias-declaration (7.1.3) that
21864 is not the declaration of a template-declaration."
21866 In other words, if we currently are in an alias template, the
21867 type-id should not define a type.
21869 So let's set parser->type_definition_forbidden_message in that
21870 case; cp_parser_check_type_definition (called by
21871 cp_parser_class_specifier) will then emit an error if a type is
21872 defined in the type-id. */
21874 {
21878 }
21883 /* Restore the error message if need be. */
21889 {
21892 }
21894 /* A typedef-name can also be introduced by an alias-declaration. The
21895 identifier following the using keyword becomes a typedef-name. It has
21896 the same semantics as if it were introduced by the typedef
21897 specifier. In particular, it does not define a new type and it shall
21898 not appear in the type-id. */
21903 {
21906 ds_attribute,
21907 attrs_token);
21908 }
21910 ds_typedef,
21911 using_token);
21913 ds_alias,
21914 using_token);
21921 id_location,
21931 else
21942 /* If decl is a template, return its TEMPLATE_DECL so that it gets
21943 added into the symbol table; otherwise, return the TYPE_DECL. */
21947 {
21951 }
21954 }
21956 /* Parse a using-directive.
21958 using-directive:
21959 attribute-specifier-seq [opt] using namespace :: [opt]
21960 nested-name-specifier [opt] namespace-name ; */
21962 static void
21964 {
21965 tree namespace_decl;
21968 {
21969 /* Error during attribute parsing that resulted in skipping
21970 to next semicolon. */
21973 }
21975 /* Look for the `using' keyword. */
21977 /* And the `namespace' keyword. */
21979 /* Look for the optional `::' operator. */
21981 /* And the optional nested-name-specifier. */
21987 /* Get the namespace being used. */
21990 /* And any specified GNU attributes. */
21994 /* Update the symbol table. */
21997 /* Look for the final `;'. */
21999 }
22001 /* Parse an asm-definition.
22003 asm-qualifier:
22004 volatile
22005 inline
22006 goto
22008 asm-qualifier-list:
22009 asm-qualifier
22010 asm-qualifier-list asm-qualifier
22012 asm-definition:
22013 asm ( string-literal ) ;
22015 GNU Extension:
22017 asm-definition:
22018 asm asm-qualifier-list [opt] ( string-literal ) ;
22019 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt] ) ;
22020 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt]
22021 : asm-operand-list [opt] ) ;
22022 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt]
22023 : asm-operand-list [opt]
22024 : asm-clobber-list [opt] ) ;
22025 asm asm-qualifier-list [opt] ( string-literal : : asm-operand-list [opt]
22026 : asm-clobber-list [opt]
22027 : asm-goto-list ) ;
22029 The form with asm-goto-list is valid if and only if the asm-qualifier-list
22030 contains goto, and is the only allowed form in that case. No duplicates are
22031 allowed in an asm-qualifier-list. */
22033 static void
22035 {
22036 tree string;
22041 tree asm_stmt;
22048 /* Look for the `asm' keyword. */
22051 /* In C++20, unevaluated inline assembly is permitted in constexpr
22052 functions. */
22057 "function only available with %<-std=c++20%> or "
22060 /* Handle the asm-qualifier-list. */
22068 {
22072 {
22075 {
22079 }
22080 else
22081 {
22086 }
22092 {
22096 }
22097 else
22106 {
22110 }
22111 else
22126 }
22128 }
22135 {
22138 }
22140 /* Look for the opening `('. */
22143 /* Look for the string. */
22146 {
22150 }
22152 /* If we're allowing GNU extensions, check for the extended assembly
22153 syntax. Unfortunately, the `:' tokens need not be separated by
22154 a space in C, and so, for compatibility, we tolerate that here
22155 too. Doing that means that we have to treat the `::' operator as
22156 two `:' tokens. */
22161 {
22166 /* The extended syntax was used. */
22169 /* Look for outputs. */
22171 {
22172 /* Consume the `:'. */
22174 /* Parse the output-operands. */
22176 CPP_COLON)
22178 CPP_SCOPE)
22180 CPP_CLOSE_PAREN))
22181 {
22185 }
22186 }
22187 /* If the next token is `::', there are no outputs, and the
22188 next token is the beginning of the inputs. */
22190 /* The inputs are coming next. */
22193 /* Look for inputs. */
22196 {
22197 /* Consume the `:' or `::'. */
22199 /* Parse the output-operands. */
22201 CPP_COLON)
22203 CPP_SCOPE)
22205 CPP_CLOSE_PAREN))
22206 {
22210 }
22211 }
22213 /* The clobbers are coming next. */
22216 /* Look for clobbers. */
22219 {
22221 /* Consume the `:' or `::'. */
22223 /* Parse the clobbers. */
22225 CPP_COLON)
22227 CPP_CLOSE_PAREN))
22229 }
22231 /* The labels are coming next. */
22234 /* Look for labels. */
22237 {
22239 /* Consume the `:' or `::'. */
22241 /* Parse the labels. */
22243 }
22247 }
22251 /* Look for the closing `)'. */
22259 {
22260 /* Create the ASM_EXPR. */
22262 {
22265 /* If the extended syntax was not used, mark the ASM_EXPR. */
22267 {
22273 }
22274 }
22275 else
22277 }
22278 }
22280 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
22281 type that comes from the decl-specifier-seq. */
22283 static tree
22285 {
22288 {
22301 }
22304 }
22306 /* Warn about the most vexing parse syntactic ambiguity, i.e., warn when
22307 a construct looks like a variable definition but is actually a function
22308 declaration. DECL_SPECIFIERS is the decl-specifier-seq and DECLARATOR
22309 is the declarator for this function declaration. */
22311 static void
22314 {
22315 /* Only warn if we are declaring a function at block scope. */
22319 /* And only if there is no storage class specified. */
22331 /* Don't warn when the whole declarator (not just the declarator-id!)
22332 was parenthesized. That is, don't warn for int(n()) but do warn
22333 for int(f)(). */
22337 tree type;
22339 {
22344 /* If the return type is void there is no ambiguity. */
22347 }
22349 /* Code like long f(); will have null ->type. If we have any
22350 type-specifiers, pretend we've seen int. */
22352 else
22355 auto_diagnostic_group d;
22360 /* The T t() case. */
22362 {
22364 "empty parentheses were disambiguated as a function "
22366 {
22367 /* () means value-initialization (C++03 and up); {} (C++11 and up)
22368 means value-initialization or aggregate-initialization, nothing
22369 means default-initialization. We can only suggest removing the
22370 parentheses/adding {} if T has a default constructor. */
22372 {
22378 {
22382 else
22385 }
22386 }
22387 }
22389 }
22391 /* If we had (...) or the parameter-list wasn't parenthesized,
22392 we're done. */
22396 /* The T t(X()) case. */
22398 {
22400 "parentheses were disambiguated as a function "
22402 {
22404 /* {}-initialization means that we can use an initializer-list
22405 constructor if no default constructor is available, so don't
22406 suggest using {} for classes that have an initializer_list
22407 constructor. */
22409 {
22414 }
22415 else
22416 {
22420 }
22421 }
22422 }
22423 /* The T t(X(), X()) case. */
22425 "parentheses were disambiguated as a function "
22427 {
22430 {
22435 }
22436 }
22437 }
22439 /* If DECLARATOR with DECL_SPECS is a function declarator that has
22440 the form of a deduction guide, tag it as such. CTOR_DTOR_OR_CONV_P
22441 has the same meaning as in cp_parser_declarator. */
22443 static void
22448 {
22454 {
22462 {
22466 }
22467 }
22468 }
22470 /* Declarators [gram.dcl.decl] */
22472 /* Parse an init-declarator.
22474 init-declarator:
22475 declarator initializer [opt]
22477 GNU Extension:
22479 init-declarator:
22480 declarator asm-specification [opt] attributes [opt] initializer [opt]
22482 function-definition:
22483 decl-specifier-seq [opt] declarator ctor-initializer [opt]
22484 function-body
22485 decl-specifier-seq [opt] declarator function-try-block
22487 GNU Extension:
22489 function-definition:
22490 __extension__ function-definition
22492 TM Extension:
22494 function-definition:
22495 decl-specifier-seq [opt] declarator function-transaction-block
22497 The parser flags FLAGS is used to control type-specifier parsing.
22499 The DECL_SPECIFIERS apply to this declarator. Returns a
22500 representation of the entity declared. If MEMBER_P is TRUE, then
22501 this declarator appears in a class scope. The new DECL created by
22502 this declarator is returned.
22504 The CHECKS are access checks that should be performed once we know
22505 what entity is being declared (and, therefore, what classes have
22506 befriended it).
22508 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
22509 for a function-definition here as well. If the declarator is a
22510 declarator for a function-definition, *FUNCTION_DEFINITION_P will
22511 be TRUE upon return. By that point, the function-definition will
22512 have been completely parsed.
22514 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
22515 is FALSE.
22517 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
22518 parsed declaration if it is an uninitialized single declarator not followed
22519 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
22520 if present, will not be consumed. If returned, this declarator will be
22521 created with SD_INITIALIZED but will not call cp_finish_decl.
22523 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
22524 and there is an initializer, the pointed location_t is set to the
22525 location of the '=' or `(', or '{' in C++11 token introducing the
22526 initializer. */
22528 static tree
22530 cp_parser_flags flags,
22540 {
22544 tree prefix_attributes;
22546 tree asm_specification;
22547 tree initializer;
22549 tree scope;
22551 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
22552 initialized with "= ..", CPP_OPEN_PAREN if initialized with
22553 "(...)". */
22568 /* Assume that this is not the declarator for a function
22569 definition. */
22573 /* Default arguments are only permitted for function parameters. */
22577 /* Defer access checks while parsing the declarator; we cannot know
22578 what names are accessible until we know what is being
22579 declared. */
22584 /* Parse the declarator. */
22585 declarator
22590 /* Gather up the deferred checks. */
22595 /* If the DECLARATOR was erroneous, there's no need to go
22596 further. */
22600 /* Check that the number of template-parameter-lists is OK. */
22610 /* Figure out what scope the entity declared by the DECLARATOR is
22611 located in. `grokdeclarator' sometimes changes the scope, so
22612 we compute it now. */
22615 /* Perform any lookups in the declared type which were thought to be
22616 dependent, but are not in the scope of the declarator. */
22617 decl_specifiers->type
22620 /* If we're allowing GNU extensions, look for an
22621 asm-specification. */
22623 {
22624 /* Look for an asm-specification. */
22627 }
22628 else
22631 /* Gather the attributes that were provided with the
22632 decl-specifiers. */
22635 /* Look for attributes. */
22639 /* Peek at the next token. */
22645 {
22646 /* Handle C++17 deduction guides. Note that class-scope
22647 non-template deduction guides are instead handled in
22648 cp_parser_member_declaration. */
22650 decl_specifiers,
22651 declarator,
22657 /* Check to see if the token indicates the start of a
22658 function-definition. */
22660 {
22662 {
22663 /* If a function-definition should not appear here, issue an
22664 error message. */
22668 }
22670 location_t func_brace_location
22673 /* Neither attributes nor an asm-specification are allowed
22674 on a function-definition. */
22677 "an %<asm%> specification is not allowed "
22681 "attributes are not allowed "
22683 /* This is a function-definition. */
22686 /* Parse the function definition. */
22689 decl_specifiers,
22690 declarator,
22691 prefix_attributes);
22692 else
22693 decl =
22694 (cp_parser_function_definition_from_specifiers_and_declarator
22698 {
22699 /* This is where the prologue starts... */
22702 }
22705 }
22706 }
22708 {
22709 /* A non-template declaration involving a function parameter list
22710 containing an implicit template parameter will be made into a
22711 template. If the resulting declaration is not going to be an
22712 actual function then finish the template scope here to prevent it.
22713 An error message will be issued once we have a decl to talk about.
22715 FIXME probably we should do type deduction rather than create an
22716 implicit template, but the standard currently doesn't allow it. */
22719 }
22721 /* [dcl.dcl]
22723 Only in function declarations for constructors, destructors, type
22724 conversions, and deduction guides can the decl-specifier-seq be omitted.
22726 We explicitly postpone this check past the point where we handle
22727 function-definitions because we tolerate function-definitions
22728 that are missing their return types in some modes. */
22730 {
22734 }
22736 /* An `=' or an '{' in C++11, indicate an initializer. An '(' may indicate
22737 an initializer as well. */
22741 {
22742 /* Don't get fooled into thinking that F(i)(1)(2) is an initializer.
22743 It isn't; it's an expression. (Here '(i)' would have already been
22744 parsed as a declarator.) */
22747 {
22754 /* If this is an initializer, only a ',' or ';' can follow: either
22755 we have another init-declarator, or we're at the end of an
22756 init-declarator-list which can only be followed by a ';'. */
22761 /* Not an init-declarator. */
22763 }
22775 {
22781 }
22782 }
22783 else
22784 {
22785 /* If the init-declarator isn't initialized and isn't followed by a
22786 `,' or `;', it's not a valid init-declarator. */
22789 {
22792 else
22793 {
22797 }
22798 }
22801 }
22803 /* Because start_decl has side-effects, we should only call it if we
22804 know we're going ahead. By this point, we know that we cannot
22805 possibly be looking at any other construct. */
22808 /* Enter the newly declared entry in the symbol table. If we're
22809 processing a declaration in a class-specifier, we wait until
22810 after processing the initializer. */
22812 {
22820 /* Adjust location of decl if declarator->id_loc is more appropriate:
22821 set, and decl wasn't merged with another decl, in which case its
22822 location would be different from input_location, and more accurate. */
22827 }
22829 /* Enter the SCOPE. That way unqualified names appearing in the
22830 initializer will be looked up in SCOPE. */
22833 /* Perform deferred access control checks, now that we know in which
22834 SCOPE the declared entity resides. */
22836 {
22839 /* If the entity being declared is a function, pretend that we
22840 are in its scope. If it is a `friend', it may have access to
22841 things that would not otherwise be accessible. */
22843 {
22846 }
22848 /* Perform access checks for template parameters. */
22851 /* Perform the access control checks for the declarator and the
22852 decl-specifiers. */
22855 /* Restore the saved value. */
22858 }
22860 /* Parse the initializer. */
22865 {
22867 {
22870 else
22871 {
22872 /* If the declaration was erroneous, we don't really
22873 know what the user intended, so just silently
22874 consume the initializer. */
22881 }
22882 }
22883 else
22884 {
22885 /* We want to record the extra mangling scope for in-class
22886 initializers of class members and initializers of static
22887 data member templates and namespace-scope initializers.
22888 The former involves deferring parsing of the initializer
22889 until end of class as with default arguments. So right
22890 here we only handle the latter two. */
22894 && !member_p
22907 }
22908 }
22910 /* The old parser allows attributes to appear after a parenthesized
22911 initializer. Mark Mitchell proposed removing this functionality
22912 on the GCC mailing lists on 2002-08-13. This parser accepts the
22913 attributes -- but ignores them. Made a permerror in GCC 8. */
22919 {
22922 {
22926 }
22927 }
22929 /* And now complain about a non-function implicit template. */
22934 /* For an in-class declaration, use `grokfield' to create the
22935 declaration. */
22937 {
22939 {
22942 }
22951 }
22953 /* Finish processing the declaration. But, skip member
22954 declarations. */
22956 {
22959 asm_specification,
22960 /* If the initializer is in parentheses, then this is
22961 a direct-initialization, which means that an
22962 `explicit' constructor is OK. Otherwise, an
22963 `explicit' constructor cannot be used. */
22966 }
22969 /* Core issue #226 (C++0x only): A default template-argument
22970 shall not be specified in a friend class template
22971 declaration. */
22980 {
22983 else
22985 }
22992 }
22994 /* Parse a declarator.
22996 declarator:
22997 direct-declarator
22998 ptr-operator declarator
23000 abstract-declarator:
23001 ptr-operator abstract-declarator [opt]
23002 direct-abstract-declarator
23004 GNU Extensions:
23006 declarator:
23007 attributes [opt] direct-declarator
23008 attributes [opt] ptr-operator declarator
23010 abstract-declarator:
23011 attributes [opt] ptr-operator abstract-declarator [opt]
23012 attributes [opt] direct-abstract-declarator
23014 The parser flags FLAGS is used to control type-specifier parsing.
23016 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
23017 detect constructors, destructors, deduction guides, or conversion operators.
23018 It is set to -1 if the declarator is a name, and +1 if it is a
23019 function. Otherwise it is set to zero. Usually you just want to
23020 test for >0, but internally the negative value is used.
23022 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
23023 a decl-specifier-seq unless it declares a constructor, destructor,
23024 or conversion. It might seem that we could check this condition in
23025 semantic analysis, rather than parsing, but that makes it difficult
23026 to handle something like `f()'. We want to notice that there are
23027 no decl-specifiers, and therefore realize that this is an
23028 expression, not a declaration.)
23030 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
23031 the declarator is a direct-declarator of the form "(...)".
23033 MEMBER_P is true iff this declarator is a member-declarator.
23035 FRIEND_P is true iff this declarator is a friend.
23037 STATIC_P is true iff the keyword static was seen. */
23041 cp_parser_declarator_kind dcl_kind,
23042 cp_parser_flags flags,
23046 {
23049 cp_cv_quals cv_quals;
23050 tree class_type;
23053 /* Assume this is not a constructor, destructor, or type-conversion
23054 operator. */
23061 /* Check for the ptr-operator production. */
23063 /* Parse the ptr-operator. */
23069 /* If that worked, then we have a ptr-operator. */
23071 {
23072 /* If a ptr-operator was found, then this declarator was not
23073 parenthesized. */
23076 /* The dependent declarator is optional if we are parsing an
23077 abstract-declarator. */
23081 /* Parse the dependent declarator. */
23087 /* If we are parsing an abstract-declarator, we must handle the
23088 case where the dependent declarator is absent. */
23093 declarator = cp_parser_make_indirect_declarator
23095 }
23096 /* Everything else is a direct-declarator. */
23097 else
23098 {
23101 CPP_OPEN_PAREN);
23105 }
23110 }
23112 /* Parse a direct-declarator or direct-abstract-declarator.
23114 direct-declarator:
23115 declarator-id
23116 direct-declarator ( parameter-declaration-clause )
23117 cv-qualifier-seq [opt]
23118 ref-qualifier [opt]
23119 exception-specification [opt]
23120 direct-declarator [ constant-expression [opt] ]
23121 ( declarator )
23123 direct-abstract-declarator:
23124 direct-abstract-declarator [opt]
23125 ( parameter-declaration-clause )
23126 cv-qualifier-seq [opt]
23127 ref-qualifier [opt]
23128 exception-specification [opt]
23129 direct-abstract-declarator [opt] [ constant-expression [opt] ]
23130 ( abstract-declarator )
23132 Returns a representation of the declarator. DCL_KIND is
23133 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
23134 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
23135 we are parsing a direct-declarator. It is
23136 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
23137 of ambiguity we prefer an abstract declarator, as per
23138 [dcl.ambig.res].
23139 The parser flags FLAGS is used to control type-specifier parsing.
23140 CTOR_DTOR_OR_CONV_P, MEMBER_P, FRIEND_P, and STATIC_P are
23141 as for cp_parser_declarator. */
23145 cp_parser_declarator_kind dcl_kind,
23146 cp_parser_flags flags,
23149 {
23160 {
23161 /* Peek at the next token. */
23164 {
23165 /* This is either a parameter-declaration-clause, or a
23166 parenthesized declarator. When we know we are parsing a
23167 named declarator, it must be a parenthesized declarator
23168 if FIRST is true. For instance, `(int)' is a
23169 parameter-declaration-clause, with an omitted
23170 direct-abstract-declarator. But `((*))', is a
23171 parenthesized abstract declarator. Finally, when T is a
23172 template parameter `(T)' is a
23173 parameter-declaration-clause, and not a parenthesized
23174 named declarator.
23176 We first try and parse a parameter-declaration-clause,
23177 and then try a nested declarator (if FIRST is true).
23179 It is not an error for it not to be a
23180 parameter-declaration-clause, even when FIRST is
23181 false. Consider,
23183 int i (int);
23184 int i (3);
23186 The first is the declaration of a function while the
23187 second is the definition of a variable, including its
23188 initializer.
23190 Having seen only the parenthesis, we cannot know which of
23191 these two alternatives should be selected. Even more
23192 complex are examples like:
23194 int i (int (a));
23195 int i (int (3));
23197 The former is a function-declaration; the latter is a
23198 variable initialization.
23200 Thus again, we try a parameter-declaration-clause, and if
23201 that fails, we back out and return. */
23204 {
23205 tree params;
23210 /* In a member-declarator, the only valid interpretation
23211 of a parenthesis is the start of a
23212 parameter-declaration-clause. (It is invalid to
23213 initialize a static data member with a parenthesized
23214 initializer; only the "=" form of initialization is
23215 permitted.) */
23219 /* Consume the `('. */
23221 matching_parens parens;
23224 {
23225 /* If this is going to be an abstract declarator, we're
23226 in a declarator and we can't have default args. */
23229 }
23233 /* Parse the parameter-declaration-clause. */
23234 params
23236 const location_t parens_end
23239 /* Consume the `)'. */
23242 /* If all went well, parse the cv-qualifier-seq,
23243 ref-qualifier and the exception-specification. */
23245 {
23246 cp_cv_quals cv_quals;
23247 cp_virt_specifiers virt_specifiers;
23248 cp_ref_qualifier ref_qual;
23249 tree exception_specification;
23250 tree late_return;
23251 tree attrs;
23254 unsigned char local_variables_forbidden_p
23256 /* 'this' is not allowed in static member functions. */
23266 /* Parse the cv-qualifier-seq. */
23268 /* Parse the ref-qualifier. */
23270 /* Parse the tx-qualifier. */
23276 /* DR 1207: 'this' is in scope after the cv-quals. */
23279 /* If it turned out that this is e.g. a pointer to a
23280 function, we don't want to delay noexcept parsing. */
23284 /* Parse the exception-specification. */
23285 exception_specification
23287 flags);
23291 cp_omp_declare_simd_data odsd;
23293 && declarator
23296 {
23300 }
23302 /* In here, we handle cases where attribute is used after
23303 the function declaration. For example:
23304 void func (int x) __attribute__((vector(..))); */
23307 late_return
23309 requires_clause);
23313 /* Parse the virt-specifier-seq. */
23317 parens_start,
23318 parens_end);
23319 /* Create the function-declarator. */
23321 params,
23322 cv_quals,
23323 virt_specifiers,
23324 ref_qual,
23325 tx_qual,
23326 exception_specification,
23327 late_return,
23328 requires_clause,
23329 attrs,
23330 parens_loc);
23332 /* Any subsequent parameter lists are to do with
23333 return type, so are not those of the declared
23334 function. */
23340 /* Restore the state of local_variables_forbidden_p. */
23341 parser->local_variables_forbidden_p
23343 }
23345 /* Remove the function parms from scope. */
23349 /* Repeat the main loop. */
23351 }
23353 /* If this is the first, we can try a parenthesized
23354 declarator. */
23356 {
23363 /* Consume the `('. */
23364 matching_parens parens;
23366 /* Parse the nested declarator. */
23369 declarator
23371 ctor_dtor_or_conv_p,
23377 /* Expect a `)'. */
23385 }
23386 /* Otherwise, we must be done. */
23387 else
23389 }
23393 {
23394 /* Parse an array-declarator. */
23404 /* Consume the `['. */
23406 /* Peek at the next token. */
23408 /* If the next token is `]', then there is no
23409 constant-expression. */
23411 {
23413 bounds
23425 {
23426 /* Normally, the array bound must be an integral constant
23427 expression. However, as an extension, we allow VLAs
23428 in function scopes as long as they aren't part of a
23429 parameter declaration. */
23433 }
23436 {
23437 /* Remember this wasn't a constant-expression. */
23440 }
23441 }
23442 else
23444 /* Look for the closing `]'. */
23446 {
23449 }
23454 }
23456 {
23457 {
23458 tree qualifying_scope;
23459 tree unqualified_name;
23460 tree attrs;
23461 special_function_kind sfk;
23466 /* Parse a declarator-id */
23469 {
23472 /* If we see an ellipsis, we should be looking at a
23473 parameter pack. */
23475 {
23476 /* Consume the `...' */
23480 }
23481 }
23484 unqualified_name
23488 {
23492 {
23493 /* Check whether an error occurred. */
23496 /* We already consumed the ellipsis to mark a
23497 parameter pack, but we have no way to report it,
23498 so abort the tentative parse. We will be exiting
23499 immediately anyway. */
23501 }
23502 else
23508 && (qualifying_scope
23510 {
23513 }
23514 }
23519 {
23524 }
23530 {
23531 /* In the declaration of a member of a template class
23532 outside of the class itself, the SCOPE will sometimes
23533 be a TYPENAME_TYPE. For example, given:
23535 template <typename T>
23536 int S<T>::R::i = 3;
23538 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
23539 this context, we must resolve S<T>::R to an ordinary
23540 type, rather than a typename type.
23542 The reason we normally avoid resolving TYPENAME_TYPEs
23543 is that a specialization of `S' might render
23544 `S<T>::R' not a type. However, if `S' is
23545 specialized, then this `i' will not be used, so there
23546 is no harm in resolving the types here. */
23547 tree type;
23549 /* Resolve the TYPENAME_TYPE. */
23552 /* If that failed, the declarator is invalid. */
23554 {
23557 "cannot define member of dependent typedef "
23559 else
23564 }
23566 }
23571 {
23572 tree class_type;
23577 else
23581 {
23585 {
23586 /* We do not attempt to print the declarator
23587 here because we do not have enough
23588 information about its original syntactic
23589 form. */
23593 }
23596 {
23600 "use %<%T::%D%> instead of %<%T::%D%> to "
23602 class_type,
23607 }
23609 }
23612 {
23619 for an unnamed type, even if the type
23620 got a name for linkage purposes. */
23622 /* Handle correctly (c++/19200):
23624 struct S {
23625 struct T{};
23626 friend void S(T);
23627 };
23629 and also:
23631 namespace N {
23632 void S();
23633 }
23635 struct S {
23636 friend void N::S();
23637 }; */
23640 class_type))
23649 }
23650 }
23652 unqualified_name,
23660 /* We're looking for this case in [temp.res]:
23661 A qualified-id is assumed to name a type if [...]
23662 - it is a decl-specifier of the decl-specifier-seq of a
23663 parameter-declaration in a declarator of a function or
23664 function template declaration, ... */
23670 {
23671 /* ...whose declarator-id is qualified. If it isn't, never
23672 assume the parameters to refer to types. */
23675 else
23676 {
23677 /* Now we have something like
23678 template <typename T> int C::x(S::p);
23679 which can be a function template declaration or a
23680 variable template definition. If name lookup for
23681 the declarator-id C::x finds one or more function
23682 templates, assume S::p to name a type. Otherwise,
23683 don't. */
23684 tree decl
23686 none_type,
23694 /* Allow
23695 template<typename T>
23696 A<T>::A(T::type) { } */
23699 qualifying_scope)))
23701 }
23702 }
23703 }
23705 handle_declarator:;
23708 {
23709 /* Any names that appear after the declarator-id for a
23710 member are looked up in the containing scope. */
23712 {
23713 /* But declarations with qualified-ids can't appear in a
23714 function. */
23718 }
23720 }
23724 /* Default args are only allowed on function
23725 declarations. */
23727 else
23731 }
23732 /* We're done. */
23733 else
23735 }
23737 /* For an abstract declarator, we might wind up with nothing at this
23738 point. That's an error; the declarator is not optional. */
23742 {
23743 /* Record overly parenthesized declarator so we can give a
23744 diagnostic about confusing decl/expr disambiguation. */
23746 {
23747 /* If the open and close parens are on different lines, this
23748 is probably a formatting thing, so ignore. */
23753 }
23758 }
23760 /* If we entered a scope, we must exit it now. */
23768 }
23770 /* Parse a ptr-operator.
23772 ptr-operator:
23773 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
23774 * cv-qualifier-seq [opt]
23775 &
23776 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
23777 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
23779 GNU Extension:
23781 ptr-operator:
23782 & cv-qualifier-seq [opt]
23784 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
23785 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
23786 an rvalue reference. In the case of a pointer-to-member, *TYPE is
23787 filled in with the TYPE containing the member. *CV_QUALS is
23788 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
23789 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
23790 Note that the tree codes returned by this function have nothing
23791 to do with the types of trees that will be eventually be created
23792 to represent the pointer or reference type being parsed. They are
23793 just constants with suggestive names. */
23794 static enum tree_code
23799 {
23804 /* Assume that it's not a pointer-to-member. */
23806 /* And that there are no cv-qualifiers. */
23809 /* Peek at the next token. */
23812 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
23822 {
23823 /* Consume the `*', `&' or `&&'. */
23826 /* A `*' can be followed by a cv-qualifier-seq, and so can a
23827 `&', if we are allowing GNU extensions. (The only qualifier
23828 that can legally appear after `&' is `restrict', but that is
23829 enforced during semantic analysis. */
23837 }
23838 else
23839 {
23840 /* Try the pointer-to-member case. */
23842 /* Look for the optional `::' operator. */
23845 /* Look for the nested-name specifier. */
23852 /* If we found it, and the next token is a `*', then we are
23853 indeed looking at a pointer-to-member operator. */
23856 {
23857 /* Indicate that the `*' operator was used. */
23865 else
23866 {
23867 /* The type of which the member is a member is given by the
23868 current SCOPE. */
23870 /* The next name will not be qualified. */
23874 /* Look for optional c++11 attributes. */
23878 /* Look for the optional cv-qualifier-seq. */
23880 }
23881 }
23882 /* If that didn't work we don't have a ptr-operator. */
23885 }
23888 }
23890 /* Parse an (optional) cv-qualifier-seq.
23892 cv-qualifier-seq:
23893 cv-qualifier cv-qualifier-seq [opt]
23895 cv-qualifier:
23896 const
23897 volatile
23899 GNU Extension:
23901 cv-qualifier:
23902 __restrict__
23904 Returns a bitmask representing the cv-qualifiers. */
23906 static cp_cv_quals
23908 {
23912 {
23914 cp_cv_quals cv_qualifier;
23916 /* Peek at the next token. */
23918 /* See if it's a cv-qualifier. */
23920 {
23936 }
23942 {
23947 }
23948 else
23949 {
23952 }
23953 }
23956 }
23958 /* Parse an (optional) ref-qualifier
23960 ref-qualifier:
23961 &
23962 &&
23964 Returns cp_ref_qualifier representing ref-qualifier. */
23966 static cp_ref_qualifier
23968 {
23971 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
23976 {
23981 {
23993 }
23998 {
24001 }
24002 else
24003 {
24006 }
24007 }
24010 }
24012 /* Parse an optional tx-qualifier.
24014 tx-qualifier:
24015 transaction_safe
24016 transaction_safe_dynamic */
24018 static tree
24020 {
24023 {
24028 {
24032 {
24035 {
24038 }
24039 else
24041 }
24042 }
24043 }
24045 }
24047 /* Parse an (optional) virt-specifier-seq.
24049 virt-specifier-seq:
24050 virt-specifier virt-specifier-seq [opt]
24052 virt-specifier:
24053 override
24054 final
24056 Returns a bitmask representing the virt-specifiers. */
24058 static cp_virt_specifiers
24060 {
24064 {
24066 cp_virt_specifiers virt_specifier;
24068 /* Peek at the next token. */
24070 /* See if it's a virt-specifier-qualifier. */
24074 {
24077 }
24079 {
24082 }
24084 {
24086 }
24087 else
24091 {
24096 }
24097 else
24098 {
24101 }
24102 }
24104 }
24106 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
24107 is in scope even though it isn't real. */
24109 void
24111 {
24112 tree this_parm;
24115 {
24116 /* We don't clear this between NSDMIs. Is it already what we want? */
24123 }
24126 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
24128 current_class_ref
24131 }
24133 /* Return true iff our current scope is a non-static data member
24134 initializer. */
24136 bool
24138 {
24139 /* We recognize NSDMI context by the context-less 'this' pointer set up
24140 by the function above. */
24146 }
24148 /* True if we're parsing a function declarator. */
24150 bool
24152 {
24153 /* this_entity is NULL for a function parameter scope while parsing the
24154 declarator; it is set when parsing the body of the function. */
24157 }
24159 /* Parse a late-specified return type, if any. This is not a separate
24160 non-terminal, but part of a function declarator, which looks like
24162 -> trailing-type-specifier-seq abstract-declarator(opt)
24164 Returns the type indicated by the type-id.
24166 In addition to this, parse any queued up #pragma omp declare simd
24167 clauses, and #pragma acc routine clauses.
24169 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
24170 function. */
24172 static tree
24175 {
24179 && declarator
24183 && declarator
24186 /* Peek at the next token. */
24188 /* A late-specified return type is indicated by an initial '->'. */
24197 {
24198 /* Consume the ->. */
24202 }
24204 /* Function declarations may be followed by a trailing
24205 requires-clause. */
24209 declarator->attributes
24213 declarator->attributes
24218 }
24220 /* Parse a declarator-id.
24222 declarator-id:
24223 id-expression
24224 :: [opt] nested-name-specifier [opt] type-name
24226 In the `id-expression' case, the value returned is as for
24227 cp_parser_id_expression if the id-expression was an unqualified-id.
24228 If the id-expression was a qualified-id, then a SCOPE_REF is
24229 returned. The first operand is the scope (either a NAMESPACE_DECL
24230 or TREE_TYPE), but the second is still just a representation of an
24231 unqualified-id. */
24233 static tree
24235 {
24236 tree id;
24237 /* The expression must be an id-expression. Assume that qualified
24238 names are the names of types so that:
24240 template <class T>
24241 int S<T>::R::i = 3;
24243 will work; we must treat `S<T>::R' as the name of a type.
24244 Similarly, assume that qualified names are templates, where
24245 required, so that:
24247 template <class T>
24248 int S<T>::R<T>::i = 3;
24250 will work, too. */
24256 optional_p);
24260 }
24262 /* Parse a type-id.
24264 type-id:
24265 type-specifier-seq abstract-declarator [opt]
24267 The parser flags FLAGS is used to control type-specifier parsing.
24269 If IS_TEMPLATE_ARG is true, we are parsing a template argument.
24271 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
24272 i.e. we've just seen "->".
24274 Returns the TYPE specified. */
24276 static tree
24280 {
24281 cp_decl_specifier_seq type_specifier_seq;
24284 /* Parse the type-specifier-seq. */
24287 is_trailing_return,
24295 /* A bare template name as a template argument is a template template
24296 argument, not a placeholder, so fail parsing it as a type argument. */
24297 {
24301 }
24305 /* There might or might not be an abstract declarator. */
24307 /* Look for the declarator. */
24308 abstract_declarator
24315 /* Check to see if there really was a declarator. */
24320 /* The concepts TS allows 'auto' as a type-id. */
24323 /* DR 625 prohibits use of auto as a template-argument. We allow 'auto'
24324 outside the template-argument-list context here only for the sake of
24325 diagnostic: grokdeclarator then can emit a better error message for
24326 e.g. using T = auto. */
24332 && !auto_typeid_ok
24333 /* None of the valid uses of 'auto' in C++14 involve the type-id
24334 nonterminal, but it is valid in a trailing-return-type. */
24337 {
24338 /* A type-id with type 'auto' is only ok if the abstract declarator
24339 is a function declarator with a late-specified return type.
24341 A type-id with 'auto' is also valid in a trailing-return-type
24342 in a compound-requirement. */
24349 else
24350 {
24352 {
24355 {
24356 auto_diagnostic_group g;
24360 tmpl);
24362 tmpl);
24363 }
24366 auto_node);
24367 else
24369 }
24371 }
24372 }
24375 is_template_arg);
24376 }
24378 /* Wrapper for cp_parser_type_id_1. */
24380 static tree
24383 {
24385 }
24387 /* Wrapper for cp_parser_type_id_1. */
24389 static tree
24391 {
24392 tree r;
24394 parser->type_definition_forbidden_message
24399 {
24402 }
24404 }
24406 /* Wrapper for cp_parser_type_id_1. */
24408 static tree
24410 {
24413 }
24415 /* Parse a type-specifier-seq.
24417 type-specifier-seq:
24418 type-specifier type-specifier-seq [opt]
24420 GNU extension:
24422 type-specifier-seq:
24423 attributes type-specifier-seq [opt]
24425 The parser flags FLAGS is used to control type-specifier parsing.
24427 If IS_DECLARATION is true, we are at the start of a "condition" or
24428 exception-declaration, so we might be followed by a declarator-id.
24430 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
24431 i.e. we've just seen "->".
24433 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
24435 static void
24437 cp_parser_flags flags,
24441 {
24445 /* Clear the TYPE_SPECIFIER_SEQ. */
24449 /* In the context of a trailing return type, enum E { } is an
24450 elaborated-type-specifier followed by a function-body, not an
24451 enum-specifier. */
24455 /* Parse the type-specifiers and attributes. */
24457 {
24458 tree type_specifier;
24461 /* Check for attributes first. */
24463 {
24464 /* GNU attributes at the end of a declaration apply to the
24465 declaration as a whole, not to the trailing return type. So look
24466 ahead to see if these attributes are at the end. */
24469 {
24475 }
24476 type_specifier_seq->attributes
24480 }
24482 /* record the token of the beginning of the type specifier seq,
24483 for error reporting purposes*/
24487 /* Look for the type-specifier. */
24489 flags,
24490 type_specifier_seq,
24492 NULL,
24495 {
24496 /* If the first type-specifier could not be found, this is not a
24497 type-specifier-seq at all. */
24499 {
24500 /* Set in_declarator_p to avoid skipping to the semicolon. */
24512 }
24513 /* If subsequent type-specifiers could not be found, the
24514 type-specifier-seq is complete. */
24516 }
24519 /* The standard says that a condition can be:
24521 type-specifier-seq declarator = assignment-expression
24523 However, given:
24525 struct S {};
24526 if (int S = ...)
24528 we should treat the "S" as a declarator, not as a
24529 type-specifier. The standard doesn't say that explicitly for
24530 type-specifier-seq, but it does say that for
24531 decl-specifier-seq in an ordinary declaration. Perhaps it
24532 would be clearer just to allow a decl-specifier-seq here, and
24533 then add a semantic restriction that if any decl-specifiers
24534 that are not type-specifiers appear, the program is invalid. */
24537 }
24538 }
24540 /* Return whether the function currently being declared has an associated
24541 template parameter list. */
24543 static bool
24545 {
24558 }
24560 /* Parse a parameter-declaration-clause.
24562 parameter-declaration-clause:
24563 parameter-declaration-list [opt] ... [opt]
24564 parameter-declaration-list , ...
24566 The parser flags FLAGS is used to control type-specifier parsing.
24568 Returns a representation for the parameter declarations. A return
24569 value of NULL indicates a parameter-declaration-clause consisting
24570 only of an ellipsis. */
24572 static tree
24574 cp_parser_flags flags)
24575 {
24576 tree parameters;
24584 && !processing_template_parmlist
24585 && !processing_explicit_instantiation
24586 /* default_arg_ok_p tracks whether this is a parameter-clause for an
24587 actual function or a random abstract declarator. */
24593 /* Peek at the next token. */
24595 /* Check for trivial parameter-declaration-clauses. */
24597 {
24598 /* Consume the `...' token. */
24601 }
24603 /* There are no parameters. */
24605 /* Check for `(void)', too, which is a special case. */
24609 {
24610 /* Consume the `void' token. */
24612 /* There are no parameters. */
24614 }
24616 /* A vector of parameters that haven't been pushed yet. */
24619 /* Parse the parameter-declaration-list. */
24622 /* If a parse error occurred while parsing the
24623 parameter-declaration-list, then the entire
24624 parameter-declaration-clause is erroneous. */
24628 /* Peek at the next token. */
24630 /* If it's a `,', the clause should terminate with an ellipsis. */
24632 {
24633 /* Consume the `,'. */
24635 /* Expect an ellipsis. */
24636 ellipsis_p
24638 }
24639 /* It might also be `...' if the optional trailing `,' was
24640 omitted. */
24642 {
24643 /* Consume the `...' token. */
24645 /* And remember that we saw it. */
24647 }
24648 else
24651 /* A valid parameter-declaration-clause can only be followed by a ')'.
24652 So it's time to push all the parameters we have seen now that we
24653 know we have a valid declaration. Note that here we may not have
24654 committed yet, nor should we. Pushing here will detect the error
24655 of redefining a parameter. */
24660 /* Finish the parameter list. */
24665 }
24667 /* Parse a parameter-declaration-list.
24669 parameter-declaration-list:
24670 parameter-declaration
24671 parameter-declaration-list , parameter-declaration
24673 The parser flags FLAGS is used to control type-specifier parsing.
24674 PENDING_DECLS is a vector of parameters that haven't been pushed yet.
24676 Returns a representation of the parameter-declaration-list, as for
24677 cp_parser_parameter_declaration_clause. However, the
24678 `void_list_node' is never appended to the list. */
24680 static tree
24682 cp_parser_flags flags,
24684 {
24690 /* The special considerations that apply to a function within an
24691 unbraced linkage specifications do not apply to the parameters
24692 to the function. */
24693 saved_in_unbraced_linkage_specification_p
24697 /* Look for more parameters. */
24699 {
24704 /* Parse the parameter. */
24705 parameter
24710 /* We don't know yet if the enclosing context is unavailable or deprecated,
24711 so wait and deal with it in grokparms if appropriate. */
24715 {
24718 PARM,
24723 }
24727 /* If a parse error occurred parsing the parameter declaration,
24728 then the entire parameter-declaration-list is erroneous. */
24730 {
24733 }
24740 {
24741 /* We cannot always pushdecl while parsing tentatively because
24742 it may have side effects and we can't be sure yet if we're
24743 parsing a declaration, e.g.:
24745 S foo(int(x), int(x), int{x});
24747 where it's not clear if we're dealing with a constructor call
24748 or a function declaration until we've seen the last argument
24749 which breaks it up.
24750 It's safe to pushdecl so long as it doesn't result in a clash
24751 with an already-pushed parameter. But we don't delay pushing
24752 different parameters to handle
24754 S foo(int(i), decltype(i) j = 42);
24756 which is valid. */
24759 /* See if PARAMETERS already contains a parameter with the same
24760 DECL_NAME as DECL. */
24766 }())
24768 else
24770 }
24773 {
24777 }
24779 /* Add the new parameter to the list. */
24783 /* If the parameters were parenthesized, it's the case of
24784 T foo(X(x)) which looks like a variable definition but
24785 is a function declaration. */
24789 /* Peek at the next token. */
24792 /* These are for Objective-C++ */
24795 /* The parameter-declaration-list is complete. */
24798 {
24801 /* Peek at the next token. */
24803 /* If it's an ellipsis, then the list is complete. */
24806 /* Otherwise, there must be more parameters. Consume the
24807 `,'. */
24809 /* When parsing something like:
24811 int i(float f, double d)
24813 we can tell after seeing the declaration for "f" that we
24814 are not looking at an initialization of a variable "i",
24815 but rather at the declaration of a function "i".
24817 Due to the fact that the parsing of template arguments
24818 (as specified to a template-id) requires backtracking we
24819 cannot use this technique when inside a template argument
24820 list. */
24824 /* However, a parameter-declaration of the form
24825 "float(f)" (which is a valid declaration of a
24826 parameter "f") can also be interpreted as an
24827 expression (the conversion of "f" to "float"). */
24830 }
24831 else
24832 {
24840 }
24841 }
24843 parser->in_unbraced_linkage_specification_p
24846 /* Reset implicit_template_scope if we are about to leave the function
24847 parameter list that introduced it. Note that for out-of-line member
24848 definitions, there will be one or more class scopes before we get to
24849 the template parameter scope. */
24853 {
24857 {
24860 }
24861 }
24864 }
24866 /* Parse a parameter declaration.
24868 parameter-declaration:
24869 decl-specifier-seq ... [opt] declarator
24870 decl-specifier-seq declarator = assignment-expression
24871 decl-specifier-seq ... [opt] abstract-declarator [opt]
24872 decl-specifier-seq abstract-declarator [opt] = assignment-expression
24874 The parser flags FLAGS is used to control type-specifier parsing.
24876 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
24877 declares a template parameter. (In that case, a non-nested `>'
24878 token encountered during the parsing of the assignment-expression
24879 is not interpreted as a greater-than operator.)
24881 Returns a representation of the parameter, or NULL if an error
24882 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
24883 true iff the declarator is of the form "(p)". */
24887 cp_parser_flags flags,
24890 {
24892 cp_decl_specifier_seq decl_specifiers;
24894 tree default_argument;
24899 /* In a template parameter, `>' is not an operator.
24901 [temp.param]
24903 When parsing a default template-argument for a non-type
24904 template-parameter, the first non-nested `>' is taken as the end
24905 of the template parameter-list rather than a greater-than
24906 operator. */
24908 /* Type definitions may not appear in parameter types. */
24910 parser->type_definition_forbidden_message
24917 /* Parse the declaration-specifiers. */
24920 flags,
24924 /* [dcl.spec.auto.general]: "A placeholder-type-specifier of the form
24925 type-constraint opt auto can be used as a decl-specifier of the
24926 decl-specifier-seq of a parameter-declaration of a function declaration
24927 or lambda-expression..." but we must not synthesize an implicit template
24928 type parameter in its declarator. That is, in "void f(auto[auto{10}]);"
24929 we want to synthesize only the first auto. */
24933 /* Complain about missing 'typename' or other invalid type names. */
24938 /* If an error occurred, there's no reason to attempt to parse the
24939 rest of the declaration. */
24941 {
24944 }
24946 /* Peek at the next token. */
24949 /* If the next token is a `)', `,', `=', `>', or `...', then there
24950 is no declarator. However, when variadic templates are enabled,
24951 there may be a declarator following `...'. */
24956 {
24960 }
24961 /* Otherwise, there should be a declarator. */
24962 else
24963 {
24967 /* After seeing a decl-specifier-seq, if the next token is not a
24968 "(" or "{", there is no possibility that the code is a valid
24969 expression. Therefore, if parsing tentatively, we commit at
24970 this point. */
24972 /* In an expression context, having seen:
24974 (int((char ...
24976 we cannot be sure whether we are looking at a
24977 function-type (taking a "char" as a parameter) or a cast
24978 of some object of type "char" to "int". */
24982 {
24984 {
24987 /* This is a CTAD expression, not a parameter declaration. */
24989 }
24990 else
24992 }
24993 /* Parse the declarator. */
24996 CP_PARSER_DECLARATOR_EITHER,
24997 CP_PARSER_FLAGS_NONE,
24999 parenthesized_p,
25004 /* After the declarator, allow more attributes. */
25005 decl_specifiers.attributes
25009 /* If the declarator is a template parameter pack, remember that and
25010 clear the flag in the declarator itself so we don't get errors
25011 from grokdeclarator. */
25013 {
25016 }
25017 }
25019 /* If the next token is an ellipsis, and we have not seen a declarator
25020 name, and if either the type of the declarator contains parameter
25021 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
25022 for, eg, abbreviated integral type names), then we actually have a
25023 parameter pack expansion expression. Otherwise, leave the ellipsis
25024 for a C-style variadic function. */
25027 /* If a function parameter pack was specified and an implicit template
25028 parameter was introduced during cp_parser_parameter_declaration,
25029 change any implicit parameters introduced into packs. */
25034 {
25042 }
25045 {
25056 {
25057 /* Consume the `...'. */
25061 /* Build a pack expansion type */
25066 else
25068 }
25069 }
25071 /* The restriction on defining new types applies only to the type
25072 of the parameter, not to the default argument. */
25075 /* If the next token is `=', then process a default argument. */
25077 {
25082 /* If we are defining a class, then the tokens that make up the
25083 default argument must be saved and processed later. */
25089 /* A constrained-type-specifier may declare a type
25090 template-parameter. */
25092 default_argument
25095 /* A constrained-type-specifier may declare a
25096 template-template-parameter. */
25098 default_argument
25101 /* Outside of a class definition, we can just parse the
25102 assignment-expression. */
25103 else
25104 default_argument
25108 {
25110 "default arguments are only "
25112 }
25114 || template_parameter_pack_p
25117 {
25118 /* Find the name of the parameter pack. */
25125 template_parm_p
25131 else
25133 template_parm_p
25140 }
25141 }
25142 else
25148 /* Generate a location for the parameter, ranging from the start of the
25149 initial token to the end of the final token (using input_location for
25150 the latter, set up by cp_lexer_set_source_position_from_token when
25151 consuming tokens).
25153 If we have a identifier, then use it for the caret location, e.g.
25155 extern int callee (int one, int (*two)(int, int), float three);
25156 ~~~~~~^~~~~~~~~~~~~~
25158 otherwise, reuse the start location for the caret location e.g.:
25160 extern int callee (int one, int (*)(int, int), float three);
25161 ^~~~~~~~~~~~~~~~~
25163 */
25169 input_location);
25172 declarator,
25173 default_argument,
25174 param_loc,
25175 template_parameter_pack_p);
25176 }
25178 /* Parse a default argument and return it.
25180 TEMPLATE_PARM_P is true if this is a default argument for a
25181 non-type template parameter. */
25182 static tree
25184 {
25190 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
25191 set correctly. */
25198 /* Local variable names (and the `this' keyword) may not
25199 appear in a default argument. */
25202 /* Parse the assignment-expression. */
25207 /* The "this" pointer is not valid in a default argument. */
25209 {
25214 }
25215 default_argument
25217 /* Restore the "this" pointer. */
25219 {
25222 }
25231 }
25233 /* Parse a function-body.
25235 function-body:
25236 compound_statement */
25238 static void
25240 {
25244 }
25246 /* Parse a ctor-initializer-opt followed by a function-body. Return
25247 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
25248 is true we are parsing a function-try-block. */
25250 static void
25253 {
25255 const bool check_body_p
25263 {
25266 "function-try-block body of %<constexpr%> constructor only "
25268 else
25270 "function-try-block body of %<constexpr%> function only "
25272 }
25274 /* Begin the function body. */
25276 /* Parse the optional ctor-initializer. */
25279 /* If we're parsing a constexpr constructor definition, we need
25280 to check that the constructor body is indeed empty. However,
25281 before we get to cp_parser_function_body lot of junk has been
25282 generated, so we can't just check that we have an empty block.
25283 Rather we take a snapshot of the outermost block, and check whether
25284 cp_parser_function_body changed its state. */
25286 {
25290 }
25291 /* Parse the function-body. */
25295 /* Finish the function body. */
25297 }
25299 /* Parse an initializer.
25301 initializer:
25302 = initializer-clause
25303 ( expression-list )
25305 Returns an expression representing the initializer. If no
25306 initializer is present, NULL_TREE is returned.
25308 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
25309 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
25310 set to TRUE if there is no initializer present. If there is an
25311 initializer, and it is not a constant-expression, *NON_CONSTANT_P
25312 is set to true; otherwise it is set to false. */
25314 static tree
25317 {
25319 tree init;
25321 /* Peek at the next token. */
25324 /* Let our caller know whether or not this initializer was
25325 parenthesized. */
25327 /* Assume that the initializer is constant. */
25331 {
25332 /* Consume the `='. */
25334 /* Parse the initializer-clause. */
25336 }
25338 {
25343 non_constant_p);
25348 }
25350 {
25355 }
25356 else
25357 {
25358 /* Anything else is an error. */
25361 }
25367 }
25369 /* Parse an initializer-clause.
25371 initializer-clause:
25372 assignment-expression
25373 braced-init-list
25375 Returns an expression representing the initializer.
25377 If the `assignment-expression' production is used the value
25378 returned is simply a representation for the expression.
25380 Otherwise, calls cp_parser_braced_list. */
25382 static cp_expr
25384 {
25385 cp_expr initializer;
25387 /* Assume the expression is constant. */
25390 /* If it is not a `{', then we are looking at an
25391 assignment-expression. */
25393 {
25394 initializer
25397 non_constant_p);
25398 }
25399 else
25403 }
25405 /* Parse a brace-enclosed initializer list.
25407 braced-init-list:
25408 { initializer-list , [opt] }
25409 { designated-initializer-list , [opt] }
25410 { }
25412 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
25413 the elements of the initializer-list (or NULL, if the last
25414 production is used). The TREE_TYPE for the CONSTRUCTOR will be
25415 NULL_TREE. There is no way to detect whether or not the optional
25416 trailing `,' was provided. NON_CONSTANT_P is as for
25417 cp_parser_initializer. */
25419 static cp_expr
25421 {
25422 tree initializer;
25425 /* Consume the `{' token. */
25426 matching_braces braces;
25428 /* Create a CONSTRUCTOR to represent the braced-initializer. */
25430 /* If it's not a `}', then there is a non-trivial initializer. */
25432 {
25434 /* Parse the initializer list. */
25438 /* A trailing `,' token is allowed. */
25441 }
25442 else
25444 /* Now, there should be a trailing `}'. */
25451 /* Build a location of the form:
25452 { ... }
25453 ^~~~~~~
25454 with caret==start at the open brace, finish at the close brace. */
25458 }
25460 /* Consume tokens up to, but not including, the next non-nested closing `]'.
25461 Returns true iff we found a closing `]'. */
25463 static bool
25465 {
25469 {
25473 {
25477 /* FALLTHRU */
25480 /* If we've run out of tokens, then there is no closing `]'. */
25494 }
25496 /* Consume the current token, skipping it. */
25498 }
25499 }
25501 /* Consume tokens up to, and including, the next non-nested closing `]'.
25502 Returns true iff we found a closing `]'. */
25504 static bool
25506 {
25511 }
25513 /* Return true if we are looking at an array-designator, false otherwise. */
25515 static bool
25517 {
25518 /* Consume the `['. */
25523 /* Skip tokens until the next token is a closing square bracket.
25524 If we find the closing `]', and the next token is a `=', then
25525 we are looking at an array designator. */
25526 bool array_designator_p
25530 /* Roll back the tokens we skipped. */
25534 }
25536 /* Parse an initializer-list.
25538 initializer-list:
25539 initializer-clause ... [opt]
25540 initializer-list , initializer-clause ... [opt]
25542 C++20 Extension:
25544 designated-initializer-list:
25545 designated-initializer-clause
25546 designated-initializer-list , designated-initializer-clause
25548 designated-initializer-clause:
25549 designator brace-or-equal-initializer
25551 designator:
25552 . identifier
25554 GNU Extension:
25556 initializer-list:
25557 designation initializer-clause ...[opt]
25558 initializer-list , designation initializer-clause ...[opt]
25560 designation:
25561 . identifier =
25562 identifier :
25563 [ constant-expression ] =
25565 Returns a vec of constructor_elt. The VALUE of each elt is an expression
25566 for the initializer. If the INDEX of the elt is non-NULL, it is the
25567 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
25568 as for cp_parser_initializer. Set *DESIGNATED to a boolean whether there
25569 are any designators. */
25574 {
25579 /* Assume all of the expressions are constant. */
25585 /* Parse the rest of the list. */
25587 {
25589 tree designator;
25590 tree initializer;
25594 /* Handle the C++20 syntax, '. id ='. */
25602 {
25605 "C++ designated initializers only available with "
25607 /* Consume the `.'. */
25609 /* Consume the identifier. */
25612 /* Consume the `='. */
25614 }
25615 /* Also, if the next token is an identifier and the following one is a
25616 colon, we are looking at the GNU designated-initializer
25617 syntax. */
25622 {
25623 /* Warn the user that they are using an extension. */
25626 /* Consume the identifier. */
25628 /* Consume the `:'. */
25630 }
25631 /* Also handle C99 array designators, '[ const ] ='. */
25635 {
25636 /* In C++11, [ could start a lambda-introducer. */
25642 {
25645 }
25646 else
25647 {
25652 }
25657 && (!require_potential_rvalue_constant_expression
25661 /* Warn the user that they are using an extension. */
25664 }
25665 else
25669 {
25672 }
25676 {
25680 }
25684 /* Parse the initializer. */
25687 /* If any clause is non-constant, so is the entire initializer. */
25691 /* If we have an ellipsis, this is an initializer pack
25692 expansion. */
25694 {
25697 /* Consume the `...'. */
25704 /* Turn the initializer into an initializer expansion. */
25706 }
25708 /* Add it to the vector. */
25711 /* If the next token is not a comma, we have reached the end of
25712 the list. */
25716 /* Peek at the next token. */
25718 /* If the next token is a `}', then we're still done. An
25719 initializer-clause can have a trailing `,' after the
25720 initializer-list and before the closing `}'. */
25724 /* Suppress location wrappers in a long initializer to save memory
25725 (14179). The cutoff is chosen arbitrarily. */
25729 /* Look one level down because it's easy. Looking deeper would require
25730 passing down a nelts pointer, and I don't think multi-level massive
25731 initializers are common enough to justify this. */
25737 /* Consume the `,' token. */
25739 }
25741 /* The same identifier shall not appear in multiple designators
25742 of a designated-initializer-list. */
25744 {
25749 {
25751 {
25753 "%<.%s%> designator used multiple times in "
25757 }
25758 else
25760 }
25764 }
25770 }
25772 /* Classes [gram.class] */
25774 /* Parse a class-name.
25776 class-name:
25777 identifier
25778 template-id
25780 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
25781 to indicate that names looked up in dependent types should be
25782 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
25783 keyword has been used to indicate that the name that appears next
25784 is a template. TAG_TYPE indicates the explicit tag given before
25785 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
25786 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
25787 is the class being defined in a class-head. If ENUM_OK is TRUE,
25788 enum-names are also accepted.
25790 Returns the TYPE_DECL representing the class. */
25792 static tree
25801 {
25802 tree decl;
25805 /* All class-names start with an identifier. */
25808 {
25811 }
25813 /* PARSER->SCOPE can be cleared when parsing the template-arguments
25814 to a template-id, so we save it here. Consider object scope too,
25815 so that make_typename_type below can use it (cp_parser_template_name
25816 considers object scope also). This may happen with code like
25818 p->template A<T>::a()
25820 where we first want to look up A<T>::a in the class of the object
25821 expression, as per [basic.lookup.classref]. */
25823 /* This only checks parser->scope to avoid duplicate errors; if
25824 ->object_type is erroneous, go on to give a parse error. */
25828 /* Any name names a type if we're following the `typename' keyword
25829 in a qualified name where the enclosing scope is type-dependent. */
25834 /* Handle the common case (an identifier, but not a template-id)
25835 efficiently. */
25838 {
25842 /* Look for the identifier. */
25846 /* If the next token isn't an identifier, we are certainly not
25847 looking at a class-name. */
25850 /* If we know this is a type-name, there's no need to look it
25851 up. */
25854 else
25855 {
25856 tree ambiguous_decls;
25857 /* If we already know that this lookup is ambiguous, then
25858 we've already issued an error message; there's no reason
25859 to check again. */
25861 {
25864 }
25865 /* If the next token is a `::', then the name must be a type
25866 name.
25868 [basic.lookup.qual]
25870 During the lookup for a name preceding the :: scope
25871 resolution operator, object, function, and enumerator
25872 names are ignored. */
25875 /* Look up the name. */
25877 tag_type,
25880 check_dependency_p,
25884 {
25888 }
25889 }
25890 }
25891 else
25892 {
25893 /* Try a template-id. */
25895 check_dependency_p,
25896 tag_type,
25897 is_declaration);
25900 }
25904 /* If this is a typename, create a TYPENAME_TYPE. */
25906 {
25911 }
25915 /* Check to see that it is really the name of a class. */
25919 /* Situations like this:
25921 template <typename T> struct A {
25922 typename T::template X<int>::I i;
25923 };
25925 are problematic. Is `T::template X<int>' a class-name? The
25926 standard does not seem to be definitive, but there is no other
25927 valid interpretation of the following `::'. Therefore, those
25928 names are considered class-names. */
25929 {
25933 }
25938 /* In Objective-C 2.0, a classname followed by '.' starts a
25939 dot-syntax expression, and it's not a type-name. */
25951 }
25953 /* Make sure that any member-function parameters are in scope.
25954 For instance, a function's noexcept-specifier can use the function's
25955 parameters:
25957 struct S {
25958 void fn (int p) noexcept(noexcept(p));
25959 };
25961 so we need to make sure name lookup can find them. This is used
25962 when we delay parsing of the noexcept-specifier. */
25964 static void
25966 {
25973 {
25977 }
25978 }
25980 /* Undo the effects of inject_parm_decls. */
25982 static void
25984 {
25987 }
25989 /* Parse a class-specifier.
25991 class-specifier:
25992 class-head { member-specification [opt] }
25994 Returns the TREE_TYPE representing the class. */
25996 tree
25998 {
26001 tree type;
26015 /* Parse the class-head. */
26018 /* If the class-head was a semantic disaster, skip the entire body
26019 of the class. */
26021 {
26025 }
26027 /* Look for the `{'. */
26028 matching_braces braces;
26030 {
26033 }
26038 /* Issue an error message if type-definitions are forbidden here. */
26040 /* Remember that we are defining one more class. */
26042 /* Inside the class, surrounding template-parameter-lists do not
26043 apply. */
26044 saved_num_template_parameter_lists
26047 /* We are not in a function body. */
26050 /* Or in a loop. */
26053 /* Or in a switch. */
26056 /* We are not immediately inside an extern "lang" block. */
26057 saved_in_unbraced_linkage_specification_p
26061 /* Start the class. */
26063 {
26065 /* SCOPE must be a scope nested inside current scope. */
26069 else
26071 }
26075 /* If the type is erroneous, skip the entire body of the class. */
26077 else
26078 /* Parse the member-specification. */
26081 /* Look for the trailing `}'. */
26083 /* Look for trailing attributes to apply to this class. */
26091 /* We've finished a type definition. Check for the common syntax
26092 error of forgetting a semicolon after the definition. We need to
26093 be careful, as we can't just check for not-a-semicolon and be done
26094 with it; the user might have typed:
26096 class X { } c = ...;
26097 class X { } *p = ...;
26099 and so forth. Instead, enumerate all the possible tokens that
26100 might follow this production; if we don't see one of them, then
26101 complain and silently insert the semicolon. */
26102 {
26107 /* Don't try to parse c++11 attributes here. As per the
26108 grammar, that should be a task for
26109 cp_parser_decl_specifier_seq. */
26113 {
26125 /* While it's legal for type qualifiers and storage class
26126 specifiers to follow type definitions in the grammar, only
26127 compiler testsuites contain code like that. Assume that if
26128 we see such code, then what we're really seeing is a case
26129 like:
26131 class X { }
26132 const <type> var = ...;
26134 or
26136 class Y { }
26137 static <type> func (...) ...
26139 i.e. the qualifier or specifier applies to the next
26140 declaration. To do so, however, we need to look ahead one
26141 more token to see if *that* token is a type specifier.
26143 This code could be improved to handle:
26145 class Z { }
26146 static const <type> var = ...; */
26149 {
26152 /* Handling user-defined types here would be nice, but very
26153 tricky. */
26154 want_semicolon
26157 }
26161 }
26163 /* If we don't have a type, then something is very wrong and we
26164 shouldn't try to do anything clever. Likewise for not seeing the
26165 closing brace. */
26167 {
26168 /* Locate the closing brace. */
26169 cp_token_position prev
26174 /* We want to suggest insertion of a ';' immediately *after* the
26175 closing brace, so, if we can, offset the location by 1 column. */
26182 /* If we successfully offset the location, suggest the fix-it. */
26195 else
26198 /* Unget one token and smash it to look as though we encountered
26199 a semicolon in the input stream. */
26204 }
26205 }
26207 /* If this class is not itself within the scope of another class,
26208 then we need to parse the bodies of all of the queued function
26209 definitions. Note that the queued functions defined in a class
26210 are not always processed immediately following the
26211 class-specifier for that class. Consider:
26213 struct A {
26214 struct B { void f() { sizeof (A); } };
26215 };
26217 If `f' were processed before the processing of `A' were
26218 completed, there would be no way to compute the size of `A'.
26219 Note that the nesting we are interested in here is lexical --
26220 not the semantic nesting given by TYPE_CONTEXT. In particular,
26221 for:
26223 struct A { struct B; };
26224 struct A::B { void f() { } };
26226 there is no need to delay the parsing of `A::B::f'. */
26228 {
26229 tree decl;
26236 {
26237 /* Skip default arguments, NSDMIs, etc, in order to improve
26238 error recovery (c++/71169, c++/71832). */
26242 }
26244 /* In a first pass, parse default arguments to the functions.
26245 Then, in a second pass, parse the bodies of the functions.
26246 This two-phased approach handles cases like:
26248 struct S {
26249 void f() { g(); }
26250 void g(int i = 3);
26251 };
26253 */
26255 {
26257 /* If there are default arguments that have not yet been processed,
26258 take care of them now. */
26260 {
26265 }
26266 /* Make sure that any template parameters are in scope. */
26268 /* Parse the default argument expressions. */
26270 /* Remove any template parameters from the symbol table. */
26272 }
26275 /* If there are noexcept-specifiers that have not yet been processed,
26276 take care of them now. Do this before processing NSDMIs as they
26277 may depend on noexcept-specifiers already having been processed. */
26281 {
26284 {
26289 }
26294 /* Make sure that any template parameters are in scope. */
26297 /* Make sure that any member-function parameters are in scope.
26298 This function doesn't expect ccp to be set. */
26302 /* 'this' is not allowed in static member functions. */
26303 unsigned char local_variables_forbidden_p
26308 /* Now we can parse the noexcept-specifier. */
26314 /* Update the fn's type directly -- it might have escaped
26315 beyond this decl :( */
26317 /* Update any instantiations we've already created. We must
26318 keep the new noexcept-specifier wrapped in a DEFERRED_NOEXCEPT
26319 so that maybe_instantiate_noexcept can tsubst the NOEXCEPT_EXPR
26320 in the pattern. */
26325 /* Restore the state of local_variables_forbidden_p. */
26328 /* The finish_struct call above performed various override checking,
26329 but it skipped unparsed noexcept-specifier operands. Now that we
26330 have resolved them, check again. */
26333 /* Remove any member-function parameters from the symbol table. */
26336 /* Remove any template parameters from the symbol table. */
26338 }
26341 /* Now parse any NSDMIs. */
26343 {
26345 {
26350 }
26353 }
26356 /* Now contract attributes. */
26358 {
26361 {
26366 }
26370 /* Make sure that any template parameters are in scope. */
26373 /* Make sure that any member-function parameters are in scope.
26374 This function doesn't expect ccp to be set. */
26378 /* 'this' is not allowed in static member functions. */
26379 unsigned char local_variables_forbidden_p
26384 /* Now we can parse contract conditions. */
26386 {
26389 }
26391 /* Restore the state of local_variables_forbidden_p. */
26394 /* Remove any member-function parameters from the symbol table. */
26397 /* Remove any template parameters from the symbol table. */
26400 /* Perform any deferred contract matching. */
26402 }
26410 /* Now parse the body of the functions. */
26412 {
26413 /* OpenMP UDRs need to be parsed before all other functions. */
26420 }
26421 else
26425 }
26427 /* Put back any saved access checks. */
26430 /* Restore saved state. */
26434 parser->num_template_parameter_lists
26436 parser->in_unbraced_linkage_specification_p
26440 }
26442 /* Parse a class-head.
26444 class-head:
26445 class-key identifier [opt] base-clause [opt]
26446 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
26447 class-key nested-name-specifier [opt] template-id
26448 base-clause [opt]
26450 class-virt-specifier:
26451 final
26453 GNU Extensions:
26454 class-key attributes identifier [opt] base-clause [opt]
26455 class-key attributes nested-name-specifier identifier base-clause [opt]
26456 class-key attributes nested-name-specifier [opt] template-id
26457 base-clause [opt]
26459 Upon return BASES is initialized to the list of base classes (or
26460 NULL, if there are none) in the same form returned by
26461 cp_parser_base_clause.
26463 Returns the TYPE of the indicated class. Sets
26464 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
26465 involving a nested-name-specifier was used, and FALSE otherwise.
26467 Returns error_mark_node if this is not a class-head.
26469 Returns NULL_TREE if the class-head is syntactically valid, but
26470 semantically invalid in a way that means we should skip the entire
26471 body of the class. */
26473 static tree
26476 {
26477 tree nested_name_specifier;
26481 tree attributes;
26482 tree bases;
26492 /* Assume no nested-name-specifier will be present. */
26494 /* Assume no template parameter lists will be used in defining the
26495 type. */
26499 /* Look for the class-key. */
26506 /* Parse the attributes. */
26511 /* If the next token is `::', that is invalid -- but sometimes
26512 people do try to write:
26514 struct ::S {};
26516 Handle this gracefully by accepting the extra qualifier, and then
26517 issuing an error about it later if this really is a
26518 class-head. If it turns out just to be an elaborated type
26519 specifier, remain silent. */
26525 /* Determine the name of the class. Begin by looking for an
26526 optional nested-name-specifier. */
26528 nested_name_specifier
26534 /* If there was a nested-name-specifier, then there *must* be an
26535 identifier. */
26540 {
26542 /* Although the grammar says `identifier', it really means
26543 `class-name' or `template-name'. You are only allowed to
26544 define a class that has already been declared with this
26545 syntax.
26547 The proposed resolution for Core Issue 180 says that wherever
26548 you see `class T::X' you should treat `X' as a type-name.
26550 It is OK to define an inaccessible class; for example:
26552 class A { class B; };
26553 class A::B {};
26555 We do not know if we will see a class-name, or a
26556 template-name. We look for a class-name first, in case the
26557 class-name is a template-id; if we looked for the
26558 template-name first we would stop after the template-name. */
26565 class_type,
26569 /* If that didn't work, ignore the nested-name-specifier. */
26571 {
26577 }
26578 /* If we could not find a corresponding TYPE, treat this
26579 declaration like an unqualified declaration. */
26582 /* Otherwise, count the number of templates used in TYPE and its
26583 containing scopes. */
26584 else
26586 }
26587 /* Otherwise, the identifier is optional. */
26588 else
26589 {
26590 /* We don't know whether what comes next is a template-id,
26591 an identifier, or nothing at all. */
26593 /* Check for a template-id. */
26598 class_key,
26600 /* If that didn't work, it could still be an identifier. */
26602 {
26604 {
26607 }
26608 else
26610 }
26611 else
26612 {
26615 }
26616 }
26621 {
26623 class_key,
26625 }
26628 /* If it's not a `:' or a `{' then we can't really be looking at a
26629 class-head, since a class-head only appears as part of a
26630 class-specifier. We have to detect this situation before calling
26631 xref_tag, since that has irreversible side-effects. */
26633 {
26637 }
26639 /* At this point, we're going ahead with the class-specifier, even
26640 if some other problem occurs. */
26643 {
26648 }
26649 /* Issue the error about the overly-qualified name now. */
26651 {
26656 }
26658 {
26663 }
26665 {
26666 tree scope;
26669 /* [temp.names]: in a qualified-id formed by a class-head-name, the
26670 keyword template shall not appear at the top level. */
26674 /* Reject typedef-names in class heads. */
26676 {
26679 type);
26682 }
26684 /* Figure out in what scope the declaration is being placed. */
26686 /* If that scope does not contain the scope in which the
26687 class was originally declared, the program is invalid. */
26689 {
26692 "declaration of %qD in namespace %qD which does not "
26695 else
26701 }
26702 /* [dcl.meaning]
26704 A declarator-id shall not be qualified except for the
26705 definition of a ... nested class outside of its class
26706 ... [or] the definition or explicit instantiation of a
26707 class member of a namespace outside of its namespace. */
26711 }
26712 /* An explicit-specialization must be preceded by "template <>". If
26713 it is not, try to recover gracefully. */
26716 && !processing_template_parmlist
26718 {
26719 /* Build a location of this form:
26720 struct typename <ARGS>
26721 ^~~~~~~~~~~~~~~~~~~~~~
26722 with caret==start at the start token, and
26723 finishing at the end of the type. */
26724 location_t reported_loc
26726 class_head_start_location,
26732 "an explicit specialization must be preceded by"
26735 /* Take the same action that would have been taken by
26736 cp_parser_explicit_specialization. */
26739 }
26740 /* There must be no "return" statements between this point and the
26741 end of this function; set "type "to the correct return value and
26742 use "goto done;" to return. */
26743 /* Make sure that the right number of template parameters were
26744 present. */
26746 template_id_p,
26749 {
26750 /* If something went wrong, there is no point in even trying to
26751 process the class-definition. */
26754 }
26756 /* Look up the type. */
26758 {
26762 {
26766 }
26767 else
26768 {
26772 /* Check the scope while we still know whether or not we had a
26773 nested-name-specifier. */
26776 }
26779 }
26781 {
26784 /* Given:
26786 template <typename T> struct S { struct T };
26787 template <typename T> struct S<T>::T { };
26789 we will get a TYPENAME_TYPE when processing the definition of
26790 `S::T'. We need to resolve it to the actual type before we
26791 try to define it. */
26793 {
26796 {
26799 }
26800 }
26804 {
26807 }
26809 /* Enter the scope indicated by the nested-name-specifier. */
26811 /* Get the canonical version of this type. */
26813 /* Call push_template_decl if it seems like we should be defining a
26814 template either from the template headers or the type we're
26815 defining, so that we diagnose both extra and missing headers. */
26819 {
26822 {
26825 }
26826 }
26830 }
26832 {
26833 /* If the class was unnamed, create a dummy name. */
26841 }
26843 /* Diagnose class/struct/union mismatches. */
26847 /* Indicate whether this class was declared as a `class' or as a
26848 `struct'. */
26852 /* If this type was already complete, and we see another definition,
26853 that's an error. Likewise if the type is already being defined:
26854 this can happen, eg, when it's defined from within an expression
26855 (c++/84605). */
26858 {
26860 type);
26862 type);
26865 }
26870 {
26873 {
26874 /* In a lambda this should work, but doesn't currently. */
26877 }
26879 /* Apply attributes now, before any use of the class as a template
26880 argument in its base list. */
26883 }
26885 /* Associate constraints with the type. */
26889 /* We will have entered the scope containing the class; the names of
26890 base classes should be looked up in that context. For example:
26892 struct A { struct B {}; struct C; };
26893 struct A::C : B {};
26895 is valid. */
26897 /* Get the list of base-classes, if there is one. Defer access checking
26898 until the entire list has been seen, as per [class.access.general]. */
26901 {
26907 }
26908 else
26911 /* If we're really defining a class, process the base classes.
26912 If they're invalid, fail. */
26916 /* Now that all bases have been seen and attached to the class, check
26917 accessibility of the types named in the base-clause. This must be
26918 done relative to the class scope, so that we accept e.g.
26920 struct A { protected: struct B {}; };
26921 struct C : A::B, A {}; // OK: A::B is accessible via base A
26923 as per [class.access.general]. */
26930 done:
26931 /* Leave the scope given by the nested-name-specifier. We will
26932 enter the class scope itself while processing the members. */
26937 {
26940 }
26946 out:
26949 }
26951 /* Parse a class-key.
26953 class-key:
26954 class
26955 struct
26956 union
26958 Returns the kind of class-key specified, or none_type to indicate
26959 error. */
26961 static enum tag_types
26963 {
26967 /* Look for the class-key. */
26972 /* Check to see if the TOKEN is a class-key. */
26977 }
26979 /* Parse a type-parameter-key.
26981 type-parameter-key:
26982 class
26983 typename
26984 */
26986 static void
26988 {
26989 /* Look for the type-parameter-key. */
26993 {
26997 /* typename is not allowed in a template template parameter
26998 by the standard until C++17. */
27000 "ISO C++ forbids typename key in template template parameter;"
27002 }
27003 else
27007 }
27009 /* Parse an (optional) member-specification.
27011 member-specification:
27012 member-declaration member-specification [opt]
27013 access-specifier : member-specification [opt] */
27015 static void
27017 {
27019 {
27023 /* Peek at the next token. */
27025 /* If it's a `}', or EOF then we've seen all the members. */
27031 /* See if this token is a keyword. */
27034 {
27038 /* Consume the access-specifier. */
27040 /* Remember which access-specifier is active. */
27042 /* Look for the `:'. */
27047 /* Accept #pragmas at class scope. */
27049 {
27052 }
27054 /* Otherwise, the next construction must be a
27055 member-declaration. */
27057 }
27058 }
27059 }
27061 /* Parse a member-declaration.
27063 member-declaration:
27064 decl-specifier-seq [opt] member-declarator-list [opt] ;
27065 function-definition ; [opt]
27066 :: [opt] nested-name-specifier template [opt] unqualified-id ;
27067 using-declaration
27068 template-declaration
27069 alias-declaration
27071 member-declarator-list:
27072 member-declarator
27073 member-declarator-list , member-declarator
27075 member-declarator:
27076 declarator pure-specifier [opt]
27077 declarator constant-initializer [opt]
27078 identifier [opt] : constant-expression
27080 GNU Extensions:
27082 member-declaration:
27083 __extension__ member-declaration
27085 member-declarator:
27086 declarator attributes [opt] pure-specifier [opt]
27087 declarator attributes [opt] constant-initializer [opt]
27088 identifier [opt] attributes [opt] : constant-expression
27090 C++0x Extensions:
27092 member-declaration:
27093 static_assert-declaration */
27095 static void
27097 {
27098 cp_decl_specifier_seq decl_specifiers;
27099 tree prefix_attributes;
27100 tree decl;
27109 /* Check for the `__extension__' keyword. */
27111 {
27112 /* Recurse. */
27114 /* Restore the old value of the PEDANTIC flag. */
27118 }
27120 /* Check for a template-declaration. */
27122 {
27123 /* An explicit specialization here is an error condition, and we
27124 expect the specialization handler to detect and report this. */
27128 else
27132 }
27133 /* Check for a template introduction. */
27137 /* Check for a using-declaration. */
27139 {
27141 /* Parse the using-declaration. */
27145 else
27146 {
27147 tree decl;
27151 /* Note that if we actually see the '=' token after the
27152 identifier, cp_parser_alias_declaration commits the
27153 tentative parse. In that case, we really expect an
27154 alias-declaration. Otherwise, we expect a using
27155 declaration. */
27156 alias_decl_expected =
27162 else
27165 }
27167 }
27169 /* Check for @defs. */
27171 {
27176 {
27181 }
27183 }
27185 /* If the next token is `static_assert' we have a static assertion. */
27187 {
27190 }
27194 cp_omp_declare_simd_data odsd;
27198 /* Parse the decl-specifier-seq. */
27201 (CP_PARSER_FLAGS_OPTIONAL
27211 /* Check for an invalid type-name. */
27215 /* If there is no declarator, then the decl-specifier-seq should
27216 specify a type. */
27218 {
27219 /* If there was no decl-specifier-seq, and the next token is a
27220 `;', then we have something like:
27222 struct S { ; };
27224 [class.mem]
27226 Each member-declaration shall declare at least one member
27227 name of the class. */
27229 {
27232 {
27236 }
27237 }
27238 else
27239 {
27240 /* See if this declaration is a friend. */
27242 /* If there were decl-specifiers, check to see if there was
27243 a class-declaration. */
27246 /* Nested classes have already been added to the class, but
27247 a `friend' needs to be explicitly registered. */
27249 {
27250 /* If the `friend' keyword was present, the friend must
27251 be introduced with a class-key. */
27254 "in C++03 a class-key must be used "
27256 /* In this case:
27258 template <typename T> struct A {
27259 friend struct A<T>::B;
27260 };
27262 A<T>::B will be represented by a TYPENAME_TYPE, and
27263 therefore not recognized by check_tag_decl. */
27265 {
27269 }
27270 /* Warn if an attribute cannot appear here, as per
27271 [dcl.attr.grammar]/5. But not when declares_class_or_enum:
27272 we ignore attributes in elaborated-type-specifiers. */
27275 {
27280 "that appertains to a friend declaration that "
27282 }
27285 "friend declaration does not name a class or "
27287 else
27290 }
27291 /* If there is no TYPE, an error message will already have
27292 been issued. */
27294 ;
27295 /* An anonymous aggregate has to be handled specially; such
27296 a declaration really declares a data member (with a
27297 particular type), as opposed to a nested class. */
27299 {
27300 /* C++11 9.5/6. */
27303 "a storage class on an anonymous aggregate "
27306 /* Remove constructors and such from TYPE, now that we
27307 know it is an anonymous aggregate. */
27309 /* And make the corresponding data member. */
27312 /* Add it to the class. */
27314 }
27315 else
27316 cp_parser_check_access_in_redeclaration
27319 }
27320 }
27321 else
27322 {
27325 /* Clear attributes from the decl_specifiers but keep them
27326 around as prefix attributes that apply them to the entity
27327 being declared. */
27335 /* See if these declarations will be friends. */
27338 /* Keep going until we hit the `;' at the end of the
27339 declaration. */
27341 {
27343 tree first_attribute;
27344 tree initializer;
27347 /* Peek at the next token. */
27350 /* The following code wants to know early if it is a bit-field
27351 or some other declaration. Attributes can appear before
27352 the `:' token. Skip over them without consuming any tokens
27353 to peek if they are followed by `:'. */
27358 {
27359 size_t n
27362 }
27364 /* Check for a bitfield declaration. */
27370 {
27371 tree identifier;
27372 tree width;
27374 location_t id_location
27379 else
27382 /* Look for attributes that apply to the bitfield. */
27385 /* Consume the `:' token. */
27388 /* Get the width of the bitfield. */
27392 /* In C++20 and as extension for C++11 and above we allow
27393 default member initializers for bit-fields. */
27398 CPP_OPEN_BRACE)))
27399 {
27400 location_t loc
27405 "default member initializers for bit-fields "
27406 "only available with %<-std=c++20%> or "
27411 {
27415 }
27416 }
27417 else
27418 {
27419 /* Look for attributes that apply to the bitfield after
27420 the `:' token and width. This is where GCC used to
27421 parse attributes in the past, pedwarn if there is
27422 a std attribute. */
27425 "ISO C++ allows bit-field attributes only "
27429 }
27433 /* Remember which attributes are prefix attributes and
27434 which are not. */
27436 /* Combine the attributes. */
27439 /* Create the bitfield declaration. */
27442 identifier,
27443 sfk_none,
27444 id_location)
27448 attributes);
27449 }
27450 else
27451 {
27453 tree asm_specification;
27457 /* We can't delay parsing for friends,
27458 alias-declarations, and typedefs, even though the
27459 standard seems to require it. */
27464 /* Parse the declarator. */
27465 declarator
27467 flags,
27473 /* If something went wrong parsing the declarator, make sure
27474 that we at least consume some tokens. */
27476 {
27477 /* Skip to the end of the statement. */
27479 /* If the next token is not a semicolon, that is
27480 probably because we just skipped over the body of
27481 a function. So, we consume a semicolon if
27482 present, but do not issue an error message if it
27483 is not present. */
27485 CPP_SEMICOLON))
27488 }
27490 /* Handle class-scope non-template C++17 deduction guides. */
27493 declarator,
27497 cp_parser_check_for_definition_in_return_type
27501 /* Look for an asm-specification. */
27503 /* Look for attributes that apply to the declaration. */
27505 /* Remember which attributes are prefix attributes and
27506 which are not. */
27508 /* Combine the attributes. */
27511 /* If it's an `=', then we have a constant-initializer or a
27512 pure-specifier. It is not correct to parse the
27513 initializer before registering the member declaration
27514 since the member declaration should be in scope while
27515 its initializer is processed. However, the rest of the
27516 front end does not yet provide an interface that allows
27517 us to handle this correctly. */
27519 {
27520 /* In [class.mem]:
27522 A pure-specifier shall be used only in the declaration of
27523 a virtual function.
27525 A member-declarator can contain a constant-initializer
27526 only if it declares a static member of integral or
27527 enumeration type.
27529 Therefore, if the DECLARATOR is for a function, we look
27530 for a pure-specifier; otherwise, we look for a
27531 constant-initializer. When we call `grokfield', it will
27532 perform more stringent semantics checks. */
27545 {
27547 /* Don't require a constant rvalue in C++11, since we
27548 might want a reference constant. We'll enforce
27549 constancy later. */
27551 /* Parse the initializer. */
27554 }
27555 else
27556 /* Parse the initializer. */
27558 }
27561 {
27563 declarator->init_loc
27567 else
27569 }
27570 /* Detect invalid bit-field cases such as
27572 int *p : 4;
27573 int &&r : 3;
27575 and similar. */
27577 /* If there were no type specifiers, it was a
27578 constructor. */
27580 {
27581 /* This is called for a decent diagnostic only. */
27590 /* Avoid "extra ;" pedwarns. */
27592 CPP_SEMICOLON))
27595 }
27596 /* Otherwise, there is no initializer. */
27597 else
27600 /* See if we are probably looking at a function
27601 definition. We are certainly not looking at a
27602 member-declarator. Calling `grokfield' has
27603 side-effects, so we must not do it unless we are sure
27604 that we are looking at a member-declarator. */
27607 {
27608 /* The grammar does not allow a pure-specifier to be
27609 used when a member function is defined. (It is
27610 possible that this fact is an oversight in the
27611 standard, since a pure function may be defined
27612 outside of the class-specifier. */
27618 declarator,
27619 attributes);
27623 /* If the member was not a friend, declare it here. */
27626 /* Peek at the next token. */
27628 /* If the next token is a semicolon, consume it. */
27630 {
27631 location_t semicolon_loc
27636 "extra %<;%> after in-class "
27638 }
27640 }
27641 else
27645 /* Create the declaration. */
27651 {
27654 else
27656 }
27657 }
27662 /* Reset PREFIX_ATTRIBUTES. */
27664 {
27669 }
27671 /* If there is any qualification still in effect, clear it
27672 now; we will be starting fresh with the next declarator. */
27676 /* If it's a `,', then there are more declarators. */
27678 {
27681 {
27687 }
27688 }
27689 /* If the next token isn't a `;', then we have a parse error. */
27691 CPP_SEMICOLON))
27692 {
27693 /* The next token might be a ways away from where the
27694 actual semicolon is missing. Find the previous token
27695 and use that for our error position. */
27702 /* Assume that the user meant to provide a semicolon. If
27703 we were to cp_parser_skip_to_end_of_statement, we might
27704 skip to a semicolon inside a member function definition
27705 and issue nonsensical error messages. */
27707 }
27710 {
27711 /* Add DECL to the list of members. */
27713 /* Explicitly include, eg, NSDMIs, for better error
27714 recovery (c++/58650). */
27722 /* Add DECL to the queue of NSDMI to be parsed later. */
27724 }
27728 }
27729 }
27732 out:
27735 }
27737 /* Parse a pure-specifier.
27739 pure-specifier:
27740 = 0
27742 Returns INTEGER_ZERO_NODE if a pure specifier is found.
27743 Otherwise, ERROR_MARK_NODE is returned. */
27745 static tree
27747 {
27750 /* Look for the `=' token. */
27753 /* Look for the `0' token. */
27762 /* Accept = default or = delete in c++0x mode. */
27765 {
27768 }
27770 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
27772 {
27777 }
27779 {
27782 }
27785 }
27787 /* Parse a constant-initializer.
27789 constant-initializer:
27790 = constant-expression
27792 Returns a representation of the constant-expression. */
27794 static tree
27796 {
27797 /* Look for the `=' token. */
27801 /* It is invalid to write:
27803 struct S { static const int i = { 7 }; };
27805 */
27807 {
27810 /* Consume the opening brace. */
27811 matching_braces braces;
27813 /* Skip the initializer. */
27815 /* Look for the trailing `}'. */
27819 }
27822 }
27824 /* Derived classes [gram.class.derived] */
27826 /* Parse a base-clause.
27828 base-clause:
27829 : base-specifier-list
27831 base-specifier-list:
27832 base-specifier ... [opt]
27833 base-specifier-list , base-specifier ... [opt]
27835 Returns a TREE_LIST representing the base-classes, in the order in
27836 which they were declared. The representation of each node is as
27837 described by cp_parser_base_specifier.
27839 In the case that no bases are specified, this function will return
27840 NULL_TREE, not ERROR_MARK_NODE. */
27842 static tree
27844 {
27847 /* Look for the `:' that begins the list. */
27850 /* Scan the base-specifier-list. */
27852 {
27854 tree base;
27857 /* Look for the base-specifier. */
27859 /* Look for the (optional) ellipsis. */
27861 {
27862 /* Consume the `...'. */
27866 }
27868 /* Add BASE to the front of the list. */
27870 {
27872 /* Make this a pack expansion type. */
27876 {
27879 }
27880 }
27881 /* Peek at the next token. */
27883 /* If it's not a comma, then the list is complete. */
27886 /* Consume the `,'. */
27888 }
27890 /* PARSER->SCOPE may still be non-NULL at this point, if the last
27891 base class had a qualified name. However, the next name that
27892 appears is certainly not qualified. */
27898 }
27900 /* Parse a base-specifier.
27902 base-specifier:
27903 :: [opt] nested-name-specifier [opt] class-name
27904 virtual access-specifier [opt] :: [opt] nested-name-specifier
27905 [opt] class-name
27906 access-specifier virtual [opt] :: [opt] nested-name-specifier
27907 [opt] class-name
27909 Returns a TREE_LIST. The TREE_PURPOSE will be one of
27910 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
27911 indicate the specifiers provided. The TREE_VALUE will be a TYPE
27912 (or the ERROR_MARK_NODE) indicating the type that was specified. */
27914 static tree
27916 {
27924 tree type;
27926 /* Process the optional `virtual' and `access-specifier'. */
27928 {
27929 /* Peek at the next token. */
27931 /* Process `virtual'. */
27933 {
27935 /* If `virtual' appears more than once, issue an error. */
27937 {
27941 }
27945 /* Consume the `virtual' token. */
27953 /* If more than one access specifier appears, issue an
27954 error. */
27957 {
27961 }
27965 /* Consume the access-specifier. */
27973 }
27974 }
27975 /* It is not uncommon to see programs mechanically, erroneously, use
27976 the 'typename' keyword to denote (dependent) qualified types
27977 as base classes. */
27979 {
27984 else
27986 "keyword %<typename%> not allowed in this context "
27989 }
27991 /* Look for the optional `::' operator. */
27993 /* Look for the nested-name-specifier. The simplest way to
27994 implement:
27996 [temp.res]
27998 The keyword `typename' is not permitted in a base-specifier or
27999 mem-initializer; in these contexts a qualified name that
28000 depends on a template-parameter is implicitly assumed to be a
28001 type name.
28003 is to pretend that we have seen the `typename' keyword at this
28004 point. */
28010 /* If the base class is given by a qualified name, assume that names
28011 we see are type names or templates, as appropriate. */
28017 /* DR 950 allows decltype as a base-specifier. */
28019 else
28020 {
28021 /* Otherwise, look for the class-name. */
28023 class_scope_p,
28024 template_p,
28025 typename_type,
28030 }
28036 }
28038 /* Exception handling [gram.exception] */
28040 /* Save the tokens that make up the noexcept-specifier for a member-function.
28041 Returns a DEFERRED_PARSE. */
28043 static tree
28045 {
28047 /* We want everything up to, including, the final ')'. */
28051 /* As with default arguments and NSDMIs, make use of DEFERRED_PARSE
28052 to carry the information we will need. */
28054 /* Save away the noexcept-specifier; we will process it when the
28055 class is complete. */
28060 }
28062 /* Used for late processing of noexcept-specifiers of member-functions.
28063 DEFAULT_ARG is the unparsed operand of a noexcept-specifier which
28064 we saved for later; parse it now. DECL is the declaration of the
28065 member function. */
28067 static tree
28069 {
28070 /* Make sure we've gotten something that hasn't been parsed yet. */
28075 /* Push the saved tokens for the noexcept-specifier onto the parser's
28076 lexer stack. */
28080 /* Parse the cached noexcept-specifier. */
28081 tree parsed_arg
28083 CP_PARSER_FLAGS_NONE,
28088 /* Revert to the main lexer. */
28091 /* Restore the queue. */
28094 /* And we're done. */
28096 }
28098 /* Perform late checking of overriding function with respect to their
28099 noexcept-specifiers. TYPE is the class and FNDECL is the function
28100 that potentially overrides some virtual function with the same
28101 signature. */
28103 static void
28105 {
28107 tree base_binfo;
28113 {
28122 }
28123 }
28125 /* Parse an (optional) noexcept-specification.
28127 noexcept-specification:
28128 noexcept ( constant-expression ) [opt]
28130 If no noexcept-specification is present, returns NULL_TREE.
28131 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
28132 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
28133 there are no parentheses. CONSUMED_EXPR will be set accordingly.
28134 Otherwise, returns a noexcept specification unless RETURN_COND is true,
28135 in which case a boolean condition is returned instead. The parser flags
28136 FLAGS is used to control parsing. QUALS are qualifiers indicating whether
28137 the (member) function is `const'. */
28139 static tree
28141 cp_parser_flags flags,
28145 {
28149 /* Peek at the next token. */
28152 /* Is it a noexcept-specification? */
28154 {
28155 tree expr;
28157 /* [class.mem]/6 says that a noexcept-specifer (within the
28158 member-specification of the class) is a complete-class context of
28159 a class. So, if the noexcept-specifier has the optional expression,
28160 just save the tokens, and reparse this after we're done with the
28161 class. */
28165 /* No need to delay parsing for a number literal or true/false. */
28177 {
28178 matching_parens parens;
28182 {
28183 /* Types may not be defined in an exception-specification. */
28185 parser->type_definition_forbidden_message
28189 expr
28195 {
28198 }
28200 /* Restore the saved message. */
28202 }
28203 else
28204 {
28207 }
28210 }
28211 else
28212 {
28216 }
28218 /* We cannot build a noexcept-spec right away because this will check
28219 that expr is a constexpr. */
28222 else
28224 }
28225 else
28227 }
28229 /* Parse an (optional) exception-specification.
28231 exception-specification:
28232 throw ( type-id-list [opt] )
28234 Returns a TREE_LIST representing the exception-specification. The
28235 TREE_VALUE of each node is a type. The parser flags FLAGS is used to
28236 control parsing. QUALS are qualifiers indicating whether the (member)
28237 function is `const'. */
28239 static tree
28241 cp_parser_flags flags)
28242 {
28244 tree type_id_list;
28247 /* Peek at the next token. */
28250 /* Is it a noexcept-specification? */
28251 type_id_list
28259 /* If it's not `throw', then there's no exception-specification. */
28265 /* Consume the `throw'. */
28268 /* Look for the `('. */
28269 matching_parens parens;
28272 /* Peek at the next token. */
28274 /* If it's not a `)', then there is a type-id-list. */
28276 {
28277 /* Types may not be defined in an exception-specification. */
28279 parser->type_definition_forbidden_message
28281 /* Parse the type-id-list. */
28283 /* Restore the saved message. */
28287 {
28291 }
28294 "dynamic exception specifications are deprecated in "
28296 }
28297 /* In C++17, throw() is equivalent to noexcept (true). throw()
28298 is deprecated in C++11 and above as well, but is still widely used,
28299 so don't warn about it yet. */
28302 else
28305 /* Look for the `)'. */
28309 }
28311 /* Parse an (optional) type-id-list.
28313 type-id-list:
28314 type-id ... [opt]
28315 type-id-list , type-id ... [opt]
28317 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
28318 in the order that the types were presented. */
28320 static tree
28322 {
28326 {
28328 tree type;
28332 /* Get the next type-id. */
28334 /* Check for invalid 'auto'. */
28336 {
28340 }
28341 /* Parse the optional ellipsis. */
28343 {
28344 /* Consume the `...'. */
28347 /* Turn the type into a pack expansion expression. */
28349 }
28350 /* Add it to the list. */
28352 /* Peek at the next token. */
28354 /* If it is not a `,', we are done. */
28357 /* Consume the `,'. */
28359 }
28362 }
28364 /* Parse a try-block.
28366 try-block:
28367 try compound-statement handler-seq */
28369 static tree
28371 {
28372 tree try_block;
28379 "%<try%> in %<constexpr%> function only "
28389 }
28391 /* Parse a function-try-block.
28393 function-try-block:
28394 try ctor-initializer [opt] function-body handler-seq */
28396 static void
28398 {
28399 tree compound_stmt;
28400 tree try_block;
28402 /* Look for the `try' keyword. */
28405 /* Let the rest of the front end know where we are. */
28407 /* Parse the function-body. */
28408 cp_parser_ctor_initializer_opt_and_function_body
28410 /* We're done with the `try' part. */
28412 /* Parse the handlers. */
28414 /* We're done with the handlers. */
28416 }
28418 /* Parse a handler-seq.
28420 handler-seq:
28421 handler handler-seq [opt] */
28423 static void
28425 {
28427 {
28430 /* Parse the handler. */
28432 /* Peek at the next token. */
28434 /* If it's not `catch' then there are no more handlers. */
28437 }
28438 }
28440 /* Parse a handler.
28442 handler:
28443 catch ( exception-declaration ) compound-statement */
28445 static void
28447 {
28448 tree handler;
28449 tree declaration;
28453 matching_parens parens;
28460 }
28462 /* Parse an exception-declaration.
28464 exception-declaration:
28465 type-specifier-seq declarator
28466 type-specifier-seq abstract-declarator
28467 type-specifier-seq
28468 ...
28470 Returns a VAR_DECL for the declaration, or NULL_TREE if the
28471 ellipsis variant is used. */
28473 static tree
28475 {
28476 cp_decl_specifier_seq type_specifiers;
28480 /* If it's an ellipsis, it's easy to handle. */
28482 {
28483 /* Consume the `...' token. */
28486 }
28488 /* Types may not be defined in exception-declarations. */
28490 parser->type_definition_forbidden_message
28493 /* Parse the type-specifier-seq. */
28498 /* If it's a `)', then there is no declarator. */
28501 else
28503 CP_PARSER_FLAGS_NONE,
28510 /* Restore the saved message. */
28517 }
28519 /* Parse a throw-expression.
28521 throw-expression:
28522 throw assignment-expression [opt]
28524 Returns a THROW_EXPR representing the throw-expression. */
28526 static tree
28528 {
28529 tree expression;
28535 /* Figure out whether or not there is an assignment-expression
28536 following the "throw" keyword. */
28544 else
28547 /* Construct a location e.g.:
28548 throw x
28549 ^~~~~~~
28550 with caret == start at the start of the "throw" token, and
28551 the end at the end of the final token we consumed. */
28557 }
28559 /* Parse a yield-expression.
28561 yield-expression:
28562 co_yield assignment-expression
28563 co_yield braced-init-list
28565 Returns a CO_YIELD_EXPR representing the yield-expression. */
28567 static tree
28569 {
28570 tree expr;
28578 {
28581 /* ??? : probably a moot point? */
28584 }
28585 else
28592 }
28594 /* GNU Extensions */
28596 /* Parse an (optional) asm-specification.
28598 asm-specification:
28599 asm ( string-literal )
28601 If the asm-specification is present, returns a STRING_CST
28602 corresponding to the string-literal. Otherwise, returns
28603 NULL_TREE. */
28605 static tree
28607 {
28609 tree asm_specification;
28611 /* Peek at the next token. */
28613 /* If the next token isn't the `asm' keyword, then there's no
28614 asm-specification. */
28618 /* Consume the `asm' token. */
28620 /* Look for the `('. */
28621 matching_parens parens;
28624 /* Look for the string-literal. */
28627 /* Look for the `)'. */
28631 }
28633 /* Parse an asm-operand-list.
28635 asm-operand-list:
28636 asm-operand
28637 asm-operand-list , asm-operand
28639 asm-operand:
28640 string-literal ( expression )
28641 [ string-literal ] string-literal ( expression )
28643 Returns a TREE_LIST representing the operands. The TREE_VALUE of
28644 each node is the expression. The TREE_PURPOSE is itself a
28645 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
28646 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
28647 is a STRING_CST for the string literal before the parenthesis. Returns
28648 ERROR_MARK_NODE if any of the operands are invalid. */
28650 static tree
28652 {
28657 {
28658 tree string_literal;
28659 tree expression;
28660 tree name;
28663 {
28664 /* Consume the `[' token. */
28666 /* Read the operand name. */
28671 /* Look for the closing `]'. */
28673 }
28674 else
28676 /* Look for the string-literal. */
28679 /* Look for the `('. */
28680 matching_parens parens;
28682 /* Parse the expression. */
28684 /* Look for the `)'. */
28692 /* Add this operand to the list. */
28694 expression,
28695 asm_operands);
28696 /* If the next token is not a `,', there are no more
28697 operands. */
28700 /* Consume the `,'. */
28702 }
28705 }
28707 /* Parse an asm-clobber-list.
28709 asm-clobber-list:
28710 string-literal
28711 asm-clobber-list , string-literal
28713 Returns a TREE_LIST, indicating the clobbers in the order that they
28714 appeared. The TREE_VALUE of each node is a STRING_CST. */
28716 static tree
28718 {
28722 {
28723 tree string_literal;
28725 /* Look for the string literal. */
28727 /* Add it to the list. */
28729 /* If the next token is not a `,', then the list is
28730 complete. */
28733 /* Consume the `,' token. */
28735 }
28738 }
28740 /* Parse an asm-label-list.
28742 asm-label-list:
28743 identifier
28744 asm-label-list , identifier
28746 Returns a TREE_LIST, indicating the labels in the order that they
28747 appeared. The TREE_VALUE of each node is a label. */
28749 static tree
28751 {
28755 {
28758 /* Look for the identifier. */
28761 {
28764 {
28770 }
28771 }
28772 /* If the next token is not a `,', then the list is
28773 complete. */
28776 /* Consume the `,' token. */
28778 }
28781 }
28783 /* Return TRUE iff the next tokens in the stream are possibly the
28784 beginning of a GNU extension attribute. */
28786 static bool
28788 {
28790 }
28792 /* Return TRUE iff the next tokens in the stream are possibly the
28793 beginning of a standard C++-11 attribute specifier. */
28795 static bool
28797 {
28799 }
28801 /* Return TRUE iff the next Nth tokens in the stream are possibly the
28802 beginning of a standard C++-11 attribute specifier. */
28804 static bool
28806 {
28814 }
28816 /* Return TRUE iff the next Nth tokens in the stream are possibly the
28817 beginning of a GNU extension attribute. */
28819 static bool
28821 {
28825 }
28827 /* Return true iff the next tokens can be the beginning of either a
28828 GNU attribute list, or a standard C++11 attribute sequence. */
28830 static bool
28832 {
28835 }
28837 /* Return true iff the next Nth tokens can be the beginning of either
28838 a GNU attribute list, or a standard C++11 attribute sequence. */
28840 static bool
28842 {
28845 }
28847 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
28848 of GNU attributes, or return NULL. */
28850 static tree
28852 {
28855 {
28860 else
28862 }
28864 }
28866 /* Parse an (optional) series of attributes.
28868 attributes:
28869 attributes attribute
28871 attribute:
28872 __attribute__ (( attribute-list [opt] ))
28874 The return value is as for cp_parser_gnu_attribute_list. */
28876 static tree
28878 {
28885 {
28887 tree attribute_list;
28890 /* Peek at the next token. */
28892 /* If it's not `__attribute__', then we're done. */
28896 /* Consume the `__attribute__' keyword. */
28898 /* Look for the two `(' tokens. */
28899 matching_parens outer_parens;
28902 matching_parens inner_parens;
28906 /* Peek at the next token. */
28909 /* Parse the attribute-list. */
28911 else
28912 /* If the next token is a `)', then there is no attribute
28913 list. */
28916 /* Look for the two `)' tokens. */
28924 /* Add these new attributes to the list. */
28926 }
28929 }
28931 /* Parse a GNU attribute-list.
28933 attribute-list:
28934 attribute
28935 attribute-list , attribute
28937 attribute:
28938 identifier
28939 identifier ( identifier )
28940 identifier ( identifier , expression-list )
28941 identifier ( expression-list )
28943 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
28944 to an attribute. The TREE_PURPOSE of each node is the identifier
28945 indicating which attribute is in use. The TREE_VALUE represents
28946 the arguments, if any. */
28948 static tree
28950 {
28954 /* Don't create wrapper nodes within attributes: the
28955 handlers don't know how to handle them. */
28956 auto_suppress_location_wrappers sentinel;
28960 {
28962 tree identifier;
28963 tree attribute;
28965 /* Look for the identifier. We also allow keywords here; for
28966 example `__attribute__ ((const))' is legal. */
28970 {
28973 /* Consume the token, but save it since we need it for the
28974 SIMD enabled function parsing. */
28977 /* Save away the identifier that indicates which attribute
28978 this is. */
28980 /* For keywords, use the canonical spelling, not the
28981 parsed identifier. */
28988 /* Peek at the next token. */
28990 /* If it's an `(', then parse the attribute arguments. */
28992 {
28998 vec = cp_parser_parenthesized_expression_list
29004 else
29005 {
29008 }
29009 /* Save the arguments away. */
29011 }
29014 {
29015 /* Add this attribute to the list. */
29018 }
29021 }
29022 /* Unless EXACTLY_ONE is set look for more attributes.
29023 If the next token isn't a `,', we're done. */
29027 /* Consume the comma and keep going. */
29029 }
29032 /* We built up the list in reverse order. */
29034 }
29036 /* Parse arguments of omp::directive attribute.
29038 ( directive-name ,[opt] clause-list[opt] )
29040 For directive just remember the first/last tokens for subsequent
29041 parsing. */
29043 static void
29045 {
29048 {
29054 }
29057 {
29063 }
29072 }
29074 /* Parse arguments of omp::sequence attribute.
29076 ( omp::[opt] directive-attr [ , omp::[opt] directive-attr ]... ) */
29078 static void
29080 {
29081 matching_parens parens;
29083 do
29084 {
29089 {
29093 }
29098 else
29103 {
29112 }
29116 UNKNOWN_LOCATION);
29119 else
29124 }
29129 }
29131 /* Parse a standard C++11 attribute.
29133 The returned representation is a TREE_LIST which TREE_PURPOSE is
29134 the scoped name of the attribute, and the TREE_VALUE is its
29135 arguments list.
29137 Note that the scoped name of the attribute is itself a TREE_LIST
29138 which TREE_PURPOSE is the namespace of the attribute, and
29139 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
29140 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
29141 and which TREE_PURPOSE is directly the attribute name.
29143 Clients of the attribute code should use get_attribute_namespace
29144 and get_attribute_name to get the actual namespace and name of
29145 attributes, regardless of their being GNU or C++11 attributes.
29147 attribute:
29148 attribute-token attribute-argument-clause [opt]
29150 attribute-token:
29151 identifier
29152 attribute-scoped-token
29154 attribute-scoped-token:
29155 attribute-namespace :: identifier
29157 attribute-namespace:
29158 identifier
29160 attribute-argument-clause:
29161 ( balanced-token-seq )
29163 balanced-token-seq:
29164 balanced-token [opt]
29165 balanced-token-seq balanced-token
29167 balanced-token:
29168 ( balanced-token-seq )
29169 [ balanced-token-seq ]
29170 { balanced-token-seq }. */
29172 static tree
29174 {
29181 /* First, parse name of the attribute, a.k.a attribute-token. */
29198 {
29199 /* We are seeing a scoped attribute token. */
29214 else
29215 {
29219 }
29225 NULL_TREE);
29227 }
29229 {
29233 NULL_TREE);
29234 }
29235 else
29236 {
29239 NULL_TREE);
29241 /* We used to treat C++11 noreturn attribute as equivalent to GNU's,
29242 but no longer: we have to be able to tell [[noreturn]] and
29243 __attribute__((noreturn)) apart. */
29244 /* C++14 deprecated attribute is equivalent to GNU's. */
29247 /* C++17 fallthrough attribute is equivalent to GNU's. */
29250 /* C++23 assume attribute is equivalent to GNU's. */
29253 /* Transactional Memory TS optimize_for_synchronized attribute is
29254 equivalent to GNU transaction_callable. */
29258 /* Transactional Memory attributes are GNU attributes. */
29261 }
29263 /* Now parse the optional argument clause of the attribute. */
29266 {
29271 {
29273 attr_id);
29275 }
29277 }
29279 {
29283 /* Maybe we don't expect to see any arguments for this attribute. */
29287 {
29289 attr_id);
29295 }
29299 /* The assume attribute needs special handling of the argument. */
29303 /* A GNU attribute that takes an identifier in parameter. */
29306 /* If this is a fake attribute created to handle -Wno-attributes,
29307 we must skip parsing the arguments. */
29309 {
29311 {
29313 {
29316 }
29318 {
29324 }
29325 }
29327 /* For unknown attributes, just skip balanced tokens instead of
29328 trying to parse the arguments. */
29332 }
29334 vec = cp_parser_parenthesized_expression_list
29340 else
29341 {
29343 /* e.g. [[attr()]]. */
29346 attr_id);
29349 }
29353 else
29355 }
29358 }
29360 /* Warn if the attribute ATTRIBUTE appears more than once in the
29361 attribute-list ATTRIBUTES. This used to be enforced for certain
29362 attributes, but the restriction was removed in P2156.
29363 LOC is the location of ATTRIBUTE. Returns true if ATTRIBUTE was not
29364 found in ATTRIBUTES. */
29366 static bool
29368 {
29377 {
29382 }
29384 }
29386 /* Parse a list of standard C++-11 attributes.
29388 attribute-list:
29389 attribute [opt]
29390 attribute-list , attribute[opt]
29391 attribute ...
29392 attribute-list , attribute ...
29393 */
29395 static tree
29397 {
29402 {
29408 {
29410 {
29413 }
29414 }
29417 {
29422 else
29423 {
29428 }
29430 }
29434 }
29437 }
29439 /* Optionally parse a C++20 contract role. A NULL return means that no
29440 contract role was specified.
29442 contract-role:
29443 % default
29444 % identifier
29446 If the identifier does not name a known contract role, it will
29447 be assumed to be default. Returns the identifier for the role
29448 token. */
29450 static tree
29452 {
29462 else
29463 {
29466 }
29469 /* FIXME: Warn about invalid/unknown roles? */
29471 }
29473 /* Parse an optional contract mode.
29475 contract-mode:
29476 contract-semantic
29477 [contract-level] [contract-role]
29479 contract-semantic:
29480 check_never_continue
29481 check_maybe_continue
29482 check_always_continue
29484 contract-level:
29485 default
29486 audit
29487 axiom
29489 contract-role:
29490 default
29491 identifier
29493 This grammar is taken from P1332R0. During parsing, this sets options
29494 on the MODE object to determine the configuration of the contract.
29496 Returns a tree containing the identifiers used in the configuration.
29497 This is either an IDENTIFIER with the literal semantic or a TREE_LIST
29498 whose TREE_VALUE is the contract-level and whose TREE_PURPOSE is the
29499 contract-role, if any. NULL_TREE is returned if no information is
29500 given (i.e., all defaults selected). */
29502 static tree
29505 {
29506 /* The mode is empty; the level and role are default. */
29510 /* There is only a role; the level is default. */
29512 {
29515 }
29517 /* Otherwise, match semantic or level. */
29521 tree config_id;
29523 {
29526 /* Either a named level, a concrete semantic, or an identifier
29527 for a postcondition. */
29532 /* The identifier is the return value for a postcondition. */
29536 }
29538 {
29541 }
29542 else
29543 {
29544 /* We got some other token other than a ':'. */
29547 }
29549 /* Consume the literal semantic or level token. */
29553 {
29555 "expected contract level: "
29558 }
29560 /* We matched an explicit semantic. */
29562 {
29564 {
29568 }
29570 }
29572 /* We matched a level, there may be a role; otherwise this is default. */
29574 {
29577 }
29580 }
29582 static tree
29584 {
29588 }
29590 static bool
29592 {
29594 }
29596 /* Parse a standard C++20 contract attribute specifier.
29598 contract-attribute-specifier:
29599 [ [ assert contract-level [opt] : conditional-expression ] ]
29600 [ [ pre contract-level [opt] : conditional-expression ] ]
29601 [ [ post contract-level [opt] identifier [opt] : conditional-expression ] ]
29603 For free functions, we cannot determine the type of the postcondition
29604 identifier because the we haven't called grokdeclarator yet. In those
29605 cases we parse the postcondition as if the identifier was declared as
29606 'auto <identifier>'. We then instantiate the postcondition once the
29607 return type is known.
29609 For member functions, contracts are in the complete-class context, so the
29610 parse is deferred. We also have the return type avaialable (unless it's
29611 deduced), so we don't need to parse the postcondition in terms of a
29612 placeholder. */
29614 static tree
29616 {
29624 /* Parse the optional mode. */
29627 /* Check for postcondition identifiers. */
29628 cp_expr identifier;
29636 /* Defer the parsing of pre/post contracts inside class definitions. */
29637 tree contract;
29639 current_class_type &&
29641 {
29642 /* Skip until we reach an unenclose ']'. If we ran into an unnested ']'
29643 that doesn't close the attribute, return an error and let the attribute
29644 handling code emit an error for missing ']]'. */
29648 CPP_CLOSE_SQUARE,
29655 /* Build a deferred-parse node. */
29660 /* And its corresponding contract. */
29662 }
29663 else
29664 {
29665 /* Enable location wrappers when parsing contracts. */
29668 /* Build a fake variable for the result identifier. */
29671 {
29675 }
29677 /* Parse the condition, ensuring that parameters or the return variable
29678 aren't flagged for use outside the body of a function. */
29683 /* Try to recover from errors by scanning up to the end of the
29684 attribute. Sometimes we get partially parsed expressions, so
29685 we need to search the condition for errors. */
29689 /* Build the contract. */
29692 /* Leave our temporary scope for the postcondition result. */
29694 {
29697 }
29698 }
29701 {
29704 }
29707 }
29709 /* Parse a contract condition for a deferred contract. */
29712 tree fn,
29713 tree attribute)
29714 {
29717 /* Make sure we've gotten something that hasn't been parsed yet or that
29718 we're not parsing an invalid contract. */
29727 /* Build a fake variable for the result identifier. */
29730 {
29731 /* TODO: Can we guarantee that the identifier has a location? */
29735 {
29738 }
29743 }
29745 /* 'this' is not allowed in preconditions of constructors or in postconditions
29746 of destructors. Note that the previous value of this variable is
29747 established by the calling function, so we need to save it here. */
29752 {
29755 }
29759 /* Push the saved tokens onto the parser's lexer stack. */
29763 /* Parse the condition, ensuring that parameters or the return variable
29764 aren't flagged for use outside the body of a function. */
29769 /* Revert to the main lexer. */
29772 /* Restore the queue. */
29778 /* Commit to changes. */
29781 /* Leave our temporary scope for the postcondition result. */
29783 {
29786 }
29787 }
29789 /* Parse a standard C++-11 attribute specifier.
29791 attribute-specifier:
29792 [ [ attribute-using-prefix [opt] attribute-list ] ]
29793 contract-attribute-specifier
29794 alignment-specifier
29796 attribute-using-prefix:
29797 using attribute-namespace :
29799 alignment-specifier:
29800 alignas ( type-id ... [opt] )
29801 alignas ( alignment-expression ... [opt] ).
29803 Extensions for contracts:
29805 contract-attribute-specifier:
29806 [ [ assert : contract-mode [opt] : conditional-expression ] ]
29807 [ [ pre : contract-mode [opt] : conditional-expression ] ]
29808 [ [ post : contract-mode [opt] identifier [opt] :
29809 conditional-expression ] ] */
29811 static tree
29813 {
29819 {
29828 {
29831 }
29833 /* Handle contract-attribute-specs specially. */
29835 {
29840 }
29843 {
29854 {
29857 "attribute using prefix only available "
29863 }
29864 else
29866 }
29870 finish_attrs:
29874 else
29875 /* Warn about parsing c++11 attribute in non-c++11 mode, only
29876 when we are sure that we have actually parsed them. */
29878 }
29879 else
29880 {
29881 tree alignas_expr;
29883 /* Look for an alignment-specifier. */
29894 matching_parens parens;
29902 {
29909 }
29914 /* Handle alignas (pack...). */
29916 {
29919 }
29921 /* Something went wrong, so don't build the attribute. */
29925 /* Missing ')' means the code cannot possibly be valid; go ahead
29926 and commit to make sure we issue a hard error. */
29934 /* Build the C++-11 representation of an 'aligned'
29935 attribute. */
29936 attributes
29939 }
29942 }
29944 /* Parse a standard C++-11 attribute-specifier-seq.
29946 attribute-specifier-seq:
29947 attribute-specifier-seq [opt] attribute-specifier */
29949 static tree
29951 {
29955 /* Don't create wrapper nodes within attributes: the
29956 handlers don't know how to handle them. */
29957 auto_suppress_location_wrappers sentinel;
29960 {
29969 else
29972 }
29975 }
29977 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
29978 return index of the first token after balanced-token, or N on failure. */
29980 static size_t
29982 {
29985 do
29987 {
29991 /* FALLTHRU */
29993 /* Ran out of tokens. */
30015 }
30018 }
30020 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
30021 return index of the first token after the GNU attribute tokens, or N on
30022 failure. */
30024 static size_t
30026 {
30028 {
30040 }
30042 }
30044 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
30045 next token), return index of the first token after the standard C++11
30046 attribute tokens, or N on failure. */
30048 static size_t
30050 {
30052 {
30055 {
30062 }
30065 {
30070 }
30071 else
30073 }
30075 }
30077 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
30078 as the next token), return index of the first token after the attribute
30079 tokens, or N on failure. */
30081 static size_t
30083 {
30087 }
30089 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
30090 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
30091 current value of the PEDANTIC flag, regardless of whether or not
30092 the `__extension__' keyword is present. The caller is responsible
30093 for restoring the value of the PEDANTIC flag. */
30095 static bool
30097 {
30098 /* Save the old value of the PEDANTIC flag. */
30102 {
30103 /* Consume the `__extension__' token. */
30105 /* We're not being pedantic while the `__extension__' keyword is
30106 in effect. */
30110 }
30113 }
30115 /* Parse a label declaration.
30117 label-declaration:
30118 __label__ label-declarator-seq ;
30120 label-declarator-seq:
30121 identifier , label-declarator-seq
30122 identifier */
30124 static void
30126 {
30127 /* Look for the `__label__' keyword. */
30131 {
30132 tree identifier;
30134 /* Look for an identifier. */
30136 /* If we failed, stop. */
30139 /* Declare it as a label. */
30141 /* If the next token is a `;', stop. */
30144 /* Look for the `,' separating the label declarations. */
30146 }
30148 /* Look for the final `;'. */
30150 }
30152 // -------------------------------------------------------------------------- //
30153 // Concept definitions
30155 static tree
30157 {
30158 /* A concept definition is an unevaluated context. */
30159 cp_unevaluated u;
30166 {
30170 }
30175 {
30179 }
30181 processing_constraint_expression_sentinel parsing_constraint;
30186 /* Consume the trailing ';'. Diagnose the problem if it isn't there,
30187 but continue as if it were. */
30191 }
30193 // -------------------------------------------------------------------------- //
30194 // Requires Clause
30196 /* Diagnose an expression that should appear in ()'s within a requires-clause
30197 and suggest where to place those parentheses. */
30199 static void
30201 {
30203 }
30205 static void
30207 {
30212 }
30214 /* Characterizes the likely kind of expression intended by a mis-written
30215 primary constraint. */
30216 enum primary_constraint_error
30217 {
30218 pce_ok,
30219 pce_maybe_operator,
30220 pce_maybe_postfix
30221 };
30223 /* Returns true if the token(s) following a primary-expression in a
30224 constraint-logical-* expression would require parentheses. */
30226 static primary_constraint_error
30228 {
30231 {
30236 {
30237 /* An equal sign may be part of the definition of a function,
30238 and not an assignment operator, when parsing the expression
30239 for a trailing requires-clause. For example:
30241 template<typename T>
30242 struct S {
30243 S() requires C<T> = default;
30244 };
30246 Don't try to reparse this a binary operator. */
30252 }
30254 /* Arithmetic operators. */
30260 /* Bitwise operators. */
30266 /* Relational operators. */
30274 /* Pointer-to-member. */
30277 /* Assignment operators. */
30288 /* Conditional operator */
30290 /* Unenclosed binary or conditional operator. */
30294 {
30295 /* A primary constraint that precedes the parameter-list of a
30296 lambda expression is followed by an open paren.
30298 []<typename T> requires C (T a, T b) { ... }
30300 Don't try to re-parse this as a postfix expression. */
30305 }
30307 {
30308 /* A primary-constraint-expression followed by a '[[' is not a
30309 postfix expression. */
30314 }
30318 /* Unenclosed postfix operator. */
30322 /* A primary constraint that precedes the lambda-declarator of a
30323 lambda expression is followed by trailing return type.
30325 []<typename T> requires C -> void {}
30327 Don't try to re-parse this as a postfix expression in
30328 C++23 and later. In C++20 ( needs to come in between but we
30329 allow it to be omitted with pedwarn. */
30332 /* Unenclosed postfix operator. */
30334 }
30335 }
30337 /* Returns true if the next token begins a unary expression, preceded by
30338 an operator or keyword. */
30340 static bool
30342 {
30345 {
30356 {
30358 {
30374 }
30375 }
30379 }
30382 }
30384 /* Parse a primary expression within a constraint. */
30386 static cp_expr
30388 {
30389 /* If this looks like a unary expression, parse it as such, but diagnose
30390 it as ill-formed; it requires parens. */
30392 {
30396 }
30399 cp_id_kind idk;
30410 {
30411 /* The primary-expression could be part of an unenclosed non-logical
30412 compound expression. */
30414 }
30416 {
30419 }
30421 /* Retry the parse at a lower precedence. If that succeeds, diagnose the
30422 error, but return the expression as if it were valid. */
30427 else
30430 {
30433 }
30435 /* Otherwise, something has gone very wrong, and we can't generate a more
30436 meaningful diagnostic or recover. */
30439 }
30441 /* Parse a constraint-logical-and-expression.
30443 constraint-logical-and-expression:
30444 primary-expression
30445 constraint-logical-and-expression '&&' primary-expression */
30447 static cp_expr
30449 {
30452 {
30456 }
30458 }
30460 /* Parse a constraint-logical-or-expression.
30462 constraint-logical-or-expression:
30463 constraint-logical-and-expression
30464 constraint-logical-or-expression '||' constraint-logical-and-expression */
30466 static cp_expr
30468 {
30471 {
30475 }
30477 }
30479 /* Parse the expression after a requires-clause. This has a different grammar
30480 than that in the concepts TS. */
30482 static tree
30484 {
30485 processing_constraint_expression_sentinel parsing_constraint;
30492 }
30494 /* Parse a expression after a requires clause.
30496 constraint-expression:
30497 logical-or-expression
30499 The required logical-or-expression must be a constant expression. Note
30500 that we don't check that the expression is constepxr here. We defer until
30501 we analyze constraints and then, we only check atomic constraints. */
30503 static tree
30505 {
30506 processing_constraint_expression_sentinel parsing_constraint;
30515 }
30517 /* Optionally parse a requires clause:
30519 requires-clause:
30520 `requires` constraint-logical-or-expression.
30521 [ConceptsTS]
30522 `requires constraint-expression.
30524 LAMBDA_P is true when the requires-clause is parsed before the
30525 parameter-list of a lambda-declarator. */
30527 static tree
30529 {
30530 /* A requires clause is an unevaluated context. */
30531 cp_unevaluated u;
30535 {
30538 {
30540 "%<requires%> only available with "
30542 /* Parse and discard the requires-clause. */
30545 }
30547 }
30551 {
30552 /* An opening brace following the start of a requires-clause is
30553 ill-formed; the user likely forgot the second `requires' that
30554 would start a requires-expression. */
30559 /* Don't consume the `requires', so that it's reused as the start of a
30560 requires-expression. */
30561 }
30562 else
30567 else
30569 }
30571 /*---------------------------------------------------------------------------
30572 Requires expressions
30573 ---------------------------------------------------------------------------*/
30575 /* Parse a requires expression
30577 requirement-expression:
30578 'requires' requirement-parameter-list [opt] requirement-body */
30580 static tree
30582 {
30586 /* Avoid committing to outer tentative parse. */
30589 /* This is definitely a requires-expression. */
30593 {
30594 /* Local parameters are delared as variables within the scope
30595 of the expression. They are not visible past the end of
30596 the expression. Expressions within the requires-expression
30597 are unevaluated. */
30598 struct scope_sentinel
30599 {
30601 {
30605 }
30608 {
30611 }
30614 /* Parse the optional parameter list. */
30616 {
30620 }
30621 else
30624 /* Parse the requirement body. */
30630 }
30632 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
30633 the parm chain. */
30638 {
30639 /* Perform semantic processing now to diagnose any invalid types and
30640 expressions. */
30645 }
30647 }
30649 /* Parse a parameterized requirement.
30651 requirement-parameter-list:
30652 '(' parameter-declaration-clause ')' */
30654 static tree
30656 {
30657 matching_parens parens;
30661 tree parms = (cp_parser_parameter_declaration_clause
30667 /* Modify the declared parameters by removing their context
30668 so they don't refer to the enclosing scope and explicitly
30669 indicating that they are constraint variables. */
30671 {
30676 {
30679 }
30680 }
30683 }
30685 /* Parse the body of a requirement.
30687 requirement-body:
30688 '{' requirement-list '}' */
30689 static tree
30691 {
30692 matching_braces braces;
30702 }
30704 /* Parse a sequence of requirements.
30706 requirement-seq:
30707 requirement
30708 requirement-seq requirement */
30710 static tree
30712 {
30714 do
30715 {
30719 }
30723 /* If there are no valid requirements, this is not a valid expression. */
30727 /* Reverse the order of requirements so they are analyzed in order. */
30729 }
30731 /* Parse a syntactic requirement or type requirement.
30733 requirement:
30734 simple-requirement
30735 compound-requirement
30736 type-requirement
30737 nested-requirement */
30739 static tree
30741 {
30745 {
30746 /* It's probably a type-requirement. */
30751 /* No, maybe it's something like typename T::type(); */
30756 /* Non-tentative for the error. */
30758 }
30761 else
30763 }
30765 /* Parse a simple requirement.
30767 simple-requirement:
30768 expression ';' */
30770 static tree
30772 {
30783 /* Sometimes we don't get locations, so use the cached token location
30784 as a reasonable approximation. */
30789 {
30792 {
30795 }
30797 {
30801 "if a concept-id is a valid expression; add "
30803 }
30805 }
30808 }
30810 /* Parse a type requirement
30812 type-requirement
30813 nested-name-specifier [opt] required-type-name ';'
30815 required-type-name:
30816 type-name
30817 'template' [opt] simple-template-id */
30819 static tree
30821 {
30825 // Save the scope before parsing name specifiers.
30836 tree type;
30838 {
30847 }
30848 else
30868 }
30870 /* Parse a compound requirement
30872 compound-requirement:
30873 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
30875 static tree
30877 {
30878 /* Parse an expression enclosed in '{ }'s. */
30879 matching_braces braces;
30890 {
30894 }
30896 /* If the expression was invalid, skip the remainder of the requirement. */
30898 {
30902 }
30904 /* Parse the optional noexcept. */
30907 {
30910 }
30912 /* Parse the optional trailing return type. */
30915 {
30921 /* C++20 allows either a type-id or a type-constraint. Parsing
30922 a type-id will subsume the parsing for a type-constraint but
30923 allow for more syntactic forms (e.g., const C<T>*). */
30932 /* Check that we haven't written something like 'const C<T>*'. */
30934 {
30936 {
30941 }
30942 }
30944 /* P1452R2 removed the trailing-return-type option. */
30947 }
30959 }
30961 /* Parse a nested requirement. This is the same as a requires clause.
30963 nested-requirement:
30964 requires-clause */
30966 static tree
30968 {
30980 }
30982 /* Support Functions */
30984 /* Return the appropriate prefer_type argument for lookup_name based on
30985 tag_type. */
30989 {
30991 {
30995 }
30996 }
30998 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
30999 NAME should have one of the representations used for an
31000 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
31001 is returned. If PARSER->SCOPE is a dependent type, then a
31002 SCOPE_REF is returned.
31004 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
31005 returned; the name was already resolved when the TEMPLATE_ID_EXPR
31006 was formed. Abstractly, such entities should not be passed to this
31007 function, because they do not need to be looked up, but it is
31008 simpler to check for this special case here, rather than at the
31009 call-sites.
31011 In cases not explicitly covered above, this function returns a
31012 DECL, OVERLOAD, or baselink representing the result of the lookup.
31013 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
31014 is returned.
31016 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
31017 (e.g., "struct") that was used. In that case bindings that do not
31018 refer to types are ignored.
31020 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
31021 ignored.
31023 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
31024 are ignored.
31026 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
31027 types.
31029 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
31030 TREE_LIST of candidates if name-lookup results in an ambiguity, and
31031 NULL_TREE otherwise. */
31033 static cp_expr
31040 location_t name_location)
31041 {
31042 tree decl;
31045 /* Assume that the lookup will be unambiguous. */
31049 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
31050 no longer valid. Note that if we are parsing tentatively, and
31051 the parse fails, OBJECT_TYPE will be automatically restored. */
31057 /* A template-id has already been resolved; there is no lookup to
31058 do. */
31062 {
31066 }
31068 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
31069 it should already have been checked to make sure that the name
31070 used matches the type being destroyed. */
31072 {
31073 tree type;
31075 /* Figure out to which type this destructor applies. */
31080 else
31082 /* If that's not a class type, there is no destructor. */
31086 /* In a non-static member function, check implicit this->. */
31089 tf_warning_or_error);
31098 }
31100 /* By this point, the NAME should be an ordinary identifier. If
31101 the id-expression was a qualified name, the qualifying scope is
31102 stored in PARSER->SCOPE at this point. */
31105 /* Perform the lookup. */
31107 {
31113 /* If the SCOPE is dependent, the lookup must be deferred until
31114 the template is instantiated -- unless we are explicitly
31115 looking up names in uninstantiated templates. Even then, we
31116 cannot look up the name if the scope is not a class type; it
31117 might, for example, be a template type parameter. */
31122 /* Defer lookup. */
31124 else
31125 {
31128 /* If PARSER->SCOPE is a dependent type, then it must be a
31129 class type, and we must not be checking dependencies;
31130 otherwise, we would have processed this lookup above. So
31131 that PARSER->SCOPE is not considered a dependent base by
31132 lookup_member, we must enter the scope here. */
31136 /* If the PARSER->SCOPE is a template specialization, it
31137 may be instantiated during name lookup. In that case,
31138 errors may be issued. Even if we rollback the current
31139 tentative parse, those errors are valid. */
31144 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
31145 lookup result and the nested-name-specifier nominates a class C:
31146 * if the name specified after the nested-name-specifier, when
31147 looked up in C, is the injected-class-name of C (Clause 9), or
31148 * if the name specified after the nested-name-specifier is the
31149 same as the identifier or the simple-template-id's template-
31150 name in the last component of the nested-name-specifier,
31151 the name is instead considered to name the constructor of
31152 class C. [ Note: for example, the constructor is not an
31153 acceptable lookup result in an elaborated-type-specifier so
31154 the constructor would not be used in place of the
31155 injected-class-name. --end note ] Such a constructor name
31156 shall be used only in the declarator-id of a declaration that
31157 names a constructor or in a using-declaration. */
31167 }
31169 /* If the scope is a dependent type and either we deferred lookup or
31170 we did lookup but didn't find the name, rememeber the name. */
31173 {
31175 {
31176 tree type;
31178 /* The resolution to Core Issue 180 says that `struct
31179 A::B' should be considered a type-name, even if `A'
31180 is dependent. */
31185 }
31189 CPP_CLOSE_PAREN)))
31193 else
31196 is_template);
31197 }
31200 }
31202 {
31205 /* Look up the name in the scope of the OBJECT_TYPE, unless the
31206 OBJECT_TYPE is not a class. */
31208 /* If the OBJECT_TYPE is a template specialization, it may
31209 be instantiated during name lookup. In that case, errors
31210 may be issued. Even if we rollback the current tentative
31211 parse, those errors are valid. */
31213 name,
31216 tf_warning_or_error);
31217 else
31221 /* Look it up in the enclosing context. DR 141: When looking for a
31222 template-name after -> or ., only consider class templates. */
31224 /* DR 141: When looking in the
31225 current enclosing context for a
31226 template-name after -> or ., only
31227 consider class templates. */
31231 /* If we did unqualified lookup of a dependent member-qualified name and
31232 found something, do we want to use it? P1787 clarified that we need
31233 to look in the object scope first even if it's dependent, but for now
31234 let's still use it in some cases.
31235 FIXME remember unqualified lookup result to use if member lookup fails
31236 at instantiation time. */
31238 {
31240 /* Only use the unqualified class template lookup if we're actually
31241 looking at a template arg list. */
31244 }
31246 /* If we know we're looking for a type (e.g. A in p->A::x),
31247 mock up a typename. */
31250 {
31252 typename_type);
31254 }
31258 }
31259 else
31260 {
31265 }
31267 /* If the lookup failed, let our caller know. */
31271 /* If we have resolved the name of a member declaration, check to
31272 see if the declaration is accessible. When the name resolves to
31273 set of overloaded functions, accessibility is checked when
31274 overload resolution is done. If we have a TREE_LIST, then the lookup
31275 is either ambiguous or it found multiple injected-class-names, the
31276 accessibility of which is trivially satisfied.
31278 During an explicit instantiation, access is not checked at all,
31279 as per [temp.explicit]. */
31282 tf_warning_or_error);
31284 /* Pull out the template from an injected-class-name (or multiple). */
31288 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
31290 {
31293 /* The error message we have to print is too complicated for
31294 cp_parser_error, so we incorporate its actions directly. */
31296 {
31298 name);
31300 }
31302 }
31313 }
31315 /* Like cp_parser_lookup_name, but for use in the typical case where
31316 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
31317 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
31319 static tree
31321 {
31323 none_type,
31328 location);
31329 }
31331 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
31332 the current context, return the TYPE_DECL. If TAG_NAME_P is
31333 true, the DECL indicates the class being defined in a class-head,
31334 or declared in an elaborated-type-specifier.
31336 Otherwise, return DECL. */
31338 static tree
31340 {
31341 /* If the TEMPLATE_DECL is being declared as part of a class-head,
31342 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
31344 struct A {
31345 template <typename T> struct B;
31346 };
31348 template <typename T> struct A::B {};
31350 Similarly, in an elaborated-type-specifier:
31352 namespace N { struct X{}; }
31354 struct A {
31355 template <typename T> friend struct N::X;
31356 };
31358 However, if the DECL refers to a class type, and we are in
31359 the scope of the class, then the name lookup automatically
31360 finds the TYPE_DECL created by build_self_reference rather
31361 than a TEMPLATE_DECL. For example, in:
31363 template <class T> struct S {
31364 S s;
31365 };
31367 there is no need to handle such case. */
31373 }
31375 /* If too many, or too few, template-parameter lists apply to the
31376 declarator, issue an error message. Returns TRUE if all went well,
31377 and FALSE otherwise. */
31379 static bool
31382 location_t declarator_location)
31383 {
31385 {
31387 {
31396 {
31397 /* If the DECLARATOR has the form `X<y>' then it uses one
31398 additional level of template parameters. */
31401 }
31403 return cp_parser_check_template_parameters
31405 declarator);
31406 }
31422 }
31424 }
31426 /* NUM_TEMPLATES were used in the current declaration. If that is
31427 invalid, return FALSE and issue an error messages. Otherwise,
31428 return TRUE. If DECLARATOR is non-NULL, then we are checking a
31429 declarator and we can print more accurate diagnostics. */
31431 static bool
31435 location_t location,
31437 {
31438 /* If there are the same number of template classes and parameter
31439 lists, that's OK. */
31442 /* If there are more, but only one more, and the name ends in an identifier,
31443 then we are declaring a primary template. That's OK too. */
31451 /* If there are more template classes than parameter lists, we have
31452 something like:
31454 template <class T> void S<T>::R<T>::f (); */
31456 {
31466 else
31469 }
31470 /* Otherwise, there are too many template parameter lists. We have
31471 something like:
31473 template <class T> template <class U> void S::f(); */
31476 }
31478 /* Parse an optional `::' token indicating that the following name is
31479 from the global namespace. If so, PARSER->SCOPE is set to the
31480 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
31481 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
31482 Returns the new value of PARSER->SCOPE, if the `::' token is
31483 present, and NULL_TREE otherwise. */
31485 static tree
31487 {
31490 /* Peek at the next token. */
31492 /* If we're looking at a `::' token then we're starting from the
31493 global namespace, not our current location. */
31495 {
31496 /* Consume the `::' token. */
31498 /* Set the SCOPE so that we know where to start the lookup. */
31504 }
31506 {
31510 }
31513 }
31515 /* Returns TRUE if the upcoming token sequence is the start of a
31516 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
31517 declarator is preceded by the `friend' specifier. The parser flags FLAGS
31518 is used to control type-specifier parsing. */
31520 static bool
31523 {
31526 tree nested_name_specifier;
31529 /* The common case is that this is not a constructor declarator, so
31530 try to avoid doing lots of work if at all possible. It's not
31531 valid declare a constructor at function scope. */
31534 /* And only certain tokens can begin a constructor declarator. */
31539 /* DR 2237 (C++20 only): A simple-template-id is no longer valid as the
31540 declarator-id of a constructor or destructor. */
31544 /* Parse tentatively; we are going to roll back all of the tokens
31545 consumed here. */
31547 /* Assume that we are looking at a constructor declarator. */
31550 /* Look for the optional `::' operator. */
31553 /* Look for the nested-name-specifier. */
31554 nested_name_specifier
31561 /* Resolve the TYPENAME_TYPE, because the call above didn't do it. */
31564 {
31569 }
31575 /* Outside of a class-specifier, there must be a
31576 nested-name-specifier. Except in C++17 mode, where we
31577 might be declaring a guiding declaration. */
31584 /* If we have a class scope, this is easy; DR 147 says that S::S always
31585 names the constructor, and no other qualified name could. */
31588 {
31598 }
31599 /* If we still think that this might be a constructor-declarator,
31600 look for a class-name. */
31602 {
31603 /* If we have:
31605 template <typename T> struct S {
31606 S();
31607 };
31609 we must recognize that the nested `S' names a class. */
31613 tree type_decl;
31617 none_type,
31624 {
31630 none_type,
31635 else
31637 }
31639 /* If there was no class-name, then this is not a constructor.
31640 Otherwise, if we are in a class-specifier and we aren't
31641 handling a friend declaration, check that its type matches
31642 current_class_type (c++/38313). Note: error_mark_node
31643 is left alone for error recovery purposes. */
31645 && (outside_class_specifier_p
31651 /* If we're still considering a constructor, we have to see a `(',
31652 to begin the parameter-declaration-clause, followed by either a
31653 `)', an `...', or a decl-specifier. We need to check for a
31654 type-specifier to avoid being fooled into thinking that:
31656 S (f) (int);
31658 is a constructor. (It is actually a function named `f' that
31659 takes one parameter (of type `int') and returns a value of type
31660 `S'. */
31668 /* A parameter declaration begins with a decl-specifier,
31669 which is either the "attribute" keyword, a storage class
31670 specifier, or (usually) a type-specifier. */
31672 /* GNU attributes can actually appear both at the start of
31673 a parameter and parenthesized declarator.
31674 S (__attribute__((unused)) int);
31675 is a constructor, but
31676 S (__attribute__((unused)) foo) (int);
31677 is a function declaration. [[attribute]] can appear in the
31678 first form too, but not in the second form. */
31680 {
31681 tree type;
31687 {
31691 }
31693 /* Names appearing in the type-specifier should be looked up
31694 in the scope of the class. */
31698 {
31701 {
31705 {
31708 }
31709 }
31711 }
31713 /* Inside the constructor parameter list, surrounding
31714 template-parameter-lists do not apply. */
31715 saved_num_template_parameter_lists
31719 /* Look for the type-specifier. It's not optional, but its typename
31720 might be. Unless this is a friend declaration; we don't want to
31721 treat
31723 friend S (T::fn)(int);
31725 as a constructor, but with P0634, we might assume a type when
31726 looking for the type-specifier. It is actually a function named
31727 `T::fn' that takes one parameter (of type `int') and returns a
31728 value of type `S'. Constructors can be friends, but they must
31729 use a qualified name.
31731 Parse with an empty set of declaration specifiers since we're
31732 trying to match a decl-specifier-seq of the first parameter.
31733 This must be non-null so that cp_parser_simple_type_specifier
31734 will recognize a constrained placeholder type such as:
31735 'C<int> auto' where C is a type concept. */
31736 cp_decl_specifier_seq ctor_specs;
31746 parser->num_template_parameter_lists
31749 /* Leave the scope of the class. */
31754 }
31755 }
31757 /* We did not really want to consume any tokens. */
31761 }
31763 /* Parse the definition of the function given by the DECL_SPECIFIERS,
31764 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
31765 they must be performed once we are in the scope of the function.
31767 Returns the function defined. */
31769 static tree
31770 cp_parser_function_definition_from_specifiers_and_declarator
31773 tree attributes,
31775 {
31776 tree fn;
31779 /* Begin the function-definition. */
31782 /* The things we're about to see are not directly qualified by any
31783 template headers we've seen thus far. */
31786 /* If there were names looked up in the decl-specifier-seq that we
31787 did not check, check them now. We must wait until we are in the
31788 scope of the function to perform the checks, since the function
31789 might be a friend. */
31793 {
31798 }
31801 {
31802 /* Skip the entire function. */
31805 }
31807 {
31808 /* Seen already, skip it. An error message has already been output. */
31812 /* If this is a function from a class, pop the nested class. */
31815 }
31816 else
31817 {
31822 }
31825 }
31827 /* Parse the part of a function-definition that follows the
31828 declarator. INLINE_P is TRUE iff this function is an inline
31829 function defined within a class-specifier.
31831 Returns the function defined. */
31833 static tree
31836 {
31837 tree fn;
31842 bool fully_implicit_function_template_p
31845 tree implicit_template_parms
31848 cp_binding_level* implicit_template_scope
31854 /* If the next token is `return', then the code may be trying to
31855 make use of the "named return value" extension that G++ used to
31856 support. */
31859 {
31860 /* Consume the `return' keyword. */
31862 /* Look for the identifier that indicates what value is to be
31863 returned. */
31865 /* Issue an error message. */
31868 /* Skip tokens until we reach the start of the function body. */
31870 {
31877 }
31878 }
31879 /* The `extern' in `extern "C" void f () { ... }' does not apply to
31880 anything declared inside `f'. */
31881 saved_in_unbraced_linkage_specification_p
31884 /* Inside the function, surrounding template-parameter-lists do not
31885 apply. */
31886 saved_num_template_parameter_lists
31890 /* If the next token is `try', `__transaction_atomic', or
31891 `__transaction_relaxed`, then we are looking at either function-try-block
31892 or function-transaction-block. Note that all of these include the
31893 function-body. */
31897 RID_TRANSACTION_RELAXED))
31901 else
31902 cp_parser_ctor_initializer_opt_and_function_body
31905 /* Finish the function. */
31909 && !inline_p
31915 /* Generate code for it, if necessary. */
31918 /* Restore the saved values. */
31919 parser->in_unbraced_linkage_specification_p
31921 parser->num_template_parameter_lists
31925 parser->fully_implicit_function_template_p
31927 parser->implicit_template_parms
31929 parser->implicit_template_scope
31936 }
31938 /* Parse a template-declaration body (following argument list). */
31940 static void
31942 tree parameter_list,
31944 {
31948 /* We just processed one more parameter list. */
31951 /* Get the deferred access checks from the parameter list. These
31952 will be checked once we know what is being declared, as for a
31953 member template the checks must be performed in the scope of the
31954 class containing the member. */
31957 /* Tentatively parse for a new template parameter list, which can either be
31958 the template keyword or a template introduction. */
31967 /* -fconcept-ts 'concept bool' syntax is handled below, in
31968 cp_parser_single_declaration. */
31970 else
31971 {
31974 checks,
31975 member_p,
31979 /* If this is a member template declaration, let the front
31980 end know. */
31982 {
31987 }
31992 }
31993 /* We are done with the current parameter list. */
31998 /* Finish up. */
32001 /* Check the template arguments for a literal operator template. */
32005 {
32009 else
32010 {
32013 {
32020 /* OK, C++20 string literal operator template. We don't need
32021 to warn in lower dialects here because we will have already
32026 }
32028 {
32037 else
32038 /* http://cplusplus.github.io/EWG/ewg-active.html#66 */
32040 "ISO C++ did not adopt string literal operator templa"
32042 }
32043 else
32045 }
32047 {
32050 "template %qD has invalid parameter list; expected "
32051 "non-type template parameter pack %<<char...>%> or "
32053 decl);
32054 else
32056 "template %qD has invalid parameter list; expected "
32058 decl);
32059 }
32060 }
32062 /* Register member declarations. */
32065 /* If DECL is a function template, we must return to parse it later.
32066 (Even though there is no definition, there might be default
32067 arguments that need handling.) */
32071 }
32073 /* Parse a template introduction header for a template-declaration. Returns
32074 false if tentative parse fails. */
32076 static bool
32078 {
32088 /* In classes don't parse valid unnamed bitfields as invalid
32089 template introductions. */
32093 /* Look for the optional `::' operator. */
32096 /* Look for the nested-name-specifier. */
32106 /* Look up the concept for which we will be matching
32107 template parameters. */
32119 /* Look for opening brace for introduction. */
32120 matching_braces braces;
32129 /* Build vector of placeholder parameters and grab
32130 matching identifiers. */
32133 /* Look for closing brace for introduction. */
32137 /* The introduction-list shall not be empty. */
32140 {
32141 /* In cp_parser_introduction_list we have already issued an error. */
32143 }
32146 {
32150 }
32152 /* Build and associate the constraint. */
32157 introduction_list,
32158 introduction_loc);
32160 {
32167 member_p);
32169 }
32175 }
32177 /* Parse a normal template-declaration following the template keyword. */
32179 static void
32181 {
32182 tree parameter_list;
32186 /* Look for the `<' token. */
32190 {
32191 /* 14.5.2.2 [temp.mem]
32193 A local class shall not have member templates. */
32198 }
32199 /* [temp]
32201 A template ... shall not have C linkage. */
32203 {
32206 /* Give it C++ linkage to avoid confusing other parts of the
32207 front end. */
32210 }
32211 else
32214 /* We cannot perform access checks on the template parameter
32215 declarations until we know what is being declared, just as we
32216 cannot check the decl-specifier list. */
32219 /* If the next token is `>', then we have an invalid
32220 specialization. Rather than complain about an invalid template
32221 parameter, issue an error message here. */
32223 {
32227 }
32228 else
32229 {
32230 /* Parse the template parameters. */
32232 }
32234 /* Look for the `>'. */
32237 /* Manage template requirements */
32239 {
32244 }
32247 member_p);
32249 /* For the erroneous case of a template with C linkage, we pushed an
32250 implicit C++ linkage scope; exit that scope now. */
32253 }
32255 /* Parse a template-declaration, assuming that the `export' (and
32256 `extern') keywords, if present, has already been scanned. MEMBER_P
32257 is as for cp_parser_template_declaration. */
32259 static bool
32261 {
32263 {
32267 }
32272 }
32274 /* Perform the deferred access checks from a template-parameter-list.
32275 CHECKS is a TREE_LIST of access checks, as returned by
32276 get_deferred_access_checks. */
32278 static void
32279 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
32280 {
32284 }
32286 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
32287 `function-definition' sequence that follows a template header.
32288 If MEMBER_P is true, this declaration appears in a class scope.
32290 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
32291 *FRIEND_P is set to TRUE iff the declaration is a friend. */
32293 static tree
32299 {
32302 cp_decl_specifier_seq decl_specifiers;
32306 /* This function is only used when processing a template
32307 declaration. */
32311 /* Defer access checks until we know what is being declared. */
32314 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
32315 alternative. */
32318 (CP_PARSER_FLAGS_OPTIONAL
32323 cp_omp_declare_simd_data odsd;
32332 /* There are no template typedefs. */
32334 {
32338 }
32340 /* Gather up the access checks that occurred the
32341 decl-specifier-seq. */
32344 /* Check for the declaration of a template class. */
32346 {
32349 {
32352 /* In this case:
32354 struct C {
32355 friend template <typename T> struct A<T>::B;
32356 };
32358 A<T>::B will be represented by a TYPENAME_TYPE, and
32359 therefore not recognized by shadow_tag. */
32361 && !decl
32368 else
32371 /* If this is a declaration, but not a definition, associate
32372 any constraints with the type declaration. Constraints
32373 are associated with definitions in cp_parser_class_specifier. */
32377 /* Perform access checks for template parameters. */
32380 /* Give a helpful diagnostic for
32381 template <class T> struct A { } a;
32382 if we aren't already recovering from an error. */
32385 {
32387 "a class template declaration must not declare "
32391 }
32392 }
32393 }
32395 /* Complain about missing 'typename' or other invalid type names. */
32398 {
32399 /* cp_parser_parse_and_diagnose_invalid_type_name calls
32400 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
32401 the rest of this declaration. */
32404 }
32406 /* If it's not a template class, try for a template function. If
32407 the next token is a `;', then this declaration does not declare
32408 anything. But, if there were errors in the decl-specifiers, then
32409 the error might well have come from an attempted class-specifier.
32410 In that case, there's no need to warn about a missing declarator. */
32414 {
32416 /* We don't delay parsing for friends, though CWG 2510 may change
32417 that. */
32421 flags,
32423 checks,
32425 member_p,
32426 declares_class_or_enum,
32430 /* 7.1.1-1 [dcl.stc]
32432 A storage-class-specifier shall not be specified in an explicit
32433 specialization... */
32435 && explicit_specialization_p
32437 {
32441 }
32445 }
32447 /* Look for a trailing `;' after the declaration. */
32453 out:
32456 /* Clear any current qualification; whatever comes next is the start
32457 of something new. */
32465 }
32467 /* Parse a cast-expression that is not the operand of a unary "&". */
32469 static cp_expr
32471 {
32474 }
32476 /* Parse a functional cast to TYPE. Returns an expression
32477 representing the cast. */
32479 static cp_expr
32481 {
32483 tree expression_list;
32484 cp_expr cast;
32493 {
32503 /* Create a location of the form:
32504 type_name{i, f}
32505 ^~~~~~~~~~~~~~~
32506 with caret == start at the start of the type name,
32507 finishing at the closing brace. */
32512 }
32521 else
32522 {
32525 }
32527 /* Create a location of the form:
32528 float(i)
32529 ^~~~~~~~
32530 with caret == start at the start of the type name,
32531 finishing at the closing paren. */
32535 tf_warning_or_error);
32537 /* [expr.const]/1: In an integral constant expression "only type
32538 conversions to integral or enumeration type can be used". */
32544 NIC_CONSTRUCTOR))
32548 }
32550 /* Save the tokens that make up the body of a member function defined
32551 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
32552 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
32553 specifiers applied to the declaration. Returns the FUNCTION_DECL
32554 for the member function. */
32556 static tree
32560 tree attributes)
32561 {
32564 tree fn;
32567 /* Create the FUNCTION_DECL. */
32571 /* If something went badly wrong, bail out now. */
32573 {
32574 /* If there's a function-body, skip it. */
32579 }
32581 /* Remember it, if there are default args to post process. */
32584 /* Save away the tokens that make up the body of the
32585 function. */
32591 RID_TRANSACTION_ATOMIC))
32592 {
32594 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
32601 {
32607 }
32608 else
32611 {
32615 }
32616 }
32618 /* Handle function try blocks. */
32620 {
32623 }
32624 /* We can have braced-init-list mem-initializers before the fn body. */
32626 {
32629 {
32630 /* cache_group will stop after an un-nested { } pair, too. */
32634 /* variadic mem-inits have ... after the ')'. */
32637 }
32638 }
32640 /* Handle function try blocks. */
32646 /* Save away the inline definition; we will process it when the
32647 class is complete. */
32651 /* We need to know that this was defined in the class, so that
32652 friend templates are handled correctly. */
32655 /* Add FN to the queue of functions to be parsed later. */
32659 }
32661 /* Save the tokens that make up the in-class initializer for a non-static
32662 data member. Returns a DEFERRED_PARSE. */
32664 static tree
32666 {
32668 }
32670 /* Parse a template-argument-list, as well as the trailing ">" (but
32671 not the opening "<"). See cp_parser_template_argument_list for the
32672 return value. */
32674 static tree
32676 {
32677 tree arguments;
32678 tree saved_scope;
32679 tree saved_qualifying_scope;
32680 tree saved_object_scope;
32683 /* [temp.names]
32685 When parsing a template-id, the first non-nested `>' is taken as
32686 the end of the template-argument-list rather than a greater-than
32687 operator. */
32688 saved_greater_than_is_operator_p
32691 /* Parsing the argument list may modify SCOPE, so we save it
32692 here. */
32696 /* We need to evaluate the template arguments, even though this
32697 template-id may be nested within a "sizeof". */
32698 cp_evaluated ev;
32699 /* Parse the template-argument-list itself. */
32704 {
32707 }
32708 else
32710 /* Look for the `>' that ends the template-argument-list. If we find
32711 a '>>' instead, it's probably just a typo. */
32713 {
32715 {
32716 /* In C++0x, a `>>' in a template argument list or cast
32717 expression is considered to be two separate `>'
32718 tokens. So, change the current token to a `>', but don't
32719 consume it: it will be consumed later when the outer
32720 template argument list (or cast expression) is parsed.
32721 Note that this replacement of `>' for `>>' is necessary
32722 even if we are parsing tentatively: in the tentative
32723 case, after calling
32724 cp_parser_enclosed_template_argument_list we will always
32725 throw away all of the template arguments and the first
32726 closing `>', either because the template argument list
32727 was erroneous or because we are replacing those tokens
32728 with a CPP_TEMPLATE_ID token. The second `>' (which will
32729 not have been thrown away) is needed either to close an
32730 outer template argument list or to complete a new-style
32731 cast. */
32734 }
32736 {
32737 /* If we're in a nested template argument list, the '>>' has
32738 to be a typo for '> >'. We emit the error message, but we
32739 continue parsing and we push a '>' as next token, so that
32740 the argument list will be parsed correctly. Note that the
32741 global source location is still on the token before the
32742 '>>', so we need to say explicitly where we want it. */
32750 }
32751 else
32752 {
32753 /* If this is not a nested template argument list, the '>>'
32754 is a typo for '>'. Emit an error message and continue.
32755 Same deal about the token location, but here we can get it
32756 right by consuming the '>>' before issuing the diagnostic. */
32759 "spurious %<>>%>, use %<>%> to terminate "
32761 }
32762 }
32763 /* Similarly for >>= and >=. */
32766 {
32772 {
32775 }
32777 {
32780 else
32783 }
32784 else
32785 {
32788 }
32794 }
32795 else
32797 /* The `>' token might be a greater-than operator again now. */
32798 parser->greater_than_is_operator_p
32800 /* Restore the SAVED_SCOPE. */
32806 }
32808 /* MEMBER_FUNCTION is a member function, or a friend. If default
32809 arguments, or the body of the function have not yet been parsed,
32810 parse them now. */
32812 static void
32814 {
32817 /* If this member is a template, get the underlying
32818 FUNCTION_DECL. */
32822 /* There should not be any class definitions in progress at this
32823 point; the bodies of members are only parsed outside of all class
32824 definitions. */
32826 /* While we're parsing the member functions we might encounter more
32827 classes. We want to handle them right away, but we don't want
32828 them getting mixed up with functions that are currently in the
32829 queue. */
32832 /* Make sure that any template parameters are in scope. */
32835 /* If the body of the function has not yet been parsed, parse it
32836 now. Except if the tokens have been purged (PR c++/39751). */
32839 {
32840 tree function_scope;
32843 /* The function is no longer pending; we are processing it. */
32848 /* If this is a local class, enter the scope of the containing
32849 function. */
32854 /* Push the body of the function onto the lexer stack. */
32857 /* Let the front end know that we going to be defining this
32858 function. */
32862 /* #pragma omp declare reduction needs special parsing. */
32864 {
32869 }
32870 else
32871 /* Now, parse the body of the function. */
32875 /* Leave the scope of the containing function. */
32879 }
32881 /* Remove any template parameters from the symbol table. */
32884 /* Restore the queue. */
32886 }
32888 /* If DECL contains any default args, remember it on the unparsed
32889 functions queue. */
32891 static void
32893 {
32894 tree probe;
32897 probe;
32900 {
32904 }
32906 /* Remember if there is a noexcept-specifier to post process. */
32911 /* Contracts are deferred. */
32914 {
32917 }
32918 }
32920 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
32921 which is either a FIELD_DECL or PARM_DECL. Parse it and return
32922 the result. For a PARM_DECL, PARMTYPE is the corresponding type
32923 from the parameter-type-list. */
32925 static tree
32928 {
32930 tree parsed_arg;
32936 /* Push the saved tokens for the default argument onto the parser's
32937 lexer stack. */
32943 /* Parse the default argument. */
32954 {
32955 /* In a non-template class, check conversions now. In a template,
32956 we'll wait and instantiate these as needed. */
32959 tf_warning_or_error);
32962 else
32964 }
32966 /* If the token stream has not been completely used up, then
32967 there was extra junk after the end of the default
32968 argument. */
32970 {
32973 else
32975 }
32977 /* Revert to the main lexer. */
32981 }
32983 /* FIELD is a non-static data member with an initializer which we saved for
32984 later; parse it now. */
32986 static void
32988 {
32989 tree def;
32996 NULL_TREE);
33002 }
33004 /* FN is a FUNCTION_DECL which may contains a parameter with an
33005 unparsed DEFERRED_PARSE. Parse the default args now. This function
33006 assumes that the current scope is the scope in which the default
33007 argument should be processed. */
33009 static void
33011 {
33014 /* While we're parsing the default args, we might (due to the
33015 statement expression extension) encounter more classes. We want
33016 to handle them right away, but we don't want them getting mixed
33017 up with default args that are currently in the queue. */
33020 /* Local variable names (and the `this' keyword) may not appear
33021 in a default argument. */
33029 /* Gather the PARM_DECLs into a vec so we can keep track of them when
33030 pushdecl clears DECL_CHAIN. */
33031 releasing_vec parms;
33041 {
33043 tree parsed_arg;
33052 /* This can happen for a friend declaration for a function
33053 already declared with default arguments. */
33056 parsed_arg
33058 default_arg,
33062 /* Update any instantiations we've already created. */
33065 }
33069 /* Restore DECL_CHAINs after clobbering by pushdecl. */
33072 {
33075 }
33079 /* Make sure no default arg is missing. */
33082 /* Restore the state of local_variables_forbidden_p. */
33085 /* Restore the queue. */
33087 }
33089 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
33091 sizeof ... ( identifier )
33093 where the 'sizeof' token has already been consumed. */
33095 static tree
33097 {
33098 /* Consume the `...'. */
33102 matching_parens parens;
33106 else
33114 /* The name is not qualified. */
33134 }
33136 /* Parse the operand of `sizeof' (or a similar operator). Returns
33137 either a TYPE or an expression, depending on the form of the
33138 input. The KEYWORD indicates which kind of expression we have
33139 encountered. */
33141 static tree
33143 {
33150 /* If it's a `...', then we are computing the length of a parameter
33151 pack. */
33156 /* Types cannot be defined in a `sizeof' expression. Save away the
33157 old message. */
33160 parser->type_definition_forbidden_message
33162 parser->type_definition_forbidden_message_arg
33165 /* The restrictions on constant-expressions do not apply inside
33166 sizeof expressions. */
33167 saved_integral_constant_expression_p
33169 saved_non_integral_constant_expression_p
33176 /* Do not actually evaluate the expression. */
33179 /* If it's a `(', then we might be looking at the type-id
33180 construction. */
33182 {
33187 /* We can't be sure yet whether we're looking at a type-id or an
33188 expression. */
33191 matching_parens parens;
33194 /* Note: as a GNU Extension, compound literals are considered
33195 postfix-expressions as they are in C99, so they are valid
33196 arguments to sizeof. See comment in cp_parser_cast_expression
33197 for details. */
33200 else
33201 {
33204 /* Look for the type-id. */
33206 /* Look for the closing `)'. */
33209 }
33211 /* If all went well, then we're done. */
33214 else
33215 {
33216 /* Commit to the tentative_firewall so we get syntax errors. */
33220 }
33221 }
33222 else
33225 /* Go back to evaluating expressions. */
33229 /* And restore the old one. */
33232 parser->integral_constant_expression_p
33234 parser->non_integral_constant_expression_p
33238 }
33240 /* If the current declaration has no declarator, return true. */
33242 static bool
33244 {
33245 /* If the next token is a `;' or a `,' then there is no
33246 declarator. */
33249 }
33251 /* Update the DECL_SPECS to reflect the storage class indicated by
33252 KEYWORD. */
33254 static void
33259 {
33260 cp_storage_class storage_class;
33263 {
33281 }
33284 {
33288 }
33290 {
33297 else
33304 }
33309 {
33312 }
33317 /* A storage class specifier cannot be applied alongside a typedef
33318 specifier. If there is a typedef specifier present then set
33319 conflicting_specifiers_p which will trigger an error later
33320 on in grokdeclarator. */
33323 {
33330 }
33331 }
33333 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
33334 is true, the type is a class or enum definition. */
33336 static void
33338 tree type_spec,
33341 {
33344 /* If the user tries to redeclare bool, char8_t, char16_t, char32_t, or
33345 wchar_t (with, for example, in "typedef int wchar_t;") we remember that
33346 this is what happened. In system headers, we ignore these
33347 declarations so that G++ can work with system headers that are not
33348 C++-safe. */
33350 && !type_definition_p
33361 {
33364 ds_redefined_builtin_type_spec,
33365 token);
33367 {
33371 }
33372 }
33375 else
33376 {
33381 }
33382 }
33384 /* True iff TOKEN is the GNU keyword __thread. */
33386 static bool
33388 {
33391 }
33393 /* Set the location for a declarator specifier and check if it is
33394 duplicated.
33396 DECL_SPECS is the sequence of declarator specifiers onto which to
33397 set the location.
33399 DS is the single declarator specifier to set which location is to
33400 be set onto the existing sequence of declarators.
33402 LOCATION is the location for the declarator specifier to
33403 consider. */
33405 static void
33408 {
33417 {
33421 }
33422 else
33423 {
33425 {
33429 else
33430 {
33433 OPT_Wlong_long,
33435 }
33436 }
33438 {
33442 {
33446 }
33447 else
33448 {
33451 }
33452 }
33453 else
33454 {
33472 "consteval"
33473 };
33477 }
33478 }
33479 }
33481 /* Return true iff the declarator specifier DS is present in the
33482 sequence of declarator specifiers DECL_SPECS. */
33484 bool
33486 cp_decl_spec ds)
33487 {
33494 }
33496 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
33497 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
33499 static bool
33501 {
33503 }
33505 /* Issue an error message indicating that TOKEN_DESC was expected.
33506 If KEYWORD is true, it indicated this function is called by
33507 cp_parser_require_keword and the required token can only be
33508 a indicated keyword.
33510 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
33511 within any error as the location of an "opening" token matching
33512 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
33513 RT_CLOSE_PAREN). */
33515 static void
33517 required_token token_desc,
33519 location_t matching_location)
33520 {
33526 {
33601 }
33604 {
33606 {
33684 }
33685 }
33689 }
33692 /* If the next token is of the indicated TYPE, consume it. Otherwise,
33693 issue an error message indicating that TOKEN_DESC was expected.
33695 Returns the token consumed, if the token had the appropriate type.
33696 Otherwise, returns NULL.
33698 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
33699 within any error as the location of an "opening" token matching
33700 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
33701 RT_CLOSE_PAREN). */
33706 required_token token_desc,
33707 location_t matching_location)
33708 {
33711 else
33712 {
33713 /* Output the MESSAGE -- unless we're parsing tentatively. */
33716 matching_location);
33718 }
33719 }
33721 /* Skip an entire parameter list from start to finish. The next token must
33722 be the initial "<" of the parameter list. Returns true on success and
33723 false otherwise. */
33725 static bool
33727 {
33728 /* Consume the "<" because cp_parser_skip_to_end_of_template_parameter_list
33729 requires it. */
33732 }
33734 /* Ensure we are at the end of a template parameter list. If we are, return.
33735 If we are not, something has gone wrong, in which case issue an error and
33736 skip to end of the parameter list. */
33738 static void
33740 {
33741 /* Are we ready, yet? If not, issue error message. */
33746 }
33748 /* You should only call this function from inside a template parameter list
33749 (i.e. the current token should at least be the initial "<" of the
33750 parameter list). If you are skipping the entire list, it may be better to
33751 use cp_parser_skip_entire_template_parameter_list.
33753 Tokens are skipped until the final ">" is found, or if we see
33754 '{', '}', ';', or if we find an unbalanced ')' or ']'.
33756 Returns true if we successfully reached the end, and false if
33757 something unexpected happened (e.g. end of file). */
33759 static bool
33761 {
33762 /* Current level of '< ... >'. */
33764 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
33767 /* Skip tokens until the desired token is found. */
33769 {
33770 /* Peek at the next token. */
33772 {
33780 /* C++0x views the `>>' operator as two `>' tokens, but
33781 C++98 does not. */
33784 {
33785 /* We've hit a `>>' where the first `>' closes the
33786 template argument list, and the second `>' is
33787 spurious. Just consume the `>>' and stop; we've
33788 already produced at least one error. */
33791 }
33792 /* Fall through for C++0x, so we handle the second `>' in
33793 the `>>'. */
33798 {
33799 /* We've reached the token we want, consume it and stop. */
33802 }
33821 /* The '>' was probably forgotten, don't look further. */
33826 }
33828 /* Consume this token. */
33830 }
33831 }
33833 /* If the next token is the indicated keyword, consume it. Otherwise,
33834 issue an error message indicating that TOKEN_DESC was expected.
33836 Returns the token consumed, if the token had the appropriate type.
33837 Otherwise, returns NULL. */
33842 required_token token_desc)
33843 {
33847 {
33849 UNKNOWN_LOCATION);
33851 }
33854 }
33856 /* Returns TRUE iff TOKEN is a token that can begin the body of a
33857 function-definition. */
33859 static bool
33861 {
33864 /* A ctor-initializer begins with a `:'. */
33866 /* A function-try-block begins with `try'. */
33868 /* A function-transaction-block begins with `__transaction_atomic'
33869 or `__transaction_relaxed'. */
33872 /* The named return value extension begins with `return'. */
33874 }
33876 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
33877 definition. */
33879 static bool
33881 {
33888 }
33890 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
33891 C++0x) ending a template-argument. */
33893 static bool
33895 {
33903 /* For better diagnostics, treat >>= like that too, that
33904 shouldn't appear non-nested in template arguments. */
33906 }
33908 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
33909 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
33911 static bool
33914 {
33920 /* Check for the sequence `<::' in the original code. It would be lexed as
33921 `[:', where `[' is a digraph, and there is no whitespace before
33922 `:'. */
33924 {
33929 }
33931 }
33933 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
33934 or none_type otherwise. */
33936 static enum tag_types
33938 {
33940 {
33950 }
33951 }
33953 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
33954 or none_type otherwise or if the token is null. */
33956 static enum tag_types
33958 {
33963 {
33971 }
33972 }
33974 /* Diagnose redundant enum-keys. */
33976 static void
33979 {
33985 /* Look up the NAME to see if it unambiguously refers to the TYPE. */
33990 /* The enum-key is redundant for uses of the TYPE that are not
33991 declarations and for which name lookup returns just the type
33992 itself. */
34000 {
34001 /* Avoid issuing the diagnostic for apparently redundant (unscoped)
34002 enum tag in shared C/C++ code in files (such as headers) included
34003 in the main source file. */
34006 LRK_MACRO_DEFINITION_LOCATION,
34010 }
34018 }
34020 /* Describes the set of declarations of a struct, class, or class template
34021 or its specializations. Used for -Wmismatched-tags. */
34023 class class_decl_loc_t
34024 {
34029 {
34031 }
34033 /* Constructs an object for a single declaration of a class with
34034 CLASS_KEY at the current location in the current function (or
34035 at another scope). KEY_REDUNDANT is true if the class-key may
34036 be omitted in the current context without an ambiguity with
34037 another symbol with the same name.
34038 DEF_P is true for a class declaration that is a definition.
34039 CURLOC is the associated location. */
34043 {
34046 key_redundant);
34048 }
34050 /* Copy, assign, and destroy the object. Necessary because LOCVEC
34051 isn't safely copyable and assignable and doesn't release storage
34052 on its own. */
34056 { }
34059 {
34067 }
34070 {
34072 }
34074 /* Issues -Wmismatched-tags for a single class. */
34077 /* Issues -Wmismatched-tags for all classes. */
34080 /* Adds TYPE_DECL to the collection of class decls and diagnoses
34081 redundant tags (if -Wredundant-tags is enabled). */
34084 /* Either adds this decl to the collection of class decls
34085 or diagnoses it, whichever is appropriate. */
34091 {
34093 }
34096 {
34098 }
34101 {
34103 }
34106 {
34108 }
34110 /* True if a definition for the class has been seen. */
34112 {
34114 }
34116 /* The location of a single mention of a class type with the given
34117 class-key. */
34118 struct class_key_loc_t
34119 {
34122 { }
34124 /* The function the type is mentioned in. */
34125 tree func;
34126 /* The exact location. */
34127 location_t loc;
34128 /* The class-key used in the mention of the type. */
34129 tag_types class_key;
34130 /* True when the class-key could be omitted at this location
34131 without an ambiguity with another symbol of the same name. */
34133 };
34134 /* Avoid using auto_vec here since it's not safe to copy due to pr90904. */
34136 /* LOCVEC index of the definition or UINT_MAX if none exists. */
34138 /* The class-key the class was last declared with or none_type when
34139 it has been declared with a mismatched key. */
34140 tag_types def_class_key;
34142 /* A mapping between a TYPE_DECL for a class and the class_decl_loc_t
34143 description above. */
34146 };
34150 /* Issue an error message if the CLASS_KEY does not match the TYPE.
34151 DEF_P is expected to be set for a definition of class TYPE. DECL_P
34152 is set for a declaration of class TYPE and clear for a reference to
34153 it that is not a declaration of it. */
34155 static void
34159 {
34165 {
34169 type))
34173 }
34178 /* Only consider the true class-keys below and ignore typename_type,
34179 etc. that are not C++ class-keys. */
34186 }
34188 /* Returns the template or specialization of one to which the RECORD_TYPE
34189 TYPE corresponds. */
34191 static tree
34193 {
34196 /* Determine the template or its partial specialization to which TYPE
34197 corresponds. */
34206 }
34209 /* Adds the class TYPE to the collection of class decls and diagnoses
34210 redundant tags (if -Wredundant-tags is enabled).
34211 DEF_P is expected to be set for a definition of class TYPE. DECL_P
34212 is set for a (likely, based on syntactic context) declaration of class
34213 TYPE and clear for a reference to it that is not a declaration of it. */
34215 void
34218 {
34221 /* Look up the NAME to see if it unambiguously refers to the TYPE
34222 and set KEY_REDUNDANT if so. */
34227 /* The class-key is redundant for uses of the CLASS_TYPE that are
34228 neither definitions of it nor declarations, and for which name
34229 lookup returns just the type itself. */
34240 {
34241 /* Avoid issuing the diagnostic for apparently redundant struct
34242 and union class-keys in shared C/C++ code in files (such as
34243 headers) included in the main source file. */
34246 LRK_MACRO_DEFINITION_LOCATION,
34250 }
34252 /* Set if a declaration of TYPE has previously been seen or if it must
34253 exist in a precompiled header. */
34257 {
34260 {
34261 /* TYPE_DECL is the first declaration or definition of the type
34262 (outside precompiled headers -- see below). Just create
34263 a new entry for it and return unless it's a declaration
34264 involving a template that may need to be diagnosed by
34265 -Wredundant-tags. */
34269 }
34270 else
34271 {
34272 /* TYPE was previously defined in some unknown precompiled header.
34273 Simply add a record of its definition at an unknown location and
34274 proceed below to add a reference to it at the current location.
34275 (Declarations in precompiled headers that are not definitions
34276 are ignored.) */
34277 tag_types def_key
34282 }
34283 }
34285 /* A prior declaration of TYPE_DECL has been seen. */
34288 {
34295 type);
34296 }
34299 /* Do nothing if this is the first declaration of the type. */
34303 /* Do nothing if the class-key in this declaration matches
34304 the definition. */
34308 def_p);
34309 }
34311 /* Either adds this DECL corresponding to the TYPE_DECL to the collection
34312 of class decls or diagnoses it, whichever is appropriate. */
34314 void
34316 tag_types class_key,
34319 {
34320 /* Reset the CLASS_KEY associated with this type on mismatch.
34321 This is an optimization that lets the diagnostic code skip
34322 over classes that use the same class-key in all declarations. */
34326 /* Set IDXDEF to the index of the vector corresponding to
34327 the definition. */
34331 /* Append a record of this declaration to the vector. */
34333 redundant);
34339 /* As a space optimization diagnose declarations of a class
34340 whose definition has been seen and purge the LOCVEC of
34341 all entries except the definition. */
34344 {
34350 }
34351 else
34352 /* Pop the entry pushed above for this declaration. */
34354 }
34356 /* Issues -Wmismatched-tags for a single class. */
34358 void
34360 {
34364 /* Number of uses of the class. */
34367 /* The class (or template) declaration guiding the decisions about
34368 the diagnostic. For ordinary classes it's the same as THIS. For
34369 uses of instantiations of templates other than their declarations
34370 it points to the record for the declaration of the corresponding
34371 primary template or partial specialization. */
34376 {
34377 /* For implicit instantiations of a primary template look up
34378 the primary or partial specialization and use it as
34379 the expected class-key rather than using the class-key of
34380 the first reference to the instantiation. The primary must
34381 be (and inevitably is) at index zero. */
34385 }
34386 else
34387 {
34388 /* Skip declarations that consistently use the same class-key. */
34391 }
34393 /* Set if a definition for the class has been seen. */
34396 /* The index of the declaration whose class-key this declaration
34397 is expected to match. It's either the class-key of the class
34398 definition if one exists or the first declaration otherwise. */
34401 /* The class-key the class is expected to be declared with: it's
34402 either the key used in its definition or the first declaration
34403 if no definition has been provided.
34404 For implicit instantiations of a primary template it's
34405 the class-key used to declare the primary with. The primary
34406 must be at index zero. */
34410 /* Advance IDX to the first declaration that either is not
34411 a definition or that doesn't match the first declaration
34412 if no definition is provided. */
34417 /* Save the current function before changing it below. */
34419 /* Set the function declaration to print in diagnostic context. */
34427 auto_diagnostic_group d;
34428 /* Issue a warning for the first mismatched declaration.
34429 Avoid using "%#qT" since the class-key for the same type will
34430 be the same regardless of which one was used in the declaraion. */
34434 {
34435 /* Suggest how to avoid the warning for each instance since
34436 the guidance may be different depending on context. */
34438 (key_redundant_p
34441 xpectkstr);
34443 /* Also point to the first declaration or definition that guided
34444 the decision to issue the warning above. */
34446 (def_p
34450 }
34452 /* Issue warnings for the remaining inconsistent declarations. */
34454 {
34456 /* Skip over the declarations that match either the definition
34457 if one was provided or the first declaration. */
34463 /* Set the function declaration to print in diagnostic context. */
34468 /* Suggest how to avoid the warning for each instance since
34469 the guidance may be different depending on context. */
34471 (key_redundant_p
34474 xpectkstr);
34475 }
34477 /* Restore the current function in case it was replaced above. */
34479 }
34481 /* Issues -Wmismatched-tags for all classes. Called at the end
34482 of processing a translation unit, after declarations of all class
34483 types and their uses have been recorded. */
34485 void
34487 {
34488 /* CLASS2LOC should be empty if both -Wmismatched-tags and
34489 -Wredundant-tags are disabled. */
34491 || warn_redundant_tags
34494 /* Save the current function before changing on return. It should
34495 be null at this point. */
34499 {
34500 /* Iterate over the collected class/struct/template declarations. */
34503 {
34507 }
34508 }
34511 }
34513 /* Issue an error message if DECL is redeclared with different
34514 access than its original declaration [class.access.spec/3].
34515 This applies to nested classes, nested class templates and
34516 enumerations [class.mem/1]. */
34518 static void
34520 {
34531 }
34533 /* Look for the `template' keyword, as a syntactic disambiguator.
34534 Return TRUE iff it is present, in which case it will be
34535 consumed. */
34537 static bool
34539 {
34541 {
34542 /* In C++98 the `template' keyword can only be used within templates;
34543 outside templates the parser can always figure out what is a
34544 template and what is not. In C++11, per the resolution of DR 468,
34545 `template' is allowed in cases where it is not strictly necessary. */
34548 {
34551 "in C++98 %<template%> (as a disambiguator) is only "
34553 /* If this part of the token stream is rescanned, the same
34554 error message would be generated. So, we purge the token
34555 from the stream. */
34558 }
34559 else
34560 {
34561 /* Consume the `template' keyword. */
34564 }
34565 }
34567 }
34569 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
34570 set PARSER->SCOPE, and perform other related actions. */
34572 static void
34574 {
34577 /* Get the stored value. */
34579 /* Set the scope from the stored value. */
34584 }
34586 /* Consume tokens up through a non-nested END token. Returns TRUE if we
34587 encounter the end of a block before what we were looking for. */
34589 static bool
34593 {
34595 {
34598 /* Abort a parenthesized expression if we encounter a semicolon. */
34602 /* If we've reached the end of the file, stop. */
34608 /* We've hit the end of an enclosing block, so there's been some
34609 kind of syntax error. */
34612 /* Consume the token. */
34614 /* See if it starts a new group. */
34616 {
34618 /* In theory this should probably check end == '}', but
34619 cp_parser_save_member_function_body needs it to exit
34620 after either '}' or ')' when called with ')'. */
34623 }
34625 {
34629 }
34634 }
34635 }
34637 /* Like above, for caching a default argument or NSDMI. Both of these are
34638 terminated by a non-nested comma, but it can be unclear whether or not a
34639 comma is nested in a template argument list unless we do more parsing.
34640 In order to handle this ambiguity, when we encounter a ',' after a '<'
34641 we try to parse what follows as a parameter-declaration-list (in the
34642 case of a default argument) or a member-declarator (in the case of an
34643 NSDMI). If that succeeds, then we stop caching. */
34645 static tree
34647 {
34652 tree default_argument;
34654 /* Add tokens until we have processed the entire default
34655 argument. We add the range [first_token, token). */
34658 {
34659 /* For list-initialization, this is straightforward. */
34662 }
34664 {
34667 /* Peek at the next token. */
34669 /* What we do depends on what token we have. */
34671 {
34672 /* In valid code, a default argument must be
34673 immediately followed by a `,' `)', or `...'. */
34676 {
34677 /* If we've seen a '<', we might be in a
34678 template-argument-list. Until Core issue 325 is
34679 resolved, we don't know how this situation ought
34680 to be handled, so try to DTRT. We check whether
34681 what comes after the comma is a valid parameter
34682 declaration list. If it is, then the comma ends
34683 the default argument; otherwise the default
34684 argument continues. */
34688 /* Set ITALP so cp_parser_parameter_declaration_list
34689 doesn't decide to commit to this parse. */
34696 {
34697 /* Parse declarators until we reach a non-comma or
34698 somthing that cannot be an initializer.
34699 Just checking whether we're looking at a single
34700 declarator is insufficient. Consider:
34701 int var = tuple<T,U>::x;
34702 The template parameter 'U' looks exactly like a
34703 declarator. */
34704 do
34705 {
34709 CP_PARSER_FLAGS_NONE,
34718 }
34720 /* If we met an '=' or ';' then the original comma
34721 was the end of the NSDMI. Otherwise assume
34722 we're still in the NSDMI. */
34725 }
34726 else
34727 {
34730 tree t = cp_parser_parameter_declaration_list
34736 }
34743 }
34744 /* FALLTHRU */
34747 /* If we run into a non-nested `;', `}', or `]',
34748 then the code is invalid -- but the default
34749 argument is certainly over. */
34754 /* Handle correctly int n = sizeof ... ( p ); */
34757 /* Update DEPTH, if necessary. */
34772 /* This might be the comparison operator, or it might
34773 start a template argument list. */
34780 /* Fall through for C++0x, which treats the `>>'
34781 operator like two `>' tokens in certain
34782 cases. */
34787 {
34788 /* This might be an operator, or it might close a
34789 template argument list. But if a previous '<'
34790 started a template argument list, this will have
34791 closed it, so we can't be in one anymore. */
34795 }
34798 /* If we run out of tokens, issue an error message. */
34806 /* In these cases, we should look for template-ids.
34807 For example, if the default argument is
34808 `X<int, double>()', we need to do name lookup to
34809 figure out whether or not `X' is a template; if
34810 so, the `,' does not end the default argument.
34812 That is not yet done. */
34817 }
34819 /* If we've reached the end, stop. */
34823 /* Add the token to the token block. */
34825 }
34827 /* Create a DEFERRED_PARSE to represent the unparsed default
34828 argument. */
34835 }
34837 /* A location to use for diagnostics about an unparsed DEFERRED_PARSE. */
34839 location_t
34841 {
34846 }
34848 /* Begin parsing tentatively. We always save tokens while parsing
34849 tentatively so that if the tentative parsing fails we can restore the
34850 tokens. */
34852 static void
34854 {
34855 /* Enter a new parsing context. */
34857 /* Begin saving tokens. */
34859 /* In order to avoid repetitive access control error messages,
34860 access checks are queued up until we are no longer parsing
34861 tentatively. */
34863 }
34865 /* Commit to the currently active tentative parse. */
34867 static void
34869 {
34873 /* Mark all of the levels as committed. */
34876 {
34883 }
34884 }
34886 /* Commit to the topmost currently active tentative parse.
34888 Note that this function shouldn't be called when there are
34889 irreversible side-effects while in a tentative state. For
34890 example, we shouldn't create a permanent entry in the symbol
34891 table, or issue an error message that might not apply if the
34892 tentative parse is aborted. */
34894 static void
34896 {
34901 {
34909 }
34910 }
34912 /* Abort the currently active tentative parse. All consumed tokens
34913 will be rolled back, and no diagnostics will be issued. */
34915 static void
34917 {
34921 /* Now, pretend that we want to see if the construct was
34922 successfully parsed. */
34924 }
34926 /* Stop parsing tentatively. If a parse error has occurred, restore the
34927 token stream. Otherwise, commit to the tokens we have consumed.
34928 Returns true if no error occurred; false otherwise. */
34930 static bool
34932 {
34936 /* Remember whether or not an error occurred, since we are about to
34937 destroy that information. */
34939 /* Remove the topmost context from the stack. */
34942 /* If no parse errors occurred, commit to the tentative parse. */
34944 {
34945 /* Commit to the tokens read tentatively, unless that was
34946 already done. */
34951 }
34952 /* Otherwise, if errors occurred, roll back our state so that things
34953 are just as they were before we began the tentative parse. */
34954 else
34955 {
34958 }
34959 /* Add the context to the front of the free list. */
34964 }
34966 /* Returns true if we are parsing tentatively and are not committed to
34967 this tentative parse. */
34969 static bool
34971 {
34974 }
34976 /* Returns nonzero iff an error has occurred during the most recent
34977 tentative parse. */
34979 static bool
34981 {
34984 }
34986 /* Returns nonzero if GNU extensions are allowed. */
34988 static bool
34990 {
34992 }
34993 \f
34994 /* Objective-C++ Productions */
34997 /* Parse an Objective-C expression, which feeds into a primary-expression
34998 above.
35000 objc-expression:
35001 objc-message-expression
35002 objc-string-literal
35003 objc-encode-expression
35004 objc-protocol-expression
35005 objc-selector-expression
35007 Returns a tree representation of the expression. */
35009 static cp_expr
35011 {
35012 /* Try to figure out what kind of declaration is present. */
35016 {
35026 {
35038 }
35039 /* FALLTHRU */
35045 }
35048 }
35050 /* Parse an Objective-C message expression.
35052 objc-message-expression:
35053 [ objc-message-receiver objc-message-args ]
35055 Returns a representation of an Objective-C message. */
35057 static tree
35059 {
35072 /* Construct a location e.g.
35073 [self func1:5]
35074 ^~~~~~~~~~~~~~
35075 ranging from the '[' to the ']', with the caret at the start. */
35081 }
35083 /* Parse an objc-message-receiver.
35085 objc-message-receiver:
35086 expression
35087 simple-type-specifier
35089 Returns a representation of the type or expression. */
35091 static tree
35093 {
35094 tree rcv;
35096 /* An Objective-C message receiver may be either (1) a type
35097 or (2) an expression. */
35101 /* If that worked out, fine. */
35108 CP_PARSER_FLAGS_NONE);
35115 }
35117 /* Parse the arguments and selectors comprising an Objective-C message.
35119 objc-message-args:
35120 objc-selector
35121 objc-selector-args
35122 objc-selector-args , objc-comma-args
35124 objc-selector-args:
35125 objc-selector [opt] : assignment-expression
35126 objc-selector-args objc-selector [opt] : assignment-expression
35128 objc-comma-args:
35129 assignment-expression
35130 objc-comma-args , assignment-expression
35132 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
35133 selector arguments and TREE_VALUE containing a list of comma
35134 arguments. */
35136 static tree
35138 {
35144 {
35150 /* Detect if we have a unary selector. */
35159 sel_args
35164 }
35166 /* Handle non-selector arguments, if any. */
35168 {
35169 tree arg;
35174 addl_args
35179 }
35182 {
35185 }
35188 }
35190 /* Parse an Objective-C encode expression.
35192 objc-encode-expression:
35193 @encode objc-typename
35195 Returns an encoded representation of the type argument. */
35197 static cp_expr
35199 {
35200 tree type;
35205 matching_parens parens;
35212 {
35216 }
35218 /* This happens if we find @encode(T) (where T is a template
35219 typename or something dependent on a template typename) when
35220 parsing a template. In that case, we can't compile it
35221 immediately, but we rather create an AT_ENCODE_EXPR which will
35222 need to be instantiated when the template is used.
35223 */
35225 {
35229 }
35232 /* Build a location of the form:
35233 @encode(int)
35234 ^~~~~~~~~~~~
35235 with caret==start at the @ token, finishing at the close paren. */
35239 }
35241 /* Parse an Objective-C @defs expression. */
35243 static tree
35245 {
35246 tree name;
35249 matching_parens parens;
35255 }
35257 /* Parse an Objective-C protocol expression.
35259 objc-protocol-expression:
35260 @protocol ( identifier )
35262 Returns a representation of the protocol expression. */
35264 static tree
35266 {
35267 tree proto;
35271 matching_parens parens;
35276 /* Build a location of the form:
35277 @protocol(prot)
35278 ^~~~~~~~~~~~~~~
35279 with caret==start at the @ token, finishing at the close paren. */
35284 }
35286 /* Parse an Objective-C selector expression.
35288 objc-selector-expression:
35289 @selector ( objc-method-signature )
35291 objc-method-signature:
35292 objc-selector
35293 objc-selector-seq
35295 objc-selector-seq:
35296 objc-selector :
35297 objc-selector-seq objc-selector :
35299 Returns a representation of the method selector. */
35301 static tree
35303 {
35310 matching_parens parens;
35316 {
35325 {
35326 /* Detect if we have a unary selector. */
35328 {
35331 }
35332 else
35333 {
35335 }
35336 }
35341 {
35342 sel_seq
35345 sel_seq
35348 }
35349 else
35350 sel_seq
35355 }
35357 finish_selector:
35361 /* Build a location of the form:
35362 @selector(func)
35363 ^~~~~~~~~~~~~~~
35364 with caret==start at the @ token, finishing at the close paren. */
35367 /* TODO: objc_build_selector_expr doesn't always honor the location. */
35370 }
35372 /* Parse a list of identifiers.
35374 objc-identifier-list:
35375 identifier
35376 objc-identifier-list , identifier
35378 Returns a TREE_LIST of identifier nodes. */
35380 static tree
35382 {
35383 tree identifier;
35384 tree list;
35395 {
35402 identifier));
35404 }
35407 }
35409 /* Parse an Objective-C alias declaration.
35411 objc-alias-declaration:
35412 @compatibility_alias identifier identifier ;
35414 This function registers the alias mapping with the Objective-C front end.
35415 It returns nothing. */
35417 static void
35419 {
35427 }
35429 /* Parse an Objective-C class forward-declaration.
35431 objc-class-declaration:
35432 @class objc-identifier-list ;
35434 The function registers the forward declarations with the Objective-C
35435 front end. It returns nothing. */
35437 static void
35439 {
35442 {
35443 tree id;
35453 else
35455 }
35457 }
35459 /* Parse a list of Objective-C protocol references.
35461 objc-protocol-refs-opt:
35462 objc-protocol-refs [opt]
35464 objc-protocol-refs:
35465 < objc-identifier-list >
35467 Returns a TREE_LIST of identifiers, if any. */
35469 static tree
35471 {
35475 {
35479 }
35482 }
35484 /* Parse a Objective-C visibility specification. */
35486 static void
35488 {
35492 {
35507 }
35509 /* Eat '@private'/'@protected'/'@public'. */
35511 }
35513 /* Parse an Objective-C method type. Return 'true' if it is a class
35514 (+) method, and 'false' if it is an instance (-) method. */
35518 {
35521 else
35523 }
35525 /* Parse an Objective-C protocol qualifier. */
35527 static tree
35529 {
35542 {
35547 }
35550 }
35552 /* Parse an Objective-C typename. */
35554 static tree
35556 {
35560 {
35563 matching_parens parens;
35567 /* An ObjC type name may consist of just protocol qualifiers, in which
35568 case the type shall default to 'id'. */
35570 {
35573 /* If the type could not be parsed, an error has already
35574 been produced. For error recovery, behave as if it had
35575 not been specified, which will use the default type
35576 'id'. */
35578 {
35580 /* We need to skip to the closing parenthesis as
35581 cp_parser_type_id() does not seem to do it for
35582 us. */
35587 }
35588 }
35592 }
35595 }
35597 /* Check to see if TYPE refers to an Objective-C selector name. */
35599 static bool
35601 {
35607 }
35609 /* Parse an Objective-C selector. */
35611 static tree
35613 {
35617 {
35620 }
35622 /* C++ operator names are allowed to appear in ObjC selectors. */
35624 {
35637 }
35638 }
35640 /* Parse an Objective-C params list. */
35642 static tree
35644 {
35650 {
35660 /* Detect if we have a unary selector. */
35663 {
35666 }
35670 {
35671 /* Something went quite wrong. There should be a colon
35672 here, but there is not. Stop parsing parameters. */
35674 }
35676 /* New ObjC allows attributes on parameters too. */
35681 params
35684 type_name,
35685 identifier,
35686 parm_attr));
35689 }
35692 {
35695 }
35697 /* We allow tail attributes for the method. */
35699 {
35707 }
35710 {
35713 }
35715 }
35717 /* Parse the non-keyword Objective-C params. */
35719 static tree
35722 {
35728 {
35730 tree parm;
35736 {
35741 }
35743 /* TODO: parse attributes for tail parameters. */
35753 }
35755 /* We allow tail attributes for the method. */
35757 {
35759 {
35764 }
35765 else
35766 /* We have an error, but parse the attributes, so that we can
35767 carry on. */
35773 }
35776 }
35778 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
35780 static void
35782 {
35785 /* If the next token is `extern' and the following token is a string
35786 literal, then we have a linkage specification. */
35788 && cp_parser_is_pure_string_literal
35791 /* Handle #pragma, if any. */
35794 /* Allow stray semicolons. */
35797 /* Mark methods as optional or required, when building protocols. */
35799 {
35802 }
35804 {
35807 }
35810 /* Other stray characters must generate errors. */
35812 {
35816 }
35817 /* Finally, try to parse a block-declaration, or a function-definition. */
35818 else
35820 }
35822 /* Parse a method signature. */
35824 static tree
35826 {
35842 }
35844 static bool
35846 {
35847 tree tattr;
35852 /* If the attributes are followed by a method introducer, this is not allowed.
35853 Dump the attributes and flag the situation. */
35858 /* Otherwise, the attributes introduce some interstitial code, possibly so
35859 rewind to allow that check. */
35862 }
35864 /* Parse an Objective-C method prototype list. */
35866 static void
35868 {
35872 {
35874 {
35879 else
35883 {
35887 }
35890 }
35896 OPT_Wattributes,
35898 else
35899 /* Allow for interspersed non-ObjC++ code. */
35903 }
35907 else
35911 }
35913 /* Parse an Objective-C method definition list. */
35915 static void
35917 {
35919 {
35923 {
35926 }
35928 {
35931 }
35933 {
35937 tree attribute;
35941 else
35942 {
35946 /* For historical reasons, we accept an optional semicolon. */
35952 tree meth
35956 }
35957 }
35958 /* The following case will be removed once @synthesize is
35959 completely implemented. */
35970 else
35971 /* Allow for interspersed non-ObjC++ code. */
35973 }
35976 }
35978 /* Parse Objective-C ivars. */
35980 static void
35982 {
35993 {
35994 cp_decl_specifier_seq declspecs;
35996 tree prefix_attributes;
36004 CP_PARSER_FLAGS_OPTIONAL,
36008 /* auto, register, static, extern, mutable. */
36010 {
36013 }
36015 /* thread_local. */
36017 {
36020 }
36022 /* typedef. */
36024 {
36027 }
36032 /* Keep going until we hit the `;' at the end of the
36033 declaration. */
36035 {
36040 /* Check for a (possibly unnamed) bitfield declaration. */
36048 {
36049 /* Get the name of the bitfield. */
36054 eat_colon:
36056 /* Get the width of the bitfield. */
36057 width
36059 }
36060 else
36061 {
36062 /* Parse the declarator. */
36063 declarator
36065 CP_PARSER_FLAGS_NONE,
36071 }
36073 /* Look for attributes that apply to the ivar. */
36075 /* Remember which attributes are prefix attributes and
36076 which are not. */
36078 /* Combine the attributes. */
36082 /* Create the bitfield declaration. */
36085 else
36090 /* Add the instance variable. */
36094 /* Reset PREFIX_ATTRIBUTES. */
36096 {
36101 }
36106 {
36109 }
36111 }
36115 }
36120 /* Do not consume the RID_AT_END, so it will be read again as terminating
36121 the @interface of @implementation. */
36125 /* For historical reasons, we accept an optional semicolon. */
36128 }
36130 /* Parse an Objective-C protocol declaration. */
36132 static void
36134 {
36140 {
36145 }
36147 /* See if we have a forward declaration or a definition. */
36150 /* Try a forward declaration first. */
36152 {
36154 {
36155 tree id;
36165 else
36167 }
36169 }
36171 /* Ok, we got a full-fledged definition (or at least should). */
36172 else
36173 {
36178 }
36179 }
36181 /* Parse an Objective-C superclass or category. */
36183 static void
36188 {
36194 {
36197 }
36199 {
36200 matching_parens parens;
36203 /* If there is no category name, and this is an @interface, we
36204 have a class extension. */
36206 {
36209 }
36210 else
36214 }
36215 }
36217 /* Parse an Objective-C class interface. */
36219 static void
36221 {
36229 {
36230 /* It's hard to recover because even if valid @interface stuff
36231 is to follow, we can't compile it (or validate it) if we
36232 don't even know which class it refers to. Let's assume this
36233 was a stray '@interface' token in the stream and skip it.
36234 */
36236 }
36241 /* We have either a class or a category on our hands. */
36244 else
36245 {
36247 /* Handle instance variable declarations, if any. */
36250 }
36253 }
36255 /* Parse an Objective-C class implementation. */
36257 static void
36259 {
36266 {
36267 /* It's hard to recover because even if valid @implementation
36268 stuff is to follow, we can't compile it (or validate it) if
36269 we don't even know which class it refers to. Let's assume
36270 this was a stray '@implementation' token in the stream and
36271 skip it.
36272 */
36274 }
36278 /* We have either a class or a category on our hands. */
36281 else
36282 {
36284 /* Handle instance variable declarations, if any. */
36287 }
36290 }
36292 /* Consume the @end token and finish off the implementation. */
36294 static void
36296 {
36299 }
36301 /* Parse an Objective-C declaration. */
36303 static void
36305 {
36306 /* Try to figure out what kind of declaration is present. */
36311 {
36327 }
36330 {
36353 }
36354 }
36356 /* Parse an Objective-C try-catch-finally statement.
36358 objc-try-catch-finally-stmt:
36359 @try compound-statement objc-catch-clause-seq [opt]
36360 objc-finally-clause [opt]
36362 objc-catch-clause-seq:
36363 objc-catch-clause objc-catch-clause-seq [opt]
36365 objc-catch-clause:
36366 @catch ( objc-exception-declaration ) compound-statement
36368 objc-finally-clause:
36369 @finally compound-statement
36371 objc-exception-declaration:
36372 parameter-declaration
36373 '...'
36375 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
36377 Returns NULL_TREE.
36379 PS: This function is identical to c_parser_objc_try_catch_finally_statement
36380 for C. Keep them in sync. */
36382 static tree
36384 {
36385 location_t location;
36386 tree stmt;
36391 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
36392 node, lest it get absorbed into the surrounding block. */
36398 {
36402 matching_parens parens;
36408 {
36409 /* We have "@catch (...)" (where the '...' are literally
36410 what is in the code). Skip the '...'.
36411 parameter_declaration is set to NULL_TREE, and
36412 objc_being_catch_clauses() knows that that means
36413 '...'. */
36416 }
36417 else
36418 {
36419 /* We have "@catch (NSException *exception)" or something
36420 like that. Parse the parameter declaration. */
36425 else
36430 }
36433 else
36434 {
36435 /* If there was no open parenthesis, we are recovering from
36436 an error, and we are trying to figure out what mistake
36437 the user has made. */
36439 /* If there is an immediate closing parenthesis, the user
36440 probably forgot the opening one (ie, they typed "@catch
36441 NSException *e)". Parse the closing parenthesis and keep
36442 going. */
36446 /* If these is no immediate closing parenthesis, the user
36447 probably doesn't know that parenthesis are required at
36448 all (ie, they typed "@catch NSException *e"). So, just
36449 forget about the closing parenthesis and keep going. */
36450 }
36454 }
36456 {
36459 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
36460 node, lest it get absorbed into the surrounding block. */
36464 }
36467 }
36469 /* Parse an Objective-C synchronized statement.
36471 objc-synchronized-stmt:
36472 @synchronized ( expression ) compound-statement
36474 Returns NULL_TREE. */
36476 static tree
36478 {
36479 location_t location;
36486 matching_parens parens;
36491 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
36492 node, lest it get absorbed into the surrounding block. */
36497 }
36499 /* Parse an Objective-C throw statement.
36501 objc-throw-stmt:
36502 @throw assignment-expression [opt] ;
36504 Returns a constructed '@throw' statement. */
36506 static tree
36508 {
36520 }
36522 /* Parse an Objective-C statement. */
36524 static tree
36526 {
36527 /* Try to figure out what kind of declaration is present. */
36531 {
36542 }
36545 }
36547 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
36548 look ahead to see if an objc keyword follows the attributes. This
36549 is to detect the use of prefix attributes on ObjC @interface and
36550 @protocol. */
36552 static bool
36554 {
36559 {
36563 else
36566 }
36569 }
36571 /* This routine is a minimal replacement for
36572 c_parser_struct_declaration () used when parsing the list of
36573 types/names or ObjC++ properties. For example, when parsing the
36574 code
36576 @property (readonly) int a, b, c;
36578 this function is responsible for parsing "int a, int b, int c" and
36579 returning the declarations as CHAIN of DECLs.
36581 TODO: Share this code with cp_parser_objc_class_ivars. It's very
36582 similar parsing. */
36583 static tree
36585 {
36587 cp_decl_specifier_seq declspecs;
36589 tree prefix_attributes;
36592 CP_PARSER_FLAGS_NONE,
36599 /* auto, register, static, extern, mutable. */
36601 {
36604 }
36606 /* thread_local. */
36608 {
36611 }
36613 /* typedef. */
36615 {
36618 }
36623 /* Keep going until we hit the `;' at the end of the declaration. */
36625 {
36630 /* Parse the declarator. */
36632 CP_PARSER_FLAGS_NONE,
36635 /* Look for attributes that apply to the ivar. */
36637 /* Remember which attributes are prefix attributes and
36638 which are not. */
36640 /* Combine the attributes. */
36650 /* Reset PREFIX_ATTRIBUTES. */
36652 {
36657 }
36664 {
36667 }
36668 else
36670 }
36672 }
36674 /* Parse an Objective-C @property declaration. The syntax is:
36676 objc-property-declaration:
36677 '@property' objc-property-attributes[opt] struct-declaration ;
36679 objc-property-attributes:
36680 '(' objc-property-attribute-list ')'
36682 objc-property-attribute-list:
36683 objc-property-attribute
36684 objc-property-attribute-list, objc-property-attribute
36686 objc-property-attribute
36687 'getter' = identifier
36688 'setter' = identifier
36689 'readonly'
36690 'readwrite'
36691 'assign'
36692 'retain'
36693 'copy'
36694 'nonatomic'
36696 For example:
36697 @property NSString *name;
36698 @property (readonly) id object;
36699 @property (retain, nonatomic, getter=getTheName) id name;
36700 @property int a, b, c;
36702 PS: This function is identical to
36703 c_parser_objc_at_property_declaration for C. Keep them in sync. */
36704 static void
36706 {
36707 /* Parse the optional attribute list.
36709 A list of parsed, but not verified, attributes. */
36715 /* Parse the optional attribute list... */
36717 {
36718 /* Eat the '('. */
36719 matching_parens parens;
36724 /* Allow empty @property attribute lists, but with a warning. */
36726 location_t attr_comb;
36728 {
36732 }
36733 else
36735 {
36742 {
36749 }
36760 /* Account for accepting the 'class' keyword in this context. */
36762 else
36766 enum objc_property_attribute_kind prop_kind
36768 property_attribute_info *prop
36772 tree meth_name;
36774 {
36779 attr_name);
36780 else
36788 {
36791 attr_name);
36794 }
36802 {
36805 attr_name);
36808 }
36810 /* Get the end of the method name, and consume the name. */
36813 /* Because method names may contain C++ keywords, we have a
36814 routine to fetch them (this also consumes the token). */
36818 {
36820 {
36822 attr_end);
36826 }
36827 else
36828 {
36832 }
36834 attr_end);
36835 }
36836 else
36838 attr_end);
36840 /* Updated location including all that was successfully
36841 parsed. */
36844 }
36846 /* If we see a comma here, then keep going - even if we already
36847 saw a syntax error. For simple mistakes e.g. (asign, getter=x)
36848 this makes a more useful output and avoid spurious warnings
36849 about missing attributes that are, in fact, specified after the
36850 one with the syntax error. */
36853 else
36855 }
36861 }
36863 /* 'properties' is the list of properties that we read. Usually a
36864 single one, but maybe more (eg, in "@property int a, b, c;" there
36865 are three).
36866 TODO: Update this parsing so that it accepts (erroneous) bitfields so
36867 that we can issue a meaningful and consistent (between C/C++) error
36868 message from objc_add_property_declaration (). */
36875 else
36876 {
36877 /* Comma-separated properties are chained together in reverse order;
36878 add them one by one. */
36882 prop_attr_list);
36883 }
36886 }
36888 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
36890 objc-synthesize-declaration:
36891 @synthesize objc-synthesize-identifier-list ;
36893 objc-synthesize-identifier-list:
36894 objc-synthesize-identifier
36895 objc-synthesize-identifier-list, objc-synthesize-identifier
36897 objc-synthesize-identifier
36898 identifier
36899 identifier = identifier
36901 For example:
36902 @synthesize MyProperty;
36903 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
36905 PS: This function is identical to c_parser_objc_at_synthesize_declaration
36906 for C. Keep them in sync.
36907 */
36908 static void
36910 {
36912 location_t loc;
36917 {
36921 {
36924 }
36926 {
36930 {
36933 }
36934 }
36935 else
36940 else
36942 }
36945 }
36947 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
36949 objc-dynamic-declaration:
36950 @dynamic identifier-list ;
36952 For example:
36953 @dynamic MyProperty;
36954 @dynamic MyProperty, AnotherProperty;
36956 PS: This function is identical to c_parser_objc_at_dynamic_declaration
36957 for C. Keep them in sync.
36958 */
36959 static void
36961 {
36963 location_t loc;
36968 {
36969 tree property;
36972 {
36975 }
36979 else
36981 }
36984 }
36986 \f
36987 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 / 4.5 / 5.0 parsing routines. */
36989 /* Returns name of the next clause.
36990 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
36991 the token is not consumed. Otherwise appropriate pragma_omp_clause is
36992 returned and the token is consumed. */
36994 static pragma_omp_clause
36996 {
37012 {
37017 {
37236 }
37237 }
37243 }
37245 /* Validate that a clause of the given type does not already exist. */
37247 static void
37250 {
37253 }
37255 /* OpenMP 2.5:
37256 variable-list:
37257 identifier
37258 variable-list , identifier
37260 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
37261 colon). An opening parenthesis will have been consumed by the caller.
37263 If KIND is nonzero, create the appropriate node and install the decl
37264 in OMP_CLAUSE_DECL and add the node to the head of the list.
37266 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
37267 return the list created.
37269 COLON can be NULL if only closing parenthesis should end the list,
37270 or pointer to bool which will receive false if the list is terminated
37271 by closing parenthesis or true if the list is terminated by colon.
37273 The optional ALLOW_DEREF argument is true if list items can use the deref
37274 (->) operator. */
37276 struct omp_dim
37277 {
37279 location_t loc;
37283 };
37285 static tree
37289 {
37295 {
37298 }
37300 {
37308 {
37314 }
37318 {
37319 cp_id_kind idk;
37322 }
37327 CPP_CLOSE_PAREN)))
37328 {
37331 }
37332 else
37333 {
37340 {
37345 }
37349 else
37352 {
37358 }
37359 }
37363 ;
37365 {
37367 {
37369 /* The OpenACC cache directive explicitly only allows "array
37370 elements or subarrays". */
37372 {
37376 }
37377 /* FALLTHROUGH. */
37381 start_component_ref:
37383 || (allow_deref
37385 {
37386 cpp_ttype ttype
37389 location_t loc
37394 decl = (cp_parser_postfix_dot_deref_expression
37397 }
37398 /* FALLTHROUGH. */
37408 {
37416 {
37419 /* Later handling is not prepared to see through these. */
37421 }
37423 parser->colon_corrects_to_scope_p
37426 {
37429 }
37430 else
37431 {
37432 /* Look for `:'. */
37434 {
37439 }
37442 else
37445 CPP_CLOSE_SQUARE))
37446 {
37448 /* Later handling is not prepared to see through these. */
37450 }
37451 }
37452 /* Look for the closing `]'. */
37454 RT_CLOSE_SQUARE))
37455 {
37460 }
37463 }
37468 && !array_section_p
37470 || (allow_deref
37472 CPP_DEREF))))
37473 {
37475 {
37479 }
37481 }
37482 else
37489 }
37492 {
37496 {
37497 depend_lvalue:
37501 }
37502 else
37504 }
37510 }
37511 else
37514 get_comma:
37518 }
37524 {
37528 }
37531 {
37534 /* Try to resync to an unnested comma. Copied from
37535 cp_parser_parenthesized_expression_list. */
37536 skip_comma:
37545 }
37548 }
37550 /* Similarly, but expect leading and trailing parenthesis. This is a very
37551 common case for omp clauses. */
37553 static tree
37556 {
37559 allow_deref);
37561 }
37563 /* OpenACC 2.0:
37564 copy ( variable-list )
37565 copyin ( variable-list )
37566 copyout ( variable-list )
37567 create ( variable-list )
37568 delete ( variable-list )
37569 present ( variable-list )
37571 OpenACC 2.6:
37572 no_create ( variable-list )
37573 attach ( variable-list )
37574 detach ( variable-list ) */
37576 static tree
37578 tree list)
37579 {
37582 {
37624 }
37632 }
37634 /* OpenACC 2.0:
37635 deviceptr ( variable-list ) */
37637 static tree
37639 {
37643 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
37644 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
37645 variable-list must only allow for pointer variables. */
37648 {
37655 }
37658 }
37660 /* OpenACC 2.5:
37661 auto
37662 finalize
37663 independent
37664 nohost
37665 seq */
37667 static tree
37669 tree list)
37670 {
37677 }
37679 /* OpenACC:
37680 num_gangs ( expression )
37681 num_workers ( expression )
37682 vector_length ( expression ) */
37684 static tree
37687 {
37690 matching_parens parens;
37698 {
37703 }
37711 }
37713 /* OpenACC:
37715 gang [( gang-arg-list )]
37716 worker [( [num:] int-expr )]
37717 vector [( [length:] int-expr )]
37719 where gang-arg is one of:
37721 [num:] int-expr
37722 static: size-expr
37724 and size-expr may be:
37726 *
37727 int-expr
37728 */
37730 static tree
37732 omp_clause_code kind,
37734 {
37743 {
37744 matching_parens parens;
37747 do
37748 {
37752 /* Gang static argument. */
37755 {
37763 {
37766 }
37768 /* Check for the '*' argument. */
37772 CPP_CLOSE_PAREN)))
37773 {
37778 {
37781 }
37783 }
37784 }
37785 /* Worker num: argument and vector length: arguments. */
37789 {
37792 }
37794 /* Now collect the actual argument. */
37796 {
37799 }
37811 {
37814 }
37816 }
37821 }
37835 cleanup_error:
37838 }
37840 /* OpenACC 2.0:
37841 tile ( size-expr-list ) */
37843 static tree
37845 {
37849 /* Collapse and tile are mutually exclusive. (The spec doesn't say
37850 so, but the spec authors never considered such a case and have
37851 differing opinions on what it might mean, including 'not
37852 allowed'.) */
37855 clause_loc);
37860 do
37861 {
37868 {
37871 }
37872 else
37876 }
37879 /* Consume the trailing ')'. */
37887 }
37889 /* OpenACC 2.0
37890 Parse wait clause or directive parameters. */
37892 static tree
37894 {
37904 {
37906 {
37909 }
37911 }
37918 {
37922 {
37925 else
37926 {
37933 }
37934 }
37935 }
37938 }
37940 /* OpenACC:
37941 wait [( int-expr-list )] */
37943 static tree
37945 {
37950 else
37951 {
37957 }
37960 }
37962 /* OpenMP 3.0:
37963 collapse ( constant-expression ) */
37965 static tree
37967 {
37969 location_t loc;
37970 HOST_WIDE_INT n;
37973 matching_parens parens;
37991 {
37994 }
38003 }
38005 /* OpenMP 2.5:
38006 default ( none | shared )
38008 OpenMP 5.1:
38009 default ( private | firstprivate )
38011 OpenACC:
38012 default ( none | present ) */
38014 static tree
38017 {
38019 tree c;
38021 matching_parens parens;
38025 {
38028 }
38030 {
38035 {
38062 }
38065 }
38066 else
38067 {
38068 invalid_kind:
38071 else
38074 }
38091 }
38093 /* OpenMP 3.1:
38094 final ( expression ) */
38096 static tree
38098 {
38101 matching_parens parens;
38120 }
38122 /* OpenMP 2.5:
38123 if ( expression )
38125 OpenMP 4.5:
38126 if ( directive-name-modifier : expression )
38128 directive-name-modifier:
38129 parallel | task | taskloop | target data | target | target update
38130 | target enter data | target exit data
38132 OpenMP 5.0:
38133 directive-name-modifier:
38134 ... | simd | cancel */
38136 static tree
38139 {
38143 matching_parens parens;
38148 {
38164 {
38167 {
38180 else
38181 {
38182 location_t loc
38187 }
38190 {
38192 {
38197 }
38199 {
38200 location_t loc
38204 }
38205 }
38206 }
38207 }
38209 {
38211 {
38214 }
38215 else
38216 {
38218 {
38219 location_t loc
38222 }
38224 }
38225 }
38226 }
38238 {
38241 {
38244 {
38256 }
38258 p);
38260 }
38262 {
38265 else
38268 }
38271 {
38275 }
38276 }
38284 }
38286 /* OpenMP 3.1:
38287 mergeable */
38289 static tree
38292 {
38293 tree c;
38296 location);
38301 }
38303 /* OpenMP 2.5:
38304 nowait */
38306 static tree
38309 {
38310 tree c;
38317 }
38319 /* OpenMP 2.5:
38320 num_threads ( expression ) */
38322 static tree
38324 location_t location)
38325 {
38328 matching_parens parens;
38348 }
38350 /* OpenMP 4.5:
38351 num_tasks ( expression )
38353 OpenMP 5.1:
38354 num_tasks ( strict : expression ) */
38356 static tree
38358 location_t location)
38359 {
38362 matching_parens parens;
38369 {
38372 {
38376 }
38377 }
38396 }
38398 /* OpenMP 4.5:
38399 grainsize ( expression )
38401 OpenMP 5.1:
38402 grainsize ( strict : expression ) */
38404 static tree
38406 location_t location)
38407 {
38410 matching_parens parens;
38417 {
38420 {
38424 }
38425 }
38444 }
38446 /* OpenMP 4.5:
38447 priority ( expression ) */
38449 static tree
38451 location_t location)
38452 {
38455 matching_parens parens;
38475 }
38477 /* OpenMP 4.5:
38478 hint ( expression ) */
38480 static tree
38482 {
38485 matching_parens parens;
38492 {
38500 }
38513 }
38515 /* OpenMP 5.1:
38516 filter ( integer-expression ) */
38518 static tree
38520 {
38523 matching_parens parens;
38541 }
38543 /* OpenMP 4.5:
38544 defaultmap ( tofrom : scalar )
38546 OpenMP 5.0:
38547 defaultmap ( implicit-behavior [ : variable-category ] ) */
38549 static tree
38551 location_t location)
38552 {
38556 enum omp_clause_defaultmap_kind category
38559 matching_parens parens;
38566 {
38567 invalid_behavior:
38569 "%<tofrom%>, %<firstprivate%>, %<none%> "
38572 }
38573 else
38574 {
38577 }
38580 {
38584 else
38591 else
38600 else
38607 else
38616 else
38622 }
38626 {
38631 {
38632 invalid_category:
38636 }
38641 {
38645 else
38652 else
38659 else
38665 }
38668 }
38678 {
38685 {
38700 }
38703 p);
38704 else
38708 }
38715 out_err:
38720 }
38722 /* OpenMP 5.0:
38723 order ( concurrent )
38725 OpenMP 5.1:
38726 order ( order-modifier : concurrent )
38728 order-modifier:
38729 reproducible
38730 unconstrained */
38732 static tree
38734 {
38740 matching_parens parens;
38746 {
38753 else
38754 {
38758 }
38761 }
38763 {
38766 }
38767 else
38768 {
38771 }
38773 {
38776 }
38788 out_err:
38793 }
38795 /* OpenMP 5.0:
38796 bind ( teams | parallel | thread ) */
38798 static tree
38800 location_t location)
38801 {
38802 tree c;
38806 matching_parens parens;
38811 {
38812 invalid:
38816 }
38817 else
38818 {
38821 }
38832 /* check_no_duplicate_clause (list, OMP_CLAUSE_BIND, "bind", location); */
38838 out_err:
38843 }
38845 /* OpenMP 2.5:
38846 ordered
38848 OpenMP 4.5:
38849 ordered ( constant-expression ) */
38851 static tree
38854 {
38856 HOST_WIDE_INT n;
38862 {
38863 matching_parens parens;
38880 {
38882 "ordered argument needs positive constant integer "
38885 }
38886 }
38892 }
38894 /* OpenMP 2.5:
38895 reduction ( reduction-operator : variable-list )
38897 reduction-operator:
38898 One of: + * - & ^ | && ||
38900 OpenMP 3.1:
38902 reduction-operator:
38903 One of: + * - & ^ | && || min max
38905 OpenMP 4.0:
38907 reduction-operator:
38908 One of: + * - & ^ | && ||
38909 id-expression
38911 OpenMP 5.0:
38912 reduction ( reduction-modifier, reduction-operator : variable-list )
38913 in_reduction ( reduction-operator : variable-list )
38914 task_reduction ( reduction-operator : variable-list ) */
38916 static tree
38919 {
38929 {
38932 {
38935 }
38938 {
38946 {
38949 }
38950 }
38951 }
38954 {
38964 }
38968 else
38969 {
38980 {
39010 }
39011 else
39012 {
39014 resync_fail:
39019 }
39020 }
39026 NULL);
39028 {
39035 }
39038 }
39040 /* OpenMP 2.5:
39041 schedule ( schedule-kind )
39042 schedule ( schedule-kind , expression )
39044 schedule-kind:
39045 static | dynamic | guided | runtime | auto
39047 OpenMP 4.5:
39048 schedule ( schedule-modifier : schedule-kind )
39049 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
39051 schedule-modifier:
39052 simd
39053 monotonic
39054 nonmonotonic */
39056 static tree
39058 {
39062 matching_parens parens;
39070 {
39079 else
39085 {
39088 }
39089 else
39090 {
39093 }
39094 }
39099 {
39104 {
39125 }
39126 }
39131 else
39137 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
39139 {
39143 }
39146 {
39161 else
39166 }
39178 invalid_kind:
39180 resync_fail:
39185 }
39187 /* OpenMP 3.0:
39188 untied */
39190 static tree
39193 {
39194 tree c;
39201 }
39203 /* OpenMP 4.0:
39204 inbranch
39205 notinbranch */
39207 static tree
39210 {
39215 }
39217 /* OpenMP 4.0:
39218 parallel
39219 for
39220 sections
39221 taskgroup */
39223 static tree
39227 {
39231 }
39233 /* OpenMP 4.5:
39234 nogroup */
39236 static tree
39239 {
39244 }
39246 /* OpenMP 4.5:
39247 simd
39248 threads */
39250 static tree
39254 {
39259 }
39261 /* OpenMP 4.0:
39262 num_teams ( expression )
39264 OpenMP 5.1:
39265 num_teams ( expression : expression ) */
39267 static tree
39269 location_t location)
39270 {
39273 matching_parens parens;
39284 {
39288 }
39305 }
39307 /* OpenMP 4.0:
39308 thread_limit ( expression ) */
39310 static tree
39312 location_t location)
39313 {
39316 matching_parens parens;
39336 }
39338 /* OpenMP 4.0:
39339 aligned ( variable-list )
39340 aligned ( variable-list : constant-expression ) */
39342 static tree
39344 {
39348 matching_parens parens;
39356 {
39366 }
39372 }
39374 /* OpenMP 5.0:
39375 allocate ( variable-list )
39376 allocate ( expression : variable-list )
39378 OpenMP 5.1:
39379 allocate ( allocator-modifier : variable-list )
39380 allocate ( allocator-modifier , allocator-modifier : variable-list )
39382 allocator-modifier:
39383 allocator ( expression )
39384 align ( expression ) */
39386 static tree
39388 {
39392 matching_parens parens;
39402 {
39408 matching_parens parens2;
39412 {
39416 }
39417 else
39418 {
39422 }
39426 {
39429 }
39433 }
39434 else
39437 {
39443 }
39446 {
39453 }
39454 else
39455 {
39459 }
39466 {
39469 }
39472 }
39474 /* OpenMP 2.5:
39475 lastprivate ( variable-list )
39477 OpenMP 5.0:
39478 lastprivate ( [ lastprivate-modifier : ] variable-list ) */
39480 static tree
39482 {
39490 {
39495 {
39499 }
39500 }
39509 }
39511 /* OpenMP 4.0:
39512 linear ( variable-list )
39513 linear ( variable-list : expression )
39515 OpenMP 4.5:
39516 linear ( modifier ( variable-list ) )
39517 linear ( modifier ( variable-list ) : expression )
39519 modifier:
39520 val
39521 ref
39522 uval
39524 OpenMP 5.2:
39525 linear ( variable-list : modifiers-list )
39527 modifiers:
39528 val
39529 ref
39530 uval
39531 step ( expression ) */
39533 static tree
39536 {
39542 matching_parens parens;
39547 {
39558 {
39561 }
39562 else
39564 }
39569 else
39570 {
39579 }
39582 {
39586 {
39596 {
39600 }
39604 CPP_CLOSE_PAREN)))
39606 }
39610 {
39612 {
39623 {
39629 }
39631 {
39632 location_t step_loc
39635 matching_parens parens2;
39637 {
39643 CPP_CLOSE_PAREN))
39644 {
39645 cp_token *token
39653 tok_loc);
39655 {
39658 }
39661 }
39667 }
39668 else
39670 }
39671 else
39674 {
39677 }
39679 }
39682 }
39686 {
39697 {
39700 }
39703 }
39714 }
39717 {
39721 }
39724 }
39726 /* OpenMP 4.0:
39727 safelen ( constant-expression ) */
39729 static tree
39731 location_t location)
39732 {
39735 matching_parens parens;
39754 }
39756 /* OpenMP 4.0:
39757 simdlen ( constant-expression ) */
39759 static tree
39761 location_t location)
39762 {
39765 matching_parens parens;
39784 }
39786 /* OpenMP 4.5:
39787 vec:
39788 identifier [+/- integer]
39789 vec , identifier [+/- integer]
39790 */
39792 static tree
39795 {
39799 {
39802 }
39805 {
39811 {
39814 {
39822 }
39823 }
39824 }
39827 {
39834 else
39835 {
39836 t = cp_parser_lookup_name_simple
39841 id_loc);
39842 }
39848 {
39851 }
39855 {
39858 }
39862 {
39865 }
39868 add_to_vector:
39870 {
39874 }
39881 }
39884 {
39891 }
39893 }
39895 /* OpenMP 5.0:
39896 detach ( event-handle ) */
39898 static tree
39900 {
39901 matching_parens parens;
39917 else
39918 {
39921 else
39926 }
39939 }
39941 /* OpenMP 5.0:
39942 iterators ( iterators-definition )
39944 iterators-definition:
39945 iterator-specifier
39946 iterator-specifier , iterators-definition
39948 iterator-specifier:
39949 identifier = range-specification
39950 iterator-type identifier = range-specification
39952 range-specification:
39953 begin : end
39954 begin : end : step */
39956 static tree
39958 {
39962 matching_parens parens;
39966 bool saved_colon_corrects_to_scope_p
39968 bool saved_colon_doesnt_start_class_def_p
39971 do
39972 {
39973 tree iter_type;
39977 else
39978 {
39981 parser->type_definition_forbidden_message
39987 }
39991 {
39994 }
40014 {
40017 }
40032 {
40035 }
40037 }
40041 parser->colon_doesnt_start_class_def_p
40051 }
40053 /* OpenMP 5.0:
40054 affinity ( [aff-modifier :] variable-list )
40055 aff-modifier:
40056 iterator ( iterators-definition ) */
40058 static tree
40060 {
40063 matching_parens parens;
40068 {
40073 CPP_OPEN_PAREN)));
40075 {
40078 }
40080 {
40084 {
40092 }
40093 }
40094 }
40098 {
40101 {
40106 }
40107 }
40109 }
40111 /* OpenMP 4.0:
40112 depend ( depend-kind : variable-list )
40114 depend-kind:
40115 in | out | inout
40117 OpenMP 4.5:
40118 depend ( source )
40120 depend ( sink : vec )
40122 OpenMP 5.0:
40123 depend ( depend-modifier , depend-kind: variable-list )
40125 depend-kind:
40126 in | out | inout | mutexinoutset | depobj
40128 depend-modifier:
40129 iterator ( iterators-definition ) */
40131 static tree
40133 {
40138 matching_parens parens;
40142 do
40143 {
40151 {
40156 }
40173 else
40176 }
40184 {
40189 }
40192 {
40203 }
40209 {
40215 }
40216 else
40217 {
40222 {
40226 else
40228 }
40231 {
40236 }
40237 }
40240 invalid_kind:
40242 resync_fail:
40249 }
40251 /* OpenMP 5.2:
40252 doacross ( source : )
40253 doacross ( source : omp_cur_iteration )
40255 doacross ( sink : vec )
40256 doacross ( sink : omp_cur_iteration - logical_iteration ) */
40258 static tree
40260 {
40261 tree nlist;
40264 matching_parens parens;
40269 {
40270 invalid_kind:
40272 resync_fail:
40277 }
40286 else
40295 {
40297 {
40302 }
40307 }
40308 else
40316 }
40318 /* OpenMP 4.0:
40319 map ( map-kind : variable-list )
40320 map ( variable-list )
40322 map-kind:
40323 alloc | to | from | tofrom
40325 OpenMP 4.5:
40326 map-kind:
40327 alloc | to | from | tofrom | release | delete
40329 map ( always [,] map-kind: variable-list )
40331 OpenMP 5.0:
40332 map ( [map-type-modifier[,] ...] map-kind: variable-list )
40334 map-type-modifier:
40335 always | close */
40337 static tree
40339 {
40350 {
40352 {
40355 }
40358 pos++;
40359 pos++;
40360 }
40365 {
40368 {
40371 }
40375 {
40377 {
40384 }
40386 }
40388 {
40390 {
40397 }
40399 }
40400 else
40401 {
40403 "modifier other than %<always%> or "
40410 }
40413 }
40417 {
40431 else
40432 {
40438 }
40441 }
40444 {
40448 }
40457 }
40459 /* OpenMP 4.0:
40460 device ( expression )
40462 OpenMP 5.0:
40463 device ( [device-modifier :] integer-expression )
40465 device-modifier:
40466 ancestor | device_num */
40468 static tree
40470 location_t location)
40471 {
40475 matching_parens parens;
40481 {
40485 {
40488 /* A requires directive with the reverse_offload clause must be
40489 specified. */
40491 {
40493 "preceded by %<requires%> directive "
40497 }
40498 }
40500 ;
40501 else
40502 {
40506 }
40509 }
40528 }
40530 /* OpenMP 4.0:
40531 dist_schedule ( static )
40532 dist_schedule ( static , expression ) */
40534 static tree
40536 location_t location)
40537 {
40540 matching_parens parens;
40551 {
40562 }
40566 /* check_no_duplicate_clause (list, OMP_CLAUSE_DIST_SCHEDULE,
40567 "dist_schedule", location); */
40573 invalid_kind:
40575 resync_fail:
40580 }
40582 /* OpenMP 4.0:
40583 proc_bind ( proc-bind-kind )
40585 proc-bind-kind:
40586 primary | master | close | spread
40587 where OpenMP 5.1 added 'primary' and deprecated the alias 'master'. */
40589 static tree
40591 location_t location)
40592 {
40593 tree c;
40600 {
40612 else
40614 }
40615 else
40624 location);
40629 invalid_kind:
40631 resync_fail:
40636 }
40638 /* OpenMP 5.0:
40639 device_type ( host | nohost | any ) */
40641 static tree
40643 location_t location)
40644 {
40645 tree c;
40652 {
40662 else
40664 }
40665 else
40674 location);
40679 invalid_kind:
40681 resync_fail:
40686 }
40688 /* OpenACC:
40689 async [( int-expr )] */
40691 static tree
40693 {
40700 {
40701 matching_parens parens;
40710 }
40720 }
40722 /* Parse all OpenACC clauses. The set clauses allowed by the directive
40723 is a bitmask in MASK. Return the list of clauses found. */
40725 static tree
40729 {
40733 /* Don't create location wrapper nodes within OpenACC clauses. */
40734 auto_suppress_location_wrappers sentinel;
40737 {
40738 location_t here;
40739 pragma_omp_clause c_kind;
40740 omp_clause_code code;
40751 {
40758 clauses);
40811 clauses);
40816 clauses);
40834 clauses);
40839 clauses);
40852 clauses);
40859 clauses);
40865 clauses);
40873 clauses);
40877 clauses
40884 clauses);
40893 clauses);
40899 OMP_CLAUSE_VECTOR,
40906 clauses);
40915 OMP_CLAUSE_WORKER,
40921 }
40926 {
40927 /* Remove the invalid clause(s) from the list to avoid
40928 confusing the rest of the compiler. */
40931 }
40932 }
40934 saw_error:
40941 }
40943 /* Parse all OpenMP clauses. The set clauses allowed by the directive
40944 is a bitmask in MASK. Return the list of clauses found.
40945 FINISH_P set if finish_omp_clauses should be called.
40946 NESTED non-zero if clauses should be terminated by closing paren instead
40947 of end of pragma. If it is 2, additionally commas are required in between
40948 the clauses. */
40950 static tree
40954 {
40959 /* Don't create location wrapper nodes within OpenMP clauses. */
40960 auto_suppress_location_wrappers sentinel;
40963 {
40964 pragma_omp_clause c_kind;
40972 {
40977 "clauses in %<simd%> trait should be separated "
40979 }
40985 {
41002 clauses);
41021 clauses);
41041 clauses);
41046 clauses);
41051 clauses);
41056 clauses);
41065 clauses
41111 clauses);
41115 clauses
41127 clauses);
41131 clauses
41133 OMP_CLAUSE_TASK_REDUCTION,
41149 clauses);
41154 OMP_CLAUSE_NOTINBRANCH,
41163 {
41164 clause_not_first:
41168 }
41197 {
41199 clauses);
41203 }
41204 else
41216 clauses);
41238 {
41243 }
41304 clauses
41310 clauses
41317 clauses);
41323 }
41328 {
41329 /* Remove the invalid clause(s) from the list to avoid
41330 confusing the rest of the compiler. */
41333 }
41334 }
41335 saw_error:
41339 {
41342 else
41344 }
41346 }
41348 /* OpenMP 2.5:
41349 structured-block:
41350 statement
41352 In practice, we're also interested in adding the statement to an
41353 outer node. So it is convenient if we work around the fact that
41354 cp_parser_statement calls add_stmt. */
41356 static unsigned
41358 {
41361 /* Only move the values to IN_OMP_BLOCK if they weren't false.
41362 This preserves the "not within loop or switch" style error messages
41363 for nonsense cases like
41364 void foo() {
41365 #pragma omp single
41366 break;
41367 }
41368 */
41373 }
41375 static void
41377 {
41379 }
41381 static tree
41383 {
41392 }
41394 /* OpenMP 5.0:
41395 # pragma omp allocate (list) [allocator(allocator)] */
41397 static void
41399 {
41409 {
41410 matching_parens parens;
41418 {
41423 }
41424 }
41432 }
41434 /* OpenMP 2.5:
41435 # pragma omp atomic new-line
41436 expression-stmt
41438 expression-stmt:
41439 x binop= expr | x++ | ++x | x-- | --x
41440 binop:
41441 +, *, -, /, &, ^, |, <<, >>
41443 where x is an lvalue expression with scalar type.
41445 OpenMP 3.1:
41446 # pragma omp atomic new-line
41447 update-stmt
41449 # pragma omp atomic read new-line
41450 read-stmt
41452 # pragma omp atomic write new-line
41453 write-stmt
41455 # pragma omp atomic update new-line
41456 update-stmt
41458 # pragma omp atomic capture new-line
41459 capture-stmt
41461 # pragma omp atomic capture new-line
41462 capture-block
41464 read-stmt:
41465 v = x
41466 write-stmt:
41467 x = expr
41468 update-stmt:
41469 expression-stmt | x = x binop expr
41470 capture-stmt:
41471 v = expression-stmt
41472 capture-block:
41473 { v = x; update-stmt; } | { update-stmt; v = x; }
41475 OpenMP 4.0:
41476 update-stmt:
41477 expression-stmt | x = x binop expr | x = expr binop x
41478 capture-stmt:
41479 v = update-stmt
41480 capture-block:
41481 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
41483 OpenMP 5.1:
41484 # pragma omp atomic compare new-line
41485 conditional-update-atomic
41487 # pragma omp atomic compare capture new-line
41488 conditional-update-capture-atomic
41490 conditional-update-atomic:
41491 cond-expr-stmt | cond-update-stmt
41492 cond-expr-stmt:
41493 x = expr ordop x ? expr : x;
41494 x = x ordop expr ? expr : x;
41495 x = x == e ? d : x;
41496 cond-update-stmt:
41497 if (expr ordop x) { x = expr; }
41498 if (x ordop expr) { x = expr; }
41499 if (x == e) { x = d; }
41500 ordop:
41501 <, >
41502 conditional-update-capture-atomic:
41503 v = cond-expr-stmt
41504 { v = x; cond-expr-stmt }
41505 { cond-expr-stmt v = x; }
41506 { v = x; cond-update-stmt }
41507 { cond-update-stmt v = x; }
41508 if (x == e) { x = d; } else { v = x; }
41509 { r = x == e; if (r) { x = d; } }
41510 { r = x == e; if (r) { x = d; } else { v = x; } }
41512 where x, r and v are lvalue expressions with scalar type,
41513 expr, e and d are expressions with scalar type and e might be
41514 the same as v. */
41516 static void
41518 {
41534 {
41540 {
41545 enum omp_memory_order new_memory_order
41561 {
41565 }
41573 {
41574 matching_parens parens;
41581 {
41591 }
41594 {
41598 else
41600 }
41601 else
41611 }
41623 {
41627 }
41628 else
41629 {
41632 "%<capture%>, %<compare%>, %<weak%>, %<fail%>, "
41633 "%<seq_cst%>, %<acq_rel%>, %<release%>, "
41635 }
41637 {
41639 {
41640 /* OpenACC permits 'update capture'. */
41647 else
41649 }
41651 {
41654 else
41656 }
41658 {
41661 else
41663 }
41665 {
41668 else
41670 }
41672 {
41675 else
41677 }
41680 }
41681 }
41683 }
41689 {
41693 else
41695 }
41697 {
41701 }
41703 {
41706 }
41708 {
41711 }
41715 {
41716 omp_requires_mask
41721 {
41731 {
41741 }
41745 }
41746 }
41747 else
41749 {
41752 {
41756 }
41762 {
41766 }
41772 }
41774 memory_order
41779 {
41789 else
41794 {
41795 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
41796 opcode. */
41801 }
41805 {
41808 }
41812 else
41813 {
41821 {
41825 }
41826 }
41829 }
41831 restart:
41833 {
41836 matching_parens parens;
41840 tree cmp_expr;
41843 else
41851 {
41857 }
41859 ;
41861 {
41865 }
41868 {
41870 "expected %<==%>, %<<%> or %<>%> comparison in %<if%> "
41873 }
41884 {
41887 }
41892 else
41905 {
41907 {
41910 }
41912 {
41917 }
41918 else
41920 }
41925 {
41930 }
41931 else
41932 {
41933 bad_if:
41937 }
41940 {
41944 {
41948 }
41976 /* Signal to c_finish_omp_atomic that in
41977 if (x == e) { x = d; } else { v = x; }
41978 case the store to v should be conditional. */
41980 }
41982 {
41985 }
41991 }
41995 {
42002 /* FALLTHROUGH */
42014 /* FALLTHROUGH */
42031 /* Undo effects of boolean_increment for post {in,de}crement. */
42033 /* FALLTHRU */
42037 {
42038 /* Undo effects of boolean_increment. */
42040 {
42041 /* This is pre or post increment. */
42046 && !structured_block
42052 }
42053 }
42054 /* FALLTHRU */
42057 {
42060 }
42062 {
42097 {
42101 }
42106 {
42112 {
42117 }
42119 {
42133 {
42135 {
42140 }
42141 else
42143 }
42148 || !structured_block
42149 || v
42155 {
42157 {
42163 }
42164 }
42172 {
42176 cond_expr:
42178 bool saved_colon_corrects_to_scope_p
42182 parser->colon_corrects_to_scope_p
42187 {
42189 {
42191 {
42195 }
42197 {
42198 opcode
42202 }
42203 }
42204 else
42205 {
42208 {
42209 opcode
42214 }
42215 }
42216 }
42218 "invalid form of "
42221 }
42225 }
42230 {
42237 }
42241 }
42245 {
42248 {
42256 }
42258 {
42263 }
42307 }
42310 {
42312 "invalid form of "
42315 }
42326 {
42328 {
42330 "invalid form of "
42333 }
42335 }
42341 }
42348 }
42349 stmt_done:
42351 {
42364 }
42366 {
42370 }
42371 done:
42373 {
42376 }
42384 invalid_compare:
42386 /* FALLTHRU */
42387 saw_error:
42392 {
42396 {
42400 }
42401 }
42402 }
42405 /* OpenMP 2.5:
42406 # pragma omp barrier new-line */
42408 static void
42410 {
42413 }
42415 /* OpenMP 2.5:
42416 # pragma omp critical [(name)] new-line
42417 structured-block
42419 OpenMP 4.5:
42420 # pragma omp critical [(name) [hint(expression)]] new-line
42421 structured-block */
42423 #define OMP_CRITICAL_CLAUSE_MASK \
42424 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
42426 static tree
42428 {
42432 {
42433 matching_parens parens;
42449 }
42456 }
42458 /* OpenMP 5.0:
42459 # pragma omp depobj ( depobj ) depobj-clause new-line
42461 depobj-clause:
42462 depend (dependence-type : locator)
42463 destroy
42464 update (dependence-type)
42466 dependence-type:
42467 in
42468 out
42469 inout
42470 mutexinout */
42472 static void
42474 {
42476 matching_parens parens;
42478 {
42481 }
42496 {
42502 {
42503 /* Don't create location wrapper nodes within the depend clause. */
42504 auto_suppress_location_wrappers sentinel;
42510 }
42514 {
42515 matching_parens c_parens;
42517 {
42518 location_t c2_loc
42521 {
42536 }
42538 {
42542 }
42548 }
42549 else
42551 }
42552 }
42554 {
42557 }
42561 }
42564 /* OpenMP 2.5:
42565 # pragma omp flush flush-vars[opt] new-line
42567 flush-vars:
42568 ( variable-list )
42570 OpenMP 5.0:
42571 # pragma omp flush memory-order-clause new-line */
42573 static void
42575 {
42581 {
42592 else
42594 "expected %<seq_cst%>, %<acq_rel%>, %<release%> or "
42597 }
42599 {
42602 "%<flush%> list specified together with memory order "
42605 }
42609 }
42611 /* Helper function, to parse omp for increment expression. */
42613 static tree
42615 {
42620 {
42623 }
42626 {
42638 }
42640 /* If decl is an iterator, preserve LHS and RHS of the relational
42641 expr until finish_omp_for. */
42652 }
42654 /* Helper function, to parse omp for increment expression. */
42656 static tree
42658 {
42662 cp_id_kind idk;
42666 {
42675 }
42684 {
42689 }
42696 {
42700 }
42713 do
42714 {
42721 {
42723 {
42726 else
42729 }
42730 else
42735 }
42736 }
42740 {
42746 }
42747 else
42751 }
42753 /* Parse the initialization statement of an OpenMP for loop.
42755 Return true if the resulting construct should have an
42756 OMP_CLAUSE_PRIVATE added to it. */
42758 static tree
42766 {
42772 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
42774 init-expr:
42775 var = lb
42776 integer-type var = lb
42777 random-access-iterator-type var = lb
42778 pointer-type var = lb
42779 */
42780 cp_decl_specifier_seq type_specifiers;
42782 /* First, try to parse as an initialized declaration. See
42783 cp_parser_condition, from whence the bulk of this is copied. */
42791 {
42792 /* If parsing a type specifier seq succeeded, then this
42793 MUST be a initialized declaration. */
42798 CP_PARSER_DECLARATOR_NAMED,
42799 CP_PARSER_FLAGS_NONE,
42811 else
42812 {
42822 {
42824 CPP_OPEN_PAREN))
42827 else
42828 /* Trigger an error. */
42833 }
42837 {
42845 {
42848 auto_node);
42853 }
42856 asm_specification,
42857 LOOKUP_ONLYCONVERTING);
42860 {
42863 }
42864 else
42865 {
42868 {
42870 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
42872 {
42876 {
42880 }
42882 }
42884 {
42889 }
42890 }
42891 }
42893 }
42894 else
42895 {
42896 /* Consume '='. */
42900 non_class:
42903 else
42906 asm_specification,
42907 LOOKUP_ONLYCONVERTING);
42908 }
42912 }
42913 }
42914 else
42915 {
42916 cp_id_kind idk;
42917 /* If parsing a type specifier sequence failed, then
42918 this MUST be a simple expression. */
42924 && decl
42927 {
42938 {
42943 }
42948 }
42950 && decl
42953 {
42954 tree rhs;
42963 tf_warning_or_error));
42966 }
42967 else
42968 {
42973 {
42977 }
42978 }
42979 }
42981 }
42983 /* Helper for cp_parser_omp_for_loop, handle one range-for loop. */
42985 void
42989 {
42994 {
42998 /* do_auto_deduction doesn't mess with template init-lists. */
43000 {
43005 {
43010 {
43014 }
43015 }
43017 }
43024 }
43029 /* If an error happened previously do nothing or else a lot of
43030 unhelpful errors would be issued. */
43032 else
43033 {
43034 tree range_temp;
43038 /* Can't bind a reference to an array of runtime bound. */
43040 else
43041 {
43047 LOOKUP_ONLYCONVERTING);
43050 }
43053 }
43064 LOOKUP_ONLYCONVERTING);
43066 /* The new for initialization statement. */
43074 else
43075 {
43078 }
43081 LOOKUP_ONLYCONVERTING);
43083 /* The new for condition. */
43086 else
43092 /* The new increment expression. */
43095 else
43098 tf_warning_or_error);
43103 {
43106 }
43111 {
43116 {
43121 }
43122 }
43126 {
43130 {
43134 {
43138 }
43139 }
43140 }
43147 {
43150 }
43152 }
43154 /* Helper for cp_parser_omp_for_loop, finalize part of range for
43155 inside of the collapsed body. */
43157 void
43159 {
43167 {
43171 }
43173 /* The declaration is initialized with *__begin inside the loop body. */
43178 LOOKUP_ONLYCONVERTING);
43181 }
43183 /* Return true if next tokens contain a standard attribute that contains
43184 omp::directive (DIRECTIVE). */
43186 static bool
43189 {
43197 {
43204 }
43209 location_t last_loc
43218 {
43220 {
43224 cnt++;
43228 {
43232 }
43233 }
43234 }
43236 {
43239 }
43241 {
43243 "%<[[omp::directive(%s)]]%> must be the only specified "
43247 }
43252 }
43254 /* Parse an OpenMP structured block sequence. KIND is the corresponding
43255 separating directive. */
43257 static tree
43260 {
43266 {
43279 kind == PRAGMA_OMP_SCAN
43284 }
43288 }
43291 /* OpenMP 5.0:
43293 scan-loop-body:
43294 { structured-block scan-directive structured-block } */
43296 static void
43298 {
43301 matching_braces braces;
43311 {
43320 {
43327 }
43329 {
43332 }
43333 else
43338 }
43339 else
43345 clauses);
43349 }
43351 /* Parse the restricted form of the for statement allowed by OpenMP. */
43353 static tree
43356 {
43358 tree orig_decl;
43361 location_t loc_first;
43364 releasing_vec for_block;
43373 {
43376 }
43379 {
43382 }
43389 {
43395 }
43409 {
43412 location_t loc;
43415 {
43419 }
43422 /* Don't create location wrapper nodes within an OpenMP "for"
43423 statement. */
43424 auto_suppress_location_wrappers sentinel;
43426 matching_parens parens;
43434 {
43435 /* Save tokens so that we can put them back. */
43438 /* Look for ':' that is not nested in () or {}. */
43439 bool is_range_for
43442 CPP_COLON,
43443 /*consume_paren=*/
43446 /* Roll back the tokens we skipped. */
43450 {
43451 bool saved_colon_corrects_to_scope_p
43454 /* A colon is used in range-based for. */
43457 /* Parse the declaration. */
43459 /*function_definition_allowed_p=*/
43461 parser->colon_corrects_to_scope_p
43473 {
43475 {
43481 }
43482 else
43484 }
43488 "%<ordered%> clause with parameter on "
43492 }
43493 }
43495 add_private_clause
43501 {
43504 {
43510 }
43511 else
43513 }
43521 {
43526 {
43530 }
43533 {
43534 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
43538 {
43541 }
43542 else
43543 {
43546 }
43548 }
43549 else
43550 {
43555 }
43556 }
43559 {
43560 tree c;
43562 {
43571 decl);
43576 decl);
43577 }
43579 {
43584 else
43589 {
43592 /* For linear, signal that we need to fill up
43593 the so far unknown linear step. */
43596 }
43597 }
43598 }
43607 {
43608 /* If decl is an iterator, preserve the operator on decl
43609 until finish_omp_for. */
43611 && ((processing_template_decl
43616 else
43619 }
43621 parse_close_paren:
43632 {
43635 }
43637 {
43641 }
43648 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
43649 in between the collapsed for loops to be still considered perfectly
43650 nested. Hopefully the final version clarifies this.
43651 For now handle (multiple) {'s and empty statements. */
43654 {
43658 {
43660 bracecount++;
43661 }
43665 else
43666 {
43673 }
43674 }
43677 {
43680 }
43681 }
43686 /* Note that we saved the original contents of this flag when we entered
43687 the structured block, and so we don't need to re-save it here. */
43690 /* Note that the grammar doesn't call for a structured block here,
43691 though the loop as a whole is a structured block. */
43693 {
43699 }
43700 else
43704 else
43708 else
43713 else
43718 {
43720 {
43722 nbraces--;
43723 }
43726 else
43727 {
43729 {
43732 }
43737 }
43738 }
43741 {
43745 else
43747 }
43750 }
43752 /* Helper function for OpenMP parsing, split clauses and call
43753 finish_omp_clauses on each of the set of clauses afterwards. */
43755 static void
43758 {
43764 i == C_OMP_CLAUSE_SPLIT_TARGET
43766 }
43768 /* OpenMP 5.0:
43769 #pragma omp loop loop-clause[optseq] new-line
43770 for-loop */
43772 #define OMP_LOOP_CLAUSE_MASK \
43773 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
43774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
43775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
43776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
43777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_BIND) \
43778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
43780 static tree
43784 {
43795 {
43798 }
43810 }
43812 /* OpenMP 4.0:
43813 #pragma omp simd simd-clause[optseq] new-line
43814 for-loop */
43816 #define OMP_SIMD_CLAUSE_MASK \
43817 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
43818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
43819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
43820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
43821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
43822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
43823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
43824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
43825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
43826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NONTEMPORAL) \
43827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
43829 static tree
43833 {
43844 {
43847 }
43859 }
43861 /* OpenMP 2.5:
43862 #pragma omp for for-clause[optseq] new-line
43863 for-loop
43865 OpenMP 4.0:
43866 #pragma omp for simd for-simd-clause[optseq] new-line
43867 for-loop */
43869 #define OMP_FOR_CLAUSE_MASK \
43870 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
43871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
43872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
43873 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
43874 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
43875 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
43876 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
43877 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
43878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
43879 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
43880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
43882 static tree
43886 {
43893 /* parallel for{, simd} disallows nowait clause, but for
43894 target {teams distribute ,}parallel for{, simd} it should be accepted. */
43897 /* Composite distribute parallel for{, simd} disallows ordered clause. */
43902 {
43907 {
43931 }
43932 }
43934 {
43937 }
43939 /* Composite distribute parallel for disallows linear clause. */
43946 {
43949 }
43961 }
43966 /* OpenMP 2.5:
43967 # pragma omp master new-line
43968 structured-block */
43970 static tree
43974 {
43982 {
43987 {
44007 }
44008 }
44010 {
44013 }
44016 {
44020 }
44021 else
44026 }
44028 /* OpenMP 5.1:
44029 # pragma omp masked masked-clauses new-line
44030 structured-block */
44032 #define OMP_MASKED_CLAUSE_MASK \
44033 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FILTER)
44035 static tree
44039 {
44048 {
44053 {
44074 }
44075 }
44077 {
44080 }
44085 {
44088 }
44092 clauses);
44093 }
44095 /* OpenMP 2.5:
44096 # pragma omp ordered new-line
44097 structured-block
44099 OpenMP 4.5:
44100 # pragma omp ordered ordered-clauses new-line
44101 structured-block */
44103 #define OMP_ORDERED_CLAUSE_MASK \
44104 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
44105 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
44107 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
44108 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
44109 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DOACROSS))
44111 static bool
44114 {
44122 {
44127 {
44129 {
44132 }
44134 {
44136 "%qs clause may only be used in compound "
44140 }
44141 tree clauses
44143 OMP_ORDERED_DEPEND_CLAUSE_MASK,
44147 }
44148 }
44150 tree clauses
44161 }
44163 /* OpenMP 2.5:
44165 section-scope:
44166 { section-sequence }
44168 section-sequence:
44169 section-directive[opt] structured-block
44170 section-sequence section-directive structured-block */
44172 static tree
44174 {
44179 matching_braces braces;
44186 != PRAGMA_OMP_SECTION
44188 {
44190 PRAGMA_OMP_SECTION);
44193 }
44196 {
44206 {
44210 }
44212 {
44215 }
44218 PRAGMA_OMP_SECTION);
44221 }
44232 }
44234 /* OpenMP 2.5:
44235 # pragma omp sections sections-clause[optseq] newline
44236 sections-scope */
44238 #define OMP_SECTIONS_CLAUSE_MASK \
44239 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44240 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44241 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44242 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44243 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44244 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
44246 static tree
44249 {
44261 {
44264 }
44271 }
44273 /* OpenMP 2.5:
44274 # pragma omp parallel parallel-clause[optseq] new-line
44275 structured-block
44276 # pragma omp parallel for parallel-for-clause[optseq] new-line
44277 structured-block
44278 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
44279 structured-block
44281 OpenMP 4.0:
44282 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
44283 structured-block */
44285 #define OMP_PARALLEL_CLAUSE_MASK \
44286 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
44287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
44290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
44291 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
44292 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44293 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
44294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
44297 static tree
44301 {
44308 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
44314 {
44322 if_p);
44326 if_p);
44329 block);
44334 }
44335 /* When combined with distribute, parallel has to be followed by for.
44336 #pragma omp target parallel is allowed though. */
44340 {
44344 }
44346 {
44350 {
44364 block);
44367 /* masked does have just filter clause, but during gimplification
44368 isn't represented by a gimplification omp context, so for
44369 #pragma omp parallel masked don't set OMP_PARALLEL_COMBINED,
44370 so that
44371 #pragma omp parallel masked
44372 #pragma omp taskloop simd lastprivate (x)
44373 isn't confused with
44374 #pragma omp parallel masked taskloop simd lastprivate (x) */
44378 }
44380 {
44394 block);
44397 /* master doesn't have any clauses and during gimplification
44398 isn't represented by a gimplification omp context, so for
44399 #pragma omp parallel master don't set OMP_PARALLEL_COMBINED,
44400 so that
44401 #pragma omp parallel master
44402 #pragma omp taskloop simd lastprivate (x)
44403 isn't confused with
44404 #pragma omp parallel master taskloop simd lastprivate (x) */
44408 }
44410 {
44425 block);
44430 }
44432 {
44435 }
44437 {
44447 block);
44450 }
44451 }
44453 {
44456 }
44461 {
44464 }
44473 }
44475 /* OpenMP 2.5:
44476 # pragma omp single single-clause[optseq] new-line
44477 structured-block */
44479 #define OMP_SINGLE_CLAUSE_MASK \
44480 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
44483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44484 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
44486 static tree
44488 {
44499 }
44501 /* OpenMP 5.1:
44502 # pragma omp scope scope-clause[optseq] new-line
44503 structured-block */
44505 #define OMP_SCOPE_CLAUSE_MASK \
44506 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44507 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44508 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44509 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44510 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
44512 static tree
44514 {
44525 }
44527 /* OpenMP 3.0:
44528 # pragma omp task task-clause[optseq] new-line
44529 structured-block */
44531 #define OMP_TASK_CLAUSE_MASK \
44532 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
44533 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
44534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
44535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
44538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
44539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
44540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
44541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
44542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44543 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION) \
44544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DETACH) \
44545 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_AFFINITY))
44547 static tree
44549 {
44561 }
44563 /* OpenMP 3.0:
44564 # pragma omp taskwait new-line
44566 OpenMP 5.0:
44567 # pragma omp taskwait taskwait-clause[opt] new-line */
44569 #define OMP_TASKWAIT_CLAUSE_MASK \
44570 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
44571 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
44573 static void
44575 {
44576 tree clauses
44581 {
44588 }
44589 else
44591 }
44593 /* OpenMP 3.1:
44594 # pragma omp taskyield new-line */
44596 static void
44598 {
44601 }
44603 /* OpenMP 4.0:
44604 # pragma omp taskgroup new-line
44605 structured-block
44607 OpenMP 5.0:
44608 # pragma omp taskgroup taskgroup-clause[optseq] new-line */
44610 #define OMP_TASKGROUP_CLAUSE_MASK \
44611 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44612 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASK_REDUCTION))
44614 static tree
44616 {
44617 tree clauses
44622 if_p),
44623 clauses);
44624 }
44627 /* OpenMP 2.5:
44628 # pragma omp threadprivate (variable-list) */
44630 static void
44632 {
44633 tree vars;
44639 }
44641 /* OpenMP 4.0:
44642 # pragma omp cancel cancel-clause[optseq] new-line */
44644 #define OMP_CANCEL_CLAUSE_MASK \
44645 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
44646 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
44647 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
44648 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
44649 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
44651 static void
44653 {
44657 }
44659 /* OpenMP 4.0:
44660 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
44662 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
44663 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
44664 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
44665 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
44666 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
44668 static bool
44671 {
44672 tree clauses;
44676 {
44681 {
44684 }
44685 }
44687 {
44691 }
44694 {
44699 else
44703 }
44706 OMP_CANCELLATION_POINT_CLAUSE_MASK,
44708 pragma_tok);
44711 }
44713 /* OpenMP 4.0:
44714 #pragma omp distribute distribute-clause[optseq] new-line
44715 for-loop */
44717 #define OMP_DISTRIBUTE_CLAUSE_MASK \
44718 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44719 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44720 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
44721 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
44722 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
44724 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
44726 static tree
44730 {
44739 {
44747 else
44750 {
44756 {
44760 else
44763 }
44769 else
44783 }
44784 }
44786 {
44789 }
44794 {
44797 }
44809 }
44811 /* OpenMP 4.0:
44812 # pragma omp teams teams-clause[optseq] new-line
44813 structured-block */
44815 #define OMP_TEAMS_CLAUSE_MASK \
44816 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
44817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
44818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
44819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
44820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
44821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
44822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
44823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
44825 static tree
44829 {
44838 {
44842 {
44868 }
44870 {
44896 }
44897 }
44899 {
44902 }
44907 {
44910 }
44920 }
44922 /* OpenMP 4.0:
44923 # pragma omp target data target-data-clause[optseq] new-line
44924 structured-block */
44926 #define OMP_TARGET_DATA_CLAUSE_MASK \
44927 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
44928 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
44929 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
44930 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR) \
44931 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_ADDR))
44933 static tree
44935 {
44937 omp_requires_mask
44940 tree clauses
44946 {
44949 {
44967 "%<#pragma omp target data%> with map-type other "
44968 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
44972 }
44977 }
44980 {
44983 "%<#pragma omp target data%> must contain at least "
44984 "one %<map%>, %<use_device_ptr%> or %<use_device_addr%> "
44987 }
44998 }
45000 /* OpenMP 4.5:
45001 # pragma omp target enter data target-enter-data-clause[optseq] new-line
45002 structured-block */
45004 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
45005 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
45007 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45008 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45009 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45011 static bool
45014 {
45017 {
45022 {
45025 }
45026 }
45028 {
45032 }
45035 {
45041 }
45044 omp_requires_mask
45047 tree clauses
45053 {
45056 {
45078 "%<#pragma omp target enter data%> with map-type other "
45082 }
45084 }
45087 {
45090 "%<#pragma omp target enter data%> must contain at least "
45093 }
45101 }
45103 /* OpenMP 4.5:
45104 # pragma omp target exit data target-enter-data-clause[optseq] new-line
45105 structured-block */
45107 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
45108 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45109 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
45110 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45111 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45112 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45114 static bool
45117 {
45120 {
45125 {
45128 }
45129 }
45131 {
45135 }
45138 {
45144 }
45147 omp_requires_mask
45150 tree clauses
45156 {
45159 {
45182 "%<#pragma omp target exit data%> with map-type other "
45183 "than %<from%>, %<tofrom%>, %<release%> or %<delete%> "
45187 }
45189 }
45192 {
45195 "%<#pragma omp target exit data%> must contain at least "
45198 }
45206 }
45208 /* OpenMP 4.0:
45209 # pragma omp target update target-update-clause[optseq] new-line */
45211 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
45212 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
45213 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
45214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45216 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45217 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
45219 static bool
45222 {
45224 {
45230 }
45232 tree clauses
45237 {
45239 "%<#pragma omp target update%> must contain at least one "
45242 }
45245 omp_requires_mask
45254 }
45256 /* OpenMP 4.0:
45257 # pragma omp target target-clause[optseq] new-line
45258 structured-block */
45260 #define OMP_TARGET_CLAUSE_MASK \
45261 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
45262 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
45263 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
45264 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
45265 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
45266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
45267 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
45268 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
45269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
45270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION) \
45271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
45272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR)\
45273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HAS_DEVICE_ADDR))
45275 static bool
45278 {
45280 omp_requires_mask
45284 {
45296 {
45304 {
45305 tree stmt;
45307 {
45310 OMP_TARGET_CLAUSE_MASK,
45315 OMP_TARGET_CLAUSE_MASK,
45320 OMP_TARGET_CLAUSE_MASK,
45325 }
45327 }
45332 {
45336 if_p);
45341 if_p);
45346 if_p);
45350 }
45356 /* For combined target teams, ensure the num_teams and
45357 thread_limit clause expressions are evaluated on the host,
45358 before entering the target construct. */
45367 {
45370 tf_none);
45377 OMP_CLAUSE_FIRSTPRIVATE);
45382 }
45387 }
45389 {
45392 }
45394 {
45398 }
45400 {
45403 }
45405 {
45408 }
45410 {
45413 }
45414 }
45416 {
45419 }
45426 {
45432 }
45441 }
45443 /* OpenACC 2.0:
45444 # pragma acc cache (variable-list) new-line
45445 */
45447 static tree
45449 {
45450 /* Don't create location wrapper nodes within 'OMP_CLAUSE__CACHE_'
45451 clauses. */
45452 auto_suppress_location_wrappers sentinel;
45468 }
45470 /* OpenACC 2.0:
45471 # pragma acc data oacc-data-clause[optseq] new-line
45472 structured-block */
45474 #define OACC_DATA_CLAUSE_MASK \
45475 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
45476 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
45477 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
45478 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
45479 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
45480 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DETACH) \
45481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
45482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
45483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
45484 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
45486 static tree
45488 {
45501 }
45503 /* OpenACC 2.0:
45504 # pragma acc host_data <clauses> new-line
45505 structured-block */
45507 #define OACC_HOST_DATA_CLAUSE_MASK \
45508 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) \
45509 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
45510 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) )
45512 static tree
45514 {
45527 }
45529 /* OpenACC 2.0:
45530 # pragma acc declare oacc-data-clause[optseq] new-line
45531 */
45533 #define OACC_DECLARE_CLAUSE_MASK \
45534 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
45535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
45536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
45537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
45538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
45539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
45540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
45541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
45543 static tree
45545 {
45555 {
45559 }
45562 {
45566 {
45570 }
45573 {
45585 {
45587 "%qD must be a global variable in "
45589 decl);
45592 }
45597 {
45601 }
45603 {
45605 "invalid use of %<extern%> variable %qD "
45609 }
45611 {
45613 "invalid use of %<global%> variable %qD "
45617 }
45619 }
45622 /* This seems to ignore the existence of cleanup scopes?
45623 What is the meaning for local extern decls? The local
45624 extern is in this scope, but it is referring to a decl that
45625 is namespace scope. */
45628 {
45631 }
45633 {
45635 "%qD must be a variable declared in the same scope as "
45639 }
45644 {
45649 }
45652 {
45653 tree id;
45656 /* We need to mark the aliased decl, as that is the entity
45657 that is being referred to. This won't work for
45658 dependent variables, but it didn't work for them before
45659 DECL_LOCAL_DECL_P was a thing either. But then
45660 dependent local extern variable decls are as rare as
45661 hen's teeth. */
45668 else
45674 {
45677 {
45680 {
45684 }
45685 }
45686 }
45687 }
45688 }
45701 }
45703 /* OpenACC 2.0:
45704 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
45706 or
45708 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
45710 LOC is the location of the #pragma token.
45711 */
45713 #define OACC_ENTER_DATA_CLAUSE_MASK \
45714 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
45715 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
45716 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
45717 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
45718 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
45719 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
45721 #define OACC_EXIT_DATA_CLAUSE_MASK \
45722 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
45723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
45724 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
45725 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
45726 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DETACH) \
45727 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
45728 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
45730 static tree
45733 {
45742 {
45747 }
45754 else
45759 {
45763 }
45771 }
45773 /* OpenACC 2.0:
45774 # pragma acc loop oacc-loop-clause[optseq] new-line
45775 structured-block */
45777 #define OACC_LOOP_CLAUSE_MASK \
45778 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
45779 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
45780 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
45781 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
45782 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
45783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
45784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
45785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
45786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
45787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
45789 static tree
45792 {
45801 {
45807 }
45816 }
45818 /* OpenACC 2.0:
45819 # pragma acc kernels oacc-kernels-clause[optseq] new-line
45820 structured-block
45822 or
45824 # pragma acc parallel oacc-parallel-clause[optseq] new-line
45825 structured-block
45827 OpenACC 2.6:
45829 # pragma acc serial oacc-serial-clause[optseq] new-line
45830 */
45832 #define OACC_KERNELS_CLAUSE_MASK \
45833 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
45834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
45835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
45836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
45837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
45838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
45839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
45840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
45841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
45842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
45843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
45844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
45845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
45846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
45847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
45849 #define OACC_PARALLEL_CLAUSE_MASK \
45850 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
45851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
45852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
45853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
45854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
45855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
45856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
45857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
45858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
45859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
45860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
45861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
45862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
45863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
45864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
45865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
45866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
45867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
45869 #define OACC_SERIAL_CLAUSE_MASK \
45870 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
45871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ATTACH) \
45872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
45873 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
45874 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
45875 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
45876 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
45877 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
45878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
45879 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NO_CREATE) \
45880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
45881 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
45882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
45883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
45884 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
45886 static tree
45889 {
45890 omp_clause_mask mask;
45893 {
45911 }
45914 {
45918 {
45921 tree clauses;
45926 }
45927 }
45936 }
45938 /* OpenACC 2.0:
45939 # pragma acc update oacc-update-clause[optseq] new-line
45940 */
45942 #define OACC_UPDATE_CLAUSE_MASK \
45943 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
45944 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
45945 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
45946 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
45947 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
45948 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
45950 static tree
45952 {
45959 {
45961 "%<#pragma acc update%> must contain at least one "
45964 }
45972 }
45974 /* OpenACC 2.0:
45975 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
45977 LOC is the location of the #pragma token.
45978 */
45980 #define OACC_WAIT_CLAUSE_MASK \
45981 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
45983 static tree
45985 {
45999 }
46001 /* OpenMP 4.0:
46002 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
46004 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
46005 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
46006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
46007 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
46008 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
46009 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
46010 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
46012 static void
46016 {
46018 cp_omp_declare_simd_data data;
46020 {
46028 /* It is safe to take the address of a local variable; it will only be
46029 used while this scope is live. */
46031 }
46033 {
46035 "%<#pragma omp declare %s%> followed by "
46040 }
46042 /* Store away all pragma tokens. */
46051 {
46055 {
46068 }
46073 "%<#pragma omp declare %s%> not immediately followed by "
46078 }
46079 }
46091 /* OpenMP 5.0:
46093 trait-selector:
46094 trait-selector-name[([trait-score:]trait-property[,trait-property[,...]])]
46096 trait-score:
46097 score(score-expression) */
46099 static tree
46101 {
46103 do
46104 {
46105 tree selector;
46109 else
46110 {
46113 }
46124 {
46151 }
46153 {
46155 {
46157 {
46160 }
46161 else
46162 {
46168 }
46169 }
46174 }
46184 {
46186 {
46190 }
46192 matching_parens parens;
46200 {
46207 {
46211 matching_parens parens2;
46219 {
46231 else
46234 }
46235 }
46236 else
46240 }
46243 {
46244 tree t;
46246 do
46247 {
46250 {
46258 "constant integer expression or string "
46260 else
46262 }
46263 else
46268 else
46270 }
46276 {
46280 }
46281 else
46282 {
46285 }
46288 do
46289 {
46293 {
46296 }
46299 else
46300 {
46304 }
46310 else
46312 }
46318 {
46325 else
46327 }
46328 else
46333 {
46335 "selector may not be specified in "
46338 }
46339 properties
46341 OMP_DECLARE_SIMD_CLAUSE_MASK,
46346 }
46352 }
46356 {
46359 }
46365 else
46367 }
46371 }
46373 /* OpenMP 5.0:
46375 trait-set-selector[,trait-set-selector[,...]]
46377 trait-set-selector:
46378 trait-set-selector-name = { trait-selector[, trait-selector[, ...]] }
46380 trait-set-selector-name:
46381 constructor
46382 device
46383 implementation
46384 user */
46386 static tree
46389 {
46391 do
46392 {
46395 setp
46398 {
46417 }
46419 {
46423 }
46431 matching_braces braces;
46435 tree selectors
46438 {
46441 }
46449 else
46451 }
46457 }
46459 /* Assumption clauses:
46460 OpenMP 5.1
46461 absent (directive-name-list)
46462 contains (directive-name-list)
46463 holds (expression)
46464 no_openmp
46465 no_openmp_routines
46466 no_parallelism */
46468 static void
46471 {
46486 {
46499 {
46504 }
46506 {
46511 }
46513 {
46518 }
46520 {
46522 matching_parens parens;
46524 {
46536 }
46537 }
46539 {
46541 matching_parens parens;
46543 {
46544 do
46545 {
46548 location_t dloc
46551 {
46552 tree id;
46557 CPP_KEYWORD))
46558 {
46559 enum rid rid
46563 }
46564 else
46567 }
46570 else
46571 {
46584 else
46585 {
46590 "mentioned in both %<absent%> and "
46598 ? &absent_head
46601 "mentioned multiple times in %qs "
46608 }
46611 }
46614 else
46616 }
46623 }
46624 }
46626 {
46633 }
46634 else
46635 {
46639 }
46640 }
46642 }
46644 /* OpenMP 5.1
46645 # pragma omp assume clauses[optseq] new-line */
46647 static void
46649 {
46652 }
46654 /* OpenMP 5.1
46655 # pragma omp assumes clauses[optseq] new-line */
46657 static bool
46659 {
46662 }
46664 /* Finalize #pragma omp declare variant after a fndecl has been parsed, and put
46665 that into "omp declare variant base" attribute. */
46667 static tree
46669 tree attrs)
46670 {
46671 matching_parens parens;
46673 {
46674 fail:
46677 }
46682 cp_expr varid
46690 tree variant;
46697 else
46698 {
46699 tree ambiguous_decls;
46707 }
46711 {
46713 variant
46721 }
46736 {
46739 }
46751 {
46753 match_loc);
46762 }
46767 }
46770 /* Finalize #pragma omp declare simd clauses after direct declarator has
46771 been parsed, and put that into "omp declare simd" attribute. */
46773 static tree
46775 {
46781 {
46786 }
46791 {
46802 {
46805 pragma_tok);
46813 }
46814 else
46815 {
46817 attrs
46819 }
46821 }
46825 {
46831 {
46833 {
46840 {
46848 else
46851 }
46857 {
46859 "unknown OpenMP directive name in "
46862 }
46866 {
46868 "OpenMP directive other than %<declare simd%> "
46869 "or %<declare variant%> appertains to a "
46872 }
46875 {
46877 "mixing OpenMP directives with attribute and "
46880 }
46885 {
46888 }
46890 cp_token tok = {};
46898 tok = {};
46903 tok = {};
46915 /* Move the current source position to that of the first token
46916 in the new lexer. */
46926 {
46934 pragma_tok);
46938 cl);
46943 }
46944 else
46945 {
46947 attrs
46949 attrs);
46950 }
46953 }
46955 }
46956 else
46958 }
46964 }
46966 /* Helper for cp_parser_omp_declare_target, handle one to or link clause
46967 on #pragma omp declare target. Return false if errors were reported. */
46969 static bool
46971 {
46974 tree id;
46976 {
46979 }
46980 else
46983 {
46986 "%qD specified both in declare target %<link%> and %qs"
46988 else
46990 "%qD specified both in declare target %<link%> and "
46993 }
46995 {
47002 {
47005 {
47009 }
47010 }
47011 }
47015 {
47019 {
47022 }
47023 }
47025 {
47029 {
47032 }
47033 }
47035 }
47037 /* OpenMP 4.0:
47038 # pragma omp declare target new-line
47039 declarations and definitions
47040 # pragma omp end declare target new-line
47042 OpenMP 4.5:
47043 # pragma omp declare target ( extended-list ) new-line
47045 # pragma omp declare target declare-target-clauses[seq] new-line */
47047 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
47048 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
47049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ENTER) \
47050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK) \
47051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE_TYPE))
47053 static void
47055 {
47062 clauses
47066 {
47068 clauses);
47071 }
47072 else
47073 {
47074 cp_omp_declare_target_attr a
47079 }
47084 {
47097 device_type);
47098 }
47102 }
47104 /* OpenMP 5.1
47105 # pragma omp begin assumes clauses[optseq] new-line
47107 # pragma omp begin declare target clauses[optseq] new-line */
47109 #define OMP_BEGIN_DECLARE_TARGET_CLAUSE_MASK \
47110 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE_TYPE)
47112 static void
47114 {
47118 {
47121 }
47123 {
47127 {
47130 }
47132 {
47134 tree clauses
47136 OMP_BEGIN_DECLARE_TARGET_CLAUSE_MASK,
47138 pragma_tok);
47143 cp_omp_declare_target_attr a
47146 }
47147 else
47148 {
47151 }
47152 }
47154 {
47159 }
47160 else
47161 {
47164 }
47165 }
47167 /* OpenMP 4.0:
47168 # pragma omp end declare target new-line
47170 OpenMP 5.1:
47171 # pragma omp end assumes new-line */
47173 static void
47175 {
47179 {
47182 }
47184 {
47188 {
47191 }
47194 else
47195 {
47199 }
47203 "%<#pragma omp end declare target%> without corresponding "
47204 "%<#pragma omp declare target%> or "
47206 else
47207 {
47208 cp_omp_declare_target_attr
47211 {
47214 "%qs in attribute syntax terminated "
47219 else
47221 "%qs in pragma syntax terminated "
47226 }
47227 }
47228 }
47230 {
47237 else
47238 {
47239 cp_omp_begin_assumes_data
47242 {
47245 "%qs in attribute syntax terminated "
47248 else
47250 "%qs in pragma syntax terminated "
47253 }
47254 }
47255 }
47256 else
47257 {
47261 }
47262 }
47264 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
47265 expression and optional initializer clause of
47266 #pragma omp declare reduction. We store the expression(s) as
47267 either 3, 6 or 7 special statements inside of the artificial function's
47268 body. The first two statements are DECL_EXPRs for the artificial
47269 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
47270 expression that uses those variables.
47271 If there was any INITIALIZER clause, this is followed by further statements,
47272 the fourth and fifth statements are DECL_EXPRs for the artificial
47273 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
47274 constructor variant (first token after open paren is not omp_priv),
47275 then the sixth statement is a statement with the function call expression
47276 that uses the OMP_PRIV and optionally OMP_ORIG variable.
47277 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
47278 to initialize the OMP_PRIV artificial variable and there is seventh
47279 statement, a DECL_EXPR of the OMP_PRIV statement again. */
47281 static bool
47283 {
47295 tree combiner;
47316 {
47319 }
47322 {
47324 matching_parens parens;
47330 {
47333 }
47349 {
47353 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
47357 == CPP_CLOSE_PAREN
47360 {
47364 }
47369 }
47370 else
47371 {
47373 /* Don't create location wrapper nodes here. */
47374 auto_suppress_location_wrappers sentinel;
47389 {
47394 }
47396 tree arg;
47409 }
47422 }
47426 UNKNOWN_LOCATION);
47429 }
47431 /* OpenMP 4.0
47432 #pragma omp declare reduction (reduction-id : typename-list : expression) \
47433 initializer-clause[opt] new-line
47435 initializer-clause:
47436 initializer (omp_priv initializer)
47437 initializer (function-name (argument-list)) */
47439 static void
47442 {
47452 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
47459 {
47491 }
47503 /* Types may not be defined in declare reduction type list. */
47506 parser->type_definition_forbidden_message
47512 saved_colon_doesnt_start_class_def_p
47517 {
47521 ;
47539 else
47544 else
47546 }
47548 /* Restore the saved message. */
47551 parser->colon_doesnt_start_class_def_p
47556 {
47557 fail:
47560 }
47566 {
47567 tree fntype
47570 NULL_TREE);
47587 {
47591 }
47597 {
47600 }
47602 {
47604 {
47610 }
47617 }
47618 else
47619 {
47622 /* We should never meet a matched duplicate decl. */
47624 }
47629 else
47632 {
47635 }
47643 else
47644 {
47648 }
47653 {
47661 }
47669 }
47673 done:
47674 /* Free any declarators allocated. */
47676 }
47678 /* OpenMP 4.0
47679 #pragma omp declare simd declare-simd-clauses[optseq] new-line
47680 #pragma omp declare reduction (reduction-id : typename-list : expression) \
47681 initializer-clause[opt] new-line
47682 #pragma omp declare target new-line
47684 OpenMP 5.0
47685 #pragma omp declare variant (identifier) match (context-selector) */
47687 static bool
47690 {
47692 {
47697 {
47702 }
47704 {
47709 }
47712 {
47715 context);
47717 }
47719 {
47722 }
47724 {
47728 }
47729 }
47734 }
47736 /* OpenMP 5.0
47737 #pragma omp requires clauses[optseq] new-line */
47739 static bool
47741 {
47746 {
47752 {
47767 {
47770 matching_parens parens;
47772 {
47774 {
47779 this_req
47782 this_req
47785 this_req
47787 }
47789 {
47791 "expected %<seq_cst%>, %<relaxed%> or "
47794 {
47801 CPP_CLOSE_PAREN))
47804 }
47805 }
47806 else
47813 /*consume_paren=*/
47817 {
47820 }
47821 }
47823 }
47824 else
47825 {
47827 "%<unified_shared_memory%>, "
47828 "%<dynamic_allocators%>, "
47829 "%<reverse_offload%> "
47833 }
47837 {
47839 {
47846 }
47848 {
47852 }
47855 {
47858 this_req
47860 (omp_requires_mask
47862 }
47866 "lexically after first %<atomic%> construct "
47869 omp_requires_mask
47872 }
47873 }
47875 }
47881 }
47884 /* OpenMP 5.1:
47885 #pragma omp nothing new-line */
47887 static void
47889 {
47891 }
47894 /* OpenMP 5.1
47895 #pragma omp error clauses[optseq] new-line */
47897 static bool
47900 {
47908 {
47921 };
47929 {
47932 }
47934 {
47939 }
47943 matching_parens parens;
47945 {
47947 {
47951 else
47953 tf_warning_or_error,
47954 LOOKUP_NORMAL);
47955 }
47956 else
47957 {
47959 {
47967 }
47969 {
47974 {
47981 CPP_CLOSE_PAREN))
47984 }
47985 }
47986 else
47988 }
47994 /*consume_paren=*/
47998 {
48000 {
48003 }
48004 else
48006 }
48008 {
48010 {
48013 }
48014 else
48016 }
48017 }
48018 else
48020 }
48030 {
48032 {
48036 }
48037 tree fndecl
48046 }
48053 {
48057 }
48061 else
48065 }
48067 /* OpenMP 4.5:
48068 #pragma omp taskloop taskloop-clause[optseq] new-line
48069 for-loop
48071 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
48072 for-loop */
48074 #define OMP_TASKLOOP_CLAUSE_MASK \
48075 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
48076 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
48077 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
48078 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
48079 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
48080 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
48081 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
48082 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
48083 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
48084 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
48085 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
48086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
48087 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
48088 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
48089 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALLOCATE) \
48090 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
48091 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
48093 static tree
48097 {
48104 /* #pragma omp parallel master taskloop{, simd} disallow in_reduction
48105 clause. */
48110 {
48115 {
48139 }
48140 }
48142 {
48145 }
48150 {
48153 }
48160 if_p);
48166 }
48169 /* OpenACC 2.0:
48170 # pragma acc routine oacc-routine-clause[optseq] new-line
48171 function-definition
48173 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
48174 */
48176 #define OACC_ROUTINE_CLAUSE_MASK \
48177 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
48178 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
48179 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
48180 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
48181 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NOHOST) )
48183 /* Parse the OpenACC routine pragma. This has an optional '( name )'
48184 component, which must resolve to a declared namespace-scope
48185 function. The clauses are either processed directly (for a named
48186 function), or defered until the immediatley following declaration
48187 is parsed. */
48189 static void
48192 {
48194 /* The checking for "another pragma following this one" in the "no optional
48195 '( name )'" case makes sure that we dont re-enter. */
48198 cp_oacc_routine_data data;
48204 /* It is safe to take the address of a local variable; it will only be
48205 used while this scope is live. */
48208 /* Look for optional '( name )'. */
48210 {
48211 matching_parens parens;
48214 /* We parse the name as an id-expression. If it resolves to
48215 anything other than a non-overloaded function at namespace
48216 scope, it's an error. */
48232 {
48236 }
48238 data.clauses
48242 /* The clauses are in reverse order; fix that to make later diagnostic
48243 emission easier. */
48249 {
48254 }
48256 /* Perhaps we should use the same rule as declarations in different
48257 namespaces? */
48259 {
48264 }
48267 {
48271 }
48275 }
48277 {
48278 /* Store away all pragma tokens. */
48286 /* Emit a helpful diagnostic if there's another pragma following this
48287 one. */
48289 {
48292 /* ..., and then just keep going. */
48294 }
48296 /* We only have to consider the pragma_external case here. */
48301 else
48304 }
48305 }
48307 /* Finalize #pragma acc routine clauses after direct declarator has
48308 been parsed. */
48310 static tree
48312 {
48317 {
48319 "%<#pragma acc routine%> not immediately followed by "
48322 }
48338 /* The clauses are in reverse order; fix that to make later diagnostic
48339 emission easier. */
48342 /* Later, cp_finalize_oacc_routine will process the clauses. */
48346 }
48348 /* Apply any saved OpenACC routine clauses to a just-parsed
48349 declaration. */
48351 static void
48353 {
48355 {
48356 /* Keep going if we're in error reporting mode. */
48362 {
48364 {
48366 "%<#pragma acc routine%> not immediately followed by"
48370 }
48374 }
48376 int compatible
48381 {
48384 }
48386 {
48387 }
48388 else
48389 {
48391 {
48400 }
48402 /* Set the routine's level of parallelism. */
48406 /* Add an "omp declare target" attribute. */
48411 }
48412 }
48413 }
48415 /* Main entry point to OpenMP statement pragmas. */
48417 static void
48419 {
48420 tree stmt;
48425 {
48453 if_p);
48473 if_p);
48478 if_p);
48483 if_p);
48488 if_p);
48493 if_p);
48498 if_p);
48510 if_p);
48524 if_p);
48529 if_p);
48536 }
48539 }
48540 \f
48541 /* Transactional Memory parsing routines. */
48543 /* Parse a transaction attribute.
48545 txn-attribute:
48546 attribute
48547 [ [ identifier ] ]
48549 We use this instead of cp_parser_attributes_opt for transactions to avoid
48550 the pedwarn in C++98 mode. */
48552 static tree
48554 {
48569 {
48573 /* For keywords, use the canonical spelling,
48574 not the parsed identifier. */
48578 }
48579 else
48583 error1:
48586 }
48588 /* Parse a __transaction_atomic or __transaction_relaxed statement.
48590 transaction-statement:
48591 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
48592 compound-statement
48593 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
48594 */
48596 static tree
48598 {
48609 else
48610 {
48614 }
48616 /* Parse a noexcept specification. */
48620 {
48621 /* cancel-and-throw is unimplemented. */
48624 }
48625 else
48627 CP_PARSER_FLAGS_NONE,
48632 /* Keep track if we're in the lexical scope of an outer transaction. */
48644 }
48646 /* Parse a __transaction_atomic or __transaction_relaxed expression.
48648 transaction-expression:
48649 __transaction_atomic txn-noexcept-spec[opt] ( expression )
48650 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
48651 */
48653 static tree
48655 {
48668 keyword == RID_TRANSACTION_RELAXED
48682 /* Set this early. This might mean that we allow transaction_cancel in
48683 an expression that we find out later actually has to be a constexpr.
48684 However, we expect that cxx_constant_value will be able to deal with
48685 this; also, if the noexcept has no constexpr, then what we parse next
48686 really is a transaction's body. */
48689 /* Parse a noexcept specification. */
48691 CP_PARSER_FLAGS_NONE,
48698 {
48699 matching_parens parens;
48706 }
48707 else
48708 {
48709 /* The only expression that is available got parsed for the noexcept
48710 already. noexcept is true then. */
48713 }
48722 }
48724 /* Parse a function-transaction-block.
48726 function-transaction-block:
48727 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
48728 function-body
48729 __transaction_atomic txn-attribute[opt] function-try-block
48730 __transaction_relaxed ctor-initializer[opt] function-body
48731 __transaction_relaxed function-try-block
48732 */
48734 static void
48736 {
48751 else
48752 {
48756 }
48764 else
48765 cp_parser_ctor_initializer_opt_and_function_body
48771 }
48773 /* Parse a __transaction_cancel statement.
48775 cancel-statement:
48776 __transaction_cancel txn-attribute[opt] ;
48777 __transaction_cancel txn-attribute[opt] throw-expression ;
48779 ??? Cancel and throw is not yet implemented. */
48781 static tree
48783 {
48789 RT_TRANSACTION_CANCEL);
48796 /* ??? Parse cancel-and-throw here. */
48801 {
48805 }
48807 {
48811 }
48813 {
48816 {
48822 }
48823 }
48825 {
48829 }
48835 }
48836 \f
48838 /* Special handling for the first token or line in the file. The first
48839 thing in the file might be #pragma GCC pch_preprocess, which loads a
48840 PCH file, which is a GC collection point. So we need to handle this
48841 first pragma without benefit of an existing lexer structure.
48843 Always returns one token to the caller in *FIRST_TOKEN. This is
48844 either the true first token of the file, or the first token after
48845 the initial pragma. */
48847 static void
48849 {
48857 {
48861 }
48863 /* Skip to the end of the pragma. */
48865 {
48868 do
48871 }
48873 /* Now actually load the PCH file. */
48877 /* Read one more token to return to our caller. We have to do this
48878 after reading the PCH file in, since its pointers have to be
48879 live. */
48881 }
48883 /* Parse a pragma GCC ivdep. */
48885 static bool
48887 {
48890 }
48892 /* Parse a pragma GCC unroll. */
48894 static unsigned short
48896 {
48906 {
48908 " assignment-expression that evaluates to a non-negative"
48911 }
48912 else
48913 {
48917 }
48920 }
48922 /* Normal parsing of a pragma token. Here we can (and must) use the
48923 regular lexer. */
48925 static bool
48927 {
48930 tree stmt;
48941 {
48949 {
48960 }
48965 {
48976 }
48981 {
48992 }
48997 {
49009 }
49014 {
49026 }
49031 {
49043 }
49062 {
49068 }
49076 {
49082 }
49090 {
49095 }
49101 {
49107 }
49115 {
49121 }
49163 {
49165 "%<#pragma omp requires%> may only be used at file or "
49169 }
49174 {
49176 "%<#pragma omp assumes%> may only be used at file or "
49180 }
49216 "%<#pragma omp scan%> may only be used in "
49222 "%<#pragma omp section%> may only be used in "
49227 {
49229 {
49233 }
49239 {
49243 }
49244 else
49250 {
49253 }
49256 }
49259 {
49261 {
49265 }
49266 const unsigned short unroll
49272 {
49276 }
49277 else
49283 {
49286 }
49289 }
49296 bad_stmt:
49299 }
49303 }
49305 /* The interface the pragma parsers have to the lexer. */
49307 enum cpp_ttype
49309 {
49321 else
49322 {
49326 }
49329 }
49331 \f
49332 /* External interface. */
49334 /* Parse one entire translation unit. */
49336 void
49338 {
49346 /* cp_lexer_new_main is called before doing any GC allocation
49347 because tokenization might load a PCH file. */
49356 }
49358 /* Create an identifier for a generic parameter type (a synthesized
49359 template parameter implied by `auto' or a concept identifier). */
49362 static tree
49364 {
49368 }
49370 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
49371 (creating a new template parameter list if necessary). Returns the newly
49372 created template type parm. */
49374 static tree
49376 {
49377 /* A requires-clause is not a function and cannot have placeholders. */
49379 {
49382 }
49386 /* We are either continuing a function template that already contains implicit
49387 template parameters, creating a new fully-implicit function template, or
49388 extending an existing explicit function template with implicit template
49389 parameters. */
49397 {
49401 }
49402 else
49403 {
49404 /* Roll back to the existing template parameter scope (in the case of
49405 extending an explicit function template) or introduce a new template
49406 parameter scope ahead of the function parameter scope (or class scope
49407 in the case of out-of-line member definitions). The function scope is
49408 added back after template parameter synthesis below. */
49413 {
49416 }
49418 {
49419 /* If not defining a class, then any class scope is a scope level in
49420 an out-of-line member definition. In this case simply wind back
49421 beyond the first such scope to inject the template parameter list.
49422 Otherwise wind back to the class being defined. The latter can
49423 occur in class member friend declarations such as:
49425 class A {
49426 void foo (auto);
49427 };
49428 class B {
49429 friend void A::foo (auto);
49430 };
49432 The template parameter list synthesized for the friend declaration
49433 must be injected in the scope of 'B'. This can also occur in
49434 erroneous cases such as:
49436 struct A {
49437 struct B {
49438 void foo (auto);
49439 };
49440 void B::foo (auto) {}
49441 };
49443 Here the attempted definition of 'B::foo' within 'A' is ill-formed
49444 but, nevertheless, the template parameter list synthesized for the
49445 declarator should be injected into the scope of 'A' as if the
49446 ill-formed template was specified explicitly. */
49449 {
49452 }
49453 }
49459 {
49460 /* Introduce a new template parameter list for implicit template
49461 parameters. */
49465 parser->implicit_template_scope
49472 }
49473 else
49474 {
49475 /* Synthesize implicit template parameters at the end of the explicit
49476 template parameter list. */
49483 parser->implicit_template_parms
49485 }
49486 }
49488 /* Synthesize a new template parameter and track the current template
49489 parameter chain with implicit_template_parms. */
49495 /* Synthesize the type template parameter. */
49503 /* Attach the constraint to the parm before processing. */
49506 tree new_parm
49508 input_location,
49509 node,
49512 // Process_template_parm returns the list of parms, and
49513 // parser->implicit_template_parms holds the final node of the parm
49514 // list. We really want to manipulate the newly appended element.
49521 // Record the last implicit parm node
49524 /* Mark the synthetic declaration "virtual". This is used when
49525 comparing template-heads to determine if whether an abbreviated
49526 function template is equivalent to an explicit template.
49528 Note that DECL_ARTIFICIAL is used elsewhere for template
49529 parameters. */
49535 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
49538 /* If creating a fully implicit function template, start the new implicit
49539 template parameter list with this synthesized type, otherwise grow the
49540 current template parameter list. */
49543 {
49549 }
49550 else
49551 {
49556 }
49558 /* If the new parameter was constrained, we need to add that to the
49559 constraints in the template parameter list. */
49561 {
49565 }
49570 }
49572 /* Finish the declaration of a fully implicit function template. Such a
49573 template has no explicit template parameter list so has not been through the
49574 normal template head and tail processing. synthesize_implicit_template_parm
49575 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
49576 provided if the declaration is a class member such that its template
49577 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
49578 form is returned. Otherwise NULL_TREE is returned. */
49580 static tree
49582 {
49587 {
49591 }
49603 }
49605 /* Like finish_fully_implicit_template, but to be used in error
49606 recovery, rearranging scopes so that we restore the state we had
49607 before synthesize_implicit_template_parm inserted the implement
49608 template parms scope. */
49610 static void
49612 {
49617 {
49626 }
49627 else
49633 }
49635 /* Helper function for diagnostics that have complained about things
49636 being used with 'extern "C"' linkage.
49638 Attempt to issue a note showing where the 'extern "C"' linkage began. */
49640 void
49642 {
49646 }