| blob | b410a6c030f29fda4e672c4ec70a4c83bcbd5e9a |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2019 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_UNIQUE_PTR
49 \f
50 /* The lexer. */
52 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
53 and c-lex.c) and the C++ parser. */
56 {
58 };
60 /* The various kinds of non integral constant we encounter. */
62 NIC_NONE,
63 /* floating-point literal */
64 NIC_FLOAT,
65 /* %<this%> */
66 NIC_THIS,
67 /* %<__FUNCTION__%> */
68 NIC_FUNC_NAME,
69 /* %<__PRETTY_FUNCTION__%> */
70 NIC_PRETTY_FUNC,
71 /* %<__func__%> */
72 NIC_C99_FUNC,
73 /* "%<va_arg%> */
74 NIC_VA_ARG,
75 /* a cast */
76 NIC_CAST,
77 /* %<typeid%> operator */
78 NIC_TYPEID,
79 /* non-constant compound literals */
80 NIC_NCC,
81 /* a function call */
82 NIC_FUNC_CALL,
83 /* an increment */
84 NIC_INC,
85 /* an decrement */
86 NIC_DEC,
87 /* an array reference */
88 NIC_ARRAY_REF,
89 /* %<->%> */
90 NIC_ARROW,
91 /* %<.%> */
92 NIC_POINT,
93 /* the address of a label */
94 NIC_ADDR_LABEL,
95 /* %<*%> */
96 NIC_STAR,
97 /* %<&%> */
98 NIC_ADDR,
99 /* %<++%> */
100 NIC_PREINCREMENT,
101 /* %<--%> */
102 NIC_PREDECREMENT,
103 /* %<new%> */
104 NIC_NEW,
105 /* %<delete%> */
106 NIC_DEL,
107 /* calls to overloaded operators */
108 NIC_OVERLOADED,
109 /* an assignment */
110 NIC_ASSIGNMENT,
111 /* a comma operator */
112 NIC_COMMA,
113 /* a call to a constructor */
114 NIC_CONSTRUCTOR,
115 /* a transaction expression */
116 NIC_TRANSACTION
117 };
119 /* The various kinds of errors about name-lookup failing. */
121 /* NULL */
122 NLE_NULL,
123 /* is not a type */
124 NLE_TYPE,
125 /* is not a class or namespace */
126 NLE_CXX98,
127 /* is not a class, namespace, or enumeration */
128 NLE_NOT_CXX98
129 };
131 /* The various kinds of required token */
133 RT_NONE,
155 /* The type is CPP_KEYWORD */
184 RT_TRANSACTION_CANCEL /* __transaction_cancel */
185 };
187 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
188 reverting it on destruction. */
190 class type_id_in_expr_sentinel
191 {
201 };
203 /* Prototypes. */
209 static void cp_lexer_destroy
211 static int cp_lexer_saving_tokens
215 static void cp_lexer_get_preprocessor_token
223 static bool cp_lexer_next_token_is_not
225 static bool cp_lexer_next_token_is_keyword
229 static void cp_lexer_purge_token
231 static void cp_lexer_purge_tokens_after
233 static void cp_lexer_save_tokens
235 static void cp_lexer_commit_tokens
237 static void cp_lexer_rollback_tokens
239 static void cp_lexer_print_token
243 static void cp_lexer_start_debugging
245 static void cp_lexer_stop_debugging
250 static tree cp_parser_noexcept_specification_opt
252 static tree cp_parser_late_noexcept_specifier
254 static void noexcept_override_late_checks
257 static void cp_parser_initial_pragma
260 static bool cp_parser_omp_declare_reduction_exprs
262 static void cp_finalize_oacc_routine
265 /* Manifest constants. */
266 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
267 #define CP_SAVED_TOKEN_STACK 5
269 /* Variables. */
271 /* The stream to which debugging output should be written. */
274 /* Nonzero if we are parsing an unevaluated operand: an operand to
275 sizeof, typeof, or alignof. */
278 /* Dump up to NUM tokens in BUFFER to FILE starting with token
279 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
280 first token in BUFFER. If NUM is 0, dump all the tokens. If
281 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
282 highlighted by surrounding it in [[ ]]. */
284 static void
288 {
305 {
308 }
313 {
320 nprinted++;
330 {
340 }
341 }
344 {
347 }
350 }
353 /* Dump all tokens in BUFFER to stderr. */
355 void
357 {
359 }
361 DEBUG_FUNCTION void
363 {
365 }
367 DEBUG_FUNCTION void
369 {
372 else
374 }
377 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
378 description for T. */
380 static void
382 {
384 {
387 }
388 }
391 /* Dump parser context C to FILE. */
393 static void
395 {
400 }
403 /* Print the stack of parsing contexts to FILE starting with FIRST. */
405 static void
407 {
413 {
416 }
417 }
420 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
422 static void
424 {
427 }
430 /* Print an unparsed function entry UF to FILE. */
432 static void
434 {
437 tree fn;
442 i++)
443 {
449 }
454 {
457 }
463 {
466 }
468 }
471 /* Print the stack of unparsed member functions S to FILE. */
473 static void
476 {
482 {
485 }
486 }
489 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
490 the given PARSER. If FILE is NULL, the output is printed on stderr. */
492 static void
494 {
506 next_token);
507 }
510 /* Dump debugging information for the given PARSER. If FILE is NULL,
511 the output is printed on stderr. */
513 void
515 {
518 expanded_location eloc;
581 parser->type_definition_forbidden_message_arg
597 }
599 DEBUG_FUNCTION void
601 {
603 }
605 DEBUG_FUNCTION void
607 {
610 else
612 }
614 /* Allocate memory for a new lexer object and return it. */
618 {
623 /* Allocate the memory. */
626 /* Initially we are not debugging. */
631 /* Create the buffer. */
635 }
638 /* Create a new main C++ lexer, the lexer that gets tokens from the
639 preprocessor. */
643 {
645 cp_token token;
647 /* It's possible that parsing the first pragma will load a PCH file,
648 which is a GC collection point. So we have to do that before
649 allocating any memory. */
654 /* Put the first token in the buffer. */
657 /* Get the remaining tokens from the preprocessor. */
659 {
662 }
671 /* Subsequent preprocessor diagnostics should use compiler
672 diagnostic functions to get the compiler source location. */
677 }
679 /* Create a new lexer whose token stream is primed with the tokens in
680 CACHE. When these tokens are exhausted, no new tokens will be read. */
684 {
689 /* We do not own the buffer. */
696 /* Initially we are not debugging. */
701 }
703 /* Frees all resources associated with LEXER. */
705 static void
707 {
711 }
713 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
714 be used. The point of this flag is to help the compiler to fold away calls
715 to cp_lexer_debugging_p within this source file at compile time, when the
716 lexer is not being debugged. */
718 #define LEXER_DEBUGGING_ENABLED_P false
720 /* Returns nonzero if debugging information should be output. */
724 {
729 }
734 {
738 }
742 {
744 }
748 {
750 }
754 {
757 else
759 }
763 {
766 /* Skip past purged tokens. */
768 {
770 tp--;
771 }
774 }
776 /* Overload for make_location, taking the lexer to mean the location of the
777 previous token. */
781 {
784 }
786 /* nonzero if we are presently saving tokens. */
790 {
792 }
794 /* Store the next token from the preprocessor in *TOKEN. Return true
795 if we reach EOF. If LEXER is NULL, assume we are handling an
796 initial #pragma pch_preprocess, and thus want the lexer to return
797 processed strings. */
799 static void
801 {
804 /* Get a new token from the preprocessor. */
805 token->type
812 /* On some systems, some header files are surrounded by an
813 implicit extern "C" block. Set a flag in the token if it
814 comes from such a header. */
819 /* Check to see if this token is a keyword. */
821 {
823 {
824 /* Mark this token as a keyword. */
826 /* Record which keyword. */
828 }
829 else
830 {
834 {
835 /* Warn about the C++0x keyword (but still treat it as
836 an identifier). */
841 /* Clear out the C_RID_CODE so we don't warn about this
842 particular identifier-turned-keyword again. */
844 }
847 }
848 }
850 {
851 /* This only happens in Objective-C++; it must be a keyword. */
854 {
855 /* Replace 'class' with '@class', 'private' with '@private',
856 etc. This prevents confusion with the C++ keyword
857 'class', and makes the tokens consistent with other
858 Objective-C 'AT' keywords. For example '@class' is
859 reported as RID_AT_CLASS which is consistent with
860 '@synchronized', which is reported as
861 RID_AT_SYNCHRONIZED.
862 */
872 }
873 }
874 }
876 /* Update the globals input_location and the input file stack from TOKEN. */
879 {
881 {
883 }
884 }
886 /* Update the globals input_location and the input file stack from LEXER. */
889 {
892 }
894 /* Return a pointer to the next token in the token stream, but do not
895 consume it. */
899 {
901 {
905 }
907 }
909 /* Return true if the next token has the indicated TYPE. */
913 {
915 }
917 /* Return true if the next token does not have the indicated TYPE. */
921 {
923 }
925 /* Return true if the next token is the indicated KEYWORD. */
929 {
931 }
935 {
937 }
941 {
943 }
945 /* Return true if KEYWORD can start a decl-specifier. */
947 bool
949 {
951 {
952 /* auto specifier: storage-class-specifier in C++,
953 simple-type-specifier in C++0x. */
955 /* Storage classes. */
961 /* Elaborated type specifiers. */
967 /* Simple type specifiers. */
982 /* GNU extensions. */
985 /* C++0x extensions. */
997 }
998 }
1000 /* Return true if the next token is a keyword for a decl-specifier. */
1002 static bool
1004 {
1009 }
1011 /* Returns TRUE iff the token T begins a decltype type. */
1013 static bool
1015 {
1018 }
1020 /* Returns TRUE iff the next token begins a decltype type. */
1022 static bool
1024 {
1027 }
1029 /* Called when processing a token with tree_check_value; perform or defer the
1030 associated checks and return the value. */
1032 static tree
1034 {
1035 /* Perform any access checks that were deferred. */
1040 {
1046 }
1047 /* Return the stored value. */
1049 }
1051 /* Return a pointer to the Nth token in the token stream. If N is 1,
1052 then this is precisely equivalent to cp_lexer_peek_token (except
1053 that it is not inline). One would like to disallow that case, but
1054 there is one case (cp_parser_nth_token_starts_template_id) where
1055 the caller passes a variable for N and it might be 1. */
1059 {
1062 /* N is 1-based, not zero-based. */
1073 {
1076 {
1079 }
1083 }
1086 {
1089 }
1092 }
1094 /* Return the next token, and advance the lexer's next_token pointer
1095 to point to the next non-purged token. */
1099 {
1105 do
1106 {
1109 {
1112 }
1114 }
1119 /* Provide debugging output. */
1121 {
1125 }
1128 }
1130 /* Permanently remove the next token from the token stream, and
1131 advance the next_token pointer to refer to the next non-purged
1132 token. */
1134 static void
1136 {
1145 do
1146 {
1147 tok++;
1149 {
1152 }
1153 }
1156 }
1158 /* Permanently remove all tokens after TOK, up to, but not
1159 including, the token that will be returned next by
1160 cp_lexer_peek_token. */
1162 static void
1164 {
1173 {
1178 }
1179 }
1181 /* Begin saving tokens. All tokens consumed after this point will be
1182 preserved. */
1184 static void
1186 {
1187 /* Provide debugging output. */
1192 }
1194 /* Commit to the portion of the token stream most recently saved. */
1196 static void
1198 {
1199 /* Provide debugging output. */
1204 }
1206 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1207 to the token stream. Stop saving tokens. */
1209 static void
1211 {
1212 /* Provide debugging output. */
1217 }
1219 /* RAII wrapper around the above functions, with sanity checking. Creating
1220 a variable saves tokens, which are committed when the variable is
1221 destroyed unless they are explicitly rolled back by calling the rollback
1222 member function. */
1224 struct saved_token_sentinel
1225 {
1230 {
1233 }
1235 {
1238 }
1240 {
1244 }
1245 };
1247 /* Print a representation of the TOKEN on the STREAM. */
1249 static void
1251 {
1252 /* We don't use cpp_type2name here because the parser defines
1253 a few tokens of its own. */
1255 /* cpplib-defined token types */
1256 #define OP(e, s) #e,
1257 #define TK(e, s) #e,
1258 TTYPE_TABLE
1259 #undef OP
1260 #undef TK
1261 /* C++ parser token types - see "Manifest constants", above. */
1265 };
1267 /* For some tokens, print the associated data. */
1269 {
1271 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1272 For example, `struct' is mapped to an INTEGER_CST. */
1275 /* fall through */
1293 /* If we have a name for the token, print it out. Otherwise, we
1294 simply give the numeric code. */
1297 else
1300 }
1301 }
1303 DEBUG_FUNCTION void
1305 {
1308 }
1310 DEBUG_FUNCTION void
1312 {
1315 else
1317 }
1320 /* Start emitting debugging information. */
1322 static void
1324 {
1331 }
1333 /* Stop emitting debugging information. */
1335 static void
1337 {
1344 }
1346 /* Create a new cp_token_cache, representing a range of tokens. */
1350 {
1355 }
1357 /* Diagnose if #pragma omp declare simd isn't followed immediately
1358 by function declaration or definition. */
1362 {
1364 {
1368 }
1369 }
1371 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1372 and put that into "omp declare simd" attribute. */
1376 {
1378 {
1380 {
1383 }
1385 {
1388 }
1389 }
1390 }
1392 /* Diagnose if #pragma acc routine isn't followed immediately by function
1393 declaration or definition. */
1397 {
1399 {
1401 "%<#pragma acc routine%> not immediately followed by "
1404 }
1405 }
1406 \f
1407 /* Decl-specifiers. */
1409 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1411 static void
1413 {
1415 }
1417 /* Declarators. */
1419 /* Nothing other than the parser should be creating declarators;
1420 declarators are a semi-syntactic representation of C++ entities.
1421 Other parts of the front end that need to create entities (like
1422 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1425 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1435 /* An erroneous declarator. */
1438 /* The obstack on which declarators and related data structures are
1439 allocated. */
1442 /* Alloc BYTES from the declarator memory pool. */
1446 {
1448 }
1450 /* Allocate a declarator of the indicated KIND. Clear fields that are
1451 common to all declarators. */
1455 {
1468 }
1470 /* Make a declarator for a generalized identifier. If
1471 QUALIFYING_SCOPE is non-NULL, the identifier is
1472 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1473 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1474 is, if any. */
1479 {
1482 /* It is valid to write:
1484 class C { void f(); };
1485 typedef C D;
1486 void D::f();
1488 The standard is not clear about whether `typedef const C D' is
1489 legal; as of 2002-09-15 the committee is considering that
1490 question. EDG 3.0 allows that syntax. Therefore, we do as
1491 well. */
1506 }
1508 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1509 of modifiers such as const or volatile to apply to the pointer
1510 type, represented as identifiers. ATTRIBUTES represent the attributes that
1511 appertain to the pointer or reference. */
1513 cp_declarator *
1515 tree attributes)
1516 {
1524 {
1528 }
1529 else
1535 }
1537 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1538 represent the attributes that appertain to the pointer or
1539 reference. */
1541 cp_declarator *
1544 {
1552 {
1556 }
1557 else
1563 }
1565 /* Like make_pointer_declarator -- but for a pointer to a non-static
1566 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1567 appertain to the pointer or reference. */
1569 cp_declarator *
1572 tree attributes)
1573 {
1582 {
1585 }
1586 else
1592 }
1594 /* Make a declarator for the function given by TARGET, with the
1595 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1596 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1597 indicates what exceptions can be thrown. */
1599 cp_declarator *
1601 tree parms,
1602 cp_cv_quals cv_qualifiers,
1603 cp_virt_specifiers virt_specifiers,
1604 cp_ref_qualifier ref_qualifier,
1605 tree tx_qualifier,
1606 tree exception_specification,
1607 tree late_return_type,
1608 tree requires_clause)
1609 {
1623 {
1627 }
1628 else
1632 }
1634 /* Make a declarator for an array of BOUNDS elements, each of which is
1635 defined by ELEMENT. */
1637 cp_declarator *
1639 {
1646 {
1650 }
1651 else
1655 }
1657 /* Determine whether the declarator we've seen so far can be a
1658 parameter pack, when followed by an ellipsis. */
1659 static bool
1661 {
1663 /* We already saw an ellipsis. */
1666 /* Search for a declarator name, or any other declarator that goes
1667 after the point where the ellipsis could appear in a parameter
1668 pack. If we find any of these, then this declarator cannot be
1669 made into a parameter pack. */
1672 {
1674 {
1687 }
1688 }
1691 }
1695 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1696 DECLARATOR and DEFAULT_ARGUMENT. */
1698 cp_parameter_declarator *
1701 tree default_argument,
1702 location_t loc,
1704 {
1712 else
1720 }
1722 /* Returns true iff DECLARATOR is a declaration for a function. */
1724 static bool
1726 {
1728 {
1737 }
1739 }
1741 /* The parser. */
1743 /* Overview
1744 --------
1746 A cp_parser parses the token stream as specified by the C++
1747 grammar. Its job is purely parsing, not semantic analysis. For
1748 example, the parser breaks the token stream into declarators,
1749 expressions, statements, and other similar syntactic constructs.
1750 It does not check that the types of the expressions on either side
1751 of an assignment-statement are compatible, or that a function is
1752 not declared with a parameter of type `void'.
1754 The parser invokes routines elsewhere in the compiler to perform
1755 semantic analysis and to build up the abstract syntax tree for the
1756 code processed.
1758 The parser (and the template instantiation code, which is, in a
1759 way, a close relative of parsing) are the only parts of the
1760 compiler that should be calling push_scope and pop_scope, or
1761 related functions. The parser (and template instantiation code)
1762 keeps track of what scope is presently active; everything else
1763 should simply honor that. (The code that generates static
1764 initializers may also need to set the scope, in order to check
1765 access control correctly when emitting the initializers.)
1767 Methodology
1768 -----------
1770 The parser is of the standard recursive-descent variety. Upcoming
1771 tokens in the token stream are examined in order to determine which
1772 production to use when parsing a non-terminal. Some C++ constructs
1773 require arbitrary look ahead to disambiguate. For example, it is
1774 impossible, in the general case, to tell whether a statement is an
1775 expression or declaration without scanning the entire statement.
1776 Therefore, the parser is capable of "parsing tentatively." When the
1777 parser is not sure what construct comes next, it enters this mode.
1778 Then, while we attempt to parse the construct, the parser queues up
1779 error messages, rather than issuing them immediately, and saves the
1780 tokens it consumes. If the construct is parsed successfully, the
1781 parser "commits", i.e., it issues any queued error messages and
1782 the tokens that were being preserved are permanently discarded.
1783 If, however, the construct is not parsed successfully, the parser
1784 rolls back its state completely so that it can resume parsing using
1785 a different alternative.
1787 Future Improvements
1788 -------------------
1790 The performance of the parser could probably be improved substantially.
1791 We could often eliminate the need to parse tentatively by looking ahead
1792 a little bit. In some places, this approach might not entirely eliminate
1793 the need to parse tentatively, but it might still speed up the average
1794 case. */
1796 /* Flags that are passed to some parsing functions. These values can
1797 be bitwise-ored together. */
1799 enum
1800 {
1801 /* No flags. */
1803 /* The construct is optional. If it is not present, then no error
1804 should be issued. */
1806 /* When parsing a type-specifier, treat user-defined type-names
1807 as non-type identifiers. */
1809 /* When parsing a type-specifier, do not try to parse a class-specifier
1810 or enum-specifier. */
1812 /* When parsing a decl-specifier-seq, only allow type-specifier or
1813 constexpr. */
1815 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1817 /* When parsing a decl-specifier-seq, allow missing typename. */
1819 };
1821 /* This type is used for parameters and variables which hold
1822 combinations of the above flags. */
1825 /* The different kinds of declarators we want to parse. */
1827 enum cp_parser_declarator_kind
1828 {
1829 /* We want an abstract declarator. */
1830 CP_PARSER_DECLARATOR_ABSTRACT,
1831 /* We want a named declarator. */
1832 CP_PARSER_DECLARATOR_NAMED,
1833 /* We don't mind, but the name must be an unqualified-id. */
1834 CP_PARSER_DECLARATOR_EITHER
1835 };
1837 /* The precedence values used to parse binary expressions. The minimum value
1838 of PREC must be 1, because zero is reserved to quickly discriminate
1839 binary operators from other tokens. */
1841 enum cp_parser_prec
1842 {
1843 PREC_NOT_OPERATOR,
1844 PREC_LOGICAL_OR_EXPRESSION,
1845 PREC_LOGICAL_AND_EXPRESSION,
1846 PREC_INCLUSIVE_OR_EXPRESSION,
1847 PREC_EXCLUSIVE_OR_EXPRESSION,
1848 PREC_AND_EXPRESSION,
1849 PREC_EQUALITY_EXPRESSION,
1850 PREC_RELATIONAL_EXPRESSION,
1851 PREC_SHIFT_EXPRESSION,
1852 PREC_ADDITIVE_EXPRESSION,
1853 PREC_MULTIPLICATIVE_EXPRESSION,
1854 PREC_PM_EXPRESSION,
1855 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1856 };
1858 /* A mapping from a token type to a corresponding tree node type, with a
1859 precedence value. */
1861 struct cp_parser_binary_operations_map_node
1862 {
1863 /* The token type. */
1865 /* The corresponding tree code. */
1867 /* The precedence of this operator. */
1869 };
1871 struct cp_parser_expression_stack_entry
1872 {
1873 /* Left hand side of the binary operation we are currently
1874 parsing. */
1875 cp_expr lhs;
1876 /* Original tree code for left hand side, if it was a binary
1877 expression itself (used for -Wparentheses). */
1879 /* Tree code for the binary operation we are parsing. */
1881 /* Precedence of the binary operation we are parsing. */
1883 /* Location of the binary operation we are parsing. */
1884 location_t loc;
1885 };
1887 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1888 entries because precedence levels on the stack are monotonically
1889 increasing. */
1893 /* Prototypes. */
1895 /* Constructors and destructors. */
1900 /* Class variables. */
1904 /* The operator-precedence table used by cp_parser_binary_expression.
1905 Transformed into an associative array (binops_by_token) by
1906 cp_parser_new. */
1939 };
1941 /* The same as binops, but initialized by cp_parser_new so that
1942 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1943 for speed. */
1946 /* Constructors and destructors. */
1948 /* Construct a new context. The context below this one on the stack
1949 is given by NEXT. */
1953 {
1956 /* Allocate the storage. */
1958 {
1959 /* Pull the first entry from the free list. */
1963 }
1964 else
1967 /* No errors have occurred yet in this context. */
1969 /* If this is not the bottommost context, copy information that we
1970 need from the previous context. */
1972 {
1973 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1974 expression, then we are parsing one in this context, too. */
1976 /* Thread the stack. */
1978 }
1981 }
1983 /* Managing the unparsed function queues. */
1985 #define unparsed_funs_with_default_args \
1986 parser->unparsed_queues->last ().funs_with_default_args
1987 #define unparsed_funs_with_definitions \
1988 parser->unparsed_queues->last ().funs_with_definitions
1989 #define unparsed_nsdmis \
1990 parser->unparsed_queues->last ().nsdmis
1991 #define unparsed_classes \
1992 parser->unparsed_queues->last ().classes
1993 #define unparsed_noexcepts \
1994 parser->unparsed_queues->last ().noexcepts
1996 static void
1998 {
2000 NULL };
2002 }
2004 static void
2006 {
2009 }
2011 /* Prototypes. */
2013 /* Constructors and destructors. */
2018 /* Routines to parse various constructs.
2020 Those that return `tree' will return the error_mark_node (rather
2021 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2022 Sometimes, they will return an ordinary node if error-recovery was
2023 attempted, even though a parse error occurred. So, to check
2024 whether or not a parse error occurred, you should always use
2025 cp_parser_error_occurred. If the construct is optional (indicated
2026 either by an `_opt' in the name of the function that does the
2027 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2028 the construct is not present. */
2030 /* Lexical conventions [gram.lex] */
2032 static cp_expr cp_parser_identifier
2034 static cp_expr cp_parser_string_literal
2036 static cp_expr cp_parser_userdef_char_literal
2038 static tree cp_parser_userdef_string_literal
2040 static cp_expr cp_parser_userdef_numeric_literal
2043 /* Basic concepts [gram.basic] */
2047 /* Expressions [gram.expr] */
2049 static cp_expr cp_parser_primary_expression
2051 static cp_expr cp_parser_id_expression
2053 static cp_expr cp_parser_unqualified_id
2055 static tree cp_parser_nested_name_specifier_opt
2057 static tree cp_parser_nested_name_specifier
2059 static tree cp_parser_qualifying_entity
2061 static cp_expr cp_parser_postfix_expression
2063 static tree cp_parser_postfix_open_square_expression
2065 static tree cp_parser_postfix_dot_deref_expression
2070 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2072 static void cp_parser_pseudo_destructor_name
2074 static cp_expr cp_parser_unary_expression
2076 static enum tree_code cp_parser_unary_operator
2078 static tree cp_parser_has_attribute_expression
2080 static tree cp_parser_new_expression
2084 static tree cp_parser_new_type_id
2092 static tree cp_parser_delete_expression
2094 static cp_expr cp_parser_cast_expression
2096 static cp_expr cp_parser_binary_expression
2098 static tree cp_parser_question_colon_clause
2100 static cp_expr cp_parser_assignment_expression
2102 static enum tree_code cp_parser_assignment_operator_opt
2104 static cp_expr cp_parser_expression
2106 static cp_expr cp_parser_constant_expression
2108 static cp_expr cp_parser_builtin_offsetof
2110 static cp_expr cp_parser_lambda_expression
2112 static void cp_parser_lambda_introducer
2114 static bool cp_parser_lambda_declarator_opt
2116 static void cp_parser_lambda_body
2119 /* Statements [gram.stmt.stmt] */
2121 static void cp_parser_statement
2123 static void cp_parser_label_for_labeled_statement
2125 static tree cp_parser_expression_statement
2127 static tree cp_parser_compound_statement
2129 static void cp_parser_statement_seq_opt
2131 static tree cp_parser_selection_statement
2133 static tree cp_parser_condition
2135 static tree cp_parser_iteration_statement
2137 static bool cp_parser_init_statement
2139 static tree cp_parser_for
2141 static tree cp_parser_c_for
2143 static tree cp_parser_range_for
2145 static void do_range_for_auto_deduction
2147 static tree cp_parser_perform_range_for_lookup
2149 static tree cp_parser_range_for_member_function
2151 static tree cp_parser_jump_statement
2153 static void cp_parser_declaration_statement
2156 static tree cp_parser_implicitly_scoped_statement
2158 static void cp_parser_already_scoped_statement
2161 /* Declarations [gram.dcl.dcl] */
2163 static void cp_parser_declaration_seq_opt
2165 static void cp_parser_declaration
2167 static void cp_parser_toplevel_declaration
2169 static void cp_parser_block_declaration
2171 static void cp_parser_simple_declaration
2173 static void cp_parser_decl_specifier_seq
2175 static tree cp_parser_storage_class_specifier_opt
2177 static tree cp_parser_function_specifier_opt
2179 static tree cp_parser_type_specifier
2182 static tree cp_parser_simple_type_specifier
2184 static tree cp_parser_type_name
2186 static tree cp_parser_nonclass_name
2188 static tree cp_parser_elaborated_type_specifier
2190 static tree cp_parser_enum_specifier
2192 static void cp_parser_enumerator_list
2194 static void cp_parser_enumerator_definition
2196 static tree cp_parser_namespace_name
2198 static void cp_parser_namespace_definition
2200 static void cp_parser_namespace_body
2202 static tree cp_parser_qualified_namespace_specifier
2204 static void cp_parser_namespace_alias_definition
2206 static bool cp_parser_using_declaration
2208 static void cp_parser_using_directive
2210 static tree cp_parser_alias_declaration
2212 static void cp_parser_asm_definition
2214 static void cp_parser_linkage_specification
2216 static void cp_parser_static_assert
2218 static tree cp_parser_decltype
2220 static tree cp_parser_decomposition_declaration
2223 /* Declarators [gram.dcl.decl] */
2225 static tree cp_parser_init_declarator
2235 static enum tree_code cp_parser_ptr_operator
2237 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2239 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2241 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2243 static tree cp_parser_tx_qualifier_opt
2245 static tree cp_parser_late_return_type_opt
2247 static tree cp_parser_declarator_id
2249 static tree cp_parser_type_id
2251 static tree cp_parser_template_type_arg
2254 static tree cp_parser_type_id_1
2256 static void cp_parser_type_specifier_seq
2258 static tree cp_parser_parameter_declaration_clause
2260 static tree cp_parser_parameter_declaration_list
2264 static tree cp_parser_default_argument
2266 static void cp_parser_function_body
2268 static tree cp_parser_initializer
2270 static cp_expr cp_parser_initializer_clause
2272 static cp_expr cp_parser_braced_list
2277 static void cp_parser_ctor_initializer_opt_and_function_body
2280 static tree cp_parser_late_parsing_omp_declare_simd
2283 static tree cp_parser_late_parsing_oacc_routine
2286 static tree synthesize_implicit_template_parm
2288 static tree finish_fully_implicit_template
2290 static void abort_fully_implicit_template
2293 /* Classes [gram.class] */
2295 static tree cp_parser_class_name
2297 static tree cp_parser_class_specifier
2299 static tree cp_parser_class_head
2301 static enum tag_types cp_parser_class_key
2303 static void cp_parser_type_parameter_key
2305 static void cp_parser_member_specification_opt
2307 static void cp_parser_member_declaration
2309 static tree cp_parser_pure_specifier
2311 static tree cp_parser_constant_initializer
2314 /* Derived classes [gram.class.derived] */
2316 static tree cp_parser_base_clause
2318 static tree cp_parser_base_specifier
2321 /* Special member functions [gram.special] */
2323 static tree cp_parser_conversion_function_id
2325 static tree cp_parser_conversion_type_id
2329 static void cp_parser_ctor_initializer_opt
2331 static void cp_parser_mem_initializer_list
2333 static tree cp_parser_mem_initializer
2335 static tree cp_parser_mem_initializer_id
2338 /* Overloading [gram.over] */
2340 static cp_expr cp_parser_operator_function_id
2342 static cp_expr cp_parser_operator
2345 /* Templates [gram.temp] */
2347 static void cp_parser_template_declaration
2349 static tree cp_parser_template_parameter_list
2351 static tree cp_parser_template_parameter
2353 static tree cp_parser_type_parameter
2355 static tree cp_parser_template_id
2357 static tree cp_parser_template_name
2359 static tree cp_parser_template_argument_list
2361 static tree cp_parser_template_argument
2363 static void cp_parser_explicit_instantiation
2365 static void cp_parser_explicit_specialization
2368 /* Exception handling [gram.exception] */
2370 static tree cp_parser_try_block
2372 static void cp_parser_function_try_block
2374 static void cp_parser_handler_seq
2376 static void cp_parser_handler
2378 static tree cp_parser_exception_declaration
2380 static tree cp_parser_throw_expression
2382 static tree cp_parser_exception_specification_opt
2384 static tree cp_parser_type_id_list
2387 /* GNU Extensions */
2389 static tree cp_parser_asm_specification_opt
2391 static tree cp_parser_asm_operand_list
2393 static tree cp_parser_asm_clobber_list
2395 static tree cp_parser_asm_label_list
2397 static bool cp_next_tokens_can_be_attribute_p
2399 static bool cp_next_tokens_can_be_gnu_attribute_p
2401 static bool cp_next_tokens_can_be_std_attribute_p
2403 static bool cp_nth_tokens_can_be_std_attribute_p
2405 static bool cp_nth_tokens_can_be_gnu_attribute_p
2407 static bool cp_nth_tokens_can_be_attribute_p
2409 static tree cp_parser_attributes_opt
2411 static tree cp_parser_gnu_attributes_opt
2413 static tree cp_parser_gnu_attribute_list
2415 static tree cp_parser_std_attribute
2417 static tree cp_parser_std_attribute_spec
2419 static tree cp_parser_std_attribute_spec_seq
2421 static size_t cp_parser_skip_attributes_opt
2423 static bool cp_parser_extension_opt
2425 static void cp_parser_label_declaration
2428 /* Concept Extensions */
2430 static tree cp_parser_requires_clause
2432 static tree cp_parser_requires_clause_opt
2434 static tree cp_parser_requires_expression
2436 static tree cp_parser_requirement_parameter_list
2438 static tree cp_parser_requirement_body
2440 static tree cp_parser_requirement_list
2442 static tree cp_parser_requirement
2444 static tree cp_parser_simple_requirement
2446 static tree cp_parser_compound_requirement
2448 static tree cp_parser_type_requirement
2450 static tree cp_parser_nested_requirement
2453 /* Transactional Memory Extensions */
2455 static tree cp_parser_transaction
2457 static tree cp_parser_transaction_expression
2459 static void cp_parser_function_transaction
2461 static tree cp_parser_transaction_cancel
2465 pragma_external,
2466 pragma_member,
2467 pragma_objc_icode,
2468 pragma_stmt,
2469 pragma_compound
2470 };
2471 static bool cp_parser_pragma
2474 /* Objective-C++ Productions */
2476 static tree cp_parser_objc_message_receiver
2478 static tree cp_parser_objc_message_args
2480 static tree cp_parser_objc_message_expression
2482 static cp_expr cp_parser_objc_encode_expression
2484 static tree cp_parser_objc_defs_expression
2486 static tree cp_parser_objc_protocol_expression
2488 static tree cp_parser_objc_selector_expression
2490 static cp_expr cp_parser_objc_expression
2492 static bool cp_parser_objc_selector_p
2494 static tree cp_parser_objc_selector
2496 static tree cp_parser_objc_protocol_refs_opt
2498 static void cp_parser_objc_declaration
2500 static tree cp_parser_objc_statement
2502 static bool cp_parser_objc_valid_prefix_attributes
2504 static void cp_parser_objc_at_property_declaration
2506 static void cp_parser_objc_at_synthesize_declaration
2508 static void cp_parser_objc_at_dynamic_declaration
2510 static tree cp_parser_objc_struct_declaration
2513 /* Utility Routines */
2515 static cp_expr cp_parser_lookup_name
2517 static tree cp_parser_lookup_name_simple
2519 static tree cp_parser_maybe_treat_template_as_class
2521 static bool cp_parser_check_declarator_template_parameters
2523 static bool cp_parser_check_template_parameters
2525 static cp_expr cp_parser_simple_cast_expression
2527 static tree cp_parser_global_scope_opt
2529 static bool cp_parser_constructor_declarator_p
2531 static tree cp_parser_function_definition_from_specifiers_and_declarator
2533 static tree cp_parser_function_definition_after_declarator
2535 static bool cp_parser_template_declaration_after_export
2537 static void cp_parser_perform_template_parameter_access_checks
2539 static tree cp_parser_single_declaration
2541 static cp_expr cp_parser_functional_cast
2543 static tree cp_parser_save_member_function_body
2545 static tree cp_parser_save_nsdmi
2547 static tree cp_parser_enclosed_template_argument_list
2549 static void cp_parser_save_default_args
2551 static void cp_parser_late_parsing_for_member
2553 static tree cp_parser_late_parse_one_default_arg
2555 static void cp_parser_late_parsing_nsdmi
2557 static void cp_parser_late_parsing_default_args
2559 static tree cp_parser_sizeof_operand
2561 static cp_expr cp_parser_trait_expr
2563 static bool cp_parser_declares_only_class_p
2565 static void cp_parser_set_storage_class
2567 static void cp_parser_set_decl_spec_type
2569 static void set_and_check_decl_spec_loc
2572 static bool cp_parser_friend_p
2574 static void cp_parser_required_error
2580 static bool cp_parser_token_starts_function_definition_p
2582 static bool cp_parser_next_token_starts_class_definition_p
2584 static bool cp_parser_next_token_ends_template_argument_p
2586 static bool cp_parser_nth_token_starts_template_argument_list_p
2588 static enum tag_types cp_parser_token_is_class_key
2590 static enum tag_types cp_parser_token_is_type_parameter_key
2592 static void cp_parser_check_class_key
2594 static void cp_parser_check_access_in_redeclaration
2596 static bool cp_parser_optional_template_keyword
2598 static void cp_parser_pre_parsed_nested_name_specifier
2600 static bool cp_parser_cache_group
2602 static tree cp_parser_cache_defarg
2604 static void cp_parser_parse_tentatively
2606 static void cp_parser_commit_to_tentative_parse
2608 static void cp_parser_commit_to_topmost_tentative_parse
2610 static void cp_parser_abort_tentative_parse
2612 static bool cp_parser_parse_definitely
2616 static bool cp_parser_uncommitted_to_tentative_parse_p
2618 static void cp_parser_error
2620 static void cp_parser_name_lookup_error
2622 static bool cp_parser_simulate_error
2624 static bool cp_parser_check_type_definition
2626 static void cp_parser_check_for_definition_in_return_type
2628 static void cp_parser_check_for_invalid_template_id
2630 static bool cp_parser_non_integral_constant_expression
2632 static void cp_parser_diagnose_invalid_type_name
2634 static bool cp_parser_parse_and_diagnose_invalid_type_name
2636 static int cp_parser_skip_to_closing_parenthesis
2638 static void cp_parser_skip_to_end_of_statement
2640 static void cp_parser_consume_semicolon_at_end_of_statement
2642 static void cp_parser_skip_to_end_of_block_or_statement
2644 static bool cp_parser_skip_to_closing_brace
2646 static void cp_parser_skip_to_end_of_template_parameter_list
2648 static void cp_parser_skip_to_pragma_eol
2650 static bool cp_parser_error_occurred
2652 static bool cp_parser_allow_gnu_extensions_p
2654 static bool cp_parser_is_pure_string_literal
2656 static bool cp_parser_is_string_literal
2658 static bool cp_parser_is_keyword
2660 static tree cp_parser_make_typename_type
2664 static bool cp_parser_compound_literal_p
2666 static bool cp_parser_array_designator_p
2668 static bool cp_parser_init_statement_p
2670 static bool cp_parser_skip_to_closing_square_bracket
2673 /* Concept-related syntactic transformations */
2678 // -------------------------------------------------------------------------- //
2679 // Unevaluated Operand Guard
2680 //
2681 // Implementation of an RAII helper for unevaluated operand parsing.
2683 {
2686 }
2689 {
2692 }
2694 // -------------------------------------------------------------------------- //
2695 // Tentative Parsing
2697 /* Returns nonzero if we are parsing tentatively. */
2701 {
2703 }
2705 /* Returns nonzero if TOKEN is a string literal. */
2707 static bool
2709 {
2715 }
2717 /* Returns nonzero if TOKEN is a string literal
2718 of a user-defined string literal. */
2720 static bool
2722 {
2729 }
2731 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2733 static bool
2735 {
2737 }
2739 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2740 PRAGMA_NONE. */
2742 static enum pragma_kind
2744 {
2747 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2749 }
2751 /* Helper function for cp_parser_error.
2752 Having peeked a token of kind TOK1_KIND that might signify
2753 a conflict marker, peek successor tokens to determine
2754 if we actually do have a conflict marker.
2755 Specifically, we consider a run of 7 '<', '=' or '>' characters
2756 at the start of a line as a conflict marker.
2757 These come through the lexer as three pairs and a single,
2758 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2759 If it returns true, *OUT_LOC is written to with the location/range
2760 of the marker. */
2762 static bool
2765 {
2776 /* It must be at the start of the line. */
2781 /* We have a conflict marker. Construct a location of the form:
2782 <<<<<<<
2783 ^~~~~~~
2784 with start == caret, finishing at the end of the marker. */
2789 }
2791 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2792 RT_CLOSE_PAREN. */
2796 {
2798 {
2806 }
2807 }
2809 /* Attempt to convert TOKEN_DESC from a required_token to an
2810 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2812 static enum cpp_ttype
2814 {
2816 {
2837 /* Use CPP_EOF as a "no completions possible" code. */
2839 }
2840 }
2843 /* Subroutine of cp_parser_error and cp_parser_required_error.
2845 Issue a diagnostic of the form
2846 FILE:LINE: MESSAGE before TOKEN
2847 where TOKEN is the next token in the input stream. MESSAGE
2848 (specified by the caller) is usually of the form "expected
2849 OTHER-TOKEN".
2851 This bypasses the check for tentative passing, and potentially
2852 adds material needed by cp_parser_required_error.
2854 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2855 suggesting insertion of the missing token.
2857 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2858 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2859 location. */
2861 static void
2863 required_token missing_token_desc,
2864 location_t matching_location)
2865 {
2867 /* This diagnostic makes more sense if it is tagged to the line
2868 of the token we just peeked at. */
2872 {
2877 }
2879 /* If this is actually a conflict marker, report it as such. */
2883 {
2884 location_t loc;
2886 {
2889 /* Consume tokens until the end of the source line. */
2891 {
2901 }
2903 }
2904 }
2911 {
2912 /* Potentially supply a fix-it hint, suggesting to add the
2913 missing token immediately after the *previous* token.
2914 This may move the primary location within richloc. */
2916 location_t prev_token_loc
2920 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2921 Attempt to consolidate diagnostics by printing it as a
2922 secondary range within the main diagnostic. */
2924 added_matching_location
2926 }
2928 /* Actually emit the error. */
2930 /* Because c_parser_error does not understand
2931 CPP_KEYWORD, keywords are treated like
2932 identifiers. */
2937 {
2938 /* If we weren't able to consolidate matching_location, then
2939 print it as a secondary diagnostic. */
2944 }
2945 }
2947 /* If not parsing tentatively, issue a diagnostic of the form
2948 FILE:LINE: MESSAGE before TOKEN
2949 where TOKEN is the next token in the input stream. MESSAGE
2950 (specified by the caller) is usually of the form "expected
2951 OTHER-TOKEN". */
2953 static void
2955 {
2958 }
2960 /* Issue an error about name-lookup failing. NAME is the
2961 IDENTIFIER_NODE DECL is the result of
2962 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2963 the thing that we hoped to find. */
2965 static void
2967 tree name,
2968 tree decl,
2969 name_lookup_error desired,
2970 location_t location)
2971 {
2972 /* If name lookup completely failed, tell the user that NAME was not
2973 declared. */
2975 {
2988 else
2990 }
2992 {
2994 {
3011 }
3012 }
3014 {
3016 {
3026 name);
3030 }
3031 }
3032 else
3033 {
3035 {
3048 }
3049 }
3050 }
3052 /* If we are parsing tentatively, remember that an error has occurred
3053 during this tentative parse. Returns true if the error was
3054 simulated; false if a message should be issued by the caller. */
3056 static bool
3058 {
3060 {
3063 }
3065 }
3067 /* This function is called when a type is defined. If type
3068 definitions are forbidden at this point, an error message is
3069 issued. */
3071 static bool
3073 {
3074 /* If types are forbidden here, issue a message. */
3076 {
3077 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3078 or %qs in the message need to be interpreted. */
3082 }
3084 }
3086 /* This function is called when the DECLARATOR is processed. The TYPE
3087 was a type defined in the decl-specifiers. If it is invalid to
3088 define a type in the decl-specifiers for DECLARATOR, an error is
3089 issued. TYPE_LOCATION is the location of TYPE and is used
3090 for error reporting. */
3092 static void
3095 {
3096 /* [dcl.fct] forbids type definitions in return types.
3097 Unfortunately, it's not easy to know whether or not we are
3098 processing a return type until after the fact. */
3106 {
3111 type);
3112 }
3113 }
3115 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3116 "<" in any valid C++ program. If the next token is indeed "<",
3117 issue a message warning the user about what appears to be an
3118 invalid attempt to form a template-id. LOCATION is the location
3119 of the type-specifier (TYPE) */
3121 static void
3123 tree type,
3125 location_t location)
3126 {
3130 {
3136 {
3139 else
3141 }
3142 else
3144 /* Remember the location of the invalid "<". */
3147 /* Consume the "<". */
3149 /* Parse the template arguments. */
3151 /* Permanently remove the invalid template arguments so that
3152 this error message is not issued again. */
3155 }
3156 }
3158 /* If parsing an integral constant-expression, issue an error message
3159 about the fact that THING appeared and return true. Otherwise,
3160 return false. In either case, set
3161 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3163 static bool
3165 non_integral_constant thing)
3166 {
3169 {
3171 {
3174 {
3177 "ISO C++ forbids using a floating-point literal "
3182 "enumeration type cannot appear in a "
3273 }
3277 }
3278 }
3280 }
3282 /* Emit a diagnostic for an invalid type name. This function commits
3283 to the current active tentative parse, if any. (Otherwise, the
3284 problematic construct might be encountered again later, resulting
3285 in duplicate error messages.) LOCATION is the location of ID. */
3287 static void
3289 location_t location)
3290 {
3293 /* Try to lookup the identifier. */
3300 /* If the lookup was ambiguous, an error will already have
3301 been issued. */
3303 /* If the lookup found a template-name, it means that the user forgot
3304 to specify an argument list. Emit a useful error message. */
3306 {
3307 auto_diagnostic_group d;
3310 decl);
3315 }
3319 /* Something like 'unsigned A a;' */
3322 {
3323 /* Issue an error message. */
3324 auto_diagnostic_group d;
3325 name_hint hint;
3329 {
3335 }
3336 else
3338 /* If we're in a template class, it's possible that the user was
3339 referring to a type from a base class. For example:
3341 template <typename T> struct A { typedef T X; };
3342 template <typename T> struct B : public A<T> { X x; };
3344 The user should have said "typename A<T>::X". */
3360 {
3361 tree b;
3364 b;
3366 {
3370 {
3371 tree field;
3372 /* Go from a particular instantiation of the
3373 template (which will have an empty TYPE_FIELDs),
3374 to the main version. */
3377 field;
3381 {
3386 }
3389 }
3390 }
3391 }
3392 }
3393 /* Here we diagnose qualified-ids where the scope is actually correct,
3394 but the identifier does not resolve to a valid type name. */
3396 {
3398 {
3399 auto_diagnostic_group d;
3400 name_hint hint;
3409 {
3412 "%qE in namespace %qE does not name a template"
3415 else
3419 }
3421 {
3424 "%qE in namespace %qE does not name a template"
3427 else
3429 "%qE in namespace %qE does not name a template"
3432 }
3433 else
3434 {
3437 "%qE in namespace %qE does not name a type"
3440 else
3444 }
3447 }
3450 {
3451 /* A<T>::A<T>() */
3452 auto_diagnostic_group d;
3458 }
3461 {
3466 "need %<typename%> before %<%T::%D::%E%> because "
3470 id,
3473 else
3477 }
3479 {
3480 auto_diagnostic_group d;
3492 else
3498 }
3499 else
3501 }
3502 }
3504 /* Check for a common situation where a type-name should be present,
3505 but is not, and issue a sensible error message. Returns true if an
3506 invalid type-name was detected.
3508 The situation handled by this function are variable declarations of the
3509 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3510 Usually, `ID' should name a type, but if we got here it means that it
3511 does not. We try to emit the best possible error message depending on
3512 how exactly the id-expression looks like. */
3514 static bool
3516 {
3517 tree id;
3520 /* Avoid duplicate error about ambiguous lookup. */
3522 {
3526 }
3535 /* If the next token is a (, this is a function with no explicit return
3536 type, i.e. constructor, destructor or conversion op. */
3539 {
3542 }
3546 /* Emit a diagnostic for the invalid type. */
3548 out:
3549 /* If we aren't in the middle of a declarator (i.e. in a
3550 parameter-declaration-clause), skip to the end of the declaration;
3551 there's no point in trying to process it. */
3555 }
3557 /* Consume tokens up to, and including, the next non-nested closing `)'.
3558 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3559 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3560 found an unnested token of that type. */
3562 static int
3565 cpp_ttype or_ttype,
3567 {
3578 {
3581 /* Have we found what we're looking for before the closing paren? */
3587 {
3591 /* FALLTHRU */
3593 /* If we've run out of tokens, then there is no closing `)'. */
3596 /* This is good for lambda expression capture-lists. */
3606 /* This matches the processing in skip_to_end_of_statement. */
3626 {
3630 }
3640 condop_depth--;
3645 }
3647 /* Consume the token. */
3649 }
3650 }
3652 /* Consume tokens up to, and including, the next non-nested closing `)'.
3653 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3654 are doing error recovery. Returns -1 if OR_COMMA is true and we
3655 found an unnested token of that type. */
3657 static int
3662 {
3666 }
3668 /* Consume tokens until we reach the end of the current statement.
3669 Normally, that will be just before consuming a `;'. However, if a
3670 non-nested `}' comes first, then we stop before consuming that. */
3672 static void
3674 {
3677 /* Unwind generic function template scope if necessary. */
3682 {
3686 {
3690 /* FALLTHRU */
3692 /* If we've run out of tokens, stop. */
3696 /* If the next token is a `;', we have reached the end of the
3697 statement. */
3703 /* If this is a non-nested '}', stop before consuming it.
3704 That way, when confronted with something like:
3706 { 3 + }
3708 we stop before consuming the closing '}', even though we
3709 have not yet reached a `;'. */
3713 /* If it is the closing '}' for a block that we have
3714 scanned, stop -- but only after consuming the token.
3715 That way given:
3717 void f g () { ... }
3718 typedef int I;
3720 we will stop after the body of the erroneously declared
3721 function, but before consuming the following `typedef'
3722 declaration. */
3724 {
3727 }
3736 }
3738 /* Consume the token. */
3740 }
3741 }
3743 /* This function is called at the end of a statement or declaration.
3744 If the next token is a semicolon, it is consumed; otherwise, error
3745 recovery is attempted. */
3747 static void
3749 {
3750 /* Look for the trailing `;'. */
3752 {
3753 /* If there is additional (erroneous) input, skip to the end of
3754 the statement. */
3756 /* If the next token is now a `;', consume it. */
3759 }
3760 }
3762 /* Skip tokens until we have consumed an entire block, or until we
3763 have consumed a non-nested `;'. */
3765 static void
3767 {
3770 /* Unwind generic function template scope if necessary. */
3775 {
3779 {
3783 /* FALLTHRU */
3785 /* If we've run out of tokens, stop. */
3789 /* Stop if this is an unnested ';'. */
3795 /* Stop if this is an unnested '}', or closes the outermost
3796 nesting level. */
3797 nesting_depth--;
3805 /* Nest. */
3806 nesting_depth++;
3811 }
3813 /* Consume the token. */
3815 }
3816 }
3818 /* Skip tokens until a non-nested closing curly brace is the next
3819 token, or there are no more tokens. Return true in the first case,
3820 false otherwise. */
3822 static bool
3824 {
3828 {
3832 {
3836 /* FALLTHRU */
3838 /* If we've run out of tokens, stop. */
3842 /* If the next token is a non-nested `}', then we have reached
3843 the end of the current block. */
3849 /* If it the next token is a `{', then we are entering a new
3850 block. Consume the entire block. */
3856 }
3858 /* Consume the token. */
3860 }
3861 }
3863 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3864 parameter is the PRAGMA token, allowing us to purge the entire pragma
3865 sequence. */
3867 static void
3869 {
3874 do
3878 /* Ensure that the pragma is not parsed again. */
3880 }
3882 /* Require pragma end of line, resyncing with it as necessary. The
3883 arguments are as for cp_parser_skip_to_pragma_eol. */
3885 static void
3887 {
3891 }
3893 /* This is a simple wrapper around make_typename_type. When the id is
3894 an unresolved identifier node, we can provide a superior diagnostic
3895 using cp_parser_diagnose_invalid_type_name. */
3897 static tree
3899 location_t id_location)
3900 {
3901 tree result;
3903 {
3909 }
3911 }
3913 /* This is a wrapper around the
3914 make_{pointer,ptrmem,reference}_declarator functions that decides
3915 which one to call based on the CODE and CLASS_TYPE arguments. The
3916 CODE argument should be one of the values returned by
3917 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3918 appertain to the pointer or reference. */
3922 cp_cv_quals cv_qualifiers,
3924 tree attributes)
3925 {
3932 else
3942 }
3944 /* Create a new C++ parser. */
3948 {
3953 /* cp_lexer_new_main is called before doing GC allocation because
3954 cp_lexer_new_main might load a PCH file. */
3957 /* Initialize the binops_by_token so that we can get the tree
3958 directly from the token. */
3966 /* For now, we always accept GNU extensions. */
3969 /* The `>' token is a greater-than operator, not the end of a
3970 template-id. */
3975 /* We are not parsing a constant-expression. */
3980 /* Local variable names are not forbidden. */
3983 /* We are not processing an `extern "C"' declaration. */
3986 /* We are not processing a declarator. */
3989 /* We are not processing a template-argument-list. */
3992 /* We are not in an iteration statement. */
3995 /* We are not in a switch statement. */
3998 /* We are not parsing a type-id inside an expression. */
4001 /* String literals should be translated to the execution character set. */
4004 /* We are not parsing a function body. */
4007 /* We can correct until told otherwise. */
4010 /* The unparsed function queue is empty. */
4013 /* There are no classes being defined. */
4016 /* No template parameters apply. */
4019 /* Special parsing data structures. */
4023 /* Not declaring an implicit function template. */
4029 /* Allow constrained-type-specifiers. */
4032 /* We haven't yet seen an 'extern "C"'. */
4036 }
4038 /* Create a cp_lexer structure which will emit the tokens in CACHE
4039 and push it onto the parser's lexer stack. This is used for delayed
4040 parsing of in-class method bodies and default arguments, and should
4041 not be confused with tentative parsing. */
4042 static void
4044 {
4049 /* Move the current source position to that of the first token in the
4050 new lexer. */
4052 }
4054 /* Pop the top lexer off the parser stack. This is never used for the
4055 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
4056 static void
4058 {
4063 /* Put the current source position back where it was before this
4064 lexer was pushed. */
4066 }
4068 /* Lexical conventions [gram.lex] */
4070 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
4071 identifier. */
4073 static cp_expr
4075 {
4078 /* Look for the identifier. */
4080 /* Return the value. */
4083 else
4085 }
4087 /* Parse a sequence of adjacent string constants. Returns a
4088 TREE_STRING representing the combined, nul-terminated string
4089 constant. If TRANSLATE is true, translate the string to the
4090 execution character set. If WIDE_OK is true, a wide string is
4091 invalid here.
4093 C++98 [lex.string] says that if a narrow string literal token is
4094 adjacent to a wide string literal token, the behavior is undefined.
4095 However, C99 6.4.5p4 says that this results in a wide string literal.
4096 We follow C99 here, for consistency with the C front end.
4098 This code is largely lifted from lex_string() in c-lex.c.
4100 FUTURE: ObjC++ will need to handle @-strings here. */
4101 static cp_expr
4104 {
4105 tree value;
4113 tree string_tree;
4119 {
4122 }
4127 {
4131 }
4132 else
4133 {
4136 }
4139 /* Try to avoid the overhead of creating and destroying an obstack
4140 for the common case of just one string. */
4143 {
4151 {
4155 }
4156 else
4160 }
4161 else
4162 {
4168 do
4169 {
4171 count++;
4176 {
4179 {
4182 }
4185 {
4190 }
4192 }
4193 else
4197 {
4201 {
4205 "unsupported non-standard concatenation "
4207 }
4208 }
4217 {
4221 }
4222 else
4223 {
4227 }
4228 }
4231 /* A string literal built by concatenation has its caret=start at
4232 the start of the initial string, and its finish at the finish of
4233 the final string literal. */
4237 }
4240 {
4243 }
4247 {
4251 {
4255 }
4258 {
4266 else
4278 }
4283 {
4288 else
4290 }
4291 }
4292 else
4293 /* cpp_interpret_string has issued an error. */
4297 {
4300 }
4303 }
4305 /* Look up a literal operator with the name and the exact arguments. */
4307 static tree
4309 {
4315 {
4319 {
4326 {
4336 }
4340 /* May be this should be sufficient_parms_p instead,
4341 depending on how exactly should user-defined literals
4342 work in presence of default arguments on the literal
4343 operator parameters. */
4346 }
4347 }
4350 }
4352 /* Parse a user-defined char constant. Returns a call to a user-defined
4353 literal operator taking the character as an argument. */
4355 static cp_expr
4357 {
4365 /* Build up a call to the user-defined operator */
4366 /* Lookup the name we got back from the id-expression. */
4367 releasing_vec args;
4371 {
4375 }
4378 }
4380 /* A subroutine of cp_parser_userdef_numeric_literal to
4381 create a char... template parameter pack from a string node. */
4383 static tree
4385 {
4386 tree charvec;
4392 /* Fill in CHARVEC with all of the parameters. */
4395 {
4404 }
4406 /* Build the argument packs. */
4412 }
4414 /* A subroutine of cp_parser_userdef_numeric_literal to
4415 create a char... template parameter pack from a string node. */
4417 static tree
4419 {
4420 tree charvec;
4431 /* First template parm is character type. */
4434 /* Fill in CHARVEC with all of the parameters. */
4441 /* Build the argument packs. */
4447 }
4449 /* Parse a user-defined numeric constant. returns a call to a user-defined
4450 literal operator. */
4452 static cp_expr
4454 {
4464 /* Look for a literal operator taking the exact type of numeric argument
4465 as the literal value. */
4466 releasing_vec args;
4470 {
4472 tf_warning_or_error);
4475 {
4478 long_long_unsigned_type_node);
4479 }
4480 else
4481 {
4485 long_double_type_node);
4489 }
4492 }
4494 /* If the numeric argument didn't work, look for a raw literal
4495 operator taking a const char* argument consisting of the number
4496 in string format. */
4501 {
4503 tf_warning_or_error);
4505 }
4507 /* If the raw literal didn't work, look for a non-type template
4508 function with parameter pack char.... Call the function with
4509 template parameter characters representing the number. */
4513 {
4516 {
4518 num_string);
4520 }
4523 tf_warning_or_error);
4525 }
4527 /* In C++14 the standard library defines complex number suffixes that
4528 conflict with GNU extensions. Prefer them if <complex> is #included. */
4538 {
4543 {
4544 /* No <complex>, so pedwarn and use GNU semantics. */
4547 }
4548 }
4550 bool complained
4557 {
4559 "(from %<<complex>%>) to enable the C++14 user-defined literal "
4564 }
4571 else
4572 {
4573 /* Use the built-in semantics. */
4574 tree type;
4576 {
4579 else
4581 }
4590 }
4593 /* Avoid repeated diagnostics. */
4596 }
4598 /* Parse a user-defined string constant. Returns a call to a user-defined
4599 literal operator taking a character pointer and the length of the string
4600 as arguments. */
4602 static tree
4604 {
4610 tree decl;
4612 /* Build up a call to the user-defined operator. */
4613 /* Lookup the name we got back from the id-expression. */
4614 releasing_vec args;
4621 tf_warning_or_error);
4623 /* Look for a suitable template function, either (C++20) with a single
4624 parameter of class type, or (N3599) with typename parameter CharT and
4625 parameter pack CharT... */
4629 {
4630 /* Use resolve_nondeduced_context to try to choose one form of template
4631 or the other. */
4638 else
4639 {
4644 }
4648 tf_warning_or_error);
4649 }
4654 }
4657 /* Basic concepts [gram.basic] */
4659 /* Parse a translation-unit.
4661 translation-unit:
4662 declaration-seq [opt] */
4664 static void
4666 {
4669 /* Create the declarator obstack. */
4671 /* Create the error declarator. */
4673 /* Create the empty parameter list. */
4675 UNKNOWN_LOCATION);
4676 /* Remember where the base of the declarator obstack lies. */
4682 {
4685 /* If we're entering or exiting a region that's implicitly
4686 extern "C", modify the lang context appropriately. */
4689 {
4693 else
4695 }
4701 {
4704 /* If the next token is now a `;', consume it. */
4707 }
4708 else
4710 }
4712 /* Get rid of the token array; we don't need it any more. */
4716 /* The EOF should have reset this. */
4719 /* Make sure the declarator obstack was fully cleaned up. */
4722 }
4724 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4725 decltype context. */
4729 {
4734 }
4736 /* We're about to parse a collection of statements. If we're currently
4737 parsing tentatively, set up a firewall so that any nested
4738 cp_parser_commit_to_tentative_parse won't affect the current context. */
4740 static cp_token_position
4742 {
4749 }
4751 /* We've finished parsing the collection of statements. Wrap up the
4752 firewall and replace the relevant tokens with the parsed form. */
4754 static void
4756 tree expr)
4757 {
4761 /* Finish the firewall level. */
4763 /* And remember the result of the parse for when we try again. */
4769 }
4771 /* Like the above functions, but let the user modify the tokens. Used by
4772 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4773 later parses, so it makes sense to localize the effects of
4774 cp_parser_commit_to_tentative_parse. */
4776 struct tentative_firewall
4777 {
4782 {
4783 /* If we're currently parsing tentatively, start a committed level as a
4784 firewall and then an inner tentative parse. */
4786 {
4790 }
4791 }
4794 {
4796 {
4797 /* Finish the inner tentative parse and the firewall, propagating any
4798 uncommitted error state to the outer tentative parse. */
4804 }
4805 }
4806 };
4808 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4809 This class is for tracking such a matching pair of symbols.
4810 In particular, it tracks the location of the first token,
4811 so that if the second token is missing, we can highlight the
4812 location of the first token when notifying the user about the
4813 problem. */
4816 class token_pair
4817 {
4819 /* token_pair's ctor. */
4822 /* If the next token is the opening symbol for this pair, consume it and
4823 return true.
4824 Otherwise, issue an error and return false.
4825 In either case, record the location of the opening token. */
4828 {
4832 }
4834 /* Consume the next token from PARSER, recording its location as
4835 that of the opening token within the pair. */
4838 {
4843 }
4845 /* If the next token is the closing symbol for this pair, consume it
4846 and return it.
4847 Otherwise, issue an error, highlighting the location of the
4848 corresponding opening token, and return NULL. */
4851 {
4854 m_open_loc);
4855 }
4858 location_t m_open_loc;
4859 };
4861 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4863 struct matching_paren_traits
4864 {
4869 };
4871 /* "matching_parens" is a token_pair<T> class for tracking matching
4872 pairs of parentheses. */
4876 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4878 struct matching_brace_traits
4879 {
4884 };
4886 /* "matching_braces" is a token_pair<T> class for tracking matching
4887 pairs of braces. */
4892 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4893 enclosing parentheses. */
4895 static cp_expr
4897 {
4900 /* Consume the '('. */
4902 matching_parens parens;
4904 /* Start the statement-expression. */
4906 /* Parse the compound-statement. */
4908 /* Finish up. */
4910 /* Consume the ')'. */
4918 }
4920 /* Expressions [gram.expr] */
4922 /* Parse a fold-operator.
4924 fold-operator:
4925 - * / % ^ & | = < > << >>
4926 = -= *= /= %= ^= &= |= <<= >>=
4927 == != <= >= && || , .* ->*
4929 This returns the tree code corresponding to the matched operator
4930 as an int. When the current token matches a compound assignment
4931 opertor, the resulting tree code is the negative value of the
4932 non-assignment operator. */
4934 static int
4936 {
4938 {
4978 }
4979 }
4981 /* Returns true if CODE indicates a binary expression, which is not allowed in
4982 the LHS of a fold-expression. More codes will need to be added to use this
4983 function in other contexts. */
4985 static bool
4987 {
4989 {
5022 }
5023 }
5025 /* If the next token is a suitable fold operator, consume it and return as
5026 the function above. */
5028 static int
5030 {
5036 }
5038 /* Parse a fold-expression.
5040 fold-expression:
5041 ( ... folding-operator cast-expression)
5042 ( cast-expression folding-operator ... )
5043 ( cast-expression folding operator ... folding-operator cast-expression)
5045 Note that the '(' and ')' are matched in primary expression. */
5047 static cp_expr
5049 {
5050 cp_id_kind pidk;
5052 // Left fold.
5054 {
5058 {
5061 }
5068 }
5073 {
5076 }
5079 {
5082 }
5085 /* The operands of a fold-expression are cast-expressions, so binary or
5086 conditional expressions are not allowed. We check this here to avoid
5087 tentative parsing. */
5099 // Right fold.
5104 {
5107 }
5110 // Binary left or right fold.
5115 }
5117 /* Parse a primary-expression.
5119 primary-expression:
5120 literal
5121 this
5122 ( expression )
5123 id-expression
5124 lambda-expression (C++11)
5126 GNU Extensions:
5128 primary-expression:
5129 ( compound-statement )
5130 __builtin_va_arg ( assignment-expression , type-id )
5131 __builtin_offsetof ( type-id , offsetof-expression )
5133 C++ Extensions:
5134 __has_nothrow_assign ( type-id )
5135 __has_nothrow_constructor ( type-id )
5136 __has_nothrow_copy ( type-id )
5137 __has_trivial_assign ( type-id )
5138 __has_trivial_constructor ( type-id )
5139 __has_trivial_copy ( type-id )
5140 __has_trivial_destructor ( type-id )
5141 __has_virtual_destructor ( type-id )
5142 __is_abstract ( type-id )
5143 __is_base_of ( type-id , type-id )
5144 __is_class ( type-id )
5145 __is_empty ( type-id )
5146 __is_enum ( type-id )
5147 __is_final ( type-id )
5148 __is_literal_type ( type-id )
5149 __is_pod ( type-id )
5150 __is_polymorphic ( type-id )
5151 __is_std_layout ( type-id )
5152 __is_trivial ( type-id )
5153 __is_union ( type-id )
5155 Objective-C++ Extension:
5157 primary-expression:
5158 objc-expression
5160 literal:
5161 __null
5163 ADDRESS_P is true iff this expression was immediately preceded by
5164 "&" and therefore might denote a pointer-to-member. CAST_P is true
5165 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5166 true iff this expression is a template argument.
5168 Returns a representation of the expression. Upon return, *IDK
5169 indicates what kind of id-expression (if any) was present. */
5171 static cp_expr
5178 {
5181 /* Assume the primary expression is not an id-expression. */
5184 /* Peek at the next token. */
5187 {
5188 /* literal:
5189 integer-literal
5190 character-literal
5191 floating-literal
5192 string-literal
5193 boolean-literal
5194 pointer-literal
5195 user-defined-literal */
5207 {
5211 }
5212 /* Floating-point literals are only allowed in an integral
5213 constant expression if they are cast to an integral or
5214 enumeration type. */
5218 {
5219 /* CAST_P will be set even in invalid code like "int(2.7 +
5220 ...)". Therefore, we have to check that the next token
5221 is sure to end the cast. */
5223 {
5228 enumerator-definition. */
5230 /* The curly brace at the end of an enum-specifier. */
5232 /* The end of a statement. */
5234 /* The end of the cast-expression. */
5236 /* The end of an array bound. */
5238 /* The closing ">" in a template-argument-list. */
5241 /* C++0x only: A ">>" treated like two ">" tokens,
5242 in a template-argument-list. */
5247 }
5249 /* If we are within a cast, then the constraint that the
5250 cast is to an integral or enumeration type will be
5251 checked at that point. If we are not within a cast, then
5252 this code is invalid. */
5255 }
5276 /* ??? Should wide strings be allowed when parser->translate_strings_p
5277 is false (i.e. in attributes)? If not, we can kill the third
5278 argument to cp_parser_string_literal. */
5285 /* If we see `( { ' then we are looking at the beginning of
5286 a GNU statement-expression. */
5289 {
5290 /* Statement-expressions are not allowed by the standard. */
5294 /* And they're not allowed outside of a function-body; you
5295 cannot, for example, write:
5297 int i = ({ int j = 3; j + 1; });
5299 at class or namespace scope. */
5302 {
5304 "statement-expressions are not allowed outside "
5310 }
5311 else
5313 }
5314 /* Otherwise it's a normal parenthesized expression. */
5315 {
5316 cp_expr expr;
5321 /* Consume the `('. */
5322 matching_parens parens;
5324 /* Within a parenthesized expression, a `>' token is always
5325 the greater-than operator. */
5326 saved_greater_than_is_operator_p
5331 /* Left fold expression. */
5333 else
5334 /* Parse the parenthesized expression. */
5339 {
5346 }
5347 else
5348 /* Let the front end know that this expression was
5349 enclosed in parentheses. This matters in case, for
5350 example, the expression is of the form `A::B', since
5351 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5352 not. */
5355 /* DR 705: Wrapping an unqualified name in parentheses
5356 suppresses arg-dependent lookup. We want to pass back
5357 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5358 (c++/37862), but none of the others. */
5362 /* The `>' token might be the end of a template-id or
5363 template-parameter-list now. */
5364 parser->greater_than_is_operator_p
5367 /* Consume the `)'. */
5376 }
5379 {
5381 {
5382 /* We might have an Objective-C++ message. */
5385 /* If that works out, we're done ... */
5388 /* ... else, fall though to see if it's a lambda. */
5389 }
5391 /* Don't warn about a failed tentative parse. */
5396 }
5400 /* We have an Objective-C++ string literal. */
5407 {
5408 /* These two are the boolean literals. */
5416 /* The `__null' literal. */
5421 /* The `nullptr' literal. */
5426 /* Recognize the `this' keyword. */
5430 {
5434 }
5435 /* Pointers cannot appear in constant-expressions. */
5440 /* The `operator' keyword can be the beginning of an
5441 id-expression. */
5448 {
5449 non_integral_constant name;
5451 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5452 __func__ are the names of variables -- but they are
5453 treated specially. Therefore, they are handled here,
5454 rather than relying on the generic id-expression logic
5455 below. Grammatically, these names are id-expressions.
5457 Consume the token. */
5461 {
5473 }
5478 /* Look up the name. */
5480 }
5483 {
5484 tree expression;
5485 tree type;
5486 location_t type_location;
5487 location_t start_loc
5489 /* The `__builtin_va_arg' construct is used to handle
5490 `va_arg'. Consume the `__builtin_va_arg' token. */
5492 /* Look for the opening `('. */
5493 matching_parens parens;
5495 /* Now, parse the assignment-expression. */
5497 /* Look for the `,'. */
5500 /* Parse the type-id. */
5501 {
5504 }
5505 /* Look for the closing `)'. */
5506 location_t finish_loc
5509 /* Using `va_arg' in a constant-expression is not
5510 allowed. */
5512 NIC_VA_ARG))
5514 /* Construct a location of the form:
5515 __builtin_va_arg (v, int)
5516 ~~~~~~~~~~~~~~~~~~~~~^~~~
5517 with the caret at the type, ranging from the start of the
5518 "__builtin_va_arg" token to the close paren. */
5519 location_t combined_loc
5522 }
5557 // C++ concepts
5561 /* Objective-C++ expressions. */
5571 {
5576 }
5577 /* FALLTHRU */
5581 }
5583 /* An id-expression can start with either an identifier, a
5584 `::' as the beginning of a qualified-id, or the "operator"
5585 keyword. */
5590 {
5591 id_expression:
5592 cp_expr id_expression;
5593 cp_expr decl;
5599 /* Parse the id-expression. */
5600 id_expression
5617 /* If we have a template-id, then no further lookup is
5618 required. If the template-id was for a template-class, we
5619 will sometimes have a TYPE_DECL at this point. */
5623 /* Look up the name. */
5624 else
5625 {
5626 tree ambiguous_decls;
5628 /* If we already know that this lookup is ambiguous, then
5629 we've already issued an error message; there's no reason
5630 to check again. */
5633 {
5636 }
5639 none_type,
5640 template_p,
5645 /* If the lookup was ambiguous, an error will already have
5646 been issued. */
5650 /* In Objective-C++, we may have an Objective-C 2.0
5651 dot-syntax for classes here. */
5656 {
5657 tree component;
5664 component);
5665 /* Build a location of the form:
5666 expr.component
5667 ~~~~~^~~~~~~~~
5668 with caret at the start of the component name (at
5669 input_location), ranging from the start of the id_expression
5670 to the end of the component name. */
5671 location_t combined_loc
5676 }
5678 /* In Objective-C++, an instance variable (ivar) may be preferred
5679 to whatever cp_parser_lookup_name() found.
5680 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5681 rest of c-family, we have to do a little extra work to preserve
5682 any location information in cp_expr "decl". Given that
5683 objc_lookup_ivar is implemented in "c-family" and "objc", we
5684 have a trip through the pure "tree" type, rather than cp_expr.
5685 Naively copying it back to "decl" would implicitly give the
5686 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5687 store an EXPR_LOCATION. Hence we only update "decl" (and
5688 hence its location_t) if we get back a different tree node. */
5690 id_expression);
5694 /* If name lookup gives us a SCOPE_REF, then the
5695 qualifying scope was dependent. */
5697 {
5698 /* At this point, we do not know if DECL is a valid
5699 integral constant expression. We assume that it is
5700 in fact such an expression, so that code like:
5702 template <int N> struct A {
5703 int a[B<N>::i];
5704 };
5706 is accepted. At template-instantiation time, we
5707 will check that B<N>::i is actually a constant. */
5709 }
5710 /* Check to see if DECL is a local variable in a context
5711 where that is forbidden. */
5714 {
5719 }
5720 }
5722 decl = (finish_id_expression
5724 idk,
5729 template_arg_p,
5734 /* Build a location for an id-expression of the form:
5735 ::ns::id
5736 ~~~~~~^~
5737 or:
5738 id
5739 ^~
5740 i.e. from the start of the first token to the end of the final
5741 token, with the caret at the start of the unqualified-id. */
5745 location_t combined_loc
5750 }
5752 /* Anything else is an error. */
5756 }
5757 }
5765 {
5768 }
5770 /* Parse an id-expression.
5772 id-expression:
5773 unqualified-id
5774 qualified-id
5776 qualified-id:
5777 :: [opt] nested-name-specifier template [opt] unqualified-id
5778 :: identifier
5779 :: operator-function-id
5780 :: template-id
5782 Return a representation of the unqualified portion of the
5783 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5784 a `::' or nested-name-specifier.
5786 Often, if the id-expression was a qualified-id, the caller will
5787 want to make a SCOPE_REF to represent the qualified-id. This
5788 function does not do this in order to avoid wastefully creating
5789 SCOPE_REFs when they are not required.
5791 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5792 `template' keyword.
5794 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5795 uninstantiated templates.
5797 If *TEMPLATE_P is non-NULL, it is set to true iff the
5798 `template' keyword is used to explicitly indicate that the entity
5799 named is a template.
5801 If DECLARATOR_P is true, the id-expression is appearing as part of
5802 a declarator, rather than as part of an expression. */
5804 static cp_expr
5811 {
5815 /* Assume the `template' keyword was not used. */
5819 /* Look for the optional `::' operator. */
5820 global_scope_p
5821 = (!template_keyword_p
5826 /* Look for the optional nested-name-specifier. */
5827 nested_name_specifier_p
5830 check_dependency_p,
5832 declarator_p,
5833 template_keyword_p)
5836 /* If there is a nested-name-specifier, then we are looking at
5837 the first qualified-id production. */
5839 {
5840 tree saved_scope;
5841 tree saved_object_scope;
5842 tree saved_qualifying_scope;
5843 cp_expr unqualified_id;
5846 /* See if the next token is the `template' keyword. */
5850 /* Name lookup we do during the processing of the
5851 unqualified-id might obliterate SCOPE. */
5855 /* Process the final unqualified-id. */
5857 check_dependency_p,
5858 declarator_p,
5860 /* Restore the SAVED_SCOPE for our caller. */
5866 }
5867 /* Otherwise, if we are in global scope, then we are looking at one
5868 of the other qualified-id productions. */
5870 {
5872 tree id;
5874 /* Peek at the next token. */
5877 /* If it's an identifier, and the next token is not a "<", then
5878 we can avoid the template-id case. This is an optimization
5879 for this common case. */
5881 && !cp_parser_nth_token_starts_template_argument_list_p
5886 /* Try a template-id. */
5890 none_type,
5891 declarator_p);
5892 /* If that worked, we're done. */
5896 /* Peek at the next token. (Changes in the token buffer may
5897 have invalidated the pointer obtained above.) */
5901 {
5908 /* Fall through. */
5913 }
5914 }
5915 else
5918 declarator_p,
5919 optional_p);
5920 }
5922 /* Parse an unqualified-id.
5924 unqualified-id:
5925 identifier
5926 operator-function-id
5927 conversion-function-id
5928 ~ class-name
5929 template-id
5931 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5932 keyword, in a construct like `A::template ...'.
5934 Returns a representation of unqualified-id. For the `identifier'
5935 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5936 production a BIT_NOT_EXPR is returned; the operand of the
5937 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5938 other productions, see the documentation accompanying the
5939 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5940 names are looked up in uninstantiated templates. If DECLARATOR_P
5941 is true, the unqualified-id is appearing as part of a declarator,
5942 rather than as part of an expression. */
5944 static cp_expr
5950 {
5953 /* Peek at the next token. */
5957 {
5959 {
5960 tree id;
5962 /* We don't know yet whether or not this will be a
5963 template-id. */
5965 /* Try a template-id. */
5967 check_dependency_p,
5968 none_type,
5969 declarator_p);
5970 /* If it worked, we're done. */
5973 /* Otherwise, it's an ordinary identifier. */
5975 }
5979 check_dependency_p,
5980 none_type,
5981 declarator_p);
5984 {
5985 tree type_decl;
5986 tree qualifying_scope;
5987 tree object_scope;
5988 tree scope;
5992 /* Consume the `~' token. */
5994 /* Parse the class-name. The standard, as written, seems to
5995 say that:
5997 template <typename T> struct S { ~S (); };
5998 template <typename T> S<T>::~S() {}
6000 is invalid, since `~' must be followed by a class-name, but
6001 `S<T>' is dependent, and so not known to be a class.
6002 That's not right; we need to look in uninstantiated
6003 templates. A further complication arises from:
6005 template <typename T> void f(T t) {
6006 t.T::~T();
6007 }
6009 Here, it is not possible to look up `T' in the scope of `T'
6010 itself. We must look in both the current scope, and the
6011 scope of the containing complete expression.
6013 Yet another issue is:
6015 struct S {
6016 int S;
6017 ~S();
6018 };
6020 S::~S() {}
6022 The standard does not seem to say that the `S' in `~S'
6023 should refer to the type `S' and not the data member
6024 `S::S'. */
6026 /* DR 244 says that we look up the name after the "~" in the
6027 same scope as we looked up the qualifying name. That idea
6028 isn't fully worked out; it's more complicated than that. */
6033 /* Check for invalid scopes. */
6035 {
6039 }
6041 {
6045 scope);
6050 }
6055 /* Create a location with caret == start at the tilde,
6056 finishing at the end of the peeked token, e.g:
6057 ~token
6058 ^~~~~~. */
6059 location_t loc
6062 /* If the name is of the form "X::~X" it's OK even if X is a
6063 typedef. */
6072 {
6075 }
6077 /* ~auto means the destructor of whatever the object is. */
6079 {
6082 "%<~auto%> only available with "
6086 }
6088 /* If there was an explicit qualification (S::~T), first look
6089 in the scope given by the qualification (i.e., S).
6091 Note: in the calls to cp_parser_class_name below we pass
6092 typename_type so that lookup finds the injected-class-name
6093 rather than the constructor. */
6097 {
6102 typename_type,
6105 declarator_p);
6108 }
6109 /* In "N::S::~S", look in "N" as well. */
6111 {
6116 type_decl
6120 typename_type,
6123 declarator_p);
6126 }
6127 /* In "p->S::~T", look in the scope given by "*p" as well. */
6129 {
6134 type_decl
6138 typename_type,
6141 declarator_p);
6144 }
6145 /* Look in the surrounding context. */
6147 {
6153 type_decl
6157 typename_type,
6160 declarator_p);
6163 {
6164 /* We couldn't find a type with this name. If we're parsing
6165 tentatively, fail and try something else. */
6167 {
6170 }
6171 /* Otherwise, accept it and check for a match at instantiation
6172 time. */
6177 }
6178 }
6179 /* If an error occurred, assume that the name of the
6180 destructor is the same as the name of the qualifying
6181 class. That allows us to keep parsing after running
6182 into ill-formed destructor names. */
6188 /* Check that destructor name and scope match. */
6190 {
6197 }
6199 /* [class.dtor]
6201 A typedef-name that names a class shall not be used as the
6202 identifier in the declarator for a destructor declaration. */
6209 type_decl);
6212 }
6216 {
6217 cp_expr id;
6219 /* This could be a template-id, so we try that first. */
6221 /* Try a template-id. */
6224 none_type,
6225 declarator_p);
6226 /* If that worked, we're done. */
6229 /* We still don't know whether we're looking at an
6230 operator-function-id or a conversion-function-id. */
6232 /* Try an operator-function-id. */
6234 /* If that didn't work, try a conversion-function-id. */
6239 }
6240 /* Fall through. */
6247 }
6248 }
6250 /* Parse an (optional) nested-name-specifier.
6252 nested-name-specifier: [C++98]
6253 class-or-namespace-name :: nested-name-specifier [opt]
6254 class-or-namespace-name :: template nested-name-specifier [opt]
6256 nested-name-specifier: [C++0x]
6257 type-name ::
6258 namespace-name ::
6259 nested-name-specifier identifier ::
6260 nested-name-specifier template [opt] simple-template-id ::
6262 PARSER->SCOPE should be set appropriately before this function is
6263 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6264 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6265 in name lookups.
6267 Sets PARSER->SCOPE to the class (TYPE) or namespace
6268 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6269 it unchanged if there is no nested-name-specifier. Returns the new
6270 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6272 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6273 part of a declaration and/or decl-specifier. */
6275 static tree
6282 {
6287 /* Remember where the nested-name-specifier starts. */
6290 {
6293 }
6296 {
6297 tree new_scope;
6298 tree old_scope;
6299 tree saved_qualifying_scope;
6301 /* Spot cases that cannot be the beginning of a
6302 nested-name-specifier. */
6305 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6306 the already parsed nested-name-specifier. */
6308 {
6309 /* Grab the nested-name-specifier and continue the loop. */
6311 /* If we originally encountered this nested-name-specifier
6312 with IS_DECLARATION set to false, we will not have
6313 resolved TYPENAME_TYPEs, so we must do so here. */
6316 {
6321 }
6324 }
6326 /* Spot cases that cannot be the beginning of a
6327 nested-name-specifier. On the second and subsequent times
6328 through the loop, we look for the `template' keyword. */
6330 ;
6331 /* A template-id can start a nested-name-specifier. */
6333 ;
6334 /* DR 743: decltype can be used in a nested-name-specifier. */
6336 ;
6337 else
6338 {
6339 /* If the next token is not an identifier, then it is
6340 definitely not a type-name or namespace-name. */
6343 /* If the following token is neither a `<' (to begin a
6344 template-id), nor a `::', then we are not looking at a
6345 nested-name-specifier. */
6351 {
6355 "found %<:%> in nested-name-specifier, "
6358 }
6361 && !cp_parser_nth_token_starts_template_argument_list_p
6364 }
6366 /* The nested-name-specifier is optional, so we parse
6367 tentatively. */
6370 /* Look for the optional `template' keyword, if this isn't the
6371 first time through the loop. */
6375 /* Save the old scope since the name lookup we are about to do
6376 might destroy it. */
6379 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6380 look up names in "X<T>::I" in order to determine that "Y" is
6381 a template. So, if we have a typename at this point, we make
6382 an effort to look through it. */
6384 && !typename_keyword_p
6389 /* Parse the qualifying entity. */
6390 new_scope
6392 typename_keyword_p,
6393 template_keyword_p,
6394 check_dependency_p,
6395 type_p,
6396 is_declaration);
6397 /* Look for the `::' token. */
6400 /* If we found what we wanted, we keep going; otherwise, we're
6401 done. */
6403 {
6406 /* Restore the OLD_SCOPE since it was valid before the
6407 failed attempt at finding the last
6408 class-or-namespace-name. */
6412 /* If the next token is a decltype, and the one after that is a
6413 `::', then the decltype has failed to resolve to a class or
6414 enumeration type. Give this error even when parsing
6415 tentatively since it can't possibly be valid--and we're going
6416 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6417 won't get another chance.*/
6421 {
6428 /* As below. */
6431 }
6435 {
6436 /* If we have a non-type template-id followed by ::, it can't
6437 possibly be valid. */
6442 {
6445 {
6451 }
6452 else
6453 {
6454 /* Variable template. */
6459 }
6466 /* As below. */
6470 }
6471 }
6475 /* If the next token is an identifier, and the one after
6476 that is a `::', then any valid interpretation would have
6477 found a class-or-namespace-name. */
6483 {
6486 {
6488 {
6489 tree decl;
6490 tree ambiguous_decls;
6493 none_type,
6502 decl);
6504 {
6505 // cp_parser_lookup_name has the same diagnostic,
6506 // thus make sure to emit it at most once.
6509 {
6514 }
6516 }
6517 else
6518 {
6520 cp_parser_name_lookup_error
6523 else
6524 cp_parser_name_lookup_error
6527 }
6528 }
6531 /* Treat this as a successful nested-name-specifier
6532 due to:
6534 [basic.lookup.qual]
6536 If the name found is not a class-name (clause
6537 _class_) or namespace-name (_namespace.def_), the
6538 program is ill-formed. */
6540 }
6542 }
6544 }
6545 /* We've found one valid nested-name-specifier. */
6547 /* Name lookup always gives us a DECL. */
6550 /* Uses of "template" must be followed by actual templates. */
6562 new_scope);
6563 /* If it is a class scope, try to complete it; we are about to
6564 be looking up names inside the class. */
6566 /* Since checking types for dependency can be expensive,
6567 avoid doing it if the type is already complete. */
6569 /* Do not try to complete dependent types. */
6571 {
6573 /* If it is a typedef to current class, use the current
6574 class instead, as the typedef won't have any names inside
6575 it yet. */
6579 }
6580 /* Make sure we look in the right scope the next time through
6581 the loop. */
6583 }
6585 /* If parsing tentatively, replace the sequence of tokens that makes
6586 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6587 token. That way, should we re-parse the token stream, we will
6588 not have to repeat the effort required to do the parse, nor will
6589 we issue duplicate error messages. */
6591 {
6595 /* Reset the contents of the START token. */
6597 /* Retrieve any deferred checks. Do not pop this access checks yet
6598 so the memory will not be reclaimed during token replacing below. */
6606 /* Purge all subsequent tokens. */
6608 }
6614 }
6616 /* Parse a nested-name-specifier. See
6617 cp_parser_nested_name_specifier_opt for details. This function
6618 behaves identically, except that it will an issue an error if no
6619 nested-name-specifier is present. */
6621 static tree
6627 {
6628 tree scope;
6630 /* Look for the nested-name-specifier. */
6632 typename_keyword_p,
6633 check_dependency_p,
6634 type_p,
6635 is_declaration);
6636 /* If it was not present, issue an error message. */
6638 {
6641 }
6644 }
6646 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6647 this is either a class-name or a namespace-name (which corresponds
6648 to the class-or-namespace-name production in the grammar). For
6649 C++0x, it can also be a type-name that refers to an enumeration
6650 type or a simple-template-id.
6652 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6653 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6654 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6655 TYPE_P is TRUE iff the next name should be taken as a class-name,
6656 even the same name is declared to be another entity in the same
6657 scope.
6659 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6660 specified by the class-or-namespace-name. If neither is found the
6661 ERROR_MARK_NODE is returned. */
6663 static tree
6670 {
6671 tree saved_scope;
6672 tree saved_qualifying_scope;
6673 tree saved_object_scope;
6674 tree scope;
6678 /* DR 743: decltype can appear in a nested-name-specifier. */
6680 {
6684 {
6687 }
6691 }
6693 /* Before we try to parse the class-name, we must save away the
6694 current PARSER->SCOPE since cp_parser_class_name will destroy
6695 it. */
6699 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6700 there is no need to look for a namespace-name. */
6701 only_class_p = template_keyword_p
6706 typename_keyword_p,
6707 template_keyword_p,
6709 check_dependency_p,
6711 is_declaration,
6714 /* If that didn't work, try for a namespace-name. */
6716 {
6717 /* Restore the saved scope. */
6721 /* If we are not looking at an identifier followed by the scope
6722 resolution operator, then this is not part of a
6723 nested-name-specifier. (Note that this function is only used
6724 to parse the components of a nested-name-specifier.) */
6729 }
6732 }
6734 /* Return true if we are looking at a compound-literal, false otherwise. */
6736 static bool
6738 {
6741 /* Skip tokens until the next token is a closing parenthesis.
6742 If we find the closing `)', and the next token is a `{', then
6743 we are looking at a compound-literal. */
6744 bool compound_literal_p
6749 /* Roll back the tokens we skipped. */
6753 }
6755 /* Return true if EXPR is the integer constant zero or a complex constant
6756 of zero, without any folding, but ignoring location wrappers. */
6758 bool
6760 {
6763 }
6765 /* Parse a postfix-expression.
6767 postfix-expression:
6768 primary-expression
6769 postfix-expression [ expression ]
6770 postfix-expression ( expression-list [opt] )
6771 simple-type-specifier ( expression-list [opt] )
6772 typename :: [opt] nested-name-specifier identifier
6773 ( expression-list [opt] )
6774 typename :: [opt] nested-name-specifier template [opt] template-id
6775 ( expression-list [opt] )
6776 postfix-expression . template [opt] id-expression
6777 postfix-expression -> template [opt] id-expression
6778 postfix-expression . pseudo-destructor-name
6779 postfix-expression -> pseudo-destructor-name
6780 postfix-expression ++
6781 postfix-expression --
6782 dynamic_cast < type-id > ( expression )
6783 static_cast < type-id > ( expression )
6784 reinterpret_cast < type-id > ( expression )
6785 const_cast < type-id > ( expression )
6786 typeid ( expression )
6787 typeid ( type-id )
6789 GNU Extension:
6791 postfix-expression:
6792 ( type-id ) { initializer-list , [opt] }
6794 This extension is a GNU version of the C99 compound-literal
6795 construct. (The C99 grammar uses `type-name' instead of `type-id',
6796 but they are essentially the same concept.)
6798 If ADDRESS_P is true, the postfix expression is the operand of the
6799 `&' operator. CAST_P is true if this expression is the target of a
6800 cast.
6802 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6803 class member access expressions [expr.ref].
6805 Returns a representation of the expression. */
6807 static cp_expr
6811 {
6813 location_t loc;
6819 /* Peek at the next token. */
6824 /* Some of the productions are determined by keywords. */
6827 {
6832 {
6833 tree type;
6834 cp_expr expression;
6838 /* All of these can be handled in the same way from the point
6839 of view of parsing. Begin by consuming the token
6840 identifying the cast. */
6843 /* New types cannot be defined in the cast. */
6845 parser->type_definition_forbidden_message
6848 /* Look for the opening `<'. */
6850 /* Parse the type to which we are casting. */
6854 NULL);
6856 /* Look for the closing `>'. */
6858 /* Restore the old message. */
6861 bool saved_greater_than_is_operator_p
6865 /* And the expression which is being cast. */
6866 matching_parens parens;
6870 RT_CLOSE_PAREN);
6874 parser->greater_than_is_operator_p
6877 /* Only type conversions to integral or enumeration types
6878 can be used in constant-expressions. */
6881 {
6884 }
6887 {
6889 postfix_expression
6893 postfix_expression
6897 postfix_expression
6899 tf_warning_or_error);
6902 postfix_expression
6907 }
6909 /* Construct a location e.g. :
6910 reinterpret_cast <int *> (expr)
6911 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6912 ranging from the start of the "*_cast" token to the final closing
6913 paren, with the caret at the start. */
6916 }
6920 {
6921 tree type;
6925 /* Consume the `typeid' token. */
6927 /* Look for the `(' token. */
6928 matching_parens parens;
6930 /* Types cannot be defined in a `typeid' expression. */
6932 parser->type_definition_forbidden_message
6934 /* We can't be sure yet whether we're looking at a type-id or an
6935 expression. */
6937 /* Try a type-id first. */
6942 /* Look for the `)' token. Otherwise, we can't be sure that
6943 we're not looking at an expression: consider `typeid (int
6944 (3))', for example. */
6946 /* If all went well, simply lookup the type-id. */
6949 /* Otherwise, fall back to the expression variant. */
6950 else
6951 {
6952 tree expression;
6954 /* Look for an expression. */
6956 /* Compute its typeid. */
6958 /* Look for the `)' token. */
6960 }
6961 /* Restore the saved message. */
6963 /* `typeid' may not appear in an integral constant expression. */
6967 /* Construct a location e.g. :
6968 typeid (expr)
6969 ^~~~~~~~~~~~~
6970 ranging from the start of the "typeid" token to the final closing
6971 paren, with the caret at the start. */
6973 {
6974 location_t typeid_loc
6978 }
6979 }
6983 {
6984 tree type;
6985 /* The syntax permitted here is the same permitted for an
6986 elaborated-type-specifier. */
6993 }
6999 {
7002 tree p;
7009 {
7012 }
7018 {
7021 postfix_expression
7023 else
7024 {
7028 }
7034 tf_warning_or_error);
7035 else
7036 {
7040 }
7045 postfix_expression
7049 postfix_expression
7052 else
7053 {
7057 }
7062 }
7064 }
7067 {
7068 tree expression;
7069 tree type;
7070 /* Consume the `__builtin_convertvector' token. */
7072 /* Look for the opening `('. */
7073 matching_parens parens;
7075 /* Now, parse the assignment-expression. */
7077 /* Look for the `,'. */
7079 location_t type_location
7081 /* Parse the type-id. */
7082 {
7085 }
7086 /* Look for the closing `)'. */
7089 tf_warning_or_error);
7090 }
7093 {
7094 tree type;
7096 /* If the next thing is a simple-type-specifier, we may be
7097 looking at a functional cast. We could also be looking at
7098 an id-expression. So, we try the functional cast, and if
7099 that doesn't work we fall back to the primary-expression. */
7101 /* Look for the simple-type-specifier. */
7105 CP_PARSER_FLAGS_NONE);
7107 /* Parse the cast itself. */
7109 postfix_expression
7111 /* If that worked, we're done. */
7115 /* If the functional-cast didn't work out, try a
7116 compound-literal. */
7119 {
7124 matching_parens parens;
7127 /* Avoid calling cp_parser_type_id pointlessly, see comment
7128 in cp_parser_cast_expression about c++/29234. */
7131 else
7132 {
7133 /* Parse the type. */
7139 }
7141 /* If things aren't going well, there's no need to
7142 keep going. */
7144 {
7146 /* Parse the brace-enclosed initializer list. */
7149 }
7150 /* If that worked, we're definitely looking at a
7151 compound-literal expression. */
7153 {
7154 /* Warn the user that a compound literal is not
7155 allowed in standard C++. */
7158 /* For simplicity, we disallow compound literals in
7159 constant-expressions. We could
7160 allow compound literals of integer type, whose
7161 initializer was a constant, in constant
7162 expressions. Permitting that usage, as a further
7163 extension, would not change the meaning of any
7164 currently accepted programs. (Of course, as
7165 compound literals are not part of ISO C++, the
7166 standard has nothing to say.) */
7168 NIC_NCC))
7169 {
7172 }
7173 /* Form the representation of the compound-literal. */
7174 postfix_expression
7179 }
7180 }
7182 /* It must be a primary-expression. */
7183 postfix_expression
7186 decltype_p,
7188 }
7190 }
7192 /* Note that we don't need to worry about calling build_cplus_new on a
7193 class-valued CALL_EXPR in decltype when it isn't the end of the
7194 postfix-expression; unary_complex_lvalue will take care of that for
7195 all these cases. */
7197 /* Keep looping until the postfix-expression is complete. */
7199 {
7203 /* It is not a Koenig lookup function call. */
7204 postfix_expression
7207 /* Peek at the next token. */
7211 {
7214 {
7216 "two consecutive %<[%> shall "
7219 }
7220 postfix_expression
7222 postfix_expression,
7224 decltype_p);
7233 /* postfix-expression ( expression-list [opt] ) */
7234 {
7245 tree stripped_expression
7247 is_builtin_constant_p
7250 {
7251 /* The whole point of __builtin_constant_p is to allow
7252 non-constant expressions to appear as arguments. */
7253 saved_integral_constant_expression_p
7255 saved_non_integral_constant_expression_p
7258 }
7259 args = (cp_parser_parenthesized_expression_list
7266 {
7267 parser->integral_constant_expression_p
7269 parser->non_integral_constant_expression_p
7271 }
7274 {
7277 }
7279 /* Function calls are not permitted in
7280 constant-expressions. */
7283 NIC_FUNC_CALL))
7284 {
7288 }
7293 {
7295 /* In C++2A, we may need to perform ADL for a template
7296 name. */
7299 {
7301 {
7304 postfix_expression
7306 complain);
7307 }
7308 else
7309 postfix_expression
7311 }
7312 /* We do not perform argument-dependent lookup if
7313 normal lookup finds a non-function, in accordance
7314 with the expected resolution of DR 218. */
7317 {
7318 /* We only need to look at the first function,
7319 because all the fns share the attribute we're
7320 concerned with (all member fns or all local
7321 fns). */
7325 /* Do not do argument dependent lookup if regular
7326 lookup finds a member function or a block-scope
7327 function declaration. [basic.lookup.argdep]/3 */
7331 {
7334 postfix_expression
7336 complain);
7337 }
7338 }
7339 }
7342 {
7352 {
7354 postfix_expression
7358 }
7361 {
7362 postfix_expression
7363 = (build_new_method_call
7369 complain));
7370 }
7371 else
7372 postfix_expression
7376 complain);
7377 }
7381 postfix_expression = (build_offset_ref_call_from_tree
7383 complain));
7385 /* A call to a static class member, or a namespace-scope
7386 function. */
7387 postfix_expression
7390 koenig_p,
7391 complain);
7392 else
7393 /* All other function calls. */
7394 postfix_expression
7397 koenig_p,
7398 complain);
7401 {
7403 start_loc,
7404 close_paren_loc);
7406 }
7408 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7412 }
7417 /* postfix-expression . template [opt] id-expression
7418 postfix-expression . pseudo-destructor-name
7419 postfix-expression -> template [opt] id-expression
7420 postfix-expression -> pseudo-destructor-name */
7422 /* Consume the `.' or `->' operator. */
7425 postfix_expression
7427 postfix_expression,
7434 /* postfix-expression ++ */
7435 /* Consume the `++' token. */
7437 /* Generate a representation for the complete expression. */
7438 postfix_expression
7440 POSTINCREMENT_EXPR);
7441 /* Increments may not appear in constant-expressions. */
7449 /* postfix-expression -- */
7450 /* Consume the `--' token. */
7452 /* Generate a representation for the complete expression. */
7453 postfix_expression
7455 POSTDECREMENT_EXPR);
7456 /* Decrements may not appear in constant-expressions. */
7467 return is_member_access
7468 ? postfix_expression
7470 else
7472 }
7473 }
7475 /* We should never get here. */
7478 }
7480 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7481 by cp_parser_builtin_offsetof. We're looking for
7483 postfix-expression [ expression ]
7484 postfix-expression [ braced-init-list ] (C++11)
7486 FOR_OFFSETOF is set if we're being called in that context, which
7487 changes how we deal with integer constant expressions. */
7489 static tree
7491 tree postfix_expression,
7494 {
7499 /* Consume the `[' token. */
7505 /* Parse the index expression. */
7506 /* ??? For offsetof, there is a question of what to allow here. If
7507 offsetof is not being used in an integral constant expression context,
7508 then we *could* get the right answer by computing the value at runtime.
7509 If we are in an integral constant expression context, then we might
7510 could accept any constant expression; hard to say without analysis.
7511 Rather than open the barn door too wide right away, allow only integer
7512 constant expressions here. */
7515 else
7516 {
7518 {
7523 }
7524 else
7528 }
7532 /* Look for the closing `]'. */
7535 /* Build the ARRAY_REF. */
7539 /* When not doing offsetof, array references are not permitted in
7540 constant-expressions. */
7546 }
7548 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7549 dereference of incomplete type, returns true if error_mark_node should
7550 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7551 and *DEPENDENT_P. */
7553 bool
7556 {
7557 /* In a template, be permissive by treating an object expression
7558 of incomplete type as dependent (after a pedwarn). */
7559 diagnostic_t kind = (processing_template_decl
7563 {
7575 /* Don't emit any diagnostic for OVERLOADs. */
7579 /* Avoid clobbering e.g. DECLs. */
7583 }
7595 {
7598 }
7600 }
7602 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7603 by cp_parser_builtin_offsetof. We're looking for
7605 postfix-expression . template [opt] id-expression
7606 postfix-expression . pseudo-destructor-name
7607 postfix-expression -> template [opt] id-expression
7608 postfix-expression -> pseudo-destructor-name
7610 FOR_OFFSETOF is set if we're being called in that context. That sorta
7611 limits what of the above we'll actually accept, but nevermind.
7612 TOKEN_TYPE is the "." or "->" token, which will already have been
7613 removed from the stream. */
7615 static tree
7618 cp_expr postfix_expression,
7620 location_t location)
7621 {
7622 tree name;
7628 /* If this is a `->' operator, dereference the pointer. */
7631 tf_warning_or_error);
7632 /* Check to see whether or not the expression is type-dependent and
7633 not the current instantiation. */
7635 /* The identifier following the `->' or `.' is not qualified. */
7641 /* Enter the scope corresponding to the type of the object
7642 given by the POSTFIX_EXPRESSION. */
7644 {
7646 /* According to the standard, no expression should ever have
7647 reference type. Unfortunately, we do not currently match
7648 the standard in this respect in that our internal representation
7649 of an expression may have reference type even when the standard
7650 says it does not. Therefore, we have to manually obtain the
7651 underlying type here. */
7653 /* The type of the POSTFIX_EXPRESSION must be complete. */
7654 /* Unlike the object expression in other contexts, *this is not
7655 required to be of complete type for purposes of class member
7656 access (5.2.5) outside the member function body. */
7660 {
7666 }
7669 {
7670 /* Let the name lookup machinery know that we are processing a
7671 class member access expression. */
7673 /* If something went wrong, we want to be able to discern that case,
7674 as opposed to the case where there was no SCOPE due to the type
7675 of expression being dependent. */
7678 /* If the SCOPE was erroneous, make the various semantic analysis
7679 functions exit quickly -- and without issuing additional error
7680 messages. */
7683 }
7684 }
7687 /* Tell cp_parser_lookup_name that there was an object, even though it's
7688 type-dependent. */
7691 /* Assume this expression is not a pseudo-destructor access. */
7694 /* If the SCOPE is a scalar type, then, if this is a valid program,
7695 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7696 is type dependent, it can be pseudo-destructor-name or something else.
7697 Try to parse it as pseudo-destructor-name first. */
7699 {
7700 tree s;
7701 tree type;
7704 /* Parse the pseudo-destructor-name. */
7713 {
7715 postfix_expression
7718 }
7719 }
7722 {
7723 /* If the SCOPE is not a scalar type, we are looking at an
7724 ordinary class member access expression, rather than a
7725 pseudo-destructor-name. */
7728 /* Parse the id-expression. */
7729 name = (cp_parser_id_expression
7736 /* In general, build a SCOPE_REF if the member name is qualified.
7737 However, if the name was not dependent and has already been
7738 resolved; there is no need to build the SCOPE_REF. For example;
7740 struct X { void f(); };
7741 template <typename T> void f(T* t) { t->X::f(); }
7743 Even though "t" is dependent, "X::f" is not and has been resolved
7744 to a BASELINK; there is no need to include scope information. */
7746 /* But we do need to remember that there was an explicit scope for
7747 virtual function calls. */
7751 /* If the name is a template-id that names a type, we will get a
7752 TYPE_DECL here. That is invalid code. */
7754 {
7757 }
7758 else
7759 {
7761 {
7763 {
7767 }
7768 else
7771 name,
7772 template_p);
7776 }
7778 adjust_result_of_qualified_name_lookup
7780 postfix_expression
7782 template_p,
7783 tf_warning_or_error);
7784 /* Build a location e.g.:
7785 ptr->access_expr
7786 ~~~^~~~~~~~~~~~~
7787 where the caret is at the deref token, ranging from
7788 the start of postfix_expression to the end of the access expr. */
7789 location_t combined_loc
7792 }
7793 }
7795 /* We no longer need to look up names in the scope of the object on
7796 the left-hand side of the `.' or `->' operator. */
7799 /* Outside of offsetof, these operators may not appear in
7800 constant-expressions. */
7802 && (cp_parser_non_integral_constant_expression
7807 }
7809 /* Parse a parenthesized expression-list.
7811 expression-list:
7812 assignment-expression
7813 expression-list, assignment-expression
7815 attribute-list:
7816 expression-list
7817 identifier
7818 identifier, expression-list
7820 CAST_P is true if this expression is the target of a cast.
7822 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7823 argument pack.
7825 WRAP_LOCATIONS_P is true if expressions within this list for which
7826 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7827 their source locations.
7829 Returns a vector of trees. Each element is a representation of an
7830 assignment-expression. NULL is returned if the ( and or ) are
7831 missing. An empty, but allocated, vector is returned on no
7832 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7833 if we are parsing an attribute list for an attribute that wants a
7834 plain identifier argument, normal_attr for an attribute that wants
7835 an expression, or non_attr if we aren't parsing an attribute list. If
7836 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7837 not all of the expressions in the list were constant.
7838 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7839 will be written to with the location of the closing parenthesis. If
7840 an error occurs, it may or may not be written to. */
7850 {
7856 /* Assume all the expressions will be constant. */
7860 matching_parens parens;
7866 /* Within a parenthesized expression, a `>' token is always
7867 the greater-than operator. */
7868 saved_greater_than_is_operator_p
7874 /* Consume expressions until there are no more. */
7877 {
7878 /* At the beginning of attribute lists, check to see if the
7879 next token is an identifier. */
7882 {
7885 /* Consume the identifier. */
7887 /* Save the identifier. */
7889 }
7890 else
7891 {
7894 /* Parse the next assignment-expression. */
7896 {
7897 /* A braced-init-list. */
7903 }
7905 {
7906 expr = (cp_parser_constant_expression
7911 }
7912 else
7914 cast_p);
7919 /* If we have an ellipsis, then this is an expression
7920 expansion. */
7923 {
7924 /* Consume the `...'. */
7927 /* Build the argument pack. */
7929 }
7934 /* Add it to the list. We add error_mark_node
7935 expressions to the list, so that we can still tell if
7936 the correct form for a parenthesized expression-list
7937 is found. That gives better errors. */
7942 }
7944 /* After the first item, attribute lists look the same as
7945 expression lists. */
7948 get_comma:;
7949 /* If the next token isn't a `,', then we are done. */
7953 /* Otherwise, consume the `,' and keep going. */
7955 }
7961 {
7964 skip_comma:;
7965 /* We try and resync to an unnested comma, as that will give the
7966 user better diagnostics. */
7974 {
7975 parser->greater_than_is_operator_p
7978 }
7979 }
7981 parser->greater_than_is_operator_p
7988 }
7990 /* Parse a pseudo-destructor-name.
7992 pseudo-destructor-name:
7993 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7994 :: [opt] nested-name-specifier template template-id :: ~ type-name
7995 :: [opt] nested-name-specifier [opt] ~ type-name
7997 If either of the first two productions is used, sets *SCOPE to the
7998 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7999 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
8000 or ERROR_MARK_NODE if the parse fails. */
8002 static void
8004 tree object,
8007 {
8010 /* Handle ~auto. */
8014 {
8017 "%<~auto%> only available with "
8024 }
8026 /* Assume that things will not work out. */
8029 /* Look for the optional `::' operator. */
8031 /* Look for the optional nested-name-specifier. */
8032 nested_name_specifier_p
8039 /* Now, if we saw a nested-name-specifier, we might be doing the
8040 second production. */
8043 {
8044 /* Consume the `template' keyword. */
8046 /* Parse the template-id. */
8050 class_type,
8052 /* Look for the `::' token. */
8054 }
8055 /* If the next token is not a `~', then there might be some
8056 additional qualification. */
8058 {
8059 /* At this point, we're looking for "type-name :: ~". The type-name
8060 must not be a class-name, since this is a pseudo-destructor. So,
8061 it must be either an enum-name, or a typedef-name -- both of which
8062 are just identifiers. So, we peek ahead to check that the "::"
8063 and "~" tokens are present; if they are not, then we can avoid
8064 calling type_name. */
8068 {
8071 }
8073 /* Look for the type-name. */
8078 /* Look for the `::' token. */
8080 }
8081 else
8084 /* Look for the `~'. */
8087 /* Once we see the ~, this has to be a pseudo-destructor. */
8091 /* Look for the type-name again. We are not responsible for
8092 checking that it matches the first type-name. */
8094 }
8096 /* Parse a unary-expression.
8098 unary-expression:
8099 postfix-expression
8100 ++ cast-expression
8101 -- cast-expression
8102 unary-operator cast-expression
8103 sizeof unary-expression
8104 sizeof ( type-id )
8105 alignof ( type-id ) [C++0x]
8106 new-expression
8107 delete-expression
8109 GNU Extensions:
8111 unary-expression:
8112 __extension__ cast-expression
8113 __alignof__ unary-expression
8114 __alignof__ ( type-id )
8115 alignof unary-expression [C++0x]
8116 __real__ cast-expression
8117 __imag__ cast-expression
8118 && identifier
8119 sizeof ( type-id ) { initializer-list , [opt] }
8120 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
8121 __alignof__ ( type-id ) { initializer-list , [opt] }
8123 ADDRESS_P is true iff the unary-expression is appearing as the
8124 operand of the `&' operator. CAST_P is true if this expression is
8125 the target of a cast.
8127 Returns a representation of the expression. */
8129 static cp_expr
8132 {
8136 /* Peek at the next token. */
8138 /* Some keywords give away the kind of expression. */
8140 {
8144 {
8147 {
8155 /* Consume the token. */
8157 /* Parse the operand. */
8163 else
8164 {
8165 /* ISO C++ defines alignof only with types, not with
8166 expressions. So pedwarn if alignof is used with a non-
8167 type expression. However, __alignof__ is ok. */
8170 "ISO C++ does not allow %<alignof%> "
8174 }
8175 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8176 SIZEOF_EXPR with the original operand. */
8178 {
8180 {
8182 {
8185 error_mark_node));
8187 }
8188 else
8192 }
8193 }
8195 /* Construct a location e.g. :
8196 alignof (expr)
8197 ^~~~~~~~~~~~~~
8198 with start == caret at the start of the "alignof"/"sizeof"
8199 token, with the endpoint at the final closing paren. */
8200 location_t compound_loc
8207 }
8219 {
8220 /* The saved value of the PEDANTIC flag. */
8222 tree expr;
8224 /* Save away the PEDANTIC flag. */
8226 /* Parse the cast-expression. */
8228 /* Restore the PEDANTIC flag. */
8232 }
8236 {
8237 tree expression;
8239 /* Consume the `__real__' or `__imag__' token. */
8241 /* Parse the cast-expression. */
8243 /* Create the complete representation. */
8247 expression,
8248 tf_warning_or_error);
8249 }
8257 {
8258 tree expr;
8267 matching_parens parens;
8271 parser->type_definition_forbidden_message
8274 saved_integral_constant_expression_p
8276 saved_non_integral_constant_expression_p
8280 saved_greater_than_is_operator_p
8292 parser->greater_than_is_operator_p
8295 parser->integral_constant_expression_p
8297 parser->non_integral_constant_expression_p
8304 /* Construct a location of the form:
8305 noexcept (expr)
8306 ^~~~~~~~~~~~~~~
8307 with start == caret, finishing at the close-paren. */
8308 location_t noexcept_loc
8312 noexcept_loc);
8313 }
8317 }
8318 }
8320 /* Look for the `:: new' and `:: delete', which also signal the
8321 beginning of a new-expression, or delete-expression,
8322 respectively. If the next token is `::', then it might be one of
8323 these. */
8325 {
8328 /* See if the token after the `::' is one of the keywords in
8329 which we're interested. */
8331 /* If it's `new', we have a new-expression. */
8334 /* Similarly, for `delete'. */
8337 }
8339 /* Look for a unary operator. */
8341 /* The `++' and `--' operators can be handled similarly, even though
8342 they are not technically unary-operators in the grammar. */
8344 {
8349 /* Handle the GNU address-of-label extension. */
8352 {
8353 tree identifier;
8354 tree expression;
8357 /* Consume the '&&' token. */
8359 /* Look for the identifier. */
8361 /* Construct a location of the form:
8362 &&label
8363 ^~~~~~~
8364 with caret==start at the "&&", finish at the end of the label. */
8365 location_t combined_loc
8367 /* Create an expression representing the address. */
8370 NIC_ADDR_LABEL))
8373 }
8374 }
8376 {
8377 cp_expr cast_expression;
8383 /* Consume the operator token. */
8387 /* Parse the cast-expression. */
8388 cast_expression
8393 pidk);
8395 /* Make a location:
8396 OP_TOKEN CAST_EXPRESSION
8397 ^~~~~~~~~~~~~~~~~~~~~~~~~
8398 with start==caret at the operator token, and
8399 extending to the end of the cast_expression. */
8402 /* Now, build an appropriate representation. */
8404 {
8408 RO_UNARY_STAR,
8409 complain);
8410 /* TODO: build_x_indirect_ref does not always honor the
8411 location, so ensure it is set. */
8417 /* Fall through. */
8420 cast_expression,
8421 complain);
8422 /* TODO: build_x_unary_op does not always honor the location,
8423 so ensure it is set. */
8431 /* Fall through. */
8433 /* Immediately fold negation of a constant, unless the constant is 0
8434 (since -0 == 0) or it would overflow. */
8436 {
8437 tree stripped_expr
8442 {
8445 stripped_expr);
8447 {
8450 }
8451 }
8452 }
8453 /* Fall through. */
8462 }
8466 non_constant_p))
8470 }
8474 decltype_p,
8475 pidk);
8476 }
8478 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8479 unary-operator, the corresponding tree code is returned. */
8481 static enum tree_code
8483 {
8485 {
8506 }
8507 }
8509 /* Parse a __builtin_has_attribute([expr|type], attribute-spec) expression.
8510 Returns a representation of the expression. */
8512 static tree
8514 {
8517 /* Consume the __builtin_has_attribute token. */
8520 matching_parens parens;
8524 /* Types cannot be defined in a `sizeof' expression. Save away the
8525 old message. */
8529 parser->type_definition_forbidden_message
8531 parser->type_definition_forbidden_message_arg
8534 /* The restrictions on constant-expressions do not apply inside
8535 sizeof expressions. */
8536 bool saved_integral_constant_expression_p
8538 bool saved_non_integral_constant_expression_p
8542 /* Do not actually evaluate the expression. */
8548 /* We can't be sure yet whether we're looking at a type-id or an
8549 expression. */
8554 /* Look for the type-id. */
8560 /* If the type-id production did not work out, then we must be
8561 looking at an expression. */
8567 /* Go back to evaluating expressions. */
8571 /* And restore the old one. */
8574 parser->integral_constant_expression_p
8576 parser->non_integral_constant_expression_p
8579 /* Consume the comma if it's there. */
8581 {
8585 }
8587 /* Parse the attribute specification. */
8591 {
8593 {
8594 /* Fold constant expressions used in attributes first. */
8597 /* Finally, see if OPER has been declared with ATTR. */
8599 }
8602 }
8603 else
8604 {
8607 }
8609 /* Construct a location e.g. :
8610 __builtin_has_attribute (oper, attr)
8611 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
8612 with start == caret at the start of the built-in token,
8613 and with the endpoint at the final closing paren. */
8614 location_t compound_loc
8621 }
8623 /* Parse a new-expression.
8625 new-expression:
8626 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8627 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8629 Returns a representation of the expression. */
8631 static tree
8633 {
8636 tree type;
8639 tree ret;
8643 /* Look for the optional `::' operator. */
8644 global_scope_p
8648 /* Look for the `new' operator. */
8650 /* There's no easy way to tell a new-placement from the
8651 `( type-id )' construct. */
8653 /* Look for a new-placement. */
8655 /* If that didn't work out, there's no new-placement. */
8657 {
8661 }
8663 /* If the next token is a `(', then we have a parenthesized
8664 type-id. */
8666 {
8670 /* Consume the `('. */
8671 matching_parens parens;
8674 /* Parse the type-id. */
8675 parser->type_definition_forbidden_message
8677 {
8680 }
8683 /* Look for the closing `)'. */
8686 /* There should not be a direct-new-declarator in this production,
8687 but GCC used to allowed this, so we check and emit a sensible error
8688 message for this case. */
8690 {
8696 }
8697 }
8698 /* Otherwise, there must be a new-type-id. */
8699 else
8702 /* If the next token is a `(' or '{', then we have a new-initializer. */
8707 else
8710 /* A new-expression may not appear in an integral constant
8711 expression. */
8714 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8715 of a new-type-id or type-id of a new-expression, the new-expression shall
8716 contain a new-initializer of the form ( assignment-expression )".
8717 Additionally, consistently with the spirit of DR 1467, we want to accept
8718 'new auto { 2 }' too. */
8724 {
8726 "initialization of new-expression for type %<auto%> "
8729 }
8730 else
8731 {
8732 /* Construct a location e.g.:
8733 ptr = new int[100]
8734 ^~~~~~~~~~~~
8735 with caret == start at the start of the "new" token, and the end
8736 at the end of the final token we consumed. */
8740 /* Create a representation of the new-expression. */
8742 tf_warning_or_error);
8744 }
8752 }
8754 /* Parse a new-placement.
8756 new-placement:
8757 ( expression-list )
8759 Returns the same representation as for an expression-list. */
8763 {
8766 /* Parse the expression-list. */
8767 expression_list = (cp_parser_parenthesized_expression_list
8776 }
8778 /* Parse a new-type-id.
8780 new-type-id:
8781 type-specifier-seq new-declarator [opt]
8783 Returns the TYPE allocated. If the new-type-id indicates an array
8784 type, *NELTS is set to the number of elements in the last array
8785 bound; the TYPE will not include the last array bound. */
8787 static tree
8789 {
8790 cp_decl_specifier_seq type_specifier_seq;
8796 /* The type-specifier sequence must not contain type definitions.
8797 (It cannot contain declarations of new types either, but if they
8798 are not definitions we will catch that because they are not
8799 complete.) */
8801 parser->type_definition_forbidden_message
8803 /* Parse the type-specifier-seq. */
8808 /* Restore the old message. */
8814 /* Parse the new-declarator. */
8817 /* Determine the number of elements in the last array dimension, if
8818 any. */
8820 /* Skip down to the last array dimension. */
8825 {
8828 }
8833 {
8836 }
8839 {
8846 else
8848 }
8851 }
8853 /* Parse an (optional) new-declarator.
8855 new-declarator:
8856 ptr-operator new-declarator [opt]
8857 direct-new-declarator
8859 Returns the declarator. */
8863 {
8866 cp_cv_quals cv_quals;
8868 /* We don't know if there's a ptr-operator next, or not. */
8870 /* Look for a ptr-operator. */
8872 /* If that worked, look for more new-declarators. */
8874 {
8877 /* Parse another optional declarator. */
8880 declarator = cp_parser_make_indirect_declarator
8884 }
8886 /* If the next token is a `[', there is a direct-new-declarator. */
8891 }
8893 /* Parse a direct-new-declarator.
8895 direct-new-declarator:
8896 [ expression ]
8897 direct-new-declarator [constant-expression]
8899 */
8903 {
8907 {
8908 tree expression;
8911 /* Look for the opening `['. */
8916 /* The standard requires that the expression have integral
8917 type. DR 74 adds enumeration types. We believe that the
8918 real intent is that these expressions be handled like the
8919 expression in a `switch' condition, which also allows
8920 classes with a single conversion to integral or
8921 enumeration type. */
8923 {
8924 expression
8926 expression,
8929 {
8931 "expression in new-declarator must have integral "
8934 }
8935 }
8937 /* Look for the closing `]'. */
8940 /* Add this bound to the declarator. */
8943 /* If the next token is not a `[', then there are no more
8944 bounds. */
8947 }
8950 }
8952 /* Parse a new-initializer.
8954 new-initializer:
8955 ( expression-list [opt] )
8956 braced-init-list
8958 Returns a representation of the expression-list. */
8962 {
8966 {
8967 tree t;
8974 }
8975 else
8976 expression_list = (cp_parser_parenthesized_expression_list
8982 }
8984 /* Parse a delete-expression.
8986 delete-expression:
8987 :: [opt] delete cast-expression
8988 :: [opt] delete [ ] cast-expression
8990 Returns a representation of the expression. */
8992 static tree
8994 {
8997 tree expression;
8999 /* Look for the optional `::' operator. */
9000 global_scope_p
9004 /* Look for the `delete' keyword. */
9006 /* See if the array syntax is in use. */
9008 {
9009 /* Consume the `[' token. */
9011 /* Look for the `]' token. */
9013 /* Remember that this is the `[]' construct. */
9015 }
9016 else
9019 /* Parse the cast-expression. */
9022 /* A delete-expression may not appear in an integral constant
9023 expression. */
9028 tf_warning_or_error);
9029 }
9031 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
9032 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
9033 0 otherwise. */
9035 static int
9037 {
9040 {
9082 /* In ((type ()) () the last () isn't a valid cast-expression,
9083 so the whole must be parsed as postfix-expression. */
9088 /* '[' may start a primary-expression in obj-c++ and in C++11,
9089 as a lambda-expression, eg, '(void)[]{}'. */
9096 /* '++' and '--' may or may not start a cast-expression:
9098 struct T { void operator++(int); };
9099 void f() { (T())++; }
9101 vs
9103 int a;
9104 (int)++a; */
9109 }
9110 }
9112 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
9113 in the order: const_cast, static_cast, reinterpret_cast.
9115 Don't suggest dynamic_cast.
9117 Return the first legal cast kind found, or NULL otherwise. */
9121 {
9122 tree trial;
9124 /* Reuse the parser logic by attempting to build the various kinds of
9125 cast, with "complain" disabled.
9126 Identify the first such cast that is valid. */
9128 /* Don't attempt to run such logic within template processing. */
9132 /* First try const_cast. */
9137 /* If that fails, try static_cast. */
9142 /* Finally, try reinterpret_cast. */
9147 /* No such cast possible. */
9149 }
9151 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
9152 suggesting how to convert a C-style cast of the form:
9154 (DST_TYPE)ORIG_EXPR
9156 to a C++-style cast.
9158 The primary range of RICHLOC is asssumed to be that of the original
9159 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
9160 of the parens in the C-style cast. */
9162 static void
9165 tree dst_type)
9166 {
9167 /* This function is non-trivial, so bail out now if the warning isn't
9168 going to be emitted. */
9172 /* Try to find a legal C++ cast, trying them in order:
9173 const_cast, static_cast, reinterpret_cast. */
9178 /* Replace the open paren with "CAST_SUGGESTION<". */
9179 pretty_printer pp;
9183 /* Replace the close paren with "> (". */
9186 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
9188 }
9191 /* Parse a cast-expression.
9193 cast-expression:
9194 unary-expression
9195 ( type-id ) cast-expression
9197 ADDRESS_P is true iff the unary-expression is appearing as the
9198 operand of the `&' operator. CAST_P is true if this expression is
9199 the target of a cast.
9201 Returns a representation of the expression. */
9203 static cp_expr
9206 {
9207 /* If it's a `(', then we might be looking at a cast. */
9209 {
9215 /* There's no way to know yet whether or not this is a cast.
9216 For example, `(int (3))' is a unary-expression, while `(int)
9217 3' is a cast. So, we resort to parsing tentatively. */
9219 /* Types may not be defined in a cast. */
9221 parser->type_definition_forbidden_message
9223 /* Consume the `('. */
9224 matching_parens parens;
9229 /* A very tricky bit is that `(struct S) { 3 }' is a
9230 compound-literal (which we permit in C++ as an extension).
9231 But, that construct is not a cast-expression -- it is a
9232 postfix-expression. (The reason is that `(struct S) { 3 }.i'
9233 is legal; if the compound-literal were a cast-expression,
9234 you'd need an extra set of parentheses.) But, if we parse
9235 the type-id, and it happens to be a class-specifier, then we
9236 will commit to the parse at that point, because we cannot
9237 undo the action that is done when creating a new class. So,
9238 then we cannot back up and do a postfix-expression.
9240 Another tricky case is the following (c++/29234):
9242 struct S { void operator () (); };
9244 void foo ()
9245 {
9246 ( S()() );
9247 }
9249 As a type-id we parse the parenthesized S()() as a function
9250 returning a function, groktypename complains and we cannot
9251 back up in this case either.
9253 Therefore, we scan ahead to the closing `)', and check to see
9254 if the tokens after the `)' can start a cast-expression. Otherwise
9255 we are dealing with an unary-expression, a postfix-expression
9256 or something else.
9258 Yet another tricky case, in C++11, is the following (c++/54891):
9260 (void)[]{};
9262 The issue is that usually, besides the case of lambda-expressions,
9263 the parenthesized type-id cannot be followed by '[', and, eg, we
9264 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
9265 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
9266 we don't commit, we try a cast-expression, then an unary-expression.
9268 Save tokens so that we can put them back. */
9271 /* We may be looking at a cast-expression. */
9274 cast_expression
9277 /* Roll back the tokens we skipped. */
9279 /* If we aren't looking at a cast-expression, simulate an error so
9280 that the call to cp_parser_error_occurred below returns true. */
9283 else
9284 {
9287 /* Look for the type-id. */
9289 /* Look for the closing `)'. */
9294 }
9296 /* Restore the saved message. */
9299 /* At this point this can only be either a cast or a
9300 parenthesized ctor such as `(T ())' that looks like a cast to
9301 function returning T. */
9303 {
9304 /* Only commit if the cast-expression doesn't start with
9305 '++', '--', or '[' in C++11. */
9313 pidk);
9316 {
9317 /* Warn about old-style casts, if so requested. */
9322 {
9328 }
9330 /* Only type conversions to integral or enumeration types
9331 can be used in constant-expressions. */
9334 NIC_CAST))
9337 /* Perform the cast. */
9338 /* Make a location:
9339 (TYPE) EXPR
9340 ^~~~~~~~~~~
9341 with start==caret at the open paren, extending to the
9342 end of "expr". */
9344 open_paren_loc,
9348 }
9349 }
9350 else
9352 }
9354 /* If we get here, then it's not a cast, so it must be a
9355 unary-expression. */
9358 }
9360 /* Parse a binary expression of the general form:
9362 pm-expression:
9363 cast-expression
9364 pm-expression .* cast-expression
9365 pm-expression ->* cast-expression
9367 multiplicative-expression:
9368 pm-expression
9369 multiplicative-expression * pm-expression
9370 multiplicative-expression / pm-expression
9371 multiplicative-expression % pm-expression
9373 additive-expression:
9374 multiplicative-expression
9375 additive-expression + multiplicative-expression
9376 additive-expression - multiplicative-expression
9378 shift-expression:
9379 additive-expression
9380 shift-expression << additive-expression
9381 shift-expression >> additive-expression
9383 relational-expression:
9384 shift-expression
9385 relational-expression < shift-expression
9386 relational-expression > shift-expression
9387 relational-expression <= shift-expression
9388 relational-expression >= shift-expression
9390 GNU Extension:
9392 relational-expression:
9393 relational-expression <? shift-expression
9394 relational-expression >? shift-expression
9396 equality-expression:
9397 relational-expression
9398 equality-expression == relational-expression
9399 equality-expression != relational-expression
9401 and-expression:
9402 equality-expression
9403 and-expression & equality-expression
9405 exclusive-or-expression:
9406 and-expression
9407 exclusive-or-expression ^ and-expression
9409 inclusive-or-expression:
9410 exclusive-or-expression
9411 inclusive-or-expression | exclusive-or-expression
9413 logical-and-expression:
9414 inclusive-or-expression
9415 logical-and-expression && inclusive-or-expression
9417 logical-or-expression:
9418 logical-and-expression
9419 logical-or-expression || logical-and-expression
9421 All these are implemented with a single function like:
9423 binary-expression:
9424 simple-cast-expression
9425 binary-expression <token> binary-expression
9427 CAST_P is true if this expression is the target of a cast.
9429 The binops_by_token map is used to get the tree codes for each <token> type.
9430 binary-expressions are associated according to a precedence table. */
9432 #define TOKEN_PRECEDENCE(token) \
9433 (((token->type == CPP_GREATER \
9434 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9435 && !parser->greater_than_is_operator_p) \
9436 ? PREC_NOT_OPERATOR \
9437 : binops_by_token[token->type].prec)
9439 static cp_expr
9445 {
9446 cp_parser_expression_stack stack;
9449 cp_parser_expression_stack_entry current;
9450 cp_expr rhs;
9454 tree overload;
9456 /* Parse the first expression. */
9467 {
9468 /* Get an operator token. */
9474 {
9476 "%<>>%> operator is treated"
9480 }
9485 /* This is a fold-expression; handle it later. */
9488 /* Popping an entry off the stack means we completed a subexpression:
9489 - either we found a token which is not an operator (`>' where it is not
9490 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9491 will happen repeatedly;
9492 - or, we found an operator which has lower priority. This is the case
9493 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9494 parsing `3 * 4'. */
9496 {
9499 else
9501 }
9503 get_rhs:
9507 /* We used the operator token. */
9510 /* For "false && x" or "true || x", x will never be executed;
9511 disable warnings while evaluating it. */
9516 {
9519 }
9521 /* Extract another operand. It may be the RHS of this expression
9522 or the LHS of a new, higher priority expression. */
9527 /* Get another operator token. Look up its precedence to avoid
9528 building a useless (immediately popped) stack entry for common
9529 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9536 {
9537 /* ... and prepare to parse the RHS of the new, higher priority
9538 expression. Since precedence levels on the stack are
9539 monotonically increasing, we do not have to care about
9540 stack overflows. */
9549 pop:
9551 /* If the stack is not empty, we have parsed into LHS the right side
9552 (`4' in the example above) of an expression we had suspended.
9553 We can use the information on the stack to recover the LHS (`3')
9554 from the stack together with the tree code (`MULT_EXPR'), and
9555 the precedence of the higher level subexpression
9556 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9557 which will be used to actually build the additive expression. */
9562 }
9564 /* Undo the disabling of warnings done above. */
9566 {
9569 }
9574 /* Avoid warning for !!x == y. */
9579 /* Avoid warning for !b == y where b is boolean. */
9583 /* Avoid warning for !!b == y where b is boolean. */
9596 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9597 ERROR_MARK for everything that is not a binary expression.
9598 This makes warn_about_parentheses miss some warnings that
9599 involve unary operators. For unary expressions we should
9600 pass the correct tree_code unless the unary expression was
9601 surrounded by parentheses.
9602 */
9606 {
9609 else
9610 {
9611 current.lhs
9614 == tcc_comparison
9618 }
9619 }
9620 else
9621 {
9627 /* TODO: build_x_binary_op doesn't always honor the location. */
9629 }
9632 /* If the binary operator required the use of an overloaded operator,
9633 then this expression cannot be an integral constant-expression.
9634 An overloaded operator can be used even if both operands are
9635 otherwise permissible in an integral constant-expression if at
9636 least one of the operands is of enumeration type. */
9640 NIC_OVERLOADED))
9642 }
9645 }
9647 static cp_expr
9652 {
9655 }
9657 /* Parse the `? expression : assignment-expression' part of a
9658 conditional-expression. The LOGICAL_OR_EXPR is the
9659 logical-or-expression that started the conditional-expression.
9660 Returns a representation of the entire conditional-expression.
9662 This routine is used by cp_parser_assignment_expression.
9664 ? expression : assignment-expression
9666 GNU Extensions:
9668 ? : assignment-expression */
9670 static tree
9672 {
9674 cp_expr assignment_expr;
9678 /* Consume the `?' token. */
9683 {
9686 /* Implicit true clause. */
9688 c_inhibit_evaluation_warnings +=
9691 }
9692 else
9693 {
9696 /* Parse the expression. */
9697 c_inhibit_evaluation_warnings +=
9700 c_inhibit_evaluation_warnings +=
9704 }
9706 /* The next token should be a `:'. */
9708 /* Parse the assignment-expression. */
9710 c_inhibit_evaluation_warnings -=
9713 /* Make a location:
9714 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9715 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9716 with the caret at the "?", ranging from the start of
9717 the logical_or_expr to the end of the assignment_expr. */
9722 /* Build the conditional-expression. */
9724 expr,
9725 assignment_expr,
9726 tf_warning_or_error);
9727 }
9729 /* Parse an assignment-expression.
9731 assignment-expression:
9732 conditional-expression
9733 logical-or-expression assignment-operator assignment_expression
9734 throw-expression
9736 CAST_P is true if this expression is the target of a cast.
9737 DECLTYPE_P is true if this expression is the operand of decltype.
9739 Returns a representation for the expression. */
9741 static cp_expr
9744 {
9745 cp_expr expr;
9747 /* If the next token is the `throw' keyword, then we're looking at
9748 a throw-expression. */
9751 /* Otherwise, it must be that we are looking at a
9752 logical-or-expression. */
9753 else
9754 {
9755 /* Parse the binary expressions (logical-or-expression). */
9757 decltype_p,
9759 /* If the next token is a `?' then we're actually looking at a
9760 conditional-expression. */
9763 else
9764 {
9767 /* If it's an assignment-operator, we're using the second
9768 production. */
9769 enum tree_code assignment_operator
9772 {
9775 /* Parse the right-hand side of the assignment. */
9782 /* An assignment may not appear in a
9783 constant-expression. */
9785 NIC_ASSIGNMENT))
9787 /* Build the assignment expression. Its default
9788 location:
9789 LHS = RHS
9790 ~~~~^~~~~
9791 is the location of the '=' token as the
9792 caret, ranging from the start of the lhs to the
9793 end of the rhs. */
9798 assignment_operator,
9799 rhs,
9801 /* TODO: build_x_modify_expr doesn't honor the location,
9802 so we must set it here. */
9804 }
9805 }
9806 }
9809 }
9811 /* Parse an (optional) assignment-operator.
9813 assignment-operator: one of
9814 = *= /= %= += -= >>= <<= &= ^= |=
9816 GNU Extension:
9818 assignment-operator: one of
9819 <?= >?=
9821 If the next token is an assignment operator, the corresponding tree
9822 code is returned, and the token is consumed. For example, for
9823 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9824 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9825 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9826 operator, ERROR_MARK is returned. */
9828 static enum tree_code
9830 {
9834 /* Peek at the next token. */
9838 {
9884 /* Nothing else is an assignment operator. */
9886 }
9888 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9893 /* If it was an assignment operator, consume it. */
9898 }
9900 /* Parse an expression.
9902 expression:
9903 assignment-expression
9904 expression , assignment-expression
9906 CAST_P is true if this expression is the target of a cast.
9907 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9908 except possibly parenthesized or on the RHS of a comma (N3276).
9909 WARN_COMMA_P is true if a comma should be diagnosed.
9911 Returns a representation of the expression. */
9913 static cp_expr
9916 {
9921 {
9922 cp_expr assignment_expression;
9924 /* Parse the next assignment-expression. */
9925 assignment_expression
9928 /* We don't create a temporary for a call that is the immediate operand
9929 of decltype or on the RHS of a comma. But when we see a comma, we
9930 need to create a temporary for a call on the LHS. */
9935 assignment_expression
9939 /* If this is the first assignment-expression, we can just
9940 save it away. */
9943 else
9944 {
9945 /* Create a location with caret at the comma, ranging
9946 from the start of the LHS to the end of the RHS. */
9951 assignment_expression,
9954 }
9955 /* If the next token is not a comma, or we're in a fold-expression, then
9956 we are done with the expression. */
9960 /* Consume the `,'. */
9963 {
9964 /* [depr.comma.subscript]: A comma expression appearing as
9965 the expr-or-braced-init-list of a subscripting expression
9966 is deprecated. A parenthesized comma expression is not
9967 deprecated. */
9969 "top-level comma expression in array subscript "
9972 }
9974 /* A comma operator cannot appear in a constant-expression. */
9977 }
9980 }
9982 /* Parse a constant-expression.
9984 constant-expression:
9985 conditional-expression
9987 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9988 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9989 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9990 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9991 only parse a conditional-expression, otherwise parse an
9992 assignment-expression. See below for rationale. */
9994 static cp_expr
9999 {
10003 cp_expr expression;
10005 /* It might seem that we could simply parse the
10006 conditional-expression, and then check to see if it were
10007 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
10008 one that the compiler can figure out is constant, possibly after
10009 doing some simplifications or optimizations. The standard has a
10010 precise definition of constant-expression, and we must honor
10011 that, even though it is somewhat more restrictive.
10013 For example:
10015 int i[(2, 3)];
10017 is not a legal declaration, because `(2, 3)' is not a
10018 constant-expression. The `,' operator is forbidden in a
10019 constant-expression. However, GCC's constant-folding machinery
10020 will fold this operation to an INTEGER_CST for `3'. */
10022 /* Save the old settings. */
10024 saved_allow_non_integral_constant_expression_p
10027 /* We are now parsing a constant-expression. */
10029 parser->allow_non_integral_constant_expression_p
10032 /* Although the grammar says "conditional-expression", when not STRICT_P,
10033 we parse an "assignment-expression", which also permits
10034 "throw-expression" and the use of assignment operators. In the case
10035 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
10036 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
10037 actually essential that we look for an assignment-expression.
10038 For example, cp_parser_initializer_clauses uses this function to
10039 determine whether a particular assignment-expression is in fact
10040 constant. */
10042 {
10043 /* Parse the binary expressions (logical-or-expression). */
10046 /* If the next token is a `?' then we're actually looking at
10047 a conditional-expression; otherwise we're done. */
10050 }
10051 else
10053 /* Restore the old settings. */
10054 parser->integral_constant_expression_p
10056 parser->allow_non_integral_constant_expression_p
10059 {
10060 /* Require an rvalue constant expression here; that's what our
10061 callers expect. Reference constant expressions are handled
10062 separately in e.g. cp_parser_template_argument. */
10071 }
10074 parser->non_integral_constant_expression_p
10078 }
10080 /* Parse __builtin_offsetof.
10082 offsetof-expression:
10083 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
10085 offsetof-member-designator:
10086 id-expression
10087 | offsetof-member-designator "." id-expression
10088 | offsetof-member-designator "[" expression "]"
10089 | offsetof-member-designator "->" id-expression */
10091 static cp_expr
10093 {
10095 tree type;
10096 cp_expr expr;
10097 cp_id_kind dummy;
10099 location_t finish_loc;
10101 /* We're about to accept non-integral-constant things, but will
10102 definitely yield an integral constant expression. Save and
10103 restore these values around our local parsing. */
10109 /* Consume the "__builtin_offsetof" token. */
10111 /* Consume the opening `('. */
10112 matching_parens parens;
10114 /* Parse the type-id. */
10116 {
10118 parser->type_definition_forbidden_message
10122 }
10123 /* Look for the `,'. */
10127 /* Build the (type *)null that begins the traditional offsetof macro. */
10128 tree object_ptr
10130 tf_warning_or_error);
10132 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
10136 {
10139 {
10141 /* offsetof-member-designator "[" expression "]" */
10147 /* offsetof-member-designator "->" identifier */
10150 /* FALLTHRU */
10153 /* offsetof-member-designator "." identifier */
10161 /* Consume the ")" token. */
10167 /* Error. We know the following require will fail, but
10168 that gives the proper error message. */
10173 }
10174 }
10176 success:
10177 /* Make a location of the form:
10178 __builtin_offsetof (struct s, f)
10179 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
10180 with caret at the type-id, ranging from the start of the
10181 "_builtin_offsetof" token to the close paren. */
10183 /* The result will be an INTEGER_CST, so we need to explicitly
10184 preserve the location. */
10187 failure:
10193 }
10195 /* Parse a trait expression.
10197 Returns a representation of the expression, the underlying type
10198 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
10200 static cp_expr
10202 {
10203 cp_trait_kind kind;
10209 {
10311 }
10313 /* Get location of initial token. */
10316 /* Consume the token. */
10319 matching_parens parens;
10322 {
10325 }
10331 {
10334 {
10337 }
10341 }
10343 {
10345 {
10349 {
10352 }
10356 }
10357 }
10362 /* Construct a location of the form:
10363 __is_trivially_copyable(_Tp)
10364 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10365 with start == caret, finishing at the close-paren. */
10368 /* Complete the trait expression, which may mean either processing
10369 the trait expr now or saving it for template instantiation. */
10371 {
10380 }
10381 }
10383 /* Parse a lambda expression.
10385 lambda-expression:
10386 lambda-introducer lambda-declarator [opt] compound-statement
10388 Returns a representation of the expression. */
10390 static cp_expr
10392 {
10394 tree type;
10404 {
10406 {
10408 "lambda-expression in unevaluated context"
10411 }
10413 }
10415 {
10417 {
10421 }
10423 }
10425 /* We may be in the middle of deferred access check. Disable
10426 it now. */
10439 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10442 /* Now that we've started the type, add the capture fields for any
10443 explicit captures. */
10446 {
10447 /* Inside the class, surrounding template-parameter-lists do not apply. */
10448 unsigned int saved_num_template_parameter_lists
10452 bool fully_implicit_function_template_p
10456 bool auto_is_implicit_function_template_parm_p
10467 /* By virtue of defining a local class, a lambda expression has access to
10468 the private variables of enclosing classes. */
10479 {
10481 }
10483 {
10486 }
10488 /* The capture list was built up in reverse order; fix that now. */
10500 parser->fully_implicit_function_template_p
10504 parser->auto_is_implicit_function_template_parm_p
10506 }
10508 /* This field is only used during parsing of the lambda. */
10511 /* This lambda shouldn't have any proxies left at this point. */
10513 /* And now that we're done, push proxies for an enclosing lambda. */
10516 /* Update the lambda expression to a range. */
10523 else
10531 }
10533 /* Parse the beginning of a lambda expression.
10535 lambda-introducer:
10536 [ lambda-capture [opt] ]
10538 LAMBDA_EXPR is the current representation of the lambda expression. */
10540 static void
10542 {
10543 /* Need commas after the first capture. */
10546 /* Eat the leading `['. */
10549 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10558 {
10564 }
10569 {
10571 tree capture_id;
10572 tree capture_init_expr;
10576 enum capture_kind_type
10577 {
10578 BY_COPY,
10579 BY_REFERENCE
10580 };
10584 {
10587 }
10591 else
10594 /* Possibly capture `this'. */
10596 {
10606 this_identifier);
10607 else
10612 }
10614 /* Possibly capture `*this'. */
10617 {
10627 this_identifier);
10628 else
10633 }
10635 /* But reject `&this'. */
10638 {
10644 }
10649 {
10656 }
10658 /* Remember whether we want to capture as a reference or not. */
10660 {
10663 }
10665 /* Get the identifier. */
10670 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10671 delimiters, but I modified this to stop on unnested ']' as well. It
10672 was already changed to stop on unnested '}', so the
10673 "closing_parenthesis" name is no more misleading with my change. */
10674 {
10680 }
10682 /* Find the initializer for this capture. */
10686 {
10688 /* An explicit initializer exists. */
10691 "lambda capture initializers "
10697 {
10700 }
10703 }
10704 else
10705 {
10708 /* Turn the identifier into an id-expression. */
10709 capture_init_expr
10714 {
10717 }
10720 {
10723 capture_init_expr);
10728 }
10731 {
10734 capture_init_expr))
10738 }
10740 capture_init_expr
10741 = finish_id_expression
10743 capture_init_expr,
10757 {
10762 {
10763 /* If what follows is an initializer, the second '...' is
10764 invalid. But for cases like [...xs...], the first one
10765 is invalid. */
10772 }
10773 }
10774 }
10778 {
10783 capture_id);
10787 "capture of %qD redundant with by-reference capture "
10789 }
10791 /* Check for duplicates.
10792 Optimize for the zero or one explicit captures cases and only create
10793 the hash_set after adding second capture. */
10801 else
10802 {
10805 }
10809 else
10812 explicit_init_p);
10814 /* If there is any qualification still in effect, clear it
10815 now; we will be starting fresh with the next capture. */
10819 }
10822 }
10824 /* Parse the (optional) middle of a lambda expression.
10826 lambda-declarator:
10827 < template-parameter-list [opt] >
10828 ( parameter-declaration-clause [opt] )
10829 attribute-specifier [opt]
10830 decl-specifier-seq [opt]
10831 exception-specification [opt]
10832 lambda-return-type-clause [opt]
10834 LAMBDA_EXPR is the current representation of the lambda expression. */
10836 static bool
10838 {
10839 /* 5.1.1.4 of the standard says:
10840 If a lambda-expression does not include a lambda-declarator, it is as if
10841 the lambda-declarator were ().
10842 This means an empty parameter list, no attributes, and no exception
10843 specification. */
10851 cp_decl_specifier_seq lambda_specs;
10854 /* The template-parameter-list is optional, but must begin with
10855 an opening angle if present. */
10857 {
10860 "lambda templates are only available with "
10864 "lambda templates are only available with "
10873 /* We just processed one more parameter list. */
10875 }
10877 /* The parameter-declaration-clause is optional (unless
10878 template-parameter-list was given), but must begin with an
10879 opening parenthesis if present. */
10881 {
10882 matching_parens parens;
10887 /* Parse parameters. */
10888 param_list
10889 = cp_parser_parameter_declaration_clause
10892 /* Default arguments shall not be specified in the
10893 parameter-declaration-clause of a lambda-declarator. */
10902 /* In the decl-specifier-seq of the lambda-declarator, each
10903 decl-specifier shall either be mutable or constexpr. */
10908 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10911 {
10916 }
10920 /* Parse optional exception specification. */
10925 /* Parse optional trailing return type. */
10927 {
10930 }
10935 /* The function parameters must be in scope all the way until after the
10936 trailing-return-type in case of decltype. */
10938 }
10942 /* Create the function call operator.
10944 Messing with declarators like this is no uglier than building up the
10945 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10946 other code. */
10947 {
10948 cp_decl_specifier_seq return_type_specs;
10950 tree fco;
10958 {
10962 else
10964 "lambda only available with %<-std=c++17%> or "
10966 }
10976 VIRT_SPEC_UNSPECIFIED,
10977 REF_QUAL_NONE,
10978 tx_qual,
10979 exception_spec,
10980 return_type,
10985 declarator,
10986 gnu_attrs);
10988 {
10991 /* Give the object parameter a different name. */
10994 }
10996 {
11000 }
11009 }
11010 }
11012 /* Parse the body of a lambda expression, which is simply
11014 compound-statement
11016 but which requires special handling.
11017 LAMBDA_EXPR is the current representation of the lambda expression. */
11019 static void
11021 {
11023 unsigned char local_variables_forbidden_p
11027 /* The body of a lambda-expression is not a subexpression of the enclosing
11028 expression. */
11029 cp_evaluated ev;
11033 else
11034 /* Still increment function_depth so that we don't GC in the
11035 middle of an expression. */
11040 /* Clear this in case we're in the middle of a default argument. */
11044 {
11048 matching_braces braces;
11051 {
11054 /* Originally C++11 required us to peek for 'return expr'; and
11055 process it specially here to deduce the return type. N3638
11056 removed the need for that. */
11064 }
11067 }
11074 else
11076 }
11078 /* Statements [gram.stmt.stmt] */
11080 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
11082 static void
11084 {
11088 /* A concept is never expanded normally. */
11094 }
11096 /* Parse a statement.
11098 statement:
11099 labeled-statement
11100 expression-statement
11101 compound-statement
11102 selection-statement
11103 iteration-statement
11104 jump-statement
11105 declaration-statement
11106 try-block
11108 C++11:
11110 statement:
11111 labeled-statement
11112 attribute-specifier-seq (opt) expression-statement
11113 attribute-specifier-seq (opt) compound-statement
11114 attribute-specifier-seq (opt) selection-statement
11115 attribute-specifier-seq (opt) iteration-statement
11116 attribute-specifier-seq (opt) jump-statement
11117 declaration-statement
11118 attribute-specifier-seq (opt) try-block
11120 init-statement:
11121 expression-statement
11122 simple-declaration
11124 TM Extension:
11126 statement:
11127 atomic-statement
11129 IN_COMPOUND is true when the statement is nested inside a
11130 cp_parser_compound_statement; this matters for certain pragmas.
11132 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11133 is a (possibly labeled) if statement which is not enclosed in braces
11134 and has an else clause. This is used to implement -Wparentheses.
11136 CHAIN is a vector of if-else-if conditions. */
11138 static void
11142 {
11147 restart:
11150 /* There is no statement yet. */
11156 /* In obj-c++, seeing '[[' might be the either the beginning of
11157 c++11 attributes, or a nested objc-message-expression. So
11158 let's parse the c++11 attributes tentatively. */
11164 {
11167 }
11169 /* Peek at the next token. */
11171 /* Remember the location of the first token in the statement. */
11175 /* If this is a keyword, then that will often determine what kind of
11176 statement we have. */
11178 {
11182 {
11185 /* Looks like a labeled-statement with a case label.
11186 Parse the label, and then use tail recursion to parse
11187 the statement. */
11213 /* Objective-C++ exception-handling constructs. */
11229 /* This must be a namespace alias definition. */
11231 {
11232 /* Attributes should be parsed as part of the the
11233 declaration, so let's un-parse them. */
11236 }
11254 /* It might be a keyword like `int' that can start a
11255 declaration-statement. */
11257 }
11258 }
11260 {
11261 /* If the next token is a `:', then we are looking at a
11262 labeled-statement. */
11265 {
11266 /* Looks like a labeled-statement with an ordinary label.
11267 Parse the label, and then use tail recursion to parse
11268 the statement. */
11273 }
11274 }
11275 /* Anything that starts with a `{' must be a compound-statement. */
11278 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
11279 a statement all its own. */
11281 {
11282 /* Only certain OpenMP pragmas are attached to statements, and thus
11283 are considered statements themselves. All others are not. In
11284 the context of a compound, accept the pragma as a "statement" and
11285 return so that we can check for a close brace. Otherwise we
11286 require a real statement and must go back and read one. */
11292 }
11294 {
11297 }
11299 /* Everything else must be a declaration-statement or an
11300 expression-statement. Try for the declaration-statement
11301 first, unless we are looking at a `;', in which case we know that
11302 we have an expression-statement. */
11304 {
11306 {
11308 /* Attributes should be parsed as part of the declaration,
11309 so let's un-parse them. */
11313 /* Try to parse the declaration-statement. */
11315 /* If that worked, we're done. */
11318 /* It didn't work, restore the post-attribute position. */
11321 }
11322 /* All preceding labels have been parsed at this point. */
11328 /* Look for an expression-statement instead. */
11331 /* Handle [[fallthrough]];. */
11333 {
11334 /* The next token after the fallthrough attribute is ';'. */
11336 {
11337 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11339 IFN_FALLTHROUGH,
11342 }
11343 else
11347 }
11348 }
11350 /* Set the line number for the statement. */
11354 /* Allow "[[fallthrough]];", but warn otherwise. */
11357 OPT_Wattributes,
11359 }
11361 /* Append ATTR to attribute list ATTRS. */
11363 static tree
11365 {
11371 }
11373 /* Parse the label for a labeled-statement, i.e.
11375 identifier :
11376 case constant-expression :
11377 default :
11379 GNU Extension:
11380 case constant-expression ... constant-expression : statement
11382 When a label is parsed without errors, the label is added to the
11383 parse tree by the finish_* functions, so this function doesn't
11384 have to return the label. */
11386 static void
11388 {
11393 /* The next token should be an identifier. */
11397 {
11400 }
11402 /* Remember whether this case or a user-defined label is allowed to fall
11403 through to. */
11408 {
11410 {
11414 /* Consume the `case' token. */
11416 /* Parse the constant-expression. */
11423 {
11424 /* Consume the `...' token. */
11430 /* We don't need to emit warnings here, as the common code
11431 will do this for us. */
11432 }
11433 else
11437 {
11440 {
11443 }
11444 }
11445 else
11448 expr);
11449 }
11453 /* Consume the `default' token. */
11457 {
11460 {
11463 }
11464 }
11465 else
11470 /* Anything else must be an ordinary label. */
11475 }
11477 /* Require the `:' token. */
11480 /* An ordinary label may optionally be followed by attributes.
11481 However, this is only permitted if the attributes are then
11482 followed by a semicolon. This is because, for backward
11483 compatibility, when parsing
11484 lab: __attribute__ ((unused)) int i;
11485 we want the attribute to attach to "i", not "lab". */
11488 {
11489 tree attrs;
11493 /* And fallthrough always binds to the expression-statement. */
11498 ;
11499 else
11501 }
11507 }
11509 /* Parse an expression-statement.
11511 expression-statement:
11512 expression [opt] ;
11514 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11515 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11516 indicates whether this expression-statement is part of an
11517 expression statement. */
11519 static tree
11521 {
11526 /* There might be attribute fallthrough. */
11529 /* If the next token is a ';', then there is no expression
11530 statement. */
11532 {
11536 {
11539 }
11540 }
11542 /* Handle [[fallthrough]];. */
11544 {
11545 /* The next token after the fallthrough attribute is ';'. */
11547 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11550 else
11554 }
11556 /* Allow "[[fallthrough]];", but warn otherwise. */
11561 /* Give a helpful message for "A<T>::type t;" and the like. */
11564 {
11571 {
11572 /* A::A a; */
11577 }
11578 }
11580 /* Consume the final `;'. */
11585 /* This is the final expression statement of a statement
11586 expression. */
11592 }
11594 /* Parse a compound-statement.
11596 compound-statement:
11597 { statement-seq [opt] }
11599 GNU extension:
11601 compound-statement:
11602 { label-declaration-seq [opt] statement-seq [opt] }
11604 label-declaration-seq:
11605 label-declaration
11606 label-declaration-seq label-declaration
11608 Returns a tree representing the statement. */
11610 static tree
11613 {
11614 tree compound_stmt;
11615 matching_braces braces;
11617 /* Consume the `{'. */
11624 /* Begin the compound-statement. */
11626 /* If the next keyword is `__label__' we have a label declaration. */
11629 /* Parse an (optional) statement-seq. */
11631 /* Finish the compound-statement. */
11633 /* Consume the `}'. */
11637 }
11639 /* Parse an (optional) statement-seq.
11641 statement-seq:
11642 statement
11643 statement-seq [opt] statement */
11645 static void
11647 {
11648 /* Scan statements until there aren't any more. */
11650 {
11653 /* If we are looking at a `}', then we have run out of
11654 statements; the same is true if we have reached the end
11655 of file, or have stumbled upon a stray '@end'. */
11662 /* If we are in a compound statement and find 'else' then
11663 something went wrong. */
11665 {
11668 else
11669 {
11672 }
11673 }
11675 /* Parse the statement. */
11677 }
11678 }
11680 /* Return true if this is the C++20 version of range-based-for with
11681 init-statement. */
11683 static bool
11685 {
11688 /* Save tokens so that we can put them back. */
11691 /* There has to be an unnested ; followed by an unnested :. */
11694 CPP_SEMICOLON,
11698 /* We found the semicolon, eat it now. */
11701 /* Now look for ':' that is not nested in () or {}. */
11704 CPP_COLON,
11707 out:
11708 /* Roll back the tokens we skipped. */
11712 }
11714 /* Return true if we're looking at (init; cond), false otherwise. */
11716 static bool
11718 {
11719 /* Save tokens so that we can put them back. */
11722 /* Look for ';' that is not nested in () or {}. */
11725 CPP_SEMICOLON,
11728 /* Roll back the tokens we skipped. */
11732 }
11734 /* Parse a selection-statement.
11736 selection-statement:
11737 if ( init-statement [opt] condition ) statement
11738 if ( init-statement [opt] condition ) statement else statement
11739 switch ( init-statement [opt] condition ) statement
11741 Returns the new IF_STMT or SWITCH_STMT.
11743 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11744 is a (possibly labeled) if statement which is not enclosed in
11745 braces and has an else clause. This is used to implement
11746 -Wparentheses.
11748 CHAIN is a vector of if-else-if conditions. This is used to implement
11749 -Wduplicated-cond. */
11751 static tree
11754 {
11757 token_indent_info guard_tinfo;
11762 /* Peek at the next token. */
11766 /* See what kind of keyword it is. */
11769 {
11772 {
11773 tree statement;
11774 tree condition;
11779 RID_CONSTEXPR))
11780 {
11786 }
11788 /* Look for the `('. */
11789 matching_parens parens;
11791 {
11794 }
11796 /* Begin the selection-statement. */
11798 {
11801 }
11802 else
11805 /* Parse the optional init-statement. */
11807 {
11808 tree decl;
11811 "init-statement in selection statements only available "
11814 }
11816 /* Parse the condition. */
11818 /* Look for the `)'. */
11824 {
11828 /* Add the condition. */
11835 /* Parse the then-clause. */
11839 /* Outside a template, the non-selected branch of a constexpr
11840 if is a 'discarded statement', i.e. unevaluated. */
11845 {
11848 }
11851 guard_tinfo);
11858 {
11862 }
11864 /* If the next token is `else', parse the else-clause. */
11866 RID_ELSE))
11867 {
11871 {
11874 }
11876 guard_tinfo
11878 /* Consume the `else' keyword. */
11881 {
11883 RID_IF)
11885 {
11886 /* We've got "if (COND) else if (COND2)". Start
11887 the condition chain and add COND as the first
11888 element. */
11892 {
11893 /* Wrap it in a NOP_EXPR so that we can set the
11894 location of the condition. */
11896 condition);
11899 }
11900 }
11902 RID_IF))
11903 {
11904 /* This is if-else without subsequent if. Zap the
11905 condition chain; we would have already warned at
11906 this point. */
11909 }
11910 }
11912 /* Parse the else-clause. */
11918 /* If we are currently parsing a then-clause, then
11919 IF_P will not be NULL. We set it to true to
11920 indicate that this if statement has an else clause.
11921 This may trigger the Wparentheses warning below
11922 when we get back up to the parent if statement. */
11927 {
11931 }
11932 }
11933 else
11934 {
11935 /* This if statement does not have an else clause. If
11936 NESTED_IF is true, then the then-clause has an if
11937 statement which does have an else clause. We warn
11938 about the potential ambiguity. */
11941 "suggest explicit braces to avoid ambiguous"
11944 {
11945 /* We don't need the condition chain anymore. */
11948 }
11949 }
11951 /* Now we're all done with the if-statement. */
11953 }
11954 else
11955 {
11959 /* Add the condition. */
11962 /* Parse the body of the switch-statement. */
11968 guard_tinfo);
11972 /* Now we're all done with the switch-statement. */
11974 }
11977 }
11983 }
11984 }
11986 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
11987 If we have seen at least one decl-specifier, and the next token
11988 is not a parenthesis, then we must be looking at a declaration.
11989 (After "int (" we might be looking at a functional cast.) */
11991 static void
11994 {
12000 }
12002 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
12003 The declarator shall not specify a function or an array. Returns
12004 TRUE if the declarator is valid, FALSE otherwise. */
12006 static bool
12009 location_t loc)
12010 {
12014 {
12019 else
12027 }
12028 else
12030 }
12032 /* Parse a condition.
12034 condition:
12035 expression
12036 type-specifier-seq declarator = initializer-clause
12037 type-specifier-seq declarator braced-init-list
12039 GNU Extension:
12041 condition:
12042 type-specifier-seq declarator asm-specification [opt]
12043 attributes [opt] = assignment-expression
12045 Returns the expression that should be tested. */
12047 static tree
12049 {
12050 cp_decl_specifier_seq type_specifiers;
12054 /* Try the declaration first. */
12056 /* New types are not allowed in the type-specifier-seq for a
12057 condition. */
12059 parser->type_definition_forbidden_message
12061 /* Parse the type-specifier-seq. */
12063 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
12066 /* Restore the saved message. */
12069 /* Gather the attributes that were provided with the
12070 decl-specifiers. */
12076 /* If all is well, we might be looking at a declaration. */
12078 {
12079 tree decl;
12080 tree asm_specification;
12081 tree attributes;
12086 /* Parse the declarator. */
12088 CP_PARSER_FLAGS_NONE,
12094 /* Parse the attributes. */
12096 /* Parse the asm-specification. */
12098 /* If the next token is not an `=' or '{', then we might still be
12099 looking at an expression. For example:
12101 if (A(a).x)
12103 looks like a decl-specifier-seq and a declarator -- but then
12104 there is no `=', so this is an expression. */
12109 /* If we did see an `=' or '{', then we are looking at a declaration
12110 for sure. */
12112 {
12113 tree pushed_scope;
12120 /* Create the declaration. */
12126 /* Parse the initializer. */
12128 {
12132 }
12134 {
12135 /* Consume the `='. */
12139 }
12140 else
12141 {
12144 }
12148 /* Process the initializer. */
12151 asm_specification,
12152 flags);
12158 }
12159 }
12160 /* If we didn't even get past the declarator successfully, we are
12161 definitely not looking at a declaration. */
12162 else
12165 /* Otherwise, we are looking at an expression. */
12167 }
12169 /* Parses a for-statement or range-for-statement until the closing ')',
12170 not included. */
12172 static tree
12174 {
12178 /* Begin the for-statement. */
12181 /* Parse the initialization. */
12187 else
12189 }
12191 static tree
12194 {
12195 /* Normal for loop */
12198 tree stmt;
12201 /* The init-statement has already been parsed in
12202 cp_parser_init_statement, so no work is needed here. */
12205 /* If there's a condition, process it. */
12209 {
12213 }
12215 {
12219 }
12221 /* Look for the `;'. */
12224 /* If there's an expression, process it. */
12230 }
12232 /* Tries to parse a range-based for-statement:
12234 range-based-for:
12235 decl-specifier-seq declarator : expression
12237 The decl-specifier-seq declarator and the `:' are already parsed by
12238 cp_parser_init_statement. If processing_template_decl it returns a
12239 newly created RANGE_FOR_STMT; if not, it is converted to a
12240 regular FOR_STMT. */
12242 static tree
12245 {
12252 /* Get the range declaration momentarily out of the way so that
12253 the range expression doesn't clash with it. */
12255 {
12257 {
12259 /* For decomposition declaration get all of the corresponding
12260 declarations out of the way. */
12264 {
12270 {
12276 }
12277 }
12278 }
12280 {
12285 }
12286 }
12289 {
12292 }
12293 else
12296 /* Put the range declaration(s) back into scope. */
12298 {
12302 }
12304 /* finish_omp_for has its own code for the following, so just
12305 return the range_expr instead. */
12309 /* If in template, STMT is converted to a normal for-statement
12310 at instantiation. If not, it is done just ahead. */
12312 {
12322 /* do_auto_deduction doesn't mess with template init-lists. */
12325 }
12326 else
12327 {
12331 unroll);
12332 }
12334 }
12336 /* Subroutine of cp_convert_range_for: given the initializer expression,
12337 builds up the range temporary. */
12339 static tree
12341 {
12344 /* Find out the type deduced by the declaration
12345 `auto &&__range = range_expr'. */
12350 /* Create the __range variable. */
12352 range_type);
12357 }
12359 /* Used by cp_parser_range_for in template context: we aren't going to
12360 do a full conversion yet, but we still need to resolve auto in the
12361 type of the for-range-declaration if present. This is basically
12362 a shortcut version of cp_convert_range_for. */
12364 static void
12366 {
12369 {
12372 iter_type = (cp_parser_perform_range_for_lookup
12375 {
12377 iter_type);
12379 RO_UNARY_STAR,
12380 tf_warning_or_error);
12383 }
12384 }
12385 }
12387 /* Converts a range-based for-statement into a normal
12388 for-statement, as per the definition.
12390 for (RANGE_DECL : RANGE_EXPR)
12391 BLOCK
12393 should be equivalent to:
12395 {
12396 auto &&__range = RANGE_EXPR;
12397 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
12398 __begin != __end;
12399 ++__begin)
12400 {
12401 RANGE_DECL = *__begin;
12402 BLOCK
12403 }
12404 }
12406 If RANGE_EXPR is an array:
12407 BEGIN_EXPR = __range
12408 END_EXPR = __range + ARRAY_SIZE(__range)
12409 Else if RANGE_EXPR has a member 'begin' or 'end':
12410 BEGIN_EXPR = __range.begin()
12411 END_EXPR = __range.end()
12412 Else:
12413 BEGIN_EXPR = begin(__range)
12414 END_EXPR = end(__range);
12416 If __range has a member 'begin' but not 'end', or vice versa, we must
12417 still use the second alternative (it will surely fail, however).
12418 When calling begin()/end() in the third alternative we must use
12419 argument dependent lookup, but always considering 'std' as an associated
12420 namespace. */
12422 tree
12426 {
12434 /* If an error happened previously do nothing or else a lot of
12435 unhelpful errors would be issued. */
12437 else
12438 {
12439 tree range_temp;
12443 /* Can't bind a reference to an array of runtime bound. */
12445 else
12446 {
12451 LOOKUP_ONLYCONVERTING);
12453 }
12456 }
12458 /* The new for initialization statement. */
12460 iter_type);
12466 LOOKUP_ONLYCONVERTING);
12476 LOOKUP_ONLYCONVERTING);
12480 /* The new for condition. */
12487 /* The new increment expression. */
12490 tf_warning_or_error);
12496 /* The declaration is initialized with *__begin inside the loop body. */
12499 tf_warning_or_error),
12501 LOOKUP_ONLYCONVERTING);
12506 }
12508 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12509 We need to solve both at the same time because the method used
12510 depends on the existence of members begin or end.
12511 Returns the type deduced for the iterator expression. */
12513 static tree
12515 {
12517 {
12520 }
12523 {
12528 }
12530 {
12531 /* If RANGE is an array, we will use pointer arithmetic. */
12534 range,
12538 }
12539 else
12540 {
12541 /* If it is not an array, we must do a bit of magic. */
12551 tf_warning_or_error);
12554 tf_warning_or_error);
12557 {
12558 /* Use the member functions. */
12561 }
12562 else
12563 {
12564 /* Use global functions with ADL. */
12565 releasing_vec vec;
12570 tf_warning_or_error);
12572 tf_warning_or_error);
12574 tf_warning_or_error);
12576 tf_warning_or_error);
12577 }
12579 /* Last common checks. */
12581 {
12582 /* If one of the expressions is an error do no more checks. */
12585 }
12588 /* Can happen, when, eg, in a template context, Koenig lookup
12589 can't resolve begin/end (c++/58503). */
12591 else
12592 {
12594 /* The unqualified type of the __begin and __end temporaries should
12595 be the same, as required by the multiple auto declaration. */
12597 {
12604 /* P0184R0 allows __begin and __end to have different types,
12605 but make sure they are comparable so we can give a better
12607 else
12611 }
12613 }
12614 }
12615 }
12617 /* Helper function for cp_parser_perform_range_for_lookup.
12618 Builds a tree for RANGE.IDENTIFIER(). */
12620 static tree
12622 {
12630 releasing_vec vec;
12634 tf_warning_or_error);
12636 }
12638 /* Parse an iteration-statement.
12640 iteration-statement:
12641 while ( condition ) statement
12642 do statement while ( expression ) ;
12643 for ( init-statement condition [opt] ; expression [opt] )
12644 statement
12646 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12648 static tree
12651 {
12654 tree statement;
12656 token_indent_info guard_tinfo;
12658 /* Peek at the next token. */
12665 /* Remember whether or not we are already within an iteration
12666 statement. */
12669 /* See what kind of keyword it is. */
12672 {
12674 {
12675 tree condition;
12677 /* Begin the while-statement. */
12679 /* Look for the `('. */
12680 matching_parens parens;
12682 /* Parse the condition. */
12685 /* Look for the `)'. */
12687 /* Parse the dependent statement. */
12693 /* We're done with the while-statement. */
12695 }
12699 {
12700 tree expression;
12702 /* Begin the do-statement. */
12704 /* Parse the body of the do-statement. */
12711 /* Look for the `while' keyword. */
12713 /* Look for the `('. */
12714 matching_parens parens;
12716 /* Parse the expression. */
12718 /* We're done with the do-statement. */
12720 /* Look for the `)'. */
12722 /* Look for the `;'. */
12724 }
12728 {
12729 /* Look for the `('. */
12730 matching_parens parens;
12735 /* Look for the `)'. */
12738 /* Parse the body of the for-statement. */
12745 /* We're done with the for-statement. */
12747 }
12754 }
12757 }
12759 /* Parse a init-statement or the declarator of a range-based-for.
12760 Returns true if a range-based-for declaration is seen.
12762 init-statement:
12763 expression-statement
12764 simple-declaration */
12766 static bool
12768 {
12769 /* If the next token is a `;', then we have an empty
12770 expression-statement. Grammatically, this is also a
12771 simple-declaration, but an invalid one, because it does not
12772 declare anything. Therefore, if we did not handle this case
12773 specially, we would issue an error message about an invalid
12774 declaration. */
12776 {
12780 /* Try to parse the init-statement. */
12782 {
12783 tree dummy;
12785 /* Parse the declaration. */
12791 /* That didn't work, try to parse it as an expression-statement. */
12795 {
12797 "range-based %<for%> loops with initializer only "
12800 }
12801 }
12803 /* A colon is used in range-based for. */
12806 /* We're going to speculatively look for a declaration, falling back
12807 to an expression, if necessary. */
12809 /* Parse the declaration. */
12812 decl);
12815 {
12816 /* It is a range-for, consume the ':'. */
12821 "range-based %<for%> loops only available with "
12823 }
12824 else
12825 /* The ';' is not consumed yet because we told
12826 cp_parser_simple_declaration not to. */
12831 /* If the tentative parse failed, then we shall need to look for an
12832 expression-statement. */
12833 }
12834 /* If we are here, it is an expression-statement. */
12837 }
12839 /* Parse a jump-statement.
12841 jump-statement:
12842 break ;
12843 continue ;
12844 return expression [opt] ;
12845 return braced-init-list ;
12846 goto identifier ;
12848 GNU extension:
12850 jump-statement:
12851 goto * expression ;
12853 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12855 static tree
12857 {
12863 /* Peek at the next token. */
12868 /* See what kind of keyword it is. */
12871 {
12875 {
12892 }
12898 {
12902 /* Fall through. */
12912 }
12917 {
12918 tree expr;
12922 {
12926 }
12929 else
12930 /* If the next token is a `;', then there is no
12931 expression. */
12933 /* Build the return-statement. */
12936 else
12938 /* Look for the final `;'. */
12940 }
12946 {
12949 }
12951 /* Create the goto-statement. */
12953 {
12954 /* Issue a warning about this use of a GNU extension. */
12956 /* Consume the '*' token. */
12958 /* Parse the dependent expression. */
12960 }
12961 else
12963 /* Look for the final `;'. */
12970 }
12973 }
12975 /* Parse a declaration-statement.
12977 declaration-statement:
12978 block-declaration */
12980 static void
12982 {
12985 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12988 /* Parse the block-declaration. */
12991 /* Free any declarators allocated. */
12993 }
12995 /* Some dependent statements (like `if (cond) statement'), are
12996 implicitly in their own scope. In other words, if the statement is
12997 a single statement (as opposed to a compound-statement), it is
12998 none-the-less treated as if it were enclosed in braces. Any
12999 declarations appearing in the dependent statement are out of scope
13000 after control passes that point. This function parses a statement,
13001 but ensures that is in its own scope, even if it is not a
13002 compound-statement.
13004 If IF_P is not NULL, *IF_P is set to indicate whether the statement
13005 is a (possibly labeled) if statement which is not enclosed in
13006 braces and has an else clause. This is used to implement
13007 -Wparentheses.
13009 CHAIN is a vector of if-else-if conditions. This is used to implement
13010 -Wduplicated-cond.
13012 Returns the new statement. */
13014 static tree
13018 {
13019 tree statement;
13022 token_indent_info body_tinfo
13028 /* Mark if () ; with a special NOP_EXPR. */
13030 {
13041 }
13042 /* if a compound is opened, we simply parse the statement directly. */
13045 /* If the token is not a `{', then we must take special action. */
13046 else
13047 {
13048 /* Create a compound-statement. */
13050 /* Parse the dependent-statement. */
13053 /* Finish the dummy compound-statement. */
13055 }
13057 token_indent_info next_tinfo
13066 /* Return the statement. */
13068 }
13070 /* For some dependent statements (like `while (cond) statement'), we
13071 have already created a scope. Therefore, even if the dependent
13072 statement is a compound-statement, we do not want to create another
13073 scope. */
13075 static void
13078 {
13079 /* If the token is a `{', then we must take special action. */
13081 {
13082 token_indent_info body_tinfo
13088 token_indent_info next_tinfo
13097 }
13098 else
13099 {
13100 /* Avoid calling cp_parser_compound_statement, so that we
13101 don't create a new scope. Do everything else by hand. */
13102 matching_braces braces;
13104 /* If the next keyword is `__label__' we have a label declaration. */
13107 /* Parse an (optional) statement-seq. */
13110 }
13111 }
13113 /* Declarations [gram.dcl.dcl] */
13115 /* Parse an optional declaration-sequence.
13117 declaration-seq:
13118 declaration
13119 declaration-seq declaration */
13121 static void
13123 {
13125 {
13131 else
13133 }
13134 }
13136 /* Parse a declaration.
13138 declaration:
13139 block-declaration
13140 function-definition
13141 template-declaration
13142 explicit-instantiation
13143 explicit-specialization
13144 linkage-specification
13145 namespace-definition
13147 C++17:
13148 deduction-guide
13150 GNU extension:
13152 declaration:
13153 __extension__ declaration */
13155 static void
13157 {
13158 cp_token token1;
13159 cp_token token2;
13164 /* Check for the `__extension__' keyword. */
13166 {
13167 /* Parse the qualified declaration. */
13169 /* Restore the PEDANTIC flag. */
13173 }
13175 /* Try to figure out what kind of declaration is present. */
13180 else
13181 {
13184 }
13186 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
13189 /* If the next token is `extern' and the following token is a string
13190 literal, then we have a linkage specification. */
13194 /* If the next token is `template', then we have either a template
13195 declaration, an explicit instantiation, or an explicit
13196 specialization. */
13198 {
13199 /* `template <>' indicates a template specialization. */
13203 /* `template <' indicates a template declaration. */
13206 /* Anything else must be an explicit instantiation. */
13207 else
13209 }
13210 /* If the next token is `export', then we have a template
13211 declaration. */
13214 /* If the next token is `extern', 'static' or 'inline' and the one
13215 after that is `template', we have a GNU extended explicit
13216 instantiation directive. */
13223 /* If the next token is `namespace', check for a named or unnamed
13224 namespace definition. */
13233 /* An unnamed namespace definition. */
13237 /* An inline (associated) namespace definition. */
13241 /* Objective-C++ declaration/definition. */
13248 /* At this point we may have a template declared by a concept
13249 introduction. */
13254 else
13255 /* Try to parse a block-declaration, or a function-definition. */
13258 /* Free any declarators allocated. */
13260 }
13262 /* Parse a namespace-scope declaration. */
13264 static void
13266 {
13270 /* A top-level declaration can consist solely of a #pragma. A
13271 nested declaration cannot, so this is done here and not in
13272 cp_parser_declaration. (A #pragma at block scope is
13273 handled in cp_parser_statement.) */
13276 {
13277 /* A declaration consisting of a single semicolon is
13278 invalid. Allow it unless we're being pedantic. */
13282 }
13283 else
13284 /* Parse the declaration itself. */
13286 }
13288 /* Parse a block-declaration.
13290 block-declaration:
13291 simple-declaration
13292 asm-definition
13293 namespace-alias-definition
13294 using-declaration
13295 using-directive
13297 GNU Extension:
13299 block-declaration:
13300 __extension__ block-declaration
13302 C++0x Extension:
13304 block-declaration:
13305 static_assert-declaration
13307 If STATEMENT_P is TRUE, then this block-declaration is occurring as
13308 part of a declaration-statement. */
13310 static void
13313 {
13317 /* Check for the `__extension__' keyword. */
13319 {
13320 /* Parse the qualified declaration. */
13322 /* Restore the PEDANTIC flag. */
13326 }
13328 /* Peek at the next token to figure out which kind of declaration is
13329 present. */
13332 /* If the next keyword is `asm', we have an asm-definition. */
13334 {
13338 }
13339 /* If the next keyword is `namespace', we have a
13340 namespace-alias-definition. */
13343 /* If the next keyword is `using', we have a
13344 using-declaration, a using-directive, or an alias-declaration. */
13346 {
13351 /* If the token after `using' is `namespace', then we have a
13352 using-directive. */
13356 /* If the second token after 'using' is '=', then we have an
13357 alias-declaration. */
13363 /* Otherwise, it's a using-declaration. */
13364 else
13367 }
13368 /* If the next keyword is `__label__' we have a misplaced label
13369 declaration. */
13371 {
13375 /* If the next token is now a `;', consume it. */
13378 }
13379 /* If the next token is `static_assert' we have a static assertion. */
13382 /* Anything else must be a simple-declaration. */
13383 else
13386 }
13388 /* Parse a simple-declaration.
13390 simple-declaration:
13391 decl-specifier-seq [opt] init-declarator-list [opt] ;
13392 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13393 brace-or-equal-initializer ;
13395 init-declarator-list:
13396 init-declarator
13397 init-declarator-list , init-declarator
13399 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
13400 function-definition as a simple-declaration.
13402 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
13403 parsed declaration if it is an uninitialized single declarator not followed
13404 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
13405 if present, will not be consumed. */
13407 static void
13411 {
13412 cp_decl_specifier_seq decl_specifiers;
13421 /* Defer access checks until we know what is being declared; the
13422 checks for names appearing in the decl-specifier-seq should be
13423 done as if we were in the scope of the thing being declared. */
13426 /* Parse the decl-specifier-seq. We have to keep track of whether
13427 or not the decl-specifier-seq declares a named class or
13428 enumeration type, since that is the only case in which the
13429 init-declarator-list is allowed to be empty.
13431 [dcl.dcl]
13433 In a simple-declaration, the optional init-declarator-list can be
13434 omitted only when declaring a class or enumeration, that is when
13435 the decl-specifier-seq contains either a class-specifier, an
13436 elaborated-type-specifier, or an enum-specifier. */
13438 CP_PARSER_FLAGS_OPTIONAL,
13441 /* We no longer need to defer access checks. */
13444 /* In a block scope, a valid declaration must always have a
13445 decl-specifier-seq. By not trying to parse declarators, we can
13446 resolve the declaration/expression ambiguity more quickly. */
13449 {
13452 }
13454 /* If the next two tokens are both identifiers, the code is
13455 erroneous. The usual cause of this situation is code like:
13457 T t;
13459 where "T" should name a type -- but does not. */
13462 {
13463 /* If parsing tentatively, we should commit; we really are
13464 looking at a declaration. */
13466 /* Give up. */
13468 }
13473 /* Look for C++17 decomposition declaration. */
13481 {
13482 tree decl
13484 maybe_range_for_decl,
13487 /* The next token should be either a `,' or a `;'. */
13489 /* If it's a `;', we are done. */
13493 {
13497 }
13498 /* Anything else is an error. */
13499 else
13500 {
13501 /* If we have already issued an error message we don't need
13502 to issue another one. */
13507 /* Skip tokens until we reach the end of the statement. */
13509 /* If the next token is now a `;', consume it. */
13513 }
13514 }
13515 else
13518 tree last_type;
13520 /* NULL_TREE if both variable and function declaration are allowed,
13521 error_mark_node if function declaration are not allowed and
13522 a FUNCTION_DECL that should be diagnosed if it is followed by
13523 variable declarations. */
13524 tree auto_function_declaration;
13527 auto_specifier_p
13531 /* Keep going until we hit the `;' at the end of the simple
13532 declaration. */
13535 CPP_SEMICOLON))
13536 {
13539 tree decl;
13543 {
13544 /* If we are processing next declarator, comma is expected */
13549 {
13553 }
13554 }
13555 else
13558 /* Parse the init-declarator. */
13560 CP_PARSER_FLAGS_NONE,
13563 function_definition_allowed_p,
13565 declares_class_or_enum,
13567 maybe_range_for_decl,
13570 /* If an error occurred while parsing tentatively, exit quickly.
13571 (That usually happens when in the body of a function; each
13572 statement is treated as a declaration-statement until proven
13573 otherwise.) */
13578 {
13579 /* If the init-declarator-list contains more than one
13580 init-declarator, they shall all form declarations of
13581 variables. */
13583 auto_function_declaration
13587 {
13589 "non-variable %qD in declaration with more than one "
13594 }
13595 }
13599 {
13603 {
13604 /* If the list of declarators contains more than one declarator,
13605 the type of each declared variable is determined as described
13606 above. If the type deduced for the template parameter U is not
13607 the same in each deduction, the program is ill-formed. */
13612 }
13613 else
13615 }
13617 /* Handle function definitions specially. */
13619 {
13620 /* If the next token is a `,', then we are probably
13621 processing something like:
13623 void f() {}, *p;
13625 which is erroneous. */
13627 {
13630 "mixing"
13632 }
13633 /* Otherwise, we're done with the list of declarators. */
13634 else
13635 {
13638 }
13639 }
13642 /* The next token should be either a `,' or a `;'. */
13644 /* If it's a `,', there are more declarators to come. */
13647 /* If it's a `;', we are done. */
13651 {
13656 }
13657 /* Anything else is an error. */
13658 else
13659 {
13660 /* If we have already issued an error message we don't need
13661 to issue another one. */
13666 /* Skip tokens until we reach the end of the statement. */
13668 /* If the next token is now a `;', consume it. */
13672 }
13673 /* After the first time around, a function-definition is not
13674 allowed -- even if it was OK at first. For example:
13676 int i, f() {}
13678 is not valid. */
13680 }
13682 /* Issue an error message if no declarators are present, and the
13683 decl-specifier-seq does not itself declare a class or
13684 enumeration: [dcl.dcl]/3. */
13686 {
13688 {
13692 /* Ensure an error is issued anyway when finish_decltype_type,
13693 called via cp_parser_decl_specifier_seq, returns a class or
13694 an enumeration (c++/51786). */
13697 }
13698 /* Perform any deferred access checks. */
13700 }
13702 /* Consume the `;'. */
13703 finish:
13707 {
13713 }
13715 done:
13717 }
13719 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13720 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13721 initializer ; */
13723 static tree
13728 {
13733 /* Parse the identifier-list. */
13737 {
13745 }
13749 {
13755 else
13756 {
13759 }
13760 }
13766 tree pushed_scope;
13773 NULL_TREE);
13780 cp_expr e;
13781 cp_decl_specifier_seq decl_specs;
13786 {
13790 else
13791 {
13794 }
13795 tree elt_pushed_scope;
13801 {
13802 /* Ensure we've diagnosed redeclaration if we aren't creating
13803 a new VAR_DECL. */
13806 }
13807 else
13811 }
13814 {
13817 }
13821 {
13829 || (is_direct_init
13832 {
13836 }
13839 {
13844 }
13845 }
13847 {
13849 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13850 the underlying DECL. */
13852 }
13858 {
13861 }
13864 }
13866 /* Parse a decl-specifier-seq.
13868 decl-specifier-seq:
13869 decl-specifier-seq [opt] decl-specifier
13870 decl-specifier attribute-specifier-seq [opt] (C++11)
13872 decl-specifier:
13873 storage-class-specifier
13874 type-specifier
13875 function-specifier
13876 friend
13877 typedef
13879 GNU Extension:
13881 decl-specifier:
13882 attributes
13884 Concepts Extension:
13886 decl-specifier:
13887 concept
13889 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13891 The parser flags FLAGS is used to control type-specifier parsing.
13893 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13894 flags:
13896 1: one of the decl-specifiers is an elaborated-type-specifier
13897 (i.e., a type declaration)
13898 2: one of the decl-specifiers is an enum-specifier or a
13899 class-specifier (i.e., a type definition)
13901 */
13903 static void
13905 cp_parser_flags flags,
13908 {
13912 cp_decl_spec ds;
13914 /* Clear DECL_SPECS. */
13917 /* Assume no class or enumeration type is declared. */
13920 /* Keep reading specifiers until there are no more to read. */
13922 {
13927 /* Peek at the next token. */
13930 /* Save the first token of the decl spec list for error
13931 reporting. */
13934 /* Handle attributes. */
13936 {
13937 /* Parse the attributes. */
13940 /* In a sequence of declaration specifiers, c++11 attributes
13941 appertain to the type that precede them. In that case
13942 [dcl.spec]/1 says:
13944 The attribute-specifier-seq affects the type only for
13945 the declaration it appears in, not other declarations
13946 involving the same type.
13948 But for now let's force the user to position the
13949 attribute either at the beginning of the declaration or
13950 after the declarator-id, which would clearly mean that it
13951 applies to the declarator. */
13953 {
13955 /* The c++11 attribute is at the beginning of the
13956 declaration. It appertains to the entity being
13958 else
13959 {
13961 {
13962 /* This is an attribute following a
13963 class-specifier. */
13968 }
13969 else
13970 {
13971 decl_specs->std_attributes
13975 }
13977 }
13978 }
13980 decl_specs->attributes
13985 }
13986 /* Assume we will find a decl-specifier keyword. */
13988 /* If the next token is an appropriate keyword, we can simply
13989 add it to the list. */
13991 {
13992 /* decl-specifier:
13993 friend
13994 constexpr */
13997 {
14002 }
14003 else
14004 {
14006 /* Consume the token. */
14008 }
14019 /* In C++20 a concept definition is just 'concept name = expr;'
14020 Support that syntax by pretending we've seen 'bool'. */
14023 {
14027 }
14030 /* function-specifier:
14031 inline
14032 virtual
14033 explicit */
14040 /* decl-specifier:
14041 typedef */
14044 /* Consume the token. */
14046 /* A constructor declarator cannot appear in a typedef. */
14048 /* The "typedef" keyword can only occur in a declaration; we
14049 may as well commit at this point. */
14056 /* storage-class-specifier:
14057 auto
14058 register
14059 static
14060 extern
14061 mutable
14063 GNU Extension:
14064 thread */
14067 {
14068 /* Consume the token. */
14071 /* Complain about `auto' as a storage specifier, if
14072 we're complaining about C++0x compatibility. */
14076 "%<auto%> changes meaning in C++11; "
14079 /* Set the storage class anyway. */
14081 token);
14082 }
14083 else
14084 /* C++0x auto type-specifier. */
14092 /* Consume the token. */
14095 token);
14098 /* Consume the token. */
14104 /* We did not yet find a decl-specifier yet. */
14107 }
14124 /* Constructors are a special case. The `S' in `S()' is not a
14125 decl-specifier; it is the beginning of the declarator. */
14126 constructor_p
14127 = (!found_decl_spec
14128 && constructor_possible_p
14129 && (cp_parser_constructor_declarator_p
14131 ds_friend))));
14133 /* If we don't have a DECL_SPEC yet, then we must be looking at
14134 a type-specifier. */
14136 {
14139 tree type_spec;
14141 type_spec
14143 decl_specs,
14149 /* If this type-specifier referenced a user-defined type
14150 (a typedef, class-name, etc.), then we can't allow any
14151 more such type-specifiers henceforth.
14153 [dcl.spec]
14155 The longest sequence of decl-specifiers that could
14156 possibly be a type name is taken as the
14157 decl-specifier-seq of a declaration. The sequence shall
14158 be self-consistent as described below.
14160 [dcl.type]
14162 As a general rule, at most one type-specifier is allowed
14163 in the complete decl-specifier-seq of a declaration. The
14164 only exceptions are the following:
14166 -- const or volatile can be combined with any other
14167 type-specifier.
14169 -- signed or unsigned can be combined with char, long,
14170 short, or int.
14172 -- ..
14174 Example:
14176 typedef char* Pc;
14177 void g (const int Pc);
14179 Here, Pc is *not* part of the decl-specifier seq; it's
14180 the declarator. Therefore, once we see a type-specifier
14181 (other than a cv-qualifier), we forbid any additional
14182 user-defined types. We *do* still allow things like `int
14183 int' to be considered a decl-specifier-seq, and issue the
14184 error message later. */
14187 /* A constructor declarator cannot follow a type-specifier. */
14189 {
14197 }
14198 }
14200 /* If we still do not have a DECL_SPEC, then there are no more
14201 decl-specifiers. */
14206 /* After we see one decl-specifier, further decl-specifiers are
14207 always optional. */
14209 }
14211 /* Don't allow a friend specifier with a class definition. */
14216 }
14218 /* Parse an (optional) storage-class-specifier.
14220 storage-class-specifier:
14221 auto
14222 register
14223 static
14224 extern
14225 mutable
14227 GNU Extension:
14229 storage-class-specifier:
14230 thread
14232 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
14234 static tree
14236 {
14238 {
14242 /* Fall through for C++98. */
14250 /* Consume the token. */
14255 }
14256 }
14258 /* Parse an (optional) function-specifier.
14260 function-specifier:
14261 inline
14262 virtual
14263 explicit
14265 C++2A Extension:
14266 explicit(constant-expression)
14268 Returns an IDENTIFIER_NODE corresponding to the keyword used.
14269 Updates DECL_SPECS, if it is non-NULL. */
14271 static tree
14274 {
14277 {
14283 /* 14.5.2.3 [temp.mem]
14285 A member function template shall not be virtual. */
14289 else
14294 {
14296 /* If we see '(', it's C++20 explicit(bool). */
14297 tree expr;
14299 {
14300 matching_parens parens;
14303 /* New types are not allowed in an explicit-specifier. */
14306 parser->type_definition_forbidden_message
14311 "%<explicit(bool)%> only available with %<-std=c++2a%> "
14314 /* Parse the constant-expression. */
14317 /* Restore the saved message. */
14320 }
14321 else
14322 /* The explicit-specifier explicit without a constant-expression is
14323 equivalent to the explicit-specifier explicit(true). */
14326 /* [dcl.fct.spec]
14327 "the constant-expression, if supplied, shall be a contextually
14328 converted constant expression of type bool." */
14330 /* We could evaluate it -- mark the decl as appropriate. */
14336 /* The expression was value-dependent. Remember it so that we can
14337 substitute it later. */
14340 }
14344 }
14346 /* Consume the token. */
14348 }
14350 /* Parse a linkage-specification.
14352 linkage-specification:
14353 extern string-literal { declaration-seq [opt] }
14354 extern string-literal declaration */
14356 static void
14358 {
14359 tree linkage;
14361 /* Look for the `extern' keyword. */
14362 cp_token *extern_token
14365 /* Look for the string-literal. */
14369 /* Transform the literal into an identifier. If the literal is a
14370 wide-character string, or contains embedded NULs, then we can't
14371 handle it as the user wants. */
14374 {
14376 /* Assume C++ linkage. */
14378 }
14379 else
14382 /* We're now using the new linkage. */
14385 /* Preserve the location of the the innermost linkage specification,
14386 tracking the locations of nested specifications via a local. */
14387 location_t saved_location
14389 /* Construct a location ranging from the start of the "extern" to
14390 the end of the string-literal, with the caret at the start, e.g.:
14391 extern "C" {
14392 ^~~~~~~~~~
14393 */
14394 parser->innermost_linkage_specification_location
14399 /* If the next token is a `{', then we're using the first
14400 production. */
14402 {
14406 /* Consume the `{' token. */
14407 matching_braces braces;
14409 /* Parse the declarations. */
14411 /* Look for the closing `}'. */
14413 }
14414 /* Otherwise, there's just one declaration. */
14415 else
14416 {
14419 saved_in_unbraced_linkage_specification_p
14423 parser->in_unbraced_linkage_specification_p
14425 }
14427 /* We're done with the linkage-specification. */
14430 /* Restore location of parent linkage specification, if any. */
14432 }
14434 /* Parse a static_assert-declaration.
14436 static_assert-declaration:
14437 static_assert ( constant-expression , string-literal ) ;
14438 static_assert ( constant-expression ) ; (C++17)
14440 If MEMBER_P, this static_assert is a class member. */
14442 static void
14444 {
14445 cp_expr condition;
14446 location_t token_loc;
14447 tree message;
14450 /* Peek at the `static_assert' token so we can keep track of exactly
14451 where the static assertion started. */
14454 /* Look for the `static_assert' keyword. */
14456 RT_STATIC_ASSERT))
14459 /* We know we are in a static assertion; commit to any tentative
14460 parse. */
14464 /* Parse the `(' starting the static assertion condition. */
14465 matching_parens parens;
14468 /* Parse the constant-expression. Allow a non-constant expression
14469 here in order to give better diagnostics in finish_static_assert. */
14470 condition =
14476 {
14479 "%<static_assert%> without a message "
14481 /* Eat the ')' */
14486 }
14487 else
14488 {
14489 /* Parse the separating `,'. */
14492 /* Parse the string-literal message. */
14497 /* A `)' completes the static assertion. */
14503 }
14505 /* A semicolon terminates the declaration. */
14508 /* Get the location for the static assertion. Use that of the
14509 condition if available, otherwise, use that of the "static_assert"
14510 token. */
14515 /* Complete the static assertion, which may mean either processing
14516 the static assert now or saving it for template instantiation. */
14518 }
14520 /* Parse the expression in decltype ( expression ). */
14522 static tree
14525 {
14527 tree expr;
14529 /* Since we're going to preserve any side-effects from this parse, set up a
14530 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14531 in the expression. */
14534 /* First, try parsing an id-expression. */
14545 {
14548 cp_id_kind idk;
14552 /* Lookup the name we got back from the id-expression. */
14557 /* A template without args is not a complete id-expression. */
14566 {
14567 /* Complete lookup of the id-expression. */
14568 expr = (finish_id_expression
14581 /* We found an id-expression, but it was something that we
14582 should not have found. This is an error, not something
14583 we can recover from, so note that we found an
14584 id-expression and we'll recover as gracefully as
14585 possible. */
14587 }
14592 /* We have an id-expression. */
14594 }
14597 {
14598 /* Abort the id-expression parse. */
14601 /* Parsing tentatively, again. */
14604 /* Parse a class member access. */
14612 /* We have an id-expression. */
14614 }
14617 /* We have parsed the complete id-expression or member access. */
14619 else
14620 {
14621 /* Abort our attempt to parse an id-expression or member access
14622 expression. */
14625 /* Commit to the tentative_firewall so we get syntax errors. */
14628 /* Parse a full expression. */
14631 }
14634 }
14636 /* Parse a `decltype' type. Returns the type.
14638 simple-type-specifier:
14639 decltype ( expression )
14640 C++14 proposal:
14641 decltype ( auto ) */
14643 static tree
14645 {
14650 {
14651 /* Already parsed. */
14654 }
14656 /* Look for the `decltype' token. */
14660 /* Parse the opening `('. */
14661 matching_parens parens;
14671 /* decltype (auto) */
14673 else
14674 {
14675 /* decltype (expression) */
14677 /* Types cannot be defined in a `decltype' expression. Save away the
14678 old message and set the new one. */
14680 parser->type_definition_forbidden_message
14683 /* The restrictions on constant-expressions do not apply inside
14684 decltype expressions. */
14685 bool saved_integral_constant_expression_p
14687 bool saved_non_integral_constant_expression_p
14691 /* Within a parenthesized expression, a `>' token is always
14692 the greater-than operator. */
14693 bool saved_greater_than_is_operator_p
14697 /* Do not actually evaluate the expression. */
14700 /* Do not warn about problems with the expression. */
14706 /* Go back to evaluating expressions. */
14710 /* The `>' token might be the end of a template-id or
14711 template-parameter-list now. */
14712 parser->greater_than_is_operator_p
14715 /* Restore the old message and the integral constant expression
14716 flags. */
14718 parser->integral_constant_expression_p
14720 parser->non_integral_constant_expression_p
14722 }
14724 /* Parse to the closing `)'. */
14726 {
14731 }
14734 {
14735 /* Build auto. */
14738 }
14739 else
14741 tf_warning_or_error);
14743 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14744 it again. */
14755 }
14757 /* Special member functions [gram.special] */
14759 /* Parse a conversion-function-id.
14761 conversion-function-id:
14762 operator conversion-type-id
14764 Returns an IDENTIFIER_NODE representing the operator. */
14766 static tree
14768 {
14769 tree type;
14770 tree saved_scope;
14771 tree saved_qualifying_scope;
14772 tree saved_object_scope;
14775 /* Look for the `operator' token. */
14778 /* When we parse the conversion-type-id, the current scope will be
14779 reset. However, we need that information in able to look up the
14780 conversion function later, so we save it here. */
14784 /* We must enter the scope of the class so that the names of
14785 entities declared within the class are available in the
14786 conversion-type-id. For example, consider:
14788 struct S {
14789 typedef int I;
14790 operator I();
14791 };
14793 S::operator I() { ... }
14795 In order to see that `I' is a type-name in the definition, we
14796 must be in the scope of `S'. */
14799 /* Parse the conversion-type-id. */
14801 /* Leave the scope of the class, if any. */
14804 /* Restore the saved scope. */
14808 /* If the TYPE is invalid, indicate failure. */
14812 }
14814 /* Parse a conversion-type-id:
14816 conversion-type-id:
14817 type-specifier-seq conversion-declarator [opt]
14819 Returns the TYPE specified. */
14821 static tree
14823 {
14824 tree attributes;
14825 cp_decl_specifier_seq type_specifiers;
14827 tree type_specified;
14830 /* Parse the attributes. */
14834 parser->type_definition_forbidden_message
14837 /* Parse the type-specifiers. DR 2413 clarifies that `typename' is
14838 optional in conversion-type-id. */
14846 /* If that didn't work, stop. */
14849 /* Parse the conversion-declarator. */
14857 /* Don't give this error when parsing tentatively. This happens to
14858 work because we always parse this definitively once. */
14861 {
14863 {
14866 }
14870 }
14873 }
14875 /* Parse an (optional) conversion-declarator.
14877 conversion-declarator:
14878 ptr-operator conversion-declarator [opt]
14880 */
14884 {
14887 cp_cv_quals cv_quals;
14889 /* We don't know if there's a ptr-operator next, or not. */
14891 /* Try the ptr-operator. */
14894 /* If it worked, look for more conversion-declarators. */
14896 {
14899 /* Parse another optional declarator. */
14902 declarator = cp_parser_make_indirect_declarator
14906 }
14909 }
14911 /* Parse an (optional) ctor-initializer.
14913 ctor-initializer:
14914 : mem-initializer-list */
14916 static void
14918 {
14919 /* If the next token is not a `:', then there is no
14920 ctor-initializer. */
14922 {
14923 /* Do default initialization of any bases and members. */
14927 }
14929 /* Consume the `:' token. */
14931 /* And the mem-initializer-list. */
14933 }
14935 /* Parse a mem-initializer-list.
14937 mem-initializer-list:
14938 mem-initializer ... [opt]
14939 mem-initializer ... [opt] , mem-initializer-list */
14941 static void
14943 {
14948 /* Let the semantic analysis code know that we are starting the
14949 mem-initializer-list. */
14954 /* Loop through the list. */
14956 {
14957 tree mem_initializer;
14960 /* Parse the mem-initializer. */
14962 /* If the next token is a `...', we're expanding member initializers. */
14968 {
14969 /* Consume the `...'. */
14973 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14974 can be expanded but members cannot. */
14977 {
14982 }
14984 /* Construct the pack expansion type. */
14987 }
14990 {
14994 }
14995 /* Look for a target constructor. */
14999 {
15002 {
15006 }
15008 }
15009 /* Add it to the list, unless it was erroneous. */
15011 {
15014 }
15015 /* If the next token is not a `,', we're done. */
15018 /* Consume the `,' token. */
15020 }
15022 /* Perform semantic analysis. */
15025 }
15027 /* Parse a mem-initializer.
15029 mem-initializer:
15030 mem-initializer-id ( expression-list [opt] )
15031 mem-initializer-id braced-init-list
15033 GNU extension:
15035 mem-initializer:
15036 ( expression-list [opt] )
15038 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
15039 class) or FIELD_DECL (for a non-static data member) to initialize;
15040 the TREE_VALUE is the expression-list. An empty initialization
15041 list is represented by void_list_node. */
15043 static tree
15045 {
15046 tree mem_initializer_id;
15047 tree expression_list;
15048 tree member;
15051 /* Find out what is being initialized. */
15053 {
15057 }
15058 else
15059 {
15063 }
15069 {
15076 }
15077 else
15078 {
15090 }
15100 }
15102 /* Parse a mem-initializer-id.
15104 mem-initializer-id:
15105 :: [opt] nested-name-specifier [opt] class-name
15106 decltype-specifier (C++11)
15107 identifier
15109 Returns a TYPE indicating the class to be initialized for the first
15110 production (and the second in C++11). Returns an IDENTIFIER_NODE
15111 indicating the data member to be initialized for the last production. */
15113 static tree
15115 {
15119 tree id;
15123 /* `typename' is not allowed in this context ([temp.res]). */
15125 {
15127 "keyword %<typename%> not allowed in this context (a qualified "
15130 }
15131 /* Look for the optional `::' operator. */
15132 global_scope_p
15136 /* Look for the optional nested-name-specifier. The simplest way to
15137 implement:
15139 [temp.res]
15141 The keyword `typename' is not permitted in a base-specifier or
15142 mem-initializer; in these contexts a qualified name that
15143 depends on a template-parameter is implicitly assumed to be a
15144 type name.
15146 is to assume that we have seen the `typename' keyword at this
15147 point. */
15148 nested_name_specifier_p
15157 /* If there is a `::' operator or a nested-name-specifier, then we
15158 are definitely looking for a class-name. */
15163 typename_type,
15167 /* Otherwise, we could also be looking for an ordinary identifier. */
15170 /* Try a decltype-specifier. */
15172 else
15173 /* Otherwise, try a class-name. */
15177 none_type,
15181 /* If we found one, we're done. */
15184 /* Otherwise, look for an ordinary identifier. */
15186 }
15188 /* Overloading [gram.over] */
15190 /* Parse an operator-function-id.
15192 operator-function-id:
15193 operator operator
15195 Returns an IDENTIFIER_NODE for the operator which is a
15196 human-readable spelling of the identifier, e.g., `operator +'. */
15198 static cp_expr
15200 {
15202 /* Look for the `operator' keyword. */
15205 /* And then the name of the operator itself. */
15207 }
15209 /* Return an identifier node for a user-defined literal operator.
15210 The suffix identifier is chained to the operator name identifier. */
15212 tree
15214 {
15215 tree identifier;
15222 }
15224 /* Parse an operator.
15226 operator:
15227 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
15228 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
15229 || ++ -- , ->* -> () []
15231 GNU Extensions:
15233 operator:
15234 <? >? <?= >?=
15236 Returns an IDENTIFIER_NODE for the operator which is a
15237 human-readable spelling of the identifier, e.g., `operator +'. */
15239 static cp_expr
15241 {
15246 /* Peek at the next token. */
15251 /* Figure out which operator we have. */
15256 {
15258 {
15259 /* The keyword should be either `new' or `delete'. */
15264 else
15267 /* Consume the `new' or `delete' token. */
15270 /* Peek at the next token. */
15272 /* If it's a `[' token then this is the array variant of the
15273 operator. */
15275 {
15276 /* Consume the `[' token. */
15278 /* Look for the `]' token. */
15283 }
15286 }
15444 {
15445 /* Consume the `('. */
15446 matching_parens parens;
15448 /* Look for the matching `)'. */
15455 }
15458 /* Consume the `['. */
15460 /* Look for the matching `]'. */
15471 /* FALLTHRU */
15480 {
15481 cp_expr str;
15482 tree string_tree;
15488 /* Consume the string. */
15494 {
15498 }
15499 else
15500 {
15502 /* Look for the suffix identifier. */
15505 {
15508 }
15510 {
15514 }
15515 else
15516 {
15519 }
15520 }
15525 {
15528 }
15531 {
15534 }
15536 {
15539 }
15540 /* Generate a location of the form:
15541 "" _suffix_identifier
15542 ^~~~~~~~~~~~~~~~~~~~~
15543 with caret == start at the start token, finish at the end of the
15544 suffix identifier. */
15545 location_t combined_loc
15548 }
15551 /* Anything else is an error. */
15553 }
15555 /* If we have selected an identifier, we need to consume the
15556 operator token. */
15558 {
15562 }
15563 /* Otherwise, no valid operator name was present. */
15564 else
15565 {
15568 }
15572 }
15574 /* Parse a template-declaration.
15576 template-declaration:
15577 export [opt] template < template-parameter-list > declaration
15579 If MEMBER_P is TRUE, this template-declaration occurs within a
15580 class-specifier.
15582 The grammar rule given by the standard isn't correct. What
15583 is really meant is:
15585 template-declaration:
15586 export [opt] template-parameter-list-seq
15587 decl-specifier-seq [opt] init-declarator [opt] ;
15588 export [opt] template-parameter-list-seq
15589 function-definition
15591 template-parameter-list-seq:
15592 template-parameter-list-seq [opt]
15593 template < template-parameter-list >
15595 Concept Extensions:
15597 template-parameter-list-seq:
15598 template < template-parameter-list > requires-clause [opt]
15600 requires-clause:
15601 requires logical-or-expression */
15603 static void
15605 {
15606 /* Check for `export'. */
15608 {
15609 /* Consume the `export' token. */
15611 /* Warn that we do not support `export'. */
15613 }
15616 }
15618 /* Parse a template-parameter-list.
15620 template-parameter-list:
15621 template-parameter
15622 template-parameter-list , template-parameter
15624 Returns a TREE_LIST. Each node represents a template parameter.
15625 The nodes are connected via their TREE_CHAINs. */
15627 static tree
15629 {
15632 /* Don't create wrapper nodes within a template-parameter-list,
15633 since we don't want to have different types based on the
15634 spelling location of constants and decls within them. */
15635 auto_suppress_location_wrappers sentinel;
15639 /* The loop below parses the template parms. We first need to know
15640 the total number of template parms to be able to compute proper
15641 canonical types of each dependent type. So after the loop, when
15642 we know the total number of template parms,
15643 end_template_parm_list computes the proper canonical types and
15644 fixes up the dependent types accordingly. */
15646 {
15647 tree parameter;
15650 location_t parm_loc;
15652 /* Parse the template-parameter. */
15657 /* Add it to the list. */
15660 parm_loc,
15661 parameter,
15662 is_non_type,
15663 is_parameter_pack);
15664 else
15665 {
15668 }
15670 /* If the next token is not a `,', we're done. */
15673 /* Otherwise, consume the `,' token. */
15675 }
15678 }
15680 /* Parse a introduction-list.
15682 introduction-list:
15683 introduced-parameter
15684 introduction-list , introduced-parameter
15686 introduced-parameter:
15687 ...[opt] identifier
15689 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15690 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15691 WILDCARD_DECL will also have DECL_NAME set and token location in
15692 DECL_SOURCE_LOCATION. */
15694 static tree
15696 {
15700 {
15709 /* Build placeholder. */
15717 /* If the next token is not a `,', we're done. */
15720 /* Otherwise, consume the `,' token. */
15722 }
15724 /* Convert the vec into a TREE_VEC. */
15727 tree parm;
15733 }
15735 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15736 is an abstract declarator. */
15740 {
15745 }
15747 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15748 is an abstract declarator. */
15752 {
15756 else
15758 }
15760 /* Returns true if DECL represents a constrained-parameter. */
15764 {
15769 }
15771 /* Returns true if PARM declares a constrained-parameter. */
15775 {
15777 }
15779 /* Check that the type parameter is only a declarator-id, and that its
15780 type is not cv-qualified. */
15782 bool
15785 {
15790 {
15793 }
15795 /* Don't allow cv-qualified type parameters. */
15798 {
15801 }
15804 }
15806 /* Finish parsing/processing a template type parameter and checking
15807 various restrictions. */
15811 tree id,
15813 {
15816 else
15818 }
15820 static tree
15822 {
15823 /* FIXME: This should probably be copied, and we may need to adjust
15824 the template parameter depths. */
15834 }
15836 /* Finish parsing/processing a template template parameter by borrowing
15837 the template parameter list from the prototype parameter. */
15839 static tree
15841 tree proto,
15842 tree id,
15844 {
15848 }
15850 /* Create a new non-type template parameter from the given PARM
15851 declarator. */
15853 static tree
15856 {
15862 }
15864 /* Build a constrained template parameter based on the PARMDECL
15865 declarator. The type of PARMDECL is the constrained type, which
15866 refers to the prototype template parameter that ultimately
15867 specifies the type of the declared parameter. */
15869 static tree
15874 {
15880 /* A template parameter constrained by a variadic concept shall also
15881 be declared as a template parameter pack. */
15886 /* Build the parameter. Return an error if the declarator was invalid. */
15887 tree parm;
15892 parmdecl);
15893 else
15898 /* Finish the parameter decl and create a node attaching the
15899 default argument and constraint. */
15904 }
15906 /* Returns true if the parsed type actually represents the declaration
15907 of a type template-parameter. */
15911 {
15914 }
15917 /* Returns true if the parsed type actually represents the declaration of
15918 a template template-parameter. */
15920 static bool
15922 {
15925 }
15927 /* Parse a default argument for a type template-parameter.
15928 Note that diagnostics are handled in cp_parser_template_parameter. */
15930 static tree
15932 {
15935 /* Consume the `=' token. */
15940 /* Parse the default-argument. */
15943 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
15944 NULL);
15948 {
15952 }
15955 }
15957 /* Parse a default argument for a template template-parameter. */
15959 static tree
15961 {
15966 /* Consume the `='. */
15968 /* Parse the id-expression. */
15970 /* save token before parsing the id-expression, for error
15971 reporting */
15973 tree default_argument
15981 /* If the id-expression was a template-id that refers to
15982 a template-class, we already have the declaration here,
15983 so no further lookup is needed. */
15984 ;
15985 else
15986 /* Look up the name. */
15987 default_argument
15989 none_type,
15995 /* See if the default argument is valid. */
15999 }
16001 /* Parse a template-parameter.
16003 template-parameter:
16004 type-parameter
16005 parameter-declaration
16007 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
16008 the parameter. The TREE_PURPOSE is the default value, if any.
16009 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
16010 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
16011 set to true iff this parameter is a parameter pack. */
16013 static tree
16016 {
16019 tree parm;
16021 /* Assume it is a type parameter or a template parameter. */
16023 /* Assume it not a parameter pack. */
16025 /* Peek at the next token. */
16027 /* If it is `template', we have a type-parameter. */
16030 /* If it is `class' or `typename' we do not know yet whether it is a
16031 type parameter or a non-type parameter. Consider:
16033 template <typename T, typename T::X X> ...
16035 or:
16037 template <class C, class D*> ...
16039 Here, the first parameter is a type parameter, and the second is
16040 a non-type parameter. We can tell by looking at the token after
16041 the identifier -- if it is a `,', `=', or `>' then we have a type
16042 parameter. */
16044 {
16045 /* Peek at the token after `class' or `typename'. */
16047 /* If it's an ellipsis, we have a template type parameter
16048 pack. */
16051 /* If it's an identifier, skip it. */
16054 /* Now, see if the token looks like the end of a template
16055 parameter. */
16060 }
16062 /* Otherwise, it is a non-type parameter or a constrained parameter.
16064 [temp.param]
16066 When parsing a default template-argument for a non-type
16067 template-parameter, the first non-nested `>' is taken as the end
16068 of the template parameter-list rather than a greater-than
16069 operator. */
16070 parameter_declarator
16072 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
16079 /* If the parameter declaration is marked as a parameter pack, set
16080 *IS_PARAMETER_PACK to notify the caller. */
16085 {
16086 /* Can happen in some cases of erroneous input (c++/34892). */
16088 /* Consume the `...' for better error recovery. */
16090 }
16092 // The parameter may have been constrained.
16095 parameter_declarator,
16096 is_non_type,
16097 is_parameter_pack);
16099 // Now we're sure that the parameter is a non-type parameter.
16110 }
16112 /* Parse a type-parameter.
16114 type-parameter:
16115 class identifier [opt]
16116 class identifier [opt] = type-id
16117 typename identifier [opt]
16118 typename identifier [opt] = type-id
16119 template < template-parameter-list > class identifier [opt]
16120 template < template-parameter-list > class identifier [opt]
16121 = id-expression
16123 GNU Extension (variadic templates):
16125 type-parameter:
16126 class ... identifier [opt]
16127 typename ... identifier [opt]
16129 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
16130 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
16131 the declaration of the parameter.
16133 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
16135 static tree
16137 {
16139 tree parameter;
16141 /* Look for a keyword to tell us what kind of parameter this is. */
16147 {
16150 {
16151 tree identifier;
16152 tree default_argument;
16154 /* If the next token is an ellipsis, we have a template
16155 argument pack. */
16157 {
16158 /* Consume the `...' token. */
16163 }
16165 /* If the next token is an identifier, then it names the
16166 parameter. */
16169 else
16172 /* Create the parameter. */
16175 /* If the next token is an `=', we have a default argument. */
16177 {
16178 default_argument
16181 /* Template parameter packs cannot have default
16182 arguments. */
16184 {
16187 "template parameter pack %qD cannot have a "
16189 else
16191 "template parameter packs cannot have "
16194 }
16197 }
16198 else
16201 /* Create the combined representation of the parameter and the
16202 default argument. */
16204 }
16208 {
16209 tree identifier;
16210 tree default_argument;
16212 /* Look for the `<'. */
16214 /* Parse the template-parameter-list. */
16216 /* Look for the `>'. */
16219 // If template requirements are present, parse them.
16221 {
16226 }
16228 /* Look for the `class' or 'typename' keywords. */
16230 /* If the next token is an ellipsis, we have a template
16231 argument pack. */
16233 {
16234 /* Consume the `...' token. */
16239 }
16240 /* If the next token is an `=', then there is a
16241 default-argument. If the next token is a `>', we are at
16242 the end of the parameter-list. If the next token is a `,',
16243 then we are at the end of this parameter. */
16247 {
16249 /* Treat invalid names as if the parameter were nameless. */
16252 }
16253 else
16256 /* Create the template parameter. */
16258 identifier);
16260 /* If the next token is an `=', then there is a
16261 default-argument. */
16263 {
16264 default_argument
16267 /* Template parameter packs cannot have default
16268 arguments. */
16270 {
16273 "template parameter pack %qD cannot "
16275 identifier);
16276 else
16280 }
16281 }
16282 else
16285 /* Create the combined representation of the parameter and the
16286 default argument. */
16288 }
16294 }
16297 }
16299 /* Parse a template-id.
16301 template-id:
16302 template-name < template-argument-list [opt] >
16304 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
16305 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
16306 returned. Otherwise, if the template-name names a function, or set
16307 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
16308 names a class, returns a TYPE_DECL for the specialization.
16310 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
16311 uninstantiated templates. */
16313 static tree
16319 {
16320 tree templ;
16321 tree arguments;
16322 tree template_id;
16327 /* If the next token corresponds to a template-id, there is no need
16328 to reparse it. */
16331 {
16334 }
16336 /* Avoid performing name lookup if there is no possibility of
16337 finding a template-id. */
16340 && !cp_parser_nth_token_starts_template_argument_list_p
16342 {
16345 }
16347 /* Remember where the template-id starts. */
16353 /* Parse the template-name. */
16356 check_dependency_p,
16357 is_declaration,
16358 tag_type,
16361 /* Push any access checks inside the firewall we're about to create. */
16367 /* Since we're going to preserve any side-effects from this parse, set up a
16368 firewall to protect our callers from cp_parser_commit_to_tentative_parse
16369 in the template arguments. */
16373 /* If we find the sequence `[:' after a template-name, it's probably
16374 a digraph-typo for `< ::'. Substitute the tokens and check if we can
16375 parse correctly the argument list. */
16382 {
16384 /* Change `:' into `::'. */
16386 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
16387 CPP_LESS. */
16390 /* Parse the arguments. */
16393 {
16394 /* If we couldn't parse an argument list, then we revert our changes
16395 and return simply an error. Maybe this is not a template-id
16396 after all. */
16401 }
16402 /* Otherwise, emit an error about the invalid digraph, but continue
16403 parsing because we got our argument list. */
16406 {
16409 "%<<:%> is an alternate spelling for %<[%>."
16412 {
16414 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
16417 }
16418 }
16419 }
16420 else
16421 {
16422 /* Look for the `<' that starts the template-argument-list. */
16424 {
16427 }
16428 /* Parse the arguments. */
16433 && !template_keyword_p
16436 {
16437 /* This didn't go well. */
16439 {
16440 /* C++2A says that "function-name < a;" is now ill-formed. */
16442 {
16445 "operand of %<<%> is ill-formed in C++2a; wrap the "
16447 }
16448 else
16449 /* We expect "f<targs>" to be followed by "(args)". */
16453 /* Purge all subsequent tokens. */
16455 }
16456 else
16460 }
16461 }
16463 /* Set the location to be of the form:
16464 template-name < template-argument-list [opt] >
16465 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
16466 with caret == start at the start of the template-name,
16467 ranging until the closing '>'. */
16468 location_t combined_loc
16471 /* Check for concepts autos where they don't belong. We could
16472 identify types in some cases of idnetifier TEMPL, looking ahead
16473 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
16474 types. We reject them in functions, but if what we have is an
16475 identifier, even with none_type we can't conclude it's NOT a
16476 type, we have to wait for template substitution. */
16479 /* Build a representation of the specialization. */
16482 TEMPLATE_ID_EXPR,
16486 {
16487 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
16488 template (rather than some instantiation thereof) only if
16489 is not nested within some other construct. For example, in
16490 "template <typename T> void f(T) { A<T>::", A<T> is just an
16491 instantiation of A. */
16492 bool entering_scope
16495 template_id
16497 }
16498 /* A template-like identifier may be a partial concept id. */
16504 {
16508 }
16509 else
16510 {
16511 /* If it's not a class-template or a template-template, it should be
16512 a function-template. */
16518 }
16520 /* If parsing tentatively, replace the sequence of tokens that makes
16521 up the template-id with a CPP_TEMPLATE_ID token. That way,
16522 should we re-parse the token stream, we will not have to repeat
16523 the effort required to do the parse, nor will we issue duplicate
16524 error messages about problems during instantiation of the
16525 template. */
16527 /* Don't do this if we had a parse error in a declarator; re-parsing
16528 might succeed if a name changes meaning (60361). */
16532 {
16533 /* Reset the contents of the START_OF_ID token. */
16537 /* Retrieve any deferred checks. Do not pop this access checks yet
16538 so the memory will not be reclaimed during token replacing below. */
16544 /* Purge all subsequent tokens. */
16547 /* ??? Can we actually assume that, if template_id ==
16548 error_mark_node, we will have issued a diagnostic to the
16549 user, as opposed to simply marking the tentative parse as
16550 failed? */
16553 }
16557 }
16559 /* Parse a template-name.
16561 template-name:
16562 identifier
16564 The standard should actually say:
16566 template-name:
16567 identifier
16568 operator-function-id
16570 A defect report has been filed about this issue.
16572 A conversion-function-id cannot be a template name because they cannot
16573 be part of a template-id. In fact, looking at this code:
16575 a.operator K<int>()
16577 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
16578 It is impossible to call a templated conversion-function-id with an
16579 explicit argument list, since the only allowed template parameter is
16580 the type to which it is converting.
16582 If TEMPLATE_KEYWORD_P is true, then we have just seen the
16583 `template' keyword, in a construction like:
16585 T::template f<3>()
16587 In that case `f' is taken to be a template-name, even though there
16588 is no way of knowing for sure.
16590 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
16591 name refers to a set of overloaded functions, at least one of which
16592 is a template, or an IDENTIFIER_NODE with the name of the template,
16593 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
16594 names are looked up inside uninstantiated templates. */
16596 static tree
16603 {
16604 tree identifier;
16605 tree decl;
16608 /* If the next token is `operator', then we have either an
16609 operator-function-id or a conversion-function-id. */
16611 {
16612 /* We don't know whether we're looking at an
16613 operator-function-id or a conversion-function-id. */
16615 /* Try an operator-function-id. */
16617 /* If that didn't work, try a conversion-function-id. */
16619 {
16622 }
16623 }
16624 /* Look for the identifier. */
16625 else
16628 /* If we didn't find an identifier, we don't have a template-id. */
16632 /* If the name immediately followed the `template' keyword, then it
16633 is a template-name. However, if the next token is not `<', then
16634 we do not treat it as a template-name, since it is not being used
16635 as part of a template-id. This enables us to handle constructs
16636 like:
16638 template <typename T> struct S { S(); };
16639 template <typename T> S<T>::S();
16641 correctly. We would treat `S' as a template -- if it were `S<T>'
16642 -- but we do not if there is no `<'. */
16646 {
16647 /* In a declaration, in a dependent context, we pretend that the
16648 "template" keyword was present in order to improve error
16649 recovery. For example, given:
16651 template <typename T> void f(T::X<int>);
16653 we want to treat "X<int>" as a template-id. */
16655 && !template_keyword_p
16657 && check_dependency_p
16659 /* Do not do this for dtors (or ctors), since they never
16660 need the template keyword before their name. */
16662 {
16665 /* Explain what went wrong. */
16667 identifier);
16670 /* If parsing tentatively, find the location of the "<" token. */
16673 /* Parse the template arguments so that we can issue error
16674 messages about them. */
16677 /* Skip tokens until we find a good place from which to
16678 continue parsing. */
16683 /* If parsing tentatively, permanently remove the
16684 template argument list. That will prevent duplicate
16685 error messages from being issued about the missing
16686 "template" keyword. */
16693 }
16695 /* If the "template" keyword is present, then there is generally
16696 no point in doing name-lookup, so we just return IDENTIFIER.
16697 But, if the qualifying scope is non-dependent then we can
16698 (and must) do name-lookup normally. */
16700 {
16706 {
16707 /* We're optimizing away the call to cp_parser_lookup_name, but
16708 we still need to do this. */
16711 }
16712 }
16713 }
16715 /* cp_parser_lookup_name clears OBJECT_TYPE. */
16719 /* Look up the name. */
16721 tag_type,
16724 check_dependency_p,
16730 /* If DECL is a template, then the name was a template-name. */
16732 {
16736 }
16737 else
16738 {
16739 /* The standard does not explicitly indicate whether a name that
16740 names a set of overloaded declarations, some of which are
16741 templates, is a template-name. However, such a name should
16742 be a template-name; otherwise, there is no way to form a
16743 template-id for the overloaded templates. */
16753 && !scoped_p
16756 {
16757 /* [temp.names] says "A name is also considered to refer to a template
16758 if it is an unqualified-id followed by a < and name lookup finds
16759 either one or more functions or finds nothing." */
16761 /* The "more functions" case. Just use the OVERLOAD as normally.
16762 We don't use is_overloaded_fn here to avoid considering
16763 BASELINKs. */
16765 /* Name lookup found one function. */
16768 /* Name lookup found nothing. */
16771 }
16774 {
16775 /* The name does not name a template. */
16778 }
16779 }
16782 }
16784 /* Parse a template-argument-list.
16786 template-argument-list:
16787 template-argument ... [opt]
16788 template-argument-list , template-argument ... [opt]
16790 Returns a TREE_VEC containing the arguments. */
16792 static tree
16794 {
16799 tree vec;
16804 /* Don't create location wrapper nodes within a template-argument-list. */
16805 auto_suppress_location_wrappers sentinel;
16809 /* Even if the template-id appears in an integral
16810 constant-expression, the contents of the argument list do
16811 not. */
16817 /* Parse the arguments. */
16818 do
16819 {
16820 tree argument;
16823 /* Consume the comma. */
16826 /* Parse the template-argument. */
16829 /* If the next token is an ellipsis, we're expanding a template
16830 argument pack. */
16832 {
16834 {
16838 }
16839 /* Consume the `...' token. */
16842 /* Make the argument into a TYPE_PACK_EXPANSION or
16843 EXPR_PACK_EXPANSION. */
16845 }
16848 {
16852 {
16855 }
16856 else
16858 }
16860 }
16876 }
16878 /* Parse a template-argument.
16880 template-argument:
16881 assignment-expression
16882 type-id
16883 id-expression
16885 The representation is that of an assignment-expression, type-id, or
16886 id-expression -- except that the qualified id-expression is
16887 evaluated, so that the value returned is either a DECL or an
16888 OVERLOAD.
16890 Although the standard says "assignment-expression", it forbids
16891 throw-expressions or assignments in the template argument.
16892 Therefore, we use "conditional-expression" instead. */
16894 static tree
16896 {
16897 tree argument;
16903 cp_id_kind idk;
16905 /* There's really no way to know what we're looking at, so we just
16906 try each alternative in order.
16908 [temp.arg]
16910 In a template-argument, an ambiguity between a type-id and an
16911 expression is resolved to a type-id, regardless of the form of
16912 the corresponding template-parameter.
16914 Therefore, we try a type-id first. */
16917 /* If there was no error parsing the type-id but the next token is a
16918 '>>', our behavior depends on which dialect of C++ we're
16919 parsing. In C++98, we probably found a typo for '> >'. But there
16920 are type-id which are also valid expressions. For instance:
16922 struct X { int operator >> (int); };
16923 template <int V> struct Foo {};
16924 Foo<X () >> 5> r;
16926 Here 'X()' is a valid type-id of a function type, but the user just
16927 wanted to write the expression "X() >> 5". Thus, we remember that we
16928 found a valid type-id, but we still try to parse the argument as an
16929 expression to see what happens.
16931 In C++0x, the '>>' will be considered two separate '>'
16932 tokens. */
16936 {
16939 }
16940 else
16941 {
16942 /* If the next token isn't a `,' or a `>', then this argument wasn't
16943 really finished. This means that the argument is not a valid
16944 type-id. */
16947 /* If that worked, we're done. */
16950 }
16951 /* We're still not sure what the argument will be. */
16953 /* Try a template. */
16961 /* If the next token isn't a `,' or a `>', then this argument wasn't
16962 really finished. */
16966 {
16967 /* Figure out what is being referred to. If the id-expression
16968 was for a class template specialization, then we will have a
16969 TYPE_DECL at this point. There is no need to do name lookup
16970 at this point in that case. */
16973 none_type,
16979 /* Handle a constrained-type-specifier for a non-type template
16980 parameter. */
16986 }
16988 {
16992 }
16993 /* It must be a non-type argument. In C++17 any constant-expression is
16994 allowed. */
16998 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
17000 -- an integral constant-expression of integral or enumeration
17001 type; or
17003 -- the name of a non-type template-parameter; or
17005 -- the name of an object or function with external linkage...
17007 -- the address of an object or function with external linkage...
17009 -- a pointer to member... */
17010 /* Look for a non-type template parameter. */
17012 {
17024 }
17026 /* If the next token is "&", the argument must be the address of an
17027 object or function with external linkage. */
17030 {
17033 }
17034 /* See if we might have an id-expression. */
17041 {
17044 address_p,
17051 else
17052 {
17053 tree probe;
17056 {
17057 /* Strip the dereference temporarily. */
17060 }
17062 /* If we're in a template, we represent a qualified-id referring
17063 to a static data member as a SCOPE_REF even if the scope isn't
17064 dependent so that we can check access control later. */
17069 {
17070 /* A variable without external linkage might still be a
17071 valid constant-expression, so no error is issued here
17072 if the external-linkage check fails. */
17075 }
17077 /* All overloaded functions are allowed; if the external
17078 linkage test does not pass, an error will be issued
17079 later. */
17080 ;
17084 /* A pointer-to-member. */
17085 ;
17087 ;
17088 else
17092 {
17095 tf_warning_or_error);
17096 else
17099 }
17100 }
17101 }
17102 /* If the argument started with "&", there are no other valid
17103 alternatives at this point. */
17105 {
17108 }
17110 general_expr:
17111 /* If the argument wasn't successfully parsed as a type-id followed
17112 by '>>', the argument can only be a constant expression now.
17113 Otherwise, we try parsing the constant-expression tentatively,
17114 because the argument could really be a type-id. */
17120 else
17121 {
17122 /* In C++20, we can encounter a braced-init-list. */
17125 {
17128 }
17130 /* With C++17 generalized non-type template arguments we need to handle
17131 lvalue constant expressions, too. */
17134 }
17142 /* We did our best to parse the argument as a non type-id, but that
17143 was the only alternative that matched (albeit with a '>' after
17144 it). We can assume it's just a typo from the user, and a
17145 diagnostic will then be issued. */
17147 }
17149 /* Parse an explicit-instantiation.
17151 explicit-instantiation:
17152 template declaration
17154 Although the standard says `declaration', what it really means is:
17156 explicit-instantiation:
17157 template decl-specifier-seq [opt] declarator [opt] ;
17159 Things like `template int S<int>::i = 5, int S<double>::j;' are not
17160 supposed to be allowed. A defect report has been filed about this
17161 issue.
17163 GNU Extension:
17165 explicit-instantiation:
17166 storage-class-specifier template
17167 decl-specifier-seq [opt] declarator [opt] ;
17168 function-specifier template
17169 decl-specifier-seq [opt] declarator [opt] ; */
17171 static void
17173 {
17175 cp_decl_specifier_seq decl_specifiers;
17180 /* Look for an (optional) storage-class-specifier or
17181 function-specifier. */
17183 {
17184 extension_specifier
17187 extension_specifier
17190 }
17192 /* Look for the `template' keyword. */
17194 /* Let the front end know that we are processing an explicit
17195 instantiation. */
17197 /* [temp.explicit] says that we are supposed to ignore access
17198 control while processing explicit instantiation directives. */
17200 /* Parse a decl-specifier-seq. */
17202 CP_PARSER_FLAGS_OPTIONAL,
17205 /* If there was exactly one decl-specifier, and it declared a class,
17206 and there's no declarator, then we have an explicit type
17207 instantiation. */
17209 {
17210 tree type;
17214 /* Turn access control back on for names used during
17215 template instantiation. */
17220 }
17221 else
17222 {
17224 tree decl;
17226 /* Parse the declarator. */
17227 declarator
17229 CP_PARSER_FLAGS_NONE,
17240 {
17243 "explicit instantiation shall not use"
17247 "explicit instantiation shall not use"
17252 /* Turn access control back on for names used during
17253 template instantiation. */
17255 /* Do the explicit instantiation. */
17257 }
17258 else
17259 {
17261 /* Skip the body of the explicit instantiation. */
17263 }
17264 }
17265 /* We're done with the instantiation. */
17271 }
17273 /* Parse an explicit-specialization.
17275 explicit-specialization:
17276 template < > declaration
17278 Although the standard says `declaration', what it really means is:
17280 explicit-specialization:
17281 template <> decl-specifier [opt] init-declarator [opt] ;
17282 template <> function-definition
17283 template <> explicit-specialization
17284 template <> template-declaration */
17286 static void
17288 {
17292 /* Look for the `template' keyword. */
17294 /* Look for the `<'. */
17296 /* Look for the `>'. */
17298 /* We have processed another parameter list. */
17300 /* [temp]
17302 A template ... explicit specialization ... shall not have C
17303 linkage. */
17305 {
17308 /* Give it C++ linkage to avoid confusing other parts of the
17309 front end. */
17312 }
17313 else
17315 /* Let the front end know that we are beginning a specialization. */
17317 {
17320 }
17322 /* If the next keyword is `template', we need to figure out whether
17323 or not we're looking a template-declaration. */
17325 {
17330 else
17332 }
17333 else
17334 /* Parse the dependent declaration. */
17340 /* We're done with the specialization. */
17342 /* For the erroneous case of a template with C linkage, we pushed an
17343 implicit C++ linkage scope; exit that scope now. */
17346 /* We're done with this parameter list. */
17348 }
17350 /* Parse a type-specifier.
17352 type-specifier:
17353 simple-type-specifier
17354 class-specifier
17355 enum-specifier
17356 elaborated-type-specifier
17357 cv-qualifier
17359 GNU Extension:
17361 type-specifier:
17362 __complex__
17364 Returns a representation of the type-specifier. For a
17365 class-specifier, enum-specifier, or elaborated-type-specifier, a
17366 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
17368 The parser flags FLAGS is used to control type-specifier parsing.
17370 If IS_DECLARATION is TRUE, then this type-specifier is appearing
17371 in a decl-specifier-seq.
17373 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
17374 class-specifier, enum-specifier, or elaborated-type-specifier, then
17375 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
17376 if a type is declared; 2 if it is defined. Otherwise, it is set to
17377 zero.
17379 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
17380 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
17381 is set to FALSE. */
17383 static tree
17385 cp_parser_flags flags,
17390 {
17396 /* Assume this type-specifier does not declare a new type. */
17399 /* And that it does not specify a cv-qualifier. */
17402 /* Peek at the next token. */
17405 /* If we're looking at a keyword, we can use that to guide the
17406 production we choose. */
17409 {
17414 /* Look for the enum-specifier. */
17416 /* If that worked, we're done. */
17418 {
17423 type_spec,
17424 token,
17427 }
17428 else
17431 /* Any of these indicate either a class-specifier, or an
17432 elaborated-type-specifier. */
17439 /* Parse tentatively so that we can back up if we don't find a
17440 class-specifier. */
17442 /* Look for the class-specifier. */
17445 /* If that worked, we're done. */
17447 {
17452 type_spec,
17453 token,
17456 }
17458 /* Fall through. */
17459 elaborated_type_specifier:
17460 /* We're declaring (not defining) a class or enum. */
17464 /* Fall through. */
17466 /* Look for an elaborated-type-specifier. */
17467 type_spec
17468 = (cp_parser_elaborated_type_specifier
17471 is_declaration));
17474 type_spec,
17475 token,
17498 /* The `__complex__' keyword is a GNU extension. */
17504 }
17506 /* Handle simple keywords. */
17508 {
17510 {
17513 }
17515 }
17517 /* If we do not already have a type-specifier, assume we are looking
17518 at a simple-type-specifier. */
17520 decl_specs,
17521 flags);
17523 /* If we didn't find a type-specifier, and a type-specifier was not
17524 optional in this context, issue an error message. */
17526 {
17529 }
17532 }
17534 /* Parse a simple-type-specifier.
17536 simple-type-specifier:
17537 :: [opt] nested-name-specifier [opt] type-name
17538 :: [opt] nested-name-specifier template template-id
17539 char
17540 wchar_t
17541 bool
17542 short
17543 int
17544 long
17545 signed
17546 unsigned
17547 float
17548 double
17549 void
17551 C++11 Extension:
17553 simple-type-specifier:
17554 auto
17555 decltype ( expression )
17556 char16_t
17557 char32_t
17558 __underlying_type ( type-id )
17560 C++17 extension:
17562 nested-name-specifier(opt) template-name
17564 GNU Extension:
17566 simple-type-specifier:
17567 __int128
17568 __typeof__ unary-expression
17569 __typeof__ ( type-id )
17570 __typeof__ ( type-id ) { initializer-list , [opt] }
17572 Concepts Extension:
17574 simple-type-specifier:
17575 constrained-type-specifier
17577 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
17578 appropriately updated. */
17580 static tree
17583 cp_parser_flags flags)
17584 {
17589 /* Peek at the next token. */
17592 /* If we're looking at a keyword, things are easy. */
17594 {
17632 {
17635 /* Check if the alternate "__intN__" form has been used instead of
17636 "__intN". */
17641 }
17670 {
17671 /* The 'auto' might be the placeholder return type for a function decl
17672 with trailing return type. */
17681 {
17683 {
17690 }
17693 {
17696 }
17699 }
17703 {
17706 }
17709 {
17712 }
17713 else
17717 {
17720 "use of %<auto%> in lambda parameter declaration "
17721 "only available with "
17723 }
17726 "use of %<auto%> in parameter declaration "
17727 "only available with "
17731 "use of %<auto%> in parameter declaration "
17733 }
17734 else
17739 /* Since DR 743, decltype can either be a simple-type-specifier by
17740 itself or begin a nested-name-specifier. Parsing it will replace
17741 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17742 handling below decide what to do. */
17748 /* Consume the `typeof' token. */
17750 /* Parse the operand to `typeof'. */
17752 /* If it is not already a TYPE, take its type. */
17758 token,
17767 token,
17777 token,
17782 }
17784 /* If token is an already-parsed decltype not followed by ::,
17785 it's a simple-type-specifier. */
17788 {
17791 {
17793 token,
17795 /* Remember that we are handling a decltype in order to
17796 implement the resolution of DR 1510 when the argument
17797 isn't instantiation dependent. */
17799 }
17802 }
17804 /* If the type-specifier was for a built-in type, we're done. */
17806 {
17807 /* Record the type. */
17814 type,
17815 token,
17820 /* Consume the token. */
17826 /* There is no valid C++ program where a non-template type is
17827 followed by a "<". That usually indicates that the user thought
17828 that the type was a template. */
17833 }
17835 /* The type-specifier must be a user-defined type. */
17837 {
17843 /* Don't gobble tokens or issue error messages if this is an
17844 optional type-specifier. */
17850 /* Look for the optional `::' operator. */
17851 global_p
17855 /* Look for the nested-name specifier. */
17856 qualified_p
17863 /* If we have seen a nested-name-specifier, and the next token
17864 is `template', then we are using the template-id production. */
17867 {
17868 /* Look for the template-id. */
17872 none_type,
17874 /* If the template-id did not name a type, we are out of
17875 luck. */
17877 {
17878 /* ...unless we pretend we have seen 'typename'. */
17882 else
17883 {
17886 }
17887 }
17888 }
17890 /* Otherwise, look for a type-name. */
17892 {
17900 }
17903 {
17904 /* Try class template argument deduction. */
17908 {
17910 none_type,
17920 else
17921 {
17926 }
17927 }
17928 else
17930 }
17932 /* If it didn't work out, we don't have a TYPE. */
17937 /* Keep track of all name-lookups performed in class scopes. */
17939 && !global_p
17940 && !qualified_p
17947 token,
17949 }
17951 /* If we didn't get a type-name, issue an error message. */
17953 {
17956 }
17959 {
17960 /* See if TYPE is an Objective-C type, and if so, parse and
17961 accept any protocol references following it. Do this before
17962 the cp_parser_check_for_invalid_template_id() call, because
17963 Objective-C types can be followed by '<...>' which would
17964 enclose protocol names rather than template arguments, and so
17965 everything is fine. */
17968 {
17972 /* Clobber the "unqualified" type previously entered into
17973 DECL_SPECS with the new, improved protocol-qualified version. */
17978 }
17980 /* There is no valid C++ program where a non-template type is
17981 followed by a "<". That usually indicates that the user
17982 thought that the type was a template. */
17984 none_type,
17986 }
17989 }
17991 /* Parse a type-name.
17993 type-name:
17994 class-name
17995 enum-name
17996 typedef-name
17997 simple-template-id [in c++0x]
17999 enum-name:
18000 identifier
18002 typedef-name:
18003 identifier
18005 Concepts:
18007 type-name:
18008 concept-name
18009 partial-concept-id
18011 concept-name:
18012 identifier
18014 Returns a TYPE_DECL for the type. */
18016 static tree
18018 {
18019 tree type_decl;
18021 /* We can't know yet whether it is a class-name or not. */
18023 /* Try a class-name. */
18025 typename_keyword_p,
18027 none_type,
18031 /* If it's not a class-name, keep looking. */
18033 {
18035 /* It must be a typedef-name or an enum-name. */
18039 /* It is either a simple-template-id representing an
18040 instantiation of an alias template... */
18044 none_type,
18046 /* Note that this must be an instantiation of an alias template
18047 because [temp.names]/6 says:
18049 A template-id that names an alias template specialization
18050 is a type-name.
18052 Whereas [temp.names]/7 says:
18054 A simple-template-id that names a class template
18055 specialization is a class-name.
18057 With concepts, this could also be a partial-concept-id that
18058 declares a non-type template parameter. */
18065 else
18069 /* ... Or a typedef-name or an enum-name. */
18071 }
18074 }
18076 /* Check if DECL and ARGS can form a constrained-type-specifier.
18077 If ARGS is non-null, we try to form a concept check of the
18078 form DECL<?, ARGS> where ? is a wildcard that matches any
18079 kind of template argument. If ARGS is NULL, then we try to
18080 form a concept check of the form DECL<?>. */
18082 static tree
18085 {
18088 /* If we a constrained-type-specifier cannot be deduced. */
18092 /* A constrained type specifier can only be found in an
18093 overload set or as a reference to a template declaration.
18095 FIXME: This might be masking a bug. It's possible that
18096 that the deduction below is causing template specializations
18097 to be formed with the wildcard as an argument. */
18101 /* Try to build a call expression that evaluates the
18102 concept. This can fail if the overload set refers
18103 only to non-templates. */
18109 /* Deduce the checked constraint and the prototype parameter.
18111 FIXME: In certain cases, failure to deduce should be a
18112 diagnosable error. */
18113 tree conc;
18114 tree proto;
18118 /* In template parameter scope, this results in a constrained
18119 parameter. Return a descriptor of that parm. */
18123 /* In a parameter-declaration-clause, constrained-type
18124 specifiers result in invented template parameters. */
18126 {
18129 }
18130 else
18131 {
18132 /* Otherwise, we're in a context where the constrained
18133 type name is deduced and the constraint applies
18134 after deduction. */
18136 }
18139 }
18141 /* If DECL refers to a concept, return a TYPE_DECL representing
18142 the result of using the constrained type specifier in the
18143 current context. DECL refers to a concept if
18145 - it is an overload set containing a function concept taking a single
18146 type argument, or
18148 - it is a variable concept taking a single type argument. */
18150 static tree
18152 {
18158 else
18160 }
18162 /* Check if DECL and ARGS form a partial-concept-id. If so,
18163 assign ID to the resulting constrained placeholder.
18165 Returns true if the partial-concept-id designates a placeholder
18166 and false otherwise. Note that *id is set to NULL_TREE in
18167 this case. */
18169 static tree
18171 {
18173 }
18175 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
18176 or a concept-name.
18178 enum-name:
18179 identifier
18181 typedef-name:
18182 identifier
18184 concept-name:
18185 identifier
18187 Returns a TYPE_DECL for the type. */
18189 static tree
18191 {
18192 tree type_decl;
18193 tree identifier;
18200 /* Look up the type-name. */
18205 /* If we found an overload set, then it may refer to a concept-name. */
18211 {
18212 /* See if this is an Objective-C type. */
18217 }
18219 /* Issue an error if we did not find a type-name. */
18221 /* In Objective-C, we have the complication that class names are
18222 normally type names and start declarations (eg, the
18223 "NSObject" in "NSObject *object;"), but can be used in an
18224 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
18225 is an expression. So, a classname followed by a dot is not a
18226 valid type-name. */
18229 {
18234 }
18235 /* Remember that the name was used in the definition of the
18236 current class so that we can check later to see if the
18237 meaning would have been different after the class was
18238 entirely defined. */
18244 }
18246 /* Parse an elaborated-type-specifier. Note that the grammar given
18247 here incorporates the resolution to DR68.
18249 elaborated-type-specifier:
18250 class-key :: [opt] nested-name-specifier [opt] identifier
18251 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
18252 enum-key :: [opt] nested-name-specifier [opt] identifier
18253 typename :: [opt] nested-name-specifier identifier
18254 typename :: [opt] nested-name-specifier template [opt]
18255 template-id
18257 GNU extension:
18259 elaborated-type-specifier:
18260 class-key attributes :: [opt] nested-name-specifier [opt] identifier
18261 class-key attributes :: [opt] nested-name-specifier [opt]
18262 template [opt] template-id
18263 enum attributes :: [opt] nested-name-specifier [opt] identifier
18265 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
18266 declared `friend'. If IS_DECLARATION is TRUE, then this
18267 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
18268 something is being declared.
18270 Returns the TYPE specified. */
18272 static tree
18276 {
18278 tree identifier;
18281 tree globalscope;
18284 /* See if we're looking at the `enum' keyword. */
18286 {
18287 /* Consume the `enum' token. */
18289 /* Remember that it's an enumeration type. */
18291 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
18292 enums) is used here. */
18296 {
18303 /* Consume the `struct' or `class' and parse it anyway. */
18305 }
18306 /* Parse the attributes. */
18308 }
18309 /* Or, it might be `typename'. */
18311 RID_TYPENAME))
18312 {
18313 /* Consume the `typename' token. */
18315 /* Remember that it's a `typename' type. */
18317 }
18318 /* Otherwise it must be a class-key. */
18319 else
18320 {
18324 /* Parse the attributes. */
18326 }
18328 /* Look for the `::' operator. */
18331 /* Look for the nested-name-specifier. */
18332 tree nested_name_specifier;
18334 {
18335 nested_name_specifier
18340 is_declaration);
18343 }
18344 else
18345 /* Even though `typename' is not present, the proposed resolution
18346 to Core Issue 180 says that in `class A<T>::B', `B' should be
18347 considered a type-name, even if `A<T>' is dependent. */
18348 nested_name_specifier
18353 is_declaration);
18354 /* For everything but enumeration types, consider a template-id.
18355 For an enumeration type, consider only a plain identifier. */
18357 {
18359 tree decl;
18361 /* Allow the `template' keyword. */
18363 /* If we didn't see `template', we don't know if there's a
18364 template-id or not. */
18367 /* The `template' keyword must follow a nested-name-specifier. */
18369 {
18373 }
18375 /* Parse the template-id. */
18379 tag_type,
18380 is_declaration);
18381 /* If we didn't find a template-id, look for an ordinary
18382 identifier. */
18384 ;
18385 /* We can get here when cp_parser_template_id, called by
18386 cp_parser_class_name with tag_type == none_type, succeeds
18387 and caches a BASELINK. Then, when called again here,
18388 instead of failing and returning an error_mark_node
18389 returns it (see template/typename17.C in C++11).
18390 ??? Could we diagnose this earlier? */
18392 {
18395 }
18396 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
18397 in effect, then we must assume that, upon instantiation, the
18398 template will correspond to a class. */
18402 typename_type,
18404 /* If the `typename' keyword is in effect and DECL is not a type
18405 decl, then type is non existent. */
18407 ;
18409 {
18413 /* If the next token is a semicolon, this must be a specialization,
18414 instantiation, or friend declaration. Check the scope while we
18415 still know whether or not we had a nested-name-specifier. */
18420 }
18423 }
18426 {
18431 {
18434 }
18436 /* For a `typename', we needn't call xref_tag. */
18442 /* Template parameter lists apply only if we are not within a
18443 function parameter list. */
18444 bool template_parm_lists_apply
18453 /* Look up a qualified name in the usual way. */
18455 {
18456 tree decl;
18457 tree ambiguous_decls;
18460 tag_type,
18467 /* If the lookup was ambiguous, an error will already have been
18468 issued. */
18472 /* If we are parsing friend declaration, DECL may be a
18473 TEMPLATE_DECL tree node here. However, we need to check
18474 whether this TEMPLATE_DECL results in valid code. Consider
18475 the following example:
18477 namespace N {
18478 template <class T> class C {};
18479 }
18480 class X {
18481 template <class T> friend class N::C; // #1, valid code
18482 };
18483 template <class T> class Y {
18484 friend class N::C; // #2, invalid code
18485 };
18487 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
18488 name lookup of `N::C'. We see that friend declaration must
18489 be template for the code to be valid. Note that
18490 processing_template_decl does not work here since it is
18491 always 1 for the above two cases. */
18493 decl = (cp_parser_maybe_treat_template_as_class
18498 {
18500 identifier,
18503 }
18506 {
18510 allow_template);
18514 }
18516 /* Forward declarations of nested types, such as
18518 class C1::C2;
18519 class C1::C2::C3;
18521 are invalid unless all components preceding the final '::'
18522 are complete. If all enclosing types are complete, these
18523 declarations become merely pointless.
18525 Invalid forward declarations of nested types are errors
18526 caught elsewhere in parsing. Those that are pointless arrive
18527 here. */
18534 }
18535 else
18536 {
18537 /* An elaborated-type-specifier sometimes introduces a new type and
18538 sometimes names an existing type. Normally, the rule is that it
18539 introduces a new type only if there is not an existing type of
18540 the same name already in scope. For example, given:
18542 struct S {};
18543 void f() { struct S s; }
18545 the `struct S' in the body of `f' is the same `struct S' as in
18546 the global scope; the existing definition is used. However, if
18547 there were no global declaration, this would introduce a new
18548 local class named `S'.
18550 An exception to this rule applies to the following code:
18552 namespace N { struct S; }
18554 Here, the elaborated-type-specifier names a new type
18555 unconditionally; even if there is already an `S' in the
18556 containing scope this declaration names a new type.
18557 This exception only applies if the elaborated-type-specifier
18558 forms the complete declaration:
18560 [class.name]
18562 A declaration consisting solely of `class-key identifier ;' is
18563 either a redeclaration of the name in the current scope or a
18564 forward declaration of the identifier as a class name. It
18565 introduces the name into the current scope.
18567 We are in this situation precisely when the next token is a `;'.
18569 An exception to the exception is that a `friend' declaration does
18570 *not* name a new type; i.e., given:
18572 struct S { friend struct T; };
18574 `T' is not a new type in the scope of `S'.
18576 Also, `new struct S' or `sizeof (struct S)' never results in the
18577 definition of a new type; a new type can only be declared in a
18578 declaration context. */
18580 tag_scope ts;
18584 /* Friends have special name lookup rules. */
18588 CPP_SEMICOLON))
18589 /* This is a `class-key identifier ;' */
18591 else
18594 template_p =
18595 (template_parm_lists_apply
18598 /* An unqualified name was used to reference this type, so
18599 there were no qualifying templates. */
18608 }
18609 }
18614 /* Allow attributes on forward declarations of classes. */
18616 {
18626 else
18629 }
18632 {
18633 /* Indicate whether this class was declared as a `class' or as a
18634 `struct'. */
18638 }
18640 /* A "<" cannot follow an elaborated type specifier. If that
18641 happens, the user was probably trying to form a template-id. */
18646 }
18648 /* Parse an enum-specifier.
18650 enum-specifier:
18651 enum-head { enumerator-list [opt] }
18652 enum-head { enumerator-list , } [C++0x]
18654 enum-head:
18655 enum-key identifier [opt] enum-base [opt]
18656 enum-key nested-name-specifier identifier enum-base [opt]
18658 enum-key:
18659 enum
18660 enum class [C++0x]
18661 enum struct [C++0x]
18663 enum-base: [C++0x]
18664 : type-specifier-seq
18666 opaque-enum-specifier:
18667 enum-key identifier enum-base [opt] ;
18669 GNU Extensions:
18670 enum-key attributes[opt] identifier [opt] enum-base [opt]
18671 { enumerator-list [opt] }attributes[opt]
18672 enum-key attributes[opt] identifier [opt] enum-base [opt]
18673 { enumerator-list, }attributes[opt] [C++0x]
18675 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
18676 if the token stream isn't an enum-specifier after all. */
18678 static tree
18680 {
18681 tree identifier;
18683 tree prev_scope;
18685 tree attributes;
18698 /* Parse tentatively so that we can back up if we don't find a
18699 enum-specifier. */
18702 /* Caller guarantees that the current token is 'enum', an identifier
18703 possibly follows, and the token after that is an opening brace.
18704 If we don't have an identifier, fabricate an anonymous name for
18705 the enumeration being defined. */
18708 /* Parse the "class" or "struct", which indicates a scoped
18709 enumeration type in C++0x. */
18712 {
18716 /* Consume the `struct' or `class' token. */
18720 }
18724 /* Clear the qualification. */
18729 /* Figure out in what scope the declaration is being placed. */
18735 nested_name_specifier
18743 {
18744 tree name;
18748 enum_type,
18753 input_location);
18755 {
18758 {
18759 /* Are template enums allowed in ISO? */
18763 /* ignore a typename reference, for it will be solved by name
18764 in start_enum. */
18766 }
18767 }
18770 else
18771 {
18776 }
18777 }
18778 else
18779 {
18782 else
18783 {
18789 }
18790 }
18793 /* Check for the `:' that denotes a specified underlying type in C++0x.
18794 Note that a ':' could also indicate a bitfield width, however. */
18796 {
18797 cp_decl_specifier_seq type_specifiers;
18799 /* Consume the `:'. */
18802 /* Parse the type-specifier-seq. */
18808 /* At this point this is surely not elaborated type specifier. */
18817 /* If that didn't work, stop. */
18819 {
18825 }
18826 }
18828 /* Look for the `{' but don't consume it yet. */
18830 {
18832 {
18835 {
18838 }
18839 }
18840 /* An opaque-enum-specifier must have a ';' here. */
18843 {
18846 {
18849 }
18850 }
18851 }
18857 {
18859 {
18863 }
18865 {
18867 }
18868 }
18870 /* Issue an error message if type-definitions are forbidden here. */
18873 else
18874 /* Create the new type. We do this before consuming the opening
18875 brace so the enum will be recorded as being on the line of its
18876 tag (or the 'enum' keyword, if there is no tag). */
18880 /* If the next token is not '{' it is an opaque-enum-specifier or an
18881 elaborated-type-specifier. */
18883 {
18887 {
18888 /* The following catches invalid code such as:
18889 enum class S<int>::E { A, B, C }; */
18897 {
18901 nested_name_specifier);
18903 }
18906 {
18908 "%qT for enum declaration does not name a class "
18911 }
18912 /* If that scope does not contain the scope in which the
18913 class was originally declared, the program is invalid. */
18915 nested_name_specifier))
18916 {
18919 "declaration of %qD in namespace %qD which does not "
18922 else
18924 "declaration of %qD in %qD which does not "
18928 }
18929 /* If that scope is the scope where the declaration is being placed
18930 the program is invalid. */
18934 {
18938 }
18939 }
18944 /* Consume the opening brace. */
18945 matching_braces braces;
18952 {
18956 }
18957 else
18958 {
18964 }
18968 /* If the next token is not '}', then there are some enumerators. */
18970 {
18974 }
18975 else
18978 /* Consume the final '}'. */
18984 }
18985 else
18986 {
18987 /* If a ';' follows, then it is an opaque-enum-specifier
18988 and additional restrictions apply. */
18990 {
18997 }
18998 }
19000 /* Look for trailing attributes to apply to this enumeration, and
19001 apply them if appropriate. */
19003 {
19006 trailing_attr,
19008 }
19010 /* Finish up the enumeration. */
19012 {
19017 }
19020 {
19022 {
19025 }
19027 {
19029 }
19030 }
19031 out:
19034 }
19036 /* Parse an enumerator-list. The enumerators all have the indicated
19037 TYPE.
19039 enumerator-list:
19040 enumerator-definition
19041 enumerator-list , enumerator-definition */
19043 static void
19045 {
19047 {
19048 /* Parse an enumerator-definition. */
19051 /* If the next token is not a ',', we've reached the end of
19052 the list. */
19055 /* Otherwise, consume the `,' and keep going. */
19057 /* If the next token is a `}', there is a trailing comma. */
19059 {
19064 }
19065 }
19066 }
19068 /* Parse an enumerator-definition. The enumerator has the indicated
19069 TYPE.
19071 enumerator-definition:
19072 enumerator
19073 enumerator = constant-expression
19075 enumerator:
19076 identifier
19078 GNU Extensions:
19080 enumerator-definition:
19081 enumerator attributes [opt]
19082 enumerator attributes [opt] = constant-expression */
19084 static void
19086 {
19087 tree identifier;
19088 tree value;
19089 location_t loc;
19091 /* Save the input location because we are interested in the location
19092 of the identifier and not the location of the explicit value. */
19095 /* Look for the identifier. */
19100 /* Parse any specified attributes. */
19103 /* If the next token is an '=', then there is an explicit value. */
19105 {
19106 /* Consume the `=' token. */
19108 /* Parse the value. */
19110 }
19111 else
19114 /* If we are processing a template, make sure the initializer of the
19115 enumerator doesn't contain any bare template parameter pack. */
19119 /* Create the enumerator. */
19121 }
19123 /* Parse a namespace-name.
19125 namespace-name:
19126 original-namespace-name
19127 namespace-alias
19129 Returns the NAMESPACE_DECL for the namespace. */
19131 static tree
19133 {
19134 tree identifier;
19135 tree namespace_decl;
19139 /* Get the name of the namespace. */
19144 /* Look up the identifier in the currently active scope. Look only
19145 for namespaces, due to:
19147 [basic.lookup.udir]
19149 When looking up a namespace-name in a using-directive or alias
19150 definition, only namespace names are considered.
19152 And:
19154 [basic.lookup.qual]
19156 During the lookup of a name preceding the :: scope resolution
19157 operator, object, function, and enumerator names are ignored.
19159 (Note that cp_parser_qualifying_entity only calls this
19160 function if the token after the name is the scope resolution
19161 operator.) */
19163 none_type,
19169 /* If it's not a namespace, issue an error. */
19172 {
19174 {
19175 auto_diagnostic_group d;
19176 name_hint hint;
19180 identifier,
19183 {
19189 }
19190 else
19192 identifier);
19193 }
19194 else
19197 }
19200 }
19202 /* Parse a namespace-definition.
19204 namespace-definition:
19205 named-namespace-definition
19206 unnamed-namespace-definition
19208 named-namespace-definition:
19209 original-namespace-definition
19210 extension-namespace-definition
19212 original-namespace-definition:
19213 namespace identifier { namespace-body }
19215 extension-namespace-definition:
19216 namespace original-namespace-name { namespace-body }
19218 unnamed-namespace-definition:
19219 namespace { namespace-body } */
19221 static void
19223 {
19224 tree identifier;
19234 {
19237 }
19239 /* Look for the `namespace' keyword. */
19240 cp_token* token
19243 /* Parse any specified attributes before the identifier. */
19247 {
19251 RID_INLINE);
19253 {
19259 }
19262 {
19267 "standard attributes on namespaces must precede "
19270 /* Parse any attributes specified after the identifier. */
19272 }
19275 {
19276 /* Don't forget that the innermost namespace might have been
19277 marked as inline. Use |= because we cannot overwrite
19278 IS_INLINE in case the outermost namespace is inline, but
19279 there are no nested inlines. */
19282 }
19286 "nested namespace definitions only available with "
19289 /* Nested namespace names can create new namespaces (unlike
19290 other qualified-ids). */
19295 else
19298 }
19310 /* Start the namespace. */
19317 /* Look for the `{' to validate starting the namespace. */
19318 matching_braces braces;
19320 {
19321 /* Parse the body of the namespace. */
19324 /* Look for the final `}'. */
19326 }
19331 /* Pop the nested namespace definitions. */
19334 }
19336 /* Parse a namespace-body.
19338 namespace-body:
19339 declaration-seq [opt] */
19341 static void
19343 {
19345 }
19347 /* Parse a namespace-alias-definition.
19349 namespace-alias-definition:
19350 namespace identifier = qualified-namespace-specifier ; */
19352 static void
19354 {
19355 tree identifier;
19356 tree namespace_specifier;
19360 /* Look for the `namespace' keyword. */
19362 /* Look for the identifier. */
19366 /* Look for the `=' token. */
19369 {
19371 /* Skip the definition. */
19376 }
19378 /* Look for the qualified-namespace-specifier. */
19379 namespace_specifier
19381 /* Look for the `;' token. */
19384 /* Register the alias in the symbol table. */
19386 }
19388 /* Parse a qualified-namespace-specifier.
19390 qualified-namespace-specifier:
19391 :: [opt] nested-name-specifier [opt] namespace-name
19393 Returns a NAMESPACE_DECL corresponding to the specified
19394 namespace. */
19396 static tree
19398 {
19399 /* Look for the optional `::'. */
19403 /* Look for the optional nested-name-specifier. */
19411 }
19413 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
19414 access declaration.
19416 using-declaration:
19417 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
19418 using :: unqualified-id ;
19420 access-declaration:
19421 qualified-id ;
19423 */
19425 static bool
19428 {
19432 tree decl;
19433 tree identifier;
19434 tree qscope;
19439 {
19442 }
19443 else
19444 {
19445 /* Look for the `using' keyword. */
19448 again:
19449 /* Peek at the next token. */
19451 /* See if it's `typename'. */
19453 {
19454 /* Remember that we've seen it. */
19456 /* Consume the `typename' token. */
19458 }
19459 }
19461 /* Look for the optional global scope qualification. */
19462 global_scope_p
19467 /* If we saw `typename', or didn't see `::', then there must be a
19468 nested-name-specifier present. */
19470 {
19476 {
19479 }
19480 }
19481 /* Otherwise, we could be in either of the two productions. In that
19482 case, treat the nested-name-specifier as optional. */
19483 else
19496 /* Something has already gone wrong; there's no need to parse
19497 further. Since an error has occurred, the return value of
19498 cp_parser_parse_definitely will be false, as required. */
19502 /* Parse the unqualified-id. */
19510 {
19515 }
19517 {
19522 "pack expansion in using-declaration only available "
19525 }
19527 /* The function we call to handle a using-declaration is different
19528 depending on what scope we are in. */
19530 ;
19533 /* [namespace.udecl]
19535 A using declaration shall not name a template-id. */
19538 else
19539 {
19541 {
19542 /* Create the USING_DECL. */
19549 {
19552 }
19553 else
19554 /* Add it to the list of members in this class. */
19556 }
19557 else
19559 }
19563 {
19567 "comma-separated list in using-declaration only available "
19570 }
19572 /* Look for the final `;'. */
19577 "access declarations are deprecated "
19578 "in favour of using-declarations; "
19582 }
19584 /* Parse an alias-declaration.
19586 alias-declaration:
19587 using identifier attribute-specifier-seq [opt] = type-id */
19589 static tree
19591 {
19595 cp_decl_specifier_seq decl_specs;
19599 /* Look for the `using' keyword. */
19600 cp_token *using_token
19622 /* Now we are going to parse the type-id of the declaration. */
19624 /*
19625 [dcl.type]/3 says:
19627 "A type-specifier-seq shall not define a class or enumeration
19628 unless it appears in the type-id of an alias-declaration (7.1.3) that
19629 is not the declaration of a template-declaration."
19631 In other words, if we currently are in an alias template, the
19632 type-id should not define a type.
19634 So let's set parser->type_definition_forbidden_message in that
19635 case; cp_parser_check_type_definition (called by
19636 cp_parser_class_specifier) will then emit an error if a type is
19637 defined in the type-id. */
19639 {
19643 }
19648 /* Restore the error message if need be. */
19654 {
19657 }
19659 /* A typedef-name can also be introduced by an alias-declaration. The
19660 identifier following the using keyword becomes a typedef-name. It has
19661 the same semantics as if it were introduced by the typedef
19662 specifier. In particular, it does not define a new type and it shall
19663 not appear in the type-id. */
19668 {
19671 ds_attribute,
19672 attrs_token);
19673 }
19675 ds_typedef,
19676 using_token);
19678 ds_alias,
19679 using_token);
19686 id_location,
19696 else
19702 // Attach constraints to the alias declaration.
19704 {
19708 }
19715 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19716 added into the symbol table; otherwise, return the TYPE_DECL. */
19720 {
19724 }
19727 }
19729 /* Parse a using-directive.
19731 using-directive:
19732 using namespace :: [opt] nested-name-specifier [opt]
19733 namespace-name ; */
19735 static void
19737 {
19738 tree namespace_decl;
19739 tree attribs;
19741 /* Look for the `using' keyword. */
19743 /* And the `namespace' keyword. */
19745 /* Look for the optional `::' operator. */
19747 /* And the optional nested-name-specifier. */
19753 /* Get the namespace being used. */
19755 /* And any specified attributes. */
19758 /* Update the symbol table. */
19761 /* Look for the final `;'. */
19763 }
19765 /* Parse an asm-definition.
19767 asm-qualifier:
19768 volatile
19769 inline
19770 goto
19772 asm-qualifier-list:
19773 asm-qualifier
19774 asm-qualifier-list asm-qualifier
19776 asm-definition:
19777 asm ( string-literal ) ;
19779 GNU Extension:
19781 asm-definition:
19782 asm asm-qualifier-list [opt] ( string-literal ) ;
19783 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt] ) ;
19784 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt]
19785 : asm-operand-list [opt] ) ;
19786 asm asm-qualifier-list [opt] ( string-literal : asm-operand-list [opt]
19787 : asm-operand-list [opt]
19788 : asm-clobber-list [opt] ) ;
19789 asm asm-qualifier-list [opt] ( string-literal : : asm-operand-list [opt]
19790 : asm-clobber-list [opt]
19791 : asm-goto-list ) ;
19793 The form with asm-goto-list is valid if and only if the asm-qualifier-list
19794 contains goto, and is the only allowed form in that case. No duplicates are
19795 allowed in an asm-qualifier-list. */
19797 static void
19799 {
19800 tree string;
19805 tree asm_stmt;
19812 /* Look for the `asm' keyword. */
19815 /* In C++2a, unevaluated inline assembly is permitted in constexpr
19816 functions. */
19823 /* Handle the asm-qualifier-list. */
19831 {
19835 {
19838 {
19842 }
19843 else
19844 {
19849 }
19855 {
19859 }
19860 else
19869 {
19873 }
19874 else
19889 }
19891 }
19898 {
19901 }
19903 /* Look for the opening `('. */
19906 /* Look for the string. */
19909 {
19913 }
19915 /* If we're allowing GNU extensions, check for the extended assembly
19916 syntax. Unfortunately, the `:' tokens need not be separated by
19917 a space in C, and so, for compatibility, we tolerate that here
19918 too. Doing that means that we have to treat the `::' operator as
19919 two `:' tokens. */
19924 {
19929 /* The extended syntax was used. */
19932 /* Look for outputs. */
19934 {
19935 /* Consume the `:'. */
19937 /* Parse the output-operands. */
19939 CPP_COLON)
19941 CPP_SCOPE)
19943 CPP_CLOSE_PAREN)
19945 {
19949 }
19950 }
19951 /* If the next token is `::', there are no outputs, and the
19952 next token is the beginning of the inputs. */
19954 /* The inputs are coming next. */
19957 /* Look for inputs. */
19960 {
19961 /* Consume the `:' or `::'. */
19963 /* Parse the output-operands. */
19965 CPP_COLON)
19967 CPP_SCOPE)
19969 CPP_CLOSE_PAREN))
19970 {
19974 }
19975 }
19977 /* The clobbers are coming next. */
19980 /* Look for clobbers. */
19983 {
19985 /* Consume the `:' or `::'. */
19987 /* Parse the clobbers. */
19989 CPP_COLON)
19991 CPP_CLOSE_PAREN))
19993 }
19995 /* The labels are coming next. */
19998 /* Look for labels. */
20001 {
20003 /* Consume the `:' or `::'. */
20005 /* Parse the labels. */
20007 }
20011 }
20015 /* Look for the closing `)'. */
20023 {
20024 /* Create the ASM_EXPR. */
20026 {
20029 /* If the extended syntax was not used, mark the ASM_EXPR. */
20031 {
20037 }
20038 }
20039 else
20041 }
20042 }
20044 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
20045 type that comes from the decl-specifier-seq. */
20047 static tree
20049 {
20052 {
20065 }
20068 }
20070 /* Declarators [gram.dcl.decl] */
20072 /* Parse an init-declarator.
20074 init-declarator:
20075 declarator initializer [opt]
20077 GNU Extension:
20079 init-declarator:
20080 declarator asm-specification [opt] attributes [opt] initializer [opt]
20082 function-definition:
20083 decl-specifier-seq [opt] declarator ctor-initializer [opt]
20084 function-body
20085 decl-specifier-seq [opt] declarator function-try-block
20087 GNU Extension:
20089 function-definition:
20090 __extension__ function-definition
20092 TM Extension:
20094 function-definition:
20095 decl-specifier-seq [opt] declarator function-transaction-block
20097 The parser flags FLAGS is used to control type-specifier parsing.
20099 The DECL_SPECIFIERS apply to this declarator. Returns a
20100 representation of the entity declared. If MEMBER_P is TRUE, then
20101 this declarator appears in a class scope. The new DECL created by
20102 this declarator is returned.
20104 The CHECKS are access checks that should be performed once we know
20105 what entity is being declared (and, therefore, what classes have
20106 befriended it).
20108 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
20109 for a function-definition here as well. If the declarator is a
20110 declarator for a function-definition, *FUNCTION_DEFINITION_P will
20111 be TRUE upon return. By that point, the function-definition will
20112 have been completely parsed.
20114 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
20115 is FALSE.
20117 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
20118 parsed declaration if it is an uninitialized single declarator not followed
20119 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
20120 if present, will not be consumed. If returned, this declarator will be
20121 created with SD_INITIALIZED but will not call cp_finish_decl.
20123 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
20124 and there is an initializer, the pointed location_t is set to the
20125 location of the '=' or `(', or '{' in C++11 token introducing the
20126 initializer. */
20128 static tree
20130 cp_parser_flags flags,
20140 {
20144 tree prefix_attributes;
20146 tree asm_specification;
20147 tree initializer;
20149 tree scope;
20151 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
20152 initialized with "= ..", CPP_OPEN_PAREN if initialized with
20153 "(...)". */
20164 /* Gather the attributes that were provided with the
20165 decl-specifiers. */
20168 /* Assume that this is not the declarator for a function
20169 definition. */
20173 /* Default arguments are only permitted for function parameters. */
20177 /* Defer access checks while parsing the declarator; we cannot know
20178 what names are accessible until we know what is being
20179 declared. */
20184 /* Parse the declarator. */
20185 declarator
20190 /* Gather up the deferred checks. */
20195 /* If the DECLARATOR was erroneous, there's no need to go
20196 further. */
20200 /* Check that the number of template-parameter-lists is OK. */
20210 /* Figure out what scope the entity declared by the DECLARATOR is
20211 located in. `grokdeclarator' sometimes changes the scope, so
20212 we compute it now. */
20215 /* Perform any lookups in the declared type which were thought to be
20216 dependent, but are not in the scope of the declarator. */
20217 decl_specifiers->type
20220 /* If we're allowing GNU extensions, look for an
20221 asm-specification. */
20223 {
20224 /* Look for an asm-specification. */
20227 }
20228 else
20231 /* Look for attributes. */
20235 /* Peek at the next token. */
20241 {
20242 /* Handle C++17 deduction guides. */
20246 {
20254 {
20258 }
20259 }
20261 /* Check to see if the token indicates the start of a
20262 function-definition. */
20264 {
20266 {
20267 /* If a function-definition should not appear here, issue an
20268 error message. */
20272 }
20274 location_t func_brace_location
20277 /* Neither attributes nor an asm-specification are allowed
20278 on a function-definition. */
20281 "an %<asm%> specification is not allowed "
20285 "attributes are not allowed "
20287 /* This is a function-definition. */
20290 /* Parse the function definition. */
20293 decl_specifiers,
20294 declarator,
20295 prefix_attributes);
20296 else
20297 decl =
20298 (cp_parser_function_definition_from_specifiers_and_declarator
20302 {
20303 /* This is where the prologue starts... */
20306 }
20309 }
20310 }
20312 {
20313 /* A non-template declaration involving a function parameter list
20314 containing an implicit template parameter will be made into a
20315 template. If the resulting declaration is not going to be an
20316 actual function then finish the template scope here to prevent it.
20317 An error message will be issued once we have a decl to talk about.
20319 FIXME probably we should do type deduction rather than create an
20320 implicit template, but the standard currently doesn't allow it. */
20323 }
20325 /* [dcl.dcl]
20327 Only in function declarations for constructors, destructors, type
20328 conversions, and deduction guides can the decl-specifier-seq be omitted.
20330 We explicitly postpone this check past the point where we handle
20331 function-definitions because we tolerate function-definitions
20332 that are missing their return types in some modes. */
20334 {
20338 }
20340 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
20344 {
20355 {
20361 }
20362 }
20363 else
20364 {
20365 /* If the init-declarator isn't initialized and isn't followed by a
20366 `,' or `;', it's not a valid init-declarator. */
20369 {
20372 else
20373 {
20377 }
20378 }
20381 }
20383 /* Because start_decl has side-effects, we should only call it if we
20384 know we're going ahead. By this point, we know that we cannot
20385 possibly be looking at any other construct. */
20388 /* Enter the newly declared entry in the symbol table. If we're
20389 processing a declaration in a class-specifier, we wait until
20390 after processing the initializer. */
20392 {
20400 /* Adjust location of decl if declarator->id_loc is more appropriate:
20401 set, and decl wasn't merged with another decl, in which case its
20402 location would be different from input_location, and more accurate. */
20407 }
20409 /* Enter the SCOPE. That way unqualified names appearing in the
20410 initializer will be looked up in SCOPE. */
20413 /* Perform deferred access control checks, now that we know in which
20414 SCOPE the declared entity resides. */
20416 {
20419 /* If the entity being declared is a function, pretend that we
20420 are in its scope. If it is a `friend', it may have access to
20421 things that would not otherwise be accessible. */
20423 {
20426 }
20428 /* Perform access checks for template parameters. */
20431 /* Perform the access control checks for the declarator and the
20432 decl-specifiers. */
20435 /* Restore the saved value. */
20438 }
20440 /* Parse the initializer. */
20445 {
20447 {
20450 else
20451 {
20452 /* If the declaration was erroneous, we don't really
20453 know what the user intended, so just silently
20454 consume the initializer. */
20461 }
20462 }
20463 else
20464 {
20465 /* We want to record the extra mangling scope for in-class
20466 initializers of class members and initializers of static data
20467 member templates. The former involves deferring
20468 parsing of the initializer until end of class as with default
20469 arguments. So right here we only handle the latter. */
20479 }
20480 }
20482 /* The old parser allows attributes to appear after a parenthesized
20483 initializer. Mark Mitchell proposed removing this functionality
20484 on the GCC mailing lists on 2002-08-13. This parser accepts the
20485 attributes -- but ignores them. Made a permerror in GCC 8. */
20491 {
20494 {
20498 }
20499 }
20501 /* And now complain about a non-function implicit template. */
20506 /* For an in-class declaration, use `grokfield' to create the
20507 declaration. */
20509 {
20511 {
20514 }
20523 }
20525 /* Finish processing the declaration. But, skip member
20526 declarations. */
20528 {
20531 asm_specification,
20532 /* If the initializer is in parentheses, then this is
20533 a direct-initialization, which means that an
20534 `explicit' constructor is OK. Otherwise, an
20535 `explicit' constructor cannot be used. */
20538 }
20541 /* Core issue #226 (C++0x only): A default template-argument
20542 shall not be specified in a friend class template
20543 declaration. */
20552 {
20555 else
20557 }
20564 }
20566 /* Parse a declarator.
20568 declarator:
20569 direct-declarator
20570 ptr-operator declarator
20572 abstract-declarator:
20573 ptr-operator abstract-declarator [opt]
20574 direct-abstract-declarator
20576 GNU Extensions:
20578 declarator:
20579 attributes [opt] direct-declarator
20580 attributes [opt] ptr-operator declarator
20582 abstract-declarator:
20583 attributes [opt] ptr-operator abstract-declarator [opt]
20584 attributes [opt] direct-abstract-declarator
20586 The parser flags FLAGS is used to control type-specifier parsing.
20588 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
20589 detect constructors, destructors, deduction guides, or conversion operators.
20590 It is set to -1 if the declarator is a name, and +1 if it is a
20591 function. Otherwise it is set to zero. Usually you just want to
20592 test for >0, but internally the negative value is used.
20594 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
20595 a decl-specifier-seq unless it declares a constructor, destructor,
20596 or conversion. It might seem that we could check this condition in
20597 semantic analysis, rather than parsing, but that makes it difficult
20598 to handle something like `f()'. We want to notice that there are
20599 no decl-specifiers, and therefore realize that this is an
20600 expression, not a declaration.)
20602 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
20603 the declarator is a direct-declarator of the form "(...)".
20605 MEMBER_P is true iff this declarator is a member-declarator.
20607 FRIEND_P is true iff this declarator is a friend.
20609 STATIC_P is true iff the keyword static was seen. */
20613 cp_parser_declarator_kind dcl_kind,
20614 cp_parser_flags flags,
20618 {
20621 cp_cv_quals cv_quals;
20622 tree class_type;
20625 /* Assume this is not a constructor, destructor, or type-conversion
20626 operator. */
20633 /* Check for the ptr-operator production. */
20635 /* Parse the ptr-operator. */
20641 /* If that worked, then we have a ptr-operator. */
20643 {
20644 /* If a ptr-operator was found, then this declarator was not
20645 parenthesized. */
20648 /* The dependent declarator is optional if we are parsing an
20649 abstract-declarator. */
20653 /* Parse the dependent declarator. */
20655 CP_PARSER_FLAGS_NONE,
20661 /* If we are parsing an abstract-declarator, we must handle the
20662 case where the dependent declarator is absent. */
20667 declarator = cp_parser_make_indirect_declarator
20669 }
20670 /* Everything else is a direct-declarator. */
20671 else
20672 {
20675 CPP_OPEN_PAREN);
20679 }
20684 }
20686 /* Parse a direct-declarator or direct-abstract-declarator.
20688 direct-declarator:
20689 declarator-id
20690 direct-declarator ( parameter-declaration-clause )
20691 cv-qualifier-seq [opt]
20692 ref-qualifier [opt]
20693 exception-specification [opt]
20694 direct-declarator [ constant-expression [opt] ]
20695 ( declarator )
20697 direct-abstract-declarator:
20698 direct-abstract-declarator [opt]
20699 ( parameter-declaration-clause )
20700 cv-qualifier-seq [opt]
20701 ref-qualifier [opt]
20702 exception-specification [opt]
20703 direct-abstract-declarator [opt] [ constant-expression [opt] ]
20704 ( abstract-declarator )
20706 Returns a representation of the declarator. DCL_KIND is
20707 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
20708 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
20709 we are parsing a direct-declarator. It is
20710 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
20711 of ambiguity we prefer an abstract declarator, as per
20712 [dcl.ambig.res].
20713 The parser flags FLAGS is used to control type-specifier parsing.
20714 CTOR_DTOR_OR_CONV_P, MEMBER_P, FRIEND_P, and STATIC_P are
20715 as for cp_parser_declarator. */
20719 cp_parser_declarator_kind dcl_kind,
20720 cp_parser_flags flags,
20723 {
20734 {
20735 /* Peek at the next token. */
20738 {
20739 /* This is either a parameter-declaration-clause, or a
20740 parenthesized declarator. When we know we are parsing a
20741 named declarator, it must be a parenthesized declarator
20742 if FIRST is true. For instance, `(int)' is a
20743 parameter-declaration-clause, with an omitted
20744 direct-abstract-declarator. But `((*))', is a
20745 parenthesized abstract declarator. Finally, when T is a
20746 template parameter `(T)' is a
20747 parameter-declaration-clause, and not a parenthesized
20748 named declarator.
20750 We first try and parse a parameter-declaration-clause,
20751 and then try a nested declarator (if FIRST is true).
20753 It is not an error for it not to be a
20754 parameter-declaration-clause, even when FIRST is
20755 false. Consider,
20757 int i (int);
20758 int i (3);
20760 The first is the declaration of a function while the
20761 second is the definition of a variable, including its
20762 initializer.
20764 Having seen only the parenthesis, we cannot know which of
20765 these two alternatives should be selected. Even more
20766 complex are examples like:
20768 int i (int (a));
20769 int i (int (3));
20771 The former is a function-declaration; the latter is a
20772 variable initialization.
20774 Thus again, we try a parameter-declaration-clause, and if
20775 that fails, we back out and return. */
20778 {
20779 tree params;
20784 /* In a member-declarator, the only valid interpretation
20785 of a parenthesis is the start of a
20786 parameter-declaration-clause. (It is invalid to
20787 initialize a static data member with a parenthesized
20788 initializer; only the "=" form of initialization is
20789 permitted.) */
20793 /* Consume the `('. */
20794 matching_parens parens;
20797 {
20798 /* If this is going to be an abstract declarator, we're
20799 in a declarator and we can't have default args. */
20802 }
20806 /* Parse the parameter-declaration-clause. */
20807 params
20810 /* Consume the `)'. */
20813 /* If all went well, parse the cv-qualifier-seq,
20814 ref-qualifier and the exception-specification. */
20816 {
20817 cp_cv_quals cv_quals;
20818 cp_virt_specifiers virt_specifiers;
20819 cp_ref_qualifier ref_qual;
20820 tree exception_specification;
20821 tree late_return;
20822 tree attrs;
20825 unsigned char local_variables_forbidden_p
20827 /* 'this' is not allowed in static member functions. */
20837 /* Parse the cv-qualifier-seq. */
20839 /* Parse the ref-qualifier. */
20841 /* Parse the tx-qualifier. */
20843 /* And the exception-specification. */
20844 exception_specification
20849 /* In here, we handle cases where attribute is used after
20850 the function declaration. For example:
20851 void func (int x) __attribute__((vector(..))); */
20854 late_return = (cp_parser_late_return_type_opt
20858 /* Parse the virt-specifier-seq. */
20861 /* Create the function-declarator. */
20863 params,
20864 cv_quals,
20865 virt_specifiers,
20866 ref_qual,
20867 tx_qual,
20868 exception_specification,
20869 late_return,
20870 requires_clause);
20873 /* Any subsequent parameter lists are to do with
20874 return type, so are not those of the declared
20875 function. */
20878 /* Restore the state of local_variables_forbidden_p. */
20879 parser->local_variables_forbidden_p
20881 }
20883 /* Remove the function parms from scope. */
20887 /* Repeat the main loop. */
20889 }
20891 /* If this is the first, we can try a parenthesized
20892 declarator. */
20894 {
20901 /* Consume the `('. */
20902 matching_parens parens;
20904 /* Parse the nested declarator. */
20907 declarator
20909 ctor_dtor_or_conv_p,
20915 /* Expect a `)'. */
20923 }
20924 /* Otherwise, we must be done. */
20925 else
20927 }
20931 {
20932 /* Parse an array-declarator. */
20942 /* Consume the `['. */
20944 /* Peek at the next token. */
20946 /* If the next token is `]', then there is no
20947 constant-expression. */
20949 {
20951 bounds
20961 {
20962 /* Normally, the array bound must be an integral constant
20963 expression. However, as an extension, we allow VLAs
20964 in function scopes as long as they aren't part of a
20965 parameter declaration. */
20969 }
20972 {
20973 /* Remember this wasn't a constant-expression. */
20976 }
20977 }
20978 else
20980 /* Look for the closing `]'. */
20982 {
20985 }
20990 }
20992 {
20993 {
20994 tree qualifying_scope;
20995 tree unqualified_name;
20996 tree attrs;
20997 special_function_kind sfk;
21002 /* Parse a declarator-id */
21005 {
21008 /* If we see an ellipsis, we should be looking at a
21009 parameter pack. */
21011 {
21012 /* Consume the `...' */
21016 }
21017 }
21020 unqualified_name
21024 {
21028 {
21029 /* Check whether an error occurred. */
21032 /* We already consumed the ellipsis to mark a
21033 parameter pack, but we have no way to report it,
21034 so abort the tentative parse. We will be exiting
21035 immediately anyway. */
21037 }
21038 else
21044 && (qualifying_scope
21046 {
21049 }
21050 }
21055 {
21060 }
21066 {
21067 /* In the declaration of a member of a template class
21068 outside of the class itself, the SCOPE will sometimes
21069 be a TYPENAME_TYPE. For example, given:
21071 template <typename T>
21072 int S<T>::R::i = 3;
21074 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
21075 this context, we must resolve S<T>::R to an ordinary
21076 type, rather than a typename type.
21078 The reason we normally avoid resolving TYPENAME_TYPEs
21079 is that a specialization of `S' might render
21080 `S<T>::R' not a type. However, if `S' is
21081 specialized, then this `i' will not be used, so there
21082 is no harm in resolving the types here. */
21083 tree type;
21085 /* Resolve the TYPENAME_TYPE. */
21088 /* If that failed, the declarator is invalid. */
21090 {
21093 "cannot define member of dependent typedef "
21095 else
21100 }
21102 }
21107 {
21108 tree class_type;
21113 else
21117 {
21121 {
21122 /* We do not attempt to print the declarator
21123 here because we do not have enough
21124 information about its original syntactic
21125 form. */
21129 }
21132 {
21136 "use %<%T::%D%> instead of %<%T::%D%> to "
21138 class_type,
21143 }
21145 }
21148 {
21155 for an unnamed type, even if the type
21156 got a name for linkage purposes. */
21158 /* Handle correctly (c++/19200):
21160 struct S {
21161 struct T{};
21162 friend void S(T);
21163 };
21165 and also:
21167 namespace N {
21168 void S();
21169 }
21171 struct S {
21172 friend void N::S();
21173 }; */
21176 class_type))
21185 }
21186 }
21188 unqualified_name,
21196 /* We're looking for this case in [temp.res]:
21197 A qualified-id is assumed to name a type if [...]
21198 - it is a decl-specifier of the decl-specifier-seq of a
21199 parameter-declaration in a declarator of a function or
21200 function template declaration, ... */
21206 {
21207 /* ...whose declarator-id is qualified. If it isn't, never
21208 assume the parameters to refer to types. */
21211 else
21212 {
21213 /* Now we have something like
21214 template <typename T> int C::x(S::p);
21215 which can be a function template declaration or a
21216 variable template definition. If name lookup for
21217 the declarator-id C::x finds one or more function
21218 templates, assume S::p to name a type. Otherwise,
21219 don't. */
21220 tree decl
21224 /* Allow
21225 template<typename T>
21226 A<T>::A(T::type) { } */
21229 qualifying_scope)))
21231 }
21232 }
21233 }
21235 handle_declarator:;
21238 {
21239 /* Any names that appear after the declarator-id for a
21240 member are looked up in the containing scope. */
21242 {
21243 /* But declarations with qualified-ids can't appear in a
21244 function. */
21248 }
21250 }
21254 /* Default args are only allowed on function
21255 declarations. */
21257 else
21261 }
21262 /* We're done. */
21263 else
21265 }
21267 /* For an abstract declarator, we might wind up with nothing at this
21268 point. That's an error; the declarator is not optional. */
21272 {
21273 /* Record overly parenthesized declarator so we can give a
21274 diagnostic about confusing decl/expr disambiguation. */
21276 {
21277 /* If the open and close parens are on different lines, this
21278 is probably a formatting thing, so ignore. */
21283 }
21286 }
21288 /* If we entered a scope, we must exit it now. */
21296 }
21298 /* Parse a ptr-operator.
21300 ptr-operator:
21301 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
21302 * cv-qualifier-seq [opt]
21303 &
21304 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
21305 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
21307 GNU Extension:
21309 ptr-operator:
21310 & cv-qualifier-seq [opt]
21312 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
21313 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
21314 an rvalue reference. In the case of a pointer-to-member, *TYPE is
21315 filled in with the TYPE containing the member. *CV_QUALS is
21316 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
21317 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
21318 Note that the tree codes returned by this function have nothing
21319 to do with the types of trees that will be eventually be created
21320 to represent the pointer or reference type being parsed. They are
21321 just constants with suggestive names. */
21322 static enum tree_code
21327 {
21332 /* Assume that it's not a pointer-to-member. */
21334 /* And that there are no cv-qualifiers. */
21337 /* Peek at the next token. */
21340 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
21350 {
21351 /* Consume the `*', `&' or `&&'. */
21354 /* A `*' can be followed by a cv-qualifier-seq, and so can a
21355 `&', if we are allowing GNU extensions. (The only qualifier
21356 that can legally appear after `&' is `restrict', but that is
21357 enforced during semantic analysis. */
21365 }
21366 else
21367 {
21368 /* Try the pointer-to-member case. */
21370 /* Look for the optional `::' operator. */
21373 /* Look for the nested-name specifier. */
21380 /* If we found it, and the next token is a `*', then we are
21381 indeed looking at a pointer-to-member operator. */
21384 {
21385 /* Indicate that the `*' operator was used. */
21393 else
21394 {
21395 /* The type of which the member is a member is given by the
21396 current SCOPE. */
21398 /* The next name will not be qualified. */
21402 /* Look for optional c++11 attributes. */
21406 /* Look for the optional cv-qualifier-seq. */
21408 }
21409 }
21410 /* If that didn't work we don't have a ptr-operator. */
21413 }
21416 }
21418 /* Parse an (optional) cv-qualifier-seq.
21420 cv-qualifier-seq:
21421 cv-qualifier cv-qualifier-seq [opt]
21423 cv-qualifier:
21424 const
21425 volatile
21427 GNU Extension:
21429 cv-qualifier:
21430 __restrict__
21432 Returns a bitmask representing the cv-qualifiers. */
21434 static cp_cv_quals
21436 {
21440 {
21442 cp_cv_quals cv_qualifier;
21444 /* Peek at the next token. */
21446 /* See if it's a cv-qualifier. */
21448 {
21464 }
21470 {
21475 }
21476 else
21477 {
21480 }
21481 }
21484 }
21486 /* Parse an (optional) ref-qualifier
21488 ref-qualifier:
21489 &
21490 &&
21492 Returns cp_ref_qualifier representing ref-qualifier. */
21494 static cp_ref_qualifier
21496 {
21499 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
21504 {
21509 {
21521 }
21526 {
21529 }
21530 else
21531 {
21534 }
21535 }
21538 }
21540 /* Parse an optional tx-qualifier.
21542 tx-qualifier:
21543 transaction_safe
21544 transaction_safe_dynamic */
21546 static tree
21548 {
21551 {
21556 {
21560 {
21563 {
21566 }
21567 else
21569 }
21570 }
21571 }
21573 }
21575 /* Parse an (optional) virt-specifier-seq.
21577 virt-specifier-seq:
21578 virt-specifier virt-specifier-seq [opt]
21580 virt-specifier:
21581 override
21582 final
21584 Returns a bitmask representing the virt-specifiers. */
21586 static cp_virt_specifiers
21588 {
21592 {
21594 cp_virt_specifiers virt_specifier;
21596 /* Peek at the next token. */
21598 /* See if it's a virt-specifier-qualifier. */
21602 {
21605 }
21607 {
21610 }
21612 {
21614 }
21615 else
21619 {
21624 }
21625 else
21626 {
21629 }
21630 }
21632 }
21634 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
21635 is in scope even though it isn't real. */
21637 void
21639 {
21640 tree this_parm;
21643 {
21644 /* We don't clear this between NSDMIs. Is it already what we want? */
21651 }
21654 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
21656 current_class_ref
21659 }
21661 /* Return true iff our current scope is a non-static data member
21662 initializer. */
21664 bool
21666 {
21667 /* We recognize NSDMI context by the context-less 'this' pointer set up
21668 by the function above. */
21674 }
21676 /* Parse a late-specified return type, if any. This is not a separate
21677 non-terminal, but part of a function declarator, which looks like
21679 -> trailing-type-specifier-seq abstract-declarator(opt)
21681 Returns the type indicated by the type-id.
21683 In addition to this, parse any queued up #pragma omp declare simd
21684 clauses, and #pragma acc routine clauses.
21686 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
21687 function. */
21689 static tree
21692 {
21696 && declarator
21700 && declarator
21703 /* Peek at the next token. */
21705 /* A late-specified return type is indicated by an initial '->'. */
21716 {
21717 /* DR 1207: 'this' is in scope in the trailing return type. */
21719 }
21722 {
21723 /* Consume the ->. */
21727 }
21729 /* Function declarations may be followed by a trailing
21730 requires-clause. */
21734 declarator->attributes
21738 declarator->attributes
21743 {
21746 }
21749 }
21751 /* Parse a declarator-id.
21753 declarator-id:
21754 id-expression
21755 :: [opt] nested-name-specifier [opt] type-name
21757 In the `id-expression' case, the value returned is as for
21758 cp_parser_id_expression if the id-expression was an unqualified-id.
21759 If the id-expression was a qualified-id, then a SCOPE_REF is
21760 returned. The first operand is the scope (either a NAMESPACE_DECL
21761 or TREE_TYPE), but the second is still just a representation of an
21762 unqualified-id. */
21764 static tree
21766 {
21767 tree id;
21768 /* The expression must be an id-expression. Assume that qualified
21769 names are the names of types so that:
21771 template <class T>
21772 int S<T>::R::i = 3;
21774 will work; we must treat `S<T>::R' as the name of a type.
21775 Similarly, assume that qualified names are templates, where
21776 required, so that:
21778 template <class T>
21779 int S<T>::R<T>::i = 3;
21781 will work, too. */
21787 optional_p);
21791 }
21793 /* Parse a type-id.
21795 type-id:
21796 type-specifier-seq abstract-declarator [opt]
21798 The parser flags FLAGS is used to control type-specifier parsing.
21800 If IS_TEMPLATE_ARG is true, we are parsing a template argument.
21802 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21803 i.e. we've just seen "->".
21805 Returns the TYPE specified. */
21807 static tree
21811 {
21812 cp_decl_specifier_seq type_specifier_seq;
21815 /* Parse the type-specifier-seq. */
21818 is_trailing_return,
21826 /* A bare template name as a template argument is a template template
21827 argument, not a placeholder, so fail parsing it as a type argument. */
21828 {
21832 }
21836 /* There might or might not be an abstract declarator. */
21838 /* Look for the declarator. */
21839 abstract_declarator
21846 /* Check to see if there really was a declarator. */
21851 /* The concepts TS allows 'auto' as a type-id. */
21853 /* None of the valid uses of 'auto' in C++14 involve the type-id
21854 nonterminal, but it is valid in a trailing-return-type. */
21857 {
21858 /* A type-id with type 'auto' is only ok if the abstract declarator
21859 is a function declarator with a late-specified return type.
21861 A type-id with 'auto' is also valid in a trailing-return-type
21862 in a compound-requirement. */
21869 else
21870 {
21873 {
21875 auto_node);
21877 tmpl);
21878 }
21879 else
21882 }
21883 }
21886 is_template_arg);
21887 }
21889 /* Wrapper for cp_parser_type_id_1. */
21891 static tree
21894 {
21896 }
21898 /* Wrapper for cp_parser_type_id_1. */
21900 static tree
21902 {
21903 tree r;
21905 parser->type_definition_forbidden_message
21910 {
21913 }
21915 }
21917 /* Wrapper for cp_parser_type_id_1. */
21919 static tree
21921 {
21924 }
21926 /* Parse a type-specifier-seq.
21928 type-specifier-seq:
21929 type-specifier type-specifier-seq [opt]
21931 GNU extension:
21933 type-specifier-seq:
21934 attributes type-specifier-seq [opt]
21936 The parser flags FLAGS is used to control type-specifier parsing.
21938 If IS_DECLARATION is true, we are at the start of a "condition" or
21939 exception-declaration, so we might be followed by a declarator-id.
21941 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21942 i.e. we've just seen "->".
21944 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21946 static void
21948 cp_parser_flags flags,
21952 {
21956 /* Clear the TYPE_SPECIFIER_SEQ. */
21960 /* In the context of a trailing return type, enum E { } is an
21961 elaborated-type-specifier followed by a function-body, not an
21962 enum-specifier. */
21966 /* Parse the type-specifiers and attributes. */
21968 {
21969 tree type_specifier;
21972 /* Check for attributes first. */
21974 {
21975 type_specifier_seq->attributes
21979 }
21981 /* record the token of the beginning of the type specifier seq,
21982 for error reporting purposes*/
21986 /* Look for the type-specifier. */
21988 flags,
21989 type_specifier_seq,
21991 NULL,
21994 {
21995 /* If the first type-specifier could not be found, this is not a
21996 type-specifier-seq at all. */
21998 {
21999 /* Set in_declarator_p to avoid skipping to the semicolon. */
22011 }
22012 /* If subsequent type-specifiers could not be found, the
22013 type-specifier-seq is complete. */
22015 }
22018 /* The standard says that a condition can be:
22020 type-specifier-seq declarator = assignment-expression
22022 However, given:
22024 struct S {};
22025 if (int S = ...)
22027 we should treat the "S" as a declarator, not as a
22028 type-specifier. The standard doesn't say that explicitly for
22029 type-specifier-seq, but it does say that for
22030 decl-specifier-seq in an ordinary declaration. Perhaps it
22031 would be clearer just to allow a decl-specifier-seq here, and
22032 then add a semantic restriction that if any decl-specifiers
22033 that are not type-specifiers appear, the program is invalid. */
22036 }
22037 }
22039 /* Return whether the function currently being declared has an associated
22040 template parameter list. */
22042 static bool
22044 {
22057 }
22059 /* Parse a parameter-declaration-clause.
22061 parameter-declaration-clause:
22062 parameter-declaration-list [opt] ... [opt]
22063 parameter-declaration-list , ...
22065 The parser flags FLAGS is used to control type-specifier parsing.
22067 Returns a representation for the parameter declarations. A return
22068 value of NULL indicates a parameter-declaration-clause consisting
22069 only of an ellipsis. */
22071 static tree
22073 cp_parser_flags flags)
22074 {
22075 tree parameters;
22083 && !processing_template_parmlist
22084 && !processing_explicit_instantiation
22085 /* default_arg_ok_p tracks whether this is a parameter-clause for an
22086 actual function or a random abstract declarator. */
22092 /* Peek at the next token. */
22094 /* Check for trivial parameter-declaration-clauses. */
22096 {
22097 /* Consume the `...' token. */
22100 }
22102 /* There are no parameters. */
22104 /* Check for `(void)', too, which is a special case. */
22108 {
22109 /* Consume the `void' token. */
22111 /* There are no parameters. */
22113 }
22115 /* Parse the parameter-declaration-list. */
22117 /* If a parse error occurred while parsing the
22118 parameter-declaration-list, then the entire
22119 parameter-declaration-clause is erroneous. */
22123 /* Peek at the next token. */
22125 /* If it's a `,', the clause should terminate with an ellipsis. */
22127 {
22128 /* Consume the `,'. */
22130 /* Expect an ellipsis. */
22131 ellipsis_p
22133 }
22134 /* It might also be `...' if the optional trailing `,' was
22135 omitted. */
22137 {
22138 /* Consume the `...' token. */
22140 /* And remember that we saw it. */
22142 }
22143 else
22146 /* Finish the parameter list. */
22151 }
22153 /* Parse a parameter-declaration-list.
22155 parameter-declaration-list:
22156 parameter-declaration
22157 parameter-declaration-list , parameter-declaration
22159 The parser flags FLAGS is used to control type-specifier parsing.
22161 Returns a representation of the parameter-declaration-list, as for
22162 cp_parser_parameter_declaration_clause. However, the
22163 `void_list_node' is never appended to the list. */
22165 static tree
22167 {
22173 /* The special considerations that apply to a function within an
22174 unbraced linkage specifications do not apply to the parameters
22175 to the function. */
22176 saved_in_unbraced_linkage_specification_p
22180 /* Look for more parameters. */
22182 {
22187 /* Parse the parameter. */
22188 parameter
22193 /* We don't know yet if the enclosing context is deprecated, so wait
22194 and warn in grokparms if appropriate. */
22198 {
22201 PARM,
22206 }
22210 /* If a parse error occurred parsing the parameter declaration,
22211 then the entire parameter-declaration-list is erroneous. */
22213 {
22216 }
22226 {
22230 }
22232 /* Add the new parameter to the list. */
22236 /* Peek at the next token. */
22239 /* These are for Objective-C++ */
22242 /* The parameter-declaration-list is complete. */
22245 {
22248 /* Peek at the next token. */
22250 /* If it's an ellipsis, then the list is complete. */
22253 /* Otherwise, there must be more parameters. Consume the
22254 `,'. */
22256 /* When parsing something like:
22258 int i(float f, double d)
22260 we can tell after seeing the declaration for "f" that we
22261 are not looking at an initialization of a variable "i",
22262 but rather at the declaration of a function "i".
22264 Due to the fact that the parsing of template arguments
22265 (as specified to a template-id) requires backtracking we
22266 cannot use this technique when inside a template argument
22267 list. */
22271 /* However, a parameter-declaration of the form
22272 "float(f)" (which is a valid declaration of a
22273 parameter "f") can also be interpreted as an
22274 expression (the conversion of "f" to "float"). */
22277 }
22278 else
22279 {
22287 }
22288 }
22290 parser->in_unbraced_linkage_specification_p
22293 /* Reset implicit_template_scope if we are about to leave the function
22294 parameter list that introduced it. Note that for out-of-line member
22295 definitions, there will be one or more class scopes before we get to
22296 the template parameter scope. */
22300 {
22304 {
22307 }
22308 }
22311 }
22313 /* Parse a parameter declaration.
22315 parameter-declaration:
22316 decl-specifier-seq ... [opt] declarator
22317 decl-specifier-seq declarator = assignment-expression
22318 decl-specifier-seq ... [opt] abstract-declarator [opt]
22319 decl-specifier-seq abstract-declarator [opt] = assignment-expression
22321 The parser flags FLAGS is used to control type-specifier parsing.
22323 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
22324 declares a template parameter. (In that case, a non-nested `>'
22325 token encountered during the parsing of the assignment-expression
22326 is not interpreted as a greater-than operator.)
22328 Returns a representation of the parameter, or NULL if an error
22329 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
22330 true iff the declarator is of the form "(p)". */
22334 cp_parser_flags flags,
22337 {
22339 cp_decl_specifier_seq decl_specifiers;
22341 tree default_argument;
22346 /* In a template parameter, `>' is not an operator.
22348 [temp.param]
22350 When parsing a default template-argument for a non-type
22351 template-parameter, the first non-nested `>' is taken as the end
22352 of the template parameter-list rather than a greater-than
22353 operator. */
22355 /* Type definitions may not appear in parameter types. */
22357 parser->type_definition_forbidden_message
22364 /* Parse the declaration-specifiers. */
22367 flags,
22371 /* Complain about missing 'typename' or other invalid type names. */
22376 /* If an error occurred, there's no reason to attempt to parse the
22377 rest of the declaration. */
22379 {
22382 }
22384 /* Peek at the next token. */
22387 /* If the next token is a `)', `,', `=', `>', or `...', then there
22388 is no declarator. However, when variadic templates are enabled,
22389 there may be a declarator following `...'. */
22394 {
22398 }
22399 /* Otherwise, there should be a declarator. */
22400 else
22401 {
22405 /* After seeing a decl-specifier-seq, if the next token is not a
22406 "(", there is no possibility that the code is a valid
22407 expression. Therefore, if parsing tentatively, we commit at
22408 this point. */
22410 /* In an expression context, having seen:
22412 (int((char ...
22414 we cannot be sure whether we are looking at a
22415 function-type (taking a "char" as a parameter) or a cast
22416 of some object of type "char" to "int". */
22422 /* Parse the declarator. */
22425 CP_PARSER_DECLARATOR_EITHER,
22426 CP_PARSER_FLAGS_NONE,
22428 parenthesized_p,
22433 /* After the declarator, allow more attributes. */
22434 decl_specifiers.attributes
22438 /* If the declarator is a template parameter pack, remember that and
22439 clear the flag in the declarator itself so we don't get errors
22440 from grokdeclarator. */
22442 {
22445 }
22446 }
22448 /* If the next token is an ellipsis, and we have not seen a declarator
22449 name, and if either the type of the declarator contains parameter
22450 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
22451 for, eg, abbreviated integral type names), then we actually have a
22452 parameter pack expansion expression. Otherwise, leave the ellipsis
22453 for a C-style variadic function. */
22456 /* If a function parameter pack was specified and an implicit template
22457 parameter was introduced during cp_parser_parameter_declaration,
22458 change any implicit parameters introduced into packs. */
22463 {
22471 }
22474 {
22485 {
22486 /* Consume the `...'. */
22490 /* Build a pack expansion type */
22495 else
22497 }
22498 }
22500 /* The restriction on defining new types applies only to the type
22501 of the parameter, not to the default argument. */
22504 /* If the next token is `=', then process a default argument. */
22506 {
22509 /* If we are defining a class, then the tokens that make up the
22510 default argument must be saved and processed later. */
22516 // A constrained-type-specifier may declare a type template-parameter.
22518 default_argument
22521 // A constrained-type-specifier may declare a template-template-parameter.
22523 default_argument
22526 /* Outside of a class definition, we can just parse the
22527 assignment-expression. */
22528 else
22529 default_argument
22533 {
22535 "default arguments are only "
22537 }
22539 || template_parameter_pack_p
22542 {
22543 /* Find the name of the parameter pack. */
22550 template_parm_p
22556 else
22558 template_parm_p
22565 }
22566 }
22567 else
22573 /* Generate a location for the parameter, ranging from the start of the
22574 initial token to the end of the final token (using input_location for
22575 the latter, set up by cp_lexer_set_source_position_from_token when
22576 consuming tokens).
22578 If we have a identifier, then use it for the caret location, e.g.
22580 extern int callee (int one, int (*two)(int, int), float three);
22581 ~~~~~~^~~~~~~~~~~~~~
22583 otherwise, reuse the start location for the caret location e.g.:
22585 extern int callee (int one, int (*)(int, int), float three);
22586 ^~~~~~~~~~~~~~~~~
22588 */
22594 input_location);
22597 declarator,
22598 default_argument,
22599 param_loc,
22600 template_parameter_pack_p);
22601 }
22603 /* Parse a default argument and return it.
22605 TEMPLATE_PARM_P is true if this is a default argument for a
22606 non-type template parameter. */
22607 static tree
22609 {
22615 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
22616 set correctly. */
22619 /* Local variable names (and the `this' keyword) may not
22620 appear in a default argument. */
22623 /* Parse the assignment-expression. */
22628 /* The "this" pointer is not valid in a default argument. */
22630 {
22635 }
22636 default_argument
22638 /* Restore the "this" pointer. */
22640 {
22643 }
22652 }
22654 /* Parse a function-body.
22656 function-body:
22657 compound_statement */
22659 static void
22661 {
22665 }
22667 /* Parse a ctor-initializer-opt followed by a function-body. Return
22668 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
22669 is true we are parsing a function-try-block. */
22671 static void
22674 {
22676 const bool check_body_p
22684 {
22687 "function-try-block body of %<constexpr%> constructor only "
22689 else
22691 "function-try-block body of %<constexpr%> function only "
22693 }
22695 /* Begin the function body. */
22697 /* Parse the optional ctor-initializer. */
22700 /* If we're parsing a constexpr constructor definition, we need
22701 to check that the constructor body is indeed empty. However,
22702 before we get to cp_parser_function_body lot of junk has been
22703 generated, so we can't just check that we have an empty block.
22704 Rather we take a snapshot of the outermost block, and check whether
22705 cp_parser_function_body changed its state. */
22707 {
22711 }
22712 /* Parse the function-body. */
22716 /* Finish the function body. */
22718 }
22720 /* Parse an initializer.
22722 initializer:
22723 = initializer-clause
22724 ( expression-list )
22726 Returns an expression representing the initializer. If no
22727 initializer is present, NULL_TREE is returned.
22729 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
22730 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
22731 set to TRUE if there is no initializer present. If there is an
22732 initializer, and it is not a constant-expression, *NON_CONSTANT_P
22733 is set to true; otherwise it is set to false. */
22735 static tree
22738 {
22740 tree init;
22742 /* Peek at the next token. */
22745 /* Let our caller know whether or not this initializer was
22746 parenthesized. */
22748 /* Assume that the initializer is constant. */
22752 {
22753 /* Consume the `='. */
22755 /* Parse the initializer-clause. */
22757 }
22759 {
22764 non_constant_p);
22769 }
22771 {
22776 }
22777 else
22778 {
22779 /* Anything else is an error. */
22782 }
22788 }
22790 /* Parse an initializer-clause.
22792 initializer-clause:
22793 assignment-expression
22794 braced-init-list
22796 Returns an expression representing the initializer.
22798 If the `assignment-expression' production is used the value
22799 returned is simply a representation for the expression.
22801 Otherwise, calls cp_parser_braced_list. */
22803 static cp_expr
22805 {
22806 cp_expr initializer;
22808 /* Assume the expression is constant. */
22811 /* If it is not a `{', then we are looking at an
22812 assignment-expression. */
22814 {
22815 initializer
22818 non_constant_p);
22819 }
22820 else
22824 }
22826 /* Parse a brace-enclosed initializer list.
22828 braced-init-list:
22829 { initializer-list , [opt] }
22830 { designated-initializer-list , [opt] }
22831 { }
22833 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
22834 the elements of the initializer-list (or NULL, if the last
22835 production is used). The TREE_TYPE for the CONSTRUCTOR will be
22836 NULL_TREE. There is no way to detect whether or not the optional
22837 trailing `,' was provided. NON_CONSTANT_P is as for
22838 cp_parser_initializer. */
22840 static cp_expr
22842 {
22843 tree initializer;
22846 /* Consume the `{' token. */
22847 matching_braces braces;
22849 /* Create a CONSTRUCTOR to represent the braced-initializer. */
22851 /* If it's not a `}', then there is a non-trivial initializer. */
22853 {
22855 /* Parse the initializer list. */
22859 /* A trailing `,' token is allowed. */
22862 }
22863 else
22865 /* Now, there should be a trailing `}'. */
22871 /* Build a location of the form:
22872 { ... }
22873 ^~~~~~~
22874 with caret==start at the open brace, finish at the close brace. */
22878 }
22880 /* Consume tokens up to, and including, the next non-nested closing `]'.
22881 Returns true iff we found a closing `]'. */
22883 static bool
22885 {
22889 {
22893 {
22897 /* FALLTHRU */
22899 /* If we've run out of tokens, then there is no closing `]'. */
22908 {
22911 }
22916 }
22918 /* Consume the token. */
22920 }
22921 }
22923 /* Return true if we are looking at an array-designator, false otherwise. */
22925 static bool
22927 {
22928 /* Consume the `['. */
22933 /* Skip tokens until the next token is a closing square bracket.
22934 If we find the closing `]', and the next token is a `=', then
22935 we are looking at an array designator. */
22936 bool array_designator_p
22940 /* Roll back the tokens we skipped. */
22944 }
22946 /* Parse an initializer-list.
22948 initializer-list:
22949 initializer-clause ... [opt]
22950 initializer-list , initializer-clause ... [opt]
22952 C++2A Extension:
22954 designated-initializer-list:
22955 designated-initializer-clause
22956 designated-initializer-list , designated-initializer-clause
22958 designated-initializer-clause:
22959 designator brace-or-equal-initializer
22961 designator:
22962 . identifier
22964 GNU Extension:
22966 initializer-list:
22967 designation initializer-clause ...[opt]
22968 initializer-list , designation initializer-clause ...[opt]
22970 designation:
22971 . identifier =
22972 identifier :
22973 [ constant-expression ] =
22975 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22976 for the initializer. If the INDEX of the elt is non-NULL, it is the
22977 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22978 as for cp_parser_initializer. Set *DESIGNATED to a boolean whether there
22979 are any designators. */
22984 {
22989 /* Assume all of the expressions are constant. */
22992 /* Parse the rest of the list. */
22994 {
22996 tree designator;
22997 tree initializer;
23001 /* Handle the C++2A syntax, '. id ='. */
23009 {
23012 "C++ designated initializers only available with "
23014 /* Consume the `.'. */
23016 /* Consume the identifier. */
23019 /* Consume the `='. */
23021 }
23022 /* Also, if the next token is an identifier and the following one is a
23023 colon, we are looking at the GNU designated-initializer
23024 syntax. */
23029 {
23030 /* Warn the user that they are using an extension. */
23033 /* Consume the identifier. */
23035 /* Consume the `:'. */
23037 }
23038 /* Also handle C99 array designators, '[ const ] ='. */
23042 {
23043 /* In C++11, [ could start a lambda-introducer. */
23049 {
23052 }
23053 else
23054 {
23059 }
23064 && (!require_potential_rvalue_constant_expression
23068 /* Warn the user that they are using an extension. */
23071 }
23072 else
23076 {
23079 }
23083 {
23087 }
23091 /* Parse the initializer. */
23094 /* If any clause is non-constant, so is the entire initializer. */
23098 /* If we have an ellipsis, this is an initializer pack
23099 expansion. */
23101 {
23104 /* Consume the `...'. */
23111 /* Turn the initializer into an initializer expansion. */
23113 }
23115 /* Add it to the vector. */
23118 /* If the next token is not a comma, we have reached the end of
23119 the list. */
23123 /* Peek at the next token. */
23125 /* If the next token is a `}', then we're still done. An
23126 initializer-clause can have a trailing `,' after the
23127 initializer-list and before the closing `}'. */
23131 /* Consume the `,' token. */
23133 }
23135 /* The same identifier shall not appear in multiple designators
23136 of a designated-initializer-list. */
23138 {
23143 {
23145 {
23147 "%<.%s%> designator used multiple times in "
23151 }
23152 else
23154 }
23158 }
23162 }
23164 /* Classes [gram.class] */
23166 /* Parse a class-name.
23168 class-name:
23169 identifier
23170 template-id
23172 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
23173 to indicate that names looked up in dependent types should be
23174 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
23175 keyword has been used to indicate that the name that appears next
23176 is a template. TAG_TYPE indicates the explicit tag given before
23177 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
23178 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
23179 is the class being defined in a class-head. If ENUM_OK is TRUE,
23180 enum-names are also accepted.
23182 Returns the TYPE_DECL representing the class. */
23184 static tree
23193 {
23194 tree decl;
23195 tree scope;
23200 /* All class-names start with an identifier. */
23203 {
23206 }
23208 /* PARSER->SCOPE can be cleared when parsing the template-arguments
23209 to a template-id, so we save it here. */
23214 /* Any name names a type if we're following the `typename' keyword
23215 in a qualified name where the enclosing scope is type-dependent. */
23218 /* Handle the common case (an identifier, but not a template-id)
23219 efficiently. */
23222 {
23226 /* Look for the identifier. */
23230 /* If the next token isn't an identifier, we are certainly not
23231 looking at a class-name. */
23234 /* If we know this is a type-name, there's no need to look it
23235 up. */
23238 else
23239 {
23240 tree ambiguous_decls;
23241 /* If we already know that this lookup is ambiguous, then
23242 we've already issued an error message; there's no reason
23243 to check again. */
23245 {
23248 }
23249 /* If the next token is a `::', then the name must be a type
23250 name.
23252 [basic.lookup.qual]
23254 During the lookup for a name preceding the :: scope
23255 resolution operator, object, function, and enumerator
23256 names are ignored. */
23259 /* Look up the name. */
23261 tag_type,
23264 check_dependency_p,
23268 {
23272 }
23273 }
23274 }
23275 else
23276 {
23277 /* Try a template-id. */
23279 check_dependency_p,
23280 tag_type,
23281 is_declaration);
23284 }
23288 /* If this is a typename, create a TYPENAME_TYPE. */
23292 {
23297 }
23301 /* Check to see that it is really the name of a class. */
23305 /* Situations like this:
23307 template <typename T> struct A {
23308 typename T::template X<int>::I i;
23309 };
23311 are problematic. Is `T::template X<int>' a class-name? The
23312 standard does not seem to be definitive, but there is no other
23313 valid interpretation of the following `::'. Therefore, those
23314 names are considered class-names. */
23315 {
23319 }
23324 /* In Objective-C 2.0, a classname followed by '.' starts a
23325 dot-syntax expression, and it's not a type-name. */
23337 }
23339 /* Make sure that any member-function parameters are in scope.
23340 For instance, a function's noexcept-specifier can use the function's
23341 parameters:
23343 struct S {
23344 void fn (int p) noexcept(noexcept(p));
23345 };
23347 so we need to make sure name lookup can find them. This is used
23348 when we delay parsing of the noexcept-specifier. */
23350 static void
23352 {
23357 }
23359 /* Undo the effects of inject_parm_decls. */
23361 static void
23363 {
23365 }
23367 /* Parse a class-specifier.
23369 class-specifier:
23370 class-head { member-specification [opt] }
23372 Returns the TREE_TYPE representing the class. */
23374 static tree
23376 {
23377 tree type;
23391 /* Parse the class-head. */
23394 /* If the class-head was a semantic disaster, skip the entire body
23395 of the class. */
23397 {
23401 }
23403 /* Look for the `{'. */
23404 matching_braces braces;
23406 {
23409 }
23414 /* Issue an error message if type-definitions are forbidden here. */
23416 /* Remember that we are defining one more class. */
23418 /* Inside the class, surrounding template-parameter-lists do not
23419 apply. */
23420 saved_num_template_parameter_lists
23423 /* We are not in a function body. */
23426 /* Or in a loop. */
23429 /* Or in a switch. */
23432 /* We are not immediately inside an extern "lang" block. */
23433 saved_in_unbraced_linkage_specification_p
23437 // Associate constraints with the type.
23441 /* Start the class. */
23443 {
23446 }
23450 /* If the type is erroneous, skip the entire body of the class. */
23452 else
23453 /* Parse the member-specification. */
23456 /* Look for the trailing `}'. */
23458 /* Look for trailing attributes to apply to this class. */
23466 /* We've finished a type definition. Check for the common syntax
23467 error of forgetting a semicolon after the definition. We need to
23468 be careful, as we can't just check for not-a-semicolon and be done
23469 with it; the user might have typed:
23471 class X { } c = ...;
23472 class X { } *p = ...;
23474 and so forth. Instead, enumerate all the possible tokens that
23475 might follow this production; if we don't see one of them, then
23476 complain and silently insert the semicolon. */
23477 {
23482 /* Don't try to parse c++11 attributes here. As per the
23483 grammar, that should be a task for
23484 cp_parser_decl_specifier_seq. */
23488 {
23499 /* While it's legal for type qualifiers and storage class
23500 specifiers to follow type definitions in the grammar, only
23501 compiler testsuites contain code like that. Assume that if
23502 we see such code, then what we're really seeing is a case
23503 like:
23505 class X { }
23506 const <type> var = ...;
23508 or
23510 class Y { }
23511 static <type> func (...) ...
23513 i.e. the qualifier or specifier applies to the next
23514 declaration. To do so, however, we need to look ahead one
23515 more token to see if *that* token is a type specifier.
23517 This code could be improved to handle:
23519 class Z { }
23520 static const <type> var = ...; */
23523 {
23526 /* Handling user-defined types here would be nice, but very
23527 tricky. */
23528 want_semicolon
23531 }
23535 }
23537 /* If we don't have a type, then something is very wrong and we
23538 shouldn't try to do anything clever. Likewise for not seeing the
23539 closing brace. */
23541 {
23542 /* Locate the closing brace. */
23543 cp_token_position prev
23548 /* We want to suggest insertion of a ';' immediately *after* the
23549 closing brace, so, if we can, offset the location by 1 column. */
23556 /* If we successfully offset the location, suggest the fix-it. */
23569 else
23572 /* Unget one token and smash it to look as though we encountered
23573 a semicolon in the input stream. */
23578 }
23579 }
23581 /* If this class is not itself within the scope of another class,
23582 then we need to parse the bodies of all of the queued function
23583 definitions. Note that the queued functions defined in a class
23584 are not always processed immediately following the
23585 class-specifier for that class. Consider:
23587 struct A {
23588 struct B { void f() { sizeof (A); } };
23589 };
23591 If `f' were processed before the processing of `A' were
23592 completed, there would be no way to compute the size of `A'.
23593 Note that the nesting we are interested in here is lexical --
23594 not the semantic nesting given by TYPE_CONTEXT. In particular,
23595 for:
23597 struct A { struct B; };
23598 struct A::B { void f() { } };
23600 there is no need to delay the parsing of `A::B::f'. */
23602 {
23603 tree decl;
23611 {
23612 /* Skip default arguments, NSDMIs, etc, in order to improve
23613 error recovery (c++/71169, c++/71832). */
23618 }
23620 /* In a first pass, parse default arguments to the functions.
23621 Then, in a second pass, parse the bodies of the functions.
23622 This two-phased approach handles cases like:
23624 struct S {
23625 void f() { g(); }
23626 void g(int i = 3);
23627 };
23629 */
23631 {
23633 /* If there are default arguments that have not yet been processed,
23634 take care of them now. */
23636 {
23641 }
23642 /* Make sure that any template parameters are in scope. */
23644 /* Parse the default argument expressions. */
23646 /* Remove any template parameters from the symbol table. */
23648 }
23650 /* Now parse any NSDMIs. */
23654 {
23656 {
23661 }
23664 }
23671 /* Now do some post-NSDMI bookkeeping. */
23677 /* If there are noexcept-specifiers that have not yet been processed,
23678 take care of them now. */
23682 {
23685 {
23690 }
23695 /* Make sure that any template parameters are in scope. */
23698 /* Make sure that any member-function parameters are in scope. */
23701 /* 'this' is not allowed in static member functions. */
23702 unsigned char local_variables_forbidden_p
23707 /* Now we can parse the noexcept-specifier. */
23713 /* Restore the state of local_variables_forbidden_p. */
23716 /* The finish_struct call above performed various override checking,
23717 but it skipped unparsed noexcept-specifier operands. Now that we
23718 have resolved them, check again. */
23721 /* Remove any member-function parameters from the symbol table. */
23724 /* Remove any template parameters from the symbol table. */
23726 }
23731 /* Now parse the body of the functions. */
23733 {
23734 /* OpenMP UDRs need to be parsed before all other functions. */
23741 }
23742 else
23746 }
23747 else
23750 /* Put back any saved access checks. */
23753 /* Restore saved state. */
23757 parser->num_template_parameter_lists
23759 parser->in_unbraced_linkage_specification_p
23763 }
23765 static tree
23767 {
23768 tree ret;
23773 }
23775 /* Parse a class-head.
23777 class-head:
23778 class-key identifier [opt] base-clause [opt]
23779 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
23780 class-key nested-name-specifier [opt] template-id
23781 base-clause [opt]
23783 class-virt-specifier:
23784 final
23786 GNU Extensions:
23787 class-key attributes identifier [opt] base-clause [opt]
23788 class-key attributes nested-name-specifier identifier base-clause [opt]
23789 class-key attributes nested-name-specifier [opt] template-id
23790 base-clause [opt]
23792 Upon return BASES is initialized to the list of base classes (or
23793 NULL, if there are none) in the same form returned by
23794 cp_parser_base_clause.
23796 Returns the TYPE of the indicated class. Sets
23797 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
23798 involving a nested-name-specifier was used, and FALSE otherwise.
23800 Returns error_mark_node if this is not a class-head.
23802 Returns NULL_TREE if the class-head is syntactically valid, but
23803 semantically invalid in a way that means we should skip the entire
23804 body of the class. */
23806 static tree
23809 {
23810 tree nested_name_specifier;
23814 tree attributes;
23815 tree bases;
23825 /* Assume no nested-name-specifier will be present. */
23827 /* Assume no template parameter lists will be used in defining the
23828 type. */
23832 /* Look for the class-key. */
23839 /* Parse the attributes. */
23842 /* If the next token is `::', that is invalid -- but sometimes
23843 people do try to write:
23845 struct ::S {};
23847 Handle this gracefully by accepting the extra qualifier, and then
23848 issuing an error about it later if this really is a
23849 class-head. If it turns out just to be an elaborated type
23850 specifier, remain silent. */
23856 /* Determine the name of the class. Begin by looking for an
23857 optional nested-name-specifier. */
23859 nested_name_specifier
23865 /* If there was a nested-name-specifier, then there *must* be an
23866 identifier. */
23871 {
23873 /* Although the grammar says `identifier', it really means
23874 `class-name' or `template-name'. You are only allowed to
23875 define a class that has already been declared with this
23876 syntax.
23878 The proposed resolution for Core Issue 180 says that wherever
23879 you see `class T::X' you should treat `X' as a type-name.
23881 It is OK to define an inaccessible class; for example:
23883 class A { class B; };
23884 class A::B {};
23886 We do not know if we will see a class-name, or a
23887 template-name. We look for a class-name first, in case the
23888 class-name is a template-id; if we looked for the
23889 template-name first we would stop after the template-name. */
23896 class_type,
23900 /* If that didn't work, ignore the nested-name-specifier. */
23902 {
23908 }
23909 /* If we could not find a corresponding TYPE, treat this
23910 declaration like an unqualified declaration. */
23913 /* Otherwise, count the number of templates used in TYPE and its
23914 containing scopes. */
23915 else
23917 }
23918 /* Otherwise, the identifier is optional. */
23919 else
23920 {
23921 /* We don't know whether what comes next is a template-id,
23922 an identifier, or nothing at all. */
23924 /* Check for a template-id. */
23929 class_key,
23931 /* If that didn't work, it could still be an identifier. */
23933 {
23935 {
23938 }
23939 else
23941 }
23942 else
23943 {
23946 }
23947 }
23952 {
23954 class_key,
23956 }
23959 /* If it's not a `:' or a `{' then we can't really be looking at a
23960 class-head, since a class-head only appears as part of a
23961 class-specifier. We have to detect this situation before calling
23962 xref_tag, since that has irreversible side-effects. */
23964 {
23968 }
23970 /* At this point, we're going ahead with the class-specifier, even
23971 if some other problem occurs. */
23974 {
23979 }
23980 /* Issue the error about the overly-qualified name now. */
23982 {
23987 }
23989 {
23994 }
23996 {
23997 tree scope;
24000 /* [temp.names]: in a qualified-id formed by a class-head-name, the
24001 keyword template shall not appear at the top level. */
24005 /* Reject typedef-names in class heads. */
24007 {
24010 type);
24013 }
24015 /* Figure out in what scope the declaration is being placed. */
24017 /* If that scope does not contain the scope in which the
24018 class was originally declared, the program is invalid. */
24020 {
24023 "declaration of %qD in namespace %qD which does not "
24026 else
24032 }
24033 /* [dcl.meaning]
24035 A declarator-id shall not be qualified except for the
24036 definition of a ... nested class outside of its class
24037 ... [or] the definition or explicit instantiation of a
24038 class member of a namespace outside of its namespace. */
24040 {
24045 }
24046 }
24047 /* An explicit-specialization must be preceded by "template <>". If
24048 it is not, try to recover gracefully. */
24051 && !processing_template_parmlist
24053 {
24054 /* Build a location of this form:
24055 struct typename <ARGS>
24056 ^~~~~~~~~~~~~~~~~~~~~~
24057 with caret==start at the start token, and
24058 finishing at the end of the type. */
24059 location_t reported_loc
24061 class_head_start_location,
24067 "an explicit specialization must be preceded by"
24070 /* Take the same action that would have been taken by
24071 cp_parser_explicit_specialization. */
24074 }
24075 /* There must be no "return" statements between this point and the
24076 end of this function; set "type "to the correct return value and
24077 use "goto done;" to return. */
24078 /* Make sure that the right number of template parameters were
24079 present. */
24081 template_id_p,
24084 {
24085 /* If something went wrong, there is no point in even trying to
24086 process the class-definition. */
24089 }
24091 /* Look up the type. */
24093 {
24097 {
24101 }
24102 else
24103 {
24107 /* Check the scope while we still know whether or not we had a
24108 nested-name-specifier. */
24111 }
24114 }
24116 {
24117 tree class_type;
24119 /* Given:
24121 template <typename T> struct S { struct T };
24122 template <typename T> struct S<T>::T { };
24124 we will get a TYPENAME_TYPE when processing the definition of
24125 `S::T'. We need to resolve it to the actual type before we
24126 try to define it. */
24128 {
24133 else
24134 {
24137 }
24138 }
24142 {
24145 }
24148 /* Enter the scope indicated by the nested-name-specifier. */
24150 /* Get the canonical version of this type. */
24152 /* Call push_template_decl if it seems like we should be defining a
24153 template either from the template headers or the type we're
24154 defining, so that we diagnose both extra and missing headers. */
24158 {
24161 {
24164 }
24165 }
24169 }
24171 {
24172 /* If the class was unnamed, create a dummy name. */
24176 ? ts_within_enclosing_non_class
24180 }
24182 /* Indicate whether this class was declared as a `class' or as a
24183 `struct'. */
24188 /* If this type was already complete, and we see another definition,
24189 that's an error. Likewise if the type is already being defined:
24190 this can happen, eg, when it's defined from within an expression
24191 (c++/84605). */
24194 {
24196 type);
24198 type);
24201 }
24206 {
24207 /* Apply attributes now, before any use of the class as a template
24208 argument in its base list. */
24211 }
24213 /* We will have entered the scope containing the class; the names of
24214 base classes should be looked up in that context. For example:
24216 struct A { struct B {}; struct C; };
24217 struct A::C : B {};
24219 is valid. */
24221 /* Get the list of base-classes, if there is one. */
24223 {
24224 /* PR59482: enter the class scope so that base-specifiers are looked
24225 up correctly. */
24229 /* PR59482: get out of the previously pushed class scope so that the
24230 subsequent pops pop the right thing. */
24233 }
24234 else
24237 /* If we're really defining a class, process the base classes.
24238 If they're invalid, fail. */
24242 done:
24243 /* Leave the scope given by the nested-name-specifier. We will
24244 enter the class scope itself while processing the members. */
24249 {
24252 }
24258 out:
24261 }
24263 /* Parse a class-key.
24265 class-key:
24266 class
24267 struct
24268 union
24270 Returns the kind of class-key specified, or none_type to indicate
24271 error. */
24273 static enum tag_types
24275 {
24279 /* Look for the class-key. */
24284 /* Check to see if the TOKEN is a class-key. */
24289 }
24291 /* Parse a type-parameter-key.
24293 type-parameter-key:
24294 class
24295 typename
24296 */
24298 static void
24300 {
24301 /* Look for the type-parameter-key. */
24305 {
24308 /* typename is not allowed in a template template parameter
24309 by the standard until C++17. */
24311 "ISO C++ forbids typename key in template template parameter;"
24313 }
24314 else
24318 }
24320 /* Parse an (optional) member-specification.
24322 member-specification:
24323 member-declaration member-specification [opt]
24324 access-specifier : member-specification [opt] */
24326 static void
24328 {
24330 {
24334 /* Peek at the next token. */
24336 /* If it's a `}', or EOF then we've seen all the members. */
24342 /* See if this token is a keyword. */
24345 {
24349 /* Consume the access-specifier. */
24351 /* Remember which access-specifier is active. */
24353 /* Look for the `:'. */
24358 /* Accept #pragmas at class scope. */
24360 {
24363 }
24365 /* Otherwise, the next construction must be a
24366 member-declaration. */
24368 }
24369 }
24370 }
24372 /* Parse a member-declaration.
24374 member-declaration:
24375 decl-specifier-seq [opt] member-declarator-list [opt] ;
24376 function-definition ; [opt]
24377 :: [opt] nested-name-specifier template [opt] unqualified-id ;
24378 using-declaration
24379 template-declaration
24380 alias-declaration
24382 member-declarator-list:
24383 member-declarator
24384 member-declarator-list , member-declarator
24386 member-declarator:
24387 declarator pure-specifier [opt]
24388 declarator constant-initializer [opt]
24389 identifier [opt] : constant-expression
24391 GNU Extensions:
24393 member-declaration:
24394 __extension__ member-declaration
24396 member-declarator:
24397 declarator attributes [opt] pure-specifier [opt]
24398 declarator attributes [opt] constant-initializer [opt]
24399 identifier [opt] attributes [opt] : constant-expression
24401 C++0x Extensions:
24403 member-declaration:
24404 static_assert-declaration */
24406 static void
24408 {
24409 cp_decl_specifier_seq decl_specifiers;
24410 tree prefix_attributes;
24411 tree decl;
24420 /* Check for the `__extension__' keyword. */
24422 {
24423 /* Recurse. */
24425 /* Restore the old value of the PEDANTIC flag. */
24429 }
24431 /* Check for a template-declaration. */
24433 {
24434 /* An explicit specialization here is an error condition, and we
24435 expect the specialization handler to detect and report this. */
24439 else
24443 }
24444 /* Check for a template introduction. */
24448 /* Check for a using-declaration. */
24450 {
24452 {
24453 /* Parse the using-declaration. */
24457 }
24458 else
24459 {
24460 tree decl;
24464 /* Note that if we actually see the '=' token after the
24465 identifier, cp_parser_alias_declaration commits the
24466 tentative parse. In that case, we really expect an
24467 alias-declaration. Otherwise, we expect a using
24468 declaration. */
24469 alias_decl_expected =
24475 else
24479 }
24480 }
24482 /* Check for @defs. */
24484 {
24489 {
24494 }
24496 }
24498 /* If the next token is `static_assert' we have a static assertion. */
24500 {
24503 }
24510 /* Parse the decl-specifier-seq. */
24513 (CP_PARSER_FLAGS_OPTIONAL
24517 /* Check for an invalid type-name. */
24521 /* If there is no declarator, then the decl-specifier-seq should
24522 specify a type. */
24524 {
24525 /* If there was no decl-specifier-seq, and the next token is a
24526 `;', then we have something like:
24528 struct S { ; };
24530 [class.mem]
24532 Each member-declaration shall declare at least one member
24533 name of the class. */
24535 {
24538 {
24542 }
24543 }
24544 else
24545 {
24546 tree type;
24548 /* See if this declaration is a friend. */
24550 /* If there were decl-specifiers, check to see if there was
24551 a class-declaration. */
24554 /* Nested classes have already been added to the class, but
24555 a `friend' needs to be explicitly registered. */
24557 {
24558 /* If the `friend' keyword was present, the friend must
24559 be introduced with a class-key. */
24562 "in C++03 a class-key must be used "
24564 /* In this case:
24566 template <typename T> struct A {
24567 friend struct A<T>::B;
24568 };
24570 A<T>::B will be represented by a TYPENAME_TYPE, and
24571 therefore not recognized by check_tag_decl. */
24573 {
24577 }
24580 "friend declaration does not name a class or "
24582 else
24585 }
24586 /* If there is no TYPE, an error message will already have
24587 been issued. */
24589 ;
24590 /* An anonymous aggregate has to be handled specially; such
24591 a declaration really declares a data member (with a
24592 particular type), as opposed to a nested class. */
24594 {
24595 /* C++11 9.5/6. */
24598 "a storage class on an anonymous aggregate "
24601 /* Remove constructors and such from TYPE, now that we
24602 know it is an anonymous aggregate. */
24604 /* And make the corresponding data member. */
24607 /* Add it to the class. */
24609 }
24610 else
24611 cp_parser_check_access_in_redeclaration
24614 }
24615 }
24616 else
24617 {
24620 /* Clear attributes from the decl_specifiers but keep them
24621 around as prefix attributes that apply them to the entity
24622 being declared. */
24626 /* See if these declarations will be friends. */
24629 /* Keep going until we hit the `;' at the end of the
24630 declaration. */
24632 {
24634 tree first_attribute;
24635 tree initializer;
24638 /* Peek at the next token. */
24641 /* The following code wants to know early if it is a bit-field
24642 or some other declaration. Attributes can appear before
24643 the `:' token. Skip over them without consuming any tokens
24644 to peek if they are followed by `:'. */
24649 {
24650 size_t n
24653 }
24655 /* Check for a bitfield declaration. */
24661 {
24662 tree identifier;
24663 tree width;
24665 location_t id_location
24670 else
24673 /* Look for attributes that apply to the bitfield. */
24676 /* Consume the `:' token. */
24679 /* Get the width of the bitfield. */
24683 /* In C++2A and as extension for C++11 and above we allow
24684 default member initializers for bit-fields. */
24689 CPP_OPEN_BRACE)))
24690 {
24691 location_t loc
24697 "default member initializers for bit-fields "
24698 "only available with %<-std=c++2a%> or "
24703 {
24707 }
24708 }
24709 else
24710 {
24711 /* Look for attributes that apply to the bitfield after
24712 the `:' token and width. This is where GCC used to
24713 parse attributes in the past, pedwarn if there is
24714 a std attribute. */
24717 "ISO C++ allows bit-field attributes only "
24721 }
24725 /* Remember which attributes are prefix attributes and
24726 which are not. */
24728 /* Combine the attributes. */
24731 /* Create the bitfield declaration. */
24734 identifier,
24735 sfk_none,
24736 id_location)
24740 attributes);
24741 }
24742 else
24743 {
24745 tree asm_specification;
24749 /* Parse the declarator. */
24750 declarator
24752 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
24758 /* If something went wrong parsing the declarator, make sure
24759 that we at least consume some tokens. */
24761 {
24762 /* Skip to the end of the statement. */
24764 /* If the next token is not a semicolon, that is
24765 probably because we just skipped over the body of
24766 a function. So, we consume a semicolon if
24767 present, but do not issue an error message if it
24768 is not present. */
24770 CPP_SEMICOLON))
24773 }
24776 cp_parser_check_for_definition_in_return_type
24780 /* Look for an asm-specification. */
24782 /* Look for attributes that apply to the declaration. */
24784 /* Remember which attributes are prefix attributes and
24785 which are not. */
24787 /* Combine the attributes. */
24790 /* If it's an `=', then we have a constant-initializer or a
24791 pure-specifier. It is not correct to parse the
24792 initializer before registering the member declaration
24793 since the member declaration should be in scope while
24794 its initializer is processed. However, the rest of the
24795 front end does not yet provide an interface that allows
24796 us to handle this correctly. */
24798 {
24799 /* In [class.mem]:
24801 A pure-specifier shall be used only in the declaration of
24802 a virtual function.
24804 A member-declarator can contain a constant-initializer
24805 only if it declares a static member of integral or
24806 enumeration type.
24808 Therefore, if the DECLARATOR is for a function, we look
24809 for a pure-specifier; otherwise, we look for a
24810 constant-initializer. When we call `grokfield', it will
24811 perform more stringent semantics checks. */
24823 {
24825 /* Don't require a constant rvalue in C++11, since we
24826 might want a reference constant. We'll enforce
24827 constancy later. */
24829 /* Parse the initializer. */
24832 }
24833 else
24834 /* Parse the initializer. */
24836 }
24839 {
24843 else
24845 }
24846 /* Otherwise, there is no initializer. */
24847 else
24850 /* See if we are probably looking at a function
24851 definition. We are certainly not looking at a
24852 member-declarator. Calling `grokfield' has
24853 side-effects, so we must not do it unless we are sure
24854 that we are looking at a member-declarator. */
24857 {
24858 /* The grammar does not allow a pure-specifier to be
24859 used when a member function is defined. (It is
24860 possible that this fact is an oversight in the
24861 standard, since a pure function may be defined
24862 outside of the class-specifier. */
24868 declarator,
24869 attributes);
24872 /* If the member was not a friend, declare it here. */
24875 /* Peek at the next token. */
24877 /* If the next token is a semicolon, consume it. */
24879 {
24880 location_t semicolon_loc
24885 "extra %<;%> after in-class "
24887 }
24889 }
24890 else
24893 /* Create the declaration. */
24898 {
24901 else
24903 }
24904 }
24909 /* Reset PREFIX_ATTRIBUTES. */
24911 {
24916 }
24918 /* If there is any qualification still in effect, clear it
24919 now; we will be starting fresh with the next declarator. */
24923 /* If it's a `,', then there are more declarators. */
24925 {
24928 {
24934 }
24935 }
24936 /* If the next token isn't a `;', then we have a parse error. */
24938 CPP_SEMICOLON))
24939 {
24940 /* The next token might be a ways away from where the
24941 actual semicolon is missing. Find the previous token
24942 and use that for our error position. */
24949 /* Assume that the user meant to provide a semicolon. If
24950 we were to cp_parser_skip_to_end_of_statement, we might
24951 skip to a semicolon inside a member function definition
24952 and issue nonsensical error messages. */
24954 }
24957 {
24958 /* Add DECL to the list of members. */
24960 /* Explicitly include, eg, NSDMIs, for better error
24961 recovery (c++/58650). */
24969 /* Add DECL to the queue of NSDMI to be parsed later. */
24971 }
24975 }
24976 }
24979 out:
24981 }
24983 /* Parse a pure-specifier.
24985 pure-specifier:
24986 = 0
24988 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24989 Otherwise, ERROR_MARK_NODE is returned. */
24991 static tree
24993 {
24996 /* Look for the `=' token. */
24999 /* Look for the `0' token. */
25008 /* Accept = default or = delete in c++0x mode. */
25011 {
25014 }
25016 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
25018 {
25023 }
25025 {
25028 }
25031 }
25033 /* Parse a constant-initializer.
25035 constant-initializer:
25036 = constant-expression
25038 Returns a representation of the constant-expression. */
25040 static tree
25042 {
25043 /* Look for the `=' token. */
25047 /* It is invalid to write:
25049 struct S { static const int i = { 7 }; };
25051 */
25053 {
25056 /* Consume the opening brace. */
25057 matching_braces braces;
25059 /* Skip the initializer. */
25061 /* Look for the trailing `}'. */
25065 }
25068 }
25070 /* Derived classes [gram.class.derived] */
25072 /* Parse a base-clause.
25074 base-clause:
25075 : base-specifier-list
25077 base-specifier-list:
25078 base-specifier ... [opt]
25079 base-specifier-list , base-specifier ... [opt]
25081 Returns a TREE_LIST representing the base-classes, in the order in
25082 which they were declared. The representation of each node is as
25083 described by cp_parser_base_specifier.
25085 In the case that no bases are specified, this function will return
25086 NULL_TREE, not ERROR_MARK_NODE. */
25088 static tree
25090 {
25093 /* Look for the `:' that begins the list. */
25096 /* Scan the base-specifier-list. */
25098 {
25100 tree base;
25103 /* Look for the base-specifier. */
25105 /* Look for the (optional) ellipsis. */
25107 {
25108 /* Consume the `...'. */
25112 }
25114 /* Add BASE to the front of the list. */
25116 {
25118 /* Make this a pack expansion type. */
25122 {
25125 }
25126 }
25127 /* Peek at the next token. */
25129 /* If it's not a comma, then the list is complete. */
25132 /* Consume the `,'. */
25134 }
25136 /* PARSER->SCOPE may still be non-NULL at this point, if the last
25137 base class had a qualified name. However, the next name that
25138 appears is certainly not qualified. */
25144 }
25146 /* Parse a base-specifier.
25148 base-specifier:
25149 :: [opt] nested-name-specifier [opt] class-name
25150 virtual access-specifier [opt] :: [opt] nested-name-specifier
25151 [opt] class-name
25152 access-specifier virtual [opt] :: [opt] nested-name-specifier
25153 [opt] class-name
25155 Returns a TREE_LIST. The TREE_PURPOSE will be one of
25156 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
25157 indicate the specifiers provided. The TREE_VALUE will be a TYPE
25158 (or the ERROR_MARK_NODE) indicating the type that was specified. */
25160 static tree
25162 {
25170 tree type;
25172 /* Process the optional `virtual' and `access-specifier'. */
25174 {
25175 /* Peek at the next token. */
25177 /* Process `virtual'. */
25179 {
25181 /* If `virtual' appears more than once, issue an error. */
25183 {
25187 }
25191 /* Consume the `virtual' token. */
25199 /* If more than one access specifier appears, issue an
25200 error. */
25203 {
25207 }
25211 /* Consume the access-specifier. */
25219 }
25220 }
25221 /* It is not uncommon to see programs mechanically, erroneously, use
25222 the 'typename' keyword to denote (dependent) qualified types
25223 as base classes. */
25225 {
25230 else
25232 "keyword %<typename%> not allowed in this context "
25235 }
25237 /* Look for the optional `::' operator. */
25239 /* Look for the nested-name-specifier. The simplest way to
25240 implement:
25242 [temp.res]
25244 The keyword `typename' is not permitted in a base-specifier or
25245 mem-initializer; in these contexts a qualified name that
25246 depends on a template-parameter is implicitly assumed to be a
25247 type name.
25249 is to pretend that we have seen the `typename' keyword at this
25250 point. */
25256 /* If the base class is given by a qualified name, assume that names
25257 we see are type names or templates, as appropriate. */
25263 /* DR 950 allows decltype as a base-specifier. */
25265 else
25266 {
25267 /* Otherwise, look for the class-name. */
25269 class_scope_p,
25270 template_p,
25271 typename_type,
25276 }
25282 }
25284 /* Exception handling [gram.exception] */
25286 /* Save the tokens that make up the noexcept-specifier for a member-function.
25287 Returns a DEFERRED_PARSE. */
25289 static tree
25291 {
25293 /* We want everything up to, including, the final ')'. */
25297 /* As with default arguments and NSDMIs, make use of DEFERRED_PARSE
25298 to carry the information we will need. */
25300 /* Save away the noexcept-specifier; we will process it when the
25301 class is complete. */
25305 }
25307 /* Used for late processing of noexcept-specifiers of member-functions.
25308 DEFAULT_ARG is the unparsed operand of a noexcept-specifier which
25309 we saved for later; parse it now. */
25311 static tree
25313 {
25314 /* Make sure we've gotten something that hasn't been parsed yet. */
25319 /* Push the saved tokens for the noexcept-specifier onto the parser's
25320 lexer stack. */
25324 /* Parse the cached noexcept-specifier. */
25325 tree parsed_arg
25332 /* Revert to the main lexer. */
25335 /* Restore the queue. */
25338 /* And we're done. */
25340 }
25342 /* Perform late checking of overriding function with respect to their
25343 noexcept-specifiers. TYPE is the class and FNDECL is the function
25344 that potentially overrides some virtual function with the same
25345 signature. */
25347 static void
25349 {
25351 tree base_binfo;
25357 {
25366 }
25367 }
25369 /* Parse an (optional) noexcept-specification.
25371 noexcept-specification:
25372 noexcept ( constant-expression ) [opt]
25374 If no noexcept-specification is present, returns NULL_TREE.
25375 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
25376 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
25377 there are no parentheses. CONSUMED_EXPR will be set accordingly.
25378 Otherwise, returns a noexcept specification unless RETURN_COND is true,
25379 in which case a boolean condition is returned instead. If FRIEND_P is true,
25380 the function with this noexcept-specification had the `friend' specifier. */
25382 static tree
25388 {
25392 /* Peek at the next token. */
25395 /* Is it a noexcept-specification? */
25397 {
25398 tree expr;
25400 /* [class.mem]/6 says that a noexcept-specifer (within the
25401 member-specification of the class) is a complete-class context of
25402 a class. So, if the noexcept-specifier has the optional expression,
25403 just save the tokens, and reparse this after we're done with the
25404 class. */
25405 const bool literal_p
25411 /* No need to delay parsing for a number literal or true/false. */
25412 && !literal_p
25414 /* Don't delay parsing for friend member functions. */
25415 && !friend_p
25423 {
25424 matching_parens parens;
25434 {
25435 /* Types may not be defined in an exception-specification. */
25437 parser->type_definition_forbidden_message
25441 expr
25447 {
25450 }
25452 /* Restore the saved message. */
25454 }
25455 else
25456 {
25459 }
25465 }
25466 else
25467 {
25471 }
25473 /* We cannot build a noexcept-spec right away because this will check
25474 that expr is a constexpr. */
25477 else
25479 }
25480 else
25482 }
25484 /* Parse an (optional) exception-specification.
25486 exception-specification:
25487 throw ( type-id-list [opt] )
25489 Returns a TREE_LIST representing the exception-specification. The
25490 TREE_VALUE of each node is a type. If FRIEND_P is true, the function
25491 with this noexcept-specification had the `friend' specifier. */
25493 static tree
25495 {
25497 tree type_id_list;
25500 /* Peek at the next token. */
25503 /* Is it a noexcept-specification? */
25504 type_id_list
25509 friend_p);
25513 /* If it's not `throw', then there's no exception-specification. */
25519 /* Consume the `throw'. */
25522 /* Look for the `('. */
25523 matching_parens parens;
25526 /* Peek at the next token. */
25528 /* If it's not a `)', then there is a type-id-list. */
25530 {
25531 /* Types may not be defined in an exception-specification. */
25533 parser->type_definition_forbidden_message
25535 /* Parse the type-id-list. */
25537 /* Restore the saved message. */
25541 {
25545 }
25548 "dynamic exception specifications are deprecated in "
25550 }
25551 /* In C++17, throw() is equivalent to noexcept (true). throw()
25552 is deprecated in C++11 and above as well, but is still widely used,
25553 so don't warn about it yet. */
25556 else
25559 /* Look for the `)'. */
25563 }
25565 /* Parse an (optional) type-id-list.
25567 type-id-list:
25568 type-id ... [opt]
25569 type-id-list , type-id ... [opt]
25571 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
25572 in the order that the types were presented. */
25574 static tree
25576 {
25580 {
25582 tree type;
25586 /* Get the next type-id. */
25588 /* Check for invalid 'auto'. */
25590 {
25594 }
25595 /* Parse the optional ellipsis. */
25597 {
25598 /* Consume the `...'. */
25601 /* Turn the type into a pack expansion expression. */
25603 }
25604 /* Add it to the list. */
25606 /* Peek at the next token. */
25608 /* If it is not a `,', we are done. */
25611 /* Consume the `,'. */
25613 }
25616 }
25618 /* Parse a try-block.
25620 try-block:
25621 try compound-statement handler-seq */
25623 static tree
25625 {
25626 tree try_block;
25633 "%<try%> in %<constexpr%> function only "
25643 }
25645 /* Parse a function-try-block.
25647 function-try-block:
25648 try ctor-initializer [opt] function-body handler-seq */
25650 static void
25652 {
25653 tree compound_stmt;
25654 tree try_block;
25656 /* Look for the `try' keyword. */
25659 /* Let the rest of the front end know where we are. */
25661 /* Parse the function-body. */
25662 cp_parser_ctor_initializer_opt_and_function_body
25664 /* We're done with the `try' part. */
25666 /* Parse the handlers. */
25668 /* We're done with the handlers. */
25670 }
25672 /* Parse a handler-seq.
25674 handler-seq:
25675 handler handler-seq [opt] */
25677 static void
25679 {
25681 {
25684 /* Parse the handler. */
25686 /* Peek at the next token. */
25688 /* If it's not `catch' then there are no more handlers. */
25691 }
25692 }
25694 /* Parse a handler.
25696 handler:
25697 catch ( exception-declaration ) compound-statement */
25699 static void
25701 {
25702 tree handler;
25703 tree declaration;
25707 matching_parens parens;
25714 }
25716 /* Parse an exception-declaration.
25718 exception-declaration:
25719 type-specifier-seq declarator
25720 type-specifier-seq abstract-declarator
25721 type-specifier-seq
25722 ...
25724 Returns a VAR_DECL for the declaration, or NULL_TREE if the
25725 ellipsis variant is used. */
25727 static tree
25729 {
25730 cp_decl_specifier_seq type_specifiers;
25734 /* If it's an ellipsis, it's easy to handle. */
25736 {
25737 /* Consume the `...' token. */
25740 }
25742 /* Types may not be defined in exception-declarations. */
25744 parser->type_definition_forbidden_message
25747 /* Parse the type-specifier-seq. */
25752 /* If it's a `)', then there is no declarator. */
25755 else
25757 CP_PARSER_FLAGS_NONE,
25764 /* Restore the saved message. */
25771 }
25773 /* Parse a throw-expression.
25775 throw-expression:
25776 throw assignment-expression [opt]
25778 Returns a THROW_EXPR representing the throw-expression. */
25780 static tree
25782 {
25783 tree expression;
25788 /* Figure out whether or not there is an assignment-expression
25789 following the "throw" keyword. */
25797 else
25801 }
25803 /* GNU Extensions */
25805 /* Parse an (optional) asm-specification.
25807 asm-specification:
25808 asm ( string-literal )
25810 If the asm-specification is present, returns a STRING_CST
25811 corresponding to the string-literal. Otherwise, returns
25812 NULL_TREE. */
25814 static tree
25816 {
25818 tree asm_specification;
25820 /* Peek at the next token. */
25822 /* If the next token isn't the `asm' keyword, then there's no
25823 asm-specification. */
25827 /* Consume the `asm' token. */
25829 /* Look for the `('. */
25830 matching_parens parens;
25833 /* Look for the string-literal. */
25836 /* Look for the `)'. */
25840 }
25842 /* Parse an asm-operand-list.
25844 asm-operand-list:
25845 asm-operand
25846 asm-operand-list , asm-operand
25848 asm-operand:
25849 string-literal ( expression )
25850 [ string-literal ] string-literal ( expression )
25852 Returns a TREE_LIST representing the operands. The TREE_VALUE of
25853 each node is the expression. The TREE_PURPOSE is itself a
25854 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
25855 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
25856 is a STRING_CST for the string literal before the parenthesis. Returns
25857 ERROR_MARK_NODE if any of the operands are invalid. */
25859 static tree
25861 {
25866 {
25867 tree string_literal;
25868 tree expression;
25869 tree name;
25872 {
25873 /* Consume the `[' token. */
25875 /* Read the operand name. */
25880 /* Look for the closing `]'. */
25882 }
25883 else
25885 /* Look for the string-literal. */
25888 /* Look for the `('. */
25889 matching_parens parens;
25891 /* Parse the expression. */
25893 /* Look for the `)'. */
25901 /* Add this operand to the list. */
25903 expression,
25904 asm_operands);
25905 /* If the next token is not a `,', there are no more
25906 operands. */
25909 /* Consume the `,'. */
25911 }
25914 }
25916 /* Parse an asm-clobber-list.
25918 asm-clobber-list:
25919 string-literal
25920 asm-clobber-list , string-literal
25922 Returns a TREE_LIST, indicating the clobbers in the order that they
25923 appeared. The TREE_VALUE of each node is a STRING_CST. */
25925 static tree
25927 {
25931 {
25932 tree string_literal;
25934 /* Look for the string literal. */
25936 /* Add it to the list. */
25938 /* If the next token is not a `,', then the list is
25939 complete. */
25942 /* Consume the `,' token. */
25944 }
25947 }
25949 /* Parse an asm-label-list.
25951 asm-label-list:
25952 identifier
25953 asm-label-list , identifier
25955 Returns a TREE_LIST, indicating the labels in the order that they
25956 appeared. The TREE_VALUE of each node is a label. */
25958 static tree
25960 {
25964 {
25967 /* Look for the identifier. */
25970 {
25973 {
25979 }
25980 }
25981 /* If the next token is not a `,', then the list is
25982 complete. */
25985 /* Consume the `,' token. */
25987 }
25990 }
25992 /* Return TRUE iff the next tokens in the stream are possibly the
25993 beginning of a GNU extension attribute. */
25995 static bool
25997 {
25999 }
26001 /* Return TRUE iff the next tokens in the stream are possibly the
26002 beginning of a standard C++-11 attribute specifier. */
26004 static bool
26006 {
26008 }
26010 /* Return TRUE iff the next Nth tokens in the stream are possibly the
26011 beginning of a standard C++-11 attribute specifier. */
26013 static bool
26015 {
26023 }
26025 /* Return TRUE iff the next Nth tokens in the stream are possibly the
26026 beginning of a GNU extension attribute. */
26028 static bool
26030 {
26034 }
26036 /* Return true iff the next tokens can be the beginning of either a
26037 GNU attribute list, or a standard C++11 attribute sequence. */
26039 static bool
26041 {
26044 }
26046 /* Return true iff the next Nth tokens can be the beginning of either
26047 a GNU attribute list, or a standard C++11 attribute sequence. */
26049 static bool
26051 {
26054 }
26056 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
26057 of GNU attributes, or return NULL. */
26059 static tree
26061 {
26065 }
26067 /* Parse an (optional) series of attributes.
26069 attributes:
26070 attributes attribute
26072 attribute:
26073 __attribute__ (( attribute-list [opt] ))
26075 The return value is as for cp_parser_gnu_attribute_list. */
26077 static tree
26079 {
26086 {
26088 tree attribute_list;
26091 /* Peek at the next token. */
26093 /* If it's not `__attribute__', then we're done. */
26097 /* Consume the `__attribute__' keyword. */
26099 /* Look for the two `(' tokens. */
26100 matching_parens outer_parens;
26103 matching_parens inner_parens;
26107 /* Peek at the next token. */
26110 /* Parse the attribute-list. */
26112 else
26113 /* If the next token is a `)', then there is no attribute
26114 list. */
26117 /* Look for the two `)' tokens. */
26125 /* Add these new attributes to the list. */
26127 }
26130 }
26132 /* Parse a GNU attribute-list.
26134 attribute-list:
26135 attribute
26136 attribute-list , attribute
26138 attribute:
26139 identifier
26140 identifier ( identifier )
26141 identifier ( identifier , expression-list )
26142 identifier ( expression-list )
26144 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
26145 to an attribute. The TREE_PURPOSE of each node is the identifier
26146 indicating which attribute is in use. The TREE_VALUE represents
26147 the arguments, if any. */
26149 static tree
26151 {
26155 /* Don't create wrapper nodes within attributes: the
26156 handlers don't know how to handle them. */
26157 auto_suppress_location_wrappers sentinel;
26161 {
26163 tree identifier;
26164 tree attribute;
26166 /* Look for the identifier. We also allow keywords here; for
26167 example `__attribute__ ((const))' is legal. */
26171 {
26174 /* Consume the token, but save it since we need it for the
26175 SIMD enabled function parsing. */
26178 /* Save away the identifier that indicates which attribute
26179 this is. */
26181 /* For keywords, use the canonical spelling, not the
26182 parsed identifier. */
26189 /* Peek at the next token. */
26191 /* If it's an `(', then parse the attribute arguments. */
26193 {
26197 vec = cp_parser_parenthesized_expression_list
26203 else
26204 {
26207 }
26208 /* Save the arguments away. */
26210 }
26213 {
26214 /* Add this attribute to the list. */
26217 }
26220 }
26221 /* Unless EXACTLY_ONE is set look for more attributes.
26222 If the next token isn't a `,', we're done. */
26226 /* Consume the comma and keep going. */
26228 }
26231 /* We built up the list in reverse order. */
26233 }
26235 /* Parse a standard C++11 attribute.
26237 The returned representation is a TREE_LIST which TREE_PURPOSE is
26238 the scoped name of the attribute, and the TREE_VALUE is its
26239 arguments list.
26241 Note that the scoped name of the attribute is itself a TREE_LIST
26242 which TREE_PURPOSE is the namespace of the attribute, and
26243 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
26244 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
26245 and which TREE_PURPOSE is directly the attribute name.
26247 Clients of the attribute code should use get_attribute_namespace
26248 and get_attribute_name to get the actual namespace and name of
26249 attributes, regardless of their being GNU or C++11 attributes.
26251 attribute:
26252 attribute-token attribute-argument-clause [opt]
26254 attribute-token:
26255 identifier
26256 attribute-scoped-token
26258 attribute-scoped-token:
26259 attribute-namespace :: identifier
26261 attribute-namespace:
26262 identifier
26264 attribute-argument-clause:
26265 ( balanced-token-seq )
26267 balanced-token-seq:
26268 balanced-token [opt]
26269 balanced-token-seq balanced-token
26271 balanced-token:
26272 ( balanced-token-seq )
26273 [ balanced-token-seq ]
26274 { balanced-token-seq }. */
26276 static tree
26278 {
26285 /* First, parse name of the attribute, a.k.a attribute-token. */
26302 {
26303 /* We are seeing a scoped attribute token. */
26318 else
26319 {
26323 }
26328 NULL_TREE);
26330 }
26332 {
26336 NULL_TREE);
26337 }
26338 else
26339 {
26342 NULL_TREE);
26343 /* We used to treat C++11 noreturn attribute as equivalent to GNU's,
26344 but no longer: we have to be able to tell [[noreturn]] and
26345 __attribute__((noreturn)) apart. */
26346 /* C++14 deprecated attribute is equivalent to GNU's. */
26349 /* C++17 fallthrough attribute is equivalent to GNU's. */
26352 /* Transactional Memory TS optimize_for_synchronized attribute is
26353 equivalent to GNU transaction_callable. */
26357 /* Transactional Memory attributes are GNU attributes. */
26360 }
26362 /* Now parse the optional argument clause of the attribute. */
26367 {
26371 /* Maybe we don't expect to see any arguments for this attribute. */
26375 {
26377 attr_id);
26383 }
26387 /* A GNU attribute that takes an identifier in parameter. */
26390 vec = cp_parser_parenthesized_expression_list
26396 else
26397 {
26400 }
26404 else
26406 }
26409 }
26411 /* Check that the attribute ATTRIBUTE appears at most once in the
26412 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
26413 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
26414 isn't implemented yet in GCC. */
26416 static void
26418 {
26420 {
26430 }
26431 }
26433 /* Parse a list of standard C++-11 attributes.
26435 attribute-list:
26436 attribute [opt]
26437 attribute-list , attribute[opt]
26438 attribute ...
26439 attribute-list , attribute ...
26440 */
26442 static tree
26444 {
26449 {
26454 {
26458 }
26461 {
26466 else
26467 {
26472 }
26474 }
26478 }
26481 }
26483 /* Parse a standard C++-11 attribute specifier.
26485 attribute-specifier:
26486 [ [ attribute-using-prefix [opt] attribute-list ] ]
26487 alignment-specifier
26489 attribute-using-prefix:
26490 using attribute-namespace :
26492 alignment-specifier:
26493 alignas ( type-id ... [opt] )
26494 alignas ( alignment-expression ... [opt] ). */
26496 static tree
26498 {
26504 {
26511 {
26522 {
26526 "attribute using prefix only available "
26532 }
26533 else
26535 }
26542 else
26543 /* Warn about parsing c++11 attribute in non-c++11 mode, only
26544 when we are sure that we have actually parsed them. */
26546 }
26547 else
26548 {
26549 tree alignas_expr;
26551 /* Look for an alignment-specifier. */
26562 matching_parens parens;
26570 {
26577 }
26582 /* Handle alignas (pack...). */
26584 {
26587 }
26589 /* Something went wrong, so don't build the attribute. */
26593 /* Missing ')' means the code cannot possibly be valid; go ahead
26594 and commit to make sure we issue a hard error. */
26602 /* Build the C++-11 representation of an 'aligned'
26603 attribute. */
26604 attributes
26607 }
26610 }
26612 /* Parse a standard C++-11 attribute-specifier-seq.
26614 attribute-specifier-seq:
26615 attribute-specifier-seq [opt] attribute-specifier
26616 */
26618 static tree
26620 {
26624 /* Don't create wrapper nodes within attributes: the
26625 handlers don't know how to handle them. */
26626 auto_suppress_location_wrappers sentinel;
26629 {
26638 else
26641 }
26644 }
26646 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
26647 return index of the first token after balanced-token, or N on failure. */
26649 static size_t
26651 {
26654 do
26656 {
26660 /* FALLTHRU */
26662 /* Ran out of tokens. */
26684 }
26687 }
26689 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
26690 return index of the first token after the GNU attribute tokens, or N on
26691 failure. */
26693 static size_t
26695 {
26697 {
26709 }
26711 }
26713 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
26714 next token), return index of the first token after the standard C++11
26715 attribute tokens, or N on failure. */
26717 static size_t
26719 {
26721 {
26724 {
26731 }
26734 {
26739 }
26740 else
26742 }
26744 }
26746 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
26747 as the next token), return index of the first token after the attribute
26748 tokens, or N on failure. */
26750 static size_t
26752 {
26756 }
26758 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
26759 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
26760 current value of the PEDANTIC flag, regardless of whether or not
26761 the `__extension__' keyword is present. The caller is responsible
26762 for restoring the value of the PEDANTIC flag. */
26764 static bool
26766 {
26767 /* Save the old value of the PEDANTIC flag. */
26771 {
26772 /* Consume the `__extension__' token. */
26774 /* We're not being pedantic while the `__extension__' keyword is
26775 in effect. */
26779 }
26782 }
26784 /* Parse a label declaration.
26786 label-declaration:
26787 __label__ label-declarator-seq ;
26789 label-declarator-seq:
26790 identifier , label-declarator-seq
26791 identifier */
26793 static void
26795 {
26796 /* Look for the `__label__' keyword. */
26800 {
26801 tree identifier;
26803 /* Look for an identifier. */
26805 /* If we failed, stop. */
26808 /* Declare it as a label. */
26810 /* If the next token is a `;', stop. */
26813 /* Look for the `,' separating the label declarations. */
26815 }
26817 /* Look for the final `;'. */
26819 }
26821 // -------------------------------------------------------------------------- //
26822 // Requires Clause
26824 // Parse a requires clause.
26825 //
26826 // requires-clause:
26827 // 'requires' logical-or-expression
26828 //
26829 // The required logical-or-expression must be a constant expression. Note
26830 // that we don't check that the expression is constepxr here. We defer until
26831 // we analyze constraints and then, we only check atomic constraints.
26832 static tree
26834 {
26835 // Parse the requires clause so that it is not automatically folded.
26843 }
26845 // Optionally parse a requires clause:
26846 static tree
26848 {
26851 {
26854 {
26857 /* Parse and discard the requires-clause. */
26860 }
26862 }
26865 }
26868 /*---------------------------------------------------------------------------
26869 Requires expressions
26870 ---------------------------------------------------------------------------*/
26872 /* Parse a requires expression
26874 requirement-expression:
26875 'requires' requirement-parameter-list [opt] requirement-body */
26876 static tree
26878 {
26882 /* A requires-expression shall appear only within a concept
26883 definition or a requires-clause.
26885 TODO: Implement this diagnostic correctly. */
26887 {
26891 }
26894 {
26895 /* Local parameters are delared as variables within the scope
26896 of the expression. They are not visible past the end of
26897 the expression. Expressions within the requires-expression
26898 are unevaluated. */
26899 struct scope_sentinel
26900 {
26902 {
26905 }
26908 {
26911 }
26914 /* Parse the optional parameter list. */
26916 {
26920 }
26921 else
26924 /* Parse the requirement body. */
26928 }
26930 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
26931 the parm chain. */
26934 }
26936 /* Parse a parameterized requirement.
26938 requirement-parameter-list:
26939 '(' parameter-declaration-clause ')' */
26940 static tree
26942 {
26943 matching_parens parens;
26947 tree parms
26954 }
26956 /* Parse the body of a requirement.
26958 requirement-body:
26959 '{' requirement-list '}' */
26960 static tree
26962 {
26963 matching_braces braces;
26973 }
26975 /* Parse a list of requirements.
26977 requirement-list:
26978 requirement
26979 requirement-list ';' requirement[opt] */
26980 static tree
26982 {
26985 {
26992 /* If we see a semi-colon, consume it. */
26996 /* Stop processing at the end of the list. */
26999 }
27001 /* Reverse the order of requirements so they are analyzed in
27002 declaration order. */
27004 }
27006 /* Parse a syntactic requirement or type requirement.
27008 requirement:
27009 simple-requirement
27010 compound-requirement
27011 type-requirement
27012 nested-requirement */
27013 static tree
27015 {
27022 else
27024 }
27026 /* Parse a simple requirement.
27028 simple-requirement:
27029 expression ';' */
27030 static tree
27032 {
27041 }
27043 /* Parse a type requirement
27045 type-requirement
27046 nested-name-specifier [opt] required-type-name ';'
27048 required-type-name:
27049 type-name
27050 'template' [opt] simple-template-id */
27051 static tree
27053 {
27056 // Save the scope before parsing name specifiers.
27067 tree type;
27069 {
27078 }
27079 else
27098 }
27100 /* Parse a compound requirement
27102 compound-requirement:
27103 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
27104 static tree
27106 {
27107 /* Parse an expression enclosed in '{ }'s. */
27108 matching_braces braces;
27119 /* Parse the optional noexcept. */
27122 {
27125 }
27127 /* Parse the optional trailing return type. */
27130 {
27138 }
27141 }
27143 /* Parse a nested requirement. This is the same as a requires clause.
27145 nested-requirement:
27146 requires-clause */
27147 static tree
27149 {
27155 }
27157 /* Support Functions */
27159 /* Return the appropriate prefer_type argument for lookup_name_real based on
27160 tag_type and template_mem_access. */
27164 {
27165 /* DR 141: When looking in the current enclosing context for a template-name
27166 after -> or ., only consider class templates. */
27170 {
27174 }
27175 }
27177 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
27178 NAME should have one of the representations used for an
27179 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
27180 is returned. If PARSER->SCOPE is a dependent type, then a
27181 SCOPE_REF is returned.
27183 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
27184 returned; the name was already resolved when the TEMPLATE_ID_EXPR
27185 was formed. Abstractly, such entities should not be passed to this
27186 function, because they do not need to be looked up, but it is
27187 simpler to check for this special case here, rather than at the
27188 call-sites.
27190 In cases not explicitly covered above, this function returns a
27191 DECL, OVERLOAD, or baselink representing the result of the lookup.
27192 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
27193 is returned.
27195 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
27196 (e.g., "struct") that was used. In that case bindings that do not
27197 refer to types are ignored.
27199 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
27200 ignored.
27202 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
27203 are ignored.
27205 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
27206 types.
27208 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
27209 TREE_LIST of candidates if name-lookup results in an ambiguity, and
27210 NULL_TREE otherwise. */
27212 static cp_expr
27219 location_t name_location)
27220 {
27221 tree decl;
27224 /* Assume that the lookup will be unambiguous. */
27228 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
27229 no longer valid. Note that if we are parsing tentatively, and
27230 the parse fails, OBJECT_TYPE will be automatically restored. */
27236 /* A template-id has already been resolved; there is no lookup to
27237 do. */
27241 {
27245 }
27247 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
27248 it should already have been checked to make sure that the name
27249 used matches the type being destroyed. */
27251 {
27252 tree type;
27254 /* Figure out to which type this destructor applies. */
27259 else
27261 /* If that's not a class type, there is no destructor. */
27272 }
27274 /* By this point, the NAME should be an ordinary identifier. If
27275 the id-expression was a qualified name, the qualifying scope is
27276 stored in PARSER->SCOPE at this point. */
27279 /* Perform the lookup. */
27281 {
27287 /* If the SCOPE is dependent, the lookup must be deferred until
27288 the template is instantiated -- unless we are explicitly
27289 looking up names in uninstantiated templates. Even then, we
27290 cannot look up the name if the scope is not a class type; it
27291 might, for example, be a template type parameter. */
27296 /* Defer lookup. */
27298 else
27299 {
27302 /* If PARSER->SCOPE is a dependent type, then it must be a
27303 class type, and we must not be checking dependencies;
27304 otherwise, we would have processed this lookup above. So
27305 that PARSER->SCOPE is not considered a dependent base by
27306 lookup_member, we must enter the scope here. */
27310 /* If the PARSER->SCOPE is a template specialization, it
27311 may be instantiated during name lookup. In that case,
27312 errors may be issued. Even if we rollback the current
27313 tentative parse, those errors are valid. */
27318 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
27319 lookup result and the nested-name-specifier nominates a class C:
27320 * if the name specified after the nested-name-specifier, when
27321 looked up in C, is the injected-class-name of C (Clause 9), or
27322 * if the name specified after the nested-name-specifier is the
27323 same as the identifier or the simple-template-id's template-
27324 name in the last component of the nested-name-specifier,
27325 the name is instead considered to name the constructor of
27326 class C. [ Note: for example, the constructor is not an
27327 acceptable lookup result in an elaborated-type-specifier so
27328 the constructor would not be used in place of the
27329 injected-class-name. --end note ] Such a constructor name
27330 shall be used only in the declarator-id of a declaration that
27331 names a constructor or in a using-declaration. */
27339 /* If we have a single function from a using decl, pull it out. */
27346 }
27348 /* If the scope is a dependent type and either we deferred lookup or
27349 we did lookup but didn't find the name, rememeber the name. */
27352 {
27354 {
27355 tree type;
27357 /* The resolution to Core Issue 180 says that `struct
27358 A::B' should be considered a type-name, even if `A'
27359 is dependent. */
27364 }
27368 CPP_CLOSE_PAREN)))
27372 else
27375 is_template);
27376 }
27379 }
27381 {
27382 /* Look up the name in the scope of the OBJECT_TYPE, unless the
27383 OBJECT_TYPE is not a class. */
27385 /* If the OBJECT_TYPE is a template specialization, it may
27386 be instantiated during name lookup. In that case, errors
27387 may be issued. Even if we rollback the current tentative
27388 parse, those errors are valid. */
27390 name,
27393 tf_warning_or_error);
27394 else
27398 /* Look it up in the enclosing context. DR 141: When looking for a
27399 template-name after -> or ., only consider class templates. */
27404 /* The object is type-dependent, so we can't look anything up; we used
27405 this to get the DR 141 behavior. */
27409 }
27410 else
27411 {
27417 }
27419 /* If the lookup failed, let our caller know. */
27423 /* Pull out the template from an injected-class-name (or multiple). */
27427 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
27429 {
27432 /* The error message we have to print is too complicated for
27433 cp_parser_error, so we incorporate its actions directly. */
27435 {
27437 name);
27439 }
27441 }
27449 /* If we have resolved the name of a member declaration, check to
27450 see if the declaration is accessible. When the name resolves to
27451 set of overloaded functions, accessibility is checked when
27452 overload resolution is done.
27454 During an explicit instantiation, access is not checked at all,
27455 as per [temp.explicit]. */
27462 }
27464 /* Like cp_parser_lookup_name, but for use in the typical case where
27465 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
27466 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
27468 static tree
27470 {
27472 none_type,
27477 location);
27478 }
27480 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
27481 the current context, return the TYPE_DECL. If TAG_NAME_P is
27482 true, the DECL indicates the class being defined in a class-head,
27483 or declared in an elaborated-type-specifier.
27485 Otherwise, return DECL. */
27487 static tree
27489 {
27490 /* If the TEMPLATE_DECL is being declared as part of a class-head,
27491 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
27493 struct A {
27494 template <typename T> struct B;
27495 };
27497 template <typename T> struct A::B {};
27499 Similarly, in an elaborated-type-specifier:
27501 namespace N { struct X{}; }
27503 struct A {
27504 template <typename T> friend struct N::X;
27505 };
27507 However, if the DECL refers to a class type, and we are in
27508 the scope of the class, then the name lookup automatically
27509 finds the TYPE_DECL created by build_self_reference rather
27510 than a TEMPLATE_DECL. For example, in:
27512 template <class T> struct S {
27513 S s;
27514 };
27516 there is no need to handle such case. */
27522 }
27524 /* If too many, or too few, template-parameter lists apply to the
27525 declarator, issue an error message. Returns TRUE if all went well,
27526 and FALSE otherwise. */
27528 static bool
27531 location_t declarator_location)
27532 {
27534 {
27536 {
27545 {
27546 /* If the DECLARATOR has the form `X<y>' then it uses one
27547 additional level of template parameters. */
27550 }
27552 return cp_parser_check_template_parameters
27554 declarator);
27555 }
27571 }
27573 }
27575 /* NUM_TEMPLATES were used in the current declaration. If that is
27576 invalid, return FALSE and issue an error messages. Otherwise,
27577 return TRUE. If DECLARATOR is non-NULL, then we are checking a
27578 declarator and we can print more accurate diagnostics. */
27580 static bool
27584 location_t location,
27586 {
27587 /* If there are the same number of template classes and parameter
27588 lists, that's OK. */
27591 /* If there are more, but only one more, and the name ends in an identifier,
27592 then we are declaring a primary template. That's OK too. */
27596 /* If there are more template classes than parameter lists, we have
27597 something like:
27599 template <class T> void S<T>::R<T>::f (); */
27601 {
27611 else
27614 }
27615 /* Otherwise, there are too many template parameter lists. We have
27616 something like:
27618 template <class T> template <class U> void S::f(); */
27621 }
27623 /* Parse an optional `::' token indicating that the following name is
27624 from the global namespace. If so, PARSER->SCOPE is set to the
27625 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
27626 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
27627 Returns the new value of PARSER->SCOPE, if the `::' token is
27628 present, and NULL_TREE otherwise. */
27630 static tree
27632 {
27635 /* Peek at the next token. */
27637 /* If we're looking at a `::' token then we're starting from the
27638 global namespace, not our current location. */
27640 {
27641 /* Consume the `::' token. */
27643 /* Set the SCOPE so that we know where to start the lookup. */
27649 }
27651 {
27655 }
27658 }
27660 /* Returns TRUE if the upcoming token sequence is the start of a
27661 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
27662 declarator is preceded by the `friend' specifier. The parser flags FLAGS
27663 is used to control type-specifier parsing. */
27665 static bool
27668 {
27671 tree nested_name_specifier;
27674 /* The common case is that this is not a constructor declarator, so
27675 try to avoid doing lots of work if at all possible. It's not
27676 valid declare a constructor at function scope. */
27679 /* And only certain tokens can begin a constructor declarator. */
27687 /* Parse tentatively; we are going to roll back all of the tokens
27688 consumed here. */
27690 /* Assume that we are looking at a constructor declarator. */
27693 /* Look for the optional `::' operator. */
27696 /* Look for the nested-name-specifier. */
27697 nested_name_specifier
27704 /* Resolve the TYPENAME_TYPE, because the call above didn't do it. */
27707 {
27712 }
27718 /* Outside of a class-specifier, there must be a
27719 nested-name-specifier. Except in C++17 mode, where we
27720 might be declaring a guiding declaration. */
27727 /* If we have a class scope, this is easy; DR 147 says that S::S always
27728 names the constructor, and no other qualified name could. */
27731 {
27741 }
27742 /* If we still think that this might be a constructor-declarator,
27743 look for a class-name. */
27745 {
27746 /* If we have:
27748 template <typename T> struct S {
27749 S();
27750 };
27752 we must recognize that the nested `S' names a class. */
27756 tree type_decl;
27760 none_type,
27767 {
27773 none_type,
27778 else
27780 }
27782 /* If there was no class-name, then this is not a constructor.
27783 Otherwise, if we are in a class-specifier and we aren't
27784 handling a friend declaration, check that its type matches
27785 current_class_type (c++/38313). Note: error_mark_node
27786 is left alone for error recovery purposes. */
27788 && (outside_class_specifier_p
27794 /* If we're still considering a constructor, we have to see a `(',
27795 to begin the parameter-declaration-clause, followed by either a
27796 `)', an `...', or a decl-specifier. We need to check for a
27797 type-specifier to avoid being fooled into thinking that:
27799 S (f) (int);
27801 is a constructor. (It is actually a function named `f' that
27802 takes one parameter (of type `int') and returns a value of type
27803 `S'. */
27811 /* A parameter declaration begins with a decl-specifier,
27812 which is either the "attribute" keyword, a storage class
27813 specifier, or (usually) a type-specifier. */
27815 /* A parameter declaration can also begin with [[attribute]]. */
27817 {
27818 tree type;
27822 /* Names appearing in the type-specifier should be looked up
27823 in the scope of the class. */
27827 {
27830 {
27834 {
27837 }
27838 }
27840 }
27842 /* Inside the constructor parameter list, surrounding
27843 template-parameter-lists do not apply. */
27844 saved_num_template_parameter_lists
27848 /* Look for the type-specifier. It's not optional, but its typename
27849 might be. Unless this is a friend declaration; we don't want to
27850 treat
27852 friend S (T::fn)(int);
27854 as a constructor, but with P0634, we might assume a type when
27855 looking for the type-specifier. It is actually a function named
27856 `T::fn' that takes one parameter (of type `int') and returns a
27857 value of type `S'. Constructors can be friends, but they must
27858 use a qualified name. */
27867 parser->num_template_parameter_lists
27870 /* Leave the scope of the class. */
27875 }
27876 }
27878 /* We did not really want to consume any tokens. */
27882 }
27884 /* Parse the definition of the function given by the DECL_SPECIFIERS,
27885 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
27886 they must be performed once we are in the scope of the function.
27888 Returns the function defined. */
27890 static tree
27891 cp_parser_function_definition_from_specifiers_and_declarator
27894 tree attributes,
27896 {
27897 tree fn;
27900 /* Begin the function-definition. */
27903 /* The things we're about to see are not directly qualified by any
27904 template headers we've seen thus far. */
27907 /* If there were names looked up in the decl-specifier-seq that we
27908 did not check, check them now. We must wait until we are in the
27909 scope of the function to perform the checks, since the function
27910 might be a friend. */
27914 {
27919 }
27922 {
27923 /* Skip the entire function. */
27926 }
27928 {
27929 /* Seen already, skip it. An error message has already been output. */
27933 /* If this is a function from a class, pop the nested class. */
27936 }
27937 else
27938 {
27939 timevar_id_t tv;
27942 else
27948 }
27951 }
27953 /* Parse the part of a function-definition that follows the
27954 declarator. INLINE_P is TRUE iff this function is an inline
27955 function defined within a class-specifier.
27957 Returns the function defined. */
27959 static tree
27962 {
27963 tree fn;
27968 bool fully_implicit_function_template_p
27971 tree implicit_template_parms
27974 cp_binding_level* implicit_template_scope
27980 /* If the next token is `return', then the code may be trying to
27981 make use of the "named return value" extension that G++ used to
27982 support. */
27985 {
27986 /* Consume the `return' keyword. */
27988 /* Look for the identifier that indicates what value is to be
27989 returned. */
27991 /* Issue an error message. */
27994 /* Skip tokens until we reach the start of the function body. */
27996 {
28003 }
28004 }
28005 /* The `extern' in `extern "C" void f () { ... }' does not apply to
28006 anything declared inside `f'. */
28007 saved_in_unbraced_linkage_specification_p
28010 /* Inside the function, surrounding template-parameter-lists do not
28011 apply. */
28012 saved_num_template_parameter_lists
28016 /* If the next token is `try', `__transaction_atomic', or
28017 `__transaction_relaxed`, then we are looking at either function-try-block
28018 or function-transaction-block. Note that all of these include the
28019 function-body. */
28023 RID_TRANSACTION_RELAXED))
28027 else
28028 cp_parser_ctor_initializer_opt_and_function_body
28031 /* Finish the function. */
28033 /* Generate code for it, if necessary. */
28035 /* Restore the saved values. */
28036 parser->in_unbraced_linkage_specification_p
28038 parser->num_template_parameter_lists
28042 parser->fully_implicit_function_template_p
28044 parser->implicit_template_parms
28046 parser->implicit_template_scope
28053 }
28055 /* Parse a template-declaration body (following argument list). */
28057 static void
28059 tree parameter_list,
28061 {
28065 /* We just processed one more parameter list. */
28068 /* Get the deferred access checks from the parameter list. These
28069 will be checked once we know what is being declared, as for a
28070 member template the checks must be performed in the scope of the
28071 class containing the member. */
28074 /* Tentatively parse for a new template parameter list, which can either be
28075 the template keyword or a template introduction. */
28081 else
28082 {
28083 /* There are no access checks when parsing a template, as we do not
28084 know if a specialization will be a friend. */
28088 checks,
28089 member_p,
28094 /* If this is a member template declaration, let the front
28095 end know. */
28097 {
28102 }
28107 }
28108 /* We are done with the current parameter list. */
28113 /* Finish up. */
28116 /* Check the template arguments for a literal operator template. */
28120 {
28124 else
28125 {
28128 {
28135 /* OK, C++20 string literal operator template. We don't need
28136 to warn in lower dialects here because we will have already
28141 }
28143 {
28152 else
28153 /* http://cplusplus.github.io/EWG/ewg-active.html#66 */
28155 "ISO C++ did not adopt string literal operator templa"
28157 }
28158 else
28160 }
28162 {
28165 "template %qD has invalid parameter list; expected "
28166 "non-type template parameter pack %<<char...>%> or "
28168 decl);
28169 else
28171 "template %qD has invalid parameter list; expected "
28173 decl);
28174 }
28175 }
28177 /* Register member declarations. */
28180 /* If DECL is a function template, we must return to parse it later.
28181 (Even though there is no definition, there might be default
28182 arguments that need handling.) */
28186 }
28188 /* Parse a template introduction header for a template-declaration. Returns
28189 false if tentative parse fails. */
28191 static bool
28193 {
28200 /* Look for the optional `::' operator. */
28203 /* Look for the nested-name-specifier. */
28213 /* Look up the concept for which we will be matching
28214 template parameters. */
28224 /* Look for opening brace for introduction. */
28225 matching_braces braces;
28233 /* Build vector of placeholder parameters and grab
28234 matching identifiers. */
28237 /* Look for closing brace for introduction. */
28241 /* The introduction-list shall not be empty. */
28244 {
28245 /* In cp_parser_introduction_list we have already issued an error. */
28247 }
28250 {
28254 }
28256 /* Build and associate the constraint. */
28259 {
28261 member_p);
28263 }
28267 }
28269 /* Parse a normal template-declaration following the template keyword. */
28271 static void
28273 {
28274 tree parameter_list;
28278 /* Look for the `<' token. */
28282 {
28283 /* 14.5.2.2 [temp.mem]
28285 A local class shall not have member templates. */
28290 }
28291 /* [temp]
28293 A template ... shall not have C linkage. */
28295 {
28298 /* Give it C++ linkage to avoid confusing other parts of the
28299 front end. */
28302 }
28303 else
28306 /* We cannot perform access checks on the template parameter
28307 declarations until we know what is being declared, just as we
28308 cannot check the decl-specifier list. */
28311 /* If the next token is `>', then we have an invalid
28312 specialization. Rather than complain about an invalid template
28313 parameter, issue an error message here. */
28315 {
28319 }
28320 else
28321 {
28322 /* Parse the template parameters. */
28324 }
28326 /* Look for the `>'. */
28329 /* Manage template requirements */
28331 {
28336 }
28339 member_p);
28341 /* For the erroneous case of a template with C linkage, we pushed an
28342 implicit C++ linkage scope; exit that scope now. */
28345 }
28347 /* Parse a template-declaration, assuming that the `export' (and
28348 `extern') keywords, if present, has already been scanned. MEMBER_P
28349 is as for cp_parser_template_declaration. */
28351 static bool
28353 {
28355 {
28359 }
28364 }
28366 /* Perform the deferred access checks from a template-parameter-list.
28367 CHECKS is a TREE_LIST of access checks, as returned by
28368 get_deferred_access_checks. */
28370 static void
28371 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
28372 {
28376 }
28378 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
28379 `function-definition' sequence that follows a template header.
28380 If MEMBER_P is true, this declaration appears in a class scope.
28382 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
28383 *FRIEND_P is set to TRUE iff the declaration is a friend. */
28385 static tree
28391 {
28394 cp_decl_specifier_seq decl_specifiers;
28398 /* This function is only used when processing a template
28399 declaration. */
28403 /* Defer access checks until we know what is being declared. */
28406 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
28407 alternative. */
28410 (CP_PARSER_FLAGS_OPTIONAL
28417 /* There are no template typedefs. */
28419 {
28423 }
28425 /* Gather up the access checks that occurred the
28426 decl-specifier-seq. */
28429 /* Check for the declaration of a template class. */
28431 {
28434 {
28435 // If this is a declaration, but not a definition, associate
28436 // any constraints with the type declaration. Constraints
28437 // are associated with definitions in cp_parser_class_specifier.
28443 /* In this case:
28445 struct C {
28446 friend template <typename T> struct A<T>::B;
28447 };
28449 A<T>::B will be represented by a TYPENAME_TYPE, and
28450 therefore not recognized by shadow_tag. */
28452 && !decl
28459 else
28462 /* Perform access checks for template parameters. */
28465 /* Give a helpful diagnostic for
28466 template <class T> struct A { } a;
28467 if we aren't already recovering from an error. */
28470 {
28472 "a class template declaration must not declare "
28476 }
28477 }
28478 }
28480 /* Complain about missing 'typename' or other invalid type names. */
28483 {
28484 /* cp_parser_parse_and_diagnose_invalid_type_name calls
28485 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
28486 the rest of this declaration. */
28489 }
28491 /* If it's not a template class, try for a template function. If
28492 the next token is a `;', then this declaration does not declare
28493 anything. But, if there were errors in the decl-specifiers, then
28494 the error might well have come from an attempted class-specifier.
28495 In that case, there's no need to warn about a missing declarator. */
28499 {
28501 CP_PARSER_FLAGS_TYPENAME_OPTIONAL,
28503 checks,
28505 member_p,
28506 declares_class_or_enum,
28510 /* 7.1.1-1 [dcl.stc]
28512 A storage-class-specifier shall not be specified in an explicit
28513 specialization... */
28515 && explicit_specialization_p
28517 {
28521 }
28525 }
28527 /* Look for a trailing `;' after the declaration. */
28533 out:
28536 /* Clear any current qualification; whatever comes next is the start
28537 of something new. */
28543 }
28545 /* Parse a cast-expression that is not the operand of a unary "&". */
28547 static cp_expr
28549 {
28552 }
28554 /* Parse a functional cast to TYPE. Returns an expression
28555 representing the cast. */
28557 static cp_expr
28559 {
28561 tree expression_list;
28562 cp_expr cast;
28571 {
28581 /* Create a location of the form:
28582 type_name{i, f}
28583 ^~~~~~~~~~~~~~~
28584 with caret == start at the start of the type name,
28585 finishing at the closing brace. */
28590 }
28599 else
28600 {
28603 }
28606 tf_warning_or_error);
28607 /* [expr.const]/1: In an integral constant expression "only type
28608 conversions to integral or enumeration type can be used". */
28614 NIC_CONSTRUCTOR))
28617 /* Create a location of the form:
28618 float(i)
28619 ^~~~~~~~
28620 with caret == start at the start of the type name,
28621 finishing at the closing paren. */
28625 }
28627 /* Save the tokens that make up the body of a member function defined
28628 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
28629 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
28630 specifiers applied to the declaration. Returns the FUNCTION_DECL
28631 for the member function. */
28633 static tree
28637 tree attributes)
28638 {
28641 tree fn;
28644 /* Create the FUNCTION_DECL. */
28648 /* If something went badly wrong, bail out now. */
28650 {
28651 /* If there's a function-body, skip it. */
28656 }
28658 /* Remember it, if there are default args to post process. */
28661 /* Save away the tokens that make up the body of the
28662 function. */
28668 RID_TRANSACTION_ATOMIC))
28669 {
28671 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
28678 {
28684 }
28685 else
28688 {
28692 }
28693 }
28695 /* Handle function try blocks. */
28697 {
28700 }
28701 /* We can have braced-init-list mem-initializers before the fn body. */
28703 {
28706 {
28707 /* cache_group will stop after an un-nested { } pair, too. */
28711 /* variadic mem-inits have ... after the ')'. */
28714 }
28715 }
28717 /* Handle function try blocks. */
28723 /* Save away the inline definition; we will process it when the
28724 class is complete. */
28728 /* We need to know that this was defined in the class, so that
28729 friend templates are handled correctly. */
28732 /* Add FN to the queue of functions to be parsed later. */
28736 }
28738 /* Save the tokens that make up the in-class initializer for a non-static
28739 data member. Returns a DEFERRED_PARSE. */
28741 static tree
28743 {
28745 }
28747 /* Parse a template-argument-list, as well as the trailing ">" (but
28748 not the opening "<"). See cp_parser_template_argument_list for the
28749 return value. */
28751 static tree
28753 {
28754 tree arguments;
28755 tree saved_scope;
28756 tree saved_qualifying_scope;
28757 tree saved_object_scope;
28760 /* [temp.names]
28762 When parsing a template-id, the first non-nested `>' is taken as
28763 the end of the template-argument-list rather than a greater-than
28764 operator. */
28765 saved_greater_than_is_operator_p
28768 /* Parsing the argument list may modify SCOPE, so we save it
28769 here. */
28773 /* We need to evaluate the template arguments, even though this
28774 template-id may be nested within a "sizeof". */
28775 cp_evaluated ev;
28776 /* Parse the template-argument-list itself. */
28780 else
28782 /* Look for the `>' that ends the template-argument-list. If we find
28783 a '>>' instead, it's probably just a typo. */
28785 {
28787 {
28788 /* In C++0x, a `>>' in a template argument list or cast
28789 expression is considered to be two separate `>'
28790 tokens. So, change the current token to a `>', but don't
28791 consume it: it will be consumed later when the outer
28792 template argument list (or cast expression) is parsed.
28793 Note that this replacement of `>' for `>>' is necessary
28794 even if we are parsing tentatively: in the tentative
28795 case, after calling
28796 cp_parser_enclosed_template_argument_list we will always
28797 throw away all of the template arguments and the first
28798 closing `>', either because the template argument list
28799 was erroneous or because we are replacing those tokens
28800 with a CPP_TEMPLATE_ID token. The second `>' (which will
28801 not have been thrown away) is needed either to close an
28802 outer template argument list or to complete a new-style
28803 cast. */
28806 }
28808 {
28809 /* If we're in a nested template argument list, the '>>' has
28810 to be a typo for '> >'. We emit the error message, but we
28811 continue parsing and we push a '>' as next token, so that
28812 the argument list will be parsed correctly. Note that the
28813 global source location is still on the token before the
28814 '>>', so we need to say explicitly where we want it. */
28822 }
28823 else
28824 {
28825 /* If this is not a nested template argument list, the '>>'
28826 is a typo for '>'. Emit an error message and continue.
28827 Same deal about the token location, but here we can get it
28828 right by consuming the '>>' before issuing the diagnostic. */
28831 "spurious %<>>%>, use %<>%> to terminate "
28833 }
28834 }
28835 else
28837 /* The `>' token might be a greater-than operator again now. */
28838 parser->greater_than_is_operator_p
28840 /* Restore the SAVED_SCOPE. */
28846 }
28848 /* MEMBER_FUNCTION is a member function, or a friend. If default
28849 arguments, or the body of the function have not yet been parsed,
28850 parse them now. */
28852 static void
28854 {
28856 /* If this member is a template, get the underlying
28857 FUNCTION_DECL. */
28861 /* There should not be any class definitions in progress at this
28862 point; the bodies of members are only parsed outside of all class
28863 definitions. */
28865 /* While we're parsing the member functions we might encounter more
28866 classes. We want to handle them right away, but we don't want
28867 them getting mixed up with functions that are currently in the
28868 queue. */
28871 /* Make sure that any template parameters are in scope. */
28874 /* If the body of the function has not yet been parsed, parse it
28875 now. */
28877 {
28878 tree function_scope;
28881 /* The function is no longer pending; we are processing it. */
28886 /* If this is a local class, enter the scope of the containing
28887 function. */
28892 /* Push the body of the function onto the lexer stack. */
28895 /* Let the front end know that we going to be defining this
28896 function. */
28900 /* Don't do access checking if it is a templated function. */
28904 /* #pragma omp declare reduction needs special parsing. */
28906 {
28911 }
28912 else
28913 /* Now, parse the body of the function. */
28920 /* Leave the scope of the containing function. */
28924 }
28926 /* Remove any template parameters from the symbol table. */
28929 /* Restore the queue. */
28932 }
28934 /* If DECL contains any default args, remember it on the unparsed
28935 functions queue. */
28937 static void
28939 {
28940 tree probe;
28943 probe;
28946 {
28950 }
28952 /* Remember if there is a noexcept-specifier to post process. */
28956 }
28958 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
28959 which is either a FIELD_DECL or PARM_DECL. Parse it and return
28960 the result. For a PARM_DECL, PARMTYPE is the corresponding type
28961 from the parameter-type-list. */
28963 static tree
28966 {
28968 tree parsed_arg;
28974 /* Push the saved tokens for the default argument onto the parser's
28975 lexer stack. */
28981 /* Parse the default argument. */
28992 {
28993 /* In a non-template class, check conversions now. In a template,
28994 we'll wait and instantiate these as needed. */
28997 tf_warning_or_error);
29000 else
29002 }
29004 /* If the token stream has not been completely used up, then
29005 there was extra junk after the end of the default
29006 argument. */
29008 {
29011 else
29013 }
29015 /* Revert to the main lexer. */
29019 }
29021 /* FIELD is a non-static data member with an initializer which we saved for
29022 later; parse it now. */
29024 static void
29026 {
29027 tree def;
29034 NULL_TREE);
29040 }
29042 /* FN is a FUNCTION_DECL which may contains a parameter with an
29043 unparsed DEFERRED_PARSE. Parse the default args now. This function
29044 assumes that the current scope is the scope in which the default
29045 argument should be processed. */
29047 static void
29049 {
29053 /* While we're parsing the default args, we might (due to the
29054 statement expression extension) encounter more classes. We want
29055 to handle them right away, but we don't want them getting mixed
29056 up with default args that are currently in the queue. */
29059 /* Local variable names (and the `this' keyword) may not appear
29060 in a default argument. */
29071 {
29073 tree parsed_arg;
29075 tree copy;
29082 /* This can happen for a friend declaration for a function
29083 already declared with default arguments. */
29086 parsed_arg
29088 default_arg,
29092 /* Update any instantiations we've already created. */
29096 }
29100 /* Make sure no default arg is missing. */
29103 /* Restore the state of local_variables_forbidden_p. */
29106 /* Restore the queue. */
29108 }
29110 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
29112 sizeof ... ( identifier )
29114 where the 'sizeof' token has already been consumed. */
29116 static tree
29118 {
29119 /* Consume the `...'. */
29123 matching_parens parens;
29127 else
29135 /* The name is not qualified. */
29154 }
29156 /* Parse the operand of `sizeof' (or a similar operator). Returns
29157 either a TYPE or an expression, depending on the form of the
29158 input. The KEYWORD indicates which kind of expression we have
29159 encountered. */
29161 static tree
29163 {
29170 /* If it's a `...', then we are computing the length of a parameter
29171 pack. */
29176 /* Types cannot be defined in a `sizeof' expression. Save away the
29177 old message. */
29180 parser->type_definition_forbidden_message
29182 parser->type_definition_forbidden_message_arg
29185 /* The restrictions on constant-expressions do not apply inside
29186 sizeof expressions. */
29187 saved_integral_constant_expression_p
29189 saved_non_integral_constant_expression_p
29193 /* Do not actually evaluate the expression. */
29196 /* If it's a `(', then we might be looking at the type-id
29197 construction. */
29199 {
29204 /* We can't be sure yet whether we're looking at a type-id or an
29205 expression. */
29208 matching_parens parens;
29211 /* Note: as a GNU Extension, compound literals are considered
29212 postfix-expressions as they are in C99, so they are valid
29213 arguments to sizeof. See comment in cp_parser_cast_expression
29214 for details. */
29217 else
29218 {
29221 /* Look for the type-id. */
29223 /* Look for the closing `)'. */
29226 }
29228 /* If all went well, then we're done. */
29231 else
29232 {
29233 /* Commit to the tentative_firewall so we get syntax errors. */
29237 }
29238 }
29239 else
29242 /* Go back to evaluating expressions. */
29246 /* And restore the old one. */
29249 parser->integral_constant_expression_p
29251 parser->non_integral_constant_expression_p
29255 }
29257 /* If the current declaration has no declarator, return true. */
29259 static bool
29261 {
29262 /* If the next token is a `;' or a `,' then there is no
29263 declarator. */
29266 }
29268 /* Update the DECL_SPECS to reflect the storage class indicated by
29269 KEYWORD. */
29271 static void
29276 {
29277 cp_storage_class storage_class;
29280 {
29284 }
29286 {
29289 }
29294 {
29297 }
29300 {
29318 }
29322 /* A storage class specifier cannot be applied alongside a typedef
29323 specifier. If there is a typedef specifier present then set
29324 conflicting_specifiers_p which will trigger an error later
29325 on in grokdeclarator. */
29328 }
29330 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
29331 is true, the type is a class or enum definition. */
29333 static void
29335 tree type_spec,
29338 {
29341 /* If the user tries to redeclare bool, char8_t, char16_t, char32_t, or
29342 wchar_t (with, for example, in "typedef int wchar_t;") we remember that
29343 this is what happened. In system headers, we ignore these
29344 declarations so that G++ can work with system headers that are not
29345 C++-safe. */
29347 && !type_definition_p
29358 {
29361 ds_redefined_builtin_type_spec,
29362 token);
29364 {
29368 }
29369 }
29372 else
29373 {
29378 }
29379 }
29381 /* True iff TOKEN is the GNU keyword __thread. */
29383 static bool
29385 {
29388 }
29390 /* Set the location for a declarator specifier and check if it is
29391 duplicated.
29393 DECL_SPECS is the sequence of declarator specifiers onto which to
29394 set the location.
29396 DS is the single declarator specifier to set which location is to
29397 be set onto the existing sequence of declarators.
29399 LOCATION is the location for the declarator specifier to
29400 consider. */
29402 static void
29405 {
29414 {
29418 }
29419 else
29420 {
29422 {
29426 else
29427 {
29430 OPT_Wlong_long,
29432 }
29433 }
29435 {
29439 {
29443 }
29444 else
29445 {
29448 }
29449 }
29450 else
29451 {
29467 "__complex"
29468 };
29472 }
29473 }
29474 }
29476 /* Return true iff the declarator specifier DS is present in the
29477 sequence of declarator specifiers DECL_SPECS. */
29479 bool
29481 cp_decl_spec ds)
29482 {
29489 }
29491 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
29492 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
29494 static bool
29496 {
29498 }
29500 /* Issue an error message indicating that TOKEN_DESC was expected.
29501 If KEYWORD is true, it indicated this function is called by
29502 cp_parser_require_keword and the required token can only be
29503 a indicated keyword.
29505 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
29506 within any error as the location of an "opening" token matching
29507 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
29508 RT_CLOSE_PAREN). */
29510 static void
29512 required_token token_desc,
29514 location_t matching_location)
29515 {
29521 {
29590 }
29593 {
29595 {
29673 }
29674 }
29678 }
29681 /* If the next token is of the indicated TYPE, consume it. Otherwise,
29682 issue an error message indicating that TOKEN_DESC was expected.
29684 Returns the token consumed, if the token had the appropriate type.
29685 Otherwise, returns NULL.
29687 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
29688 within any error as the location of an "opening" token matching
29689 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
29690 RT_CLOSE_PAREN). */
29695 required_token token_desc,
29696 location_t matching_location)
29697 {
29700 else
29701 {
29702 /* Output the MESSAGE -- unless we're parsing tentatively. */
29705 matching_location);
29707 }
29708 }
29710 /* An error message is produced if the next token is not '>'.
29711 All further tokens are skipped until the desired token is
29712 found or '{', '}', ';' or an unbalanced ')' or ']'. */
29714 static void
29716 {
29717 /* Current level of '< ... >'. */
29719 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
29722 /* Are we ready, yet? If not, issue error message. */
29726 /* Skip tokens until the desired token is found. */
29728 {
29729 /* Peek at the next token. */
29731 {
29739 /* C++0x views the `>>' operator as two `>' tokens, but
29740 C++98 does not. */
29743 {
29744 /* We've hit a `>>' where the first `>' closes the
29745 template argument list, and the second `>' is
29746 spurious. Just consume the `>>' and stop; we've
29747 already produced at least one error. */
29750 }
29751 /* Fall through for C++0x, so we handle the second `>' in
29752 the `>>'. */
29757 {
29758 /* We've reached the token we want, consume it and stop. */
29761 }
29780 /* The '>' was probably forgotten, don't look further. */
29785 }
29787 /* Consume this token. */
29789 }
29790 }
29792 /* If the next token is the indicated keyword, consume it. Otherwise,
29793 issue an error message indicating that TOKEN_DESC was expected.
29795 Returns the token consumed, if the token had the appropriate type.
29796 Otherwise, returns NULL. */
29801 required_token token_desc)
29802 {
29806 {
29808 UNKNOWN_LOCATION);
29810 }
29813 }
29815 /* Returns TRUE iff TOKEN is a token that can begin the body of a
29816 function-definition. */
29818 static bool
29820 {
29823 /* A ctor-initializer begins with a `:'. */
29825 /* A function-try-block begins with `try'. */
29827 /* A function-transaction-block begins with `__transaction_atomic'
29828 or `__transaction_relaxed'. */
29831 /* The named return value extension begins with `return'. */
29833 }
29835 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
29836 definition. */
29838 static bool
29840 {
29847 }
29849 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
29850 C++0x) ending a template-argument. */
29852 static bool
29854 {
29862 }
29864 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
29865 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
29867 static bool
29870 {
29876 /* Check for the sequence `<::' in the original code. It would be lexed as
29877 `[:', where `[' is a digraph, and there is no whitespace before
29878 `:'. */
29880 {
29885 }
29887 }
29889 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
29890 or none_type otherwise. */
29892 static enum tag_types
29894 {
29896 {
29906 }
29907 }
29909 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
29910 or none_type otherwise or if the token is null. */
29912 static enum tag_types
29914 {
29919 {
29927 }
29928 }
29930 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
29932 static void
29934 {
29938 {
29942 type))
29945 }
29946 }
29948 /* Issue an error message if DECL is redeclared with different
29949 access than its original declaration [class.access.spec/3].
29950 This applies to nested classes, nested class templates and
29951 enumerations [class.mem/1]. */
29953 static void
29955 {
29966 }
29968 /* Look for the `template' keyword, as a syntactic disambiguator.
29969 Return TRUE iff it is present, in which case it will be
29970 consumed. */
29972 static bool
29974 {
29976 {
29977 /* In C++98 the `template' keyword can only be used within templates;
29978 outside templates the parser can always figure out what is a
29979 template and what is not. In C++11, per the resolution of DR 468,
29980 `template' is allowed in cases where it is not strictly necessary. */
29983 {
29986 "in C++98 %<template%> (as a disambiguator) is only "
29988 /* If this part of the token stream is rescanned, the same
29989 error message would be generated. So, we purge the token
29990 from the stream. */
29993 }
29994 else
29995 {
29996 /* Consume the `template' keyword. */
29999 }
30000 }
30002 }
30004 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
30005 set PARSER->SCOPE, and perform other related actions. */
30007 static void
30009 {
30012 /* Get the stored value. */
30014 /* Set the scope from the stored value. */
30018 }
30020 /* Consume tokens up through a non-nested END token. Returns TRUE if we
30021 encounter the end of a block before what we were looking for. */
30023 static bool
30027 {
30029 {
30032 /* Abort a parenthesized expression if we encounter a semicolon. */
30036 /* If we've reached the end of the file, stop. */
30042 /* We've hit the end of an enclosing block, so there's been some
30043 kind of syntax error. */
30046 /* Consume the token. */
30048 /* See if it starts a new group. */
30050 {
30052 /* In theory this should probably check end == '}', but
30053 cp_parser_save_member_function_body needs it to exit
30054 after either '}' or ')' when called with ')'. */
30057 }
30059 {
30063 }
30068 }
30069 }
30071 /* Like above, for caching a default argument or NSDMI. Both of these are
30072 terminated by a non-nested comma, but it can be unclear whether or not a
30073 comma is nested in a template argument list unless we do more parsing.
30074 In order to handle this ambiguity, when we encounter a ',' after a '<'
30075 we try to parse what follows as a parameter-declaration-list (in the
30076 case of a default argument) or a member-declarator (in the case of an
30077 NSDMI). If that succeeds, then we stop caching. */
30079 static tree
30081 {
30086 tree default_argument;
30088 /* Add tokens until we have processed the entire default
30089 argument. We add the range [first_token, token). */
30092 {
30093 /* For list-initialization, this is straightforward. */
30096 }
30098 {
30101 /* Peek at the next token. */
30103 /* What we do depends on what token we have. */
30105 {
30106 /* In valid code, a default argument must be
30107 immediately followed by a `,' `)', or `...'. */
30110 {
30111 /* If we've seen a '<', we might be in a
30112 template-argument-list. Until Core issue 325 is
30113 resolved, we don't know how this situation ought
30114 to be handled, so try to DTRT. We check whether
30115 what comes after the comma is a valid parameter
30116 declaration list. If it is, then the comma ends
30117 the default argument; otherwise the default
30118 argument continues. */
30122 /* Set ITALP so cp_parser_parameter_declaration_list
30123 doesn't decide to commit to this parse. */
30130 {
30131 /* Parse declarators until we reach a non-comma or
30132 somthing that cannot be an initializer.
30133 Just checking whether we're looking at a single
30134 declarator is insufficient. Consider:
30135 int var = tuple<T,U>::x;
30136 The template parameter 'U' looks exactly like a
30137 declarator. */
30138 do
30139 {
30143 CP_PARSER_FLAGS_NONE,
30152 }
30154 /* If we met an '=' or ';' then the original comma
30155 was the end of the NSDMI. Otherwise assume
30156 we're still in the NSDMI. */
30159 }
30160 else
30161 {
30164 tree t = cp_parser_parameter_declaration_list
30169 }
30176 }
30177 /* FALLTHRU */
30180 /* If we run into a non-nested `;', `}', or `]',
30181 then the code is invalid -- but the default
30182 argument is certainly over. */
30187 /* Handle correctly int n = sizeof ... ( p ); */
30190 /* Update DEPTH, if necessary. */
30205 /* This might be the comparison operator, or it might
30206 start a template argument list. */
30213 /* Fall through for C++0x, which treats the `>>'
30214 operator like two `>' tokens in certain
30215 cases. */
30220 {
30221 /* This might be an operator, or it might close a
30222 template argument list. But if a previous '<'
30223 started a template argument list, this will have
30224 closed it, so we can't be in one anymore. */
30228 }
30231 /* If we run out of tokens, issue an error message. */
30239 /* In these cases, we should look for template-ids.
30240 For example, if the default argument is
30241 `X<int, double>()', we need to do name lookup to
30242 figure out whether or not `X' is a template; if
30243 so, the `,' does not end the default argument.
30245 That is not yet done. */
30250 }
30252 /* If we've reached the end, stop. */
30256 /* Add the token to the token block. */
30258 }
30260 /* Create a DEFERRED_PARSE to represent the unparsed default
30261 argument. */
30268 }
30270 /* A location to use for diagnostics about an unparsed DEFERRED_PARSE. */
30272 location_t
30274 {
30279 }
30281 /* Begin parsing tentatively. We always save tokens while parsing
30282 tentatively so that if the tentative parsing fails we can restore the
30283 tokens. */
30285 static void
30287 {
30288 /* Enter a new parsing context. */
30290 /* Begin saving tokens. */
30292 /* In order to avoid repetitive access control error messages,
30293 access checks are queued up until we are no longer parsing
30294 tentatively. */
30296 }
30298 /* Commit to the currently active tentative parse. */
30300 static void
30302 {
30306 /* Mark all of the levels as committed. */
30309 {
30316 }
30317 }
30319 /* Commit to the topmost currently active tentative parse.
30321 Note that this function shouldn't be called when there are
30322 irreversible side-effects while in a tentative state. For
30323 example, we shouldn't create a permanent entry in the symbol
30324 table, or issue an error message that might not apply if the
30325 tentative parse is aborted. */
30327 static void
30329 {
30334 {
30342 }
30343 }
30345 /* Abort the currently active tentative parse. All consumed tokens
30346 will be rolled back, and no diagnostics will be issued. */
30348 static void
30350 {
30354 /* Now, pretend that we want to see if the construct was
30355 successfully parsed. */
30357 }
30359 /* Stop parsing tentatively. If a parse error has occurred, restore the
30360 token stream. Otherwise, commit to the tokens we have consumed.
30361 Returns true if no error occurred; false otherwise. */
30363 static bool
30365 {
30369 /* Remember whether or not an error occurred, since we are about to
30370 destroy that information. */
30372 /* Remove the topmost context from the stack. */
30375 /* If no parse errors occurred, commit to the tentative parse. */
30377 {
30378 /* Commit to the tokens read tentatively, unless that was
30379 already done. */
30384 }
30385 /* Otherwise, if errors occurred, roll back our state so that things
30386 are just as they were before we began the tentative parse. */
30387 else
30388 {
30391 }
30392 /* Add the context to the front of the free list. */
30397 }
30399 /* Returns true if we are parsing tentatively and are not committed to
30400 this tentative parse. */
30402 static bool
30404 {
30407 }
30409 /* Returns nonzero iff an error has occurred during the most recent
30410 tentative parse. */
30412 static bool
30414 {
30417 }
30419 /* Returns nonzero if GNU extensions are allowed. */
30421 static bool
30423 {
30425 }
30426 \f
30427 /* Objective-C++ Productions */
30430 /* Parse an Objective-C expression, which feeds into a primary-expression
30431 above.
30433 objc-expression:
30434 objc-message-expression
30435 objc-string-literal
30436 objc-encode-expression
30437 objc-protocol-expression
30438 objc-selector-expression
30440 Returns a tree representation of the expression. */
30442 static cp_expr
30444 {
30445 /* Try to figure out what kind of declaration is present. */
30449 {
30459 {
30471 }
30472 /* FALLTHRU */
30478 }
30481 }
30483 /* Parse an Objective-C message expression.
30485 objc-message-expression:
30486 [ objc-message-receiver objc-message-args ]
30488 Returns a representation of an Objective-C message. */
30490 static tree
30492 {
30504 /* Construct a location e.g.
30505 [self func1:5]
30506 ^~~~~~~~~~~~~~
30507 ranging from the '[' to the ']', with the caret at the start. */
30512 }
30514 /* Parse an objc-message-receiver.
30516 objc-message-receiver:
30517 expression
30518 simple-type-specifier
30520 Returns a representation of the type or expression. */
30522 static tree
30524 {
30525 tree rcv;
30527 /* An Objective-C message receiver may be either (1) a type
30528 or (2) an expression. */
30532 /* If that worked out, fine. */
30539 CP_PARSER_FLAGS_NONE);
30546 }
30548 /* Parse the arguments and selectors comprising an Objective-C message.
30550 objc-message-args:
30551 objc-selector
30552 objc-selector-args
30553 objc-selector-args , objc-comma-args
30555 objc-selector-args:
30556 objc-selector [opt] : assignment-expression
30557 objc-selector-args objc-selector [opt] : assignment-expression
30559 objc-comma-args:
30560 assignment-expression
30561 objc-comma-args , assignment-expression
30563 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
30564 selector arguments and TREE_VALUE containing a list of comma
30565 arguments. */
30567 static tree
30569 {
30575 {
30581 /* Detect if we have a unary selector. */
30590 sel_args
30595 }
30597 /* Handle non-selector arguments, if any. */
30599 {
30600 tree arg;
30605 addl_args
30610 }
30613 {
30616 }
30619 }
30621 /* Parse an Objective-C encode expression.
30623 objc-encode-expression:
30624 @encode objc-typename
30626 Returns an encoded representation of the type argument. */
30628 static cp_expr
30630 {
30631 tree type;
30636 matching_parens parens;
30643 {
30647 }
30649 /* This happens if we find @encode(T) (where T is a template
30650 typename or something dependent on a template typename) when
30651 parsing a template. In that case, we can't compile it
30652 immediately, but we rather create an AT_ENCODE_EXPR which will
30653 need to be instantiated when the template is used.
30654 */
30656 {
30660 }
30663 /* Build a location of the form:
30664 @encode(int)
30665 ^~~~~~~~~~~~
30666 with caret==start at the @ token, finishing at the close paren. */
30670 }
30672 /* Parse an Objective-C @defs expression. */
30674 static tree
30676 {
30677 tree name;
30680 matching_parens parens;
30686 }
30688 /* Parse an Objective-C protocol expression.
30690 objc-protocol-expression:
30691 @protocol ( identifier )
30693 Returns a representation of the protocol expression. */
30695 static tree
30697 {
30698 tree proto;
30702 matching_parens parens;
30707 /* Build a location of the form:
30708 @protocol(prot)
30709 ^~~~~~~~~~~~~~~
30710 with caret==start at the @ token, finishing at the close paren. */
30715 }
30717 /* Parse an Objective-C selector expression.
30719 objc-selector-expression:
30720 @selector ( objc-method-signature )
30722 objc-method-signature:
30723 objc-selector
30724 objc-selector-seq
30726 objc-selector-seq:
30727 objc-selector :
30728 objc-selector-seq objc-selector :
30730 Returns a representation of the method selector. */
30732 static tree
30734 {
30741 matching_parens parens;
30747 {
30756 {
30757 /* Detect if we have a unary selector. */
30759 {
30762 }
30763 else
30764 {
30766 }
30767 }
30772 {
30773 sel_seq
30776 sel_seq
30779 }
30780 else
30781 sel_seq
30786 }
30788 finish_selector:
30792 /* Build a location of the form:
30793 @selector(func)
30794 ^~~~~~~~~~~~~~~
30795 with caret==start at the @ token, finishing at the close paren. */
30798 /* TODO: objc_build_selector_expr doesn't always honor the location. */
30801 }
30803 /* Parse a list of identifiers.
30805 objc-identifier-list:
30806 identifier
30807 objc-identifier-list , identifier
30809 Returns a TREE_LIST of identifier nodes. */
30811 static tree
30813 {
30814 tree identifier;
30815 tree list;
30826 {
30833 identifier));
30835 }
30838 }
30840 /* Parse an Objective-C alias declaration.
30842 objc-alias-declaration:
30843 @compatibility_alias identifier identifier ;
30845 This function registers the alias mapping with the Objective-C front end.
30846 It returns nothing. */
30848 static void
30850 {
30858 }
30860 /* Parse an Objective-C class forward-declaration.
30862 objc-class-declaration:
30863 @class objc-identifier-list ;
30865 The function registers the forward declarations with the Objective-C
30866 front end. It returns nothing. */
30868 static void
30870 {
30873 {
30874 tree id;
30884 else
30886 }
30888 }
30890 /* Parse a list of Objective-C protocol references.
30892 objc-protocol-refs-opt:
30893 objc-protocol-refs [opt]
30895 objc-protocol-refs:
30896 < objc-identifier-list >
30898 Returns a TREE_LIST of identifiers, if any. */
30900 static tree
30902 {
30906 {
30910 }
30913 }
30915 /* Parse a Objective-C visibility specification. */
30917 static void
30919 {
30923 {
30938 }
30940 /* Eat '@private'/'@protected'/'@public'. */
30942 }
30944 /* Parse an Objective-C method type. Return 'true' if it is a class
30945 (+) method, and 'false' if it is an instance (-) method. */
30949 {
30952 else
30954 }
30956 /* Parse an Objective-C protocol qualifier. */
30958 static tree
30960 {
30973 {
30978 }
30981 }
30983 /* Parse an Objective-C typename. */
30985 static tree
30987 {
30991 {
30994 matching_parens parens;
30998 /* An ObjC type name may consist of just protocol qualifiers, in which
30999 case the type shall default to 'id'. */
31001 {
31004 /* If the type could not be parsed, an error has already
31005 been produced. For error recovery, behave as if it had
31006 not been specified, which will use the default type
31007 'id'. */
31009 {
31011 /* We need to skip to the closing parenthesis as
31012 cp_parser_type_id() does not seem to do it for
31013 us. */
31018 }
31019 }
31023 }
31026 }
31028 /* Check to see if TYPE refers to an Objective-C selector name. */
31030 static bool
31032 {
31038 }
31040 /* Parse an Objective-C selector. */
31042 static tree
31044 {
31048 {
31051 }
31053 /* C++ operator names are allowed to appear in ObjC selectors. */
31055 {
31068 }
31069 }
31071 /* Parse an Objective-C params list. */
31073 static tree
31075 {
31081 {
31091 /* Detect if we have a unary selector. */
31094 {
31097 }
31101 {
31102 /* Something went quite wrong. There should be a colon
31103 here, but there is not. Stop parsing parameters. */
31105 }
31107 /* New ObjC allows attributes on parameters too. */
31112 params
31115 type_name,
31116 identifier,
31117 parm_attr));
31120 }
31123 {
31126 }
31128 /* We allow tail attributes for the method. */
31130 {
31138 }
31141 {
31144 }
31146 }
31148 /* Parse the non-keyword Objective-C params. */
31150 static tree
31153 {
31159 {
31161 tree parm;
31167 {
31172 }
31174 /* TODO: parse attributes for tail parameters. */
31184 }
31186 /* We allow tail attributes for the method. */
31188 {
31190 {
31195 }
31196 else
31197 /* We have an error, but parse the attributes, so that we can
31198 carry on. */
31204 }
31207 }
31209 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
31211 static void
31213 {
31216 /* If the next token is `extern' and the following token is a string
31217 literal, then we have a linkage specification. */
31219 && cp_parser_is_pure_string_literal
31222 /* Handle #pragma, if any. */
31225 /* Allow stray semicolons. */
31228 /* Mark methods as optional or required, when building protocols. */
31230 {
31233 }
31235 {
31238 }
31241 /* Other stray characters must generate errors. */
31243 {
31247 }
31248 /* Finally, try to parse a block-declaration, or a function-definition. */
31249 else
31251 }
31253 /* Parse a method signature. */
31255 static tree
31257 {
31273 }
31275 static bool
31277 {
31278 tree tattr;
31283 /* If the attributes are followed by a method introducer, this is not allowed.
31284 Dump the attributes and flag the situation. */
31289 /* Otherwise, the attributes introduce some interstitial code, possibly so
31290 rewind to allow that check. */
31293 }
31295 /* Parse an Objective-C method prototype list. */
31297 static void
31299 {
31303 {
31305 {
31310 else
31314 {
31318 }
31321 }
31327 OPT_Wattributes,
31329 else
31330 /* Allow for interspersed non-ObjC++ code. */
31334 }
31338 else
31342 }
31344 /* Parse an Objective-C method definition list. */
31346 static void
31348 {
31352 {
31353 tree meth;
31356 {
31362 else
31367 {
31371 }
31373 NULL_TREE);
31375 /* For historical reasons, we accept an optional semicolon. */
31382 {
31389 }
31390 }
31391 /* The following case will be removed once @synthesize is
31392 completely implemented. */
31403 else
31404 /* Allow for interspersed non-ObjC++ code. */
31408 }
31412 else
31416 }
31418 /* Parse Objective-C ivars. */
31420 static void
31422 {
31433 {
31434 cp_decl_specifier_seq declspecs;
31436 tree prefix_attributes;
31444 CP_PARSER_FLAGS_OPTIONAL,
31448 /* auto, register, static, extern, mutable. */
31450 {
31453 }
31455 /* thread_local. */
31457 {
31460 }
31462 /* typedef. */
31464 {
31467 }
31472 /* Keep going until we hit the `;' at the end of the
31473 declaration. */
31475 {
31480 /* Check for a (possibly unnamed) bitfield declaration. */
31488 {
31489 /* Get the name of the bitfield. */
31494 eat_colon:
31496 /* Get the width of the bitfield. */
31497 width
31499 }
31500 else
31501 {
31502 /* Parse the declarator. */
31503 declarator
31505 CP_PARSER_FLAGS_NONE,
31511 }
31513 /* Look for attributes that apply to the ivar. */
31515 /* Remember which attributes are prefix attributes and
31516 which are not. */
31518 /* Combine the attributes. */
31522 /* Create the bitfield declaration. */
31525 else
31530 /* Add the instance variable. */
31534 /* Reset PREFIX_ATTRIBUTES. */
31536 {
31541 }
31546 {
31549 }
31551 }
31555 }
31560 /* Do not consume the RID_AT_END, so it will be read again as terminating
31561 the @interface of @implementation. */
31565 /* For historical reasons, we accept an optional semicolon. */
31568 }
31570 /* Parse an Objective-C protocol declaration. */
31572 static void
31574 {
31580 {
31585 }
31587 /* See if we have a forward declaration or a definition. */
31590 /* Try a forward declaration first. */
31592 {
31594 {
31595 tree id;
31605 else
31607 }
31609 }
31611 /* Ok, we got a full-fledged definition (or at least should). */
31612 else
31613 {
31618 }
31619 }
31621 /* Parse an Objective-C superclass or category. */
31623 static void
31628 {
31634 {
31637 }
31639 {
31640 matching_parens parens;
31643 /* If there is no category name, and this is an @interface, we
31644 have a class extension. */
31646 {
31649 }
31650 else
31654 }
31655 }
31657 /* Parse an Objective-C class interface. */
31659 static void
31661 {
31668 {
31669 /* It's hard to recover because even if valid @interface stuff
31670 is to follow, we can't compile it (or validate it) if we
31671 don't even know which class it refers to. Let's assume this
31672 was a stray '@interface' token in the stream and skip it.
31673 */
31675 }
31680 /* We have either a class or a category on our hands. */
31683 else
31684 {
31686 /* Handle instance variable declarations, if any. */
31689 }
31692 }
31694 /* Parse an Objective-C class implementation. */
31696 static void
31698 {
31705 {
31706 /* It's hard to recover because even if valid @implementation
31707 stuff is to follow, we can't compile it (or validate it) if
31708 we don't even know which class it refers to. Let's assume
31709 this was a stray '@implementation' token in the stream and
31710 skip it.
31711 */
31713 }
31717 /* We have either a class or a category on our hands. */
31720 else
31721 {
31723 /* Handle instance variable declarations, if any. */
31726 }
31729 }
31731 /* Consume the @end token and finish off the implementation. */
31733 static void
31735 {
31738 }
31740 /* Parse an Objective-C declaration. */
31742 static void
31744 {
31745 /* Try to figure out what kind of declaration is present. */
31750 {
31766 }
31769 {
31792 }
31793 }
31795 /* Parse an Objective-C try-catch-finally statement.
31797 objc-try-catch-finally-stmt:
31798 @try compound-statement objc-catch-clause-seq [opt]
31799 objc-finally-clause [opt]
31801 objc-catch-clause-seq:
31802 objc-catch-clause objc-catch-clause-seq [opt]
31804 objc-catch-clause:
31805 @catch ( objc-exception-declaration ) compound-statement
31807 objc-finally-clause:
31808 @finally compound-statement
31810 objc-exception-declaration:
31811 parameter-declaration
31812 '...'
31814 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
31816 Returns NULL_TREE.
31818 PS: This function is identical to c_parser_objc_try_catch_finally_statement
31819 for C. Keep them in sync. */
31821 static tree
31823 {
31824 location_t location;
31825 tree stmt;
31830 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
31831 node, lest it get absorbed into the surrounding block. */
31837 {
31841 matching_parens parens;
31847 {
31848 /* We have "@catch (...)" (where the '...' are literally
31849 what is in the code). Skip the '...'.
31850 parameter_declaration is set to NULL_TREE, and
31851 objc_being_catch_clauses() knows that that means
31852 '...'. */
31855 }
31856 else
31857 {
31858 /* We have "@catch (NSException *exception)" or something
31859 like that. Parse the parameter declaration. */
31864 else
31869 }
31872 else
31873 {
31874 /* If there was no open parenthesis, we are recovering from
31875 an error, and we are trying to figure out what mistake
31876 the user has made. */
31878 /* If there is an immediate closing parenthesis, the user
31879 probably forgot the opening one (ie, they typed "@catch
31880 NSException *e)". Parse the closing parenthesis and keep
31881 going. */
31885 /* If these is no immediate closing parenthesis, the user
31886 probably doesn't know that parenthesis are required at
31887 all (ie, they typed "@catch NSException *e"). So, just
31888 forget about the closing parenthesis and keep going. */
31889 }
31893 }
31895 {
31898 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
31899 node, lest it get absorbed into the surrounding block. */
31903 }
31906 }
31908 /* Parse an Objective-C synchronized statement.
31910 objc-synchronized-stmt:
31911 @synchronized ( expression ) compound-statement
31913 Returns NULL_TREE. */
31915 static tree
31917 {
31918 location_t location;
31925 matching_parens parens;
31930 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
31931 node, lest it get absorbed into the surrounding block. */
31936 }
31938 /* Parse an Objective-C throw statement.
31940 objc-throw-stmt:
31941 @throw assignment-expression [opt] ;
31943 Returns a constructed '@throw' statement. */
31945 static tree
31947 {
31959 }
31961 /* Parse an Objective-C statement. */
31963 static tree
31965 {
31966 /* Try to figure out what kind of declaration is present. */
31970 {
31981 }
31984 }
31986 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
31987 look ahead to see if an objc keyword follows the attributes. This
31988 is to detect the use of prefix attributes on ObjC @interface and
31989 @protocol. */
31991 static bool
31993 {
31998 {
32001 }
32004 }
32006 /* This routine is a minimal replacement for
32007 c_parser_struct_declaration () used when parsing the list of
32008 types/names or ObjC++ properties. For example, when parsing the
32009 code
32011 @property (readonly) int a, b, c;
32013 this function is responsible for parsing "int a, int b, int c" and
32014 returning the declarations as CHAIN of DECLs.
32016 TODO: Share this code with cp_parser_objc_class_ivars. It's very
32017 similar parsing. */
32018 static tree
32020 {
32022 cp_decl_specifier_seq declspecs;
32024 tree prefix_attributes;
32027 CP_PARSER_FLAGS_NONE,
32034 /* auto, register, static, extern, mutable. */
32036 {
32039 }
32041 /* thread_local. */
32043 {
32046 }
32048 /* typedef. */
32050 {
32053 }
32058 /* Keep going until we hit the `;' at the end of the declaration. */
32060 {
32065 /* Parse the declarator. */
32067 CP_PARSER_FLAGS_NONE,
32070 /* Look for attributes that apply to the ivar. */
32072 /* Remember which attributes are prefix attributes and
32073 which are not. */
32075 /* Combine the attributes. */
32085 /* Reset PREFIX_ATTRIBUTES. */
32087 {
32092 }
32099 {
32102 }
32103 else
32105 }
32107 }
32109 /* Parse an Objective-C @property declaration. The syntax is:
32111 objc-property-declaration:
32112 '@property' objc-property-attributes[opt] struct-declaration ;
32114 objc-property-attributes:
32115 '(' objc-property-attribute-list ')'
32117 objc-property-attribute-list:
32118 objc-property-attribute
32119 objc-property-attribute-list, objc-property-attribute
32121 objc-property-attribute
32122 'getter' = identifier
32123 'setter' = identifier
32124 'readonly'
32125 'readwrite'
32126 'assign'
32127 'retain'
32128 'copy'
32129 'nonatomic'
32131 For example:
32132 @property NSString *name;
32133 @property (readonly) id object;
32134 @property (retain, nonatomic, getter=getTheName) id name;
32135 @property int a, b, c;
32137 PS: This function is identical to
32138 c_parser_objc_at_property_declaration for C. Keep them in sync. */
32139 static void
32141 {
32142 /* The following variables hold the attributes of the properties as
32143 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
32144 seen. When we see an attribute, we set them to 'true' (if they
32145 are boolean properties) or to the identifier (if they have an
32146 argument, ie, for getter and setter). Note that here we only
32147 parse the list of attributes, check the syntax and accumulate the
32148 attributes that we find. objc_add_property_declaration() will
32149 then process the information. */
32159 /* 'properties' is the list of properties that we read. Usually a
32160 single one, but maybe more (eg, in "@property int a, b, c;" there
32161 are three). */
32162 tree properties;
32163 location_t loc;
32169 /* Parse the optional attribute list... */
32171 {
32172 /* Eat the '('. */
32173 matching_parens parens;
32177 {
32183 {
32186 }
32190 {
32201 {
32205 else
32210 }
32213 {
32217 }
32219 {
32221 {
32224 }
32225 else
32229 else
32231 }
32232 else
32233 {
32235 {
32238 }
32239 else
32241 }
32247 }
32254 else
32256 }
32258 /* FIXME: "@property (setter, assign);" will generate a spurious
32259 "error: expected ‘)’ before ‘,’ token". This is because
32260 cp_parser_require, unlike the C counterpart, will produce an
32261 error even if we are in error recovery. */
32263 {
32268 }
32269 }
32271 /* ... and the property declaration(s). */
32275 {
32277 /* If the next token is now a `;', consume it. */
32281 }
32285 else
32286 {
32287 /* Comma-separated properties are chained together in
32288 reverse order; add them one by one. */
32297 }
32300 }
32302 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
32304 objc-synthesize-declaration:
32305 @synthesize objc-synthesize-identifier-list ;
32307 objc-synthesize-identifier-list:
32308 objc-synthesize-identifier
32309 objc-synthesize-identifier-list, objc-synthesize-identifier
32311 objc-synthesize-identifier
32312 identifier
32313 identifier = identifier
32315 For example:
32316 @synthesize MyProperty;
32317 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
32319 PS: This function is identical to c_parser_objc_at_synthesize_declaration
32320 for C. Keep them in sync.
32321 */
32322 static void
32324 {
32326 location_t loc;
32331 {
32335 {
32338 }
32340 {
32344 {
32347 }
32348 }
32349 else
32354 else
32356 }
32359 }
32361 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
32363 objc-dynamic-declaration:
32364 @dynamic identifier-list ;
32366 For example:
32367 @dynamic MyProperty;
32368 @dynamic MyProperty, AnotherProperty;
32370 PS: This function is identical to c_parser_objc_at_dynamic_declaration
32371 for C. Keep them in sync.
32372 */
32373 static void
32375 {
32377 location_t loc;
32382 {
32383 tree property;
32386 {
32389 }
32393 else
32395 }
32398 }
32400 \f
32401 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 / 4.5 / 5.0 parsing routines. */
32403 /* Returns name of the next clause.
32404 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
32405 the token is not consumed. Otherwise appropriate pragma_omp_clause is
32406 returned and the token is consumed. */
32408 static pragma_omp_clause
32410 {
32426 {
32431 {
32628 }
32629 }
32635 }
32637 /* Validate that a clause of the given type does not already exist. */
32639 static void
32642 {
32645 }
32647 /* OpenMP 2.5:
32648 variable-list:
32649 identifier
32650 variable-list , identifier
32652 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
32653 colon). An opening parenthesis will have been consumed by the caller.
32655 If KIND is nonzero, create the appropriate node and install the decl
32656 in OMP_CLAUSE_DECL and add the node to the head of the list.
32658 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
32659 return the list created.
32661 COLON can be NULL if only closing parenthesis should end the list,
32662 or pointer to bool which will receive false if the list is terminated
32663 by closing parenthesis or true if the list is terminated by colon. */
32665 static tree
32668 {
32672 {
32675 }
32677 {
32684 && current_class_ptr
32686 {
32692 }
32693 else
32694 {
32701 {
32706 }
32710 else
32713 {
32719 }
32720 }
32722 ;
32724 {
32726 {
32728 /* The OpenACC cache directive explicitly only allows "array
32729 elements or subarrays". */
32731 {
32735 }
32736 /* FALLTHROUGH. */
32741 {
32742 location_t loc
32747 decl
32751 }
32752 /* FALLTHROUGH. */
32758 {
32766 parser->colon_corrects_to_scope_p
32770 else
32771 {
32772 /* Look for `:'. */
32774 {
32779 }
32783 CPP_CLOSE_SQUARE))
32785 }
32786 /* Look for the closing `]'. */
32788 RT_CLOSE_SQUARE))
32789 {
32794 }
32797 }
32801 }
32804 {
32808 {
32809 depend_lvalue:
32813 }
32814 else
32816 }
32822 }
32823 else
32826 get_comma:
32830 }
32836 {
32840 }
32843 {
32846 /* Try to resync to an unnested comma. Copied from
32847 cp_parser_parenthesized_expression_list. */
32848 skip_comma:
32857 }
32860 }
32862 /* Similarly, but expect leading and trailing parenthesis. This is a very
32863 common case for omp clauses. */
32865 static tree
32867 {
32871 }
32873 /* OpenACC 2.0:
32874 copy ( variable-list )
32875 copyin ( variable-list )
32876 copyout ( variable-list )
32877 create ( variable-list )
32878 delete ( variable-list )
32879 present ( variable-list ) */
32881 static tree
32883 tree list)
32884 {
32887 {
32920 }
32928 }
32930 /* OpenACC 2.0:
32931 deviceptr ( variable-list ) */
32933 static tree
32935 {
32939 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
32940 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
32941 variable-list must only allow for pointer variables. */
32944 {
32951 }
32954 }
32956 /* OpenACC 2.5:
32957 auto
32958 finalize
32959 independent
32960 nohost
32961 seq */
32963 static tree
32965 tree list)
32966 {
32973 }
32975 /* OpenACC:
32976 num_gangs ( expression )
32977 num_workers ( expression )
32978 vector_length ( expression ) */
32980 static tree
32983 {
32986 matching_parens parens;
32994 {
32999 }
33007 }
33009 /* OpenACC:
33011 gang [( gang-arg-list )]
33012 worker [( [num:] int-expr )]
33013 vector [( [length:] int-expr )]
33015 where gang-arg is one of:
33017 [num:] int-expr
33018 static: size-expr
33020 and size-expr may be:
33022 *
33023 int-expr
33024 */
33026 static tree
33028 omp_clause_code kind,
33030 {
33039 {
33040 matching_parens parens;
33043 do
33044 {
33048 /* Gang static argument. */
33051 {
33059 {
33062 }
33064 /* Check for the '*' argument. */
33068 CPP_CLOSE_PAREN)))
33069 {
33074 {
33077 }
33079 }
33080 }
33081 /* Worker num: argument and vector length: arguments. */
33085 {
33088 }
33090 /* Now collect the actual argument. */
33092 {
33095 }
33107 {
33110 }
33112 }
33117 }
33131 cleanup_error:
33134 }
33136 /* OpenACC 2.0:
33137 tile ( size-expr-list ) */
33139 static tree
33141 {
33145 /* Collapse and tile are mutually exclusive. (The spec doesn't say
33146 so, but the spec authors never considered such a case and have
33147 differing opinions on what it might mean, including 'not
33148 allowed'.) */
33151 clause_loc);
33156 do
33157 {
33164 {
33167 }
33168 else
33172 }
33175 /* Consume the trailing ')'. */
33183 }
33185 /* OpenACC 2.0
33186 Parse wait clause or directive parameters. */
33188 static tree
33190 {
33200 {
33202 {
33205 }
33207 }
33214 {
33218 {
33221 else
33222 {
33229 }
33230 }
33231 }
33234 }
33236 /* OpenACC:
33237 wait [( int-expr-list )] */
33239 static tree
33241 {
33246 else
33247 {
33253 }
33256 }
33258 /* OpenMP 3.0:
33259 collapse ( constant-expression ) */
33261 static tree
33263 {
33265 location_t loc;
33266 HOST_WIDE_INT n;
33269 matching_parens parens;
33287 {
33290 }
33299 }
33301 /* OpenMP 2.5:
33302 default ( none | shared )
33304 OpenACC:
33305 default ( none | present ) */
33307 static tree
33310 {
33312 tree c;
33314 matching_parens parens;
33318 {
33323 {
33344 }
33347 }
33348 else
33349 {
33350 invalid_kind:
33353 else
33355 }
33372 }
33374 /* OpenMP 3.1:
33375 final ( expression ) */
33377 static tree
33379 {
33382 matching_parens parens;
33401 }
33403 /* OpenMP 2.5:
33404 if ( expression )
33406 OpenMP 4.5:
33407 if ( directive-name-modifier : expression )
33409 directive-name-modifier:
33410 parallel | task | taskloop | target data | target | target update
33411 | target enter data | target exit data
33413 OpenMP 5.0:
33414 directive-name-modifier:
33415 ... | simd | cancel */
33417 static tree
33420 {
33424 matching_parens parens;
33429 {
33445 {
33448 {
33461 else
33462 {
33463 location_t loc
33468 }
33471 {
33473 {
33478 }
33480 {
33481 location_t loc
33485 }
33486 }
33487 }
33488 }
33490 {
33492 {
33495 }
33496 else
33497 {
33499 {
33500 location_t loc
33503 }
33505 }
33506 }
33507 }
33519 {
33522 {
33525 {
33537 }
33539 p);
33541 }
33543 {
33546 else
33549 }
33552 {
33556 }
33557 }
33565 }
33567 /* OpenMP 3.1:
33568 mergeable */
33570 static tree
33573 {
33574 tree c;
33577 location);
33582 }
33584 /* OpenMP 2.5:
33585 nowait */
33587 static tree
33590 {
33591 tree c;
33598 }
33600 /* OpenMP 2.5:
33601 num_threads ( expression ) */
33603 static tree
33605 location_t location)
33606 {
33609 matching_parens parens;
33629 }
33631 /* OpenMP 4.5:
33632 num_tasks ( expression ) */
33634 static tree
33636 location_t location)
33637 {
33640 matching_parens parens;
33660 }
33662 /* OpenMP 4.5:
33663 grainsize ( expression ) */
33665 static tree
33667 location_t location)
33668 {
33671 matching_parens parens;
33691 }
33693 /* OpenMP 4.5:
33694 priority ( expression ) */
33696 static tree
33698 location_t location)
33699 {
33702 matching_parens parens;
33722 }
33724 /* OpenMP 4.5:
33725 hint ( expression ) */
33727 static tree
33729 {
33732 matching_parens parens;
33751 }
33753 /* OpenMP 4.5:
33754 defaultmap ( tofrom : scalar )
33756 OpenMP 5.0:
33757 defaultmap ( implicit-behavior [ : variable-category ] ) */
33759 static tree
33761 location_t location)
33762 {
33766 enum omp_clause_defaultmap_kind category
33769 matching_parens parens;
33776 {
33777 invalid_behavior:
33779 "%<tofrom%>, %<firstprivate%>, %<none%> "
33782 }
33783 else
33784 {
33787 }
33790 {
33794 else
33801 else
33810 else
33817 else
33826 else
33832 }
33836 {
33841 {
33842 invalid_category:
33846 }
33851 {
33855 else
33862 else
33869 else
33875 }
33878 }
33888 {
33895 {
33910 }
33913 p);
33914 else
33918 }
33925 out_err:
33930 }
33932 /* OpenMP 5.0:
33933 order ( concurrent ) */
33935 static tree
33937 {
33941 matching_parens parens;
33946 {
33949 }
33950 else
33951 {
33954 }
33956 {
33959 }
33964 /* check_no_duplicate_clause (list, OMP_CLAUSE_ORDER, "order", location); */
33969 out_err:
33974 }
33976 /* OpenMP 5.0:
33977 bind ( teams | parallel | thread ) */
33979 static tree
33981 location_t location)
33982 {
33983 tree c;
33987 matching_parens parens;
33992 {
33993 invalid:
33997 }
33998 else
33999 {
34002 }
34013 /* check_no_duplicate_clause (list, OMP_CLAUSE_BIND, "bind", location); */
34019 out_err:
34024 }
34026 /* OpenMP 2.5:
34027 ordered
34029 OpenMP 4.5:
34030 ordered ( constant-expression ) */
34032 static tree
34035 {
34037 HOST_WIDE_INT n;
34043 {
34044 matching_parens parens;
34061 {
34063 "ordered argument needs positive constant integer "
34066 }
34067 }
34073 }
34075 /* OpenMP 2.5:
34076 reduction ( reduction-operator : variable-list )
34078 reduction-operator:
34079 One of: + * - & ^ | && ||
34081 OpenMP 3.1:
34083 reduction-operator:
34084 One of: + * - & ^ | && || min max
34086 OpenMP 4.0:
34088 reduction-operator:
34089 One of: + * - & ^ | && ||
34090 id-expression
34092 OpenMP 5.0:
34093 reduction ( reduction-modifier, reduction-operator : variable-list )
34094 in_reduction ( reduction-operator : variable-list )
34095 task_reduction ( reduction-operator : variable-list ) */
34097 static tree
34100 {
34110 {
34113 {
34116 }
34119 {
34127 {
34130 }
34131 }
34132 }
34135 {
34145 }
34149 else
34150 {
34161 {
34191 }
34192 else
34193 {
34195 resync_fail:
34200 }
34201 }
34207 NULL);
34209 {
34216 }
34219 }
34221 /* OpenMP 2.5:
34222 schedule ( schedule-kind )
34223 schedule ( schedule-kind , expression )
34225 schedule-kind:
34226 static | dynamic | guided | runtime | auto
34228 OpenMP 4.5:
34229 schedule ( schedule-modifier : schedule-kind )
34230 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
34232 schedule-modifier:
34233 simd
34234 monotonic
34235 nonmonotonic */
34237 static tree
34239 {
34243 matching_parens parens;
34250 {
34259 else
34265 else
34266 {
34269 }
34270 }
34273 {
34278 {
34299 }
34300 }
34305 else
34311 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
34313 {
34317 }
34320 {
34335 else
34340 }
34352 invalid_kind:
34354 resync_fail:
34359 }
34361 /* OpenMP 3.0:
34362 untied */
34364 static tree
34367 {
34368 tree c;
34375 }
34377 /* OpenMP 4.0:
34378 inbranch
34379 notinbranch */
34381 static tree
34384 {
34389 }
34391 /* OpenMP 4.0:
34392 parallel
34393 for
34394 sections
34395 taskgroup */
34397 static tree
34401 {
34405 }
34407 /* OpenMP 4.5:
34408 nogroup */
34410 static tree
34413 {
34418 }
34420 /* OpenMP 4.5:
34421 simd
34422 threads */
34424 static tree
34428 {
34433 }
34435 /* OpenMP 4.0:
34436 num_teams ( expression ) */
34438 static tree
34440 location_t location)
34441 {
34444 matching_parens parens;
34464 }
34466 /* OpenMP 4.0:
34467 thread_limit ( expression ) */
34469 static tree
34471 location_t location)
34472 {
34475 matching_parens parens;
34495 }
34497 /* OpenMP 4.0:
34498 aligned ( variable-list )
34499 aligned ( variable-list : constant-expression ) */
34501 static tree
34503 {
34507 matching_parens parens;
34515 {
34525 }
34531 }
34533 /* OpenMP 2.5:
34534 lastprivate ( variable-list )
34536 OpenMP 5.0:
34537 lastprivate ( [ lastprivate-modifier : ] variable-list ) */
34539 static tree
34541 {
34549 {
34554 {
34558 }
34559 }
34568 }
34570 /* OpenMP 4.0:
34571 linear ( variable-list )
34572 linear ( variable-list : expression )
34574 OpenMP 4.5:
34575 linear ( modifier ( variable-list ) )
34576 linear ( modifier ( variable-list ) : expression ) */
34578 static tree
34581 {
34586 matching_parens parens;
34591 {
34603 else
34605 }
34610 else
34611 {
34620 }
34623 {
34628 {
34639 {
34642 }
34645 }
34656 }
34659 {
34662 }
34665 }
34667 /* OpenMP 4.0:
34668 safelen ( constant-expression ) */
34670 static tree
34672 location_t location)
34673 {
34676 matching_parens parens;
34695 }
34697 /* OpenMP 4.0:
34698 simdlen ( constant-expression ) */
34700 static tree
34702 location_t location)
34703 {
34706 matching_parens parens;
34725 }
34727 /* OpenMP 4.5:
34728 vec:
34729 identifier [+/- integer]
34730 vec , identifier [+/- integer]
34731 */
34733 static tree
34735 tree list)
34736 {
34740 {
34743 }
34746 {
34753 else
34754 {
34755 t = cp_parser_lookup_name_simple
34760 id_loc);
34761 }
34767 {
34770 }
34774 {
34777 }
34781 {
34784 }
34787 add_to_vector:
34789 {
34793 }
34799 }
34802 {
34808 }
34810 }
34812 /* OpenMP 5.0:
34813 iterators ( iterators-definition )
34815 iterators-definition:
34816 iterator-specifier
34817 iterator-specifier , iterators-definition
34819 iterator-specifier:
34820 identifier = range-specification
34821 iterator-type identifier = range-specification
34823 range-specification:
34824 begin : end
34825 begin : end : step */
34827 static tree
34829 {
34833 matching_parens parens;
34837 bool saved_colon_corrects_to_scope_p
34839 bool saved_colon_doesnt_start_class_def_p
34842 do
34843 {
34844 tree iter_type;
34848 else
34849 {
34852 parser->type_definition_forbidden_message
34858 }
34862 {
34865 }
34885 {
34888 }
34903 {
34906 }
34908 }
34912 parser->colon_doesnt_start_class_def_p
34922 }
34924 /* OpenMP 4.0:
34925 depend ( depend-kind : variable-list )
34927 depend-kind:
34928 in | out | inout
34930 OpenMP 4.5:
34931 depend ( source )
34933 depend ( sink : vec )
34935 OpenMP 5.0:
34936 depend ( depend-modifier , depend-kind: variable-list )
34938 depend-kind:
34939 in | out | inout | mutexinoutset | depobj
34941 depend-modifier:
34942 iterator ( iterators-definition ) */
34944 static tree
34946 {
34950 matching_parens parens;
34954 do
34955 {
34963 {
34968 }
34983 else
34986 }
34993 {
34998 }
35001 {
35011 }
35018 else
35019 {
35024 {
35028 else
35030 }
35033 {
35038 }
35039 }
35042 invalid_kind:
35044 resync_fail:
35051 }
35053 /* OpenMP 4.0:
35054 map ( map-kind : variable-list )
35055 map ( variable-list )
35057 map-kind:
35058 alloc | to | from | tofrom
35060 OpenMP 4.5:
35061 map-kind:
35062 alloc | to | from | tofrom | release | delete
35064 map ( always [,] map-kind: variable-list ) */
35066 static tree
35068 {
35077 {
35082 {
35085 nth++;
35091 {
35096 }
35097 }
35098 }
35102 {
35116 else
35117 {
35123 }
35126 }
35129 {
35133 }
35136 NULL);
35142 }
35144 /* OpenMP 4.0:
35145 device ( expression ) */
35147 static tree
35149 location_t location)
35150 {
35153 matching_parens parens;
35173 }
35175 /* OpenMP 4.0:
35176 dist_schedule ( static )
35177 dist_schedule ( static , expression ) */
35179 static tree
35181 location_t location)
35182 {
35185 matching_parens parens;
35196 {
35207 }
35211 /* check_no_duplicate_clause (list, OMP_CLAUSE_DIST_SCHEDULE,
35212 "dist_schedule", location); */
35218 invalid_kind:
35220 resync_fail:
35225 }
35227 /* OpenMP 4.0:
35228 proc_bind ( proc-bind-kind )
35230 proc-bind-kind:
35231 master | close | spread */
35233 static tree
35235 location_t location)
35236 {
35237 tree c;
35244 {
35254 else
35256 }
35257 else
35266 location);
35271 invalid_kind:
35273 resync_fail:
35278 }
35280 /* OpenMP 5.0:
35281 device_type ( host | nohost | any ) */
35283 static tree
35285 location_t location)
35286 {
35287 tree c;
35294 {
35304 else
35306 }
35307 else
35315 /* check_no_duplicate_clause (list, OMP_CLAUSE_DEVICE_TYPE, "device_type",
35316 location); */
35321 invalid_kind:
35323 resync_fail:
35328 }
35330 /* OpenACC:
35331 async [( int-expr )] */
35333 static tree
35335 {
35342 {
35343 matching_parens parens;
35352 }
35362 }
35364 /* Parse all OpenACC clauses. The set clauses allowed by the directive
35365 is a bitmask in MASK. Return the list of clauses found. */
35367 static tree
35371 {
35376 {
35377 location_t here;
35378 pragma_omp_clause c_kind;
35379 omp_clause_code code;
35390 {
35397 clauses);
35442 clauses);
35447 clauses);
35465 clauses);
35470 clauses);
35481 clauses);
35487 clauses);
35495 clauses);
35499 clauses
35506 clauses);
35515 clauses);
35521 OMP_CLAUSE_VECTOR,
35528 clauses);
35537 OMP_CLAUSE_WORKER,
35543 }
35548 {
35549 /* Remove the invalid clause(s) from the list to avoid
35550 confusing the rest of the compiler. */
35553 }
35554 }
35556 saw_error:
35563 }
35565 /* Parse all OpenMP clauses. The set clauses allowed by the directive
35566 is a bitmask in MASK. Return the list of clauses found; the result
35567 of clause default goes in *pdefault. */
35569 static tree
35573 {
35578 /* Don't create location wrapper nodes within OpenMP clauses. */
35579 auto_suppress_location_wrappers sentinel;
35582 {
35583 pragma_omp_clause c_kind;
35594 {
35611 clauses);
35625 clauses);
35645 clauses);
35650 clauses);
35655 clauses);
35664 clauses
35710 clauses);
35714 clauses
35726 clauses);
35730 clauses
35732 OMP_CLAUSE_TASK_REDUCTION,
35748 clauses);
35753 OMP_CLAUSE_NOTINBRANCH,
35762 {
35763 clause_not_first:
35767 }
35797 clauses);
35798 else
35808 clauses);
35826 {
35831 }
35879 clauses
35885 clauses
35893 }
35898 {
35899 /* Remove the invalid clause(s) from the list to avoid
35900 confusing the rest of the compiler. */
35903 }
35904 }
35905 saw_error:
35908 {
35911 else
35913 }
35915 }
35917 /* OpenMP 2.5:
35918 structured-block:
35919 statement
35921 In practice, we're also interested in adding the statement to an
35922 outer node. So it is convenient if we work around the fact that
35923 cp_parser_statement calls add_stmt. */
35925 static unsigned
35927 {
35930 /* Only move the values to IN_OMP_BLOCK if they weren't false.
35931 This preserves the "not within loop or switch" style error messages
35932 for nonsense cases like
35933 void foo() {
35934 #pragma omp single
35935 break;
35936 }
35937 */
35942 }
35944 static void
35946 {
35948 }
35950 static tree
35952 {
35960 }
35962 /* OpenMP 2.5:
35963 # pragma omp atomic new-line
35964 expression-stmt
35966 expression-stmt:
35967 x binop= expr | x++ | ++x | x-- | --x
35968 binop:
35969 +, *, -, /, &, ^, |, <<, >>
35971 where x is an lvalue expression with scalar type.
35973 OpenMP 3.1:
35974 # pragma omp atomic new-line
35975 update-stmt
35977 # pragma omp atomic read new-line
35978 read-stmt
35980 # pragma omp atomic write new-line
35981 write-stmt
35983 # pragma omp atomic update new-line
35984 update-stmt
35986 # pragma omp atomic capture new-line
35987 capture-stmt
35989 # pragma omp atomic capture new-line
35990 capture-block
35992 read-stmt:
35993 v = x
35994 write-stmt:
35995 x = expr
35996 update-stmt:
35997 expression-stmt | x = x binop expr
35998 capture-stmt:
35999 v = expression-stmt
36000 capture-block:
36001 { v = x; update-stmt; } | { update-stmt; v = x; }
36003 OpenMP 4.0:
36004 update-stmt:
36005 expression-stmt | x = x binop expr | x = expr binop x
36006 capture-stmt:
36007 v = update-stmt
36008 capture-block:
36009 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
36011 where x and v are lvalue expressions with scalar type. */
36013 static void
36015 {
36026 {
36033 {
36038 enum omp_memory_order new_memory_order
36060 {
36064 }
36065 else
36066 {
36069 "%<capture%>, %<seq_cst%>, %<acq_rel%>, "
36071 }
36073 {
36075 {
36078 else
36080 }
36082 {
36085 else
36087 }
36090 }
36091 }
36093 }
36099 {
36100 omp_requires_mask
36105 {
36115 {
36126 }
36130 }
36131 }
36132 else
36134 {
36138 {
36142 }
36147 {
36151 }
36156 {
36160 }
36164 }
36167 {
36177 else
36182 {
36183 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
36184 opcode. */
36189 }
36193 {
36196 }
36197 else
36198 {
36204 }
36207 }
36209 restart:
36213 {
36220 /* FALLTHROUGH */
36230 /* FALLTHROUGH */
36245 /* Undo effects of boolean_increment for post {in,de}crement. */
36247 /* FALLTHRU */
36251 {
36252 /* Undo effects of boolean_increment. */
36254 {
36255 /* This is pre or post increment. */
36260 && !structured_block
36264 }
36265 }
36266 /* FALLTHRU */
36269 {
36304 {
36308 }
36311 {
36317 {
36322 }
36324 {
36336 {
36338 {
36343 }
36344 else
36346 }
36350 }
36353 {
36360 }
36364 }
36368 {
36371 {
36379 }
36381 {
36386 }
36421 }
36432 /* FALLTHROUGH */
36437 }
36444 }
36445 stmt_done:
36447 {
36458 }
36460 {
36463 }
36464 done:
36472 saw_error:
36475 {
36479 {
36483 }
36484 }
36485 }
36488 /* OpenMP 2.5:
36489 # pragma omp barrier new-line */
36491 static void
36493 {
36496 }
36498 /* OpenMP 2.5:
36499 # pragma omp critical [(name)] new-line
36500 structured-block
36502 OpenMP 4.5:
36503 # pragma omp critical [(name) [hint(expression)]] new-line
36504 structured-block */
36506 #define OMP_CRITICAL_CLAUSE_MASK \
36507 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
36509 static tree
36511 {
36515 {
36516 matching_parens parens;
36534 OMP_CRITICAL_CLAUSE_MASK,
36536 }
36537 else
36542 }
36544 /* OpenMP 5.0:
36545 # pragma omp depobj ( depobj ) depobj-clause new-line
36547 depobj-clause:
36548 depend (dependence-type : locator)
36549 destroy
36550 update (dependence-type)
36552 dependence-type:
36553 in
36554 out
36555 inout
36556 mutexinout */
36558 static void
36560 {
36562 matching_parens parens;
36564 {
36567 }
36580 {
36586 {
36592 }
36596 {
36597 matching_parens c_parens;
36599 {
36600 location_t c2_loc
36603 {
36616 }
36618 {
36622 }
36628 }
36629 else
36631 }
36632 }
36634 {
36637 }
36641 }
36644 /* OpenMP 2.5:
36645 # pragma omp flush flush-vars[opt] new-line
36647 flush-vars:
36648 ( variable-list )
36650 OpenMP 5.0:
36651 # pragma omp flush memory-order-clause new-line */
36653 static void
36655 {
36658 {
36667 else
36671 }
36673 {
36676 "%<flush%> list specified together with memory order "
36679 }
36683 }
36685 /* Helper function, to parse omp for increment expression. */
36687 static tree
36689 {
36694 {
36697 }
36700 {
36712 }
36714 /* If decl is an iterator, preserve LHS and RHS of the relational
36715 expr until finish_omp_for. */
36726 }
36728 /* Helper function, to parse omp for increment expression. */
36730 static tree
36732 {
36736 cp_id_kind idk;
36740 {
36749 }
36758 {
36763 }
36770 {
36774 }
36787 do
36788 {
36795 {
36797 {
36800 else
36802 tf_warning_or_error);
36803 }
36804 else
36807 }
36808 }
36812 {
36818 }
36819 else
36823 }
36825 /* Parse the initialization statement of an OpenMP for loop.
36827 Return true if the resulting construct should have an
36828 OMP_CLAUSE_PRIVATE added to it. */
36830 static tree
36838 {
36844 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
36846 init-expr:
36847 var = lb
36848 integer-type var = lb
36849 random-access-iterator-type var = lb
36850 pointer-type var = lb
36851 */
36852 cp_decl_specifier_seq type_specifiers;
36854 /* First, try to parse as an initialized declaration. See
36855 cp_parser_condition, from whence the bulk of this is copied. */
36863 {
36864 /* If parsing a type specifier seq succeeded, then this
36865 MUST be a initialized declaration. */
36870 CP_PARSER_DECLARATOR_NAMED,
36871 CP_PARSER_FLAGS_NONE,
36883 else
36884 {
36894 {
36896 CPP_OPEN_PAREN))
36899 else
36900 /* Trigger an error. */
36905 }
36909 {
36917 {
36920 auto_node);
36925 }
36928 asm_specification,
36929 LOOKUP_ONLYCONVERTING);
36932 {
36935 }
36936 else
36937 {
36940 {
36942 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
36944 {
36948 {
36952 }
36954 }
36956 {
36961 }
36962 }
36963 }
36965 }
36966 else
36967 {
36968 /* Consume '='. */
36972 non_class:
36975 else
36978 asm_specification,
36979 LOOKUP_ONLYCONVERTING);
36980 }
36984 }
36985 }
36986 else
36987 {
36988 cp_id_kind idk;
36989 /* If parsing a type specifier sequence failed, then
36990 this MUST be a simple expression. */
36996 && decl
36999 {
37010 {
37015 }
37020 }
37022 && decl
37025 {
37026 tree rhs;
37034 rhs,
37035 tf_warning_or_error));
37038 }
37039 else
37040 {
37045 {
37049 }
37050 }
37051 }
37053 }
37055 /* Helper for cp_parser_omp_for_loop, handle one range-for loop. */
37057 void
37061 {
37066 {
37070 /* do_auto_deduction doesn't mess with template init-lists. */
37072 {
37075 {
37081 }
37083 }
37090 }
37095 /* If an error happened previously do nothing or else a lot of
37096 unhelpful errors would be issued. */
37098 else
37099 {
37100 tree range_temp;
37104 /* Can't bind a reference to an array of runtime bound. */
37106 else
37107 {
37113 LOOKUP_ONLYCONVERTING);
37116 }
37119 }
37130 LOOKUP_ONLYCONVERTING);
37132 /* The new for initialization statement. */
37140 else
37141 {
37144 }
37147 LOOKUP_ONLYCONVERTING);
37149 /* The new for condition. */
37152 else
37158 /* The new increment expression. */
37161 else
37164 tf_warning_or_error);
37169 {
37172 }
37177 {
37182 {
37187 }
37188 }
37192 {
37194 tf_none);
37198 }
37205 {
37208 }
37210 }
37212 /* Helper for cp_parser_omp_for_loop, finalize part of range for
37213 inside of the collapsed body. */
37215 void
37217 {
37225 {
37229 }
37231 /* The declaration is initialized with *__begin inside the loop body. */
37234 tf_warning_or_error),
37236 LOOKUP_ONLYCONVERTING);
37239 }
37241 /* OpenMP 5.0:
37243 scan-loop-body:
37244 { structured-block scan-directive structured-block } */
37246 static void
37248 {
37251 matching_braces braces;
37261 {
37267 {
37274 }
37276 {
37279 }
37280 else
37285 }
37286 else
37292 clauses);
37296 }
37298 /* Parse the restricted form of the for statement allowed by OpenMP. */
37300 static tree
37303 {
37305 tree orig_decl;
37308 location_t loc_first;
37311 releasing_vec for_block;
37320 {
37323 }
37326 {
37329 }
37336 {
37342 }
37344 {
37347 {
37349 "%<linear%> clause may not be specified together "
37352 }
37353 else
37355 }
37369 {
37372 location_t loc;
37375 {
37379 }
37382 /* Don't create location wrapper nodes within an OpenMP "for"
37383 statement. */
37384 auto_suppress_location_wrappers sentinel;
37386 matching_parens parens;
37394 {
37395 /* Save tokens so that we can put them back. */
37398 /* Look for ':' that is not nested in () or {}. */
37399 bool is_range_for
37402 CPP_COLON,
37403 /*consume_paren=*/
37406 /* Roll back the tokens we skipped. */
37410 {
37411 bool saved_colon_corrects_to_scope_p
37414 /* A colon is used in range-based for. */
37417 /* Parse the declaration. */
37419 /*function_definition_allowed_p=*/
37421 parser->colon_corrects_to_scope_p
37433 {
37435 {
37441 }
37442 else
37444 }
37448 "%<ordered%> clause with parameter on "
37452 }
37453 }
37455 add_private_clause
37461 {
37464 {
37470 }
37471 else
37473 }
37481 {
37486 {
37490 }
37493 {
37494 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
37498 {
37501 }
37502 else
37503 {
37506 }
37508 }
37509 else
37510 {
37515 }
37516 }
37519 {
37520 tree c;
37522 {
37531 decl);
37536 decl);
37537 }
37539 {
37544 else
37549 {
37552 /* For linear, signal that we need to fill up
37553 the so far unknown linear step. */
37556 }
37557 }
37558 }
37567 {
37568 /* If decl is an iterator, preserve the operator on decl
37569 until finish_omp_for. */
37571 && ((processing_template_decl
37576 else
37580 }
37582 parse_close_paren:
37593 {
37596 }
37598 {
37602 }
37609 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
37610 in between the collapsed for loops to be still considered perfectly
37611 nested. Hopefully the final version clarifies this.
37612 For now handle (multiple) {'s and empty statements. */
37615 {
37619 {
37621 bracecount++;
37622 }
37626 else
37627 {
37634 }
37635 }
37638 {
37641 }
37642 }
37647 /* Note that we saved the original contents of this flag when we entered
37648 the structured block, and so we don't need to re-save it here. */
37651 /* Note that the grammar doesn't call for a structured block here,
37652 though the loop as a whole is a structured block. */
37654 {
37660 }
37661 else
37665 else
37669 else
37674 else
37679 {
37681 {
37683 nbraces--;
37684 }
37687 else
37688 {
37690 {
37693 }
37698 }
37699 }
37702 {
37706 else
37708 }
37711 }
37713 /* Helper function for OpenMP parsing, split clauses and call
37714 finish_omp_clauses on each of the set of clauses afterwards. */
37716 static void
37719 {
37725 }
37727 /* OpenMP 5.0:
37728 #pragma omp loop loop-clause[optseq] new-line
37729 for-loop */
37731 #define OMP_LOOP_CLAUSE_MASK \
37732 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37733 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37734 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
37735 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37736 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_BIND) \
37737 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
37739 static tree
37743 {
37754 {
37757 }
37769 }
37771 /* OpenMP 4.0:
37772 #pragma omp simd simd-clause[optseq] new-line
37773 for-loop */
37775 #define OMP_SIMD_CLAUSE_MASK \
37776 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
37777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37779 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37780 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37781 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37782 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
37783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NONTEMPORAL) \
37786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
37788 static tree
37792 {
37803 {
37807 OMP_CLAUSE_ORDERED);
37809 {
37811 "%<ordered%> clause with parameter may not be specified "
37814 }
37815 }
37827 }
37829 /* OpenMP 2.5:
37830 #pragma omp for for-clause[optseq] new-line
37831 for-loop
37833 OpenMP 4.0:
37834 #pragma omp for simd for-simd-clause[optseq] new-line
37835 for-loop */
37837 #define OMP_FOR_CLAUSE_MASK \
37838 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
37843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
37844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
37845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
37846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDER))
37849 static tree
37853 {
37860 /* parallel for{, simd} disallows nowait clause, but for
37861 target {teams distribute ,}parallel for{, simd} it should be accepted. */
37864 /* Composite distribute parallel for{, simd} disallows ordered clause. */
37869 {
37874 {
37898 }
37899 }
37901 {
37904 }
37906 /* Composite distribute parallel for disallows linear clause. */
37913 {
37916 }
37928 }
37933 /* OpenMP 2.5:
37934 # pragma omp master new-line
37935 structured-block */
37937 static tree
37941 {
37949 {
37954 {
37972 }
37973 }
37975 {
37978 }
37981 {
37985 }
37986 else
37991 }
37993 /* OpenMP 2.5:
37994 # pragma omp ordered new-line
37995 structured-block
37997 OpenMP 4.5:
37998 # pragma omp ordered ordered-clauses new-line
37999 structured-block */
38001 #define OMP_ORDERED_CLAUSE_MASK \
38002 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
38003 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
38005 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
38006 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
38008 static bool
38011 {
38015 {
38020 {
38022 {
38025 }
38027 {
38029 "%<depend%> clause may only be used in compound "
38033 }
38034 tree clauses
38036 OMP_ORDERED_DEPEND_CLAUSE_MASK,
38040 }
38041 }
38043 tree clauses
38054 }
38056 /* OpenMP 2.5:
38058 section-scope:
38059 { section-sequence }
38061 section-sequence:
38062 section-directive[opt] structured-block
38063 section-sequence section-directive structured-block */
38065 static tree
38067 {
38072 matching_braces braces;
38080 {
38084 }
38087 {
38095 {
38099 }
38101 {
38104 }
38109 }
38120 }
38122 /* OpenMP 2.5:
38123 # pragma omp sections sections-clause[optseq] newline
38124 sections-scope */
38126 #define OMP_SECTIONS_CLAUSE_MASK \
38127 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
38128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
38129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
38130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
38131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
38133 static tree
38136 {
38148 {
38151 }
38158 }
38160 /* OpenMP 2.5:
38161 # pragma omp parallel parallel-clause[optseq] new-line
38162 structured-block
38163 # pragma omp parallel for parallel-for-clause[optseq] new-line
38164 structured-block
38165 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
38166 structured-block
38168 OpenMP 4.0:
38169 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
38170 structured-block */
38172 #define OMP_PARALLEL_CLAUSE_MASK \
38173 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
38174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
38175 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
38176 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
38177 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
38178 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
38179 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
38180 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
38181 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
38183 static tree
38187 {
38194 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
38200 {
38208 if_p);
38212 if_p);
38215 block);
38220 }
38221 /* When combined with distribute, parallel has to be followed by for.
38222 #pragma omp target parallel is allowed though. */
38226 {
38230 }
38232 {
38236 {
38247 block);
38252 }
38254 {
38269 block);
38274 }
38276 {
38279 }
38281 {
38291 block);
38294 }
38295 }
38297 {
38300 }
38305 {
38308 }
38316 }
38318 /* OpenMP 2.5:
38319 # pragma omp single single-clause[optseq] new-line
38320 structured-block */
38322 #define OMP_SINGLE_CLAUSE_MASK \
38323 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
38324 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
38325 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
38326 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
38328 static tree
38330 {
38341 }
38343 /* OpenMP 3.0:
38344 # pragma omp task task-clause[optseq] new-line
38345 structured-block */
38347 #define OMP_TASK_CLAUSE_MASK \
38348 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
38349 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
38350 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
38351 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
38352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
38353 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
38354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
38355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
38356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
38357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
38358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
38360 static tree
38362 {
38373 }
38375 /* OpenMP 3.0:
38376 # pragma omp taskwait new-line
38378 OpenMP 5.0:
38379 # pragma omp taskwait taskwait-clause[opt] new-line */
38381 #define OMP_TASKWAIT_CLAUSE_MASK \
38382 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
38384 static void
38386 {
38387 tree clauses
38392 {
38399 }
38400 else
38402 }
38404 /* OpenMP 3.1:
38405 # pragma omp taskyield new-line */
38407 static void
38409 {
38412 }
38414 /* OpenMP 4.0:
38415 # pragma omp taskgroup new-line
38416 structured-block
38418 OpenMP 5.0:
38419 # pragma omp taskgroup taskgroup-clause[optseq] new-line */
38421 #define OMP_TASKGROUP_CLAUSE_MASK \
38422 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASK_REDUCTION))
38424 static tree
38426 {
38427 tree clauses
38432 if_p),
38433 clauses);
38434 }
38437 /* OpenMP 2.5:
38438 # pragma omp threadprivate (variable-list) */
38440 static void
38442 {
38443 tree vars;
38449 }
38451 /* OpenMP 4.0:
38452 # pragma omp cancel cancel-clause[optseq] new-line */
38454 #define OMP_CANCEL_CLAUSE_MASK \
38455 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
38456 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
38457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
38458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
38459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
38461 static void
38463 {
38467 }
38469 /* OpenMP 4.0:
38470 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
38472 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
38473 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
38474 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
38475 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
38476 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
38478 static void
38481 {
38482 tree clauses;
38486 {
38491 {
38494 }
38495 }
38497 {
38501 }
38504 {
38509 else
38513 }
38516 OMP_CANCELLATION_POINT_CLAUSE_MASK,
38518 pragma_tok);
38520 }
38522 /* OpenMP 4.0:
38523 #pragma omp distribute distribute-clause[optseq] new-line
38524 for-loop */
38526 #define OMP_DISTRIBUTE_CLAUSE_MASK \
38527 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
38528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
38529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
38530 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
38531 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
38533 static tree
38537 {
38546 {
38554 else
38557 {
38563 {
38567 else
38570 }
38576 else
38590 }
38591 }
38593 {
38596 }
38601 {
38604 }
38616 }
38618 /* OpenMP 4.0:
38619 # pragma omp teams teams-clause[optseq] new-line
38620 structured-block */
38622 #define OMP_TEAMS_CLAUSE_MASK \
38623 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
38624 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
38625 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
38626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
38627 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
38628 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
38629 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
38631 static tree
38635 {
38644 {
38648 {
38674 }
38676 {
38702 }
38703 }
38705 {
38708 }
38713 {
38716 }
38726 }
38728 /* OpenMP 4.0:
38729 # pragma omp target data target-data-clause[optseq] new-line
38730 structured-block */
38732 #define OMP_TARGET_DATA_CLAUSE_MASK \
38733 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
38734 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
38735 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
38736 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR) \
38737 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_ADDR))
38739 static tree
38741 {
38742 tree clauses
38747 {
38750 {
38767 "%<#pragma omp target data%> with map-type other "
38768 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
38772 }
38777 }
38780 {
38783 "%<#pragma omp target data%> must contain at least "
38784 "one %<map%>, %<use_device_ptr%> or %<use_device_addr%> "
38787 }
38798 }
38800 /* OpenMP 4.5:
38801 # pragma omp target enter data target-enter-data-clause[optseq] new-line
38802 structured-block */
38804 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
38805 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
38806 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
38807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
38808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
38809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
38811 static tree
38814 {
38817 {
38822 {
38825 }
38826 }
38828 {
38832 }
38835 {
38841 }
38843 tree clauses
38848 {
38851 {
38864 "%<#pragma omp target enter data%> with map-type other "
38868 }
38870 }
38873 {
38876 "%<#pragma omp target enter data%> must contain at least "
38879 }
38886 }
38888 /* OpenMP 4.5:
38889 # pragma omp target exit data target-enter-data-clause[optseq] new-line
38890 structured-block */
38892 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
38893 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
38894 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
38895 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
38896 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
38897 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
38899 static tree
38902 {
38905 {
38910 {
38913 }
38914 }
38916 {
38920 }
38923 {
38929 }
38931 tree clauses
38936 {
38939 {
38953 "%<#pragma omp target exit data%> with map-type other "
38954 "than %<from%>, %<release%> or %<delete%> on %<map%>"
38958 }
38960 }
38963 {
38966 "%<#pragma omp target exit data%> must contain at least "
38969 }
38976 }
38978 /* OpenMP 4.0:
38979 # pragma omp target update target-update-clause[optseq] new-line */
38981 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
38982 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
38983 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
38984 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
38985 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
38986 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
38987 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
38989 static bool
38992 {
38994 {
39000 }
39002 tree clauses
39007 {
39009 "%<#pragma omp target update%> must contain at least one "
39012 }
39020 }
39022 /* OpenMP 4.0:
39023 # pragma omp target target-clause[optseq] new-line
39024 structured-block */
39026 #define OMP_TARGET_CLAUSE_MASK \
39027 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
39028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
39029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
39030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
39031 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
39032 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
39033 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
39034 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
39035 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
39037 static bool
39040 {
39044 omp_requires_mask
39048 {
39060 {
39068 {
39069 tree stmt;
39071 {
39074 OMP_TARGET_CLAUSE_MASK,
39079 OMP_TARGET_CLAUSE_MASK,
39084 OMP_TARGET_CLAUSE_MASK,
39089 }
39091 }
39096 {
39100 if_p);
39105 if_p);
39110 if_p);
39114 }
39120 {
39121 /* For combined target teams, ensure the num_teams and
39122 thread_limit clause expressions are evaluated on the host,
39123 before entering the target construct. */
39124 tree c;
39130 {
39139 OMP_CLAUSE_FIRSTPRIVATE);
39144 }
39145 }
39155 }
39157 {
39160 }
39162 {
39166 }
39168 {
39172 }
39174 {
39178 }
39180 {
39183 }
39184 }
39186 {
39189 }
39204 check_clauses:
39206 {
39209 {
39223 "%<#pragma omp target%> with map-type other "
39224 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
39228 }
39230 }
39232 }
39234 /* OpenACC 2.0:
39235 # pragma acc cache (variable-list) new-line
39236 */
39238 static tree
39240 {
39255 }
39257 /* OpenACC 2.0:
39258 # pragma acc data oacc-data-clause[optseq] new-line
39259 structured-block */
39261 #define OACC_DATA_CLAUSE_MASK \
39262 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
39263 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
39264 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
39265 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
39266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
39267 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
39268 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
39270 static tree
39272 {
39285 }
39287 /* OpenACC 2.0:
39288 # pragma acc host_data <clauses> new-line
39289 structured-block */
39291 #define OACC_HOST_DATA_CLAUSE_MASK \
39292 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
39294 static tree
39296 {
39309 }
39311 /* OpenACC 2.0:
39312 # pragma acc declare oacc-data-clause[optseq] new-line
39313 */
39315 #define OACC_DECLARE_CLAUSE_MASK \
39316 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
39317 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
39318 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
39319 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
39320 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
39321 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
39322 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
39323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
39325 static tree
39327 {
39336 {
39340 }
39343 {
39347 {
39351 }
39354 {
39366 {
39368 "%qD must be a global variable in "
39370 decl);
39373 }
39378 {
39382 }
39384 {
39386 "invalid use of %<extern%> variable %qD "
39390 }
39392 {
39394 "invalid use of %<global%> variable %qD "
39398 }
39400 }
39405 {
39410 }
39413 {
39414 tree id;
39418 else
39424 {
39427 {
39430 {
39434 }
39435 }
39436 }
39437 }
39438 }
39451 }
39453 /* OpenACC 2.0:
39454 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
39456 or
39458 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
39460 LOC is the location of the #pragma token.
39461 */
39463 #define OACC_ENTER_DATA_CLAUSE_MASK \
39464 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
39465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
39466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
39467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
39468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
39470 #define OACC_EXIT_DATA_CLAUSE_MASK \
39471 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
39472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
39473 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
39474 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
39475 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
39476 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
39478 static tree
39481 {
39490 {
39495 }
39502 else
39507 {
39511 }
39519 }
39521 /* OpenACC 2.0:
39522 # pragma acc loop oacc-loop-clause[optseq] new-line
39523 structured-block */
39525 #define OACC_LOOP_CLAUSE_MASK \
39526 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
39527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
39528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
39529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
39530 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
39531 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
39532 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
39533 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
39534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
39535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
39537 static tree
39540 {
39549 {
39555 }
39564 }
39566 /* OpenACC 2.0:
39567 # pragma acc kernels oacc-kernels-clause[optseq] new-line
39568 structured-block
39570 or
39572 # pragma acc parallel oacc-parallel-clause[optseq] new-line
39573 structured-block
39574 */
39576 #define OACC_KERNELS_CLAUSE_MASK \
39577 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
39578 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
39579 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
39580 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
39581 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
39582 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
39583 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
39584 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
39585 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
39586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
39587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
39588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
39589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
39591 #define OACC_PARALLEL_CLAUSE_MASK \
39592 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
39593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
39594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
39595 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
39596 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
39597 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
39598 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
39599 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
39600 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
39601 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
39602 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
39603 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
39604 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
39605 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
39606 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
39607 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
39609 static tree
39612 {
39613 omp_clause_mask mask;
39616 {
39629 }
39632 {
39636 {
39639 tree clauses;
39644 }
39645 }
39654 }
39656 /* OpenACC 2.0:
39657 # pragma acc update oacc-update-clause[optseq] new-line
39658 */
39660 #define OACC_UPDATE_CLAUSE_MASK \
39661 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
39662 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
39663 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
39664 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
39665 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
39666 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
39668 static tree
39670 {
39677 {
39679 "%<#pragma acc update%> must contain at least one "
39682 }
39690 }
39692 /* OpenACC 2.0:
39693 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
39695 LOC is the location of the #pragma token.
39696 */
39698 #define OACC_WAIT_CLAUSE_MASK \
39699 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
39701 static tree
39703 {
39717 }
39719 /* OpenMP 4.0:
39720 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
39722 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
39723 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
39724 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
39725 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
39726 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
39727 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
39728 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
39730 static void
39733 {
39735 cp_omp_declare_simd_data data;
39737 {
39742 /* It is safe to take the address of a local variable; it will only be
39743 used while this scope is live. */
39745 }
39747 /* Store away all pragma tokens. */
39759 {
39763 {
39776 }
39781 "%<#pragma omp declare simd%> not immediately followed by "
39785 }
39786 }
39788 /* Finalize #pragma omp declare simd clauses after direct declarator has
39789 been parsed, and put that into "omp declare simd" attribute. */
39791 static tree
39793 {
39799 {
39803 }
39808 {
39826 }
39830 }
39833 /* OpenMP 4.0:
39834 # pragma omp declare target new-line
39835 declarations and definitions
39836 # pragma omp end declare target new-line
39838 OpenMP 4.5:
39839 # pragma omp declare target ( extended-list ) new-line
39841 # pragma omp declare target declare-target-clauses[seq] new-line */
39843 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
39844 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
39845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK) \
39846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE_TYPE))
39848 static void
39850 {
39855 clauses
39859 {
39861 clauses);
39864 }
39865 else
39866 {
39870 }
39875 {
39884 {
39887 }
39888 else
39891 {
39893 "%qD specified both in declare target %<link%> and %<to%>"
39896 }
39898 {
39905 {
39908 {
39912 }
39913 }
39914 }
39918 {
39922 {
39926 }
39927 }
39929 {
39933 {
39937 }
39938 }
39939 }
39943 }
39945 static void
39947 {
39950 {
39953 }
39955 {
39959 {
39962 }
39965 else
39966 {
39970 }
39971 }
39972 else
39973 {
39977 }
39981 "%<#pragma omp end declare target%> without corresponding "
39983 else
39985 }
39987 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
39988 expression and optional initializer clause of
39989 #pragma omp declare reduction. We store the expression(s) as
39990 either 3, 6 or 7 special statements inside of the artificial function's
39991 body. The first two statements are DECL_EXPRs for the artificial
39992 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
39993 expression that uses those variables.
39994 If there was any INITIALIZER clause, this is followed by further statements,
39995 the fourth and fifth statements are DECL_EXPRs for the artificial
39996 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
39997 constructor variant (first token after open paren is not omp_priv),
39998 then the sixth statement is a statement with the function call expression
39999 that uses the OMP_PRIV and optionally OMP_ORIG variable.
40000 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
40001 to initialize the OMP_PRIV artificial variable and there is seventh
40002 statement, a DECL_EXPR of the OMP_PRIV statement again. */
40004 static bool
40006 {
40018 tree combiner;
40033 {
40036 }
40039 {
40041 matching_parens parens;
40047 {
40050 }
40066 {
40070 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
40074 == CPP_CLOSE_PAREN
40077 {
40081 }
40086 }
40087 else
40088 {
40090 /* Don't create location wrapper nodes here. */
40091 auto_suppress_location_wrappers sentinel;
40106 {
40111 }
40113 tree arg;
40126 }
40137 }
40141 UNKNOWN_LOCATION);
40144 }
40146 /* OpenMP 4.0
40147 #pragma omp declare reduction (reduction-id : typename-list : expression) \
40148 initializer-clause[opt] new-line
40150 initializer-clause:
40151 initializer (omp_priv initializer)
40152 initializer (function-name (argument-list)) */
40154 static void
40157 {
40167 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
40174 {
40206 }
40218 /* Types may not be defined in declare reduction type list. */
40221 parser->type_definition_forbidden_message
40227 saved_colon_doesnt_start_class_def_p
40232 {
40236 ;
40254 else
40259 else
40261 }
40263 /* Restore the saved message. */
40266 parser->colon_doesnt_start_class_def_p
40271 {
40272 fail:
40275 }
40281 {
40282 tree fntype
40285 NULL_TREE);
40305 {
40310 }
40312 {
40314 {
40323 }
40330 }
40331 else
40332 {
40335 }
40338 else
40341 {
40344 }
40346 {
40349 else
40354 }
40359 else
40360 {
40369 }
40376 }
40380 done:
40381 /* Free any declarators allocated. */
40383 }
40385 /* OpenMP 4.0
40386 #pragma omp declare simd declare-simd-clauses[optseq] new-line
40387 #pragma omp declare reduction (reduction-id : typename-list : expression) \
40388 initializer-clause[opt] new-line
40389 #pragma omp declare target new-line */
40391 static bool
40394 {
40396 {
40401 {
40404 context);
40406 }
40409 {
40412 context);
40414 }
40416 {
40419 }
40421 {
40425 }
40426 }
40431 }
40433 /* OpenMP 5.0
40434 #pragma omp requires clauses[optseq] new-line */
40436 static bool
40438 {
40444 {
40451 {
40466 {
40469 matching_parens parens;
40471 {
40473 {
40478 this_req
40481 this_req
40484 this_req
40486 }
40488 {
40490 "expected %<seq_cst%>, %<relaxed%> or "
40493 CPP_CLOSE_PAREN))
40495 }
40496 else
40503 /*consume_paren=*/
40507 {
40510 }
40511 }
40513 }
40514 else
40515 {
40517 "%<unified_shared_memory%>, "
40518 "%<dynamic_allocators%>, "
40519 "%<reverse_offload%> "
40523 }
40530 {
40532 {
40539 }
40541 {
40545 }
40548 {
40551 this_req
40553 (omp_requires_mask
40555 }
40559 "lexically after first %<atomic%> construct "
40562 omp_requires_mask
40565 }
40566 }
40568 }
40574 }
40577 /* OpenMP 4.5:
40578 #pragma omp taskloop taskloop-clause[optseq] new-line
40579 for-loop
40581 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
40582 for-loop */
40584 #define OMP_TASKLOOP_CLAUSE_MASK \
40585 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
40586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
40587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
40588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
40589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
40590 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
40591 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
40592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
40593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
40594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
40595 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
40596 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
40597 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
40598 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
40599 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
40600 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
40602 static tree
40606 {
40613 /* #pragma omp parallel master taskloop{, simd} disallow in_reduction
40614 clause. */
40619 {
40624 {
40648 }
40649 }
40651 {
40654 }
40659 {
40662 }
40669 if_p);
40675 }
40678 /* OpenACC 2.0:
40679 # pragma acc routine oacc-routine-clause[optseq] new-line
40680 function-definition
40682 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
40683 */
40685 #define OACC_ROUTINE_CLAUSE_MASK \
40686 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
40687 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
40688 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
40689 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
40692 /* Parse the OpenACC routine pragma. This has an optional '( name )'
40693 component, which must resolve to a declared namespace-scope
40694 function. The clauses are either processed directly (for a named
40695 function), or defered until the immediatley following declaration
40696 is parsed. */
40698 static void
40701 {
40703 /* The checking for "another pragma following this one" in the "no optional
40704 '( name )'" case makes sure that we dont re-enter. */
40707 cp_oacc_routine_data data;
40713 /* It is safe to take the address of a local variable; it will only be
40714 used while this scope is live. */
40717 /* Look for optional '( name )'. */
40719 {
40720 matching_parens parens;
40723 /* We parse the name as an id-expression. If it resolves to
40724 anything other than a non-overloaded function at namespace
40725 scope, it's an error. */
40741 {
40745 }
40747 data.clauses
40751 /* The clauses are in reverse order; fix that to make later diagnostic
40752 emission easier. */
40758 {
40763 }
40765 /* Perhaps we should use the same rule as declarations in different
40766 namespaces? */
40768 {
40773 }
40776 {
40780 }
40784 }
40786 {
40787 /* Store away all pragma tokens. */
40798 /* Emit a helpful diagnostic if there's another pragma following this
40799 one. */
40801 {
40804 /* ..., and then just keep going. */
40806 }
40808 /* We only have to consider the pragma_external case here. */
40813 else
40816 }
40817 }
40819 /* Finalize #pragma acc routine clauses after direct declarator has
40820 been parsed. */
40822 static tree
40824 {
40829 {
40831 "%<#pragma acc routine%> not immediately followed by "
40834 }
40850 /* The clauses are in reverse order; fix that to make later diagnostic
40851 emission easier. */
40854 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
40855 fndecl_seen. */
40858 }
40860 /* Apply any saved OpenACC routine clauses to a just-parsed
40861 declaration. */
40863 static void
40865 {
40867 {
40868 /* Keep going if we're in error reporting mode. */
40874 {
40876 "%<#pragma acc routine%> not immediately followed by"
40880 }
40882 {
40885 }
40887 int compatible
40892 {
40895 }
40897 {
40898 }
40899 else
40900 {
40902 {
40911 }
40913 /* Set the routine's level of parallelism. */
40917 /* Add an "omp declare target" attribute. */
40922 }
40924 /* Don't unset parser->oacc_routine here: we may still need it to
40925 diagnose wrong usage. But, remember that we've used this "#pragma acc
40926 routine". */
40928 }
40929 }
40931 /* Main entry point to OpenMP statement pragmas. */
40933 static void
40935 {
40936 tree stmt;
40941 {
40964 if_p);
40969 if_p);
40986 if_p);
40991 if_p);
40996 if_p);
41001 if_p);
41006 if_p);
41015 if_p);
41029 if_p);
41034 if_p);
41038 }
41041 }
41042 \f
41043 /* Transactional Memory parsing routines. */
41045 /* Parse a transaction attribute.
41047 txn-attribute:
41048 attribute
41049 [ [ identifier ] ]
41051 We use this instead of cp_parser_attributes_opt for transactions to avoid
41052 the pedwarn in C++98 mode. */
41054 static tree
41056 {
41071 {
41075 /* For keywords, use the canonical spelling,
41076 not the parsed identifier. */
41080 }
41081 else
41085 error1:
41088 }
41090 /* Parse a __transaction_atomic or __transaction_relaxed statement.
41092 transaction-statement:
41093 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
41094 compound-statement
41095 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
41096 */
41098 static tree
41100 {
41111 else
41112 {
41116 }
41118 /* Parse a noexcept specification. */
41122 {
41123 /* cancel-and-throw is unimplemented. */
41126 }
41127 else
41134 /* Keep track if we're in the lexical scope of an outer transaction. */
41146 }
41148 /* Parse a __transaction_atomic or __transaction_relaxed expression.
41150 transaction-expression:
41151 __transaction_atomic txn-noexcept-spec[opt] ( expression )
41152 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
41153 */
41155 static tree
41157 {
41170 keyword == RID_TRANSACTION_RELAXED
41184 /* Set this early. This might mean that we allow transaction_cancel in
41185 an expression that we find out later actually has to be a constexpr.
41186 However, we expect that cxx_constant_value will be able to deal with
41187 this; also, if the noexcept has no constexpr, then what we parse next
41188 really is a transaction's body. */
41191 /* Parse a noexcept specification. */
41200 {
41201 matching_parens parens;
41208 }
41209 else
41210 {
41211 /* The only expression that is available got parsed for the noexcept
41212 already. noexcept is true then. */
41215 }
41224 }
41226 /* Parse a function-transaction-block.
41228 function-transaction-block:
41229 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
41230 function-body
41231 __transaction_atomic txn-attribute[opt] function-try-block
41232 __transaction_relaxed ctor-initializer[opt] function-body
41233 __transaction_relaxed function-try-block
41234 */
41236 static void
41238 {
41253 else
41254 {
41258 }
41266 else
41267 cp_parser_ctor_initializer_opt_and_function_body
41273 }
41275 /* Parse a __transaction_cancel statement.
41277 cancel-statement:
41278 __transaction_cancel txn-attribute[opt] ;
41279 __transaction_cancel txn-attribute[opt] throw-expression ;
41281 ??? Cancel and throw is not yet implemented. */
41283 static tree
41285 {
41291 RT_TRANSACTION_CANCEL);
41298 /* ??? Parse cancel-and-throw here. */
41303 {
41307 }
41309 {
41313 }
41315 {
41318 {
41324 }
41325 }
41327 {
41331 }
41337 }
41338 \f
41339 /* The parser. */
41343 \f
41344 /* Special handling for the first token or line in the file. The first
41345 thing in the file might be #pragma GCC pch_preprocess, which loads a
41346 PCH file, which is a GC collection point. So we need to handle this
41347 first pragma without benefit of an existing lexer structure.
41349 Always returns one token to the caller in *FIRST_TOKEN. This is
41350 either the true first token of the file, or the first token after
41351 the initial pragma. */
41353 static void
41355 {
41364 {
41371 }
41372 else
41375 /* Skip to the end of the pragma. */
41379 /* Now actually load the PCH file. */
41383 /* Read one more token to return to our caller. We have to do this
41384 after reading the PCH file in, since its pointers have to be
41385 live. */
41387 }
41389 /* Parse a pragma GCC ivdep. */
41391 static bool
41393 {
41396 }
41398 /* Parse a pragma GCC unroll. */
41400 static unsigned short
41402 {
41412 {
41414 " assignment-expression that evaluates to a non-negative"
41417 }
41418 else
41419 {
41423 }
41426 }
41428 /* Normal parsing of a pragma token. Here we can (and must) use the
41429 regular lexer. */
41431 static bool
41433 {
41436 tree stmt;
41447 {
41455 {
41465 }
41470 {
41480 }
41485 {
41495 }
41500 {
41511 }
41516 {
41527 }
41532 {
41543 }
41563 {
41568 }
41576 {
41581 }
41589 {
41593 }
41599 {
41604 }
41612 {
41617 }
41676 "%<#pragma omp scan%> may only be used in "
41682 "%<#pragma omp section%> may only be used in "
41687 {
41689 {
41693 }
41699 {
41703 }
41704 else
41710 {
41713 }
41716 }
41719 {
41721 {
41725 }
41726 const unsigned short unroll
41732 {
41736 }
41737 else
41743 {
41746 }
41749 }
41756 bad_stmt:
41759 }
41763 }
41765 /* The interface the pragma parsers have to the lexer. */
41767 enum cpp_ttype
41769 {
41781 else
41782 {
41786 }
41789 }
41791 \f
41792 /* External interface. */
41794 /* Parse one entire translation unit. */
41796 void
41798 {
41813 }
41815 /* Create an identifier for a generic parameter type (a synthesized
41816 template parameter implied by `auto' or a concept identifier). */
41819 static tree
41821 {
41825 }
41827 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
41828 (creating a new template parameter list if necessary). Returns the newly
41829 created template type parm. */
41831 static tree
41833 {
41836 /* Before committing to modifying any scope, if we're in an
41837 implicit template scope, and we're trying to synthesize a
41838 constrained parameter, try to find a previous parameter with
41839 the same name. This is the same-type rule for abbreviated
41840 function templates.
41842 NOTE: We can generate implicit parameters when tentatively
41843 parsing a nested name specifier, only to reject that parse
41844 later. However, matching the same template-id as part of a
41845 direct-declarator should generate an identical template
41846 parameter, so this rule will merge them. */
41848 {
41851 {
41853 {
41856 /* Return the TEMPLATE_PARM_INDEX. */
41859 }
41861 }
41862 }
41864 /* We are either continuing a function template that already contains implicit
41865 template parameters, creating a new fully-implicit function template, or
41866 extending an existing explicit function template with implicit template
41867 parameters. */
41875 {
41879 }
41880 else
41881 {
41882 /* Roll back to the existing template parameter scope (in the case of
41883 extending an explicit function template) or introduce a new template
41884 parameter scope ahead of the function parameter scope (or class scope
41885 in the case of out-of-line member definitions). The function scope is
41886 added back after template parameter synthesis below. */
41891 {
41894 }
41896 {
41897 /* If not defining a class, then any class scope is a scope level in
41898 an out-of-line member definition. In this case simply wind back
41899 beyond the first such scope to inject the template parameter list.
41900 Otherwise wind back to the class being defined. The latter can
41901 occur in class member friend declarations such as:
41903 class A {
41904 void foo (auto);
41905 };
41906 class B {
41907 friend void A::foo (auto);
41908 };
41910 The template parameter list synthesized for the friend declaration
41911 must be injected in the scope of 'B'. This can also occur in
41912 erroneous cases such as:
41914 struct A {
41915 struct B {
41916 void foo (auto);
41917 };
41918 void B::foo (auto) {}
41919 };
41921 Here the attempted definition of 'B::foo' within 'A' is ill-formed
41922 but, nevertheless, the template parameter list synthesized for the
41923 declarator should be injected into the scope of 'A' as if the
41924 ill-formed template was specified explicitly. */
41927 {
41930 }
41931 }
41937 {
41938 /* Introduce a new template parameter list for implicit template
41939 parameters. */
41943 parser->implicit_template_scope
41950 }
41951 else
41952 {
41953 /* Synthesize implicit template parameters at the end of the explicit
41954 template parameter list. */
41961 parser->implicit_template_parms
41963 }
41964 }
41966 /* Synthesize a new template parameter and track the current template
41967 parameter chain with implicit_template_parms. */
41971 tree synth_tmpl_parm;
41975 synth_tmpl_parm
41978 synth_tmpl_parm
41980 else
41981 {
41985 }
41987 // Attach the constraint to the parm before processing.
41990 tree new_parm
41992 input_location,
41993 node,
41997 // Chain the new parameter to the list of implicit parameters.
41999 parser->implicit_template_parms
42001 else
42006 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
42009 /* If creating a fully implicit function template, start the new implicit
42010 template parameter list with this synthesized type, otherwise grow the
42011 current template parameter list. */
42014 {
42021 }
42022 else
42023 {
42028 }
42030 // If the new parameter was constrained, we need to add that to the
42031 // constraints in the template parameter list.
42033 {
42037 }
42042 }
42044 /* Finish the declaration of a fully implicit function template. Such a
42045 template has no explicit template parameter list so has not been through the
42046 normal template head and tail processing. synthesize_implicit_template_parm
42047 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
42048 provided if the declaration is a class member such that its template
42049 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
42050 form is returned. Otherwise NULL_TREE is returned. */
42052 static tree
42054 {
42059 {
42063 }
42075 }
42077 /* Like finish_fully_implicit_template, but to be used in error
42078 recovery, rearranging scopes so that we restore the state we had
42079 before synthesize_implicit_template_parm inserted the implement
42080 template parms scope. */
42082 static void
42084 {
42089 {
42098 }
42099 else
42105 }
42107 /* Helper function for diagnostics that have complained about things
42108 being used with 'extern "C"' linkage.
42110 Attempt to issue a note showing where the 'extern "C"' linkage began. */
42112 void
42114 {
42118 }