| blob | 2533871fb28afaa1d9b01e87ba15ced832d6274a |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2018 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
48 \f
49 /* The lexer. */
51 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
52 and c-lex.c) and the C++ parser. */
55 {
57 };
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
116 };
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
128 };
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
184 };
186 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
187 reverting it on destruction. */
189 class type_id_in_expr_sentinel
190 {
200 };
202 /* Prototypes. */
208 static void cp_lexer_destroy
210 static int cp_lexer_saving_tokens
214 static void cp_lexer_get_preprocessor_token
222 static bool cp_lexer_next_token_is_not
224 static bool cp_lexer_next_token_is_keyword
228 static void cp_lexer_purge_token
230 static void cp_lexer_purge_tokens_after
232 static void cp_lexer_save_tokens
234 static void cp_lexer_commit_tokens
236 static void cp_lexer_rollback_tokens
238 static void cp_lexer_print_token
242 static void cp_lexer_start_debugging
244 static void cp_lexer_stop_debugging
250 static void cp_parser_initial_pragma
253 static bool cp_parser_omp_declare_reduction_exprs
255 static void cp_finalize_oacc_routine
258 /* Manifest constants. */
259 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
260 #define CP_SAVED_TOKEN_STACK 5
262 /* Variables. */
264 /* The stream to which debugging output should be written. */
267 /* Nonzero if we are parsing an unevaluated operand: an operand to
268 sizeof, typeof, or alignof. */
271 /* Dump up to NUM tokens in BUFFER to FILE starting with token
272 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
273 first token in BUFFER. If NUM is 0, dump all the tokens. If
274 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
275 highlighted by surrounding it in [[ ]]. */
277 static void
281 {
298 {
301 }
306 {
313 nprinted++;
323 {
333 }
334 }
337 {
340 }
343 }
346 /* Dump all tokens in BUFFER to stderr. */
348 void
350 {
352 }
354 DEBUG_FUNCTION void
356 {
358 }
360 DEBUG_FUNCTION void
362 {
365 else
367 }
370 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
371 description for T. */
373 static void
375 {
377 {
380 }
381 }
384 /* Dump parser context C to FILE. */
386 static void
388 {
393 }
396 /* Print the stack of parsing contexts to FILE starting with FIRST. */
398 static void
400 {
406 {
409 }
410 }
413 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
415 static void
417 {
420 }
423 /* Print an unparsed function entry UF to FILE. */
425 static void
427 {
430 tree fn;
435 i++)
436 {
442 }
447 {
450 }
456 {
459 }
461 }
464 /* Print the stack of unparsed member functions S to FILE. */
466 static void
469 {
475 {
478 }
479 }
482 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
483 the given PARSER. If FILE is NULL, the output is printed on stderr. */
485 static void
487 {
499 next_token);
500 }
503 /* Dump debugging information for the given PARSER. If FILE is NULL,
504 the output is printed on stderr. */
506 void
508 {
511 expanded_location eloc;
585 }
587 DEBUG_FUNCTION void
589 {
591 }
593 DEBUG_FUNCTION void
595 {
598 else
600 }
602 /* Allocate memory for a new lexer object and return it. */
606 {
611 /* Allocate the memory. */
614 /* Initially we are not debugging. */
619 /* Create the buffer. */
623 }
626 /* Create a new main C++ lexer, the lexer that gets tokens from the
627 preprocessor. */
631 {
633 cp_token token;
635 /* It's possible that parsing the first pragma will load a PCH file,
636 which is a GC collection point. So we have to do that before
637 allocating any memory. */
642 /* Put the first token in the buffer. */
645 /* Get the remaining tokens from the preprocessor. */
647 {
650 }
659 /* Subsequent preprocessor diagnostics should use compiler
660 diagnostic functions to get the compiler source location. */
665 }
667 /* Create a new lexer whose token stream is primed with the tokens in
668 CACHE. When these tokens are exhausted, no new tokens will be read. */
672 {
677 /* We do not own the buffer. */
684 /* Initially we are not debugging. */
689 }
691 /* Frees all resources associated with LEXER. */
693 static void
695 {
699 }
701 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
702 be used. The point of this flag is to help the compiler to fold away calls
703 to cp_lexer_debugging_p within this source file at compile time, when the
704 lexer is not being debugged. */
706 #define LEXER_DEBUGGING_ENABLED_P false
708 /* Returns nonzero if debugging information should be output. */
712 {
717 }
722 {
726 }
730 {
732 }
736 {
738 }
742 {
745 else
747 }
751 {
754 /* Skip past purged tokens. */
756 {
758 tp--;
759 }
762 }
764 /* nonzero if we are presently saving tokens. */
768 {
770 }
772 /* Store the next token from the preprocessor in *TOKEN. Return true
773 if we reach EOF. If LEXER is NULL, assume we are handling an
774 initial #pragma pch_preprocess, and thus want the lexer to return
775 processed strings. */
777 static void
779 {
782 /* Get a new token from the preprocessor. */
783 token->type
790 /* On some systems, some header files are surrounded by an
791 implicit extern "C" block. Set a flag in the token if it
792 comes from such a header. */
797 /* Check to see if this token is a keyword. */
799 {
801 {
802 /* Mark this token as a keyword. */
804 /* Record which keyword. */
806 }
807 else
808 {
812 {
813 /* Warn about the C++0x keyword (but still treat it as
814 an identifier). */
819 /* Clear out the C_RID_CODE so we don't warn about this
820 particular identifier-turned-keyword again. */
822 }
825 }
826 }
828 {
829 /* This only happens in Objective-C++; it must be a keyword. */
832 {
833 /* Replace 'class' with '@class', 'private' with '@private',
834 etc. This prevents confusion with the C++ keyword
835 'class', and makes the tokens consistent with other
836 Objective-C 'AT' keywords. For example '@class' is
837 reported as RID_AT_CLASS which is consistent with
838 '@synchronized', which is reported as
839 RID_AT_SYNCHRONIZED.
840 */
850 }
851 }
852 }
854 /* Update the globals input_location and the input file stack from TOKEN. */
857 {
859 {
861 }
862 }
864 /* Update the globals input_location and the input file stack from LEXER. */
867 {
870 }
872 /* Return a pointer to the next token in the token stream, but do not
873 consume it. */
877 {
879 {
883 }
885 }
887 /* Return true if the next token has the indicated TYPE. */
891 {
893 }
895 /* Return true if the next token does not have the indicated TYPE. */
899 {
901 }
903 /* Return true if the next token is the indicated KEYWORD. */
907 {
909 }
913 {
915 }
919 {
921 }
923 /* Return true if KEYWORD can start a decl-specifier. */
925 bool
927 {
929 {
930 /* auto specifier: storage-class-specifier in C++,
931 simple-type-specifier in C++0x. */
933 /* Storage classes. */
939 /* Elaborated type specifiers. */
945 /* Simple type specifiers. */
959 /* GNU extensions. */
962 /* C++0x extensions. */
974 }
975 }
977 /* Return true if the next token is a keyword for a decl-specifier. */
979 static bool
981 {
986 }
988 /* Returns TRUE iff the token T begins a decltype type. */
990 static bool
992 {
995 }
997 /* Returns TRUE iff the next token begins a decltype type. */
999 static bool
1001 {
1004 }
1006 /* Called when processing a token with tree_check_value; perform or defer the
1007 associated checks and return the value. */
1009 static tree
1011 {
1012 /* Perform any access checks that were deferred. */
1017 {
1023 }
1024 /* Return the stored value. */
1026 }
1028 /* Return a pointer to the Nth token in the token stream. If N is 1,
1029 then this is precisely equivalent to cp_lexer_peek_token (except
1030 that it is not inline). One would like to disallow that case, but
1031 there is one case (cp_parser_nth_token_starts_template_id) where
1032 the caller passes a variable for N and it might be 1. */
1036 {
1039 /* N is 1-based, not zero-based. */
1050 {
1053 {
1056 }
1060 }
1063 {
1066 }
1069 }
1071 /* Return the next token, and advance the lexer's next_token pointer
1072 to point to the next non-purged token. */
1076 {
1082 do
1083 {
1086 {
1089 }
1091 }
1096 /* Provide debugging output. */
1098 {
1102 }
1105 }
1107 /* Permanently remove the next token from the token stream, and
1108 advance the next_token pointer to refer to the next non-purged
1109 token. */
1111 static void
1113 {
1122 do
1123 {
1124 tok++;
1126 {
1129 }
1130 }
1133 }
1135 /* Permanently remove all tokens after TOK, up to, but not
1136 including, the token that will be returned next by
1137 cp_lexer_peek_token. */
1139 static void
1141 {
1150 {
1155 }
1156 }
1158 /* Begin saving tokens. All tokens consumed after this point will be
1159 preserved. */
1161 static void
1163 {
1164 /* Provide debugging output. */
1169 }
1171 /* Commit to the portion of the token stream most recently saved. */
1173 static void
1175 {
1176 /* Provide debugging output. */
1181 }
1183 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1184 to the token stream. Stop saving tokens. */
1186 static void
1188 {
1189 /* Provide debugging output. */
1194 }
1196 /* RAII wrapper around the above functions, with sanity checking. Creating
1197 a variable saves tokens, which are committed when the variable is
1198 destroyed unless they are explicitly rolled back by calling the rollback
1199 member function. */
1201 struct saved_token_sentinel
1202 {
1207 {
1210 }
1212 {
1215 }
1217 {
1221 }
1222 };
1224 /* Print a representation of the TOKEN on the STREAM. */
1226 static void
1228 {
1229 /* We don't use cpp_type2name here because the parser defines
1230 a few tokens of its own. */
1232 /* cpplib-defined token types */
1233 #define OP(e, s) #e,
1234 #define TK(e, s) #e,
1235 TTYPE_TABLE
1236 #undef OP
1237 #undef TK
1238 /* C++ parser token types - see "Manifest constants", above. */
1242 };
1244 /* For some tokens, print the associated data. */
1246 {
1248 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1249 For example, `struct' is mapped to an INTEGER_CST. */
1252 /* fall through */
1270 /* If we have a name for the token, print it out. Otherwise, we
1271 simply give the numeric code. */
1274 else
1277 }
1278 }
1280 DEBUG_FUNCTION void
1282 {
1285 }
1287 DEBUG_FUNCTION void
1289 {
1292 else
1294 }
1297 /* Start emitting debugging information. */
1299 static void
1301 {
1308 }
1310 /* Stop emitting debugging information. */
1312 static void
1314 {
1321 }
1323 /* Create a new cp_token_cache, representing a range of tokens. */
1327 {
1332 }
1334 /* Diagnose if #pragma omp declare simd isn't followed immediately
1335 by function declaration or definition. */
1339 {
1341 {
1345 }
1346 }
1348 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1349 and put that into "omp declare simd" attribute. */
1353 {
1355 {
1357 {
1360 }
1362 {
1365 }
1366 }
1367 }
1369 /* Diagnose if #pragma acc routine isn't followed immediately by function
1370 declaration or definition. */
1374 {
1376 {
1378 "%<#pragma acc routine%> not immediately followed by "
1381 }
1382 }
1383 \f
1384 /* Decl-specifiers. */
1386 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1388 static void
1390 {
1392 }
1394 /* Declarators. */
1396 /* Nothing other than the parser should be creating declarators;
1397 declarators are a semi-syntactic representation of C++ entities.
1398 Other parts of the front end that need to create entities (like
1399 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1402 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1412 /* An erroneous declarator. */
1415 /* The obstack on which declarators and related data structures are
1416 allocated. */
1419 /* Alloc BYTES from the declarator memory pool. */
1423 {
1425 }
1427 /* Allocate a declarator of the indicated KIND. Clear fields that are
1428 common to all declarators. */
1432 {
1445 }
1447 /* Make a declarator for a generalized identifier. If
1448 QUALIFYING_SCOPE is non-NULL, the identifier is
1449 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1450 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1451 is, if any. */
1455 special_function_kind sfk)
1456 {
1459 /* It is valid to write:
1461 class C { void f(); };
1462 typedef C D;
1463 void D::f();
1465 The standard is not clear about whether `typedef const C D' is
1466 legal; as of 2002-09-15 the committee is considering that
1467 question. EDG 3.0 allows that syntax. Therefore, we do as
1468 well. */
1482 }
1484 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1485 of modifiers such as const or volatile to apply to the pointer
1486 type, represented as identifiers. ATTRIBUTES represent the attributes that
1487 appertain to the pointer or reference. */
1489 cp_declarator *
1491 tree attributes)
1492 {
1500 {
1504 }
1505 else
1511 }
1513 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1514 represent the attributes that appertain to the pointer or
1515 reference. */
1517 cp_declarator *
1520 {
1528 {
1532 }
1533 else
1539 }
1541 /* Like make_pointer_declarator -- but for a pointer to a non-static
1542 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1543 appertain to the pointer or reference. */
1545 cp_declarator *
1548 tree attributes)
1549 {
1558 {
1561 }
1562 else
1568 }
1570 /* Make a declarator for the function given by TARGET, with the
1571 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1572 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1573 indicates what exceptions can be thrown. */
1575 cp_declarator *
1577 tree parms,
1578 cp_cv_quals cv_qualifiers,
1579 cp_virt_specifiers virt_specifiers,
1580 cp_ref_qualifier ref_qualifier,
1581 tree tx_qualifier,
1582 tree exception_specification,
1583 tree late_return_type,
1584 tree requires_clause)
1585 {
1599 {
1603 }
1604 else
1608 }
1610 /* Make a declarator for an array of BOUNDS elements, each of which is
1611 defined by ELEMENT. */
1613 cp_declarator *
1615 {
1622 {
1626 }
1627 else
1631 }
1633 /* Determine whether the declarator we've seen so far can be a
1634 parameter pack, when followed by an ellipsis. */
1635 static bool
1637 {
1639 /* We already saw an ellipsis. */
1642 /* Search for a declarator name, or any other declarator that goes
1643 after the point where the ellipsis could appear in a parameter
1644 pack. If we find any of these, then this declarator can not be
1645 made into a parameter pack. */
1648 {
1650 {
1663 }
1664 }
1667 }
1671 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1672 DECLARATOR and DEFAULT_ARGUMENT. */
1674 cp_parameter_declarator *
1677 tree default_argument,
1678 location_t loc,
1680 {
1688 else
1696 }
1698 /* Returns true iff DECLARATOR is a declaration for a function. */
1700 static bool
1702 {
1704 {
1713 }
1715 }
1717 /* The parser. */
1719 /* Overview
1720 --------
1722 A cp_parser parses the token stream as specified by the C++
1723 grammar. Its job is purely parsing, not semantic analysis. For
1724 example, the parser breaks the token stream into declarators,
1725 expressions, statements, and other similar syntactic constructs.
1726 It does not check that the types of the expressions on either side
1727 of an assignment-statement are compatible, or that a function is
1728 not declared with a parameter of type `void'.
1730 The parser invokes routines elsewhere in the compiler to perform
1731 semantic analysis and to build up the abstract syntax tree for the
1732 code processed.
1734 The parser (and the template instantiation code, which is, in a
1735 way, a close relative of parsing) are the only parts of the
1736 compiler that should be calling push_scope and pop_scope, or
1737 related functions. The parser (and template instantiation code)
1738 keeps track of what scope is presently active; everything else
1739 should simply honor that. (The code that generates static
1740 initializers may also need to set the scope, in order to check
1741 access control correctly when emitting the initializers.)
1743 Methodology
1744 -----------
1746 The parser is of the standard recursive-descent variety. Upcoming
1747 tokens in the token stream are examined in order to determine which
1748 production to use when parsing a non-terminal. Some C++ constructs
1749 require arbitrary look ahead to disambiguate. For example, it is
1750 impossible, in the general case, to tell whether a statement is an
1751 expression or declaration without scanning the entire statement.
1752 Therefore, the parser is capable of "parsing tentatively." When the
1753 parser is not sure what construct comes next, it enters this mode.
1754 Then, while we attempt to parse the construct, the parser queues up
1755 error messages, rather than issuing them immediately, and saves the
1756 tokens it consumes. If the construct is parsed successfully, the
1757 parser "commits", i.e., it issues any queued error messages and
1758 the tokens that were being preserved are permanently discarded.
1759 If, however, the construct is not parsed successfully, the parser
1760 rolls back its state completely so that it can resume parsing using
1761 a different alternative.
1763 Future Improvements
1764 -------------------
1766 The performance of the parser could probably be improved substantially.
1767 We could often eliminate the need to parse tentatively by looking ahead
1768 a little bit. In some places, this approach might not entirely eliminate
1769 the need to parse tentatively, but it might still speed up the average
1770 case. */
1772 /* Flags that are passed to some parsing functions. These values can
1773 be bitwise-ored together. */
1775 enum
1776 {
1777 /* No flags. */
1779 /* The construct is optional. If it is not present, then no error
1780 should be issued. */
1782 /* When parsing a type-specifier, treat user-defined type-names
1783 as non-type identifiers. */
1785 /* When parsing a type-specifier, do not try to parse a class-specifier
1786 or enum-specifier. */
1788 /* When parsing a decl-specifier-seq, only allow type-specifier or
1789 constexpr. */
1791 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1793 };
1795 /* This type is used for parameters and variables which hold
1796 combinations of the above flags. */
1799 /* The different kinds of declarators we want to parse. */
1801 enum cp_parser_declarator_kind
1802 {
1803 /* We want an abstract declarator. */
1804 CP_PARSER_DECLARATOR_ABSTRACT,
1805 /* We want a named declarator. */
1806 CP_PARSER_DECLARATOR_NAMED,
1807 /* We don't mind, but the name must be an unqualified-id. */
1808 CP_PARSER_DECLARATOR_EITHER
1809 };
1811 /* The precedence values used to parse binary expressions. The minimum value
1812 of PREC must be 1, because zero is reserved to quickly discriminate
1813 binary operators from other tokens. */
1815 enum cp_parser_prec
1816 {
1817 PREC_NOT_OPERATOR,
1818 PREC_LOGICAL_OR_EXPRESSION,
1819 PREC_LOGICAL_AND_EXPRESSION,
1820 PREC_INCLUSIVE_OR_EXPRESSION,
1821 PREC_EXCLUSIVE_OR_EXPRESSION,
1822 PREC_AND_EXPRESSION,
1823 PREC_EQUALITY_EXPRESSION,
1824 PREC_RELATIONAL_EXPRESSION,
1825 PREC_SHIFT_EXPRESSION,
1826 PREC_ADDITIVE_EXPRESSION,
1827 PREC_MULTIPLICATIVE_EXPRESSION,
1828 PREC_PM_EXPRESSION,
1829 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1830 };
1832 /* A mapping from a token type to a corresponding tree node type, with a
1833 precedence value. */
1835 struct cp_parser_binary_operations_map_node
1836 {
1837 /* The token type. */
1839 /* The corresponding tree code. */
1841 /* The precedence of this operator. */
1843 };
1845 struct cp_parser_expression_stack_entry
1846 {
1847 /* Left hand side of the binary operation we are currently
1848 parsing. */
1849 cp_expr lhs;
1850 /* Original tree code for left hand side, if it was a binary
1851 expression itself (used for -Wparentheses). */
1853 /* Tree code for the binary operation we are parsing. */
1855 /* Precedence of the binary operation we are parsing. */
1857 /* Location of the binary operation we are parsing. */
1858 location_t loc;
1859 };
1861 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1862 entries because precedence levels on the stack are monotonically
1863 increasing. */
1867 /* Prototypes. */
1869 /* Constructors and destructors. */
1874 /* Class variables. */
1878 /* The operator-precedence table used by cp_parser_binary_expression.
1879 Transformed into an associative array (binops_by_token) by
1880 cp_parser_new. */
1913 };
1915 /* The same as binops, but initialized by cp_parser_new so that
1916 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1917 for speed. */
1920 /* Constructors and destructors. */
1922 /* Construct a new context. The context below this one on the stack
1923 is given by NEXT. */
1927 {
1930 /* Allocate the storage. */
1932 {
1933 /* Pull the first entry from the free list. */
1937 }
1938 else
1941 /* No errors have occurred yet in this context. */
1943 /* If this is not the bottommost context, copy information that we
1944 need from the previous context. */
1946 {
1947 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1948 expression, then we are parsing one in this context, too. */
1950 /* Thread the stack. */
1952 }
1955 }
1957 /* Managing the unparsed function queues. */
1959 #define unparsed_funs_with_default_args \
1960 parser->unparsed_queues->last ().funs_with_default_args
1961 #define unparsed_funs_with_definitions \
1962 parser->unparsed_queues->last ().funs_with_definitions
1963 #define unparsed_nsdmis \
1964 parser->unparsed_queues->last ().nsdmis
1965 #define unparsed_classes \
1966 parser->unparsed_queues->last ().classes
1968 static void
1970 {
1973 }
1975 static void
1977 {
1980 }
1982 /* Prototypes. */
1984 /* Constructors and destructors. */
1989 /* Routines to parse various constructs.
1991 Those that return `tree' will return the error_mark_node (rather
1992 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1993 Sometimes, they will return an ordinary node if error-recovery was
1994 attempted, even though a parse error occurred. So, to check
1995 whether or not a parse error occurred, you should always use
1996 cp_parser_error_occurred. If the construct is optional (indicated
1997 either by an `_opt' in the name of the function that does the
1998 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1999 the construct is not present. */
2001 /* Lexical conventions [gram.lex] */
2003 static cp_expr cp_parser_identifier
2005 static cp_expr cp_parser_string_literal
2007 static cp_expr cp_parser_userdef_char_literal
2009 static tree cp_parser_userdef_string_literal
2011 static cp_expr cp_parser_userdef_numeric_literal
2014 /* Basic concepts [gram.basic] */
2018 /* Expressions [gram.expr] */
2020 static cp_expr cp_parser_primary_expression
2022 static cp_expr cp_parser_id_expression
2024 static cp_expr cp_parser_unqualified_id
2026 static tree cp_parser_nested_name_specifier_opt
2028 static tree cp_parser_nested_name_specifier
2030 static tree cp_parser_qualifying_entity
2032 static cp_expr cp_parser_postfix_expression
2034 static tree cp_parser_postfix_open_square_expression
2036 static tree cp_parser_postfix_dot_deref_expression
2041 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2043 static void cp_parser_pseudo_destructor_name
2045 static cp_expr cp_parser_unary_expression
2047 static enum tree_code cp_parser_unary_operator
2049 static tree cp_parser_new_expression
2053 static tree cp_parser_new_type_id
2061 static tree cp_parser_delete_expression
2063 static cp_expr cp_parser_cast_expression
2065 static cp_expr cp_parser_binary_expression
2067 static tree cp_parser_question_colon_clause
2069 static cp_expr cp_parser_assignment_expression
2071 static enum tree_code cp_parser_assignment_operator_opt
2073 static cp_expr cp_parser_expression
2075 static cp_expr cp_parser_constant_expression
2077 static cp_expr cp_parser_builtin_offsetof
2079 static cp_expr cp_parser_lambda_expression
2081 static void cp_parser_lambda_introducer
2083 static bool cp_parser_lambda_declarator_opt
2085 static void cp_parser_lambda_body
2088 /* Statements [gram.stmt.stmt] */
2090 static void cp_parser_statement
2092 static void cp_parser_label_for_labeled_statement
2094 static tree cp_parser_expression_statement
2096 static tree cp_parser_compound_statement
2098 static void cp_parser_statement_seq_opt
2100 static tree cp_parser_selection_statement
2102 static tree cp_parser_condition
2104 static tree cp_parser_iteration_statement
2106 static bool cp_parser_init_statement
2108 static tree cp_parser_for
2110 static tree cp_parser_c_for
2112 static tree cp_parser_range_for
2114 static void do_range_for_auto_deduction
2116 static tree cp_parser_perform_range_for_lookup
2118 static tree cp_parser_range_for_member_function
2120 static tree cp_parser_jump_statement
2122 static void cp_parser_declaration_statement
2125 static tree cp_parser_implicitly_scoped_statement
2127 static void cp_parser_already_scoped_statement
2130 /* Declarations [gram.dcl.dcl] */
2132 static void cp_parser_declaration_seq_opt
2134 static void cp_parser_declaration
2136 static void cp_parser_toplevel_declaration
2138 static void cp_parser_block_declaration
2140 static void cp_parser_simple_declaration
2142 static void cp_parser_decl_specifier_seq
2144 static tree cp_parser_storage_class_specifier_opt
2146 static tree cp_parser_function_specifier_opt
2148 static tree cp_parser_type_specifier
2151 static tree cp_parser_simple_type_specifier
2153 static tree cp_parser_type_name
2155 static tree cp_parser_type_name
2157 static tree cp_parser_nonclass_name
2159 static tree cp_parser_elaborated_type_specifier
2161 static tree cp_parser_enum_specifier
2163 static void cp_parser_enumerator_list
2165 static void cp_parser_enumerator_definition
2167 static tree cp_parser_namespace_name
2169 static void cp_parser_namespace_definition
2171 static void cp_parser_namespace_body
2173 static tree cp_parser_qualified_namespace_specifier
2175 static void cp_parser_namespace_alias_definition
2177 static bool cp_parser_using_declaration
2179 static void cp_parser_using_directive
2181 static tree cp_parser_alias_declaration
2183 static void cp_parser_asm_definition
2185 static void cp_parser_linkage_specification
2187 static void cp_parser_static_assert
2189 static tree cp_parser_decltype
2191 static tree cp_parser_decomposition_declaration
2194 /* Declarators [gram.dcl.decl] */
2196 static tree cp_parser_init_declarator
2203 static enum tree_code cp_parser_ptr_operator
2205 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2207 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2209 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2211 static tree cp_parser_tx_qualifier_opt
2213 static tree cp_parser_late_return_type_opt
2215 static tree cp_parser_declarator_id
2217 static tree cp_parser_type_id
2219 static tree cp_parser_template_type_arg
2222 static tree cp_parser_type_id_1
2224 static void cp_parser_type_specifier_seq
2226 static tree cp_parser_parameter_declaration_clause
2228 static tree cp_parser_parameter_declaration_list
2232 static tree cp_parser_default_argument
2234 static void cp_parser_function_body
2236 static tree cp_parser_initializer
2238 static cp_expr cp_parser_initializer_clause
2240 static cp_expr cp_parser_braced_list
2245 static void cp_parser_ctor_initializer_opt_and_function_body
2248 static tree cp_parser_late_parsing_omp_declare_simd
2251 static tree cp_parser_late_parsing_oacc_routine
2254 static tree synthesize_implicit_template_parm
2256 static tree finish_fully_implicit_template
2258 static void abort_fully_implicit_template
2261 /* Classes [gram.class] */
2263 static tree cp_parser_class_name
2265 static tree cp_parser_class_specifier
2267 static tree cp_parser_class_head
2269 static enum tag_types cp_parser_class_key
2271 static void cp_parser_type_parameter_key
2273 static void cp_parser_member_specification_opt
2275 static void cp_parser_member_declaration
2277 static tree cp_parser_pure_specifier
2279 static tree cp_parser_constant_initializer
2282 /* Derived classes [gram.class.derived] */
2284 static tree cp_parser_base_clause
2286 static tree cp_parser_base_specifier
2289 /* Special member functions [gram.special] */
2291 static tree cp_parser_conversion_function_id
2293 static tree cp_parser_conversion_type_id
2297 static void cp_parser_ctor_initializer_opt
2299 static void cp_parser_mem_initializer_list
2301 static tree cp_parser_mem_initializer
2303 static tree cp_parser_mem_initializer_id
2306 /* Overloading [gram.over] */
2308 static cp_expr cp_parser_operator_function_id
2310 static cp_expr cp_parser_operator
2313 /* Templates [gram.temp] */
2315 static void cp_parser_template_declaration
2317 static tree cp_parser_template_parameter_list
2319 static tree cp_parser_template_parameter
2321 static tree cp_parser_type_parameter
2323 static tree cp_parser_template_id
2325 static tree cp_parser_template_name
2327 static tree cp_parser_template_argument_list
2329 static tree cp_parser_template_argument
2331 static void cp_parser_explicit_instantiation
2333 static void cp_parser_explicit_specialization
2336 /* Exception handling [gram.exception] */
2338 static tree cp_parser_try_block
2340 static void cp_parser_function_try_block
2342 static void cp_parser_handler_seq
2344 static void cp_parser_handler
2346 static tree cp_parser_exception_declaration
2348 static tree cp_parser_throw_expression
2350 static tree cp_parser_exception_specification_opt
2352 static tree cp_parser_type_id_list
2355 /* GNU Extensions */
2357 static tree cp_parser_asm_specification_opt
2359 static tree cp_parser_asm_operand_list
2361 static tree cp_parser_asm_clobber_list
2363 static tree cp_parser_asm_label_list
2365 static bool cp_next_tokens_can_be_attribute_p
2367 static bool cp_next_tokens_can_be_gnu_attribute_p
2369 static bool cp_next_tokens_can_be_std_attribute_p
2371 static bool cp_nth_tokens_can_be_std_attribute_p
2373 static bool cp_nth_tokens_can_be_gnu_attribute_p
2375 static bool cp_nth_tokens_can_be_attribute_p
2377 static tree cp_parser_attributes_opt
2379 static tree cp_parser_gnu_attributes_opt
2381 static tree cp_parser_gnu_attribute_list
2383 static tree cp_parser_std_attribute
2385 static tree cp_parser_std_attribute_spec
2387 static tree cp_parser_std_attribute_spec_seq
2389 static size_t cp_parser_skip_attributes_opt
2391 static bool cp_parser_extension_opt
2393 static void cp_parser_label_declaration
2396 /* Concept Extensions */
2398 static tree cp_parser_requires_clause
2400 static tree cp_parser_requires_clause_opt
2402 static tree cp_parser_requires_expression
2404 static tree cp_parser_requirement_parameter_list
2406 static tree cp_parser_requirement_body
2408 static tree cp_parser_requirement_list
2410 static tree cp_parser_requirement
2412 static tree cp_parser_simple_requirement
2414 static tree cp_parser_compound_requirement
2416 static tree cp_parser_type_requirement
2418 static tree cp_parser_nested_requirement
2421 /* Transactional Memory Extensions */
2423 static tree cp_parser_transaction
2425 static tree cp_parser_transaction_expression
2427 static void cp_parser_function_transaction
2429 static tree cp_parser_transaction_cancel
2433 pragma_external,
2434 pragma_member,
2435 pragma_objc_icode,
2436 pragma_stmt,
2437 pragma_compound
2438 };
2439 static bool cp_parser_pragma
2442 /* Objective-C++ Productions */
2444 static tree cp_parser_objc_message_receiver
2446 static tree cp_parser_objc_message_args
2448 static tree cp_parser_objc_message_expression
2450 static cp_expr cp_parser_objc_encode_expression
2452 static tree cp_parser_objc_defs_expression
2454 static tree cp_parser_objc_protocol_expression
2456 static tree cp_parser_objc_selector_expression
2458 static cp_expr cp_parser_objc_expression
2460 static bool cp_parser_objc_selector_p
2462 static tree cp_parser_objc_selector
2464 static tree cp_parser_objc_protocol_refs_opt
2466 static void cp_parser_objc_declaration
2468 static tree cp_parser_objc_statement
2470 static bool cp_parser_objc_valid_prefix_attributes
2472 static void cp_parser_objc_at_property_declaration
2474 static void cp_parser_objc_at_synthesize_declaration
2476 static void cp_parser_objc_at_dynamic_declaration
2478 static tree cp_parser_objc_struct_declaration
2481 /* Utility Routines */
2483 static cp_expr cp_parser_lookup_name
2485 static tree cp_parser_lookup_name_simple
2487 static tree cp_parser_maybe_treat_template_as_class
2489 static bool cp_parser_check_declarator_template_parameters
2491 static bool cp_parser_check_template_parameters
2493 static cp_expr cp_parser_simple_cast_expression
2495 static tree cp_parser_global_scope_opt
2497 static bool cp_parser_constructor_declarator_p
2499 static tree cp_parser_function_definition_from_specifiers_and_declarator
2501 static tree cp_parser_function_definition_after_declarator
2503 static bool cp_parser_template_declaration_after_export
2505 static void cp_parser_perform_template_parameter_access_checks
2507 static tree cp_parser_single_declaration
2509 static cp_expr cp_parser_functional_cast
2511 static tree cp_parser_save_member_function_body
2513 static tree cp_parser_save_nsdmi
2515 static tree cp_parser_enclosed_template_argument_list
2517 static void cp_parser_save_default_args
2519 static void cp_parser_late_parsing_for_member
2521 static tree cp_parser_late_parse_one_default_arg
2523 static void cp_parser_late_parsing_nsdmi
2525 static void cp_parser_late_parsing_default_args
2527 static tree cp_parser_sizeof_operand
2529 static cp_expr cp_parser_trait_expr
2531 static bool cp_parser_declares_only_class_p
2533 static void cp_parser_set_storage_class
2535 static void cp_parser_set_decl_spec_type
2537 static void set_and_check_decl_spec_loc
2540 static bool cp_parser_friend_p
2542 static void cp_parser_required_error
2548 static bool cp_parser_token_starts_function_definition_p
2550 static bool cp_parser_next_token_starts_class_definition_p
2552 static bool cp_parser_next_token_ends_template_argument_p
2554 static bool cp_parser_nth_token_starts_template_argument_list_p
2556 static enum tag_types cp_parser_token_is_class_key
2558 static enum tag_types cp_parser_token_is_type_parameter_key
2560 static void cp_parser_check_class_key
2562 static void cp_parser_check_access_in_redeclaration
2564 static bool cp_parser_optional_template_keyword
2566 static void cp_parser_pre_parsed_nested_name_specifier
2568 static bool cp_parser_cache_group
2570 static tree cp_parser_cache_defarg
2572 static void cp_parser_parse_tentatively
2574 static void cp_parser_commit_to_tentative_parse
2576 static void cp_parser_commit_to_topmost_tentative_parse
2578 static void cp_parser_abort_tentative_parse
2580 static bool cp_parser_parse_definitely
2584 static bool cp_parser_uncommitted_to_tentative_parse_p
2586 static void cp_parser_error
2588 static void cp_parser_name_lookup_error
2590 static bool cp_parser_simulate_error
2592 static bool cp_parser_check_type_definition
2594 static void cp_parser_check_for_definition_in_return_type
2596 static void cp_parser_check_for_invalid_template_id
2598 static bool cp_parser_non_integral_constant_expression
2600 static void cp_parser_diagnose_invalid_type_name
2602 static bool cp_parser_parse_and_diagnose_invalid_type_name
2604 static int cp_parser_skip_to_closing_parenthesis
2606 static void cp_parser_skip_to_end_of_statement
2608 static void cp_parser_consume_semicolon_at_end_of_statement
2610 static void cp_parser_skip_to_end_of_block_or_statement
2612 static bool cp_parser_skip_to_closing_brace
2614 static void cp_parser_skip_to_end_of_template_parameter_list
2616 static void cp_parser_skip_to_pragma_eol
2618 static bool cp_parser_error_occurred
2620 static bool cp_parser_allow_gnu_extensions_p
2622 static bool cp_parser_is_pure_string_literal
2624 static bool cp_parser_is_string_literal
2626 static bool cp_parser_is_keyword
2628 static tree cp_parser_make_typename_type
2632 static bool cp_parser_compound_literal_p
2634 static bool cp_parser_array_designator_p
2636 static bool cp_parser_init_statement_p
2638 static bool cp_parser_skip_to_closing_square_bracket
2641 /* Concept-related syntactic transformations */
2646 // -------------------------------------------------------------------------- //
2647 // Unevaluated Operand Guard
2648 //
2649 // Implementation of an RAII helper for unevaluated operand parsing.
2651 {
2654 }
2657 {
2660 }
2662 // -------------------------------------------------------------------------- //
2663 // Tentative Parsing
2665 /* Returns nonzero if we are parsing tentatively. */
2669 {
2671 }
2673 /* Returns nonzero if TOKEN is a string literal. */
2675 static bool
2677 {
2683 }
2685 /* Returns nonzero if TOKEN is a string literal
2686 of a user-defined string literal. */
2688 static bool
2690 {
2697 }
2699 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2701 static bool
2703 {
2705 }
2707 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2708 PRAGMA_NONE. */
2710 static enum pragma_kind
2712 {
2715 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2717 }
2719 /* Helper function for cp_parser_error.
2720 Having peeked a token of kind TOK1_KIND that might signify
2721 a conflict marker, peek successor tokens to determine
2722 if we actually do have a conflict marker.
2723 Specifically, we consider a run of 7 '<', '=' or '>' characters
2724 at the start of a line as a conflict marker.
2725 These come through the lexer as three pairs and a single,
2726 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2727 If it returns true, *OUT_LOC is written to with the location/range
2728 of the marker. */
2730 static bool
2733 {
2744 /* It must be at the start of the line. */
2749 /* We have a conflict marker. Construct a location of the form:
2750 <<<<<<<
2751 ^~~~~~~
2752 with start == caret, finishing at the end of the marker. */
2757 }
2759 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2760 RT_CLOSE_PAREN. */
2764 {
2766 {
2774 }
2775 }
2777 /* Attempt to convert TOKEN_DESC from a required_token to an
2778 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2780 static enum cpp_ttype
2782 {
2784 {
2805 /* Use CPP_EOF as a "no completions possible" code. */
2807 }
2808 }
2811 /* Subroutine of cp_parser_error and cp_parser_required_error.
2813 Issue a diagnostic of the form
2814 FILE:LINE: MESSAGE before TOKEN
2815 where TOKEN is the next token in the input stream. MESSAGE
2816 (specified by the caller) is usually of the form "expected
2817 OTHER-TOKEN".
2819 This bypasses the check for tentative passing, and potentially
2820 adds material needed by cp_parser_required_error.
2822 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2823 suggesting insertion of the missing token.
2825 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2826 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2827 location. */
2829 static void
2831 required_token missing_token_desc,
2832 location_t matching_location)
2833 {
2835 /* This diagnostic makes more sense if it is tagged to the line
2836 of the token we just peeked at. */
2840 {
2845 }
2847 /* If this is actually a conflict marker, report it as such. */
2851 {
2852 location_t loc;
2854 {
2857 /* Consume tokens until the end of the source line. */
2859 {
2869 }
2871 }
2872 }
2879 {
2880 /* Potentially supply a fix-it hint, suggesting to add the
2881 missing token immediately after the *previous* token.
2882 This may move the primary location within richloc. */
2884 location_t prev_token_loc
2888 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2889 Attempt to consolidate diagnostics by printing it as a
2890 secondary range within the main diagnostic. */
2892 added_matching_location
2894 }
2896 /* Actually emit the error. */
2898 /* Because c_parser_error does not understand
2899 CPP_KEYWORD, keywords are treated like
2900 identifiers. */
2905 {
2906 /* If we weren't able to consolidate matching_location, then
2907 print it as a secondary diagnostic. */
2912 }
2913 }
2915 /* If not parsing tentatively, issue a diagnostic of the form
2916 FILE:LINE: MESSAGE before TOKEN
2917 where TOKEN is the next token in the input stream. MESSAGE
2918 (specified by the caller) is usually of the form "expected
2919 OTHER-TOKEN". */
2921 static void
2923 {
2926 }
2928 /* Issue an error about name-lookup failing. NAME is the
2929 IDENTIFIER_NODE DECL is the result of
2930 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2931 the thing that we hoped to find. */
2933 static void
2935 tree name,
2936 tree decl,
2937 name_lookup_error desired,
2938 location_t location)
2939 {
2940 /* If name lookup completely failed, tell the user that NAME was not
2941 declared. */
2943 {
2956 else
2958 }
2960 {
2962 {
2979 }
2980 }
2982 {
2984 {
2994 name);
2998 }
2999 }
3000 else
3001 {
3003 {
3016 }
3017 }
3018 }
3020 /* If we are parsing tentatively, remember that an error has occurred
3021 during this tentative parse. Returns true if the error was
3022 simulated; false if a message should be issued by the caller. */
3024 static bool
3026 {
3028 {
3031 }
3033 }
3035 /* This function is called when a type is defined. If type
3036 definitions are forbidden at this point, an error message is
3037 issued. */
3039 static bool
3041 {
3042 /* If types are forbidden here, issue a message. */
3044 {
3045 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3046 in the message need to be interpreted. */
3049 }
3051 }
3053 /* This function is called when the DECLARATOR is processed. The TYPE
3054 was a type defined in the decl-specifiers. If it is invalid to
3055 define a type in the decl-specifiers for DECLARATOR, an error is
3056 issued. TYPE_LOCATION is the location of TYPE and is used
3057 for error reporting. */
3059 static void
3062 {
3063 /* [dcl.fct] forbids type definitions in return types.
3064 Unfortunately, it's not easy to know whether or not we are
3065 processing a return type until after the fact. */
3073 {
3078 type);
3079 }
3080 }
3082 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3083 "<" in any valid C++ program. If the next token is indeed "<",
3084 issue a message warning the user about what appears to be an
3085 invalid attempt to form a template-id. LOCATION is the location
3086 of the type-specifier (TYPE) */
3088 static void
3090 tree type,
3092 location_t location)
3093 {
3097 {
3103 {
3106 else
3108 }
3109 else
3111 /* Remember the location of the invalid "<". */
3114 /* Consume the "<". */
3116 /* Parse the template arguments. */
3118 /* Permanently remove the invalid template arguments so that
3119 this error message is not issued again. */
3122 }
3123 }
3125 /* If parsing an integral constant-expression, issue an error message
3126 about the fact that THING appeared and return true. Otherwise,
3127 return false. In either case, set
3128 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3130 static bool
3132 non_integral_constant thing)
3133 {
3136 {
3138 {
3141 {
3144 "ISO C++ forbids using a floating-point literal "
3149 "enumeration type cannot appear in a "
3240 }
3244 }
3245 }
3247 }
3249 /* Emit a diagnostic for an invalid type name. This function commits
3250 to the current active tentative parse, if any. (Otherwise, the
3251 problematic construct might be encountered again later, resulting
3252 in duplicate error messages.) LOCATION is the location of ID. */
3254 static void
3256 location_t location)
3257 {
3260 /* Try to lookup the identifier. */
3267 /* If the lookup was ambiguous, an error will already have
3268 been issued. */
3270 /* If the lookup found a template-name, it means that the user forgot
3271 to specify an argument list. Emit a useful error message. */
3273 {
3274 auto_diagnostic_group d;
3277 decl);
3282 }
3286 /* Something like 'unsigned A a;' */
3289 {
3290 /* Issue an error message. */
3291 auto_diagnostic_group d;
3292 name_hint hint;
3296 {
3302 }
3303 else
3305 /* If we're in a template class, it's possible that the user was
3306 referring to a type from a base class. For example:
3308 template <typename T> struct A { typedef T X; };
3309 template <typename T> struct B : public A<T> { X x; };
3311 The user should have said "typename A<T>::X". */
3327 {
3328 tree b;
3331 b;
3333 {
3337 {
3338 tree field;
3339 /* Go from a particular instantiation of the
3340 template (which will have an empty TYPE_FIELDs),
3341 to the main version. */
3344 field;
3348 {
3353 }
3356 }
3357 }
3358 }
3359 }
3360 /* Here we diagnose qualified-ids where the scope is actually correct,
3361 but the identifier does not resolve to a valid type name. */
3363 {
3365 {
3366 auto_diagnostic_group d;
3375 else
3384 }
3387 {
3388 /* A<T>::A<T>() */
3389 auto_diagnostic_group d;
3395 }
3398 {
3403 "need %<typename%> before %<%T::%D::%E%> because "
3407 id,
3410 else
3414 }
3416 {
3417 auto_diagnostic_group d;
3429 else
3435 }
3436 else
3438 }
3439 }
3441 /* Check for a common situation where a type-name should be present,
3442 but is not, and issue a sensible error message. Returns true if an
3443 invalid type-name was detected.
3445 The situation handled by this function are variable declarations of the
3446 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3447 Usually, `ID' should name a type, but if we got here it means that it
3448 does not. We try to emit the best possible error message depending on
3449 how exactly the id-expression looks like. */
3451 static bool
3453 {
3454 tree id;
3457 /* Avoid duplicate error about ambiguous lookup. */
3459 {
3463 }
3472 /* If the next token is a (, this is a function with no explicit return
3473 type, i.e. constructor, destructor or conversion op. */
3476 {
3479 }
3483 /* Emit a diagnostic for the invalid type. */
3485 out:
3486 /* If we aren't in the middle of a declarator (i.e. in a
3487 parameter-declaration-clause), skip to the end of the declaration;
3488 there's no point in trying to process it. */
3492 }
3494 /* Consume tokens up to, and including, the next non-nested closing `)'.
3495 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3496 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3497 found an unnested token of that type. */
3499 static int
3502 cpp_ttype or_ttype,
3504 {
3515 {
3518 /* Have we found what we're looking for before the closing paren? */
3524 {
3527 /* If we've run out of tokens, then there is no closing `)'. */
3530 /* This is good for lambda expression capture-lists. */
3540 /* This matches the processing in skip_to_end_of_statement. */
3560 {
3564 }
3574 condop_depth--;
3579 }
3581 /* Consume the token. */
3583 }
3584 }
3586 /* Consume tokens up to, and including, the next non-nested closing `)'.
3587 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3588 are doing error recovery. Returns -1 if OR_COMMA is true and we
3589 found an unnested token of that type. */
3591 static int
3596 {
3600 }
3602 /* Consume tokens until we reach the end of the current statement.
3603 Normally, that will be just before consuming a `;'. However, if a
3604 non-nested `}' comes first, then we stop before consuming that. */
3606 static void
3608 {
3611 /* Unwind generic function template scope if necessary. */
3616 {
3620 {
3623 /* If we've run out of tokens, stop. */
3627 /* If the next token is a `;', we have reached the end of the
3628 statement. */
3634 /* If this is a non-nested '}', stop before consuming it.
3635 That way, when confronted with something like:
3637 { 3 + }
3639 we stop before consuming the closing '}', even though we
3640 have not yet reached a `;'. */
3644 /* If it is the closing '}' for a block that we have
3645 scanned, stop -- but only after consuming the token.
3646 That way given:
3648 void f g () { ... }
3649 typedef int I;
3651 we will stop after the body of the erroneously declared
3652 function, but before consuming the following `typedef'
3653 declaration. */
3655 {
3658 }
3667 }
3669 /* Consume the token. */
3671 }
3672 }
3674 /* This function is called at the end of a statement or declaration.
3675 If the next token is a semicolon, it is consumed; otherwise, error
3676 recovery is attempted. */
3678 static void
3680 {
3681 /* Look for the trailing `;'. */
3683 {
3684 /* If there is additional (erroneous) input, skip to the end of
3685 the statement. */
3687 /* If the next token is now a `;', consume it. */
3690 }
3691 }
3693 /* Skip tokens until we have consumed an entire block, or until we
3694 have consumed a non-nested `;'. */
3696 static void
3698 {
3701 /* Unwind generic function template scope if necessary. */
3706 {
3710 {
3713 /* If we've run out of tokens, stop. */
3717 /* Stop if this is an unnested ';'. */
3723 /* Stop if this is an unnested '}', or closes the outermost
3724 nesting level. */
3725 nesting_depth--;
3733 /* Nest. */
3734 nesting_depth++;
3739 }
3741 /* Consume the token. */
3743 }
3744 }
3746 /* Skip tokens until a non-nested closing curly brace is the next
3747 token, or there are no more tokens. Return true in the first case,
3748 false otherwise. */
3750 static bool
3752 {
3756 {
3760 {
3763 /* If we've run out of tokens, stop. */
3767 /* If the next token is a non-nested `}', then we have reached
3768 the end of the current block. */
3774 /* If it the next token is a `{', then we are entering a new
3775 block. Consume the entire block. */
3781 }
3783 /* Consume the token. */
3785 }
3786 }
3788 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3789 parameter is the PRAGMA token, allowing us to purge the entire pragma
3790 sequence. */
3792 static void
3794 {
3799 do
3803 /* Ensure that the pragma is not parsed again. */
3805 }
3807 /* Require pragma end of line, resyncing with it as necessary. The
3808 arguments are as for cp_parser_skip_to_pragma_eol. */
3810 static void
3812 {
3816 }
3818 /* This is a simple wrapper around make_typename_type. When the id is
3819 an unresolved identifier node, we can provide a superior diagnostic
3820 using cp_parser_diagnose_invalid_type_name. */
3822 static tree
3824 location_t id_location)
3825 {
3826 tree result;
3828 {
3834 }
3836 }
3838 /* This is a wrapper around the
3839 make_{pointer,ptrmem,reference}_declarator functions that decides
3840 which one to call based on the CODE and CLASS_TYPE arguments. The
3841 CODE argument should be one of the values returned by
3842 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3843 appertain to the pointer or reference. */
3847 cp_cv_quals cv_qualifiers,
3849 tree attributes)
3850 {
3857 else
3867 }
3869 /* Create a new C++ parser. */
3873 {
3878 /* cp_lexer_new_main is called before doing GC allocation because
3879 cp_lexer_new_main might load a PCH file. */
3882 /* Initialize the binops_by_token so that we can get the tree
3883 directly from the token. */
3891 /* For now, we always accept GNU extensions. */
3894 /* The `>' token is a greater-than operator, not the end of a
3895 template-id. */
3900 /* We are not parsing a constant-expression. */
3905 /* Local variable names are not forbidden. */
3908 /* We are not processing an `extern "C"' declaration. */
3911 /* We are not processing a declarator. */
3914 /* We are not processing a template-argument-list. */
3917 /* We are not in an iteration statement. */
3920 /* We are not in a switch statement. */
3923 /* We are not parsing a type-id inside an expression. */
3926 /* String literals should be translated to the execution character set. */
3929 /* We are not parsing a function body. */
3932 /* We can correct until told otherwise. */
3935 /* The unparsed function queue is empty. */
3938 /* There are no classes being defined. */
3941 /* No template parameters apply. */
3944 /* Special parsing data structures. */
3948 /* Not declaring an implicit function template. */
3954 /* Allow constrained-type-specifiers. */
3957 /* We haven't yet seen an 'extern "C"'. */
3961 }
3963 /* Create a cp_lexer structure which will emit the tokens in CACHE
3964 and push it onto the parser's lexer stack. This is used for delayed
3965 parsing of in-class method bodies and default arguments, and should
3966 not be confused with tentative parsing. */
3967 static void
3969 {
3974 /* Move the current source position to that of the first token in the
3975 new lexer. */
3977 }
3979 /* Pop the top lexer off the parser stack. This is never used for the
3980 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3981 static void
3983 {
3988 /* Put the current source position back where it was before this
3989 lexer was pushed. */
3991 }
3993 /* Lexical conventions [gram.lex] */
3995 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3996 identifier. */
3998 static cp_expr
4000 {
4003 /* Look for the identifier. */
4005 /* Return the value. */
4008 else
4010 }
4012 /* Parse a sequence of adjacent string constants. Returns a
4013 TREE_STRING representing the combined, nul-terminated string
4014 constant. If TRANSLATE is true, translate the string to the
4015 execution character set. If WIDE_OK is true, a wide string is
4016 invalid here.
4018 C++98 [lex.string] says that if a narrow string literal token is
4019 adjacent to a wide string literal token, the behavior is undefined.
4020 However, C99 6.4.5p4 says that this results in a wide string literal.
4021 We follow C99 here, for consistency with the C front end.
4023 This code is largely lifted from lex_string() in c-lex.c.
4025 FUTURE: ObjC++ will need to handle @-strings here. */
4026 static cp_expr
4029 {
4030 tree value;
4038 tree string_tree;
4044 {
4047 }
4052 {
4056 }
4057 else
4058 {
4061 }
4064 /* Try to avoid the overhead of creating and destroying an obstack
4065 for the common case of just one string. */
4068 {
4076 {
4080 }
4081 else
4085 }
4086 else
4087 {
4093 do
4094 {
4096 count++;
4101 {
4104 {
4107 }
4110 {
4115 }
4117 }
4118 else
4122 {
4126 {
4130 "unsupported non-standard concatenation "
4132 }
4133 }
4142 {
4146 }
4147 else
4148 {
4152 }
4153 }
4156 /* A string literal built by concatenation has its caret=start at
4157 the start of the initial string, and its finish at the finish of
4158 the final string literal. */
4162 }
4165 {
4168 }
4172 {
4176 {
4180 }
4183 {
4198 }
4203 {
4208 else
4210 }
4211 }
4212 else
4213 /* cpp_interpret_string has issued an error. */
4217 {
4220 }
4223 }
4225 /* Look up a literal operator with the name and the exact arguments. */
4227 static tree
4229 {
4230 tree decl;
4236 {
4242 {
4245 {
4255 }
4258 /* May be this should be sufficient_parms_p instead,
4259 depending on how exactly should user-defined literals
4260 work in presence of default arguments on the literal
4261 operator parameters. */
4264 }
4265 }
4268 }
4270 /* Parse a user-defined char constant. Returns a call to a user-defined
4271 literal operator taking the character as an argument. */
4273 static cp_expr
4275 {
4283 /* Build up a call to the user-defined operator */
4284 /* Lookup the name we got back from the id-expression. */
4289 {
4294 }
4298 }
4300 /* A subroutine of cp_parser_userdef_numeric_literal to
4301 create a char... template parameter pack from a string node. */
4303 static tree
4305 {
4306 tree charvec;
4312 /* Fill in CHARVEC with all of the parameters. */
4315 {
4324 }
4326 /* Build the argument packs. */
4332 }
4334 /* A subroutine of cp_parser_userdef_numeric_literal to
4335 create a char... template parameter pack from a string node. */
4337 static tree
4339 {
4340 tree charvec;
4351 /* First template parm is character type. */
4354 /* Fill in CHARVEC with all of the parameters. */
4361 /* Build the argument packs. */
4367 }
4369 /* Parse a user-defined numeric constant. returns a call to a user-defined
4370 literal operator. */
4372 static cp_expr
4374 {
4385 /* Look for a literal operator taking the exact type of numeric argument
4386 as the literal value. */
4391 {
4393 tf_warning_or_error);
4396 {
4399 long_long_unsigned_type_node);
4400 }
4401 else
4402 {
4406 long_double_type_node);
4410 }
4414 }
4417 /* If the numeric argument didn't work, look for a raw literal
4418 operator taking a const char* argument consisting of the number
4419 in string format. */
4424 {
4426 tf_warning_or_error);
4429 }
4432 /* If the raw literal didn't work, look for a non-type template
4433 function with parameter pack char.... Call the function with
4434 template parameter characters representing the number. */
4438 {
4441 {
4443 num_string);
4445 }
4448 tf_warning_or_error);
4451 }
4455 /* In C++14 the standard library defines complex number suffixes that
4456 conflict with GNU extensions. Prefer them if <complex> is #included. */
4466 {
4471 {
4472 /* No <complex>, so pedwarn and use GNU semantics. */
4475 }
4476 }
4478 bool complained
4485 {
4487 "(from <complex>) to enable the C++14 user-defined literal "
4492 }
4499 else
4500 {
4501 /* Use the built-in semantics. */
4502 tree type;
4504 {
4507 else
4509 }
4518 }
4521 /* Avoid repeated diagnostics. */
4524 }
4526 /* Parse a user-defined string constant. Returns a call to a user-defined
4527 literal operator taking a character pointer and the length of the string
4528 as arguments. */
4530 static tree
4532 {
4541 /* Build up a call to the user-defined operator. */
4542 /* Lookup the name we got back from the id-expression. */
4549 {
4551 tf_warning_or_error);
4554 }
4557 /* Look for a template function with typename parameter CharT
4558 and parameter pack CharT... Call the function with
4559 template parameter characters representing the string. */
4563 {
4567 tf_warning_or_error);
4570 }
4576 }
4579 /* Basic concepts [gram.basic] */
4581 /* Parse a translation-unit.
4583 translation-unit:
4584 declaration-seq [opt] */
4586 static void
4588 {
4591 /* Create the declarator obstack. */
4593 /* Create the error declarator. */
4595 /* Create the empty parameter list. */
4597 UNKNOWN_LOCATION);
4598 /* Remember where the base of the declarator obstack lies. */
4604 {
4607 /* If we're entering or exiting a region that's implicitly
4608 extern "C", modify the lang context appropriately. */
4611 {
4615 else
4617 }
4623 {
4626 /* If the next token is now a `;', consume it. */
4629 }
4630 else
4632 }
4634 /* Get rid of the token array; we don't need it any more. */
4638 /* The EOF should have reset this. */
4641 /* Make sure the declarator obstack was fully cleaned up. */
4644 }
4646 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4647 decltype context. */
4651 {
4656 }
4658 /* We're about to parse a collection of statements. If we're currently
4659 parsing tentatively, set up a firewall so that any nested
4660 cp_parser_commit_to_tentative_parse won't affect the current context. */
4662 static cp_token_position
4664 {
4671 }
4673 /* We've finished parsing the collection of statements. Wrap up the
4674 firewall and replace the relevant tokens with the parsed form. */
4676 static void
4678 tree expr)
4679 {
4683 /* Finish the firewall level. */
4685 /* And remember the result of the parse for when we try again. */
4691 }
4693 /* Like the above functions, but let the user modify the tokens. Used by
4694 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4695 later parses, so it makes sense to localize the effects of
4696 cp_parser_commit_to_tentative_parse. */
4698 struct tentative_firewall
4699 {
4704 {
4705 /* If we're currently parsing tentatively, start a committed level as a
4706 firewall and then an inner tentative parse. */
4708 {
4712 }
4713 }
4716 {
4718 {
4719 /* Finish the inner tentative parse and the firewall, propagating any
4720 uncommitted error state to the outer tentative parse. */
4726 }
4727 }
4728 };
4730 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4731 This class is for tracking such a matching pair of symbols.
4732 In particular, it tracks the location of the first token,
4733 so that if the second token is missing, we can highlight the
4734 location of the first token when notifying the user about the
4735 problem. */
4738 class token_pair
4739 {
4741 /* token_pair's ctor. */
4744 /* If the next token is the opening symbol for this pair, consume it and
4745 return true.
4746 Otherwise, issue an error and return false.
4747 In either case, record the location of the opening token. */
4750 {
4754 }
4756 /* Consume the next token from PARSER, recording its location as
4757 that of the opening token within the pair. */
4760 {
4765 }
4767 /* If the next token is the closing symbol for this pair, consume it
4768 and return it.
4769 Otherwise, issue an error, highlighting the location of the
4770 corresponding opening token, and return NULL. */
4773 {
4776 m_open_loc);
4777 }
4780 location_t m_open_loc;
4781 };
4783 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4785 struct matching_paren_traits
4786 {
4791 };
4793 /* "matching_parens" is a token_pair<T> class for tracking matching
4794 pairs of parentheses. */
4798 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4800 struct matching_brace_traits
4801 {
4806 };
4808 /* "matching_braces" is a token_pair<T> class for tracking matching
4809 pairs of braces. */
4814 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4815 enclosing parentheses. */
4817 static cp_expr
4819 {
4822 /* Consume the '('. */
4824 matching_parens parens;
4826 /* Start the statement-expression. */
4828 /* Parse the compound-statement. */
4830 /* Finish up. */
4832 /* Consume the ')'. */
4840 }
4842 /* Expressions [gram.expr] */
4844 /* Parse a fold-operator.
4846 fold-operator:
4847 - * / % ^ & | = < > << >>
4848 = -= *= /= %= ^= &= |= <<= >>=
4849 == != <= >= && || , .* ->*
4851 This returns the tree code corresponding to the matched operator
4852 as an int. When the current token matches a compound assignment
4853 opertor, the resulting tree code is the negative value of the
4854 non-assignment operator. */
4856 static int
4858 {
4860 {
4900 }
4901 }
4903 /* Returns true if CODE indicates a binary expression, which is not allowed in
4904 the LHS of a fold-expression. More codes will need to be added to use this
4905 function in other contexts. */
4907 static bool
4909 {
4911 {
4944 }
4945 }
4947 /* If the next token is a suitable fold operator, consume it and return as
4948 the function above. */
4950 static int
4952 {
4958 }
4960 /* Parse a fold-expression.
4962 fold-expression:
4963 ( ... folding-operator cast-expression)
4964 ( cast-expression folding-operator ... )
4965 ( cast-expression folding operator ... folding-operator cast-expression)
4967 Note that the '(' and ')' are matched in primary expression. */
4969 static cp_expr
4971 {
4972 cp_id_kind pidk;
4974 // Left fold.
4976 {
4980 {
4983 }
4990 }
4995 {
4998 }
5001 {
5004 }
5007 /* The operands of a fold-expression are cast-expressions, so binary or
5008 conditional expressions are not allowed. We check this here to avoid
5009 tentative parsing. */
5021 // Right fold.
5026 {
5029 }
5032 // Binary left or right fold.
5037 }
5039 /* Parse a primary-expression.
5041 primary-expression:
5042 literal
5043 this
5044 ( expression )
5045 id-expression
5046 lambda-expression (C++11)
5048 GNU Extensions:
5050 primary-expression:
5051 ( compound-statement )
5052 __builtin_va_arg ( assignment-expression , type-id )
5053 __builtin_offsetof ( type-id , offsetof-expression )
5055 C++ Extensions:
5056 __has_nothrow_assign ( type-id )
5057 __has_nothrow_constructor ( type-id )
5058 __has_nothrow_copy ( type-id )
5059 __has_trivial_assign ( type-id )
5060 __has_trivial_constructor ( type-id )
5061 __has_trivial_copy ( type-id )
5062 __has_trivial_destructor ( type-id )
5063 __has_virtual_destructor ( type-id )
5064 __is_abstract ( type-id )
5065 __is_base_of ( type-id , type-id )
5066 __is_class ( type-id )
5067 __is_empty ( type-id )
5068 __is_enum ( type-id )
5069 __is_final ( type-id )
5070 __is_literal_type ( type-id )
5071 __is_pod ( type-id )
5072 __is_polymorphic ( type-id )
5073 __is_std_layout ( type-id )
5074 __is_trivial ( type-id )
5075 __is_union ( type-id )
5077 Objective-C++ Extension:
5079 primary-expression:
5080 objc-expression
5082 literal:
5083 __null
5085 ADDRESS_P is true iff this expression was immediately preceded by
5086 "&" and therefore might denote a pointer-to-member. CAST_P is true
5087 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5088 true iff this expression is a template argument.
5090 Returns a representation of the expression. Upon return, *IDK
5091 indicates what kind of id-expression (if any) was present. */
5093 static cp_expr
5100 {
5103 /* Assume the primary expression is not an id-expression. */
5106 /* Peek at the next token. */
5109 {
5110 /* literal:
5111 integer-literal
5112 character-literal
5113 floating-literal
5114 string-literal
5115 boolean-literal
5116 pointer-literal
5117 user-defined-literal */
5129 {
5133 }
5134 /* Floating-point literals are only allowed in an integral
5135 constant expression if they are cast to an integral or
5136 enumeration type. */
5140 {
5141 /* CAST_P will be set even in invalid code like "int(2.7 +
5142 ...)". Therefore, we have to check that the next token
5143 is sure to end the cast. */
5145 {
5150 enumerator-definition. */
5152 /* The curly brace at the end of an enum-specifier. */
5154 /* The end of a statement. */
5156 /* The end of the cast-expression. */
5158 /* The end of an array bound. */
5160 /* The closing ">" in a template-argument-list. */
5163 /* C++0x only: A ">>" treated like two ">" tokens,
5164 in a template-argument-list. */
5169 }
5171 /* If we are within a cast, then the constraint that the
5172 cast is to an integral or enumeration type will be
5173 checked at that point. If we are not within a cast, then
5174 this code is invalid. */
5177 }
5197 /* ??? Should wide strings be allowed when parser->translate_strings_p
5198 is false (i.e. in attributes)? If not, we can kill the third
5199 argument to cp_parser_string_literal. */
5205 /* If we see `( { ' then we are looking at the beginning of
5206 a GNU statement-expression. */
5209 {
5210 /* Statement-expressions are not allowed by the standard. */
5214 /* And they're not allowed outside of a function-body; you
5215 cannot, for example, write:
5217 int i = ({ int j = 3; j + 1; });
5219 at class or namespace scope. */
5222 {
5224 "statement-expressions are not allowed outside "
5230 }
5231 else
5233 }
5234 /* Otherwise it's a normal parenthesized expression. */
5235 {
5236 cp_expr expr;
5241 /* Consume the `('. */
5242 matching_parens parens;
5244 /* Within a parenthesized expression, a `>' token is always
5245 the greater-than operator. */
5246 saved_greater_than_is_operator_p
5251 /* Left fold expression. */
5253 else
5254 /* Parse the parenthesized expression. */
5259 {
5266 }
5267 else
5268 /* Let the front end know that this expression was
5269 enclosed in parentheses. This matters in case, for
5270 example, the expression is of the form `A::B', since
5271 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5272 not. */
5275 /* DR 705: Wrapping an unqualified name in parentheses
5276 suppresses arg-dependent lookup. We want to pass back
5277 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5278 (c++/37862), but none of the others. */
5282 /* The `>' token might be the end of a template-id or
5283 template-parameter-list now. */
5284 parser->greater_than_is_operator_p
5287 /* Consume the `)'. */
5296 }
5299 {
5301 {
5302 /* We might have an Objective-C++ message. */
5305 /* If that works out, we're done ... */
5308 /* ... else, fall though to see if it's a lambda. */
5309 }
5311 /* Don't warn about a failed tentative parse. */
5316 }
5320 /* We have an Objective-C++ string literal. */
5327 {
5328 /* These two are the boolean literals. */
5336 /* The `__null' literal. */
5341 /* The `nullptr' literal. */
5346 /* Recognize the `this' keyword. */
5350 {
5354 }
5355 /* Pointers cannot appear in constant-expressions. */
5360 /* The `operator' keyword can be the beginning of an
5361 id-expression. */
5368 {
5369 non_integral_constant name;
5371 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5372 __func__ are the names of variables -- but they are
5373 treated specially. Therefore, they are handled here,
5374 rather than relying on the generic id-expression logic
5375 below. Grammatically, these names are id-expressions.
5377 Consume the token. */
5381 {
5393 }
5398 /* Look up the name. */
5400 }
5403 {
5404 tree expression;
5405 tree type;
5406 source_location type_location;
5407 location_t start_loc
5409 /* The `__builtin_va_arg' construct is used to handle
5410 `va_arg'. Consume the `__builtin_va_arg' token. */
5412 /* Look for the opening `('. */
5413 matching_parens parens;
5415 /* Now, parse the assignment-expression. */
5417 /* Look for the `,'. */
5420 /* Parse the type-id. */
5421 {
5424 }
5425 /* Look for the closing `)'. */
5426 location_t finish_loc
5429 /* Using `va_arg' in a constant-expression is not
5430 allowed. */
5432 NIC_VA_ARG))
5434 /* Construct a location of the form:
5435 __builtin_va_arg (v, int)
5436 ~~~~~~~~~~~~~~~~~~~~~^~~~
5437 with the caret at the type, ranging from the start of the
5438 "__builtin_va_arg" token to the close paren. */
5439 location_t combined_loc
5442 }
5477 // C++ concepts
5481 /* Objective-C++ expressions. */
5491 {
5496 }
5497 /* FALLTHRU */
5501 }
5503 /* An id-expression can start with either an identifier, a
5504 `::' as the beginning of a qualified-id, or the "operator"
5505 keyword. */
5510 {
5511 id_expression:
5512 cp_expr id_expression;
5513 cp_expr decl;
5519 /* Parse the id-expression. */
5520 id_expression
5537 /* If we have a template-id, then no further lookup is
5538 required. If the template-id was for a template-class, we
5539 will sometimes have a TYPE_DECL at this point. */
5543 /* Look up the name. */
5544 else
5545 {
5546 tree ambiguous_decls;
5548 /* If we already know that this lookup is ambiguous, then
5549 we've already issued an error message; there's no reason
5550 to check again. */
5553 {
5556 }
5559 none_type,
5560 template_p,
5565 /* If the lookup was ambiguous, an error will already have
5566 been issued. */
5570 /* In Objective-C++, we may have an Objective-C 2.0
5571 dot-syntax for classes here. */
5576 {
5577 tree component;
5584 component);
5585 /* Build a location of the form:
5586 expr.component
5587 ~~~~~^~~~~~~~~
5588 with caret at the start of the component name (at
5589 input_location), ranging from the start of the id_expression
5590 to the end of the component name. */
5591 location_t combined_loc
5596 }
5598 /* In Objective-C++, an instance variable (ivar) may be preferred
5599 to whatever cp_parser_lookup_name() found.
5600 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5601 rest of c-family, we have to do a little extra work to preserve
5602 any location information in cp_expr "decl". Given that
5603 objc_lookup_ivar is implemented in "c-family" and "objc", we
5604 have a trip through the pure "tree" type, rather than cp_expr.
5605 Naively copying it back to "decl" would implicitly give the
5606 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5607 store an EXPR_LOCATION. Hence we only update "decl" (and
5608 hence its location_t) if we get back a different tree node. */
5610 id_expression);
5614 /* If name lookup gives us a SCOPE_REF, then the
5615 qualifying scope was dependent. */
5617 {
5618 /* At this point, we do not know if DECL is a valid
5619 integral constant expression. We assume that it is
5620 in fact such an expression, so that code like:
5622 template <int N> struct A {
5623 int a[B<N>::i];
5624 };
5626 is accepted. At template-instantiation time, we
5627 will check that B<N>::i is actually a constant. */
5629 }
5630 /* Check to see if DECL is a local variable in a context
5631 where that is forbidden. */
5634 {
5639 }
5640 }
5644 /* It's too difficult to mark ths in all the places where
5645 we know for sure we need to keep the lookup, so do it
5646 now. The cost is extra GC to recycle the lookups
5647 resolved at parse time. */
5650 decl = (finish_id_expression
5652 idk,
5657 template_arg_p,
5664 }
5666 /* Anything else is an error. */
5670 }
5671 }
5679 {
5682 }
5684 /* Parse an id-expression.
5686 id-expression:
5687 unqualified-id
5688 qualified-id
5690 qualified-id:
5691 :: [opt] nested-name-specifier template [opt] unqualified-id
5692 :: identifier
5693 :: operator-function-id
5694 :: template-id
5696 Return a representation of the unqualified portion of the
5697 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5698 a `::' or nested-name-specifier.
5700 Often, if the id-expression was a qualified-id, the caller will
5701 want to make a SCOPE_REF to represent the qualified-id. This
5702 function does not do this in order to avoid wastefully creating
5703 SCOPE_REFs when they are not required.
5705 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5706 `template' keyword.
5708 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5709 uninstantiated templates.
5711 If *TEMPLATE_P is non-NULL, it is set to true iff the
5712 `template' keyword is used to explicitly indicate that the entity
5713 named is a template.
5715 If DECLARATOR_P is true, the id-expression is appearing as part of
5716 a declarator, rather than as part of an expression. */
5718 static cp_expr
5725 {
5729 /* Assume the `template' keyword was not used. */
5733 /* Look for the optional `::' operator. */
5734 global_scope_p
5735 = (!template_keyword_p
5740 /* Look for the optional nested-name-specifier. */
5741 nested_name_specifier_p
5744 check_dependency_p,
5746 declarator_p,
5747 template_keyword_p)
5750 /* If there is a nested-name-specifier, then we are looking at
5751 the first qualified-id production. */
5753 {
5754 tree saved_scope;
5755 tree saved_object_scope;
5756 tree saved_qualifying_scope;
5757 cp_expr unqualified_id;
5760 /* See if the next token is the `template' keyword. */
5764 /* Name lookup we do during the processing of the
5765 unqualified-id might obliterate SCOPE. */
5769 /* Process the final unqualified-id. */
5771 check_dependency_p,
5772 declarator_p,
5774 /* Restore the SAVED_SCOPE for our caller. */
5780 }
5781 /* Otherwise, if we are in global scope, then we are looking at one
5782 of the other qualified-id productions. */
5784 {
5786 tree id;
5788 /* Peek at the next token. */
5791 /* If it's an identifier, and the next token is not a "<", then
5792 we can avoid the template-id case. This is an optimization
5793 for this common case. */
5795 && !cp_parser_nth_token_starts_template_argument_list_p
5800 /* Try a template-id. */
5804 none_type,
5805 declarator_p);
5806 /* If that worked, we're done. */
5810 /* Peek at the next token. (Changes in the token buffer may
5811 have invalidated the pointer obtained above.) */
5815 {
5822 /* Fall through. */
5827 }
5828 }
5829 else
5832 declarator_p,
5833 optional_p);
5834 }
5836 /* Parse an unqualified-id.
5838 unqualified-id:
5839 identifier
5840 operator-function-id
5841 conversion-function-id
5842 ~ class-name
5843 template-id
5845 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5846 keyword, in a construct like `A::template ...'.
5848 Returns a representation of unqualified-id. For the `identifier'
5849 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5850 production a BIT_NOT_EXPR is returned; the operand of the
5851 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5852 other productions, see the documentation accompanying the
5853 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5854 names are looked up in uninstantiated templates. If DECLARATOR_P
5855 is true, the unqualified-id is appearing as part of a declarator,
5856 rather than as part of an expression. */
5858 static cp_expr
5864 {
5867 /* Peek at the next token. */
5871 {
5873 {
5874 tree id;
5876 /* We don't know yet whether or not this will be a
5877 template-id. */
5879 /* Try a template-id. */
5881 check_dependency_p,
5882 none_type,
5883 declarator_p);
5884 /* If it worked, we're done. */
5887 /* Otherwise, it's an ordinary identifier. */
5889 }
5893 check_dependency_p,
5894 none_type,
5895 declarator_p);
5898 {
5899 tree type_decl;
5900 tree qualifying_scope;
5901 tree object_scope;
5902 tree scope;
5905 /* Consume the `~' token. */
5907 /* Parse the class-name. The standard, as written, seems to
5908 say that:
5910 template <typename T> struct S { ~S (); };
5911 template <typename T> S<T>::~S() {}
5913 is invalid, since `~' must be followed by a class-name, but
5914 `S<T>' is dependent, and so not known to be a class.
5915 That's not right; we need to look in uninstantiated
5916 templates. A further complication arises from:
5918 template <typename T> void f(T t) {
5919 t.T::~T();
5920 }
5922 Here, it is not possible to look up `T' in the scope of `T'
5923 itself. We must look in both the current scope, and the
5924 scope of the containing complete expression.
5926 Yet another issue is:
5928 struct S {
5929 int S;
5930 ~S();
5931 };
5933 S::~S() {}
5935 The standard does not seem to say that the `S' in `~S'
5936 should refer to the type `S' and not the data member
5937 `S::S'. */
5939 /* DR 244 says that we look up the name after the "~" in the
5940 same scope as we looked up the qualifying name. That idea
5941 isn't fully worked out; it's more complicated than that. */
5946 /* Check for invalid scopes. */
5948 {
5952 }
5954 {
5958 scope);
5963 }
5966 /* If the name is of the form "X::~X" it's OK even if X is a
5967 typedef. */
5976 {
5979 }
5981 /* ~auto means the destructor of whatever the object is. */
5983 {
5986 "%<~auto%> only available with "
5990 }
5992 /* If there was an explicit qualification (S::~T), first look
5993 in the scope given by the qualification (i.e., S).
5995 Note: in the calls to cp_parser_class_name below we pass
5996 typename_type so that lookup finds the injected-class-name
5997 rather than the constructor. */
6001 {
6006 typename_type,
6009 declarator_p);
6012 }
6013 /* In "N::S::~S", look in "N" as well. */
6015 {
6020 type_decl
6024 typename_type,
6027 declarator_p);
6030 }
6031 /* In "p->S::~T", look in the scope given by "*p" as well. */
6033 {
6038 type_decl
6042 typename_type,
6045 declarator_p);
6048 }
6049 /* Look in the surrounding context. */
6051 {
6057 type_decl
6061 typename_type,
6064 declarator_p);
6067 {
6068 /* We couldn't find a type with this name. If we're parsing
6069 tentatively, fail and try something else. */
6071 {
6074 }
6075 /* Otherwise, accept it and check for a match at instantiation
6076 time. */
6081 }
6082 }
6083 /* If an error occurred, assume that the name of the
6084 destructor is the same as the name of the qualifying
6085 class. That allows us to keep parsing after running
6086 into ill-formed destructor names. */
6092 /* Check that destructor name and scope match. */
6094 {
6101 }
6103 /* [class.dtor]
6105 A typedef-name that names a class shall not be used as the
6106 identifier in the declarator for a destructor declaration. */
6113 type_decl);
6116 }
6120 {
6121 cp_expr id;
6123 /* This could be a template-id, so we try that first. */
6125 /* Try a template-id. */
6128 none_type,
6129 declarator_p);
6130 /* If that worked, we're done. */
6133 /* We still don't know whether we're looking at an
6134 operator-function-id or a conversion-function-id. */
6136 /* Try an operator-function-id. */
6138 /* If that didn't work, try a conversion-function-id. */
6143 }
6144 /* Fall through. */
6151 }
6152 }
6154 /* Parse an (optional) nested-name-specifier.
6156 nested-name-specifier: [C++98]
6157 class-or-namespace-name :: nested-name-specifier [opt]
6158 class-or-namespace-name :: template nested-name-specifier [opt]
6160 nested-name-specifier: [C++0x]
6161 type-name ::
6162 namespace-name ::
6163 nested-name-specifier identifier ::
6164 nested-name-specifier template [opt] simple-template-id ::
6166 PARSER->SCOPE should be set appropriately before this function is
6167 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6168 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6169 in name lookups.
6171 Sets PARSER->SCOPE to the class (TYPE) or namespace
6172 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6173 it unchanged if there is no nested-name-specifier. Returns the new
6174 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6176 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6177 part of a declaration and/or decl-specifier. */
6179 static tree
6186 {
6191 /* Remember where the nested-name-specifier starts. */
6193 {
6196 }
6199 {
6200 tree new_scope;
6201 tree old_scope;
6202 tree saved_qualifying_scope;
6204 /* Spot cases that cannot be the beginning of a
6205 nested-name-specifier. */
6208 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6209 the already parsed nested-name-specifier. */
6211 {
6212 /* Grab the nested-name-specifier and continue the loop. */
6214 /* If we originally encountered this nested-name-specifier
6215 with IS_DECLARATION set to false, we will not have
6216 resolved TYPENAME_TYPEs, so we must do so here. */
6219 {
6224 }
6227 }
6229 /* Spot cases that cannot be the beginning of a
6230 nested-name-specifier. On the second and subsequent times
6231 through the loop, we look for the `template' keyword. */
6233 ;
6234 /* A template-id can start a nested-name-specifier. */
6236 ;
6237 /* DR 743: decltype can be used in a nested-name-specifier. */
6239 ;
6240 else
6241 {
6242 /* If the next token is not an identifier, then it is
6243 definitely not a type-name or namespace-name. */
6246 /* If the following token is neither a `<' (to begin a
6247 template-id), nor a `::', then we are not looking at a
6248 nested-name-specifier. */
6254 {
6258 "found %<:%> in nested-name-specifier, "
6261 }
6264 && !cp_parser_nth_token_starts_template_argument_list_p
6267 }
6269 /* The nested-name-specifier is optional, so we parse
6270 tentatively. */
6273 /* Look for the optional `template' keyword, if this isn't the
6274 first time through the loop. */
6278 /* Save the old scope since the name lookup we are about to do
6279 might destroy it. */
6282 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6283 look up names in "X<T>::I" in order to determine that "Y" is
6284 a template. So, if we have a typename at this point, we make
6285 an effort to look through it. */
6287 && !typename_keyword_p
6292 /* Parse the qualifying entity. */
6293 new_scope
6295 typename_keyword_p,
6296 template_keyword_p,
6297 check_dependency_p,
6298 type_p,
6299 is_declaration);
6300 /* Look for the `::' token. */
6303 /* If we found what we wanted, we keep going; otherwise, we're
6304 done. */
6306 {
6309 /* Restore the OLD_SCOPE since it was valid before the
6310 failed attempt at finding the last
6311 class-or-namespace-name. */
6315 /* If the next token is a decltype, and the one after that is a
6316 `::', then the decltype has failed to resolve to a class or
6317 enumeration type. Give this error even when parsing
6318 tentatively since it can't possibly be valid--and we're going
6319 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6320 won't get another chance.*/
6324 {
6331 /* As below. */
6334 }
6338 {
6339 /* If we have a non-type template-id followed by ::, it can't
6340 possibly be valid. */
6345 {
6348 {
6354 }
6355 else
6356 {
6357 /* Variable template. */
6362 }
6369 /* As below. */
6373 }
6374 }
6378 /* If the next token is an identifier, and the one after
6379 that is a `::', then any valid interpretation would have
6380 found a class-or-namespace-name. */
6386 {
6389 {
6391 {
6392 tree decl;
6393 tree ambiguous_decls;
6396 none_type,
6405 decl);
6407 {
6408 // cp_parser_lookup_name has the same diagnostic,
6409 // thus make sure to emit it at most once.
6412 {
6417 }
6419 }
6420 else
6421 {
6423 cp_parser_name_lookup_error
6426 else
6427 cp_parser_name_lookup_error
6430 }
6431 }
6434 /* Treat this as a successful nested-name-specifier
6435 due to:
6437 [basic.lookup.qual]
6439 If the name found is not a class-name (clause
6440 _class_) or namespace-name (_namespace.def_), the
6441 program is ill-formed. */
6443 }
6445 }
6447 }
6448 /* We've found one valid nested-name-specifier. */
6450 /* Name lookup always gives us a DECL. */
6453 /* Uses of "template" must be followed by actual templates. */
6465 new_scope);
6466 /* If it is a class scope, try to complete it; we are about to
6467 be looking up names inside the class. */
6469 /* Since checking types for dependency can be expensive,
6470 avoid doing it if the type is already complete. */
6472 /* Do not try to complete dependent types. */
6474 {
6476 /* If it is a typedef to current class, use the current
6477 class instead, as the typedef won't have any names inside
6478 it yet. */
6482 }
6483 /* Make sure we look in the right scope the next time through
6484 the loop. */
6486 }
6488 /* If parsing tentatively, replace the sequence of tokens that makes
6489 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6490 token. That way, should we re-parse the token stream, we will
6491 not have to repeat the effort required to do the parse, nor will
6492 we issue duplicate error messages. */
6494 {
6498 /* Reset the contents of the START token. */
6500 /* Retrieve any deferred checks. Do not pop this access checks yet
6501 so the memory will not be reclaimed during token replacing below. */
6509 /* Purge all subsequent tokens. */
6511 }
6517 }
6519 /* Parse a nested-name-specifier. See
6520 cp_parser_nested_name_specifier_opt for details. This function
6521 behaves identically, except that it will an issue an error if no
6522 nested-name-specifier is present. */
6524 static tree
6530 {
6531 tree scope;
6533 /* Look for the nested-name-specifier. */
6535 typename_keyword_p,
6536 check_dependency_p,
6537 type_p,
6538 is_declaration);
6539 /* If it was not present, issue an error message. */
6541 {
6544 }
6547 }
6549 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6550 this is either a class-name or a namespace-name (which corresponds
6551 to the class-or-namespace-name production in the grammar). For
6552 C++0x, it can also be a type-name that refers to an enumeration
6553 type or a simple-template-id.
6555 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6556 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6557 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6558 TYPE_P is TRUE iff the next name should be taken as a class-name,
6559 even the same name is declared to be another entity in the same
6560 scope.
6562 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6563 specified by the class-or-namespace-name. If neither is found the
6564 ERROR_MARK_NODE is returned. */
6566 static tree
6573 {
6574 tree saved_scope;
6575 tree saved_qualifying_scope;
6576 tree saved_object_scope;
6577 tree scope;
6581 /* DR 743: decltype can appear in a nested-name-specifier. */
6583 {
6587 {
6590 }
6594 }
6596 /* Before we try to parse the class-name, we must save away the
6597 current PARSER->SCOPE since cp_parser_class_name will destroy
6598 it. */
6602 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6603 there is no need to look for a namespace-name. */
6604 only_class_p = template_keyword_p
6609 typename_keyword_p,
6610 template_keyword_p,
6612 check_dependency_p,
6614 is_declaration,
6617 /* If that didn't work, try for a namespace-name. */
6619 {
6620 /* Restore the saved scope. */
6624 /* If we are not looking at an identifier followed by the scope
6625 resolution operator, then this is not part of a
6626 nested-name-specifier. (Note that this function is only used
6627 to parse the components of a nested-name-specifier.) */
6632 }
6635 }
6637 /* Return true if we are looking at a compound-literal, false otherwise. */
6639 static bool
6641 {
6644 /* Skip tokens until the next token is a closing parenthesis.
6645 If we find the closing `)', and the next token is a `{', then
6646 we are looking at a compound-literal. */
6647 bool compound_literal_p
6652 /* Roll back the tokens we skipped. */
6656 }
6658 /* Return true if EXPR is the integer constant zero or a complex constant
6659 of zero, without any folding, but ignoring location wrappers. */
6661 bool
6663 {
6666 }
6668 /* Parse a postfix-expression.
6670 postfix-expression:
6671 primary-expression
6672 postfix-expression [ expression ]
6673 postfix-expression ( expression-list [opt] )
6674 simple-type-specifier ( expression-list [opt] )
6675 typename :: [opt] nested-name-specifier identifier
6676 ( expression-list [opt] )
6677 typename :: [opt] nested-name-specifier template [opt] template-id
6678 ( expression-list [opt] )
6679 postfix-expression . template [opt] id-expression
6680 postfix-expression -> template [opt] id-expression
6681 postfix-expression . pseudo-destructor-name
6682 postfix-expression -> pseudo-destructor-name
6683 postfix-expression ++
6684 postfix-expression --
6685 dynamic_cast < type-id > ( expression )
6686 static_cast < type-id > ( expression )
6687 reinterpret_cast < type-id > ( expression )
6688 const_cast < type-id > ( expression )
6689 typeid ( expression )
6690 typeid ( type-id )
6692 GNU Extension:
6694 postfix-expression:
6695 ( type-id ) { initializer-list , [opt] }
6697 This extension is a GNU version of the C99 compound-literal
6698 construct. (The C99 grammar uses `type-name' instead of `type-id',
6699 but they are essentially the same concept.)
6701 If ADDRESS_P is true, the postfix expression is the operand of the
6702 `&' operator. CAST_P is true if this expression is the target of a
6703 cast.
6705 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6706 class member access expressions [expr.ref].
6708 Returns a representation of the expression. */
6710 static cp_expr
6714 {
6716 location_t loc;
6722 /* Peek at the next token. */
6727 /* Some of the productions are determined by keywords. */
6730 {
6735 {
6736 tree type;
6737 cp_expr expression;
6741 /* All of these can be handled in the same way from the point
6742 of view of parsing. Begin by consuming the token
6743 identifying the cast. */
6746 /* New types cannot be defined in the cast. */
6748 parser->type_definition_forbidden_message
6751 /* Look for the opening `<'. */
6753 /* Parse the type to which we are casting. */
6758 /* Look for the closing `>'. */
6760 /* Restore the old message. */
6763 bool saved_greater_than_is_operator_p
6767 /* And the expression which is being cast. */
6768 matching_parens parens;
6772 RT_CLOSE_PAREN);
6776 parser->greater_than_is_operator_p
6779 /* Only type conversions to integral or enumeration types
6780 can be used in constant-expressions. */
6783 {
6786 }
6789 {
6791 postfix_expression
6795 postfix_expression
6799 postfix_expression
6801 tf_warning_or_error);
6804 postfix_expression
6809 }
6811 /* Construct a location e.g. :
6812 reinterpret_cast <int *> (expr)
6813 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6814 ranging from the start of the "*_cast" token to the final closing
6815 paren, with the caret at the start. */
6818 }
6822 {
6823 tree type;
6827 /* Consume the `typeid' token. */
6829 /* Look for the `(' token. */
6830 matching_parens parens;
6832 /* Types cannot be defined in a `typeid' expression. */
6834 parser->type_definition_forbidden_message
6836 /* We can't be sure yet whether we're looking at a type-id or an
6837 expression. */
6839 /* Try a type-id first. */
6844 /* Look for the `)' token. Otherwise, we can't be sure that
6845 we're not looking at an expression: consider `typeid (int
6846 (3))', for example. */
6848 /* If all went well, simply lookup the type-id. */
6851 /* Otherwise, fall back to the expression variant. */
6852 else
6853 {
6854 tree expression;
6856 /* Look for an expression. */
6858 /* Compute its typeid. */
6860 /* Look for the `)' token. */
6862 }
6863 /* Restore the saved message. */
6865 /* `typeid' may not appear in an integral constant expression. */
6869 /* Construct a location e.g. :
6870 typeid (expr)
6871 ^~~~~~~~~~~~~
6872 ranging from the start of the "typeid" token to the final closing
6873 paren, with the caret at the start. */
6875 {
6876 location_t typeid_loc
6880 }
6881 }
6885 {
6886 tree type;
6887 /* The syntax permitted here is the same permitted for an
6888 elaborated-type-specifier. */
6895 }
6901 {
6904 tree p;
6911 {
6914 }
6920 {
6923 postfix_expression
6925 else
6926 {
6930 }
6936 tf_warning_or_error);
6937 else
6938 {
6942 }
6947 postfix_expression
6951 postfix_expression
6954 else
6955 {
6959 }
6964 }
6966 }
6969 {
6970 tree type;
6972 /* If the next thing is a simple-type-specifier, we may be
6973 looking at a functional cast. We could also be looking at
6974 an id-expression. So, we try the functional cast, and if
6975 that doesn't work we fall back to the primary-expression. */
6977 /* Look for the simple-type-specifier. */
6981 CP_PARSER_FLAGS_NONE);
6983 /* Parse the cast itself. */
6985 postfix_expression
6987 /* If that worked, we're done. */
6991 /* If the functional-cast didn't work out, try a
6992 compound-literal. */
6995 {
7000 matching_parens parens;
7003 /* Avoid calling cp_parser_type_id pointlessly, see comment
7004 in cp_parser_cast_expression about c++/29234. */
7007 else
7008 {
7009 /* Parse the type. */
7015 }
7017 /* If things aren't going well, there's no need to
7018 keep going. */
7020 {
7022 /* Parse the brace-enclosed initializer list. */
7025 }
7026 /* If that worked, we're definitely looking at a
7027 compound-literal expression. */
7029 {
7030 /* Warn the user that a compound literal is not
7031 allowed in standard C++. */
7034 /* For simplicity, we disallow compound literals in
7035 constant-expressions. We could
7036 allow compound literals of integer type, whose
7037 initializer was a constant, in constant
7038 expressions. Permitting that usage, as a further
7039 extension, would not change the meaning of any
7040 currently accepted programs. (Of course, as
7041 compound literals are not part of ISO C++, the
7042 standard has nothing to say.) */
7044 NIC_NCC))
7045 {
7048 }
7049 /* Form the representation of the compound-literal. */
7050 postfix_expression
7055 }
7056 }
7058 /* It must be a primary-expression. */
7059 postfix_expression
7062 decltype_p,
7064 }
7066 }
7068 /* Note that we don't need to worry about calling build_cplus_new on a
7069 class-valued CALL_EXPR in decltype when it isn't the end of the
7070 postfix-expression; unary_complex_lvalue will take care of that for
7071 all these cases. */
7073 /* Keep looping until the postfix-expression is complete. */
7075 {
7079 /* It is not a Koenig lookup function call. */
7080 postfix_expression
7083 /* Peek at the next token. */
7087 {
7090 {
7092 "two consecutive %<[%> shall "
7095 }
7096 postfix_expression
7098 postfix_expression,
7100 decltype_p);
7109 /* postfix-expression ( expression-list [opt] ) */
7110 {
7121 is_builtin_constant_p
7124 {
7125 /* The whole point of __builtin_constant_p is to allow
7126 non-constant expressions to appear as arguments. */
7127 saved_integral_constant_expression_p
7129 saved_non_integral_constant_expression_p
7132 }
7133 args = (cp_parser_parenthesized_expression_list
7140 {
7141 parser->integral_constant_expression_p
7143 parser->non_integral_constant_expression_p
7145 }
7148 {
7151 }
7153 /* Function calls are not permitted in
7154 constant-expressions. */
7157 NIC_FUNC_CALL))
7158 {
7162 }
7167 {
7169 {
7171 {
7174 postfix_expression
7176 complain);
7177 }
7178 else
7179 postfix_expression
7181 }
7182 /* We do not perform argument-dependent lookup if
7183 normal lookup finds a non-function, in accordance
7184 with the expected resolution of DR 218. */
7187 {
7191 /* Do not do argument dependent lookup if regular
7192 lookup finds a member function or a block-scope
7193 function declaration. [basic.lookup.argdep]/3 */
7196 {
7199 postfix_expression
7201 complain);
7202 }
7203 }
7204 }
7207 {
7217 {
7219 postfix_expression
7223 }
7226 {
7227 postfix_expression
7228 = (build_new_method_call
7234 complain));
7235 }
7236 else
7237 postfix_expression
7241 complain);
7242 }
7246 postfix_expression = (build_offset_ref_call_from_tree
7248 complain));
7250 /* A call to a static class member, or a namespace-scope
7251 function. */
7252 postfix_expression
7255 koenig_p,
7256 complain);
7257 else
7258 /* All other function calls. */
7259 postfix_expression
7262 koenig_p,
7263 complain);
7266 {
7268 start_loc,
7269 close_paren_loc);
7271 }
7273 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7277 }
7282 /* postfix-expression . template [opt] id-expression
7283 postfix-expression . pseudo-destructor-name
7284 postfix-expression -> template [opt] id-expression
7285 postfix-expression -> pseudo-destructor-name */
7287 /* Consume the `.' or `->' operator. */
7290 postfix_expression
7292 postfix_expression,
7299 /* postfix-expression ++ */
7300 /* Consume the `++' token. */
7302 /* Generate a representation for the complete expression. */
7303 postfix_expression
7305 POSTINCREMENT_EXPR);
7306 /* Increments may not appear in constant-expressions. */
7314 /* postfix-expression -- */
7315 /* Consume the `--' token. */
7317 /* Generate a representation for the complete expression. */
7318 postfix_expression
7320 POSTDECREMENT_EXPR);
7321 /* Decrements may not appear in constant-expressions. */
7332 return is_member_access
7333 ? postfix_expression
7335 else
7337 }
7338 }
7340 /* We should never get here. */
7343 }
7345 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7346 by cp_parser_builtin_offsetof. We're looking for
7348 postfix-expression [ expression ]
7349 postfix-expression [ braced-init-list ] (C++11)
7351 FOR_OFFSETOF is set if we're being called in that context, which
7352 changes how we deal with integer constant expressions. */
7354 static tree
7356 tree postfix_expression,
7359 {
7364 /* Consume the `[' token. */
7370 /* Parse the index expression. */
7371 /* ??? For offsetof, there is a question of what to allow here. If
7372 offsetof is not being used in an integral constant expression context,
7373 then we *could* get the right answer by computing the value at runtime.
7374 If we are in an integral constant expression context, then we might
7375 could accept any constant expression; hard to say without analysis.
7376 Rather than open the barn door too wide right away, allow only integer
7377 constant expressions here. */
7380 else
7381 {
7383 {
7388 }
7389 else
7391 }
7395 /* Look for the closing `]'. */
7398 /* Build the ARRAY_REF. */
7402 /* When not doing offsetof, array references are not permitted in
7403 constant-expressions. */
7409 }
7411 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7412 dereference of incomplete type, returns true if error_mark_node should
7413 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7414 and *DEPENDENT_P. */
7416 bool
7419 {
7420 /* In a template, be permissive by treating an object expression
7421 of incomplete type as dependent (after a pedwarn). */
7422 diagnostic_t kind = (processing_template_decl
7426 {
7438 /* Don't emit any diagnostic for OVERLOADs. */
7442 /* Avoid clobbering e.g. DECLs. */
7446 }
7458 {
7461 }
7463 }
7465 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7466 by cp_parser_builtin_offsetof. We're looking for
7468 postfix-expression . template [opt] id-expression
7469 postfix-expression . pseudo-destructor-name
7470 postfix-expression -> template [opt] id-expression
7471 postfix-expression -> pseudo-destructor-name
7473 FOR_OFFSETOF is set if we're being called in that context. That sorta
7474 limits what of the above we'll actually accept, but nevermind.
7475 TOKEN_TYPE is the "." or "->" token, which will already have been
7476 removed from the stream. */
7478 static tree
7481 cp_expr postfix_expression,
7483 location_t location)
7484 {
7485 tree name;
7491 /* If this is a `->' operator, dereference the pointer. */
7494 tf_warning_or_error);
7495 /* Check to see whether or not the expression is type-dependent and
7496 not the current instantiation. */
7498 /* The identifier following the `->' or `.' is not qualified. */
7504 /* Enter the scope corresponding to the type of the object
7505 given by the POSTFIX_EXPRESSION. */
7507 {
7509 /* According to the standard, no expression should ever have
7510 reference type. Unfortunately, we do not currently match
7511 the standard in this respect in that our internal representation
7512 of an expression may have reference type even when the standard
7513 says it does not. Therefore, we have to manually obtain the
7514 underlying type here. */
7516 /* The type of the POSTFIX_EXPRESSION must be complete. */
7517 /* Unlike the object expression in other contexts, *this is not
7518 required to be of complete type for purposes of class member
7519 access (5.2.5) outside the member function body. */
7523 {
7529 }
7532 {
7533 /* Let the name lookup machinery know that we are processing a
7534 class member access expression. */
7536 /* If something went wrong, we want to be able to discern that case,
7537 as opposed to the case where there was no SCOPE due to the type
7538 of expression being dependent. */
7541 /* If the SCOPE was erroneous, make the various semantic analysis
7542 functions exit quickly -- and without issuing additional error
7543 messages. */
7546 }
7547 }
7550 /* Tell cp_parser_lookup_name that there was an object, even though it's
7551 type-dependent. */
7554 /* Assume this expression is not a pseudo-destructor access. */
7557 /* If the SCOPE is a scalar type, then, if this is a valid program,
7558 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7559 is type dependent, it can be pseudo-destructor-name or something else.
7560 Try to parse it as pseudo-destructor-name first. */
7562 {
7563 tree s;
7564 tree type;
7567 /* Parse the pseudo-destructor-name. */
7576 {
7578 postfix_expression
7581 }
7582 }
7585 {
7586 /* If the SCOPE is not a scalar type, we are looking at an
7587 ordinary class member access expression, rather than a
7588 pseudo-destructor-name. */
7591 /* Parse the id-expression. */
7592 name = (cp_parser_id_expression
7599 /* In general, build a SCOPE_REF if the member name is qualified.
7600 However, if the name was not dependent and has already been
7601 resolved; there is no need to build the SCOPE_REF. For example;
7603 struct X { void f(); };
7604 template <typename T> void f(T* t) { t->X::f(); }
7606 Even though "t" is dependent, "X::f" is not and has been resolved
7607 to a BASELINK; there is no need to include scope information. */
7609 /* But we do need to remember that there was an explicit scope for
7610 virtual function calls. */
7614 /* If the name is a template-id that names a type, we will get a
7615 TYPE_DECL here. That is invalid code. */
7617 {
7620 }
7621 else
7622 {
7624 {
7626 {
7630 }
7631 else
7634 name,
7635 template_p);
7639 }
7641 adjust_result_of_qualified_name_lookup
7643 postfix_expression
7645 template_p,
7646 tf_warning_or_error);
7647 /* Build a location e.g.:
7648 ptr->access_expr
7649 ~~~^~~~~~~~~~~~~
7650 where the caret is at the deref token, ranging from
7651 the start of postfix_expression to the end of the access expr. */
7652 location_t end_loc
7654 location_t combined_loc
7657 }
7658 }
7660 /* We no longer need to look up names in the scope of the object on
7661 the left-hand side of the `.' or `->' operator. */
7664 /* Outside of offsetof, these operators may not appear in
7665 constant-expressions. */
7667 && (cp_parser_non_integral_constant_expression
7672 }
7674 /* Parse a parenthesized expression-list.
7676 expression-list:
7677 assignment-expression
7678 expression-list, assignment-expression
7680 attribute-list:
7681 expression-list
7682 identifier
7683 identifier, expression-list
7685 CAST_P is true if this expression is the target of a cast.
7687 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7688 argument pack.
7690 WRAP_LOCATIONS_P is true if expressions within this list for which
7691 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7692 their source locations.
7694 Returns a vector of trees. Each element is a representation of an
7695 assignment-expression. NULL is returned if the ( and or ) are
7696 missing. An empty, but allocated, vector is returned on no
7697 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7698 if we are parsing an attribute list for an attribute that wants a
7699 plain identifier argument, normal_attr for an attribute that wants
7700 an expression, or non_attr if we aren't parsing an attribute list. If
7701 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7702 not all of the expressions in the list were constant.
7703 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7704 will be written to with the location of the closing parenthesis. If
7705 an error occurs, it may or may not be written to. */
7715 {
7721 /* Assume all the expressions will be constant. */
7725 matching_parens parens;
7731 /* Within a parenthesized expression, a `>' token is always
7732 the greater-than operator. */
7733 saved_greater_than_is_operator_p
7739 /* Consume expressions until there are no more. */
7742 {
7743 /* At the beginning of attribute lists, check to see if the
7744 next token is an identifier. */
7747 {
7750 /* Consume the identifier. */
7752 /* Save the identifier. */
7754 }
7755 else
7756 {
7759 /* Parse the next assignment-expression. */
7761 {
7762 /* A braced-init-list. */
7768 }
7770 {
7771 expr = (cp_parser_constant_expression
7776 }
7777 else
7779 cast_p);
7784 /* If we have an ellipsis, then this is an expression
7785 expansion. */
7788 {
7789 /* Consume the `...'. */
7792 /* Build the argument pack. */
7794 }
7799 /* Add it to the list. We add error_mark_node
7800 expressions to the list, so that we can still tell if
7801 the correct form for a parenthesized expression-list
7802 is found. That gives better errors. */
7807 }
7809 /* After the first item, attribute lists look the same as
7810 expression lists. */
7813 get_comma:;
7814 /* If the next token isn't a `,', then we are done. */
7818 /* Otherwise, consume the `,' and keep going. */
7820 }
7826 {
7829 skip_comma:;
7830 /* We try and resync to an unnested comma, as that will give the
7831 user better diagnostics. */
7839 {
7840 parser->greater_than_is_operator_p
7843 }
7844 }
7846 parser->greater_than_is_operator_p
7853 }
7855 /* Parse a pseudo-destructor-name.
7857 pseudo-destructor-name:
7858 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7859 :: [opt] nested-name-specifier template template-id :: ~ type-name
7860 :: [opt] nested-name-specifier [opt] ~ type-name
7862 If either of the first two productions is used, sets *SCOPE to the
7863 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7864 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7865 or ERROR_MARK_NODE if the parse fails. */
7867 static void
7869 tree object,
7872 {
7875 /* Handle ~auto. */
7879 {
7882 "%<~auto%> only available with "
7889 }
7891 /* Assume that things will not work out. */
7894 /* Look for the optional `::' operator. */
7896 /* Look for the optional nested-name-specifier. */
7897 nested_name_specifier_p
7904 /* Now, if we saw a nested-name-specifier, we might be doing the
7905 second production. */
7908 {
7909 /* Consume the `template' keyword. */
7911 /* Parse the template-id. */
7915 class_type,
7917 /* Look for the `::' token. */
7919 }
7920 /* If the next token is not a `~', then there might be some
7921 additional qualification. */
7923 {
7924 /* At this point, we're looking for "type-name :: ~". The type-name
7925 must not be a class-name, since this is a pseudo-destructor. So,
7926 it must be either an enum-name, or a typedef-name -- both of which
7927 are just identifiers. So, we peek ahead to check that the "::"
7928 and "~" tokens are present; if they are not, then we can avoid
7929 calling type_name. */
7933 {
7936 }
7938 /* Look for the type-name. */
7943 /* Look for the `::' token. */
7945 }
7946 else
7949 /* Look for the `~'. */
7952 /* Once we see the ~, this has to be a pseudo-destructor. */
7956 /* Look for the type-name again. We are not responsible for
7957 checking that it matches the first type-name. */
7959 }
7961 /* Parse a unary-expression.
7963 unary-expression:
7964 postfix-expression
7965 ++ cast-expression
7966 -- cast-expression
7967 unary-operator cast-expression
7968 sizeof unary-expression
7969 sizeof ( type-id )
7970 alignof ( type-id ) [C++0x]
7971 new-expression
7972 delete-expression
7974 GNU Extensions:
7976 unary-expression:
7977 __extension__ cast-expression
7978 __alignof__ unary-expression
7979 __alignof__ ( type-id )
7980 alignof unary-expression [C++0x]
7981 __real__ cast-expression
7982 __imag__ cast-expression
7983 && identifier
7984 sizeof ( type-id ) { initializer-list , [opt] }
7985 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7986 __alignof__ ( type-id ) { initializer-list , [opt] }
7988 ADDRESS_P is true iff the unary-expression is appearing as the
7989 operand of the `&' operator. CAST_P is true if this expression is
7990 the target of a cast.
7992 Returns a representation of the expression. */
7994 static cp_expr
7997 {
8001 /* Peek at the next token. */
8003 /* Some keywords give away the kind of expression. */
8005 {
8009 {
8012 {
8020 /* Consume the token. */
8022 /* Parse the operand. */
8028 else
8029 {
8030 /* ISO C++ defines alignof only with types, not with
8031 expressions. So pedwarn if alignof is used with a non-
8032 type expression. However, __alignof__ is ok. */
8035 "ISO C++ does not allow %<alignof%> "
8039 }
8040 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8041 SIZEOF_EXPR with the original operand. */
8043 {
8045 {
8047 {
8050 error_mark_node));
8052 }
8053 else
8057 }
8058 }
8060 /* Construct a location e.g. :
8061 alignof (expr)
8062 ^~~~~~~~~~~~~~
8063 with start == caret at the start of the "alignof"/"sizeof"
8064 token, with the endpoint at the final closing paren. */
8065 location_t finish_loc
8067 location_t compound_loc
8074 }
8083 {
8084 /* The saved value of the PEDANTIC flag. */
8086 tree expr;
8088 /* Save away the PEDANTIC flag. */
8090 /* Parse the cast-expression. */
8092 /* Restore the PEDANTIC flag. */
8096 }
8100 {
8101 tree expression;
8103 /* Consume the `__real__' or `__imag__' token. */
8105 /* Parse the cast-expression. */
8107 /* Create the complete representation. */
8111 expression,
8112 tf_warning_or_error);
8113 }
8121 {
8122 tree expr;
8131 matching_parens parens;
8135 parser->type_definition_forbidden_message
8138 saved_integral_constant_expression_p
8140 saved_non_integral_constant_expression_p
8144 saved_greater_than_is_operator_p
8156 parser->greater_than_is_operator_p
8159 parser->integral_constant_expression_p
8161 parser->non_integral_constant_expression_p
8166 location_t finish_loc
8170 /* Construct a location of the form:
8171 noexcept (expr)
8172 ^~~~~~~~~~~~~~~
8173 with start == caret, finishing at the close-paren. */
8174 location_t noexcept_loc
8178 noexcept_loc);
8179 }
8183 }
8184 }
8186 /* Look for the `:: new' and `:: delete', which also signal the
8187 beginning of a new-expression, or delete-expression,
8188 respectively. If the next token is `::', then it might be one of
8189 these. */
8191 {
8194 /* See if the token after the `::' is one of the keywords in
8195 which we're interested. */
8197 /* If it's `new', we have a new-expression. */
8200 /* Similarly, for `delete'. */
8203 }
8205 /* Look for a unary operator. */
8207 /* The `++' and `--' operators can be handled similarly, even though
8208 they are not technically unary-operators in the grammar. */
8210 {
8215 /* Handle the GNU address-of-label extension. */
8218 {
8219 tree identifier;
8220 tree expression;
8223 /* Consume the '&&' token. */
8225 /* Look for the identifier. */
8226 location_t finish_loc
8229 /* Construct a location of the form:
8230 &&label
8231 ^~~~~~~
8232 with caret==start at the "&&", finish at the end of the label. */
8233 location_t combined_loc
8235 /* Create an expression representing the address. */
8238 NIC_ADDR_LABEL))
8241 }
8242 }
8244 {
8245 cp_expr cast_expression;
8251 /* Consume the operator token. */
8255 /* Parse the cast-expression. */
8256 cast_expression
8261 pidk);
8263 /* Make a location:
8264 OP_TOKEN CAST_EXPRESSION
8265 ^~~~~~~~~~~~~~~~~~~~~~~~~
8266 with start==caret at the operator token, and
8267 extending to the end of the cast_expression. */
8270 /* Now, build an appropriate representation. */
8272 {
8276 RO_UNARY_STAR,
8277 complain);
8278 /* TODO: build_x_indirect_ref does not always honor the
8279 location, so ensure it is set. */
8285 /* Fall through. */
8288 cast_expression,
8289 complain);
8290 /* TODO: build_x_unary_op does not always honor the location,
8291 so ensure it is set. */
8299 /* Fall through. */
8301 /* Immediately fold negation of a constant, unless the constant is 0
8302 (since -0 == 0) or it would overflow. */
8307 {
8310 cast_expression);
8312 {
8315 }
8316 }
8317 /* Fall through. */
8326 }
8330 non_constant_p))
8334 }
8338 decltype_p,
8339 pidk);
8340 }
8342 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8343 unary-operator, the corresponding tree code is returned. */
8345 static enum tree_code
8347 {
8349 {
8370 }
8371 }
8373 /* Parse a new-expression.
8375 new-expression:
8376 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8377 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8379 Returns a representation of the expression. */
8381 static tree
8383 {
8386 tree type;
8389 tree ret;
8393 /* Look for the optional `::' operator. */
8394 global_scope_p
8398 /* Look for the `new' operator. */
8400 /* There's no easy way to tell a new-placement from the
8401 `( type-id )' construct. */
8403 /* Look for a new-placement. */
8405 /* If that didn't work out, there's no new-placement. */
8407 {
8411 }
8413 /* If the next token is a `(', then we have a parenthesized
8414 type-id. */
8416 {
8420 /* Consume the `('. */
8421 matching_parens parens;
8424 /* Parse the type-id. */
8425 parser->type_definition_forbidden_message
8427 {
8430 }
8433 /* Look for the closing `)'. */
8436 /* There should not be a direct-new-declarator in this production,
8437 but GCC used to allowed this, so we check and emit a sensible error
8438 message for this case. */
8440 {
8446 }
8447 }
8448 /* Otherwise, there must be a new-type-id. */
8449 else
8452 /* If the next token is a `(' or '{', then we have a new-initializer. */
8457 else
8460 /* A new-expression may not appear in an integral constant
8461 expression. */
8464 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8465 of a new-type-id or type-id of a new-expression, the new-expression shall
8466 contain a new-initializer of the form ( assignment-expression )".
8467 Additionally, consistently with the spirit of DR 1467, we want to accept
8468 'new auto { 2 }' too. */
8474 {
8476 "initialization of new-expression for type %<auto%> "
8479 }
8480 else
8481 {
8482 /* Construct a location e.g.:
8483 ptr = new int[100]
8484 ^~~~~~~~~~~~
8485 with caret == start at the start of the "new" token, and the end
8486 at the end of the final token we consumed. */
8491 /* Create a representation of the new-expression. */
8493 tf_warning_or_error);
8495 }
8503 }
8505 /* Parse a new-placement.
8507 new-placement:
8508 ( expression-list )
8510 Returns the same representation as for an expression-list. */
8514 {
8517 /* Parse the expression-list. */
8518 expression_list = (cp_parser_parenthesized_expression_list
8527 }
8529 /* Parse a new-type-id.
8531 new-type-id:
8532 type-specifier-seq new-declarator [opt]
8534 Returns the TYPE allocated. If the new-type-id indicates an array
8535 type, *NELTS is set to the number of elements in the last array
8536 bound; the TYPE will not include the last array bound. */
8538 static tree
8540 {
8541 cp_decl_specifier_seq type_specifier_seq;
8547 /* The type-specifier sequence must not contain type definitions.
8548 (It cannot contain declarations of new types either, but if they
8549 are not definitions we will catch that because they are not
8550 complete.) */
8552 parser->type_definition_forbidden_message
8554 /* Parse the type-specifier-seq. */
8558 /* Restore the old message. */
8564 /* Parse the new-declarator. */
8567 /* Determine the number of elements in the last array dimension, if
8568 any. */
8570 /* Skip down to the last array dimension. */
8575 {
8578 }
8583 {
8586 }
8589 {
8596 else
8598 }
8601 }
8603 /* Parse an (optional) new-declarator.
8605 new-declarator:
8606 ptr-operator new-declarator [opt]
8607 direct-new-declarator
8609 Returns the declarator. */
8613 {
8616 cp_cv_quals cv_quals;
8618 /* We don't know if there's a ptr-operator next, or not. */
8620 /* Look for a ptr-operator. */
8622 /* If that worked, look for more new-declarators. */
8624 {
8627 /* Parse another optional declarator. */
8630 declarator = cp_parser_make_indirect_declarator
8634 }
8636 /* If the next token is a `[', there is a direct-new-declarator. */
8641 }
8643 /* Parse a direct-new-declarator.
8645 direct-new-declarator:
8646 [ expression ]
8647 direct-new-declarator [constant-expression]
8649 */
8653 {
8657 {
8658 tree expression;
8661 /* Look for the opening `['. */
8666 /* The standard requires that the expression have integral
8667 type. DR 74 adds enumeration types. We believe that the
8668 real intent is that these expressions be handled like the
8669 expression in a `switch' condition, which also allows
8670 classes with a single conversion to integral or
8671 enumeration type. */
8673 {
8674 expression
8676 expression,
8679 {
8681 "expression in new-declarator must have integral "
8684 }
8685 }
8687 /* Look for the closing `]'. */
8690 /* Add this bound to the declarator. */
8693 /* If the next token is not a `[', then there are no more
8694 bounds. */
8697 }
8700 }
8702 /* Parse a new-initializer.
8704 new-initializer:
8705 ( expression-list [opt] )
8706 braced-init-list
8708 Returns a representation of the expression-list. */
8712 {
8716 {
8717 tree t;
8724 }
8725 else
8726 expression_list = (cp_parser_parenthesized_expression_list
8732 }
8734 /* Parse a delete-expression.
8736 delete-expression:
8737 :: [opt] delete cast-expression
8738 :: [opt] delete [ ] cast-expression
8740 Returns a representation of the expression. */
8742 static tree
8744 {
8747 tree expression;
8749 /* Look for the optional `::' operator. */
8750 global_scope_p
8754 /* Look for the `delete' keyword. */
8756 /* See if the array syntax is in use. */
8758 {
8759 /* Consume the `[' token. */
8761 /* Look for the `]' token. */
8763 /* Remember that this is the `[]' construct. */
8765 }
8766 else
8769 /* Parse the cast-expression. */
8772 /* A delete-expression may not appear in an integral constant
8773 expression. */
8778 tf_warning_or_error);
8779 }
8781 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8782 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8783 0 otherwise. */
8785 static int
8787 {
8790 {
8832 /* In ((type ()) () the last () isn't a valid cast-expression,
8833 so the whole must be parsed as postfix-expression. */
8838 /* '[' may start a primary-expression in obj-c++ and in C++11,
8839 as a lambda-expression, eg, '(void)[]{}'. */
8846 /* '++' and '--' may or may not start a cast-expression:
8848 struct T { void operator++(int); };
8849 void f() { (T())++; }
8851 vs
8853 int a;
8854 (int)++a; */
8859 }
8860 }
8862 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8863 in the order: const_cast, static_cast, reinterpret_cast.
8865 Don't suggest dynamic_cast.
8867 Return the first legal cast kind found, or NULL otherwise. */
8871 {
8872 tree trial;
8874 /* Reuse the parser logic by attempting to build the various kinds of
8875 cast, with "complain" disabled.
8876 Identify the first such cast that is valid. */
8878 /* Don't attempt to run such logic within template processing. */
8882 /* First try const_cast. */
8887 /* If that fails, try static_cast. */
8892 /* Finally, try reinterpret_cast. */
8897 /* No such cast possible. */
8899 }
8901 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8902 suggesting how to convert a C-style cast of the form:
8904 (DST_TYPE)ORIG_EXPR
8906 to a C++-style cast.
8908 The primary range of RICHLOC is asssumed to be that of the original
8909 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8910 of the parens in the C-style cast. */
8912 static void
8915 tree dst_type)
8916 {
8917 /* This function is non-trivial, so bail out now if the warning isn't
8918 going to be emitted. */
8922 /* Try to find a legal C++ cast, trying them in order:
8923 const_cast, static_cast, reinterpret_cast. */
8928 /* Replace the open paren with "CAST_SUGGESTION<". */
8929 pretty_printer pp;
8933 /* Replace the close paren with "> (". */
8936 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8938 }
8941 /* Parse a cast-expression.
8943 cast-expression:
8944 unary-expression
8945 ( type-id ) cast-expression
8947 ADDRESS_P is true iff the unary-expression is appearing as the
8948 operand of the `&' operator. CAST_P is true if this expression is
8949 the target of a cast.
8951 Returns a representation of the expression. */
8953 static cp_expr
8956 {
8957 /* If it's a `(', then we might be looking at a cast. */
8959 {
8965 /* There's no way to know yet whether or not this is a cast.
8966 For example, `(int (3))' is a unary-expression, while `(int)
8967 3' is a cast. So, we resort to parsing tentatively. */
8969 /* Types may not be defined in a cast. */
8971 parser->type_definition_forbidden_message
8973 /* Consume the `('. */
8974 matching_parens parens;
8979 /* A very tricky bit is that `(struct S) { 3 }' is a
8980 compound-literal (which we permit in C++ as an extension).
8981 But, that construct is not a cast-expression -- it is a
8982 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8983 is legal; if the compound-literal were a cast-expression,
8984 you'd need an extra set of parentheses.) But, if we parse
8985 the type-id, and it happens to be a class-specifier, then we
8986 will commit to the parse at that point, because we cannot
8987 undo the action that is done when creating a new class. So,
8988 then we cannot back up and do a postfix-expression.
8990 Another tricky case is the following (c++/29234):
8992 struct S { void operator () (); };
8994 void foo ()
8995 {
8996 ( S()() );
8997 }
8999 As a type-id we parse the parenthesized S()() as a function
9000 returning a function, groktypename complains and we cannot
9001 back up in this case either.
9003 Therefore, we scan ahead to the closing `)', and check to see
9004 if the tokens after the `)' can start a cast-expression. Otherwise
9005 we are dealing with an unary-expression, a postfix-expression
9006 or something else.
9008 Yet another tricky case, in C++11, is the following (c++/54891):
9010 (void)[]{};
9012 The issue is that usually, besides the case of lambda-expressions,
9013 the parenthesized type-id cannot be followed by '[', and, eg, we
9014 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
9015 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
9016 we don't commit, we try a cast-expression, then an unary-expression.
9018 Save tokens so that we can put them back. */
9021 /* We may be looking at a cast-expression. */
9024 cast_expression
9027 /* Roll back the tokens we skipped. */
9029 /* If we aren't looking at a cast-expression, simulate an error so
9030 that the call to cp_parser_error_occurred below returns true. */
9033 else
9034 {
9037 /* Look for the type-id. */
9039 /* Look for the closing `)'. */
9044 }
9046 /* Restore the saved message. */
9049 /* At this point this can only be either a cast or a
9050 parenthesized ctor such as `(T ())' that looks like a cast to
9051 function returning T. */
9053 {
9054 /* Only commit if the cast-expression doesn't start with
9055 '++', '--', or '[' in C++11. */
9063 pidk);
9066 {
9067 /* Warn about old-style casts, if so requested. */
9072 {
9078 }
9080 /* Only type conversions to integral or enumeration types
9081 can be used in constant-expressions. */
9084 NIC_CAST))
9087 /* Perform the cast. */
9088 /* Make a location:
9089 (TYPE) EXPR
9090 ^~~~~~~~~~~
9091 with start==caret at the open paren, extending to the
9092 end of "expr". */
9094 open_paren_loc,
9098 }
9099 }
9100 else
9102 }
9104 /* If we get here, then it's not a cast, so it must be a
9105 unary-expression. */
9108 }
9110 /* Parse a binary expression of the general form:
9112 pm-expression:
9113 cast-expression
9114 pm-expression .* cast-expression
9115 pm-expression ->* cast-expression
9117 multiplicative-expression:
9118 pm-expression
9119 multiplicative-expression * pm-expression
9120 multiplicative-expression / pm-expression
9121 multiplicative-expression % pm-expression
9123 additive-expression:
9124 multiplicative-expression
9125 additive-expression + multiplicative-expression
9126 additive-expression - multiplicative-expression
9128 shift-expression:
9129 additive-expression
9130 shift-expression << additive-expression
9131 shift-expression >> additive-expression
9133 relational-expression:
9134 shift-expression
9135 relational-expression < shift-expression
9136 relational-expression > shift-expression
9137 relational-expression <= shift-expression
9138 relational-expression >= shift-expression
9140 GNU Extension:
9142 relational-expression:
9143 relational-expression <? shift-expression
9144 relational-expression >? shift-expression
9146 equality-expression:
9147 relational-expression
9148 equality-expression == relational-expression
9149 equality-expression != relational-expression
9151 and-expression:
9152 equality-expression
9153 and-expression & equality-expression
9155 exclusive-or-expression:
9156 and-expression
9157 exclusive-or-expression ^ and-expression
9159 inclusive-or-expression:
9160 exclusive-or-expression
9161 inclusive-or-expression | exclusive-or-expression
9163 logical-and-expression:
9164 inclusive-or-expression
9165 logical-and-expression && inclusive-or-expression
9167 logical-or-expression:
9168 logical-and-expression
9169 logical-or-expression || logical-and-expression
9171 All these are implemented with a single function like:
9173 binary-expression:
9174 simple-cast-expression
9175 binary-expression <token> binary-expression
9177 CAST_P is true if this expression is the target of a cast.
9179 The binops_by_token map is used to get the tree codes for each <token> type.
9180 binary-expressions are associated according to a precedence table. */
9182 #define TOKEN_PRECEDENCE(token) \
9183 (((token->type == CPP_GREATER \
9184 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9185 && !parser->greater_than_is_operator_p) \
9186 ? PREC_NOT_OPERATOR \
9187 : binops_by_token[token->type].prec)
9189 static cp_expr
9195 {
9196 cp_parser_expression_stack stack;
9198 cp_parser_expression_stack_entry current;
9199 cp_expr rhs;
9203 tree overload;
9205 /* Parse the first expression. */
9216 {
9217 /* Get an operator token. */
9223 {
9225 "%<>>%> operator is treated"
9229 }
9234 /* This is a fold-expression; handle it later. */
9237 /* Popping an entry off the stack means we completed a subexpression:
9238 - either we found a token which is not an operator (`>' where it is not
9239 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9240 will happen repeatedly;
9241 - or, we found an operator which has lower priority. This is the case
9242 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9243 parsing `3 * 4'. */
9245 {
9248 else
9250 }
9252 get_rhs:
9256 /* We used the operator token. */
9259 /* For "false && x" or "true || x", x will never be executed;
9260 disable warnings while evaluating it. */
9262 c_inhibit_evaluation_warnings +=
9265 c_inhibit_evaluation_warnings +=
9268 /* Extract another operand. It may be the RHS of this expression
9269 or the LHS of a new, higher priority expression. */
9274 /* Get another operator token. Look up its precedence to avoid
9275 building a useless (immediately popped) stack entry for common
9276 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9283 {
9284 /* ... and prepare to parse the RHS of the new, higher priority
9285 expression. Since precedence levels on the stack are
9286 monotonically increasing, we do not have to care about
9287 stack overflows. */
9296 pop:
9298 /* If the stack is not empty, we have parsed into LHS the right side
9299 (`4' in the example above) of an expression we had suspended.
9300 We can use the information on the stack to recover the LHS (`3')
9301 from the stack together with the tree code (`MULT_EXPR'), and
9302 the precedence of the higher level subexpression
9303 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9304 which will be used to actually build the additive expression. */
9309 }
9311 /* Undo the disabling of warnings done above. */
9313 c_inhibit_evaluation_warnings -=
9316 c_inhibit_evaluation_warnings -=
9322 /* Avoid warning for !!x == y. */
9327 /* Avoid warning for !b == y where b is boolean. */
9331 /* Avoid warning for !!b == y where b is boolean. */
9344 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9345 ERROR_MARK for everything that is not a binary expression.
9346 This makes warn_about_parentheses miss some warnings that
9347 involve unary operators. For unary expressions we should
9348 pass the correct tree_code unless the unary expression was
9349 surrounded by parentheses.
9350 */
9354 {
9357 else
9358 {
9359 current.lhs
9362 == tcc_comparison
9366 }
9367 }
9368 else
9369 {
9374 /* TODO: build_x_binary_op doesn't always honor the location. */
9376 }
9379 /* If the binary operator required the use of an overloaded operator,
9380 then this expression cannot be an integral constant-expression.
9381 An overloaded operator can be used even if both operands are
9382 otherwise permissible in an integral constant-expression if at
9383 least one of the operands is of enumeration type. */
9387 NIC_OVERLOADED))
9389 }
9392 }
9394 static cp_expr
9399 {
9402 }
9404 /* Parse the `? expression : assignment-expression' part of a
9405 conditional-expression. The LOGICAL_OR_EXPR is the
9406 logical-or-expression that started the conditional-expression.
9407 Returns a representation of the entire conditional-expression.
9409 This routine is used by cp_parser_assignment_expression.
9411 ? expression : assignment-expression
9413 GNU Extensions:
9415 ? : assignment-expression */
9417 static tree
9419 {
9421 cp_expr assignment_expr;
9425 /* Consume the `?' token. */
9430 {
9433 /* Implicit true clause. */
9435 c_inhibit_evaluation_warnings +=
9438 }
9439 else
9440 {
9443 /* Parse the expression. */
9444 c_inhibit_evaluation_warnings +=
9447 c_inhibit_evaluation_warnings +=
9451 }
9453 /* The next token should be a `:'. */
9455 /* Parse the assignment-expression. */
9457 c_inhibit_evaluation_warnings -=
9460 /* Make a location:
9461 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9462 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9463 with the caret at the "?", ranging from the start of
9464 the logical_or_expr to the end of the assignment_expr. */
9469 /* Build the conditional-expression. */
9471 expr,
9472 assignment_expr,
9473 tf_warning_or_error);
9474 }
9476 /* Parse an assignment-expression.
9478 assignment-expression:
9479 conditional-expression
9480 logical-or-expression assignment-operator assignment_expression
9481 throw-expression
9483 CAST_P is true if this expression is the target of a cast.
9484 DECLTYPE_P is true if this expression is the operand of decltype.
9486 Returns a representation for the expression. */
9488 static cp_expr
9491 {
9492 cp_expr expr;
9494 /* If the next token is the `throw' keyword, then we're looking at
9495 a throw-expression. */
9498 /* Otherwise, it must be that we are looking at a
9499 logical-or-expression. */
9500 else
9501 {
9502 /* Parse the binary expressions (logical-or-expression). */
9504 decltype_p,
9506 /* If the next token is a `?' then we're actually looking at a
9507 conditional-expression. */
9510 else
9511 {
9514 /* If it's an assignment-operator, we're using the second
9515 production. */
9516 enum tree_code assignment_operator
9519 {
9522 /* Parse the right-hand side of the assignment. */
9529 /* An assignment may not appear in a
9530 constant-expression. */
9532 NIC_ASSIGNMENT))
9534 /* Build the assignment expression. Its default
9535 location:
9536 LHS = RHS
9537 ~~~~^~~~~
9538 is the location of the '=' token as the
9539 caret, ranging from the start of the lhs to the
9540 end of the rhs. */
9545 assignment_operator,
9546 rhs,
9548 /* TODO: build_x_modify_expr doesn't honor the location,
9549 so we must set it here. */
9551 }
9552 }
9553 }
9556 }
9558 /* Parse an (optional) assignment-operator.
9560 assignment-operator: one of
9561 = *= /= %= += -= >>= <<= &= ^= |=
9563 GNU Extension:
9565 assignment-operator: one of
9566 <?= >?=
9568 If the next token is an assignment operator, the corresponding tree
9569 code is returned, and the token is consumed. For example, for
9570 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9571 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9572 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9573 operator, ERROR_MARK is returned. */
9575 static enum tree_code
9577 {
9581 /* Peek at the next token. */
9585 {
9631 /* Nothing else is an assignment operator. */
9633 }
9635 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9640 /* If it was an assignment operator, consume it. */
9645 }
9647 /* Parse an expression.
9649 expression:
9650 assignment-expression
9651 expression , assignment-expression
9653 CAST_P is true if this expression is the target of a cast.
9654 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9655 except possibly parenthesized or on the RHS of a comma (N3276).
9657 Returns a representation of the expression. */
9659 static cp_expr
9662 {
9667 {
9668 cp_expr assignment_expression;
9670 /* Parse the next assignment-expression. */
9671 assignment_expression
9674 /* We don't create a temporary for a call that is the immediate operand
9675 of decltype or on the RHS of a comma. But when we see a comma, we
9676 need to create a temporary for a call on the LHS. */
9681 assignment_expression
9685 /* If this is the first assignment-expression, we can just
9686 save it away. */
9689 else
9690 {
9691 /* Create a location with caret at the comma, ranging
9692 from the start of the LHS to the end of the RHS. */
9697 assignment_expression,
9700 }
9701 /* If the next token is not a comma, or we're in a fold-expression, then
9702 we are done with the expression. */
9706 /* Consume the `,'. */
9709 /* A comma operator cannot appear in a constant-expression. */
9712 }
9715 }
9717 /* Parse a constant-expression.
9719 constant-expression:
9720 conditional-expression
9722 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9723 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9724 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9725 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9726 only parse a conditional-expression, otherwise parse an
9727 assignment-expression. See below for rationale. */
9729 static cp_expr
9734 {
9738 cp_expr expression;
9740 /* It might seem that we could simply parse the
9741 conditional-expression, and then check to see if it were
9742 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9743 one that the compiler can figure out is constant, possibly after
9744 doing some simplifications or optimizations. The standard has a
9745 precise definition of constant-expression, and we must honor
9746 that, even though it is somewhat more restrictive.
9748 For example:
9750 int i[(2, 3)];
9752 is not a legal declaration, because `(2, 3)' is not a
9753 constant-expression. The `,' operator is forbidden in a
9754 constant-expression. However, GCC's constant-folding machinery
9755 will fold this operation to an INTEGER_CST for `3'. */
9757 /* Save the old settings. */
9759 saved_allow_non_integral_constant_expression_p
9762 /* We are now parsing a constant-expression. */
9764 parser->allow_non_integral_constant_expression_p
9767 /* Although the grammar says "conditional-expression", when not STRICT_P,
9768 we parse an "assignment-expression", which also permits
9769 "throw-expression" and the use of assignment operators. In the case
9770 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9771 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9772 actually essential that we look for an assignment-expression.
9773 For example, cp_parser_initializer_clauses uses this function to
9774 determine whether a particular assignment-expression is in fact
9775 constant. */
9777 {
9778 /* Parse the binary expressions (logical-or-expression). */
9781 /* If the next token is a `?' then we're actually looking at
9782 a conditional-expression; otherwise we're done. */
9785 }
9786 else
9788 /* Restore the old settings. */
9789 parser->integral_constant_expression_p
9791 parser->allow_non_integral_constant_expression_p
9794 {
9795 /* Require an rvalue constant expression here; that's what our
9796 callers expect. Reference constant expressions are handled
9797 separately in e.g. cp_parser_template_argument. */
9806 }
9809 parser->non_integral_constant_expression_p
9813 }
9815 /* Parse __builtin_offsetof.
9817 offsetof-expression:
9818 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9820 offsetof-member-designator:
9821 id-expression
9822 | offsetof-member-designator "." id-expression
9823 | offsetof-member-designator "[" expression "]"
9824 | offsetof-member-designator "->" id-expression */
9826 static cp_expr
9828 {
9830 tree type;
9831 cp_expr expr;
9832 cp_id_kind dummy;
9834 location_t finish_loc;
9836 /* We're about to accept non-integral-constant things, but will
9837 definitely yield an integral constant expression. Save and
9838 restore these values around our local parsing. */
9844 /* Consume the "__builtin_offsetof" token. */
9846 /* Consume the opening `('. */
9847 matching_parens parens;
9849 /* Parse the type-id. */
9851 {
9853 parser->type_definition_forbidden_message
9857 }
9858 /* Look for the `,'. */
9862 /* Build the (type *)null that begins the traditional offsetof macro. */
9863 tree object_ptr
9865 tf_warning_or_error);
9867 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9871 {
9874 {
9876 /* offsetof-member-designator "[" expression "]" */
9882 /* offsetof-member-designator "->" identifier */
9885 /* FALLTHRU */
9888 /* offsetof-member-designator "." identifier */
9896 /* Consume the ")" token. */
9902 /* Error. We know the following require will fail, but
9903 that gives the proper error message. */
9908 }
9909 }
9911 success:
9912 /* Make a location of the form:
9913 __builtin_offsetof (struct s, f)
9914 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9915 with caret at the type-id, ranging from the start of the
9916 "_builtin_offsetof" token to the close paren. */
9918 /* The result will be an INTEGER_CST, so we need to explicitly
9919 preserve the location. */
9922 failure:
9928 }
9930 /* Parse a trait expression.
9932 Returns a representation of the expression, the underlying type
9933 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9935 static cp_expr
9937 {
9938 cp_trait_kind kind;
9944 {
10046 }
10048 /* Get location of initial token. */
10051 /* Consume the token. */
10054 matching_parens parens;
10057 {
10060 }
10066 {
10069 {
10072 }
10076 }
10078 {
10080 {
10084 {
10087 }
10091 }
10092 }
10097 /* Construct a location of the form:
10098 __is_trivially_copyable(_Tp)
10099 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10100 with start == caret, finishing at the close-paren. */
10103 /* Complete the trait expression, which may mean either processing
10104 the trait expr now or saving it for template instantiation. */
10106 {
10115 }
10116 }
10118 /* Parse a lambda expression.
10120 lambda-expression:
10121 lambda-introducer lambda-declarator [opt] compound-statement
10123 Returns a representation of the expression. */
10125 static cp_expr
10127 {
10129 tree type;
10137 {
10139 {
10143 }
10145 }
10147 {
10149 {
10152 }
10154 }
10156 /* We may be in the middle of deferred access check. Disable
10157 it now. */
10168 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10171 /* Now that we've started the type, add the capture fields for any
10172 explicit captures. */
10175 {
10176 /* Inside the class, surrounding template-parameter-lists do not apply. */
10177 unsigned int saved_num_template_parameter_lists
10181 bool fully_implicit_function_template_p
10185 bool auto_is_implicit_function_template_parm_p
10196 /* By virtue of defining a local class, a lambda expression has access to
10197 the private variables of enclosing classes. */
10205 {
10210 }
10212 {
10215 }
10217 /* The capture list was built up in reverse order; fix that now. */
10229 parser->fully_implicit_function_template_p
10233 parser->auto_is_implicit_function_template_parm_p
10235 }
10237 /* This field is only used during parsing of the lambda. */
10240 /* This lambda shouldn't have any proxies left at this point. */
10242 /* And now that we're done, push proxies for an enclosing lambda. */
10245 /* Update the lambda expression to a range. */
10253 else
10261 }
10263 /* Parse the beginning of a lambda expression.
10265 lambda-introducer:
10266 [ lambda-capture [opt] ]
10268 LAMBDA_EXPR is the current representation of the lambda expression. */
10270 static void
10272 {
10273 /* Need commas after the first capture. */
10276 /* Eat the leading `['. */
10279 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10287 {
10293 }
10296 {
10298 tree capture_id;
10299 tree capture_init_expr;
10303 enum capture_kind_type
10304 {
10305 BY_COPY,
10306 BY_REFERENCE
10307 };
10311 {
10314 }
10318 else
10321 /* Possibly capture `this'. */
10323 {
10334 explicit_init_p);
10336 }
10338 /* Possibly capture `*this'. */
10341 {
10352 explicit_init_p);
10354 }
10356 /* Remember whether we want to capture as a reference or not. */
10358 {
10361 }
10363 /* Get the identifier. */
10368 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10369 delimiters, but I modified this to stop on unnested ']' as well. It
10370 was already changed to stop on unnested '}', so the
10371 "closing_parenthesis" name is no more misleading with my change. */
10372 {
10378 }
10380 /* Find the initializer for this capture. */
10384 {
10386 /* An explicit initializer exists. */
10389 "lambda capture initializers "
10395 {
10398 }
10399 }
10400 else
10401 {
10404 /* Turn the identifier into an id-expression. */
10405 capture_init_expr
10410 {
10413 }
10416 {
10419 capture_init_expr);
10424 }
10427 {
10430 capture_init_expr))
10434 }
10436 capture_init_expr
10437 = finish_id_expression
10439 capture_init_expr,
10453 {
10456 }
10457 }
10461 {
10466 capture_id);
10470 "capture of %qD redundant with by-reference capture "
10472 }
10475 capture_id,
10476 capture_init_expr,
10478 explicit_init_p);
10480 /* If there is any qualification still in effect, clear it
10481 now; we will be starting fresh with the next capture. */
10485 }
10488 }
10490 /* Parse the (optional) middle of a lambda expression.
10492 lambda-declarator:
10493 < template-parameter-list [opt] >
10494 ( parameter-declaration-clause [opt] )
10495 attribute-specifier [opt]
10496 decl-specifier-seq [opt]
10497 exception-specification [opt]
10498 lambda-return-type-clause [opt]
10500 LAMBDA_EXPR is the current representation of the lambda expression. */
10502 static bool
10504 {
10505 /* 5.1.1.4 of the standard says:
10506 If a lambda-expression does not include a lambda-declarator, it is as if
10507 the lambda-declarator were ().
10508 This means an empty parameter list, no attributes, and no exception
10509 specification. */
10516 cp_decl_specifier_seq lambda_specs;
10519 /* The template-parameter-list is optional, but must begin with
10520 an opening angle if present. */
10522 {
10525 "lambda templates are only available with "
10529 "lambda templates are only available with "
10538 /* We just processed one more parameter list. */
10540 }
10542 /* The parameter-declaration-clause is optional (unless
10543 template-parameter-list was given), but must begin with an
10544 opening parenthesis if present. */
10546 {
10547 matching_parens parens;
10552 /* Parse parameters. */
10555 /* Default arguments shall not be specified in the
10556 parameter-declaration-clause of a lambda-declarator. */
10567 /* In the decl-specifier-seq of the lambda-declarator, each
10568 decl-specifier shall either be mutable or constexpr. */
10572 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10575 {
10580 }
10584 /* Parse optional exception specification. */
10587 /* Parse optional trailing return type. */
10589 {
10592 }
10594 /* The function parameters must be in scope all the way until after the
10595 trailing-return-type in case of decltype. */
10597 }
10601 /* Create the function call operator.
10603 Messing with declarators like this is no uglier than building up the
10604 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10605 other code. */
10606 {
10607 cp_decl_specifier_seq return_type_specs;
10609 tree fco;
10617 {
10621 else
10624 }
10633 VIRT_SPEC_UNSPECIFIED,
10634 REF_QUAL_NONE,
10635 tx_qual,
10636 exception_spec,
10644 declarator,
10645 attributes);
10647 {
10650 /* Give the object parameter a different name. */
10653 }
10655 {
10659 }
10668 }
10669 }
10671 /* Parse the body of a lambda expression, which is simply
10673 compound-statement
10675 but which requires special handling.
10676 LAMBDA_EXPR is the current representation of the lambda expression. */
10678 static void
10680 {
10687 else
10688 /* Still increment function_depth so that we don't GC in the
10689 middle of an expression. */
10694 /* Clear this in case we're in the middle of a default argument. */
10698 {
10702 matching_braces braces;
10705 {
10708 /* Originally C++11 required us to peek for 'return expr'; and
10709 process it specially here to deduce the return type. N3638
10710 removed the need for that. */
10718 }
10721 }
10728 else
10730 }
10732 /* Statements [gram.stmt.stmt] */
10734 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10736 static void
10738 {
10742 /* A concept is never expanded normally. */
10748 }
10750 /* Parse a statement.
10752 statement:
10753 labeled-statement
10754 expression-statement
10755 compound-statement
10756 selection-statement
10757 iteration-statement
10758 jump-statement
10759 declaration-statement
10760 try-block
10762 C++11:
10764 statement:
10765 labeled-statement
10766 attribute-specifier-seq (opt) expression-statement
10767 attribute-specifier-seq (opt) compound-statement
10768 attribute-specifier-seq (opt) selection-statement
10769 attribute-specifier-seq (opt) iteration-statement
10770 attribute-specifier-seq (opt) jump-statement
10771 declaration-statement
10772 attribute-specifier-seq (opt) try-block
10774 init-statement:
10775 expression-statement
10776 simple-declaration
10778 TM Extension:
10780 statement:
10781 atomic-statement
10783 IN_COMPOUND is true when the statement is nested inside a
10784 cp_parser_compound_statement; this matters for certain pragmas.
10786 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10787 is a (possibly labeled) if statement which is not enclosed in braces
10788 and has an else clause. This is used to implement -Wparentheses.
10790 CHAIN is a vector of if-else-if conditions. */
10792 static void
10796 {
10801 restart:
10804 /* There is no statement yet. */
10810 /* In obj-c++, seeing '[[' might be the either the beginning of
10811 c++11 attributes, or a nested objc-message-expression. So
10812 let's parse the c++11 attributes tentatively. */
10816 {
10819 }
10821 /* Peek at the next token. */
10823 /* Remember the location of the first token in the statement. */
10826 /* If this is a keyword, then that will often determine what kind of
10827 statement we have. */
10829 {
10833 {
10836 /* Looks like a labeled-statement with a case label.
10837 Parse the label, and then use tail recursion to parse
10838 the statement. */
10861 /* Objective-C++ exception-handling constructs. */
10875 /* This must be a namespace alias definition. */
10891 /* It might be a keyword like `int' that can start a
10892 declaration-statement. */
10894 }
10895 }
10897 {
10898 /* If the next token is a `:', then we are looking at a
10899 labeled-statement. */
10902 {
10903 /* Looks like a labeled-statement with an ordinary label.
10904 Parse the label, and then use tail recursion to parse
10905 the statement. */
10910 }
10911 }
10912 /* Anything that starts with a `{' must be a compound-statement. */
10915 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10916 a statement all its own. */
10918 {
10919 /* Only certain OpenMP pragmas are attached to statements, and thus
10920 are considered statements themselves. All others are not. In
10921 the context of a compound, accept the pragma as a "statement" and
10922 return so that we can check for a close brace. Otherwise we
10923 require a real statement and must go back and read one. */
10929 }
10931 {
10934 }
10936 /* Everything else must be a declaration-statement or an
10937 expression-statement. Try for the declaration-statement
10938 first, unless we are looking at a `;', in which case we know that
10939 we have an expression-statement. */
10941 {
10943 {
10945 {
10946 /* Attributes should be parsed as part of the the
10947 declaration, so let's un-parse them. */
10950 }
10953 /* Try to parse the declaration-statement. */
10955 /* If that worked, we're done. */
10958 }
10959 /* All preceding labels have been parsed at this point. */
10963 /* Look for an expression-statement instead. */
10966 /* Handle [[fallthrough]];. */
10968 {
10969 /* The next token after the fallthrough attribute is ';'. */
10971 {
10972 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10974 IFN_FALLTHROUGH,
10977 }
10978 else
10982 }
10983 }
10985 /* Set the line number for the statement. */
10989 /* Allow "[[fallthrough]];", but warn otherwise. */
10992 OPT_Wattributes,
10994 }
10996 /* Append ATTR to attribute list ATTRS. */
10998 static tree
11000 {
11006 }
11008 /* Parse the label for a labeled-statement, i.e.
11010 identifier :
11011 case constant-expression :
11012 default :
11014 GNU Extension:
11015 case constant-expression ... constant-expression : statement
11017 When a label is parsed without errors, the label is added to the
11018 parse tree by the finish_* functions, so this function doesn't
11019 have to return the label. */
11021 static void
11023 {
11028 /* The next token should be an identifier. */
11032 {
11035 }
11037 /* Remember whether this case or a user-defined label is allowed to fall
11038 through to. */
11043 {
11045 {
11049 /* Consume the `case' token. */
11051 /* Parse the constant-expression. */
11058 {
11059 /* Consume the `...' token. */
11065 /* We don't need to emit warnings here, as the common code
11066 will do this for us. */
11067 }
11068 else
11072 {
11076 }
11077 else
11080 expr);
11081 }
11085 /* Consume the `default' token. */
11089 {
11093 }
11094 else
11099 /* Anything else must be an ordinary label. */
11104 }
11106 /* Require the `:' token. */
11109 /* An ordinary label may optionally be followed by attributes.
11110 However, this is only permitted if the attributes are then
11111 followed by a semicolon. This is because, for backward
11112 compatibility, when parsing
11113 lab: __attribute__ ((unused)) int i;
11114 we want the attribute to attach to "i", not "lab". */
11117 {
11118 tree attrs;
11125 ;
11126 else
11128 }
11134 }
11136 /* Parse an expression-statement.
11138 expression-statement:
11139 expression [opt] ;
11141 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11142 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11143 indicates whether this expression-statement is part of an
11144 expression statement. */
11146 static tree
11148 {
11153 /* There might be attribute fallthrough. */
11156 /* If the next token is a ';', then there is no expression
11157 statement. */
11159 {
11163 {
11166 }
11167 }
11169 /* Handle [[fallthrough]];. */
11171 {
11172 /* The next token after the fallthrough attribute is ';'. */
11174 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11177 else
11181 }
11183 /* Allow "[[fallthrough]];", but warn otherwise. */
11188 /* Give a helpful message for "A<T>::type t;" and the like. */
11191 {
11198 {
11199 /* A::A a; */
11204 }
11205 }
11207 /* Consume the final `;'. */
11212 /* This is the final expression statement of a statement
11213 expression. */
11219 }
11221 /* Parse a compound-statement.
11223 compound-statement:
11224 { statement-seq [opt] }
11226 GNU extension:
11228 compound-statement:
11229 { label-declaration-seq [opt] statement-seq [opt] }
11231 label-declaration-seq:
11232 label-declaration
11233 label-declaration-seq label-declaration
11235 Returns a tree representing the statement. */
11237 static tree
11240 {
11241 tree compound_stmt;
11242 matching_braces braces;
11244 /* Consume the `{'. */
11251 /* Begin the compound-statement. */
11253 /* If the next keyword is `__label__' we have a label declaration. */
11256 /* Parse an (optional) statement-seq. */
11258 /* Finish the compound-statement. */
11260 /* Consume the `}'. */
11264 }
11266 /* Parse an (optional) statement-seq.
11268 statement-seq:
11269 statement
11270 statement-seq [opt] statement */
11272 static void
11274 {
11275 /* Scan statements until there aren't any more. */
11277 {
11280 /* If we are looking at a `}', then we have run out of
11281 statements; the same is true if we have reached the end
11282 of file, or have stumbled upon a stray '@end'. */
11289 /* If we are in a compound statement and find 'else' then
11290 something went wrong. */
11292 {
11295 else
11296 {
11299 }
11300 }
11302 /* Parse the statement. */
11304 }
11305 }
11307 /* Return true if this is the C++20 version of range-based-for with
11308 init-statement. */
11310 static bool
11312 {
11315 /* Save tokens so that we can put them back. */
11318 /* There has to be an unnested ; followed by an unnested :. */
11321 CPP_SEMICOLON,
11325 /* We found the semicolon, eat it now. */
11328 /* Now look for ':' that is not nested in () or {}. */
11331 CPP_COLON,
11334 out:
11335 /* Roll back the tokens we skipped. */
11339 }
11341 /* Return true if we're looking at (init; cond), false otherwise. */
11343 static bool
11345 {
11346 /* Save tokens so that we can put them back. */
11349 /* Look for ';' that is not nested in () or {}. */
11352 CPP_SEMICOLON,
11355 /* Roll back the tokens we skipped. */
11359 }
11361 /* Parse a selection-statement.
11363 selection-statement:
11364 if ( init-statement [opt] condition ) statement
11365 if ( init-statement [opt] condition ) statement else statement
11366 switch ( init-statement [opt] condition ) statement
11368 Returns the new IF_STMT or SWITCH_STMT.
11370 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11371 is a (possibly labeled) if statement which is not enclosed in
11372 braces and has an else clause. This is used to implement
11373 -Wparentheses.
11375 CHAIN is a vector of if-else-if conditions. This is used to implement
11376 -Wduplicated-cond. */
11378 static tree
11381 {
11384 token_indent_info guard_tinfo;
11389 /* Peek at the next token. */
11393 /* See what kind of keyword it is. */
11396 {
11399 {
11400 tree statement;
11401 tree condition;
11406 RID_CONSTEXPR))
11407 {
11413 }
11415 /* Look for the `('. */
11416 matching_parens parens;
11418 {
11421 }
11423 /* Begin the selection-statement. */
11425 {
11428 }
11429 else
11432 /* Parse the optional init-statement. */
11434 {
11435 tree decl;
11438 "init-statement in selection statements only available "
11441 }
11443 /* Parse the condition. */
11445 /* Look for the `)'. */
11451 {
11455 /* Add the condition. */
11462 /* Parse the then-clause. */
11466 /* Outside a template, the non-selected branch of a constexpr
11467 if is a 'discarded statement', i.e. unevaluated. */
11472 {
11475 }
11478 guard_tinfo);
11485 {
11489 }
11491 /* If the next token is `else', parse the else-clause. */
11493 RID_ELSE))
11494 {
11498 {
11501 }
11503 guard_tinfo
11505 /* Consume the `else' keyword. */
11508 {
11510 RID_IF)
11512 {
11513 /* We've got "if (COND) else if (COND2)". Start
11514 the condition chain and add COND as the first
11515 element. */
11519 {
11520 /* Wrap it in a NOP_EXPR so that we can set the
11521 location of the condition. */
11523 condition);
11526 }
11527 }
11529 RID_IF))
11530 {
11531 /* This is if-else without subsequent if. Zap the
11532 condition chain; we would have already warned at
11533 this point. */
11536 }
11537 }
11539 /* Parse the else-clause. */
11545 /* If we are currently parsing a then-clause, then
11546 IF_P will not be NULL. We set it to true to
11547 indicate that this if statement has an else clause.
11548 This may trigger the Wparentheses warning below
11549 when we get back up to the parent if statement. */
11554 {
11558 }
11559 }
11560 else
11561 {
11562 /* This if statement does not have an else clause. If
11563 NESTED_IF is true, then the then-clause has an if
11564 statement which does have an else clause. We warn
11565 about the potential ambiguity. */
11568 "suggest explicit braces to avoid ambiguous"
11571 {
11572 /* We don't need the condition chain anymore. */
11575 }
11576 }
11578 /* Now we're all done with the if-statement. */
11580 }
11581 else
11582 {
11586 /* Add the condition. */
11589 /* Parse the body of the switch-statement. */
11595 guard_tinfo);
11599 /* Now we're all done with the switch-statement. */
11601 }
11604 }
11610 }
11611 }
11613 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
11614 If we have seen at least one decl-specifier, and the next token
11615 is not a parenthesis, then we must be looking at a declaration.
11616 (After "int (" we might be looking at a functional cast.) */
11618 static void
11621 {
11627 }
11629 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
11630 The declarator shall not specify a function or an array. Returns
11631 TRUE if the declarator is valid, FALSE otherwise. */
11633 static bool
11636 location_t loc)
11637 {
11641 {
11646 else
11654 }
11655 else
11657 }
11659 /* Parse a condition.
11661 condition:
11662 expression
11663 type-specifier-seq declarator = initializer-clause
11664 type-specifier-seq declarator braced-init-list
11666 GNU Extension:
11668 condition:
11669 type-specifier-seq declarator asm-specification [opt]
11670 attributes [opt] = assignment-expression
11672 Returns the expression that should be tested. */
11674 static tree
11676 {
11677 cp_decl_specifier_seq type_specifiers;
11681 /* Try the declaration first. */
11683 /* New types are not allowed in the type-specifier-seq for a
11684 condition. */
11686 parser->type_definition_forbidden_message
11688 /* Parse the type-specifier-seq. */
11690 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11693 /* Restore the saved message. */
11699 /* If all is well, we might be looking at a declaration. */
11701 {
11702 tree decl;
11703 tree asm_specification;
11704 tree attributes;
11709 /* Parse the declarator. */
11715 /* Parse the attributes. */
11717 /* Parse the asm-specification. */
11719 /* If the next token is not an `=' or '{', then we might still be
11720 looking at an expression. For example:
11722 if (A(a).x)
11724 looks like a decl-specifier-seq and a declarator -- but then
11725 there is no `=', so this is an expression. */
11730 /* If we did see an `=' or '{', then we are looking at a declaration
11731 for sure. */
11733 {
11734 tree pushed_scope;
11741 /* Create the declaration. */
11747 /* Parse the initializer. */
11749 {
11753 }
11755 {
11756 /* Consume the `='. */
11760 }
11761 else
11762 {
11765 }
11769 /* Process the initializer. */
11772 asm_specification,
11773 flags);
11779 }
11780 }
11781 /* If we didn't even get past the declarator successfully, we are
11782 definitely not looking at a declaration. */
11783 else
11786 /* Otherwise, we are looking at an expression. */
11788 }
11790 /* Parses a for-statement or range-for-statement until the closing ')',
11791 not included. */
11793 static tree
11795 {
11799 /* Begin the for-statement. */
11802 /* Parse the initialization. */
11807 else
11809 }
11811 static tree
11814 {
11815 /* Normal for loop */
11818 tree stmt;
11821 /* The init-statement has already been parsed in
11822 cp_parser_init_statement, so no work is needed here. */
11825 /* If there's a condition, process it. */
11829 {
11833 }
11835 {
11839 }
11841 /* Look for the `;'. */
11844 /* If there's an expression, process it. */
11850 }
11852 /* Tries to parse a range-based for-statement:
11854 range-based-for:
11855 decl-specifier-seq declarator : expression
11857 The decl-specifier-seq declarator and the `:' are already parsed by
11858 cp_parser_init_statement. If processing_template_decl it returns a
11859 newly created RANGE_FOR_STMT; if not, it is converted to a
11860 regular FOR_STMT. */
11862 static tree
11865 {
11872 /* Get the range declaration momentarily out of the way so that
11873 the range expression doesn't clash with it. */
11875 {
11877 {
11879 /* For decomposition declaration get all of the corresponding
11880 declarations out of the way. */
11884 {
11890 {
11896 }
11897 }
11898 }
11900 {
11905 }
11906 }
11909 {
11912 }
11913 else
11916 /* Put the range declaration(s) back into scope. */
11918 {
11922 }
11924 /* If in template, STMT is converted to a normal for-statement
11925 at instantiation. If not, it is done just ahead. */
11927 {
11937 /* do_auto_deduction doesn't mess with template init-lists. */
11940 }
11941 else
11942 {
11946 unroll);
11947 }
11949 }
11951 /* Subroutine of cp_convert_range_for: given the initializer expression,
11952 builds up the range temporary. */
11954 static tree
11956 {
11959 /* Find out the type deduced by the declaration
11960 `auto &&__range = range_expr'. */
11965 /* Create the __range variable. */
11967 range_type);
11972 }
11974 /* Used by cp_parser_range_for in template context: we aren't going to
11975 do a full conversion yet, but we still need to resolve auto in the
11976 type of the for-range-declaration if present. This is basically
11977 a shortcut version of cp_convert_range_for. */
11979 static void
11981 {
11984 {
11987 iter_type = (cp_parser_perform_range_for_lookup
11990 {
11992 iter_type);
11994 RO_UNARY_STAR,
11995 tf_warning_or_error);
11998 }
11999 }
12000 }
12002 /* Converts a range-based for-statement into a normal
12003 for-statement, as per the definition.
12005 for (RANGE_DECL : RANGE_EXPR)
12006 BLOCK
12008 should be equivalent to:
12010 {
12011 auto &&__range = RANGE_EXPR;
12012 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
12013 __begin != __end;
12014 ++__begin)
12015 {
12016 RANGE_DECL = *__begin;
12017 BLOCK
12018 }
12019 }
12021 If RANGE_EXPR is an array:
12022 BEGIN_EXPR = __range
12023 END_EXPR = __range + ARRAY_SIZE(__range)
12024 Else if RANGE_EXPR has a member 'begin' or 'end':
12025 BEGIN_EXPR = __range.begin()
12026 END_EXPR = __range.end()
12027 Else:
12028 BEGIN_EXPR = begin(__range)
12029 END_EXPR = end(__range);
12031 If __range has a member 'begin' but not 'end', or vice versa, we must
12032 still use the second alternative (it will surely fail, however).
12033 When calling begin()/end() in the third alternative we must use
12034 argument dependent lookup, but always considering 'std' as an associated
12035 namespace. */
12037 tree
12041 {
12049 /* If an error happened previously do nothing or else a lot of
12050 unhelpful errors would be issued. */
12052 else
12053 {
12054 tree range_temp;
12058 /* Can't bind a reference to an array of runtime bound. */
12060 else
12061 {
12066 LOOKUP_ONLYCONVERTING);
12068 }
12071 }
12073 /* The new for initialization statement. */
12075 iter_type);
12081 LOOKUP_ONLYCONVERTING);
12091 LOOKUP_ONLYCONVERTING);
12095 /* The new for condition. */
12102 /* The new increment expression. */
12105 tf_warning_or_error);
12111 /* The declaration is initialized with *__begin inside the loop body. */
12114 tf_warning_or_error),
12116 LOOKUP_ONLYCONVERTING);
12121 }
12123 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12124 We need to solve both at the same time because the method used
12125 depends on the existence of members begin or end.
12126 Returns the type deduced for the iterator expression. */
12128 static tree
12130 {
12132 {
12135 }
12138 {
12143 }
12145 {
12146 /* If RANGE is an array, we will use pointer arithmetic. */
12149 range,
12153 }
12154 else
12155 {
12156 /* If it is not an array, we must do a bit of magic. */
12166 tf_warning_or_error);
12169 tf_warning_or_error);
12172 {
12173 /* Use the member functions. */
12176 }
12177 else
12178 {
12179 /* Use global functions with ADL. */
12186 tf_warning_or_error);
12188 tf_warning_or_error);
12190 tf_warning_or_error);
12192 tf_warning_or_error);
12195 }
12197 /* Last common checks. */
12199 {
12200 /* If one of the expressions is an error do no more checks. */
12203 }
12206 /* Can happen, when, eg, in a template context, Koenig lookup
12207 can't resolve begin/end (c++/58503). */
12209 else
12210 {
12212 /* The unqualified type of the __begin and __end temporaries should
12213 be the same, as required by the multiple auto declaration. */
12215 {
12222 /* P0184R0 allows __begin and __end to have different types,
12223 but make sure they are comparable so we can give a better
12225 else
12229 }
12231 }
12232 }
12233 }
12235 /* Helper function for cp_parser_perform_range_for_lookup.
12236 Builds a tree for RANGE.IDENTIFIER(). */
12238 static tree
12240 {
12253 tf_warning_or_error);
12256 }
12258 /* Parse an iteration-statement.
12260 iteration-statement:
12261 while ( condition ) statement
12262 do statement while ( expression ) ;
12263 for ( init-statement condition [opt] ; expression [opt] )
12264 statement
12266 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12268 static tree
12271 {
12274 tree statement;
12276 token_indent_info guard_tinfo;
12278 /* Peek at the next token. */
12285 /* Remember whether or not we are already within an iteration
12286 statement. */
12289 /* See what kind of keyword it is. */
12292 {
12294 {
12295 tree condition;
12297 /* Begin the while-statement. */
12299 /* Look for the `('. */
12300 matching_parens parens;
12302 /* Parse the condition. */
12305 /* Look for the `)'. */
12307 /* Parse the dependent statement. */
12313 /* We're done with the while-statement. */
12315 }
12319 {
12320 tree expression;
12322 /* Begin the do-statement. */
12324 /* Parse the body of the do-statement. */
12331 /* Look for the `while' keyword. */
12333 /* Look for the `('. */
12334 matching_parens parens;
12336 /* Parse the expression. */
12338 /* We're done with the do-statement. */
12340 /* Look for the `)'. */
12342 /* Look for the `;'. */
12344 }
12348 {
12349 /* Look for the `('. */
12350 matching_parens parens;
12355 /* Look for the `)'. */
12358 /* Parse the body of the for-statement. */
12365 /* We're done with the for-statement. */
12367 }
12374 }
12377 }
12379 /* Parse a init-statement or the declarator of a range-based-for.
12380 Returns true if a range-based-for declaration is seen.
12382 init-statement:
12383 expression-statement
12384 simple-declaration */
12386 static bool
12388 {
12389 /* If the next token is a `;', then we have an empty
12390 expression-statement. Grammatically, this is also a
12391 simple-declaration, but an invalid one, because it does not
12392 declare anything. Therefore, if we did not handle this case
12393 specially, we would issue an error message about an invalid
12394 declaration. */
12396 {
12400 /* Try to parse the init-statement. */
12402 {
12403 tree dummy;
12405 /* Parse the declaration. */
12411 /* That didn't work, try to parse it as an expression-statement. */
12415 {
12417 "range-based %<for%> loops with initializer only "
12420 }
12421 }
12423 /* A colon is used in range-based for. */
12426 /* We're going to speculatively look for a declaration, falling back
12427 to an expression, if necessary. */
12429 /* Parse the declaration. */
12432 decl);
12435 {
12436 /* It is a range-for, consume the ':'. */
12441 "range-based %<for%> loops only available with "
12443 }
12444 else
12445 /* The ';' is not consumed yet because we told
12446 cp_parser_simple_declaration not to. */
12451 /* If the tentative parse failed, then we shall need to look for an
12452 expression-statement. */
12453 }
12454 /* If we are here, it is an expression-statement. */
12457 }
12459 /* Parse a jump-statement.
12461 jump-statement:
12462 break ;
12463 continue ;
12464 return expression [opt] ;
12465 return braced-init-list ;
12466 goto identifier ;
12468 GNU extension:
12470 jump-statement:
12471 goto * expression ;
12473 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12475 static tree
12477 {
12483 /* Peek at the next token. */
12488 /* See what kind of keyword it is. */
12491 {
12495 {
12512 }
12518 {
12522 /* Fall through. */
12532 }
12537 {
12538 tree expr;
12542 {
12546 }
12549 else
12550 /* If the next token is a `;', then there is no
12551 expression. */
12553 /* Build the return-statement. */
12556 else
12558 /* Look for the final `;'. */
12560 }
12566 {
12569 }
12571 /* Create the goto-statement. */
12573 {
12574 /* Issue a warning about this use of a GNU extension. */
12576 /* Consume the '*' token. */
12578 /* Parse the dependent expression. */
12580 }
12581 else
12583 /* Look for the final `;'. */
12590 }
12593 }
12595 /* Parse a declaration-statement.
12597 declaration-statement:
12598 block-declaration */
12600 static void
12602 {
12605 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12608 /* Parse the block-declaration. */
12611 /* Free any declarators allocated. */
12613 }
12615 /* Some dependent statements (like `if (cond) statement'), are
12616 implicitly in their own scope. In other words, if the statement is
12617 a single statement (as opposed to a compound-statement), it is
12618 none-the-less treated as if it were enclosed in braces. Any
12619 declarations appearing in the dependent statement are out of scope
12620 after control passes that point. This function parses a statement,
12621 but ensures that is in its own scope, even if it is not a
12622 compound-statement.
12624 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12625 is a (possibly labeled) if statement which is not enclosed in
12626 braces and has an else clause. This is used to implement
12627 -Wparentheses.
12629 CHAIN is a vector of if-else-if conditions. This is used to implement
12630 -Wduplicated-cond.
12632 Returns the new statement. */
12634 static tree
12638 {
12639 tree statement;
12642 token_indent_info body_tinfo
12648 /* Mark if () ; with a special NOP_EXPR. */
12650 {
12661 }
12662 /* if a compound is opened, we simply parse the statement directly. */
12665 /* If the token is not a `{', then we must take special action. */
12666 else
12667 {
12668 /* Create a compound-statement. */
12670 /* Parse the dependent-statement. */
12673 /* Finish the dummy compound-statement. */
12675 }
12677 token_indent_info next_tinfo
12686 /* Return the statement. */
12688 }
12690 /* For some dependent statements (like `while (cond) statement'), we
12691 have already created a scope. Therefore, even if the dependent
12692 statement is a compound-statement, we do not want to create another
12693 scope. */
12695 static void
12698 {
12699 /* If the token is a `{', then we must take special action. */
12701 {
12702 token_indent_info body_tinfo
12708 token_indent_info next_tinfo
12717 }
12718 else
12719 {
12720 /* Avoid calling cp_parser_compound_statement, so that we
12721 don't create a new scope. Do everything else by hand. */
12722 matching_braces braces;
12724 /* If the next keyword is `__label__' we have a label declaration. */
12727 /* Parse an (optional) statement-seq. */
12730 }
12731 }
12733 /* Declarations [gram.dcl.dcl] */
12735 /* Parse an optional declaration-sequence.
12737 declaration-seq:
12738 declaration
12739 declaration-seq declaration */
12741 static void
12743 {
12745 {
12751 else
12753 }
12754 }
12756 /* Parse a declaration.
12758 declaration:
12759 block-declaration
12760 function-definition
12761 template-declaration
12762 explicit-instantiation
12763 explicit-specialization
12764 linkage-specification
12765 namespace-definition
12767 C++17:
12768 deduction-guide
12770 GNU extension:
12772 declaration:
12773 __extension__ declaration */
12775 static void
12777 {
12778 cp_token token1;
12779 cp_token token2;
12784 /* Check for the `__extension__' keyword. */
12786 {
12787 /* Parse the qualified declaration. */
12789 /* Restore the PEDANTIC flag. */
12793 }
12795 /* Try to figure out what kind of declaration is present. */
12800 else
12801 {
12804 }
12806 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12809 /* If the next token is `extern' and the following token is a string
12810 literal, then we have a linkage specification. */
12814 /* If the next token is `template', then we have either a template
12815 declaration, an explicit instantiation, or an explicit
12816 specialization. */
12818 {
12819 /* `template <>' indicates a template specialization. */
12823 /* `template <' indicates a template declaration. */
12826 /* Anything else must be an explicit instantiation. */
12827 else
12829 }
12830 /* If the next token is `export', then we have a template
12831 declaration. */
12834 /* If the next token is `extern', 'static' or 'inline' and the one
12835 after that is `template', we have a GNU extended explicit
12836 instantiation directive. */
12843 /* If the next token is `namespace', check for a named or unnamed
12844 namespace definition. */
12853 /* An unnamed namespace definition. */
12857 /* An inline (associated) namespace definition. */
12861 /* Objective-C++ declaration/definition. */
12868 /* At this point we may have a template declared by a concept
12869 introduction. */
12874 else
12875 /* Try to parse a block-declaration, or a function-definition. */
12878 /* Free any declarators allocated. */
12880 }
12882 /* Parse a namespace-scope declaration. */
12884 static void
12886 {
12890 /* A top-level declaration can consist solely of a #pragma. A
12891 nested declaration cannot, so this is done here and not in
12892 cp_parser_declaration. (A #pragma at block scope is
12893 handled in cp_parser_statement.) */
12896 {
12897 /* A declaration consisting of a single semicolon is
12898 invalid. Allow it unless we're being pedantic. */
12902 }
12903 else
12904 /* Parse the declaration itself. */
12906 }
12908 /* Parse a block-declaration.
12910 block-declaration:
12911 simple-declaration
12912 asm-definition
12913 namespace-alias-definition
12914 using-declaration
12915 using-directive
12917 GNU Extension:
12919 block-declaration:
12920 __extension__ block-declaration
12922 C++0x Extension:
12924 block-declaration:
12925 static_assert-declaration
12927 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12928 part of a declaration-statement. */
12930 static void
12933 {
12937 /* Check for the `__extension__' keyword. */
12939 {
12940 /* Parse the qualified declaration. */
12942 /* Restore the PEDANTIC flag. */
12946 }
12948 /* Peek at the next token to figure out which kind of declaration is
12949 present. */
12952 /* If the next keyword is `asm', we have an asm-definition. */
12954 {
12958 }
12959 /* If the next keyword is `namespace', we have a
12960 namespace-alias-definition. */
12963 /* If the next keyword is `using', we have a
12964 using-declaration, a using-directive, or an alias-declaration. */
12966 {
12971 /* If the token after `using' is `namespace', then we have a
12972 using-directive. */
12976 /* If the second token after 'using' is '=', then we have an
12977 alias-declaration. */
12983 /* Otherwise, it's a using-declaration. */
12984 else
12987 }
12988 /* If the next keyword is `__label__' we have a misplaced label
12989 declaration. */
12991 {
12995 /* If the next token is now a `;', consume it. */
12998 }
12999 /* If the next token is `static_assert' we have a static assertion. */
13002 /* Anything else must be a simple-declaration. */
13003 else
13006 }
13008 /* Parse a simple-declaration.
13010 simple-declaration:
13011 decl-specifier-seq [opt] init-declarator-list [opt] ;
13012 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13013 brace-or-equal-initializer ;
13015 init-declarator-list:
13016 init-declarator
13017 init-declarator-list , init-declarator
13019 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
13020 function-definition as a simple-declaration.
13022 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
13023 parsed declaration if it is an uninitialized single declarator not followed
13024 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
13025 if present, will not be consumed. */
13027 static void
13031 {
13032 cp_decl_specifier_seq decl_specifiers;
13041 /* Defer access checks until we know what is being declared; the
13042 checks for names appearing in the decl-specifier-seq should be
13043 done as if we were in the scope of the thing being declared. */
13046 /* Parse the decl-specifier-seq. We have to keep track of whether
13047 or not the decl-specifier-seq declares a named class or
13048 enumeration type, since that is the only case in which the
13049 init-declarator-list is allowed to be empty.
13051 [dcl.dcl]
13053 In a simple-declaration, the optional init-declarator-list can be
13054 omitted only when declaring a class or enumeration, that is when
13055 the decl-specifier-seq contains either a class-specifier, an
13056 elaborated-type-specifier, or an enum-specifier. */
13058 CP_PARSER_FLAGS_OPTIONAL,
13061 /* We no longer need to defer access checks. */
13064 /* In a block scope, a valid declaration must always have a
13065 decl-specifier-seq. By not trying to parse declarators, we can
13066 resolve the declaration/expression ambiguity more quickly. */
13069 {
13072 }
13074 /* If the next two tokens are both identifiers, the code is
13075 erroneous. The usual cause of this situation is code like:
13077 T t;
13079 where "T" should name a type -- but does not. */
13082 {
13083 /* If parsing tentatively, we should commit; we really are
13084 looking at a declaration. */
13086 /* Give up. */
13088 }
13093 /* Look for C++17 decomposition declaration. */
13101 {
13102 tree decl
13104 maybe_range_for_decl,
13107 /* The next token should be either a `,' or a `;'. */
13109 /* If it's a `;', we are done. */
13113 {
13117 }
13118 /* Anything else is an error. */
13119 else
13120 {
13121 /* If we have already issued an error message we don't need
13122 to issue another one. */
13127 /* Skip tokens until we reach the end of the statement. */
13129 /* If the next token is now a `;', consume it. */
13133 }
13134 }
13135 else
13138 tree last_type;
13140 /* NULL_TREE if both variable and function declaration are allowed,
13141 error_mark_node if function declaration are not allowed and
13142 a FUNCTION_DECL that should be diagnosed if it is followed by
13143 variable declarations. */
13144 tree auto_function_declaration;
13147 auto_specifier_p
13151 /* Keep going until we hit the `;' at the end of the simple
13152 declaration. */
13155 CPP_SEMICOLON))
13156 {
13159 tree decl;
13163 {
13164 /* If we are processing next declarator, comma is expected */
13169 {
13173 }
13174 }
13175 else
13178 /* Parse the init-declarator. */
13181 function_definition_allowed_p,
13183 declares_class_or_enum,
13185 maybe_range_for_decl,
13188 /* If an error occurred while parsing tentatively, exit quickly.
13189 (That usually happens when in the body of a function; each
13190 statement is treated as a declaration-statement until proven
13191 otherwise.) */
13196 {
13197 /* If the init-declarator-list contains more than one
13198 init-declarator, they shall all form declarations of
13199 variables. */
13201 auto_function_declaration
13205 {
13207 "non-variable %qD in declaration with more than one "
13212 }
13213 }
13217 {
13221 {
13222 /* If the list of declarators contains more than one declarator,
13223 the type of each declared variable is determined as described
13224 above. If the type deduced for the template parameter U is not
13225 the same in each deduction, the program is ill-formed. */
13230 }
13231 else
13233 }
13235 /* Handle function definitions specially. */
13237 {
13238 /* If the next token is a `,', then we are probably
13239 processing something like:
13241 void f() {}, *p;
13243 which is erroneous. */
13245 {
13248 "mixing"
13250 }
13251 /* Otherwise, we're done with the list of declarators. */
13252 else
13253 {
13256 }
13257 }
13260 /* The next token should be either a `,' or a `;'. */
13262 /* If it's a `,', there are more declarators to come. */
13265 /* If it's a `;', we are done. */
13269 {
13274 }
13275 /* Anything else is an error. */
13276 else
13277 {
13278 /* If we have already issued an error message we don't need
13279 to issue another one. */
13284 /* Skip tokens until we reach the end of the statement. */
13286 /* If the next token is now a `;', consume it. */
13290 }
13291 /* After the first time around, a function-definition is not
13292 allowed -- even if it was OK at first. For example:
13294 int i, f() {}
13296 is not valid. */
13298 }
13300 /* Issue an error message if no declarators are present, and the
13301 decl-specifier-seq does not itself declare a class or
13302 enumeration: [dcl.dcl]/3. */
13304 {
13306 {
13310 /* Ensure an error is issued anyway when finish_decltype_type,
13311 called via cp_parser_decl_specifier_seq, returns a class or
13312 an enumeration (c++/51786). */
13315 }
13316 /* Perform any deferred access checks. */
13318 }
13320 /* Consume the `;'. */
13321 finish:
13325 {
13331 }
13333 done:
13335 }
13337 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13338 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13339 initializer ; */
13341 static tree
13346 {
13351 /* Parse the identifier-list. */
13355 {
13363 }
13367 {
13373 else
13374 {
13377 }
13378 }
13384 tree pushed_scope;
13391 NULL_TREE);
13398 cp_expr e;
13399 cp_decl_specifier_seq decl_specs;
13404 {
13407 else
13410 tree elt_pushed_scope;
13416 {
13417 /* Ensure we've diagnosed redeclaration if we aren't creating
13418 a new VAR_DECL. */
13421 }
13422 else
13426 }
13429 {
13432 }
13436 {
13444 || (is_direct_init
13447 {
13451 }
13454 {
13459 }
13460 }
13462 {
13464 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13465 the underlying DECL. */
13467 }
13473 {
13476 }
13479 }
13481 /* Parse a decl-specifier-seq.
13483 decl-specifier-seq:
13484 decl-specifier-seq [opt] decl-specifier
13485 decl-specifier attribute-specifier-seq [opt] (C++11)
13487 decl-specifier:
13488 storage-class-specifier
13489 type-specifier
13490 function-specifier
13491 friend
13492 typedef
13494 GNU Extension:
13496 decl-specifier:
13497 attributes
13499 Concepts Extension:
13501 decl-specifier:
13502 concept
13504 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13506 The parser flags FLAGS is used to control type-specifier parsing.
13508 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13509 flags:
13511 1: one of the decl-specifiers is an elaborated-type-specifier
13512 (i.e., a type declaration)
13513 2: one of the decl-specifiers is an enum-specifier or a
13514 class-specifier (i.e., a type definition)
13516 */
13518 static void
13520 cp_parser_flags flags,
13523 {
13527 cp_decl_spec ds;
13529 /* Clear DECL_SPECS. */
13532 /* Assume no class or enumeration type is declared. */
13535 /* Keep reading specifiers until there are no more to read. */
13537 {
13542 /* Peek at the next token. */
13545 /* Save the first token of the decl spec list for error
13546 reporting. */
13549 /* Handle attributes. */
13551 {
13552 /* Parse the attributes. */
13555 /* In a sequence of declaration specifiers, c++11 attributes
13556 appertain to the type that precede them. In that case
13557 [dcl.spec]/1 says:
13559 The attribute-specifier-seq affects the type only for
13560 the declaration it appears in, not other declarations
13561 involving the same type.
13563 But for now let's force the user to position the
13564 attribute either at the beginning of the declaration or
13565 after the declarator-id, which would clearly mean that it
13566 applies to the declarator. */
13568 {
13570 /* The c++11 attribute is at the beginning of the
13571 declaration. It appertains to the entity being
13573 else
13574 {
13576 {
13577 /* This is an attribute following a
13578 class-specifier. */
13583 }
13584 else
13585 {
13586 decl_specs->std_attributes
13590 }
13592 }
13593 }
13595 decl_specs->attributes
13600 }
13601 /* Assume we will find a decl-specifier keyword. */
13603 /* If the next token is an appropriate keyword, we can simply
13604 add it to the list. */
13606 {
13607 /* decl-specifier:
13608 friend
13609 constexpr */
13612 {
13617 }
13618 else
13619 {
13621 /* Consume the token. */
13623 }
13636 /* function-specifier:
13637 inline
13638 virtual
13639 explicit */
13646 /* decl-specifier:
13647 typedef */
13650 /* Consume the token. */
13652 /* A constructor declarator cannot appear in a typedef. */
13654 /* The "typedef" keyword can only occur in a declaration; we
13655 may as well commit at this point. */
13662 /* storage-class-specifier:
13663 auto
13664 register
13665 static
13666 extern
13667 mutable
13669 GNU Extension:
13670 thread */
13673 {
13674 /* Consume the token. */
13677 /* Complain about `auto' as a storage specifier, if
13678 we're complaining about C++0x compatibility. */
13682 "%<auto%> changes meaning in C++11; "
13685 /* Set the storage class anyway. */
13687 token);
13688 }
13689 else
13690 /* C++0x auto type-specifier. */
13698 /* Consume the token. */
13701 token);
13704 /* Consume the token. */
13710 /* We did not yet find a decl-specifier yet. */
13713 }
13730 /* Constructors are a special case. The `S' in `S()' is not a
13731 decl-specifier; it is the beginning of the declarator. */
13732 constructor_p
13733 = (!found_decl_spec
13734 && constructor_possible_p
13735 && (cp_parser_constructor_declarator_p
13738 /* If we don't have a DECL_SPEC yet, then we must be looking at
13739 a type-specifier. */
13741 {
13744 tree type_spec;
13746 type_spec
13748 decl_specs,
13754 /* If this type-specifier referenced a user-defined type
13755 (a typedef, class-name, etc.), then we can't allow any
13756 more such type-specifiers henceforth.
13758 [dcl.spec]
13760 The longest sequence of decl-specifiers that could
13761 possibly be a type name is taken as the
13762 decl-specifier-seq of a declaration. The sequence shall
13763 be self-consistent as described below.
13765 [dcl.type]
13767 As a general rule, at most one type-specifier is allowed
13768 in the complete decl-specifier-seq of a declaration. The
13769 only exceptions are the following:
13771 -- const or volatile can be combined with any other
13772 type-specifier.
13774 -- signed or unsigned can be combined with char, long,
13775 short, or int.
13777 -- ..
13779 Example:
13781 typedef char* Pc;
13782 void g (const int Pc);
13784 Here, Pc is *not* part of the decl-specifier seq; it's
13785 the declarator. Therefore, once we see a type-specifier
13786 (other than a cv-qualifier), we forbid any additional
13787 user-defined types. We *do* still allow things like `int
13788 int' to be considered a decl-specifier-seq, and issue the
13789 error message later. */
13792 /* A constructor declarator cannot follow a type-specifier. */
13794 {
13802 }
13803 }
13805 /* If we still do not have a DECL_SPEC, then there are no more
13806 decl-specifiers. */
13811 /* After we see one decl-specifier, further decl-specifiers are
13812 always optional. */
13814 }
13816 /* Don't allow a friend specifier with a class definition. */
13821 }
13823 /* Parse an (optional) storage-class-specifier.
13825 storage-class-specifier:
13826 auto
13827 register
13828 static
13829 extern
13830 mutable
13832 GNU Extension:
13834 storage-class-specifier:
13835 thread
13837 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13839 static tree
13841 {
13843 {
13847 /* Fall through for C++98. */
13855 /* Consume the token. */
13860 }
13861 }
13863 /* Parse an (optional) function-specifier.
13865 function-specifier:
13866 inline
13867 virtual
13868 explicit
13870 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13871 Updates DECL_SPECS, if it is non-NULL. */
13873 static tree
13876 {
13879 {
13885 /* 14.5.2.3 [temp.mem]
13887 A member function template shall not be virtual. */
13891 else
13901 }
13903 /* Consume the token. */
13905 }
13907 /* Parse a linkage-specification.
13909 linkage-specification:
13910 extern string-literal { declaration-seq [opt] }
13911 extern string-literal declaration */
13913 static void
13915 {
13916 tree linkage;
13918 /* Look for the `extern' keyword. */
13919 cp_token *extern_token
13922 /* Look for the string-literal. */
13926 /* Transform the literal into an identifier. If the literal is a
13927 wide-character string, or contains embedded NULs, then we can't
13928 handle it as the user wants. */
13931 {
13933 /* Assume C++ linkage. */
13935 }
13936 else
13939 /* We're now using the new linkage. */
13942 /* Preserve the location of the the innermost linkage specification,
13943 tracking the locations of nested specifications via a local. */
13944 location_t saved_location
13946 /* Construct a location ranging from the start of the "extern" to
13947 the end of the string-literal, with the caret at the start, e.g.:
13948 extern "C" {
13949 ^~~~~~~~~~
13950 */
13951 parser->innermost_linkage_specification_location
13956 /* If the next token is a `{', then we're using the first
13957 production. */
13959 {
13963 /* Consume the `{' token. */
13964 matching_braces braces;
13966 /* Parse the declarations. */
13968 /* Look for the closing `}'. */
13970 }
13971 /* Otherwise, there's just one declaration. */
13972 else
13973 {
13976 saved_in_unbraced_linkage_specification_p
13980 parser->in_unbraced_linkage_specification_p
13982 }
13984 /* We're done with the linkage-specification. */
13987 /* Restore location of parent linkage specification, if any. */
13989 }
13991 /* Parse a static_assert-declaration.
13993 static_assert-declaration:
13994 static_assert ( constant-expression , string-literal ) ;
13995 static_assert ( constant-expression ) ; (C++17)
13997 If MEMBER_P, this static_assert is a class member. */
13999 static void
14001 {
14002 cp_expr condition;
14003 location_t token_loc;
14004 tree message;
14007 /* Peek at the `static_assert' token so we can keep track of exactly
14008 where the static assertion started. */
14011 /* Look for the `static_assert' keyword. */
14013 RT_STATIC_ASSERT))
14016 /* We know we are in a static assertion; commit to any tentative
14017 parse. */
14021 /* Parse the `(' starting the static assertion condition. */
14022 matching_parens parens;
14025 /* Parse the constant-expression. Allow a non-constant expression
14026 here in order to give better diagnostics in finish_static_assert. */
14027 condition =
14033 {
14036 "static_assert without a message "
14038 /* Eat the ')' */
14043 }
14044 else
14045 {
14046 /* Parse the separating `,'. */
14049 /* Parse the string-literal message. */
14054 /* A `)' completes the static assertion. */
14060 }
14062 /* A semicolon terminates the declaration. */
14065 /* Get the location for the static assertion. Use that of the
14066 condition if available, otherwise, use that of the "static_assert"
14067 token. */
14072 /* Complete the static assertion, which may mean either processing
14073 the static assert now or saving it for template instantiation. */
14075 }
14077 /* Parse the expression in decltype ( expression ). */
14079 static tree
14082 {
14084 tree expr;
14086 /* Since we're going to preserve any side-effects from this parse, set up a
14087 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14088 in the expression. */
14091 /* First, try parsing an id-expression. */
14102 {
14105 cp_id_kind idk;
14109 /* Lookup the name we got back from the id-expression. */
14114 /* A template without args is not a complete id-expression. */
14123 {
14124 /* Complete lookup of the id-expression. */
14125 expr = (finish_id_expression
14138 /* We found an id-expression, but it was something that we
14139 should not have found. This is an error, not something
14140 we can recover from, so note that we found an
14141 id-expression and we'll recover as gracefully as
14142 possible. */
14144 }
14149 /* We have an id-expression. */
14151 }
14154 {
14155 /* Abort the id-expression parse. */
14158 /* Parsing tentatively, again. */
14161 /* Parse a class member access. */
14169 /* We have an id-expression. */
14171 }
14174 /* We have parsed the complete id-expression or member access. */
14176 else
14177 {
14178 /* Abort our attempt to parse an id-expression or member access
14179 expression. */
14182 /* Commit to the tentative_firewall so we get syntax errors. */
14185 /* Parse a full expression. */
14188 }
14191 }
14193 /* Parse a `decltype' type. Returns the type.
14195 simple-type-specifier:
14196 decltype ( expression )
14197 C++14 proposal:
14198 decltype ( auto ) */
14200 static tree
14202 {
14207 {
14208 /* Already parsed. */
14211 }
14213 /* Look for the `decltype' token. */
14217 /* Parse the opening `('. */
14218 matching_parens parens;
14228 /* decltype (auto) */
14230 else
14231 {
14232 /* decltype (expression) */
14234 /* Types cannot be defined in a `decltype' expression. Save away the
14235 old message and set the new one. */
14237 parser->type_definition_forbidden_message
14240 /* The restrictions on constant-expressions do not apply inside
14241 decltype expressions. */
14242 bool saved_integral_constant_expression_p
14244 bool saved_non_integral_constant_expression_p
14248 /* Within a parenthesized expression, a `>' token is always
14249 the greater-than operator. */
14250 bool saved_greater_than_is_operator_p
14254 /* Do not actually evaluate the expression. */
14257 /* Do not warn about problems with the expression. */
14262 /* Go back to evaluating expressions. */
14266 /* The `>' token might be the end of a template-id or
14267 template-parameter-list now. */
14268 parser->greater_than_is_operator_p
14271 /* Restore the old message and the integral constant expression
14272 flags. */
14274 parser->integral_constant_expression_p
14276 parser->non_integral_constant_expression_p
14278 }
14280 /* Parse to the closing `)'. */
14282 {
14287 }
14290 {
14291 /* Build auto. */
14294 }
14295 else
14297 tf_warning_or_error);
14299 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14300 it again. */
14311 }
14313 /* Special member functions [gram.special] */
14315 /* Parse a conversion-function-id.
14317 conversion-function-id:
14318 operator conversion-type-id
14320 Returns an IDENTIFIER_NODE representing the operator. */
14322 static tree
14324 {
14325 tree type;
14326 tree saved_scope;
14327 tree saved_qualifying_scope;
14328 tree saved_object_scope;
14331 /* Look for the `operator' token. */
14334 /* When we parse the conversion-type-id, the current scope will be
14335 reset. However, we need that information in able to look up the
14336 conversion function later, so we save it here. */
14340 /* We must enter the scope of the class so that the names of
14341 entities declared within the class are available in the
14342 conversion-type-id. For example, consider:
14344 struct S {
14345 typedef int I;
14346 operator I();
14347 };
14349 S::operator I() { ... }
14351 In order to see that `I' is a type-name in the definition, we
14352 must be in the scope of `S'. */
14355 /* Parse the conversion-type-id. */
14357 /* Leave the scope of the class, if any. */
14360 /* Restore the saved scope. */
14364 /* If the TYPE is invalid, indicate failure. */
14368 }
14370 /* Parse a conversion-type-id:
14372 conversion-type-id:
14373 type-specifier-seq conversion-declarator [opt]
14375 Returns the TYPE specified. */
14377 static tree
14379 {
14380 tree attributes;
14381 cp_decl_specifier_seq type_specifiers;
14383 tree type_specified;
14386 /* Parse the attributes. */
14390 parser->type_definition_forbidden_message
14393 /* Parse the type-specifiers. */
14400 /* If that didn't work, stop. */
14403 /* Parse the conversion-declarator. */
14411 /* Don't give this error when parsing tentatively. This happens to
14412 work because we always parse this definitively once. */
14415 {
14417 {
14420 }
14424 }
14427 }
14429 /* Parse an (optional) conversion-declarator.
14431 conversion-declarator:
14432 ptr-operator conversion-declarator [opt]
14434 */
14438 {
14441 cp_cv_quals cv_quals;
14443 /* We don't know if there's a ptr-operator next, or not. */
14445 /* Try the ptr-operator. */
14448 /* If it worked, look for more conversion-declarators. */
14450 {
14453 /* Parse another optional declarator. */
14456 declarator = cp_parser_make_indirect_declarator
14460 }
14463 }
14465 /* Parse an (optional) ctor-initializer.
14467 ctor-initializer:
14468 : mem-initializer-list */
14470 static void
14472 {
14473 /* If the next token is not a `:', then there is no
14474 ctor-initializer. */
14476 {
14477 /* Do default initialization of any bases and members. */
14481 }
14483 /* Consume the `:' token. */
14485 /* And the mem-initializer-list. */
14487 }
14489 /* Parse a mem-initializer-list.
14491 mem-initializer-list:
14492 mem-initializer ... [opt]
14493 mem-initializer ... [opt] , mem-initializer-list */
14495 static void
14497 {
14502 /* Let the semantic analysis code know that we are starting the
14503 mem-initializer-list. */
14508 /* Loop through the list. */
14510 {
14511 tree mem_initializer;
14514 /* Parse the mem-initializer. */
14516 /* If the next token is a `...', we're expanding member initializers. */
14522 {
14523 /* Consume the `...'. */
14527 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14528 can be expanded but members cannot. */
14531 {
14536 }
14538 /* Construct the pack expansion type. */
14541 }
14544 {
14548 }
14549 /* Look for a target constructor. */
14553 {
14556 {
14560 }
14562 }
14563 /* Add it to the list, unless it was erroneous. */
14565 {
14568 }
14569 /* If the next token is not a `,', we're done. */
14572 /* Consume the `,' token. */
14574 }
14576 /* Perform semantic analysis. */
14579 }
14581 /* Parse a mem-initializer.
14583 mem-initializer:
14584 mem-initializer-id ( expression-list [opt] )
14585 mem-initializer-id braced-init-list
14587 GNU extension:
14589 mem-initializer:
14590 ( expression-list [opt] )
14592 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14593 class) or FIELD_DECL (for a non-static data member) to initialize;
14594 the TREE_VALUE is the expression-list. An empty initialization
14595 list is represented by void_list_node. */
14597 static tree
14599 {
14600 tree mem_initializer_id;
14601 tree expression_list;
14602 tree member;
14605 /* Find out what is being initialized. */
14607 {
14611 }
14612 else
14613 {
14617 }
14623 {
14630 }
14631 else
14632 {
14642 }
14652 }
14654 /* Parse a mem-initializer-id.
14656 mem-initializer-id:
14657 :: [opt] nested-name-specifier [opt] class-name
14658 decltype-specifier (C++11)
14659 identifier
14661 Returns a TYPE indicating the class to be initialized for the first
14662 production (and the second in C++11). Returns an IDENTIFIER_NODE
14663 indicating the data member to be initialized for the last production. */
14665 static tree
14667 {
14671 tree id;
14675 /* `typename' is not allowed in this context ([temp.res]). */
14677 {
14679 "keyword %<typename%> not allowed in this context (a qualified "
14682 }
14683 /* Look for the optional `::' operator. */
14684 global_scope_p
14688 /* Look for the optional nested-name-specifier. The simplest way to
14689 implement:
14691 [temp.res]
14693 The keyword `typename' is not permitted in a base-specifier or
14694 mem-initializer; in these contexts a qualified name that
14695 depends on a template-parameter is implicitly assumed to be a
14696 type name.
14698 is to assume that we have seen the `typename' keyword at this
14699 point. */
14700 nested_name_specifier_p
14709 /* If there is a `::' operator or a nested-name-specifier, then we
14710 are definitely looking for a class-name. */
14715 typename_type,
14719 /* Otherwise, we could also be looking for an ordinary identifier. */
14722 /* Try a decltype-specifier. */
14724 else
14725 /* Otherwise, try a class-name. */
14729 none_type,
14733 /* If we found one, we're done. */
14736 /* Otherwise, look for an ordinary identifier. */
14738 }
14740 /* Overloading [gram.over] */
14742 /* Parse an operator-function-id.
14744 operator-function-id:
14745 operator operator
14747 Returns an IDENTIFIER_NODE for the operator which is a
14748 human-readable spelling of the identifier, e.g., `operator +'. */
14750 static cp_expr
14752 {
14753 /* Look for the `operator' keyword. */
14756 /* And then the name of the operator itself. */
14758 }
14760 /* Return an identifier node for a user-defined literal operator.
14761 The suffix identifier is chained to the operator name identifier. */
14763 tree
14765 {
14766 tree identifier;
14773 }
14775 /* Parse an operator.
14777 operator:
14778 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14779 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14780 || ++ -- , ->* -> () []
14782 GNU Extensions:
14784 operator:
14785 <? >? <?= >?=
14787 Returns an IDENTIFIER_NODE for the operator which is a
14788 human-readable spelling of the identifier, e.g., `operator +'. */
14790 static cp_expr
14792 {
14797 /* Peek at the next token. */
14802 /* Figure out which operator we have. */
14807 {
14809 {
14810 /* The keyword should be either `new' or `delete'. */
14815 else
14818 /* Consume the `new' or `delete' token. */
14821 /* Peek at the next token. */
14823 /* If it's a `[' token then this is the array variant of the
14824 operator. */
14826 {
14827 /* Consume the `[' token. */
14829 /* Look for the `]' token. */
14834 }
14838 }
14996 {
14997 /* Consume the `('. */
14998 matching_parens parens;
15000 /* Look for the matching `)'. */
15005 }
15008 /* Consume the `['. */
15010 /* Look for the matching `]'. */
15019 /* FALLTHRU */
15028 {
15035 /* Consume the string. */
15041 {
15044 }
15045 else
15046 {
15048 /* Look for the suffix identifier. */
15053 {
15057 }
15058 else
15059 {
15062 }
15063 }
15068 {
15071 }
15074 {
15077 }
15079 {
15082 }
15084 }
15087 /* Anything else is an error. */
15089 }
15091 /* If we have selected an identifier, we need to consume the
15092 operator token. */
15094 {
15098 }
15099 /* Otherwise, no valid operator name was present. */
15100 else
15101 {
15104 }
15107 }
15109 /* Parse a template-declaration.
15111 template-declaration:
15112 export [opt] template < template-parameter-list > declaration
15114 If MEMBER_P is TRUE, this template-declaration occurs within a
15115 class-specifier.
15117 The grammar rule given by the standard isn't correct. What
15118 is really meant is:
15120 template-declaration:
15121 export [opt] template-parameter-list-seq
15122 decl-specifier-seq [opt] init-declarator [opt] ;
15123 export [opt] template-parameter-list-seq
15124 function-definition
15126 template-parameter-list-seq:
15127 template-parameter-list-seq [opt]
15128 template < template-parameter-list >
15130 Concept Extensions:
15132 template-parameter-list-seq:
15133 template < template-parameter-list > requires-clause [opt]
15135 requires-clause:
15136 requires logical-or-expression */
15138 static void
15140 {
15141 /* Check for `export'. */
15143 {
15144 /* Consume the `export' token. */
15146 /* Warn that we do not support `export'. */
15148 }
15151 }
15153 /* Parse a template-parameter-list.
15155 template-parameter-list:
15156 template-parameter
15157 template-parameter-list , template-parameter
15159 Returns a TREE_LIST. Each node represents a template parameter.
15160 The nodes are connected via their TREE_CHAINs. */
15162 static tree
15164 {
15169 /* The loop below parses the template parms. We first need to know
15170 the total number of template parms to be able to compute proper
15171 canonical types of each dependent type. So after the loop, when
15172 we know the total number of template parms,
15173 end_template_parm_list computes the proper canonical types and
15174 fixes up the dependent types accordingly. */
15176 {
15177 tree parameter;
15180 location_t parm_loc;
15182 /* Parse the template-parameter. */
15187 /* Add it to the list. */
15190 parm_loc,
15191 parameter,
15192 is_non_type,
15193 is_parameter_pack);
15194 else
15195 {
15198 }
15200 /* If the next token is not a `,', we're done. */
15203 /* Otherwise, consume the `,' token. */
15205 }
15208 }
15210 /* Parse a introduction-list.
15212 introduction-list:
15213 introduced-parameter
15214 introduction-list , introduced-parameter
15216 introduced-parameter:
15217 ...[opt] identifier
15219 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15220 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15221 WILDCARD_DECL will also have DECL_NAME set and token location in
15222 DECL_SOURCE_LOCATION. */
15224 static tree
15226 {
15230 {
15239 /* Build placeholder. */
15247 /* If the next token is not a `,', we're done. */
15250 /* Otherwise, consume the `,' token. */
15252 }
15254 /* Convert the vec into a TREE_VEC. */
15257 tree parm;
15263 }
15265 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15266 is an abstract declarator. */
15270 {
15275 }
15277 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15278 is an abstract declarator. */
15282 {
15286 else
15288 }
15290 /* Returns true if DECL represents a constrained-parameter. */
15294 {
15299 }
15301 /* Returns true if PARM declares a constrained-parameter. */
15305 {
15307 }
15309 /* Check that the type parameter is only a declarator-id, and that its
15310 type is not cv-qualified. */
15312 bool
15315 {
15320 {
15323 }
15325 /* Don't allow cv-qualified type parameters. */
15328 {
15331 }
15334 }
15336 /* Finish parsing/processing a template type parameter and checking
15337 various restrictions. */
15341 tree id,
15343 {
15346 else
15348 }
15350 static tree
15352 {
15353 /* FIXME: This should probably be copied, and we may need to adjust
15354 the template parameter depths. */
15364 }
15366 /* Finish parsing/processing a template template parameter by borrowing
15367 the template parameter list from the prototype parameter. */
15369 static tree
15371 tree proto,
15372 tree id,
15374 {
15378 }
15380 /* Create a new non-type template parameter from the given PARM
15381 declarator. */
15383 static tree
15386 {
15392 }
15394 /* Build a constrained template parameter based on the PARMDECL
15395 declarator. The type of PARMDECL is the constrained type, which
15396 refers to the prototype template parameter that ultimately
15397 specifies the type of the declared parameter. */
15399 static tree
15404 {
15410 /* A template parameter constrained by a variadic concept shall also
15411 be declared as a template parameter pack. */
15416 /* Build the parameter. Return an error if the declarator was invalid. */
15417 tree parm;
15422 parmdecl);
15423 else
15428 /* Finish the parameter decl and create a node attaching the
15429 default argument and constraint. */
15434 }
15436 /* Returns true if the parsed type actually represents the declaration
15437 of a type template-parameter. */
15441 {
15444 }
15447 /* Returns true if the parsed type actually represents the declaration of
15448 a template template-parameter. */
15450 static bool
15452 {
15455 }
15457 /* Parse a default argument for a type template-parameter.
15458 Note that diagnostics are handled in cp_parser_template_parameter. */
15460 static tree
15462 {
15465 /* Consume the `=' token. */
15470 /* Parse the default-argument. */
15476 {
15480 }
15483 }
15485 /* Parse a default argument for a template template-parameter. */
15487 static tree
15489 {
15494 /* Consume the `='. */
15496 /* Parse the id-expression. */
15498 /* save token before parsing the id-expression, for error
15499 reporting */
15501 tree default_argument
15509 /* If the id-expression was a template-id that refers to
15510 a template-class, we already have the declaration here,
15511 so no further lookup is needed. */
15512 ;
15513 else
15514 /* Look up the name. */
15515 default_argument
15517 none_type,
15523 /* See if the default argument is valid. */
15527 }
15529 /* Parse a template-parameter.
15531 template-parameter:
15532 type-parameter
15533 parameter-declaration
15535 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15536 the parameter. The TREE_PURPOSE is the default value, if any.
15537 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15538 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15539 set to true iff this parameter is a parameter pack. */
15541 static tree
15544 {
15547 tree parm;
15549 /* Assume it is a type parameter or a template parameter. */
15551 /* Assume it not a parameter pack. */
15553 /* Peek at the next token. */
15555 /* If it is `template', we have a type-parameter. */
15558 /* If it is `class' or `typename' we do not know yet whether it is a
15559 type parameter or a non-type parameter. Consider:
15561 template <typename T, typename T::X X> ...
15563 or:
15565 template <class C, class D*> ...
15567 Here, the first parameter is a type parameter, and the second is
15568 a non-type parameter. We can tell by looking at the token after
15569 the identifier -- if it is a `,', `=', or `>' then we have a type
15570 parameter. */
15572 {
15573 /* Peek at the token after `class' or `typename'. */
15575 /* If it's an ellipsis, we have a template type parameter
15576 pack. */
15579 /* If it's an identifier, skip it. */
15582 /* Now, see if the token looks like the end of a template
15583 parameter. */
15588 }
15590 /* Otherwise, it is a non-type parameter or a constrained parameter.
15592 [temp.param]
15594 When parsing a default template-argument for a non-type
15595 template-parameter, the first non-nested `>' is taken as the end
15596 of the template parameter-list rather than a greater-than
15597 operator. */
15598 parameter_declarator
15605 /* If the parameter declaration is marked as a parameter pack, set
15606 *IS_PARAMETER_PACK to notify the caller. */
15611 {
15612 /* Can happen in some cases of erroneous input (c++/34892). */
15614 /* Consume the `...' for better error recovery. */
15616 }
15618 // The parameter may have been constrained.
15621 parameter_declarator,
15622 is_non_type,
15623 is_parameter_pack);
15625 // Now we're sure that the parameter is a non-type parameter.
15636 }
15638 /* Parse a type-parameter.
15640 type-parameter:
15641 class identifier [opt]
15642 class identifier [opt] = type-id
15643 typename identifier [opt]
15644 typename identifier [opt] = type-id
15645 template < template-parameter-list > class identifier [opt]
15646 template < template-parameter-list > class identifier [opt]
15647 = id-expression
15649 GNU Extension (variadic templates):
15651 type-parameter:
15652 class ... identifier [opt]
15653 typename ... identifier [opt]
15655 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15656 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15657 the declaration of the parameter.
15659 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15661 static tree
15663 {
15665 tree parameter;
15667 /* Look for a keyword to tell us what kind of parameter this is. */
15673 {
15676 {
15677 tree identifier;
15678 tree default_argument;
15680 /* If the next token is an ellipsis, we have a template
15681 argument pack. */
15683 {
15684 /* Consume the `...' token. */
15689 }
15691 /* If the next token is an identifier, then it names the
15692 parameter. */
15695 else
15698 /* Create the parameter. */
15701 /* If the next token is an `=', we have a default argument. */
15703 {
15704 default_argument
15707 /* Template parameter packs cannot have default
15708 arguments. */
15710 {
15713 "template parameter pack %qD cannot have a "
15715 else
15717 "template parameter packs cannot have "
15720 }
15723 }
15724 else
15727 /* Create the combined representation of the parameter and the
15728 default argument. */
15730 }
15734 {
15735 tree identifier;
15736 tree default_argument;
15738 /* Look for the `<'. */
15740 /* Parse the template-parameter-list. */
15742 /* Look for the `>'. */
15745 // If template requirements are present, parse them.
15747 {
15752 }
15754 /* Look for the `class' or 'typename' keywords. */
15756 /* If the next token is an ellipsis, we have a template
15757 argument pack. */
15759 {
15760 /* Consume the `...' token. */
15765 }
15766 /* If the next token is an `=', then there is a
15767 default-argument. If the next token is a `>', we are at
15768 the end of the parameter-list. If the next token is a `,',
15769 then we are at the end of this parameter. */
15773 {
15775 /* Treat invalid names as if the parameter were nameless. */
15778 }
15779 else
15782 /* Create the template parameter. */
15784 identifier);
15786 /* If the next token is an `=', then there is a
15787 default-argument. */
15789 {
15790 default_argument
15793 /* Template parameter packs cannot have default
15794 arguments. */
15796 {
15799 "template parameter pack %qD cannot "
15801 identifier);
15802 else
15806 }
15807 }
15808 else
15811 /* Create the combined representation of the parameter and the
15812 default argument. */
15814 }
15820 }
15823 }
15825 /* Parse a template-id.
15827 template-id:
15828 template-name < template-argument-list [opt] >
15830 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15831 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15832 returned. Otherwise, if the template-name names a function, or set
15833 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15834 names a class, returns a TYPE_DECL for the specialization.
15836 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15837 uninstantiated templates. */
15839 static tree
15845 {
15846 tree templ;
15847 tree arguments;
15848 tree template_id;
15853 /* If the next token corresponds to a template-id, there is no need
15854 to reparse it. */
15857 {
15860 }
15862 /* Avoid performing name lookup if there is no possibility of
15863 finding a template-id. */
15866 && !cp_parser_nth_token_starts_template_argument_list_p
15868 {
15871 }
15873 /* Remember where the template-id starts. */
15879 /* Parse the template-name. */
15882 check_dependency_p,
15883 is_declaration,
15884 tag_type,
15887 {
15890 }
15892 /* Since we're going to preserve any side-effects from this parse, set up a
15893 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15894 in the template arguments. */
15897 /* If we find the sequence `[:' after a template-name, it's probably
15898 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15899 parse correctly the argument list. */
15906 {
15908 /* Change `:' into `::'. */
15910 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15911 CPP_LESS. */
15914 /* Parse the arguments. */
15917 {
15918 /* If we couldn't parse an argument list, then we revert our changes
15919 and return simply an error. Maybe this is not a template-id
15920 after all. */
15925 }
15926 /* Otherwise, emit an error about the invalid digraph, but continue
15927 parsing because we got our argument list. */
15930 {
15933 "%<<:%> is an alternate spelling for %<[%>."
15936 {
15938 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15941 }
15942 }
15943 }
15944 else
15945 {
15946 /* Look for the `<' that starts the template-argument-list. */
15948 {
15951 }
15952 /* Parse the arguments. */
15954 }
15956 /* Set the location to be of the form:
15957 template-name < template-argument-list [opt] >
15958 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15959 with caret == start at the start of the template-name,
15960 ranging until the closing '>'. */
15961 location_t finish_loc
15963 location_t combined_loc
15966 /* Check for concepts autos where they don't belong. We could
15967 identify types in some cases of idnetifier TEMPL, looking ahead
15968 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
15969 types. We reject them in functions, but if what we have is an
15970 identifier, even with none_type we can't conclude it's NOT a
15971 type, we have to wait for template substitution. */
15974 /* Build a representation of the specialization. */
15977 TEMPLATE_ID_EXPR,
15981 {
15982 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15983 template (rather than some instantiation thereof) only if
15984 is not nested within some other construct. For example, in
15985 "template <typename T> void f(T) { A<T>::", A<T> is just an
15986 instantiation of A. */
15987 bool entering_scope
15990 template_id
15992 }
15993 /* A template-like identifier may be a partial concept id. */
15999 {
16003 }
16004 else
16005 {
16006 /* If it's not a class-template or a template-template, it should be
16007 a function-template. */
16015 }
16017 /* If parsing tentatively, replace the sequence of tokens that makes
16018 up the template-id with a CPP_TEMPLATE_ID token. That way,
16019 should we re-parse the token stream, we will not have to repeat
16020 the effort required to do the parse, nor will we issue duplicate
16021 error messages about problems during instantiation of the
16022 template. */
16024 /* Don't do this if we had a parse error in a declarator; re-parsing
16025 might succeed if a name changes meaning (60361). */
16029 {
16030 /* Reset the contents of the START_OF_ID token. */
16034 /* Retrieve any deferred checks. Do not pop this access checks yet
16035 so the memory will not be reclaimed during token replacing below. */
16041 /* Purge all subsequent tokens. */
16044 /* ??? Can we actually assume that, if template_id ==
16045 error_mark_node, we will have issued a diagnostic to the
16046 user, as opposed to simply marking the tentative parse as
16047 failed? */
16050 }
16054 }
16056 /* Parse a template-name.
16058 template-name:
16059 identifier
16061 The standard should actually say:
16063 template-name:
16064 identifier
16065 operator-function-id
16067 A defect report has been filed about this issue.
16069 A conversion-function-id cannot be a template name because they cannot
16070 be part of a template-id. In fact, looking at this code:
16072 a.operator K<int>()
16074 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
16075 It is impossible to call a templated conversion-function-id with an
16076 explicit argument list, since the only allowed template parameter is
16077 the type to which it is converting.
16079 If TEMPLATE_KEYWORD_P is true, then we have just seen the
16080 `template' keyword, in a construction like:
16082 T::template f<3>()
16084 In that case `f' is taken to be a template-name, even though there
16085 is no way of knowing for sure.
16087 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
16088 name refers to a set of overloaded functions, at least one of which
16089 is a template, or an IDENTIFIER_NODE with the name of the template,
16090 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
16091 names are looked up inside uninstantiated templates. */
16093 static tree
16100 {
16101 tree identifier;
16102 tree decl;
16105 /* If the next token is `operator', then we have either an
16106 operator-function-id or a conversion-function-id. */
16108 {
16109 /* We don't know whether we're looking at an
16110 operator-function-id or a conversion-function-id. */
16112 /* Try an operator-function-id. */
16114 /* If that didn't work, try a conversion-function-id. */
16116 {
16119 }
16120 }
16121 /* Look for the identifier. */
16122 else
16125 /* If we didn't find an identifier, we don't have a template-id. */
16129 /* If the name immediately followed the `template' keyword, then it
16130 is a template-name. However, if the next token is not `<', then
16131 we do not treat it as a template-name, since it is not being used
16132 as part of a template-id. This enables us to handle constructs
16133 like:
16135 template <typename T> struct S { S(); };
16136 template <typename T> S<T>::S();
16138 correctly. We would treat `S' as a template -- if it were `S<T>'
16139 -- but we do not if there is no `<'. */
16143 {
16144 /* In a declaration, in a dependent context, we pretend that the
16145 "template" keyword was present in order to improve error
16146 recovery. For example, given:
16148 template <typename T> void f(T::X<int>);
16150 we want to treat "X<int>" as a template-id. */
16152 && !template_keyword_p
16154 && check_dependency_p
16156 /* Do not do this for dtors (or ctors), since they never
16157 need the template keyword before their name. */
16159 {
16162 /* Explain what went wrong. */
16164 identifier);
16167 /* If parsing tentatively, find the location of the "<" token. */
16170 /* Parse the template arguments so that we can issue error
16171 messages about them. */
16174 /* Skip tokens until we find a good place from which to
16175 continue parsing. */
16180 /* If parsing tentatively, permanently remove the
16181 template argument list. That will prevent duplicate
16182 error messages from being issued about the missing
16183 "template" keyword. */
16190 }
16192 /* If the "template" keyword is present, then there is generally
16193 no point in doing name-lookup, so we just return IDENTIFIER.
16194 But, if the qualifying scope is non-dependent then we can
16195 (and must) do name-lookup normally. */
16197 {
16203 {
16204 /* We're optimizing away the call to cp_parser_lookup_name, but
16205 we still need to do this. */
16208 }
16209 }
16210 }
16212 /* Look up the name. */
16214 tag_type,
16217 check_dependency_p,
16223 /* If DECL is a template, then the name was a template-name. */
16225 {
16229 }
16230 else
16231 {
16232 /* The standard does not explicitly indicate whether a name that
16233 names a set of overloaded declarations, some of which are
16234 templates, is a template-name. However, such a name should
16235 be a template-name; otherwise, there is no way to form a
16236 template-id for the overloaded templates. */
16245 {
16246 /* The name does not name a template. */
16249 }
16250 }
16252 /* If DECL is dependent, and refers to a function, then just return
16253 its name; we will look it up again during template instantiation. */
16255 {
16259 }
16262 }
16264 /* Parse a template-argument-list.
16266 template-argument-list:
16267 template-argument ... [opt]
16268 template-argument-list , template-argument ... [opt]
16270 Returns a TREE_VEC containing the arguments. */
16272 static tree
16274 {
16279 tree vec;
16286 /* Even if the template-id appears in an integral
16287 constant-expression, the contents of the argument list do
16288 not. */
16294 /* Parse the arguments. */
16295 do
16296 {
16297 tree argument;
16300 /* Consume the comma. */
16303 /* Parse the template-argument. */
16306 /* If the next token is an ellipsis, we're expanding a template
16307 argument pack. */
16309 {
16311 {
16315 }
16316 /* Consume the `...' token. */
16319 /* Make the argument into a TYPE_PACK_EXPANSION or
16320 EXPR_PACK_EXPANSION. */
16322 }
16325 {
16329 {
16332 }
16333 else
16335 }
16337 }
16353 }
16355 /* Parse a template-argument.
16357 template-argument:
16358 assignment-expression
16359 type-id
16360 id-expression
16362 The representation is that of an assignment-expression, type-id, or
16363 id-expression -- except that the qualified id-expression is
16364 evaluated, so that the value returned is either a DECL or an
16365 OVERLOAD.
16367 Although the standard says "assignment-expression", it forbids
16368 throw-expressions or assignments in the template argument.
16369 Therefore, we use "conditional-expression" instead. */
16371 static tree
16373 {
16374 tree argument;
16380 cp_id_kind idk;
16382 /* There's really no way to know what we're looking at, so we just
16383 try each alternative in order.
16385 [temp.arg]
16387 In a template-argument, an ambiguity between a type-id and an
16388 expression is resolved to a type-id, regardless of the form of
16389 the corresponding template-parameter.
16391 Therefore, we try a type-id first. */
16394 /* If there was no error parsing the type-id but the next token is a
16395 '>>', our behavior depends on which dialect of C++ we're
16396 parsing. In C++98, we probably found a typo for '> >'. But there
16397 are type-id which are also valid expressions. For instance:
16399 struct X { int operator >> (int); };
16400 template <int V> struct Foo {};
16401 Foo<X () >> 5> r;
16403 Here 'X()' is a valid type-id of a function type, but the user just
16404 wanted to write the expression "X() >> 5". Thus, we remember that we
16405 found a valid type-id, but we still try to parse the argument as an
16406 expression to see what happens.
16408 In C++0x, the '>>' will be considered two separate '>'
16409 tokens. */
16413 {
16416 }
16417 else
16418 {
16419 /* If the next token isn't a `,' or a `>', then this argument wasn't
16420 really finished. This means that the argument is not a valid
16421 type-id. */
16424 /* If that worked, we're done. */
16427 }
16428 /* We're still not sure what the argument will be. */
16430 /* Try a template. */
16438 /* If the next token isn't a `,' or a `>', then this argument wasn't
16439 really finished. */
16443 {
16444 /* Figure out what is being referred to. If the id-expression
16445 was for a class template specialization, then we will have a
16446 TYPE_DECL at this point. There is no need to do name lookup
16447 at this point in that case. */
16450 none_type,
16456 /* Handle a constrained-type-specifier for a non-type template
16457 parameter. */
16463 }
16465 {
16469 }
16470 /* It must be a non-type argument. In C++17 any constant-expression is
16471 allowed. */
16475 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16477 -- an integral constant-expression of integral or enumeration
16478 type; or
16480 -- the name of a non-type template-parameter; or
16482 -- the name of an object or function with external linkage...
16484 -- the address of an object or function with external linkage...
16486 -- a pointer to member... */
16487 /* Look for a non-type template parameter. */
16489 {
16501 }
16503 /* If the next token is "&", the argument must be the address of an
16504 object or function with external linkage. */
16507 {
16510 }
16511 /* See if we might have an id-expression. */
16518 {
16521 address_p,
16528 else
16529 {
16530 tree probe;
16533 {
16534 /* Strip the dereference temporarily. */
16537 }
16539 /* If we're in a template, we represent a qualified-id referring
16540 to a static data member as a SCOPE_REF even if the scope isn't
16541 dependent so that we can check access control later. */
16546 {
16547 /* A variable without external linkage might still be a
16548 valid constant-expression, so no error is issued here
16549 if the external-linkage check fails. */
16552 }
16554 /* All overloaded functions are allowed; if the external
16555 linkage test does not pass, an error will be issued
16556 later. */
16557 ;
16561 /* A pointer-to-member. */
16562 ;
16564 ;
16565 else
16569 {
16572 tf_warning_or_error);
16573 else
16576 }
16577 }
16578 }
16579 /* If the argument started with "&", there are no other valid
16580 alternatives at this point. */
16582 {
16585 }
16587 general_expr:
16588 /* If the argument wasn't successfully parsed as a type-id followed
16589 by '>>', the argument can only be a constant expression now.
16590 Otherwise, we try parsing the constant-expression tentatively,
16591 because the argument could really be a type-id. */
16597 else
16598 {
16599 /* With C++17 generalized non-type template arguments we need to handle
16600 lvalue constant expressions, too. */
16603 }
16611 /* We did our best to parse the argument as a non type-id, but that
16612 was the only alternative that matched (albeit with a '>' after
16613 it). We can assume it's just a typo from the user, and a
16614 diagnostic will then be issued. */
16616 }
16618 /* Parse an explicit-instantiation.
16620 explicit-instantiation:
16621 template declaration
16623 Although the standard says `declaration', what it really means is:
16625 explicit-instantiation:
16626 template decl-specifier-seq [opt] declarator [opt] ;
16628 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16629 supposed to be allowed. A defect report has been filed about this
16630 issue.
16632 GNU Extension:
16634 explicit-instantiation:
16635 storage-class-specifier template
16636 decl-specifier-seq [opt] declarator [opt] ;
16637 function-specifier template
16638 decl-specifier-seq [opt] declarator [opt] ; */
16640 static void
16642 {
16644 cp_decl_specifier_seq decl_specifiers;
16649 /* Look for an (optional) storage-class-specifier or
16650 function-specifier. */
16652 {
16653 extension_specifier
16656 extension_specifier
16659 }
16661 /* Look for the `template' keyword. */
16663 /* Let the front end know that we are processing an explicit
16664 instantiation. */
16666 /* [temp.explicit] says that we are supposed to ignore access
16667 control while processing explicit instantiation directives. */
16669 /* Parse a decl-specifier-seq. */
16671 CP_PARSER_FLAGS_OPTIONAL,
16674 /* If there was exactly one decl-specifier, and it declared a class,
16675 and there's no declarator, then we have an explicit type
16676 instantiation. */
16678 {
16679 tree type;
16683 /* Turn access control back on for names used during
16684 template instantiation. */
16689 }
16690 else
16691 {
16693 tree decl;
16695 /* Parse the declarator. */
16696 declarator
16707 {
16710 "explicit instantiation shall not use"
16714 "explicit instantiation shall not use"
16719 /* Turn access control back on for names used during
16720 template instantiation. */
16722 /* Do the explicit instantiation. */
16724 }
16725 else
16726 {
16728 /* Skip the body of the explicit instantiation. */
16730 }
16731 }
16732 /* We're done with the instantiation. */
16738 }
16740 /* Parse an explicit-specialization.
16742 explicit-specialization:
16743 template < > declaration
16745 Although the standard says `declaration', what it really means is:
16747 explicit-specialization:
16748 template <> decl-specifier [opt] init-declarator [opt] ;
16749 template <> function-definition
16750 template <> explicit-specialization
16751 template <> template-declaration */
16753 static void
16755 {
16759 /* Look for the `template' keyword. */
16761 /* Look for the `<'. */
16763 /* Look for the `>'. */
16765 /* We have processed another parameter list. */
16767 /* [temp]
16769 A template ... explicit specialization ... shall not have C
16770 linkage. */
16772 {
16775 /* Give it C++ linkage to avoid confusing other parts of the
16776 front end. */
16779 }
16780 else
16782 /* Let the front end know that we are beginning a specialization. */
16784 {
16787 }
16789 /* If the next keyword is `template', we need to figure out whether
16790 or not we're looking a template-declaration. */
16792 {
16797 else
16799 }
16800 else
16801 /* Parse the dependent declaration. */
16807 /* We're done with the specialization. */
16809 /* For the erroneous case of a template with C linkage, we pushed an
16810 implicit C++ linkage scope; exit that scope now. */
16813 /* We're done with this parameter list. */
16815 }
16817 /* Parse a type-specifier.
16819 type-specifier:
16820 simple-type-specifier
16821 class-specifier
16822 enum-specifier
16823 elaborated-type-specifier
16824 cv-qualifier
16826 GNU Extension:
16828 type-specifier:
16829 __complex__
16831 Returns a representation of the type-specifier. For a
16832 class-specifier, enum-specifier, or elaborated-type-specifier, a
16833 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16835 The parser flags FLAGS is used to control type-specifier parsing.
16837 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16838 in a decl-specifier-seq.
16840 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16841 class-specifier, enum-specifier, or elaborated-type-specifier, then
16842 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16843 if a type is declared; 2 if it is defined. Otherwise, it is set to
16844 zero.
16846 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16847 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16848 is set to FALSE. */
16850 static tree
16852 cp_parser_flags flags,
16857 {
16863 /* Assume this type-specifier does not declare a new type. */
16866 /* And that it does not specify a cv-qualifier. */
16869 /* Peek at the next token. */
16872 /* If we're looking at a keyword, we can use that to guide the
16873 production we choose. */
16876 {
16881 /* Look for the enum-specifier. */
16883 /* If that worked, we're done. */
16885 {
16890 type_spec,
16891 token,
16894 }
16895 else
16898 /* Any of these indicate either a class-specifier, or an
16899 elaborated-type-specifier. */
16906 /* Parse tentatively so that we can back up if we don't find a
16907 class-specifier. */
16909 /* Look for the class-specifier. */
16912 /* If that worked, we're done. */
16914 {
16919 type_spec,
16920 token,
16923 }
16925 /* Fall through. */
16926 elaborated_type_specifier:
16927 /* We're declaring (not defining) a class or enum. */
16931 /* Fall through. */
16933 /* Look for an elaborated-type-specifier. */
16934 type_spec
16935 = (cp_parser_elaborated_type_specifier
16938 is_declaration));
16941 type_spec,
16942 token,
16965 /* The `__complex__' keyword is a GNU extension. */
16971 }
16973 /* Handle simple keywords. */
16975 {
16977 {
16980 }
16982 }
16984 /* If we do not already have a type-specifier, assume we are looking
16985 at a simple-type-specifier. */
16987 decl_specs,
16988 flags);
16990 /* If we didn't find a type-specifier, and a type-specifier was not
16991 optional in this context, issue an error message. */
16993 {
16996 }
16999 }
17001 /* Parse a simple-type-specifier.
17003 simple-type-specifier:
17004 :: [opt] nested-name-specifier [opt] type-name
17005 :: [opt] nested-name-specifier template template-id
17006 char
17007 wchar_t
17008 bool
17009 short
17010 int
17011 long
17012 signed
17013 unsigned
17014 float
17015 double
17016 void
17018 C++11 Extension:
17020 simple-type-specifier:
17021 auto
17022 decltype ( expression )
17023 char16_t
17024 char32_t
17025 __underlying_type ( type-id )
17027 C++17 extension:
17029 nested-name-specifier(opt) template-name
17031 GNU Extension:
17033 simple-type-specifier:
17034 __int128
17035 __typeof__ unary-expression
17036 __typeof__ ( type-id )
17037 __typeof__ ( type-id ) { initializer-list , [opt] }
17039 Concepts Extension:
17041 simple-type-specifier:
17042 constrained-type-specifier
17044 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
17045 appropriately updated. */
17047 static tree
17050 cp_parser_flags flags)
17051 {
17056 /* Peek at the next token. */
17059 /* If we're looking at a keyword, things are easy. */
17061 {
17096 {
17099 }
17128 {
17129 /* The 'auto' might be the placeholder return type for a function decl
17130 with trailing return type. */
17139 {
17141 {
17148 }
17151 {
17154 }
17157 }
17161 {
17164 }
17167 {
17170 }
17171 else
17175 {
17178 "use of %<auto%> in lambda parameter declaration "
17179 "only available with "
17181 }
17184 "use of %<auto%> in parameter declaration "
17185 "only available with "
17189 "use of %<auto%> in parameter declaration "
17191 }
17192 else
17197 /* Since DR 743, decltype can either be a simple-type-specifier by
17198 itself or begin a nested-name-specifier. Parsing it will replace
17199 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17200 handling below decide what to do. */
17206 /* Consume the `typeof' token. */
17208 /* Parse the operand to `typeof'. */
17210 /* If it is not already a TYPE, take its type. */
17216 token,
17225 token,
17235 token,
17240 }
17242 /* If token is an already-parsed decltype not followed by ::,
17243 it's a simple-type-specifier. */
17246 {
17249 {
17251 token,
17253 /* Remember that we are handling a decltype in order to
17254 implement the resolution of DR 1510 when the argument
17255 isn't instantiation dependent. */
17257 }
17260 }
17262 /* If the type-specifier was for a built-in type, we're done. */
17264 {
17265 /* Record the type. */
17272 type,
17273 token,
17278 /* Consume the token. */
17284 /* There is no valid C++ program where a non-template type is
17285 followed by a "<". That usually indicates that the user thought
17286 that the type was a template. */
17291 }
17293 /* The type-specifier must be a user-defined type. */
17295 {
17299 /* Don't gobble tokens or issue error messages if this is an
17300 optional type-specifier. */
17306 /* Look for the optional `::' operator. */
17307 global_p
17311 /* Look for the nested-name specifier. */
17312 qualified_p
17319 /* If we have seen a nested-name-specifier, and the next token
17320 is `template', then we are using the template-id production. */
17323 {
17324 /* Look for the template-id. */
17328 none_type,
17330 /* If the template-id did not name a type, we are out of
17331 luck. */
17333 {
17336 }
17337 }
17338 /* Otherwise, look for a type-name. */
17339 else
17341 /* Keep track of all name-lookups performed in class scopes. */
17343 && !global_p
17344 && !qualified_p
17348 /* If it didn't work out, we don't have a TYPE. */
17353 {
17367 {
17369 none_type,
17379 else
17380 {
17385 }
17386 }
17387 else
17393 }
17396 token,
17398 }
17400 /* If we didn't get a type-name, issue an error message. */
17402 {
17405 }
17408 {
17409 /* See if TYPE is an Objective-C type, and if so, parse and
17410 accept any protocol references following it. Do this before
17411 the cp_parser_check_for_invalid_template_id() call, because
17412 Objective-C types can be followed by '<...>' which would
17413 enclose protocol names rather than template arguments, and so
17414 everything is fine. */
17417 {
17421 /* Clobber the "unqualified" type previously entered into
17422 DECL_SPECS with the new, improved protocol-qualified version. */
17427 }
17429 /* There is no valid C++ program where a non-template type is
17430 followed by a "<". That usually indicates that the user
17431 thought that the type was a template. */
17433 none_type,
17435 }
17438 }
17440 /* Parse a type-name.
17442 type-name:
17443 class-name
17444 enum-name
17445 typedef-name
17446 simple-template-id [in c++0x]
17448 enum-name:
17449 identifier
17451 typedef-name:
17452 identifier
17454 Concepts:
17456 type-name:
17457 concept-name
17458 partial-concept-id
17460 concept-name:
17461 identifier
17463 Returns a TYPE_DECL for the type. */
17465 static tree
17467 {
17469 }
17471 /* See above. */
17472 static tree
17474 {
17475 tree type_decl;
17477 /* We can't know yet whether it is a class-name or not. */
17479 /* Try a class-name. */
17481 typename_keyword_p,
17483 none_type,
17487 /* If it's not a class-name, keep looking. */
17489 {
17491 /* It must be a typedef-name or an enum-name. */
17495 /* It is either a simple-template-id representing an
17496 instantiation of an alias template... */
17500 none_type,
17502 /* Note that this must be an instantiation of an alias template
17503 because [temp.names]/6 says:
17505 A template-id that names an alias template specialization
17506 is a type-name.
17508 Whereas [temp.names]/7 says:
17510 A simple-template-id that names a class template
17511 specialization is a class-name.
17513 With concepts, this could also be a partial-concept-id that
17514 declares a non-type template parameter. */
17521 else
17525 /* ... Or a typedef-name or an enum-name. */
17527 }
17530 }
17532 /* Check if DECL and ARGS can form a constrained-type-specifier.
17533 If ARGS is non-null, we try to form a concept check of the
17534 form DECL<?, ARGS> where ? is a wildcard that matches any
17535 kind of template argument. If ARGS is NULL, then we try to
17536 form a concept check of the form DECL<?>. */
17538 static tree
17541 {
17544 /* If we a constrained-type-specifier cannot be deduced. */
17548 /* A constrained type specifier can only be found in an
17549 overload set or as a reference to a template declaration.
17551 FIXME: This might be masking a bug. It's possible that
17552 that the deduction below is causing template specializations
17553 to be formed with the wildcard as an argument. */
17557 /* Try to build a call expression that evaluates the
17558 concept. This can fail if the overload set refers
17559 only to non-templates. */
17565 /* Deduce the checked constraint and the prototype parameter.
17567 FIXME: In certain cases, failure to deduce should be a
17568 diagnosable error. */
17569 tree conc;
17570 tree proto;
17574 /* In template parameter scope, this results in a constrained
17575 parameter. Return a descriptor of that parm. */
17579 /* In a parameter-declaration-clause, constrained-type
17580 specifiers result in invented template parameters. */
17582 {
17585 }
17586 else
17587 {
17588 /* Otherwise, we're in a context where the constrained
17589 type name is deduced and the constraint applies
17590 after deduction. */
17592 }
17595 }
17597 /* If DECL refers to a concept, return a TYPE_DECL representing
17598 the result of using the constrained type specifier in the
17599 current context. DECL refers to a concept if
17601 - it is an overload set containing a function concept taking a single
17602 type argument, or
17604 - it is a variable concept taking a single type argument. */
17606 static tree
17608 {
17614 else
17616 }
17618 /* Check if DECL and ARGS form a partial-concept-id. If so,
17619 assign ID to the resulting constrained placeholder.
17621 Returns true if the partial-concept-id designates a placeholder
17622 and false otherwise. Note that *id is set to NULL_TREE in
17623 this case. */
17625 static tree
17627 {
17629 }
17631 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17632 or a concept-name.
17634 enum-name:
17635 identifier
17637 typedef-name:
17638 identifier
17640 concept-name:
17641 identifier
17643 Returns a TYPE_DECL for the type. */
17645 static tree
17647 {
17648 tree type_decl;
17649 tree identifier;
17656 /* Look up the type-name. */
17661 /* If we found an overload set, then it may refer to a concept-name. */
17667 {
17668 /* See if this is an Objective-C type. */
17673 }
17675 /* Issue an error if we did not find a type-name. */
17677 /* In Objective-C, we have the complication that class names are
17678 normally type names and start declarations (eg, the
17679 "NSObject" in "NSObject *object;"), but can be used in an
17680 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17681 is an expression. So, a classname followed by a dot is not a
17682 valid type-name. */
17685 {
17690 }
17691 /* Remember that the name was used in the definition of the
17692 current class so that we can check later to see if the
17693 meaning would have been different after the class was
17694 entirely defined. */
17700 }
17702 /* Parse an elaborated-type-specifier. Note that the grammar given
17703 here incorporates the resolution to DR68.
17705 elaborated-type-specifier:
17706 class-key :: [opt] nested-name-specifier [opt] identifier
17707 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17708 enum-key :: [opt] nested-name-specifier [opt] identifier
17709 typename :: [opt] nested-name-specifier identifier
17710 typename :: [opt] nested-name-specifier template [opt]
17711 template-id
17713 GNU extension:
17715 elaborated-type-specifier:
17716 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17717 class-key attributes :: [opt] nested-name-specifier [opt]
17718 template [opt] template-id
17719 enum attributes :: [opt] nested-name-specifier [opt] identifier
17721 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17722 declared `friend'. If IS_DECLARATION is TRUE, then this
17723 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17724 something is being declared.
17726 Returns the TYPE specified. */
17728 static tree
17732 {
17734 tree identifier;
17737 tree globalscope;
17740 /* See if we're looking at the `enum' keyword. */
17742 {
17743 /* Consume the `enum' token. */
17745 /* Remember that it's an enumeration type. */
17747 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17748 enums) is used here. */
17752 {
17759 /* Consume the `struct' or `class' and parse it anyway. */
17761 }
17762 /* Parse the attributes. */
17764 }
17765 /* Or, it might be `typename'. */
17767 RID_TYPENAME))
17768 {
17769 /* Consume the `typename' token. */
17771 /* Remember that it's a `typename' type. */
17773 }
17774 /* Otherwise it must be a class-key. */
17775 else
17776 {
17780 /* Parse the attributes. */
17782 }
17784 /* Look for the `::' operator. */
17787 /* Look for the nested-name-specifier. */
17788 tree nested_name_specifier;
17790 {
17791 nested_name_specifier
17796 is_declaration);
17799 }
17800 else
17801 /* Even though `typename' is not present, the proposed resolution
17802 to Core Issue 180 says that in `class A<T>::B', `B' should be
17803 considered a type-name, even if `A<T>' is dependent. */
17804 nested_name_specifier
17809 is_declaration);
17810 /* For everything but enumeration types, consider a template-id.
17811 For an enumeration type, consider only a plain identifier. */
17813 {
17815 tree decl;
17817 /* Allow the `template' keyword. */
17819 /* If we didn't see `template', we don't know if there's a
17820 template-id or not. */
17823 /* Parse the template-id. */
17827 tag_type,
17828 is_declaration);
17829 /* If we didn't find a template-id, look for an ordinary
17830 identifier. */
17832 ;
17833 /* We can get here when cp_parser_template_id, called by
17834 cp_parser_class_name with tag_type == none_type, succeeds
17835 and caches a BASELINK. Then, when called again here,
17836 instead of failing and returning an error_mark_node
17837 returns it (see template/typename17.C in C++11).
17838 ??? Could we diagnose this earlier? */
17840 {
17843 }
17844 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17845 in effect, then we must assume that, upon instantiation, the
17846 template will correspond to a class. */
17850 typename_type,
17852 /* If the `typename' keyword is in effect and DECL is not a type
17853 decl, then type is non existent. */
17855 ;
17857 {
17861 /* If the next token is a semicolon, this must be a specialization,
17862 instantiation, or friend declaration. Check the scope while we
17863 still know whether or not we had a nested-name-specifier. */
17868 }
17871 }
17874 {
17879 {
17882 }
17884 /* For a `typename', we needn't call xref_tag. */
17890 /* Template parameter lists apply only if we are not within a
17891 function parameter list. */
17892 bool template_parm_lists_apply
17901 /* Look up a qualified name in the usual way. */
17903 {
17904 tree decl;
17905 tree ambiguous_decls;
17908 tag_type,
17915 /* If the lookup was ambiguous, an error will already have been
17916 issued. */
17920 /* If we are parsing friend declaration, DECL may be a
17921 TEMPLATE_DECL tree node here. However, we need to check
17922 whether this TEMPLATE_DECL results in valid code. Consider
17923 the following example:
17925 namespace N {
17926 template <class T> class C {};
17927 }
17928 class X {
17929 template <class T> friend class N::C; // #1, valid code
17930 };
17931 template <class T> class Y {
17932 friend class N::C; // #2, invalid code
17933 };
17935 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17936 name lookup of `N::C'. We see that friend declaration must
17937 be template for the code to be valid. Note that
17938 processing_template_decl does not work here since it is
17939 always 1 for the above two cases. */
17941 decl = (cp_parser_maybe_treat_template_as_class
17946 {
17948 identifier,
17951 }
17954 {
17958 allow_template);
17962 }
17964 /* Forward declarations of nested types, such as
17966 class C1::C2;
17967 class C1::C2::C3;
17969 are invalid unless all components preceding the final '::'
17970 are complete. If all enclosing types are complete, these
17971 declarations become merely pointless.
17973 Invalid forward declarations of nested types are errors
17974 caught elsewhere in parsing. Those that are pointless arrive
17975 here. */
17982 }
17983 else
17984 {
17985 /* An elaborated-type-specifier sometimes introduces a new type and
17986 sometimes names an existing type. Normally, the rule is that it
17987 introduces a new type only if there is not an existing type of
17988 the same name already in scope. For example, given:
17990 struct S {};
17991 void f() { struct S s; }
17993 the `struct S' in the body of `f' is the same `struct S' as in
17994 the global scope; the existing definition is used. However, if
17995 there were no global declaration, this would introduce a new
17996 local class named `S'.
17998 An exception to this rule applies to the following code:
18000 namespace N { struct S; }
18002 Here, the elaborated-type-specifier names a new type
18003 unconditionally; even if there is already an `S' in the
18004 containing scope this declaration names a new type.
18005 This exception only applies if the elaborated-type-specifier
18006 forms the complete declaration:
18008 [class.name]
18010 A declaration consisting solely of `class-key identifier ;' is
18011 either a redeclaration of the name in the current scope or a
18012 forward declaration of the identifier as a class name. It
18013 introduces the name into the current scope.
18015 We are in this situation precisely when the next token is a `;'.
18017 An exception to the exception is that a `friend' declaration does
18018 *not* name a new type; i.e., given:
18020 struct S { friend struct T; };
18022 `T' is not a new type in the scope of `S'.
18024 Also, `new struct S' or `sizeof (struct S)' never results in the
18025 definition of a new type; a new type can only be declared in a
18026 declaration context. */
18028 tag_scope ts;
18032 /* Friends have special name lookup rules. */
18036 CPP_SEMICOLON))
18037 /* This is a `class-key identifier ;' */
18039 else
18042 template_p =
18043 (template_parm_lists_apply
18046 /* An unqualified name was used to reference this type, so
18047 there were no qualifying templates. */
18056 }
18057 }
18062 /* Allow attributes on forward declarations of classes. */
18064 {
18074 else
18077 }
18080 {
18081 /* Indicate whether this class was declared as a `class' or as a
18082 `struct'. */
18086 }
18088 /* A "<" cannot follow an elaborated type specifier. If that
18089 happens, the user was probably trying to form a template-id. */
18094 }
18096 /* Parse an enum-specifier.
18098 enum-specifier:
18099 enum-head { enumerator-list [opt] }
18100 enum-head { enumerator-list , } [C++0x]
18102 enum-head:
18103 enum-key identifier [opt] enum-base [opt]
18104 enum-key nested-name-specifier identifier enum-base [opt]
18106 enum-key:
18107 enum
18108 enum class [C++0x]
18109 enum struct [C++0x]
18111 enum-base: [C++0x]
18112 : type-specifier-seq
18114 opaque-enum-specifier:
18115 enum-key identifier enum-base [opt] ;
18117 GNU Extensions:
18118 enum-key attributes[opt] identifier [opt] enum-base [opt]
18119 { enumerator-list [opt] }attributes[opt]
18120 enum-key attributes[opt] identifier [opt] enum-base [opt]
18121 { enumerator-list, }attributes[opt] [C++0x]
18123 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
18124 if the token stream isn't an enum-specifier after all. */
18126 static tree
18128 {
18129 tree identifier;
18131 tree prev_scope;
18133 tree attributes;
18146 /* Parse tentatively so that we can back up if we don't find a
18147 enum-specifier. */
18150 /* Caller guarantees that the current token is 'enum', an identifier
18151 possibly follows, and the token after that is an opening brace.
18152 If we don't have an identifier, fabricate an anonymous name for
18153 the enumeration being defined. */
18156 /* Parse the "class" or "struct", which indicates a scoped
18157 enumeration type in C++0x. */
18160 {
18164 /* Consume the `struct' or `class' token. */
18168 }
18172 /* Clear the qualification. */
18177 /* Figure out in what scope the declaration is being placed. */
18183 nested_name_specifier
18191 {
18192 tree name;
18196 enum_type,
18201 input_location);
18203 {
18206 {
18207 /* Are template enums allowed in ISO? */
18211 /* ignore a typename reference, for it will be solved by name
18212 in start_enum. */
18214 }
18215 }
18218 else
18219 {
18224 }
18225 }
18226 else
18227 {
18230 else
18231 {
18237 }
18238 }
18241 /* Check for the `:' that denotes a specified underlying type in C++0x.
18242 Note that a ':' could also indicate a bitfield width, however. */
18244 {
18245 cp_decl_specifier_seq type_specifiers;
18247 /* Consume the `:'. */
18250 /* Parse the type-specifier-seq. */
18255 /* At this point this is surely not elaborated type specifier. */
18264 /* If that didn't work, stop. */
18266 {
18272 }
18273 }
18275 /* Look for the `{' but don't consume it yet. */
18277 {
18279 {
18282 {
18285 }
18286 }
18287 /* An opaque-enum-specifier must have a ';' here. */
18290 {
18293 {
18296 }
18297 }
18298 }
18304 {
18306 {
18310 }
18312 {
18314 }
18315 }
18317 /* Issue an error message if type-definitions are forbidden here. */
18320 else
18321 /* Create the new type. We do this before consuming the opening
18322 brace so the enum will be recorded as being on the line of its
18323 tag (or the 'enum' keyword, if there is no tag). */
18327 /* If the next token is not '{' it is an opaque-enum-specifier or an
18328 elaborated-type-specifier. */
18330 {
18334 {
18335 /* The following catches invalid code such as:
18336 enum class S<int>::E { A, B, C }; */
18344 {
18348 nested_name_specifier);
18350 }
18353 {
18355 "%qT for enum declaration does not name a class "
18358 }
18359 /* If that scope does not contain the scope in which the
18360 class was originally declared, the program is invalid. */
18362 nested_name_specifier))
18363 {
18366 "declaration of %qD in namespace %qD which does not "
18369 else
18371 "declaration of %qD in %qD which does not "
18375 }
18376 /* If that scope is the scope where the declaration is being placed
18377 the program is invalid. */
18381 {
18385 }
18386 }
18391 /* Consume the opening brace. */
18392 matching_braces braces;
18399 {
18403 }
18404 else
18405 {
18411 }
18415 /* If the next token is not '}', then there are some enumerators. */
18417 {
18421 }
18422 else
18425 /* Consume the final '}'. */
18431 }
18432 else
18433 {
18434 /* If a ';' follows, then it is an opaque-enum-specifier
18435 and additional restrictions apply. */
18437 {
18444 }
18445 }
18447 /* Look for trailing attributes to apply to this enumeration, and
18448 apply them if appropriate. */
18450 {
18453 trailing_attr,
18455 }
18457 /* Finish up the enumeration. */
18459 {
18464 }
18467 {
18469 {
18472 }
18474 {
18476 }
18477 }
18478 out:
18481 }
18483 /* Parse an enumerator-list. The enumerators all have the indicated
18484 TYPE.
18486 enumerator-list:
18487 enumerator-definition
18488 enumerator-list , enumerator-definition */
18490 static void
18492 {
18494 {
18495 /* Parse an enumerator-definition. */
18498 /* If the next token is not a ',', we've reached the end of
18499 the list. */
18502 /* Otherwise, consume the `,' and keep going. */
18504 /* If the next token is a `}', there is a trailing comma. */
18506 {
18511 }
18512 }
18513 }
18515 /* Parse an enumerator-definition. The enumerator has the indicated
18516 TYPE.
18518 enumerator-definition:
18519 enumerator
18520 enumerator = constant-expression
18522 enumerator:
18523 identifier
18525 GNU Extensions:
18527 enumerator-definition:
18528 enumerator attributes [opt]
18529 enumerator attributes [opt] = constant-expression */
18531 static void
18533 {
18534 tree identifier;
18535 tree value;
18536 location_t loc;
18538 /* Save the input location because we are interested in the location
18539 of the identifier and not the location of the explicit value. */
18542 /* Look for the identifier. */
18547 /* Parse any specified attributes. */
18550 /* If the next token is an '=', then there is an explicit value. */
18552 {
18553 /* Consume the `=' token. */
18555 /* Parse the value. */
18557 }
18558 else
18561 /* If we are processing a template, make sure the initializer of the
18562 enumerator doesn't contain any bare template parameter pack. */
18566 /* Create the enumerator. */
18568 }
18570 /* Parse a namespace-name.
18572 namespace-name:
18573 original-namespace-name
18574 namespace-alias
18576 Returns the NAMESPACE_DECL for the namespace. */
18578 static tree
18580 {
18581 tree identifier;
18582 tree namespace_decl;
18586 /* Get the name of the namespace. */
18591 /* Look up the identifier in the currently active scope. Look only
18592 for namespaces, due to:
18594 [basic.lookup.udir]
18596 When looking up a namespace-name in a using-directive or alias
18597 definition, only namespace names are considered.
18599 And:
18601 [basic.lookup.qual]
18603 During the lookup of a name preceding the :: scope resolution
18604 operator, object, function, and enumerator names are ignored.
18606 (Note that cp_parser_qualifying_entity only calls this
18607 function if the token after the name is the scope resolution
18608 operator.) */
18610 none_type,
18616 /* If it's not a namespace, issue an error. */
18619 {
18621 {
18622 auto_diagnostic_group d;
18628 }
18631 }
18634 }
18636 /* Parse a namespace-definition.
18638 namespace-definition:
18639 named-namespace-definition
18640 unnamed-namespace-definition
18642 named-namespace-definition:
18643 original-namespace-definition
18644 extension-namespace-definition
18646 original-namespace-definition:
18647 namespace identifier { namespace-body }
18649 extension-namespace-definition:
18650 namespace original-namespace-name { namespace-body }
18652 unnamed-namespace-definition:
18653 namespace { namespace-body } */
18655 static void
18657 {
18658 tree identifier;
18667 {
18670 }
18672 /* Look for the `namespace' keyword. */
18673 cp_token* token
18676 /* Parse any specified attributes before the identifier. */
18680 {
18684 {
18689 "standard attributes on namespaces must precede "
18692 /* Parse any attributes specified after the identifier. */
18694 }
18701 "nested namespace definitions only available with "
18704 /* Nested namespace names can create new namespaces (unlike
18705 other qualified-ids). */
18708 else
18711 }
18723 /* Start the namespace. */
18730 /* Look for the `{' to validate starting the namespace. */
18731 matching_braces braces;
18733 {
18734 /* Parse the body of the namespace. */
18737 /* Look for the final `}'. */
18739 }
18744 /* Pop the nested namespace definitions. */
18747 }
18749 /* Parse a namespace-body.
18751 namespace-body:
18752 declaration-seq [opt] */
18754 static void
18756 {
18758 }
18760 /* Parse a namespace-alias-definition.
18762 namespace-alias-definition:
18763 namespace identifier = qualified-namespace-specifier ; */
18765 static void
18767 {
18768 tree identifier;
18769 tree namespace_specifier;
18773 /* Look for the `namespace' keyword. */
18775 /* Look for the identifier. */
18779 /* Look for the `=' token. */
18782 {
18784 /* Skip the definition. */
18789 }
18791 /* Look for the qualified-namespace-specifier. */
18792 namespace_specifier
18794 /* Look for the `;' token. */
18797 /* Register the alias in the symbol table. */
18799 }
18801 /* Parse a qualified-namespace-specifier.
18803 qualified-namespace-specifier:
18804 :: [opt] nested-name-specifier [opt] namespace-name
18806 Returns a NAMESPACE_DECL corresponding to the specified
18807 namespace. */
18809 static tree
18811 {
18812 /* Look for the optional `::'. */
18816 /* Look for the optional nested-name-specifier. */
18824 }
18826 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18827 access declaration.
18829 using-declaration:
18830 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18831 using :: unqualified-id ;
18833 access-declaration:
18834 qualified-id ;
18836 */
18838 static bool
18841 {
18845 tree decl;
18846 tree identifier;
18847 tree qscope;
18852 {
18855 }
18856 else
18857 {
18858 /* Look for the `using' keyword. */
18861 again:
18862 /* Peek at the next token. */
18864 /* See if it's `typename'. */
18866 {
18867 /* Remember that we've seen it. */
18869 /* Consume the `typename' token. */
18871 }
18872 }
18874 /* Look for the optional global scope qualification. */
18875 global_scope_p
18880 /* If we saw `typename', or didn't see `::', then there must be a
18881 nested-name-specifier present. */
18883 {
18889 {
18892 }
18893 }
18894 /* Otherwise, we could be in either of the two productions. In that
18895 case, treat the nested-name-specifier as optional. */
18896 else
18908 /* Something has already gone wrong; there's no need to parse
18909 further. Since an error has occurred, the return value of
18910 cp_parser_parse_definitely will be false, as required. */
18914 /* Parse the unqualified-id. */
18922 {
18927 }
18929 {
18934 "pack expansion in using-declaration only available "
18937 }
18939 /* The function we call to handle a using-declaration is different
18940 depending on what scope we are in. */
18942 ;
18945 /* [namespace.udecl]
18947 A using declaration shall not name a template-id. */
18950 else
18951 {
18953 {
18954 /* Create the USING_DECL. */
18961 {
18964 }
18965 else
18966 /* Add it to the list of members in this class. */
18968 }
18969 else
18970 {
18972 identifier,
18979 {
18982 }
18985 else
18987 }
18988 }
18992 {
18996 "comma-separated list in using-declaration only available "
18999 }
19001 /* Look for the final `;'. */
19006 "access declarations are deprecated "
19007 "in favour of using-declarations; "
19011 }
19013 /* Parse an alias-declaration.
19015 alias-declaration:
19016 using identifier attribute-specifier-seq [opt] = type-id */
19018 static tree
19020 {
19024 cp_decl_specifier_seq decl_specs;
19028 /* Look for the `using' keyword. */
19029 cp_token *using_token
19051 /* Now we are going to parse the type-id of the declaration. */
19053 /*
19054 [dcl.type]/3 says:
19056 "A type-specifier-seq shall not define a class or enumeration
19057 unless it appears in the type-id of an alias-declaration (7.1.3) that
19058 is not the declaration of a template-declaration."
19060 In other words, if we currently are in an alias template, the
19061 type-id should not define a type.
19063 So let's set parser->type_definition_forbidden_message in that
19064 case; cp_parser_check_type_definition (called by
19065 cp_parser_class_specifier) will then emit an error if a type is
19066 defined in the type-id. */
19068 {
19072 }
19076 /* Restore the error message if need be. */
19082 {
19085 }
19087 /* A typedef-name can also be introduced by an alias-declaration. The
19088 identifier following the using keyword becomes a typedef-name. It has
19089 the same semantics as if it were introduced by the typedef
19090 specifier. In particular, it does not define a new type and it shall
19091 not appear in the type-id. */
19096 {
19099 ds_attribute,
19100 attrs_token);
19101 }
19103 ds_typedef,
19104 using_token);
19106 ds_alias,
19107 using_token);
19114 id_location,
19125 else
19131 // Attach constraints to the alias declaration.
19133 {
19137 }
19144 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19145 added into the symbol table; otherwise, return the TYPE_DECL. */
19149 {
19153 }
19156 }
19158 /* Parse a using-directive.
19160 using-directive:
19161 using namespace :: [opt] nested-name-specifier [opt]
19162 namespace-name ; */
19164 static void
19166 {
19167 tree namespace_decl;
19168 tree attribs;
19170 /* Look for the `using' keyword. */
19172 /* And the `namespace' keyword. */
19174 /* Look for the optional `::' operator. */
19176 /* And the optional nested-name-specifier. */
19182 /* Get the namespace being used. */
19184 /* And any specified attributes. */
19187 /* Update the symbol table. */
19190 else
19193 /* Look for the final `;'. */
19195 }
19197 /* Parse an asm-definition.
19199 asm-definition:
19200 asm ( string-literal ) ;
19202 GNU Extension:
19204 asm-definition:
19205 asm volatile [opt] ( string-literal ) ;
19206 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19207 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19208 : asm-operand-list [opt] ) ;
19209 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19210 : asm-operand-list [opt]
19211 : asm-clobber-list [opt] ) ;
19212 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19213 : asm-clobber-list [opt]
19214 : asm-goto-list ) ; */
19216 static void
19218 {
19219 tree string;
19224 tree asm_stmt;
19232 /* Look for the `asm' keyword. */
19237 {
19240 }
19242 /* See if the next token is `volatile'. */
19245 {
19246 /* Remember that we saw the `volatile' keyword. */
19248 /* Consume the token. */
19250 }
19254 {
19255 /* Remember that we saw the `goto' keyword. */
19257 /* Consume the token. */
19259 }
19260 /* Look for the opening `('. */
19263 /* Look for the string. */
19266 {
19270 }
19272 /* If we're allowing GNU extensions, check for the extended assembly
19273 syntax. Unfortunately, the `:' tokens need not be separated by
19274 a space in C, and so, for compatibility, we tolerate that here
19275 too. Doing that means that we have to treat the `::' operator as
19276 two `:' tokens. */
19281 {
19286 /* The extended syntax was used. */
19289 /* Look for outputs. */
19291 {
19292 /* Consume the `:'. */
19294 /* Parse the output-operands. */
19296 CPP_COLON)
19298 CPP_SCOPE)
19300 CPP_CLOSE_PAREN)
19302 {
19306 }
19307 }
19308 /* If the next token is `::', there are no outputs, and the
19309 next token is the beginning of the inputs. */
19311 /* The inputs are coming next. */
19314 /* Look for inputs. */
19317 {
19318 /* Consume the `:' or `::'. */
19320 /* Parse the output-operands. */
19322 CPP_COLON)
19324 CPP_SCOPE)
19326 CPP_CLOSE_PAREN))
19327 {
19331 }
19332 }
19334 /* The clobbers are coming next. */
19337 /* Look for clobbers. */
19340 {
19342 /* Consume the `:' or `::'. */
19344 /* Parse the clobbers. */
19346 CPP_COLON)
19348 CPP_CLOSE_PAREN))
19350 }
19353 /* The labels are coming next. */
19356 /* Look for labels. */
19359 {
19361 /* Consume the `:' or `::'. */
19363 /* Parse the labels. */
19365 }
19369 }
19373 /* Look for the closing `)'. */
19381 {
19382 /* Create the ASM_EXPR. */
19384 {
19387 /* If the extended syntax was not used, mark the ASM_EXPR. */
19389 {
19395 }
19396 }
19397 else
19399 }
19400 }
19402 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19403 type that comes from the decl-specifier-seq. */
19405 static tree
19407 {
19410 {
19423 }
19426 }
19428 /* Declarators [gram.dcl.decl] */
19430 /* Parse an init-declarator.
19432 init-declarator:
19433 declarator initializer [opt]
19435 GNU Extension:
19437 init-declarator:
19438 declarator asm-specification [opt] attributes [opt] initializer [opt]
19440 function-definition:
19441 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19442 function-body
19443 decl-specifier-seq [opt] declarator function-try-block
19445 GNU Extension:
19447 function-definition:
19448 __extension__ function-definition
19450 TM Extension:
19452 function-definition:
19453 decl-specifier-seq [opt] declarator function-transaction-block
19455 The DECL_SPECIFIERS apply to this declarator. Returns a
19456 representation of the entity declared. If MEMBER_P is TRUE, then
19457 this declarator appears in a class scope. The new DECL created by
19458 this declarator is returned.
19460 The CHECKS are access checks that should be performed once we know
19461 what entity is being declared (and, therefore, what classes have
19462 befriended it).
19464 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19465 for a function-definition here as well. If the declarator is a
19466 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19467 be TRUE upon return. By that point, the function-definition will
19468 have been completely parsed.
19470 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19471 is FALSE.
19473 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19474 parsed declaration if it is an uninitialized single declarator not followed
19475 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19476 if present, will not be consumed. If returned, this declarator will be
19477 created with SD_INITIALIZED but will not call cp_finish_decl.
19479 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19480 and there is an initializer, the pointed location_t is set to the
19481 location of the '=' or `(', or '{' in C++11 token introducing the
19482 initializer. */
19484 static tree
19495 {
19499 tree prefix_attributes;
19501 tree asm_specification;
19502 tree initializer;
19504 tree scope;
19506 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19507 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19508 "(...)". */
19519 /* Gather the attributes that were provided with the
19520 decl-specifiers. */
19523 /* Assume that this is not the declarator for a function
19524 definition. */
19528 /* Default arguments are only permitted for function parameters. */
19532 /* Defer access checks while parsing the declarator; we cannot know
19533 what names are accessible until we know what is being
19534 declared. */
19539 /* Parse the declarator. */
19540 declarator
19545 /* Gather up the deferred checks. */
19550 /* If the DECLARATOR was erroneous, there's no need to go
19551 further. */
19555 /* Check that the number of template-parameter-lists is OK. */
19565 /* Figure out what scope the entity declared by the DECLARATOR is
19566 located in. `grokdeclarator' sometimes changes the scope, so
19567 we compute it now. */
19570 /* Perform any lookups in the declared type which were thought to be
19571 dependent, but are not in the scope of the declarator. */
19572 decl_specifiers->type
19575 /* If we're allowing GNU extensions, look for an
19576 asm-specification. */
19578 {
19579 /* Look for an asm-specification. */
19582 }
19583 else
19586 /* Look for attributes. */
19590 /* Peek at the next token. */
19596 {
19597 /* Handle C++17 deduction guides. */
19601 {
19609 {
19613 }
19614 }
19616 /* Check to see if the token indicates the start of a
19617 function-definition. */
19619 {
19621 {
19622 /* If a function-definition should not appear here, issue an
19623 error message. */
19627 }
19629 location_t func_brace_location
19632 /* Neither attributes nor an asm-specification are allowed
19633 on a function-definition. */
19636 "an asm-specification is not allowed "
19640 "attributes are not allowed "
19642 /* This is a function-definition. */
19645 /* Parse the function definition. */
19648 decl_specifiers,
19649 declarator,
19650 prefix_attributes);
19651 else
19652 decl =
19653 (cp_parser_function_definition_from_specifiers_and_declarator
19657 {
19658 /* This is where the prologue starts... */
19661 }
19664 }
19665 }
19667 {
19668 /* A non-template declaration involving a function parameter list
19669 containing an implicit template parameter will be made into a
19670 template. If the resulting declaration is not going to be an
19671 actual function then finish the template scope here to prevent it.
19672 An error message will be issued once we have a decl to talk about.
19674 FIXME probably we should do type deduction rather than create an
19675 implicit template, but the standard currently doesn't allow it. */
19678 }
19680 /* [dcl.dcl]
19682 Only in function declarations for constructors, destructors, type
19683 conversions, and deduction guides can the decl-specifier-seq be omitted.
19685 We explicitly postpone this check past the point where we handle
19686 function-definitions because we tolerate function-definitions
19687 that are missing their return types in some modes. */
19689 {
19693 }
19695 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19699 {
19710 {
19716 }
19717 }
19718 else
19719 {
19720 /* If the init-declarator isn't initialized and isn't followed by a
19721 `,' or `;', it's not a valid init-declarator. */
19724 {
19727 else
19728 {
19732 }
19733 }
19736 }
19738 /* Because start_decl has side-effects, we should only call it if we
19739 know we're going ahead. By this point, we know that we cannot
19740 possibly be looking at any other construct. */
19743 /* Enter the newly declared entry in the symbol table. If we're
19744 processing a declaration in a class-specifier, we wait until
19745 after processing the initializer. */
19747 {
19755 /* Adjust location of decl if declarator->id_loc is more appropriate:
19756 set, and decl wasn't merged with another decl, in which case its
19757 location would be different from input_location, and more accurate. */
19762 }
19764 /* Enter the SCOPE. That way unqualified names appearing in the
19765 initializer will be looked up in SCOPE. */
19768 /* Perform deferred access control checks, now that we know in which
19769 SCOPE the declared entity resides. */
19771 {
19774 /* If the entity being declared is a function, pretend that we
19775 are in its scope. If it is a `friend', it may have access to
19776 things that would not otherwise be accessible. */
19778 {
19781 }
19783 /* Perform access checks for template parameters. */
19786 /* Perform the access control checks for the declarator and the
19787 decl-specifiers. */
19790 /* Restore the saved value. */
19793 }
19795 /* Parse the initializer. */
19800 {
19802 {
19805 else
19806 {
19807 /* If the declaration was erroneous, we don't really
19808 know what the user intended, so just silently
19809 consume the initializer. */
19816 }
19817 }
19818 else
19819 {
19820 /* We want to record the extra mangling scope for in-class
19821 initializers of class members and initializers of static data
19822 member templates. The former involves deferring
19823 parsing of the initializer until end of class as with default
19824 arguments. So right here we only handle the latter. */
19834 }
19835 }
19837 /* The old parser allows attributes to appear after a parenthesized
19838 initializer. Mark Mitchell proposed removing this functionality
19839 on the GCC mailing lists on 2002-08-13. This parser accepts the
19840 attributes -- but ignores them. Made a permerror in GCC 8. */
19846 {
19849 {
19853 }
19854 }
19856 /* And now complain about a non-function implicit template. */
19861 /* For an in-class declaration, use `grokfield' to create the
19862 declaration. */
19864 {
19866 {
19869 }
19878 }
19880 /* Finish processing the declaration. But, skip member
19881 declarations. */
19883 {
19886 asm_specification,
19887 /* If the initializer is in parentheses, then this is
19888 a direct-initialization, which means that an
19889 `explicit' constructor is OK. Otherwise, an
19890 `explicit' constructor cannot be used. */
19893 }
19896 /* Core issue #226 (C++0x only): A default template-argument
19897 shall not be specified in a friend class template
19898 declaration. */
19907 {
19910 else
19912 }
19919 }
19921 /* Parse a declarator.
19923 declarator:
19924 direct-declarator
19925 ptr-operator declarator
19927 abstract-declarator:
19928 ptr-operator abstract-declarator [opt]
19929 direct-abstract-declarator
19931 GNU Extensions:
19933 declarator:
19934 attributes [opt] direct-declarator
19935 attributes [opt] ptr-operator declarator
19937 abstract-declarator:
19938 attributes [opt] ptr-operator abstract-declarator [opt]
19939 attributes [opt] direct-abstract-declarator
19941 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19942 detect constructors, destructors, deduction guides, or conversion operators.
19943 It is set to -1 if the declarator is a name, and +1 if it is a
19944 function. Otherwise it is set to zero. Usually you just want to
19945 test for >0, but internally the negative value is used.
19947 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19948 a decl-specifier-seq unless it declares a constructor, destructor,
19949 or conversion. It might seem that we could check this condition in
19950 semantic analysis, rather than parsing, but that makes it difficult
19951 to handle something like `f()'. We want to notice that there are
19952 no decl-specifiers, and therefore realize that this is an
19953 expression, not a declaration.)
19955 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19956 the declarator is a direct-declarator of the form "(...)".
19958 MEMBER_P is true iff this declarator is a member-declarator.
19960 FRIEND_P is true iff this declarator is a friend. */
19964 cp_parser_declarator_kind dcl_kind,
19968 {
19971 cp_cv_quals cv_quals;
19972 tree class_type;
19975 /* Assume this is not a constructor, destructor, or type-conversion
19976 operator. */
19983 /* Check for the ptr-operator production. */
19985 /* Parse the ptr-operator. */
19991 /* If that worked, then we have a ptr-operator. */
19993 {
19994 /* If a ptr-operator was found, then this declarator was not
19995 parenthesized. */
19998 /* The dependent declarator is optional if we are parsing an
19999 abstract-declarator. */
20003 /* Parse the dependent declarator. */
20008 friend_p);
20010 /* If we are parsing an abstract-declarator, we must handle the
20011 case where the dependent declarator is absent. */
20016 declarator = cp_parser_make_indirect_declarator
20018 }
20019 /* Everything else is a direct-declarator. */
20020 else
20021 {
20024 CPP_OPEN_PAREN);
20026 ctor_dtor_or_conv_p,
20028 }
20033 }
20035 /* Parse a direct-declarator or direct-abstract-declarator.
20037 direct-declarator:
20038 declarator-id
20039 direct-declarator ( parameter-declaration-clause )
20040 cv-qualifier-seq [opt]
20041 ref-qualifier [opt]
20042 exception-specification [opt]
20043 direct-declarator [ constant-expression [opt] ]
20044 ( declarator )
20046 direct-abstract-declarator:
20047 direct-abstract-declarator [opt]
20048 ( parameter-declaration-clause )
20049 cv-qualifier-seq [opt]
20050 ref-qualifier [opt]
20051 exception-specification [opt]
20052 direct-abstract-declarator [opt] [ constant-expression [opt] ]
20053 ( abstract-declarator )
20055 Returns a representation of the declarator. DCL_KIND is
20056 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
20057 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
20058 we are parsing a direct-declarator. It is
20059 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
20060 of ambiguity we prefer an abstract declarator, as per
20061 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
20062 as for cp_parser_declarator. */
20066 cp_parser_declarator_kind dcl_kind,
20069 {
20080 {
20081 /* Peek at the next token. */
20084 {
20085 /* This is either a parameter-declaration-clause, or a
20086 parenthesized declarator. When we know we are parsing a
20087 named declarator, it must be a parenthesized declarator
20088 if FIRST is true. For instance, `(int)' is a
20089 parameter-declaration-clause, with an omitted
20090 direct-abstract-declarator. But `((*))', is a
20091 parenthesized abstract declarator. Finally, when T is a
20092 template parameter `(T)' is a
20093 parameter-declaration-clause, and not a parenthesized
20094 named declarator.
20096 We first try and parse a parameter-declaration-clause,
20097 and then try a nested declarator (if FIRST is true).
20099 It is not an error for it not to be a
20100 parameter-declaration-clause, even when FIRST is
20101 false. Consider,
20103 int i (int);
20104 int i (3);
20106 The first is the declaration of a function while the
20107 second is the definition of a variable, including its
20108 initializer.
20110 Having seen only the parenthesis, we cannot know which of
20111 these two alternatives should be selected. Even more
20112 complex are examples like:
20114 int i (int (a));
20115 int i (int (3));
20117 The former is a function-declaration; the latter is a
20118 variable initialization.
20120 Thus again, we try a parameter-declaration-clause, and if
20121 that fails, we back out and return. */
20124 {
20125 tree params;
20130 /* In a member-declarator, the only valid interpretation
20131 of a parenthesis is the start of a
20132 parameter-declaration-clause. (It is invalid to
20133 initialize a static data member with a parenthesized
20134 initializer; only the "=" form of initialization is
20135 permitted.) */
20139 /* Consume the `('. */
20140 matching_parens parens;
20143 {
20144 /* If this is going to be an abstract declarator, we're
20145 in a declarator and we can't have default args. */
20148 }
20152 /* Parse the parameter-declaration-clause. */
20155 /* Consume the `)'. */
20158 /* If all went well, parse the cv-qualifier-seq,
20159 ref-qualifier and the exception-specification. */
20161 {
20162 cp_cv_quals cv_quals;
20163 cp_virt_specifiers virt_specifiers;
20164 cp_ref_qualifier ref_qual;
20165 tree exception_specification;
20166 tree late_return;
20167 tree attrs;
20177 /* Parse the cv-qualifier-seq. */
20179 /* Parse the ref-qualifier. */
20181 /* Parse the tx-qualifier. */
20183 /* And the exception-specification. */
20184 exception_specification
20189 /* In here, we handle cases where attribute is used after
20190 the function declaration. For example:
20191 void func (int x) __attribute__((vector(..))); */
20194 late_return = (cp_parser_late_return_type_opt
20198 /* Parse the virt-specifier-seq. */
20201 /* Create the function-declarator. */
20203 params,
20204 cv_quals,
20205 virt_specifiers,
20206 ref_qual,
20207 tx_qual,
20208 exception_specification,
20209 late_return,
20210 requires_clause);
20213 /* Any subsequent parameter lists are to do with
20214 return type, so are not those of the declared
20215 function. */
20217 }
20219 /* Remove the function parms from scope. */
20223 /* Repeat the main loop. */
20225 }
20227 /* If this is the first, we can try a parenthesized
20228 declarator. */
20230 {
20237 /* Consume the `('. */
20238 matching_parens parens;
20240 /* Parse the nested declarator. */
20243 declarator
20249 /* Expect a `)'. */
20257 }
20258 /* Otherwise, we must be done. */
20259 else
20261 }
20265 {
20266 /* Parse an array-declarator. */
20276 /* Consume the `['. */
20278 /* Peek at the next token. */
20280 /* If the next token is `]', then there is no
20281 constant-expression. */
20283 {
20285 bounds
20295 {
20296 /* Normally, the array bound must be an integral constant
20297 expression. However, as an extension, we allow VLAs
20298 in function scopes as long as they aren't part of a
20299 parameter declaration. */
20303 }
20306 {
20307 /* Remember this wasn't a constant-expression. */
20310 }
20311 }
20312 else
20314 /* Look for the closing `]'. */
20316 {
20319 }
20324 }
20326 {
20327 {
20328 tree qualifying_scope;
20329 tree unqualified_name;
20330 tree attrs;
20331 special_function_kind sfk;
20336 /* Parse a declarator-id */
20339 {
20342 /* If we see an ellipsis, we should be looking at a
20343 parameter pack. */
20345 {
20346 /* Consume the `...' */
20350 }
20351 }
20354 unqualified_name
20358 {
20362 {
20363 /* Check whether an error occurred. */
20366 /* We already consumed the ellipsis to mark a
20367 parameter pack, but we have no way to report it,
20368 so abort the tentative parse. We will be exiting
20369 immediately anyway. */
20371 }
20372 else
20378 && (qualifying_scope
20380 {
20383 }
20384 }
20389 {
20394 }
20400 {
20401 /* In the declaration of a member of a template class
20402 outside of the class itself, the SCOPE will sometimes
20403 be a TYPENAME_TYPE. For example, given:
20405 template <typename T>
20406 int S<T>::R::i = 3;
20408 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20409 this context, we must resolve S<T>::R to an ordinary
20410 type, rather than a typename type.
20412 The reason we normally avoid resolving TYPENAME_TYPEs
20413 is that a specialization of `S' might render
20414 `S<T>::R' not a type. However, if `S' is
20415 specialized, then this `i' will not be used, so there
20416 is no harm in resolving the types here. */
20417 tree type;
20419 /* Resolve the TYPENAME_TYPE. */
20422 /* If that failed, the declarator is invalid. */
20424 {
20427 "cannot define member of dependent typedef "
20429 else
20434 }
20436 }
20441 {
20442 tree class_type;
20447 else
20451 {
20455 {
20456 /* We do not attempt to print the declarator
20457 here because we do not have enough
20458 information about its original syntactic
20459 form. */
20463 }
20466 {
20470 "use %<%T::%D%> instead of %<%T::%D%> to "
20472 class_type,
20477 }
20479 }
20482 {
20489 for an unnamed type, even if the type
20490 got a name for linkage purposes. */
20492 /* Handle correctly (c++/19200):
20494 struct S {
20495 struct T{};
20496 friend void S(T);
20497 };
20499 and also:
20501 namespace N {
20502 void S();
20503 }
20505 struct S {
20506 friend void N::S();
20507 }; */
20510 class_type))
20519 }
20520 }
20522 unqualified_name,
20523 sfk);
20530 }
20532 handle_declarator:;
20535 {
20536 /* Any names that appear after the declarator-id for a
20537 member are looked up in the containing scope. */
20539 {
20540 /* But declarations with qualified-ids can't appear in a
20541 function. */
20545 }
20547 }
20551 /* Default args are only allowed on function
20552 declarations. */
20554 else
20558 }
20559 /* We're done. */
20560 else
20562 }
20564 /* For an abstract declarator, we might wind up with nothing at this
20565 point. That's an error; the declarator is not optional. */
20569 {
20570 /* Record overly parenthesized declarator so we can give a
20571 diagnostic about confusing decl/expr disambiguation. */
20573 {
20574 /* If the open and close parens are on different lines, this
20575 is probably a formatting thing, so ignore. */
20580 }
20583 }
20585 /* If we entered a scope, we must exit it now. */
20593 }
20595 /* Parse a ptr-operator.
20597 ptr-operator:
20598 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20599 * cv-qualifier-seq [opt]
20600 &
20601 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20602 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20604 GNU Extension:
20606 ptr-operator:
20607 & cv-qualifier-seq [opt]
20609 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20610 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20611 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20612 filled in with the TYPE containing the member. *CV_QUALS is
20613 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20614 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20615 Note that the tree codes returned by this function have nothing
20616 to do with the types of trees that will be eventually be created
20617 to represent the pointer or reference type being parsed. They are
20618 just constants with suggestive names. */
20619 static enum tree_code
20624 {
20629 /* Assume that it's not a pointer-to-member. */
20631 /* And that there are no cv-qualifiers. */
20634 /* Peek at the next token. */
20637 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20647 {
20648 /* Consume the `*', `&' or `&&'. */
20651 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20652 `&', if we are allowing GNU extensions. (The only qualifier
20653 that can legally appear after `&' is `restrict', but that is
20654 enforced during semantic analysis. */
20662 }
20663 else
20664 {
20665 /* Try the pointer-to-member case. */
20667 /* Look for the optional `::' operator. */
20670 /* Look for the nested-name specifier. */
20677 /* If we found it, and the next token is a `*', then we are
20678 indeed looking at a pointer-to-member operator. */
20681 {
20682 /* Indicate that the `*' operator was used. */
20690 else
20691 {
20692 /* The type of which the member is a member is given by the
20693 current SCOPE. */
20695 /* The next name will not be qualified. */
20699 /* Look for optional c++11 attributes. */
20703 /* Look for the optional cv-qualifier-seq. */
20705 }
20706 }
20707 /* If that didn't work we don't have a ptr-operator. */
20710 }
20713 }
20715 /* Parse an (optional) cv-qualifier-seq.
20717 cv-qualifier-seq:
20718 cv-qualifier cv-qualifier-seq [opt]
20720 cv-qualifier:
20721 const
20722 volatile
20724 GNU Extension:
20726 cv-qualifier:
20727 __restrict__
20729 Returns a bitmask representing the cv-qualifiers. */
20731 static cp_cv_quals
20733 {
20737 {
20739 cp_cv_quals cv_qualifier;
20741 /* Peek at the next token. */
20743 /* See if it's a cv-qualifier. */
20745 {
20761 }
20767 {
20772 }
20773 else
20774 {
20777 }
20778 }
20781 }
20783 /* Parse an (optional) ref-qualifier
20785 ref-qualifier:
20786 &
20787 &&
20789 Returns cp_ref_qualifier representing ref-qualifier. */
20791 static cp_ref_qualifier
20793 {
20796 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20801 {
20806 {
20818 }
20823 {
20826 }
20827 else
20828 {
20831 }
20832 }
20835 }
20837 /* Parse an optional tx-qualifier.
20839 tx-qualifier:
20840 transaction_safe
20841 transaction_safe_dynamic */
20843 static tree
20845 {
20848 {
20853 {
20857 {
20860 {
20863 }
20864 else
20866 }
20867 }
20868 }
20870 }
20872 /* Parse an (optional) virt-specifier-seq.
20874 virt-specifier-seq:
20875 virt-specifier virt-specifier-seq [opt]
20877 virt-specifier:
20878 override
20879 final
20881 Returns a bitmask representing the virt-specifiers. */
20883 static cp_virt_specifiers
20885 {
20889 {
20891 cp_virt_specifiers virt_specifier;
20893 /* Peek at the next token. */
20895 /* See if it's a virt-specifier-qualifier. */
20899 {
20902 }
20904 {
20907 }
20909 {
20911 }
20912 else
20916 {
20921 }
20922 else
20923 {
20926 }
20927 }
20929 }
20931 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20932 is in scope even though it isn't real. */
20934 void
20936 {
20937 tree this_parm;
20940 {
20941 /* We don't clear this between NSDMIs. Is it already what we want? */
20948 }
20951 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20953 current_class_ref
20956 }
20958 /* Return true iff our current scope is a non-static data member
20959 initializer. */
20961 bool
20963 {
20964 /* We recognize NSDMI context by the context-less 'this' pointer set up
20965 by the function above. */
20971 }
20973 /* Parse a late-specified return type, if any. This is not a separate
20974 non-terminal, but part of a function declarator, which looks like
20976 -> trailing-type-specifier-seq abstract-declarator(opt)
20978 Returns the type indicated by the type-id.
20980 In addition to this, parse any queued up #pragma omp declare simd
20981 clauses, and #pragma acc routine clauses.
20983 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20984 function. */
20986 static tree
20989 {
20993 && declarator
20997 && declarator
21000 /* Peek at the next token. */
21002 /* A late-specified return type is indicated by an initial '->'. */
21013 {
21014 /* DR 1207: 'this' is in scope in the trailing return type. */
21016 }
21019 {
21020 /* Consume the ->. */
21024 }
21026 /* Function declarations may be followed by a trailing
21027 requires-clause. */
21031 declarator->attributes
21035 declarator->attributes
21040 {
21043 }
21046 }
21048 /* Parse a declarator-id.
21050 declarator-id:
21051 id-expression
21052 :: [opt] nested-name-specifier [opt] type-name
21054 In the `id-expression' case, the value returned is as for
21055 cp_parser_id_expression if the id-expression was an unqualified-id.
21056 If the id-expression was a qualified-id, then a SCOPE_REF is
21057 returned. The first operand is the scope (either a NAMESPACE_DECL
21058 or TREE_TYPE), but the second is still just a representation of an
21059 unqualified-id. */
21061 static tree
21063 {
21064 tree id;
21065 /* The expression must be an id-expression. Assume that qualified
21066 names are the names of types so that:
21068 template <class T>
21069 int S<T>::R::i = 3;
21071 will work; we must treat `S<T>::R' as the name of a type.
21072 Similarly, assume that qualified names are templates, where
21073 required, so that:
21075 template <class T>
21076 int S<T>::R<T>::i = 3;
21078 will work, too. */
21084 optional_p);
21088 }
21090 /* Parse a type-id.
21092 type-id:
21093 type-specifier-seq abstract-declarator [opt]
21095 Returns the TYPE specified. */
21097 static tree
21100 {
21101 cp_decl_specifier_seq type_specifier_seq;
21104 /* Parse the type-specifier-seq. */
21106 is_trailing_return,
21114 /* A bare template name as a template argument is a template template
21115 argument, not a placeholder, so fail parsing it as a type argument. */
21116 {
21120 }
21124 /* There might or might not be an abstract declarator. */
21126 /* Look for the declarator. */
21127 abstract_declarator
21132 /* Check to see if there really was a declarator. */
21137 /* The concepts TS allows 'auto' as a type-id. */
21139 /* None of the valid uses of 'auto' in C++14 involve the type-id
21140 nonterminal, but it is valid in a trailing-return-type. */
21143 {
21144 /* A type-id with type 'auto' is only ok if the abstract declarator
21145 is a function declarator with a late-specified return type.
21147 A type-id with 'auto' is also valid in a trailing-return-type
21148 in a compound-requirement. */
21155 else
21156 {
21159 {
21161 auto_node);
21163 tmpl);
21164 }
21165 else
21168 }
21169 }
21172 is_template_arg);
21173 }
21175 static tree
21177 {
21179 }
21181 static tree
21183 {
21184 tree r;
21186 parser->type_definition_forbidden_message
21191 {
21194 }
21196 }
21198 static tree
21200 {
21202 }
21204 /* Parse a type-specifier-seq.
21206 type-specifier-seq:
21207 type-specifier type-specifier-seq [opt]
21209 GNU extension:
21211 type-specifier-seq:
21212 attributes type-specifier-seq [opt]
21214 If IS_DECLARATION is true, we are at the start of a "condition" or
21215 exception-declaration, so we might be followed by a declarator-id.
21217 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21218 i.e. we've just seen "->".
21220 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21222 static void
21227 {
21232 /* Clear the TYPE_SPECIFIER_SEQ. */
21235 /* In the context of a trailing return type, enum E { } is an
21236 elaborated-type-specifier followed by a function-body, not an
21237 enum-specifier. */
21241 /* Parse the type-specifiers and attributes. */
21243 {
21244 tree type_specifier;
21247 /* Check for attributes first. */
21249 {
21250 type_specifier_seq->attributes
21254 }
21256 /* record the token of the beginning of the type specifier seq,
21257 for error reporting purposes*/
21261 /* Look for the type-specifier. */
21263 flags,
21264 type_specifier_seq,
21266 NULL,
21269 {
21270 /* If the first type-specifier could not be found, this is not a
21271 type-specifier-seq at all. */
21273 {
21274 /* Set in_declarator_p to avoid skipping to the semicolon. */
21286 }
21287 /* If subsequent type-specifiers could not be found, the
21288 type-specifier-seq is complete. */
21290 }
21293 /* The standard says that a condition can be:
21295 type-specifier-seq declarator = assignment-expression
21297 However, given:
21299 struct S {};
21300 if (int S = ...)
21302 we should treat the "S" as a declarator, not as a
21303 type-specifier. The standard doesn't say that explicitly for
21304 type-specifier-seq, but it does say that for
21305 decl-specifier-seq in an ordinary declaration. Perhaps it
21306 would be clearer just to allow a decl-specifier-seq here, and
21307 then add a semantic restriction that if any decl-specifiers
21308 that are not type-specifiers appear, the program is invalid. */
21311 }
21312 }
21314 /* Return whether the function currently being declared has an associated
21315 template parameter list. */
21317 static bool
21319 {
21332 }
21334 /* Parse a parameter-declaration-clause.
21336 parameter-declaration-clause:
21337 parameter-declaration-list [opt] ... [opt]
21338 parameter-declaration-list , ...
21340 Returns a representation for the parameter declarations. A return
21341 value of NULL indicates a parameter-declaration-clause consisting
21342 only of an ellipsis. */
21344 static tree
21346 {
21347 tree parameters;
21355 && !processing_template_parmlist
21356 && !processing_explicit_instantiation
21357 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21358 actual function or a random abstract declarator. */
21364 /* Peek at the next token. */
21366 /* Check for trivial parameter-declaration-clauses. */
21368 {
21369 /* Consume the `...' token. */
21372 }
21374 /* There are no parameters. */
21376 /* Check for `(void)', too, which is a special case. */
21380 {
21381 /* Consume the `void' token. */
21383 /* There are no parameters. */
21385 }
21387 /* Parse the parameter-declaration-list. */
21389 /* If a parse error occurred while parsing the
21390 parameter-declaration-list, then the entire
21391 parameter-declaration-clause is erroneous. */
21395 /* Peek at the next token. */
21397 /* If it's a `,', the clause should terminate with an ellipsis. */
21399 {
21400 /* Consume the `,'. */
21402 /* Expect an ellipsis. */
21403 ellipsis_p
21405 }
21406 /* It might also be `...' if the optional trailing `,' was
21407 omitted. */
21409 {
21410 /* Consume the `...' token. */
21412 /* And remember that we saw it. */
21414 }
21415 else
21418 /* Finish the parameter list. */
21423 }
21425 /* Parse a parameter-declaration-list.
21427 parameter-declaration-list:
21428 parameter-declaration
21429 parameter-declaration-list , parameter-declaration
21431 Returns a representation of the parameter-declaration-list, as for
21432 cp_parser_parameter_declaration_clause. However, the
21433 `void_list_node' is never appended to the list. */
21435 static tree
21437 {
21443 /* The special considerations that apply to a function within an
21444 unbraced linkage specifications do not apply to the parameters
21445 to the function. */
21446 saved_in_unbraced_linkage_specification_p
21450 /* Look for more parameters. */
21452 {
21457 /* Parse the parameter. */
21458 parameter
21463 /* We don't know yet if the enclosing context is deprecated, so wait
21464 and warn in grokparms if appropriate. */
21468 {
21471 PARM,
21476 }
21480 /* If a parse error occurred parsing the parameter declaration,
21481 then the entire parameter-declaration-list is erroneous. */
21483 {
21486 }
21496 {
21500 }
21502 /* Add the new parameter to the list. */
21506 /* Peek at the next token. */
21509 /* These are for Objective-C++ */
21512 /* The parameter-declaration-list is complete. */
21515 {
21518 /* Peek at the next token. */
21520 /* If it's an ellipsis, then the list is complete. */
21523 /* Otherwise, there must be more parameters. Consume the
21524 `,'. */
21526 /* When parsing something like:
21528 int i(float f, double d)
21530 we can tell after seeing the declaration for "f" that we
21531 are not looking at an initialization of a variable "i",
21532 but rather at the declaration of a function "i".
21534 Due to the fact that the parsing of template arguments
21535 (as specified to a template-id) requires backtracking we
21536 cannot use this technique when inside a template argument
21537 list. */
21541 /* However, a parameter-declaration of the form
21542 "float(f)" (which is a valid declaration of a
21543 parameter "f") can also be interpreted as an
21544 expression (the conversion of "f" to "float"). */
21547 }
21548 else
21549 {
21557 }
21558 }
21560 parser->in_unbraced_linkage_specification_p
21563 /* Reset implicit_template_scope if we are about to leave the function
21564 parameter list that introduced it. Note that for out-of-line member
21565 definitions, there will be one or more class scopes before we get to
21566 the template parameter scope. */
21570 {
21574 {
21577 }
21578 }
21581 }
21583 /* Parse a parameter declaration.
21585 parameter-declaration:
21586 decl-specifier-seq ... [opt] declarator
21587 decl-specifier-seq declarator = assignment-expression
21588 decl-specifier-seq ... [opt] abstract-declarator [opt]
21589 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21591 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21592 declares a template parameter. (In that case, a non-nested `>'
21593 token encountered during the parsing of the assignment-expression
21594 is not interpreted as a greater-than operator.)
21596 Returns a representation of the parameter, or NULL if an error
21597 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21598 true iff the declarator is of the form "(p)". */
21604 {
21606 cp_decl_specifier_seq decl_specifiers;
21608 tree default_argument;
21613 /* In a template parameter, `>' is not an operator.
21615 [temp.param]
21617 When parsing a default template-argument for a non-type
21618 template-parameter, the first non-nested `>' is taken as the end
21619 of the template parameter-list rather than a greater-than
21620 operator. */
21622 /* Type definitions may not appear in parameter types. */
21624 parser->type_definition_forbidden_message
21631 /* Parse the declaration-specifiers. */
21634 CP_PARSER_FLAGS_NONE,
21638 /* Complain about missing 'typename' or other invalid type names. */
21643 /* If an error occurred, there's no reason to attempt to parse the
21644 rest of the declaration. */
21646 {
21649 }
21651 /* Peek at the next token. */
21654 /* If the next token is a `)', `,', `=', `>', or `...', then there
21655 is no declarator. However, when variadic templates are enabled,
21656 there may be a declarator following `...'. */
21661 {
21665 }
21666 /* Otherwise, there should be a declarator. */
21667 else
21668 {
21672 /* After seeing a decl-specifier-seq, if the next token is not a
21673 "(", there is no possibility that the code is a valid
21674 expression. Therefore, if parsing tentatively, we commit at
21675 this point. */
21677 /* In an expression context, having seen:
21679 (int((char ...
21681 we cannot be sure whether we are looking at a
21682 function-type (taking a "char" as a parameter) or a cast
21683 of some object of type "char" to "int". */
21689 /* Parse the declarator. */
21692 CP_PARSER_DECLARATOR_EITHER,
21694 parenthesized_p,
21698 /* After the declarator, allow more attributes. */
21699 decl_specifiers.attributes
21703 /* If the declarator is a template parameter pack, remember that and
21704 clear the flag in the declarator itself so we don't get errors
21705 from grokdeclarator. */
21707 {
21710 }
21711 }
21713 /* If the next token is an ellipsis, and we have not seen a declarator
21714 name, and if either the type of the declarator contains parameter
21715 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21716 for, eg, abbreviated integral type names), then we actually have a
21717 parameter pack expansion expression. Otherwise, leave the ellipsis
21718 for a C-style variadic function. */
21721 /* If a function parameter pack was specified and an implicit template
21722 parameter was introduced during cp_parser_parameter_declaration,
21723 change any implicit parameters introduced into packs. */
21728 {
21736 }
21739 {
21750 {
21751 /* Consume the `...'. */
21755 /* Build a pack expansion type */
21760 else
21762 }
21763 }
21765 /* The restriction on defining new types applies only to the type
21766 of the parameter, not to the default argument. */
21769 /* If the next token is `=', then process a default argument. */
21771 {
21774 /* If we are defining a class, then the tokens that make up the
21775 default argument must be saved and processed later. */
21781 // A constrained-type-specifier may declare a type template-parameter.
21783 default_argument
21786 // A constrained-type-specifier may declare a template-template-parameter.
21788 default_argument
21791 /* Outside of a class definition, we can just parse the
21792 assignment-expression. */
21793 else
21794 default_argument
21798 {
21800 "default arguments are only "
21802 }
21804 || template_parameter_pack_p
21807 {
21808 /* Find the name of the parameter pack. */
21815 template_parm_p
21821 else
21823 template_parm_p
21830 }
21831 }
21832 else
21835 /* Generate a location for the parameter, ranging from the start of the
21836 initial token to the end of the final token (using input_location for
21837 the latter, set up by cp_lexer_set_source_position_from_token when
21838 consuming tokens).
21840 If we have a identifier, then use it for the caret location, e.g.
21842 extern int callee (int one, int (*two)(int, int), float three);
21843 ~~~~~~^~~~~~~~~~~~~~
21845 otherwise, reuse the start location for the caret location e.g.:
21847 extern int callee (int one, int (*)(int, int), float three);
21848 ^~~~~~~~~~~~~~~~~
21850 */
21856 input_location);
21859 declarator,
21860 default_argument,
21861 param_loc,
21862 template_parameter_pack_p);
21863 }
21865 /* Parse a default argument and return it.
21867 TEMPLATE_PARM_P is true if this is a default argument for a
21868 non-type template parameter. */
21869 static tree
21871 {
21877 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21878 set correctly. */
21881 /* Local variable names (and the `this' keyword) may not
21882 appear in a default argument. */
21885 /* Parse the assignment-expression. */
21890 /* The "this" pointer is not valid in a default argument. */
21892 {
21897 }
21898 default_argument
21900 /* Restore the "this" pointer. */
21902 {
21905 }
21914 }
21916 /* Parse a function-body.
21918 function-body:
21919 compound_statement */
21921 static void
21923 {
21927 }
21929 /* Parse a ctor-initializer-opt followed by a function-body. Return
21930 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21931 is true we are parsing a function-try-block. */
21933 static void
21936 {
21943 /* Begin the function body. */
21945 /* Parse the optional ctor-initializer. */
21948 /* If we're parsing a constexpr constructor definition, we need
21949 to check that the constructor body is indeed empty. However,
21950 before we get to cp_parser_function_body lot of junk has been
21951 generated, so we can't just check that we have an empty block.
21952 Rather we take a snapshot of the outermost block, and check whether
21953 cp_parser_function_body changed its state. */
21955 {
21959 }
21960 /* Parse the function-body. */
21964 /* Finish the function body. */
21966 }
21968 /* Parse an initializer.
21970 initializer:
21971 = initializer-clause
21972 ( expression-list )
21974 Returns an expression representing the initializer. If no
21975 initializer is present, NULL_TREE is returned.
21977 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21978 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21979 set to TRUE if there is no initializer present. If there is an
21980 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21981 is set to true; otherwise it is set to false. */
21983 static tree
21986 {
21988 tree init;
21990 /* Peek at the next token. */
21993 /* Let our caller know whether or not this initializer was
21994 parenthesized. */
21996 /* Assume that the initializer is constant. */
22000 {
22001 /* Consume the `='. */
22003 /* Parse the initializer-clause. */
22005 }
22007 {
22012 non_constant_p);
22017 }
22019 {
22024 }
22025 else
22026 {
22027 /* Anything else is an error. */
22030 }
22036 }
22038 /* Parse an initializer-clause.
22040 initializer-clause:
22041 assignment-expression
22042 braced-init-list
22044 Returns an expression representing the initializer.
22046 If the `assignment-expression' production is used the value
22047 returned is simply a representation for the expression.
22049 Otherwise, calls cp_parser_braced_list. */
22051 static cp_expr
22053 {
22054 cp_expr initializer;
22056 /* Assume the expression is constant. */
22059 /* If it is not a `{', then we are looking at an
22060 assignment-expression. */
22062 {
22063 initializer
22066 non_constant_p);
22067 }
22068 else
22072 }
22074 /* Parse a brace-enclosed initializer list.
22076 braced-init-list:
22077 { initializer-list , [opt] }
22078 { designated-initializer-list , [opt] }
22079 { }
22081 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
22082 the elements of the initializer-list (or NULL, if the last
22083 production is used). The TREE_TYPE for the CONSTRUCTOR will be
22084 NULL_TREE. There is no way to detect whether or not the optional
22085 trailing `,' was provided. NON_CONSTANT_P is as for
22086 cp_parser_initializer. */
22088 static cp_expr
22090 {
22091 tree initializer;
22094 /* Consume the `{' token. */
22095 matching_braces braces;
22097 /* Create a CONSTRUCTOR to represent the braced-initializer. */
22099 /* If it's not a `}', then there is a non-trivial initializer. */
22101 {
22102 /* Parse the initializer list. */
22105 /* A trailing `,' token is allowed. */
22108 }
22109 else
22111 /* Now, there should be a trailing `}'. */
22117 /* Build a location of the form:
22118 { ... }
22119 ^~~~~~~
22120 with caret==start at the open brace, finish at the close brace. */
22124 }
22126 /* Consume tokens up to, and including, the next non-nested closing `]'.
22127 Returns true iff we found a closing `]'. */
22129 static bool
22131 {
22135 {
22139 {
22142 /* If we've run out of tokens, then there is no closing `]'. */
22151 {
22154 }
22159 }
22161 /* Consume the token. */
22163 }
22164 }
22166 /* Return true if we are looking at an array-designator, false otherwise. */
22168 static bool
22170 {
22171 /* Consume the `['. */
22176 /* Skip tokens until the next token is a closing square bracket.
22177 If we find the closing `]', and the next token is a `=', then
22178 we are looking at an array designator. */
22179 bool array_designator_p
22183 /* Roll back the tokens we skipped. */
22187 }
22189 /* Parse an initializer-list.
22191 initializer-list:
22192 initializer-clause ... [opt]
22193 initializer-list , initializer-clause ... [opt]
22195 C++2A Extension:
22197 designated-initializer-list:
22198 designated-initializer-clause
22199 designated-initializer-list , designated-initializer-clause
22201 designated-initializer-clause:
22202 designator brace-or-equal-initializer
22204 designator:
22205 . identifier
22207 GNU Extension:
22209 initializer-list:
22210 designation initializer-clause ...[opt]
22211 initializer-list , designation initializer-clause ...[opt]
22213 designation:
22214 . identifier =
22215 identifier :
22216 [ constant-expression ] =
22218 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22219 for the initializer. If the INDEX of the elt is non-NULL, it is the
22220 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22221 as for cp_parser_initializer. */
22225 {
22230 /* Assume all of the expressions are constant. */
22233 /* Parse the rest of the list. */
22235 {
22237 tree designator;
22238 tree initializer;
22242 /* Handle the C++2A syntax, '. id ='. */
22250 {
22253 "C++ designated initializers only available with "
22255 /* Consume the `.'. */
22257 /* Consume the identifier. */
22260 /* Consume the `='. */
22262 }
22263 /* Also, if the next token is an identifier and the following one is a
22264 colon, we are looking at the GNU designated-initializer
22265 syntax. */
22270 {
22271 /* Warn the user that they are using an extension. */
22274 /* Consume the identifier. */
22276 /* Consume the `:'. */
22278 }
22279 /* Also handle C99 array designators, '[ const ] ='. */
22283 {
22284 /* In C++11, [ could start a lambda-introducer. */
22290 {
22293 }
22294 else
22295 {
22300 }
22305 && (!require_potential_rvalue_constant_expression
22309 /* Warn the user that they are using an extension. */
22312 }
22313 else
22317 {
22320 }
22324 {
22328 }
22332 /* Parse the initializer. */
22335 /* If any clause is non-constant, so is the entire initializer. */
22339 /* If we have an ellipsis, this is an initializer pack
22340 expansion. */
22342 {
22345 /* Consume the `...'. */
22352 /* Turn the initializer into an initializer expansion. */
22354 }
22356 /* Add it to the vector. */
22359 /* If the next token is not a comma, we have reached the end of
22360 the list. */
22364 /* Peek at the next token. */
22366 /* If the next token is a `}', then we're still done. An
22367 initializer-clause can have a trailing `,' after the
22368 initializer-list and before the closing `}'. */
22372 /* Consume the `,' token. */
22374 }
22376 /* The same identifier shall not appear in multiple designators
22377 of a designated-initializer-list. */
22379 {
22384 {
22386 {
22388 "%<.%s%> designator used multiple times in "
22392 }
22393 else
22395 }
22399 }
22402 }
22404 /* Classes [gram.class] */
22406 /* Parse a class-name.
22408 class-name:
22409 identifier
22410 template-id
22412 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22413 to indicate that names looked up in dependent types should be
22414 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22415 keyword has been used to indicate that the name that appears next
22416 is a template. TAG_TYPE indicates the explicit tag given before
22417 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22418 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22419 is the class being defined in a class-head. If ENUM_OK is TRUE,
22420 enum-names are also accepted.
22422 Returns the TYPE_DECL representing the class. */
22424 static tree
22433 {
22434 tree decl;
22435 tree scope;
22440 /* All class-names start with an identifier. */
22443 {
22446 }
22448 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22449 to a template-id, so we save it here. */
22454 /* Any name names a type if we're following the `typename' keyword
22455 in a qualified name where the enclosing scope is type-dependent. */
22458 /* Handle the common case (an identifier, but not a template-id)
22459 efficiently. */
22462 {
22466 /* Look for the identifier. */
22470 /* If the next token isn't an identifier, we are certainly not
22471 looking at a class-name. */
22474 /* If we know this is a type-name, there's no need to look it
22475 up. */
22478 else
22479 {
22480 tree ambiguous_decls;
22481 /* If we already know that this lookup is ambiguous, then
22482 we've already issued an error message; there's no reason
22483 to check again. */
22485 {
22488 }
22489 /* If the next token is a `::', then the name must be a type
22490 name.
22492 [basic.lookup.qual]
22494 During the lookup for a name preceding the :: scope
22495 resolution operator, object, function, and enumerator
22496 names are ignored. */
22499 /* Look up the name. */
22501 tag_type,
22504 check_dependency_p,
22508 {
22512 }
22513 }
22514 }
22515 else
22516 {
22517 /* Try a template-id. */
22519 check_dependency_p,
22520 tag_type,
22521 is_declaration);
22524 }
22528 /* If this is a typename, create a TYPENAME_TYPE. */
22530 {
22535 }
22539 /* Check to see that it is really the name of a class. */
22543 /* Situations like this:
22545 template <typename T> struct A {
22546 typename T::template X<int>::I i;
22547 };
22549 are problematic. Is `T::template X<int>' a class-name? The
22550 standard does not seem to be definitive, but there is no other
22551 valid interpretation of the following `::'. Therefore, those
22552 names are considered class-names. */
22553 {
22557 }
22562 /* In Objective-C 2.0, a classname followed by '.' starts a
22563 dot-syntax expression, and it's not a type-name. */
22575 }
22577 /* Parse a class-specifier.
22579 class-specifier:
22580 class-head { member-specification [opt] }
22582 Returns the TREE_TYPE representing the class. */
22584 static tree
22586 {
22587 tree type;
22601 /* Parse the class-head. */
22604 /* If the class-head was a semantic disaster, skip the entire body
22605 of the class. */
22607 {
22611 }
22613 /* Look for the `{'. */
22614 matching_braces braces;
22616 {
22619 }
22624 /* Issue an error message if type-definitions are forbidden here. */
22626 /* Remember that we are defining one more class. */
22628 /* Inside the class, surrounding template-parameter-lists do not
22629 apply. */
22630 saved_num_template_parameter_lists
22633 /* We are not in a function body. */
22636 /* Or in a loop. */
22639 /* Or in a switch. */
22642 /* We are not immediately inside an extern "lang" block. */
22643 saved_in_unbraced_linkage_specification_p
22647 // Associate constraints with the type.
22651 /* Start the class. */
22653 {
22656 }
22660 /* If the type is erroneous, skip the entire body of the class. */
22662 else
22663 /* Parse the member-specification. */
22666 /* Look for the trailing `}'. */
22668 /* Look for trailing attributes to apply to this class. */
22676 /* We've finished a type definition. Check for the common syntax
22677 error of forgetting a semicolon after the definition. We need to
22678 be careful, as we can't just check for not-a-semicolon and be done
22679 with it; the user might have typed:
22681 class X { } c = ...;
22682 class X { } *p = ...;
22684 and so forth. Instead, enumerate all the possible tokens that
22685 might follow this production; if we don't see one of them, then
22686 complain and silently insert the semicolon. */
22687 {
22692 /* Don't try to parse c++11 attributes here. As per the
22693 grammar, that should be a task for
22694 cp_parser_decl_specifier_seq. */
22698 {
22709 /* While it's legal for type qualifiers and storage class
22710 specifiers to follow type definitions in the grammar, only
22711 compiler testsuites contain code like that. Assume that if
22712 we see such code, then what we're really seeing is a case
22713 like:
22715 class X { }
22716 const <type> var = ...;
22718 or
22720 class Y { }
22721 static <type> func (...) ...
22723 i.e. the qualifier or specifier applies to the next
22724 declaration. To do so, however, we need to look ahead one
22725 more token to see if *that* token is a type specifier.
22727 This code could be improved to handle:
22729 class Z { }
22730 static const <type> var = ...; */
22733 {
22736 /* Handling user-defined types here would be nice, but very
22737 tricky. */
22738 want_semicolon
22741 }
22745 }
22747 /* If we don't have a type, then something is very wrong and we
22748 shouldn't try to do anything clever. Likewise for not seeing the
22749 closing brace. */
22751 {
22752 /* Locate the closing brace. */
22753 cp_token_position prev
22758 /* We want to suggest insertion of a ';' immediately *after* the
22759 closing brace, so, if we can, offset the location by 1 column. */
22766 /* If we successfully offset the location, suggest the fix-it. */
22779 else
22782 /* Unget one token and smash it to look as though we encountered
22783 a semicolon in the input stream. */
22788 }
22789 }
22791 /* If this class is not itself within the scope of another class,
22792 then we need to parse the bodies of all of the queued function
22793 definitions. Note that the queued functions defined in a class
22794 are not always processed immediately following the
22795 class-specifier for that class. Consider:
22797 struct A {
22798 struct B { void f() { sizeof (A); } };
22799 };
22801 If `f' were processed before the processing of `A' were
22802 completed, there would be no way to compute the size of `A'.
22803 Note that the nesting we are interested in here is lexical --
22804 not the semantic nesting given by TYPE_CONTEXT. In particular,
22805 for:
22807 struct A { struct B; };
22808 struct A::B { void f() { } };
22810 there is no need to delay the parsing of `A::B::f'. */
22812 {
22813 tree decl;
22821 {
22822 /* Skip default arguments, NSDMIs, etc, in order to improve
22823 error recovery (c++/71169, c++/71832). */
22828 }
22830 /* In a first pass, parse default arguments to the functions.
22831 Then, in a second pass, parse the bodies of the functions.
22832 This two-phased approach handles cases like:
22834 struct S {
22835 void f() { g(); }
22836 void g(int i = 3);
22837 };
22839 */
22841 {
22843 /* If there are default arguments that have not yet been processed,
22844 take care of them now. */
22846 {
22851 }
22852 /* Make sure that any template parameters are in scope. */
22854 /* Parse the default argument expressions. */
22856 /* Remove any template parameters from the symbol table. */
22858 }
22860 /* Now parse any NSDMIs. */
22864 {
22866 {
22871 }
22874 }
22881 /* Now do some post-NSDMI bookkeeping. */
22887 /* Now parse the body of the functions. */
22889 {
22890 /* OpenMP UDRs need to be parsed before all other functions. */
22897 }
22898 else
22902 }
22903 else
22906 /* Put back any saved access checks. */
22909 /* Restore saved state. */
22913 parser->num_template_parameter_lists
22915 parser->in_unbraced_linkage_specification_p
22919 }
22921 static tree
22923 {
22924 tree ret;
22929 }
22931 /* Parse a class-head.
22933 class-head:
22934 class-key identifier [opt] base-clause [opt]
22935 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22936 class-key nested-name-specifier [opt] template-id
22937 base-clause [opt]
22939 class-virt-specifier:
22940 final
22942 GNU Extensions:
22943 class-key attributes identifier [opt] base-clause [opt]
22944 class-key attributes nested-name-specifier identifier base-clause [opt]
22945 class-key attributes nested-name-specifier [opt] template-id
22946 base-clause [opt]
22948 Upon return BASES is initialized to the list of base classes (or
22949 NULL, if there are none) in the same form returned by
22950 cp_parser_base_clause.
22952 Returns the TYPE of the indicated class. Sets
22953 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22954 involving a nested-name-specifier was used, and FALSE otherwise.
22956 Returns error_mark_node if this is not a class-head.
22958 Returns NULL_TREE if the class-head is syntactically valid, but
22959 semantically invalid in a way that means we should skip the entire
22960 body of the class. */
22962 static tree
22965 {
22966 tree nested_name_specifier;
22970 tree attributes;
22971 tree bases;
22981 /* Assume no nested-name-specifier will be present. */
22983 /* Assume no template parameter lists will be used in defining the
22984 type. */
22988 /* Look for the class-key. */
22995 /* Parse the attributes. */
22998 /* If the next token is `::', that is invalid -- but sometimes
22999 people do try to write:
23001 struct ::S {};
23003 Handle this gracefully by accepting the extra qualifier, and then
23004 issuing an error about it later if this really is a
23005 class-head. If it turns out just to be an elaborated type
23006 specifier, remain silent. */
23012 /* Determine the name of the class. Begin by looking for an
23013 optional nested-name-specifier. */
23015 nested_name_specifier
23021 /* If there was a nested-name-specifier, then there *must* be an
23022 identifier. */
23027 {
23029 /* Although the grammar says `identifier', it really means
23030 `class-name' or `template-name'. You are only allowed to
23031 define a class that has already been declared with this
23032 syntax.
23034 The proposed resolution for Core Issue 180 says that wherever
23035 you see `class T::X' you should treat `X' as a type-name.
23037 It is OK to define an inaccessible class; for example:
23039 class A { class B; };
23040 class A::B {};
23042 We do not know if we will see a class-name, or a
23043 template-name. We look for a class-name first, in case the
23044 class-name is a template-id; if we looked for the
23045 template-name first we would stop after the template-name. */
23052 class_type,
23056 /* If that didn't work, ignore the nested-name-specifier. */
23058 {
23064 }
23065 /* If we could not find a corresponding TYPE, treat this
23066 declaration like an unqualified declaration. */
23069 /* Otherwise, count the number of templates used in TYPE and its
23070 containing scopes. */
23071 else
23073 }
23074 /* Otherwise, the identifier is optional. */
23075 else
23076 {
23077 /* We don't know whether what comes next is a template-id,
23078 an identifier, or nothing at all. */
23080 /* Check for a template-id. */
23085 class_key,
23087 /* If that didn't work, it could still be an identifier. */
23089 {
23091 {
23094 }
23095 else
23097 }
23098 else
23099 {
23102 }
23103 }
23108 {
23110 class_key,
23112 }
23115 /* If it's not a `:' or a `{' then we can't really be looking at a
23116 class-head, since a class-head only appears as part of a
23117 class-specifier. We have to detect this situation before calling
23118 xref_tag, since that has irreversible side-effects. */
23120 {
23124 }
23126 /* At this point, we're going ahead with the class-specifier, even
23127 if some other problem occurs. */
23130 {
23135 }
23136 /* Issue the error about the overly-qualified name now. */
23138 {
23143 }
23145 {
23150 }
23152 {
23153 tree scope;
23156 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23157 keyword template shall not appear at the top level. */
23161 /* Reject typedef-names in class heads. */
23163 {
23166 type);
23169 }
23171 /* Figure out in what scope the declaration is being placed. */
23173 /* If that scope does not contain the scope in which the
23174 class was originally declared, the program is invalid. */
23176 {
23179 "declaration of %qD in namespace %qD which does not "
23182 else
23188 }
23189 /* [dcl.meaning]
23191 A declarator-id shall not be qualified except for the
23192 definition of a ... nested class outside of its class
23193 ... [or] the definition or explicit instantiation of a
23194 class member of a namespace outside of its namespace. */
23196 {
23201 }
23202 }
23203 /* An explicit-specialization must be preceded by "template <>". If
23204 it is not, try to recover gracefully. */
23207 && !processing_template_parmlist
23209 {
23210 /* Build a location of this form:
23211 struct typename <ARGS>
23212 ^~~~~~~~~~~~~~~~~~~~~~
23213 with caret==start at the start token, and
23214 finishing at the end of the type. */
23215 location_t reported_loc
23217 class_head_start_location,
23223 "an explicit specialization must be preceded by"
23226 /* Take the same action that would have been taken by
23227 cp_parser_explicit_specialization. */
23230 }
23231 /* There must be no "return" statements between this point and the
23232 end of this function; set "type "to the correct return value and
23233 use "goto done;" to return. */
23234 /* Make sure that the right number of template parameters were
23235 present. */
23237 template_id_p,
23240 {
23241 /* If something went wrong, there is no point in even trying to
23242 process the class-definition. */
23245 }
23247 /* Look up the type. */
23249 {
23253 {
23257 }
23258 else
23259 {
23263 /* Check the scope while we still know whether or not we had a
23264 nested-name-specifier. */
23267 }
23270 }
23272 {
23273 tree class_type;
23275 /* Given:
23277 template <typename T> struct S { struct T };
23278 template <typename T> struct S<T>::T { };
23280 we will get a TYPENAME_TYPE when processing the definition of
23281 `S::T'. We need to resolve it to the actual type before we
23282 try to define it. */
23284 {
23289 else
23290 {
23293 }
23294 }
23298 {
23301 }
23304 /* Enter the scope indicated by the nested-name-specifier. */
23306 /* Get the canonical version of this type. */
23308 /* Call push_template_decl if it seems like we should be defining a
23309 template either from the template headers or the type we're
23310 defining, so that we diagnose both extra and missing headers. */
23314 {
23317 {
23320 }
23321 }
23325 }
23327 {
23328 /* If the class was unnamed, create a dummy name. */
23332 ? ts_within_enclosing_non_class
23336 }
23338 /* Indicate whether this class was declared as a `class' or as a
23339 `struct'. */
23344 /* If this type was already complete, and we see another definition,
23345 that's an error. */
23347 {
23349 type);
23351 type);
23354 }
23359 {
23360 /* Apply attributes now, before any use of the class as a template
23361 argument in its base list. */
23364 }
23366 /* We will have entered the scope containing the class; the names of
23367 base classes should be looked up in that context. For example:
23369 struct A { struct B {}; struct C; };
23370 struct A::C : B {};
23372 is valid. */
23374 /* Get the list of base-classes, if there is one. */
23376 {
23377 /* PR59482: enter the class scope so that base-specifiers are looked
23378 up correctly. */
23382 /* PR59482: get out of the previously pushed class scope so that the
23383 subsequent pops pop the right thing. */
23386 }
23387 else
23390 /* If we're really defining a class, process the base classes.
23391 If they're invalid, fail. */
23395 done:
23396 /* Leave the scope given by the nested-name-specifier. We will
23397 enter the class scope itself while processing the members. */
23402 {
23405 }
23411 out:
23414 }
23416 /* Parse a class-key.
23418 class-key:
23419 class
23420 struct
23421 union
23423 Returns the kind of class-key specified, or none_type to indicate
23424 error. */
23426 static enum tag_types
23428 {
23432 /* Look for the class-key. */
23437 /* Check to see if the TOKEN is a class-key. */
23442 }
23444 /* Parse a type-parameter-key.
23446 type-parameter-key:
23447 class
23448 typename
23449 */
23451 static void
23453 {
23454 /* Look for the type-parameter-key. */
23458 {
23461 /* typename is not allowed in a template template parameter
23462 by the standard until C++17. */
23464 "ISO C++ forbids typename key in template template parameter;"
23466 }
23467 else
23471 }
23473 /* Parse an (optional) member-specification.
23475 member-specification:
23476 member-declaration member-specification [opt]
23477 access-specifier : member-specification [opt] */
23479 static void
23481 {
23483 {
23487 /* Peek at the next token. */
23489 /* If it's a `}', or EOF then we've seen all the members. */
23495 /* See if this token is a keyword. */
23498 {
23502 /* Consume the access-specifier. */
23504 /* Remember which access-specifier is active. */
23506 /* Look for the `:'. */
23511 /* Accept #pragmas at class scope. */
23513 {
23516 }
23518 /* Otherwise, the next construction must be a
23519 member-declaration. */
23521 }
23522 }
23523 }
23525 /* Parse a member-declaration.
23527 member-declaration:
23528 decl-specifier-seq [opt] member-declarator-list [opt] ;
23529 function-definition ; [opt]
23530 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23531 using-declaration
23532 template-declaration
23533 alias-declaration
23535 member-declarator-list:
23536 member-declarator
23537 member-declarator-list , member-declarator
23539 member-declarator:
23540 declarator pure-specifier [opt]
23541 declarator constant-initializer [opt]
23542 identifier [opt] : constant-expression
23544 GNU Extensions:
23546 member-declaration:
23547 __extension__ member-declaration
23549 member-declarator:
23550 declarator attributes [opt] pure-specifier [opt]
23551 declarator attributes [opt] constant-initializer [opt]
23552 identifier [opt] attributes [opt] : constant-expression
23554 C++0x Extensions:
23556 member-declaration:
23557 static_assert-declaration */
23559 static void
23561 {
23562 cp_decl_specifier_seq decl_specifiers;
23563 tree prefix_attributes;
23564 tree decl;
23573 /* Check for the `__extension__' keyword. */
23575 {
23576 /* Recurse. */
23578 /* Restore the old value of the PEDANTIC flag. */
23582 }
23584 /* Check for a template-declaration. */
23586 {
23587 /* An explicit specialization here is an error condition, and we
23588 expect the specialization handler to detect and report this. */
23592 else
23596 }
23597 /* Check for a template introduction. */
23601 /* Check for a using-declaration. */
23603 {
23605 {
23606 /* Parse the using-declaration. */
23610 }
23611 else
23612 {
23613 tree decl;
23617 /* Note that if we actually see the '=' token after the
23618 identifier, cp_parser_alias_declaration commits the
23619 tentative parse. In that case, we really expect an
23620 alias-declaration. Otherwise, we expect a using
23621 declaration. */
23622 alias_decl_expected =
23628 else
23632 }
23633 }
23635 /* Check for @defs. */
23637 {
23642 {
23647 }
23649 }
23651 /* If the next token is `static_assert' we have a static assertion. */
23653 {
23656 }
23663 /* Parse the decl-specifier-seq. */
23666 CP_PARSER_FLAGS_OPTIONAL,
23669 /* Check for an invalid type-name. */
23673 /* If there is no declarator, then the decl-specifier-seq should
23674 specify a type. */
23676 {
23677 /* If there was no decl-specifier-seq, and the next token is a
23678 `;', then we have something like:
23680 struct S { ; };
23682 [class.mem]
23684 Each member-declaration shall declare at least one member
23685 name of the class. */
23687 {
23690 {
23694 }
23695 }
23696 else
23697 {
23698 tree type;
23700 /* See if this declaration is a friend. */
23702 /* If there were decl-specifiers, check to see if there was
23703 a class-declaration. */
23706 /* Nested classes have already been added to the class, but
23707 a `friend' needs to be explicitly registered. */
23709 {
23710 /* If the `friend' keyword was present, the friend must
23711 be introduced with a class-key. */
23714 "in C++03 a class-key must be used "
23716 /* In this case:
23718 template <typename T> struct A {
23719 friend struct A<T>::B;
23720 };
23722 A<T>::B will be represented by a TYPENAME_TYPE, and
23723 therefore not recognized by check_tag_decl. */
23725 {
23729 }
23732 "friend declaration does not name a class or "
23734 else
23737 }
23738 /* If there is no TYPE, an error message will already have
23739 been issued. */
23741 ;
23742 /* An anonymous aggregate has to be handled specially; such
23743 a declaration really declares a data member (with a
23744 particular type), as opposed to a nested class. */
23746 {
23747 /* C++11 9.5/6. */
23750 "a storage class on an anonymous aggregate "
23753 /* Remove constructors and such from TYPE, now that we
23754 know it is an anonymous aggregate. */
23756 /* And make the corresponding data member. */
23759 /* Add it to the class. */
23761 }
23762 else
23763 cp_parser_check_access_in_redeclaration
23766 }
23767 }
23768 else
23769 {
23772 /* Clear attributes from the decl_specifiers but keep them
23773 around as prefix attributes that apply them to the entity
23774 being declared. */
23778 /* See if these declarations will be friends. */
23781 /* Keep going until we hit the `;' at the end of the
23782 declaration. */
23784 {
23786 tree first_attribute;
23787 tree initializer;
23790 /* Peek at the next token. */
23793 /* The following code wants to know early if it is a bit-field
23794 or some other declaration. Attributes can appear before
23795 the `:' token. Skip over them without consuming any tokens
23796 to peek if they are followed by `:'. */
23801 {
23802 size_t n
23805 }
23807 /* Check for a bitfield declaration. */
23813 {
23814 tree identifier;
23815 tree width;
23820 else
23823 /* Look for attributes that apply to the bitfield. */
23826 /* Consume the `:' token. */
23829 /* Get the width of the bitfield. */
23833 /* In C++2A and as extension for C++11 and above we allow
23834 default member initializers for bit-fields. */
23839 CPP_OPEN_BRACE)))
23840 {
23841 location_t loc
23847 "default member initializers for bit-fields "
23848 "only available with -std=c++2a or "
23853 {
23857 }
23858 }
23859 else
23860 {
23861 /* Look for attributes that apply to the bitfield after
23862 the `:' token and width. This is where GCC used to
23863 parse attributes in the past, pedwarn if there is
23864 a std attribute. */
23867 "ISO C++ allows bit-field attributes only "
23871 }
23875 /* Remember which attributes are prefix attributes and
23876 which are not. */
23878 /* Combine the attributes. */
23881 /* Create the bitfield declaration. */
23884 identifier,
23885 sfk_none)
23889 attributes);
23890 }
23891 else
23892 {
23894 tree asm_specification;
23897 /* Parse the declarator. */
23898 declarator
23903 friend_p);
23905 /* If something went wrong parsing the declarator, make sure
23906 that we at least consume some tokens. */
23908 {
23909 /* Skip to the end of the statement. */
23911 /* If the next token is not a semicolon, that is
23912 probably because we just skipped over the body of
23913 a function. So, we consume a semicolon if
23914 present, but do not issue an error message if it
23915 is not present. */
23917 CPP_SEMICOLON))
23920 }
23923 cp_parser_check_for_definition_in_return_type
23927 /* Look for an asm-specification. */
23929 /* Look for attributes that apply to the declaration. */
23931 /* Remember which attributes are prefix attributes and
23932 which are not. */
23934 /* Combine the attributes. */
23937 /* If it's an `=', then we have a constant-initializer or a
23938 pure-specifier. It is not correct to parse the
23939 initializer before registering the member declaration
23940 since the member declaration should be in scope while
23941 its initializer is processed. However, the rest of the
23942 front end does not yet provide an interface that allows
23943 us to handle this correctly. */
23945 {
23946 /* In [class.mem]:
23948 A pure-specifier shall be used only in the declaration of
23949 a virtual function.
23951 A member-declarator can contain a constant-initializer
23952 only if it declares a static member of integral or
23953 enumeration type.
23955 Therefore, if the DECLARATOR is for a function, we look
23956 for a pure-specifier; otherwise, we look for a
23957 constant-initializer. When we call `grokfield', it will
23958 perform more stringent semantics checks. */
23970 {
23972 /* Don't require a constant rvalue in C++11, since we
23973 might want a reference constant. We'll enforce
23974 constancy later. */
23976 /* Parse the initializer. */
23979 }
23980 else
23981 /* Parse the initializer. */
23983 }
23986 {
23990 else
23992 }
23993 /* Otherwise, there is no initializer. */
23994 else
23997 /* See if we are probably looking at a function
23998 definition. We are certainly not looking at a
23999 member-declarator. Calling `grokfield' has
24000 side-effects, so we must not do it unless we are sure
24001 that we are looking at a member-declarator. */
24004 {
24005 /* The grammar does not allow a pure-specifier to be
24006 used when a member function is defined. (It is
24007 possible that this fact is an oversight in the
24008 standard, since a pure function may be defined
24009 outside of the class-specifier. */
24015 declarator,
24016 attributes);
24019 /* If the member was not a friend, declare it here. */
24022 /* Peek at the next token. */
24024 /* If the next token is a semicolon, consume it. */
24026 {
24027 location_t semicolon_loc
24032 "extra %<;%> after in-class "
24034 }
24036 }
24037 else
24040 /* Create the declaration. */
24045 {
24048 else
24050 }
24051 }
24056 /* Reset PREFIX_ATTRIBUTES. */
24058 {
24063 }
24065 /* If there is any qualification still in effect, clear it
24066 now; we will be starting fresh with the next declarator. */
24070 /* If it's a `,', then there are more declarators. */
24072 {
24075 {
24081 }
24082 }
24083 /* If the next token isn't a `;', then we have a parse error. */
24085 CPP_SEMICOLON))
24086 {
24087 /* The next token might be a ways away from where the
24088 actual semicolon is missing. Find the previous token
24089 and use that for our error position. */
24096 /* Assume that the user meant to provide a semicolon. If
24097 we were to cp_parser_skip_to_end_of_statement, we might
24098 skip to a semicolon inside a member function definition
24099 and issue nonsensical error messages. */
24101 }
24104 {
24105 /* Add DECL to the list of members. */
24107 /* Explicitly include, eg, NSDMIs, for better error
24108 recovery (c++/58650). */
24116 /* Add DECL to the queue of NSDMI to be parsed later. */
24118 }
24122 }
24123 }
24126 out:
24128 }
24130 /* Parse a pure-specifier.
24132 pure-specifier:
24133 = 0
24135 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24136 Otherwise, ERROR_MARK_NODE is returned. */
24138 static tree
24140 {
24143 /* Look for the `=' token. */
24146 /* Look for the `0' token. */
24155 /* Accept = default or = delete in c++0x mode. */
24158 {
24161 }
24163 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24165 {
24170 }
24172 {
24175 }
24178 }
24180 /* Parse a constant-initializer.
24182 constant-initializer:
24183 = constant-expression
24185 Returns a representation of the constant-expression. */
24187 static tree
24189 {
24190 /* Look for the `=' token. */
24194 /* It is invalid to write:
24196 struct S { static const int i = { 7 }; };
24198 */
24200 {
24203 /* Consume the opening brace. */
24204 matching_braces braces;
24206 /* Skip the initializer. */
24208 /* Look for the trailing `}'. */
24212 }
24215 }
24217 /* Derived classes [gram.class.derived] */
24219 /* Parse a base-clause.
24221 base-clause:
24222 : base-specifier-list
24224 base-specifier-list:
24225 base-specifier ... [opt]
24226 base-specifier-list , base-specifier ... [opt]
24228 Returns a TREE_LIST representing the base-classes, in the order in
24229 which they were declared. The representation of each node is as
24230 described by cp_parser_base_specifier.
24232 In the case that no bases are specified, this function will return
24233 NULL_TREE, not ERROR_MARK_NODE. */
24235 static tree
24237 {
24240 /* Look for the `:' that begins the list. */
24243 /* Scan the base-specifier-list. */
24245 {
24247 tree base;
24250 /* Look for the base-specifier. */
24252 /* Look for the (optional) ellipsis. */
24254 {
24255 /* Consume the `...'. */
24259 }
24261 /* Add BASE to the front of the list. */
24263 {
24265 /* Make this a pack expansion type. */
24269 {
24272 }
24273 }
24274 /* Peek at the next token. */
24276 /* If it's not a comma, then the list is complete. */
24279 /* Consume the `,'. */
24281 }
24283 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24284 base class had a qualified name. However, the next name that
24285 appears is certainly not qualified. */
24291 }
24293 /* Parse a base-specifier.
24295 base-specifier:
24296 :: [opt] nested-name-specifier [opt] class-name
24297 virtual access-specifier [opt] :: [opt] nested-name-specifier
24298 [opt] class-name
24299 access-specifier virtual [opt] :: [opt] nested-name-specifier
24300 [opt] class-name
24302 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24303 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24304 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24305 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24307 static tree
24309 {
24317 tree type;
24319 /* Process the optional `virtual' and `access-specifier'. */
24321 {
24322 /* Peek at the next token. */
24324 /* Process `virtual'. */
24326 {
24328 /* If `virtual' appears more than once, issue an error. */
24330 {
24334 }
24338 /* Consume the `virtual' token. */
24346 /* If more than one access specifier appears, issue an
24347 error. */
24350 {
24354 }
24358 /* Consume the access-specifier. */
24366 }
24367 }
24368 /* It is not uncommon to see programs mechanically, erroneously, use
24369 the 'typename' keyword to denote (dependent) qualified types
24370 as base classes. */
24372 {
24377 else
24379 "keyword %<typename%> not allowed in this context "
24382 }
24384 /* Look for the optional `::' operator. */
24386 /* Look for the nested-name-specifier. The simplest way to
24387 implement:
24389 [temp.res]
24391 The keyword `typename' is not permitted in a base-specifier or
24392 mem-initializer; in these contexts a qualified name that
24393 depends on a template-parameter is implicitly assumed to be a
24394 type name.
24396 is to pretend that we have seen the `typename' keyword at this
24397 point. */
24403 /* If the base class is given by a qualified name, assume that names
24404 we see are type names or templates, as appropriate. */
24410 /* DR 950 allows decltype as a base-specifier. */
24412 else
24413 {
24414 /* Otherwise, look for the class-name. */
24416 class_scope_p,
24417 template_p,
24418 typename_type,
24423 }
24429 }
24431 /* Exception handling [gram.exception] */
24433 /* Parse an (optional) noexcept-specification.
24435 noexcept-specification:
24436 noexcept ( constant-expression ) [opt]
24438 If no noexcept-specification is present, returns NULL_TREE.
24439 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24440 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24441 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24442 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24443 in which case a boolean condition is returned instead. */
24445 static tree
24450 {
24454 /* Peek at the next token. */
24457 /* Is it a noexcept-specification? */
24459 {
24460 tree expr;
24464 {
24465 matching_parens parens;
24469 {
24470 /* Types may not be defined in an exception-specification. */
24472 parser->type_definition_forbidden_message
24477 /* Restore the saved message. */
24479 }
24480 else
24481 {
24484 }
24487 }
24488 else
24489 {
24493 }
24495 /* We cannot build a noexcept-spec right away because this will check
24496 that expr is a constexpr. */
24499 else
24501 }
24502 else
24504 }
24506 /* Parse an (optional) exception-specification.
24508 exception-specification:
24509 throw ( type-id-list [opt] )
24511 Returns a TREE_LIST representing the exception-specification. The
24512 TREE_VALUE of each node is a type. */
24514 static tree
24516 {
24518 tree type_id_list;
24521 /* Peek at the next token. */
24524 /* Is it a noexcept-specification? */
24530 /* If it's not `throw', then there's no exception-specification. */
24536 /* Consume the `throw'. */
24539 /* Look for the `('. */
24540 matching_parens parens;
24543 /* Peek at the next token. */
24545 /* If it's not a `)', then there is a type-id-list. */
24547 {
24548 /* Types may not be defined in an exception-specification. */
24550 parser->type_definition_forbidden_message
24552 /* Parse the type-id-list. */
24554 /* Restore the saved message. */
24558 {
24562 }
24565 "dynamic exception specifications are deprecated in "
24567 }
24568 /* In C++17, throw() is equivalent to noexcept (true). throw()
24569 is deprecated in C++11 and above as well, but is still widely used,
24570 so don't warn about it yet. */
24573 else
24576 /* Look for the `)'. */
24580 }
24582 /* Parse an (optional) type-id-list.
24584 type-id-list:
24585 type-id ... [opt]
24586 type-id-list , type-id ... [opt]
24588 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24589 in the order that the types were presented. */
24591 static tree
24593 {
24597 {
24599 tree type;
24603 /* Get the next type-id. */
24605 /* Check for invalid 'auto'. */
24607 {
24611 }
24612 /* Parse the optional ellipsis. */
24614 {
24615 /* Consume the `...'. */
24618 /* Turn the type into a pack expansion expression. */
24620 }
24621 /* Add it to the list. */
24623 /* Peek at the next token. */
24625 /* If it is not a `,', we are done. */
24628 /* Consume the `,'. */
24630 }
24633 }
24635 /* Parse a try-block.
24637 try-block:
24638 try compound-statement handler-seq */
24640 static tree
24642 {
24643 tree try_block;
24657 }
24659 /* Parse a function-try-block.
24661 function-try-block:
24662 try ctor-initializer [opt] function-body handler-seq */
24664 static void
24666 {
24667 tree compound_stmt;
24668 tree try_block;
24670 /* Look for the `try' keyword. */
24673 /* Let the rest of the front end know where we are. */
24675 /* Parse the function-body. */
24676 cp_parser_ctor_initializer_opt_and_function_body
24678 /* We're done with the `try' part. */
24680 /* Parse the handlers. */
24682 /* We're done with the handlers. */
24684 }
24686 /* Parse a handler-seq.
24688 handler-seq:
24689 handler handler-seq [opt] */
24691 static void
24693 {
24695 {
24698 /* Parse the handler. */
24700 /* Peek at the next token. */
24702 /* If it's not `catch' then there are no more handlers. */
24705 }
24706 }
24708 /* Parse a handler.
24710 handler:
24711 catch ( exception-declaration ) compound-statement */
24713 static void
24715 {
24716 tree handler;
24717 tree declaration;
24721 matching_parens parens;
24728 }
24730 /* Parse an exception-declaration.
24732 exception-declaration:
24733 type-specifier-seq declarator
24734 type-specifier-seq abstract-declarator
24735 type-specifier-seq
24736 ...
24738 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24739 ellipsis variant is used. */
24741 static tree
24743 {
24744 cp_decl_specifier_seq type_specifiers;
24748 /* If it's an ellipsis, it's easy to handle. */
24750 {
24751 /* Consume the `...' token. */
24754 }
24756 /* Types may not be defined in exception-declarations. */
24758 parser->type_definition_forbidden_message
24761 /* Parse the type-specifier-seq. */
24765 /* If it's a `)', then there is no declarator. */
24768 else
24775 /* Restore the saved message. */
24782 }
24784 /* Parse a throw-expression.
24786 throw-expression:
24787 throw assignment-expression [opt]
24789 Returns a THROW_EXPR representing the throw-expression. */
24791 static tree
24793 {
24794 tree expression;
24799 /* Figure out whether or not there is an assignment-expression
24800 following the "throw" keyword. */
24808 else
24812 }
24814 /* GNU Extensions */
24816 /* Parse an (optional) asm-specification.
24818 asm-specification:
24819 asm ( string-literal )
24821 If the asm-specification is present, returns a STRING_CST
24822 corresponding to the string-literal. Otherwise, returns
24823 NULL_TREE. */
24825 static tree
24827 {
24829 tree asm_specification;
24831 /* Peek at the next token. */
24833 /* If the next token isn't the `asm' keyword, then there's no
24834 asm-specification. */
24838 /* Consume the `asm' token. */
24840 /* Look for the `('. */
24841 matching_parens parens;
24844 /* Look for the string-literal. */
24847 /* Look for the `)'. */
24851 }
24853 /* Parse an asm-operand-list.
24855 asm-operand-list:
24856 asm-operand
24857 asm-operand-list , asm-operand
24859 asm-operand:
24860 string-literal ( expression )
24861 [ string-literal ] string-literal ( expression )
24863 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24864 each node is the expression. The TREE_PURPOSE is itself a
24865 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24866 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24867 is a STRING_CST for the string literal before the parenthesis. Returns
24868 ERROR_MARK_NODE if any of the operands are invalid. */
24870 static tree
24872 {
24877 {
24878 tree string_literal;
24879 tree expression;
24880 tree name;
24883 {
24884 /* Consume the `[' token. */
24886 /* Read the operand name. */
24891 /* Look for the closing `]'. */
24893 }
24894 else
24896 /* Look for the string-literal. */
24899 /* Look for the `('. */
24900 matching_parens parens;
24902 /* Parse the expression. */
24904 /* Look for the `)'. */
24912 /* Add this operand to the list. */
24914 expression,
24915 asm_operands);
24916 /* If the next token is not a `,', there are no more
24917 operands. */
24920 /* Consume the `,'. */
24922 }
24925 }
24927 /* Parse an asm-clobber-list.
24929 asm-clobber-list:
24930 string-literal
24931 asm-clobber-list , string-literal
24933 Returns a TREE_LIST, indicating the clobbers in the order that they
24934 appeared. The TREE_VALUE of each node is a STRING_CST. */
24936 static tree
24938 {
24942 {
24943 tree string_literal;
24945 /* Look for the string literal. */
24947 /* Add it to the list. */
24949 /* If the next token is not a `,', then the list is
24950 complete. */
24953 /* Consume the `,' token. */
24955 }
24958 }
24960 /* Parse an asm-label-list.
24962 asm-label-list:
24963 identifier
24964 asm-label-list , identifier
24966 Returns a TREE_LIST, indicating the labels in the order that they
24967 appeared. The TREE_VALUE of each node is a label. */
24969 static tree
24971 {
24975 {
24978 /* Look for the identifier. */
24981 {
24984 {
24990 }
24991 }
24992 /* If the next token is not a `,', then the list is
24993 complete. */
24996 /* Consume the `,' token. */
24998 }
25001 }
25003 /* Return TRUE iff the next tokens in the stream are possibly the
25004 beginning of a GNU extension attribute. */
25006 static bool
25008 {
25010 }
25012 /* Return TRUE iff the next tokens in the stream are possibly the
25013 beginning of a standard C++-11 attribute specifier. */
25015 static bool
25017 {
25019 }
25021 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25022 beginning of a standard C++-11 attribute specifier. */
25024 static bool
25026 {
25034 }
25036 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25037 beginning of a GNU extension attribute. */
25039 static bool
25041 {
25045 }
25047 /* Return true iff the next tokens can be the beginning of either a
25048 GNU attribute list, or a standard C++11 attribute sequence. */
25050 static bool
25052 {
25055 }
25057 /* Return true iff the next Nth tokens can be the beginning of either
25058 a GNU attribute list, or a standard C++11 attribute sequence. */
25060 static bool
25062 {
25065 }
25067 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
25068 of GNU attributes, or return NULL. */
25070 static tree
25072 {
25076 }
25078 /* Parse an (optional) series of attributes.
25080 attributes:
25081 attributes attribute
25083 attribute:
25084 __attribute__ (( attribute-list [opt] ))
25086 The return value is as for cp_parser_gnu_attribute_list. */
25088 static tree
25090 {
25097 {
25099 tree attribute_list;
25102 /* Peek at the next token. */
25104 /* If it's not `__attribute__', then we're done. */
25108 /* Consume the `__attribute__' keyword. */
25110 /* Look for the two `(' tokens. */
25111 matching_parens outer_parens;
25113 matching_parens inner_parens;
25116 /* Peek at the next token. */
25119 /* Parse the attribute-list. */
25121 else
25122 /* If the next token is a `)', then there is no attribute
25123 list. */
25126 /* Look for the two `)' tokens. */
25134 /* Add these new attributes to the list. */
25136 }
25139 }
25141 /* Parse a GNU attribute-list.
25143 attribute-list:
25144 attribute
25145 attribute-list , attribute
25147 attribute:
25148 identifier
25149 identifier ( identifier )
25150 identifier ( identifier , expression-list )
25151 identifier ( expression-list )
25153 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25154 to an attribute. The TREE_PURPOSE of each node is the identifier
25155 indicating which attribute is in use. The TREE_VALUE represents
25156 the arguments, if any. */
25158 static tree
25160 {
25166 {
25168 tree identifier;
25169 tree attribute;
25171 /* Look for the identifier. We also allow keywords here; for
25172 example `__attribute__ ((const))' is legal. */
25176 {
25179 /* Consume the token, but save it since we need it for the
25180 SIMD enabled function parsing. */
25183 /* Save away the identifier that indicates which attribute
25184 this is. */
25186 /* For keywords, use the canonical spelling, not the
25187 parsed identifier. */
25194 /* Peek at the next token. */
25196 /* If it's an `(', then parse the attribute arguments. */
25198 {
25202 vec = cp_parser_parenthesized_expression_list
25208 else
25209 {
25212 }
25213 /* Save the arguments away. */
25215 }
25218 {
25219 /* Add this attribute to the list. */
25222 }
25225 }
25226 /* Now, look for more attributes. If the next token isn't a
25227 `,', we're done. */
25231 /* Consume the comma and keep going. */
25233 }
25236 /* We built up the list in reverse order. */
25238 }
25240 /* Parse a standard C++11 attribute.
25242 The returned representation is a TREE_LIST which TREE_PURPOSE is
25243 the scoped name of the attribute, and the TREE_VALUE is its
25244 arguments list.
25246 Note that the scoped name of the attribute is itself a TREE_LIST
25247 which TREE_PURPOSE is the namespace of the attribute, and
25248 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25249 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25250 and which TREE_PURPOSE is directly the attribute name.
25252 Clients of the attribute code should use get_attribute_namespace
25253 and get_attribute_name to get the actual namespace and name of
25254 attributes, regardless of their being GNU or C++11 attributes.
25256 attribute:
25257 attribute-token attribute-argument-clause [opt]
25259 attribute-token:
25260 identifier
25261 attribute-scoped-token
25263 attribute-scoped-token:
25264 attribute-namespace :: identifier
25266 attribute-namespace:
25267 identifier
25269 attribute-argument-clause:
25270 ( balanced-token-seq )
25272 balanced-token-seq:
25273 balanced-token [opt]
25274 balanced-token-seq balanced-token
25276 balanced-token:
25277 ( balanced-token-seq )
25278 [ balanced-token-seq ]
25279 { balanced-token-seq }. */
25281 static tree
25283 {
25290 /* First, parse name of the attribute, a.k.a attribute-token. */
25307 {
25308 /* We are seeing a scoped attribute token. */
25323 else
25324 {
25328 }
25333 NULL_TREE);
25335 }
25337 {
25341 NULL_TREE);
25342 }
25343 else
25344 {
25347 NULL_TREE);
25348 /* C++11 noreturn attribute is equivalent to GNU's. */
25351 /* C++14 deprecated attribute is equivalent to GNU's. */
25354 /* C++17 fallthrough attribute is equivalent to GNU's. */
25357 /* Transactional Memory TS optimize_for_synchronized attribute is
25358 equivalent to GNU transaction_callable. */
25362 /* Transactional Memory attributes are GNU attributes. */
25365 }
25367 /* Now parse the optional argument clause of the attribute. */
25372 {
25378 /* A GNU attribute that takes an identifier in parameter. */
25381 vec = cp_parser_parenthesized_expression_list
25387 else
25388 {
25391 }
25395 else
25397 }
25400 }
25402 /* Check that the attribute ATTRIBUTE appears at most once in the
25403 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25404 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25405 isn't implemented yet in GCC. */
25407 static void
25409 {
25411 {
25421 }
25422 }
25424 /* Parse a list of standard C++-11 attributes.
25426 attribute-list:
25427 attribute [opt]
25428 attribute-list , attribute[opt]
25429 attribute ...
25430 attribute-list , attribute ...
25431 */
25433 static tree
25435 {
25440 {
25445 {
25449 }
25452 {
25457 else
25458 {
25463 }
25465 }
25469 }
25472 }
25474 /* Parse a standard C++-11 attribute specifier.
25476 attribute-specifier:
25477 [ [ attribute-using-prefix [opt] attribute-list ] ]
25478 alignment-specifier
25480 attribute-using-prefix:
25481 using attribute-namespace :
25483 alignment-specifier:
25484 alignas ( type-id ... [opt] )
25485 alignas ( alignment-expression ... [opt] ). */
25487 static tree
25489 {
25495 {
25502 {
25513 {
25517 "attribute using prefix only available "
25523 }
25524 else
25526 }
25533 else
25534 /* Warn about parsing c++11 attribute in non-c++11 mode, only
25535 when we are sure that we have actually parsed them. */
25537 }
25538 else
25539 {
25540 tree alignas_expr;
25542 /* Look for an alignment-specifier. */
25553 matching_parens parens;
25561 {
25568 }
25573 /* Handle alignas (pack...). */
25575 {
25578 }
25580 /* Something went wrong, so don't build the attribute. */
25587 /* Build the C++-11 representation of an 'aligned'
25588 attribute. */
25589 attributes
25592 }
25595 }
25597 /* Parse a standard C++-11 attribute-specifier-seq.
25599 attribute-specifier-seq:
25600 attribute-specifier-seq [opt] attribute-specifier
25601 */
25603 static tree
25605 {
25610 {
25619 else
25622 }
25625 }
25627 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25628 return index of the first token after balanced-token, or N on failure. */
25630 static size_t
25632 {
25635 do
25637 {
25640 /* Ran out of tokens. */
25662 }
25665 }
25667 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25668 return index of the first token after the GNU attribute tokens, or N on
25669 failure. */
25671 static size_t
25673 {
25675 {
25687 }
25689 }
25691 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25692 next token), return index of the first token after the standard C++11
25693 attribute tokens, or N on failure. */
25695 static size_t
25697 {
25699 {
25702 {
25709 }
25712 {
25717 }
25718 else
25720 }
25722 }
25724 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25725 as the next token), return index of the first token after the attribute
25726 tokens, or N on failure. */
25728 static size_t
25730 {
25734 }
25736 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25737 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25738 current value of the PEDANTIC flag, regardless of whether or not
25739 the `__extension__' keyword is present. The caller is responsible
25740 for restoring the value of the PEDANTIC flag. */
25742 static bool
25744 {
25745 /* Save the old value of the PEDANTIC flag. */
25749 {
25750 /* Consume the `__extension__' token. */
25752 /* We're not being pedantic while the `__extension__' keyword is
25753 in effect. */
25757 }
25760 }
25762 /* Parse a label declaration.
25764 label-declaration:
25765 __label__ label-declarator-seq ;
25767 label-declarator-seq:
25768 identifier , label-declarator-seq
25769 identifier */
25771 static void
25773 {
25774 /* Look for the `__label__' keyword. */
25778 {
25779 tree identifier;
25781 /* Look for an identifier. */
25783 /* If we failed, stop. */
25786 /* Declare it as a label. */
25788 /* If the next token is a `;', stop. */
25791 /* Look for the `,' separating the label declarations. */
25793 }
25795 /* Look for the final `;'. */
25797 }
25799 // -------------------------------------------------------------------------- //
25800 // Requires Clause
25802 // Parse a requires clause.
25803 //
25804 // requires-clause:
25805 // 'requires' logical-or-expression
25806 //
25807 // The required logical-or-expression must be a constant expression. Note
25808 // that we don't check that the expression is constepxr here. We defer until
25809 // we analyze constraints and then, we only check atomic constraints.
25810 static tree
25812 {
25813 // Parse the requires clause so that it is not automatically folded.
25821 }
25823 // Optionally parse a requires clause:
25824 static tree
25826 {
25829 {
25832 {
25835 /* Parse and discard the requires-clause. */
25838 }
25840 }
25843 }
25846 /*---------------------------------------------------------------------------
25847 Requires expressions
25848 ---------------------------------------------------------------------------*/
25850 /* Parse a requires expression
25852 requirement-expression:
25853 'requires' requirement-parameter-list [opt] requirement-body */
25854 static tree
25856 {
25860 /* A requires-expression shall appear only within a concept
25861 definition or a requires-clause.
25863 TODO: Implement this diagnostic correctly. */
25865 {
25869 }
25872 {
25873 /* Local parameters are delared as variables within the scope
25874 of the expression. They are not visible past the end of
25875 the expression. Expressions within the requires-expression
25876 are unevaluated. */
25877 struct scope_sentinel
25878 {
25880 {
25883 }
25886 {
25889 }
25892 /* Parse the optional parameter list. */
25894 {
25898 }
25899 else
25902 /* Parse the requirement body. */
25906 }
25908 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25909 the parm chain. */
25912 }
25914 /* Parse a parameterized requirement.
25916 requirement-parameter-list:
25917 '(' parameter-declaration-clause ')' */
25918 static tree
25920 {
25921 matching_parens parens;
25931 }
25933 /* Parse the body of a requirement.
25935 requirement-body:
25936 '{' requirement-list '}' */
25937 static tree
25939 {
25940 matching_braces braces;
25950 }
25952 /* Parse a list of requirements.
25954 requirement-list:
25955 requirement
25956 requirement-list ';' requirement[opt] */
25957 static tree
25959 {
25962 {
25969 /* If we see a semi-colon, consume it. */
25973 /* Stop processing at the end of the list. */
25976 }
25978 /* Reverse the order of requirements so they are analyzed in
25979 declaration order. */
25981 }
25983 /* Parse a syntactic requirement or type requirement.
25985 requirement:
25986 simple-requirement
25987 compound-requirement
25988 type-requirement
25989 nested-requirement */
25990 static tree
25992 {
25999 else
26001 }
26003 /* Parse a simple requirement.
26005 simple-requirement:
26006 expression ';' */
26007 static tree
26009 {
26018 }
26020 /* Parse a type requirement
26022 type-requirement
26023 nested-name-specifier [opt] required-type-name ';'
26025 required-type-name:
26026 type-name
26027 'template' [opt] simple-template-id */
26028 static tree
26030 {
26033 // Save the scope before parsing name specifiers.
26044 tree type;
26046 {
26055 }
26056 else
26075 }
26077 /* Parse a compound requirement
26079 compound-requirement:
26080 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
26081 static tree
26083 {
26084 /* Parse an expression enclosed in '{ }'s. */
26085 matching_braces braces;
26096 /* Parse the optional noexcept. */
26099 {
26102 }
26104 /* Parse the optional trailing return type. */
26107 {
26115 }
26118 }
26120 /* Parse a nested requirement. This is the same as a requires clause.
26122 nested-requirement:
26123 requires-clause */
26124 static tree
26126 {
26132 }
26134 /* Support Functions */
26136 /* Return the appropriate prefer_type argument for lookup_name_real based on
26137 tag_type and template_mem_access. */
26141 {
26142 /* DR 141: When looking in the current enclosing context for a template-name
26143 after -> or ., only consider class templates. */
26147 {
26151 }
26152 }
26154 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26155 NAME should have one of the representations used for an
26156 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26157 is returned. If PARSER->SCOPE is a dependent type, then a
26158 SCOPE_REF is returned.
26160 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26161 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26162 was formed. Abstractly, such entities should not be passed to this
26163 function, because they do not need to be looked up, but it is
26164 simpler to check for this special case here, rather than at the
26165 call-sites.
26167 In cases not explicitly covered above, this function returns a
26168 DECL, OVERLOAD, or baselink representing the result of the lookup.
26169 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26170 is returned.
26172 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26173 (e.g., "struct") that was used. In that case bindings that do not
26174 refer to types are ignored.
26176 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26177 ignored.
26179 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26180 are ignored.
26182 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26183 types.
26185 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26186 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26187 NULL_TREE otherwise. */
26189 static cp_expr
26196 location_t name_location)
26197 {
26198 tree decl;
26201 /* Assume that the lookup will be unambiguous. */
26205 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26206 no longer valid. Note that if we are parsing tentatively, and
26207 the parse fails, OBJECT_TYPE will be automatically restored. */
26213 /* A template-id has already been resolved; there is no lookup to
26214 do. */
26218 {
26222 }
26224 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26225 it should already have been checked to make sure that the name
26226 used matches the type being destroyed. */
26228 {
26229 tree type;
26231 /* Figure out to which type this destructor applies. */
26236 else
26238 /* If that's not a class type, there is no destructor. */
26249 }
26251 /* By this point, the NAME should be an ordinary identifier. If
26252 the id-expression was a qualified name, the qualifying scope is
26253 stored in PARSER->SCOPE at this point. */
26256 /* Perform the lookup. */
26258 {
26264 /* If the SCOPE is dependent, the lookup must be deferred until
26265 the template is instantiated -- unless we are explicitly
26266 looking up names in uninstantiated templates. Even then, we
26267 cannot look up the name if the scope is not a class type; it
26268 might, for example, be a template type parameter. */
26273 /* Defer lookup. */
26275 else
26276 {
26279 /* If PARSER->SCOPE is a dependent type, then it must be a
26280 class type, and we must not be checking dependencies;
26281 otherwise, we would have processed this lookup above. So
26282 that PARSER->SCOPE is not considered a dependent base by
26283 lookup_member, we must enter the scope here. */
26287 /* If the PARSER->SCOPE is a template specialization, it
26288 may be instantiated during name lookup. In that case,
26289 errors may be issued. Even if we rollback the current
26290 tentative parse, those errors are valid. */
26295 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26296 lookup result and the nested-name-specifier nominates a class C:
26297 * if the name specified after the nested-name-specifier, when
26298 looked up in C, is the injected-class-name of C (Clause 9), or
26299 * if the name specified after the nested-name-specifier is the
26300 same as the identifier or the simple-template-id's template-
26301 name in the last component of the nested-name-specifier,
26302 the name is instead considered to name the constructor of
26303 class C. [ Note: for example, the constructor is not an
26304 acceptable lookup result in an elaborated-type-specifier so
26305 the constructor would not be used in place of the
26306 injected-class-name. --end note ] Such a constructor name
26307 shall be used only in the declarator-id of a declaration that
26308 names a constructor or in a using-declaration. */
26316 /* If we have a single function from a using decl, pull it out. */
26323 }
26325 /* If the scope is a dependent type and either we deferred lookup or
26326 we did lookup but didn't find the name, rememeber the name. */
26329 {
26331 {
26332 tree type;
26334 /* The resolution to Core Issue 180 says that `struct
26335 A::B' should be considered a type-name, even if `A'
26336 is dependent. */
26341 }
26345 CPP_CLOSE_PAREN)))
26349 else
26352 is_template);
26353 }
26356 }
26358 {
26359 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26360 OBJECT_TYPE is not a class. */
26362 /* If the OBJECT_TYPE is a template specialization, it may
26363 be instantiated during name lookup. In that case, errors
26364 may be issued. Even if we rollback the current tentative
26365 parse, those errors are valid. */
26367 name,
26370 tf_warning_or_error);
26371 else
26375 /* Look it up in the enclosing context. DR 141: When looking for a
26376 template-name after -> or ., only consider class templates. */
26381 /* The object is type-dependent, so we can't look anything up; we used
26382 this to get the DR 141 behavior. */
26386 }
26387 else
26388 {
26394 }
26396 /* If the lookup failed, let our caller know. */
26400 /* Pull out the template from an injected-class-name (or multiple). */
26404 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26406 {
26409 /* The error message we have to print is too complicated for
26410 cp_parser_error, so we incorporate its actions directly. */
26412 {
26414 name);
26416 }
26418 }
26426 /* If we have resolved the name of a member declaration, check to
26427 see if the declaration is accessible. When the name resolves to
26428 set of overloaded functions, accessibility is checked when
26429 overload resolution is done.
26431 During an explicit instantiation, access is not checked at all,
26432 as per [temp.explicit]. */
26439 }
26441 /* Like cp_parser_lookup_name, but for use in the typical case where
26442 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26443 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26445 static tree
26447 {
26449 none_type,
26454 location);
26455 }
26457 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26458 the current context, return the TYPE_DECL. If TAG_NAME_P is
26459 true, the DECL indicates the class being defined in a class-head,
26460 or declared in an elaborated-type-specifier.
26462 Otherwise, return DECL. */
26464 static tree
26466 {
26467 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26468 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26470 struct A {
26471 template <typename T> struct B;
26472 };
26474 template <typename T> struct A::B {};
26476 Similarly, in an elaborated-type-specifier:
26478 namespace N { struct X{}; }
26480 struct A {
26481 template <typename T> friend struct N::X;
26482 };
26484 However, if the DECL refers to a class type, and we are in
26485 the scope of the class, then the name lookup automatically
26486 finds the TYPE_DECL created by build_self_reference rather
26487 than a TEMPLATE_DECL. For example, in:
26489 template <class T> struct S {
26490 S s;
26491 };
26493 there is no need to handle such case. */
26499 }
26501 /* If too many, or too few, template-parameter lists apply to the
26502 declarator, issue an error message. Returns TRUE if all went well,
26503 and FALSE otherwise. */
26505 static bool
26508 location_t declarator_location)
26509 {
26511 {
26513 {
26522 {
26523 /* If the DECLARATOR has the form `X<y>' then it uses one
26524 additional level of template parameters. */
26527 }
26529 return cp_parser_check_template_parameters
26531 declarator);
26532 }
26548 }
26550 }
26552 /* NUM_TEMPLATES were used in the current declaration. If that is
26553 invalid, return FALSE and issue an error messages. Otherwise,
26554 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26555 declarator and we can print more accurate diagnostics. */
26557 static bool
26561 location_t location,
26563 {
26564 /* If there are the same number of template classes and parameter
26565 lists, that's OK. */
26568 /* If there are more, but only one more, and the name ends in an identifier,
26569 then we are declaring a primary template. That's OK too. */
26573 /* If there are more template classes than parameter lists, we have
26574 something like:
26576 template <class T> void S<T>::R<T>::f (); */
26578 {
26588 else
26591 }
26592 /* Otherwise, there are too many template parameter lists. We have
26593 something like:
26595 template <class T> template <class U> void S::f(); */
26598 }
26600 /* Parse an optional `::' token indicating that the following name is
26601 from the global namespace. If so, PARSER->SCOPE is set to the
26602 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26603 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26604 Returns the new value of PARSER->SCOPE, if the `::' token is
26605 present, and NULL_TREE otherwise. */
26607 static tree
26609 {
26612 /* Peek at the next token. */
26614 /* If we're looking at a `::' token then we're starting from the
26615 global namespace, not our current location. */
26617 {
26618 /* Consume the `::' token. */
26620 /* Set the SCOPE so that we know where to start the lookup. */
26626 }
26628 {
26632 }
26635 }
26637 /* Returns TRUE if the upcoming token sequence is the start of a
26638 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26639 declarator is preceded by the `friend' specifier. */
26641 static bool
26643 {
26646 tree nested_name_specifier;
26649 /* The common case is that this is not a constructor declarator, so
26650 try to avoid doing lots of work if at all possible. It's not
26651 valid declare a constructor at function scope. */
26654 /* And only certain tokens can begin a constructor declarator. */
26662 /* Parse tentatively; we are going to roll back all of the tokens
26663 consumed here. */
26665 /* Assume that we are looking at a constructor declarator. */
26668 /* Look for the optional `::' operator. */
26671 /* Look for the nested-name-specifier. */
26672 nested_name_specifier
26683 /* Outside of a class-specifier, there must be a
26684 nested-name-specifier. Except in C++17 mode, where we
26685 might be declaring a guiding declaration. */
26692 /* If we have a class scope, this is easy; DR 147 says that S::S always
26693 names the constructor, and no other qualified name could. */
26696 {
26706 }
26707 /* If we still think that this might be a constructor-declarator,
26708 look for a class-name. */
26710 {
26711 /* If we have:
26713 template <typename T> struct S {
26714 S();
26715 };
26717 we must recognize that the nested `S' names a class. */
26721 tree type_decl;
26725 none_type,
26732 {
26738 none_type,
26743 else
26745 }
26747 /* If there was no class-name, then this is not a constructor.
26748 Otherwise, if we are in a class-specifier and we aren't
26749 handling a friend declaration, check that its type matches
26750 current_class_type (c++/38313). Note: error_mark_node
26751 is left alone for error recovery purposes. */
26753 && (outside_class_specifier_p
26759 /* If we're still considering a constructor, we have to see a `(',
26760 to begin the parameter-declaration-clause, followed by either a
26761 `)', an `...', or a decl-specifier. We need to check for a
26762 type-specifier to avoid being fooled into thinking that:
26764 S (f) (int);
26766 is a constructor. (It is actually a function named `f' that
26767 takes one parameter (of type `int') and returns a value of type
26768 `S'. */
26776 /* A parameter declaration begins with a decl-specifier,
26777 which is either the "attribute" keyword, a storage class
26778 specifier, or (usually) a type-specifier. */
26780 {
26781 tree type;
26785 /* Names appearing in the type-specifier should be looked up
26786 in the scope of the class. */
26790 {
26793 {
26797 {
26800 }
26801 }
26803 }
26805 /* Inside the constructor parameter list, surrounding
26806 template-parameter-lists do not apply. */
26807 saved_num_template_parameter_lists
26811 /* Look for the type-specifier. */
26813 CP_PARSER_FLAGS_NONE,
26819 parser->num_template_parameter_lists
26822 /* Leave the scope of the class. */
26827 }
26828 }
26830 /* We did not really want to consume any tokens. */
26834 }
26836 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26837 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26838 they must be performed once we are in the scope of the function.
26840 Returns the function defined. */
26842 static tree
26843 cp_parser_function_definition_from_specifiers_and_declarator
26846 tree attributes,
26848 {
26849 tree fn;
26852 /* Begin the function-definition. */
26855 /* The things we're about to see are not directly qualified by any
26856 template headers we've seen thus far. */
26859 /* If there were names looked up in the decl-specifier-seq that we
26860 did not check, check them now. We must wait until we are in the
26861 scope of the function to perform the checks, since the function
26862 might be a friend. */
26866 {
26871 }
26874 {
26875 /* Skip the entire function. */
26878 }
26880 {
26881 /* Seen already, skip it. An error message has already been output. */
26885 /* If this is a function from a class, pop the nested class. */
26888 }
26889 else
26890 {
26891 timevar_id_t tv;
26894 else
26900 }
26903 }
26905 /* Parse the part of a function-definition that follows the
26906 declarator. INLINE_P is TRUE iff this function is an inline
26907 function defined within a class-specifier.
26909 Returns the function defined. */
26911 static tree
26914 {
26915 tree fn;
26920 bool fully_implicit_function_template_p
26923 tree implicit_template_parms
26926 cp_binding_level* implicit_template_scope
26932 /* If the next token is `return', then the code may be trying to
26933 make use of the "named return value" extension that G++ used to
26934 support. */
26937 {
26938 /* Consume the `return' keyword. */
26940 /* Look for the identifier that indicates what value is to be
26941 returned. */
26943 /* Issue an error message. */
26946 /* Skip tokens until we reach the start of the function body. */
26948 {
26955 }
26956 }
26957 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26958 anything declared inside `f'. */
26959 saved_in_unbraced_linkage_specification_p
26962 /* Inside the function, surrounding template-parameter-lists do not
26963 apply. */
26964 saved_num_template_parameter_lists
26968 /* If the next token is `try', `__transaction_atomic', or
26969 `__transaction_relaxed`, then we are looking at either function-try-block
26970 or function-transaction-block. Note that all of these include the
26971 function-body. */
26975 RID_TRANSACTION_RELAXED))
26979 else
26980 cp_parser_ctor_initializer_opt_and_function_body
26983 /* Finish the function. */
26985 /* Generate code for it, if necessary. */
26987 /* Restore the saved values. */
26988 parser->in_unbraced_linkage_specification_p
26990 parser->num_template_parameter_lists
26994 parser->fully_implicit_function_template_p
26996 parser->implicit_template_parms
26998 parser->implicit_template_scope
27005 }
27007 /* Parse a template-declaration body (following argument list). */
27009 static void
27011 tree parameter_list,
27013 {
27017 /* We just processed one more parameter list. */
27020 /* Get the deferred access checks from the parameter list. These
27021 will be checked once we know what is being declared, as for a
27022 member template the checks must be performed in the scope of the
27023 class containing the member. */
27026 /* Tentatively parse for a new template parameter list, which can either be
27027 the template keyword or a template introduction. */
27033 else
27034 {
27035 /* There are no access checks when parsing a template, as we do not
27036 know if a specialization will be a friend. */
27040 checks,
27041 member_p,
27046 /* If this is a member template declaration, let the front
27047 end know. */
27049 {
27054 }
27059 }
27060 /* We are done with the current parameter list. */
27065 /* Finish up. */
27068 /* Check the template arguments for a literal operator template. */
27072 {
27076 else
27077 {
27080 {
27086 }
27088 {
27097 }
27098 else
27100 }
27102 {
27105 " Expected non-type template argument pack <char...>"
27107 decl);
27108 else
27111 decl);
27112 }
27113 }
27115 /* Register member declarations. */
27118 /* If DECL is a function template, we must return to parse it later.
27119 (Even though there is no definition, there might be default
27120 arguments that need handling.) */
27124 }
27126 /* Parse a template introduction header for a template-declaration. Returns
27127 false if tentative parse fails. */
27129 static bool
27131 {
27138 /* Look for the optional `::' operator. */
27141 /* Look for the nested-name-specifier. */
27151 /* Look up the concept for which we will be matching
27152 template parameters. */
27162 /* Look for opening brace for introduction. */
27163 matching_braces braces;
27171 /* Build vector of placeholder parameters and grab
27172 matching identifiers. */
27175 /* Look for closing brace for introduction. */
27179 /* The introduction-list shall not be empty. */
27182 {
27183 /* In cp_parser_introduction_list we have already issued an error. */
27185 }
27188 {
27192 }
27194 /* Build and associate the constraint. */
27197 {
27199 member_p);
27201 }
27205 }
27207 /* Parse a normal template-declaration following the template keyword. */
27209 static void
27211 {
27212 tree parameter_list;
27216 /* Look for the `<' token. */
27220 {
27221 /* 14.5.2.2 [temp.mem]
27223 A local class shall not have member templates. */
27228 }
27229 /* [temp]
27231 A template ... shall not have C linkage. */
27233 {
27236 /* Give it C++ linkage to avoid confusing other parts of the
27237 front end. */
27240 }
27241 else
27244 /* We cannot perform access checks on the template parameter
27245 declarations until we know what is being declared, just as we
27246 cannot check the decl-specifier list. */
27249 /* If the next token is `>', then we have an invalid
27250 specialization. Rather than complain about an invalid template
27251 parameter, issue an error message here. */
27253 {
27257 }
27258 else
27259 {
27260 /* Parse the template parameters. */
27262 }
27264 /* Look for the `>'. */
27267 /* Manage template requirements */
27269 {
27274 }
27277 member_p);
27279 /* For the erroneous case of a template with C linkage, we pushed an
27280 implicit C++ linkage scope; exit that scope now. */
27283 }
27285 /* Parse a template-declaration, assuming that the `export' (and
27286 `extern') keywords, if present, has already been scanned. MEMBER_P
27287 is as for cp_parser_template_declaration. */
27289 static bool
27291 {
27293 {
27297 }
27302 }
27304 /* Perform the deferred access checks from a template-parameter-list.
27305 CHECKS is a TREE_LIST of access checks, as returned by
27306 get_deferred_access_checks. */
27308 static void
27309 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27310 {
27314 }
27316 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27317 `function-definition' sequence that follows a template header.
27318 If MEMBER_P is true, this declaration appears in a class scope.
27320 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27321 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27323 static tree
27329 {
27332 cp_decl_specifier_seq decl_specifiers;
27336 /* This function is only used when processing a template
27337 declaration. */
27341 /* Defer access checks until we know what is being declared. */
27344 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27345 alternative. */
27348 CP_PARSER_FLAGS_OPTIONAL,
27354 /* There are no template typedefs. */
27356 {
27360 }
27362 /* Gather up the access checks that occurred the
27363 decl-specifier-seq. */
27366 /* Check for the declaration of a template class. */
27368 {
27371 {
27372 // If this is a declaration, but not a definition, associate
27373 // any constraints with the type declaration. Constraints
27374 // are associated with definitions in cp_parser_class_specifier.
27380 /* In this case:
27382 struct C {
27383 friend template <typename T> struct A<T>::B;
27384 };
27386 A<T>::B will be represented by a TYPENAME_TYPE, and
27387 therefore not recognized by shadow_tag. */
27389 && !decl
27396 else
27399 /* Perform access checks for template parameters. */
27402 /* Give a helpful diagnostic for
27403 template <class T> struct A { } a;
27404 if we aren't already recovering from an error. */
27407 {
27409 "a class template declaration must not declare "
27413 }
27414 }
27415 }
27417 /* Complain about missing 'typename' or other invalid type names. */
27420 {
27421 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27422 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27423 the rest of this declaration. */
27426 }
27428 /* If it's not a template class, try for a template function. If
27429 the next token is a `;', then this declaration does not declare
27430 anything. But, if there were errors in the decl-specifiers, then
27431 the error might well have come from an attempted class-specifier.
27432 In that case, there's no need to warn about a missing declarator. */
27436 {
27439 checks,
27441 member_p,
27442 declares_class_or_enum,
27446 /* 7.1.1-1 [dcl.stc]
27448 A storage-class-specifier shall not be specified in an explicit
27449 specialization... */
27451 && explicit_specialization_p
27453 {
27457 }
27461 }
27463 /* Look for a trailing `;' after the declaration. */
27469 out:
27472 /* Clear any current qualification; whatever comes next is the start
27473 of something new. */
27479 }
27481 /* Parse a cast-expression that is not the operand of a unary "&". */
27483 static cp_expr
27485 {
27488 }
27490 /* Parse a functional cast to TYPE. Returns an expression
27491 representing the cast. */
27493 static cp_expr
27495 {
27497 tree expression_list;
27498 cp_expr cast;
27507 {
27517 /* Create a location of the form:
27518 type_name{i, f}
27519 ^~~~~~~~~~~~~~~
27520 with caret == start at the start of the type name,
27521 finishing at the closing brace. */
27522 location_t finish_loc
27525 finish_loc);
27528 }
27537 else
27538 {
27541 }
27544 tf_warning_or_error);
27545 /* [expr.const]/1: In an integral constant expression "only type
27546 conversions to integral or enumeration type can be used". */
27552 NIC_CONSTRUCTOR))
27555 /* Create a location of the form:
27556 float(i)
27557 ^~~~~~~~
27558 with caret == start at the start of the type name,
27559 finishing at the closing paren. */
27560 location_t finish_loc
27565 }
27567 /* Save the tokens that make up the body of a member function defined
27568 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27569 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27570 specifiers applied to the declaration. Returns the FUNCTION_DECL
27571 for the member function. */
27573 static tree
27577 tree attributes)
27578 {
27581 tree fn;
27584 /* Create the FUNCTION_DECL. */
27588 /* If something went badly wrong, bail out now. */
27590 {
27591 /* If there's a function-body, skip it. */
27596 }
27598 /* Remember it, if there default args to post process. */
27601 /* Save away the tokens that make up the body of the
27602 function. */
27608 RID_TRANSACTION_ATOMIC))
27609 {
27611 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27618 {
27624 }
27625 else
27628 {
27632 }
27633 }
27635 /* Handle function try blocks. */
27637 {
27640 }
27641 /* We can have braced-init-list mem-initializers before the fn body. */
27643 {
27646 {
27647 /* cache_group will stop after an un-nested { } pair, too. */
27651 /* variadic mem-inits have ... after the ')'. */
27654 }
27655 }
27657 /* Handle function try blocks. */
27663 /* Save away the inline definition; we will process it when the
27664 class is complete. */
27668 /* We need to know that this was defined in the class, so that
27669 friend templates are handled correctly. */
27672 /* Add FN to the queue of functions to be parsed later. */
27676 }
27678 /* Save the tokens that make up the in-class initializer for a non-static
27679 data member. Returns a DEFAULT_ARG. */
27681 static tree
27683 {
27685 }
27687 /* Parse a template-argument-list, as well as the trailing ">" (but
27688 not the opening "<"). See cp_parser_template_argument_list for the
27689 return value. */
27691 static tree
27693 {
27694 tree arguments;
27695 tree saved_scope;
27696 tree saved_qualifying_scope;
27697 tree saved_object_scope;
27702 /* [temp.names]
27704 When parsing a template-id, the first non-nested `>' is taken as
27705 the end of the template-argument-list rather than a greater-than
27706 operator. */
27707 saved_greater_than_is_operator_p
27710 /* Parsing the argument list may modify SCOPE, so we save it
27711 here. */
27715 /* We need to evaluate the template arguments, even though this
27716 template-id may be nested within a "sizeof". */
27721 /* Parse the template-argument-list itself. */
27725 else
27727 /* Look for the `>' that ends the template-argument-list. If we find
27728 a '>>' instead, it's probably just a typo. */
27730 {
27732 {
27733 /* In C++0x, a `>>' in a template argument list or cast
27734 expression is considered to be two separate `>'
27735 tokens. So, change the current token to a `>', but don't
27736 consume it: it will be consumed later when the outer
27737 template argument list (or cast expression) is parsed.
27738 Note that this replacement of `>' for `>>' is necessary
27739 even if we are parsing tentatively: in the tentative
27740 case, after calling
27741 cp_parser_enclosed_template_argument_list we will always
27742 throw away all of the template arguments and the first
27743 closing `>', either because the template argument list
27744 was erroneous or because we are replacing those tokens
27745 with a CPP_TEMPLATE_ID token. The second `>' (which will
27746 not have been thrown away) is needed either to close an
27747 outer template argument list or to complete a new-style
27748 cast. */
27751 }
27753 {
27754 /* If we're in a nested template argument list, the '>>' has
27755 to be a typo for '> >'. We emit the error message, but we
27756 continue parsing and we push a '>' as next token, so that
27757 the argument list will be parsed correctly. Note that the
27758 global source location is still on the token before the
27759 '>>', so we need to say explicitly where we want it. */
27767 }
27768 else
27769 {
27770 /* If this is not a nested template argument list, the '>>'
27771 is a typo for '>'. Emit an error message and continue.
27772 Same deal about the token location, but here we can get it
27773 right by consuming the '>>' before issuing the diagnostic. */
27776 "spurious %<>>%>, use %<>%> to terminate "
27778 }
27779 }
27780 else
27782 /* The `>' token might be a greater-than operator again now. */
27783 parser->greater_than_is_operator_p
27785 /* Restore the SAVED_SCOPE. */
27793 }
27795 /* MEMBER_FUNCTION is a member function, or a friend. If default
27796 arguments, or the body of the function have not yet been parsed,
27797 parse them now. */
27799 static void
27801 {
27803 /* If this member is a template, get the underlying
27804 FUNCTION_DECL. */
27808 /* There should not be any class definitions in progress at this
27809 point; the bodies of members are only parsed outside of all class
27810 definitions. */
27812 /* While we're parsing the member functions we might encounter more
27813 classes. We want to handle them right away, but we don't want
27814 them getting mixed up with functions that are currently in the
27815 queue. */
27818 /* Make sure that any template parameters are in scope. */
27821 /* If the body of the function has not yet been parsed, parse it
27822 now. */
27824 {
27825 tree function_scope;
27828 /* The function is no longer pending; we are processing it. */
27833 /* If this is a local class, enter the scope of the containing
27834 function. */
27839 /* Push the body of the function onto the lexer stack. */
27842 /* Let the front end know that we going to be defining this
27843 function. */
27847 /* Don't do access checking if it is a templated function. */
27851 /* #pragma omp declare reduction needs special parsing. */
27853 {
27858 }
27859 else
27860 /* Now, parse the body of the function. */
27867 /* Leave the scope of the containing function. */
27871 }
27873 /* Remove any template parameters from the symbol table. */
27876 /* Restore the queue. */
27879 }
27881 /* If DECL contains any default args, remember it on the unparsed
27882 functions queue. */
27884 static void
27886 {
27887 tree probe;
27890 probe;
27893 {
27897 }
27898 }
27900 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27901 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27902 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27903 from the parameter-type-list. */
27905 static tree
27908 {
27910 tree parsed_arg;
27916 /* Push the saved tokens for the default argument onto the parser's
27917 lexer stack. */
27923 /* Parse the default argument. */
27934 {
27935 /* In a non-template class, check conversions now. In a template,
27936 we'll wait and instantiate these as needed. */
27939 tf_warning_or_error);
27942 else
27944 }
27946 /* If the token stream has not been completely used up, then
27947 there was extra junk after the end of the default
27948 argument. */
27950 {
27953 else
27955 }
27957 /* Revert to the main lexer. */
27961 }
27963 /* FIELD is a non-static data member with an initializer which we saved for
27964 later; parse it now. */
27966 static void
27968 {
27969 tree def;
27976 NULL_TREE);
27982 }
27984 /* FN is a FUNCTION_DECL which may contains a parameter with an
27985 unparsed DEFAULT_ARG. Parse the default args now. This function
27986 assumes that the current scope is the scope in which the default
27987 argument should be processed. */
27989 static void
27991 {
27995 /* While we're parsing the default args, we might (due to the
27996 statement expression extension) encounter more classes. We want
27997 to handle them right away, but we don't want them getting mixed
27998 up with default args that are currently in the queue. */
28001 /* Local variable names (and the `this' keyword) may not appear
28002 in a default argument. */
28013 {
28015 tree parsed_arg;
28017 tree copy;
28024 /* This can happen for a friend declaration for a function
28025 already declared with default arguments. */
28028 parsed_arg
28030 default_arg,
28034 /* Update any instantiations we've already created. */
28038 }
28042 /* Make sure no default arg is missing. */
28045 /* Restore the state of local_variables_forbidden_p. */
28048 /* Restore the queue. */
28050 }
28052 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
28054 sizeof ... ( identifier )
28056 where the 'sizeof' token has already been consumed. */
28058 static tree
28060 {
28061 /* Consume the `...'. */
28065 matching_parens parens;
28069 else
28077 /* The name is not qualified. */
28096 }
28098 /* Parse the operand of `sizeof' (or a similar operator). Returns
28099 either a TYPE or an expression, depending on the form of the
28100 input. The KEYWORD indicates which kind of expression we have
28101 encountered. */
28103 static tree
28105 {
28112 /* If it's a `...', then we are computing the length of a parameter
28113 pack. */
28118 /* Types cannot be defined in a `sizeof' expression. Save away the
28119 old message. */
28121 /* And create the new one. */
28127 /* The restrictions on constant-expressions do not apply inside
28128 sizeof expressions. */
28129 saved_integral_constant_expression_p
28131 saved_non_integral_constant_expression_p
28135 /* Do not actually evaluate the expression. */
28138 /* If it's a `(', then we might be looking at the type-id
28139 construction. */
28141 {
28144 /* We can't be sure yet whether we're looking at a type-id or an
28145 expression. */
28148 matching_parens parens;
28151 /* Note: as a GNU Extension, compound literals are considered
28152 postfix-expressions as they are in C99, so they are valid
28153 arguments to sizeof. See comment in cp_parser_cast_expression
28154 for details. */
28157 else
28158 {
28161 /* Look for the type-id. */
28163 /* Look for the closing `)'. */
28166 }
28168 /* If all went well, then we're done. */
28170 {
28171 cp_decl_specifier_seq decl_specs;
28173 /* Build a trivial decl-specifier-seq. */
28177 /* Call grokdeclarator to figure out what type this is. */
28180 TYPENAME,
28183 }
28184 }
28186 /* If the type-id production did not work out, then we must be
28187 looking at the unary-expression production. */
28191 /* Go back to evaluating expressions. */
28195 /* Free the message we created. */
28197 /* And restore the old one. */
28199 parser->integral_constant_expression_p
28201 parser->non_integral_constant_expression_p
28205 }
28207 /* If the current declaration has no declarator, return true. */
28209 static bool
28211 {
28212 /* If the next token is a `;' or a `,' then there is no
28213 declarator. */
28216 }
28218 /* Update the DECL_SPECS to reflect the storage class indicated by
28219 KEYWORD. */
28221 static void
28226 {
28227 cp_storage_class storage_class;
28230 {
28234 }
28236 {
28239 }
28244 {
28247 }
28250 {
28268 }
28272 /* A storage class specifier cannot be applied alongside a typedef
28273 specifier. If there is a typedef specifier present then set
28274 conflicting_specifiers_p which will trigger an error later
28275 on in grokdeclarator. */
28278 }
28280 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28281 is true, the type is a class or enum definition. */
28283 static void
28285 tree type_spec,
28288 {
28291 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28292 (with, for example, in "typedef int wchar_t;") we remember that
28293 this is what happened. In system headers, we ignore these
28294 declarations so that G++ can work with system headers that are not
28295 C++-safe. */
28297 && !type_definition_p
28307 {
28310 ds_redefined_builtin_type_spec,
28311 token);
28313 {
28317 }
28318 }
28321 else
28322 {
28327 }
28328 }
28330 /* True iff TOKEN is the GNU keyword __thread. */
28332 static bool
28334 {
28337 }
28339 /* Set the location for a declarator specifier and check if it is
28340 duplicated.
28342 DECL_SPECS is the sequence of declarator specifiers onto which to
28343 set the location.
28345 DS is the single declarator specifier to set which location is to
28346 be set onto the existing sequence of declarators.
28348 LOCATION is the location for the declarator specifier to
28349 consider. */
28351 static void
28354 {
28363 {
28367 }
28368 else
28369 {
28371 {
28375 else
28376 {
28379 OPT_Wlong_long,
28381 }
28382 }
28384 {
28388 {
28392 }
28393 else
28394 {
28397 }
28398 }
28399 else
28400 {
28416 "__complex"
28417 };
28421 }
28422 }
28423 }
28425 /* Return true iff the declarator specifier DS is present in the
28426 sequence of declarator specifiers DECL_SPECS. */
28428 bool
28430 cp_decl_spec ds)
28431 {
28438 }
28440 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28441 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28443 static bool
28445 {
28447 }
28449 /* Issue an error message indicating that TOKEN_DESC was expected.
28450 If KEYWORD is true, it indicated this function is called by
28451 cp_parser_require_keword and the required token can only be
28452 a indicated keyword.
28454 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28455 within any error as the location of an "opening" token matching
28456 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28457 RT_CLOSE_PAREN). */
28459 static void
28461 required_token token_desc,
28463 location_t matching_location)
28464 {
28470 {
28539 }
28542 {
28544 {
28622 }
28623 }
28627 }
28630 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28631 issue an error message indicating that TOKEN_DESC was expected.
28633 Returns the token consumed, if the token had the appropriate type.
28634 Otherwise, returns NULL.
28636 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28637 within any error as the location of an "opening" token matching
28638 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28639 RT_CLOSE_PAREN). */
28644 required_token token_desc,
28645 location_t matching_location)
28646 {
28649 else
28650 {
28651 /* Output the MESSAGE -- unless we're parsing tentatively. */
28654 matching_location);
28656 }
28657 }
28659 /* An error message is produced if the next token is not '>'.
28660 All further tokens are skipped until the desired token is
28661 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28663 static void
28665 {
28666 /* Current level of '< ... >'. */
28668 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28671 /* Are we ready, yet? If not, issue error message. */
28675 /* Skip tokens until the desired token is found. */
28677 {
28678 /* Peek at the next token. */
28680 {
28688 /* C++0x views the `>>' operator as two `>' tokens, but
28689 C++98 does not. */
28692 {
28693 /* We've hit a `>>' where the first `>' closes the
28694 template argument list, and the second `>' is
28695 spurious. Just consume the `>>' and stop; we've
28696 already produced at least one error. */
28699 }
28700 /* Fall through for C++0x, so we handle the second `>' in
28701 the `>>'. */
28706 {
28707 /* We've reached the token we want, consume it and stop. */
28710 }
28729 /* The '>' was probably forgotten, don't look further. */
28734 }
28736 /* Consume this token. */
28738 }
28739 }
28741 /* If the next token is the indicated keyword, consume it. Otherwise,
28742 issue an error message indicating that TOKEN_DESC was expected.
28744 Returns the token consumed, if the token had the appropriate type.
28745 Otherwise, returns NULL. */
28750 required_token token_desc)
28751 {
28755 {
28757 UNKNOWN_LOCATION);
28759 }
28762 }
28764 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28765 function-definition. */
28767 static bool
28769 {
28772 /* A ctor-initializer begins with a `:'. */
28774 /* A function-try-block begins with `try'. */
28776 /* A function-transaction-block begins with `__transaction_atomic'
28777 or `__transaction_relaxed'. */
28780 /* The named return value extension begins with `return'. */
28782 }
28784 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28785 definition. */
28787 static bool
28789 {
28796 }
28798 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28799 C++0x) ending a template-argument. */
28801 static bool
28803 {
28811 }
28813 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28814 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28816 static bool
28819 {
28825 /* Check for the sequence `<::' in the original code. It would be lexed as
28826 `[:', where `[' is a digraph, and there is no whitespace before
28827 `:'. */
28829 {
28834 }
28836 }
28838 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28839 or none_type otherwise. */
28841 static enum tag_types
28843 {
28845 {
28855 }
28856 }
28858 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28859 or none_type otherwise or if the token is null. */
28861 static enum tag_types
28863 {
28868 {
28876 }
28877 }
28879 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28881 static void
28883 {
28887 {
28891 type))
28894 }
28895 }
28897 /* Issue an error message if DECL is redeclared with different
28898 access than its original declaration [class.access.spec/3].
28899 This applies to nested classes, nested class templates and
28900 enumerations [class.mem/1]. */
28902 static void
28904 {
28915 }
28917 /* Look for the `template' keyword, as a syntactic disambiguator.
28918 Return TRUE iff it is present, in which case it will be
28919 consumed. */
28921 static bool
28923 {
28925 {
28926 /* In C++98 the `template' keyword can only be used within templates;
28927 outside templates the parser can always figure out what is a
28928 template and what is not. In C++11, per the resolution of DR 468,
28929 `template' is allowed in cases where it is not strictly necessary. */
28932 {
28935 "in C++98 %<template%> (as a disambiguator) is only "
28937 /* If this part of the token stream is rescanned, the same
28938 error message would be generated. So, we purge the token
28939 from the stream. */
28942 }
28943 else
28944 {
28945 /* Consume the `template' keyword. */
28948 }
28949 }
28951 }
28953 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28954 set PARSER->SCOPE, and perform other related actions. */
28956 static void
28958 {
28961 /* Get the stored value. */
28963 /* Set the scope from the stored value. */
28967 }
28969 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28970 encounter the end of a block before what we were looking for. */
28972 static bool
28976 {
28978 {
28981 /* Abort a parenthesized expression if we encounter a semicolon. */
28985 /* If we've reached the end of the file, stop. */
28991 /* We've hit the end of an enclosing block, so there's been some
28992 kind of syntax error. */
28995 /* Consume the token. */
28997 /* See if it starts a new group. */
28999 {
29001 /* In theory this should probably check end == '}', but
29002 cp_parser_save_member_function_body needs it to exit
29003 after either '}' or ')' when called with ')'. */
29006 }
29008 {
29012 }
29017 }
29018 }
29020 /* Like above, for caching a default argument or NSDMI. Both of these are
29021 terminated by a non-nested comma, but it can be unclear whether or not a
29022 comma is nested in a template argument list unless we do more parsing.
29023 In order to handle this ambiguity, when we encounter a ',' after a '<'
29024 we try to parse what follows as a parameter-declaration-list (in the
29025 case of a default argument) or a member-declarator (in the case of an
29026 NSDMI). If that succeeds, then we stop caching. */
29028 static tree
29030 {
29035 tree default_argument;
29037 /* Add tokens until we have processed the entire default
29038 argument. We add the range [first_token, token). */
29041 {
29042 /* For list-initialization, this is straightforward. */
29045 }
29047 {
29050 /* Peek at the next token. */
29052 /* What we do depends on what token we have. */
29054 {
29055 /* In valid code, a default argument must be
29056 immediately followed by a `,' `)', or `...'. */
29059 {
29060 /* If we've seen a '<', we might be in a
29061 template-argument-list. Until Core issue 325 is
29062 resolved, we don't know how this situation ought
29063 to be handled, so try to DTRT. We check whether
29064 what comes after the comma is a valid parameter
29065 declaration list. If it is, then the comma ends
29066 the default argument; otherwise the default
29067 argument continues. */
29071 /* Set ITALP so cp_parser_parameter_declaration_list
29072 doesn't decide to commit to this parse. */
29079 {
29080 /* Parse declarators until we reach a non-comma or
29081 somthing that cannot be an initializer.
29082 Just checking whether we're looking at a single
29083 declarator is insufficient. Consider:
29084 int var = tuple<T,U>::x;
29085 The template parameter 'U' looks exactly like a
29086 declarator. */
29087 do
29088 {
29099 }
29101 /* If we met an '=' or ';' then the original comma
29102 was the end of the NSDMI. Otherwise assume
29103 we're still in the NSDMI. */
29106 }
29107 else
29108 {
29115 }
29122 }
29123 /* FALLTHRU */
29126 /* If we run into a non-nested `;', `}', or `]',
29127 then the code is invalid -- but the default
29128 argument is certainly over. */
29133 /* Handle correctly int n = sizeof ... ( p ); */
29136 /* Update DEPTH, if necessary. */
29151 /* This might be the comparison operator, or it might
29152 start a template argument list. */
29159 /* Fall through for C++0x, which treats the `>>'
29160 operator like two `>' tokens in certain
29161 cases. */
29166 {
29167 /* This might be an operator, or it might close a
29168 template argument list. But if a previous '<'
29169 started a template argument list, this will have
29170 closed it, so we can't be in one anymore. */
29174 }
29177 /* If we run out of tokens, issue an error message. */
29185 /* In these cases, we should look for template-ids.
29186 For example, if the default argument is
29187 `X<int, double>()', we need to do name lookup to
29188 figure out whether or not `X' is a template; if
29189 so, the `,' does not end the default argument.
29191 That is not yet done. */
29196 }
29198 /* If we've reached the end, stop. */
29202 /* Add the token to the token block. */
29204 }
29206 /* Create a DEFAULT_ARG to represent the unparsed default
29207 argument. */
29214 }
29216 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29218 location_t
29220 {
29225 }
29227 /* Begin parsing tentatively. We always save tokens while parsing
29228 tentatively so that if the tentative parsing fails we can restore the
29229 tokens. */
29231 static void
29233 {
29234 /* Enter a new parsing context. */
29236 /* Begin saving tokens. */
29238 /* In order to avoid repetitive access control error messages,
29239 access checks are queued up until we are no longer parsing
29240 tentatively. */
29242 }
29244 /* Commit to the currently active tentative parse. */
29246 static void
29248 {
29252 /* Mark all of the levels as committed. */
29255 {
29262 }
29263 }
29265 /* Commit to the topmost currently active tentative parse.
29267 Note that this function shouldn't be called when there are
29268 irreversible side-effects while in a tentative state. For
29269 example, we shouldn't create a permanent entry in the symbol
29270 table, or issue an error message that might not apply if the
29271 tentative parse is aborted. */
29273 static void
29275 {
29280 {
29288 }
29289 }
29291 /* Abort the currently active tentative parse. All consumed tokens
29292 will be rolled back, and no diagnostics will be issued. */
29294 static void
29296 {
29300 /* Now, pretend that we want to see if the construct was
29301 successfully parsed. */
29303 }
29305 /* Stop parsing tentatively. If a parse error has occurred, restore the
29306 token stream. Otherwise, commit to the tokens we have consumed.
29307 Returns true if no error occurred; false otherwise. */
29309 static bool
29311 {
29315 /* Remember whether or not an error occurred, since we are about to
29316 destroy that information. */
29318 /* Remove the topmost context from the stack. */
29321 /* If no parse errors occurred, commit to the tentative parse. */
29323 {
29324 /* Commit to the tokens read tentatively, unless that was
29325 already done. */
29330 }
29331 /* Otherwise, if errors occurred, roll back our state so that things
29332 are just as they were before we began the tentative parse. */
29333 else
29334 {
29337 }
29338 /* Add the context to the front of the free list. */
29343 }
29345 /* Returns true if we are parsing tentatively and are not committed to
29346 this tentative parse. */
29348 static bool
29350 {
29353 }
29355 /* Returns nonzero iff an error has occurred during the most recent
29356 tentative parse. */
29358 static bool
29360 {
29363 }
29365 /* Returns nonzero if GNU extensions are allowed. */
29367 static bool
29369 {
29371 }
29372 \f
29373 /* Objective-C++ Productions */
29376 /* Parse an Objective-C expression, which feeds into a primary-expression
29377 above.
29379 objc-expression:
29380 objc-message-expression
29381 objc-string-literal
29382 objc-encode-expression
29383 objc-protocol-expression
29384 objc-selector-expression
29386 Returns a tree representation of the expression. */
29388 static cp_expr
29390 {
29391 /* Try to figure out what kind of declaration is present. */
29395 {
29405 {
29417 }
29418 /* FALLTHRU */
29424 }
29427 }
29429 /* Parse an Objective-C message expression.
29431 objc-message-expression:
29432 [ objc-message-receiver objc-message-args ]
29434 Returns a representation of an Objective-C message. */
29436 static tree
29438 {
29450 /* Construct a location e.g.
29451 [self func1:5]
29452 ^~~~~~~~~~~~~~
29453 ranging from the '[' to the ']', with the caret at the start. */
29458 }
29460 /* Parse an objc-message-receiver.
29462 objc-message-receiver:
29463 expression
29464 simple-type-specifier
29466 Returns a representation of the type or expression. */
29468 static tree
29470 {
29471 tree rcv;
29473 /* An Objective-C message receiver may be either (1) a type
29474 or (2) an expression. */
29478 /* If that worked out, fine. */
29485 CP_PARSER_FLAGS_NONE);
29492 }
29494 /* Parse the arguments and selectors comprising an Objective-C message.
29496 objc-message-args:
29497 objc-selector
29498 objc-selector-args
29499 objc-selector-args , objc-comma-args
29501 objc-selector-args:
29502 objc-selector [opt] : assignment-expression
29503 objc-selector-args objc-selector [opt] : assignment-expression
29505 objc-comma-args:
29506 assignment-expression
29507 objc-comma-args , assignment-expression
29509 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29510 selector arguments and TREE_VALUE containing a list of comma
29511 arguments. */
29513 static tree
29515 {
29521 {
29527 /* Detect if we have a unary selector. */
29536 sel_args
29541 }
29543 /* Handle non-selector arguments, if any. */
29545 {
29546 tree arg;
29551 addl_args
29556 }
29559 {
29562 }
29565 }
29567 /* Parse an Objective-C encode expression.
29569 objc-encode-expression:
29570 @encode objc-typename
29572 Returns an encoded representation of the type argument. */
29574 static cp_expr
29576 {
29577 tree type;
29582 matching_parens parens;
29589 {
29593 }
29595 /* This happens if we find @encode(T) (where T is a template
29596 typename or something dependent on a template typename) when
29597 parsing a template. In that case, we can't compile it
29598 immediately, but we rather create an AT_ENCODE_EXPR which will
29599 need to be instantiated when the template is used.
29600 */
29602 {
29606 }
29609 /* Build a location of the form:
29610 @encode(int)
29611 ^~~~~~~~~~~~
29612 with caret==start at the @ token, finishing at the close paren. */
29613 location_t combined_loc
29618 }
29620 /* Parse an Objective-C @defs expression. */
29622 static tree
29624 {
29625 tree name;
29628 matching_parens parens;
29634 }
29636 /* Parse an Objective-C protocol expression.
29638 objc-protocol-expression:
29639 @protocol ( identifier )
29641 Returns a representation of the protocol expression. */
29643 static tree
29645 {
29646 tree proto;
29650 matching_parens parens;
29655 /* Build a location of the form:
29656 @protocol(prot)
29657 ^~~~~~~~~~~~~~~
29658 with caret==start at the @ token, finishing at the close paren. */
29659 location_t combined_loc
29665 }
29667 /* Parse an Objective-C selector expression.
29669 objc-selector-expression:
29670 @selector ( objc-method-signature )
29672 objc-method-signature:
29673 objc-selector
29674 objc-selector-seq
29676 objc-selector-seq:
29677 objc-selector :
29678 objc-selector-seq objc-selector :
29680 Returns a representation of the method selector. */
29682 static tree
29684 {
29691 matching_parens parens;
29697 {
29706 {
29707 /* Detect if we have a unary selector. */
29709 {
29712 }
29713 else
29714 {
29716 }
29717 }
29722 {
29723 sel_seq
29726 sel_seq
29729 }
29730 else
29731 sel_seq
29736 }
29738 finish_selector:
29742 /* Build a location of the form:
29743 @selector(func)
29744 ^~~~~~~~~~~~~~~
29745 with caret==start at the @ token, finishing at the close paren. */
29746 location_t combined_loc
29750 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29753 }
29755 /* Parse a list of identifiers.
29757 objc-identifier-list:
29758 identifier
29759 objc-identifier-list , identifier
29761 Returns a TREE_LIST of identifier nodes. */
29763 static tree
29765 {
29766 tree identifier;
29767 tree list;
29778 {
29785 identifier));
29787 }
29790 }
29792 /* Parse an Objective-C alias declaration.
29794 objc-alias-declaration:
29795 @compatibility_alias identifier identifier ;
29797 This function registers the alias mapping with the Objective-C front end.
29798 It returns nothing. */
29800 static void
29802 {
29810 }
29812 /* Parse an Objective-C class forward-declaration.
29814 objc-class-declaration:
29815 @class objc-identifier-list ;
29817 The function registers the forward declarations with the Objective-C
29818 front end. It returns nothing. */
29820 static void
29822 {
29825 {
29826 tree id;
29836 else
29838 }
29840 }
29842 /* Parse a list of Objective-C protocol references.
29844 objc-protocol-refs-opt:
29845 objc-protocol-refs [opt]
29847 objc-protocol-refs:
29848 < objc-identifier-list >
29850 Returns a TREE_LIST of identifiers, if any. */
29852 static tree
29854 {
29858 {
29862 }
29865 }
29867 /* Parse a Objective-C visibility specification. */
29869 static void
29871 {
29875 {
29890 }
29892 /* Eat '@private'/'@protected'/'@public'. */
29894 }
29896 /* Parse an Objective-C method type. Return 'true' if it is a class
29897 (+) method, and 'false' if it is an instance (-) method. */
29901 {
29904 else
29906 }
29908 /* Parse an Objective-C protocol qualifier. */
29910 static tree
29912 {
29925 {
29930 }
29933 }
29935 /* Parse an Objective-C typename. */
29937 static tree
29939 {
29943 {
29946 matching_parens parens;
29950 /* An ObjC type name may consist of just protocol qualifiers, in which
29951 case the type shall default to 'id'. */
29953 {
29956 /* If the type could not be parsed, an error has already
29957 been produced. For error recovery, behave as if it had
29958 not been specified, which will use the default type
29959 'id'. */
29961 {
29963 /* We need to skip to the closing parenthesis as
29964 cp_parser_type_id() does not seem to do it for
29965 us. */
29970 }
29971 }
29975 }
29978 }
29980 /* Check to see if TYPE refers to an Objective-C selector name. */
29982 static bool
29984 {
29990 }
29992 /* Parse an Objective-C selector. */
29994 static tree
29996 {
30000 {
30003 }
30005 /* C++ operator names are allowed to appear in ObjC selectors. */
30007 {
30020 }
30021 }
30023 /* Parse an Objective-C params list. */
30025 static tree
30027 {
30033 {
30043 /* Detect if we have a unary selector. */
30046 {
30049 }
30053 {
30054 /* Something went quite wrong. There should be a colon
30055 here, but there is not. Stop parsing parameters. */
30057 }
30059 /* New ObjC allows attributes on parameters too. */
30064 params
30067 type_name,
30068 identifier,
30069 parm_attr));
30072 }
30075 {
30078 }
30080 /* We allow tail attributes for the method. */
30082 {
30090 }
30093 {
30096 }
30098 }
30100 /* Parse the non-keyword Objective-C params. */
30102 static tree
30105 {
30111 {
30113 tree parm;
30119 {
30124 }
30126 /* TODO: parse attributes for tail parameters. */
30135 }
30137 /* We allow tail attributes for the method. */
30139 {
30141 {
30146 }
30147 else
30148 /* We have an error, but parse the attributes, so that we can
30149 carry on. */
30155 }
30158 }
30160 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30162 static void
30164 {
30167 /* If the next token is `extern' and the following token is a string
30168 literal, then we have a linkage specification. */
30170 && cp_parser_is_pure_string_literal
30173 /* Handle #pragma, if any. */
30176 /* Allow stray semicolons. */
30179 /* Mark methods as optional or required, when building protocols. */
30181 {
30184 }
30186 {
30189 }
30192 /* Other stray characters must generate errors. */
30194 {
30198 }
30199 /* Finally, try to parse a block-declaration, or a function-definition. */
30200 else
30202 }
30204 /* Parse a method signature. */
30206 static tree
30208 {
30224 }
30226 static bool
30228 {
30229 tree tattr;
30234 /* If the attributes are followed by a method introducer, this is not allowed.
30235 Dump the attributes and flag the situation. */
30240 /* Otherwise, the attributes introduce some interstitial code, possibly so
30241 rewind to allow that check. */
30244 }
30246 /* Parse an Objective-C method prototype list. */
30248 static void
30250 {
30254 {
30256 {
30261 else
30265 {
30269 }
30272 }
30278 OPT_Wattributes,
30280 else
30281 /* Allow for interspersed non-ObjC++ code. */
30285 }
30289 else
30293 }
30295 /* Parse an Objective-C method definition list. */
30297 static void
30299 {
30303 {
30304 tree meth;
30307 {
30313 else
30318 {
30322 }
30324 NULL_TREE);
30326 /* For historical reasons, we accept an optional semicolon. */
30333 {
30340 }
30341 }
30342 /* The following case will be removed once @synthesize is
30343 completely implemented. */
30354 else
30355 /* Allow for interspersed non-ObjC++ code. */
30359 }
30363 else
30367 }
30369 /* Parse Objective-C ivars. */
30371 static void
30373 {
30384 {
30385 cp_decl_specifier_seq declspecs;
30387 tree prefix_attributes;
30395 CP_PARSER_FLAGS_OPTIONAL,
30399 /* auto, register, static, extern, mutable. */
30401 {
30404 }
30406 /* thread_local. */
30408 {
30411 }
30413 /* typedef. */
30415 {
30418 }
30423 /* Keep going until we hit the `;' at the end of the
30424 declaration. */
30426 {
30431 /* Check for a (possibly unnamed) bitfield declaration. */
30439 {
30440 /* Get the name of the bitfield. */
30443 sfk_none);
30445 eat_colon:
30447 /* Get the width of the bitfield. */
30448 width
30450 }
30451 else
30452 {
30453 /* Parse the declarator. */
30454 declarator
30460 }
30462 /* Look for attributes that apply to the ivar. */
30464 /* Remember which attributes are prefix attributes and
30465 which are not. */
30467 /* Combine the attributes. */
30471 /* Create the bitfield declaration. */
30474 else
30479 /* Add the instance variable. */
30483 /* Reset PREFIX_ATTRIBUTES. */
30485 {
30490 }
30495 {
30498 }
30500 }
30504 }
30509 /* Do not consume the RID_AT_END, so it will be read again as terminating
30510 the @interface of @implementation. */
30514 /* For historical reasons, we accept an optional semicolon. */
30517 }
30519 /* Parse an Objective-C protocol declaration. */
30521 static void
30523 {
30529 {
30534 }
30536 /* See if we have a forward declaration or a definition. */
30539 /* Try a forward declaration first. */
30541 {
30543 {
30544 tree id;
30554 else
30556 }
30558 }
30560 /* Ok, we got a full-fledged definition (or at least should). */
30561 else
30562 {
30567 }
30568 }
30570 /* Parse an Objective-C superclass or category. */
30572 static void
30577 {
30583 {
30586 }
30588 {
30589 matching_parens parens;
30592 /* If there is no category name, and this is an @interface, we
30593 have a class extension. */
30595 {
30598 }
30599 else
30603 }
30604 }
30606 /* Parse an Objective-C class interface. */
30608 static void
30610 {
30617 {
30618 /* It's hard to recover because even if valid @interface stuff
30619 is to follow, we can't compile it (or validate it) if we
30620 don't even know which class it refers to. Let's assume this
30621 was a stray '@interface' token in the stream and skip it.
30622 */
30624 }
30629 /* We have either a class or a category on our hands. */
30632 else
30633 {
30635 /* Handle instance variable declarations, if any. */
30638 }
30641 }
30643 /* Parse an Objective-C class implementation. */
30645 static void
30647 {
30654 {
30655 /* It's hard to recover because even if valid @implementation
30656 stuff is to follow, we can't compile it (or validate it) if
30657 we don't even know which class it refers to. Let's assume
30658 this was a stray '@implementation' token in the stream and
30659 skip it.
30660 */
30662 }
30666 /* We have either a class or a category on our hands. */
30669 else
30670 {
30672 /* Handle instance variable declarations, if any. */
30675 }
30678 }
30680 /* Consume the @end token and finish off the implementation. */
30682 static void
30684 {
30687 }
30689 /* Parse an Objective-C declaration. */
30691 static void
30693 {
30694 /* Try to figure out what kind of declaration is present. */
30699 {
30715 }
30718 {
30741 }
30742 }
30744 /* Parse an Objective-C try-catch-finally statement.
30746 objc-try-catch-finally-stmt:
30747 @try compound-statement objc-catch-clause-seq [opt]
30748 objc-finally-clause [opt]
30750 objc-catch-clause-seq:
30751 objc-catch-clause objc-catch-clause-seq [opt]
30753 objc-catch-clause:
30754 @catch ( objc-exception-declaration ) compound-statement
30756 objc-finally-clause:
30757 @finally compound-statement
30759 objc-exception-declaration:
30760 parameter-declaration
30761 '...'
30763 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30765 Returns NULL_TREE.
30767 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30768 for C. Keep them in sync. */
30770 static tree
30772 {
30773 location_t location;
30774 tree stmt;
30779 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30780 node, lest it get absorbed into the surrounding block. */
30786 {
30790 matching_parens parens;
30796 {
30797 /* We have "@catch (...)" (where the '...' are literally
30798 what is in the code). Skip the '...'.
30799 parameter_declaration is set to NULL_TREE, and
30800 objc_being_catch_clauses() knows that that means
30801 '...'. */
30804 }
30805 else
30806 {
30807 /* We have "@catch (NSException *exception)" or something
30808 like that. Parse the parameter declaration. */
30812 else
30817 }
30820 else
30821 {
30822 /* If there was no open parenthesis, we are recovering from
30823 an error, and we are trying to figure out what mistake
30824 the user has made. */
30826 /* If there is an immediate closing parenthesis, the user
30827 probably forgot the opening one (ie, they typed "@catch
30828 NSException *e)". Parse the closing parenthesis and keep
30829 going. */
30833 /* If these is no immediate closing parenthesis, the user
30834 probably doesn't know that parenthesis are required at
30835 all (ie, they typed "@catch NSException *e"). So, just
30836 forget about the closing parenthesis and keep going. */
30837 }
30841 }
30843 {
30846 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30847 node, lest it get absorbed into the surrounding block. */
30851 }
30854 }
30856 /* Parse an Objective-C synchronized statement.
30858 objc-synchronized-stmt:
30859 @synchronized ( expression ) compound-statement
30861 Returns NULL_TREE. */
30863 static tree
30865 {
30866 location_t location;
30873 matching_parens parens;
30878 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30879 node, lest it get absorbed into the surrounding block. */
30884 }
30886 /* Parse an Objective-C throw statement.
30888 objc-throw-stmt:
30889 @throw assignment-expression [opt] ;
30891 Returns a constructed '@throw' statement. */
30893 static tree
30895 {
30907 }
30909 /* Parse an Objective-C statement. */
30911 static tree
30913 {
30914 /* Try to figure out what kind of declaration is present. */
30918 {
30929 }
30932 }
30934 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30935 look ahead to see if an objc keyword follows the attributes. This
30936 is to detect the use of prefix attributes on ObjC @interface and
30937 @protocol. */
30939 static bool
30941 {
30946 {
30949 }
30952 }
30954 /* This routine is a minimal replacement for
30955 c_parser_struct_declaration () used when parsing the list of
30956 types/names or ObjC++ properties. For example, when parsing the
30957 code
30959 @property (readonly) int a, b, c;
30961 this function is responsible for parsing "int a, int b, int c" and
30962 returning the declarations as CHAIN of DECLs.
30964 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30965 similar parsing. */
30966 static tree
30968 {
30970 cp_decl_specifier_seq declspecs;
30972 tree prefix_attributes;
30975 CP_PARSER_FLAGS_NONE,
30982 /* auto, register, static, extern, mutable. */
30984 {
30987 }
30989 /* thread_local. */
30991 {
30994 }
30996 /* typedef. */
30998 {
31001 }
31006 /* Keep going until we hit the `;' at the end of the declaration. */
31008 {
31013 /* Parse the declarator. */
31017 /* Look for attributes that apply to the ivar. */
31019 /* Remember which attributes are prefix attributes and
31020 which are not. */
31022 /* Combine the attributes. */
31032 /* Reset PREFIX_ATTRIBUTES. */
31034 {
31039 }
31046 {
31049 }
31050 else
31052 }
31054 }
31056 /* Parse an Objective-C @property declaration. The syntax is:
31058 objc-property-declaration:
31059 '@property' objc-property-attributes[opt] struct-declaration ;
31061 objc-property-attributes:
31062 '(' objc-property-attribute-list ')'
31064 objc-property-attribute-list:
31065 objc-property-attribute
31066 objc-property-attribute-list, objc-property-attribute
31068 objc-property-attribute
31069 'getter' = identifier
31070 'setter' = identifier
31071 'readonly'
31072 'readwrite'
31073 'assign'
31074 'retain'
31075 'copy'
31076 'nonatomic'
31078 For example:
31079 @property NSString *name;
31080 @property (readonly) id object;
31081 @property (retain, nonatomic, getter=getTheName) id name;
31082 @property int a, b, c;
31084 PS: This function is identical to
31085 c_parser_objc_at_property_declaration for C. Keep them in sync. */
31086 static void
31088 {
31089 /* The following variables hold the attributes of the properties as
31090 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
31091 seen. When we see an attribute, we set them to 'true' (if they
31092 are boolean properties) or to the identifier (if they have an
31093 argument, ie, for getter and setter). Note that here we only
31094 parse the list of attributes, check the syntax and accumulate the
31095 attributes that we find. objc_add_property_declaration() will
31096 then process the information. */
31106 /* 'properties' is the list of properties that we read. Usually a
31107 single one, but maybe more (eg, in "@property int a, b, c;" there
31108 are three). */
31109 tree properties;
31110 location_t loc;
31116 /* Parse the optional attribute list... */
31118 {
31119 /* Eat the '('. */
31120 matching_parens parens;
31124 {
31130 {
31133 }
31137 {
31148 {
31152 else
31157 }
31160 {
31164 }
31166 {
31168 {
31171 }
31172 else
31176 else
31178 }
31179 else
31180 {
31182 {
31185 }
31186 else
31188 }
31194 }
31201 else
31203 }
31205 /* FIXME: "@property (setter, assign);" will generate a spurious
31206 "error: expected ‘)’ before ‘,’ token". This is because
31207 cp_parser_require, unlike the C counterpart, will produce an
31208 error even if we are in error recovery. */
31210 {
31215 }
31216 }
31218 /* ... and the property declaration(s). */
31222 {
31224 /* If the next token is now a `;', consume it. */
31228 }
31232 else
31233 {
31234 /* Comma-separated properties are chained together in
31235 reverse order; add them one by one. */
31244 }
31247 }
31249 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31251 objc-synthesize-declaration:
31252 @synthesize objc-synthesize-identifier-list ;
31254 objc-synthesize-identifier-list:
31255 objc-synthesize-identifier
31256 objc-synthesize-identifier-list, objc-synthesize-identifier
31258 objc-synthesize-identifier
31259 identifier
31260 identifier = identifier
31262 For example:
31263 @synthesize MyProperty;
31264 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31266 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31267 for C. Keep them in sync.
31268 */
31269 static void
31271 {
31273 location_t loc;
31278 {
31282 {
31285 }
31287 {
31291 {
31294 }
31295 }
31296 else
31301 else
31303 }
31306 }
31308 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31310 objc-dynamic-declaration:
31311 @dynamic identifier-list ;
31313 For example:
31314 @dynamic MyProperty;
31315 @dynamic MyProperty, AnotherProperty;
31317 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31318 for C. Keep them in sync.
31319 */
31320 static void
31322 {
31324 location_t loc;
31329 {
31330 tree property;
31333 {
31336 }
31340 else
31342 }
31345 }
31347 \f
31348 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31350 /* Returns name of the next clause.
31351 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31352 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31353 returned and the token is consumed. */
31355 static pragma_omp_clause
31357 {
31373 {
31378 {
31559 }
31560 }
31566 }
31568 /* Validate that a clause of the given type does not already exist. */
31570 static void
31573 {
31574 tree c;
31578 {
31581 }
31582 }
31584 /* OpenMP 2.5:
31585 variable-list:
31586 identifier
31587 variable-list , identifier
31589 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31590 colon). An opening parenthesis will have been consumed by the caller.
31592 If KIND is nonzero, create the appropriate node and install the decl
31593 in OMP_CLAUSE_DECL and add the node to the head of the list.
31595 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31596 return the list created.
31598 COLON can be NULL if only closing parenthesis should end the list,
31599 or pointer to bool which will receive false if the list is terminated
31600 by closing parenthesis or true if the list is terminated by colon. */
31602 static tree
31605 {
31609 {
31612 }
31614 {
31619 && current_class_ptr
31621 {
31627 }
31628 else
31629 {
31640 else
31645 }
31647 ;
31649 {
31651 {
31653 /* The OpenACC cache directive explicitly only allows "array
31654 elements or subarrays". */
31656 {
31660 }
31661 /* FALLTHROUGH. */
31666 {
31667 location_t loc
31672 decl
31676 }
31677 /* FALLTHROUGH. */
31681 {
31689 parser->colon_corrects_to_scope_p
31693 else
31694 {
31695 /* Look for `:'. */
31699 CPP_CLOSE_SQUARE))
31701 }
31702 /* Look for the closing `]'. */
31704 RT_CLOSE_SQUARE))
31708 }
31712 }
31718 }
31719 else
31722 get_comma:
31726 }
31732 {
31736 }
31739 {
31742 /* Try to resync to an unnested comma. Copied from
31743 cp_parser_parenthesized_expression_list. */
31744 skip_comma:
31753 }
31756 }
31758 /* Similarly, but expect leading and trailing parenthesis. This is a very
31759 common case for omp clauses. */
31761 static tree
31763 {
31767 }
31769 /* OpenACC 2.0:
31770 copy ( variable-list )
31771 copyin ( variable-list )
31772 copyout ( variable-list )
31773 create ( variable-list )
31774 delete ( variable-list )
31775 present ( variable-list ) */
31777 static tree
31779 tree list)
31780 {
31783 {
31816 }
31824 }
31826 /* OpenACC 2.0:
31827 deviceptr ( variable-list ) */
31829 static tree
31831 {
31835 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31836 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31837 variable-list must only allow for pointer variables. */
31840 {
31847 }
31850 }
31852 /* OpenACC 2.5:
31853 auto
31854 finalize
31855 independent
31856 nohost
31857 seq */
31859 static tree
31863 {
31868 }
31870 /* OpenACC:
31871 num_gangs ( expression )
31872 num_workers ( expression )
31873 vector_length ( expression ) */
31875 static tree
31878 {
31881 matching_parens parens;
31889 {
31894 }
31902 }
31904 /* OpenACC:
31906 gang [( gang-arg-list )]
31907 worker [( [num:] int-expr )]
31908 vector [( [length:] int-expr )]
31910 where gang-arg is one of:
31912 [num:] int-expr
31913 static: size-expr
31915 and size-expr may be:
31917 *
31918 int-expr
31919 */
31921 static tree
31924 {
31934 {
31935 matching_parens parens;
31938 do
31939 {
31943 /* Gang static argument. */
31946 {
31954 {
31957 }
31959 /* Check for the '*' argument. */
31963 CPP_CLOSE_PAREN)))
31964 {
31969 {
31972 }
31974 }
31975 }
31976 /* Worker num: argument and vector length: arguments. */
31980 {
31983 }
31985 /* Now collect the actual argument. */
31987 {
31990 }
32002 {
32005 }
32007 }
32012 }
32026 cleanup_error:
32029 }
32031 /* OpenACC 2.0:
32032 tile ( size-expr-list ) */
32034 static tree
32036 {
32040 /* Collapse and tile are mutually exclusive. (The spec doesn't say
32041 so, but the spec authors never considered such a case and have
32042 differing opinions on what it might mean, including 'not
32043 allowed'.) */
32046 clause_loc);
32051 do
32052 {
32059 {
32062 }
32063 else
32067 }
32070 /* Consume the trailing ')'. */
32078 }
32080 /* OpenACC 2.0
32081 Parse wait clause or directive parameters. */
32083 static tree
32085 {
32095 {
32100 }
32107 {
32111 {
32114 else
32115 {
32122 }
32123 }
32124 }
32127 }
32129 /* OpenACC:
32130 wait ( int-expr-list ) */
32132 static tree
32134 {
32143 }
32145 /* OpenMP 3.0:
32146 collapse ( constant-expression ) */
32148 static tree
32150 {
32152 location_t loc;
32153 HOST_WIDE_INT n;
32156 matching_parens parens;
32174 {
32177 }
32186 }
32188 /* OpenMP 2.5:
32189 default ( none | shared )
32191 OpenACC:
32192 default ( none | present ) */
32194 static tree
32197 {
32199 tree c;
32201 matching_parens parens;
32205 {
32210 {
32231 }
32234 }
32235 else
32236 {
32237 invalid_kind:
32240 else
32242 }
32259 }
32261 /* OpenMP 3.1:
32262 final ( expression ) */
32264 static tree
32266 {
32269 matching_parens parens;
32288 }
32290 /* OpenMP 2.5:
32291 if ( expression )
32293 OpenMP 4.5:
32294 if ( directive-name-modifier : expression )
32296 directive-name-modifier:
32297 parallel | task | taskloop | target data | target | target update
32298 | target enter data | target exit data */
32300 static tree
32303 {
32307 matching_parens parens;
32312 {
32324 {
32327 {
32340 else
32341 {
32342 location_t loc
32347 }
32350 {
32352 {
32357 }
32359 {
32360 location_t loc
32364 }
32365 }
32366 }
32367 }
32369 {
32371 {
32374 }
32375 else
32376 {
32378 {
32379 location_t loc
32382 }
32384 }
32385 }
32386 }
32398 {
32401 {
32404 {
32414 }
32416 p);
32418 }
32420 {
32423 else
32426 }
32429 {
32433 }
32434 }
32442 }
32444 /* OpenMP 3.1:
32445 mergeable */
32447 static tree
32450 {
32451 tree c;
32454 location);
32459 }
32461 /* OpenMP 2.5:
32462 nowait */
32464 static tree
32467 {
32468 tree c;
32475 }
32477 /* OpenMP 2.5:
32478 num_threads ( expression ) */
32480 static tree
32482 location_t location)
32483 {
32486 matching_parens parens;
32506 }
32508 /* OpenMP 4.5:
32509 num_tasks ( expression ) */
32511 static tree
32513 location_t location)
32514 {
32517 matching_parens parens;
32537 }
32539 /* OpenMP 4.5:
32540 grainsize ( expression ) */
32542 static tree
32544 location_t location)
32545 {
32548 matching_parens parens;
32568 }
32570 /* OpenMP 4.5:
32571 priority ( expression ) */
32573 static tree
32575 location_t location)
32576 {
32579 matching_parens parens;
32599 }
32601 /* OpenMP 4.5:
32602 hint ( expression ) */
32604 static tree
32606 location_t location)
32607 {
32610 matching_parens parens;
32629 }
32631 /* OpenMP 4.5:
32632 defaultmap ( tofrom : scalar ) */
32634 static tree
32636 location_t location)
32637 {
32641 matching_parens parens;
32646 {
32649 }
32653 {
32656 }
32662 {
32665 }
32669 {
32672 }
32678 location);
32684 out_err:
32689 }
32691 /* OpenMP 2.5:
32692 ordered
32694 OpenMP 4.5:
32695 ordered ( constant-expression ) */
32697 static tree
32700 {
32702 HOST_WIDE_INT n;
32708 {
32709 matching_parens parens;
32726 {
32728 "ordered argument needs positive constant integer "
32731 }
32732 }
32738 }
32740 /* OpenMP 2.5:
32741 reduction ( reduction-operator : variable-list )
32743 reduction-operator:
32744 One of: + * - & ^ | && ||
32746 OpenMP 3.1:
32748 reduction-operator:
32749 One of: + * - & ^ | && || min max
32751 OpenMP 4.0:
32753 reduction-operator:
32754 One of: + * - & ^ | && ||
32755 id-expression */
32757 static tree
32759 {
32767 {
32777 }
32781 else
32782 {
32793 {
32823 }
32824 else
32825 {
32827 resync_fail:
32832 }
32833 }
32839 NULL);
32841 {
32844 }
32847 }
32849 /* OpenMP 2.5:
32850 schedule ( schedule-kind )
32851 schedule ( schedule-kind , expression )
32853 schedule-kind:
32854 static | dynamic | guided | runtime | auto
32856 OpenMP 4.5:
32857 schedule ( schedule-modifier : schedule-kind )
32858 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32860 schedule-modifier:
32861 simd
32862 monotonic
32863 nonmonotonic */
32865 static tree
32867 {
32871 matching_parens parens;
32878 {
32887 else
32893 else
32894 {
32897 }
32898 }
32901 {
32906 {
32927 }
32928 }
32933 else
32939 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32941 {
32945 }
32948 {
32963 else
32968 }
32980 invalid_kind:
32982 resync_fail:
32987 }
32989 /* OpenMP 3.0:
32990 untied */
32992 static tree
32995 {
32996 tree c;
33003 }
33005 /* OpenMP 4.0:
33006 inbranch
33007 notinbranch */
33009 static tree
33012 {
33017 }
33019 /* OpenMP 4.0:
33020 parallel
33021 for
33022 sections
33023 taskgroup */
33025 static tree
33029 {
33033 }
33035 /* OpenMP 4.5:
33036 nogroup */
33038 static tree
33041 {
33046 }
33048 /* OpenMP 4.5:
33049 simd
33050 threads */
33052 static tree
33056 {
33061 }
33063 /* OpenMP 4.0:
33064 num_teams ( expression ) */
33066 static tree
33068 location_t location)
33069 {
33072 matching_parens parens;
33092 }
33094 /* OpenMP 4.0:
33095 thread_limit ( expression ) */
33097 static tree
33099 location_t location)
33100 {
33103 matching_parens parens;
33123 }
33125 /* OpenMP 4.0:
33126 aligned ( variable-list )
33127 aligned ( variable-list : constant-expression ) */
33129 static tree
33131 {
33135 matching_parens parens;
33143 {
33153 }
33159 }
33161 /* OpenMP 4.0:
33162 linear ( variable-list )
33163 linear ( variable-list : expression )
33165 OpenMP 4.5:
33166 linear ( modifier ( variable-list ) )
33167 linear ( modifier ( variable-list ) : expression ) */
33169 static tree
33172 {
33177 matching_parens parens;
33182 {
33194 else
33196 }
33201 else
33202 {
33211 }
33214 {
33219 {
33230 {
33233 }
33236 }
33247 }
33250 {
33253 }
33256 }
33258 /* OpenMP 4.0:
33259 safelen ( constant-expression ) */
33261 static tree
33263 location_t location)
33264 {
33267 matching_parens parens;
33286 }
33288 /* OpenMP 4.0:
33289 simdlen ( constant-expression ) */
33291 static tree
33293 location_t location)
33294 {
33297 matching_parens parens;
33316 }
33318 /* OpenMP 4.5:
33319 vec:
33320 identifier [+/- integer]
33321 vec , identifier [+/- integer]
33322 */
33324 static tree
33326 tree list)
33327 {
33331 {
33334 }
33337 {
33344 else
33345 {
33346 t = cp_parser_lookup_name_simple
33351 id_loc);
33352 }
33358 {
33361 }
33365 {
33368 }
33372 {
33375 }
33378 add_to_vector:
33380 {
33384 }
33390 }
33393 {
33399 }
33401 }
33403 /* OpenMP 4.0:
33404 depend ( depend-kind : variable-list )
33406 depend-kind:
33407 in | out | inout
33409 OpenMP 4.5:
33410 depend ( source )
33412 depend ( sink : vec ) */
33414 static tree
33416 {
33420 matching_parens parens;
33425 {
33439 else
33441 }
33442 else
33448 {
33458 }
33465 else
33466 {
33472 }
33475 invalid_kind:
33477 resync_fail:
33482 }
33484 /* OpenMP 4.0:
33485 map ( map-kind : variable-list )
33486 map ( variable-list )
33488 map-kind:
33489 alloc | to | from | tofrom
33491 OpenMP 4.5:
33492 map-kind:
33493 alloc | to | from | tofrom | release | delete
33495 map ( always [,] map-kind: variable-list ) */
33497 static tree
33499 {
33508 {
33513 {
33516 nth++;
33522 {
33527 }
33528 }
33529 }
33533 {
33547 else
33548 {
33554 }
33557 }
33560 {
33564 }
33567 NULL);
33573 }
33575 /* OpenMP 4.0:
33576 device ( expression ) */
33578 static tree
33580 location_t location)
33581 {
33584 matching_parens parens;
33604 }
33606 /* OpenMP 4.0:
33607 dist_schedule ( static )
33608 dist_schedule ( static , expression ) */
33610 static tree
33612 location_t location)
33613 {
33616 matching_parens parens;
33627 {
33638 }
33643 location);
33647 invalid_kind:
33649 resync_fail:
33654 }
33656 /* OpenMP 4.0:
33657 proc_bind ( proc-bind-kind )
33659 proc-bind-kind:
33660 master | close | spread */
33662 static tree
33664 location_t location)
33665 {
33666 tree c;
33673 {
33683 else
33685 }
33686 else
33695 location);
33700 invalid_kind:
33702 resync_fail:
33707 }
33709 /* OpenACC:
33710 async [( int-expr )] */
33712 static tree
33714 {
33721 {
33722 matching_parens parens;
33731 }
33741 }
33743 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33744 is a bitmask in MASK. Return the list of clauses found. */
33746 static tree
33750 {
33755 {
33756 location_t here;
33757 pragma_omp_clause c_kind;
33758 omp_clause_code code;
33769 {
33826 clauses);
33844 OMP_CLAUSE_IF_PRESENT,
33850 OMP_CLAUSE_INDEPENDENT,
33862 clauses);
33868 clauses);
33876 clauses);
33894 clauses);
33906 clauses);
33920 }
33925 {
33926 /* Remove the invalid clause(s) from the list to avoid
33927 confusing the rest of the compiler. */
33930 }
33931 }
33933 saw_error:
33940 }
33942 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33943 is a bitmask in MASK. Return the list of clauses found; the result
33944 of clause default goes in *pdefault. */
33946 static tree
33950 {
33956 {
33957 pragma_omp_clause c_kind;
33968 {
33980 clauses);
33994 clauses);
34014 clauses);
34019 clauses);
34029 clauses);
34063 clauses);
34077 clauses);
34092 OMP_CLAUSE_NOTINBRANCH,
34101 {
34102 clause_not_first:
34106 }
34136 clauses);
34137 else
34147 clauses);
34165 {
34170 }
34213 clauses
34219 clauses
34227 }
34232 {
34233 /* Remove the invalid clause(s) from the list to avoid
34234 confusing the rest of the compiler. */
34237 }
34238 }
34239 saw_error:
34242 {
34245 else
34247 }
34249 }
34251 /* OpenMP 2.5:
34252 structured-block:
34253 statement
34255 In practice, we're also interested in adding the statement to an
34256 outer node. So it is convenient if we work around the fact that
34257 cp_parser_statement calls add_stmt. */
34259 static unsigned
34261 {
34264 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34265 This preserves the "not within loop or switch" style error messages
34266 for nonsense cases like
34267 void foo() {
34268 #pragma omp single
34269 break;
34270 }
34271 */
34276 }
34278 static void
34280 {
34282 }
34284 static tree
34286 {
34294 }
34296 /* OpenMP 2.5:
34297 # pragma omp atomic new-line
34298 expression-stmt
34300 expression-stmt:
34301 x binop= expr | x++ | ++x | x-- | --x
34302 binop:
34303 +, *, -, /, &, ^, |, <<, >>
34305 where x is an lvalue expression with scalar type.
34307 OpenMP 3.1:
34308 # pragma omp atomic new-line
34309 update-stmt
34311 # pragma omp atomic read new-line
34312 read-stmt
34314 # pragma omp atomic write new-line
34315 write-stmt
34317 # pragma omp atomic update new-line
34318 update-stmt
34320 # pragma omp atomic capture new-line
34321 capture-stmt
34323 # pragma omp atomic capture new-line
34324 capture-block
34326 read-stmt:
34327 v = x
34328 write-stmt:
34329 x = expr
34330 update-stmt:
34331 expression-stmt | x = x binop expr
34332 capture-stmt:
34333 v = expression-stmt
34334 capture-block:
34335 { v = x; update-stmt; } | { update-stmt; v = x; }
34337 OpenMP 4.0:
34338 update-stmt:
34339 expression-stmt | x = x binop expr | x = expr binop x
34340 capture-stmt:
34341 v = update-stmt
34342 capture-block:
34343 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34345 where x and v are lvalue expressions with scalar type. */
34347 static void
34349 {
34357 {
34362 {
34368 }
34369 }
34371 {
34383 else
34387 }
34389 {
34395 {
34400 {
34403 }
34404 }
34405 }
34409 {
34419 else
34424 {
34425 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34426 opcode. */
34431 }
34435 {
34438 }
34439 else
34440 {
34446 }
34449 }
34451 restart:
34455 {
34462 /* FALLTHROUGH */
34472 /* FALLTHROUGH */
34487 /* Undo effects of boolean_increment for post {in,de}crement. */
34489 /* FALLTHRU */
34493 {
34494 /* Undo effects of boolean_increment. */
34496 {
34497 /* This is pre or post increment. */
34502 && !structured_block
34506 }
34507 }
34508 /* FALLTHRU */
34511 {
34546 {
34550 }
34553 {
34559 {
34564 }
34566 {
34578 {
34580 {
34585 }
34586 else
34588 }
34592 }
34595 {
34602 }
34606 }
34610 {
34613 {
34621 }
34623 {
34628 }
34663 }
34674 /* FALLTHROUGH */
34679 }
34686 }
34687 stmt_done:
34689 {
34700 }
34702 {
34705 }
34706 done:
34712 saw_error:
34715 {
34719 {
34723 }
34724 }
34725 }
34728 /* OpenMP 2.5:
34729 # pragma omp barrier new-line */
34731 static void
34733 {
34736 }
34738 /* OpenMP 2.5:
34739 # pragma omp critical [(name)] new-line
34740 structured-block
34742 OpenMP 4.5:
34743 # pragma omp critical [(name) [hint(expression)]] new-line
34744 structured-block */
34746 #define OMP_CRITICAL_CLAUSE_MASK \
34747 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34749 static tree
34751 {
34755 {
34756 matching_parens parens;
34770 OMP_CRITICAL_CLAUSE_MASK,
34772 }
34773 else
34778 }
34780 /* OpenMP 2.5:
34781 # pragma omp flush flush-vars[opt] new-line
34783 flush-vars:
34784 ( variable-list ) */
34786 static void
34788 {
34794 }
34796 /* Helper function, to parse omp for increment expression. */
34798 static tree
34800 {
34805 {
34808 }
34811 {
34818 /* Fall through: OpenMP disallows NE_EXPR. */
34822 }
34824 /* If decl is an iterator, preserve LHS and RHS of the relational
34825 expr until finish_omp_for. */
34836 }
34838 /* Helper function, to parse omp for increment expression. */
34840 static tree
34842 {
34846 cp_id_kind idk;
34850 {
34859 }
34868 {
34873 }
34880 {
34884 }
34897 do
34898 {
34905 {
34907 {
34910 else
34912 tf_warning_or_error);
34913 }
34914 else
34917 }
34918 }
34922 {
34928 }
34929 else
34933 }
34935 /* Parse the initialization statement of an OpenMP for loop.
34937 Return true if the resulting construct should have an
34938 OMP_CLAUSE_PRIVATE added to it. */
34940 static tree
34948 {
34954 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34956 init-expr:
34957 var = lb
34958 integer-type var = lb
34959 random-access-iterator-type var = lb
34960 pointer-type var = lb
34961 */
34962 cp_decl_specifier_seq type_specifiers;
34964 /* First, try to parse as an initialized declaration. See
34965 cp_parser_condition, from whence the bulk of this is copied. */
34972 {
34973 /* If parsing a type specifier seq succeeded, then this
34974 MUST be a initialized declaration. */
34979 CP_PARSER_DECLARATOR_NAMED,
34990 else
34991 {
35001 {
35003 CPP_OPEN_PAREN))
35006 else
35007 /* Trigger an error. */
35012 }
35016 {
35024 {
35027 auto_node);
35032 }
35035 asm_specification,
35036 LOOKUP_ONLYCONVERTING);
35039 {
35042 }
35043 else
35044 {
35047 {
35049 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
35051 {
35055 {
35059 }
35061 }
35063 {
35068 }
35069 }
35070 }
35072 }
35073 else
35074 {
35075 /* Consume '='. */
35079 non_class:
35082 else
35085 asm_specification,
35086 LOOKUP_ONLYCONVERTING);
35087 }
35091 }
35092 }
35093 else
35094 {
35095 cp_id_kind idk;
35096 /* If parsing a type specifier sequence failed, then
35097 this MUST be a simple expression. */
35103 && decl
35106 {
35117 {
35122 }
35127 }
35129 && decl
35132 {
35133 tree rhs;
35141 rhs,
35142 tf_warning_or_error));
35145 }
35146 else
35147 {
35152 {
35156 }
35157 }
35158 }
35160 }
35162 /* Parse the restricted form of the for statement allowed by OpenMP. */
35164 static tree
35167 {
35171 location_t loc_first;
35182 {
35185 }
35188 {
35191 }
35194 {
35200 }
35202 {
35205 {
35207 "%<linear%> clause may not be specified together "
35210 }
35211 else
35213 }
35226 {
35229 location_t loc;
35232 {
35236 }
35239 matching_parens parens;
35246 add_private_clause
35252 {
35255 {
35261 }
35262 else
35264 }
35271 {
35276 {
35280 }
35283 {
35284 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35288 {
35291 }
35292 else
35293 {
35296 }
35298 }
35299 else
35300 {
35305 }
35306 }
35309 {
35310 tree c;
35312 {
35321 decl);
35325 decl);
35326 }
35328 {
35333 else
35338 {
35341 /* For linear, signal that we need to fill up
35342 the so far unknown linear step. */
35345 }
35346 }
35347 }
35356 {
35357 /* If decl is an iterator, preserve the operator on decl
35358 until finish_omp_for. */
35360 && ((processing_template_decl
35365 else
35369 }
35381 {
35384 }
35389 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35390 in between the collapsed for loops to be still considered perfectly
35391 nested. Hopefully the final version clarifies this.
35392 For now handle (multiple) {'s and empty statements. */
35395 {
35399 {
35401 bracecount++;
35402 }
35406 else
35407 {
35414 }
35415 }
35418 {
35421 }
35422 }
35427 /* Note that we saved the original contents of this flag when we entered
35428 the structured block, and so we don't need to re-save it here. */
35431 /* Note that the grammar doesn't call for a structured block here,
35432 though the loop as a whole is a structured block. */
35439 else
35444 {
35446 {
35448 nbraces--;
35449 }
35452 else
35453 {
35455 {
35458 }
35463 }
35464 }
35467 {
35471 else
35473 }
35477 }
35479 /* Helper function for OpenMP parsing, split clauses and call
35480 finish_omp_clauses on each of the set of clauses afterwards. */
35482 static void
35485 {
35491 }
35493 /* OpenMP 4.0:
35494 #pragma omp simd simd-clause[optseq] new-line
35495 for-loop */
35497 #define OMP_SIMD_CLAUSE_MASK \
35498 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35499 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35500 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35501 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35502 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35505 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35507 static tree
35511 {
35522 {
35526 OMP_CLAUSE_ORDERED);
35528 {
35530 "%<ordered%> clause with parameter may not be specified "
35533 }
35534 }
35545 }
35547 /* OpenMP 2.5:
35548 #pragma omp for for-clause[optseq] new-line
35549 for-loop
35551 OpenMP 4.0:
35552 #pragma omp for simd for-simd-clause[optseq] new-line
35553 for-loop */
35555 #define OMP_FOR_CLAUSE_MASK \
35556 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35557 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35558 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35563 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35566 static tree
35570 {
35577 /* parallel for{, simd} disallows nowait clause, but for
35578 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35581 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35586 {
35591 {
35615 }
35616 }
35618 {
35621 }
35623 /* Composite distribute parallel for disallows linear clause. */
35630 {
35633 }
35644 }
35646 /* OpenMP 2.5:
35647 # pragma omp master new-line
35648 structured-block */
35650 static tree
35652 {
35656 }
35658 /* OpenMP 2.5:
35659 # pragma omp ordered new-line
35660 structured-block
35662 OpenMP 4.5:
35663 # pragma omp ordered ordered-clauses new-line
35664 structured-block */
35666 #define OMP_ORDERED_CLAUSE_MASK \
35667 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35668 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35670 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35671 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35673 static bool
35676 {
35680 {
35685 {
35687 {
35690 }
35692 {
35694 "%<depend%> clause may only be used in compound "
35698 }
35699 tree clauses
35701 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35705 }
35706 }
35708 tree clauses
35719 }
35721 /* OpenMP 2.5:
35723 section-scope:
35724 { section-sequence }
35726 section-sequence:
35727 section-directive[opt] structured-block
35728 section-sequence section-directive structured-block */
35730 static tree
35732 {
35737 matching_braces braces;
35745 {
35749 }
35752 {
35760 {
35764 }
35766 {
35769 }
35774 }
35785 }
35787 /* OpenMP 2.5:
35788 # pragma omp sections sections-clause[optseq] newline
35789 sections-scope */
35791 #define OMP_SECTIONS_CLAUSE_MASK \
35792 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35793 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35798 static tree
35801 {
35813 {
35816 }
35823 }
35825 /* OpenMP 2.5:
35826 # pragma omp parallel parallel-clause[optseq] new-line
35827 structured-block
35828 # pragma omp parallel for parallel-for-clause[optseq] new-line
35829 structured-block
35830 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35831 structured-block
35833 OpenMP 4.0:
35834 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35835 structured-block */
35837 #define OMP_PARALLEL_CLAUSE_MASK \
35838 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35848 static tree
35852 {
35859 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35865 {
35873 if_p);
35877 if_p);
35880 block);
35885 }
35886 /* When combined with distribute, parallel has to be followed by for.
35887 #pragma omp target parallel is allowed though. */
35891 {
35895 }
35897 {
35900 }
35902 {
35906 {
35916 block);
35919 }
35920 }
35925 {
35928 }
35936 }
35938 /* OpenMP 2.5:
35939 # pragma omp single single-clause[optseq] new-line
35940 structured-block */
35942 #define OMP_SINGLE_CLAUSE_MASK \
35943 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35944 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35945 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35946 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35948 static tree
35950 {
35960 }
35962 /* OpenMP 3.0:
35963 # pragma omp task task-clause[optseq] new-line
35964 structured-block */
35966 #define OMP_TASK_CLAUSE_MASK \
35967 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35976 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35978 static tree
35980 {
35991 }
35993 /* OpenMP 3.0:
35994 # pragma omp taskwait new-line */
35996 static void
35998 {
36001 }
36003 /* OpenMP 3.1:
36004 # pragma omp taskyield new-line */
36006 static void
36008 {
36011 }
36013 /* OpenMP 4.0:
36014 # pragma omp taskgroup new-line
36015 structured-block */
36017 static tree
36019 {
36023 if_p));
36024 }
36027 /* OpenMP 2.5:
36028 # pragma omp threadprivate (variable-list) */
36030 static void
36032 {
36033 tree vars;
36039 }
36041 /* OpenMP 4.0:
36042 # pragma omp cancel cancel-clause[optseq] new-line */
36044 #define OMP_CANCEL_CLAUSE_MASK \
36045 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
36046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
36047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
36048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
36049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
36051 static void
36053 {
36057 }
36059 /* OpenMP 4.0:
36060 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
36062 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
36063 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
36064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
36065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
36066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
36068 static void
36071 {
36072 tree clauses;
36076 {
36081 {
36084 }
36085 }
36087 {
36091 }
36094 {
36099 else
36103 }
36106 OMP_CANCELLATION_POINT_CLAUSE_MASK,
36108 pragma_tok);
36110 }
36112 /* OpenMP 4.0:
36113 #pragma omp distribute distribute-clause[optseq] new-line
36114 for-loop */
36116 #define OMP_DISTRIBUTE_CLAUSE_MASK \
36117 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36118 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
36121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36123 static tree
36127 {
36136 {
36144 else
36147 {
36153 {
36157 else
36160 }
36166 else
36180 }
36181 }
36183 {
36186 }
36191 {
36194 }
36205 }
36207 /* OpenMP 4.0:
36208 # pragma omp teams teams-clause[optseq] new-line
36209 structured-block */
36211 #define OMP_TEAMS_CLAUSE_MASK \
36212 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36213 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36216 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36217 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36220 static tree
36224 {
36233 {
36237 {
36262 }
36263 }
36265 {
36268 }
36273 {
36276 }
36285 }
36287 /* OpenMP 4.0:
36288 # pragma omp target data target-data-clause[optseq] new-line
36289 structured-block */
36291 #define OMP_TARGET_DATA_CLAUSE_MASK \
36292 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36293 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36297 static tree
36299 {
36300 tree clauses
36305 {
36308 {
36325 "%<#pragma omp target data%> with map-type other "
36326 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36330 }
36332 }
36335 {
36338 "%<#pragma omp target data%> must contain at least "
36341 }
36352 }
36354 /* OpenMP 4.5:
36355 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36356 structured-block */
36358 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36359 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36362 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36363 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36365 static tree
36368 {
36371 {
36376 {
36379 }
36380 }
36382 {
36386 }
36389 {
36395 }
36397 tree clauses
36402 {
36405 {
36418 "%<#pragma omp target enter data%> with map-type other "
36422 }
36424 }
36427 {
36430 "%<#pragma omp target enter data%> must contain at least "
36433 }
36440 }
36442 /* OpenMP 4.5:
36443 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36444 structured-block */
36446 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36447 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36448 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36449 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36450 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36451 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36453 static tree
36456 {
36459 {
36464 {
36467 }
36468 }
36470 {
36474 }
36477 {
36483 }
36485 tree clauses
36490 {
36493 {
36507 "%<#pragma omp target exit data%> with map-type other "
36508 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36512 }
36514 }
36517 {
36520 "%<#pragma omp target exit data%> must contain at least "
36523 }
36530 }
36532 /* OpenMP 4.0:
36533 # pragma omp target update target-update-clause[optseq] new-line */
36535 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36536 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36543 static bool
36546 {
36548 {
36554 }
36556 tree clauses
36561 {
36563 "%<#pragma omp target update%> must contain at least one "
36566 }
36574 }
36576 /* OpenMP 4.0:
36577 # pragma omp target target-clause[optseq] new-line
36578 structured-block */
36580 #define OMP_TARGET_CLAUSE_MASK \
36581 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36582 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36583 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36584 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36585 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36591 static bool
36594 {
36598 {
36610 {
36618 {
36619 tree stmt;
36621 {
36624 OMP_TARGET_CLAUSE_MASK,
36629 OMP_TARGET_CLAUSE_MASK,
36634 OMP_TARGET_CLAUSE_MASK,
36639 }
36641 }
36646 {
36650 if_p);
36655 if_p);
36660 if_p);
36664 }
36670 {
36671 /* For combined target teams, ensure the num_teams and
36672 thread_limit clause expressions are evaluated on the host,
36673 before entering the target construct. */
36674 tree c;
36680 {
36689 OMP_CLAUSE_FIRSTPRIVATE);
36694 }
36695 }
36705 }
36707 {
36710 }
36712 {
36716 }
36718 {
36722 }
36724 {
36728 }
36730 {
36733 }
36734 }
36736 {
36739 }
36754 check_clauses:
36756 {
36759 {
36773 "%<#pragma omp target%> with map-type other "
36774 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36778 }
36780 }
36782 }
36784 /* OpenACC 2.0:
36785 # pragma acc cache (variable-list) new-line
36786 */
36788 static tree
36790 {
36805 }
36807 /* OpenACC 2.0:
36808 # pragma acc data oacc-data-clause[optseq] new-line
36809 structured-block */
36811 #define OACC_DATA_CLAUSE_MASK \
36812 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
36820 static tree
36822 {
36835 }
36837 /* OpenACC 2.0:
36838 # pragma acc host_data <clauses> new-line
36839 structured-block */
36841 #define OACC_HOST_DATA_CLAUSE_MASK \
36842 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36844 static tree
36846 {
36859 }
36861 /* OpenACC 2.0:
36862 # pragma acc declare oacc-data-clause[optseq] new-line
36863 */
36865 #define OACC_DECLARE_CLAUSE_MASK \
36866 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36870 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36873 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
36875 static tree
36877 {
36886 {
36890 }
36893 {
36897 {
36901 }
36904 {
36916 {
36918 "%qD must be a global variable in "
36920 decl);
36923 }
36928 {
36932 }
36934 {
36936 "invalid use of %<extern%> variable %qD "
36940 }
36942 {
36944 "invalid use of %<global%> variable %qD "
36948 }
36950 }
36955 {
36960 }
36963 {
36964 tree id;
36968 else
36974 {
36977 {
36980 {
36984 }
36985 }
36986 }
36987 }
36988 }
37001 }
37003 /* OpenACC 2.0:
37004 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
37006 or
37008 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
37010 LOC is the location of the #pragma token.
37011 */
37013 #define OACC_ENTER_DATA_CLAUSE_MASK \
37014 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37015 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37020 #define OACC_EXIT_DATA_CLAUSE_MASK \
37021 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37022 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37023 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37024 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
37025 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
37026 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37028 static tree
37031 {
37040 {
37045 }
37052 else
37057 {
37061 }
37069 }
37071 /* OpenACC 2.0:
37072 # pragma acc loop oacc-loop-clause[optseq] new-line
37073 structured-block */
37075 #define OACC_LOOP_CLAUSE_MASK \
37076 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
37077 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37078 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37079 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37080 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37081 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37082 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
37083 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
37084 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
37085 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
37087 static tree
37090 {
37099 {
37105 }
37114 }
37116 /* OpenACC 2.0:
37117 # pragma acc kernels oacc-kernels-clause[optseq] new-line
37118 structured-block
37120 or
37122 # pragma acc parallel oacc-parallel-clause[optseq] new-line
37123 structured-block
37124 */
37126 #define OACC_KERNELS_CLAUSE_MASK \
37127 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37134 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37135 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37138 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37141 #define OACC_PARALLEL_CLAUSE_MASK \
37142 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37143 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37144 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37145 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37146 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37147 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37148 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
37150 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37151 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37152 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37153 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37154 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37155 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37156 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37157 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37159 static tree
37162 {
37163 omp_clause_mask mask;
37166 {
37179 }
37182 {
37186 {
37189 tree clauses;
37191 if_p);
37193 }
37194 }
37203 }
37205 /* OpenACC 2.0:
37206 # pragma acc update oacc-update-clause[optseq] new-line
37207 */
37209 #define OACC_UPDATE_CLAUSE_MASK \
37210 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37211 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37212 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37213 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
37215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37217 static tree
37219 {
37226 {
37228 "%<#pragma acc update%> must contain at least one "
37231 }
37239 }
37241 /* OpenACC 2.0:
37242 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37244 LOC is the location of the #pragma token.
37245 */
37247 #define OACC_WAIT_CLAUSE_MASK \
37248 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37250 static tree
37252 {
37266 }
37268 /* OpenMP 4.0:
37269 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37271 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37272 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37275 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37276 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37277 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37279 static void
37282 {
37284 cp_omp_declare_simd_data data;
37286 {
37291 /* It is safe to take the address of a local variable; it will only be
37292 used while this scope is live. */
37294 }
37296 /* Store away all pragma tokens. */
37308 {
37312 {
37325 }
37330 "%<#pragma omp declare simd%> not immediately followed by "
37334 }
37335 }
37337 /* Finalize #pragma omp declare simd clauses after direct declarator has
37338 been parsed, and put that into "omp declare simd" attribute. */
37340 static tree
37342 {
37348 {
37352 }
37357 {
37375 }
37379 }
37382 /* OpenMP 4.0:
37383 # pragma omp declare target new-line
37384 declarations and definitions
37385 # pragma omp end declare target new-line
37387 OpenMP 4.5:
37388 # pragma omp declare target ( extended-list ) new-line
37390 # pragma omp declare target declare-target-clauses[seq] new-line */
37392 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37393 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37396 static void
37398 {
37401 clauses
37405 {
37407 clauses);
37410 }
37411 else
37412 {
37416 }
37419 "%<#pragma omp declare target%> with clauses in between "
37420 "%<#pragma omp declare target%> without clauses and "
37423 {
37429 {
37432 }
37433 else
37436 {
37438 "%qD specified both in declare target %<link%> and %<to%>"
37441 }
37443 {
37450 {
37453 {
37457 }
37458 }
37459 }
37460 }
37461 }
37463 static void
37465 {
37468 {
37471 }
37473 {
37477 {
37480 }
37483 else
37484 {
37488 }
37489 }
37490 else
37491 {
37495 }
37499 "%<#pragma omp end declare target%> without corresponding "
37501 else
37503 }
37505 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37506 expression and optional initializer clause of
37507 #pragma omp declare reduction. We store the expression(s) as
37508 either 3, 6 or 7 special statements inside of the artificial function's
37509 body. The first two statements are DECL_EXPRs for the artificial
37510 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37511 expression that uses those variables.
37512 If there was any INITIALIZER clause, this is followed by further statements,
37513 the fourth and fifth statements are DECL_EXPRs for the artificial
37514 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37515 constructor variant (first token after open paren is not omp_priv),
37516 then the sixth statement is a statement with the function call expression
37517 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37518 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37519 to initialize the OMP_PRIV artificial variable and there is seventh
37520 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37522 static bool
37524 {
37536 tree combiner;
37551 {
37554 }
37557 {
37559 matching_parens parens;
37565 {
37568 }
37584 {
37588 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37592 == CPP_CLOSE_PAREN
37595 {
37599 }
37604 }
37605 else
37606 {
37622 {
37627 }
37629 tree arg;
37642 }
37653 }
37657 UNKNOWN_LOCATION);
37660 }
37662 /* OpenMP 4.0
37663 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37664 initializer-clause[opt] new-line
37666 initializer-clause:
37667 initializer (omp_priv initializer)
37668 initializer (function-name (argument-list)) */
37670 static void
37673 {
37683 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37690 {
37722 }
37734 /* Types may not be defined in declare reduction type list. */
37737 parser->type_definition_forbidden_message
37743 saved_colon_doesnt_start_class_def_p
37748 {
37752 ;
37771 else
37776 else
37778 }
37780 /* Restore the saved message. */
37783 parser->colon_doesnt_start_class_def_p
37788 {
37789 fail:
37792 }
37798 {
37799 tree fntype
37802 NULL_TREE);
37822 {
37827 }
37829 {
37831 {
37840 }
37847 }
37848 else
37849 {
37852 }
37855 else
37858 {
37861 }
37863 {
37866 else
37871 }
37876 else
37877 {
37886 }
37893 }
37897 done:
37898 /* Free any declarators allocated. */
37900 }
37902 /* OpenMP 4.0
37903 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37904 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37905 initializer-clause[opt] new-line
37906 #pragma omp declare target new-line */
37908 static bool
37911 {
37913 {
37918 {
37921 context);
37923 }
37926 {
37929 context);
37931 }
37933 {
37936 }
37938 {
37942 }
37943 }
37948 }
37950 /* OpenMP 4.5:
37951 #pragma omp taskloop taskloop-clause[optseq] new-line
37952 for-loop
37954 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37955 for-loop */
37957 #define OMP_TASKLOOP_CLAUSE_MASK \
37958 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37973 static tree
37977 {
37986 {
37991 {
38015 }
38016 }
38018 {
38021 }
38026 {
38029 }
38035 if_p);
38041 }
38044 /* OpenACC 2.0:
38045 # pragma acc routine oacc-routine-clause[optseq] new-line
38046 function-definition
38048 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
38049 */
38051 #define OACC_ROUTINE_CLAUSE_MASK \
38052 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
38053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
38054 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
38055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
38058 /* Parse the OpenACC routine pragma. This has an optional '( name )'
38059 component, which must resolve to a declared namespace-scope
38060 function. The clauses are either processed directly (for a named
38061 function), or defered until the immediatley following declaration
38062 is parsed. */
38064 static void
38067 {
38069 /* The checking for "another pragma following this one" in the "no optional
38070 '( name )'" case makes sure that we dont re-enter. */
38073 cp_oacc_routine_data data;
38079 /* It is safe to take the address of a local variable; it will only be
38080 used while this scope is live. */
38083 /* Look for optional '( name )'. */
38085 {
38086 matching_parens parens;
38089 /* We parse the name as an id-expression. If it resolves to
38090 anything other than a non-overloaded function at namespace
38091 scope, it's an error. */
38107 {
38111 }
38113 data.clauses
38121 {
38126 }
38128 /* Perhaps we should use the same rule as declarations in different
38129 namespaces? */
38131 {
38136 }
38139 {
38143 }
38147 }
38149 {
38150 /* Store away all pragma tokens. */
38161 /* Emit a helpful diagnostic if there's another pragma following this
38162 one. */
38164 {
38167 /* ..., and then just keep going. */
38169 }
38171 /* We only have to consider the pragma_external case here. */
38176 else
38179 }
38180 }
38182 /* Finalize #pragma acc routine clauses after direct declarator has
38183 been parsed. */
38185 static tree
38187 {
38192 {
38194 "%<#pragma acc routine%> not immediately followed by "
38197 }
38214 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38215 fndecl_seen. */
38218 }
38220 /* Apply any saved OpenACC routine clauses to a just-parsed
38221 declaration. */
38223 static void
38225 {
38227 {
38228 /* Keep going if we're in error reporting mode. */
38234 {
38236 "%<#pragma acc routine%> not immediately followed by"
38240 }
38242 {
38245 }
38248 {
38253 }
38256 {
38264 }
38266 /* Process the routine's dimension clauses. */
38270 /* Add an "omp declare target" attribute. */
38275 /* Don't unset parser->oacc_routine here: we may still need it to
38276 diagnose wrong usage. But, remember that we've used this "#pragma acc
38277 routine". */
38279 }
38280 }
38282 /* Main entry point to OpenMP statement pragmas. */
38284 static void
38286 {
38287 tree stmt;
38292 {
38315 if_p);
38320 if_p);
38337 if_p);
38342 if_p);
38350 if_p);
38359 if_p);
38373 if_p);
38378 if_p);
38382 }
38385 }
38386 \f
38387 /* Transactional Memory parsing routines. */
38389 /* Parse a transaction attribute.
38391 txn-attribute:
38392 attribute
38393 [ [ identifier ] ]
38395 We use this instead of cp_parser_attributes_opt for transactions to avoid
38396 the pedwarn in C++98 mode. */
38398 static tree
38400 {
38415 {
38419 /* For keywords, use the canonical spelling,
38420 not the parsed identifier. */
38424 }
38425 else
38429 error1:
38432 }
38434 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38436 transaction-statement:
38437 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38438 compound-statement
38439 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38440 */
38442 static tree
38444 {
38455 else
38456 {
38460 }
38462 /* Parse a noexcept specification. */
38466 {
38467 /* cancel-and-throw is unimplemented. */
38470 }
38471 else
38474 /* Keep track if we're in the lexical scope of an outer transaction. */
38486 }
38488 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38490 transaction-expression:
38491 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38492 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38493 */
38495 static tree
38497 {
38510 keyword == RID_TRANSACTION_RELAXED
38524 /* Set this early. This might mean that we allow transaction_cancel in
38525 an expression that we find out later actually has to be a constexpr.
38526 However, we expect that cxx_constant_value will be able to deal with
38527 this; also, if the noexcept has no constexpr, then what we parse next
38528 really is a transaction's body. */
38531 /* Parse a noexcept specification. */
38537 {
38538 matching_parens parens;
38545 }
38546 else
38547 {
38548 /* The only expression that is available got parsed for the noexcept
38549 already. noexcept is true then. */
38552 }
38561 }
38563 /* Parse a function-transaction-block.
38565 function-transaction-block:
38566 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38567 function-body
38568 __transaction_atomic txn-attribute[opt] function-try-block
38569 __transaction_relaxed ctor-initializer[opt] function-body
38570 __transaction_relaxed function-try-block
38571 */
38573 static void
38575 {
38590 else
38591 {
38595 }
38603 else
38604 cp_parser_ctor_initializer_opt_and_function_body
38610 }
38612 /* Parse a __transaction_cancel statement.
38614 cancel-statement:
38615 __transaction_cancel txn-attribute[opt] ;
38616 __transaction_cancel txn-attribute[opt] throw-expression ;
38618 ??? Cancel and throw is not yet implemented. */
38620 static tree
38622 {
38628 RT_TRANSACTION_CANCEL);
38635 /* ??? Parse cancel-and-throw here. */
38640 {
38644 }
38646 {
38650 }
38652 {
38655 {
38661 }
38662 }
38664 {
38668 }
38674 }
38675 \f
38676 /* The parser. */
38680 \f
38681 /* Special handling for the first token or line in the file. The first
38682 thing in the file might be #pragma GCC pch_preprocess, which loads a
38683 PCH file, which is a GC collection point. So we need to handle this
38684 first pragma without benefit of an existing lexer structure.
38686 Always returns one token to the caller in *FIRST_TOKEN. This is
38687 either the true first token of the file, or the first token after
38688 the initial pragma. */
38690 static void
38692 {
38701 {
38708 }
38709 else
38712 /* Skip to the end of the pragma. */
38716 /* Now actually load the PCH file. */
38720 /* Read one more token to return to our caller. We have to do this
38721 after reading the PCH file in, since its pointers have to be
38722 live. */
38724 }
38726 /* Parse a pragma GCC ivdep. */
38728 static bool
38730 {
38733 }
38735 /* Parse a pragma GCC unroll. */
38737 static unsigned short
38739 {
38749 {
38751 " assignment-expression that evaluates to a non-negative"
38754 }
38755 else
38756 {
38760 }
38763 }
38765 /* Normal parsing of a pragma token. Here we can (and must) use the
38766 regular lexer. */
38768 static bool
38770 {
38773 tree stmt;
38784 {
38792 {
38802 }
38807 {
38817 }
38822 {
38833 }
38838 {
38849 }
38854 {
38865 }
38885 {
38890 }
38898 {
38903 }
38911 {
38915 }
38921 {
38926 }
38934 {
38939 }
38994 "%<#pragma omp section%> may only be used in "
38999 {
39001 {
39005 }
39011 {
39015 }
39016 else
39022 {
39025 }
39028 }
39031 {
39033 {
39037 }
39038 const unsigned short unroll
39044 {
39048 }
39049 else
39055 {
39058 }
39061 }
39068 bad_stmt:
39071 }
39075 }
39077 /* The interface the pragma parsers have to the lexer. */
39079 enum cpp_ttype
39081 {
39093 else
39094 {
39098 }
39101 }
39103 \f
39104 /* External interface. */
39106 /* Parse one entire translation unit. */
39108 void
39110 {
39125 }
39127 /* Create an identifier for a generic parameter type (a synthesized
39128 template parameter implied by `auto' or a concept identifier). */
39131 static tree
39133 {
39137 }
39139 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39140 (creating a new template parameter list if necessary). Returns the newly
39141 created template type parm. */
39143 static tree
39145 {
39148 /* Before committing to modifying any scope, if we're in an
39149 implicit template scope, and we're trying to synthesize a
39150 constrained parameter, try to find a previous parameter with
39151 the same name. This is the same-type rule for abbreviated
39152 function templates.
39154 NOTE: We can generate implicit parameters when tentatively
39155 parsing a nested name specifier, only to reject that parse
39156 later. However, matching the same template-id as part of a
39157 direct-declarator should generate an identical template
39158 parameter, so this rule will merge them. */
39160 {
39163 {
39165 {
39168 /* Return the TEMPLATE_PARM_INDEX. */
39171 }
39173 }
39174 }
39176 /* We are either continuing a function template that already contains implicit
39177 template parameters, creating a new fully-implicit function template, or
39178 extending an existing explicit function template with implicit template
39179 parameters. */
39187 {
39191 }
39192 else
39193 {
39194 /* Roll back to the existing template parameter scope (in the case of
39195 extending an explicit function template) or introduce a new template
39196 parameter scope ahead of the function parameter scope (or class scope
39197 in the case of out-of-line member definitions). The function scope is
39198 added back after template parameter synthesis below. */
39203 {
39206 }
39208 {
39209 /* If not defining a class, then any class scope is a scope level in
39210 an out-of-line member definition. In this case simply wind back
39211 beyond the first such scope to inject the template parameter list.
39212 Otherwise wind back to the class being defined. The latter can
39213 occur in class member friend declarations such as:
39215 class A {
39216 void foo (auto);
39217 };
39218 class B {
39219 friend void A::foo (auto);
39220 };
39222 The template parameter list synthesized for the friend declaration
39223 must be injected in the scope of 'B'. This can also occur in
39224 erroneous cases such as:
39226 struct A {
39227 struct B {
39228 void foo (auto);
39229 };
39230 void B::foo (auto) {}
39231 };
39233 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39234 but, nevertheless, the template parameter list synthesized for the
39235 declarator should be injected into the scope of 'A' as if the
39236 ill-formed template was specified explicitly. */
39239 {
39242 }
39243 }
39249 {
39250 /* Introduce a new template parameter list for implicit template
39251 parameters. */
39255 parser->implicit_template_scope
39262 }
39263 else
39264 {
39265 /* Synthesize implicit template parameters at the end of the explicit
39266 template parameter list. */
39273 parser->implicit_template_parms
39275 }
39276 }
39278 /* Synthesize a new template parameter and track the current template
39279 parameter chain with implicit_template_parms. */
39283 tree synth_tmpl_parm;
39287 synth_tmpl_parm
39290 synth_tmpl_parm
39292 else
39293 {
39297 }
39299 // Attach the constraint to the parm before processing.
39302 tree new_parm
39304 input_location,
39305 node,
39309 // Chain the new parameter to the list of implicit parameters.
39311 parser->implicit_template_parms
39313 else
39318 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39321 /* If creating a fully implicit function template, start the new implicit
39322 template parameter list with this synthesized type, otherwise grow the
39323 current template parameter list. */
39326 {
39333 }
39334 else
39335 {
39340 }
39342 // If the new parameter was constrained, we need to add that to the
39343 // constraints in the template parameter list.
39345 {
39349 }
39354 }
39356 /* Finish the declaration of a fully implicit function template. Such a
39357 template has no explicit template parameter list so has not been through the
39358 normal template head and tail processing. synthesize_implicit_template_parm
39359 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39360 provided if the declaration is a class member such that its template
39361 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39362 form is returned. Otherwise NULL_TREE is returned. */
39364 static tree
39366 {
39371 {
39375 }
39387 }
39389 /* Like finish_fully_implicit_template, but to be used in error
39390 recovery, rearranging scopes so that we restore the state we had
39391 before synthesize_implicit_template_parm inserted the implement
39392 template parms scope. */
39394 static void
39396 {
39401 {
39410 }
39411 else
39417 }
39419 /* Helper function for diagnostics that have complained about things
39420 being used with 'extern "C"' linkage.
39422 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39424 void
39426 {
39430 }