| blob | db0f0338179ea1d20a574be11bead07f46650f13 |
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
49 \f
50 /* The lexer. */
52 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
53 and c-lex.c) and the C++ parser. */
56 {
58 };
60 /* The various kinds of non integral constant we encounter. */
62 NIC_NONE,
63 /* floating-point literal */
64 NIC_FLOAT,
65 /* %<this%> */
66 NIC_THIS,
67 /* %<__FUNCTION__%> */
68 NIC_FUNC_NAME,
69 /* %<__PRETTY_FUNCTION__%> */
70 NIC_PRETTY_FUNC,
71 /* %<__func__%> */
72 NIC_C99_FUNC,
73 /* "%<va_arg%> */
74 NIC_VA_ARG,
75 /* a cast */
76 NIC_CAST,
77 /* %<typeid%> operator */
78 NIC_TYPEID,
79 /* non-constant compound literals */
80 NIC_NCC,
81 /* a function call */
82 NIC_FUNC_CALL,
83 /* an increment */
84 NIC_INC,
85 /* an decrement */
86 NIC_DEC,
87 /* an array reference */
88 NIC_ARRAY_REF,
89 /* %<->%> */
90 NIC_ARROW,
91 /* %<.%> */
92 NIC_POINT,
93 /* the address of a label */
94 NIC_ADDR_LABEL,
95 /* %<*%> */
96 NIC_STAR,
97 /* %<&%> */
98 NIC_ADDR,
99 /* %<++%> */
100 NIC_PREINCREMENT,
101 /* %<--%> */
102 NIC_PREDECREMENT,
103 /* %<new%> */
104 NIC_NEW,
105 /* %<delete%> */
106 NIC_DEL,
107 /* calls to overloaded operators */
108 NIC_OVERLOADED,
109 /* an assignment */
110 NIC_ASSIGNMENT,
111 /* a comma operator */
112 NIC_COMMA,
113 /* a call to a constructor */
114 NIC_CONSTRUCTOR,
115 /* a transaction expression */
116 NIC_TRANSACTION
117 };
119 /* The various kinds of errors about name-lookup failing. */
121 /* NULL */
122 NLE_NULL,
123 /* is not a type */
124 NLE_TYPE,
125 /* is not a class or namespace */
126 NLE_CXX98,
127 /* is not a class, namespace, or enumeration */
128 NLE_NOT_CXX98
129 };
131 /* The various kinds of required token */
133 RT_NONE,
155 /* The type is CPP_KEYWORD */
184 RT_TRANSACTION_CANCEL /* __transaction_cancel */
185 };
187 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
188 reverting it on destruction. */
190 class type_id_in_expr_sentinel
191 {
201 };
203 /* Prototypes. */
209 static void cp_lexer_destroy
211 static int cp_lexer_saving_tokens
215 static void cp_lexer_get_preprocessor_token
223 static bool cp_lexer_next_token_is_not
225 static bool cp_lexer_next_token_is_keyword
229 static void cp_lexer_purge_token
231 static void cp_lexer_purge_tokens_after
233 static void cp_lexer_save_tokens
235 static void cp_lexer_commit_tokens
237 static void cp_lexer_rollback_tokens
239 static void cp_lexer_print_token
243 static void cp_lexer_start_debugging
245 static void cp_lexer_stop_debugging
251 static void cp_parser_initial_pragma
254 static bool cp_parser_omp_declare_reduction_exprs
256 static void cp_finalize_oacc_routine
259 /* Manifest constants. */
260 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
261 #define CP_SAVED_TOKEN_STACK 5
263 /* Variables. */
265 /* The stream to which debugging output should be written. */
268 /* Nonzero if we are parsing an unevaluated operand: an operand to
269 sizeof, typeof, or alignof. */
272 /* Dump up to NUM tokens in BUFFER to FILE starting with token
273 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
274 first token in BUFFER. If NUM is 0, dump all the tokens. If
275 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
276 highlighted by surrounding it in [[ ]]. */
278 static void
282 {
299 {
302 }
307 {
314 nprinted++;
324 {
334 }
335 }
338 {
341 }
344 }
347 /* Dump all tokens in BUFFER to stderr. */
349 void
351 {
353 }
355 DEBUG_FUNCTION void
357 {
359 }
361 DEBUG_FUNCTION void
363 {
366 else
368 }
371 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
372 description for T. */
374 static void
376 {
378 {
381 }
382 }
385 /* Dump parser context C to FILE. */
387 static void
389 {
394 }
397 /* Print the stack of parsing contexts to FILE starting with FIRST. */
399 static void
401 {
407 {
410 }
411 }
414 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
416 static void
418 {
421 }
424 /* Print an unparsed function entry UF to FILE. */
426 static void
428 {
431 tree fn;
436 i++)
437 {
443 }
448 {
451 }
457 {
460 }
462 }
465 /* Print the stack of unparsed member functions S to FILE. */
467 static void
470 {
476 {
479 }
480 }
483 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
484 the given PARSER. If FILE is NULL, the output is printed on stderr. */
486 static void
488 {
500 next_token);
501 }
504 /* Dump debugging information for the given PARSER. If FILE is NULL,
505 the output is printed on stderr. */
507 void
509 {
512 expanded_location eloc;
586 }
588 DEBUG_FUNCTION void
590 {
592 }
594 DEBUG_FUNCTION void
596 {
599 else
601 }
603 /* Allocate memory for a new lexer object and return it. */
607 {
612 /* Allocate the memory. */
615 /* Initially we are not debugging. */
620 /* Create the buffer. */
624 }
627 /* Create a new main C++ lexer, the lexer that gets tokens from the
628 preprocessor. */
632 {
634 cp_token token;
636 /* It's possible that parsing the first pragma will load a PCH file,
637 which is a GC collection point. So we have to do that before
638 allocating any memory. */
643 /* Put the first token in the buffer. */
646 /* Get the remaining tokens from the preprocessor. */
648 {
651 }
660 /* Subsequent preprocessor diagnostics should use compiler
661 diagnostic functions to get the compiler source location. */
666 }
668 /* Create a new lexer whose token stream is primed with the tokens in
669 CACHE. When these tokens are exhausted, no new tokens will be read. */
673 {
678 /* We do not own the buffer. */
685 /* Initially we are not debugging. */
690 }
692 /* Frees all resources associated with LEXER. */
694 static void
696 {
700 }
702 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
703 be used. The point of this flag is to help the compiler to fold away calls
704 to cp_lexer_debugging_p within this source file at compile time, when the
705 lexer is not being debugged. */
707 #define LEXER_DEBUGGING_ENABLED_P false
709 /* Returns nonzero if debugging information should be output. */
713 {
718 }
723 {
727 }
731 {
733 }
737 {
739 }
743 {
746 else
748 }
752 {
755 /* Skip past purged tokens. */
757 {
759 tp--;
760 }
763 }
765 /* nonzero if we are presently saving tokens. */
769 {
771 }
773 /* Store the next token from the preprocessor in *TOKEN. Return true
774 if we reach EOF. If LEXER is NULL, assume we are handling an
775 initial #pragma pch_preprocess, and thus want the lexer to return
776 processed strings. */
778 static void
780 {
783 /* Get a new token from the preprocessor. */
784 token->type
791 /* On some systems, some header files are surrounded by an
792 implicit extern "C" block. Set a flag in the token if it
793 comes from such a header. */
798 /* Check to see if this token is a keyword. */
800 {
802 {
803 /* Mark this token as a keyword. */
805 /* Record which keyword. */
807 }
808 else
809 {
813 {
814 /* Warn about the C++0x keyword (but still treat it as
815 an identifier). */
820 /* Clear out the C_RID_CODE so we don't warn about this
821 particular identifier-turned-keyword again. */
823 }
826 }
827 }
829 {
830 /* This only happens in Objective-C++; it must be a keyword. */
833 {
834 /* Replace 'class' with '@class', 'private' with '@private',
835 etc. This prevents confusion with the C++ keyword
836 'class', and makes the tokens consistent with other
837 Objective-C 'AT' keywords. For example '@class' is
838 reported as RID_AT_CLASS which is consistent with
839 '@synchronized', which is reported as
840 RID_AT_SYNCHRONIZED.
841 */
851 }
852 }
853 }
855 /* Update the globals input_location and the input file stack from TOKEN. */
858 {
860 {
862 }
863 }
865 /* Update the globals input_location and the input file stack from LEXER. */
868 {
871 }
873 /* Return a pointer to the next token in the token stream, but do not
874 consume it. */
878 {
880 {
884 }
886 }
888 /* Return true if the next token has the indicated TYPE. */
892 {
894 }
896 /* Return true if the next token does not have the indicated TYPE. */
900 {
902 }
904 /* Return true if the next token is the indicated KEYWORD. */
908 {
910 }
914 {
916 }
920 {
922 }
924 /* Return true if KEYWORD can start a decl-specifier. */
926 bool
928 {
930 {
931 /* auto specifier: storage-class-specifier in C++,
932 simple-type-specifier in C++0x. */
934 /* Storage classes. */
940 /* Elaborated type specifiers. */
946 /* Simple type specifiers. */
960 /* GNU extensions. */
963 /* C++0x extensions. */
975 }
976 }
978 /* Return true if the next token is a keyword for a decl-specifier. */
980 static bool
982 {
987 }
989 /* Returns TRUE iff the token T begins a decltype type. */
991 static bool
993 {
996 }
998 /* Returns TRUE iff the next token begins a decltype type. */
1000 static bool
1002 {
1005 }
1007 /* Called when processing a token with tree_check_value; perform or defer the
1008 associated checks and return the value. */
1010 static tree
1012 {
1013 /* Perform any access checks that were deferred. */
1018 {
1024 }
1025 /* Return the stored value. */
1027 }
1029 /* Return a pointer to the Nth token in the token stream. If N is 1,
1030 then this is precisely equivalent to cp_lexer_peek_token (except
1031 that it is not inline). One would like to disallow that case, but
1032 there is one case (cp_parser_nth_token_starts_template_id) where
1033 the caller passes a variable for N and it might be 1. */
1037 {
1040 /* N is 1-based, not zero-based. */
1051 {
1054 {
1057 }
1061 }
1064 {
1067 }
1070 }
1072 /* Return the next token, and advance the lexer's next_token pointer
1073 to point to the next non-purged token. */
1077 {
1083 do
1084 {
1087 {
1090 }
1092 }
1097 /* Provide debugging output. */
1099 {
1103 }
1106 }
1108 /* Permanently remove the next token from the token stream, and
1109 advance the next_token pointer to refer to the next non-purged
1110 token. */
1112 static void
1114 {
1123 do
1124 {
1125 tok++;
1127 {
1130 }
1131 }
1134 }
1136 /* Permanently remove all tokens after TOK, up to, but not
1137 including, the token that will be returned next by
1138 cp_lexer_peek_token. */
1140 static void
1142 {
1151 {
1156 }
1157 }
1159 /* Begin saving tokens. All tokens consumed after this point will be
1160 preserved. */
1162 static void
1164 {
1165 /* Provide debugging output. */
1170 }
1172 /* Commit to the portion of the token stream most recently saved. */
1174 static void
1176 {
1177 /* Provide debugging output. */
1182 }
1184 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1185 to the token stream. Stop saving tokens. */
1187 static void
1189 {
1190 /* Provide debugging output. */
1195 }
1197 /* RAII wrapper around the above functions, with sanity checking. Creating
1198 a variable saves tokens, which are committed when the variable is
1199 destroyed unless they are explicitly rolled back by calling the rollback
1200 member function. */
1202 struct saved_token_sentinel
1203 {
1208 {
1211 }
1213 {
1216 }
1218 {
1222 }
1223 };
1225 /* Print a representation of the TOKEN on the STREAM. */
1227 static void
1229 {
1230 /* We don't use cpp_type2name here because the parser defines
1231 a few tokens of its own. */
1233 /* cpplib-defined token types */
1234 #define OP(e, s) #e,
1235 #define TK(e, s) #e,
1236 TTYPE_TABLE
1237 #undef OP
1238 #undef TK
1239 /* C++ parser token types - see "Manifest constants", above. */
1243 };
1245 /* For some tokens, print the associated data. */
1247 {
1249 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1250 For example, `struct' is mapped to an INTEGER_CST. */
1253 /* fall through */
1271 /* If we have a name for the token, print it out. Otherwise, we
1272 simply give the numeric code. */
1275 else
1278 }
1279 }
1281 DEBUG_FUNCTION void
1283 {
1286 }
1288 DEBUG_FUNCTION void
1290 {
1293 else
1295 }
1298 /* Start emitting debugging information. */
1300 static void
1302 {
1309 }
1311 /* Stop emitting debugging information. */
1313 static void
1315 {
1322 }
1324 /* Create a new cp_token_cache, representing a range of tokens. */
1328 {
1333 }
1335 /* Diagnose if #pragma omp declare simd isn't followed immediately
1336 by function declaration or definition. */
1340 {
1342 {
1346 }
1347 }
1349 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1350 and put that into "omp declare simd" attribute. */
1354 {
1356 {
1358 {
1361 }
1363 {
1366 }
1367 }
1368 }
1370 /* Diagnose if #pragma acc routine isn't followed immediately by function
1371 declaration or definition. */
1375 {
1377 {
1379 "%<#pragma acc routine%> not immediately followed by "
1382 }
1383 }
1384 \f
1385 /* Decl-specifiers. */
1387 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1389 static void
1391 {
1393 }
1395 /* Declarators. */
1397 /* Nothing other than the parser should be creating declarators;
1398 declarators are a semi-syntactic representation of C++ entities.
1399 Other parts of the front end that need to create entities (like
1400 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1403 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1413 /* An erroneous declarator. */
1416 /* The obstack on which declarators and related data structures are
1417 allocated. */
1420 /* Alloc BYTES from the declarator memory pool. */
1424 {
1426 }
1428 /* Allocate a declarator of the indicated KIND. Clear fields that are
1429 common to all declarators. */
1433 {
1446 }
1448 /* Make a declarator for a generalized identifier. If
1449 QUALIFYING_SCOPE is non-NULL, the identifier is
1450 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1451 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1452 is, if any. */
1456 special_function_kind sfk)
1457 {
1460 /* It is valid to write:
1462 class C { void f(); };
1463 typedef C D;
1464 void D::f();
1466 The standard is not clear about whether `typedef const C D' is
1467 legal; as of 2002-09-15 the committee is considering that
1468 question. EDG 3.0 allows that syntax. Therefore, we do as
1469 well. */
1483 }
1485 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1486 of modifiers such as const or volatile to apply to the pointer
1487 type, represented as identifiers. ATTRIBUTES represent the attributes that
1488 appertain to the pointer or reference. */
1490 cp_declarator *
1492 tree attributes)
1493 {
1501 {
1505 }
1506 else
1512 }
1514 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1515 represent the attributes that appertain to the pointer or
1516 reference. */
1518 cp_declarator *
1521 {
1529 {
1533 }
1534 else
1540 }
1542 /* Like make_pointer_declarator -- but for a pointer to a non-static
1543 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1544 appertain to the pointer or reference. */
1546 cp_declarator *
1549 tree attributes)
1550 {
1559 {
1562 }
1563 else
1569 }
1571 /* Make a declarator for the function given by TARGET, with the
1572 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1573 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1574 indicates what exceptions can be thrown. */
1576 cp_declarator *
1578 tree parms,
1579 cp_cv_quals cv_qualifiers,
1580 cp_virt_specifiers virt_specifiers,
1581 cp_ref_qualifier ref_qualifier,
1582 tree tx_qualifier,
1583 tree exception_specification,
1584 tree late_return_type,
1585 tree requires_clause)
1586 {
1600 {
1604 }
1605 else
1609 }
1611 /* Make a declarator for an array of BOUNDS elements, each of which is
1612 defined by ELEMENT. */
1614 cp_declarator *
1616 {
1623 {
1627 }
1628 else
1632 }
1634 /* Determine whether the declarator we've seen so far can be a
1635 parameter pack, when followed by an ellipsis. */
1636 static bool
1638 {
1640 /* We already saw an ellipsis. */
1643 /* Search for a declarator name, or any other declarator that goes
1644 after the point where the ellipsis could appear in a parameter
1645 pack. If we find any of these, then this declarator can not be
1646 made into a parameter pack. */
1649 {
1651 {
1664 }
1665 }
1668 }
1672 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1673 DECLARATOR and DEFAULT_ARGUMENT. */
1675 cp_parameter_declarator *
1678 tree default_argument,
1679 location_t loc,
1681 {
1689 else
1697 }
1699 /* Returns true iff DECLARATOR is a declaration for a function. */
1701 static bool
1703 {
1705 {
1714 }
1716 }
1718 /* The parser. */
1720 /* Overview
1721 --------
1723 A cp_parser parses the token stream as specified by the C++
1724 grammar. Its job is purely parsing, not semantic analysis. For
1725 example, the parser breaks the token stream into declarators,
1726 expressions, statements, and other similar syntactic constructs.
1727 It does not check that the types of the expressions on either side
1728 of an assignment-statement are compatible, or that a function is
1729 not declared with a parameter of type `void'.
1731 The parser invokes routines elsewhere in the compiler to perform
1732 semantic analysis and to build up the abstract syntax tree for the
1733 code processed.
1735 The parser (and the template instantiation code, which is, in a
1736 way, a close relative of parsing) are the only parts of the
1737 compiler that should be calling push_scope and pop_scope, or
1738 related functions. The parser (and template instantiation code)
1739 keeps track of what scope is presently active; everything else
1740 should simply honor that. (The code that generates static
1741 initializers may also need to set the scope, in order to check
1742 access control correctly when emitting the initializers.)
1744 Methodology
1745 -----------
1747 The parser is of the standard recursive-descent variety. Upcoming
1748 tokens in the token stream are examined in order to determine which
1749 production to use when parsing a non-terminal. Some C++ constructs
1750 require arbitrary look ahead to disambiguate. For example, it is
1751 impossible, in the general case, to tell whether a statement is an
1752 expression or declaration without scanning the entire statement.
1753 Therefore, the parser is capable of "parsing tentatively." When the
1754 parser is not sure what construct comes next, it enters this mode.
1755 Then, while we attempt to parse the construct, the parser queues up
1756 error messages, rather than issuing them immediately, and saves the
1757 tokens it consumes. If the construct is parsed successfully, the
1758 parser "commits", i.e., it issues any queued error messages and
1759 the tokens that were being preserved are permanently discarded.
1760 If, however, the construct is not parsed successfully, the parser
1761 rolls back its state completely so that it can resume parsing using
1762 a different alternative.
1764 Future Improvements
1765 -------------------
1767 The performance of the parser could probably be improved substantially.
1768 We could often eliminate the need to parse tentatively by looking ahead
1769 a little bit. In some places, this approach might not entirely eliminate
1770 the need to parse tentatively, but it might still speed up the average
1771 case. */
1773 /* Flags that are passed to some parsing functions. These values can
1774 be bitwise-ored together. */
1776 enum
1777 {
1778 /* No flags. */
1780 /* The construct is optional. If it is not present, then no error
1781 should be issued. */
1783 /* When parsing a type-specifier, treat user-defined type-names
1784 as non-type identifiers. */
1786 /* When parsing a type-specifier, do not try to parse a class-specifier
1787 or enum-specifier. */
1789 /* When parsing a decl-specifier-seq, only allow type-specifier or
1790 constexpr. */
1792 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1794 };
1796 /* This type is used for parameters and variables which hold
1797 combinations of the above flags. */
1800 /* The different kinds of declarators we want to parse. */
1802 enum cp_parser_declarator_kind
1803 {
1804 /* We want an abstract declarator. */
1805 CP_PARSER_DECLARATOR_ABSTRACT,
1806 /* We want a named declarator. */
1807 CP_PARSER_DECLARATOR_NAMED,
1808 /* We don't mind, but the name must be an unqualified-id. */
1809 CP_PARSER_DECLARATOR_EITHER
1810 };
1812 /* The precedence values used to parse binary expressions. The minimum value
1813 of PREC must be 1, because zero is reserved to quickly discriminate
1814 binary operators from other tokens. */
1816 enum cp_parser_prec
1817 {
1818 PREC_NOT_OPERATOR,
1819 PREC_LOGICAL_OR_EXPRESSION,
1820 PREC_LOGICAL_AND_EXPRESSION,
1821 PREC_INCLUSIVE_OR_EXPRESSION,
1822 PREC_EXCLUSIVE_OR_EXPRESSION,
1823 PREC_AND_EXPRESSION,
1824 PREC_EQUALITY_EXPRESSION,
1825 PREC_RELATIONAL_EXPRESSION,
1826 PREC_SHIFT_EXPRESSION,
1827 PREC_ADDITIVE_EXPRESSION,
1828 PREC_MULTIPLICATIVE_EXPRESSION,
1829 PREC_PM_EXPRESSION,
1830 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1831 };
1833 /* A mapping from a token type to a corresponding tree node type, with a
1834 precedence value. */
1836 struct cp_parser_binary_operations_map_node
1837 {
1838 /* The token type. */
1840 /* The corresponding tree code. */
1842 /* The precedence of this operator. */
1844 };
1846 struct cp_parser_expression_stack_entry
1847 {
1848 /* Left hand side of the binary operation we are currently
1849 parsing. */
1850 cp_expr lhs;
1851 /* Original tree code for left hand side, if it was a binary
1852 expression itself (used for -Wparentheses). */
1854 /* Tree code for the binary operation we are parsing. */
1856 /* Precedence of the binary operation we are parsing. */
1858 /* Location of the binary operation we are parsing. */
1859 location_t loc;
1860 };
1862 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1863 entries because precedence levels on the stack are monotonically
1864 increasing. */
1868 /* Prototypes. */
1870 /* Constructors and destructors. */
1875 /* Class variables. */
1879 /* The operator-precedence table used by cp_parser_binary_expression.
1880 Transformed into an associative array (binops_by_token) by
1881 cp_parser_new. */
1914 };
1916 /* The same as binops, but initialized by cp_parser_new so that
1917 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1918 for speed. */
1921 /* Constructors and destructors. */
1923 /* Construct a new context. The context below this one on the stack
1924 is given by NEXT. */
1928 {
1931 /* Allocate the storage. */
1933 {
1934 /* Pull the first entry from the free list. */
1938 }
1939 else
1942 /* No errors have occurred yet in this context. */
1944 /* If this is not the bottommost context, copy information that we
1945 need from the previous context. */
1947 {
1948 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1949 expression, then we are parsing one in this context, too. */
1951 /* Thread the stack. */
1953 }
1956 }
1958 /* Managing the unparsed function queues. */
1960 #define unparsed_funs_with_default_args \
1961 parser->unparsed_queues->last ().funs_with_default_args
1962 #define unparsed_funs_with_definitions \
1963 parser->unparsed_queues->last ().funs_with_definitions
1964 #define unparsed_nsdmis \
1965 parser->unparsed_queues->last ().nsdmis
1966 #define unparsed_classes \
1967 parser->unparsed_queues->last ().classes
1969 static void
1971 {
1974 }
1976 static void
1978 {
1981 }
1983 /* Prototypes. */
1985 /* Constructors and destructors. */
1990 /* Routines to parse various constructs.
1992 Those that return `tree' will return the error_mark_node (rather
1993 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1994 Sometimes, they will return an ordinary node if error-recovery was
1995 attempted, even though a parse error occurred. So, to check
1996 whether or not a parse error occurred, you should always use
1997 cp_parser_error_occurred. If the construct is optional (indicated
1998 either by an `_opt' in the name of the function that does the
1999 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2000 the construct is not present. */
2002 /* Lexical conventions [gram.lex] */
2004 static cp_expr cp_parser_identifier
2006 static cp_expr cp_parser_string_literal
2008 static cp_expr cp_parser_userdef_char_literal
2010 static tree cp_parser_userdef_string_literal
2012 static cp_expr cp_parser_userdef_numeric_literal
2015 /* Basic concepts [gram.basic] */
2019 /* Expressions [gram.expr] */
2021 static cp_expr cp_parser_primary_expression
2023 static cp_expr cp_parser_id_expression
2025 static cp_expr cp_parser_unqualified_id
2027 static tree cp_parser_nested_name_specifier_opt
2029 static tree cp_parser_nested_name_specifier
2031 static tree cp_parser_qualifying_entity
2033 static cp_expr cp_parser_postfix_expression
2035 static tree cp_parser_postfix_open_square_expression
2037 static tree cp_parser_postfix_dot_deref_expression
2042 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2044 static void cp_parser_pseudo_destructor_name
2046 static cp_expr cp_parser_unary_expression
2048 static enum tree_code cp_parser_unary_operator
2050 static tree cp_parser_new_expression
2054 static tree cp_parser_new_type_id
2062 static tree cp_parser_delete_expression
2064 static cp_expr cp_parser_cast_expression
2066 static cp_expr cp_parser_binary_expression
2068 static tree cp_parser_question_colon_clause
2070 static cp_expr cp_parser_assignment_expression
2072 static enum tree_code cp_parser_assignment_operator_opt
2074 static cp_expr cp_parser_expression
2076 static cp_expr cp_parser_constant_expression
2078 static cp_expr cp_parser_builtin_offsetof
2080 static cp_expr cp_parser_lambda_expression
2082 static void cp_parser_lambda_introducer
2084 static bool cp_parser_lambda_declarator_opt
2086 static void cp_parser_lambda_body
2089 /* Statements [gram.stmt.stmt] */
2091 static void cp_parser_statement
2093 static void cp_parser_label_for_labeled_statement
2095 static tree cp_parser_expression_statement
2097 static tree cp_parser_compound_statement
2099 static void cp_parser_statement_seq_opt
2101 static tree cp_parser_selection_statement
2103 static tree cp_parser_condition
2105 static tree cp_parser_iteration_statement
2107 static bool cp_parser_init_statement
2109 static tree cp_parser_for
2111 static tree cp_parser_c_for
2113 static tree cp_parser_range_for
2115 static void do_range_for_auto_deduction
2117 static tree cp_parser_perform_range_for_lookup
2119 static tree cp_parser_range_for_member_function
2121 static tree cp_parser_jump_statement
2123 static void cp_parser_declaration_statement
2126 static tree cp_parser_implicitly_scoped_statement
2128 static void cp_parser_already_scoped_statement
2131 /* Declarations [gram.dcl.dcl] */
2133 static void cp_parser_declaration_seq_opt
2135 static void cp_parser_declaration
2137 static void cp_parser_toplevel_declaration
2139 static void cp_parser_block_declaration
2141 static void cp_parser_simple_declaration
2143 static void cp_parser_decl_specifier_seq
2145 static tree cp_parser_storage_class_specifier_opt
2147 static tree cp_parser_function_specifier_opt
2149 static tree cp_parser_type_specifier
2152 static tree cp_parser_simple_type_specifier
2154 static tree cp_parser_type_name
2156 static tree cp_parser_type_name
2158 static tree cp_parser_nonclass_name
2160 static tree cp_parser_elaborated_type_specifier
2162 static tree cp_parser_enum_specifier
2164 static void cp_parser_enumerator_list
2166 static void cp_parser_enumerator_definition
2168 static tree cp_parser_namespace_name
2170 static void cp_parser_namespace_definition
2172 static void cp_parser_namespace_body
2174 static tree cp_parser_qualified_namespace_specifier
2176 static void cp_parser_namespace_alias_definition
2178 static bool cp_parser_using_declaration
2180 static void cp_parser_using_directive
2182 static tree cp_parser_alias_declaration
2184 static void cp_parser_asm_definition
2186 static void cp_parser_linkage_specification
2188 static void cp_parser_static_assert
2190 static tree cp_parser_decltype
2192 static tree cp_parser_decomposition_declaration
2195 /* Declarators [gram.dcl.decl] */
2197 static tree cp_parser_init_declarator
2204 static enum tree_code cp_parser_ptr_operator
2206 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2208 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2210 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2212 static tree cp_parser_tx_qualifier_opt
2214 static tree cp_parser_late_return_type_opt
2216 static tree cp_parser_declarator_id
2218 static tree cp_parser_type_id
2220 static tree cp_parser_template_type_arg
2223 static tree cp_parser_type_id_1
2225 static void cp_parser_type_specifier_seq
2227 static tree cp_parser_parameter_declaration_clause
2229 static tree cp_parser_parameter_declaration_list
2233 static tree cp_parser_default_argument
2235 static void cp_parser_function_body
2237 static tree cp_parser_initializer
2239 static cp_expr cp_parser_initializer_clause
2241 static cp_expr cp_parser_braced_list
2246 static void cp_parser_ctor_initializer_opt_and_function_body
2249 static tree cp_parser_late_parsing_omp_declare_simd
2252 static tree cp_parser_late_parsing_oacc_routine
2255 static tree synthesize_implicit_template_parm
2257 static tree finish_fully_implicit_template
2259 static void abort_fully_implicit_template
2262 /* Classes [gram.class] */
2264 static tree cp_parser_class_name
2266 static tree cp_parser_class_specifier
2268 static tree cp_parser_class_head
2270 static enum tag_types cp_parser_class_key
2272 static void cp_parser_type_parameter_key
2274 static void cp_parser_member_specification_opt
2276 static void cp_parser_member_declaration
2278 static tree cp_parser_pure_specifier
2280 static tree cp_parser_constant_initializer
2283 /* Derived classes [gram.class.derived] */
2285 static tree cp_parser_base_clause
2287 static tree cp_parser_base_specifier
2290 /* Special member functions [gram.special] */
2292 static tree cp_parser_conversion_function_id
2294 static tree cp_parser_conversion_type_id
2298 static void cp_parser_ctor_initializer_opt
2300 static void cp_parser_mem_initializer_list
2302 static tree cp_parser_mem_initializer
2304 static tree cp_parser_mem_initializer_id
2307 /* Overloading [gram.over] */
2309 static cp_expr cp_parser_operator_function_id
2311 static cp_expr cp_parser_operator
2314 /* Templates [gram.temp] */
2316 static void cp_parser_template_declaration
2318 static tree cp_parser_template_parameter_list
2320 static tree cp_parser_template_parameter
2322 static tree cp_parser_type_parameter
2324 static tree cp_parser_template_id
2326 static tree cp_parser_template_name
2328 static tree cp_parser_template_argument_list
2330 static tree cp_parser_template_argument
2332 static void cp_parser_explicit_instantiation
2334 static void cp_parser_explicit_specialization
2337 /* Exception handling [gram.exception] */
2339 static tree cp_parser_try_block
2341 static void cp_parser_function_try_block
2343 static void cp_parser_handler_seq
2345 static void cp_parser_handler
2347 static tree cp_parser_exception_declaration
2349 static tree cp_parser_throw_expression
2351 static tree cp_parser_exception_specification_opt
2353 static tree cp_parser_type_id_list
2356 /* GNU Extensions */
2358 static tree cp_parser_asm_specification_opt
2360 static tree cp_parser_asm_operand_list
2362 static tree cp_parser_asm_clobber_list
2364 static tree cp_parser_asm_label_list
2366 static bool cp_next_tokens_can_be_attribute_p
2368 static bool cp_next_tokens_can_be_gnu_attribute_p
2370 static bool cp_next_tokens_can_be_std_attribute_p
2372 static bool cp_nth_tokens_can_be_std_attribute_p
2374 static bool cp_nth_tokens_can_be_gnu_attribute_p
2376 static bool cp_nth_tokens_can_be_attribute_p
2378 static tree cp_parser_attributes_opt
2380 static tree cp_parser_gnu_attributes_opt
2382 static tree cp_parser_gnu_attribute_list
2384 static tree cp_parser_std_attribute
2386 static tree cp_parser_std_attribute_spec
2388 static tree cp_parser_std_attribute_spec_seq
2390 static size_t cp_parser_skip_attributes_opt
2392 static bool cp_parser_extension_opt
2394 static void cp_parser_label_declaration
2397 /* Concept Extensions */
2399 static tree cp_parser_requires_clause
2401 static tree cp_parser_requires_clause_opt
2403 static tree cp_parser_requires_expression
2405 static tree cp_parser_requirement_parameter_list
2407 static tree cp_parser_requirement_body
2409 static tree cp_parser_requirement_list
2411 static tree cp_parser_requirement
2413 static tree cp_parser_simple_requirement
2415 static tree cp_parser_compound_requirement
2417 static tree cp_parser_type_requirement
2419 static tree cp_parser_nested_requirement
2422 /* Transactional Memory Extensions */
2424 static tree cp_parser_transaction
2426 static tree cp_parser_transaction_expression
2428 static void cp_parser_function_transaction
2430 static tree cp_parser_transaction_cancel
2434 pragma_external,
2435 pragma_member,
2436 pragma_objc_icode,
2437 pragma_stmt,
2438 pragma_compound
2439 };
2440 static bool cp_parser_pragma
2443 /* Objective-C++ Productions */
2445 static tree cp_parser_objc_message_receiver
2447 static tree cp_parser_objc_message_args
2449 static tree cp_parser_objc_message_expression
2451 static cp_expr cp_parser_objc_encode_expression
2453 static tree cp_parser_objc_defs_expression
2455 static tree cp_parser_objc_protocol_expression
2457 static tree cp_parser_objc_selector_expression
2459 static cp_expr cp_parser_objc_expression
2461 static bool cp_parser_objc_selector_p
2463 static tree cp_parser_objc_selector
2465 static tree cp_parser_objc_protocol_refs_opt
2467 static void cp_parser_objc_declaration
2469 static tree cp_parser_objc_statement
2471 static bool cp_parser_objc_valid_prefix_attributes
2473 static void cp_parser_objc_at_property_declaration
2475 static void cp_parser_objc_at_synthesize_declaration
2477 static void cp_parser_objc_at_dynamic_declaration
2479 static tree cp_parser_objc_struct_declaration
2482 /* Utility Routines */
2484 static cp_expr cp_parser_lookup_name
2486 static tree cp_parser_lookup_name_simple
2488 static tree cp_parser_maybe_treat_template_as_class
2490 static bool cp_parser_check_declarator_template_parameters
2492 static bool cp_parser_check_template_parameters
2494 static cp_expr cp_parser_simple_cast_expression
2496 static tree cp_parser_global_scope_opt
2498 static bool cp_parser_constructor_declarator_p
2500 static tree cp_parser_function_definition_from_specifiers_and_declarator
2502 static tree cp_parser_function_definition_after_declarator
2504 static bool cp_parser_template_declaration_after_export
2506 static void cp_parser_perform_template_parameter_access_checks
2508 static tree cp_parser_single_declaration
2510 static cp_expr cp_parser_functional_cast
2512 static tree cp_parser_save_member_function_body
2514 static tree cp_parser_save_nsdmi
2516 static tree cp_parser_enclosed_template_argument_list
2518 static void cp_parser_save_default_args
2520 static void cp_parser_late_parsing_for_member
2522 static tree cp_parser_late_parse_one_default_arg
2524 static void cp_parser_late_parsing_nsdmi
2526 static void cp_parser_late_parsing_default_args
2528 static tree cp_parser_sizeof_operand
2530 static cp_expr cp_parser_trait_expr
2532 static bool cp_parser_declares_only_class_p
2534 static void cp_parser_set_storage_class
2536 static void cp_parser_set_decl_spec_type
2538 static void set_and_check_decl_spec_loc
2541 static bool cp_parser_friend_p
2543 static void cp_parser_required_error
2549 static bool cp_parser_token_starts_function_definition_p
2551 static bool cp_parser_next_token_starts_class_definition_p
2553 static bool cp_parser_next_token_ends_template_argument_p
2555 static bool cp_parser_nth_token_starts_template_argument_list_p
2557 static enum tag_types cp_parser_token_is_class_key
2559 static enum tag_types cp_parser_token_is_type_parameter_key
2561 static void cp_parser_check_class_key
2563 static void cp_parser_check_access_in_redeclaration
2565 static bool cp_parser_optional_template_keyword
2567 static void cp_parser_pre_parsed_nested_name_specifier
2569 static bool cp_parser_cache_group
2571 static tree cp_parser_cache_defarg
2573 static void cp_parser_parse_tentatively
2575 static void cp_parser_commit_to_tentative_parse
2577 static void cp_parser_commit_to_topmost_tentative_parse
2579 static void cp_parser_abort_tentative_parse
2581 static bool cp_parser_parse_definitely
2585 static bool cp_parser_uncommitted_to_tentative_parse_p
2587 static void cp_parser_error
2589 static void cp_parser_name_lookup_error
2591 static bool cp_parser_simulate_error
2593 static bool cp_parser_check_type_definition
2595 static void cp_parser_check_for_definition_in_return_type
2597 static void cp_parser_check_for_invalid_template_id
2599 static bool cp_parser_non_integral_constant_expression
2601 static void cp_parser_diagnose_invalid_type_name
2603 static bool cp_parser_parse_and_diagnose_invalid_type_name
2605 static int cp_parser_skip_to_closing_parenthesis
2607 static void cp_parser_skip_to_end_of_statement
2609 static void cp_parser_consume_semicolon_at_end_of_statement
2611 static void cp_parser_skip_to_end_of_block_or_statement
2613 static bool cp_parser_skip_to_closing_brace
2615 static void cp_parser_skip_to_end_of_template_parameter_list
2617 static void cp_parser_skip_to_pragma_eol
2619 static bool cp_parser_error_occurred
2621 static bool cp_parser_allow_gnu_extensions_p
2623 static bool cp_parser_is_pure_string_literal
2625 static bool cp_parser_is_string_literal
2627 static bool cp_parser_is_keyword
2629 static tree cp_parser_make_typename_type
2633 static bool cp_parser_compound_literal_p
2635 static bool cp_parser_array_designator_p
2637 static bool cp_parser_init_statement_p
2639 static bool cp_parser_skip_to_closing_square_bracket
2642 /* Concept-related syntactic transformations */
2647 // -------------------------------------------------------------------------- //
2648 // Unevaluated Operand Guard
2649 //
2650 // Implementation of an RAII helper for unevaluated operand parsing.
2652 {
2655 }
2658 {
2661 }
2663 // -------------------------------------------------------------------------- //
2664 // Tentative Parsing
2666 /* Returns nonzero if we are parsing tentatively. */
2670 {
2672 }
2674 /* Returns nonzero if TOKEN is a string literal. */
2676 static bool
2678 {
2684 }
2686 /* Returns nonzero if TOKEN is a string literal
2687 of a user-defined string literal. */
2689 static bool
2691 {
2698 }
2700 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2702 static bool
2704 {
2706 }
2708 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2709 PRAGMA_NONE. */
2711 static enum pragma_kind
2713 {
2716 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2718 }
2720 /* Helper function for cp_parser_error.
2721 Having peeked a token of kind TOK1_KIND that might signify
2722 a conflict marker, peek successor tokens to determine
2723 if we actually do have a conflict marker.
2724 Specifically, we consider a run of 7 '<', '=' or '>' characters
2725 at the start of a line as a conflict marker.
2726 These come through the lexer as three pairs and a single,
2727 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2728 If it returns true, *OUT_LOC is written to with the location/range
2729 of the marker. */
2731 static bool
2734 {
2745 /* It must be at the start of the line. */
2750 /* We have a conflict marker. Construct a location of the form:
2751 <<<<<<<
2752 ^~~~~~~
2753 with start == caret, finishing at the end of the marker. */
2758 }
2760 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2761 RT_CLOSE_PAREN. */
2765 {
2767 {
2775 }
2776 }
2778 /* Attempt to convert TOKEN_DESC from a required_token to an
2779 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2781 static enum cpp_ttype
2783 {
2785 {
2806 /* Use CPP_EOF as a "no completions possible" code. */
2808 }
2809 }
2812 /* Subroutine of cp_parser_error and cp_parser_required_error.
2814 Issue a diagnostic of the form
2815 FILE:LINE: MESSAGE before TOKEN
2816 where TOKEN is the next token in the input stream. MESSAGE
2817 (specified by the caller) is usually of the form "expected
2818 OTHER-TOKEN".
2820 This bypasses the check for tentative passing, and potentially
2821 adds material needed by cp_parser_required_error.
2823 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2824 suggesting insertion of the missing token.
2826 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2827 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2828 location. */
2830 static void
2832 required_token missing_token_desc,
2833 location_t matching_location)
2834 {
2836 /* This diagnostic makes more sense if it is tagged to the line
2837 of the token we just peeked at. */
2841 {
2846 }
2848 /* If this is actually a conflict marker, report it as such. */
2852 {
2853 location_t loc;
2855 {
2858 /* Consume tokens until the end of the source line. */
2860 {
2870 }
2872 }
2873 }
2880 {
2881 /* Potentially supply a fix-it hint, suggesting to add the
2882 missing token immediately after the *previous* token.
2883 This may move the primary location within richloc. */
2885 location_t prev_token_loc
2889 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2890 Attempt to consolidate diagnostics by printing it as a
2891 secondary range within the main diagnostic. */
2893 added_matching_location
2895 }
2897 /* Actually emit the error. */
2899 /* Because c_parser_error does not understand
2900 CPP_KEYWORD, keywords are treated like
2901 identifiers. */
2906 {
2907 /* If we weren't able to consolidate matching_location, then
2908 print it as a secondary diagnostic. */
2913 }
2914 }
2916 /* If not parsing tentatively, issue a diagnostic of the form
2917 FILE:LINE: MESSAGE before TOKEN
2918 where TOKEN is the next token in the input stream. MESSAGE
2919 (specified by the caller) is usually of the form "expected
2920 OTHER-TOKEN". */
2922 static void
2924 {
2927 }
2929 /* Issue an error about name-lookup failing. NAME is the
2930 IDENTIFIER_NODE DECL is the result of
2931 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2932 the thing that we hoped to find. */
2934 static void
2936 tree name,
2937 tree decl,
2938 name_lookup_error desired,
2939 location_t location)
2940 {
2941 /* If name lookup completely failed, tell the user that NAME was not
2942 declared. */
2944 {
2957 else
2959 }
2961 {
2963 {
2980 }
2981 }
2983 {
2985 {
2995 name);
2999 }
3000 }
3001 else
3002 {
3004 {
3017 }
3018 }
3019 }
3021 /* If we are parsing tentatively, remember that an error has occurred
3022 during this tentative parse. Returns true if the error was
3023 simulated; false if a message should be issued by the caller. */
3025 static bool
3027 {
3029 {
3032 }
3034 }
3036 /* This function is called when a type is defined. If type
3037 definitions are forbidden at this point, an error message is
3038 issued. */
3040 static bool
3042 {
3043 /* If types are forbidden here, issue a message. */
3045 {
3046 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3047 in the message need to be interpreted. */
3050 }
3052 }
3054 /* This function is called when the DECLARATOR is processed. The TYPE
3055 was a type defined in the decl-specifiers. If it is invalid to
3056 define a type in the decl-specifiers for DECLARATOR, an error is
3057 issued. TYPE_LOCATION is the location of TYPE and is used
3058 for error reporting. */
3060 static void
3063 {
3064 /* [dcl.fct] forbids type definitions in return types.
3065 Unfortunately, it's not easy to know whether or not we are
3066 processing a return type until after the fact. */
3074 {
3079 type);
3080 }
3081 }
3083 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3084 "<" in any valid C++ program. If the next token is indeed "<",
3085 issue a message warning the user about what appears to be an
3086 invalid attempt to form a template-id. LOCATION is the location
3087 of the type-specifier (TYPE) */
3089 static void
3091 tree type,
3093 location_t location)
3094 {
3098 {
3104 {
3107 else
3109 }
3110 else
3112 /* Remember the location of the invalid "<". */
3115 /* Consume the "<". */
3117 /* Parse the template arguments. */
3119 /* Permanently remove the invalid template arguments so that
3120 this error message is not issued again. */
3123 }
3124 }
3126 /* If parsing an integral constant-expression, issue an error message
3127 about the fact that THING appeared and return true. Otherwise,
3128 return false. In either case, set
3129 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3131 static bool
3133 non_integral_constant thing)
3134 {
3137 {
3139 {
3142 {
3145 "ISO C++ forbids using a floating-point literal "
3150 "enumeration type cannot appear in a "
3241 }
3245 }
3246 }
3248 }
3250 /* Emit a diagnostic for an invalid type name. This function commits
3251 to the current active tentative parse, if any. (Otherwise, the
3252 problematic construct might be encountered again later, resulting
3253 in duplicate error messages.) LOCATION is the location of ID. */
3255 static void
3257 location_t location)
3258 {
3261 /* Try to lookup the identifier. */
3268 /* If the lookup was ambiguous, an error will already have
3269 been issued. */
3271 /* If the lookup found a template-name, it means that the user forgot
3272 to specify an argument list. Emit a useful error message. */
3274 {
3275 auto_diagnostic_group d;
3278 decl);
3283 }
3287 /* Something like 'unsigned A a;' */
3290 {
3291 /* Issue an error message. */
3292 auto_diagnostic_group d;
3293 name_hint hint;
3297 {
3303 }
3304 else
3306 /* If we're in a template class, it's possible that the user was
3307 referring to a type from a base class. For example:
3309 template <typename T> struct A { typedef T X; };
3310 template <typename T> struct B : public A<T> { X x; };
3312 The user should have said "typename A<T>::X". */
3328 {
3329 tree b;
3332 b;
3334 {
3338 {
3339 tree field;
3340 /* Go from a particular instantiation of the
3341 template (which will have an empty TYPE_FIELDs),
3342 to the main version. */
3345 field;
3349 {
3354 }
3357 }
3358 }
3359 }
3360 }
3361 /* Here we diagnose qualified-ids where the scope is actually correct,
3362 but the identifier does not resolve to a valid type name. */
3364 {
3366 {
3367 auto_diagnostic_group d;
3368 name_hint hint;
3377 {
3380 "%qE in namespace %qE does not name a template"
3383 else
3387 }
3389 {
3392 "%qE in namespace %qE does not name a template"
3395 else
3397 "%qE in namespace %qE does not name a template"
3400 }
3401 else
3402 {
3405 "%qE in namespace %qE does not name a type"
3408 else
3412 }
3415 }
3418 {
3419 /* A<T>::A<T>() */
3420 auto_diagnostic_group d;
3426 }
3429 {
3434 "need %<typename%> before %<%T::%D::%E%> because "
3438 id,
3441 else
3445 }
3447 {
3448 auto_diagnostic_group d;
3460 else
3466 }
3467 else
3469 }
3470 }
3472 /* Check for a common situation where a type-name should be present,
3473 but is not, and issue a sensible error message. Returns true if an
3474 invalid type-name was detected.
3476 The situation handled by this function are variable declarations of the
3477 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3478 Usually, `ID' should name a type, but if we got here it means that it
3479 does not. We try to emit the best possible error message depending on
3480 how exactly the id-expression looks like. */
3482 static bool
3484 {
3485 tree id;
3488 /* Avoid duplicate error about ambiguous lookup. */
3490 {
3494 }
3503 /* If the next token is a (, this is a function with no explicit return
3504 type, i.e. constructor, destructor or conversion op. */
3507 {
3510 }
3514 /* Emit a diagnostic for the invalid type. */
3516 out:
3517 /* If we aren't in the middle of a declarator (i.e. in a
3518 parameter-declaration-clause), skip to the end of the declaration;
3519 there's no point in trying to process it. */
3523 }
3525 /* Consume tokens up to, and including, the next non-nested closing `)'.
3526 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3527 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3528 found an unnested token of that type. */
3530 static int
3533 cpp_ttype or_ttype,
3535 {
3546 {
3549 /* Have we found what we're looking for before the closing paren? */
3555 {
3558 /* If we've run out of tokens, then there is no closing `)'. */
3561 /* This is good for lambda expression capture-lists. */
3571 /* This matches the processing in skip_to_end_of_statement. */
3591 {
3595 }
3605 condop_depth--;
3610 }
3612 /* Consume the token. */
3614 }
3615 }
3617 /* Consume tokens up to, and including, the next non-nested closing `)'.
3618 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3619 are doing error recovery. Returns -1 if OR_COMMA is true and we
3620 found an unnested token of that type. */
3622 static int
3627 {
3631 }
3633 /* Consume tokens until we reach the end of the current statement.
3634 Normally, that will be just before consuming a `;'. However, if a
3635 non-nested `}' comes first, then we stop before consuming that. */
3637 static void
3639 {
3642 /* Unwind generic function template scope if necessary. */
3647 {
3651 {
3654 /* If we've run out of tokens, stop. */
3658 /* If the next token is a `;', we have reached the end of the
3659 statement. */
3665 /* If this is a non-nested '}', stop before consuming it.
3666 That way, when confronted with something like:
3668 { 3 + }
3670 we stop before consuming the closing '}', even though we
3671 have not yet reached a `;'. */
3675 /* If it is the closing '}' for a block that we have
3676 scanned, stop -- but only after consuming the token.
3677 That way given:
3679 void f g () { ... }
3680 typedef int I;
3682 we will stop after the body of the erroneously declared
3683 function, but before consuming the following `typedef'
3684 declaration. */
3686 {
3689 }
3698 }
3700 /* Consume the token. */
3702 }
3703 }
3705 /* This function is called at the end of a statement or declaration.
3706 If the next token is a semicolon, it is consumed; otherwise, error
3707 recovery is attempted. */
3709 static void
3711 {
3712 /* Look for the trailing `;'. */
3714 {
3715 /* If there is additional (erroneous) input, skip to the end of
3716 the statement. */
3718 /* If the next token is now a `;', consume it. */
3721 }
3722 }
3724 /* Skip tokens until we have consumed an entire block, or until we
3725 have consumed a non-nested `;'. */
3727 static void
3729 {
3732 /* Unwind generic function template scope if necessary. */
3737 {
3741 {
3744 /* If we've run out of tokens, stop. */
3748 /* Stop if this is an unnested ';'. */
3754 /* Stop if this is an unnested '}', or closes the outermost
3755 nesting level. */
3756 nesting_depth--;
3764 /* Nest. */
3765 nesting_depth++;
3770 }
3772 /* Consume the token. */
3774 }
3775 }
3777 /* Skip tokens until a non-nested closing curly brace is the next
3778 token, or there are no more tokens. Return true in the first case,
3779 false otherwise. */
3781 static bool
3783 {
3787 {
3791 {
3794 /* If we've run out of tokens, stop. */
3798 /* If the next token is a non-nested `}', then we have reached
3799 the end of the current block. */
3805 /* If it the next token is a `{', then we are entering a new
3806 block. Consume the entire block. */
3812 }
3814 /* Consume the token. */
3816 }
3817 }
3819 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3820 parameter is the PRAGMA token, allowing us to purge the entire pragma
3821 sequence. */
3823 static void
3825 {
3830 do
3834 /* Ensure that the pragma is not parsed again. */
3836 }
3838 /* Require pragma end of line, resyncing with it as necessary. The
3839 arguments are as for cp_parser_skip_to_pragma_eol. */
3841 static void
3843 {
3847 }
3849 /* This is a simple wrapper around make_typename_type. When the id is
3850 an unresolved identifier node, we can provide a superior diagnostic
3851 using cp_parser_diagnose_invalid_type_name. */
3853 static tree
3855 location_t id_location)
3856 {
3857 tree result;
3859 {
3865 }
3867 }
3869 /* This is a wrapper around the
3870 make_{pointer,ptrmem,reference}_declarator functions that decides
3871 which one to call based on the CODE and CLASS_TYPE arguments. The
3872 CODE argument should be one of the values returned by
3873 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3874 appertain to the pointer or reference. */
3878 cp_cv_quals cv_qualifiers,
3880 tree attributes)
3881 {
3888 else
3898 }
3900 /* Create a new C++ parser. */
3904 {
3909 /* cp_lexer_new_main is called before doing GC allocation because
3910 cp_lexer_new_main might load a PCH file. */
3913 /* Initialize the binops_by_token so that we can get the tree
3914 directly from the token. */
3922 /* For now, we always accept GNU extensions. */
3925 /* The `>' token is a greater-than operator, not the end of a
3926 template-id. */
3931 /* We are not parsing a constant-expression. */
3936 /* Local variable names are not forbidden. */
3939 /* We are not processing an `extern "C"' declaration. */
3942 /* We are not processing a declarator. */
3945 /* We are not processing a template-argument-list. */
3948 /* We are not in an iteration statement. */
3951 /* We are not in a switch statement. */
3954 /* We are not parsing a type-id inside an expression. */
3957 /* String literals should be translated to the execution character set. */
3960 /* We are not parsing a function body. */
3963 /* We can correct until told otherwise. */
3966 /* The unparsed function queue is empty. */
3969 /* There are no classes being defined. */
3972 /* No template parameters apply. */
3975 /* Special parsing data structures. */
3979 /* Not declaring an implicit function template. */
3985 /* Allow constrained-type-specifiers. */
3988 /* We haven't yet seen an 'extern "C"'. */
3992 }
3994 /* Create a cp_lexer structure which will emit the tokens in CACHE
3995 and push it onto the parser's lexer stack. This is used for delayed
3996 parsing of in-class method bodies and default arguments, and should
3997 not be confused with tentative parsing. */
3998 static void
4000 {
4005 /* Move the current source position to that of the first token in the
4006 new lexer. */
4008 }
4010 /* Pop the top lexer off the parser stack. This is never used for the
4011 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
4012 static void
4014 {
4019 /* Put the current source position back where it was before this
4020 lexer was pushed. */
4022 }
4024 /* Lexical conventions [gram.lex] */
4026 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
4027 identifier. */
4029 static cp_expr
4031 {
4034 /* Look for the identifier. */
4036 /* Return the value. */
4039 else
4041 }
4043 /* Parse a sequence of adjacent string constants. Returns a
4044 TREE_STRING representing the combined, nul-terminated string
4045 constant. If TRANSLATE is true, translate the string to the
4046 execution character set. If WIDE_OK is true, a wide string is
4047 invalid here.
4049 C++98 [lex.string] says that if a narrow string literal token is
4050 adjacent to a wide string literal token, the behavior is undefined.
4051 However, C99 6.4.5p4 says that this results in a wide string literal.
4052 We follow C99 here, for consistency with the C front end.
4054 This code is largely lifted from lex_string() in c-lex.c.
4056 FUTURE: ObjC++ will need to handle @-strings here. */
4057 static cp_expr
4060 {
4061 tree value;
4069 tree string_tree;
4075 {
4078 }
4083 {
4087 }
4088 else
4089 {
4092 }
4095 /* Try to avoid the overhead of creating and destroying an obstack
4096 for the common case of just one string. */
4099 {
4107 {
4111 }
4112 else
4116 }
4117 else
4118 {
4124 do
4125 {
4127 count++;
4132 {
4135 {
4138 }
4141 {
4146 }
4148 }
4149 else
4153 {
4157 {
4161 "unsupported non-standard concatenation "
4163 }
4164 }
4173 {
4177 }
4178 else
4179 {
4183 }
4184 }
4187 /* A string literal built by concatenation has its caret=start at
4188 the start of the initial string, and its finish at the finish of
4189 the final string literal. */
4193 }
4196 {
4199 }
4203 {
4207 {
4211 }
4214 {
4229 }
4234 {
4239 else
4241 }
4242 }
4243 else
4244 /* cpp_interpret_string has issued an error. */
4248 {
4251 }
4254 }
4256 /* Look up a literal operator with the name and the exact arguments. */
4258 static tree
4260 {
4261 tree decl;
4267 {
4273 {
4276 {
4286 }
4289 /* May be this should be sufficient_parms_p instead,
4290 depending on how exactly should user-defined literals
4291 work in presence of default arguments on the literal
4292 operator parameters. */
4295 }
4296 }
4299 }
4301 /* Parse a user-defined char constant. Returns a call to a user-defined
4302 literal operator taking the character as an argument. */
4304 static cp_expr
4306 {
4314 /* Build up a call to the user-defined operator */
4315 /* Lookup the name we got back from the id-expression. */
4320 {
4325 }
4329 }
4331 /* A subroutine of cp_parser_userdef_numeric_literal to
4332 create a char... template parameter pack from a string node. */
4334 static tree
4336 {
4337 tree charvec;
4343 /* Fill in CHARVEC with all of the parameters. */
4346 {
4355 }
4357 /* Build the argument packs. */
4363 }
4365 /* A subroutine of cp_parser_userdef_numeric_literal to
4366 create a char... template parameter pack from a string node. */
4368 static tree
4370 {
4371 tree charvec;
4382 /* First template parm is character type. */
4385 /* Fill in CHARVEC with all of the parameters. */
4392 /* Build the argument packs. */
4398 }
4400 /* Parse a user-defined numeric constant. returns a call to a user-defined
4401 literal operator. */
4403 static cp_expr
4405 {
4416 /* Look for a literal operator taking the exact type of numeric argument
4417 as the literal value. */
4422 {
4424 tf_warning_or_error);
4427 {
4430 long_long_unsigned_type_node);
4431 }
4432 else
4433 {
4437 long_double_type_node);
4441 }
4445 }
4448 /* If the numeric argument didn't work, look for a raw literal
4449 operator taking a const char* argument consisting of the number
4450 in string format. */
4455 {
4457 tf_warning_or_error);
4460 }
4463 /* If the raw literal didn't work, look for a non-type template
4464 function with parameter pack char.... Call the function with
4465 template parameter characters representing the number. */
4469 {
4472 {
4474 num_string);
4476 }
4479 tf_warning_or_error);
4482 }
4486 /* In C++14 the standard library defines complex number suffixes that
4487 conflict with GNU extensions. Prefer them if <complex> is #included. */
4497 {
4502 {
4503 /* No <complex>, so pedwarn and use GNU semantics. */
4506 }
4507 }
4509 bool complained
4516 {
4518 "(from <complex>) to enable the C++14 user-defined literal "
4523 }
4530 else
4531 {
4532 /* Use the built-in semantics. */
4533 tree type;
4535 {
4538 else
4540 }
4549 }
4552 /* Avoid repeated diagnostics. */
4555 }
4557 /* Parse a user-defined string constant. Returns a call to a user-defined
4558 literal operator taking a character pointer and the length of the string
4559 as arguments. */
4561 static tree
4563 {
4569 tree decl;
4571 /* Build up a call to the user-defined operator. */
4572 /* Lookup the name we got back from the id-expression. */
4573 releasing_vec rargs;
4581 tf_warning_or_error);
4583 /* Look for a suitable template function, either (C++20) with a single
4584 parameter of class type, or (N3599) with typename parameter CharT and
4585 parameter pack CharT... */
4589 {
4590 /* Use resolve_nondeduced_context to try to choose one form of template
4591 or the other. */
4598 else
4599 {
4604 }
4608 tf_warning_or_error);
4609 }
4614 }
4617 /* Basic concepts [gram.basic] */
4619 /* Parse a translation-unit.
4621 translation-unit:
4622 declaration-seq [opt] */
4624 static void
4626 {
4629 /* Create the declarator obstack. */
4631 /* Create the error declarator. */
4633 /* Create the empty parameter list. */
4635 UNKNOWN_LOCATION);
4636 /* Remember where the base of the declarator obstack lies. */
4642 {
4645 /* If we're entering or exiting a region that's implicitly
4646 extern "C", modify the lang context appropriately. */
4649 {
4653 else
4655 }
4661 {
4664 /* If the next token is now a `;', consume it. */
4667 }
4668 else
4670 }
4672 /* Get rid of the token array; we don't need it any more. */
4676 /* The EOF should have reset this. */
4679 /* Make sure the declarator obstack was fully cleaned up. */
4682 }
4684 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4685 decltype context. */
4689 {
4694 }
4696 /* We're about to parse a collection of statements. If we're currently
4697 parsing tentatively, set up a firewall so that any nested
4698 cp_parser_commit_to_tentative_parse won't affect the current context. */
4700 static cp_token_position
4702 {
4709 }
4711 /* We've finished parsing the collection of statements. Wrap up the
4712 firewall and replace the relevant tokens with the parsed form. */
4714 static void
4716 tree expr)
4717 {
4721 /* Finish the firewall level. */
4723 /* And remember the result of the parse for when we try again. */
4729 }
4731 /* Like the above functions, but let the user modify the tokens. Used by
4732 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4733 later parses, so it makes sense to localize the effects of
4734 cp_parser_commit_to_tentative_parse. */
4736 struct tentative_firewall
4737 {
4742 {
4743 /* If we're currently parsing tentatively, start a committed level as a
4744 firewall and then an inner tentative parse. */
4746 {
4750 }
4751 }
4754 {
4756 {
4757 /* Finish the inner tentative parse and the firewall, propagating any
4758 uncommitted error state to the outer tentative parse. */
4764 }
4765 }
4766 };
4768 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4769 This class is for tracking such a matching pair of symbols.
4770 In particular, it tracks the location of the first token,
4771 so that if the second token is missing, we can highlight the
4772 location of the first token when notifying the user about the
4773 problem. */
4776 class token_pair
4777 {
4779 /* token_pair's ctor. */
4782 /* If the next token is the opening symbol for this pair, consume it and
4783 return true.
4784 Otherwise, issue an error and return false.
4785 In either case, record the location of the opening token. */
4788 {
4792 }
4794 /* Consume the next token from PARSER, recording its location as
4795 that of the opening token within the pair. */
4798 {
4803 }
4805 /* If the next token is the closing symbol for this pair, consume it
4806 and return it.
4807 Otherwise, issue an error, highlighting the location of the
4808 corresponding opening token, and return NULL. */
4811 {
4814 m_open_loc);
4815 }
4818 location_t m_open_loc;
4819 };
4821 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4823 struct matching_paren_traits
4824 {
4829 };
4831 /* "matching_parens" is a token_pair<T> class for tracking matching
4832 pairs of parentheses. */
4836 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4838 struct matching_brace_traits
4839 {
4844 };
4846 /* "matching_braces" is a token_pair<T> class for tracking matching
4847 pairs of braces. */
4852 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4853 enclosing parentheses. */
4855 static cp_expr
4857 {
4860 /* Consume the '('. */
4862 matching_parens parens;
4864 /* Start the statement-expression. */
4866 /* Parse the compound-statement. */
4868 /* Finish up. */
4870 /* Consume the ')'. */
4878 }
4880 /* Expressions [gram.expr] */
4882 /* Parse a fold-operator.
4884 fold-operator:
4885 - * / % ^ & | = < > << >>
4886 = -= *= /= %= ^= &= |= <<= >>=
4887 == != <= >= && || , .* ->*
4889 This returns the tree code corresponding to the matched operator
4890 as an int. When the current token matches a compound assignment
4891 opertor, the resulting tree code is the negative value of the
4892 non-assignment operator. */
4894 static int
4896 {
4898 {
4938 }
4939 }
4941 /* Returns true if CODE indicates a binary expression, which is not allowed in
4942 the LHS of a fold-expression. More codes will need to be added to use this
4943 function in other contexts. */
4945 static bool
4947 {
4949 {
4982 }
4983 }
4985 /* If the next token is a suitable fold operator, consume it and return as
4986 the function above. */
4988 static int
4990 {
4996 }
4998 /* Parse a fold-expression.
5000 fold-expression:
5001 ( ... folding-operator cast-expression)
5002 ( cast-expression folding-operator ... )
5003 ( cast-expression folding operator ... folding-operator cast-expression)
5005 Note that the '(' and ')' are matched in primary expression. */
5007 static cp_expr
5009 {
5010 cp_id_kind pidk;
5012 // Left fold.
5014 {
5018 {
5021 }
5028 }
5033 {
5036 }
5039 {
5042 }
5045 /* The operands of a fold-expression are cast-expressions, so binary or
5046 conditional expressions are not allowed. We check this here to avoid
5047 tentative parsing. */
5059 // Right fold.
5064 {
5067 }
5070 // Binary left or right fold.
5075 }
5077 /* Parse a primary-expression.
5079 primary-expression:
5080 literal
5081 this
5082 ( expression )
5083 id-expression
5084 lambda-expression (C++11)
5086 GNU Extensions:
5088 primary-expression:
5089 ( compound-statement )
5090 __builtin_va_arg ( assignment-expression , type-id )
5091 __builtin_offsetof ( type-id , offsetof-expression )
5093 C++ Extensions:
5094 __has_nothrow_assign ( type-id )
5095 __has_nothrow_constructor ( type-id )
5096 __has_nothrow_copy ( type-id )
5097 __has_trivial_assign ( type-id )
5098 __has_trivial_constructor ( type-id )
5099 __has_trivial_copy ( type-id )
5100 __has_trivial_destructor ( type-id )
5101 __has_virtual_destructor ( type-id )
5102 __is_abstract ( type-id )
5103 __is_base_of ( type-id , type-id )
5104 __is_class ( type-id )
5105 __is_empty ( type-id )
5106 __is_enum ( type-id )
5107 __is_final ( type-id )
5108 __is_literal_type ( type-id )
5109 __is_pod ( type-id )
5110 __is_polymorphic ( type-id )
5111 __is_std_layout ( type-id )
5112 __is_trivial ( type-id )
5113 __is_union ( type-id )
5115 Objective-C++ Extension:
5117 primary-expression:
5118 objc-expression
5120 literal:
5121 __null
5123 ADDRESS_P is true iff this expression was immediately preceded by
5124 "&" and therefore might denote a pointer-to-member. CAST_P is true
5125 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5126 true iff this expression is a template argument.
5128 Returns a representation of the expression. Upon return, *IDK
5129 indicates what kind of id-expression (if any) was present. */
5131 static cp_expr
5138 {
5141 /* Assume the primary expression is not an id-expression. */
5144 /* Peek at the next token. */
5147 {
5148 /* literal:
5149 integer-literal
5150 character-literal
5151 floating-literal
5152 string-literal
5153 boolean-literal
5154 pointer-literal
5155 user-defined-literal */
5167 {
5171 }
5172 /* Floating-point literals are only allowed in an integral
5173 constant expression if they are cast to an integral or
5174 enumeration type. */
5178 {
5179 /* CAST_P will be set even in invalid code like "int(2.7 +
5180 ...)". Therefore, we have to check that the next token
5181 is sure to end the cast. */
5183 {
5188 enumerator-definition. */
5190 /* The curly brace at the end of an enum-specifier. */
5192 /* The end of a statement. */
5194 /* The end of the cast-expression. */
5196 /* The end of an array bound. */
5198 /* The closing ">" in a template-argument-list. */
5201 /* C++0x only: A ">>" treated like two ">" tokens,
5202 in a template-argument-list. */
5207 }
5209 /* If we are within a cast, then the constraint that the
5210 cast is to an integral or enumeration type will be
5211 checked at that point. If we are not within a cast, then
5212 this code is invalid. */
5215 }
5235 /* ??? Should wide strings be allowed when parser->translate_strings_p
5236 is false (i.e. in attributes)? If not, we can kill the third
5237 argument to cp_parser_string_literal. */
5243 /* If we see `( { ' then we are looking at the beginning of
5244 a GNU statement-expression. */
5247 {
5248 /* Statement-expressions are not allowed by the standard. */
5252 /* And they're not allowed outside of a function-body; you
5253 cannot, for example, write:
5255 int i = ({ int j = 3; j + 1; });
5257 at class or namespace scope. */
5260 {
5262 "statement-expressions are not allowed outside "
5268 }
5269 else
5271 }
5272 /* Otherwise it's a normal parenthesized expression. */
5273 {
5274 cp_expr expr;
5279 /* Consume the `('. */
5280 matching_parens parens;
5282 /* Within a parenthesized expression, a `>' token is always
5283 the greater-than operator. */
5284 saved_greater_than_is_operator_p
5289 /* Left fold expression. */
5291 else
5292 /* Parse the parenthesized expression. */
5297 {
5304 }
5305 else
5306 /* Let the front end know that this expression was
5307 enclosed in parentheses. This matters in case, for
5308 example, the expression is of the form `A::B', since
5309 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5310 not. */
5313 /* DR 705: Wrapping an unqualified name in parentheses
5314 suppresses arg-dependent lookup. We want to pass back
5315 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5316 (c++/37862), but none of the others. */
5320 /* The `>' token might be the end of a template-id or
5321 template-parameter-list now. */
5322 parser->greater_than_is_operator_p
5325 /* Consume the `)'. */
5334 }
5337 {
5339 {
5340 /* We might have an Objective-C++ message. */
5343 /* If that works out, we're done ... */
5346 /* ... else, fall though to see if it's a lambda. */
5347 }
5349 /* Don't warn about a failed tentative parse. */
5354 }
5358 /* We have an Objective-C++ string literal. */
5365 {
5366 /* These two are the boolean literals. */
5374 /* The `__null' literal. */
5379 /* The `nullptr' literal. */
5384 /* Recognize the `this' keyword. */
5388 {
5392 }
5393 /* Pointers cannot appear in constant-expressions. */
5398 /* The `operator' keyword can be the beginning of an
5399 id-expression. */
5406 {
5407 non_integral_constant name;
5409 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5410 __func__ are the names of variables -- but they are
5411 treated specially. Therefore, they are handled here,
5412 rather than relying on the generic id-expression logic
5413 below. Grammatically, these names are id-expressions.
5415 Consume the token. */
5419 {
5431 }
5436 /* Look up the name. */
5438 }
5441 {
5442 tree expression;
5443 tree type;
5444 source_location type_location;
5445 location_t start_loc
5447 /* The `__builtin_va_arg' construct is used to handle
5448 `va_arg'. Consume the `__builtin_va_arg' token. */
5450 /* Look for the opening `('. */
5451 matching_parens parens;
5453 /* Now, parse the assignment-expression. */
5455 /* Look for the `,'. */
5458 /* Parse the type-id. */
5459 {
5462 }
5463 /* Look for the closing `)'. */
5464 location_t finish_loc
5467 /* Using `va_arg' in a constant-expression is not
5468 allowed. */
5470 NIC_VA_ARG))
5472 /* Construct a location of the form:
5473 __builtin_va_arg (v, int)
5474 ~~~~~~~~~~~~~~~~~~~~~^~~~
5475 with the caret at the type, ranging from the start of the
5476 "__builtin_va_arg" token to the close paren. */
5477 location_t combined_loc
5480 }
5515 // C++ concepts
5519 /* Objective-C++ expressions. */
5529 {
5534 }
5535 /* FALLTHRU */
5539 }
5541 /* An id-expression can start with either an identifier, a
5542 `::' as the beginning of a qualified-id, or the "operator"
5543 keyword. */
5548 {
5549 id_expression:
5550 cp_expr id_expression;
5551 cp_expr decl;
5557 /* Parse the id-expression. */
5558 id_expression
5575 /* If we have a template-id, then no further lookup is
5576 required. If the template-id was for a template-class, we
5577 will sometimes have a TYPE_DECL at this point. */
5581 /* Look up the name. */
5582 else
5583 {
5584 tree ambiguous_decls;
5586 /* If we already know that this lookup is ambiguous, then
5587 we've already issued an error message; there's no reason
5588 to check again. */
5591 {
5594 }
5597 none_type,
5598 template_p,
5603 /* If the lookup was ambiguous, an error will already have
5604 been issued. */
5608 /* In Objective-C++, we may have an Objective-C 2.0
5609 dot-syntax for classes here. */
5614 {
5615 tree component;
5622 component);
5623 /* Build a location of the form:
5624 expr.component
5625 ~~~~~^~~~~~~~~
5626 with caret at the start of the component name (at
5627 input_location), ranging from the start of the id_expression
5628 to the end of the component name. */
5629 location_t combined_loc
5634 }
5636 /* In Objective-C++, an instance variable (ivar) may be preferred
5637 to whatever cp_parser_lookup_name() found.
5638 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5639 rest of c-family, we have to do a little extra work to preserve
5640 any location information in cp_expr "decl". Given that
5641 objc_lookup_ivar is implemented in "c-family" and "objc", we
5642 have a trip through the pure "tree" type, rather than cp_expr.
5643 Naively copying it back to "decl" would implicitly give the
5644 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5645 store an EXPR_LOCATION. Hence we only update "decl" (and
5646 hence its location_t) if we get back a different tree node. */
5648 id_expression);
5652 /* If name lookup gives us a SCOPE_REF, then the
5653 qualifying scope was dependent. */
5655 {
5656 /* At this point, we do not know if DECL is a valid
5657 integral constant expression. We assume that it is
5658 in fact such an expression, so that code like:
5660 template <int N> struct A {
5661 int a[B<N>::i];
5662 };
5664 is accepted. At template-instantiation time, we
5665 will check that B<N>::i is actually a constant. */
5667 }
5668 /* Check to see if DECL is a local variable in a context
5669 where that is forbidden. */
5672 {
5677 }
5678 }
5682 /* It's too difficult to mark ths in all the places where
5683 we know for sure we need to keep the lookup, so do it
5684 now. The cost is extra GC to recycle the lookups
5685 resolved at parse time. */
5688 decl = (finish_id_expression
5690 idk,
5695 template_arg_p,
5702 }
5704 /* Anything else is an error. */
5708 }
5709 }
5717 {
5720 }
5722 /* Parse an id-expression.
5724 id-expression:
5725 unqualified-id
5726 qualified-id
5728 qualified-id:
5729 :: [opt] nested-name-specifier template [opt] unqualified-id
5730 :: identifier
5731 :: operator-function-id
5732 :: template-id
5734 Return a representation of the unqualified portion of the
5735 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5736 a `::' or nested-name-specifier.
5738 Often, if the id-expression was a qualified-id, the caller will
5739 want to make a SCOPE_REF to represent the qualified-id. This
5740 function does not do this in order to avoid wastefully creating
5741 SCOPE_REFs when they are not required.
5743 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5744 `template' keyword.
5746 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5747 uninstantiated templates.
5749 If *TEMPLATE_P is non-NULL, it is set to true iff the
5750 `template' keyword is used to explicitly indicate that the entity
5751 named is a template.
5753 If DECLARATOR_P is true, the id-expression is appearing as part of
5754 a declarator, rather than as part of an expression. */
5756 static cp_expr
5763 {
5767 /* Assume the `template' keyword was not used. */
5771 /* Look for the optional `::' operator. */
5772 global_scope_p
5773 = (!template_keyword_p
5778 /* Look for the optional nested-name-specifier. */
5779 nested_name_specifier_p
5782 check_dependency_p,
5784 declarator_p,
5785 template_keyword_p)
5788 /* If there is a nested-name-specifier, then we are looking at
5789 the first qualified-id production. */
5791 {
5792 tree saved_scope;
5793 tree saved_object_scope;
5794 tree saved_qualifying_scope;
5795 cp_expr unqualified_id;
5798 /* See if the next token is the `template' keyword. */
5802 /* Name lookup we do during the processing of the
5803 unqualified-id might obliterate SCOPE. */
5807 /* Process the final unqualified-id. */
5809 check_dependency_p,
5810 declarator_p,
5812 /* Restore the SAVED_SCOPE for our caller. */
5818 }
5819 /* Otherwise, if we are in global scope, then we are looking at one
5820 of the other qualified-id productions. */
5822 {
5824 tree id;
5826 /* Peek at the next token. */
5829 /* If it's an identifier, and the next token is not a "<", then
5830 we can avoid the template-id case. This is an optimization
5831 for this common case. */
5833 && !cp_parser_nth_token_starts_template_argument_list_p
5838 /* Try a template-id. */
5842 none_type,
5843 declarator_p);
5844 /* If that worked, we're done. */
5848 /* Peek at the next token. (Changes in the token buffer may
5849 have invalidated the pointer obtained above.) */
5853 {
5860 /* Fall through. */
5865 }
5866 }
5867 else
5870 declarator_p,
5871 optional_p);
5872 }
5874 /* Parse an unqualified-id.
5876 unqualified-id:
5877 identifier
5878 operator-function-id
5879 conversion-function-id
5880 ~ class-name
5881 template-id
5883 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5884 keyword, in a construct like `A::template ...'.
5886 Returns a representation of unqualified-id. For the `identifier'
5887 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5888 production a BIT_NOT_EXPR is returned; the operand of the
5889 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5890 other productions, see the documentation accompanying the
5891 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5892 names are looked up in uninstantiated templates. If DECLARATOR_P
5893 is true, the unqualified-id is appearing as part of a declarator,
5894 rather than as part of an expression. */
5896 static cp_expr
5902 {
5905 /* Peek at the next token. */
5909 {
5911 {
5912 tree id;
5914 /* We don't know yet whether or not this will be a
5915 template-id. */
5917 /* Try a template-id. */
5919 check_dependency_p,
5920 none_type,
5921 declarator_p);
5922 /* If it worked, we're done. */
5925 /* Otherwise, it's an ordinary identifier. */
5927 }
5931 check_dependency_p,
5932 none_type,
5933 declarator_p);
5936 {
5937 tree type_decl;
5938 tree qualifying_scope;
5939 tree object_scope;
5940 tree scope;
5943 /* Consume the `~' token. */
5945 /* Parse the class-name. The standard, as written, seems to
5946 say that:
5948 template <typename T> struct S { ~S (); };
5949 template <typename T> S<T>::~S() {}
5951 is invalid, since `~' must be followed by a class-name, but
5952 `S<T>' is dependent, and so not known to be a class.
5953 That's not right; we need to look in uninstantiated
5954 templates. A further complication arises from:
5956 template <typename T> void f(T t) {
5957 t.T::~T();
5958 }
5960 Here, it is not possible to look up `T' in the scope of `T'
5961 itself. We must look in both the current scope, and the
5962 scope of the containing complete expression.
5964 Yet another issue is:
5966 struct S {
5967 int S;
5968 ~S();
5969 };
5971 S::~S() {}
5973 The standard does not seem to say that the `S' in `~S'
5974 should refer to the type `S' and not the data member
5975 `S::S'. */
5977 /* DR 244 says that we look up the name after the "~" in the
5978 same scope as we looked up the qualifying name. That idea
5979 isn't fully worked out; it's more complicated than that. */
5984 /* Check for invalid scopes. */
5986 {
5990 }
5992 {
5996 scope);
6001 }
6004 /* If the name is of the form "X::~X" it's OK even if X is a
6005 typedef. */
6014 {
6017 }
6019 /* ~auto means the destructor of whatever the object is. */
6021 {
6024 "%<~auto%> only available with "
6028 }
6030 /* If there was an explicit qualification (S::~T), first look
6031 in the scope given by the qualification (i.e., S).
6033 Note: in the calls to cp_parser_class_name below we pass
6034 typename_type so that lookup finds the injected-class-name
6035 rather than the constructor. */
6039 {
6044 typename_type,
6047 declarator_p);
6050 }
6051 /* In "N::S::~S", look in "N" as well. */
6053 {
6058 type_decl
6062 typename_type,
6065 declarator_p);
6068 }
6069 /* In "p->S::~T", look in the scope given by "*p" as well. */
6071 {
6076 type_decl
6080 typename_type,
6083 declarator_p);
6086 }
6087 /* Look in the surrounding context. */
6089 {
6095 type_decl
6099 typename_type,
6102 declarator_p);
6105 {
6106 /* We couldn't find a type with this name. If we're parsing
6107 tentatively, fail and try something else. */
6109 {
6112 }
6113 /* Otherwise, accept it and check for a match at instantiation
6114 time. */
6119 }
6120 }
6121 /* If an error occurred, assume that the name of the
6122 destructor is the same as the name of the qualifying
6123 class. That allows us to keep parsing after running
6124 into ill-formed destructor names. */
6130 /* Check that destructor name and scope match. */
6132 {
6139 }
6141 /* [class.dtor]
6143 A typedef-name that names a class shall not be used as the
6144 identifier in the declarator for a destructor declaration. */
6151 type_decl);
6154 }
6158 {
6159 cp_expr id;
6161 /* This could be a template-id, so we try that first. */
6163 /* Try a template-id. */
6166 none_type,
6167 declarator_p);
6168 /* If that worked, we're done. */
6171 /* We still don't know whether we're looking at an
6172 operator-function-id or a conversion-function-id. */
6174 /* Try an operator-function-id. */
6176 /* If that didn't work, try a conversion-function-id. */
6181 }
6182 /* Fall through. */
6189 }
6190 }
6192 /* Parse an (optional) nested-name-specifier.
6194 nested-name-specifier: [C++98]
6195 class-or-namespace-name :: nested-name-specifier [opt]
6196 class-or-namespace-name :: template nested-name-specifier [opt]
6198 nested-name-specifier: [C++0x]
6199 type-name ::
6200 namespace-name ::
6201 nested-name-specifier identifier ::
6202 nested-name-specifier template [opt] simple-template-id ::
6204 PARSER->SCOPE should be set appropriately before this function is
6205 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6206 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6207 in name lookups.
6209 Sets PARSER->SCOPE to the class (TYPE) or namespace
6210 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6211 it unchanged if there is no nested-name-specifier. Returns the new
6212 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6214 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6215 part of a declaration and/or decl-specifier. */
6217 static tree
6224 {
6229 /* Remember where the nested-name-specifier starts. */
6231 {
6234 }
6237 {
6238 tree new_scope;
6239 tree old_scope;
6240 tree saved_qualifying_scope;
6242 /* Spot cases that cannot be the beginning of a
6243 nested-name-specifier. */
6246 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6247 the already parsed nested-name-specifier. */
6249 {
6250 /* Grab the nested-name-specifier and continue the loop. */
6252 /* If we originally encountered this nested-name-specifier
6253 with IS_DECLARATION set to false, we will not have
6254 resolved TYPENAME_TYPEs, so we must do so here. */
6257 {
6262 }
6265 }
6267 /* Spot cases that cannot be the beginning of a
6268 nested-name-specifier. On the second and subsequent times
6269 through the loop, we look for the `template' keyword. */
6271 ;
6272 /* A template-id can start a nested-name-specifier. */
6274 ;
6275 /* DR 743: decltype can be used in a nested-name-specifier. */
6277 ;
6278 else
6279 {
6280 /* If the next token is not an identifier, then it is
6281 definitely not a type-name or namespace-name. */
6284 /* If the following token is neither a `<' (to begin a
6285 template-id), nor a `::', then we are not looking at a
6286 nested-name-specifier. */
6292 {
6296 "found %<:%> in nested-name-specifier, "
6299 }
6302 && !cp_parser_nth_token_starts_template_argument_list_p
6305 }
6307 /* The nested-name-specifier is optional, so we parse
6308 tentatively. */
6311 /* Look for the optional `template' keyword, if this isn't the
6312 first time through the loop. */
6316 /* Save the old scope since the name lookup we are about to do
6317 might destroy it. */
6320 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6321 look up names in "X<T>::I" in order to determine that "Y" is
6322 a template. So, if we have a typename at this point, we make
6323 an effort to look through it. */
6325 && !typename_keyword_p
6330 /* Parse the qualifying entity. */
6331 new_scope
6333 typename_keyword_p,
6334 template_keyword_p,
6335 check_dependency_p,
6336 type_p,
6337 is_declaration);
6338 /* Look for the `::' token. */
6341 /* If we found what we wanted, we keep going; otherwise, we're
6342 done. */
6344 {
6347 /* Restore the OLD_SCOPE since it was valid before the
6348 failed attempt at finding the last
6349 class-or-namespace-name. */
6353 /* If the next token is a decltype, and the one after that is a
6354 `::', then the decltype has failed to resolve to a class or
6355 enumeration type. Give this error even when parsing
6356 tentatively since it can't possibly be valid--and we're going
6357 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6358 won't get another chance.*/
6362 {
6369 /* As below. */
6372 }
6376 {
6377 /* If we have a non-type template-id followed by ::, it can't
6378 possibly be valid. */
6383 {
6386 {
6392 }
6393 else
6394 {
6395 /* Variable template. */
6400 }
6407 /* As below. */
6411 }
6412 }
6416 /* If the next token is an identifier, and the one after
6417 that is a `::', then any valid interpretation would have
6418 found a class-or-namespace-name. */
6424 {
6427 {
6429 {
6430 tree decl;
6431 tree ambiguous_decls;
6434 none_type,
6443 decl);
6445 {
6446 // cp_parser_lookup_name has the same diagnostic,
6447 // thus make sure to emit it at most once.
6450 {
6455 }
6457 }
6458 else
6459 {
6461 cp_parser_name_lookup_error
6464 else
6465 cp_parser_name_lookup_error
6468 }
6469 }
6472 /* Treat this as a successful nested-name-specifier
6473 due to:
6475 [basic.lookup.qual]
6477 If the name found is not a class-name (clause
6478 _class_) or namespace-name (_namespace.def_), the
6479 program is ill-formed. */
6481 }
6483 }
6485 }
6486 /* We've found one valid nested-name-specifier. */
6488 /* Name lookup always gives us a DECL. */
6491 /* Uses of "template" must be followed by actual templates. */
6503 new_scope);
6504 /* If it is a class scope, try to complete it; we are about to
6505 be looking up names inside the class. */
6507 /* Since checking types for dependency can be expensive,
6508 avoid doing it if the type is already complete. */
6510 /* Do not try to complete dependent types. */
6512 {
6514 /* If it is a typedef to current class, use the current
6515 class instead, as the typedef won't have any names inside
6516 it yet. */
6520 }
6521 /* Make sure we look in the right scope the next time through
6522 the loop. */
6524 }
6526 /* If parsing tentatively, replace the sequence of tokens that makes
6527 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6528 token. That way, should we re-parse the token stream, we will
6529 not have to repeat the effort required to do the parse, nor will
6530 we issue duplicate error messages. */
6532 {
6536 /* Reset the contents of the START token. */
6538 /* Retrieve any deferred checks. Do not pop this access checks yet
6539 so the memory will not be reclaimed during token replacing below. */
6547 /* Purge all subsequent tokens. */
6549 }
6555 }
6557 /* Parse a nested-name-specifier. See
6558 cp_parser_nested_name_specifier_opt for details. This function
6559 behaves identically, except that it will an issue an error if no
6560 nested-name-specifier is present. */
6562 static tree
6568 {
6569 tree scope;
6571 /* Look for the nested-name-specifier. */
6573 typename_keyword_p,
6574 check_dependency_p,
6575 type_p,
6576 is_declaration);
6577 /* If it was not present, issue an error message. */
6579 {
6582 }
6585 }
6587 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6588 this is either a class-name or a namespace-name (which corresponds
6589 to the class-or-namespace-name production in the grammar). For
6590 C++0x, it can also be a type-name that refers to an enumeration
6591 type or a simple-template-id.
6593 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6594 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6595 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6596 TYPE_P is TRUE iff the next name should be taken as a class-name,
6597 even the same name is declared to be another entity in the same
6598 scope.
6600 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6601 specified by the class-or-namespace-name. If neither is found the
6602 ERROR_MARK_NODE is returned. */
6604 static tree
6611 {
6612 tree saved_scope;
6613 tree saved_qualifying_scope;
6614 tree saved_object_scope;
6615 tree scope;
6619 /* DR 743: decltype can appear in a nested-name-specifier. */
6621 {
6625 {
6628 }
6632 }
6634 /* Before we try to parse the class-name, we must save away the
6635 current PARSER->SCOPE since cp_parser_class_name will destroy
6636 it. */
6640 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6641 there is no need to look for a namespace-name. */
6642 only_class_p = template_keyword_p
6647 typename_keyword_p,
6648 template_keyword_p,
6650 check_dependency_p,
6652 is_declaration,
6655 /* If that didn't work, try for a namespace-name. */
6657 {
6658 /* Restore the saved scope. */
6662 /* If we are not looking at an identifier followed by the scope
6663 resolution operator, then this is not part of a
6664 nested-name-specifier. (Note that this function is only used
6665 to parse the components of a nested-name-specifier.) */
6670 }
6673 }
6675 /* Return true if we are looking at a compound-literal, false otherwise. */
6677 static bool
6679 {
6682 /* Skip tokens until the next token is a closing parenthesis.
6683 If we find the closing `)', and the next token is a `{', then
6684 we are looking at a compound-literal. */
6685 bool compound_literal_p
6690 /* Roll back the tokens we skipped. */
6694 }
6696 /* Return true if EXPR is the integer constant zero or a complex constant
6697 of zero, without any folding, but ignoring location wrappers. */
6699 bool
6701 {
6704 }
6706 /* Parse a postfix-expression.
6708 postfix-expression:
6709 primary-expression
6710 postfix-expression [ expression ]
6711 postfix-expression ( expression-list [opt] )
6712 simple-type-specifier ( expression-list [opt] )
6713 typename :: [opt] nested-name-specifier identifier
6714 ( expression-list [opt] )
6715 typename :: [opt] nested-name-specifier template [opt] template-id
6716 ( expression-list [opt] )
6717 postfix-expression . template [opt] id-expression
6718 postfix-expression -> template [opt] id-expression
6719 postfix-expression . pseudo-destructor-name
6720 postfix-expression -> pseudo-destructor-name
6721 postfix-expression ++
6722 postfix-expression --
6723 dynamic_cast < type-id > ( expression )
6724 static_cast < type-id > ( expression )
6725 reinterpret_cast < type-id > ( expression )
6726 const_cast < type-id > ( expression )
6727 typeid ( expression )
6728 typeid ( type-id )
6730 GNU Extension:
6732 postfix-expression:
6733 ( type-id ) { initializer-list , [opt] }
6735 This extension is a GNU version of the C99 compound-literal
6736 construct. (The C99 grammar uses `type-name' instead of `type-id',
6737 but they are essentially the same concept.)
6739 If ADDRESS_P is true, the postfix expression is the operand of the
6740 `&' operator. CAST_P is true if this expression is the target of a
6741 cast.
6743 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6744 class member access expressions [expr.ref].
6746 Returns a representation of the expression. */
6748 static cp_expr
6752 {
6754 location_t loc;
6760 /* Peek at the next token. */
6765 /* Some of the productions are determined by keywords. */
6768 {
6773 {
6774 tree type;
6775 cp_expr expression;
6779 /* All of these can be handled in the same way from the point
6780 of view of parsing. Begin by consuming the token
6781 identifying the cast. */
6784 /* New types cannot be defined in the cast. */
6786 parser->type_definition_forbidden_message
6789 /* Look for the opening `<'. */
6791 /* Parse the type to which we are casting. */
6796 /* Look for the closing `>'. */
6798 /* Restore the old message. */
6801 bool saved_greater_than_is_operator_p
6805 /* And the expression which is being cast. */
6806 matching_parens parens;
6810 RT_CLOSE_PAREN);
6814 parser->greater_than_is_operator_p
6817 /* Only type conversions to integral or enumeration types
6818 can be used in constant-expressions. */
6821 {
6824 }
6827 {
6829 postfix_expression
6833 postfix_expression
6837 postfix_expression
6839 tf_warning_or_error);
6842 postfix_expression
6847 }
6849 /* Construct a location e.g. :
6850 reinterpret_cast <int *> (expr)
6851 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6852 ranging from the start of the "*_cast" token to the final closing
6853 paren, with the caret at the start. */
6856 }
6860 {
6861 tree type;
6865 /* Consume the `typeid' token. */
6867 /* Look for the `(' token. */
6868 matching_parens parens;
6870 /* Types cannot be defined in a `typeid' expression. */
6872 parser->type_definition_forbidden_message
6874 /* We can't be sure yet whether we're looking at a type-id or an
6875 expression. */
6877 /* Try a type-id first. */
6882 /* Look for the `)' token. Otherwise, we can't be sure that
6883 we're not looking at an expression: consider `typeid (int
6884 (3))', for example. */
6886 /* If all went well, simply lookup the type-id. */
6889 /* Otherwise, fall back to the expression variant. */
6890 else
6891 {
6892 tree expression;
6894 /* Look for an expression. */
6896 /* Compute its typeid. */
6898 /* Look for the `)' token. */
6900 }
6901 /* Restore the saved message. */
6903 /* `typeid' may not appear in an integral constant expression. */
6907 /* Construct a location e.g. :
6908 typeid (expr)
6909 ^~~~~~~~~~~~~
6910 ranging from the start of the "typeid" token to the final closing
6911 paren, with the caret at the start. */
6913 {
6914 location_t typeid_loc
6918 }
6919 }
6923 {
6924 tree type;
6925 /* The syntax permitted here is the same permitted for an
6926 elaborated-type-specifier. */
6933 }
6939 {
6942 tree p;
6949 {
6952 }
6958 {
6961 postfix_expression
6963 else
6964 {
6968 }
6974 tf_warning_or_error);
6975 else
6976 {
6980 }
6985 postfix_expression
6989 postfix_expression
6992 else
6993 {
6997 }
7002 }
7004 }
7007 {
7008 tree type;
7010 /* If the next thing is a simple-type-specifier, we may be
7011 looking at a functional cast. We could also be looking at
7012 an id-expression. So, we try the functional cast, and if
7013 that doesn't work we fall back to the primary-expression. */
7015 /* Look for the simple-type-specifier. */
7019 CP_PARSER_FLAGS_NONE);
7021 /* Parse the cast itself. */
7023 postfix_expression
7025 /* If that worked, we're done. */
7029 /* If the functional-cast didn't work out, try a
7030 compound-literal. */
7033 {
7038 matching_parens parens;
7041 /* Avoid calling cp_parser_type_id pointlessly, see comment
7042 in cp_parser_cast_expression about c++/29234. */
7045 else
7046 {
7047 /* Parse the type. */
7053 }
7055 /* If things aren't going well, there's no need to
7056 keep going. */
7058 {
7060 /* Parse the brace-enclosed initializer list. */
7063 }
7064 /* If that worked, we're definitely looking at a
7065 compound-literal expression. */
7067 {
7068 /* Warn the user that a compound literal is not
7069 allowed in standard C++. */
7072 /* For simplicity, we disallow compound literals in
7073 constant-expressions. We could
7074 allow compound literals of integer type, whose
7075 initializer was a constant, in constant
7076 expressions. Permitting that usage, as a further
7077 extension, would not change the meaning of any
7078 currently accepted programs. (Of course, as
7079 compound literals are not part of ISO C++, the
7080 standard has nothing to say.) */
7082 NIC_NCC))
7083 {
7086 }
7087 /* Form the representation of the compound-literal. */
7088 postfix_expression
7093 }
7094 }
7096 /* It must be a primary-expression. */
7097 postfix_expression
7100 decltype_p,
7102 }
7104 }
7106 /* Note that we don't need to worry about calling build_cplus_new on a
7107 class-valued CALL_EXPR in decltype when it isn't the end of the
7108 postfix-expression; unary_complex_lvalue will take care of that for
7109 all these cases. */
7111 /* Keep looping until the postfix-expression is complete. */
7113 {
7117 /* It is not a Koenig lookup function call. */
7118 postfix_expression
7121 /* Peek at the next token. */
7125 {
7128 {
7130 "two consecutive %<[%> shall "
7133 }
7134 postfix_expression
7136 postfix_expression,
7138 decltype_p);
7147 /* postfix-expression ( expression-list [opt] ) */
7148 {
7159 is_builtin_constant_p
7162 {
7163 /* The whole point of __builtin_constant_p is to allow
7164 non-constant expressions to appear as arguments. */
7165 saved_integral_constant_expression_p
7167 saved_non_integral_constant_expression_p
7170 }
7171 args = (cp_parser_parenthesized_expression_list
7178 {
7179 parser->integral_constant_expression_p
7181 parser->non_integral_constant_expression_p
7183 }
7186 {
7189 }
7191 /* Function calls are not permitted in
7192 constant-expressions. */
7195 NIC_FUNC_CALL))
7196 {
7200 }
7205 {
7207 /* In C++2A, we may need to perform ADL for a template
7208 name. */
7211 {
7213 {
7216 postfix_expression
7218 complain);
7219 }
7220 else
7221 postfix_expression
7223 }
7224 /* We do not perform argument-dependent lookup if
7225 normal lookup finds a non-function, in accordance
7226 with the expected resolution of DR 218. */
7229 {
7233 /* Do not do argument dependent lookup if regular
7234 lookup finds a member function or a block-scope
7235 function declaration. [basic.lookup.argdep]/3 */
7238 {
7241 postfix_expression
7243 complain);
7244 }
7245 }
7246 }
7249 {
7259 {
7261 postfix_expression
7265 }
7268 {
7269 postfix_expression
7270 = (build_new_method_call
7276 complain));
7277 }
7278 else
7279 postfix_expression
7283 complain);
7284 }
7288 postfix_expression = (build_offset_ref_call_from_tree
7290 complain));
7292 /* A call to a static class member, or a namespace-scope
7293 function. */
7294 postfix_expression
7297 koenig_p,
7298 complain);
7299 else
7300 /* All other function calls. */
7301 postfix_expression
7304 koenig_p,
7305 complain);
7308 {
7310 start_loc,
7311 close_paren_loc);
7313 }
7315 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7319 }
7324 /* postfix-expression . template [opt] id-expression
7325 postfix-expression . pseudo-destructor-name
7326 postfix-expression -> template [opt] id-expression
7327 postfix-expression -> pseudo-destructor-name */
7329 /* Consume the `.' or `->' operator. */
7332 postfix_expression
7334 postfix_expression,
7341 /* postfix-expression ++ */
7342 /* Consume the `++' token. */
7344 /* Generate a representation for the complete expression. */
7345 postfix_expression
7347 POSTINCREMENT_EXPR);
7348 /* Increments may not appear in constant-expressions. */
7356 /* postfix-expression -- */
7357 /* Consume the `--' token. */
7359 /* Generate a representation for the complete expression. */
7360 postfix_expression
7362 POSTDECREMENT_EXPR);
7363 /* Decrements may not appear in constant-expressions. */
7374 return is_member_access
7375 ? postfix_expression
7377 else
7379 }
7380 }
7382 /* We should never get here. */
7385 }
7387 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7388 by cp_parser_builtin_offsetof. We're looking for
7390 postfix-expression [ expression ]
7391 postfix-expression [ braced-init-list ] (C++11)
7393 FOR_OFFSETOF is set if we're being called in that context, which
7394 changes how we deal with integer constant expressions. */
7396 static tree
7398 tree postfix_expression,
7401 {
7406 /* Consume the `[' token. */
7412 /* Parse the index expression. */
7413 /* ??? For offsetof, there is a question of what to allow here. If
7414 offsetof is not being used in an integral constant expression context,
7415 then we *could* get the right answer by computing the value at runtime.
7416 If we are in an integral constant expression context, then we might
7417 could accept any constant expression; hard to say without analysis.
7418 Rather than open the barn door too wide right away, allow only integer
7419 constant expressions here. */
7422 else
7423 {
7425 {
7430 }
7431 else
7433 }
7437 /* Look for the closing `]'. */
7440 /* Build the ARRAY_REF. */
7444 /* When not doing offsetof, array references are not permitted in
7445 constant-expressions. */
7451 }
7453 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7454 dereference of incomplete type, returns true if error_mark_node should
7455 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7456 and *DEPENDENT_P. */
7458 bool
7461 {
7462 /* In a template, be permissive by treating an object expression
7463 of incomplete type as dependent (after a pedwarn). */
7464 diagnostic_t kind = (processing_template_decl
7468 {
7480 /* Don't emit any diagnostic for OVERLOADs. */
7484 /* Avoid clobbering e.g. DECLs. */
7488 }
7500 {
7503 }
7505 }
7507 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7508 by cp_parser_builtin_offsetof. We're looking for
7510 postfix-expression . template [opt] id-expression
7511 postfix-expression . pseudo-destructor-name
7512 postfix-expression -> template [opt] id-expression
7513 postfix-expression -> pseudo-destructor-name
7515 FOR_OFFSETOF is set if we're being called in that context. That sorta
7516 limits what of the above we'll actually accept, but nevermind.
7517 TOKEN_TYPE is the "." or "->" token, which will already have been
7518 removed from the stream. */
7520 static tree
7523 cp_expr postfix_expression,
7525 location_t location)
7526 {
7527 tree name;
7533 /* If this is a `->' operator, dereference the pointer. */
7536 tf_warning_or_error);
7537 /* Check to see whether or not the expression is type-dependent and
7538 not the current instantiation. */
7540 /* The identifier following the `->' or `.' is not qualified. */
7546 /* Enter the scope corresponding to the type of the object
7547 given by the POSTFIX_EXPRESSION. */
7549 {
7551 /* According to the standard, no expression should ever have
7552 reference type. Unfortunately, we do not currently match
7553 the standard in this respect in that our internal representation
7554 of an expression may have reference type even when the standard
7555 says it does not. Therefore, we have to manually obtain the
7556 underlying type here. */
7558 /* The type of the POSTFIX_EXPRESSION must be complete. */
7559 /* Unlike the object expression in other contexts, *this is not
7560 required to be of complete type for purposes of class member
7561 access (5.2.5) outside the member function body. */
7565 {
7571 }
7574 {
7575 /* Let the name lookup machinery know that we are processing a
7576 class member access expression. */
7578 /* If something went wrong, we want to be able to discern that case,
7579 as opposed to the case where there was no SCOPE due to the type
7580 of expression being dependent. */
7583 /* If the SCOPE was erroneous, make the various semantic analysis
7584 functions exit quickly -- and without issuing additional error
7585 messages. */
7588 }
7589 }
7592 /* Tell cp_parser_lookup_name that there was an object, even though it's
7593 type-dependent. */
7596 /* Assume this expression is not a pseudo-destructor access. */
7599 /* If the SCOPE is a scalar type, then, if this is a valid program,
7600 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7601 is type dependent, it can be pseudo-destructor-name or something else.
7602 Try to parse it as pseudo-destructor-name first. */
7604 {
7605 tree s;
7606 tree type;
7609 /* Parse the pseudo-destructor-name. */
7618 {
7620 postfix_expression
7623 }
7624 }
7627 {
7628 /* If the SCOPE is not a scalar type, we are looking at an
7629 ordinary class member access expression, rather than a
7630 pseudo-destructor-name. */
7633 /* Parse the id-expression. */
7634 name = (cp_parser_id_expression
7641 /* In general, build a SCOPE_REF if the member name is qualified.
7642 However, if the name was not dependent and has already been
7643 resolved; there is no need to build the SCOPE_REF. For example;
7645 struct X { void f(); };
7646 template <typename T> void f(T* t) { t->X::f(); }
7648 Even though "t" is dependent, "X::f" is not and has been resolved
7649 to a BASELINK; there is no need to include scope information. */
7651 /* But we do need to remember that there was an explicit scope for
7652 virtual function calls. */
7656 /* If the name is a template-id that names a type, we will get a
7657 TYPE_DECL here. That is invalid code. */
7659 {
7662 }
7663 else
7664 {
7666 {
7668 {
7672 }
7673 else
7676 name,
7677 template_p);
7681 }
7683 adjust_result_of_qualified_name_lookup
7685 postfix_expression
7687 template_p,
7688 tf_warning_or_error);
7689 /* Build a location e.g.:
7690 ptr->access_expr
7691 ~~~^~~~~~~~~~~~~
7692 where the caret is at the deref token, ranging from
7693 the start of postfix_expression to the end of the access expr. */
7694 location_t end_loc
7696 location_t combined_loc
7699 }
7700 }
7702 /* We no longer need to look up names in the scope of the object on
7703 the left-hand side of the `.' or `->' operator. */
7706 /* Outside of offsetof, these operators may not appear in
7707 constant-expressions. */
7709 && (cp_parser_non_integral_constant_expression
7714 }
7716 /* Parse a parenthesized expression-list.
7718 expression-list:
7719 assignment-expression
7720 expression-list, assignment-expression
7722 attribute-list:
7723 expression-list
7724 identifier
7725 identifier, expression-list
7727 CAST_P is true if this expression is the target of a cast.
7729 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7730 argument pack.
7732 WRAP_LOCATIONS_P is true if expressions within this list for which
7733 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7734 their source locations.
7736 Returns a vector of trees. Each element is a representation of an
7737 assignment-expression. NULL is returned if the ( and or ) are
7738 missing. An empty, but allocated, vector is returned on no
7739 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7740 if we are parsing an attribute list for an attribute that wants a
7741 plain identifier argument, normal_attr for an attribute that wants
7742 an expression, or non_attr if we aren't parsing an attribute list. If
7743 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7744 not all of the expressions in the list were constant.
7745 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7746 will be written to with the location of the closing parenthesis. If
7747 an error occurs, it may or may not be written to. */
7757 {
7763 /* Assume all the expressions will be constant. */
7767 matching_parens parens;
7773 /* Within a parenthesized expression, a `>' token is always
7774 the greater-than operator. */
7775 saved_greater_than_is_operator_p
7781 /* Consume expressions until there are no more. */
7784 {
7785 /* At the beginning of attribute lists, check to see if the
7786 next token is an identifier. */
7789 {
7792 /* Consume the identifier. */
7794 /* Save the identifier. */
7796 }
7797 else
7798 {
7801 /* Parse the next assignment-expression. */
7803 {
7804 /* A braced-init-list. */
7810 }
7812 {
7813 expr = (cp_parser_constant_expression
7818 }
7819 else
7821 cast_p);
7826 /* If we have an ellipsis, then this is an expression
7827 expansion. */
7830 {
7831 /* Consume the `...'. */
7834 /* Build the argument pack. */
7836 }
7841 /* Add it to the list. We add error_mark_node
7842 expressions to the list, so that we can still tell if
7843 the correct form for a parenthesized expression-list
7844 is found. That gives better errors. */
7849 }
7851 /* After the first item, attribute lists look the same as
7852 expression lists. */
7855 get_comma:;
7856 /* If the next token isn't a `,', then we are done. */
7860 /* Otherwise, consume the `,' and keep going. */
7862 }
7868 {
7871 skip_comma:;
7872 /* We try and resync to an unnested comma, as that will give the
7873 user better diagnostics. */
7881 {
7882 parser->greater_than_is_operator_p
7885 }
7886 }
7888 parser->greater_than_is_operator_p
7895 }
7897 /* Parse a pseudo-destructor-name.
7899 pseudo-destructor-name:
7900 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7901 :: [opt] nested-name-specifier template template-id :: ~ type-name
7902 :: [opt] nested-name-specifier [opt] ~ type-name
7904 If either of the first two productions is used, sets *SCOPE to the
7905 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7906 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7907 or ERROR_MARK_NODE if the parse fails. */
7909 static void
7911 tree object,
7914 {
7917 /* Handle ~auto. */
7921 {
7924 "%<~auto%> only available with "
7931 }
7933 /* Assume that things will not work out. */
7936 /* Look for the optional `::' operator. */
7938 /* Look for the optional nested-name-specifier. */
7939 nested_name_specifier_p
7946 /* Now, if we saw a nested-name-specifier, we might be doing the
7947 second production. */
7950 {
7951 /* Consume the `template' keyword. */
7953 /* Parse the template-id. */
7957 class_type,
7959 /* Look for the `::' token. */
7961 }
7962 /* If the next token is not a `~', then there might be some
7963 additional qualification. */
7965 {
7966 /* At this point, we're looking for "type-name :: ~". The type-name
7967 must not be a class-name, since this is a pseudo-destructor. So,
7968 it must be either an enum-name, or a typedef-name -- both of which
7969 are just identifiers. So, we peek ahead to check that the "::"
7970 and "~" tokens are present; if they are not, then we can avoid
7971 calling type_name. */
7975 {
7978 }
7980 /* Look for the type-name. */
7985 /* Look for the `::' token. */
7987 }
7988 else
7991 /* Look for the `~'. */
7994 /* Once we see the ~, this has to be a pseudo-destructor. */
7998 /* Look for the type-name again. We are not responsible for
7999 checking that it matches the first type-name. */
8001 }
8003 /* Parse a unary-expression.
8005 unary-expression:
8006 postfix-expression
8007 ++ cast-expression
8008 -- cast-expression
8009 unary-operator cast-expression
8010 sizeof unary-expression
8011 sizeof ( type-id )
8012 alignof ( type-id ) [C++0x]
8013 new-expression
8014 delete-expression
8016 GNU Extensions:
8018 unary-expression:
8019 __extension__ cast-expression
8020 __alignof__ unary-expression
8021 __alignof__ ( type-id )
8022 alignof unary-expression [C++0x]
8023 __real__ cast-expression
8024 __imag__ cast-expression
8025 && identifier
8026 sizeof ( type-id ) { initializer-list , [opt] }
8027 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
8028 __alignof__ ( type-id ) { initializer-list , [opt] }
8030 ADDRESS_P is true iff the unary-expression is appearing as the
8031 operand of the `&' operator. CAST_P is true if this expression is
8032 the target of a cast.
8034 Returns a representation of the expression. */
8036 static cp_expr
8039 {
8043 /* Peek at the next token. */
8045 /* Some keywords give away the kind of expression. */
8047 {
8051 {
8054 {
8062 /* Consume the token. */
8064 /* Parse the operand. */
8070 else
8071 {
8072 /* ISO C++ defines alignof only with types, not with
8073 expressions. So pedwarn if alignof is used with a non-
8074 type expression. However, __alignof__ is ok. */
8077 "ISO C++ does not allow %<alignof%> "
8081 }
8082 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8083 SIZEOF_EXPR with the original operand. */
8085 {
8087 {
8089 {
8092 error_mark_node));
8094 }
8095 else
8099 }
8100 }
8102 /* Construct a location e.g. :
8103 alignof (expr)
8104 ^~~~~~~~~~~~~~
8105 with start == caret at the start of the "alignof"/"sizeof"
8106 token, with the endpoint at the final closing paren. */
8107 location_t finish_loc
8109 location_t compound_loc
8116 }
8125 {
8126 /* The saved value of the PEDANTIC flag. */
8128 tree expr;
8130 /* Save away the PEDANTIC flag. */
8132 /* Parse the cast-expression. */
8134 /* Restore the PEDANTIC flag. */
8138 }
8142 {
8143 tree expression;
8145 /* Consume the `__real__' or `__imag__' token. */
8147 /* Parse the cast-expression. */
8149 /* Create the complete representation. */
8153 expression,
8154 tf_warning_or_error);
8155 }
8163 {
8164 tree expr;
8173 matching_parens parens;
8177 parser->type_definition_forbidden_message
8180 saved_integral_constant_expression_p
8182 saved_non_integral_constant_expression_p
8186 saved_greater_than_is_operator_p
8198 parser->greater_than_is_operator_p
8201 parser->integral_constant_expression_p
8203 parser->non_integral_constant_expression_p
8208 location_t finish_loc
8212 /* Construct a location of the form:
8213 noexcept (expr)
8214 ^~~~~~~~~~~~~~~
8215 with start == caret, finishing at the close-paren. */
8216 location_t noexcept_loc
8220 noexcept_loc);
8221 }
8225 }
8226 }
8228 /* Look for the `:: new' and `:: delete', which also signal the
8229 beginning of a new-expression, or delete-expression,
8230 respectively. If the next token is `::', then it might be one of
8231 these. */
8233 {
8236 /* See if the token after the `::' is one of the keywords in
8237 which we're interested. */
8239 /* If it's `new', we have a new-expression. */
8242 /* Similarly, for `delete'. */
8245 }
8247 /* Look for a unary operator. */
8249 /* The `++' and `--' operators can be handled similarly, even though
8250 they are not technically unary-operators in the grammar. */
8252 {
8257 /* Handle the GNU address-of-label extension. */
8260 {
8261 tree identifier;
8262 tree expression;
8265 /* Consume the '&&' token. */
8267 /* Look for the identifier. */
8268 location_t finish_loc
8271 /* Construct a location of the form:
8272 &&label
8273 ^~~~~~~
8274 with caret==start at the "&&", finish at the end of the label. */
8275 location_t combined_loc
8277 /* Create an expression representing the address. */
8280 NIC_ADDR_LABEL))
8283 }
8284 }
8286 {
8287 cp_expr cast_expression;
8293 /* Consume the operator token. */
8297 /* Parse the cast-expression. */
8298 cast_expression
8303 pidk);
8305 /* Make a location:
8306 OP_TOKEN CAST_EXPRESSION
8307 ^~~~~~~~~~~~~~~~~~~~~~~~~
8308 with start==caret at the operator token, and
8309 extending to the end of the cast_expression. */
8312 /* Now, build an appropriate representation. */
8314 {
8318 RO_UNARY_STAR,
8319 complain);
8320 /* TODO: build_x_indirect_ref does not always honor the
8321 location, so ensure it is set. */
8327 /* Fall through. */
8330 cast_expression,
8331 complain);
8332 /* TODO: build_x_unary_op does not always honor the location,
8333 so ensure it is set. */
8341 /* Fall through. */
8343 /* Immediately fold negation of a constant, unless the constant is 0
8344 (since -0 == 0) or it would overflow. */
8349 {
8352 cast_expression);
8354 {
8357 }
8358 }
8359 /* Fall through. */
8368 }
8372 non_constant_p))
8376 }
8380 decltype_p,
8381 pidk);
8382 }
8384 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8385 unary-operator, the corresponding tree code is returned. */
8387 static enum tree_code
8389 {
8391 {
8412 }
8413 }
8415 /* Parse a new-expression.
8417 new-expression:
8418 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8419 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8421 Returns a representation of the expression. */
8423 static tree
8425 {
8428 tree type;
8431 tree ret;
8435 /* Look for the optional `::' operator. */
8436 global_scope_p
8440 /* Look for the `new' operator. */
8442 /* There's no easy way to tell a new-placement from the
8443 `( type-id )' construct. */
8445 /* Look for a new-placement. */
8447 /* If that didn't work out, there's no new-placement. */
8449 {
8453 }
8455 /* If the next token is a `(', then we have a parenthesized
8456 type-id. */
8458 {
8462 /* Consume the `('. */
8463 matching_parens parens;
8466 /* Parse the type-id. */
8467 parser->type_definition_forbidden_message
8469 {
8472 }
8475 /* Look for the closing `)'. */
8478 /* There should not be a direct-new-declarator in this production,
8479 but GCC used to allowed this, so we check and emit a sensible error
8480 message for this case. */
8482 {
8488 }
8489 }
8490 /* Otherwise, there must be a new-type-id. */
8491 else
8494 /* If the next token is a `(' or '{', then we have a new-initializer. */
8499 else
8502 /* A new-expression may not appear in an integral constant
8503 expression. */
8506 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8507 of a new-type-id or type-id of a new-expression, the new-expression shall
8508 contain a new-initializer of the form ( assignment-expression )".
8509 Additionally, consistently with the spirit of DR 1467, we want to accept
8510 'new auto { 2 }' too. */
8516 {
8518 "initialization of new-expression for type %<auto%> "
8521 }
8522 else
8523 {
8524 /* Construct a location e.g.:
8525 ptr = new int[100]
8526 ^~~~~~~~~~~~
8527 with caret == start at the start of the "new" token, and the end
8528 at the end of the final token we consumed. */
8533 /* Create a representation of the new-expression. */
8535 tf_warning_or_error);
8537 }
8545 }
8547 /* Parse a new-placement.
8549 new-placement:
8550 ( expression-list )
8552 Returns the same representation as for an expression-list. */
8556 {
8559 /* Parse the expression-list. */
8560 expression_list = (cp_parser_parenthesized_expression_list
8569 }
8571 /* Parse a new-type-id.
8573 new-type-id:
8574 type-specifier-seq new-declarator [opt]
8576 Returns the TYPE allocated. If the new-type-id indicates an array
8577 type, *NELTS is set to the number of elements in the last array
8578 bound; the TYPE will not include the last array bound. */
8580 static tree
8582 {
8583 cp_decl_specifier_seq type_specifier_seq;
8589 /* The type-specifier sequence must not contain type definitions.
8590 (It cannot contain declarations of new types either, but if they
8591 are not definitions we will catch that because they are not
8592 complete.) */
8594 parser->type_definition_forbidden_message
8596 /* Parse the type-specifier-seq. */
8600 /* Restore the old message. */
8606 /* Parse the new-declarator. */
8609 /* Determine the number of elements in the last array dimension, if
8610 any. */
8612 /* Skip down to the last array dimension. */
8617 {
8620 }
8625 {
8628 }
8631 {
8638 else
8640 }
8643 }
8645 /* Parse an (optional) new-declarator.
8647 new-declarator:
8648 ptr-operator new-declarator [opt]
8649 direct-new-declarator
8651 Returns the declarator. */
8655 {
8658 cp_cv_quals cv_quals;
8660 /* We don't know if there's a ptr-operator next, or not. */
8662 /* Look for a ptr-operator. */
8664 /* If that worked, look for more new-declarators. */
8666 {
8669 /* Parse another optional declarator. */
8672 declarator = cp_parser_make_indirect_declarator
8676 }
8678 /* If the next token is a `[', there is a direct-new-declarator. */
8683 }
8685 /* Parse a direct-new-declarator.
8687 direct-new-declarator:
8688 [ expression ]
8689 direct-new-declarator [constant-expression]
8691 */
8695 {
8699 {
8700 tree expression;
8703 /* Look for the opening `['. */
8708 /* The standard requires that the expression have integral
8709 type. DR 74 adds enumeration types. We believe that the
8710 real intent is that these expressions be handled like the
8711 expression in a `switch' condition, which also allows
8712 classes with a single conversion to integral or
8713 enumeration type. */
8715 {
8716 expression
8718 expression,
8721 {
8723 "expression in new-declarator must have integral "
8726 }
8727 }
8729 /* Look for the closing `]'. */
8732 /* Add this bound to the declarator. */
8735 /* If the next token is not a `[', then there are no more
8736 bounds. */
8739 }
8742 }
8744 /* Parse a new-initializer.
8746 new-initializer:
8747 ( expression-list [opt] )
8748 braced-init-list
8750 Returns a representation of the expression-list. */
8754 {
8758 {
8759 tree t;
8766 }
8767 else
8768 expression_list = (cp_parser_parenthesized_expression_list
8774 }
8776 /* Parse a delete-expression.
8778 delete-expression:
8779 :: [opt] delete cast-expression
8780 :: [opt] delete [ ] cast-expression
8782 Returns a representation of the expression. */
8784 static tree
8786 {
8789 tree expression;
8791 /* Look for the optional `::' operator. */
8792 global_scope_p
8796 /* Look for the `delete' keyword. */
8798 /* See if the array syntax is in use. */
8800 {
8801 /* Consume the `[' token. */
8803 /* Look for the `]' token. */
8805 /* Remember that this is the `[]' construct. */
8807 }
8808 else
8811 /* Parse the cast-expression. */
8814 /* A delete-expression may not appear in an integral constant
8815 expression. */
8820 tf_warning_or_error);
8821 }
8823 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8824 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8825 0 otherwise. */
8827 static int
8829 {
8832 {
8874 /* In ((type ()) () the last () isn't a valid cast-expression,
8875 so the whole must be parsed as postfix-expression. */
8880 /* '[' may start a primary-expression in obj-c++ and in C++11,
8881 as a lambda-expression, eg, '(void)[]{}'. */
8888 /* '++' and '--' may or may not start a cast-expression:
8890 struct T { void operator++(int); };
8891 void f() { (T())++; }
8893 vs
8895 int a;
8896 (int)++a; */
8901 }
8902 }
8904 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8905 in the order: const_cast, static_cast, reinterpret_cast.
8907 Don't suggest dynamic_cast.
8909 Return the first legal cast kind found, or NULL otherwise. */
8913 {
8914 tree trial;
8916 /* Reuse the parser logic by attempting to build the various kinds of
8917 cast, with "complain" disabled.
8918 Identify the first such cast that is valid. */
8920 /* Don't attempt to run such logic within template processing. */
8924 /* First try const_cast. */
8929 /* If that fails, try static_cast. */
8934 /* Finally, try reinterpret_cast. */
8939 /* No such cast possible. */
8941 }
8943 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8944 suggesting how to convert a C-style cast of the form:
8946 (DST_TYPE)ORIG_EXPR
8948 to a C++-style cast.
8950 The primary range of RICHLOC is asssumed to be that of the original
8951 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8952 of the parens in the C-style cast. */
8954 static void
8957 tree dst_type)
8958 {
8959 /* This function is non-trivial, so bail out now if the warning isn't
8960 going to be emitted. */
8964 /* Try to find a legal C++ cast, trying them in order:
8965 const_cast, static_cast, reinterpret_cast. */
8970 /* Replace the open paren with "CAST_SUGGESTION<". */
8971 pretty_printer pp;
8975 /* Replace the close paren with "> (". */
8978 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8980 }
8983 /* Parse a cast-expression.
8985 cast-expression:
8986 unary-expression
8987 ( type-id ) cast-expression
8989 ADDRESS_P is true iff the unary-expression is appearing as the
8990 operand of the `&' operator. CAST_P is true if this expression is
8991 the target of a cast.
8993 Returns a representation of the expression. */
8995 static cp_expr
8998 {
8999 /* If it's a `(', then we might be looking at a cast. */
9001 {
9007 /* There's no way to know yet whether or not this is a cast.
9008 For example, `(int (3))' is a unary-expression, while `(int)
9009 3' is a cast. So, we resort to parsing tentatively. */
9011 /* Types may not be defined in a cast. */
9013 parser->type_definition_forbidden_message
9015 /* Consume the `('. */
9016 matching_parens parens;
9021 /* A very tricky bit is that `(struct S) { 3 }' is a
9022 compound-literal (which we permit in C++ as an extension).
9023 But, that construct is not a cast-expression -- it is a
9024 postfix-expression. (The reason is that `(struct S) { 3 }.i'
9025 is legal; if the compound-literal were a cast-expression,
9026 you'd need an extra set of parentheses.) But, if we parse
9027 the type-id, and it happens to be a class-specifier, then we
9028 will commit to the parse at that point, because we cannot
9029 undo the action that is done when creating a new class. So,
9030 then we cannot back up and do a postfix-expression.
9032 Another tricky case is the following (c++/29234):
9034 struct S { void operator () (); };
9036 void foo ()
9037 {
9038 ( S()() );
9039 }
9041 As a type-id we parse the parenthesized S()() as a function
9042 returning a function, groktypename complains and we cannot
9043 back up in this case either.
9045 Therefore, we scan ahead to the closing `)', and check to see
9046 if the tokens after the `)' can start a cast-expression. Otherwise
9047 we are dealing with an unary-expression, a postfix-expression
9048 or something else.
9050 Yet another tricky case, in C++11, is the following (c++/54891):
9052 (void)[]{};
9054 The issue is that usually, besides the case of lambda-expressions,
9055 the parenthesized type-id cannot be followed by '[', and, eg, we
9056 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
9057 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
9058 we don't commit, we try a cast-expression, then an unary-expression.
9060 Save tokens so that we can put them back. */
9063 /* We may be looking at a cast-expression. */
9066 cast_expression
9069 /* Roll back the tokens we skipped. */
9071 /* If we aren't looking at a cast-expression, simulate an error so
9072 that the call to cp_parser_error_occurred below returns true. */
9075 else
9076 {
9079 /* Look for the type-id. */
9081 /* Look for the closing `)'. */
9086 }
9088 /* Restore the saved message. */
9091 /* At this point this can only be either a cast or a
9092 parenthesized ctor such as `(T ())' that looks like a cast to
9093 function returning T. */
9095 {
9096 /* Only commit if the cast-expression doesn't start with
9097 '++', '--', or '[' in C++11. */
9105 pidk);
9108 {
9109 /* Warn about old-style casts, if so requested. */
9114 {
9120 }
9122 /* Only type conversions to integral or enumeration types
9123 can be used in constant-expressions. */
9126 NIC_CAST))
9129 /* Perform the cast. */
9130 /* Make a location:
9131 (TYPE) EXPR
9132 ^~~~~~~~~~~
9133 with start==caret at the open paren, extending to the
9134 end of "expr". */
9136 open_paren_loc,
9140 }
9141 }
9142 else
9144 }
9146 /* If we get here, then it's not a cast, so it must be a
9147 unary-expression. */
9150 }
9152 /* Parse a binary expression of the general form:
9154 pm-expression:
9155 cast-expression
9156 pm-expression .* cast-expression
9157 pm-expression ->* cast-expression
9159 multiplicative-expression:
9160 pm-expression
9161 multiplicative-expression * pm-expression
9162 multiplicative-expression / pm-expression
9163 multiplicative-expression % pm-expression
9165 additive-expression:
9166 multiplicative-expression
9167 additive-expression + multiplicative-expression
9168 additive-expression - multiplicative-expression
9170 shift-expression:
9171 additive-expression
9172 shift-expression << additive-expression
9173 shift-expression >> additive-expression
9175 relational-expression:
9176 shift-expression
9177 relational-expression < shift-expression
9178 relational-expression > shift-expression
9179 relational-expression <= shift-expression
9180 relational-expression >= shift-expression
9182 GNU Extension:
9184 relational-expression:
9185 relational-expression <? shift-expression
9186 relational-expression >? shift-expression
9188 equality-expression:
9189 relational-expression
9190 equality-expression == relational-expression
9191 equality-expression != relational-expression
9193 and-expression:
9194 equality-expression
9195 and-expression & equality-expression
9197 exclusive-or-expression:
9198 and-expression
9199 exclusive-or-expression ^ and-expression
9201 inclusive-or-expression:
9202 exclusive-or-expression
9203 inclusive-or-expression | exclusive-or-expression
9205 logical-and-expression:
9206 inclusive-or-expression
9207 logical-and-expression && inclusive-or-expression
9209 logical-or-expression:
9210 logical-and-expression
9211 logical-or-expression || logical-and-expression
9213 All these are implemented with a single function like:
9215 binary-expression:
9216 simple-cast-expression
9217 binary-expression <token> binary-expression
9219 CAST_P is true if this expression is the target of a cast.
9221 The binops_by_token map is used to get the tree codes for each <token> type.
9222 binary-expressions are associated according to a precedence table. */
9224 #define TOKEN_PRECEDENCE(token) \
9225 (((token->type == CPP_GREATER \
9226 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9227 && !parser->greater_than_is_operator_p) \
9228 ? PREC_NOT_OPERATOR \
9229 : binops_by_token[token->type].prec)
9231 static cp_expr
9237 {
9238 cp_parser_expression_stack stack;
9240 cp_parser_expression_stack_entry current;
9241 cp_expr rhs;
9245 tree overload;
9247 /* Parse the first expression. */
9258 {
9259 /* Get an operator token. */
9265 {
9267 "%<>>%> operator is treated"
9271 }
9276 /* This is a fold-expression; handle it later. */
9279 /* Popping an entry off the stack means we completed a subexpression:
9280 - either we found a token which is not an operator (`>' where it is not
9281 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9282 will happen repeatedly;
9283 - or, we found an operator which has lower priority. This is the case
9284 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9285 parsing `3 * 4'. */
9287 {
9290 else
9292 }
9294 get_rhs:
9298 /* We used the operator token. */
9301 /* For "false && x" or "true || x", x will never be executed;
9302 disable warnings while evaluating it. */
9304 c_inhibit_evaluation_warnings +=
9307 c_inhibit_evaluation_warnings +=
9310 /* Extract another operand. It may be the RHS of this expression
9311 or the LHS of a new, higher priority expression. */
9316 /* Get another operator token. Look up its precedence to avoid
9317 building a useless (immediately popped) stack entry for common
9318 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9325 {
9326 /* ... and prepare to parse the RHS of the new, higher priority
9327 expression. Since precedence levels on the stack are
9328 monotonically increasing, we do not have to care about
9329 stack overflows. */
9338 pop:
9340 /* If the stack is not empty, we have parsed into LHS the right side
9341 (`4' in the example above) of an expression we had suspended.
9342 We can use the information on the stack to recover the LHS (`3')
9343 from the stack together with the tree code (`MULT_EXPR'), and
9344 the precedence of the higher level subexpression
9345 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9346 which will be used to actually build the additive expression. */
9351 }
9353 /* Undo the disabling of warnings done above. */
9355 c_inhibit_evaluation_warnings -=
9358 c_inhibit_evaluation_warnings -=
9364 /* Avoid warning for !!x == y. */
9369 /* Avoid warning for !b == y where b is boolean. */
9373 /* Avoid warning for !!b == y where b is boolean. */
9386 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9387 ERROR_MARK for everything that is not a binary expression.
9388 This makes warn_about_parentheses miss some warnings that
9389 involve unary operators. For unary expressions we should
9390 pass the correct tree_code unless the unary expression was
9391 surrounded by parentheses.
9392 */
9396 {
9399 else
9400 {
9401 current.lhs
9404 == tcc_comparison
9408 }
9409 }
9410 else
9411 {
9416 /* TODO: build_x_binary_op doesn't always honor the location. */
9418 }
9421 /* If the binary operator required the use of an overloaded operator,
9422 then this expression cannot be an integral constant-expression.
9423 An overloaded operator can be used even if both operands are
9424 otherwise permissible in an integral constant-expression if at
9425 least one of the operands is of enumeration type. */
9429 NIC_OVERLOADED))
9431 }
9434 }
9436 static cp_expr
9441 {
9444 }
9446 /* Parse the `? expression : assignment-expression' part of a
9447 conditional-expression. The LOGICAL_OR_EXPR is the
9448 logical-or-expression that started the conditional-expression.
9449 Returns a representation of the entire conditional-expression.
9451 This routine is used by cp_parser_assignment_expression.
9453 ? expression : assignment-expression
9455 GNU Extensions:
9457 ? : assignment-expression */
9459 static tree
9461 {
9463 cp_expr assignment_expr;
9467 /* Consume the `?' token. */
9472 {
9475 /* Implicit true clause. */
9477 c_inhibit_evaluation_warnings +=
9480 }
9481 else
9482 {
9485 /* Parse the expression. */
9486 c_inhibit_evaluation_warnings +=
9489 c_inhibit_evaluation_warnings +=
9493 }
9495 /* The next token should be a `:'. */
9497 /* Parse the assignment-expression. */
9499 c_inhibit_evaluation_warnings -=
9502 /* Make a location:
9503 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9504 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9505 with the caret at the "?", ranging from the start of
9506 the logical_or_expr to the end of the assignment_expr. */
9511 /* Build the conditional-expression. */
9513 expr,
9514 assignment_expr,
9515 tf_warning_or_error);
9516 }
9518 /* Parse an assignment-expression.
9520 assignment-expression:
9521 conditional-expression
9522 logical-or-expression assignment-operator assignment_expression
9523 throw-expression
9525 CAST_P is true if this expression is the target of a cast.
9526 DECLTYPE_P is true if this expression is the operand of decltype.
9528 Returns a representation for the expression. */
9530 static cp_expr
9533 {
9534 cp_expr expr;
9536 /* If the next token is the `throw' keyword, then we're looking at
9537 a throw-expression. */
9540 /* Otherwise, it must be that we are looking at a
9541 logical-or-expression. */
9542 else
9543 {
9544 /* Parse the binary expressions (logical-or-expression). */
9546 decltype_p,
9548 /* If the next token is a `?' then we're actually looking at a
9549 conditional-expression. */
9552 else
9553 {
9556 /* If it's an assignment-operator, we're using the second
9557 production. */
9558 enum tree_code assignment_operator
9561 {
9564 /* Parse the right-hand side of the assignment. */
9571 /* An assignment may not appear in a
9572 constant-expression. */
9574 NIC_ASSIGNMENT))
9576 /* Build the assignment expression. Its default
9577 location:
9578 LHS = RHS
9579 ~~~~^~~~~
9580 is the location of the '=' token as the
9581 caret, ranging from the start of the lhs to the
9582 end of the rhs. */
9587 assignment_operator,
9588 rhs,
9590 /* TODO: build_x_modify_expr doesn't honor the location,
9591 so we must set it here. */
9593 }
9594 }
9595 }
9598 }
9600 /* Parse an (optional) assignment-operator.
9602 assignment-operator: one of
9603 = *= /= %= += -= >>= <<= &= ^= |=
9605 GNU Extension:
9607 assignment-operator: one of
9608 <?= >?=
9610 If the next token is an assignment operator, the corresponding tree
9611 code is returned, and the token is consumed. For example, for
9612 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9613 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9614 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9615 operator, ERROR_MARK is returned. */
9617 static enum tree_code
9619 {
9623 /* Peek at the next token. */
9627 {
9673 /* Nothing else is an assignment operator. */
9675 }
9677 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9682 /* If it was an assignment operator, consume it. */
9687 }
9689 /* Parse an expression.
9691 expression:
9692 assignment-expression
9693 expression , assignment-expression
9695 CAST_P is true if this expression is the target of a cast.
9696 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9697 except possibly parenthesized or on the RHS of a comma (N3276).
9699 Returns a representation of the expression. */
9701 static cp_expr
9704 {
9709 {
9710 cp_expr assignment_expression;
9712 /* Parse the next assignment-expression. */
9713 assignment_expression
9716 /* We don't create a temporary for a call that is the immediate operand
9717 of decltype or on the RHS of a comma. But when we see a comma, we
9718 need to create a temporary for a call on the LHS. */
9723 assignment_expression
9727 /* If this is the first assignment-expression, we can just
9728 save it away. */
9731 else
9732 {
9733 /* Create a location with caret at the comma, ranging
9734 from the start of the LHS to the end of the RHS. */
9739 assignment_expression,
9742 }
9743 /* If the next token is not a comma, or we're in a fold-expression, then
9744 we are done with the expression. */
9748 /* Consume the `,'. */
9751 /* A comma operator cannot appear in a constant-expression. */
9754 }
9757 }
9759 /* Parse a constant-expression.
9761 constant-expression:
9762 conditional-expression
9764 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9765 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9766 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9767 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9768 only parse a conditional-expression, otherwise parse an
9769 assignment-expression. See below for rationale. */
9771 static cp_expr
9776 {
9780 cp_expr expression;
9782 /* It might seem that we could simply parse the
9783 conditional-expression, and then check to see if it were
9784 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9785 one that the compiler can figure out is constant, possibly after
9786 doing some simplifications or optimizations. The standard has a
9787 precise definition of constant-expression, and we must honor
9788 that, even though it is somewhat more restrictive.
9790 For example:
9792 int i[(2, 3)];
9794 is not a legal declaration, because `(2, 3)' is not a
9795 constant-expression. The `,' operator is forbidden in a
9796 constant-expression. However, GCC's constant-folding machinery
9797 will fold this operation to an INTEGER_CST for `3'. */
9799 /* Save the old settings. */
9801 saved_allow_non_integral_constant_expression_p
9804 /* We are now parsing a constant-expression. */
9806 parser->allow_non_integral_constant_expression_p
9809 /* Although the grammar says "conditional-expression", when not STRICT_P,
9810 we parse an "assignment-expression", which also permits
9811 "throw-expression" and the use of assignment operators. In the case
9812 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9813 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9814 actually essential that we look for an assignment-expression.
9815 For example, cp_parser_initializer_clauses uses this function to
9816 determine whether a particular assignment-expression is in fact
9817 constant. */
9819 {
9820 /* Parse the binary expressions (logical-or-expression). */
9823 /* If the next token is a `?' then we're actually looking at
9824 a conditional-expression; otherwise we're done. */
9827 }
9828 else
9830 /* Restore the old settings. */
9831 parser->integral_constant_expression_p
9833 parser->allow_non_integral_constant_expression_p
9836 {
9837 /* Require an rvalue constant expression here; that's what our
9838 callers expect. Reference constant expressions are handled
9839 separately in e.g. cp_parser_template_argument. */
9848 }
9851 parser->non_integral_constant_expression_p
9855 }
9857 /* Parse __builtin_offsetof.
9859 offsetof-expression:
9860 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9862 offsetof-member-designator:
9863 id-expression
9864 | offsetof-member-designator "." id-expression
9865 | offsetof-member-designator "[" expression "]"
9866 | offsetof-member-designator "->" id-expression */
9868 static cp_expr
9870 {
9872 tree type;
9873 cp_expr expr;
9874 cp_id_kind dummy;
9876 location_t finish_loc;
9878 /* We're about to accept non-integral-constant things, but will
9879 definitely yield an integral constant expression. Save and
9880 restore these values around our local parsing. */
9886 /* Consume the "__builtin_offsetof" token. */
9888 /* Consume the opening `('. */
9889 matching_parens parens;
9891 /* Parse the type-id. */
9893 {
9895 parser->type_definition_forbidden_message
9899 }
9900 /* Look for the `,'. */
9904 /* Build the (type *)null that begins the traditional offsetof macro. */
9905 tree object_ptr
9907 tf_warning_or_error);
9909 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9913 {
9916 {
9918 /* offsetof-member-designator "[" expression "]" */
9924 /* offsetof-member-designator "->" identifier */
9927 /* FALLTHRU */
9930 /* offsetof-member-designator "." identifier */
9938 /* Consume the ")" token. */
9944 /* Error. We know the following require will fail, but
9945 that gives the proper error message. */
9950 }
9951 }
9953 success:
9954 /* Make a location of the form:
9955 __builtin_offsetof (struct s, f)
9956 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9957 with caret at the type-id, ranging from the start of the
9958 "_builtin_offsetof" token to the close paren. */
9960 /* The result will be an INTEGER_CST, so we need to explicitly
9961 preserve the location. */
9964 failure:
9970 }
9972 /* Parse a trait expression.
9974 Returns a representation of the expression, the underlying type
9975 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9977 static cp_expr
9979 {
9980 cp_trait_kind kind;
9986 {
10088 }
10090 /* Get location of initial token. */
10093 /* Consume the token. */
10096 matching_parens parens;
10099 {
10102 }
10108 {
10111 {
10114 }
10118 }
10120 {
10122 {
10126 {
10129 }
10133 }
10134 }
10139 /* Construct a location of the form:
10140 __is_trivially_copyable(_Tp)
10141 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10142 with start == caret, finishing at the close-paren. */
10145 /* Complete the trait expression, which may mean either processing
10146 the trait expr now or saving it for template instantiation. */
10148 {
10157 }
10158 }
10160 /* Parse a lambda expression.
10162 lambda-expression:
10163 lambda-introducer lambda-declarator [opt] compound-statement
10165 Returns a representation of the expression. */
10167 static cp_expr
10169 {
10171 tree type;
10181 {
10183 {
10185 "lambda-expression in unevaluated context"
10188 }
10190 }
10192 {
10194 {
10198 }
10200 }
10202 /* We may be in the middle of deferred access check. Disable
10203 it now. */
10216 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10219 /* Now that we've started the type, add the capture fields for any
10220 explicit captures. */
10223 {
10224 /* Inside the class, surrounding template-parameter-lists do not apply. */
10225 unsigned int saved_num_template_parameter_lists
10229 bool fully_implicit_function_template_p
10233 bool auto_is_implicit_function_template_parm_p
10244 /* By virtue of defining a local class, a lambda expression has access to
10245 the private variables of enclosing classes. */
10256 {
10258 }
10260 {
10263 }
10265 /* The capture list was built up in reverse order; fix that now. */
10277 parser->fully_implicit_function_template_p
10281 parser->auto_is_implicit_function_template_parm_p
10283 }
10285 /* This field is only used during parsing of the lambda. */
10288 /* This lambda shouldn't have any proxies left at this point. */
10290 /* And now that we're done, push proxies for an enclosing lambda. */
10293 /* Update the lambda expression to a range. */
10301 else
10309 }
10311 /* Parse the beginning of a lambda expression.
10313 lambda-introducer:
10314 [ lambda-capture [opt] ]
10316 LAMBDA_EXPR is the current representation of the lambda expression. */
10318 static void
10320 {
10321 /* Need commas after the first capture. */
10324 /* Eat the leading `['. */
10327 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10335 {
10341 }
10344 {
10346 tree capture_id;
10347 tree capture_init_expr;
10351 enum capture_kind_type
10352 {
10353 BY_COPY,
10354 BY_REFERENCE
10355 };
10359 {
10362 }
10366 else
10369 /* Possibly capture `this'. */
10371 {
10382 explicit_init_p);
10384 }
10386 /* Possibly capture `*this'. */
10389 {
10400 explicit_init_p);
10402 }
10406 {
10413 }
10415 /* Remember whether we want to capture as a reference or not. */
10417 {
10420 }
10422 /* Get the identifier. */
10427 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10428 delimiters, but I modified this to stop on unnested ']' as well. It
10429 was already changed to stop on unnested '}', so the
10430 "closing_parenthesis" name is no more misleading with my change. */
10431 {
10437 }
10439 /* Find the initializer for this capture. */
10443 {
10445 /* An explicit initializer exists. */
10448 "lambda capture initializers "
10454 {
10457 }
10460 }
10461 else
10462 {
10465 /* Turn the identifier into an id-expression. */
10466 capture_init_expr
10471 {
10474 }
10477 {
10480 capture_init_expr);
10485 }
10488 {
10491 capture_init_expr))
10495 }
10497 capture_init_expr
10498 = finish_id_expression
10500 capture_init_expr,
10514 {
10517 }
10518 }
10522 {
10527 capture_id);
10531 "capture of %qD redundant with by-reference capture "
10533 }
10536 capture_id,
10537 capture_init_expr,
10539 explicit_init_p);
10541 /* If there is any qualification still in effect, clear it
10542 now; we will be starting fresh with the next capture. */
10546 }
10549 }
10551 /* Parse the (optional) middle of a lambda expression.
10553 lambda-declarator:
10554 < template-parameter-list [opt] >
10555 ( parameter-declaration-clause [opt] )
10556 attribute-specifier [opt]
10557 decl-specifier-seq [opt]
10558 exception-specification [opt]
10559 lambda-return-type-clause [opt]
10561 LAMBDA_EXPR is the current representation of the lambda expression. */
10563 static bool
10565 {
10566 /* 5.1.1.4 of the standard says:
10567 If a lambda-expression does not include a lambda-declarator, it is as if
10568 the lambda-declarator were ().
10569 This means an empty parameter list, no attributes, and no exception
10570 specification. */
10577 cp_decl_specifier_seq lambda_specs;
10580 /* The template-parameter-list is optional, but must begin with
10581 an opening angle if present. */
10583 {
10586 "lambda templates are only available with "
10590 "lambda templates are only available with "
10599 /* We just processed one more parameter list. */
10601 }
10603 /* The parameter-declaration-clause is optional (unless
10604 template-parameter-list was given), but must begin with an
10605 opening parenthesis if present. */
10607 {
10608 matching_parens parens;
10613 /* Parse parameters. */
10616 /* Default arguments shall not be specified in the
10617 parameter-declaration-clause of a lambda-declarator. */
10626 /* In the decl-specifier-seq of the lambda-declarator, each
10627 decl-specifier shall either be mutable or constexpr. */
10631 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10634 {
10639 }
10643 /* Parse optional exception specification. */
10648 /* Parse optional trailing return type. */
10650 {
10653 }
10655 /* The function parameters must be in scope all the way until after the
10656 trailing-return-type in case of decltype. */
10658 }
10662 /* Create the function call operator.
10664 Messing with declarators like this is no uglier than building up the
10665 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10666 other code. */
10667 {
10668 cp_decl_specifier_seq return_type_specs;
10670 tree fco;
10678 {
10682 else
10685 }
10694 VIRT_SPEC_UNSPECIFIED,
10695 REF_QUAL_NONE,
10696 tx_qual,
10697 exception_spec,
10698 return_type,
10704 declarator,
10705 NULL_TREE);
10707 {
10710 /* Give the object parameter a different name. */
10713 }
10715 {
10719 }
10728 }
10729 }
10731 /* Parse the body of a lambda expression, which is simply
10733 compound-statement
10735 but which requires special handling.
10736 LAMBDA_EXPR is the current representation of the lambda expression. */
10738 static void
10740 {
10745 /* The body of a lambda-expression is not a subexpression of the enclosing
10746 expression. */
10747 cp_evaluated ev;
10751 else
10752 /* Still increment function_depth so that we don't GC in the
10753 middle of an expression. */
10758 /* Clear this in case we're in the middle of a default argument. */
10762 {
10766 matching_braces braces;
10769 {
10772 /* Originally C++11 required us to peek for 'return expr'; and
10773 process it specially here to deduce the return type. N3638
10774 removed the need for that. */
10782 }
10785 }
10792 else
10794 }
10796 /* Statements [gram.stmt.stmt] */
10798 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10800 static void
10802 {
10806 /* A concept is never expanded normally. */
10812 }
10814 /* Parse a statement.
10816 statement:
10817 labeled-statement
10818 expression-statement
10819 compound-statement
10820 selection-statement
10821 iteration-statement
10822 jump-statement
10823 declaration-statement
10824 try-block
10826 C++11:
10828 statement:
10829 labeled-statement
10830 attribute-specifier-seq (opt) expression-statement
10831 attribute-specifier-seq (opt) compound-statement
10832 attribute-specifier-seq (opt) selection-statement
10833 attribute-specifier-seq (opt) iteration-statement
10834 attribute-specifier-seq (opt) jump-statement
10835 declaration-statement
10836 attribute-specifier-seq (opt) try-block
10838 init-statement:
10839 expression-statement
10840 simple-declaration
10842 TM Extension:
10844 statement:
10845 atomic-statement
10847 IN_COMPOUND is true when the statement is nested inside a
10848 cp_parser_compound_statement; this matters for certain pragmas.
10850 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10851 is a (possibly labeled) if statement which is not enclosed in braces
10852 and has an else clause. This is used to implement -Wparentheses.
10854 CHAIN is a vector of if-else-if conditions. */
10856 static void
10860 {
10865 restart:
10868 /* There is no statement yet. */
10874 /* In obj-c++, seeing '[[' might be the either the beginning of
10875 c++11 attributes, or a nested objc-message-expression. So
10876 let's parse the c++11 attributes tentatively. */
10880 {
10883 }
10885 /* Peek at the next token. */
10887 /* Remember the location of the first token in the statement. */
10890 /* If this is a keyword, then that will often determine what kind of
10891 statement we have. */
10893 {
10897 {
10900 /* Looks like a labeled-statement with a case label.
10901 Parse the label, and then use tail recursion to parse
10902 the statement. */
10925 /* Objective-C++ exception-handling constructs. */
10939 /* This must be a namespace alias definition. */
10955 /* It might be a keyword like `int' that can start a
10956 declaration-statement. */
10958 }
10959 }
10961 {
10962 /* If the next token is a `:', then we are looking at a
10963 labeled-statement. */
10966 {
10967 /* Looks like a labeled-statement with an ordinary label.
10968 Parse the label, and then use tail recursion to parse
10969 the statement. */
10974 }
10975 }
10976 /* Anything that starts with a `{' must be a compound-statement. */
10979 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10980 a statement all its own. */
10982 {
10983 /* Only certain OpenMP pragmas are attached to statements, and thus
10984 are considered statements themselves. All others are not. In
10985 the context of a compound, accept the pragma as a "statement" and
10986 return so that we can check for a close brace. Otherwise we
10987 require a real statement and must go back and read one. */
10993 }
10995 {
10998 }
11000 /* Everything else must be a declaration-statement or an
11001 expression-statement. Try for the declaration-statement
11002 first, unless we are looking at a `;', in which case we know that
11003 we have an expression-statement. */
11005 {
11007 {
11009 {
11010 /* Attributes should be parsed as part of the the
11011 declaration, so let's un-parse them. */
11014 }
11017 /* Try to parse the declaration-statement. */
11019 /* If that worked, we're done. */
11022 }
11023 /* All preceding labels have been parsed at this point. */
11027 /* Look for an expression-statement instead. */
11030 /* Handle [[fallthrough]];. */
11032 {
11033 /* The next token after the fallthrough attribute is ';'. */
11035 {
11036 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11038 IFN_FALLTHROUGH,
11041 }
11042 else
11046 }
11047 }
11049 /* Set the line number for the statement. */
11053 /* Allow "[[fallthrough]];", but warn otherwise. */
11056 OPT_Wattributes,
11058 }
11060 /* Append ATTR to attribute list ATTRS. */
11062 static tree
11064 {
11070 }
11072 /* Parse the label for a labeled-statement, i.e.
11074 identifier :
11075 case constant-expression :
11076 default :
11078 GNU Extension:
11079 case constant-expression ... constant-expression : statement
11081 When a label is parsed without errors, the label is added to the
11082 parse tree by the finish_* functions, so this function doesn't
11083 have to return the label. */
11085 static void
11087 {
11092 /* The next token should be an identifier. */
11096 {
11099 }
11101 /* Remember whether this case or a user-defined label is allowed to fall
11102 through to. */
11107 {
11109 {
11113 /* Consume the `case' token. */
11115 /* Parse the constant-expression. */
11122 {
11123 /* Consume the `...' token. */
11129 /* We don't need to emit warnings here, as the common code
11130 will do this for us. */
11131 }
11132 else
11136 {
11140 }
11141 else
11144 expr);
11145 }
11149 /* Consume the `default' token. */
11153 {
11157 }
11158 else
11163 /* Anything else must be an ordinary label. */
11168 }
11170 /* Require the `:' token. */
11173 /* An ordinary label may optionally be followed by attributes.
11174 However, this is only permitted if the attributes are then
11175 followed by a semicolon. This is because, for backward
11176 compatibility, when parsing
11177 lab: __attribute__ ((unused)) int i;
11178 we want the attribute to attach to "i", not "lab". */
11181 {
11182 tree attrs;
11189 ;
11190 else
11192 }
11198 }
11200 /* Parse an expression-statement.
11202 expression-statement:
11203 expression [opt] ;
11205 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11206 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11207 indicates whether this expression-statement is part of an
11208 expression statement. */
11210 static tree
11212 {
11217 /* There might be attribute fallthrough. */
11220 /* If the next token is a ';', then there is no expression
11221 statement. */
11223 {
11227 {
11230 }
11231 }
11233 /* Handle [[fallthrough]];. */
11235 {
11236 /* The next token after the fallthrough attribute is ';'. */
11238 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11241 else
11245 }
11247 /* Allow "[[fallthrough]];", but warn otherwise. */
11252 /* Give a helpful message for "A<T>::type t;" and the like. */
11255 {
11262 {
11263 /* A::A a; */
11268 }
11269 }
11271 /* Consume the final `;'. */
11276 /* This is the final expression statement of a statement
11277 expression. */
11283 }
11285 /* Parse a compound-statement.
11287 compound-statement:
11288 { statement-seq [opt] }
11290 GNU extension:
11292 compound-statement:
11293 { label-declaration-seq [opt] statement-seq [opt] }
11295 label-declaration-seq:
11296 label-declaration
11297 label-declaration-seq label-declaration
11299 Returns a tree representing the statement. */
11301 static tree
11304 {
11305 tree compound_stmt;
11306 matching_braces braces;
11308 /* Consume the `{'. */
11315 /* Begin the compound-statement. */
11317 /* If the next keyword is `__label__' we have a label declaration. */
11320 /* Parse an (optional) statement-seq. */
11322 /* Finish the compound-statement. */
11324 /* Consume the `}'. */
11328 }
11330 /* Parse an (optional) statement-seq.
11332 statement-seq:
11333 statement
11334 statement-seq [opt] statement */
11336 static void
11338 {
11339 /* Scan statements until there aren't any more. */
11341 {
11344 /* If we are looking at a `}', then we have run out of
11345 statements; the same is true if we have reached the end
11346 of file, or have stumbled upon a stray '@end'. */
11353 /* If we are in a compound statement and find 'else' then
11354 something went wrong. */
11356 {
11359 else
11360 {
11363 }
11364 }
11366 /* Parse the statement. */
11368 }
11369 }
11371 /* Return true if this is the C++20 version of range-based-for with
11372 init-statement. */
11374 static bool
11376 {
11379 /* Save tokens so that we can put them back. */
11382 /* There has to be an unnested ; followed by an unnested :. */
11385 CPP_SEMICOLON,
11389 /* We found the semicolon, eat it now. */
11392 /* Now look for ':' that is not nested in () or {}. */
11395 CPP_COLON,
11398 out:
11399 /* Roll back the tokens we skipped. */
11403 }
11405 /* Return true if we're looking at (init; cond), false otherwise. */
11407 static bool
11409 {
11410 /* Save tokens so that we can put them back. */
11413 /* Look for ';' that is not nested in () or {}. */
11416 CPP_SEMICOLON,
11419 /* Roll back the tokens we skipped. */
11423 }
11425 /* Parse a selection-statement.
11427 selection-statement:
11428 if ( init-statement [opt] condition ) statement
11429 if ( init-statement [opt] condition ) statement else statement
11430 switch ( init-statement [opt] condition ) statement
11432 Returns the new IF_STMT or SWITCH_STMT.
11434 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11435 is a (possibly labeled) if statement which is not enclosed in
11436 braces and has an else clause. This is used to implement
11437 -Wparentheses.
11439 CHAIN is a vector of if-else-if conditions. This is used to implement
11440 -Wduplicated-cond. */
11442 static tree
11445 {
11448 token_indent_info guard_tinfo;
11453 /* Peek at the next token. */
11457 /* See what kind of keyword it is. */
11460 {
11463 {
11464 tree statement;
11465 tree condition;
11470 RID_CONSTEXPR))
11471 {
11477 }
11479 /* Look for the `('. */
11480 matching_parens parens;
11482 {
11485 }
11487 /* Begin the selection-statement. */
11489 {
11492 }
11493 else
11496 /* Parse the optional init-statement. */
11498 {
11499 tree decl;
11502 "init-statement in selection statements only available "
11505 }
11507 /* Parse the condition. */
11509 /* Look for the `)'. */
11515 {
11519 /* Add the condition. */
11526 /* Parse the then-clause. */
11530 /* Outside a template, the non-selected branch of a constexpr
11531 if is a 'discarded statement', i.e. unevaluated. */
11536 {
11539 }
11542 guard_tinfo);
11549 {
11553 }
11555 /* If the next token is `else', parse the else-clause. */
11557 RID_ELSE))
11558 {
11562 {
11565 }
11567 guard_tinfo
11569 /* Consume the `else' keyword. */
11572 {
11574 RID_IF)
11576 {
11577 /* We've got "if (COND) else if (COND2)". Start
11578 the condition chain and add COND as the first
11579 element. */
11583 {
11584 /* Wrap it in a NOP_EXPR so that we can set the
11585 location of the condition. */
11587 condition);
11590 }
11591 }
11593 RID_IF))
11594 {
11595 /* This is if-else without subsequent if. Zap the
11596 condition chain; we would have already warned at
11597 this point. */
11600 }
11601 }
11603 /* Parse the else-clause. */
11609 /* If we are currently parsing a then-clause, then
11610 IF_P will not be NULL. We set it to true to
11611 indicate that this if statement has an else clause.
11612 This may trigger the Wparentheses warning below
11613 when we get back up to the parent if statement. */
11618 {
11622 }
11623 }
11624 else
11625 {
11626 /* This if statement does not have an else clause. If
11627 NESTED_IF is true, then the then-clause has an if
11628 statement which does have an else clause. We warn
11629 about the potential ambiguity. */
11632 "suggest explicit braces to avoid ambiguous"
11635 {
11636 /* We don't need the condition chain anymore. */
11639 }
11640 }
11642 /* Now we're all done with the if-statement. */
11644 }
11645 else
11646 {
11650 /* Add the condition. */
11653 /* Parse the body of the switch-statement. */
11659 guard_tinfo);
11663 /* Now we're all done with the switch-statement. */
11665 }
11668 }
11674 }
11675 }
11677 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
11678 If we have seen at least one decl-specifier, and the next token
11679 is not a parenthesis, then we must be looking at a declaration.
11680 (After "int (" we might be looking at a functional cast.) */
11682 static void
11685 {
11691 }
11693 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
11694 The declarator shall not specify a function or an array. Returns
11695 TRUE if the declarator is valid, FALSE otherwise. */
11697 static bool
11700 location_t loc)
11701 {
11705 {
11710 else
11718 }
11719 else
11721 }
11723 /* Parse a condition.
11725 condition:
11726 expression
11727 type-specifier-seq declarator = initializer-clause
11728 type-specifier-seq declarator braced-init-list
11730 GNU Extension:
11732 condition:
11733 type-specifier-seq declarator asm-specification [opt]
11734 attributes [opt] = assignment-expression
11736 Returns the expression that should be tested. */
11738 static tree
11740 {
11741 cp_decl_specifier_seq type_specifiers;
11745 /* Try the declaration first. */
11747 /* New types are not allowed in the type-specifier-seq for a
11748 condition. */
11750 parser->type_definition_forbidden_message
11752 /* Parse the type-specifier-seq. */
11754 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11757 /* Restore the saved message. */
11763 /* If all is well, we might be looking at a declaration. */
11765 {
11766 tree decl;
11767 tree asm_specification;
11768 tree attributes;
11773 /* Parse the declarator. */
11779 /* Parse the attributes. */
11781 /* Parse the asm-specification. */
11783 /* If the next token is not an `=' or '{', then we might still be
11784 looking at an expression. For example:
11786 if (A(a).x)
11788 looks like a decl-specifier-seq and a declarator -- but then
11789 there is no `=', so this is an expression. */
11794 /* If we did see an `=' or '{', then we are looking at a declaration
11795 for sure. */
11797 {
11798 tree pushed_scope;
11805 /* Create the declaration. */
11811 /* Parse the initializer. */
11813 {
11817 }
11819 {
11820 /* Consume the `='. */
11824 }
11825 else
11826 {
11829 }
11833 /* Process the initializer. */
11836 asm_specification,
11837 flags);
11843 }
11844 }
11845 /* If we didn't even get past the declarator successfully, we are
11846 definitely not looking at a declaration. */
11847 else
11850 /* Otherwise, we are looking at an expression. */
11852 }
11854 /* Parses a for-statement or range-for-statement until the closing ')',
11855 not included. */
11857 static tree
11859 {
11863 /* Begin the for-statement. */
11866 /* Parse the initialization. */
11872 else
11874 }
11876 static tree
11879 {
11880 /* Normal for loop */
11883 tree stmt;
11886 /* The init-statement has already been parsed in
11887 cp_parser_init_statement, so no work is needed here. */
11890 /* If there's a condition, process it. */
11894 {
11898 }
11900 {
11904 }
11906 /* Look for the `;'. */
11909 /* If there's an expression, process it. */
11915 }
11917 /* Tries to parse a range-based for-statement:
11919 range-based-for:
11920 decl-specifier-seq declarator : expression
11922 The decl-specifier-seq declarator and the `:' are already parsed by
11923 cp_parser_init_statement. If processing_template_decl it returns a
11924 newly created RANGE_FOR_STMT; if not, it is converted to a
11925 regular FOR_STMT. */
11927 static tree
11930 {
11937 /* Get the range declaration momentarily out of the way so that
11938 the range expression doesn't clash with it. */
11940 {
11942 {
11944 /* For decomposition declaration get all of the corresponding
11945 declarations out of the way. */
11949 {
11955 {
11961 }
11962 }
11963 }
11965 {
11970 }
11971 }
11974 {
11977 }
11978 else
11981 /* Put the range declaration(s) back into scope. */
11983 {
11987 }
11989 /* finish_omp_for has its own code for the following, so just
11990 return the range_expr instead. */
11994 /* If in template, STMT is converted to a normal for-statement
11995 at instantiation. If not, it is done just ahead. */
11997 {
12007 /* do_auto_deduction doesn't mess with template init-lists. */
12010 }
12011 else
12012 {
12016 unroll);
12017 }
12019 }
12021 /* Subroutine of cp_convert_range_for: given the initializer expression,
12022 builds up the range temporary. */
12024 static tree
12026 {
12029 /* Find out the type deduced by the declaration
12030 `auto &&__range = range_expr'. */
12035 /* Create the __range variable. */
12037 range_type);
12042 }
12044 /* Used by cp_parser_range_for in template context: we aren't going to
12045 do a full conversion yet, but we still need to resolve auto in the
12046 type of the for-range-declaration if present. This is basically
12047 a shortcut version of cp_convert_range_for. */
12049 static void
12051 {
12054 {
12057 iter_type = (cp_parser_perform_range_for_lookup
12060 {
12062 iter_type);
12064 RO_UNARY_STAR,
12065 tf_warning_or_error);
12068 }
12069 }
12070 }
12072 /* Converts a range-based for-statement into a normal
12073 for-statement, as per the definition.
12075 for (RANGE_DECL : RANGE_EXPR)
12076 BLOCK
12078 should be equivalent to:
12080 {
12081 auto &&__range = RANGE_EXPR;
12082 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
12083 __begin != __end;
12084 ++__begin)
12085 {
12086 RANGE_DECL = *__begin;
12087 BLOCK
12088 }
12089 }
12091 If RANGE_EXPR is an array:
12092 BEGIN_EXPR = __range
12093 END_EXPR = __range + ARRAY_SIZE(__range)
12094 Else if RANGE_EXPR has a member 'begin' or 'end':
12095 BEGIN_EXPR = __range.begin()
12096 END_EXPR = __range.end()
12097 Else:
12098 BEGIN_EXPR = begin(__range)
12099 END_EXPR = end(__range);
12101 If __range has a member 'begin' but not 'end', or vice versa, we must
12102 still use the second alternative (it will surely fail, however).
12103 When calling begin()/end() in the third alternative we must use
12104 argument dependent lookup, but always considering 'std' as an associated
12105 namespace. */
12107 tree
12111 {
12119 /* If an error happened previously do nothing or else a lot of
12120 unhelpful errors would be issued. */
12122 else
12123 {
12124 tree range_temp;
12128 /* Can't bind a reference to an array of runtime bound. */
12130 else
12131 {
12136 LOOKUP_ONLYCONVERTING);
12138 }
12141 }
12143 /* The new for initialization statement. */
12145 iter_type);
12151 LOOKUP_ONLYCONVERTING);
12161 LOOKUP_ONLYCONVERTING);
12165 /* The new for condition. */
12172 /* The new increment expression. */
12175 tf_warning_or_error);
12181 /* The declaration is initialized with *__begin inside the loop body. */
12184 tf_warning_or_error),
12186 LOOKUP_ONLYCONVERTING);
12191 }
12193 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12194 We need to solve both at the same time because the method used
12195 depends on the existence of members begin or end.
12196 Returns the type deduced for the iterator expression. */
12198 static tree
12200 {
12202 {
12205 }
12208 {
12213 }
12215 {
12216 /* If RANGE is an array, we will use pointer arithmetic. */
12219 range,
12223 }
12224 else
12225 {
12226 /* If it is not an array, we must do a bit of magic. */
12236 tf_warning_or_error);
12239 tf_warning_or_error);
12242 {
12243 /* Use the member functions. */
12246 }
12247 else
12248 {
12249 /* Use global functions with ADL. */
12256 tf_warning_or_error);
12258 tf_warning_or_error);
12260 tf_warning_or_error);
12262 tf_warning_or_error);
12265 }
12267 /* Last common checks. */
12269 {
12270 /* If one of the expressions is an error do no more checks. */
12273 }
12276 /* Can happen, when, eg, in a template context, Koenig lookup
12277 can't resolve begin/end (c++/58503). */
12279 else
12280 {
12282 /* The unqualified type of the __begin and __end temporaries should
12283 be the same, as required by the multiple auto declaration. */
12285 {
12292 /* P0184R0 allows __begin and __end to have different types,
12293 but make sure they are comparable so we can give a better
12295 else
12299 }
12301 }
12302 }
12303 }
12305 /* Helper function for cp_parser_perform_range_for_lookup.
12306 Builds a tree for RANGE.IDENTIFIER(). */
12308 static tree
12310 {
12323 tf_warning_or_error);
12326 }
12328 /* Parse an iteration-statement.
12330 iteration-statement:
12331 while ( condition ) statement
12332 do statement while ( expression ) ;
12333 for ( init-statement condition [opt] ; expression [opt] )
12334 statement
12336 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12338 static tree
12341 {
12344 tree statement;
12346 token_indent_info guard_tinfo;
12348 /* Peek at the next token. */
12355 /* Remember whether or not we are already within an iteration
12356 statement. */
12359 /* See what kind of keyword it is. */
12362 {
12364 {
12365 tree condition;
12367 /* Begin the while-statement. */
12369 /* Look for the `('. */
12370 matching_parens parens;
12372 /* Parse the condition. */
12375 /* Look for the `)'. */
12377 /* Parse the dependent statement. */
12383 /* We're done with the while-statement. */
12385 }
12389 {
12390 tree expression;
12392 /* Begin the do-statement. */
12394 /* Parse the body of the do-statement. */
12401 /* Look for the `while' keyword. */
12403 /* Look for the `('. */
12404 matching_parens parens;
12406 /* Parse the expression. */
12408 /* We're done with the do-statement. */
12410 /* Look for the `)'. */
12412 /* Look for the `;'. */
12414 }
12418 {
12419 /* Look for the `('. */
12420 matching_parens parens;
12425 /* Look for the `)'. */
12428 /* Parse the body of the for-statement. */
12435 /* We're done with the for-statement. */
12437 }
12444 }
12447 }
12449 /* Parse a init-statement or the declarator of a range-based-for.
12450 Returns true if a range-based-for declaration is seen.
12452 init-statement:
12453 expression-statement
12454 simple-declaration */
12456 static bool
12458 {
12459 /* If the next token is a `;', then we have an empty
12460 expression-statement. Grammatically, this is also a
12461 simple-declaration, but an invalid one, because it does not
12462 declare anything. Therefore, if we did not handle this case
12463 specially, we would issue an error message about an invalid
12464 declaration. */
12466 {
12470 /* Try to parse the init-statement. */
12472 {
12473 tree dummy;
12475 /* Parse the declaration. */
12481 /* That didn't work, try to parse it as an expression-statement. */
12485 {
12487 "range-based %<for%> loops with initializer only "
12490 }
12491 }
12493 /* A colon is used in range-based for. */
12496 /* We're going to speculatively look for a declaration, falling back
12497 to an expression, if necessary. */
12499 /* Parse the declaration. */
12502 decl);
12505 {
12506 /* It is a range-for, consume the ':'. */
12511 "range-based %<for%> loops only available with "
12513 }
12514 else
12515 /* The ';' is not consumed yet because we told
12516 cp_parser_simple_declaration not to. */
12521 /* If the tentative parse failed, then we shall need to look for an
12522 expression-statement. */
12523 }
12524 /* If we are here, it is an expression-statement. */
12527 }
12529 /* Parse a jump-statement.
12531 jump-statement:
12532 break ;
12533 continue ;
12534 return expression [opt] ;
12535 return braced-init-list ;
12536 goto identifier ;
12538 GNU extension:
12540 jump-statement:
12541 goto * expression ;
12543 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12545 static tree
12547 {
12553 /* Peek at the next token. */
12558 /* See what kind of keyword it is. */
12561 {
12565 {
12582 }
12588 {
12592 /* Fall through. */
12602 }
12607 {
12608 tree expr;
12612 {
12616 }
12619 else
12620 /* If the next token is a `;', then there is no
12621 expression. */
12623 /* Build the return-statement. */
12626 else
12628 /* Look for the final `;'. */
12630 }
12636 {
12639 }
12641 /* Create the goto-statement. */
12643 {
12644 /* Issue a warning about this use of a GNU extension. */
12646 /* Consume the '*' token. */
12648 /* Parse the dependent expression. */
12650 }
12651 else
12653 /* Look for the final `;'. */
12660 }
12663 }
12665 /* Parse a declaration-statement.
12667 declaration-statement:
12668 block-declaration */
12670 static void
12672 {
12675 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12678 /* Parse the block-declaration. */
12681 /* Free any declarators allocated. */
12683 }
12685 /* Some dependent statements (like `if (cond) statement'), are
12686 implicitly in their own scope. In other words, if the statement is
12687 a single statement (as opposed to a compound-statement), it is
12688 none-the-less treated as if it were enclosed in braces. Any
12689 declarations appearing in the dependent statement are out of scope
12690 after control passes that point. This function parses a statement,
12691 but ensures that is in its own scope, even if it is not a
12692 compound-statement.
12694 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12695 is a (possibly labeled) if statement which is not enclosed in
12696 braces and has an else clause. This is used to implement
12697 -Wparentheses.
12699 CHAIN is a vector of if-else-if conditions. This is used to implement
12700 -Wduplicated-cond.
12702 Returns the new statement. */
12704 static tree
12708 {
12709 tree statement;
12712 token_indent_info body_tinfo
12718 /* Mark if () ; with a special NOP_EXPR. */
12720 {
12731 }
12732 /* if a compound is opened, we simply parse the statement directly. */
12735 /* If the token is not a `{', then we must take special action. */
12736 else
12737 {
12738 /* Create a compound-statement. */
12740 /* Parse the dependent-statement. */
12743 /* Finish the dummy compound-statement. */
12745 }
12747 token_indent_info next_tinfo
12756 /* Return the statement. */
12758 }
12760 /* For some dependent statements (like `while (cond) statement'), we
12761 have already created a scope. Therefore, even if the dependent
12762 statement is a compound-statement, we do not want to create another
12763 scope. */
12765 static void
12768 {
12769 /* If the token is a `{', then we must take special action. */
12771 {
12772 token_indent_info body_tinfo
12778 token_indent_info next_tinfo
12787 }
12788 else
12789 {
12790 /* Avoid calling cp_parser_compound_statement, so that we
12791 don't create a new scope. Do everything else by hand. */
12792 matching_braces braces;
12794 /* If the next keyword is `__label__' we have a label declaration. */
12797 /* Parse an (optional) statement-seq. */
12800 }
12801 }
12803 /* Declarations [gram.dcl.dcl] */
12805 /* Parse an optional declaration-sequence.
12807 declaration-seq:
12808 declaration
12809 declaration-seq declaration */
12811 static void
12813 {
12815 {
12821 else
12823 }
12824 }
12826 /* Parse a declaration.
12828 declaration:
12829 block-declaration
12830 function-definition
12831 template-declaration
12832 explicit-instantiation
12833 explicit-specialization
12834 linkage-specification
12835 namespace-definition
12837 C++17:
12838 deduction-guide
12840 GNU extension:
12842 declaration:
12843 __extension__ declaration */
12845 static void
12847 {
12848 cp_token token1;
12849 cp_token token2;
12854 /* Check for the `__extension__' keyword. */
12856 {
12857 /* Parse the qualified declaration. */
12859 /* Restore the PEDANTIC flag. */
12863 }
12865 /* Try to figure out what kind of declaration is present. */
12870 else
12871 {
12874 }
12876 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12879 /* If the next token is `extern' and the following token is a string
12880 literal, then we have a linkage specification. */
12884 /* If the next token is `template', then we have either a template
12885 declaration, an explicit instantiation, or an explicit
12886 specialization. */
12888 {
12889 /* `template <>' indicates a template specialization. */
12893 /* `template <' indicates a template declaration. */
12896 /* Anything else must be an explicit instantiation. */
12897 else
12899 }
12900 /* If the next token is `export', then we have a template
12901 declaration. */
12904 /* If the next token is `extern', 'static' or 'inline' and the one
12905 after that is `template', we have a GNU extended explicit
12906 instantiation directive. */
12913 /* If the next token is `namespace', check for a named or unnamed
12914 namespace definition. */
12923 /* An unnamed namespace definition. */
12927 /* An inline (associated) namespace definition. */
12931 /* Objective-C++ declaration/definition. */
12938 /* At this point we may have a template declared by a concept
12939 introduction. */
12944 else
12945 /* Try to parse a block-declaration, or a function-definition. */
12948 /* Free any declarators allocated. */
12950 }
12952 /* Parse a namespace-scope declaration. */
12954 static void
12956 {
12960 /* A top-level declaration can consist solely of a #pragma. A
12961 nested declaration cannot, so this is done here and not in
12962 cp_parser_declaration. (A #pragma at block scope is
12963 handled in cp_parser_statement.) */
12966 {
12967 /* A declaration consisting of a single semicolon is
12968 invalid. Allow it unless we're being pedantic. */
12972 }
12973 else
12974 /* Parse the declaration itself. */
12976 }
12978 /* Parse a block-declaration.
12980 block-declaration:
12981 simple-declaration
12982 asm-definition
12983 namespace-alias-definition
12984 using-declaration
12985 using-directive
12987 GNU Extension:
12989 block-declaration:
12990 __extension__ block-declaration
12992 C++0x Extension:
12994 block-declaration:
12995 static_assert-declaration
12997 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12998 part of a declaration-statement. */
13000 static void
13003 {
13007 /* Check for the `__extension__' keyword. */
13009 {
13010 /* Parse the qualified declaration. */
13012 /* Restore the PEDANTIC flag. */
13016 }
13018 /* Peek at the next token to figure out which kind of declaration is
13019 present. */
13022 /* If the next keyword is `asm', we have an asm-definition. */
13024 {
13028 }
13029 /* If the next keyword is `namespace', we have a
13030 namespace-alias-definition. */
13033 /* If the next keyword is `using', we have a
13034 using-declaration, a using-directive, or an alias-declaration. */
13036 {
13041 /* If the token after `using' is `namespace', then we have a
13042 using-directive. */
13046 /* If the second token after 'using' is '=', then we have an
13047 alias-declaration. */
13053 /* Otherwise, it's a using-declaration. */
13054 else
13057 }
13058 /* If the next keyword is `__label__' we have a misplaced label
13059 declaration. */
13061 {
13065 /* If the next token is now a `;', consume it. */
13068 }
13069 /* If the next token is `static_assert' we have a static assertion. */
13072 /* Anything else must be a simple-declaration. */
13073 else
13076 }
13078 /* Parse a simple-declaration.
13080 simple-declaration:
13081 decl-specifier-seq [opt] init-declarator-list [opt] ;
13082 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13083 brace-or-equal-initializer ;
13085 init-declarator-list:
13086 init-declarator
13087 init-declarator-list , init-declarator
13089 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
13090 function-definition as a simple-declaration.
13092 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
13093 parsed declaration if it is an uninitialized single declarator not followed
13094 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
13095 if present, will not be consumed. */
13097 static void
13101 {
13102 cp_decl_specifier_seq decl_specifiers;
13111 /* Defer access checks until we know what is being declared; the
13112 checks for names appearing in the decl-specifier-seq should be
13113 done as if we were in the scope of the thing being declared. */
13116 /* Parse the decl-specifier-seq. We have to keep track of whether
13117 or not the decl-specifier-seq declares a named class or
13118 enumeration type, since that is the only case in which the
13119 init-declarator-list is allowed to be empty.
13121 [dcl.dcl]
13123 In a simple-declaration, the optional init-declarator-list can be
13124 omitted only when declaring a class or enumeration, that is when
13125 the decl-specifier-seq contains either a class-specifier, an
13126 elaborated-type-specifier, or an enum-specifier. */
13128 CP_PARSER_FLAGS_OPTIONAL,
13131 /* We no longer need to defer access checks. */
13134 /* In a block scope, a valid declaration must always have a
13135 decl-specifier-seq. By not trying to parse declarators, we can
13136 resolve the declaration/expression ambiguity more quickly. */
13139 {
13142 }
13144 /* If the next two tokens are both identifiers, the code is
13145 erroneous. The usual cause of this situation is code like:
13147 T t;
13149 where "T" should name a type -- but does not. */
13152 {
13153 /* If parsing tentatively, we should commit; we really are
13154 looking at a declaration. */
13156 /* Give up. */
13158 }
13163 /* Look for C++17 decomposition declaration. */
13171 {
13172 tree decl
13174 maybe_range_for_decl,
13177 /* The next token should be either a `,' or a `;'. */
13179 /* If it's a `;', we are done. */
13183 {
13187 }
13188 /* Anything else is an error. */
13189 else
13190 {
13191 /* If we have already issued an error message we don't need
13192 to issue another one. */
13197 /* Skip tokens until we reach the end of the statement. */
13199 /* If the next token is now a `;', consume it. */
13203 }
13204 }
13205 else
13208 tree last_type;
13210 /* NULL_TREE if both variable and function declaration are allowed,
13211 error_mark_node if function declaration are not allowed and
13212 a FUNCTION_DECL that should be diagnosed if it is followed by
13213 variable declarations. */
13214 tree auto_function_declaration;
13217 auto_specifier_p
13221 /* Keep going until we hit the `;' at the end of the simple
13222 declaration. */
13225 CPP_SEMICOLON))
13226 {
13229 tree decl;
13233 {
13234 /* If we are processing next declarator, comma is expected */
13239 {
13243 }
13244 }
13245 else
13248 /* Parse the init-declarator. */
13251 function_definition_allowed_p,
13253 declares_class_or_enum,
13255 maybe_range_for_decl,
13258 /* If an error occurred while parsing tentatively, exit quickly.
13259 (That usually happens when in the body of a function; each
13260 statement is treated as a declaration-statement until proven
13261 otherwise.) */
13266 {
13267 /* If the init-declarator-list contains more than one
13268 init-declarator, they shall all form declarations of
13269 variables. */
13271 auto_function_declaration
13275 {
13277 "non-variable %qD in declaration with more than one "
13282 }
13283 }
13287 {
13291 {
13292 /* If the list of declarators contains more than one declarator,
13293 the type of each declared variable is determined as described
13294 above. If the type deduced for the template parameter U is not
13295 the same in each deduction, the program is ill-formed. */
13300 }
13301 else
13303 }
13305 /* Handle function definitions specially. */
13307 {
13308 /* If the next token is a `,', then we are probably
13309 processing something like:
13311 void f() {}, *p;
13313 which is erroneous. */
13315 {
13318 "mixing"
13320 }
13321 /* Otherwise, we're done with the list of declarators. */
13322 else
13323 {
13326 }
13327 }
13330 /* The next token should be either a `,' or a `;'. */
13332 /* If it's a `,', there are more declarators to come. */
13335 /* If it's a `;', we are done. */
13339 {
13344 }
13345 /* Anything else is an error. */
13346 else
13347 {
13348 /* If we have already issued an error message we don't need
13349 to issue another one. */
13354 /* Skip tokens until we reach the end of the statement. */
13356 /* If the next token is now a `;', consume it. */
13360 }
13361 /* After the first time around, a function-definition is not
13362 allowed -- even if it was OK at first. For example:
13364 int i, f() {}
13366 is not valid. */
13368 }
13370 /* Issue an error message if no declarators are present, and the
13371 decl-specifier-seq does not itself declare a class or
13372 enumeration: [dcl.dcl]/3. */
13374 {
13376 {
13380 /* Ensure an error is issued anyway when finish_decltype_type,
13381 called via cp_parser_decl_specifier_seq, returns a class or
13382 an enumeration (c++/51786). */
13385 }
13386 /* Perform any deferred access checks. */
13388 }
13390 /* Consume the `;'. */
13391 finish:
13395 {
13401 }
13403 done:
13405 }
13407 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13408 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13409 initializer ; */
13411 static tree
13416 {
13421 /* Parse the identifier-list. */
13425 {
13433 }
13437 {
13443 else
13444 {
13447 }
13448 }
13454 tree pushed_scope;
13461 NULL_TREE);
13468 cp_expr e;
13469 cp_decl_specifier_seq decl_specs;
13474 {
13477 else
13480 tree elt_pushed_scope;
13486 {
13487 /* Ensure we've diagnosed redeclaration if we aren't creating
13488 a new VAR_DECL. */
13491 }
13492 else
13496 }
13499 {
13502 }
13506 {
13514 || (is_direct_init
13517 {
13521 }
13524 {
13529 }
13530 }
13532 {
13534 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13535 the underlying DECL. */
13537 }
13543 {
13546 }
13549 }
13551 /* Parse a decl-specifier-seq.
13553 decl-specifier-seq:
13554 decl-specifier-seq [opt] decl-specifier
13555 decl-specifier attribute-specifier-seq [opt] (C++11)
13557 decl-specifier:
13558 storage-class-specifier
13559 type-specifier
13560 function-specifier
13561 friend
13562 typedef
13564 GNU Extension:
13566 decl-specifier:
13567 attributes
13569 Concepts Extension:
13571 decl-specifier:
13572 concept
13574 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13576 The parser flags FLAGS is used to control type-specifier parsing.
13578 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13579 flags:
13581 1: one of the decl-specifiers is an elaborated-type-specifier
13582 (i.e., a type declaration)
13583 2: one of the decl-specifiers is an enum-specifier or a
13584 class-specifier (i.e., a type definition)
13586 */
13588 static void
13590 cp_parser_flags flags,
13593 {
13597 cp_decl_spec ds;
13599 /* Clear DECL_SPECS. */
13602 /* Assume no class or enumeration type is declared. */
13605 /* Keep reading specifiers until there are no more to read. */
13607 {
13612 /* Peek at the next token. */
13615 /* Save the first token of the decl spec list for error
13616 reporting. */
13619 /* Handle attributes. */
13621 {
13622 /* Parse the attributes. */
13625 /* In a sequence of declaration specifiers, c++11 attributes
13626 appertain to the type that precede them. In that case
13627 [dcl.spec]/1 says:
13629 The attribute-specifier-seq affects the type only for
13630 the declaration it appears in, not other declarations
13631 involving the same type.
13633 But for now let's force the user to position the
13634 attribute either at the beginning of the declaration or
13635 after the declarator-id, which would clearly mean that it
13636 applies to the declarator. */
13638 {
13640 /* The c++11 attribute is at the beginning of the
13641 declaration. It appertains to the entity being
13643 else
13644 {
13646 {
13647 /* This is an attribute following a
13648 class-specifier. */
13653 }
13654 else
13655 {
13656 decl_specs->std_attributes
13660 }
13662 }
13663 }
13665 decl_specs->attributes
13670 }
13671 /* Assume we will find a decl-specifier keyword. */
13673 /* If the next token is an appropriate keyword, we can simply
13674 add it to the list. */
13676 {
13677 /* decl-specifier:
13678 friend
13679 constexpr */
13682 {
13687 }
13688 else
13689 {
13691 /* Consume the token. */
13693 }
13706 /* function-specifier:
13707 inline
13708 virtual
13709 explicit */
13716 /* decl-specifier:
13717 typedef */
13720 /* Consume the token. */
13722 /* A constructor declarator cannot appear in a typedef. */
13724 /* The "typedef" keyword can only occur in a declaration; we
13725 may as well commit at this point. */
13732 /* storage-class-specifier:
13733 auto
13734 register
13735 static
13736 extern
13737 mutable
13739 GNU Extension:
13740 thread */
13743 {
13744 /* Consume the token. */
13747 /* Complain about `auto' as a storage specifier, if
13748 we're complaining about C++0x compatibility. */
13752 "%<auto%> changes meaning in C++11; "
13755 /* Set the storage class anyway. */
13757 token);
13758 }
13759 else
13760 /* C++0x auto type-specifier. */
13768 /* Consume the token. */
13771 token);
13774 /* Consume the token. */
13780 /* We did not yet find a decl-specifier yet. */
13783 }
13800 /* Constructors are a special case. The `S' in `S()' is not a
13801 decl-specifier; it is the beginning of the declarator. */
13802 constructor_p
13803 = (!found_decl_spec
13804 && constructor_possible_p
13805 && (cp_parser_constructor_declarator_p
13808 /* If we don't have a DECL_SPEC yet, then we must be looking at
13809 a type-specifier. */
13811 {
13814 tree type_spec;
13816 type_spec
13818 decl_specs,
13824 /* If this type-specifier referenced a user-defined type
13825 (a typedef, class-name, etc.), then we can't allow any
13826 more such type-specifiers henceforth.
13828 [dcl.spec]
13830 The longest sequence of decl-specifiers that could
13831 possibly be a type name is taken as the
13832 decl-specifier-seq of a declaration. The sequence shall
13833 be self-consistent as described below.
13835 [dcl.type]
13837 As a general rule, at most one type-specifier is allowed
13838 in the complete decl-specifier-seq of a declaration. The
13839 only exceptions are the following:
13841 -- const or volatile can be combined with any other
13842 type-specifier.
13844 -- signed or unsigned can be combined with char, long,
13845 short, or int.
13847 -- ..
13849 Example:
13851 typedef char* Pc;
13852 void g (const int Pc);
13854 Here, Pc is *not* part of the decl-specifier seq; it's
13855 the declarator. Therefore, once we see a type-specifier
13856 (other than a cv-qualifier), we forbid any additional
13857 user-defined types. We *do* still allow things like `int
13858 int' to be considered a decl-specifier-seq, and issue the
13859 error message later. */
13862 /* A constructor declarator cannot follow a type-specifier. */
13864 {
13872 }
13873 }
13875 /* If we still do not have a DECL_SPEC, then there are no more
13876 decl-specifiers. */
13881 /* After we see one decl-specifier, further decl-specifiers are
13882 always optional. */
13884 }
13886 /* Don't allow a friend specifier with a class definition. */
13891 }
13893 /* Parse an (optional) storage-class-specifier.
13895 storage-class-specifier:
13896 auto
13897 register
13898 static
13899 extern
13900 mutable
13902 GNU Extension:
13904 storage-class-specifier:
13905 thread
13907 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13909 static tree
13911 {
13913 {
13917 /* Fall through for C++98. */
13925 /* Consume the token. */
13930 }
13931 }
13933 /* Parse an (optional) function-specifier.
13935 function-specifier:
13936 inline
13937 virtual
13938 explicit
13940 C++2A Extension:
13941 explicit(constant-expression)
13943 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13944 Updates DECL_SPECS, if it is non-NULL. */
13946 static tree
13949 {
13952 {
13958 /* 14.5.2.3 [temp.mem]
13960 A member function template shall not be virtual. */
13964 else
13969 {
13971 /* If we see '(', it's C++20 explicit(bool). */
13972 tree expr;
13974 {
13975 matching_parens parens;
13978 /* New types are not allowed in an explicit-specifier. */
13981 parser->type_definition_forbidden_message
13986 "%<explicit(bool)%> only available with -std=c++2a "
13989 /* Parse the constant-expression. */
13992 /* Restore the saved message. */
13995 }
13996 else
13997 /* The explicit-specifier explicit without a constant-expression is
13998 equivalent to the explicit-specifier explicit(true). */
14001 /* [dcl.fct.spec]
14002 "the constant-expression, if supplied, shall be a contextually
14003 converted constant expression of type bool." */
14005 /* We could evaluate it -- mark the decl as appropriate. */
14011 /* The expression was value-dependent. Remember it so that we can
14012 substitute it later. */
14015 }
14019 }
14021 /* Consume the token. */
14023 }
14025 /* Parse a linkage-specification.
14027 linkage-specification:
14028 extern string-literal { declaration-seq [opt] }
14029 extern string-literal declaration */
14031 static void
14033 {
14034 tree linkage;
14036 /* Look for the `extern' keyword. */
14037 cp_token *extern_token
14040 /* Look for the string-literal. */
14044 /* Transform the literal into an identifier. If the literal is a
14045 wide-character string, or contains embedded NULs, then we can't
14046 handle it as the user wants. */
14049 {
14051 /* Assume C++ linkage. */
14053 }
14054 else
14057 /* We're now using the new linkage. */
14060 /* Preserve the location of the the innermost linkage specification,
14061 tracking the locations of nested specifications via a local. */
14062 location_t saved_location
14064 /* Construct a location ranging from the start of the "extern" to
14065 the end of the string-literal, with the caret at the start, e.g.:
14066 extern "C" {
14067 ^~~~~~~~~~
14068 */
14069 parser->innermost_linkage_specification_location
14074 /* If the next token is a `{', then we're using the first
14075 production. */
14077 {
14081 /* Consume the `{' token. */
14082 matching_braces braces;
14084 /* Parse the declarations. */
14086 /* Look for the closing `}'. */
14088 }
14089 /* Otherwise, there's just one declaration. */
14090 else
14091 {
14094 saved_in_unbraced_linkage_specification_p
14098 parser->in_unbraced_linkage_specification_p
14100 }
14102 /* We're done with the linkage-specification. */
14105 /* Restore location of parent linkage specification, if any. */
14107 }
14109 /* Parse a static_assert-declaration.
14111 static_assert-declaration:
14112 static_assert ( constant-expression , string-literal ) ;
14113 static_assert ( constant-expression ) ; (C++17)
14115 If MEMBER_P, this static_assert is a class member. */
14117 static void
14119 {
14120 cp_expr condition;
14121 location_t token_loc;
14122 tree message;
14125 /* Peek at the `static_assert' token so we can keep track of exactly
14126 where the static assertion started. */
14129 /* Look for the `static_assert' keyword. */
14131 RT_STATIC_ASSERT))
14134 /* We know we are in a static assertion; commit to any tentative
14135 parse. */
14139 /* Parse the `(' starting the static assertion condition. */
14140 matching_parens parens;
14143 /* Parse the constant-expression. Allow a non-constant expression
14144 here in order to give better diagnostics in finish_static_assert. */
14145 condition =
14151 {
14154 "static_assert without a message "
14156 /* Eat the ')' */
14161 }
14162 else
14163 {
14164 /* Parse the separating `,'. */
14167 /* Parse the string-literal message. */
14172 /* A `)' completes the static assertion. */
14178 }
14180 /* A semicolon terminates the declaration. */
14183 /* Get the location for the static assertion. Use that of the
14184 condition if available, otherwise, use that of the "static_assert"
14185 token. */
14190 /* Complete the static assertion, which may mean either processing
14191 the static assert now or saving it for template instantiation. */
14193 }
14195 /* Parse the expression in decltype ( expression ). */
14197 static tree
14200 {
14202 tree expr;
14204 /* Since we're going to preserve any side-effects from this parse, set up a
14205 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14206 in the expression. */
14209 /* First, try parsing an id-expression. */
14220 {
14223 cp_id_kind idk;
14227 /* Lookup the name we got back from the id-expression. */
14232 /* A template without args is not a complete id-expression. */
14241 {
14242 /* Complete lookup of the id-expression. */
14243 expr = (finish_id_expression
14256 /* We found an id-expression, but it was something that we
14257 should not have found. This is an error, not something
14258 we can recover from, so note that we found an
14259 id-expression and we'll recover as gracefully as
14260 possible. */
14262 }
14267 /* We have an id-expression. */
14269 }
14272 {
14273 /* Abort the id-expression parse. */
14276 /* Parsing tentatively, again. */
14279 /* Parse a class member access. */
14287 /* We have an id-expression. */
14289 }
14292 /* We have parsed the complete id-expression or member access. */
14294 else
14295 {
14296 /* Abort our attempt to parse an id-expression or member access
14297 expression. */
14300 /* Commit to the tentative_firewall so we get syntax errors. */
14303 /* Parse a full expression. */
14306 }
14309 }
14311 /* Parse a `decltype' type. Returns the type.
14313 simple-type-specifier:
14314 decltype ( expression )
14315 C++14 proposal:
14316 decltype ( auto ) */
14318 static tree
14320 {
14325 {
14326 /* Already parsed. */
14329 }
14331 /* Look for the `decltype' token. */
14335 /* Parse the opening `('. */
14336 matching_parens parens;
14346 /* decltype (auto) */
14348 else
14349 {
14350 /* decltype (expression) */
14352 /* Types cannot be defined in a `decltype' expression. Save away the
14353 old message and set the new one. */
14355 parser->type_definition_forbidden_message
14358 /* The restrictions on constant-expressions do not apply inside
14359 decltype expressions. */
14360 bool saved_integral_constant_expression_p
14362 bool saved_non_integral_constant_expression_p
14366 /* Within a parenthesized expression, a `>' token is always
14367 the greater-than operator. */
14368 bool saved_greater_than_is_operator_p
14372 /* Do not actually evaluate the expression. */
14375 /* Do not warn about problems with the expression. */
14380 /* Go back to evaluating expressions. */
14384 /* The `>' token might be the end of a template-id or
14385 template-parameter-list now. */
14386 parser->greater_than_is_operator_p
14389 /* Restore the old message and the integral constant expression
14390 flags. */
14392 parser->integral_constant_expression_p
14394 parser->non_integral_constant_expression_p
14396 }
14398 /* Parse to the closing `)'. */
14400 {
14405 }
14408 {
14409 /* Build auto. */
14412 }
14413 else
14415 tf_warning_or_error);
14417 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14418 it again. */
14429 }
14431 /* Special member functions [gram.special] */
14433 /* Parse a conversion-function-id.
14435 conversion-function-id:
14436 operator conversion-type-id
14438 Returns an IDENTIFIER_NODE representing the operator. */
14440 static tree
14442 {
14443 tree type;
14444 tree saved_scope;
14445 tree saved_qualifying_scope;
14446 tree saved_object_scope;
14449 /* Look for the `operator' token. */
14452 /* When we parse the conversion-type-id, the current scope will be
14453 reset. However, we need that information in able to look up the
14454 conversion function later, so we save it here. */
14458 /* We must enter the scope of the class so that the names of
14459 entities declared within the class are available in the
14460 conversion-type-id. For example, consider:
14462 struct S {
14463 typedef int I;
14464 operator I();
14465 };
14467 S::operator I() { ... }
14469 In order to see that `I' is a type-name in the definition, we
14470 must be in the scope of `S'. */
14473 /* Parse the conversion-type-id. */
14475 /* Leave the scope of the class, if any. */
14478 /* Restore the saved scope. */
14482 /* If the TYPE is invalid, indicate failure. */
14486 }
14488 /* Parse a conversion-type-id:
14490 conversion-type-id:
14491 type-specifier-seq conversion-declarator [opt]
14493 Returns the TYPE specified. */
14495 static tree
14497 {
14498 tree attributes;
14499 cp_decl_specifier_seq type_specifiers;
14501 tree type_specified;
14504 /* Parse the attributes. */
14508 parser->type_definition_forbidden_message
14511 /* Parse the type-specifiers. */
14518 /* If that didn't work, stop. */
14521 /* Parse the conversion-declarator. */
14529 /* Don't give this error when parsing tentatively. This happens to
14530 work because we always parse this definitively once. */
14533 {
14535 {
14538 }
14542 }
14545 }
14547 /* Parse an (optional) conversion-declarator.
14549 conversion-declarator:
14550 ptr-operator conversion-declarator [opt]
14552 */
14556 {
14559 cp_cv_quals cv_quals;
14561 /* We don't know if there's a ptr-operator next, or not. */
14563 /* Try the ptr-operator. */
14566 /* If it worked, look for more conversion-declarators. */
14568 {
14571 /* Parse another optional declarator. */
14574 declarator = cp_parser_make_indirect_declarator
14578 }
14581 }
14583 /* Parse an (optional) ctor-initializer.
14585 ctor-initializer:
14586 : mem-initializer-list */
14588 static void
14590 {
14591 /* If the next token is not a `:', then there is no
14592 ctor-initializer. */
14594 {
14595 /* Do default initialization of any bases and members. */
14599 }
14601 /* Consume the `:' token. */
14603 /* And the mem-initializer-list. */
14605 }
14607 /* Parse a mem-initializer-list.
14609 mem-initializer-list:
14610 mem-initializer ... [opt]
14611 mem-initializer ... [opt] , mem-initializer-list */
14613 static void
14615 {
14620 /* Let the semantic analysis code know that we are starting the
14621 mem-initializer-list. */
14626 /* Loop through the list. */
14628 {
14629 tree mem_initializer;
14632 /* Parse the mem-initializer. */
14634 /* If the next token is a `...', we're expanding member initializers. */
14640 {
14641 /* Consume the `...'. */
14645 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14646 can be expanded but members cannot. */
14649 {
14654 }
14656 /* Construct the pack expansion type. */
14659 }
14662 {
14666 }
14667 /* Look for a target constructor. */
14671 {
14674 {
14678 }
14680 }
14681 /* Add it to the list, unless it was erroneous. */
14683 {
14686 }
14687 /* If the next token is not a `,', we're done. */
14690 /* Consume the `,' token. */
14692 }
14694 /* Perform semantic analysis. */
14697 }
14699 /* Parse a mem-initializer.
14701 mem-initializer:
14702 mem-initializer-id ( expression-list [opt] )
14703 mem-initializer-id braced-init-list
14705 GNU extension:
14707 mem-initializer:
14708 ( expression-list [opt] )
14710 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14711 class) or FIELD_DECL (for a non-static data member) to initialize;
14712 the TREE_VALUE is the expression-list. An empty initialization
14713 list is represented by void_list_node. */
14715 static tree
14717 {
14718 tree mem_initializer_id;
14719 tree expression_list;
14720 tree member;
14723 /* Find out what is being initialized. */
14725 {
14729 }
14730 else
14731 {
14735 }
14741 {
14748 }
14749 else
14750 {
14760 }
14770 }
14772 /* Parse a mem-initializer-id.
14774 mem-initializer-id:
14775 :: [opt] nested-name-specifier [opt] class-name
14776 decltype-specifier (C++11)
14777 identifier
14779 Returns a TYPE indicating the class to be initialized for the first
14780 production (and the second in C++11). Returns an IDENTIFIER_NODE
14781 indicating the data member to be initialized for the last production. */
14783 static tree
14785 {
14789 tree id;
14793 /* `typename' is not allowed in this context ([temp.res]). */
14795 {
14797 "keyword %<typename%> not allowed in this context (a qualified "
14800 }
14801 /* Look for the optional `::' operator. */
14802 global_scope_p
14806 /* Look for the optional nested-name-specifier. The simplest way to
14807 implement:
14809 [temp.res]
14811 The keyword `typename' is not permitted in a base-specifier or
14812 mem-initializer; in these contexts a qualified name that
14813 depends on a template-parameter is implicitly assumed to be a
14814 type name.
14816 is to assume that we have seen the `typename' keyword at this
14817 point. */
14818 nested_name_specifier_p
14827 /* If there is a `::' operator or a nested-name-specifier, then we
14828 are definitely looking for a class-name. */
14833 typename_type,
14837 /* Otherwise, we could also be looking for an ordinary identifier. */
14840 /* Try a decltype-specifier. */
14842 else
14843 /* Otherwise, try a class-name. */
14847 none_type,
14851 /* If we found one, we're done. */
14854 /* Otherwise, look for an ordinary identifier. */
14856 }
14858 /* Overloading [gram.over] */
14860 /* Parse an operator-function-id.
14862 operator-function-id:
14863 operator operator
14865 Returns an IDENTIFIER_NODE for the operator which is a
14866 human-readable spelling of the identifier, e.g., `operator +'. */
14868 static cp_expr
14870 {
14871 /* Look for the `operator' keyword. */
14874 /* And then the name of the operator itself. */
14876 }
14878 /* Return an identifier node for a user-defined literal operator.
14879 The suffix identifier is chained to the operator name identifier. */
14881 tree
14883 {
14884 tree identifier;
14891 }
14893 /* Parse an operator.
14895 operator:
14896 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14897 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14898 || ++ -- , ->* -> () []
14900 GNU Extensions:
14902 operator:
14903 <? >? <?= >?=
14905 Returns an IDENTIFIER_NODE for the operator which is a
14906 human-readable spelling of the identifier, e.g., `operator +'. */
14908 static cp_expr
14910 {
14915 /* Peek at the next token. */
14920 /* Figure out which operator we have. */
14925 {
14927 {
14928 /* The keyword should be either `new' or `delete'. */
14933 else
14936 /* Consume the `new' or `delete' token. */
14939 /* Peek at the next token. */
14941 /* If it's a `[' token then this is the array variant of the
14942 operator. */
14944 {
14945 /* Consume the `[' token. */
14947 /* Look for the `]' token. */
14952 }
14956 }
15114 {
15115 /* Consume the `('. */
15116 matching_parens parens;
15118 /* Look for the matching `)'. */
15123 }
15126 /* Consume the `['. */
15128 /* Look for the matching `]'. */
15137 /* FALLTHRU */
15146 {
15153 /* Consume the string. */
15159 {
15162 }
15163 else
15164 {
15166 /* Look for the suffix identifier. */
15171 {
15175 }
15176 else
15177 {
15180 }
15181 }
15186 {
15189 }
15192 {
15195 }
15197 {
15200 }
15202 }
15205 /* Anything else is an error. */
15207 }
15209 /* If we have selected an identifier, we need to consume the
15210 operator token. */
15212 {
15216 }
15217 /* Otherwise, no valid operator name was present. */
15218 else
15219 {
15222 }
15225 }
15227 /* Parse a template-declaration.
15229 template-declaration:
15230 export [opt] template < template-parameter-list > declaration
15232 If MEMBER_P is TRUE, this template-declaration occurs within a
15233 class-specifier.
15235 The grammar rule given by the standard isn't correct. What
15236 is really meant is:
15238 template-declaration:
15239 export [opt] template-parameter-list-seq
15240 decl-specifier-seq [opt] init-declarator [opt] ;
15241 export [opt] template-parameter-list-seq
15242 function-definition
15244 template-parameter-list-seq:
15245 template-parameter-list-seq [opt]
15246 template < template-parameter-list >
15248 Concept Extensions:
15250 template-parameter-list-seq:
15251 template < template-parameter-list > requires-clause [opt]
15253 requires-clause:
15254 requires logical-or-expression */
15256 static void
15258 {
15259 /* Check for `export'. */
15261 {
15262 /* Consume the `export' token. */
15264 /* Warn that we do not support `export'. */
15266 }
15269 }
15271 /* Parse a template-parameter-list.
15273 template-parameter-list:
15274 template-parameter
15275 template-parameter-list , template-parameter
15277 Returns a TREE_LIST. Each node represents a template parameter.
15278 The nodes are connected via their TREE_CHAINs. */
15280 static tree
15282 {
15287 /* The loop below parses the template parms. We first need to know
15288 the total number of template parms to be able to compute proper
15289 canonical types of each dependent type. So after the loop, when
15290 we know the total number of template parms,
15291 end_template_parm_list computes the proper canonical types and
15292 fixes up the dependent types accordingly. */
15294 {
15295 tree parameter;
15298 location_t parm_loc;
15300 /* Parse the template-parameter. */
15305 /* Add it to the list. */
15308 parm_loc,
15309 parameter,
15310 is_non_type,
15311 is_parameter_pack);
15312 else
15313 {
15316 }
15318 /* If the next token is not a `,', we're done. */
15321 /* Otherwise, consume the `,' token. */
15323 }
15326 }
15328 /* Parse a introduction-list.
15330 introduction-list:
15331 introduced-parameter
15332 introduction-list , introduced-parameter
15334 introduced-parameter:
15335 ...[opt] identifier
15337 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15338 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15339 WILDCARD_DECL will also have DECL_NAME set and token location in
15340 DECL_SOURCE_LOCATION. */
15342 static tree
15344 {
15348 {
15357 /* Build placeholder. */
15365 /* If the next token is not a `,', we're done. */
15368 /* Otherwise, consume the `,' token. */
15370 }
15372 /* Convert the vec into a TREE_VEC. */
15375 tree parm;
15381 }
15383 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15384 is an abstract declarator. */
15388 {
15393 }
15395 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15396 is an abstract declarator. */
15400 {
15404 else
15406 }
15408 /* Returns true if DECL represents a constrained-parameter. */
15412 {
15417 }
15419 /* Returns true if PARM declares a constrained-parameter. */
15423 {
15425 }
15427 /* Check that the type parameter is only a declarator-id, and that its
15428 type is not cv-qualified. */
15430 bool
15433 {
15438 {
15441 }
15443 /* Don't allow cv-qualified type parameters. */
15446 {
15449 }
15452 }
15454 /* Finish parsing/processing a template type parameter and checking
15455 various restrictions. */
15459 tree id,
15461 {
15464 else
15466 }
15468 static tree
15470 {
15471 /* FIXME: This should probably be copied, and we may need to adjust
15472 the template parameter depths. */
15482 }
15484 /* Finish parsing/processing a template template parameter by borrowing
15485 the template parameter list from the prototype parameter. */
15487 static tree
15489 tree proto,
15490 tree id,
15492 {
15496 }
15498 /* Create a new non-type template parameter from the given PARM
15499 declarator. */
15501 static tree
15504 {
15510 }
15512 /* Build a constrained template parameter based on the PARMDECL
15513 declarator. The type of PARMDECL is the constrained type, which
15514 refers to the prototype template parameter that ultimately
15515 specifies the type of the declared parameter. */
15517 static tree
15522 {
15528 /* A template parameter constrained by a variadic concept shall also
15529 be declared as a template parameter pack. */
15534 /* Build the parameter. Return an error if the declarator was invalid. */
15535 tree parm;
15540 parmdecl);
15541 else
15546 /* Finish the parameter decl and create a node attaching the
15547 default argument and constraint. */
15552 }
15554 /* Returns true if the parsed type actually represents the declaration
15555 of a type template-parameter. */
15559 {
15562 }
15565 /* Returns true if the parsed type actually represents the declaration of
15566 a template template-parameter. */
15568 static bool
15570 {
15573 }
15575 /* Parse a default argument for a type template-parameter.
15576 Note that diagnostics are handled in cp_parser_template_parameter. */
15578 static tree
15580 {
15583 /* Consume the `=' token. */
15588 /* Parse the default-argument. */
15594 {
15598 }
15601 }
15603 /* Parse a default argument for a template template-parameter. */
15605 static tree
15607 {
15612 /* Consume the `='. */
15614 /* Parse the id-expression. */
15616 /* save token before parsing the id-expression, for error
15617 reporting */
15619 tree default_argument
15627 /* If the id-expression was a template-id that refers to
15628 a template-class, we already have the declaration here,
15629 so no further lookup is needed. */
15630 ;
15631 else
15632 /* Look up the name. */
15633 default_argument
15635 none_type,
15641 /* See if the default argument is valid. */
15645 }
15647 /* Parse a template-parameter.
15649 template-parameter:
15650 type-parameter
15651 parameter-declaration
15653 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15654 the parameter. The TREE_PURPOSE is the default value, if any.
15655 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15656 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15657 set to true iff this parameter is a parameter pack. */
15659 static tree
15662 {
15665 tree parm;
15667 /* Assume it is a type parameter or a template parameter. */
15669 /* Assume it not a parameter pack. */
15671 /* Peek at the next token. */
15673 /* If it is `template', we have a type-parameter. */
15676 /* If it is `class' or `typename' we do not know yet whether it is a
15677 type parameter or a non-type parameter. Consider:
15679 template <typename T, typename T::X X> ...
15681 or:
15683 template <class C, class D*> ...
15685 Here, the first parameter is a type parameter, and the second is
15686 a non-type parameter. We can tell by looking at the token after
15687 the identifier -- if it is a `,', `=', or `>' then we have a type
15688 parameter. */
15690 {
15691 /* Peek at the token after `class' or `typename'. */
15693 /* If it's an ellipsis, we have a template type parameter
15694 pack. */
15697 /* If it's an identifier, skip it. */
15700 /* Now, see if the token looks like the end of a template
15701 parameter. */
15706 }
15708 /* Otherwise, it is a non-type parameter or a constrained parameter.
15710 [temp.param]
15712 When parsing a default template-argument for a non-type
15713 template-parameter, the first non-nested `>' is taken as the end
15714 of the template parameter-list rather than a greater-than
15715 operator. */
15716 parameter_declarator
15723 /* If the parameter declaration is marked as a parameter pack, set
15724 *IS_PARAMETER_PACK to notify the caller. */
15729 {
15730 /* Can happen in some cases of erroneous input (c++/34892). */
15732 /* Consume the `...' for better error recovery. */
15734 }
15736 // The parameter may have been constrained.
15739 parameter_declarator,
15740 is_non_type,
15741 is_parameter_pack);
15743 // Now we're sure that the parameter is a non-type parameter.
15754 }
15756 /* Parse a type-parameter.
15758 type-parameter:
15759 class identifier [opt]
15760 class identifier [opt] = type-id
15761 typename identifier [opt]
15762 typename identifier [opt] = type-id
15763 template < template-parameter-list > class identifier [opt]
15764 template < template-parameter-list > class identifier [opt]
15765 = id-expression
15767 GNU Extension (variadic templates):
15769 type-parameter:
15770 class ... identifier [opt]
15771 typename ... identifier [opt]
15773 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15774 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15775 the declaration of the parameter.
15777 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15779 static tree
15781 {
15783 tree parameter;
15785 /* Look for a keyword to tell us what kind of parameter this is. */
15791 {
15794 {
15795 tree identifier;
15796 tree default_argument;
15798 /* If the next token is an ellipsis, we have a template
15799 argument pack. */
15801 {
15802 /* Consume the `...' token. */
15807 }
15809 /* If the next token is an identifier, then it names the
15810 parameter. */
15813 else
15816 /* Create the parameter. */
15819 /* If the next token is an `=', we have a default argument. */
15821 {
15822 default_argument
15825 /* Template parameter packs cannot have default
15826 arguments. */
15828 {
15831 "template parameter pack %qD cannot have a "
15833 else
15835 "template parameter packs cannot have "
15838 }
15841 }
15842 else
15845 /* Create the combined representation of the parameter and the
15846 default argument. */
15848 }
15852 {
15853 tree identifier;
15854 tree default_argument;
15856 /* Look for the `<'. */
15858 /* Parse the template-parameter-list. */
15860 /* Look for the `>'. */
15863 // If template requirements are present, parse them.
15865 {
15870 }
15872 /* Look for the `class' or 'typename' keywords. */
15874 /* If the next token is an ellipsis, we have a template
15875 argument pack. */
15877 {
15878 /* Consume the `...' token. */
15883 }
15884 /* If the next token is an `=', then there is a
15885 default-argument. If the next token is a `>', we are at
15886 the end of the parameter-list. If the next token is a `,',
15887 then we are at the end of this parameter. */
15891 {
15893 /* Treat invalid names as if the parameter were nameless. */
15896 }
15897 else
15900 /* Create the template parameter. */
15902 identifier);
15904 /* If the next token is an `=', then there is a
15905 default-argument. */
15907 {
15908 default_argument
15911 /* Template parameter packs cannot have default
15912 arguments. */
15914 {
15917 "template parameter pack %qD cannot "
15919 identifier);
15920 else
15924 }
15925 }
15926 else
15929 /* Create the combined representation of the parameter and the
15930 default argument. */
15932 }
15938 }
15941 }
15943 /* Parse a template-id.
15945 template-id:
15946 template-name < template-argument-list [opt] >
15948 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15949 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15950 returned. Otherwise, if the template-name names a function, or set
15951 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15952 names a class, returns a TYPE_DECL for the specialization.
15954 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15955 uninstantiated templates. */
15957 static tree
15963 {
15964 tree templ;
15965 tree arguments;
15966 tree template_id;
15971 /* If the next token corresponds to a template-id, there is no need
15972 to reparse it. */
15975 {
15978 }
15980 /* Avoid performing name lookup if there is no possibility of
15981 finding a template-id. */
15984 && !cp_parser_nth_token_starts_template_argument_list_p
15986 {
15989 }
15991 /* Remember where the template-id starts. */
15997 /* Parse the template-name. */
16000 check_dependency_p,
16001 is_declaration,
16002 tag_type,
16005 {
16008 }
16010 /* Since we're going to preserve any side-effects from this parse, set up a
16011 firewall to protect our callers from cp_parser_commit_to_tentative_parse
16012 in the template arguments. */
16015 /* If we find the sequence `[:' after a template-name, it's probably
16016 a digraph-typo for `< ::'. Substitute the tokens and check if we can
16017 parse correctly the argument list. */
16024 {
16026 /* Change `:' into `::'. */
16028 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
16029 CPP_LESS. */
16032 /* Parse the arguments. */
16035 {
16036 /* If we couldn't parse an argument list, then we revert our changes
16037 and return simply an error. Maybe this is not a template-id
16038 after all. */
16043 }
16044 /* Otherwise, emit an error about the invalid digraph, but continue
16045 parsing because we got our argument list. */
16048 {
16051 "%<<:%> is an alternate spelling for %<[%>."
16054 {
16056 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
16059 }
16060 }
16061 }
16062 else
16063 {
16064 /* Look for the `<' that starts the template-argument-list. */
16066 {
16069 }
16070 /* Parse the arguments. */
16075 && !template_keyword_p
16078 {
16079 /* This didn't go well. */
16081 {
16082 /* C++2A says that "function-name < a;" is now ill-formed. */
16084 {
16087 "operand of %<<%> is ill-formed in C++2a; wrap the "
16089 }
16090 else
16091 /* We expect "f<targs>" to be followed by "(args)". */
16095 /* Purge all subsequent tokens. */
16097 }
16098 else
16102 }
16103 }
16105 /* Set the location to be of the form:
16106 template-name < template-argument-list [opt] >
16107 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
16108 with caret == start at the start of the template-name,
16109 ranging until the closing '>'. */
16110 location_t finish_loc
16112 location_t combined_loc
16115 /* Check for concepts autos where they don't belong. We could
16116 identify types in some cases of idnetifier TEMPL, looking ahead
16117 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
16118 types. We reject them in functions, but if what we have is an
16119 identifier, even with none_type we can't conclude it's NOT a
16120 type, we have to wait for template substitution. */
16123 /* Build a representation of the specialization. */
16126 TEMPLATE_ID_EXPR,
16130 {
16131 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
16132 template (rather than some instantiation thereof) only if
16133 is not nested within some other construct. For example, in
16134 "template <typename T> void f(T) { A<T>::", A<T> is just an
16135 instantiation of A. */
16136 bool entering_scope
16139 template_id
16141 }
16142 /* A template-like identifier may be a partial concept id. */
16148 {
16152 }
16153 else
16154 {
16155 /* If it's not a class-template or a template-template, it should be
16156 a function-template. */
16165 }
16167 /* If parsing tentatively, replace the sequence of tokens that makes
16168 up the template-id with a CPP_TEMPLATE_ID token. That way,
16169 should we re-parse the token stream, we will not have to repeat
16170 the effort required to do the parse, nor will we issue duplicate
16171 error messages about problems during instantiation of the
16172 template. */
16174 /* Don't do this if we had a parse error in a declarator; re-parsing
16175 might succeed if a name changes meaning (60361). */
16179 {
16180 /* Reset the contents of the START_OF_ID token. */
16184 /* Retrieve any deferred checks. Do not pop this access checks yet
16185 so the memory will not be reclaimed during token replacing below. */
16191 /* Purge all subsequent tokens. */
16194 /* ??? Can we actually assume that, if template_id ==
16195 error_mark_node, we will have issued a diagnostic to the
16196 user, as opposed to simply marking the tentative parse as
16197 failed? */
16200 }
16204 }
16206 /* Parse a template-name.
16208 template-name:
16209 identifier
16211 The standard should actually say:
16213 template-name:
16214 identifier
16215 operator-function-id
16217 A defect report has been filed about this issue.
16219 A conversion-function-id cannot be a template name because they cannot
16220 be part of a template-id. In fact, looking at this code:
16222 a.operator K<int>()
16224 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
16225 It is impossible to call a templated conversion-function-id with an
16226 explicit argument list, since the only allowed template parameter is
16227 the type to which it is converting.
16229 If TEMPLATE_KEYWORD_P is true, then we have just seen the
16230 `template' keyword, in a construction like:
16232 T::template f<3>()
16234 In that case `f' is taken to be a template-name, even though there
16235 is no way of knowing for sure.
16237 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
16238 name refers to a set of overloaded functions, at least one of which
16239 is a template, or an IDENTIFIER_NODE with the name of the template,
16240 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
16241 names are looked up inside uninstantiated templates. */
16243 static tree
16250 {
16251 tree identifier;
16252 tree decl;
16255 /* If the next token is `operator', then we have either an
16256 operator-function-id or a conversion-function-id. */
16258 {
16259 /* We don't know whether we're looking at an
16260 operator-function-id or a conversion-function-id. */
16262 /* Try an operator-function-id. */
16264 /* If that didn't work, try a conversion-function-id. */
16266 {
16269 }
16270 }
16271 /* Look for the identifier. */
16272 else
16275 /* If we didn't find an identifier, we don't have a template-id. */
16279 /* If the name immediately followed the `template' keyword, then it
16280 is a template-name. However, if the next token is not `<', then
16281 we do not treat it as a template-name, since it is not being used
16282 as part of a template-id. This enables us to handle constructs
16283 like:
16285 template <typename T> struct S { S(); };
16286 template <typename T> S<T>::S();
16288 correctly. We would treat `S' as a template -- if it were `S<T>'
16289 -- but we do not if there is no `<'. */
16293 {
16294 /* In a declaration, in a dependent context, we pretend that the
16295 "template" keyword was present in order to improve error
16296 recovery. For example, given:
16298 template <typename T> void f(T::X<int>);
16300 we want to treat "X<int>" as a template-id. */
16302 && !template_keyword_p
16304 && check_dependency_p
16306 /* Do not do this for dtors (or ctors), since they never
16307 need the template keyword before their name. */
16309 {
16312 /* Explain what went wrong. */
16314 identifier);
16317 /* If parsing tentatively, find the location of the "<" token. */
16320 /* Parse the template arguments so that we can issue error
16321 messages about them. */
16324 /* Skip tokens until we find a good place from which to
16325 continue parsing. */
16330 /* If parsing tentatively, permanently remove the
16331 template argument list. That will prevent duplicate
16332 error messages from being issued about the missing
16333 "template" keyword. */
16340 }
16342 /* If the "template" keyword is present, then there is generally
16343 no point in doing name-lookup, so we just return IDENTIFIER.
16344 But, if the qualifying scope is non-dependent then we can
16345 (and must) do name-lookup normally. */
16347 {
16353 {
16354 /* We're optimizing away the call to cp_parser_lookup_name, but
16355 we still need to do this. */
16358 }
16359 }
16360 }
16362 /* cp_parser_lookup_name clears OBJECT_TYPE. */
16366 /* Look up the name. */
16368 tag_type,
16371 check_dependency_p,
16377 /* If DECL is a template, then the name was a template-name. */
16379 {
16383 }
16384 else
16385 {
16386 /* The standard does not explicitly indicate whether a name that
16387 names a set of overloaded declarations, some of which are
16388 templates, is a template-name. However, such a name should
16389 be a template-name; otherwise, there is no way to form a
16390 template-id for the overloaded templates. */
16400 && !scoped_p
16402 {
16403 /* [temp.names] says "A name is also considered to refer to a template
16404 if it is an unqualified-id followed by a < and name lookup finds
16405 either one or more functions or finds nothing." */
16407 /* The "more functions" case. Just use the OVERLOAD as normally.
16408 We don't use is_overloaded_fn here to avoid considering
16409 BASELINKs. */
16411 /* Name lookup found one function. */
16414 /* Name lookup found nothing. */
16417 }
16420 {
16421 /* The name does not name a template. */
16424 }
16425 }
16428 }
16430 /* Parse a template-argument-list.
16432 template-argument-list:
16433 template-argument ... [opt]
16434 template-argument-list , template-argument ... [opt]
16436 Returns a TREE_VEC containing the arguments. */
16438 static tree
16440 {
16445 tree vec;
16452 /* Even if the template-id appears in an integral
16453 constant-expression, the contents of the argument list do
16454 not. */
16460 /* Parse the arguments. */
16461 do
16462 {
16463 tree argument;
16466 /* Consume the comma. */
16469 /* Parse the template-argument. */
16472 /* If the next token is an ellipsis, we're expanding a template
16473 argument pack. */
16475 {
16477 {
16481 }
16482 /* Consume the `...' token. */
16485 /* Make the argument into a TYPE_PACK_EXPANSION or
16486 EXPR_PACK_EXPANSION. */
16488 }
16491 {
16495 {
16498 }
16499 else
16501 }
16503 }
16519 }
16521 /* Parse a template-argument.
16523 template-argument:
16524 assignment-expression
16525 type-id
16526 id-expression
16528 The representation is that of an assignment-expression, type-id, or
16529 id-expression -- except that the qualified id-expression is
16530 evaluated, so that the value returned is either a DECL or an
16531 OVERLOAD.
16533 Although the standard says "assignment-expression", it forbids
16534 throw-expressions or assignments in the template argument.
16535 Therefore, we use "conditional-expression" instead. */
16537 static tree
16539 {
16540 tree argument;
16546 cp_id_kind idk;
16548 /* There's really no way to know what we're looking at, so we just
16549 try each alternative in order.
16551 [temp.arg]
16553 In a template-argument, an ambiguity between a type-id and an
16554 expression is resolved to a type-id, regardless of the form of
16555 the corresponding template-parameter.
16557 Therefore, we try a type-id first. */
16560 /* If there was no error parsing the type-id but the next token is a
16561 '>>', our behavior depends on which dialect of C++ we're
16562 parsing. In C++98, we probably found a typo for '> >'. But there
16563 are type-id which are also valid expressions. For instance:
16565 struct X { int operator >> (int); };
16566 template <int V> struct Foo {};
16567 Foo<X () >> 5> r;
16569 Here 'X()' is a valid type-id of a function type, but the user just
16570 wanted to write the expression "X() >> 5". Thus, we remember that we
16571 found a valid type-id, but we still try to parse the argument as an
16572 expression to see what happens.
16574 In C++0x, the '>>' will be considered two separate '>'
16575 tokens. */
16579 {
16582 }
16583 else
16584 {
16585 /* If the next token isn't a `,' or a `>', then this argument wasn't
16586 really finished. This means that the argument is not a valid
16587 type-id. */
16590 /* If that worked, we're done. */
16593 }
16594 /* We're still not sure what the argument will be. */
16596 /* Try a template. */
16604 /* If the next token isn't a `,' or a `>', then this argument wasn't
16605 really finished. */
16609 {
16610 /* Figure out what is being referred to. If the id-expression
16611 was for a class template specialization, then we will have a
16612 TYPE_DECL at this point. There is no need to do name lookup
16613 at this point in that case. */
16616 none_type,
16622 /* Handle a constrained-type-specifier for a non-type template
16623 parameter. */
16629 }
16631 {
16635 }
16636 /* It must be a non-type argument. In C++17 any constant-expression is
16637 allowed. */
16641 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16643 -- an integral constant-expression of integral or enumeration
16644 type; or
16646 -- the name of a non-type template-parameter; or
16648 -- the name of an object or function with external linkage...
16650 -- the address of an object or function with external linkage...
16652 -- a pointer to member... */
16653 /* Look for a non-type template parameter. */
16655 {
16667 }
16669 /* If the next token is "&", the argument must be the address of an
16670 object or function with external linkage. */
16673 {
16676 }
16677 /* See if we might have an id-expression. */
16684 {
16687 address_p,
16694 else
16695 {
16696 tree probe;
16699 {
16700 /* Strip the dereference temporarily. */
16703 }
16705 /* If we're in a template, we represent a qualified-id referring
16706 to a static data member as a SCOPE_REF even if the scope isn't
16707 dependent so that we can check access control later. */
16712 {
16713 /* A variable without external linkage might still be a
16714 valid constant-expression, so no error is issued here
16715 if the external-linkage check fails. */
16718 }
16720 /* All overloaded functions are allowed; if the external
16721 linkage test does not pass, an error will be issued
16722 later. */
16723 ;
16727 /* A pointer-to-member. */
16728 ;
16730 ;
16731 else
16735 {
16738 tf_warning_or_error);
16739 else
16742 }
16743 }
16744 }
16745 /* If the argument started with "&", there are no other valid
16746 alternatives at this point. */
16748 {
16751 }
16753 general_expr:
16754 /* If the argument wasn't successfully parsed as a type-id followed
16755 by '>>', the argument can only be a constant expression now.
16756 Otherwise, we try parsing the constant-expression tentatively,
16757 because the argument could really be a type-id. */
16763 else
16764 {
16765 /* With C++17 generalized non-type template arguments we need to handle
16766 lvalue constant expressions, too. */
16769 }
16777 /* We did our best to parse the argument as a non type-id, but that
16778 was the only alternative that matched (albeit with a '>' after
16779 it). We can assume it's just a typo from the user, and a
16780 diagnostic will then be issued. */
16782 }
16784 /* Parse an explicit-instantiation.
16786 explicit-instantiation:
16787 template declaration
16789 Although the standard says `declaration', what it really means is:
16791 explicit-instantiation:
16792 template decl-specifier-seq [opt] declarator [opt] ;
16794 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16795 supposed to be allowed. A defect report has been filed about this
16796 issue.
16798 GNU Extension:
16800 explicit-instantiation:
16801 storage-class-specifier template
16802 decl-specifier-seq [opt] declarator [opt] ;
16803 function-specifier template
16804 decl-specifier-seq [opt] declarator [opt] ; */
16806 static void
16808 {
16810 cp_decl_specifier_seq decl_specifiers;
16815 /* Look for an (optional) storage-class-specifier or
16816 function-specifier. */
16818 {
16819 extension_specifier
16822 extension_specifier
16825 }
16827 /* Look for the `template' keyword. */
16829 /* Let the front end know that we are processing an explicit
16830 instantiation. */
16832 /* [temp.explicit] says that we are supposed to ignore access
16833 control while processing explicit instantiation directives. */
16835 /* Parse a decl-specifier-seq. */
16837 CP_PARSER_FLAGS_OPTIONAL,
16840 /* If there was exactly one decl-specifier, and it declared a class,
16841 and there's no declarator, then we have an explicit type
16842 instantiation. */
16844 {
16845 tree type;
16849 /* Turn access control back on for names used during
16850 template instantiation. */
16855 }
16856 else
16857 {
16859 tree decl;
16861 /* Parse the declarator. */
16862 declarator
16873 {
16876 "explicit instantiation shall not use"
16880 "explicit instantiation shall not use"
16885 /* Turn access control back on for names used during
16886 template instantiation. */
16888 /* Do the explicit instantiation. */
16890 }
16891 else
16892 {
16894 /* Skip the body of the explicit instantiation. */
16896 }
16897 }
16898 /* We're done with the instantiation. */
16904 }
16906 /* Parse an explicit-specialization.
16908 explicit-specialization:
16909 template < > declaration
16911 Although the standard says `declaration', what it really means is:
16913 explicit-specialization:
16914 template <> decl-specifier [opt] init-declarator [opt] ;
16915 template <> function-definition
16916 template <> explicit-specialization
16917 template <> template-declaration */
16919 static void
16921 {
16925 /* Look for the `template' keyword. */
16927 /* Look for the `<'. */
16929 /* Look for the `>'. */
16931 /* We have processed another parameter list. */
16933 /* [temp]
16935 A template ... explicit specialization ... shall not have C
16936 linkage. */
16938 {
16941 /* Give it C++ linkage to avoid confusing other parts of the
16942 front end. */
16945 }
16946 else
16948 /* Let the front end know that we are beginning a specialization. */
16950 {
16953 }
16955 /* If the next keyword is `template', we need to figure out whether
16956 or not we're looking a template-declaration. */
16958 {
16963 else
16965 }
16966 else
16967 /* Parse the dependent declaration. */
16973 /* We're done with the specialization. */
16975 /* For the erroneous case of a template with C linkage, we pushed an
16976 implicit C++ linkage scope; exit that scope now. */
16979 /* We're done with this parameter list. */
16981 }
16983 /* Parse a type-specifier.
16985 type-specifier:
16986 simple-type-specifier
16987 class-specifier
16988 enum-specifier
16989 elaborated-type-specifier
16990 cv-qualifier
16992 GNU Extension:
16994 type-specifier:
16995 __complex__
16997 Returns a representation of the type-specifier. For a
16998 class-specifier, enum-specifier, or elaborated-type-specifier, a
16999 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
17001 The parser flags FLAGS is used to control type-specifier parsing.
17003 If IS_DECLARATION is TRUE, then this type-specifier is appearing
17004 in a decl-specifier-seq.
17006 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
17007 class-specifier, enum-specifier, or elaborated-type-specifier, then
17008 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
17009 if a type is declared; 2 if it is defined. Otherwise, it is set to
17010 zero.
17012 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
17013 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
17014 is set to FALSE. */
17016 static tree
17018 cp_parser_flags flags,
17023 {
17029 /* Assume this type-specifier does not declare a new type. */
17032 /* And that it does not specify a cv-qualifier. */
17035 /* Peek at the next token. */
17038 /* If we're looking at a keyword, we can use that to guide the
17039 production we choose. */
17042 {
17047 /* Look for the enum-specifier. */
17049 /* If that worked, we're done. */
17051 {
17056 type_spec,
17057 token,
17060 }
17061 else
17064 /* Any of these indicate either a class-specifier, or an
17065 elaborated-type-specifier. */
17072 /* Parse tentatively so that we can back up if we don't find a
17073 class-specifier. */
17075 /* Look for the class-specifier. */
17078 /* If that worked, we're done. */
17080 {
17085 type_spec,
17086 token,
17089 }
17091 /* Fall through. */
17092 elaborated_type_specifier:
17093 /* We're declaring (not defining) a class or enum. */
17097 /* Fall through. */
17099 /* Look for an elaborated-type-specifier. */
17100 type_spec
17101 = (cp_parser_elaborated_type_specifier
17104 is_declaration));
17107 type_spec,
17108 token,
17131 /* The `__complex__' keyword is a GNU extension. */
17137 }
17139 /* Handle simple keywords. */
17141 {
17143 {
17146 }
17148 }
17150 /* If we do not already have a type-specifier, assume we are looking
17151 at a simple-type-specifier. */
17153 decl_specs,
17154 flags);
17156 /* If we didn't find a type-specifier, and a type-specifier was not
17157 optional in this context, issue an error message. */
17159 {
17162 }
17165 }
17167 /* Parse a simple-type-specifier.
17169 simple-type-specifier:
17170 :: [opt] nested-name-specifier [opt] type-name
17171 :: [opt] nested-name-specifier template template-id
17172 char
17173 wchar_t
17174 bool
17175 short
17176 int
17177 long
17178 signed
17179 unsigned
17180 float
17181 double
17182 void
17184 C++11 Extension:
17186 simple-type-specifier:
17187 auto
17188 decltype ( expression )
17189 char16_t
17190 char32_t
17191 __underlying_type ( type-id )
17193 C++17 extension:
17195 nested-name-specifier(opt) template-name
17197 GNU Extension:
17199 simple-type-specifier:
17200 __int128
17201 __typeof__ unary-expression
17202 __typeof__ ( type-id )
17203 __typeof__ ( type-id ) { initializer-list , [opt] }
17205 Concepts Extension:
17207 simple-type-specifier:
17208 constrained-type-specifier
17210 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
17211 appropriately updated. */
17213 static tree
17216 cp_parser_flags flags)
17217 {
17222 /* Peek at the next token. */
17225 /* If we're looking at a keyword, things are easy. */
17227 {
17262 {
17265 }
17294 {
17295 /* The 'auto' might be the placeholder return type for a function decl
17296 with trailing return type. */
17305 {
17307 {
17314 }
17317 {
17320 }
17323 }
17327 {
17330 }
17333 {
17336 }
17337 else
17341 {
17344 "use of %<auto%> in lambda parameter declaration "
17345 "only available with "
17347 }
17350 "use of %<auto%> in parameter declaration "
17351 "only available with "
17355 "use of %<auto%> in parameter declaration "
17357 }
17358 else
17363 /* Since DR 743, decltype can either be a simple-type-specifier by
17364 itself or begin a nested-name-specifier. Parsing it will replace
17365 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17366 handling below decide what to do. */
17372 /* Consume the `typeof' token. */
17374 /* Parse the operand to `typeof'. */
17376 /* If it is not already a TYPE, take its type. */
17382 token,
17391 token,
17401 token,
17406 }
17408 /* If token is an already-parsed decltype not followed by ::,
17409 it's a simple-type-specifier. */
17412 {
17415 {
17417 token,
17419 /* Remember that we are handling a decltype in order to
17420 implement the resolution of DR 1510 when the argument
17421 isn't instantiation dependent. */
17423 }
17426 }
17428 /* If the type-specifier was for a built-in type, we're done. */
17430 {
17431 /* Record the type. */
17438 type,
17439 token,
17444 /* Consume the token. */
17450 /* There is no valid C++ program where a non-template type is
17451 followed by a "<". That usually indicates that the user thought
17452 that the type was a template. */
17457 }
17459 /* The type-specifier must be a user-defined type. */
17461 {
17465 /* Don't gobble tokens or issue error messages if this is an
17466 optional type-specifier. */
17472 /* Look for the optional `::' operator. */
17473 global_p
17477 /* Look for the nested-name specifier. */
17478 qualified_p
17485 /* If we have seen a nested-name-specifier, and the next token
17486 is `template', then we are using the template-id production. */
17489 {
17490 /* Look for the template-id. */
17494 none_type,
17496 /* If the template-id did not name a type, we are out of
17497 luck. */
17499 {
17502 }
17503 }
17504 /* Otherwise, look for a type-name. */
17505 else
17507 /* Keep track of all name-lookups performed in class scopes. */
17509 && !global_p
17510 && !qualified_p
17514 /* If it didn't work out, we don't have a TYPE. */
17519 {
17533 {
17535 none_type,
17545 else
17546 {
17551 }
17552 }
17553 else
17559 }
17562 token,
17564 }
17566 /* If we didn't get a type-name, issue an error message. */
17568 {
17571 }
17574 {
17575 /* See if TYPE is an Objective-C type, and if so, parse and
17576 accept any protocol references following it. Do this before
17577 the cp_parser_check_for_invalid_template_id() call, because
17578 Objective-C types can be followed by '<...>' which would
17579 enclose protocol names rather than template arguments, and so
17580 everything is fine. */
17583 {
17587 /* Clobber the "unqualified" type previously entered into
17588 DECL_SPECS with the new, improved protocol-qualified version. */
17593 }
17595 /* There is no valid C++ program where a non-template type is
17596 followed by a "<". That usually indicates that the user
17597 thought that the type was a template. */
17599 none_type,
17601 }
17604 }
17606 /* Parse a type-name.
17608 type-name:
17609 class-name
17610 enum-name
17611 typedef-name
17612 simple-template-id [in c++0x]
17614 enum-name:
17615 identifier
17617 typedef-name:
17618 identifier
17620 Concepts:
17622 type-name:
17623 concept-name
17624 partial-concept-id
17626 concept-name:
17627 identifier
17629 Returns a TYPE_DECL for the type. */
17631 static tree
17633 {
17635 }
17637 /* See above. */
17638 static tree
17640 {
17641 tree type_decl;
17643 /* We can't know yet whether it is a class-name or not. */
17645 /* Try a class-name. */
17647 typename_keyword_p,
17649 none_type,
17653 /* If it's not a class-name, keep looking. */
17655 {
17657 /* It must be a typedef-name or an enum-name. */
17661 /* It is either a simple-template-id representing an
17662 instantiation of an alias template... */
17666 none_type,
17668 /* Note that this must be an instantiation of an alias template
17669 because [temp.names]/6 says:
17671 A template-id that names an alias template specialization
17672 is a type-name.
17674 Whereas [temp.names]/7 says:
17676 A simple-template-id that names a class template
17677 specialization is a class-name.
17679 With concepts, this could also be a partial-concept-id that
17680 declares a non-type template parameter. */
17687 else
17691 /* ... Or a typedef-name or an enum-name. */
17693 }
17696 }
17698 /* Check if DECL and ARGS can form a constrained-type-specifier.
17699 If ARGS is non-null, we try to form a concept check of the
17700 form DECL<?, ARGS> where ? is a wildcard that matches any
17701 kind of template argument. If ARGS is NULL, then we try to
17702 form a concept check of the form DECL<?>. */
17704 static tree
17707 {
17710 /* If we a constrained-type-specifier cannot be deduced. */
17714 /* A constrained type specifier can only be found in an
17715 overload set or as a reference to a template declaration.
17717 FIXME: This might be masking a bug. It's possible that
17718 that the deduction below is causing template specializations
17719 to be formed with the wildcard as an argument. */
17723 /* Try to build a call expression that evaluates the
17724 concept. This can fail if the overload set refers
17725 only to non-templates. */
17731 /* Deduce the checked constraint and the prototype parameter.
17733 FIXME: In certain cases, failure to deduce should be a
17734 diagnosable error. */
17735 tree conc;
17736 tree proto;
17740 /* In template parameter scope, this results in a constrained
17741 parameter. Return a descriptor of that parm. */
17745 /* In a parameter-declaration-clause, constrained-type
17746 specifiers result in invented template parameters. */
17748 {
17751 }
17752 else
17753 {
17754 /* Otherwise, we're in a context where the constrained
17755 type name is deduced and the constraint applies
17756 after deduction. */
17758 }
17761 }
17763 /* If DECL refers to a concept, return a TYPE_DECL representing
17764 the result of using the constrained type specifier in the
17765 current context. DECL refers to a concept if
17767 - it is an overload set containing a function concept taking a single
17768 type argument, or
17770 - it is a variable concept taking a single type argument. */
17772 static tree
17774 {
17780 else
17782 }
17784 /* Check if DECL and ARGS form a partial-concept-id. If so,
17785 assign ID to the resulting constrained placeholder.
17787 Returns true if the partial-concept-id designates a placeholder
17788 and false otherwise. Note that *id is set to NULL_TREE in
17789 this case. */
17791 static tree
17793 {
17795 }
17797 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17798 or a concept-name.
17800 enum-name:
17801 identifier
17803 typedef-name:
17804 identifier
17806 concept-name:
17807 identifier
17809 Returns a TYPE_DECL for the type. */
17811 static tree
17813 {
17814 tree type_decl;
17815 tree identifier;
17822 /* Look up the type-name. */
17827 /* If we found an overload set, then it may refer to a concept-name. */
17833 {
17834 /* See if this is an Objective-C type. */
17839 }
17841 /* Issue an error if we did not find a type-name. */
17843 /* In Objective-C, we have the complication that class names are
17844 normally type names and start declarations (eg, the
17845 "NSObject" in "NSObject *object;"), but can be used in an
17846 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17847 is an expression. So, a classname followed by a dot is not a
17848 valid type-name. */
17851 {
17856 }
17857 /* Remember that the name was used in the definition of the
17858 current class so that we can check later to see if the
17859 meaning would have been different after the class was
17860 entirely defined. */
17866 }
17868 /* Parse an elaborated-type-specifier. Note that the grammar given
17869 here incorporates the resolution to DR68.
17871 elaborated-type-specifier:
17872 class-key :: [opt] nested-name-specifier [opt] identifier
17873 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17874 enum-key :: [opt] nested-name-specifier [opt] identifier
17875 typename :: [opt] nested-name-specifier identifier
17876 typename :: [opt] nested-name-specifier template [opt]
17877 template-id
17879 GNU extension:
17881 elaborated-type-specifier:
17882 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17883 class-key attributes :: [opt] nested-name-specifier [opt]
17884 template [opt] template-id
17885 enum attributes :: [opt] nested-name-specifier [opt] identifier
17887 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17888 declared `friend'. If IS_DECLARATION is TRUE, then this
17889 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17890 something is being declared.
17892 Returns the TYPE specified. */
17894 static tree
17898 {
17900 tree identifier;
17903 tree globalscope;
17906 /* See if we're looking at the `enum' keyword. */
17908 {
17909 /* Consume the `enum' token. */
17911 /* Remember that it's an enumeration type. */
17913 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17914 enums) is used here. */
17918 {
17925 /* Consume the `struct' or `class' and parse it anyway. */
17927 }
17928 /* Parse the attributes. */
17930 }
17931 /* Or, it might be `typename'. */
17933 RID_TYPENAME))
17934 {
17935 /* Consume the `typename' token. */
17937 /* Remember that it's a `typename' type. */
17939 }
17940 /* Otherwise it must be a class-key. */
17941 else
17942 {
17946 /* Parse the attributes. */
17948 }
17950 /* Look for the `::' operator. */
17953 /* Look for the nested-name-specifier. */
17954 tree nested_name_specifier;
17956 {
17957 nested_name_specifier
17962 is_declaration);
17965 }
17966 else
17967 /* Even though `typename' is not present, the proposed resolution
17968 to Core Issue 180 says that in `class A<T>::B', `B' should be
17969 considered a type-name, even if `A<T>' is dependent. */
17970 nested_name_specifier
17975 is_declaration);
17976 /* For everything but enumeration types, consider a template-id.
17977 For an enumeration type, consider only a plain identifier. */
17979 {
17981 tree decl;
17983 /* Allow the `template' keyword. */
17985 /* If we didn't see `template', we don't know if there's a
17986 template-id or not. */
17989 /* Parse the template-id. */
17993 tag_type,
17994 is_declaration);
17995 /* If we didn't find a template-id, look for an ordinary
17996 identifier. */
17998 ;
17999 /* We can get here when cp_parser_template_id, called by
18000 cp_parser_class_name with tag_type == none_type, succeeds
18001 and caches a BASELINK. Then, when called again here,
18002 instead of failing and returning an error_mark_node
18003 returns it (see template/typename17.C in C++11).
18004 ??? Could we diagnose this earlier? */
18006 {
18009 }
18010 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
18011 in effect, then we must assume that, upon instantiation, the
18012 template will correspond to a class. */
18016 typename_type,
18018 /* If the `typename' keyword is in effect and DECL is not a type
18019 decl, then type is non existent. */
18021 ;
18023 {
18027 /* If the next token is a semicolon, this must be a specialization,
18028 instantiation, or friend declaration. Check the scope while we
18029 still know whether or not we had a nested-name-specifier. */
18034 }
18037 }
18040 {
18045 {
18048 }
18050 /* For a `typename', we needn't call xref_tag. */
18056 /* Template parameter lists apply only if we are not within a
18057 function parameter list. */
18058 bool template_parm_lists_apply
18067 /* Look up a qualified name in the usual way. */
18069 {
18070 tree decl;
18071 tree ambiguous_decls;
18074 tag_type,
18081 /* If the lookup was ambiguous, an error will already have been
18082 issued. */
18086 /* If we are parsing friend declaration, DECL may be a
18087 TEMPLATE_DECL tree node here. However, we need to check
18088 whether this TEMPLATE_DECL results in valid code. Consider
18089 the following example:
18091 namespace N {
18092 template <class T> class C {};
18093 }
18094 class X {
18095 template <class T> friend class N::C; // #1, valid code
18096 };
18097 template <class T> class Y {
18098 friend class N::C; // #2, invalid code
18099 };
18101 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
18102 name lookup of `N::C'. We see that friend declaration must
18103 be template for the code to be valid. Note that
18104 processing_template_decl does not work here since it is
18105 always 1 for the above two cases. */
18107 decl = (cp_parser_maybe_treat_template_as_class
18112 {
18114 identifier,
18117 }
18120 {
18124 allow_template);
18128 }
18130 /* Forward declarations of nested types, such as
18132 class C1::C2;
18133 class C1::C2::C3;
18135 are invalid unless all components preceding the final '::'
18136 are complete. If all enclosing types are complete, these
18137 declarations become merely pointless.
18139 Invalid forward declarations of nested types are errors
18140 caught elsewhere in parsing. Those that are pointless arrive
18141 here. */
18148 }
18149 else
18150 {
18151 /* An elaborated-type-specifier sometimes introduces a new type and
18152 sometimes names an existing type. Normally, the rule is that it
18153 introduces a new type only if there is not an existing type of
18154 the same name already in scope. For example, given:
18156 struct S {};
18157 void f() { struct S s; }
18159 the `struct S' in the body of `f' is the same `struct S' as in
18160 the global scope; the existing definition is used. However, if
18161 there were no global declaration, this would introduce a new
18162 local class named `S'.
18164 An exception to this rule applies to the following code:
18166 namespace N { struct S; }
18168 Here, the elaborated-type-specifier names a new type
18169 unconditionally; even if there is already an `S' in the
18170 containing scope this declaration names a new type.
18171 This exception only applies if the elaborated-type-specifier
18172 forms the complete declaration:
18174 [class.name]
18176 A declaration consisting solely of `class-key identifier ;' is
18177 either a redeclaration of the name in the current scope or a
18178 forward declaration of the identifier as a class name. It
18179 introduces the name into the current scope.
18181 We are in this situation precisely when the next token is a `;'.
18183 An exception to the exception is that a `friend' declaration does
18184 *not* name a new type; i.e., given:
18186 struct S { friend struct T; };
18188 `T' is not a new type in the scope of `S'.
18190 Also, `new struct S' or `sizeof (struct S)' never results in the
18191 definition of a new type; a new type can only be declared in a
18192 declaration context. */
18194 tag_scope ts;
18198 /* Friends have special name lookup rules. */
18202 CPP_SEMICOLON))
18203 /* This is a `class-key identifier ;' */
18205 else
18208 template_p =
18209 (template_parm_lists_apply
18212 /* An unqualified name was used to reference this type, so
18213 there were no qualifying templates. */
18222 }
18223 }
18228 /* Allow attributes on forward declarations of classes. */
18230 {
18240 else
18243 }
18246 {
18247 /* Indicate whether this class was declared as a `class' or as a
18248 `struct'. */
18252 }
18254 /* A "<" cannot follow an elaborated type specifier. If that
18255 happens, the user was probably trying to form a template-id. */
18260 }
18262 /* Parse an enum-specifier.
18264 enum-specifier:
18265 enum-head { enumerator-list [opt] }
18266 enum-head { enumerator-list , } [C++0x]
18268 enum-head:
18269 enum-key identifier [opt] enum-base [opt]
18270 enum-key nested-name-specifier identifier enum-base [opt]
18272 enum-key:
18273 enum
18274 enum class [C++0x]
18275 enum struct [C++0x]
18277 enum-base: [C++0x]
18278 : type-specifier-seq
18280 opaque-enum-specifier:
18281 enum-key identifier enum-base [opt] ;
18283 GNU Extensions:
18284 enum-key attributes[opt] identifier [opt] enum-base [opt]
18285 { enumerator-list [opt] }attributes[opt]
18286 enum-key attributes[opt] identifier [opt] enum-base [opt]
18287 { enumerator-list, }attributes[opt] [C++0x]
18289 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
18290 if the token stream isn't an enum-specifier after all. */
18292 static tree
18294 {
18295 tree identifier;
18297 tree prev_scope;
18299 tree attributes;
18312 /* Parse tentatively so that we can back up if we don't find a
18313 enum-specifier. */
18316 /* Caller guarantees that the current token is 'enum', an identifier
18317 possibly follows, and the token after that is an opening brace.
18318 If we don't have an identifier, fabricate an anonymous name for
18319 the enumeration being defined. */
18322 /* Parse the "class" or "struct", which indicates a scoped
18323 enumeration type in C++0x. */
18326 {
18330 /* Consume the `struct' or `class' token. */
18334 }
18338 /* Clear the qualification. */
18343 /* Figure out in what scope the declaration is being placed. */
18349 nested_name_specifier
18357 {
18358 tree name;
18362 enum_type,
18367 input_location);
18369 {
18372 {
18373 /* Are template enums allowed in ISO? */
18377 /* ignore a typename reference, for it will be solved by name
18378 in start_enum. */
18380 }
18381 }
18384 else
18385 {
18390 }
18391 }
18392 else
18393 {
18396 else
18397 {
18403 }
18404 }
18407 /* Check for the `:' that denotes a specified underlying type in C++0x.
18408 Note that a ':' could also indicate a bitfield width, however. */
18410 {
18411 cp_decl_specifier_seq type_specifiers;
18413 /* Consume the `:'. */
18416 /* Parse the type-specifier-seq. */
18421 /* At this point this is surely not elaborated type specifier. */
18430 /* If that didn't work, stop. */
18432 {
18438 }
18439 }
18441 /* Look for the `{' but don't consume it yet. */
18443 {
18445 {
18448 {
18451 }
18452 }
18453 /* An opaque-enum-specifier must have a ';' here. */
18456 {
18459 {
18462 }
18463 }
18464 }
18470 {
18472 {
18476 }
18478 {
18480 }
18481 }
18483 /* Issue an error message if type-definitions are forbidden here. */
18486 else
18487 /* Create the new type. We do this before consuming the opening
18488 brace so the enum will be recorded as being on the line of its
18489 tag (or the 'enum' keyword, if there is no tag). */
18493 /* If the next token is not '{' it is an opaque-enum-specifier or an
18494 elaborated-type-specifier. */
18496 {
18500 {
18501 /* The following catches invalid code such as:
18502 enum class S<int>::E { A, B, C }; */
18510 {
18514 nested_name_specifier);
18516 }
18519 {
18521 "%qT for enum declaration does not name a class "
18524 }
18525 /* If that scope does not contain the scope in which the
18526 class was originally declared, the program is invalid. */
18528 nested_name_specifier))
18529 {
18532 "declaration of %qD in namespace %qD which does not "
18535 else
18537 "declaration of %qD in %qD which does not "
18541 }
18542 /* If that scope is the scope where the declaration is being placed
18543 the program is invalid. */
18547 {
18551 }
18552 }
18557 /* Consume the opening brace. */
18558 matching_braces braces;
18565 {
18569 }
18570 else
18571 {
18577 }
18581 /* If the next token is not '}', then there are some enumerators. */
18583 {
18587 }
18588 else
18591 /* Consume the final '}'. */
18597 }
18598 else
18599 {
18600 /* If a ';' follows, then it is an opaque-enum-specifier
18601 and additional restrictions apply. */
18603 {
18610 }
18611 }
18613 /* Look for trailing attributes to apply to this enumeration, and
18614 apply them if appropriate. */
18616 {
18619 trailing_attr,
18621 }
18623 /* Finish up the enumeration. */
18625 {
18630 }
18633 {
18635 {
18638 }
18640 {
18642 }
18643 }
18644 out:
18647 }
18649 /* Parse an enumerator-list. The enumerators all have the indicated
18650 TYPE.
18652 enumerator-list:
18653 enumerator-definition
18654 enumerator-list , enumerator-definition */
18656 static void
18658 {
18660 {
18661 /* Parse an enumerator-definition. */
18664 /* If the next token is not a ',', we've reached the end of
18665 the list. */
18668 /* Otherwise, consume the `,' and keep going. */
18670 /* If the next token is a `}', there is a trailing comma. */
18672 {
18677 }
18678 }
18679 }
18681 /* Parse an enumerator-definition. The enumerator has the indicated
18682 TYPE.
18684 enumerator-definition:
18685 enumerator
18686 enumerator = constant-expression
18688 enumerator:
18689 identifier
18691 GNU Extensions:
18693 enumerator-definition:
18694 enumerator attributes [opt]
18695 enumerator attributes [opt] = constant-expression */
18697 static void
18699 {
18700 tree identifier;
18701 tree value;
18702 location_t loc;
18704 /* Save the input location because we are interested in the location
18705 of the identifier and not the location of the explicit value. */
18708 /* Look for the identifier. */
18713 /* Parse any specified attributes. */
18716 /* If the next token is an '=', then there is an explicit value. */
18718 {
18719 /* Consume the `=' token. */
18721 /* Parse the value. */
18723 }
18724 else
18727 /* If we are processing a template, make sure the initializer of the
18728 enumerator doesn't contain any bare template parameter pack. */
18732 /* Create the enumerator. */
18734 }
18736 /* Parse a namespace-name.
18738 namespace-name:
18739 original-namespace-name
18740 namespace-alias
18742 Returns the NAMESPACE_DECL for the namespace. */
18744 static tree
18746 {
18747 tree identifier;
18748 tree namespace_decl;
18752 /* Get the name of the namespace. */
18757 /* Look up the identifier in the currently active scope. Look only
18758 for namespaces, due to:
18760 [basic.lookup.udir]
18762 When looking up a namespace-name in a using-directive or alias
18763 definition, only namespace names are considered.
18765 And:
18767 [basic.lookup.qual]
18769 During the lookup of a name preceding the :: scope resolution
18770 operator, object, function, and enumerator names are ignored.
18772 (Note that cp_parser_qualifying_entity only calls this
18773 function if the token after the name is the scope resolution
18774 operator.) */
18776 none_type,
18782 /* If it's not a namespace, issue an error. */
18785 {
18787 {
18788 auto_diagnostic_group d;
18789 name_hint hint;
18793 identifier,
18796 {
18802 }
18803 else
18805 identifier);
18806 }
18807 else
18810 }
18813 }
18815 /* Parse a namespace-definition.
18817 namespace-definition:
18818 named-namespace-definition
18819 unnamed-namespace-definition
18821 named-namespace-definition:
18822 original-namespace-definition
18823 extension-namespace-definition
18825 original-namespace-definition:
18826 namespace identifier { namespace-body }
18828 extension-namespace-definition:
18829 namespace original-namespace-name { namespace-body }
18831 unnamed-namespace-definition:
18832 namespace { namespace-body } */
18834 static void
18836 {
18837 tree identifier;
18846 {
18849 }
18851 /* Look for the `namespace' keyword. */
18852 cp_token* token
18855 /* Parse any specified attributes before the identifier. */
18859 {
18863 {
18868 "standard attributes on namespaces must precede "
18871 /* Parse any attributes specified after the identifier. */
18873 }
18880 "nested namespace definitions only available with "
18883 /* Nested namespace names can create new namespaces (unlike
18884 other qualified-ids). */
18887 else
18890 }
18902 /* Start the namespace. */
18909 /* Look for the `{' to validate starting the namespace. */
18910 matching_braces braces;
18912 {
18913 /* Parse the body of the namespace. */
18916 /* Look for the final `}'. */
18918 }
18923 /* Pop the nested namespace definitions. */
18926 }
18928 /* Parse a namespace-body.
18930 namespace-body:
18931 declaration-seq [opt] */
18933 static void
18935 {
18937 }
18939 /* Parse a namespace-alias-definition.
18941 namespace-alias-definition:
18942 namespace identifier = qualified-namespace-specifier ; */
18944 static void
18946 {
18947 tree identifier;
18948 tree namespace_specifier;
18952 /* Look for the `namespace' keyword. */
18954 /* Look for the identifier. */
18958 /* Look for the `=' token. */
18961 {
18963 /* Skip the definition. */
18968 }
18970 /* Look for the qualified-namespace-specifier. */
18971 namespace_specifier
18973 /* Look for the `;' token. */
18976 /* Register the alias in the symbol table. */
18978 }
18980 /* Parse a qualified-namespace-specifier.
18982 qualified-namespace-specifier:
18983 :: [opt] nested-name-specifier [opt] namespace-name
18985 Returns a NAMESPACE_DECL corresponding to the specified
18986 namespace. */
18988 static tree
18990 {
18991 /* Look for the optional `::'. */
18995 /* Look for the optional nested-name-specifier. */
19003 }
19005 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
19006 access declaration.
19008 using-declaration:
19009 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
19010 using :: unqualified-id ;
19012 access-declaration:
19013 qualified-id ;
19015 */
19017 static bool
19020 {
19024 tree decl;
19025 tree identifier;
19026 tree qscope;
19031 {
19034 }
19035 else
19036 {
19037 /* Look for the `using' keyword. */
19040 again:
19041 /* Peek at the next token. */
19043 /* See if it's `typename'. */
19045 {
19046 /* Remember that we've seen it. */
19048 /* Consume the `typename' token. */
19050 }
19051 }
19053 /* Look for the optional global scope qualification. */
19054 global_scope_p
19059 /* If we saw `typename', or didn't see `::', then there must be a
19060 nested-name-specifier present. */
19062 {
19068 {
19071 }
19072 }
19073 /* Otherwise, we could be in either of the two productions. In that
19074 case, treat the nested-name-specifier as optional. */
19075 else
19087 /* Something has already gone wrong; there's no need to parse
19088 further. Since an error has occurred, the return value of
19089 cp_parser_parse_definitely will be false, as required. */
19093 /* Parse the unqualified-id. */
19101 {
19106 }
19108 {
19113 "pack expansion in using-declaration only available "
19116 }
19118 /* The function we call to handle a using-declaration is different
19119 depending on what scope we are in. */
19121 ;
19124 /* [namespace.udecl]
19126 A using declaration shall not name a template-id. */
19129 else
19130 {
19132 {
19133 /* Create the USING_DECL. */
19140 {
19143 }
19144 else
19145 /* Add it to the list of members in this class. */
19147 }
19148 else
19149 {
19151 identifier,
19158 {
19161 }
19164 else
19166 }
19167 }
19171 {
19175 "comma-separated list in using-declaration only available "
19178 }
19180 /* Look for the final `;'. */
19185 "access declarations are deprecated "
19186 "in favour of using-declarations; "
19190 }
19192 /* Parse an alias-declaration.
19194 alias-declaration:
19195 using identifier attribute-specifier-seq [opt] = type-id */
19197 static tree
19199 {
19203 cp_decl_specifier_seq decl_specs;
19207 /* Look for the `using' keyword. */
19208 cp_token *using_token
19230 /* Now we are going to parse the type-id of the declaration. */
19232 /*
19233 [dcl.type]/3 says:
19235 "A type-specifier-seq shall not define a class or enumeration
19236 unless it appears in the type-id of an alias-declaration (7.1.3) that
19237 is not the declaration of a template-declaration."
19239 In other words, if we currently are in an alias template, the
19240 type-id should not define a type.
19242 So let's set parser->type_definition_forbidden_message in that
19243 case; cp_parser_check_type_definition (called by
19244 cp_parser_class_specifier) will then emit an error if a type is
19245 defined in the type-id. */
19247 {
19251 }
19255 /* Restore the error message if need be. */
19261 {
19264 }
19266 /* A typedef-name can also be introduced by an alias-declaration. The
19267 identifier following the using keyword becomes a typedef-name. It has
19268 the same semantics as if it were introduced by the typedef
19269 specifier. In particular, it does not define a new type and it shall
19270 not appear in the type-id. */
19275 {
19278 ds_attribute,
19279 attrs_token);
19280 }
19282 ds_typedef,
19283 using_token);
19285 ds_alias,
19286 using_token);
19293 id_location,
19304 else
19310 // Attach constraints to the alias declaration.
19312 {
19316 }
19323 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19324 added into the symbol table; otherwise, return the TYPE_DECL. */
19328 {
19332 }
19335 }
19337 /* Parse a using-directive.
19339 using-directive:
19340 using namespace :: [opt] nested-name-specifier [opt]
19341 namespace-name ; */
19343 static void
19345 {
19346 tree namespace_decl;
19347 tree attribs;
19349 /* Look for the `using' keyword. */
19351 /* And the `namespace' keyword. */
19353 /* Look for the optional `::' operator. */
19355 /* And the optional nested-name-specifier. */
19361 /* Get the namespace being used. */
19363 /* And any specified attributes. */
19366 /* Update the symbol table. */
19369 else
19372 /* Look for the final `;'. */
19374 }
19376 /* Parse an asm-definition.
19378 asm-definition:
19379 asm ( string-literal ) ;
19381 GNU Extension:
19383 asm-definition:
19384 asm volatile [opt] ( string-literal ) ;
19385 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19386 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19387 : asm-operand-list [opt] ) ;
19388 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19389 : asm-operand-list [opt]
19390 : asm-clobber-list [opt] ) ;
19391 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19392 : asm-clobber-list [opt]
19393 : asm-goto-list ) ; */
19395 static void
19397 {
19398 tree string;
19403 tree asm_stmt;
19411 /* Look for the `asm' keyword. */
19416 {
19419 }
19421 /* See if the next token is `volatile'. */
19424 {
19425 /* Remember that we saw the `volatile' keyword. */
19427 /* Consume the token. */
19429 }
19433 {
19434 /* Remember that we saw the `goto' keyword. */
19436 /* Consume the token. */
19438 }
19439 /* Look for the opening `('. */
19442 /* Look for the string. */
19445 {
19449 }
19451 /* If we're allowing GNU extensions, check for the extended assembly
19452 syntax. Unfortunately, the `:' tokens need not be separated by
19453 a space in C, and so, for compatibility, we tolerate that here
19454 too. Doing that means that we have to treat the `::' operator as
19455 two `:' tokens. */
19460 {
19465 /* The extended syntax was used. */
19468 /* Look for outputs. */
19470 {
19471 /* Consume the `:'. */
19473 /* Parse the output-operands. */
19475 CPP_COLON)
19477 CPP_SCOPE)
19479 CPP_CLOSE_PAREN)
19481 {
19485 }
19486 }
19487 /* If the next token is `::', there are no outputs, and the
19488 next token is the beginning of the inputs. */
19490 /* The inputs are coming next. */
19493 /* Look for inputs. */
19496 {
19497 /* Consume the `:' or `::'. */
19499 /* Parse the output-operands. */
19501 CPP_COLON)
19503 CPP_SCOPE)
19505 CPP_CLOSE_PAREN))
19506 {
19510 }
19511 }
19513 /* The clobbers are coming next. */
19516 /* Look for clobbers. */
19519 {
19521 /* Consume the `:' or `::'. */
19523 /* Parse the clobbers. */
19525 CPP_COLON)
19527 CPP_CLOSE_PAREN))
19529 }
19532 /* The labels are coming next. */
19535 /* Look for labels. */
19538 {
19540 /* Consume the `:' or `::'. */
19542 /* Parse the labels. */
19544 }
19548 }
19552 /* Look for the closing `)'. */
19560 {
19561 /* Create the ASM_EXPR. */
19563 {
19566 /* If the extended syntax was not used, mark the ASM_EXPR. */
19568 {
19574 }
19575 }
19576 else
19578 }
19579 }
19581 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19582 type that comes from the decl-specifier-seq. */
19584 static tree
19586 {
19589 {
19602 }
19605 }
19607 /* Declarators [gram.dcl.decl] */
19609 /* Parse an init-declarator.
19611 init-declarator:
19612 declarator initializer [opt]
19614 GNU Extension:
19616 init-declarator:
19617 declarator asm-specification [opt] attributes [opt] initializer [opt]
19619 function-definition:
19620 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19621 function-body
19622 decl-specifier-seq [opt] declarator function-try-block
19624 GNU Extension:
19626 function-definition:
19627 __extension__ function-definition
19629 TM Extension:
19631 function-definition:
19632 decl-specifier-seq [opt] declarator function-transaction-block
19634 The DECL_SPECIFIERS apply to this declarator. Returns a
19635 representation of the entity declared. If MEMBER_P is TRUE, then
19636 this declarator appears in a class scope. The new DECL created by
19637 this declarator is returned.
19639 The CHECKS are access checks that should be performed once we know
19640 what entity is being declared (and, therefore, what classes have
19641 befriended it).
19643 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19644 for a function-definition here as well. If the declarator is a
19645 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19646 be TRUE upon return. By that point, the function-definition will
19647 have been completely parsed.
19649 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19650 is FALSE.
19652 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19653 parsed declaration if it is an uninitialized single declarator not followed
19654 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19655 if present, will not be consumed. If returned, this declarator will be
19656 created with SD_INITIALIZED but will not call cp_finish_decl.
19658 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19659 and there is an initializer, the pointed location_t is set to the
19660 location of the '=' or `(', or '{' in C++11 token introducing the
19661 initializer. */
19663 static tree
19674 {
19678 tree prefix_attributes;
19680 tree asm_specification;
19681 tree initializer;
19683 tree scope;
19685 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19686 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19687 "(...)". */
19698 /* Gather the attributes that were provided with the
19699 decl-specifiers. */
19702 /* Assume that this is not the declarator for a function
19703 definition. */
19707 /* Default arguments are only permitted for function parameters. */
19711 /* Defer access checks while parsing the declarator; we cannot know
19712 what names are accessible until we know what is being
19713 declared. */
19718 /* Parse the declarator. */
19719 declarator
19724 /* Gather up the deferred checks. */
19729 /* If the DECLARATOR was erroneous, there's no need to go
19730 further. */
19734 /* Check that the number of template-parameter-lists is OK. */
19744 /* Figure out what scope the entity declared by the DECLARATOR is
19745 located in. `grokdeclarator' sometimes changes the scope, so
19746 we compute it now. */
19749 /* Perform any lookups in the declared type which were thought to be
19750 dependent, but are not in the scope of the declarator. */
19751 decl_specifiers->type
19754 /* If we're allowing GNU extensions, look for an
19755 asm-specification. */
19757 {
19758 /* Look for an asm-specification. */
19761 }
19762 else
19765 /* Look for attributes. */
19769 /* Peek at the next token. */
19775 {
19776 /* Handle C++17 deduction guides. */
19780 {
19788 {
19792 }
19793 }
19795 /* Check to see if the token indicates the start of a
19796 function-definition. */
19798 {
19800 {
19801 /* If a function-definition should not appear here, issue an
19802 error message. */
19806 }
19808 location_t func_brace_location
19811 /* Neither attributes nor an asm-specification are allowed
19812 on a function-definition. */
19815 "an asm-specification is not allowed "
19819 "attributes are not allowed "
19821 /* This is a function-definition. */
19824 /* Parse the function definition. */
19827 decl_specifiers,
19828 declarator,
19829 prefix_attributes);
19830 else
19831 decl =
19832 (cp_parser_function_definition_from_specifiers_and_declarator
19836 {
19837 /* This is where the prologue starts... */
19840 }
19843 }
19844 }
19846 {
19847 /* A non-template declaration involving a function parameter list
19848 containing an implicit template parameter will be made into a
19849 template. If the resulting declaration is not going to be an
19850 actual function then finish the template scope here to prevent it.
19851 An error message will be issued once we have a decl to talk about.
19853 FIXME probably we should do type deduction rather than create an
19854 implicit template, but the standard currently doesn't allow it. */
19857 }
19859 /* [dcl.dcl]
19861 Only in function declarations for constructors, destructors, type
19862 conversions, and deduction guides can the decl-specifier-seq be omitted.
19864 We explicitly postpone this check past the point where we handle
19865 function-definitions because we tolerate function-definitions
19866 that are missing their return types in some modes. */
19868 {
19872 }
19874 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19878 {
19889 {
19895 }
19896 }
19897 else
19898 {
19899 /* If the init-declarator isn't initialized and isn't followed by a
19900 `,' or `;', it's not a valid init-declarator. */
19903 {
19906 else
19907 {
19911 }
19912 }
19915 }
19917 /* Because start_decl has side-effects, we should only call it if we
19918 know we're going ahead. By this point, we know that we cannot
19919 possibly be looking at any other construct. */
19922 /* Enter the newly declared entry in the symbol table. If we're
19923 processing a declaration in a class-specifier, we wait until
19924 after processing the initializer. */
19926 {
19934 /* Adjust location of decl if declarator->id_loc is more appropriate:
19935 set, and decl wasn't merged with another decl, in which case its
19936 location would be different from input_location, and more accurate. */
19941 }
19943 /* Enter the SCOPE. That way unqualified names appearing in the
19944 initializer will be looked up in SCOPE. */
19947 /* Perform deferred access control checks, now that we know in which
19948 SCOPE the declared entity resides. */
19950 {
19953 /* If the entity being declared is a function, pretend that we
19954 are in its scope. If it is a `friend', it may have access to
19955 things that would not otherwise be accessible. */
19957 {
19960 }
19962 /* Perform access checks for template parameters. */
19965 /* Perform the access control checks for the declarator and the
19966 decl-specifiers. */
19969 /* Restore the saved value. */
19972 }
19974 /* Parse the initializer. */
19979 {
19981 {
19984 else
19985 {
19986 /* If the declaration was erroneous, we don't really
19987 know what the user intended, so just silently
19988 consume the initializer. */
19995 }
19996 }
19997 else
19998 {
19999 /* We want to record the extra mangling scope for in-class
20000 initializers of class members and initializers of static data
20001 member templates. The former involves deferring
20002 parsing of the initializer until end of class as with default
20003 arguments. So right here we only handle the latter. */
20013 }
20014 }
20016 /* The old parser allows attributes to appear after a parenthesized
20017 initializer. Mark Mitchell proposed removing this functionality
20018 on the GCC mailing lists on 2002-08-13. This parser accepts the
20019 attributes -- but ignores them. Made a permerror in GCC 8. */
20025 {
20028 {
20032 }
20033 }
20035 /* And now complain about a non-function implicit template. */
20040 /* For an in-class declaration, use `grokfield' to create the
20041 declaration. */
20043 {
20045 {
20048 }
20057 }
20059 /* Finish processing the declaration. But, skip member
20060 declarations. */
20062 {
20065 asm_specification,
20066 /* If the initializer is in parentheses, then this is
20067 a direct-initialization, which means that an
20068 `explicit' constructor is OK. Otherwise, an
20069 `explicit' constructor cannot be used. */
20072 }
20075 /* Core issue #226 (C++0x only): A default template-argument
20076 shall not be specified in a friend class template
20077 declaration. */
20086 {
20089 else
20091 }
20098 }
20100 /* Parse a declarator.
20102 declarator:
20103 direct-declarator
20104 ptr-operator declarator
20106 abstract-declarator:
20107 ptr-operator abstract-declarator [opt]
20108 direct-abstract-declarator
20110 GNU Extensions:
20112 declarator:
20113 attributes [opt] direct-declarator
20114 attributes [opt] ptr-operator declarator
20116 abstract-declarator:
20117 attributes [opt] ptr-operator abstract-declarator [opt]
20118 attributes [opt] direct-abstract-declarator
20120 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
20121 detect constructors, destructors, deduction guides, or conversion operators.
20122 It is set to -1 if the declarator is a name, and +1 if it is a
20123 function. Otherwise it is set to zero. Usually you just want to
20124 test for >0, but internally the negative value is used.
20126 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
20127 a decl-specifier-seq unless it declares a constructor, destructor,
20128 or conversion. It might seem that we could check this condition in
20129 semantic analysis, rather than parsing, but that makes it difficult
20130 to handle something like `f()'. We want to notice that there are
20131 no decl-specifiers, and therefore realize that this is an
20132 expression, not a declaration.)
20134 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
20135 the declarator is a direct-declarator of the form "(...)".
20137 MEMBER_P is true iff this declarator is a member-declarator.
20139 FRIEND_P is true iff this declarator is a friend. */
20143 cp_parser_declarator_kind dcl_kind,
20147 {
20150 cp_cv_quals cv_quals;
20151 tree class_type;
20154 /* Assume this is not a constructor, destructor, or type-conversion
20155 operator. */
20162 /* Check for the ptr-operator production. */
20164 /* Parse the ptr-operator. */
20170 /* If that worked, then we have a ptr-operator. */
20172 {
20173 /* If a ptr-operator was found, then this declarator was not
20174 parenthesized. */
20177 /* The dependent declarator is optional if we are parsing an
20178 abstract-declarator. */
20182 /* Parse the dependent declarator. */
20187 friend_p);
20189 /* If we are parsing an abstract-declarator, we must handle the
20190 case where the dependent declarator is absent. */
20195 declarator = cp_parser_make_indirect_declarator
20197 }
20198 /* Everything else is a direct-declarator. */
20199 else
20200 {
20203 CPP_OPEN_PAREN);
20205 ctor_dtor_or_conv_p,
20207 }
20212 }
20214 /* Parse a direct-declarator or direct-abstract-declarator.
20216 direct-declarator:
20217 declarator-id
20218 direct-declarator ( parameter-declaration-clause )
20219 cv-qualifier-seq [opt]
20220 ref-qualifier [opt]
20221 exception-specification [opt]
20222 direct-declarator [ constant-expression [opt] ]
20223 ( declarator )
20225 direct-abstract-declarator:
20226 direct-abstract-declarator [opt]
20227 ( parameter-declaration-clause )
20228 cv-qualifier-seq [opt]
20229 ref-qualifier [opt]
20230 exception-specification [opt]
20231 direct-abstract-declarator [opt] [ constant-expression [opt] ]
20232 ( abstract-declarator )
20234 Returns a representation of the declarator. DCL_KIND is
20235 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
20236 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
20237 we are parsing a direct-declarator. It is
20238 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
20239 of ambiguity we prefer an abstract declarator, as per
20240 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
20241 as for cp_parser_declarator. */
20245 cp_parser_declarator_kind dcl_kind,
20248 {
20259 {
20260 /* Peek at the next token. */
20263 {
20264 /* This is either a parameter-declaration-clause, or a
20265 parenthesized declarator. When we know we are parsing a
20266 named declarator, it must be a parenthesized declarator
20267 if FIRST is true. For instance, `(int)' is a
20268 parameter-declaration-clause, with an omitted
20269 direct-abstract-declarator. But `((*))', is a
20270 parenthesized abstract declarator. Finally, when T is a
20271 template parameter `(T)' is a
20272 parameter-declaration-clause, and not a parenthesized
20273 named declarator.
20275 We first try and parse a parameter-declaration-clause,
20276 and then try a nested declarator (if FIRST is true).
20278 It is not an error for it not to be a
20279 parameter-declaration-clause, even when FIRST is
20280 false. Consider,
20282 int i (int);
20283 int i (3);
20285 The first is the declaration of a function while the
20286 second is the definition of a variable, including its
20287 initializer.
20289 Having seen only the parenthesis, we cannot know which of
20290 these two alternatives should be selected. Even more
20291 complex are examples like:
20293 int i (int (a));
20294 int i (int (3));
20296 The former is a function-declaration; the latter is a
20297 variable initialization.
20299 Thus again, we try a parameter-declaration-clause, and if
20300 that fails, we back out and return. */
20303 {
20304 tree params;
20309 /* In a member-declarator, the only valid interpretation
20310 of a parenthesis is the start of a
20311 parameter-declaration-clause. (It is invalid to
20312 initialize a static data member with a parenthesized
20313 initializer; only the "=" form of initialization is
20314 permitted.) */
20318 /* Consume the `('. */
20319 matching_parens parens;
20322 {
20323 /* If this is going to be an abstract declarator, we're
20324 in a declarator and we can't have default args. */
20327 }
20331 /* Parse the parameter-declaration-clause. */
20334 /* Consume the `)'. */
20337 /* If all went well, parse the cv-qualifier-seq,
20338 ref-qualifier and the exception-specification. */
20340 {
20341 cp_cv_quals cv_quals;
20342 cp_virt_specifiers virt_specifiers;
20343 cp_ref_qualifier ref_qual;
20344 tree exception_specification;
20345 tree late_return;
20346 tree attrs;
20356 /* Parse the cv-qualifier-seq. */
20358 /* Parse the ref-qualifier. */
20360 /* Parse the tx-qualifier. */
20362 /* And the exception-specification. */
20363 exception_specification
20368 /* In here, we handle cases where attribute is used after
20369 the function declaration. For example:
20370 void func (int x) __attribute__((vector(..))); */
20373 late_return = (cp_parser_late_return_type_opt
20377 /* Parse the virt-specifier-seq. */
20380 /* Create the function-declarator. */
20382 params,
20383 cv_quals,
20384 virt_specifiers,
20385 ref_qual,
20386 tx_qual,
20387 exception_specification,
20388 late_return,
20389 requires_clause);
20392 /* Any subsequent parameter lists are to do with
20393 return type, so are not those of the declared
20394 function. */
20396 }
20398 /* Remove the function parms from scope. */
20402 /* Repeat the main loop. */
20404 }
20406 /* If this is the first, we can try a parenthesized
20407 declarator. */
20409 {
20416 /* Consume the `('. */
20417 matching_parens parens;
20419 /* Parse the nested declarator. */
20422 declarator
20428 /* Expect a `)'. */
20436 }
20437 /* Otherwise, we must be done. */
20438 else
20440 }
20444 {
20445 /* Parse an array-declarator. */
20455 /* Consume the `['. */
20457 /* Peek at the next token. */
20459 /* If the next token is `]', then there is no
20460 constant-expression. */
20462 {
20464 bounds
20474 {
20475 /* Normally, the array bound must be an integral constant
20476 expression. However, as an extension, we allow VLAs
20477 in function scopes as long as they aren't part of a
20478 parameter declaration. */
20482 }
20485 {
20486 /* Remember this wasn't a constant-expression. */
20489 }
20490 }
20491 else
20493 /* Look for the closing `]'. */
20495 {
20498 }
20503 }
20505 {
20506 {
20507 tree qualifying_scope;
20508 tree unqualified_name;
20509 tree attrs;
20510 special_function_kind sfk;
20515 /* Parse a declarator-id */
20518 {
20521 /* If we see an ellipsis, we should be looking at a
20522 parameter pack. */
20524 {
20525 /* Consume the `...' */
20529 }
20530 }
20533 unqualified_name
20537 {
20541 {
20542 /* Check whether an error occurred. */
20545 /* We already consumed the ellipsis to mark a
20546 parameter pack, but we have no way to report it,
20547 so abort the tentative parse. We will be exiting
20548 immediately anyway. */
20550 }
20551 else
20557 && (qualifying_scope
20559 {
20562 }
20563 }
20568 {
20573 }
20579 {
20580 /* In the declaration of a member of a template class
20581 outside of the class itself, the SCOPE will sometimes
20582 be a TYPENAME_TYPE. For example, given:
20584 template <typename T>
20585 int S<T>::R::i = 3;
20587 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20588 this context, we must resolve S<T>::R to an ordinary
20589 type, rather than a typename type.
20591 The reason we normally avoid resolving TYPENAME_TYPEs
20592 is that a specialization of `S' might render
20593 `S<T>::R' not a type. However, if `S' is
20594 specialized, then this `i' will not be used, so there
20595 is no harm in resolving the types here. */
20596 tree type;
20598 /* Resolve the TYPENAME_TYPE. */
20601 /* If that failed, the declarator is invalid. */
20603 {
20606 "cannot define member of dependent typedef "
20608 else
20613 }
20615 }
20620 {
20621 tree class_type;
20626 else
20630 {
20634 {
20635 /* We do not attempt to print the declarator
20636 here because we do not have enough
20637 information about its original syntactic
20638 form. */
20642 }
20645 {
20649 "use %<%T::%D%> instead of %<%T::%D%> to "
20651 class_type,
20656 }
20658 }
20661 {
20668 for an unnamed type, even if the type
20669 got a name for linkage purposes. */
20671 /* Handle correctly (c++/19200):
20673 struct S {
20674 struct T{};
20675 friend void S(T);
20676 };
20678 and also:
20680 namespace N {
20681 void S();
20682 }
20684 struct S {
20685 friend void N::S();
20686 }; */
20689 class_type))
20698 }
20699 }
20701 unqualified_name,
20702 sfk);
20709 }
20711 handle_declarator:;
20714 {
20715 /* Any names that appear after the declarator-id for a
20716 member are looked up in the containing scope. */
20718 {
20719 /* But declarations with qualified-ids can't appear in a
20720 function. */
20724 }
20726 }
20730 /* Default args are only allowed on function
20731 declarations. */
20733 else
20737 }
20738 /* We're done. */
20739 else
20741 }
20743 /* For an abstract declarator, we might wind up with nothing at this
20744 point. That's an error; the declarator is not optional. */
20748 {
20749 /* Record overly parenthesized declarator so we can give a
20750 diagnostic about confusing decl/expr disambiguation. */
20752 {
20753 /* If the open and close parens are on different lines, this
20754 is probably a formatting thing, so ignore. */
20759 }
20762 }
20764 /* If we entered a scope, we must exit it now. */
20772 }
20774 /* Parse a ptr-operator.
20776 ptr-operator:
20777 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20778 * cv-qualifier-seq [opt]
20779 &
20780 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20781 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20783 GNU Extension:
20785 ptr-operator:
20786 & cv-qualifier-seq [opt]
20788 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20789 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20790 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20791 filled in with the TYPE containing the member. *CV_QUALS is
20792 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20793 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20794 Note that the tree codes returned by this function have nothing
20795 to do with the types of trees that will be eventually be created
20796 to represent the pointer or reference type being parsed. They are
20797 just constants with suggestive names. */
20798 static enum tree_code
20803 {
20808 /* Assume that it's not a pointer-to-member. */
20810 /* And that there are no cv-qualifiers. */
20813 /* Peek at the next token. */
20816 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20826 {
20827 /* Consume the `*', `&' or `&&'. */
20830 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20831 `&', if we are allowing GNU extensions. (The only qualifier
20832 that can legally appear after `&' is `restrict', but that is
20833 enforced during semantic analysis. */
20841 }
20842 else
20843 {
20844 /* Try the pointer-to-member case. */
20846 /* Look for the optional `::' operator. */
20849 /* Look for the nested-name specifier. */
20856 /* If we found it, and the next token is a `*', then we are
20857 indeed looking at a pointer-to-member operator. */
20860 {
20861 /* Indicate that the `*' operator was used. */
20869 else
20870 {
20871 /* The type of which the member is a member is given by the
20872 current SCOPE. */
20874 /* The next name will not be qualified. */
20878 /* Look for optional c++11 attributes. */
20882 /* Look for the optional cv-qualifier-seq. */
20884 }
20885 }
20886 /* If that didn't work we don't have a ptr-operator. */
20889 }
20892 }
20894 /* Parse an (optional) cv-qualifier-seq.
20896 cv-qualifier-seq:
20897 cv-qualifier cv-qualifier-seq [opt]
20899 cv-qualifier:
20900 const
20901 volatile
20903 GNU Extension:
20905 cv-qualifier:
20906 __restrict__
20908 Returns a bitmask representing the cv-qualifiers. */
20910 static cp_cv_quals
20912 {
20916 {
20918 cp_cv_quals cv_qualifier;
20920 /* Peek at the next token. */
20922 /* See if it's a cv-qualifier. */
20924 {
20940 }
20946 {
20951 }
20952 else
20953 {
20956 }
20957 }
20960 }
20962 /* Parse an (optional) ref-qualifier
20964 ref-qualifier:
20965 &
20966 &&
20968 Returns cp_ref_qualifier representing ref-qualifier. */
20970 static cp_ref_qualifier
20972 {
20975 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20980 {
20985 {
20997 }
21002 {
21005 }
21006 else
21007 {
21010 }
21011 }
21014 }
21016 /* Parse an optional tx-qualifier.
21018 tx-qualifier:
21019 transaction_safe
21020 transaction_safe_dynamic */
21022 static tree
21024 {
21027 {
21032 {
21036 {
21039 {
21042 }
21043 else
21045 }
21046 }
21047 }
21049 }
21051 /* Parse an (optional) virt-specifier-seq.
21053 virt-specifier-seq:
21054 virt-specifier virt-specifier-seq [opt]
21056 virt-specifier:
21057 override
21058 final
21060 Returns a bitmask representing the virt-specifiers. */
21062 static cp_virt_specifiers
21064 {
21068 {
21070 cp_virt_specifiers virt_specifier;
21072 /* Peek at the next token. */
21074 /* See if it's a virt-specifier-qualifier. */
21078 {
21081 }
21083 {
21086 }
21088 {
21090 }
21091 else
21095 {
21100 }
21101 else
21102 {
21105 }
21106 }
21108 }
21110 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
21111 is in scope even though it isn't real. */
21113 void
21115 {
21116 tree this_parm;
21119 {
21120 /* We don't clear this between NSDMIs. Is it already what we want? */
21127 }
21130 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
21132 current_class_ref
21135 }
21137 /* Return true iff our current scope is a non-static data member
21138 initializer. */
21140 bool
21142 {
21143 /* We recognize NSDMI context by the context-less 'this' pointer set up
21144 by the function above. */
21150 }
21152 /* Parse a late-specified return type, if any. This is not a separate
21153 non-terminal, but part of a function declarator, which looks like
21155 -> trailing-type-specifier-seq abstract-declarator(opt)
21157 Returns the type indicated by the type-id.
21159 In addition to this, parse any queued up #pragma omp declare simd
21160 clauses, and #pragma acc routine clauses.
21162 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
21163 function. */
21165 static tree
21168 {
21172 && declarator
21176 && declarator
21179 /* Peek at the next token. */
21181 /* A late-specified return type is indicated by an initial '->'. */
21192 {
21193 /* DR 1207: 'this' is in scope in the trailing return type. */
21195 }
21198 {
21199 /* Consume the ->. */
21203 }
21205 /* Function declarations may be followed by a trailing
21206 requires-clause. */
21210 declarator->attributes
21214 declarator->attributes
21219 {
21222 }
21225 }
21227 /* Parse a declarator-id.
21229 declarator-id:
21230 id-expression
21231 :: [opt] nested-name-specifier [opt] type-name
21233 In the `id-expression' case, the value returned is as for
21234 cp_parser_id_expression if the id-expression was an unqualified-id.
21235 If the id-expression was a qualified-id, then a SCOPE_REF is
21236 returned. The first operand is the scope (either a NAMESPACE_DECL
21237 or TREE_TYPE), but the second is still just a representation of an
21238 unqualified-id. */
21240 static tree
21242 {
21243 tree id;
21244 /* The expression must be an id-expression. Assume that qualified
21245 names are the names of types so that:
21247 template <class T>
21248 int S<T>::R::i = 3;
21250 will work; we must treat `S<T>::R' as the name of a type.
21251 Similarly, assume that qualified names are templates, where
21252 required, so that:
21254 template <class T>
21255 int S<T>::R<T>::i = 3;
21257 will work, too. */
21263 optional_p);
21267 }
21269 /* Parse a type-id.
21271 type-id:
21272 type-specifier-seq abstract-declarator [opt]
21274 Returns the TYPE specified. */
21276 static tree
21279 {
21280 cp_decl_specifier_seq type_specifier_seq;
21283 /* Parse the type-specifier-seq. */
21285 is_trailing_return,
21293 /* A bare template name as a template argument is a template template
21294 argument, not a placeholder, so fail parsing it as a type argument. */
21295 {
21299 }
21303 /* There might or might not be an abstract declarator. */
21305 /* Look for the declarator. */
21306 abstract_declarator
21311 /* Check to see if there really was a declarator. */
21316 /* The concepts TS allows 'auto' as a type-id. */
21318 /* None of the valid uses of 'auto' in C++14 involve the type-id
21319 nonterminal, but it is valid in a trailing-return-type. */
21322 {
21323 /* A type-id with type 'auto' is only ok if the abstract declarator
21324 is a function declarator with a late-specified return type.
21326 A type-id with 'auto' is also valid in a trailing-return-type
21327 in a compound-requirement. */
21334 else
21335 {
21338 {
21340 auto_node);
21342 tmpl);
21343 }
21344 else
21347 }
21348 }
21351 is_template_arg);
21352 }
21354 static tree
21356 {
21358 }
21360 static tree
21362 {
21363 tree r;
21365 parser->type_definition_forbidden_message
21370 {
21373 }
21375 }
21377 static tree
21379 {
21381 }
21383 /* Parse a type-specifier-seq.
21385 type-specifier-seq:
21386 type-specifier type-specifier-seq [opt]
21388 GNU extension:
21390 type-specifier-seq:
21391 attributes type-specifier-seq [opt]
21393 If IS_DECLARATION is true, we are at the start of a "condition" or
21394 exception-declaration, so we might be followed by a declarator-id.
21396 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21397 i.e. we've just seen "->".
21399 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21401 static void
21406 {
21411 /* Clear the TYPE_SPECIFIER_SEQ. */
21414 /* In the context of a trailing return type, enum E { } is an
21415 elaborated-type-specifier followed by a function-body, not an
21416 enum-specifier. */
21420 /* Parse the type-specifiers and attributes. */
21422 {
21423 tree type_specifier;
21426 /* Check for attributes first. */
21428 {
21429 type_specifier_seq->attributes
21433 }
21435 /* record the token of the beginning of the type specifier seq,
21436 for error reporting purposes*/
21440 /* Look for the type-specifier. */
21442 flags,
21443 type_specifier_seq,
21445 NULL,
21448 {
21449 /* If the first type-specifier could not be found, this is not a
21450 type-specifier-seq at all. */
21452 {
21453 /* Set in_declarator_p to avoid skipping to the semicolon. */
21465 }
21466 /* If subsequent type-specifiers could not be found, the
21467 type-specifier-seq is complete. */
21469 }
21472 /* The standard says that a condition can be:
21474 type-specifier-seq declarator = assignment-expression
21476 However, given:
21478 struct S {};
21479 if (int S = ...)
21481 we should treat the "S" as a declarator, not as a
21482 type-specifier. The standard doesn't say that explicitly for
21483 type-specifier-seq, but it does say that for
21484 decl-specifier-seq in an ordinary declaration. Perhaps it
21485 would be clearer just to allow a decl-specifier-seq here, and
21486 then add a semantic restriction that if any decl-specifiers
21487 that are not type-specifiers appear, the program is invalid. */
21490 }
21491 }
21493 /* Return whether the function currently being declared has an associated
21494 template parameter list. */
21496 static bool
21498 {
21511 }
21513 /* Parse a parameter-declaration-clause.
21515 parameter-declaration-clause:
21516 parameter-declaration-list [opt] ... [opt]
21517 parameter-declaration-list , ...
21519 Returns a representation for the parameter declarations. A return
21520 value of NULL indicates a parameter-declaration-clause consisting
21521 only of an ellipsis. */
21523 static tree
21525 {
21526 tree parameters;
21534 && !processing_template_parmlist
21535 && !processing_explicit_instantiation
21536 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21537 actual function or a random abstract declarator. */
21543 /* Peek at the next token. */
21545 /* Check for trivial parameter-declaration-clauses. */
21547 {
21548 /* Consume the `...' token. */
21551 }
21553 /* There are no parameters. */
21555 /* Check for `(void)', too, which is a special case. */
21559 {
21560 /* Consume the `void' token. */
21562 /* There are no parameters. */
21564 }
21566 /* Parse the parameter-declaration-list. */
21568 /* If a parse error occurred while parsing the
21569 parameter-declaration-list, then the entire
21570 parameter-declaration-clause is erroneous. */
21574 /* Peek at the next token. */
21576 /* If it's a `,', the clause should terminate with an ellipsis. */
21578 {
21579 /* Consume the `,'. */
21581 /* Expect an ellipsis. */
21582 ellipsis_p
21584 }
21585 /* It might also be `...' if the optional trailing `,' was
21586 omitted. */
21588 {
21589 /* Consume the `...' token. */
21591 /* And remember that we saw it. */
21593 }
21594 else
21597 /* Finish the parameter list. */
21602 }
21604 /* Parse a parameter-declaration-list.
21606 parameter-declaration-list:
21607 parameter-declaration
21608 parameter-declaration-list , parameter-declaration
21610 Returns a representation of the parameter-declaration-list, as for
21611 cp_parser_parameter_declaration_clause. However, the
21612 `void_list_node' is never appended to the list. */
21614 static tree
21616 {
21622 /* The special considerations that apply to a function within an
21623 unbraced linkage specifications do not apply to the parameters
21624 to the function. */
21625 saved_in_unbraced_linkage_specification_p
21629 /* Look for more parameters. */
21631 {
21636 /* Parse the parameter. */
21637 parameter
21642 /* We don't know yet if the enclosing context is deprecated, so wait
21643 and warn in grokparms if appropriate. */
21647 {
21650 PARM,
21655 }
21659 /* If a parse error occurred parsing the parameter declaration,
21660 then the entire parameter-declaration-list is erroneous. */
21662 {
21665 }
21675 {
21679 }
21681 /* Add the new parameter to the list. */
21685 /* Peek at the next token. */
21688 /* These are for Objective-C++ */
21691 /* The parameter-declaration-list is complete. */
21694 {
21697 /* Peek at the next token. */
21699 /* If it's an ellipsis, then the list is complete. */
21702 /* Otherwise, there must be more parameters. Consume the
21703 `,'. */
21705 /* When parsing something like:
21707 int i(float f, double d)
21709 we can tell after seeing the declaration for "f" that we
21710 are not looking at an initialization of a variable "i",
21711 but rather at the declaration of a function "i".
21713 Due to the fact that the parsing of template arguments
21714 (as specified to a template-id) requires backtracking we
21715 cannot use this technique when inside a template argument
21716 list. */
21720 /* However, a parameter-declaration of the form
21721 "float(f)" (which is a valid declaration of a
21722 parameter "f") can also be interpreted as an
21723 expression (the conversion of "f" to "float"). */
21726 }
21727 else
21728 {
21736 }
21737 }
21739 parser->in_unbraced_linkage_specification_p
21742 /* Reset implicit_template_scope if we are about to leave the function
21743 parameter list that introduced it. Note that for out-of-line member
21744 definitions, there will be one or more class scopes before we get to
21745 the template parameter scope. */
21749 {
21753 {
21756 }
21757 }
21760 }
21762 /* Parse a parameter declaration.
21764 parameter-declaration:
21765 decl-specifier-seq ... [opt] declarator
21766 decl-specifier-seq declarator = assignment-expression
21767 decl-specifier-seq ... [opt] abstract-declarator [opt]
21768 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21770 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21771 declares a template parameter. (In that case, a non-nested `>'
21772 token encountered during the parsing of the assignment-expression
21773 is not interpreted as a greater-than operator.)
21775 Returns a representation of the parameter, or NULL if an error
21776 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21777 true iff the declarator is of the form "(p)". */
21783 {
21785 cp_decl_specifier_seq decl_specifiers;
21787 tree default_argument;
21792 /* In a template parameter, `>' is not an operator.
21794 [temp.param]
21796 When parsing a default template-argument for a non-type
21797 template-parameter, the first non-nested `>' is taken as the end
21798 of the template parameter-list rather than a greater-than
21799 operator. */
21801 /* Type definitions may not appear in parameter types. */
21803 parser->type_definition_forbidden_message
21810 /* Parse the declaration-specifiers. */
21813 CP_PARSER_FLAGS_NONE,
21817 /* Complain about missing 'typename' or other invalid type names. */
21822 /* If an error occurred, there's no reason to attempt to parse the
21823 rest of the declaration. */
21825 {
21828 }
21830 /* Peek at the next token. */
21833 /* If the next token is a `)', `,', `=', `>', or `...', then there
21834 is no declarator. However, when variadic templates are enabled,
21835 there may be a declarator following `...'. */
21840 {
21844 }
21845 /* Otherwise, there should be a declarator. */
21846 else
21847 {
21851 /* After seeing a decl-specifier-seq, if the next token is not a
21852 "(", there is no possibility that the code is a valid
21853 expression. Therefore, if parsing tentatively, we commit at
21854 this point. */
21856 /* In an expression context, having seen:
21858 (int((char ...
21860 we cannot be sure whether we are looking at a
21861 function-type (taking a "char" as a parameter) or a cast
21862 of some object of type "char" to "int". */
21868 /* Parse the declarator. */
21871 CP_PARSER_DECLARATOR_EITHER,
21873 parenthesized_p,
21877 /* After the declarator, allow more attributes. */
21878 decl_specifiers.attributes
21882 /* If the declarator is a template parameter pack, remember that and
21883 clear the flag in the declarator itself so we don't get errors
21884 from grokdeclarator. */
21886 {
21889 }
21890 }
21892 /* If the next token is an ellipsis, and we have not seen a declarator
21893 name, and if either the type of the declarator contains parameter
21894 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21895 for, eg, abbreviated integral type names), then we actually have a
21896 parameter pack expansion expression. Otherwise, leave the ellipsis
21897 for a C-style variadic function. */
21900 /* If a function parameter pack was specified and an implicit template
21901 parameter was introduced during cp_parser_parameter_declaration,
21902 change any implicit parameters introduced into packs. */
21907 {
21915 }
21918 {
21929 {
21930 /* Consume the `...'. */
21934 /* Build a pack expansion type */
21939 else
21941 }
21942 }
21944 /* The restriction on defining new types applies only to the type
21945 of the parameter, not to the default argument. */
21948 /* If the next token is `=', then process a default argument. */
21950 {
21953 /* If we are defining a class, then the tokens that make up the
21954 default argument must be saved and processed later. */
21960 // A constrained-type-specifier may declare a type template-parameter.
21962 default_argument
21965 // A constrained-type-specifier may declare a template-template-parameter.
21967 default_argument
21970 /* Outside of a class definition, we can just parse the
21971 assignment-expression. */
21972 else
21973 default_argument
21977 {
21979 "default arguments are only "
21981 }
21983 || template_parameter_pack_p
21986 {
21987 /* Find the name of the parameter pack. */
21994 template_parm_p
22000 else
22002 template_parm_p
22009 }
22010 }
22011 else
22014 /* Generate a location for the parameter, ranging from the start of the
22015 initial token to the end of the final token (using input_location for
22016 the latter, set up by cp_lexer_set_source_position_from_token when
22017 consuming tokens).
22019 If we have a identifier, then use it for the caret location, e.g.
22021 extern int callee (int one, int (*two)(int, int), float three);
22022 ~~~~~~^~~~~~~~~~~~~~
22024 otherwise, reuse the start location for the caret location e.g.:
22026 extern int callee (int one, int (*)(int, int), float three);
22027 ^~~~~~~~~~~~~~~~~
22029 */
22035 input_location);
22038 declarator,
22039 default_argument,
22040 param_loc,
22041 template_parameter_pack_p);
22042 }
22044 /* Parse a default argument and return it.
22046 TEMPLATE_PARM_P is true if this is a default argument for a
22047 non-type template parameter. */
22048 static tree
22050 {
22056 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
22057 set correctly. */
22060 /* Local variable names (and the `this' keyword) may not
22061 appear in a default argument. */
22064 /* Parse the assignment-expression. */
22069 /* The "this" pointer is not valid in a default argument. */
22071 {
22076 }
22077 default_argument
22079 /* Restore the "this" pointer. */
22081 {
22084 }
22093 }
22095 /* Parse a function-body.
22097 function-body:
22098 compound_statement */
22100 static void
22102 {
22106 }
22108 /* Parse a ctor-initializer-opt followed by a function-body. Return
22109 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
22110 is true we are parsing a function-try-block. */
22112 static void
22115 {
22122 /* Begin the function body. */
22124 /* Parse the optional ctor-initializer. */
22127 /* If we're parsing a constexpr constructor definition, we need
22128 to check that the constructor body is indeed empty. However,
22129 before we get to cp_parser_function_body lot of junk has been
22130 generated, so we can't just check that we have an empty block.
22131 Rather we take a snapshot of the outermost block, and check whether
22132 cp_parser_function_body changed its state. */
22134 {
22138 }
22139 /* Parse the function-body. */
22143 /* Finish the function body. */
22145 }
22147 /* Parse an initializer.
22149 initializer:
22150 = initializer-clause
22151 ( expression-list )
22153 Returns an expression representing the initializer. If no
22154 initializer is present, NULL_TREE is returned.
22156 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
22157 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
22158 set to TRUE if there is no initializer present. If there is an
22159 initializer, and it is not a constant-expression, *NON_CONSTANT_P
22160 is set to true; otherwise it is set to false. */
22162 static tree
22165 {
22167 tree init;
22169 /* Peek at the next token. */
22172 /* Let our caller know whether or not this initializer was
22173 parenthesized. */
22175 /* Assume that the initializer is constant. */
22179 {
22180 /* Consume the `='. */
22182 /* Parse the initializer-clause. */
22184 }
22186 {
22191 non_constant_p);
22196 }
22198 {
22203 }
22204 else
22205 {
22206 /* Anything else is an error. */
22209 }
22215 }
22217 /* Parse an initializer-clause.
22219 initializer-clause:
22220 assignment-expression
22221 braced-init-list
22223 Returns an expression representing the initializer.
22225 If the `assignment-expression' production is used the value
22226 returned is simply a representation for the expression.
22228 Otherwise, calls cp_parser_braced_list. */
22230 static cp_expr
22232 {
22233 cp_expr initializer;
22235 /* Assume the expression is constant. */
22238 /* If it is not a `{', then we are looking at an
22239 assignment-expression. */
22241 {
22242 initializer
22245 non_constant_p);
22246 }
22247 else
22251 }
22253 /* Parse a brace-enclosed initializer list.
22255 braced-init-list:
22256 { initializer-list , [opt] }
22257 { designated-initializer-list , [opt] }
22258 { }
22260 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
22261 the elements of the initializer-list (or NULL, if the last
22262 production is used). The TREE_TYPE for the CONSTRUCTOR will be
22263 NULL_TREE. There is no way to detect whether or not the optional
22264 trailing `,' was provided. NON_CONSTANT_P is as for
22265 cp_parser_initializer. */
22267 static cp_expr
22269 {
22270 tree initializer;
22273 /* Consume the `{' token. */
22274 matching_braces braces;
22276 /* Create a CONSTRUCTOR to represent the braced-initializer. */
22278 /* If it's not a `}', then there is a non-trivial initializer. */
22280 {
22281 /* Parse the initializer list. */
22284 /* A trailing `,' token is allowed. */
22287 }
22288 else
22290 /* Now, there should be a trailing `}'. */
22296 /* Build a location of the form:
22297 { ... }
22298 ^~~~~~~
22299 with caret==start at the open brace, finish at the close brace. */
22303 }
22305 /* Consume tokens up to, and including, the next non-nested closing `]'.
22306 Returns true iff we found a closing `]'. */
22308 static bool
22310 {
22314 {
22318 {
22321 /* If we've run out of tokens, then there is no closing `]'. */
22330 {
22333 }
22338 }
22340 /* Consume the token. */
22342 }
22343 }
22345 /* Return true if we are looking at an array-designator, false otherwise. */
22347 static bool
22349 {
22350 /* Consume the `['. */
22355 /* Skip tokens until the next token is a closing square bracket.
22356 If we find the closing `]', and the next token is a `=', then
22357 we are looking at an array designator. */
22358 bool array_designator_p
22362 /* Roll back the tokens we skipped. */
22366 }
22368 /* Parse an initializer-list.
22370 initializer-list:
22371 initializer-clause ... [opt]
22372 initializer-list , initializer-clause ... [opt]
22374 C++2A Extension:
22376 designated-initializer-list:
22377 designated-initializer-clause
22378 designated-initializer-list , designated-initializer-clause
22380 designated-initializer-clause:
22381 designator brace-or-equal-initializer
22383 designator:
22384 . identifier
22386 GNU Extension:
22388 initializer-list:
22389 designation initializer-clause ...[opt]
22390 initializer-list , designation initializer-clause ...[opt]
22392 designation:
22393 . identifier =
22394 identifier :
22395 [ constant-expression ] =
22397 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22398 for the initializer. If the INDEX of the elt is non-NULL, it is the
22399 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22400 as for cp_parser_initializer. */
22404 {
22409 /* Assume all of the expressions are constant. */
22412 /* Parse the rest of the list. */
22414 {
22416 tree designator;
22417 tree initializer;
22421 /* Handle the C++2A syntax, '. id ='. */
22429 {
22432 "C++ designated initializers only available with "
22434 /* Consume the `.'. */
22436 /* Consume the identifier. */
22439 /* Consume the `='. */
22441 }
22442 /* Also, if the next token is an identifier and the following one is a
22443 colon, we are looking at the GNU designated-initializer
22444 syntax. */
22449 {
22450 /* Warn the user that they are using an extension. */
22453 /* Consume the identifier. */
22455 /* Consume the `:'. */
22457 }
22458 /* Also handle C99 array designators, '[ const ] ='. */
22462 {
22463 /* In C++11, [ could start a lambda-introducer. */
22469 {
22472 }
22473 else
22474 {
22479 }
22484 && (!require_potential_rvalue_constant_expression
22488 /* Warn the user that they are using an extension. */
22491 }
22492 else
22496 {
22499 }
22503 {
22507 }
22511 /* Parse the initializer. */
22514 /* If any clause is non-constant, so is the entire initializer. */
22518 /* If we have an ellipsis, this is an initializer pack
22519 expansion. */
22521 {
22524 /* Consume the `...'. */
22531 /* Turn the initializer into an initializer expansion. */
22533 }
22535 /* Add it to the vector. */
22538 /* If the next token is not a comma, we have reached the end of
22539 the list. */
22543 /* Peek at the next token. */
22545 /* If the next token is a `}', then we're still done. An
22546 initializer-clause can have a trailing `,' after the
22547 initializer-list and before the closing `}'. */
22551 /* Consume the `,' token. */
22553 }
22555 /* The same identifier shall not appear in multiple designators
22556 of a designated-initializer-list. */
22558 {
22563 {
22565 {
22567 "%<.%s%> designator used multiple times in "
22571 }
22572 else
22574 }
22578 }
22581 }
22583 /* Classes [gram.class] */
22585 /* Parse a class-name.
22587 class-name:
22588 identifier
22589 template-id
22591 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22592 to indicate that names looked up in dependent types should be
22593 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22594 keyword has been used to indicate that the name that appears next
22595 is a template. TAG_TYPE indicates the explicit tag given before
22596 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22597 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22598 is the class being defined in a class-head. If ENUM_OK is TRUE,
22599 enum-names are also accepted.
22601 Returns the TYPE_DECL representing the class. */
22603 static tree
22612 {
22613 tree decl;
22614 tree scope;
22619 /* All class-names start with an identifier. */
22622 {
22625 }
22627 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22628 to a template-id, so we save it here. */
22633 /* Any name names a type if we're following the `typename' keyword
22634 in a qualified name where the enclosing scope is type-dependent. */
22637 /* Handle the common case (an identifier, but not a template-id)
22638 efficiently. */
22641 {
22645 /* Look for the identifier. */
22649 /* If the next token isn't an identifier, we are certainly not
22650 looking at a class-name. */
22653 /* If we know this is a type-name, there's no need to look it
22654 up. */
22657 else
22658 {
22659 tree ambiguous_decls;
22660 /* If we already know that this lookup is ambiguous, then
22661 we've already issued an error message; there's no reason
22662 to check again. */
22664 {
22667 }
22668 /* If the next token is a `::', then the name must be a type
22669 name.
22671 [basic.lookup.qual]
22673 During the lookup for a name preceding the :: scope
22674 resolution operator, object, function, and enumerator
22675 names are ignored. */
22678 /* Look up the name. */
22680 tag_type,
22683 check_dependency_p,
22687 {
22691 }
22692 }
22693 }
22694 else
22695 {
22696 /* Try a template-id. */
22698 check_dependency_p,
22699 tag_type,
22700 is_declaration);
22703 }
22707 /* If this is a typename, create a TYPENAME_TYPE. */
22709 {
22714 }
22718 /* Check to see that it is really the name of a class. */
22722 /* Situations like this:
22724 template <typename T> struct A {
22725 typename T::template X<int>::I i;
22726 };
22728 are problematic. Is `T::template X<int>' a class-name? The
22729 standard does not seem to be definitive, but there is no other
22730 valid interpretation of the following `::'. Therefore, those
22731 names are considered class-names. */
22732 {
22736 }
22741 /* In Objective-C 2.0, a classname followed by '.' starts a
22742 dot-syntax expression, and it's not a type-name. */
22754 }
22756 /* Parse a class-specifier.
22758 class-specifier:
22759 class-head { member-specification [opt] }
22761 Returns the TREE_TYPE representing the class. */
22763 static tree
22765 {
22766 tree type;
22780 /* Parse the class-head. */
22783 /* If the class-head was a semantic disaster, skip the entire body
22784 of the class. */
22786 {
22790 }
22792 /* Look for the `{'. */
22793 matching_braces braces;
22795 {
22798 }
22803 /* Issue an error message if type-definitions are forbidden here. */
22805 /* Remember that we are defining one more class. */
22807 /* Inside the class, surrounding template-parameter-lists do not
22808 apply. */
22809 saved_num_template_parameter_lists
22812 /* We are not in a function body. */
22815 /* Or in a loop. */
22818 /* Or in a switch. */
22821 /* We are not immediately inside an extern "lang" block. */
22822 saved_in_unbraced_linkage_specification_p
22826 // Associate constraints with the type.
22830 /* Start the class. */
22832 {
22835 }
22839 /* If the type is erroneous, skip the entire body of the class. */
22841 else
22842 /* Parse the member-specification. */
22845 /* Look for the trailing `}'. */
22847 /* Look for trailing attributes to apply to this class. */
22855 /* We've finished a type definition. Check for the common syntax
22856 error of forgetting a semicolon after the definition. We need to
22857 be careful, as we can't just check for not-a-semicolon and be done
22858 with it; the user might have typed:
22860 class X { } c = ...;
22861 class X { } *p = ...;
22863 and so forth. Instead, enumerate all the possible tokens that
22864 might follow this production; if we don't see one of them, then
22865 complain and silently insert the semicolon. */
22866 {
22871 /* Don't try to parse c++11 attributes here. As per the
22872 grammar, that should be a task for
22873 cp_parser_decl_specifier_seq. */
22877 {
22888 /* While it's legal for type qualifiers and storage class
22889 specifiers to follow type definitions in the grammar, only
22890 compiler testsuites contain code like that. Assume that if
22891 we see such code, then what we're really seeing is a case
22892 like:
22894 class X { }
22895 const <type> var = ...;
22897 or
22899 class Y { }
22900 static <type> func (...) ...
22902 i.e. the qualifier or specifier applies to the next
22903 declaration. To do so, however, we need to look ahead one
22904 more token to see if *that* token is a type specifier.
22906 This code could be improved to handle:
22908 class Z { }
22909 static const <type> var = ...; */
22912 {
22915 /* Handling user-defined types here would be nice, but very
22916 tricky. */
22917 want_semicolon
22920 }
22924 }
22926 /* If we don't have a type, then something is very wrong and we
22927 shouldn't try to do anything clever. Likewise for not seeing the
22928 closing brace. */
22930 {
22931 /* Locate the closing brace. */
22932 cp_token_position prev
22937 /* We want to suggest insertion of a ';' immediately *after* the
22938 closing brace, so, if we can, offset the location by 1 column. */
22945 /* If we successfully offset the location, suggest the fix-it. */
22958 else
22961 /* Unget one token and smash it to look as though we encountered
22962 a semicolon in the input stream. */
22967 }
22968 }
22970 /* If this class is not itself within the scope of another class,
22971 then we need to parse the bodies of all of the queued function
22972 definitions. Note that the queued functions defined in a class
22973 are not always processed immediately following the
22974 class-specifier for that class. Consider:
22976 struct A {
22977 struct B { void f() { sizeof (A); } };
22978 };
22980 If `f' were processed before the processing of `A' were
22981 completed, there would be no way to compute the size of `A'.
22982 Note that the nesting we are interested in here is lexical --
22983 not the semantic nesting given by TYPE_CONTEXT. In particular,
22984 for:
22986 struct A { struct B; };
22987 struct A::B { void f() { } };
22989 there is no need to delay the parsing of `A::B::f'. */
22991 {
22992 tree decl;
23000 {
23001 /* Skip default arguments, NSDMIs, etc, in order to improve
23002 error recovery (c++/71169, c++/71832). */
23007 }
23009 /* In a first pass, parse default arguments to the functions.
23010 Then, in a second pass, parse the bodies of the functions.
23011 This two-phased approach handles cases like:
23013 struct S {
23014 void f() { g(); }
23015 void g(int i = 3);
23016 };
23018 */
23020 {
23022 /* If there are default arguments that have not yet been processed,
23023 take care of them now. */
23025 {
23030 }
23031 /* Make sure that any template parameters are in scope. */
23033 /* Parse the default argument expressions. */
23035 /* Remove any template parameters from the symbol table. */
23037 }
23039 /* Now parse any NSDMIs. */
23043 {
23045 {
23050 }
23053 }
23060 /* Now do some post-NSDMI bookkeeping. */
23066 /* Now parse the body of the functions. */
23068 {
23069 /* OpenMP UDRs need to be parsed before all other functions. */
23076 }
23077 else
23081 }
23082 else
23085 /* Put back any saved access checks. */
23088 /* Restore saved state. */
23092 parser->num_template_parameter_lists
23094 parser->in_unbraced_linkage_specification_p
23098 }
23100 static tree
23102 {
23103 tree ret;
23108 }
23110 /* Parse a class-head.
23112 class-head:
23113 class-key identifier [opt] base-clause [opt]
23114 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
23115 class-key nested-name-specifier [opt] template-id
23116 base-clause [opt]
23118 class-virt-specifier:
23119 final
23121 GNU Extensions:
23122 class-key attributes identifier [opt] base-clause [opt]
23123 class-key attributes nested-name-specifier identifier base-clause [opt]
23124 class-key attributes nested-name-specifier [opt] template-id
23125 base-clause [opt]
23127 Upon return BASES is initialized to the list of base classes (or
23128 NULL, if there are none) in the same form returned by
23129 cp_parser_base_clause.
23131 Returns the TYPE of the indicated class. Sets
23132 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
23133 involving a nested-name-specifier was used, and FALSE otherwise.
23135 Returns error_mark_node if this is not a class-head.
23137 Returns NULL_TREE if the class-head is syntactically valid, but
23138 semantically invalid in a way that means we should skip the entire
23139 body of the class. */
23141 static tree
23144 {
23145 tree nested_name_specifier;
23149 tree attributes;
23150 tree bases;
23160 /* Assume no nested-name-specifier will be present. */
23162 /* Assume no template parameter lists will be used in defining the
23163 type. */
23167 /* Look for the class-key. */
23174 /* Parse the attributes. */
23177 /* If the next token is `::', that is invalid -- but sometimes
23178 people do try to write:
23180 struct ::S {};
23182 Handle this gracefully by accepting the extra qualifier, and then
23183 issuing an error about it later if this really is a
23184 class-head. If it turns out just to be an elaborated type
23185 specifier, remain silent. */
23191 /* Determine the name of the class. Begin by looking for an
23192 optional nested-name-specifier. */
23194 nested_name_specifier
23200 /* If there was a nested-name-specifier, then there *must* be an
23201 identifier. */
23206 {
23208 /* Although the grammar says `identifier', it really means
23209 `class-name' or `template-name'. You are only allowed to
23210 define a class that has already been declared with this
23211 syntax.
23213 The proposed resolution for Core Issue 180 says that wherever
23214 you see `class T::X' you should treat `X' as a type-name.
23216 It is OK to define an inaccessible class; for example:
23218 class A { class B; };
23219 class A::B {};
23221 We do not know if we will see a class-name, or a
23222 template-name. We look for a class-name first, in case the
23223 class-name is a template-id; if we looked for the
23224 template-name first we would stop after the template-name. */
23231 class_type,
23235 /* If that didn't work, ignore the nested-name-specifier. */
23237 {
23243 }
23244 /* If we could not find a corresponding TYPE, treat this
23245 declaration like an unqualified declaration. */
23248 /* Otherwise, count the number of templates used in TYPE and its
23249 containing scopes. */
23250 else
23252 }
23253 /* Otherwise, the identifier is optional. */
23254 else
23255 {
23256 /* We don't know whether what comes next is a template-id,
23257 an identifier, or nothing at all. */
23259 /* Check for a template-id. */
23264 class_key,
23266 /* If that didn't work, it could still be an identifier. */
23268 {
23270 {
23273 }
23274 else
23276 }
23277 else
23278 {
23281 }
23282 }
23287 {
23289 class_key,
23291 }
23294 /* If it's not a `:' or a `{' then we can't really be looking at a
23295 class-head, since a class-head only appears as part of a
23296 class-specifier. We have to detect this situation before calling
23297 xref_tag, since that has irreversible side-effects. */
23299 {
23303 }
23305 /* At this point, we're going ahead with the class-specifier, even
23306 if some other problem occurs. */
23309 {
23314 }
23315 /* Issue the error about the overly-qualified name now. */
23317 {
23322 }
23324 {
23329 }
23331 {
23332 tree scope;
23335 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23336 keyword template shall not appear at the top level. */
23340 /* Reject typedef-names in class heads. */
23342 {
23345 type);
23348 }
23350 /* Figure out in what scope the declaration is being placed. */
23352 /* If that scope does not contain the scope in which the
23353 class was originally declared, the program is invalid. */
23355 {
23358 "declaration of %qD in namespace %qD which does not "
23361 else
23367 }
23368 /* [dcl.meaning]
23370 A declarator-id shall not be qualified except for the
23371 definition of a ... nested class outside of its class
23372 ... [or] the definition or explicit instantiation of a
23373 class member of a namespace outside of its namespace. */
23375 {
23380 }
23381 }
23382 /* An explicit-specialization must be preceded by "template <>". If
23383 it is not, try to recover gracefully. */
23386 && !processing_template_parmlist
23388 {
23389 /* Build a location of this form:
23390 struct typename <ARGS>
23391 ^~~~~~~~~~~~~~~~~~~~~~
23392 with caret==start at the start token, and
23393 finishing at the end of the type. */
23394 location_t reported_loc
23396 class_head_start_location,
23402 "an explicit specialization must be preceded by"
23405 /* Take the same action that would have been taken by
23406 cp_parser_explicit_specialization. */
23409 }
23410 /* There must be no "return" statements between this point and the
23411 end of this function; set "type "to the correct return value and
23412 use "goto done;" to return. */
23413 /* Make sure that the right number of template parameters were
23414 present. */
23416 template_id_p,
23419 {
23420 /* If something went wrong, there is no point in even trying to
23421 process the class-definition. */
23424 }
23426 /* Look up the type. */
23428 {
23432 {
23436 }
23437 else
23438 {
23442 /* Check the scope while we still know whether or not we had a
23443 nested-name-specifier. */
23446 }
23449 }
23451 {
23452 tree class_type;
23454 /* Given:
23456 template <typename T> struct S { struct T };
23457 template <typename T> struct S<T>::T { };
23459 we will get a TYPENAME_TYPE when processing the definition of
23460 `S::T'. We need to resolve it to the actual type before we
23461 try to define it. */
23463 {
23468 else
23469 {
23472 }
23473 }
23477 {
23480 }
23483 /* Enter the scope indicated by the nested-name-specifier. */
23485 /* Get the canonical version of this type. */
23487 /* Call push_template_decl if it seems like we should be defining a
23488 template either from the template headers or the type we're
23489 defining, so that we diagnose both extra and missing headers. */
23493 {
23496 {
23499 }
23500 }
23504 }
23506 {
23507 /* If the class was unnamed, create a dummy name. */
23511 ? ts_within_enclosing_non_class
23515 }
23517 /* Indicate whether this class was declared as a `class' or as a
23518 `struct'. */
23523 /* If this type was already complete, and we see another definition,
23524 that's an error. */
23526 {
23528 type);
23530 type);
23533 }
23538 {
23539 /* Apply attributes now, before any use of the class as a template
23540 argument in its base list. */
23543 }
23545 /* We will have entered the scope containing the class; the names of
23546 base classes should be looked up in that context. For example:
23548 struct A { struct B {}; struct C; };
23549 struct A::C : B {};
23551 is valid. */
23553 /* Get the list of base-classes, if there is one. */
23555 {
23556 /* PR59482: enter the class scope so that base-specifiers are looked
23557 up correctly. */
23561 /* PR59482: get out of the previously pushed class scope so that the
23562 subsequent pops pop the right thing. */
23565 }
23566 else
23569 /* If we're really defining a class, process the base classes.
23570 If they're invalid, fail. */
23574 done:
23575 /* Leave the scope given by the nested-name-specifier. We will
23576 enter the class scope itself while processing the members. */
23581 {
23584 }
23590 out:
23593 }
23595 /* Parse a class-key.
23597 class-key:
23598 class
23599 struct
23600 union
23602 Returns the kind of class-key specified, or none_type to indicate
23603 error. */
23605 static enum tag_types
23607 {
23611 /* Look for the class-key. */
23616 /* Check to see if the TOKEN is a class-key. */
23621 }
23623 /* Parse a type-parameter-key.
23625 type-parameter-key:
23626 class
23627 typename
23628 */
23630 static void
23632 {
23633 /* Look for the type-parameter-key. */
23637 {
23640 /* typename is not allowed in a template template parameter
23641 by the standard until C++17. */
23643 "ISO C++ forbids typename key in template template parameter;"
23645 }
23646 else
23650 }
23652 /* Parse an (optional) member-specification.
23654 member-specification:
23655 member-declaration member-specification [opt]
23656 access-specifier : member-specification [opt] */
23658 static void
23660 {
23662 {
23666 /* Peek at the next token. */
23668 /* If it's a `}', or EOF then we've seen all the members. */
23674 /* See if this token is a keyword. */
23677 {
23681 /* Consume the access-specifier. */
23683 /* Remember which access-specifier is active. */
23685 /* Look for the `:'. */
23690 /* Accept #pragmas at class scope. */
23692 {
23695 }
23697 /* Otherwise, the next construction must be a
23698 member-declaration. */
23700 }
23701 }
23702 }
23704 /* Parse a member-declaration.
23706 member-declaration:
23707 decl-specifier-seq [opt] member-declarator-list [opt] ;
23708 function-definition ; [opt]
23709 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23710 using-declaration
23711 template-declaration
23712 alias-declaration
23714 member-declarator-list:
23715 member-declarator
23716 member-declarator-list , member-declarator
23718 member-declarator:
23719 declarator pure-specifier [opt]
23720 declarator constant-initializer [opt]
23721 identifier [opt] : constant-expression
23723 GNU Extensions:
23725 member-declaration:
23726 __extension__ member-declaration
23728 member-declarator:
23729 declarator attributes [opt] pure-specifier [opt]
23730 declarator attributes [opt] constant-initializer [opt]
23731 identifier [opt] attributes [opt] : constant-expression
23733 C++0x Extensions:
23735 member-declaration:
23736 static_assert-declaration */
23738 static void
23740 {
23741 cp_decl_specifier_seq decl_specifiers;
23742 tree prefix_attributes;
23743 tree decl;
23752 /* Check for the `__extension__' keyword. */
23754 {
23755 /* Recurse. */
23757 /* Restore the old value of the PEDANTIC flag. */
23761 }
23763 /* Check for a template-declaration. */
23765 {
23766 /* An explicit specialization here is an error condition, and we
23767 expect the specialization handler to detect and report this. */
23771 else
23775 }
23776 /* Check for a template introduction. */
23780 /* Check for a using-declaration. */
23782 {
23784 {
23785 /* Parse the using-declaration. */
23789 }
23790 else
23791 {
23792 tree decl;
23796 /* Note that if we actually see the '=' token after the
23797 identifier, cp_parser_alias_declaration commits the
23798 tentative parse. In that case, we really expect an
23799 alias-declaration. Otherwise, we expect a using
23800 declaration. */
23801 alias_decl_expected =
23807 else
23811 }
23812 }
23814 /* Check for @defs. */
23816 {
23821 {
23826 }
23828 }
23830 /* If the next token is `static_assert' we have a static assertion. */
23832 {
23835 }
23842 /* Parse the decl-specifier-seq. */
23845 CP_PARSER_FLAGS_OPTIONAL,
23848 /* Check for an invalid type-name. */
23852 /* If there is no declarator, then the decl-specifier-seq should
23853 specify a type. */
23855 {
23856 /* If there was no decl-specifier-seq, and the next token is a
23857 `;', then we have something like:
23859 struct S { ; };
23861 [class.mem]
23863 Each member-declaration shall declare at least one member
23864 name of the class. */
23866 {
23869 {
23873 }
23874 }
23875 else
23876 {
23877 tree type;
23879 /* See if this declaration is a friend. */
23881 /* If there were decl-specifiers, check to see if there was
23882 a class-declaration. */
23885 /* Nested classes have already been added to the class, but
23886 a `friend' needs to be explicitly registered. */
23888 {
23889 /* If the `friend' keyword was present, the friend must
23890 be introduced with a class-key. */
23893 "in C++03 a class-key must be used "
23895 /* In this case:
23897 template <typename T> struct A {
23898 friend struct A<T>::B;
23899 };
23901 A<T>::B will be represented by a TYPENAME_TYPE, and
23902 therefore not recognized by check_tag_decl. */
23904 {
23908 }
23911 "friend declaration does not name a class or "
23913 else
23916 }
23917 /* If there is no TYPE, an error message will already have
23918 been issued. */
23920 ;
23921 /* An anonymous aggregate has to be handled specially; such
23922 a declaration really declares a data member (with a
23923 particular type), as opposed to a nested class. */
23925 {
23926 /* C++11 9.5/6. */
23929 "a storage class on an anonymous aggregate "
23932 /* Remove constructors and such from TYPE, now that we
23933 know it is an anonymous aggregate. */
23935 /* And make the corresponding data member. */
23938 /* Add it to the class. */
23940 }
23941 else
23942 cp_parser_check_access_in_redeclaration
23945 }
23946 }
23947 else
23948 {
23951 /* Clear attributes from the decl_specifiers but keep them
23952 around as prefix attributes that apply them to the entity
23953 being declared. */
23957 /* See if these declarations will be friends. */
23960 /* Keep going until we hit the `;' at the end of the
23961 declaration. */
23963 {
23965 tree first_attribute;
23966 tree initializer;
23969 /* Peek at the next token. */
23972 /* The following code wants to know early if it is a bit-field
23973 or some other declaration. Attributes can appear before
23974 the `:' token. Skip over them without consuming any tokens
23975 to peek if they are followed by `:'. */
23980 {
23981 size_t n
23984 }
23986 /* Check for a bitfield declaration. */
23992 {
23993 tree identifier;
23994 tree width;
23999 else
24002 /* Look for attributes that apply to the bitfield. */
24005 /* Consume the `:' token. */
24008 /* Get the width of the bitfield. */
24012 /* In C++2A and as extension for C++11 and above we allow
24013 default member initializers for bit-fields. */
24018 CPP_OPEN_BRACE)))
24019 {
24020 location_t loc
24026 "default member initializers for bit-fields "
24027 "only available with -std=c++2a or "
24032 {
24036 }
24037 }
24038 else
24039 {
24040 /* Look for attributes that apply to the bitfield after
24041 the `:' token and width. This is where GCC used to
24042 parse attributes in the past, pedwarn if there is
24043 a std attribute. */
24046 "ISO C++ allows bit-field attributes only "
24050 }
24054 /* Remember which attributes are prefix attributes and
24055 which are not. */
24057 /* Combine the attributes. */
24060 /* Create the bitfield declaration. */
24063 identifier,
24064 sfk_none)
24068 attributes);
24069 }
24070 else
24071 {
24073 tree asm_specification;
24076 /* Parse the declarator. */
24077 declarator
24082 friend_p);
24084 /* If something went wrong parsing the declarator, make sure
24085 that we at least consume some tokens. */
24087 {
24088 /* Skip to the end of the statement. */
24090 /* If the next token is not a semicolon, that is
24091 probably because we just skipped over the body of
24092 a function. So, we consume a semicolon if
24093 present, but do not issue an error message if it
24094 is not present. */
24096 CPP_SEMICOLON))
24099 }
24102 cp_parser_check_for_definition_in_return_type
24106 /* Look for an asm-specification. */
24108 /* Look for attributes that apply to the declaration. */
24110 /* Remember which attributes are prefix attributes and
24111 which are not. */
24113 /* Combine the attributes. */
24116 /* If it's an `=', then we have a constant-initializer or a
24117 pure-specifier. It is not correct to parse the
24118 initializer before registering the member declaration
24119 since the member declaration should be in scope while
24120 its initializer is processed. However, the rest of the
24121 front end does not yet provide an interface that allows
24122 us to handle this correctly. */
24124 {
24125 /* In [class.mem]:
24127 A pure-specifier shall be used only in the declaration of
24128 a virtual function.
24130 A member-declarator can contain a constant-initializer
24131 only if it declares a static member of integral or
24132 enumeration type.
24134 Therefore, if the DECLARATOR is for a function, we look
24135 for a pure-specifier; otherwise, we look for a
24136 constant-initializer. When we call `grokfield', it will
24137 perform more stringent semantics checks. */
24149 {
24151 /* Don't require a constant rvalue in C++11, since we
24152 might want a reference constant. We'll enforce
24153 constancy later. */
24155 /* Parse the initializer. */
24158 }
24159 else
24160 /* Parse the initializer. */
24162 }
24165 {
24169 else
24171 }
24172 /* Otherwise, there is no initializer. */
24173 else
24176 /* See if we are probably looking at a function
24177 definition. We are certainly not looking at a
24178 member-declarator. Calling `grokfield' has
24179 side-effects, so we must not do it unless we are sure
24180 that we are looking at a member-declarator. */
24183 {
24184 /* The grammar does not allow a pure-specifier to be
24185 used when a member function is defined. (It is
24186 possible that this fact is an oversight in the
24187 standard, since a pure function may be defined
24188 outside of the class-specifier. */
24194 declarator,
24195 attributes);
24198 /* If the member was not a friend, declare it here. */
24201 /* Peek at the next token. */
24203 /* If the next token is a semicolon, consume it. */
24205 {
24206 location_t semicolon_loc
24211 "extra %<;%> after in-class "
24213 }
24215 }
24216 else
24219 /* Create the declaration. */
24224 {
24227 else
24229 }
24230 }
24235 /* Reset PREFIX_ATTRIBUTES. */
24237 {
24242 }
24244 /* If there is any qualification still in effect, clear it
24245 now; we will be starting fresh with the next declarator. */
24249 /* If it's a `,', then there are more declarators. */
24251 {
24254 {
24260 }
24261 }
24262 /* If the next token isn't a `;', then we have a parse error. */
24264 CPP_SEMICOLON))
24265 {
24266 /* The next token might be a ways away from where the
24267 actual semicolon is missing. Find the previous token
24268 and use that for our error position. */
24275 /* Assume that the user meant to provide a semicolon. If
24276 we were to cp_parser_skip_to_end_of_statement, we might
24277 skip to a semicolon inside a member function definition
24278 and issue nonsensical error messages. */
24280 }
24283 {
24284 /* Add DECL to the list of members. */
24286 /* Explicitly include, eg, NSDMIs, for better error
24287 recovery (c++/58650). */
24295 /* Add DECL to the queue of NSDMI to be parsed later. */
24297 }
24301 }
24302 }
24305 out:
24307 }
24309 /* Parse a pure-specifier.
24311 pure-specifier:
24312 = 0
24314 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24315 Otherwise, ERROR_MARK_NODE is returned. */
24317 static tree
24319 {
24322 /* Look for the `=' token. */
24325 /* Look for the `0' token. */
24334 /* Accept = default or = delete in c++0x mode. */
24337 {
24340 }
24342 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24344 {
24349 }
24351 {
24354 }
24357 }
24359 /* Parse a constant-initializer.
24361 constant-initializer:
24362 = constant-expression
24364 Returns a representation of the constant-expression. */
24366 static tree
24368 {
24369 /* Look for the `=' token. */
24373 /* It is invalid to write:
24375 struct S { static const int i = { 7 }; };
24377 */
24379 {
24382 /* Consume the opening brace. */
24383 matching_braces braces;
24385 /* Skip the initializer. */
24387 /* Look for the trailing `}'. */
24391 }
24394 }
24396 /* Derived classes [gram.class.derived] */
24398 /* Parse a base-clause.
24400 base-clause:
24401 : base-specifier-list
24403 base-specifier-list:
24404 base-specifier ... [opt]
24405 base-specifier-list , base-specifier ... [opt]
24407 Returns a TREE_LIST representing the base-classes, in the order in
24408 which they were declared. The representation of each node is as
24409 described by cp_parser_base_specifier.
24411 In the case that no bases are specified, this function will return
24412 NULL_TREE, not ERROR_MARK_NODE. */
24414 static tree
24416 {
24419 /* Look for the `:' that begins the list. */
24422 /* Scan the base-specifier-list. */
24424 {
24426 tree base;
24429 /* Look for the base-specifier. */
24431 /* Look for the (optional) ellipsis. */
24433 {
24434 /* Consume the `...'. */
24438 }
24440 /* Add BASE to the front of the list. */
24442 {
24444 /* Make this a pack expansion type. */
24448 {
24451 }
24452 }
24453 /* Peek at the next token. */
24455 /* If it's not a comma, then the list is complete. */
24458 /* Consume the `,'. */
24460 }
24462 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24463 base class had a qualified name. However, the next name that
24464 appears is certainly not qualified. */
24470 }
24472 /* Parse a base-specifier.
24474 base-specifier:
24475 :: [opt] nested-name-specifier [opt] class-name
24476 virtual access-specifier [opt] :: [opt] nested-name-specifier
24477 [opt] class-name
24478 access-specifier virtual [opt] :: [opt] nested-name-specifier
24479 [opt] class-name
24481 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24482 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24483 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24484 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24486 static tree
24488 {
24496 tree type;
24498 /* Process the optional `virtual' and `access-specifier'. */
24500 {
24501 /* Peek at the next token. */
24503 /* Process `virtual'. */
24505 {
24507 /* If `virtual' appears more than once, issue an error. */
24509 {
24513 }
24517 /* Consume the `virtual' token. */
24525 /* If more than one access specifier appears, issue an
24526 error. */
24529 {
24533 }
24537 /* Consume the access-specifier. */
24545 }
24546 }
24547 /* It is not uncommon to see programs mechanically, erroneously, use
24548 the 'typename' keyword to denote (dependent) qualified types
24549 as base classes. */
24551 {
24556 else
24558 "keyword %<typename%> not allowed in this context "
24561 }
24563 /* Look for the optional `::' operator. */
24565 /* Look for the nested-name-specifier. The simplest way to
24566 implement:
24568 [temp.res]
24570 The keyword `typename' is not permitted in a base-specifier or
24571 mem-initializer; in these contexts a qualified name that
24572 depends on a template-parameter is implicitly assumed to be a
24573 type name.
24575 is to pretend that we have seen the `typename' keyword at this
24576 point. */
24582 /* If the base class is given by a qualified name, assume that names
24583 we see are type names or templates, as appropriate. */
24589 /* DR 950 allows decltype as a base-specifier. */
24591 else
24592 {
24593 /* Otherwise, look for the class-name. */
24595 class_scope_p,
24596 template_p,
24597 typename_type,
24602 }
24608 }
24610 /* Exception handling [gram.exception] */
24612 /* Parse an (optional) noexcept-specification.
24614 noexcept-specification:
24615 noexcept ( constant-expression ) [opt]
24617 If no noexcept-specification is present, returns NULL_TREE.
24618 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24619 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24620 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24621 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24622 in which case a boolean condition is returned instead. */
24624 static tree
24629 {
24633 /* Peek at the next token. */
24636 /* Is it a noexcept-specification? */
24638 {
24639 tree expr;
24643 {
24644 matching_parens parens;
24648 {
24649 /* Types may not be defined in an exception-specification. */
24651 parser->type_definition_forbidden_message
24656 /* Restore the saved message. */
24658 }
24659 else
24660 {
24663 }
24666 }
24667 else
24668 {
24672 }
24674 /* We cannot build a noexcept-spec right away because this will check
24675 that expr is a constexpr. */
24678 else
24680 }
24681 else
24683 }
24685 /* Parse an (optional) exception-specification.
24687 exception-specification:
24688 throw ( type-id-list [opt] )
24690 Returns a TREE_LIST representing the exception-specification. The
24691 TREE_VALUE of each node is a type. */
24693 static tree
24695 {
24697 tree type_id_list;
24700 /* Peek at the next token. */
24703 /* Is it a noexcept-specification? */
24709 /* If it's not `throw', then there's no exception-specification. */
24715 /* Consume the `throw'. */
24718 /* Look for the `('. */
24719 matching_parens parens;
24722 /* Peek at the next token. */
24724 /* If it's not a `)', then there is a type-id-list. */
24726 {
24727 /* Types may not be defined in an exception-specification. */
24729 parser->type_definition_forbidden_message
24731 /* Parse the type-id-list. */
24733 /* Restore the saved message. */
24737 {
24741 }
24744 "dynamic exception specifications are deprecated in "
24746 }
24747 /* In C++17, throw() is equivalent to noexcept (true). throw()
24748 is deprecated in C++11 and above as well, but is still widely used,
24749 so don't warn about it yet. */
24752 else
24755 /* Look for the `)'. */
24759 }
24761 /* Parse an (optional) type-id-list.
24763 type-id-list:
24764 type-id ... [opt]
24765 type-id-list , type-id ... [opt]
24767 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24768 in the order that the types were presented. */
24770 static tree
24772 {
24776 {
24778 tree type;
24782 /* Get the next type-id. */
24784 /* Check for invalid 'auto'. */
24786 {
24790 }
24791 /* Parse the optional ellipsis. */
24793 {
24794 /* Consume the `...'. */
24797 /* Turn the type into a pack expansion expression. */
24799 }
24800 /* Add it to the list. */
24802 /* Peek at the next token. */
24804 /* If it is not a `,', we are done. */
24807 /* Consume the `,'. */
24809 }
24812 }
24814 /* Parse a try-block.
24816 try-block:
24817 try compound-statement handler-seq */
24819 static tree
24821 {
24822 tree try_block;
24836 }
24838 /* Parse a function-try-block.
24840 function-try-block:
24841 try ctor-initializer [opt] function-body handler-seq */
24843 static void
24845 {
24846 tree compound_stmt;
24847 tree try_block;
24849 /* Look for the `try' keyword. */
24852 /* Let the rest of the front end know where we are. */
24854 /* Parse the function-body. */
24855 cp_parser_ctor_initializer_opt_and_function_body
24857 /* We're done with the `try' part. */
24859 /* Parse the handlers. */
24861 /* We're done with the handlers. */
24863 }
24865 /* Parse a handler-seq.
24867 handler-seq:
24868 handler handler-seq [opt] */
24870 static void
24872 {
24874 {
24877 /* Parse the handler. */
24879 /* Peek at the next token. */
24881 /* If it's not `catch' then there are no more handlers. */
24884 }
24885 }
24887 /* Parse a handler.
24889 handler:
24890 catch ( exception-declaration ) compound-statement */
24892 static void
24894 {
24895 tree handler;
24896 tree declaration;
24900 matching_parens parens;
24907 }
24909 /* Parse an exception-declaration.
24911 exception-declaration:
24912 type-specifier-seq declarator
24913 type-specifier-seq abstract-declarator
24914 type-specifier-seq
24915 ...
24917 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24918 ellipsis variant is used. */
24920 static tree
24922 {
24923 cp_decl_specifier_seq type_specifiers;
24927 /* If it's an ellipsis, it's easy to handle. */
24929 {
24930 /* Consume the `...' token. */
24933 }
24935 /* Types may not be defined in exception-declarations. */
24937 parser->type_definition_forbidden_message
24940 /* Parse the type-specifier-seq. */
24944 /* If it's a `)', then there is no declarator. */
24947 else
24954 /* Restore the saved message. */
24961 }
24963 /* Parse a throw-expression.
24965 throw-expression:
24966 throw assignment-expression [opt]
24968 Returns a THROW_EXPR representing the throw-expression. */
24970 static tree
24972 {
24973 tree expression;
24978 /* Figure out whether or not there is an assignment-expression
24979 following the "throw" keyword. */
24987 else
24991 }
24993 /* GNU Extensions */
24995 /* Parse an (optional) asm-specification.
24997 asm-specification:
24998 asm ( string-literal )
25000 If the asm-specification is present, returns a STRING_CST
25001 corresponding to the string-literal. Otherwise, returns
25002 NULL_TREE. */
25004 static tree
25006 {
25008 tree asm_specification;
25010 /* Peek at the next token. */
25012 /* If the next token isn't the `asm' keyword, then there's no
25013 asm-specification. */
25017 /* Consume the `asm' token. */
25019 /* Look for the `('. */
25020 matching_parens parens;
25023 /* Look for the string-literal. */
25026 /* Look for the `)'. */
25030 }
25032 /* Parse an asm-operand-list.
25034 asm-operand-list:
25035 asm-operand
25036 asm-operand-list , asm-operand
25038 asm-operand:
25039 string-literal ( expression )
25040 [ string-literal ] string-literal ( expression )
25042 Returns a TREE_LIST representing the operands. The TREE_VALUE of
25043 each node is the expression. The TREE_PURPOSE is itself a
25044 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
25045 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
25046 is a STRING_CST for the string literal before the parenthesis. Returns
25047 ERROR_MARK_NODE if any of the operands are invalid. */
25049 static tree
25051 {
25056 {
25057 tree string_literal;
25058 tree expression;
25059 tree name;
25062 {
25063 /* Consume the `[' token. */
25065 /* Read the operand name. */
25070 /* Look for the closing `]'. */
25072 }
25073 else
25075 /* Look for the string-literal. */
25078 /* Look for the `('. */
25079 matching_parens parens;
25081 /* Parse the expression. */
25083 /* Look for the `)'. */
25091 /* Add this operand to the list. */
25093 expression,
25094 asm_operands);
25095 /* If the next token is not a `,', there are no more
25096 operands. */
25099 /* Consume the `,'. */
25101 }
25104 }
25106 /* Parse an asm-clobber-list.
25108 asm-clobber-list:
25109 string-literal
25110 asm-clobber-list , string-literal
25112 Returns a TREE_LIST, indicating the clobbers in the order that they
25113 appeared. The TREE_VALUE of each node is a STRING_CST. */
25115 static tree
25117 {
25121 {
25122 tree string_literal;
25124 /* Look for the string literal. */
25126 /* Add it to the list. */
25128 /* If the next token is not a `,', then the list is
25129 complete. */
25132 /* Consume the `,' token. */
25134 }
25137 }
25139 /* Parse an asm-label-list.
25141 asm-label-list:
25142 identifier
25143 asm-label-list , identifier
25145 Returns a TREE_LIST, indicating the labels in the order that they
25146 appeared. The TREE_VALUE of each node is a label. */
25148 static tree
25150 {
25154 {
25157 /* Look for the identifier. */
25160 {
25163 {
25169 }
25170 }
25171 /* If the next token is not a `,', then the list is
25172 complete. */
25175 /* Consume the `,' token. */
25177 }
25180 }
25182 /* Return TRUE iff the next tokens in the stream are possibly the
25183 beginning of a GNU extension attribute. */
25185 static bool
25187 {
25189 }
25191 /* Return TRUE iff the next tokens in the stream are possibly the
25192 beginning of a standard C++-11 attribute specifier. */
25194 static bool
25196 {
25198 }
25200 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25201 beginning of a standard C++-11 attribute specifier. */
25203 static bool
25205 {
25213 }
25215 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25216 beginning of a GNU extension attribute. */
25218 static bool
25220 {
25224 }
25226 /* Return true iff the next tokens can be the beginning of either a
25227 GNU attribute list, or a standard C++11 attribute sequence. */
25229 static bool
25231 {
25234 }
25236 /* Return true iff the next Nth tokens can be the beginning of either
25237 a GNU attribute list, or a standard C++11 attribute sequence. */
25239 static bool
25241 {
25244 }
25246 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
25247 of GNU attributes, or return NULL. */
25249 static tree
25251 {
25255 }
25257 /* Parse an (optional) series of attributes.
25259 attributes:
25260 attributes attribute
25262 attribute:
25263 __attribute__ (( attribute-list [opt] ))
25265 The return value is as for cp_parser_gnu_attribute_list. */
25267 static tree
25269 {
25276 {
25278 tree attribute_list;
25281 /* Peek at the next token. */
25283 /* If it's not `__attribute__', then we're done. */
25287 /* Consume the `__attribute__' keyword. */
25289 /* Look for the two `(' tokens. */
25290 matching_parens outer_parens;
25292 matching_parens inner_parens;
25295 /* Peek at the next token. */
25298 /* Parse the attribute-list. */
25300 else
25301 /* If the next token is a `)', then there is no attribute
25302 list. */
25305 /* Look for the two `)' tokens. */
25313 /* Add these new attributes to the list. */
25315 }
25318 }
25320 /* Parse a GNU attribute-list.
25322 attribute-list:
25323 attribute
25324 attribute-list , attribute
25326 attribute:
25327 identifier
25328 identifier ( identifier )
25329 identifier ( identifier , expression-list )
25330 identifier ( expression-list )
25332 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25333 to an attribute. The TREE_PURPOSE of each node is the identifier
25334 indicating which attribute is in use. The TREE_VALUE represents
25335 the arguments, if any. */
25337 static tree
25339 {
25345 {
25347 tree identifier;
25348 tree attribute;
25350 /* Look for the identifier. We also allow keywords here; for
25351 example `__attribute__ ((const))' is legal. */
25355 {
25358 /* Consume the token, but save it since we need it for the
25359 SIMD enabled function parsing. */
25362 /* Save away the identifier that indicates which attribute
25363 this is. */
25365 /* For keywords, use the canonical spelling, not the
25366 parsed identifier. */
25373 /* Peek at the next token. */
25375 /* If it's an `(', then parse the attribute arguments. */
25377 {
25381 vec = cp_parser_parenthesized_expression_list
25387 else
25388 {
25391 }
25392 /* Save the arguments away. */
25394 }
25397 {
25398 /* Add this attribute to the list. */
25401 }
25404 }
25405 /* Now, look for more attributes. If the next token isn't a
25406 `,', we're done. */
25410 /* Consume the comma and keep going. */
25412 }
25415 /* We built up the list in reverse order. */
25417 }
25419 /* Parse a standard C++11 attribute.
25421 The returned representation is a TREE_LIST which TREE_PURPOSE is
25422 the scoped name of the attribute, and the TREE_VALUE is its
25423 arguments list.
25425 Note that the scoped name of the attribute is itself a TREE_LIST
25426 which TREE_PURPOSE is the namespace of the attribute, and
25427 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25428 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25429 and which TREE_PURPOSE is directly the attribute name.
25431 Clients of the attribute code should use get_attribute_namespace
25432 and get_attribute_name to get the actual namespace and name of
25433 attributes, regardless of their being GNU or C++11 attributes.
25435 attribute:
25436 attribute-token attribute-argument-clause [opt]
25438 attribute-token:
25439 identifier
25440 attribute-scoped-token
25442 attribute-scoped-token:
25443 attribute-namespace :: identifier
25445 attribute-namespace:
25446 identifier
25448 attribute-argument-clause:
25449 ( balanced-token-seq )
25451 balanced-token-seq:
25452 balanced-token [opt]
25453 balanced-token-seq balanced-token
25455 balanced-token:
25456 ( balanced-token-seq )
25457 [ balanced-token-seq ]
25458 { balanced-token-seq }. */
25460 static tree
25462 {
25469 /* First, parse name of the attribute, a.k.a attribute-token. */
25486 {
25487 /* We are seeing a scoped attribute token. */
25502 else
25503 {
25507 }
25512 NULL_TREE);
25514 }
25516 {
25520 NULL_TREE);
25521 }
25522 else
25523 {
25526 NULL_TREE);
25527 /* C++11 noreturn attribute is equivalent to GNU's. */
25530 /* C++14 deprecated attribute is equivalent to GNU's. */
25533 /* C++17 fallthrough attribute is equivalent to GNU's. */
25536 /* Transactional Memory TS optimize_for_synchronized attribute is
25537 equivalent to GNU transaction_callable. */
25541 /* Transactional Memory attributes are GNU attributes. */
25544 }
25546 /* Now parse the optional argument clause of the attribute. */
25551 {
25557 /* A GNU attribute that takes an identifier in parameter. */
25560 vec = cp_parser_parenthesized_expression_list
25566 else
25567 {
25570 }
25574 else
25576 }
25579 }
25581 /* Check that the attribute ATTRIBUTE appears at most once in the
25582 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25583 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25584 isn't implemented yet in GCC. */
25586 static void
25588 {
25590 {
25600 }
25601 }
25603 /* Parse a list of standard C++-11 attributes.
25605 attribute-list:
25606 attribute [opt]
25607 attribute-list , attribute[opt]
25608 attribute ...
25609 attribute-list , attribute ...
25610 */
25612 static tree
25614 {
25619 {
25624 {
25628 }
25631 {
25636 else
25637 {
25642 }
25644 }
25648 }
25651 }
25653 /* Parse a standard C++-11 attribute specifier.
25655 attribute-specifier:
25656 [ [ attribute-using-prefix [opt] attribute-list ] ]
25657 alignment-specifier
25659 attribute-using-prefix:
25660 using attribute-namespace :
25662 alignment-specifier:
25663 alignas ( type-id ... [opt] )
25664 alignas ( alignment-expression ... [opt] ). */
25666 static tree
25668 {
25674 {
25681 {
25692 {
25696 "attribute using prefix only available "
25702 }
25703 else
25705 }
25712 else
25713 /* Warn about parsing c++11 attribute in non-c++11 mode, only
25714 when we are sure that we have actually parsed them. */
25716 }
25717 else
25718 {
25719 tree alignas_expr;
25721 /* Look for an alignment-specifier. */
25732 matching_parens parens;
25740 {
25747 }
25752 /* Handle alignas (pack...). */
25754 {
25757 }
25759 /* Something went wrong, so don't build the attribute. */
25766 /* Build the C++-11 representation of an 'aligned'
25767 attribute. */
25768 attributes
25771 }
25774 }
25776 /* Parse a standard C++-11 attribute-specifier-seq.
25778 attribute-specifier-seq:
25779 attribute-specifier-seq [opt] attribute-specifier
25780 */
25782 static tree
25784 {
25789 {
25798 else
25801 }
25804 }
25806 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25807 return index of the first token after balanced-token, or N on failure. */
25809 static size_t
25811 {
25814 do
25816 {
25819 /* Ran out of tokens. */
25841 }
25844 }
25846 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25847 return index of the first token after the GNU attribute tokens, or N on
25848 failure. */
25850 static size_t
25852 {
25854 {
25866 }
25868 }
25870 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25871 next token), return index of the first token after the standard C++11
25872 attribute tokens, or N on failure. */
25874 static size_t
25876 {
25878 {
25881 {
25888 }
25891 {
25896 }
25897 else
25899 }
25901 }
25903 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25904 as the next token), return index of the first token after the attribute
25905 tokens, or N on failure. */
25907 static size_t
25909 {
25913 }
25915 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25916 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25917 current value of the PEDANTIC flag, regardless of whether or not
25918 the `__extension__' keyword is present. The caller is responsible
25919 for restoring the value of the PEDANTIC flag. */
25921 static bool
25923 {
25924 /* Save the old value of the PEDANTIC flag. */
25928 {
25929 /* Consume the `__extension__' token. */
25931 /* We're not being pedantic while the `__extension__' keyword is
25932 in effect. */
25936 }
25939 }
25941 /* Parse a label declaration.
25943 label-declaration:
25944 __label__ label-declarator-seq ;
25946 label-declarator-seq:
25947 identifier , label-declarator-seq
25948 identifier */
25950 static void
25952 {
25953 /* Look for the `__label__' keyword. */
25957 {
25958 tree identifier;
25960 /* Look for an identifier. */
25962 /* If we failed, stop. */
25965 /* Declare it as a label. */
25967 /* If the next token is a `;', stop. */
25970 /* Look for the `,' separating the label declarations. */
25972 }
25974 /* Look for the final `;'. */
25976 }
25978 // -------------------------------------------------------------------------- //
25979 // Requires Clause
25981 // Parse a requires clause.
25982 //
25983 // requires-clause:
25984 // 'requires' logical-or-expression
25985 //
25986 // The required logical-or-expression must be a constant expression. Note
25987 // that we don't check that the expression is constepxr here. We defer until
25988 // we analyze constraints and then, we only check atomic constraints.
25989 static tree
25991 {
25992 // Parse the requires clause so that it is not automatically folded.
26000 }
26002 // Optionally parse a requires clause:
26003 static tree
26005 {
26008 {
26011 {
26014 /* Parse and discard the requires-clause. */
26017 }
26019 }
26022 }
26025 /*---------------------------------------------------------------------------
26026 Requires expressions
26027 ---------------------------------------------------------------------------*/
26029 /* Parse a requires expression
26031 requirement-expression:
26032 'requires' requirement-parameter-list [opt] requirement-body */
26033 static tree
26035 {
26039 /* A requires-expression shall appear only within a concept
26040 definition or a requires-clause.
26042 TODO: Implement this diagnostic correctly. */
26044 {
26048 }
26051 {
26052 /* Local parameters are delared as variables within the scope
26053 of the expression. They are not visible past the end of
26054 the expression. Expressions within the requires-expression
26055 are unevaluated. */
26056 struct scope_sentinel
26057 {
26059 {
26062 }
26065 {
26068 }
26071 /* Parse the optional parameter list. */
26073 {
26077 }
26078 else
26081 /* Parse the requirement body. */
26085 }
26087 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
26088 the parm chain. */
26091 }
26093 /* Parse a parameterized requirement.
26095 requirement-parameter-list:
26096 '(' parameter-declaration-clause ')' */
26097 static tree
26099 {
26100 matching_parens parens;
26110 }
26112 /* Parse the body of a requirement.
26114 requirement-body:
26115 '{' requirement-list '}' */
26116 static tree
26118 {
26119 matching_braces braces;
26129 }
26131 /* Parse a list of requirements.
26133 requirement-list:
26134 requirement
26135 requirement-list ';' requirement[opt] */
26136 static tree
26138 {
26141 {
26148 /* If we see a semi-colon, consume it. */
26152 /* Stop processing at the end of the list. */
26155 }
26157 /* Reverse the order of requirements so they are analyzed in
26158 declaration order. */
26160 }
26162 /* Parse a syntactic requirement or type requirement.
26164 requirement:
26165 simple-requirement
26166 compound-requirement
26167 type-requirement
26168 nested-requirement */
26169 static tree
26171 {
26178 else
26180 }
26182 /* Parse a simple requirement.
26184 simple-requirement:
26185 expression ';' */
26186 static tree
26188 {
26197 }
26199 /* Parse a type requirement
26201 type-requirement
26202 nested-name-specifier [opt] required-type-name ';'
26204 required-type-name:
26205 type-name
26206 'template' [opt] simple-template-id */
26207 static tree
26209 {
26212 // Save the scope before parsing name specifiers.
26223 tree type;
26225 {
26234 }
26235 else
26254 }
26256 /* Parse a compound requirement
26258 compound-requirement:
26259 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
26260 static tree
26262 {
26263 /* Parse an expression enclosed in '{ }'s. */
26264 matching_braces braces;
26275 /* Parse the optional noexcept. */
26278 {
26281 }
26283 /* Parse the optional trailing return type. */
26286 {
26294 }
26297 }
26299 /* Parse a nested requirement. This is the same as a requires clause.
26301 nested-requirement:
26302 requires-clause */
26303 static tree
26305 {
26311 }
26313 /* Support Functions */
26315 /* Return the appropriate prefer_type argument for lookup_name_real based on
26316 tag_type and template_mem_access. */
26320 {
26321 /* DR 141: When looking in the current enclosing context for a template-name
26322 after -> or ., only consider class templates. */
26326 {
26330 }
26331 }
26333 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26334 NAME should have one of the representations used for an
26335 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26336 is returned. If PARSER->SCOPE is a dependent type, then a
26337 SCOPE_REF is returned.
26339 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26340 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26341 was formed. Abstractly, such entities should not be passed to this
26342 function, because they do not need to be looked up, but it is
26343 simpler to check for this special case here, rather than at the
26344 call-sites.
26346 In cases not explicitly covered above, this function returns a
26347 DECL, OVERLOAD, or baselink representing the result of the lookup.
26348 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26349 is returned.
26351 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26352 (e.g., "struct") that was used. In that case bindings that do not
26353 refer to types are ignored.
26355 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26356 ignored.
26358 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26359 are ignored.
26361 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26362 types.
26364 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26365 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26366 NULL_TREE otherwise. */
26368 static cp_expr
26375 location_t name_location)
26376 {
26377 tree decl;
26380 /* Assume that the lookup will be unambiguous. */
26384 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26385 no longer valid. Note that if we are parsing tentatively, and
26386 the parse fails, OBJECT_TYPE will be automatically restored. */
26392 /* A template-id has already been resolved; there is no lookup to
26393 do. */
26397 {
26401 }
26403 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26404 it should already have been checked to make sure that the name
26405 used matches the type being destroyed. */
26407 {
26408 tree type;
26410 /* Figure out to which type this destructor applies. */
26415 else
26417 /* If that's not a class type, there is no destructor. */
26428 }
26430 /* By this point, the NAME should be an ordinary identifier. If
26431 the id-expression was a qualified name, the qualifying scope is
26432 stored in PARSER->SCOPE at this point. */
26435 /* Perform the lookup. */
26437 {
26443 /* If the SCOPE is dependent, the lookup must be deferred until
26444 the template is instantiated -- unless we are explicitly
26445 looking up names in uninstantiated templates. Even then, we
26446 cannot look up the name if the scope is not a class type; it
26447 might, for example, be a template type parameter. */
26452 /* Defer lookup. */
26454 else
26455 {
26458 /* If PARSER->SCOPE is a dependent type, then it must be a
26459 class type, and we must not be checking dependencies;
26460 otherwise, we would have processed this lookup above. So
26461 that PARSER->SCOPE is not considered a dependent base by
26462 lookup_member, we must enter the scope here. */
26466 /* If the PARSER->SCOPE is a template specialization, it
26467 may be instantiated during name lookup. In that case,
26468 errors may be issued. Even if we rollback the current
26469 tentative parse, those errors are valid. */
26474 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26475 lookup result and the nested-name-specifier nominates a class C:
26476 * if the name specified after the nested-name-specifier, when
26477 looked up in C, is the injected-class-name of C (Clause 9), or
26478 * if the name specified after the nested-name-specifier is the
26479 same as the identifier or the simple-template-id's template-
26480 name in the last component of the nested-name-specifier,
26481 the name is instead considered to name the constructor of
26482 class C. [ Note: for example, the constructor is not an
26483 acceptable lookup result in an elaborated-type-specifier so
26484 the constructor would not be used in place of the
26485 injected-class-name. --end note ] Such a constructor name
26486 shall be used only in the declarator-id of a declaration that
26487 names a constructor or in a using-declaration. */
26495 /* If we have a single function from a using decl, pull it out. */
26502 }
26504 /* If the scope is a dependent type and either we deferred lookup or
26505 we did lookup but didn't find the name, rememeber the name. */
26508 {
26510 {
26511 tree type;
26513 /* The resolution to Core Issue 180 says that `struct
26514 A::B' should be considered a type-name, even if `A'
26515 is dependent. */
26520 }
26524 CPP_CLOSE_PAREN)))
26528 else
26531 is_template);
26532 }
26535 }
26537 {
26538 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26539 OBJECT_TYPE is not a class. */
26541 /* If the OBJECT_TYPE is a template specialization, it may
26542 be instantiated during name lookup. In that case, errors
26543 may be issued. Even if we rollback the current tentative
26544 parse, those errors are valid. */
26546 name,
26549 tf_warning_or_error);
26550 else
26554 /* Look it up in the enclosing context. DR 141: When looking for a
26555 template-name after -> or ., only consider class templates. */
26560 /* The object is type-dependent, so we can't look anything up; we used
26561 this to get the DR 141 behavior. */
26565 }
26566 else
26567 {
26573 }
26575 /* If the lookup failed, let our caller know. */
26579 /* Pull out the template from an injected-class-name (or multiple). */
26583 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26585 {
26588 /* The error message we have to print is too complicated for
26589 cp_parser_error, so we incorporate its actions directly. */
26591 {
26593 name);
26595 }
26597 }
26605 /* If we have resolved the name of a member declaration, check to
26606 see if the declaration is accessible. When the name resolves to
26607 set of overloaded functions, accessibility is checked when
26608 overload resolution is done.
26610 During an explicit instantiation, access is not checked at all,
26611 as per [temp.explicit]. */
26618 }
26620 /* Like cp_parser_lookup_name, but for use in the typical case where
26621 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26622 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26624 static tree
26626 {
26628 none_type,
26633 location);
26634 }
26636 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26637 the current context, return the TYPE_DECL. If TAG_NAME_P is
26638 true, the DECL indicates the class being defined in a class-head,
26639 or declared in an elaborated-type-specifier.
26641 Otherwise, return DECL. */
26643 static tree
26645 {
26646 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26647 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26649 struct A {
26650 template <typename T> struct B;
26651 };
26653 template <typename T> struct A::B {};
26655 Similarly, in an elaborated-type-specifier:
26657 namespace N { struct X{}; }
26659 struct A {
26660 template <typename T> friend struct N::X;
26661 };
26663 However, if the DECL refers to a class type, and we are in
26664 the scope of the class, then the name lookup automatically
26665 finds the TYPE_DECL created by build_self_reference rather
26666 than a TEMPLATE_DECL. For example, in:
26668 template <class T> struct S {
26669 S s;
26670 };
26672 there is no need to handle such case. */
26678 }
26680 /* If too many, or too few, template-parameter lists apply to the
26681 declarator, issue an error message. Returns TRUE if all went well,
26682 and FALSE otherwise. */
26684 static bool
26687 location_t declarator_location)
26688 {
26690 {
26692 {
26701 {
26702 /* If the DECLARATOR has the form `X<y>' then it uses one
26703 additional level of template parameters. */
26706 }
26708 return cp_parser_check_template_parameters
26710 declarator);
26711 }
26727 }
26729 }
26731 /* NUM_TEMPLATES were used in the current declaration. If that is
26732 invalid, return FALSE and issue an error messages. Otherwise,
26733 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26734 declarator and we can print more accurate diagnostics. */
26736 static bool
26740 location_t location,
26742 {
26743 /* If there are the same number of template classes and parameter
26744 lists, that's OK. */
26747 /* If there are more, but only one more, and the name ends in an identifier,
26748 then we are declaring a primary template. That's OK too. */
26752 /* If there are more template classes than parameter lists, we have
26753 something like:
26755 template <class T> void S<T>::R<T>::f (); */
26757 {
26767 else
26770 }
26771 /* Otherwise, there are too many template parameter lists. We have
26772 something like:
26774 template <class T> template <class U> void S::f(); */
26777 }
26779 /* Parse an optional `::' token indicating that the following name is
26780 from the global namespace. If so, PARSER->SCOPE is set to the
26781 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26782 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26783 Returns the new value of PARSER->SCOPE, if the `::' token is
26784 present, and NULL_TREE otherwise. */
26786 static tree
26788 {
26791 /* Peek at the next token. */
26793 /* If we're looking at a `::' token then we're starting from the
26794 global namespace, not our current location. */
26796 {
26797 /* Consume the `::' token. */
26799 /* Set the SCOPE so that we know where to start the lookup. */
26805 }
26807 {
26811 }
26814 }
26816 /* Returns TRUE if the upcoming token sequence is the start of a
26817 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26818 declarator is preceded by the `friend' specifier. */
26820 static bool
26822 {
26825 tree nested_name_specifier;
26828 /* The common case is that this is not a constructor declarator, so
26829 try to avoid doing lots of work if at all possible. It's not
26830 valid declare a constructor at function scope. */
26833 /* And only certain tokens can begin a constructor declarator. */
26841 /* Parse tentatively; we are going to roll back all of the tokens
26842 consumed here. */
26844 /* Assume that we are looking at a constructor declarator. */
26847 /* Look for the optional `::' operator. */
26850 /* Look for the nested-name-specifier. */
26851 nested_name_specifier
26862 /* Outside of a class-specifier, there must be a
26863 nested-name-specifier. Except in C++17 mode, where we
26864 might be declaring a guiding declaration. */
26871 /* If we have a class scope, this is easy; DR 147 says that S::S always
26872 names the constructor, and no other qualified name could. */
26875 {
26885 }
26886 /* If we still think that this might be a constructor-declarator,
26887 look for a class-name. */
26889 {
26890 /* If we have:
26892 template <typename T> struct S {
26893 S();
26894 };
26896 we must recognize that the nested `S' names a class. */
26900 tree type_decl;
26904 none_type,
26911 {
26917 none_type,
26922 else
26924 }
26926 /* If there was no class-name, then this is not a constructor.
26927 Otherwise, if we are in a class-specifier and we aren't
26928 handling a friend declaration, check that its type matches
26929 current_class_type (c++/38313). Note: error_mark_node
26930 is left alone for error recovery purposes. */
26932 && (outside_class_specifier_p
26938 /* If we're still considering a constructor, we have to see a `(',
26939 to begin the parameter-declaration-clause, followed by either a
26940 `)', an `...', or a decl-specifier. We need to check for a
26941 type-specifier to avoid being fooled into thinking that:
26943 S (f) (int);
26945 is a constructor. (It is actually a function named `f' that
26946 takes one parameter (of type `int') and returns a value of type
26947 `S'. */
26955 /* A parameter declaration begins with a decl-specifier,
26956 which is either the "attribute" keyword, a storage class
26957 specifier, or (usually) a type-specifier. */
26959 {
26960 tree type;
26964 /* Names appearing in the type-specifier should be looked up
26965 in the scope of the class. */
26969 {
26972 {
26976 {
26979 }
26980 }
26982 }
26984 /* Inside the constructor parameter list, surrounding
26985 template-parameter-lists do not apply. */
26986 saved_num_template_parameter_lists
26990 /* Look for the type-specifier. */
26992 CP_PARSER_FLAGS_NONE,
26998 parser->num_template_parameter_lists
27001 /* Leave the scope of the class. */
27006 }
27007 }
27009 /* We did not really want to consume any tokens. */
27013 }
27015 /* Parse the definition of the function given by the DECL_SPECIFIERS,
27016 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
27017 they must be performed once we are in the scope of the function.
27019 Returns the function defined. */
27021 static tree
27022 cp_parser_function_definition_from_specifiers_and_declarator
27025 tree attributes,
27027 {
27028 tree fn;
27031 /* Begin the function-definition. */
27034 /* The things we're about to see are not directly qualified by any
27035 template headers we've seen thus far. */
27038 /* If there were names looked up in the decl-specifier-seq that we
27039 did not check, check them now. We must wait until we are in the
27040 scope of the function to perform the checks, since the function
27041 might be a friend. */
27045 {
27050 }
27053 {
27054 /* Skip the entire function. */
27057 }
27059 {
27060 /* Seen already, skip it. An error message has already been output. */
27064 /* If this is a function from a class, pop the nested class. */
27067 }
27068 else
27069 {
27070 timevar_id_t tv;
27073 else
27079 }
27082 }
27084 /* Parse the part of a function-definition that follows the
27085 declarator. INLINE_P is TRUE iff this function is an inline
27086 function defined within a class-specifier.
27088 Returns the function defined. */
27090 static tree
27093 {
27094 tree fn;
27099 bool fully_implicit_function_template_p
27102 tree implicit_template_parms
27105 cp_binding_level* implicit_template_scope
27111 /* If the next token is `return', then the code may be trying to
27112 make use of the "named return value" extension that G++ used to
27113 support. */
27116 {
27117 /* Consume the `return' keyword. */
27119 /* Look for the identifier that indicates what value is to be
27120 returned. */
27122 /* Issue an error message. */
27125 /* Skip tokens until we reach the start of the function body. */
27127 {
27134 }
27135 }
27136 /* The `extern' in `extern "C" void f () { ... }' does not apply to
27137 anything declared inside `f'. */
27138 saved_in_unbraced_linkage_specification_p
27141 /* Inside the function, surrounding template-parameter-lists do not
27142 apply. */
27143 saved_num_template_parameter_lists
27147 /* If the next token is `try', `__transaction_atomic', or
27148 `__transaction_relaxed`, then we are looking at either function-try-block
27149 or function-transaction-block. Note that all of these include the
27150 function-body. */
27154 RID_TRANSACTION_RELAXED))
27158 else
27159 cp_parser_ctor_initializer_opt_and_function_body
27162 /* Finish the function. */
27164 /* Generate code for it, if necessary. */
27166 /* Restore the saved values. */
27167 parser->in_unbraced_linkage_specification_p
27169 parser->num_template_parameter_lists
27173 parser->fully_implicit_function_template_p
27175 parser->implicit_template_parms
27177 parser->implicit_template_scope
27184 }
27186 /* Parse a template-declaration body (following argument list). */
27188 static void
27190 tree parameter_list,
27192 {
27196 /* We just processed one more parameter list. */
27199 /* Get the deferred access checks from the parameter list. These
27200 will be checked once we know what is being declared, as for a
27201 member template the checks must be performed in the scope of the
27202 class containing the member. */
27205 /* Tentatively parse for a new template parameter list, which can either be
27206 the template keyword or a template introduction. */
27212 else
27213 {
27214 /* There are no access checks when parsing a template, as we do not
27215 know if a specialization will be a friend. */
27219 checks,
27220 member_p,
27225 /* If this is a member template declaration, let the front
27226 end know. */
27228 {
27233 }
27238 }
27239 /* We are done with the current parameter list. */
27244 /* Finish up. */
27247 /* Check the template arguments for a literal operator template. */
27251 {
27255 else
27256 {
27259 {
27263 /* OK, C++20 string literal operator template. We don't need
27264 to warn in lower dialects here because we will have already
27269 }
27271 {
27280 else
27281 /* http://cplusplus.github.io/EWG/ewg-active.html#66 */
27283 "ISO C++ did not adopt string literal operator templa"
27285 }
27286 else
27288 }
27290 {
27293 " Expected non-type template parameter pack <char...> "
27295 decl);
27296 else
27299 decl);
27300 }
27301 }
27303 /* Register member declarations. */
27306 /* If DECL is a function template, we must return to parse it later.
27307 (Even though there is no definition, there might be default
27308 arguments that need handling.) */
27312 }
27314 /* Parse a template introduction header for a template-declaration. Returns
27315 false if tentative parse fails. */
27317 static bool
27319 {
27326 /* Look for the optional `::' operator. */
27329 /* Look for the nested-name-specifier. */
27339 /* Look up the concept for which we will be matching
27340 template parameters. */
27350 /* Look for opening brace for introduction. */
27351 matching_braces braces;
27359 /* Build vector of placeholder parameters and grab
27360 matching identifiers. */
27363 /* Look for closing brace for introduction. */
27367 /* The introduction-list shall not be empty. */
27370 {
27371 /* In cp_parser_introduction_list we have already issued an error. */
27373 }
27376 {
27380 }
27382 /* Build and associate the constraint. */
27385 {
27387 member_p);
27389 }
27393 }
27395 /* Parse a normal template-declaration following the template keyword. */
27397 static void
27399 {
27400 tree parameter_list;
27404 /* Look for the `<' token. */
27408 {
27409 /* 14.5.2.2 [temp.mem]
27411 A local class shall not have member templates. */
27416 }
27417 /* [temp]
27419 A template ... shall not have C linkage. */
27421 {
27424 /* Give it C++ linkage to avoid confusing other parts of the
27425 front end. */
27428 }
27429 else
27432 /* We cannot perform access checks on the template parameter
27433 declarations until we know what is being declared, just as we
27434 cannot check the decl-specifier list. */
27437 /* If the next token is `>', then we have an invalid
27438 specialization. Rather than complain about an invalid template
27439 parameter, issue an error message here. */
27441 {
27445 }
27446 else
27447 {
27448 /* Parse the template parameters. */
27450 }
27452 /* Look for the `>'. */
27455 /* Manage template requirements */
27457 {
27462 }
27465 member_p);
27467 /* For the erroneous case of a template with C linkage, we pushed an
27468 implicit C++ linkage scope; exit that scope now. */
27471 }
27473 /* Parse a template-declaration, assuming that the `export' (and
27474 `extern') keywords, if present, has already been scanned. MEMBER_P
27475 is as for cp_parser_template_declaration. */
27477 static bool
27479 {
27481 {
27485 }
27490 }
27492 /* Perform the deferred access checks from a template-parameter-list.
27493 CHECKS is a TREE_LIST of access checks, as returned by
27494 get_deferred_access_checks. */
27496 static void
27497 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27498 {
27502 }
27504 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27505 `function-definition' sequence that follows a template header.
27506 If MEMBER_P is true, this declaration appears in a class scope.
27508 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27509 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27511 static tree
27517 {
27520 cp_decl_specifier_seq decl_specifiers;
27524 /* This function is only used when processing a template
27525 declaration. */
27529 /* Defer access checks until we know what is being declared. */
27532 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27533 alternative. */
27536 CP_PARSER_FLAGS_OPTIONAL,
27542 /* There are no template typedefs. */
27544 {
27548 }
27550 /* Gather up the access checks that occurred the
27551 decl-specifier-seq. */
27554 /* Check for the declaration of a template class. */
27556 {
27559 {
27560 // If this is a declaration, but not a definition, associate
27561 // any constraints with the type declaration. Constraints
27562 // are associated with definitions in cp_parser_class_specifier.
27568 /* In this case:
27570 struct C {
27571 friend template <typename T> struct A<T>::B;
27572 };
27574 A<T>::B will be represented by a TYPENAME_TYPE, and
27575 therefore not recognized by shadow_tag. */
27577 && !decl
27584 else
27587 /* Perform access checks for template parameters. */
27590 /* Give a helpful diagnostic for
27591 template <class T> struct A { } a;
27592 if we aren't already recovering from an error. */
27595 {
27597 "a class template declaration must not declare "
27601 }
27602 }
27603 }
27605 /* Complain about missing 'typename' or other invalid type names. */
27608 {
27609 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27610 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27611 the rest of this declaration. */
27614 }
27616 /* If it's not a template class, try for a template function. If
27617 the next token is a `;', then this declaration does not declare
27618 anything. But, if there were errors in the decl-specifiers, then
27619 the error might well have come from an attempted class-specifier.
27620 In that case, there's no need to warn about a missing declarator. */
27624 {
27627 checks,
27629 member_p,
27630 declares_class_or_enum,
27634 /* 7.1.1-1 [dcl.stc]
27636 A storage-class-specifier shall not be specified in an explicit
27637 specialization... */
27639 && explicit_specialization_p
27641 {
27645 }
27649 }
27651 /* Look for a trailing `;' after the declaration. */
27657 out:
27660 /* Clear any current qualification; whatever comes next is the start
27661 of something new. */
27667 }
27669 /* Parse a cast-expression that is not the operand of a unary "&". */
27671 static cp_expr
27673 {
27676 }
27678 /* Parse a functional cast to TYPE. Returns an expression
27679 representing the cast. */
27681 static cp_expr
27683 {
27685 tree expression_list;
27686 cp_expr cast;
27695 {
27705 /* Create a location of the form:
27706 type_name{i, f}
27707 ^~~~~~~~~~~~~~~
27708 with caret == start at the start of the type name,
27709 finishing at the closing brace. */
27710 location_t finish_loc
27713 finish_loc);
27716 }
27725 else
27726 {
27729 }
27732 tf_warning_or_error);
27733 /* [expr.const]/1: In an integral constant expression "only type
27734 conversions to integral or enumeration type can be used". */
27740 NIC_CONSTRUCTOR))
27743 /* Create a location of the form:
27744 float(i)
27745 ^~~~~~~~
27746 with caret == start at the start of the type name,
27747 finishing at the closing paren. */
27748 location_t finish_loc
27753 }
27755 /* Save the tokens that make up the body of a member function defined
27756 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27757 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27758 specifiers applied to the declaration. Returns the FUNCTION_DECL
27759 for the member function. */
27761 static tree
27765 tree attributes)
27766 {
27769 tree fn;
27772 /* Create the FUNCTION_DECL. */
27776 /* If something went badly wrong, bail out now. */
27778 {
27779 /* If there's a function-body, skip it. */
27784 }
27786 /* Remember it, if there default args to post process. */
27789 /* Save away the tokens that make up the body of the
27790 function. */
27796 RID_TRANSACTION_ATOMIC))
27797 {
27799 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27806 {
27812 }
27813 else
27816 {
27820 }
27821 }
27823 /* Handle function try blocks. */
27825 {
27828 }
27829 /* We can have braced-init-list mem-initializers before the fn body. */
27831 {
27834 {
27835 /* cache_group will stop after an un-nested { } pair, too. */
27839 /* variadic mem-inits have ... after the ')'. */
27842 }
27843 }
27845 /* Handle function try blocks. */
27851 /* Save away the inline definition; we will process it when the
27852 class is complete. */
27856 /* We need to know that this was defined in the class, so that
27857 friend templates are handled correctly. */
27860 /* Add FN to the queue of functions to be parsed later. */
27864 }
27866 /* Save the tokens that make up the in-class initializer for a non-static
27867 data member. Returns a DEFAULT_ARG. */
27869 static tree
27871 {
27873 }
27875 /* Parse a template-argument-list, as well as the trailing ">" (but
27876 not the opening "<"). See cp_parser_template_argument_list for the
27877 return value. */
27879 static tree
27881 {
27882 tree arguments;
27883 tree saved_scope;
27884 tree saved_qualifying_scope;
27885 tree saved_object_scope;
27888 /* [temp.names]
27890 When parsing a template-id, the first non-nested `>' is taken as
27891 the end of the template-argument-list rather than a greater-than
27892 operator. */
27893 saved_greater_than_is_operator_p
27896 /* Parsing the argument list may modify SCOPE, so we save it
27897 here. */
27901 /* We need to evaluate the template arguments, even though this
27902 template-id may be nested within a "sizeof". */
27903 cp_evaluated ev;
27904 /* Parse the template-argument-list itself. */
27908 else
27910 /* Look for the `>' that ends the template-argument-list. If we find
27911 a '>>' instead, it's probably just a typo. */
27913 {
27915 {
27916 /* In C++0x, a `>>' in a template argument list or cast
27917 expression is considered to be two separate `>'
27918 tokens. So, change the current token to a `>', but don't
27919 consume it: it will be consumed later when the outer
27920 template argument list (or cast expression) is parsed.
27921 Note that this replacement of `>' for `>>' is necessary
27922 even if we are parsing tentatively: in the tentative
27923 case, after calling
27924 cp_parser_enclosed_template_argument_list we will always
27925 throw away all of the template arguments and the first
27926 closing `>', either because the template argument list
27927 was erroneous or because we are replacing those tokens
27928 with a CPP_TEMPLATE_ID token. The second `>' (which will
27929 not have been thrown away) is needed either to close an
27930 outer template argument list or to complete a new-style
27931 cast. */
27934 }
27936 {
27937 /* If we're in a nested template argument list, the '>>' has
27938 to be a typo for '> >'. We emit the error message, but we
27939 continue parsing and we push a '>' as next token, so that
27940 the argument list will be parsed correctly. Note that the
27941 global source location is still on the token before the
27942 '>>', so we need to say explicitly where we want it. */
27950 }
27951 else
27952 {
27953 /* If this is not a nested template argument list, the '>>'
27954 is a typo for '>'. Emit an error message and continue.
27955 Same deal about the token location, but here we can get it
27956 right by consuming the '>>' before issuing the diagnostic. */
27959 "spurious %<>>%>, use %<>%> to terminate "
27961 }
27962 }
27963 else
27965 /* The `>' token might be a greater-than operator again now. */
27966 parser->greater_than_is_operator_p
27968 /* Restore the SAVED_SCOPE. */
27974 }
27976 /* MEMBER_FUNCTION is a member function, or a friend. If default
27977 arguments, or the body of the function have not yet been parsed,
27978 parse them now. */
27980 static void
27982 {
27984 /* If this member is a template, get the underlying
27985 FUNCTION_DECL. */
27989 /* There should not be any class definitions in progress at this
27990 point; the bodies of members are only parsed outside of all class
27991 definitions. */
27993 /* While we're parsing the member functions we might encounter more
27994 classes. We want to handle them right away, but we don't want
27995 them getting mixed up with functions that are currently in the
27996 queue. */
27999 /* Make sure that any template parameters are in scope. */
28002 /* If the body of the function has not yet been parsed, parse it
28003 now. */
28005 {
28006 tree function_scope;
28009 /* The function is no longer pending; we are processing it. */
28014 /* If this is a local class, enter the scope of the containing
28015 function. */
28020 /* Push the body of the function onto the lexer stack. */
28023 /* Let the front end know that we going to be defining this
28024 function. */
28028 /* Don't do access checking if it is a templated function. */
28032 /* #pragma omp declare reduction needs special parsing. */
28034 {
28039 }
28040 else
28041 /* Now, parse the body of the function. */
28048 /* Leave the scope of the containing function. */
28052 }
28054 /* Remove any template parameters from the symbol table. */
28057 /* Restore the queue. */
28060 }
28062 /* If DECL contains any default args, remember it on the unparsed
28063 functions queue. */
28065 static void
28067 {
28068 tree probe;
28071 probe;
28074 {
28078 }
28079 }
28081 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
28082 which is either a FIELD_DECL or PARM_DECL. Parse it and return
28083 the result. For a PARM_DECL, PARMTYPE is the corresponding type
28084 from the parameter-type-list. */
28086 static tree
28089 {
28091 tree parsed_arg;
28097 /* Push the saved tokens for the default argument onto the parser's
28098 lexer stack. */
28104 /* Parse the default argument. */
28115 {
28116 /* In a non-template class, check conversions now. In a template,
28117 we'll wait and instantiate these as needed. */
28120 tf_warning_or_error);
28123 else
28125 }
28127 /* If the token stream has not been completely used up, then
28128 there was extra junk after the end of the default
28129 argument. */
28131 {
28134 else
28136 }
28138 /* Revert to the main lexer. */
28142 }
28144 /* FIELD is a non-static data member with an initializer which we saved for
28145 later; parse it now. */
28147 static void
28149 {
28150 tree def;
28157 NULL_TREE);
28163 }
28165 /* FN is a FUNCTION_DECL which may contains a parameter with an
28166 unparsed DEFAULT_ARG. Parse the default args now. This function
28167 assumes that the current scope is the scope in which the default
28168 argument should be processed. */
28170 static void
28172 {
28176 /* While we're parsing the default args, we might (due to the
28177 statement expression extension) encounter more classes. We want
28178 to handle them right away, but we don't want them getting mixed
28179 up with default args that are currently in the queue. */
28182 /* Local variable names (and the `this' keyword) may not appear
28183 in a default argument. */
28194 {
28196 tree parsed_arg;
28198 tree copy;
28205 /* This can happen for a friend declaration for a function
28206 already declared with default arguments. */
28209 parsed_arg
28211 default_arg,
28215 /* Update any instantiations we've already created. */
28219 }
28223 /* Make sure no default arg is missing. */
28226 /* Restore the state of local_variables_forbidden_p. */
28229 /* Restore the queue. */
28231 }
28233 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
28235 sizeof ... ( identifier )
28237 where the 'sizeof' token has already been consumed. */
28239 static tree
28241 {
28242 /* Consume the `...'. */
28246 matching_parens parens;
28250 else
28258 /* The name is not qualified. */
28277 }
28279 /* Parse the operand of `sizeof' (or a similar operator). Returns
28280 either a TYPE or an expression, depending on the form of the
28281 input. The KEYWORD indicates which kind of expression we have
28282 encountered. */
28284 static tree
28286 {
28293 /* If it's a `...', then we are computing the length of a parameter
28294 pack. */
28299 /* Types cannot be defined in a `sizeof' expression. Save away the
28300 old message. */
28302 /* And create the new one. */
28308 /* The restrictions on constant-expressions do not apply inside
28309 sizeof expressions. */
28310 saved_integral_constant_expression_p
28312 saved_non_integral_constant_expression_p
28316 /* Do not actually evaluate the expression. */
28319 /* If it's a `(', then we might be looking at the type-id
28320 construction. */
28322 {
28325 /* We can't be sure yet whether we're looking at a type-id or an
28326 expression. */
28329 matching_parens parens;
28332 /* Note: as a GNU Extension, compound literals are considered
28333 postfix-expressions as they are in C99, so they are valid
28334 arguments to sizeof. See comment in cp_parser_cast_expression
28335 for details. */
28338 else
28339 {
28342 /* Look for the type-id. */
28344 /* Look for the closing `)'. */
28347 }
28349 /* If all went well, then we're done. */
28352 }
28354 /* If the type-id production did not work out, then we must be
28355 looking at the unary-expression production. */
28359 /* Go back to evaluating expressions. */
28363 /* Free the message we created. */
28365 /* And restore the old one. */
28367 parser->integral_constant_expression_p
28369 parser->non_integral_constant_expression_p
28373 }
28375 /* If the current declaration has no declarator, return true. */
28377 static bool
28379 {
28380 /* If the next token is a `;' or a `,' then there is no
28381 declarator. */
28384 }
28386 /* Update the DECL_SPECS to reflect the storage class indicated by
28387 KEYWORD. */
28389 static void
28394 {
28395 cp_storage_class storage_class;
28398 {
28402 }
28404 {
28407 }
28412 {
28415 }
28418 {
28436 }
28440 /* A storage class specifier cannot be applied alongside a typedef
28441 specifier. If there is a typedef specifier present then set
28442 conflicting_specifiers_p which will trigger an error later
28443 on in grokdeclarator. */
28446 }
28448 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28449 is true, the type is a class or enum definition. */
28451 static void
28453 tree type_spec,
28456 {
28459 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28460 (with, for example, in "typedef int wchar_t;") we remember that
28461 this is what happened. In system headers, we ignore these
28462 declarations so that G++ can work with system headers that are not
28463 C++-safe. */
28465 && !type_definition_p
28475 {
28478 ds_redefined_builtin_type_spec,
28479 token);
28481 {
28485 }
28486 }
28489 else
28490 {
28495 }
28496 }
28498 /* True iff TOKEN is the GNU keyword __thread. */
28500 static bool
28502 {
28505 }
28507 /* Set the location for a declarator specifier and check if it is
28508 duplicated.
28510 DECL_SPECS is the sequence of declarator specifiers onto which to
28511 set the location.
28513 DS is the single declarator specifier to set which location is to
28514 be set onto the existing sequence of declarators.
28516 LOCATION is the location for the declarator specifier to
28517 consider. */
28519 static void
28522 {
28531 {
28535 }
28536 else
28537 {
28539 {
28543 else
28544 {
28547 OPT_Wlong_long,
28549 }
28550 }
28552 {
28556 {
28560 }
28561 else
28562 {
28565 }
28566 }
28567 else
28568 {
28584 "__complex"
28585 };
28589 }
28590 }
28591 }
28593 /* Return true iff the declarator specifier DS is present in the
28594 sequence of declarator specifiers DECL_SPECS. */
28596 bool
28598 cp_decl_spec ds)
28599 {
28606 }
28608 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28609 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28611 static bool
28613 {
28615 }
28617 /* Issue an error message indicating that TOKEN_DESC was expected.
28618 If KEYWORD is true, it indicated this function is called by
28619 cp_parser_require_keword and the required token can only be
28620 a indicated keyword.
28622 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28623 within any error as the location of an "opening" token matching
28624 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28625 RT_CLOSE_PAREN). */
28627 static void
28629 required_token token_desc,
28631 location_t matching_location)
28632 {
28638 {
28707 }
28710 {
28712 {
28790 }
28791 }
28795 }
28798 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28799 issue an error message indicating that TOKEN_DESC was expected.
28801 Returns the token consumed, if the token had the appropriate type.
28802 Otherwise, returns NULL.
28804 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28805 within any error as the location of an "opening" token matching
28806 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28807 RT_CLOSE_PAREN). */
28812 required_token token_desc,
28813 location_t matching_location)
28814 {
28817 else
28818 {
28819 /* Output the MESSAGE -- unless we're parsing tentatively. */
28822 matching_location);
28824 }
28825 }
28827 /* An error message is produced if the next token is not '>'.
28828 All further tokens are skipped until the desired token is
28829 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28831 static void
28833 {
28834 /* Current level of '< ... >'. */
28836 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28839 /* Are we ready, yet? If not, issue error message. */
28843 /* Skip tokens until the desired token is found. */
28845 {
28846 /* Peek at the next token. */
28848 {
28856 /* C++0x views the `>>' operator as two `>' tokens, but
28857 C++98 does not. */
28860 {
28861 /* We've hit a `>>' where the first `>' closes the
28862 template argument list, and the second `>' is
28863 spurious. Just consume the `>>' and stop; we've
28864 already produced at least one error. */
28867 }
28868 /* Fall through for C++0x, so we handle the second `>' in
28869 the `>>'. */
28874 {
28875 /* We've reached the token we want, consume it and stop. */
28878 }
28897 /* The '>' was probably forgotten, don't look further. */
28902 }
28904 /* Consume this token. */
28906 }
28907 }
28909 /* If the next token is the indicated keyword, consume it. Otherwise,
28910 issue an error message indicating that TOKEN_DESC was expected.
28912 Returns the token consumed, if the token had the appropriate type.
28913 Otherwise, returns NULL. */
28918 required_token token_desc)
28919 {
28923 {
28925 UNKNOWN_LOCATION);
28927 }
28930 }
28932 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28933 function-definition. */
28935 static bool
28937 {
28940 /* A ctor-initializer begins with a `:'. */
28942 /* A function-try-block begins with `try'. */
28944 /* A function-transaction-block begins with `__transaction_atomic'
28945 or `__transaction_relaxed'. */
28948 /* The named return value extension begins with `return'. */
28950 }
28952 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28953 definition. */
28955 static bool
28957 {
28964 }
28966 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28967 C++0x) ending a template-argument. */
28969 static bool
28971 {
28979 }
28981 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28982 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28984 static bool
28987 {
28993 /* Check for the sequence `<::' in the original code. It would be lexed as
28994 `[:', where `[' is a digraph, and there is no whitespace before
28995 `:'. */
28997 {
29002 }
29004 }
29006 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
29007 or none_type otherwise. */
29009 static enum tag_types
29011 {
29013 {
29023 }
29024 }
29026 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
29027 or none_type otherwise or if the token is null. */
29029 static enum tag_types
29031 {
29036 {
29044 }
29045 }
29047 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
29049 static void
29051 {
29055 {
29059 type))
29062 }
29063 }
29065 /* Issue an error message if DECL is redeclared with different
29066 access than its original declaration [class.access.spec/3].
29067 This applies to nested classes, nested class templates and
29068 enumerations [class.mem/1]. */
29070 static void
29072 {
29083 }
29085 /* Look for the `template' keyword, as a syntactic disambiguator.
29086 Return TRUE iff it is present, in which case it will be
29087 consumed. */
29089 static bool
29091 {
29093 {
29094 /* In C++98 the `template' keyword can only be used within templates;
29095 outside templates the parser can always figure out what is a
29096 template and what is not. In C++11, per the resolution of DR 468,
29097 `template' is allowed in cases where it is not strictly necessary. */
29100 {
29103 "in C++98 %<template%> (as a disambiguator) is only "
29105 /* If this part of the token stream is rescanned, the same
29106 error message would be generated. So, we purge the token
29107 from the stream. */
29110 }
29111 else
29112 {
29113 /* Consume the `template' keyword. */
29116 }
29117 }
29119 }
29121 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
29122 set PARSER->SCOPE, and perform other related actions. */
29124 static void
29126 {
29129 /* Get the stored value. */
29131 /* Set the scope from the stored value. */
29135 }
29137 /* Consume tokens up through a non-nested END token. Returns TRUE if we
29138 encounter the end of a block before what we were looking for. */
29140 static bool
29144 {
29146 {
29149 /* Abort a parenthesized expression if we encounter a semicolon. */
29153 /* If we've reached the end of the file, stop. */
29159 /* We've hit the end of an enclosing block, so there's been some
29160 kind of syntax error. */
29163 /* Consume the token. */
29165 /* See if it starts a new group. */
29167 {
29169 /* In theory this should probably check end == '}', but
29170 cp_parser_save_member_function_body needs it to exit
29171 after either '}' or ')' when called with ')'. */
29174 }
29176 {
29180 }
29185 }
29186 }
29188 /* Like above, for caching a default argument or NSDMI. Both of these are
29189 terminated by a non-nested comma, but it can be unclear whether or not a
29190 comma is nested in a template argument list unless we do more parsing.
29191 In order to handle this ambiguity, when we encounter a ',' after a '<'
29192 we try to parse what follows as a parameter-declaration-list (in the
29193 case of a default argument) or a member-declarator (in the case of an
29194 NSDMI). If that succeeds, then we stop caching. */
29196 static tree
29198 {
29203 tree default_argument;
29205 /* Add tokens until we have processed the entire default
29206 argument. We add the range [first_token, token). */
29209 {
29210 /* For list-initialization, this is straightforward. */
29213 }
29215 {
29218 /* Peek at the next token. */
29220 /* What we do depends on what token we have. */
29222 {
29223 /* In valid code, a default argument must be
29224 immediately followed by a `,' `)', or `...'. */
29227 {
29228 /* If we've seen a '<', we might be in a
29229 template-argument-list. Until Core issue 325 is
29230 resolved, we don't know how this situation ought
29231 to be handled, so try to DTRT. We check whether
29232 what comes after the comma is a valid parameter
29233 declaration list. If it is, then the comma ends
29234 the default argument; otherwise the default
29235 argument continues. */
29239 /* Set ITALP so cp_parser_parameter_declaration_list
29240 doesn't decide to commit to this parse. */
29247 {
29248 /* Parse declarators until we reach a non-comma or
29249 somthing that cannot be an initializer.
29250 Just checking whether we're looking at a single
29251 declarator is insufficient. Consider:
29252 int var = tuple<T,U>::x;
29253 The template parameter 'U' looks exactly like a
29254 declarator. */
29255 do
29256 {
29267 }
29269 /* If we met an '=' or ';' then the original comma
29270 was the end of the NSDMI. Otherwise assume
29271 we're still in the NSDMI. */
29274 }
29275 else
29276 {
29283 }
29290 }
29291 /* FALLTHRU */
29294 /* If we run into a non-nested `;', `}', or `]',
29295 then the code is invalid -- but the default
29296 argument is certainly over. */
29301 /* Handle correctly int n = sizeof ... ( p ); */
29304 /* Update DEPTH, if necessary. */
29319 /* This might be the comparison operator, or it might
29320 start a template argument list. */
29327 /* Fall through for C++0x, which treats the `>>'
29328 operator like two `>' tokens in certain
29329 cases. */
29334 {
29335 /* This might be an operator, or it might close a
29336 template argument list. But if a previous '<'
29337 started a template argument list, this will have
29338 closed it, so we can't be in one anymore. */
29342 }
29345 /* If we run out of tokens, issue an error message. */
29353 /* In these cases, we should look for template-ids.
29354 For example, if the default argument is
29355 `X<int, double>()', we need to do name lookup to
29356 figure out whether or not `X' is a template; if
29357 so, the `,' does not end the default argument.
29359 That is not yet done. */
29364 }
29366 /* If we've reached the end, stop. */
29370 /* Add the token to the token block. */
29372 }
29374 /* Create a DEFAULT_ARG to represent the unparsed default
29375 argument. */
29382 }
29384 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29386 location_t
29388 {
29393 }
29395 /* Begin parsing tentatively. We always save tokens while parsing
29396 tentatively so that if the tentative parsing fails we can restore the
29397 tokens. */
29399 static void
29401 {
29402 /* Enter a new parsing context. */
29404 /* Begin saving tokens. */
29406 /* In order to avoid repetitive access control error messages,
29407 access checks are queued up until we are no longer parsing
29408 tentatively. */
29410 }
29412 /* Commit to the currently active tentative parse. */
29414 static void
29416 {
29420 /* Mark all of the levels as committed. */
29423 {
29430 }
29431 }
29433 /* Commit to the topmost currently active tentative parse.
29435 Note that this function shouldn't be called when there are
29436 irreversible side-effects while in a tentative state. For
29437 example, we shouldn't create a permanent entry in the symbol
29438 table, or issue an error message that might not apply if the
29439 tentative parse is aborted. */
29441 static void
29443 {
29448 {
29456 }
29457 }
29459 /* Abort the currently active tentative parse. All consumed tokens
29460 will be rolled back, and no diagnostics will be issued. */
29462 static void
29464 {
29468 /* Now, pretend that we want to see if the construct was
29469 successfully parsed. */
29471 }
29473 /* Stop parsing tentatively. If a parse error has occurred, restore the
29474 token stream. Otherwise, commit to the tokens we have consumed.
29475 Returns true if no error occurred; false otherwise. */
29477 static bool
29479 {
29483 /* Remember whether or not an error occurred, since we are about to
29484 destroy that information. */
29486 /* Remove the topmost context from the stack. */
29489 /* If no parse errors occurred, commit to the tentative parse. */
29491 {
29492 /* Commit to the tokens read tentatively, unless that was
29493 already done. */
29498 }
29499 /* Otherwise, if errors occurred, roll back our state so that things
29500 are just as they were before we began the tentative parse. */
29501 else
29502 {
29505 }
29506 /* Add the context to the front of the free list. */
29511 }
29513 /* Returns true if we are parsing tentatively and are not committed to
29514 this tentative parse. */
29516 static bool
29518 {
29521 }
29523 /* Returns nonzero iff an error has occurred during the most recent
29524 tentative parse. */
29526 static bool
29528 {
29531 }
29533 /* Returns nonzero if GNU extensions are allowed. */
29535 static bool
29537 {
29539 }
29540 \f
29541 /* Objective-C++ Productions */
29544 /* Parse an Objective-C expression, which feeds into a primary-expression
29545 above.
29547 objc-expression:
29548 objc-message-expression
29549 objc-string-literal
29550 objc-encode-expression
29551 objc-protocol-expression
29552 objc-selector-expression
29554 Returns a tree representation of the expression. */
29556 static cp_expr
29558 {
29559 /* Try to figure out what kind of declaration is present. */
29563 {
29573 {
29585 }
29586 /* FALLTHRU */
29592 }
29595 }
29597 /* Parse an Objective-C message expression.
29599 objc-message-expression:
29600 [ objc-message-receiver objc-message-args ]
29602 Returns a representation of an Objective-C message. */
29604 static tree
29606 {
29618 /* Construct a location e.g.
29619 [self func1:5]
29620 ^~~~~~~~~~~~~~
29621 ranging from the '[' to the ']', with the caret at the start. */
29626 }
29628 /* Parse an objc-message-receiver.
29630 objc-message-receiver:
29631 expression
29632 simple-type-specifier
29634 Returns a representation of the type or expression. */
29636 static tree
29638 {
29639 tree rcv;
29641 /* An Objective-C message receiver may be either (1) a type
29642 or (2) an expression. */
29646 /* If that worked out, fine. */
29653 CP_PARSER_FLAGS_NONE);
29660 }
29662 /* Parse the arguments and selectors comprising an Objective-C message.
29664 objc-message-args:
29665 objc-selector
29666 objc-selector-args
29667 objc-selector-args , objc-comma-args
29669 objc-selector-args:
29670 objc-selector [opt] : assignment-expression
29671 objc-selector-args objc-selector [opt] : assignment-expression
29673 objc-comma-args:
29674 assignment-expression
29675 objc-comma-args , assignment-expression
29677 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29678 selector arguments and TREE_VALUE containing a list of comma
29679 arguments. */
29681 static tree
29683 {
29689 {
29695 /* Detect if we have a unary selector. */
29704 sel_args
29709 }
29711 /* Handle non-selector arguments, if any. */
29713 {
29714 tree arg;
29719 addl_args
29724 }
29727 {
29730 }
29733 }
29735 /* Parse an Objective-C encode expression.
29737 objc-encode-expression:
29738 @encode objc-typename
29740 Returns an encoded representation of the type argument. */
29742 static cp_expr
29744 {
29745 tree type;
29750 matching_parens parens;
29757 {
29761 }
29763 /* This happens if we find @encode(T) (where T is a template
29764 typename or something dependent on a template typename) when
29765 parsing a template. In that case, we can't compile it
29766 immediately, but we rather create an AT_ENCODE_EXPR which will
29767 need to be instantiated when the template is used.
29768 */
29770 {
29774 }
29777 /* Build a location of the form:
29778 @encode(int)
29779 ^~~~~~~~~~~~
29780 with caret==start at the @ token, finishing at the close paren. */
29781 location_t combined_loc
29786 }
29788 /* Parse an Objective-C @defs expression. */
29790 static tree
29792 {
29793 tree name;
29796 matching_parens parens;
29802 }
29804 /* Parse an Objective-C protocol expression.
29806 objc-protocol-expression:
29807 @protocol ( identifier )
29809 Returns a representation of the protocol expression. */
29811 static tree
29813 {
29814 tree proto;
29818 matching_parens parens;
29823 /* Build a location of the form:
29824 @protocol(prot)
29825 ^~~~~~~~~~~~~~~
29826 with caret==start at the @ token, finishing at the close paren. */
29827 location_t combined_loc
29833 }
29835 /* Parse an Objective-C selector expression.
29837 objc-selector-expression:
29838 @selector ( objc-method-signature )
29840 objc-method-signature:
29841 objc-selector
29842 objc-selector-seq
29844 objc-selector-seq:
29845 objc-selector :
29846 objc-selector-seq objc-selector :
29848 Returns a representation of the method selector. */
29850 static tree
29852 {
29859 matching_parens parens;
29865 {
29874 {
29875 /* Detect if we have a unary selector. */
29877 {
29880 }
29881 else
29882 {
29884 }
29885 }
29890 {
29891 sel_seq
29894 sel_seq
29897 }
29898 else
29899 sel_seq
29904 }
29906 finish_selector:
29910 /* Build a location of the form:
29911 @selector(func)
29912 ^~~~~~~~~~~~~~~
29913 with caret==start at the @ token, finishing at the close paren. */
29914 location_t combined_loc
29918 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29921 }
29923 /* Parse a list of identifiers.
29925 objc-identifier-list:
29926 identifier
29927 objc-identifier-list , identifier
29929 Returns a TREE_LIST of identifier nodes. */
29931 static tree
29933 {
29934 tree identifier;
29935 tree list;
29946 {
29953 identifier));
29955 }
29958 }
29960 /* Parse an Objective-C alias declaration.
29962 objc-alias-declaration:
29963 @compatibility_alias identifier identifier ;
29965 This function registers the alias mapping with the Objective-C front end.
29966 It returns nothing. */
29968 static void
29970 {
29978 }
29980 /* Parse an Objective-C class forward-declaration.
29982 objc-class-declaration:
29983 @class objc-identifier-list ;
29985 The function registers the forward declarations with the Objective-C
29986 front end. It returns nothing. */
29988 static void
29990 {
29993 {
29994 tree id;
30004 else
30006 }
30008 }
30010 /* Parse a list of Objective-C protocol references.
30012 objc-protocol-refs-opt:
30013 objc-protocol-refs [opt]
30015 objc-protocol-refs:
30016 < objc-identifier-list >
30018 Returns a TREE_LIST of identifiers, if any. */
30020 static tree
30022 {
30026 {
30030 }
30033 }
30035 /* Parse a Objective-C visibility specification. */
30037 static void
30039 {
30043 {
30058 }
30060 /* Eat '@private'/'@protected'/'@public'. */
30062 }
30064 /* Parse an Objective-C method type. Return 'true' if it is a class
30065 (+) method, and 'false' if it is an instance (-) method. */
30069 {
30072 else
30074 }
30076 /* Parse an Objective-C protocol qualifier. */
30078 static tree
30080 {
30093 {
30098 }
30101 }
30103 /* Parse an Objective-C typename. */
30105 static tree
30107 {
30111 {
30114 matching_parens parens;
30118 /* An ObjC type name may consist of just protocol qualifiers, in which
30119 case the type shall default to 'id'. */
30121 {
30124 /* If the type could not be parsed, an error has already
30125 been produced. For error recovery, behave as if it had
30126 not been specified, which will use the default type
30127 'id'. */
30129 {
30131 /* We need to skip to the closing parenthesis as
30132 cp_parser_type_id() does not seem to do it for
30133 us. */
30138 }
30139 }
30143 }
30146 }
30148 /* Check to see if TYPE refers to an Objective-C selector name. */
30150 static bool
30152 {
30158 }
30160 /* Parse an Objective-C selector. */
30162 static tree
30164 {
30168 {
30171 }
30173 /* C++ operator names are allowed to appear in ObjC selectors. */
30175 {
30188 }
30189 }
30191 /* Parse an Objective-C params list. */
30193 static tree
30195 {
30201 {
30211 /* Detect if we have a unary selector. */
30214 {
30217 }
30221 {
30222 /* Something went quite wrong. There should be a colon
30223 here, but there is not. Stop parsing parameters. */
30225 }
30227 /* New ObjC allows attributes on parameters too. */
30232 params
30235 type_name,
30236 identifier,
30237 parm_attr));
30240 }
30243 {
30246 }
30248 /* We allow tail attributes for the method. */
30250 {
30258 }
30261 {
30264 }
30266 }
30268 /* Parse the non-keyword Objective-C params. */
30270 static tree
30273 {
30279 {
30281 tree parm;
30287 {
30292 }
30294 /* TODO: parse attributes for tail parameters. */
30303 }
30305 /* We allow tail attributes for the method. */
30307 {
30309 {
30314 }
30315 else
30316 /* We have an error, but parse the attributes, so that we can
30317 carry on. */
30323 }
30326 }
30328 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30330 static void
30332 {
30335 /* If the next token is `extern' and the following token is a string
30336 literal, then we have a linkage specification. */
30338 && cp_parser_is_pure_string_literal
30341 /* Handle #pragma, if any. */
30344 /* Allow stray semicolons. */
30347 /* Mark methods as optional or required, when building protocols. */
30349 {
30352 }
30354 {
30357 }
30360 /* Other stray characters must generate errors. */
30362 {
30366 }
30367 /* Finally, try to parse a block-declaration, or a function-definition. */
30368 else
30370 }
30372 /* Parse a method signature. */
30374 static tree
30376 {
30392 }
30394 static bool
30396 {
30397 tree tattr;
30402 /* If the attributes are followed by a method introducer, this is not allowed.
30403 Dump the attributes and flag the situation. */
30408 /* Otherwise, the attributes introduce some interstitial code, possibly so
30409 rewind to allow that check. */
30412 }
30414 /* Parse an Objective-C method prototype list. */
30416 static void
30418 {
30422 {
30424 {
30429 else
30433 {
30437 }
30440 }
30446 OPT_Wattributes,
30448 else
30449 /* Allow for interspersed non-ObjC++ code. */
30453 }
30457 else
30461 }
30463 /* Parse an Objective-C method definition list. */
30465 static void
30467 {
30471 {
30472 tree meth;
30475 {
30481 else
30486 {
30490 }
30492 NULL_TREE);
30494 /* For historical reasons, we accept an optional semicolon. */
30501 {
30508 }
30509 }
30510 /* The following case will be removed once @synthesize is
30511 completely implemented. */
30522 else
30523 /* Allow for interspersed non-ObjC++ code. */
30527 }
30531 else
30535 }
30537 /* Parse Objective-C ivars. */
30539 static void
30541 {
30552 {
30553 cp_decl_specifier_seq declspecs;
30555 tree prefix_attributes;
30563 CP_PARSER_FLAGS_OPTIONAL,
30567 /* auto, register, static, extern, mutable. */
30569 {
30572 }
30574 /* thread_local. */
30576 {
30579 }
30581 /* typedef. */
30583 {
30586 }
30591 /* Keep going until we hit the `;' at the end of the
30592 declaration. */
30594 {
30599 /* Check for a (possibly unnamed) bitfield declaration. */
30607 {
30608 /* Get the name of the bitfield. */
30611 sfk_none);
30613 eat_colon:
30615 /* Get the width of the bitfield. */
30616 width
30618 }
30619 else
30620 {
30621 /* Parse the declarator. */
30622 declarator
30628 }
30630 /* Look for attributes that apply to the ivar. */
30632 /* Remember which attributes are prefix attributes and
30633 which are not. */
30635 /* Combine the attributes. */
30639 /* Create the bitfield declaration. */
30642 else
30647 /* Add the instance variable. */
30651 /* Reset PREFIX_ATTRIBUTES. */
30653 {
30658 }
30663 {
30666 }
30668 }
30672 }
30677 /* Do not consume the RID_AT_END, so it will be read again as terminating
30678 the @interface of @implementation. */
30682 /* For historical reasons, we accept an optional semicolon. */
30685 }
30687 /* Parse an Objective-C protocol declaration. */
30689 static void
30691 {
30697 {
30702 }
30704 /* See if we have a forward declaration or a definition. */
30707 /* Try a forward declaration first. */
30709 {
30711 {
30712 tree id;
30722 else
30724 }
30726 }
30728 /* Ok, we got a full-fledged definition (or at least should). */
30729 else
30730 {
30735 }
30736 }
30738 /* Parse an Objective-C superclass or category. */
30740 static void
30745 {
30751 {
30754 }
30756 {
30757 matching_parens parens;
30760 /* If there is no category name, and this is an @interface, we
30761 have a class extension. */
30763 {
30766 }
30767 else
30771 }
30772 }
30774 /* Parse an Objective-C class interface. */
30776 static void
30778 {
30785 {
30786 /* It's hard to recover because even if valid @interface stuff
30787 is to follow, we can't compile it (or validate it) if we
30788 don't even know which class it refers to. Let's assume this
30789 was a stray '@interface' token in the stream and skip it.
30790 */
30792 }
30797 /* We have either a class or a category on our hands. */
30800 else
30801 {
30803 /* Handle instance variable declarations, if any. */
30806 }
30809 }
30811 /* Parse an Objective-C class implementation. */
30813 static void
30815 {
30822 {
30823 /* It's hard to recover because even if valid @implementation
30824 stuff is to follow, we can't compile it (or validate it) if
30825 we don't even know which class it refers to. Let's assume
30826 this was a stray '@implementation' token in the stream and
30827 skip it.
30828 */
30830 }
30834 /* We have either a class or a category on our hands. */
30837 else
30838 {
30840 /* Handle instance variable declarations, if any. */
30843 }
30846 }
30848 /* Consume the @end token and finish off the implementation. */
30850 static void
30852 {
30855 }
30857 /* Parse an Objective-C declaration. */
30859 static void
30861 {
30862 /* Try to figure out what kind of declaration is present. */
30867 {
30883 }
30886 {
30909 }
30910 }
30912 /* Parse an Objective-C try-catch-finally statement.
30914 objc-try-catch-finally-stmt:
30915 @try compound-statement objc-catch-clause-seq [opt]
30916 objc-finally-clause [opt]
30918 objc-catch-clause-seq:
30919 objc-catch-clause objc-catch-clause-seq [opt]
30921 objc-catch-clause:
30922 @catch ( objc-exception-declaration ) compound-statement
30924 objc-finally-clause:
30925 @finally compound-statement
30927 objc-exception-declaration:
30928 parameter-declaration
30929 '...'
30931 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30933 Returns NULL_TREE.
30935 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30936 for C. Keep them in sync. */
30938 static tree
30940 {
30941 location_t location;
30942 tree stmt;
30947 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30948 node, lest it get absorbed into the surrounding block. */
30954 {
30958 matching_parens parens;
30964 {
30965 /* We have "@catch (...)" (where the '...' are literally
30966 what is in the code). Skip the '...'.
30967 parameter_declaration is set to NULL_TREE, and
30968 objc_being_catch_clauses() knows that that means
30969 '...'. */
30972 }
30973 else
30974 {
30975 /* We have "@catch (NSException *exception)" or something
30976 like that. Parse the parameter declaration. */
30980 else
30985 }
30988 else
30989 {
30990 /* If there was no open parenthesis, we are recovering from
30991 an error, and we are trying to figure out what mistake
30992 the user has made. */
30994 /* If there is an immediate closing parenthesis, the user
30995 probably forgot the opening one (ie, they typed "@catch
30996 NSException *e)". Parse the closing parenthesis and keep
30997 going. */
31001 /* If these is no immediate closing parenthesis, the user
31002 probably doesn't know that parenthesis are required at
31003 all (ie, they typed "@catch NSException *e"). So, just
31004 forget about the closing parenthesis and keep going. */
31005 }
31009 }
31011 {
31014 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
31015 node, lest it get absorbed into the surrounding block. */
31019 }
31022 }
31024 /* Parse an Objective-C synchronized statement.
31026 objc-synchronized-stmt:
31027 @synchronized ( expression ) compound-statement
31029 Returns NULL_TREE. */
31031 static tree
31033 {
31034 location_t location;
31041 matching_parens parens;
31046 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
31047 node, lest it get absorbed into the surrounding block. */
31052 }
31054 /* Parse an Objective-C throw statement.
31056 objc-throw-stmt:
31057 @throw assignment-expression [opt] ;
31059 Returns a constructed '@throw' statement. */
31061 static tree
31063 {
31075 }
31077 /* Parse an Objective-C statement. */
31079 static tree
31081 {
31082 /* Try to figure out what kind of declaration is present. */
31086 {
31097 }
31100 }
31102 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
31103 look ahead to see if an objc keyword follows the attributes. This
31104 is to detect the use of prefix attributes on ObjC @interface and
31105 @protocol. */
31107 static bool
31109 {
31114 {
31117 }
31120 }
31122 /* This routine is a minimal replacement for
31123 c_parser_struct_declaration () used when parsing the list of
31124 types/names or ObjC++ properties. For example, when parsing the
31125 code
31127 @property (readonly) int a, b, c;
31129 this function is responsible for parsing "int a, int b, int c" and
31130 returning the declarations as CHAIN of DECLs.
31132 TODO: Share this code with cp_parser_objc_class_ivars. It's very
31133 similar parsing. */
31134 static tree
31136 {
31138 cp_decl_specifier_seq declspecs;
31140 tree prefix_attributes;
31143 CP_PARSER_FLAGS_NONE,
31150 /* auto, register, static, extern, mutable. */
31152 {
31155 }
31157 /* thread_local. */
31159 {
31162 }
31164 /* typedef. */
31166 {
31169 }
31174 /* Keep going until we hit the `;' at the end of the declaration. */
31176 {
31181 /* Parse the declarator. */
31185 /* Look for attributes that apply to the ivar. */
31187 /* Remember which attributes are prefix attributes and
31188 which are not. */
31190 /* Combine the attributes. */
31200 /* Reset PREFIX_ATTRIBUTES. */
31202 {
31207 }
31214 {
31217 }
31218 else
31220 }
31222 }
31224 /* Parse an Objective-C @property declaration. The syntax is:
31226 objc-property-declaration:
31227 '@property' objc-property-attributes[opt] struct-declaration ;
31229 objc-property-attributes:
31230 '(' objc-property-attribute-list ')'
31232 objc-property-attribute-list:
31233 objc-property-attribute
31234 objc-property-attribute-list, objc-property-attribute
31236 objc-property-attribute
31237 'getter' = identifier
31238 'setter' = identifier
31239 'readonly'
31240 'readwrite'
31241 'assign'
31242 'retain'
31243 'copy'
31244 'nonatomic'
31246 For example:
31247 @property NSString *name;
31248 @property (readonly) id object;
31249 @property (retain, nonatomic, getter=getTheName) id name;
31250 @property int a, b, c;
31252 PS: This function is identical to
31253 c_parser_objc_at_property_declaration for C. Keep them in sync. */
31254 static void
31256 {
31257 /* The following variables hold the attributes of the properties as
31258 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
31259 seen. When we see an attribute, we set them to 'true' (if they
31260 are boolean properties) or to the identifier (if they have an
31261 argument, ie, for getter and setter). Note that here we only
31262 parse the list of attributes, check the syntax and accumulate the
31263 attributes that we find. objc_add_property_declaration() will
31264 then process the information. */
31274 /* 'properties' is the list of properties that we read. Usually a
31275 single one, but maybe more (eg, in "@property int a, b, c;" there
31276 are three). */
31277 tree properties;
31278 location_t loc;
31284 /* Parse the optional attribute list... */
31286 {
31287 /* Eat the '('. */
31288 matching_parens parens;
31292 {
31298 {
31301 }
31305 {
31316 {
31320 else
31325 }
31328 {
31332 }
31334 {
31336 {
31339 }
31340 else
31344 else
31346 }
31347 else
31348 {
31350 {
31353 }
31354 else
31356 }
31362 }
31369 else
31371 }
31373 /* FIXME: "@property (setter, assign);" will generate a spurious
31374 "error: expected ‘)’ before ‘,’ token". This is because
31375 cp_parser_require, unlike the C counterpart, will produce an
31376 error even if we are in error recovery. */
31378 {
31383 }
31384 }
31386 /* ... and the property declaration(s). */
31390 {
31392 /* If the next token is now a `;', consume it. */
31396 }
31400 else
31401 {
31402 /* Comma-separated properties are chained together in
31403 reverse order; add them one by one. */
31412 }
31415 }
31417 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31419 objc-synthesize-declaration:
31420 @synthesize objc-synthesize-identifier-list ;
31422 objc-synthesize-identifier-list:
31423 objc-synthesize-identifier
31424 objc-synthesize-identifier-list, objc-synthesize-identifier
31426 objc-synthesize-identifier
31427 identifier
31428 identifier = identifier
31430 For example:
31431 @synthesize MyProperty;
31432 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31434 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31435 for C. Keep them in sync.
31436 */
31437 static void
31439 {
31441 location_t loc;
31446 {
31450 {
31453 }
31455 {
31459 {
31462 }
31463 }
31464 else
31469 else
31471 }
31474 }
31476 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31478 objc-dynamic-declaration:
31479 @dynamic identifier-list ;
31481 For example:
31482 @dynamic MyProperty;
31483 @dynamic MyProperty, AnotherProperty;
31485 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31486 for C. Keep them in sync.
31487 */
31488 static void
31490 {
31492 location_t loc;
31497 {
31498 tree property;
31501 {
31504 }
31508 else
31510 }
31513 }
31515 \f
31516 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 / 4.5 / 5.0 parsing routines. */
31518 /* Returns name of the next clause.
31519 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31520 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31521 returned and the token is consumed. */
31523 static pragma_omp_clause
31525 {
31541 {
31546 {
31733 }
31734 }
31740 }
31742 /* Validate that a clause of the given type does not already exist. */
31744 static void
31747 {
31748 tree c;
31752 {
31755 }
31756 }
31758 /* OpenMP 2.5:
31759 variable-list:
31760 identifier
31761 variable-list , identifier
31763 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31764 colon). An opening parenthesis will have been consumed by the caller.
31766 If KIND is nonzero, create the appropriate node and install the decl
31767 in OMP_CLAUSE_DECL and add the node to the head of the list.
31769 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31770 return the list created.
31772 COLON can be NULL if only closing parenthesis should end the list,
31773 or pointer to bool which will receive false if the list is terminated
31774 by closing parenthesis or true if the list is terminated by colon. */
31776 static tree
31779 {
31783 {
31786 }
31788 {
31795 && current_class_ptr
31797 {
31803 }
31804 else
31805 {
31812 {
31817 }
31821 else
31824 {
31830 }
31831 }
31833 ;
31835 {
31837 {
31839 /* The OpenACC cache directive explicitly only allows "array
31840 elements or subarrays". */
31842 {
31846 }
31847 /* FALLTHROUGH. */
31852 {
31853 location_t loc
31858 decl
31862 }
31863 /* FALLTHROUGH. */
31869 {
31877 parser->colon_corrects_to_scope_p
31881 else
31882 {
31883 /* Look for `:'. */
31885 {
31890 }
31894 CPP_CLOSE_SQUARE))
31896 }
31897 /* Look for the closing `]'. */
31899 RT_CLOSE_SQUARE))
31900 {
31905 }
31908 }
31912 }
31915 {
31919 {
31920 depend_lvalue:
31924 }
31925 else
31927 }
31933 }
31934 else
31937 get_comma:
31941 }
31947 {
31951 }
31954 {
31957 /* Try to resync to an unnested comma. Copied from
31958 cp_parser_parenthesized_expression_list. */
31959 skip_comma:
31968 }
31971 }
31973 /* Similarly, but expect leading and trailing parenthesis. This is a very
31974 common case for omp clauses. */
31976 static tree
31978 {
31982 }
31984 /* OpenACC 2.0:
31985 copy ( variable-list )
31986 copyin ( variable-list )
31987 copyout ( variable-list )
31988 create ( variable-list )
31989 delete ( variable-list )
31990 present ( variable-list ) */
31992 static tree
31994 tree list)
31995 {
31998 {
32031 }
32039 }
32041 /* OpenACC 2.0:
32042 deviceptr ( variable-list ) */
32044 static tree
32046 {
32050 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
32051 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
32052 variable-list must only allow for pointer variables. */
32055 {
32062 }
32065 }
32067 /* OpenACC 2.5:
32068 auto
32069 finalize
32070 independent
32071 nohost
32072 seq */
32074 static tree
32078 {
32083 }
32085 /* OpenACC:
32086 num_gangs ( expression )
32087 num_workers ( expression )
32088 vector_length ( expression ) */
32090 static tree
32093 {
32096 matching_parens parens;
32104 {
32109 }
32117 }
32119 /* OpenACC:
32121 gang [( gang-arg-list )]
32122 worker [( [num:] int-expr )]
32123 vector [( [length:] int-expr )]
32125 where gang-arg is one of:
32127 [num:] int-expr
32128 static: size-expr
32130 and size-expr may be:
32132 *
32133 int-expr
32134 */
32136 static tree
32139 {
32149 {
32150 matching_parens parens;
32153 do
32154 {
32158 /* Gang static argument. */
32161 {
32169 {
32172 }
32174 /* Check for the '*' argument. */
32178 CPP_CLOSE_PAREN)))
32179 {
32184 {
32187 }
32189 }
32190 }
32191 /* Worker num: argument and vector length: arguments. */
32195 {
32198 }
32200 /* Now collect the actual argument. */
32202 {
32205 }
32217 {
32220 }
32222 }
32227 }
32241 cleanup_error:
32244 }
32246 /* OpenACC 2.0:
32247 tile ( size-expr-list ) */
32249 static tree
32251 {
32255 /* Collapse and tile are mutually exclusive. (The spec doesn't say
32256 so, but the spec authors never considered such a case and have
32257 differing opinions on what it might mean, including 'not
32258 allowed'.) */
32261 clause_loc);
32266 do
32267 {
32274 {
32277 }
32278 else
32282 }
32285 /* Consume the trailing ')'. */
32293 }
32295 /* OpenACC 2.0
32296 Parse wait clause or directive parameters. */
32298 static tree
32300 {
32310 {
32315 }
32322 {
32326 {
32329 else
32330 {
32337 }
32338 }
32339 }
32342 }
32344 /* OpenACC:
32345 wait ( int-expr-list ) */
32347 static tree
32349 {
32358 }
32360 /* OpenMP 3.0:
32361 collapse ( constant-expression ) */
32363 static tree
32365 {
32367 location_t loc;
32368 HOST_WIDE_INT n;
32371 matching_parens parens;
32389 {
32392 }
32401 }
32403 /* OpenMP 2.5:
32404 default ( none | shared )
32406 OpenACC:
32407 default ( none | present ) */
32409 static tree
32412 {
32414 tree c;
32416 matching_parens parens;
32420 {
32425 {
32446 }
32449 }
32450 else
32451 {
32452 invalid_kind:
32455 else
32457 }
32474 }
32476 /* OpenMP 3.1:
32477 final ( expression ) */
32479 static tree
32481 {
32484 matching_parens parens;
32503 }
32505 /* OpenMP 2.5:
32506 if ( expression )
32508 OpenMP 4.5:
32509 if ( directive-name-modifier : expression )
32511 directive-name-modifier:
32512 parallel | task | taskloop | target data | target | target update
32513 | target enter data | target exit data
32515 OpenMP 5.0:
32516 directive-name-modifier:
32517 ... | simd | cancel */
32519 static tree
32522 {
32526 matching_parens parens;
32531 {
32547 {
32550 {
32563 else
32564 {
32565 location_t loc
32570 }
32573 {
32575 {
32580 }
32582 {
32583 location_t loc
32587 }
32588 }
32589 }
32590 }
32592 {
32594 {
32597 }
32598 else
32599 {
32601 {
32602 location_t loc
32605 }
32607 }
32608 }
32609 }
32621 {
32624 {
32627 {
32639 }
32641 p);
32643 }
32645 {
32648 else
32651 }
32654 {
32658 }
32659 }
32667 }
32669 /* OpenMP 3.1:
32670 mergeable */
32672 static tree
32675 {
32676 tree c;
32679 location);
32684 }
32686 /* OpenMP 2.5:
32687 nowait */
32689 static tree
32692 {
32693 tree c;
32700 }
32702 /* OpenMP 2.5:
32703 num_threads ( expression ) */
32705 static tree
32707 location_t location)
32708 {
32711 matching_parens parens;
32731 }
32733 /* OpenMP 4.5:
32734 num_tasks ( expression ) */
32736 static tree
32738 location_t location)
32739 {
32742 matching_parens parens;
32762 }
32764 /* OpenMP 4.5:
32765 grainsize ( expression ) */
32767 static tree
32769 location_t location)
32770 {
32773 matching_parens parens;
32793 }
32795 /* OpenMP 4.5:
32796 priority ( expression ) */
32798 static tree
32800 location_t location)
32801 {
32804 matching_parens parens;
32824 }
32826 /* OpenMP 4.5:
32827 hint ( expression ) */
32829 static tree
32831 {
32834 matching_parens parens;
32853 }
32855 /* OpenMP 4.5:
32856 defaultmap ( tofrom : scalar )
32858 OpenMP 5.0:
32859 defaultmap ( implicit-behavior [ : variable-category ] ) */
32861 static tree
32863 location_t location)
32864 {
32868 enum omp_clause_defaultmap_kind category
32871 matching_parens parens;
32878 {
32879 invalid_behavior:
32881 "%<tofrom%>, %<firstprivate%>, %<none%> "
32884 }
32885 else
32886 {
32889 }
32892 {
32896 else
32903 else
32912 else
32919 else
32928 else
32934 }
32938 {
32943 {
32944 invalid_category:
32948 }
32953 {
32957 else
32964 else
32971 else
32977 }
32980 }
32990 {
32997 {
33012 }
33015 p);
33016 else
33020 }
33027 out_err:
33032 }
33034 /* OpenMP 2.5:
33035 ordered
33037 OpenMP 4.5:
33038 ordered ( constant-expression ) */
33040 static tree
33043 {
33045 HOST_WIDE_INT n;
33051 {
33052 matching_parens parens;
33069 {
33071 "ordered argument needs positive constant integer "
33074 }
33075 }
33081 }
33083 /* OpenMP 2.5:
33084 reduction ( reduction-operator : variable-list )
33086 reduction-operator:
33087 One of: + * - & ^ | && ||
33089 OpenMP 3.1:
33091 reduction-operator:
33092 One of: + * - & ^ | && || min max
33094 OpenMP 4.0:
33096 reduction-operator:
33097 One of: + * - & ^ | && ||
33098 id-expression
33100 OpenMP 5.0:
33101 reduction ( reduction-modifier, reduction-operator : variable-list )
33102 in_reduction ( reduction-operator : variable-list )
33103 task_reduction ( reduction-operator : variable-list ) */
33105 static tree
33108 {
33118 {
33121 {
33124 }
33127 {
33133 {
33137 }
33139 {
33142 }
33143 }
33144 }
33147 {
33157 }
33161 else
33162 {
33173 {
33203 }
33204 else
33205 {
33207 resync_fail:
33212 }
33213 }
33219 NULL);
33221 {
33228 }
33231 }
33233 /* OpenMP 2.5:
33234 schedule ( schedule-kind )
33235 schedule ( schedule-kind , expression )
33237 schedule-kind:
33238 static | dynamic | guided | runtime | auto
33240 OpenMP 4.5:
33241 schedule ( schedule-modifier : schedule-kind )
33242 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
33244 schedule-modifier:
33245 simd
33246 monotonic
33247 nonmonotonic */
33249 static tree
33251 {
33255 matching_parens parens;
33262 {
33271 else
33277 else
33278 {
33281 }
33282 }
33285 {
33290 {
33311 }
33312 }
33317 else
33323 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
33325 {
33329 }
33332 {
33347 else
33352 }
33364 invalid_kind:
33366 resync_fail:
33371 }
33373 /* OpenMP 3.0:
33374 untied */
33376 static tree
33379 {
33380 tree c;
33387 }
33389 /* OpenMP 4.0:
33390 inbranch
33391 notinbranch */
33393 static tree
33396 {
33401 }
33403 /* OpenMP 4.0:
33404 parallel
33405 for
33406 sections
33407 taskgroup */
33409 static tree
33413 {
33417 }
33419 /* OpenMP 4.5:
33420 nogroup */
33422 static tree
33425 {
33430 }
33432 /* OpenMP 4.5:
33433 simd
33434 threads */
33436 static tree
33440 {
33445 }
33447 /* OpenMP 4.0:
33448 num_teams ( expression ) */
33450 static tree
33452 location_t location)
33453 {
33456 matching_parens parens;
33476 }
33478 /* OpenMP 4.0:
33479 thread_limit ( expression ) */
33481 static tree
33483 location_t location)
33484 {
33487 matching_parens parens;
33507 }
33509 /* OpenMP 4.0:
33510 aligned ( variable-list )
33511 aligned ( variable-list : constant-expression ) */
33513 static tree
33515 {
33519 matching_parens parens;
33527 {
33537 }
33543 }
33545 /* OpenMP 2.5:
33546 lastprivate ( variable-list )
33548 OpenMP 5.0:
33549 lastprivate ( [ lastprivate-modifier : ] variable-list ) */
33551 static tree
33553 {
33561 {
33566 {
33570 }
33571 }
33580 }
33582 /* OpenMP 4.0:
33583 linear ( variable-list )
33584 linear ( variable-list : expression )
33586 OpenMP 4.5:
33587 linear ( modifier ( variable-list ) )
33588 linear ( modifier ( variable-list ) : expression ) */
33590 static tree
33593 {
33598 matching_parens parens;
33603 {
33615 else
33617 }
33622 else
33623 {
33632 }
33635 {
33640 {
33651 {
33654 }
33657 }
33668 }
33671 {
33674 }
33677 }
33679 /* OpenMP 4.0:
33680 safelen ( constant-expression ) */
33682 static tree
33684 location_t location)
33685 {
33688 matching_parens parens;
33707 }
33709 /* OpenMP 4.0:
33710 simdlen ( constant-expression ) */
33712 static tree
33714 location_t location)
33715 {
33718 matching_parens parens;
33737 }
33739 /* OpenMP 4.5:
33740 vec:
33741 identifier [+/- integer]
33742 vec , identifier [+/- integer]
33743 */
33745 static tree
33747 tree list)
33748 {
33752 {
33755 }
33758 {
33765 else
33766 {
33767 t = cp_parser_lookup_name_simple
33772 id_loc);
33773 }
33779 {
33782 }
33786 {
33789 }
33793 {
33796 }
33799 add_to_vector:
33801 {
33805 }
33811 }
33814 {
33820 }
33822 }
33824 /* OpenMP 5.0:
33825 iterators ( iterators-definition )
33827 iterators-definition:
33828 iterator-specifier
33829 iterator-specifier , iterators-definition
33831 iterator-specifier:
33832 identifier = range-specification
33833 iterator-type identifier = range-specification
33835 range-specification:
33836 begin : end
33837 begin : end : step */
33839 static tree
33841 {
33845 matching_parens parens;
33849 bool saved_colon_corrects_to_scope_p
33851 bool saved_colon_doesnt_start_class_def_p
33854 do
33855 {
33856 tree iter_type;
33860 else
33861 {
33864 parser->type_definition_forbidden_message
33870 }
33874 {
33877 }
33897 {
33900 }
33915 {
33918 }
33920 }
33924 parser->colon_doesnt_start_class_def_p
33934 }
33936 /* OpenMP 4.0:
33937 depend ( depend-kind : variable-list )
33939 depend-kind:
33940 in | out | inout
33942 OpenMP 4.5:
33943 depend ( source )
33945 depend ( sink : vec )
33947 OpenMP 5.0:
33948 depend ( depend-modifier , depend-kind: variable-list )
33950 depend-kind:
33951 in | out | inout | mutexinoutset | depobj
33953 depend-modifier:
33954 iterator ( iterators-definition ) */
33956 static tree
33958 {
33962 matching_parens parens;
33966 do
33967 {
33975 {
33980 }
33995 else
33998 }
34005 {
34010 }
34013 {
34023 }
34030 else
34031 {
34036 {
34040 else
34042 }
34045 {
34050 }
34051 }
34054 invalid_kind:
34056 resync_fail:
34063 }
34065 /* OpenMP 4.0:
34066 map ( map-kind : variable-list )
34067 map ( variable-list )
34069 map-kind:
34070 alloc | to | from | tofrom
34072 OpenMP 4.5:
34073 map-kind:
34074 alloc | to | from | tofrom | release | delete
34076 map ( always [,] map-kind: variable-list ) */
34078 static tree
34080 {
34089 {
34094 {
34097 nth++;
34103 {
34108 }
34109 }
34110 }
34114 {
34128 else
34129 {
34135 }
34138 }
34141 {
34145 }
34148 NULL);
34154 }
34156 /* OpenMP 4.0:
34157 device ( expression ) */
34159 static tree
34161 location_t location)
34162 {
34165 matching_parens parens;
34185 }
34187 /* OpenMP 4.0:
34188 dist_schedule ( static )
34189 dist_schedule ( static , expression ) */
34191 static tree
34193 location_t location)
34194 {
34197 matching_parens parens;
34208 {
34219 }
34224 location);
34228 invalid_kind:
34230 resync_fail:
34235 }
34237 /* OpenMP 4.0:
34238 proc_bind ( proc-bind-kind )
34240 proc-bind-kind:
34241 master | close | spread */
34243 static tree
34245 location_t location)
34246 {
34247 tree c;
34254 {
34264 else
34266 }
34267 else
34276 location);
34281 invalid_kind:
34283 resync_fail:
34288 }
34290 /* OpenACC:
34291 async [( int-expr )] */
34293 static tree
34295 {
34302 {
34303 matching_parens parens;
34312 }
34322 }
34324 /* Parse all OpenACC clauses. The set clauses allowed by the directive
34325 is a bitmask in MASK. Return the list of clauses found. */
34327 static tree
34331 {
34336 {
34337 location_t here;
34338 pragma_omp_clause c_kind;
34339 omp_clause_code code;
34350 {
34407 clauses);
34425 OMP_CLAUSE_IF_PRESENT,
34431 OMP_CLAUSE_INDEPENDENT,
34443 clauses);
34449 clauses);
34457 clauses);
34461 clauses
34477 clauses);
34489 clauses);
34503 }
34508 {
34509 /* Remove the invalid clause(s) from the list to avoid
34510 confusing the rest of the compiler. */
34513 }
34514 }
34516 saw_error:
34523 }
34525 /* Parse all OpenMP clauses. The set clauses allowed by the directive
34526 is a bitmask in MASK. Return the list of clauses found; the result
34527 of clause default goes in *pdefault. */
34529 static tree
34533 {
34539 {
34540 pragma_omp_clause c_kind;
34551 {
34563 clauses);
34577 clauses);
34597 clauses);
34602 clauses);
34611 clauses
34651 clauses);
34655 clauses
34667 clauses);
34671 clauses
34673 OMP_CLAUSE_TASK_REDUCTION,
34689 clauses);
34694 OMP_CLAUSE_NOTINBRANCH,
34703 {
34704 clause_not_first:
34708 }
34738 clauses);
34739 else
34749 clauses);
34767 {
34772 }
34815 clauses
34821 clauses
34829 }
34834 {
34835 /* Remove the invalid clause(s) from the list to avoid
34836 confusing the rest of the compiler. */
34839 }
34840 }
34841 saw_error:
34844 {
34847 else
34849 }
34851 }
34853 /* OpenMP 2.5:
34854 structured-block:
34855 statement
34857 In practice, we're also interested in adding the statement to an
34858 outer node. So it is convenient if we work around the fact that
34859 cp_parser_statement calls add_stmt. */
34861 static unsigned
34863 {
34866 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34867 This preserves the "not within loop or switch" style error messages
34868 for nonsense cases like
34869 void foo() {
34870 #pragma omp single
34871 break;
34872 }
34873 */
34878 }
34880 static void
34882 {
34884 }
34886 static tree
34888 {
34896 }
34898 /* OpenMP 2.5:
34899 # pragma omp atomic new-line
34900 expression-stmt
34902 expression-stmt:
34903 x binop= expr | x++ | ++x | x-- | --x
34904 binop:
34905 +, *, -, /, &, ^, |, <<, >>
34907 where x is an lvalue expression with scalar type.
34909 OpenMP 3.1:
34910 # pragma omp atomic new-line
34911 update-stmt
34913 # pragma omp atomic read new-line
34914 read-stmt
34916 # pragma omp atomic write new-line
34917 write-stmt
34919 # pragma omp atomic update new-line
34920 update-stmt
34922 # pragma omp atomic capture new-line
34923 capture-stmt
34925 # pragma omp atomic capture new-line
34926 capture-block
34928 read-stmt:
34929 v = x
34930 write-stmt:
34931 x = expr
34932 update-stmt:
34933 expression-stmt | x = x binop expr
34934 capture-stmt:
34935 v = expression-stmt
34936 capture-block:
34937 { v = x; update-stmt; } | { update-stmt; v = x; }
34939 OpenMP 4.0:
34940 update-stmt:
34941 expression-stmt | x = x binop expr | x = expr binop x
34942 capture-stmt:
34943 v = update-stmt
34944 capture-block:
34945 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34947 where x and v are lvalue expressions with scalar type. */
34949 static void
34951 {
34962 {
34969 {
34974 enum omp_memory_order new_memory_order
34996 {
35000 }
35001 else
35002 {
35005 "%<capture%>, %<seq_cst%>, %<acq_rel%>, "
35007 }
35009 {
35011 {
35014 else
35016 }
35018 {
35021 else
35023 }
35026 }
35027 }
35029 }
35035 {
35036 omp_requires_mask
35041 {
35051 {
35062 }
35066 }
35067 }
35068 else
35070 {
35074 {
35078 }
35083 {
35087 }
35092 {
35096 }
35100 }
35103 {
35113 else
35118 {
35119 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
35120 opcode. */
35125 }
35129 {
35132 }
35133 else
35134 {
35140 }
35143 }
35145 restart:
35149 {
35156 /* FALLTHROUGH */
35166 /* FALLTHROUGH */
35181 /* Undo effects of boolean_increment for post {in,de}crement. */
35183 /* FALLTHRU */
35187 {
35188 /* Undo effects of boolean_increment. */
35190 {
35191 /* This is pre or post increment. */
35196 && !structured_block
35200 }
35201 }
35202 /* FALLTHRU */
35205 {
35240 {
35244 }
35247 {
35253 {
35258 }
35260 {
35272 {
35274 {
35279 }
35280 else
35282 }
35286 }
35289 {
35296 }
35300 }
35304 {
35307 {
35315 }
35317 {
35322 }
35357 }
35368 /* FALLTHROUGH */
35373 }
35380 }
35381 stmt_done:
35383 {
35394 }
35396 {
35399 }
35400 done:
35408 saw_error:
35411 {
35415 {
35419 }
35420 }
35421 }
35424 /* OpenMP 2.5:
35425 # pragma omp barrier new-line */
35427 static void
35429 {
35432 }
35434 /* OpenMP 2.5:
35435 # pragma omp critical [(name)] new-line
35436 structured-block
35438 OpenMP 4.5:
35439 # pragma omp critical [(name) [hint(expression)]] new-line
35440 structured-block */
35442 #define OMP_CRITICAL_CLAUSE_MASK \
35443 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
35445 static tree
35447 {
35451 {
35452 matching_parens parens;
35470 OMP_CRITICAL_CLAUSE_MASK,
35472 }
35473 else
35478 }
35480 /* OpenMP 5.0:
35481 # pragma omp depobj ( depobj ) depobj-clause new-line
35483 depobj-clause:
35484 depend (dependence-type : locator)
35485 destroy
35486 update (dependence-type)
35488 dependence-type:
35489 in
35490 out
35491 inout
35492 mutexinout */
35494 static void
35496 {
35498 matching_parens parens;
35500 {
35503 }
35516 {
35522 {
35528 }
35532 {
35533 matching_parens c_parens;
35535 {
35536 location_t c2_loc
35539 {
35552 }
35554 {
35558 }
35564 }
35565 else
35567 }
35568 }
35570 {
35573 }
35577 }
35580 /* OpenMP 2.5:
35581 # pragma omp flush flush-vars[opt] new-line
35583 flush-vars:
35584 ( variable-list )
35586 OpenMP 5.0:
35587 # pragma omp flush memory-order-clause new-line */
35589 static void
35591 {
35594 {
35603 else
35607 }
35609 {
35612 "%<flush%> list specified together with memory order "
35615 }
35619 }
35621 /* Helper function, to parse omp for increment expression. */
35623 static tree
35625 {
35630 {
35633 }
35636 {
35648 }
35650 /* If decl is an iterator, preserve LHS and RHS of the relational
35651 expr until finish_omp_for. */
35662 }
35664 /* Helper function, to parse omp for increment expression. */
35666 static tree
35668 {
35672 cp_id_kind idk;
35676 {
35685 }
35694 {
35699 }
35706 {
35710 }
35723 do
35724 {
35731 {
35733 {
35736 else
35738 tf_warning_or_error);
35739 }
35740 else
35743 }
35744 }
35748 {
35754 }
35755 else
35759 }
35761 /* Parse the initialization statement of an OpenMP for loop.
35763 Return true if the resulting construct should have an
35764 OMP_CLAUSE_PRIVATE added to it. */
35766 static tree
35774 {
35780 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
35782 init-expr:
35783 var = lb
35784 integer-type var = lb
35785 random-access-iterator-type var = lb
35786 pointer-type var = lb
35787 */
35788 cp_decl_specifier_seq type_specifiers;
35790 /* First, try to parse as an initialized declaration. See
35791 cp_parser_condition, from whence the bulk of this is copied. */
35798 {
35799 /* If parsing a type specifier seq succeeded, then this
35800 MUST be a initialized declaration. */
35805 CP_PARSER_DECLARATOR_NAMED,
35816 else
35817 {
35827 {
35829 CPP_OPEN_PAREN))
35832 else
35833 /* Trigger an error. */
35838 }
35842 {
35850 {
35853 auto_node);
35858 }
35861 asm_specification,
35862 LOOKUP_ONLYCONVERTING);
35865 {
35868 }
35869 else
35870 {
35873 {
35875 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
35877 {
35881 {
35885 }
35887 }
35889 {
35894 }
35895 }
35896 }
35898 }
35899 else
35900 {
35901 /* Consume '='. */
35905 non_class:
35908 else
35911 asm_specification,
35912 LOOKUP_ONLYCONVERTING);
35913 }
35917 }
35918 }
35919 else
35920 {
35921 cp_id_kind idk;
35922 /* If parsing a type specifier sequence failed, then
35923 this MUST be a simple expression. */
35929 && decl
35932 {
35943 {
35948 }
35953 }
35955 && decl
35958 {
35959 tree rhs;
35967 rhs,
35968 tf_warning_or_error));
35971 }
35972 else
35973 {
35978 {
35982 }
35983 }
35984 }
35986 }
35988 /* Helper for cp_parser_omp_for_loop, handle one range-for loop. */
35990 void
35994 {
35999 {
36003 /* do_auto_deduction doesn't mess with template init-lists. */
36005 {
36008 {
36014 }
36016 }
36023 }
36028 /* If an error happened previously do nothing or else a lot of
36029 unhelpful errors would be issued. */
36031 else
36032 {
36033 tree range_temp;
36037 /* Can't bind a reference to an array of runtime bound. */
36039 else
36040 {
36046 LOOKUP_ONLYCONVERTING);
36049 }
36052 }
36063 LOOKUP_ONLYCONVERTING);
36065 /* The new for initialization statement. */
36073 else
36074 {
36077 }
36080 LOOKUP_ONLYCONVERTING);
36082 /* The new for condition. */
36085 else
36091 /* The new increment expression. */
36094 else
36097 tf_warning_or_error);
36102 {
36105 }
36110 {
36115 {
36120 }
36121 }
36125 {
36127 tf_none);
36131 }
36138 {
36141 }
36143 }
36145 /* Helper for cp_parser_omp_for_loop, finalize part of range for
36146 inside of the collapsed body. */
36148 void
36150 {
36158 {
36162 }
36164 /* The declaration is initialized with *__begin inside the loop body. */
36167 tf_warning_or_error),
36169 LOOKUP_ONLYCONVERTING);
36172 }
36174 /* Parse the restricted form of the for statement allowed by OpenMP. */
36176 static tree
36179 {
36181 tree orig_decl;
36184 location_t loc_first;
36195 {
36198 }
36201 {
36204 }
36207 {
36213 }
36215 {
36218 {
36220 "%<linear%> clause may not be specified together "
36223 }
36224 else
36226 }
36240 {
36243 location_t loc;
36246 {
36250 }
36253 matching_parens parens;
36261 {
36262 /* Save tokens so that we can put them back. */
36265 /* Look for ':' that is not nested in () or {}. */
36266 bool is_range_for
36269 CPP_COLON,
36270 /*consume_paren=*/
36273 /* Roll back the tokens we skipped. */
36277 {
36278 bool saved_colon_corrects_to_scope_p
36281 /* A colon is used in range-based for. */
36284 /* Parse the declaration. */
36286 /*function_definition_allowed_p=*/
36288 parser->colon_corrects_to_scope_p
36300 {
36302 {
36308 }
36309 else
36311 }
36315 "%<ordered%> clause with parameter on "
36319 }
36320 }
36322 add_private_clause
36328 {
36331 {
36337 }
36338 else
36340 }
36347 {
36352 {
36356 }
36359 {
36360 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
36364 {
36367 }
36368 else
36369 {
36372 }
36374 }
36375 else
36376 {
36381 }
36382 }
36385 {
36386 tree c;
36388 {
36397 decl);
36402 decl);
36403 }
36405 {
36410 else
36415 {
36418 /* For linear, signal that we need to fill up
36419 the so far unknown linear step. */
36422 }
36423 }
36424 }
36433 {
36434 /* If decl is an iterator, preserve the operator on decl
36435 until finish_omp_for. */
36437 && ((processing_template_decl
36442 else
36446 }
36448 parse_close_paren:
36459 {
36462 }
36464 {
36468 }
36475 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
36476 in between the collapsed for loops to be still considered perfectly
36477 nested. Hopefully the final version clarifies this.
36478 For now handle (multiple) {'s and empty statements. */
36481 {
36485 {
36487 bracecount++;
36488 }
36492 else
36493 {
36500 }
36501 }
36504 {
36507 }
36508 }
36513 /* Note that we saved the original contents of this flag when we entered
36514 the structured block, and so we don't need to re-save it here. */
36517 /* Note that the grammar doesn't call for a structured block here,
36518 though the loop as a whole is a structured block. */
36520 {
36526 }
36527 else
36532 else
36537 else
36542 {
36544 {
36546 nbraces--;
36547 }
36550 else
36551 {
36553 {
36556 }
36561 }
36562 }
36565 {
36569 else
36571 }
36575 }
36577 /* Helper function for OpenMP parsing, split clauses and call
36578 finish_omp_clauses on each of the set of clauses afterwards. */
36580 static void
36583 {
36589 }
36591 /* OpenMP 4.0:
36592 #pragma omp simd simd-clause[optseq] new-line
36593 for-loop */
36595 #define OMP_SIMD_CLAUSE_MASK \
36596 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
36597 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36598 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36599 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36600 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36601 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36602 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36603 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
36604 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36605 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NONTEMPORAL))
36607 static tree
36611 {
36622 {
36626 OMP_CLAUSE_ORDERED);
36628 {
36630 "%<ordered%> clause with parameter may not be specified "
36633 }
36634 }
36646 }
36648 /* OpenMP 2.5:
36649 #pragma omp for for-clause[optseq] new-line
36650 for-loop
36652 OpenMP 4.0:
36653 #pragma omp for simd for-simd-clause[optseq] new-line
36654 for-loop */
36656 #define OMP_FOR_CLAUSE_MASK \
36657 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36658 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36660 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36661 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36662 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
36663 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
36664 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36665 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36667 static tree
36671 {
36678 /* parallel for{, simd} disallows nowait clause, but for
36679 target {teams distribute ,}parallel for{, simd} it should be accepted. */
36682 /* Composite distribute parallel for{, simd} disallows ordered clause. */
36687 {
36692 {
36716 }
36717 }
36719 {
36722 }
36724 /* Composite distribute parallel for disallows linear clause. */
36731 {
36734 }
36746 }
36751 /* OpenMP 2.5:
36752 # pragma omp master new-line
36753 structured-block */
36755 static tree
36759 {
36767 {
36772 {
36790 }
36791 }
36793 {
36796 }
36799 {
36803 }
36804 else
36809 }
36811 /* OpenMP 2.5:
36812 # pragma omp ordered new-line
36813 structured-block
36815 OpenMP 4.5:
36816 # pragma omp ordered ordered-clauses new-line
36817 structured-block */
36819 #define OMP_ORDERED_CLAUSE_MASK \
36820 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
36821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
36823 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
36824 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
36826 static bool
36829 {
36833 {
36838 {
36840 {
36843 }
36845 {
36847 "%<depend%> clause may only be used in compound "
36851 }
36852 tree clauses
36854 OMP_ORDERED_DEPEND_CLAUSE_MASK,
36858 }
36859 }
36861 tree clauses
36872 }
36874 /* OpenMP 2.5:
36876 section-scope:
36877 { section-sequence }
36879 section-sequence:
36880 section-directive[opt] structured-block
36881 section-sequence section-directive structured-block */
36883 static tree
36885 {
36890 matching_braces braces;
36898 {
36902 }
36905 {
36913 {
36917 }
36919 {
36922 }
36927 }
36938 }
36940 /* OpenMP 2.5:
36941 # pragma omp sections sections-clause[optseq] newline
36942 sections-scope */
36944 #define OMP_SECTIONS_CLAUSE_MASK \
36945 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36946 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36947 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36948 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36949 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36951 static tree
36954 {
36966 {
36969 }
36976 }
36978 /* OpenMP 2.5:
36979 # pragma omp parallel parallel-clause[optseq] new-line
36980 structured-block
36981 # pragma omp parallel for parallel-for-clause[optseq] new-line
36982 structured-block
36983 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
36984 structured-block
36986 OpenMP 4.0:
36987 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
36988 structured-block */
36990 #define OMP_PARALLEL_CLAUSE_MASK \
36991 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36992 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36993 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36994 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
36995 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36996 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
36997 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36998 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
36999 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
37001 static tree
37005 {
37012 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
37018 {
37026 if_p);
37030 if_p);
37033 block);
37038 }
37039 /* When combined with distribute, parallel has to be followed by for.
37040 #pragma omp target parallel is allowed though. */
37044 {
37048 }
37050 {
37054 {
37065 block);
37070 }
37072 {
37075 }
37077 {
37087 block);
37090 }
37091 }
37093 {
37096 }
37101 {
37104 }
37112 }
37114 /* OpenMP 2.5:
37115 # pragma omp single single-clause[optseq] new-line
37116 structured-block */
37118 #define OMP_SINGLE_CLAUSE_MASK \
37119 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
37122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37124 static tree
37126 {
37137 }
37139 /* OpenMP 3.0:
37140 # pragma omp task task-clause[optseq] new-line
37141 structured-block */
37143 #define OMP_TASK_CLAUSE_MASK \
37144 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37145 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37146 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37147 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37148 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37150 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37151 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37152 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37153 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
37154 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
37156 static tree
37158 {
37169 }
37171 /* OpenMP 3.0:
37172 # pragma omp taskwait new-line
37174 OpenMP 5.0:
37175 # pragma omp taskwait taskwait-clause[opt] new-line */
37177 #define OMP_TASKWAIT_CLAUSE_MASK \
37178 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
37180 static void
37182 {
37183 tree clauses
37188 {
37195 }
37196 else
37198 }
37200 /* OpenMP 3.1:
37201 # pragma omp taskyield new-line */
37203 static void
37205 {
37208 }
37210 /* OpenMP 4.0:
37211 # pragma omp taskgroup new-line
37212 structured-block
37214 OpenMP 5.0:
37215 # pragma omp taskgroup taskgroup-clause[optseq] new-line */
37217 #define OMP_TASKGROUP_CLAUSE_MASK \
37218 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASK_REDUCTION))
37220 static tree
37222 {
37223 tree clauses
37228 if_p),
37229 clauses);
37230 }
37233 /* OpenMP 2.5:
37234 # pragma omp threadprivate (variable-list) */
37236 static void
37238 {
37239 tree vars;
37245 }
37247 /* OpenMP 4.0:
37248 # pragma omp cancel cancel-clause[optseq] new-line */
37250 #define OMP_CANCEL_CLAUSE_MASK \
37251 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
37252 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
37253 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
37254 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
37255 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
37257 static void
37259 {
37263 }
37265 /* OpenMP 4.0:
37266 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
37268 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
37269 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
37270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
37271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
37272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
37274 static void
37277 {
37278 tree clauses;
37282 {
37287 {
37290 }
37291 }
37293 {
37297 }
37300 {
37305 else
37309 }
37312 OMP_CANCELLATION_POINT_CLAUSE_MASK,
37314 pragma_tok);
37316 }
37318 /* OpenMP 4.0:
37319 #pragma omp distribute distribute-clause[optseq] new-line
37320 for-loop */
37322 #define OMP_DISTRIBUTE_CLAUSE_MASK \
37323 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37324 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37325 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37326 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
37327 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
37329 static tree
37333 {
37342 {
37350 else
37353 {
37359 {
37363 else
37366 }
37372 else
37386 }
37387 }
37389 {
37392 }
37397 {
37400 }
37412 }
37414 /* OpenMP 4.0:
37415 # pragma omp teams teams-clause[optseq] new-line
37416 structured-block */
37418 #define OMP_TEAMS_CLAUSE_MASK \
37419 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37420 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37421 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37422 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
37423 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
37424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
37425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
37427 static tree
37431 {
37440 {
37444 {
37470 }
37471 }
37473 {
37476 }
37481 {
37484 }
37494 }
37496 /* OpenMP 4.0:
37497 # pragma omp target data target-data-clause[optseq] new-line
37498 structured-block */
37500 #define OMP_TARGET_DATA_CLAUSE_MASK \
37501 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37502 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
37506 static tree
37508 {
37509 tree clauses
37514 {
37517 {
37534 "%<#pragma omp target data%> with map-type other "
37535 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
37539 }
37543 }
37546 {
37549 "%<#pragma omp target data%> must contain at least "
37552 }
37563 }
37565 /* OpenMP 4.5:
37566 # pragma omp target enter data target-enter-data-clause[optseq] new-line
37567 structured-block */
37569 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
37570 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37571 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37572 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37573 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37574 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37576 static tree
37579 {
37582 {
37587 {
37590 }
37591 }
37593 {
37597 }
37600 {
37606 }
37608 tree clauses
37613 {
37616 {
37629 "%<#pragma omp target enter data%> with map-type other "
37633 }
37635 }
37638 {
37641 "%<#pragma omp target enter data%> must contain at least "
37644 }
37651 }
37653 /* OpenMP 4.5:
37654 # pragma omp target exit data target-enter-data-clause[optseq] new-line
37655 structured-block */
37657 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
37658 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37660 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37661 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37662 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37664 static tree
37667 {
37670 {
37675 {
37678 }
37679 }
37681 {
37685 }
37688 {
37694 }
37696 tree clauses
37701 {
37704 {
37718 "%<#pragma omp target exit data%> with map-type other "
37719 "than %<from%>, %<release%> or %<delete%> on %<map%>"
37723 }
37725 }
37728 {
37731 "%<#pragma omp target exit data%> must contain at least "
37734 }
37741 }
37743 /* OpenMP 4.0:
37744 # pragma omp target update target-update-clause[optseq] new-line */
37746 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
37747 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
37748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37754 static bool
37757 {
37759 {
37765 }
37767 tree clauses
37772 {
37774 "%<#pragma omp target update%> must contain at least one "
37777 }
37785 }
37787 /* OpenMP 4.0:
37788 # pragma omp target target-clause[optseq] new-line
37789 structured-block */
37791 #define OMP_TARGET_CLAUSE_MASK \
37792 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37793 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
37797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
37800 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
37802 static bool
37805 {
37809 omp_requires_mask
37813 {
37825 {
37833 {
37834 tree stmt;
37836 {
37839 OMP_TARGET_CLAUSE_MASK,
37844 OMP_TARGET_CLAUSE_MASK,
37849 OMP_TARGET_CLAUSE_MASK,
37854 }
37856 }
37861 {
37865 if_p);
37870 if_p);
37875 if_p);
37879 }
37885 {
37886 /* For combined target teams, ensure the num_teams and
37887 thread_limit clause expressions are evaluated on the host,
37888 before entering the target construct. */
37889 tree c;
37895 {
37904 OMP_CLAUSE_FIRSTPRIVATE);
37909 }
37910 }
37920 }
37922 {
37925 }
37927 {
37931 }
37933 {
37937 }
37939 {
37943 }
37945 {
37948 }
37949 }
37951 {
37954 }
37969 check_clauses:
37971 {
37974 {
37988 "%<#pragma omp target%> with map-type other "
37989 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
37993 }
37995 }
37997 }
37999 /* OpenACC 2.0:
38000 # pragma acc cache (variable-list) new-line
38001 */
38003 static tree
38005 {
38020 }
38022 /* OpenACC 2.0:
38023 # pragma acc data oacc-data-clause[optseq] new-line
38024 structured-block */
38026 #define OACC_DATA_CLAUSE_MASK \
38027 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38031 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38032 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38033 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
38035 static tree
38037 {
38050 }
38052 /* OpenACC 2.0:
38053 # pragma acc host_data <clauses> new-line
38054 structured-block */
38056 #define OACC_HOST_DATA_CLAUSE_MASK \
38057 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
38059 static tree
38061 {
38074 }
38076 /* OpenACC 2.0:
38077 # pragma acc declare oacc-data-clause[optseq] new-line
38078 */
38080 #define OACC_DECLARE_CLAUSE_MASK \
38081 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38082 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38083 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38084 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38085 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
38087 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
38088 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
38090 static tree
38092 {
38101 {
38105 }
38108 {
38112 {
38116 }
38119 {
38131 {
38133 "%qD must be a global variable in "
38135 decl);
38138 }
38143 {
38147 }
38149 {
38151 "invalid use of %<extern%> variable %qD "
38155 }
38157 {
38159 "invalid use of %<global%> variable %qD "
38163 }
38165 }
38170 {
38175 }
38178 {
38179 tree id;
38183 else
38189 {
38192 {
38195 {
38199 }
38200 }
38201 }
38202 }
38203 }
38216 }
38218 /* OpenACC 2.0:
38219 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
38221 or
38223 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
38225 LOC is the location of the #pragma token.
38226 */
38228 #define OACC_ENTER_DATA_CLAUSE_MASK \
38229 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38231 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38232 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38233 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38235 #define OACC_EXIT_DATA_CLAUSE_MASK \
38236 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38237 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38238 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38239 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
38240 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
38241 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38243 static tree
38246 {
38255 {
38260 }
38267 else
38272 {
38276 }
38284 }
38286 /* OpenACC 2.0:
38287 # pragma acc loop oacc-loop-clause[optseq] new-line
38288 structured-block */
38290 #define OACC_LOOP_CLAUSE_MASK \
38291 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
38292 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
38293 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
38294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
38295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
38296 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
38297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
38298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
38299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
38300 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
38302 static tree
38305 {
38314 {
38320 }
38329 }
38331 /* OpenACC 2.0:
38332 # pragma acc kernels oacc-kernels-clause[optseq] new-line
38333 structured-block
38335 or
38337 # pragma acc parallel oacc-parallel-clause[optseq] new-line
38338 structured-block
38339 */
38341 #define OACC_KERNELS_CLAUSE_MASK \
38342 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38345 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
38348 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38349 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38350 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
38351 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
38352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
38353 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
38354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38356 #define OACC_PARALLEL_CLAUSE_MASK \
38357 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38359 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38362 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
38363 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38364 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
38365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
38367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
38368 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
38369 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
38370 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
38371 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
38372 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38374 static tree
38377 {
38378 omp_clause_mask mask;
38381 {
38394 }
38397 {
38401 {
38404 tree clauses;
38406 if_p);
38408 }
38409 }
38418 }
38420 /* OpenACC 2.0:
38421 # pragma acc update oacc-update-clause[optseq] new-line
38422 */
38424 #define OACC_UPDATE_CLAUSE_MASK \
38425 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
38427 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
38428 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38429 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
38430 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
38432 static tree
38434 {
38441 {
38443 "%<#pragma acc update%> must contain at least one "
38446 }
38454 }
38456 /* OpenACC 2.0:
38457 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
38459 LOC is the location of the #pragma token.
38460 */
38462 #define OACC_WAIT_CLAUSE_MASK \
38463 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
38465 static tree
38467 {
38481 }
38483 /* OpenMP 4.0:
38484 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
38486 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
38487 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
38488 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
38489 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
38490 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
38491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
38492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
38494 static void
38497 {
38499 cp_omp_declare_simd_data data;
38501 {
38506 /* It is safe to take the address of a local variable; it will only be
38507 used while this scope is live. */
38509 }
38511 /* Store away all pragma tokens. */
38523 {
38527 {
38540 }
38545 "%<#pragma omp declare simd%> not immediately followed by "
38549 }
38550 }
38552 /* Finalize #pragma omp declare simd clauses after direct declarator has
38553 been parsed, and put that into "omp declare simd" attribute. */
38555 static tree
38557 {
38563 {
38567 }
38572 {
38590 }
38594 }
38597 /* OpenMP 4.0:
38598 # pragma omp declare target new-line
38599 declarations and definitions
38600 # pragma omp end declare target new-line
38602 OpenMP 4.5:
38603 # pragma omp declare target ( extended-list ) new-line
38605 # pragma omp declare target declare-target-clauses[seq] new-line */
38607 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
38608 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
38609 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
38611 static void
38613 {
38616 clauses
38620 {
38622 clauses);
38625 }
38626 else
38627 {
38631 }
38634 "%<#pragma omp declare target%> with clauses in between "
38635 "%<#pragma omp declare target%> without clauses and "
38638 {
38644 {
38647 }
38648 else
38651 {
38653 "%qD specified both in declare target %<link%> and %<to%>"
38656 }
38658 {
38665 {
38668 {
38672 }
38673 }
38674 }
38675 }
38676 }
38678 static void
38680 {
38683 {
38686 }
38688 {
38692 {
38695 }
38698 else
38699 {
38703 }
38704 }
38705 else
38706 {
38710 }
38714 "%<#pragma omp end declare target%> without corresponding "
38716 else
38718 }
38720 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
38721 expression and optional initializer clause of
38722 #pragma omp declare reduction. We store the expression(s) as
38723 either 3, 6 or 7 special statements inside of the artificial function's
38724 body. The first two statements are DECL_EXPRs for the artificial
38725 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
38726 expression that uses those variables.
38727 If there was any INITIALIZER clause, this is followed by further statements,
38728 the fourth and fifth statements are DECL_EXPRs for the artificial
38729 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
38730 constructor variant (first token after open paren is not omp_priv),
38731 then the sixth statement is a statement with the function call expression
38732 that uses the OMP_PRIV and optionally OMP_ORIG variable.
38733 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
38734 to initialize the OMP_PRIV artificial variable and there is seventh
38735 statement, a DECL_EXPR of the OMP_PRIV statement again. */
38737 static bool
38739 {
38751 tree combiner;
38766 {
38769 }
38772 {
38774 matching_parens parens;
38780 {
38783 }
38799 {
38803 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
38807 == CPP_CLOSE_PAREN
38810 {
38814 }
38819 }
38820 else
38821 {
38837 {
38842 }
38844 tree arg;
38857 }
38868 }
38872 UNKNOWN_LOCATION);
38875 }
38877 /* OpenMP 4.0
38878 #pragma omp declare reduction (reduction-id : typename-list : expression) \
38879 initializer-clause[opt] new-line
38881 initializer-clause:
38882 initializer (omp_priv initializer)
38883 initializer (function-name (argument-list)) */
38885 static void
38888 {
38898 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
38905 {
38937 }
38949 /* Types may not be defined in declare reduction type list. */
38952 parser->type_definition_forbidden_message
38958 saved_colon_doesnt_start_class_def_p
38963 {
38967 ;
38986 else
38991 else
38993 }
38995 /* Restore the saved message. */
38998 parser->colon_doesnt_start_class_def_p
39003 {
39004 fail:
39007 }
39013 {
39014 tree fntype
39017 NULL_TREE);
39037 {
39042 }
39044 {
39046 {
39055 }
39062 }
39063 else
39064 {
39067 }
39070 else
39073 {
39076 }
39078 {
39081 else
39086 }
39091 else
39092 {
39101 }
39108 }
39112 done:
39113 /* Free any declarators allocated. */
39115 }
39117 /* OpenMP 4.0
39118 #pragma omp declare simd declare-simd-clauses[optseq] new-line
39119 #pragma omp declare reduction (reduction-id : typename-list : expression) \
39120 initializer-clause[opt] new-line
39121 #pragma omp declare target new-line */
39123 static bool
39126 {
39128 {
39133 {
39136 context);
39138 }
39141 {
39144 context);
39146 }
39148 {
39151 }
39153 {
39157 }
39158 }
39163 }
39165 /* OpenMP 5.0
39166 #pragma omp requires clauses[optseq] new-line */
39168 static bool
39170 {
39176 {
39183 {
39198 {
39201 matching_parens parens;
39203 {
39205 {
39210 this_req
39213 this_req
39216 this_req
39218 }
39220 {
39222 "expected %<seq_cst%>, %<relaxed%> or "
39225 CPP_CLOSE_PAREN))
39227 }
39228 else
39235 /*consume_paren=*/
39239 {
39242 }
39243 }
39245 }
39246 else
39247 {
39249 "%<unified_shared_memory%>, "
39250 "%<dynamic_allocators%>, "
39251 "%<reverse_offload%> "
39255 }
39262 {
39264 {
39271 }
39273 {
39277 }
39280 {
39283 this_req
39285 (omp_requires_mask
39287 }
39291 "lexically after first %<atomic%> construct "
39294 omp_requires_mask
39297 }
39298 }
39300 }
39306 }
39309 /* OpenMP 4.5:
39310 #pragma omp taskloop taskloop-clause[optseq] new-line
39311 for-loop
39313 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
39314 for-loop */
39316 #define OMP_TASKLOOP_CLAUSE_MASK \
39317 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
39318 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
39319 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
39320 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
39321 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
39322 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
39323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
39324 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
39325 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
39326 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
39327 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
39328 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
39329 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
39330 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
39331 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
39332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
39334 static tree
39338 {
39345 /* #pragma omp parallel master taskloop{, simd} disallow in_reduction
39346 clause. */
39351 {
39356 {
39380 }
39381 }
39383 {
39386 }
39391 {
39394 }
39401 if_p);
39407 }
39410 /* OpenACC 2.0:
39411 # pragma acc routine oacc-routine-clause[optseq] new-line
39412 function-definition
39414 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
39415 */
39417 #define OACC_ROUTINE_CLAUSE_MASK \
39418 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
39419 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
39420 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
39421 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
39424 /* Parse the OpenACC routine pragma. This has an optional '( name )'
39425 component, which must resolve to a declared namespace-scope
39426 function. The clauses are either processed directly (for a named
39427 function), or defered until the immediatley following declaration
39428 is parsed. */
39430 static void
39433 {
39435 /* The checking for "another pragma following this one" in the "no optional
39436 '( name )'" case makes sure that we dont re-enter. */
39439 cp_oacc_routine_data data;
39445 /* It is safe to take the address of a local variable; it will only be
39446 used while this scope is live. */
39449 /* Look for optional '( name )'. */
39451 {
39452 matching_parens parens;
39455 /* We parse the name as an id-expression. If it resolves to
39456 anything other than a non-overloaded function at namespace
39457 scope, it's an error. */
39473 {
39477 }
39479 data.clauses
39487 {
39492 }
39494 /* Perhaps we should use the same rule as declarations in different
39495 namespaces? */
39497 {
39502 }
39505 {
39509 }
39513 }
39515 {
39516 /* Store away all pragma tokens. */
39527 /* Emit a helpful diagnostic if there's another pragma following this
39528 one. */
39530 {
39533 /* ..., and then just keep going. */
39535 }
39537 /* We only have to consider the pragma_external case here. */
39542 else
39545 }
39546 }
39548 /* Finalize #pragma acc routine clauses after direct declarator has
39549 been parsed. */
39551 static tree
39553 {
39558 {
39560 "%<#pragma acc routine%> not immediately followed by "
39563 }
39580 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
39581 fndecl_seen. */
39584 }
39586 /* Apply any saved OpenACC routine clauses to a just-parsed
39587 declaration. */
39589 static void
39591 {
39593 {
39594 /* Keep going if we're in error reporting mode. */
39600 {
39602 "%<#pragma acc routine%> not immediately followed by"
39606 }
39608 {
39611 }
39614 {
39619 }
39622 {
39630 }
39632 /* Process the routine's dimension clauses. */
39636 /* Add an "omp declare target" attribute. */
39641 /* Don't unset parser->oacc_routine here: we may still need it to
39642 diagnose wrong usage. But, remember that we've used this "#pragma acc
39643 routine". */
39645 }
39646 }
39648 /* Main entry point to OpenMP statement pragmas. */
39650 static void
39652 {
39653 tree stmt;
39658 {
39681 if_p);
39686 if_p);
39703 if_p);
39708 if_p);
39713 if_p);
39718 if_p);
39727 if_p);
39741 if_p);
39746 if_p);
39750 }
39753 }
39754 \f
39755 /* Transactional Memory parsing routines. */
39757 /* Parse a transaction attribute.
39759 txn-attribute:
39760 attribute
39761 [ [ identifier ] ]
39763 We use this instead of cp_parser_attributes_opt for transactions to avoid
39764 the pedwarn in C++98 mode. */
39766 static tree
39768 {
39783 {
39787 /* For keywords, use the canonical spelling,
39788 not the parsed identifier. */
39792 }
39793 else
39797 error1:
39800 }
39802 /* Parse a __transaction_atomic or __transaction_relaxed statement.
39804 transaction-statement:
39805 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
39806 compound-statement
39807 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
39808 */
39810 static tree
39812 {
39823 else
39824 {
39828 }
39830 /* Parse a noexcept specification. */
39834 {
39835 /* cancel-and-throw is unimplemented. */
39838 }
39839 else
39842 /* Keep track if we're in the lexical scope of an outer transaction. */
39854 }
39856 /* Parse a __transaction_atomic or __transaction_relaxed expression.
39858 transaction-expression:
39859 __transaction_atomic txn-noexcept-spec[opt] ( expression )
39860 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
39861 */
39863 static tree
39865 {
39878 keyword == RID_TRANSACTION_RELAXED
39892 /* Set this early. This might mean that we allow transaction_cancel in
39893 an expression that we find out later actually has to be a constexpr.
39894 However, we expect that cxx_constant_value will be able to deal with
39895 this; also, if the noexcept has no constexpr, then what we parse next
39896 really is a transaction's body. */
39899 /* Parse a noexcept specification. */
39905 {
39906 matching_parens parens;
39913 }
39914 else
39915 {
39916 /* The only expression that is available got parsed for the noexcept
39917 already. noexcept is true then. */
39920 }
39929 }
39931 /* Parse a function-transaction-block.
39933 function-transaction-block:
39934 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
39935 function-body
39936 __transaction_atomic txn-attribute[opt] function-try-block
39937 __transaction_relaxed ctor-initializer[opt] function-body
39938 __transaction_relaxed function-try-block
39939 */
39941 static void
39943 {
39958 else
39959 {
39963 }
39971 else
39972 cp_parser_ctor_initializer_opt_and_function_body
39978 }
39980 /* Parse a __transaction_cancel statement.
39982 cancel-statement:
39983 __transaction_cancel txn-attribute[opt] ;
39984 __transaction_cancel txn-attribute[opt] throw-expression ;
39986 ??? Cancel and throw is not yet implemented. */
39988 static tree
39990 {
39996 RT_TRANSACTION_CANCEL);
40003 /* ??? Parse cancel-and-throw here. */
40008 {
40012 }
40014 {
40018 }
40020 {
40023 {
40029 }
40030 }
40032 {
40036 }
40042 }
40043 \f
40044 /* The parser. */
40048 \f
40049 /* Special handling for the first token or line in the file. The first
40050 thing in the file might be #pragma GCC pch_preprocess, which loads a
40051 PCH file, which is a GC collection point. So we need to handle this
40052 first pragma without benefit of an existing lexer structure.
40054 Always returns one token to the caller in *FIRST_TOKEN. This is
40055 either the true first token of the file, or the first token after
40056 the initial pragma. */
40058 static void
40060 {
40069 {
40076 }
40077 else
40080 /* Skip to the end of the pragma. */
40084 /* Now actually load the PCH file. */
40088 /* Read one more token to return to our caller. We have to do this
40089 after reading the PCH file in, since its pointers have to be
40090 live. */
40092 }
40094 /* Parse a pragma GCC ivdep. */
40096 static bool
40098 {
40101 }
40103 /* Parse a pragma GCC unroll. */
40105 static unsigned short
40107 {
40117 {
40119 " assignment-expression that evaluates to a non-negative"
40122 }
40123 else
40124 {
40128 }
40131 }
40133 /* Normal parsing of a pragma token. Here we can (and must) use the
40134 regular lexer. */
40136 static bool
40138 {
40141 tree stmt;
40152 {
40160 {
40170 }
40175 {
40185 }
40190 {
40200 }
40205 {
40216 }
40221 {
40232 }
40237 {
40248 }
40268 {
40273 }
40281 {
40286 }
40294 {
40298 }
40304 {
40309 }
40317 {
40322 }
40380 "%<#pragma omp section%> may only be used in "
40385 {
40387 {
40391 }
40397 {
40401 }
40402 else
40408 {
40411 }
40414 }
40417 {
40419 {
40423 }
40424 const unsigned short unroll
40430 {
40434 }
40435 else
40441 {
40444 }
40447 }
40454 bad_stmt:
40457 }
40461 }
40463 /* The interface the pragma parsers have to the lexer. */
40465 enum cpp_ttype
40467 {
40479 else
40480 {
40484 }
40487 }
40489 \f
40490 /* External interface. */
40492 /* Parse one entire translation unit. */
40494 void
40496 {
40511 }
40513 /* Create an identifier for a generic parameter type (a synthesized
40514 template parameter implied by `auto' or a concept identifier). */
40517 static tree
40519 {
40523 }
40525 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
40526 (creating a new template parameter list if necessary). Returns the newly
40527 created template type parm. */
40529 static tree
40531 {
40534 /* Before committing to modifying any scope, if we're in an
40535 implicit template scope, and we're trying to synthesize a
40536 constrained parameter, try to find a previous parameter with
40537 the same name. This is the same-type rule for abbreviated
40538 function templates.
40540 NOTE: We can generate implicit parameters when tentatively
40541 parsing a nested name specifier, only to reject that parse
40542 later. However, matching the same template-id as part of a
40543 direct-declarator should generate an identical template
40544 parameter, so this rule will merge them. */
40546 {
40549 {
40551 {
40554 /* Return the TEMPLATE_PARM_INDEX. */
40557 }
40559 }
40560 }
40562 /* We are either continuing a function template that already contains implicit
40563 template parameters, creating a new fully-implicit function template, or
40564 extending an existing explicit function template with implicit template
40565 parameters. */
40573 {
40577 }
40578 else
40579 {
40580 /* Roll back to the existing template parameter scope (in the case of
40581 extending an explicit function template) or introduce a new template
40582 parameter scope ahead of the function parameter scope (or class scope
40583 in the case of out-of-line member definitions). The function scope is
40584 added back after template parameter synthesis below. */
40589 {
40592 }
40594 {
40595 /* If not defining a class, then any class scope is a scope level in
40596 an out-of-line member definition. In this case simply wind back
40597 beyond the first such scope to inject the template parameter list.
40598 Otherwise wind back to the class being defined. The latter can
40599 occur in class member friend declarations such as:
40601 class A {
40602 void foo (auto);
40603 };
40604 class B {
40605 friend void A::foo (auto);
40606 };
40608 The template parameter list synthesized for the friend declaration
40609 must be injected in the scope of 'B'. This can also occur in
40610 erroneous cases such as:
40612 struct A {
40613 struct B {
40614 void foo (auto);
40615 };
40616 void B::foo (auto) {}
40617 };
40619 Here the attempted definition of 'B::foo' within 'A' is ill-formed
40620 but, nevertheless, the template parameter list synthesized for the
40621 declarator should be injected into the scope of 'A' as if the
40622 ill-formed template was specified explicitly. */
40625 {
40628 }
40629 }
40635 {
40636 /* Introduce a new template parameter list for implicit template
40637 parameters. */
40641 parser->implicit_template_scope
40648 }
40649 else
40650 {
40651 /* Synthesize implicit template parameters at the end of the explicit
40652 template parameter list. */
40659 parser->implicit_template_parms
40661 }
40662 }
40664 /* Synthesize a new template parameter and track the current template
40665 parameter chain with implicit_template_parms. */
40669 tree synth_tmpl_parm;
40673 synth_tmpl_parm
40676 synth_tmpl_parm
40678 else
40679 {
40683 }
40685 // Attach the constraint to the parm before processing.
40688 tree new_parm
40690 input_location,
40691 node,
40695 // Chain the new parameter to the list of implicit parameters.
40697 parser->implicit_template_parms
40699 else
40704 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
40707 /* If creating a fully implicit function template, start the new implicit
40708 template parameter list with this synthesized type, otherwise grow the
40709 current template parameter list. */
40712 {
40719 }
40720 else
40721 {
40726 }
40728 // If the new parameter was constrained, we need to add that to the
40729 // constraints in the template parameter list.
40731 {
40735 }
40740 }
40742 /* Finish the declaration of a fully implicit function template. Such a
40743 template has no explicit template parameter list so has not been through the
40744 normal template head and tail processing. synthesize_implicit_template_parm
40745 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
40746 provided if the declaration is a class member such that its template
40747 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
40748 form is returned. Otherwise NULL_TREE is returned. */
40750 static tree
40752 {
40757 {
40761 }
40773 }
40775 /* Like finish_fully_implicit_template, but to be used in error
40776 recovery, rearranging scopes so that we restore the state we had
40777 before synthesize_implicit_template_parm inserted the implement
40778 template parms scope. */
40780 static void
40782 {
40787 {
40796 }
40797 else
40803 }
40805 /* Helper function for diagnostics that have complained about things
40806 being used with 'extern "C"' linkage.
40808 Attempt to issue a note showing where the 'extern "C"' linkage began. */
40810 void
40812 {
40816 }