| blob | 465ab8fdbaed0efbaa68a8583dac908ce6c72f9e |
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;
10179 {
10181 {
10185 }
10187 }
10189 {
10191 {
10194 }
10196 }
10198 /* We may be in the middle of deferred access check. Disable
10199 it now. */
10210 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10213 /* Now that we've started the type, add the capture fields for any
10214 explicit captures. */
10217 {
10218 /* Inside the class, surrounding template-parameter-lists do not apply. */
10219 unsigned int saved_num_template_parameter_lists
10223 bool fully_implicit_function_template_p
10227 bool auto_is_implicit_function_template_parm_p
10238 /* By virtue of defining a local class, a lambda expression has access to
10239 the private variables of enclosing classes. */
10247 {
10252 }
10254 {
10257 }
10259 /* The capture list was built up in reverse order; fix that now. */
10271 parser->fully_implicit_function_template_p
10275 parser->auto_is_implicit_function_template_parm_p
10277 }
10279 /* This field is only used during parsing of the lambda. */
10282 /* This lambda shouldn't have any proxies left at this point. */
10284 /* And now that we're done, push proxies for an enclosing lambda. */
10287 /* Update the lambda expression to a range. */
10295 else
10303 }
10305 /* Parse the beginning of a lambda expression.
10307 lambda-introducer:
10308 [ lambda-capture [opt] ]
10310 LAMBDA_EXPR is the current representation of the lambda expression. */
10312 static void
10314 {
10315 /* Need commas after the first capture. */
10318 /* Eat the leading `['. */
10321 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10329 {
10335 }
10338 {
10340 tree capture_id;
10341 tree capture_init_expr;
10345 enum capture_kind_type
10346 {
10347 BY_COPY,
10348 BY_REFERENCE
10349 };
10353 {
10356 }
10360 else
10363 /* Possibly capture `this'. */
10365 {
10376 explicit_init_p);
10378 }
10380 /* Possibly capture `*this'. */
10383 {
10394 explicit_init_p);
10396 }
10398 /* Remember whether we want to capture as a reference or not. */
10400 {
10403 }
10405 /* Get the identifier. */
10410 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10411 delimiters, but I modified this to stop on unnested ']' as well. It
10412 was already changed to stop on unnested '}', so the
10413 "closing_parenthesis" name is no more misleading with my change. */
10414 {
10420 }
10422 /* Find the initializer for this capture. */
10426 {
10428 /* An explicit initializer exists. */
10431 "lambda capture initializers "
10437 {
10440 }
10441 }
10442 else
10443 {
10446 /* Turn the identifier into an id-expression. */
10447 capture_init_expr
10452 {
10455 }
10458 {
10461 capture_init_expr);
10466 }
10469 {
10472 capture_init_expr))
10476 }
10478 capture_init_expr
10479 = finish_id_expression
10481 capture_init_expr,
10495 {
10498 }
10499 }
10503 {
10508 capture_id);
10512 "capture of %qD redundant with by-reference capture "
10514 }
10517 capture_id,
10518 capture_init_expr,
10520 explicit_init_p);
10522 /* If there is any qualification still in effect, clear it
10523 now; we will be starting fresh with the next capture. */
10527 }
10530 }
10532 /* Parse the (optional) middle of a lambda expression.
10534 lambda-declarator:
10535 < template-parameter-list [opt] >
10536 ( parameter-declaration-clause [opt] )
10537 attribute-specifier [opt]
10538 decl-specifier-seq [opt]
10539 exception-specification [opt]
10540 lambda-return-type-clause [opt]
10542 LAMBDA_EXPR is the current representation of the lambda expression. */
10544 static bool
10546 {
10547 /* 5.1.1.4 of the standard says:
10548 If a lambda-expression does not include a lambda-declarator, it is as if
10549 the lambda-declarator were ().
10550 This means an empty parameter list, no attributes, and no exception
10551 specification. */
10558 cp_decl_specifier_seq lambda_specs;
10561 /* The template-parameter-list is optional, but must begin with
10562 an opening angle if present. */
10564 {
10567 "lambda templates are only available with "
10571 "lambda templates are only available with "
10580 /* We just processed one more parameter list. */
10582 }
10584 /* The parameter-declaration-clause is optional (unless
10585 template-parameter-list was given), but must begin with an
10586 opening parenthesis if present. */
10588 {
10589 matching_parens parens;
10594 /* Parse parameters. */
10597 /* Default arguments shall not be specified in the
10598 parameter-declaration-clause of a lambda-declarator. */
10607 /* In the decl-specifier-seq of the lambda-declarator, each
10608 decl-specifier shall either be mutable or constexpr. */
10612 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10615 {
10620 }
10624 /* Parse optional exception specification. */
10629 /* Parse optional trailing return type. */
10631 {
10634 }
10636 /* The function parameters must be in scope all the way until after the
10637 trailing-return-type in case of decltype. */
10639 }
10643 /* Create the function call operator.
10645 Messing with declarators like this is no uglier than building up the
10646 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10647 other code. */
10648 {
10649 cp_decl_specifier_seq return_type_specs;
10651 tree fco;
10659 {
10663 else
10666 }
10675 VIRT_SPEC_UNSPECIFIED,
10676 REF_QUAL_NONE,
10677 tx_qual,
10678 exception_spec,
10679 return_type,
10685 declarator,
10686 NULL_TREE);
10688 {
10691 /* Give the object parameter a different name. */
10694 }
10696 {
10700 }
10709 }
10710 }
10712 /* Parse the body of a lambda expression, which is simply
10714 compound-statement
10716 but which requires special handling.
10717 LAMBDA_EXPR is the current representation of the lambda expression. */
10719 static void
10721 {
10728 else
10729 /* Still increment function_depth so that we don't GC in the
10730 middle of an expression. */
10735 /* Clear this in case we're in the middle of a default argument. */
10739 {
10743 matching_braces braces;
10746 {
10749 /* Originally C++11 required us to peek for 'return expr'; and
10750 process it specially here to deduce the return type. N3638
10751 removed the need for that. */
10759 }
10762 }
10769 else
10771 }
10773 /* Statements [gram.stmt.stmt] */
10775 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10777 static void
10779 {
10783 /* A concept is never expanded normally. */
10789 }
10791 /* Parse a statement.
10793 statement:
10794 labeled-statement
10795 expression-statement
10796 compound-statement
10797 selection-statement
10798 iteration-statement
10799 jump-statement
10800 declaration-statement
10801 try-block
10803 C++11:
10805 statement:
10806 labeled-statement
10807 attribute-specifier-seq (opt) expression-statement
10808 attribute-specifier-seq (opt) compound-statement
10809 attribute-specifier-seq (opt) selection-statement
10810 attribute-specifier-seq (opt) iteration-statement
10811 attribute-specifier-seq (opt) jump-statement
10812 declaration-statement
10813 attribute-specifier-seq (opt) try-block
10815 init-statement:
10816 expression-statement
10817 simple-declaration
10819 TM Extension:
10821 statement:
10822 atomic-statement
10824 IN_COMPOUND is true when the statement is nested inside a
10825 cp_parser_compound_statement; this matters for certain pragmas.
10827 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10828 is a (possibly labeled) if statement which is not enclosed in braces
10829 and has an else clause. This is used to implement -Wparentheses.
10831 CHAIN is a vector of if-else-if conditions. */
10833 static void
10837 {
10842 restart:
10845 /* There is no statement yet. */
10851 /* In obj-c++, seeing '[[' might be the either the beginning of
10852 c++11 attributes, or a nested objc-message-expression. So
10853 let's parse the c++11 attributes tentatively. */
10857 {
10860 }
10862 /* Peek at the next token. */
10864 /* Remember the location of the first token in the statement. */
10867 /* If this is a keyword, then that will often determine what kind of
10868 statement we have. */
10870 {
10874 {
10877 /* Looks like a labeled-statement with a case label.
10878 Parse the label, and then use tail recursion to parse
10879 the statement. */
10902 /* Objective-C++ exception-handling constructs. */
10916 /* This must be a namespace alias definition. */
10932 /* It might be a keyword like `int' that can start a
10933 declaration-statement. */
10935 }
10936 }
10938 {
10939 /* If the next token is a `:', then we are looking at a
10940 labeled-statement. */
10943 {
10944 /* Looks like a labeled-statement with an ordinary label.
10945 Parse the label, and then use tail recursion to parse
10946 the statement. */
10951 }
10952 }
10953 /* Anything that starts with a `{' must be a compound-statement. */
10956 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10957 a statement all its own. */
10959 {
10960 /* Only certain OpenMP pragmas are attached to statements, and thus
10961 are considered statements themselves. All others are not. In
10962 the context of a compound, accept the pragma as a "statement" and
10963 return so that we can check for a close brace. Otherwise we
10964 require a real statement and must go back and read one. */
10970 }
10972 {
10975 }
10977 /* Everything else must be a declaration-statement or an
10978 expression-statement. Try for the declaration-statement
10979 first, unless we are looking at a `;', in which case we know that
10980 we have an expression-statement. */
10982 {
10984 {
10986 {
10987 /* Attributes should be parsed as part of the the
10988 declaration, so let's un-parse them. */
10991 }
10994 /* Try to parse the declaration-statement. */
10996 /* If that worked, we're done. */
10999 }
11000 /* All preceding labels have been parsed at this point. */
11004 /* Look for an expression-statement instead. */
11007 /* Handle [[fallthrough]];. */
11009 {
11010 /* The next token after the fallthrough attribute is ';'. */
11012 {
11013 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11015 IFN_FALLTHROUGH,
11018 }
11019 else
11023 }
11024 }
11026 /* Set the line number for the statement. */
11030 /* Allow "[[fallthrough]];", but warn otherwise. */
11033 OPT_Wattributes,
11035 }
11037 /* Append ATTR to attribute list ATTRS. */
11039 static tree
11041 {
11047 }
11049 /* Parse the label for a labeled-statement, i.e.
11051 identifier :
11052 case constant-expression :
11053 default :
11055 GNU Extension:
11056 case constant-expression ... constant-expression : statement
11058 When a label is parsed without errors, the label is added to the
11059 parse tree by the finish_* functions, so this function doesn't
11060 have to return the label. */
11062 static void
11064 {
11069 /* The next token should be an identifier. */
11073 {
11076 }
11078 /* Remember whether this case or a user-defined label is allowed to fall
11079 through to. */
11084 {
11086 {
11090 /* Consume the `case' token. */
11092 /* Parse the constant-expression. */
11099 {
11100 /* Consume the `...' token. */
11106 /* We don't need to emit warnings here, as the common code
11107 will do this for us. */
11108 }
11109 else
11113 {
11117 }
11118 else
11121 expr);
11122 }
11126 /* Consume the `default' token. */
11130 {
11134 }
11135 else
11140 /* Anything else must be an ordinary label. */
11145 }
11147 /* Require the `:' token. */
11150 /* An ordinary label may optionally be followed by attributes.
11151 However, this is only permitted if the attributes are then
11152 followed by a semicolon. This is because, for backward
11153 compatibility, when parsing
11154 lab: __attribute__ ((unused)) int i;
11155 we want the attribute to attach to "i", not "lab". */
11158 {
11159 tree attrs;
11166 ;
11167 else
11169 }
11175 }
11177 /* Parse an expression-statement.
11179 expression-statement:
11180 expression [opt] ;
11182 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11183 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11184 indicates whether this expression-statement is part of an
11185 expression statement. */
11187 static tree
11189 {
11194 /* There might be attribute fallthrough. */
11197 /* If the next token is a ';', then there is no expression
11198 statement. */
11200 {
11204 {
11207 }
11208 }
11210 /* Handle [[fallthrough]];. */
11212 {
11213 /* The next token after the fallthrough attribute is ';'. */
11215 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11218 else
11222 }
11224 /* Allow "[[fallthrough]];", but warn otherwise. */
11229 /* Give a helpful message for "A<T>::type t;" and the like. */
11232 {
11239 {
11240 /* A::A a; */
11245 }
11246 }
11248 /* Consume the final `;'. */
11253 /* This is the final expression statement of a statement
11254 expression. */
11260 }
11262 /* Parse a compound-statement.
11264 compound-statement:
11265 { statement-seq [opt] }
11267 GNU extension:
11269 compound-statement:
11270 { label-declaration-seq [opt] statement-seq [opt] }
11272 label-declaration-seq:
11273 label-declaration
11274 label-declaration-seq label-declaration
11276 Returns a tree representing the statement. */
11278 static tree
11281 {
11282 tree compound_stmt;
11283 matching_braces braces;
11285 /* Consume the `{'. */
11292 /* Begin the compound-statement. */
11294 /* If the next keyword is `__label__' we have a label declaration. */
11297 /* Parse an (optional) statement-seq. */
11299 /* Finish the compound-statement. */
11301 /* Consume the `}'. */
11305 }
11307 /* Parse an (optional) statement-seq.
11309 statement-seq:
11310 statement
11311 statement-seq [opt] statement */
11313 static void
11315 {
11316 /* Scan statements until there aren't any more. */
11318 {
11321 /* If we are looking at a `}', then we have run out of
11322 statements; the same is true if we have reached the end
11323 of file, or have stumbled upon a stray '@end'. */
11330 /* If we are in a compound statement and find 'else' then
11331 something went wrong. */
11333 {
11336 else
11337 {
11340 }
11341 }
11343 /* Parse the statement. */
11345 }
11346 }
11348 /* Return true if this is the C++20 version of range-based-for with
11349 init-statement. */
11351 static bool
11353 {
11356 /* Save tokens so that we can put them back. */
11359 /* There has to be an unnested ; followed by an unnested :. */
11362 CPP_SEMICOLON,
11366 /* We found the semicolon, eat it now. */
11369 /* Now look for ':' that is not nested in () or {}. */
11372 CPP_COLON,
11375 out:
11376 /* Roll back the tokens we skipped. */
11380 }
11382 /* Return true if we're looking at (init; cond), false otherwise. */
11384 static bool
11386 {
11387 /* Save tokens so that we can put them back. */
11390 /* Look for ';' that is not nested in () or {}. */
11393 CPP_SEMICOLON,
11396 /* Roll back the tokens we skipped. */
11400 }
11402 /* Parse a selection-statement.
11404 selection-statement:
11405 if ( init-statement [opt] condition ) statement
11406 if ( init-statement [opt] condition ) statement else statement
11407 switch ( init-statement [opt] condition ) statement
11409 Returns the new IF_STMT or SWITCH_STMT.
11411 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11412 is a (possibly labeled) if statement which is not enclosed in
11413 braces and has an else clause. This is used to implement
11414 -Wparentheses.
11416 CHAIN is a vector of if-else-if conditions. This is used to implement
11417 -Wduplicated-cond. */
11419 static tree
11422 {
11425 token_indent_info guard_tinfo;
11430 /* Peek at the next token. */
11434 /* See what kind of keyword it is. */
11437 {
11440 {
11441 tree statement;
11442 tree condition;
11447 RID_CONSTEXPR))
11448 {
11454 }
11456 /* Look for the `('. */
11457 matching_parens parens;
11459 {
11462 }
11464 /* Begin the selection-statement. */
11466 {
11469 }
11470 else
11473 /* Parse the optional init-statement. */
11475 {
11476 tree decl;
11479 "init-statement in selection statements only available "
11482 }
11484 /* Parse the condition. */
11486 /* Look for the `)'. */
11492 {
11496 /* Add the condition. */
11503 /* Parse the then-clause. */
11507 /* Outside a template, the non-selected branch of a constexpr
11508 if is a 'discarded statement', i.e. unevaluated. */
11513 {
11516 }
11519 guard_tinfo);
11526 {
11530 }
11532 /* If the next token is `else', parse the else-clause. */
11534 RID_ELSE))
11535 {
11539 {
11542 }
11544 guard_tinfo
11546 /* Consume the `else' keyword. */
11549 {
11551 RID_IF)
11553 {
11554 /* We've got "if (COND) else if (COND2)". Start
11555 the condition chain and add COND as the first
11556 element. */
11560 {
11561 /* Wrap it in a NOP_EXPR so that we can set the
11562 location of the condition. */
11564 condition);
11567 }
11568 }
11570 RID_IF))
11571 {
11572 /* This is if-else without subsequent if. Zap the
11573 condition chain; we would have already warned at
11574 this point. */
11577 }
11578 }
11580 /* Parse the else-clause. */
11586 /* If we are currently parsing a then-clause, then
11587 IF_P will not be NULL. We set it to true to
11588 indicate that this if statement has an else clause.
11589 This may trigger the Wparentheses warning below
11590 when we get back up to the parent if statement. */
11595 {
11599 }
11600 }
11601 else
11602 {
11603 /* This if statement does not have an else clause. If
11604 NESTED_IF is true, then the then-clause has an if
11605 statement which does have an else clause. We warn
11606 about the potential ambiguity. */
11609 "suggest explicit braces to avoid ambiguous"
11612 {
11613 /* We don't need the condition chain anymore. */
11616 }
11617 }
11619 /* Now we're all done with the if-statement. */
11621 }
11622 else
11623 {
11627 /* Add the condition. */
11630 /* Parse the body of the switch-statement. */
11636 guard_tinfo);
11640 /* Now we're all done with the switch-statement. */
11642 }
11645 }
11651 }
11652 }
11654 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
11655 If we have seen at least one decl-specifier, and the next token
11656 is not a parenthesis, then we must be looking at a declaration.
11657 (After "int (" we might be looking at a functional cast.) */
11659 static void
11662 {
11668 }
11670 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
11671 The declarator shall not specify a function or an array. Returns
11672 TRUE if the declarator is valid, FALSE otherwise. */
11674 static bool
11677 location_t loc)
11678 {
11682 {
11687 else
11695 }
11696 else
11698 }
11700 /* Parse a condition.
11702 condition:
11703 expression
11704 type-specifier-seq declarator = initializer-clause
11705 type-specifier-seq declarator braced-init-list
11707 GNU Extension:
11709 condition:
11710 type-specifier-seq declarator asm-specification [opt]
11711 attributes [opt] = assignment-expression
11713 Returns the expression that should be tested. */
11715 static tree
11717 {
11718 cp_decl_specifier_seq type_specifiers;
11722 /* Try the declaration first. */
11724 /* New types are not allowed in the type-specifier-seq for a
11725 condition. */
11727 parser->type_definition_forbidden_message
11729 /* Parse the type-specifier-seq. */
11731 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11734 /* Restore the saved message. */
11740 /* If all is well, we might be looking at a declaration. */
11742 {
11743 tree decl;
11744 tree asm_specification;
11745 tree attributes;
11750 /* Parse the declarator. */
11756 /* Parse the attributes. */
11758 /* Parse the asm-specification. */
11760 /* If the next token is not an `=' or '{', then we might still be
11761 looking at an expression. For example:
11763 if (A(a).x)
11765 looks like a decl-specifier-seq and a declarator -- but then
11766 there is no `=', so this is an expression. */
11771 /* If we did see an `=' or '{', then we are looking at a declaration
11772 for sure. */
11774 {
11775 tree pushed_scope;
11782 /* Create the declaration. */
11788 /* Parse the initializer. */
11790 {
11794 }
11796 {
11797 /* Consume the `='. */
11801 }
11802 else
11803 {
11806 }
11810 /* Process the initializer. */
11813 asm_specification,
11814 flags);
11820 }
11821 }
11822 /* If we didn't even get past the declarator successfully, we are
11823 definitely not looking at a declaration. */
11824 else
11827 /* Otherwise, we are looking at an expression. */
11829 }
11831 /* Parses a for-statement or range-for-statement until the closing ')',
11832 not included. */
11834 static tree
11836 {
11840 /* Begin the for-statement. */
11843 /* Parse the initialization. */
11849 else
11851 }
11853 static tree
11856 {
11857 /* Normal for loop */
11860 tree stmt;
11863 /* The init-statement has already been parsed in
11864 cp_parser_init_statement, so no work is needed here. */
11867 /* If there's a condition, process it. */
11871 {
11875 }
11877 {
11881 }
11883 /* Look for the `;'. */
11886 /* If there's an expression, process it. */
11892 }
11894 /* Tries to parse a range-based for-statement:
11896 range-based-for:
11897 decl-specifier-seq declarator : expression
11899 The decl-specifier-seq declarator and the `:' are already parsed by
11900 cp_parser_init_statement. If processing_template_decl it returns a
11901 newly created RANGE_FOR_STMT; if not, it is converted to a
11902 regular FOR_STMT. */
11904 static tree
11907 {
11914 /* Get the range declaration momentarily out of the way so that
11915 the range expression doesn't clash with it. */
11917 {
11919 {
11921 /* For decomposition declaration get all of the corresponding
11922 declarations out of the way. */
11926 {
11932 {
11938 }
11939 }
11940 }
11942 {
11947 }
11948 }
11951 {
11954 }
11955 else
11958 /* Put the range declaration(s) back into scope. */
11960 {
11964 }
11966 /* finish_omp_for has its own code for the following, so just
11967 return the range_expr instead. */
11971 /* If in template, STMT is converted to a normal for-statement
11972 at instantiation. If not, it is done just ahead. */
11974 {
11984 /* do_auto_deduction doesn't mess with template init-lists. */
11987 }
11988 else
11989 {
11993 unroll);
11994 }
11996 }
11998 /* Subroutine of cp_convert_range_for: given the initializer expression,
11999 builds up the range temporary. */
12001 static tree
12003 {
12006 /* Find out the type deduced by the declaration
12007 `auto &&__range = range_expr'. */
12012 /* Create the __range variable. */
12014 range_type);
12019 }
12021 /* Used by cp_parser_range_for in template context: we aren't going to
12022 do a full conversion yet, but we still need to resolve auto in the
12023 type of the for-range-declaration if present. This is basically
12024 a shortcut version of cp_convert_range_for. */
12026 static void
12028 {
12031 {
12034 iter_type = (cp_parser_perform_range_for_lookup
12037 {
12039 iter_type);
12041 RO_UNARY_STAR,
12042 tf_warning_or_error);
12045 }
12046 }
12047 }
12049 /* Converts a range-based for-statement into a normal
12050 for-statement, as per the definition.
12052 for (RANGE_DECL : RANGE_EXPR)
12053 BLOCK
12055 should be equivalent to:
12057 {
12058 auto &&__range = RANGE_EXPR;
12059 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
12060 __begin != __end;
12061 ++__begin)
12062 {
12063 RANGE_DECL = *__begin;
12064 BLOCK
12065 }
12066 }
12068 If RANGE_EXPR is an array:
12069 BEGIN_EXPR = __range
12070 END_EXPR = __range + ARRAY_SIZE(__range)
12071 Else if RANGE_EXPR has a member 'begin' or 'end':
12072 BEGIN_EXPR = __range.begin()
12073 END_EXPR = __range.end()
12074 Else:
12075 BEGIN_EXPR = begin(__range)
12076 END_EXPR = end(__range);
12078 If __range has a member 'begin' but not 'end', or vice versa, we must
12079 still use the second alternative (it will surely fail, however).
12080 When calling begin()/end() in the third alternative we must use
12081 argument dependent lookup, but always considering 'std' as an associated
12082 namespace. */
12084 tree
12088 {
12096 /* If an error happened previously do nothing or else a lot of
12097 unhelpful errors would be issued. */
12099 else
12100 {
12101 tree range_temp;
12105 /* Can't bind a reference to an array of runtime bound. */
12107 else
12108 {
12113 LOOKUP_ONLYCONVERTING);
12115 }
12118 }
12120 /* The new for initialization statement. */
12122 iter_type);
12128 LOOKUP_ONLYCONVERTING);
12138 LOOKUP_ONLYCONVERTING);
12142 /* The new for condition. */
12149 /* The new increment expression. */
12152 tf_warning_or_error);
12158 /* The declaration is initialized with *__begin inside the loop body. */
12161 tf_warning_or_error),
12163 LOOKUP_ONLYCONVERTING);
12168 }
12170 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12171 We need to solve both at the same time because the method used
12172 depends on the existence of members begin or end.
12173 Returns the type deduced for the iterator expression. */
12175 static tree
12177 {
12179 {
12182 }
12185 {
12190 }
12192 {
12193 /* If RANGE is an array, we will use pointer arithmetic. */
12196 range,
12200 }
12201 else
12202 {
12203 /* If it is not an array, we must do a bit of magic. */
12213 tf_warning_or_error);
12216 tf_warning_or_error);
12219 {
12220 /* Use the member functions. */
12223 }
12224 else
12225 {
12226 /* Use global functions with ADL. */
12233 tf_warning_or_error);
12235 tf_warning_or_error);
12237 tf_warning_or_error);
12239 tf_warning_or_error);
12242 }
12244 /* Last common checks. */
12246 {
12247 /* If one of the expressions is an error do no more checks. */
12250 }
12253 /* Can happen, when, eg, in a template context, Koenig lookup
12254 can't resolve begin/end (c++/58503). */
12256 else
12257 {
12259 /* The unqualified type of the __begin and __end temporaries should
12260 be the same, as required by the multiple auto declaration. */
12262 {
12269 /* P0184R0 allows __begin and __end to have different types,
12270 but make sure they are comparable so we can give a better
12272 else
12276 }
12278 }
12279 }
12280 }
12282 /* Helper function for cp_parser_perform_range_for_lookup.
12283 Builds a tree for RANGE.IDENTIFIER(). */
12285 static tree
12287 {
12300 tf_warning_or_error);
12303 }
12305 /* Parse an iteration-statement.
12307 iteration-statement:
12308 while ( condition ) statement
12309 do statement while ( expression ) ;
12310 for ( init-statement condition [opt] ; expression [opt] )
12311 statement
12313 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12315 static tree
12318 {
12321 tree statement;
12323 token_indent_info guard_tinfo;
12325 /* Peek at the next token. */
12332 /* Remember whether or not we are already within an iteration
12333 statement. */
12336 /* See what kind of keyword it is. */
12339 {
12341 {
12342 tree condition;
12344 /* Begin the while-statement. */
12346 /* Look for the `('. */
12347 matching_parens parens;
12349 /* Parse the condition. */
12352 /* Look for the `)'. */
12354 /* Parse the dependent statement. */
12360 /* We're done with the while-statement. */
12362 }
12366 {
12367 tree expression;
12369 /* Begin the do-statement. */
12371 /* Parse the body of the do-statement. */
12378 /* Look for the `while' keyword. */
12380 /* Look for the `('. */
12381 matching_parens parens;
12383 /* Parse the expression. */
12385 /* We're done with the do-statement. */
12387 /* Look for the `)'. */
12389 /* Look for the `;'. */
12391 }
12395 {
12396 /* Look for the `('. */
12397 matching_parens parens;
12402 /* Look for the `)'. */
12405 /* Parse the body of the for-statement. */
12412 /* We're done with the for-statement. */
12414 }
12421 }
12424 }
12426 /* Parse a init-statement or the declarator of a range-based-for.
12427 Returns true if a range-based-for declaration is seen.
12429 init-statement:
12430 expression-statement
12431 simple-declaration */
12433 static bool
12435 {
12436 /* If the next token is a `;', then we have an empty
12437 expression-statement. Grammatically, this is also a
12438 simple-declaration, but an invalid one, because it does not
12439 declare anything. Therefore, if we did not handle this case
12440 specially, we would issue an error message about an invalid
12441 declaration. */
12443 {
12447 /* Try to parse the init-statement. */
12449 {
12450 tree dummy;
12452 /* Parse the declaration. */
12458 /* That didn't work, try to parse it as an expression-statement. */
12462 {
12464 "range-based %<for%> loops with initializer only "
12467 }
12468 }
12470 /* A colon is used in range-based for. */
12473 /* We're going to speculatively look for a declaration, falling back
12474 to an expression, if necessary. */
12476 /* Parse the declaration. */
12479 decl);
12482 {
12483 /* It is a range-for, consume the ':'. */
12488 "range-based %<for%> loops only available with "
12490 }
12491 else
12492 /* The ';' is not consumed yet because we told
12493 cp_parser_simple_declaration not to. */
12498 /* If the tentative parse failed, then we shall need to look for an
12499 expression-statement. */
12500 }
12501 /* If we are here, it is an expression-statement. */
12504 }
12506 /* Parse a jump-statement.
12508 jump-statement:
12509 break ;
12510 continue ;
12511 return expression [opt] ;
12512 return braced-init-list ;
12513 goto identifier ;
12515 GNU extension:
12517 jump-statement:
12518 goto * expression ;
12520 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12522 static tree
12524 {
12530 /* Peek at the next token. */
12535 /* See what kind of keyword it is. */
12538 {
12542 {
12559 }
12565 {
12569 /* Fall through. */
12579 }
12584 {
12585 tree expr;
12589 {
12593 }
12596 else
12597 /* If the next token is a `;', then there is no
12598 expression. */
12600 /* Build the return-statement. */
12603 else
12605 /* Look for the final `;'. */
12607 }
12613 {
12616 }
12618 /* Create the goto-statement. */
12620 {
12621 /* Issue a warning about this use of a GNU extension. */
12623 /* Consume the '*' token. */
12625 /* Parse the dependent expression. */
12627 }
12628 else
12630 /* Look for the final `;'. */
12637 }
12640 }
12642 /* Parse a declaration-statement.
12644 declaration-statement:
12645 block-declaration */
12647 static void
12649 {
12652 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12655 /* Parse the block-declaration. */
12658 /* Free any declarators allocated. */
12660 }
12662 /* Some dependent statements (like `if (cond) statement'), are
12663 implicitly in their own scope. In other words, if the statement is
12664 a single statement (as opposed to a compound-statement), it is
12665 none-the-less treated as if it were enclosed in braces. Any
12666 declarations appearing in the dependent statement are out of scope
12667 after control passes that point. This function parses a statement,
12668 but ensures that is in its own scope, even if it is not a
12669 compound-statement.
12671 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12672 is a (possibly labeled) if statement which is not enclosed in
12673 braces and has an else clause. This is used to implement
12674 -Wparentheses.
12676 CHAIN is a vector of if-else-if conditions. This is used to implement
12677 -Wduplicated-cond.
12679 Returns the new statement. */
12681 static tree
12685 {
12686 tree statement;
12689 token_indent_info body_tinfo
12695 /* Mark if () ; with a special NOP_EXPR. */
12697 {
12708 }
12709 /* if a compound is opened, we simply parse the statement directly. */
12712 /* If the token is not a `{', then we must take special action. */
12713 else
12714 {
12715 /* Create a compound-statement. */
12717 /* Parse the dependent-statement. */
12720 /* Finish the dummy compound-statement. */
12722 }
12724 token_indent_info next_tinfo
12733 /* Return the statement. */
12735 }
12737 /* For some dependent statements (like `while (cond) statement'), we
12738 have already created a scope. Therefore, even if the dependent
12739 statement is a compound-statement, we do not want to create another
12740 scope. */
12742 static void
12745 {
12746 /* If the token is a `{', then we must take special action. */
12748 {
12749 token_indent_info body_tinfo
12755 token_indent_info next_tinfo
12764 }
12765 else
12766 {
12767 /* Avoid calling cp_parser_compound_statement, so that we
12768 don't create a new scope. Do everything else by hand. */
12769 matching_braces braces;
12771 /* If the next keyword is `__label__' we have a label declaration. */
12774 /* Parse an (optional) statement-seq. */
12777 }
12778 }
12780 /* Declarations [gram.dcl.dcl] */
12782 /* Parse an optional declaration-sequence.
12784 declaration-seq:
12785 declaration
12786 declaration-seq declaration */
12788 static void
12790 {
12792 {
12798 else
12800 }
12801 }
12803 /* Parse a declaration.
12805 declaration:
12806 block-declaration
12807 function-definition
12808 template-declaration
12809 explicit-instantiation
12810 explicit-specialization
12811 linkage-specification
12812 namespace-definition
12814 C++17:
12815 deduction-guide
12817 GNU extension:
12819 declaration:
12820 __extension__ declaration */
12822 static void
12824 {
12825 cp_token token1;
12826 cp_token token2;
12831 /* Check for the `__extension__' keyword. */
12833 {
12834 /* Parse the qualified declaration. */
12836 /* Restore the PEDANTIC flag. */
12840 }
12842 /* Try to figure out what kind of declaration is present. */
12847 else
12848 {
12851 }
12853 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12856 /* If the next token is `extern' and the following token is a string
12857 literal, then we have a linkage specification. */
12861 /* If the next token is `template', then we have either a template
12862 declaration, an explicit instantiation, or an explicit
12863 specialization. */
12865 {
12866 /* `template <>' indicates a template specialization. */
12870 /* `template <' indicates a template declaration. */
12873 /* Anything else must be an explicit instantiation. */
12874 else
12876 }
12877 /* If the next token is `export', then we have a template
12878 declaration. */
12881 /* If the next token is `extern', 'static' or 'inline' and the one
12882 after that is `template', we have a GNU extended explicit
12883 instantiation directive. */
12890 /* If the next token is `namespace', check for a named or unnamed
12891 namespace definition. */
12900 /* An unnamed namespace definition. */
12904 /* An inline (associated) namespace definition. */
12908 /* Objective-C++ declaration/definition. */
12915 /* At this point we may have a template declared by a concept
12916 introduction. */
12921 else
12922 /* Try to parse a block-declaration, or a function-definition. */
12925 /* Free any declarators allocated. */
12927 }
12929 /* Parse a namespace-scope declaration. */
12931 static void
12933 {
12937 /* A top-level declaration can consist solely of a #pragma. A
12938 nested declaration cannot, so this is done here and not in
12939 cp_parser_declaration. (A #pragma at block scope is
12940 handled in cp_parser_statement.) */
12943 {
12944 /* A declaration consisting of a single semicolon is
12945 invalid. Allow it unless we're being pedantic. */
12949 }
12950 else
12951 /* Parse the declaration itself. */
12953 }
12955 /* Parse a block-declaration.
12957 block-declaration:
12958 simple-declaration
12959 asm-definition
12960 namespace-alias-definition
12961 using-declaration
12962 using-directive
12964 GNU Extension:
12966 block-declaration:
12967 __extension__ block-declaration
12969 C++0x Extension:
12971 block-declaration:
12972 static_assert-declaration
12974 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12975 part of a declaration-statement. */
12977 static void
12980 {
12984 /* Check for the `__extension__' keyword. */
12986 {
12987 /* Parse the qualified declaration. */
12989 /* Restore the PEDANTIC flag. */
12993 }
12995 /* Peek at the next token to figure out which kind of declaration is
12996 present. */
12999 /* If the next keyword is `asm', we have an asm-definition. */
13001 {
13005 }
13006 /* If the next keyword is `namespace', we have a
13007 namespace-alias-definition. */
13010 /* If the next keyword is `using', we have a
13011 using-declaration, a using-directive, or an alias-declaration. */
13013 {
13018 /* If the token after `using' is `namespace', then we have a
13019 using-directive. */
13023 /* If the second token after 'using' is '=', then we have an
13024 alias-declaration. */
13030 /* Otherwise, it's a using-declaration. */
13031 else
13034 }
13035 /* If the next keyword is `__label__' we have a misplaced label
13036 declaration. */
13038 {
13042 /* If the next token is now a `;', consume it. */
13045 }
13046 /* If the next token is `static_assert' we have a static assertion. */
13049 /* Anything else must be a simple-declaration. */
13050 else
13053 }
13055 /* Parse a simple-declaration.
13057 simple-declaration:
13058 decl-specifier-seq [opt] init-declarator-list [opt] ;
13059 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13060 brace-or-equal-initializer ;
13062 init-declarator-list:
13063 init-declarator
13064 init-declarator-list , init-declarator
13066 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
13067 function-definition as a simple-declaration.
13069 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
13070 parsed declaration if it is an uninitialized single declarator not followed
13071 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
13072 if present, will not be consumed. */
13074 static void
13078 {
13079 cp_decl_specifier_seq decl_specifiers;
13088 /* Defer access checks until we know what is being declared; the
13089 checks for names appearing in the decl-specifier-seq should be
13090 done as if we were in the scope of the thing being declared. */
13093 /* Parse the decl-specifier-seq. We have to keep track of whether
13094 or not the decl-specifier-seq declares a named class or
13095 enumeration type, since that is the only case in which the
13096 init-declarator-list is allowed to be empty.
13098 [dcl.dcl]
13100 In a simple-declaration, the optional init-declarator-list can be
13101 omitted only when declaring a class or enumeration, that is when
13102 the decl-specifier-seq contains either a class-specifier, an
13103 elaborated-type-specifier, or an enum-specifier. */
13105 CP_PARSER_FLAGS_OPTIONAL,
13108 /* We no longer need to defer access checks. */
13111 /* In a block scope, a valid declaration must always have a
13112 decl-specifier-seq. By not trying to parse declarators, we can
13113 resolve the declaration/expression ambiguity more quickly. */
13116 {
13119 }
13121 /* If the next two tokens are both identifiers, the code is
13122 erroneous. The usual cause of this situation is code like:
13124 T t;
13126 where "T" should name a type -- but does not. */
13129 {
13130 /* If parsing tentatively, we should commit; we really are
13131 looking at a declaration. */
13133 /* Give up. */
13135 }
13140 /* Look for C++17 decomposition declaration. */
13148 {
13149 tree decl
13151 maybe_range_for_decl,
13154 /* The next token should be either a `,' or a `;'. */
13156 /* If it's a `;', we are done. */
13160 {
13164 }
13165 /* Anything else is an error. */
13166 else
13167 {
13168 /* If we have already issued an error message we don't need
13169 to issue another one. */
13174 /* Skip tokens until we reach the end of the statement. */
13176 /* If the next token is now a `;', consume it. */
13180 }
13181 }
13182 else
13185 tree last_type;
13187 /* NULL_TREE if both variable and function declaration are allowed,
13188 error_mark_node if function declaration are not allowed and
13189 a FUNCTION_DECL that should be diagnosed if it is followed by
13190 variable declarations. */
13191 tree auto_function_declaration;
13194 auto_specifier_p
13198 /* Keep going until we hit the `;' at the end of the simple
13199 declaration. */
13202 CPP_SEMICOLON))
13203 {
13206 tree decl;
13210 {
13211 /* If we are processing next declarator, comma is expected */
13216 {
13220 }
13221 }
13222 else
13225 /* Parse the init-declarator. */
13228 function_definition_allowed_p,
13230 declares_class_or_enum,
13232 maybe_range_for_decl,
13235 /* If an error occurred while parsing tentatively, exit quickly.
13236 (That usually happens when in the body of a function; each
13237 statement is treated as a declaration-statement until proven
13238 otherwise.) */
13243 {
13244 /* If the init-declarator-list contains more than one
13245 init-declarator, they shall all form declarations of
13246 variables. */
13248 auto_function_declaration
13252 {
13254 "non-variable %qD in declaration with more than one "
13259 }
13260 }
13264 {
13268 {
13269 /* If the list of declarators contains more than one declarator,
13270 the type of each declared variable is determined as described
13271 above. If the type deduced for the template parameter U is not
13272 the same in each deduction, the program is ill-formed. */
13277 }
13278 else
13280 }
13282 /* Handle function definitions specially. */
13284 {
13285 /* If the next token is a `,', then we are probably
13286 processing something like:
13288 void f() {}, *p;
13290 which is erroneous. */
13292 {
13295 "mixing"
13297 }
13298 /* Otherwise, we're done with the list of declarators. */
13299 else
13300 {
13303 }
13304 }
13307 /* The next token should be either a `,' or a `;'. */
13309 /* If it's a `,', there are more declarators to come. */
13312 /* If it's a `;', we are done. */
13316 {
13321 }
13322 /* Anything else is an error. */
13323 else
13324 {
13325 /* If we have already issued an error message we don't need
13326 to issue another one. */
13331 /* Skip tokens until we reach the end of the statement. */
13333 /* If the next token is now a `;', consume it. */
13337 }
13338 /* After the first time around, a function-definition is not
13339 allowed -- even if it was OK at first. For example:
13341 int i, f() {}
13343 is not valid. */
13345 }
13347 /* Issue an error message if no declarators are present, and the
13348 decl-specifier-seq does not itself declare a class or
13349 enumeration: [dcl.dcl]/3. */
13351 {
13353 {
13357 /* Ensure an error is issued anyway when finish_decltype_type,
13358 called via cp_parser_decl_specifier_seq, returns a class or
13359 an enumeration (c++/51786). */
13362 }
13363 /* Perform any deferred access checks. */
13365 }
13367 /* Consume the `;'. */
13368 finish:
13372 {
13378 }
13380 done:
13382 }
13384 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13385 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13386 initializer ; */
13388 static tree
13393 {
13398 /* Parse the identifier-list. */
13402 {
13410 }
13414 {
13420 else
13421 {
13424 }
13425 }
13431 tree pushed_scope;
13438 NULL_TREE);
13445 cp_expr e;
13446 cp_decl_specifier_seq decl_specs;
13451 {
13454 else
13457 tree elt_pushed_scope;
13463 {
13464 /* Ensure we've diagnosed redeclaration if we aren't creating
13465 a new VAR_DECL. */
13468 }
13469 else
13473 }
13476 {
13479 }
13483 {
13491 || (is_direct_init
13494 {
13498 }
13501 {
13506 }
13507 }
13509 {
13511 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13512 the underlying DECL. */
13514 }
13520 {
13523 }
13526 }
13528 /* Parse a decl-specifier-seq.
13530 decl-specifier-seq:
13531 decl-specifier-seq [opt] decl-specifier
13532 decl-specifier attribute-specifier-seq [opt] (C++11)
13534 decl-specifier:
13535 storage-class-specifier
13536 type-specifier
13537 function-specifier
13538 friend
13539 typedef
13541 GNU Extension:
13543 decl-specifier:
13544 attributes
13546 Concepts Extension:
13548 decl-specifier:
13549 concept
13551 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13553 The parser flags FLAGS is used to control type-specifier parsing.
13555 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13556 flags:
13558 1: one of the decl-specifiers is an elaborated-type-specifier
13559 (i.e., a type declaration)
13560 2: one of the decl-specifiers is an enum-specifier or a
13561 class-specifier (i.e., a type definition)
13563 */
13565 static void
13567 cp_parser_flags flags,
13570 {
13574 cp_decl_spec ds;
13576 /* Clear DECL_SPECS. */
13579 /* Assume no class or enumeration type is declared. */
13582 /* Keep reading specifiers until there are no more to read. */
13584 {
13589 /* Peek at the next token. */
13592 /* Save the first token of the decl spec list for error
13593 reporting. */
13596 /* Handle attributes. */
13598 {
13599 /* Parse the attributes. */
13602 /* In a sequence of declaration specifiers, c++11 attributes
13603 appertain to the type that precede them. In that case
13604 [dcl.spec]/1 says:
13606 The attribute-specifier-seq affects the type only for
13607 the declaration it appears in, not other declarations
13608 involving the same type.
13610 But for now let's force the user to position the
13611 attribute either at the beginning of the declaration or
13612 after the declarator-id, which would clearly mean that it
13613 applies to the declarator. */
13615 {
13617 /* The c++11 attribute is at the beginning of the
13618 declaration. It appertains to the entity being
13620 else
13621 {
13623 {
13624 /* This is an attribute following a
13625 class-specifier. */
13630 }
13631 else
13632 {
13633 decl_specs->std_attributes
13637 }
13639 }
13640 }
13642 decl_specs->attributes
13647 }
13648 /* Assume we will find a decl-specifier keyword. */
13650 /* If the next token is an appropriate keyword, we can simply
13651 add it to the list. */
13653 {
13654 /* decl-specifier:
13655 friend
13656 constexpr */
13659 {
13664 }
13665 else
13666 {
13668 /* Consume the token. */
13670 }
13683 /* function-specifier:
13684 inline
13685 virtual
13686 explicit */
13693 /* decl-specifier:
13694 typedef */
13697 /* Consume the token. */
13699 /* A constructor declarator cannot appear in a typedef. */
13701 /* The "typedef" keyword can only occur in a declaration; we
13702 may as well commit at this point. */
13709 /* storage-class-specifier:
13710 auto
13711 register
13712 static
13713 extern
13714 mutable
13716 GNU Extension:
13717 thread */
13720 {
13721 /* Consume the token. */
13724 /* Complain about `auto' as a storage specifier, if
13725 we're complaining about C++0x compatibility. */
13729 "%<auto%> changes meaning in C++11; "
13732 /* Set the storage class anyway. */
13734 token);
13735 }
13736 else
13737 /* C++0x auto type-specifier. */
13745 /* Consume the token. */
13748 token);
13751 /* Consume the token. */
13757 /* We did not yet find a decl-specifier yet. */
13760 }
13777 /* Constructors are a special case. The `S' in `S()' is not a
13778 decl-specifier; it is the beginning of the declarator. */
13779 constructor_p
13780 = (!found_decl_spec
13781 && constructor_possible_p
13782 && (cp_parser_constructor_declarator_p
13785 /* If we don't have a DECL_SPEC yet, then we must be looking at
13786 a type-specifier. */
13788 {
13791 tree type_spec;
13793 type_spec
13795 decl_specs,
13801 /* If this type-specifier referenced a user-defined type
13802 (a typedef, class-name, etc.), then we can't allow any
13803 more such type-specifiers henceforth.
13805 [dcl.spec]
13807 The longest sequence of decl-specifiers that could
13808 possibly be a type name is taken as the
13809 decl-specifier-seq of a declaration. The sequence shall
13810 be self-consistent as described below.
13812 [dcl.type]
13814 As a general rule, at most one type-specifier is allowed
13815 in the complete decl-specifier-seq of a declaration. The
13816 only exceptions are the following:
13818 -- const or volatile can be combined with any other
13819 type-specifier.
13821 -- signed or unsigned can be combined with char, long,
13822 short, or int.
13824 -- ..
13826 Example:
13828 typedef char* Pc;
13829 void g (const int Pc);
13831 Here, Pc is *not* part of the decl-specifier seq; it's
13832 the declarator. Therefore, once we see a type-specifier
13833 (other than a cv-qualifier), we forbid any additional
13834 user-defined types. We *do* still allow things like `int
13835 int' to be considered a decl-specifier-seq, and issue the
13836 error message later. */
13839 /* A constructor declarator cannot follow a type-specifier. */
13841 {
13849 }
13850 }
13852 /* If we still do not have a DECL_SPEC, then there are no more
13853 decl-specifiers. */
13858 /* After we see one decl-specifier, further decl-specifiers are
13859 always optional. */
13861 }
13863 /* Don't allow a friend specifier with a class definition. */
13868 }
13870 /* Parse an (optional) storage-class-specifier.
13872 storage-class-specifier:
13873 auto
13874 register
13875 static
13876 extern
13877 mutable
13879 GNU Extension:
13881 storage-class-specifier:
13882 thread
13884 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13886 static tree
13888 {
13890 {
13894 /* Fall through for C++98. */
13902 /* Consume the token. */
13907 }
13908 }
13910 /* Parse an (optional) function-specifier.
13912 function-specifier:
13913 inline
13914 virtual
13915 explicit
13917 C++2A Extension:
13918 explicit(constant-expression)
13920 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13921 Updates DECL_SPECS, if it is non-NULL. */
13923 static tree
13926 {
13929 {
13935 /* 14.5.2.3 [temp.mem]
13937 A member function template shall not be virtual. */
13941 else
13946 {
13948 /* If we see '(', it's C++20 explicit(bool). */
13949 tree expr;
13951 {
13952 matching_parens parens;
13955 /* New types are not allowed in an explicit-specifier. */
13958 parser->type_definition_forbidden_message
13963 "%<explicit(bool)%> only available with -std=c++2a "
13966 /* Parse the constant-expression. */
13969 /* Restore the saved message. */
13972 }
13973 else
13974 /* The explicit-specifier explicit without a constant-expression is
13975 equivalent to the explicit-specifier explicit(true). */
13978 /* [dcl.fct.spec]
13979 "the constant-expression, if supplied, shall be a contextually
13980 converted constant expression of type bool." */
13982 /* We could evaluate it -- mark the decl as appropriate. */
13988 /* The expression was value-dependent. Remember it so that we can
13989 substitute it later. */
13992 }
13996 }
13998 /* Consume the token. */
14000 }
14002 /* Parse a linkage-specification.
14004 linkage-specification:
14005 extern string-literal { declaration-seq [opt] }
14006 extern string-literal declaration */
14008 static void
14010 {
14011 tree linkage;
14013 /* Look for the `extern' keyword. */
14014 cp_token *extern_token
14017 /* Look for the string-literal. */
14021 /* Transform the literal into an identifier. If the literal is a
14022 wide-character string, or contains embedded NULs, then we can't
14023 handle it as the user wants. */
14026 {
14028 /* Assume C++ linkage. */
14030 }
14031 else
14034 /* We're now using the new linkage. */
14037 /* Preserve the location of the the innermost linkage specification,
14038 tracking the locations of nested specifications via a local. */
14039 location_t saved_location
14041 /* Construct a location ranging from the start of the "extern" to
14042 the end of the string-literal, with the caret at the start, e.g.:
14043 extern "C" {
14044 ^~~~~~~~~~
14045 */
14046 parser->innermost_linkage_specification_location
14051 /* If the next token is a `{', then we're using the first
14052 production. */
14054 {
14058 /* Consume the `{' token. */
14059 matching_braces braces;
14061 /* Parse the declarations. */
14063 /* Look for the closing `}'. */
14065 }
14066 /* Otherwise, there's just one declaration. */
14067 else
14068 {
14071 saved_in_unbraced_linkage_specification_p
14075 parser->in_unbraced_linkage_specification_p
14077 }
14079 /* We're done with the linkage-specification. */
14082 /* Restore location of parent linkage specification, if any. */
14084 }
14086 /* Parse a static_assert-declaration.
14088 static_assert-declaration:
14089 static_assert ( constant-expression , string-literal ) ;
14090 static_assert ( constant-expression ) ; (C++17)
14092 If MEMBER_P, this static_assert is a class member. */
14094 static void
14096 {
14097 cp_expr condition;
14098 location_t token_loc;
14099 tree message;
14102 /* Peek at the `static_assert' token so we can keep track of exactly
14103 where the static assertion started. */
14106 /* Look for the `static_assert' keyword. */
14108 RT_STATIC_ASSERT))
14111 /* We know we are in a static assertion; commit to any tentative
14112 parse. */
14116 /* Parse the `(' starting the static assertion condition. */
14117 matching_parens parens;
14120 /* Parse the constant-expression. Allow a non-constant expression
14121 here in order to give better diagnostics in finish_static_assert. */
14122 condition =
14128 {
14131 "static_assert without a message "
14133 /* Eat the ')' */
14138 }
14139 else
14140 {
14141 /* Parse the separating `,'. */
14144 /* Parse the string-literal message. */
14149 /* A `)' completes the static assertion. */
14155 }
14157 /* A semicolon terminates the declaration. */
14160 /* Get the location for the static assertion. Use that of the
14161 condition if available, otherwise, use that of the "static_assert"
14162 token. */
14167 /* Complete the static assertion, which may mean either processing
14168 the static assert now or saving it for template instantiation. */
14170 }
14172 /* Parse the expression in decltype ( expression ). */
14174 static tree
14177 {
14179 tree expr;
14181 /* Since we're going to preserve any side-effects from this parse, set up a
14182 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14183 in the expression. */
14186 /* First, try parsing an id-expression. */
14197 {
14200 cp_id_kind idk;
14204 /* Lookup the name we got back from the id-expression. */
14209 /* A template without args is not a complete id-expression. */
14218 {
14219 /* Complete lookup of the id-expression. */
14220 expr = (finish_id_expression
14233 /* We found an id-expression, but it was something that we
14234 should not have found. This is an error, not something
14235 we can recover from, so note that we found an
14236 id-expression and we'll recover as gracefully as
14237 possible. */
14239 }
14244 /* We have an id-expression. */
14246 }
14249 {
14250 /* Abort the id-expression parse. */
14253 /* Parsing tentatively, again. */
14256 /* Parse a class member access. */
14264 /* We have an id-expression. */
14266 }
14269 /* We have parsed the complete id-expression or member access. */
14271 else
14272 {
14273 /* Abort our attempt to parse an id-expression or member access
14274 expression. */
14277 /* Commit to the tentative_firewall so we get syntax errors. */
14280 /* Parse a full expression. */
14283 }
14286 }
14288 /* Parse a `decltype' type. Returns the type.
14290 simple-type-specifier:
14291 decltype ( expression )
14292 C++14 proposal:
14293 decltype ( auto ) */
14295 static tree
14297 {
14302 {
14303 /* Already parsed. */
14306 }
14308 /* Look for the `decltype' token. */
14312 /* Parse the opening `('. */
14313 matching_parens parens;
14323 /* decltype (auto) */
14325 else
14326 {
14327 /* decltype (expression) */
14329 /* Types cannot be defined in a `decltype' expression. Save away the
14330 old message and set the new one. */
14332 parser->type_definition_forbidden_message
14335 /* The restrictions on constant-expressions do not apply inside
14336 decltype expressions. */
14337 bool saved_integral_constant_expression_p
14339 bool saved_non_integral_constant_expression_p
14343 /* Within a parenthesized expression, a `>' token is always
14344 the greater-than operator. */
14345 bool saved_greater_than_is_operator_p
14349 /* Do not actually evaluate the expression. */
14352 /* Do not warn about problems with the expression. */
14357 /* Go back to evaluating expressions. */
14361 /* The `>' token might be the end of a template-id or
14362 template-parameter-list now. */
14363 parser->greater_than_is_operator_p
14366 /* Restore the old message and the integral constant expression
14367 flags. */
14369 parser->integral_constant_expression_p
14371 parser->non_integral_constant_expression_p
14373 }
14375 /* Parse to the closing `)'. */
14377 {
14382 }
14385 {
14386 /* Build auto. */
14389 }
14390 else
14392 tf_warning_or_error);
14394 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14395 it again. */
14406 }
14408 /* Special member functions [gram.special] */
14410 /* Parse a conversion-function-id.
14412 conversion-function-id:
14413 operator conversion-type-id
14415 Returns an IDENTIFIER_NODE representing the operator. */
14417 static tree
14419 {
14420 tree type;
14421 tree saved_scope;
14422 tree saved_qualifying_scope;
14423 tree saved_object_scope;
14426 /* Look for the `operator' token. */
14429 /* When we parse the conversion-type-id, the current scope will be
14430 reset. However, we need that information in able to look up the
14431 conversion function later, so we save it here. */
14435 /* We must enter the scope of the class so that the names of
14436 entities declared within the class are available in the
14437 conversion-type-id. For example, consider:
14439 struct S {
14440 typedef int I;
14441 operator I();
14442 };
14444 S::operator I() { ... }
14446 In order to see that `I' is a type-name in the definition, we
14447 must be in the scope of `S'. */
14450 /* Parse the conversion-type-id. */
14452 /* Leave the scope of the class, if any. */
14455 /* Restore the saved scope. */
14459 /* If the TYPE is invalid, indicate failure. */
14463 }
14465 /* Parse a conversion-type-id:
14467 conversion-type-id:
14468 type-specifier-seq conversion-declarator [opt]
14470 Returns the TYPE specified. */
14472 static tree
14474 {
14475 tree attributes;
14476 cp_decl_specifier_seq type_specifiers;
14478 tree type_specified;
14481 /* Parse the attributes. */
14485 parser->type_definition_forbidden_message
14488 /* Parse the type-specifiers. */
14495 /* If that didn't work, stop. */
14498 /* Parse the conversion-declarator. */
14506 /* Don't give this error when parsing tentatively. This happens to
14507 work because we always parse this definitively once. */
14510 {
14512 {
14515 }
14519 }
14522 }
14524 /* Parse an (optional) conversion-declarator.
14526 conversion-declarator:
14527 ptr-operator conversion-declarator [opt]
14529 */
14533 {
14536 cp_cv_quals cv_quals;
14538 /* We don't know if there's a ptr-operator next, or not. */
14540 /* Try the ptr-operator. */
14543 /* If it worked, look for more conversion-declarators. */
14545 {
14548 /* Parse another optional declarator. */
14551 declarator = cp_parser_make_indirect_declarator
14555 }
14558 }
14560 /* Parse an (optional) ctor-initializer.
14562 ctor-initializer:
14563 : mem-initializer-list */
14565 static void
14567 {
14568 /* If the next token is not a `:', then there is no
14569 ctor-initializer. */
14571 {
14572 /* Do default initialization of any bases and members. */
14576 }
14578 /* Consume the `:' token. */
14580 /* And the mem-initializer-list. */
14582 }
14584 /* Parse a mem-initializer-list.
14586 mem-initializer-list:
14587 mem-initializer ... [opt]
14588 mem-initializer ... [opt] , mem-initializer-list */
14590 static void
14592 {
14597 /* Let the semantic analysis code know that we are starting the
14598 mem-initializer-list. */
14603 /* Loop through the list. */
14605 {
14606 tree mem_initializer;
14609 /* Parse the mem-initializer. */
14611 /* If the next token is a `...', we're expanding member initializers. */
14617 {
14618 /* Consume the `...'. */
14622 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14623 can be expanded but members cannot. */
14626 {
14631 }
14633 /* Construct the pack expansion type. */
14636 }
14639 {
14643 }
14644 /* Look for a target constructor. */
14648 {
14651 {
14655 }
14657 }
14658 /* Add it to the list, unless it was erroneous. */
14660 {
14663 }
14664 /* If the next token is not a `,', we're done. */
14667 /* Consume the `,' token. */
14669 }
14671 /* Perform semantic analysis. */
14674 }
14676 /* Parse a mem-initializer.
14678 mem-initializer:
14679 mem-initializer-id ( expression-list [opt] )
14680 mem-initializer-id braced-init-list
14682 GNU extension:
14684 mem-initializer:
14685 ( expression-list [opt] )
14687 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14688 class) or FIELD_DECL (for a non-static data member) to initialize;
14689 the TREE_VALUE is the expression-list. An empty initialization
14690 list is represented by void_list_node. */
14692 static tree
14694 {
14695 tree mem_initializer_id;
14696 tree expression_list;
14697 tree member;
14700 /* Find out what is being initialized. */
14702 {
14706 }
14707 else
14708 {
14712 }
14718 {
14725 }
14726 else
14727 {
14737 }
14747 }
14749 /* Parse a mem-initializer-id.
14751 mem-initializer-id:
14752 :: [opt] nested-name-specifier [opt] class-name
14753 decltype-specifier (C++11)
14754 identifier
14756 Returns a TYPE indicating the class to be initialized for the first
14757 production (and the second in C++11). Returns an IDENTIFIER_NODE
14758 indicating the data member to be initialized for the last production. */
14760 static tree
14762 {
14766 tree id;
14770 /* `typename' is not allowed in this context ([temp.res]). */
14772 {
14774 "keyword %<typename%> not allowed in this context (a qualified "
14777 }
14778 /* Look for the optional `::' operator. */
14779 global_scope_p
14783 /* Look for the optional nested-name-specifier. The simplest way to
14784 implement:
14786 [temp.res]
14788 The keyword `typename' is not permitted in a base-specifier or
14789 mem-initializer; in these contexts a qualified name that
14790 depends on a template-parameter is implicitly assumed to be a
14791 type name.
14793 is to assume that we have seen the `typename' keyword at this
14794 point. */
14795 nested_name_specifier_p
14804 /* If there is a `::' operator or a nested-name-specifier, then we
14805 are definitely looking for a class-name. */
14810 typename_type,
14814 /* Otherwise, we could also be looking for an ordinary identifier. */
14817 /* Try a decltype-specifier. */
14819 else
14820 /* Otherwise, try a class-name. */
14824 none_type,
14828 /* If we found one, we're done. */
14831 /* Otherwise, look for an ordinary identifier. */
14833 }
14835 /* Overloading [gram.over] */
14837 /* Parse an operator-function-id.
14839 operator-function-id:
14840 operator operator
14842 Returns an IDENTIFIER_NODE for the operator which is a
14843 human-readable spelling of the identifier, e.g., `operator +'. */
14845 static cp_expr
14847 {
14848 /* Look for the `operator' keyword. */
14851 /* And then the name of the operator itself. */
14853 }
14855 /* Return an identifier node for a user-defined literal operator.
14856 The suffix identifier is chained to the operator name identifier. */
14858 tree
14860 {
14861 tree identifier;
14868 }
14870 /* Parse an operator.
14872 operator:
14873 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14874 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14875 || ++ -- , ->* -> () []
14877 GNU Extensions:
14879 operator:
14880 <? >? <?= >?=
14882 Returns an IDENTIFIER_NODE for the operator which is a
14883 human-readable spelling of the identifier, e.g., `operator +'. */
14885 static cp_expr
14887 {
14892 /* Peek at the next token. */
14897 /* Figure out which operator we have. */
14902 {
14904 {
14905 /* The keyword should be either `new' or `delete'. */
14910 else
14913 /* Consume the `new' or `delete' token. */
14916 /* Peek at the next token. */
14918 /* If it's a `[' token then this is the array variant of the
14919 operator. */
14921 {
14922 /* Consume the `[' token. */
14924 /* Look for the `]' token. */
14929 }
14933 }
15091 {
15092 /* Consume the `('. */
15093 matching_parens parens;
15095 /* Look for the matching `)'. */
15100 }
15103 /* Consume the `['. */
15105 /* Look for the matching `]'. */
15114 /* FALLTHRU */
15123 {
15130 /* Consume the string. */
15136 {
15139 }
15140 else
15141 {
15143 /* Look for the suffix identifier. */
15148 {
15152 }
15153 else
15154 {
15157 }
15158 }
15163 {
15166 }
15169 {
15172 }
15174 {
15177 }
15179 }
15182 /* Anything else is an error. */
15184 }
15186 /* If we have selected an identifier, we need to consume the
15187 operator token. */
15189 {
15193 }
15194 /* Otherwise, no valid operator name was present. */
15195 else
15196 {
15199 }
15202 }
15204 /* Parse a template-declaration.
15206 template-declaration:
15207 export [opt] template < template-parameter-list > declaration
15209 If MEMBER_P is TRUE, this template-declaration occurs within a
15210 class-specifier.
15212 The grammar rule given by the standard isn't correct. What
15213 is really meant is:
15215 template-declaration:
15216 export [opt] template-parameter-list-seq
15217 decl-specifier-seq [opt] init-declarator [opt] ;
15218 export [opt] template-parameter-list-seq
15219 function-definition
15221 template-parameter-list-seq:
15222 template-parameter-list-seq [opt]
15223 template < template-parameter-list >
15225 Concept Extensions:
15227 template-parameter-list-seq:
15228 template < template-parameter-list > requires-clause [opt]
15230 requires-clause:
15231 requires logical-or-expression */
15233 static void
15235 {
15236 /* Check for `export'. */
15238 {
15239 /* Consume the `export' token. */
15241 /* Warn that we do not support `export'. */
15243 }
15246 }
15248 /* Parse a template-parameter-list.
15250 template-parameter-list:
15251 template-parameter
15252 template-parameter-list , template-parameter
15254 Returns a TREE_LIST. Each node represents a template parameter.
15255 The nodes are connected via their TREE_CHAINs. */
15257 static tree
15259 {
15264 /* The loop below parses the template parms. We first need to know
15265 the total number of template parms to be able to compute proper
15266 canonical types of each dependent type. So after the loop, when
15267 we know the total number of template parms,
15268 end_template_parm_list computes the proper canonical types and
15269 fixes up the dependent types accordingly. */
15271 {
15272 tree parameter;
15275 location_t parm_loc;
15277 /* Parse the template-parameter. */
15282 /* Add it to the list. */
15285 parm_loc,
15286 parameter,
15287 is_non_type,
15288 is_parameter_pack);
15289 else
15290 {
15293 }
15295 /* If the next token is not a `,', we're done. */
15298 /* Otherwise, consume the `,' token. */
15300 }
15303 }
15305 /* Parse a introduction-list.
15307 introduction-list:
15308 introduced-parameter
15309 introduction-list , introduced-parameter
15311 introduced-parameter:
15312 ...[opt] identifier
15314 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15315 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15316 WILDCARD_DECL will also have DECL_NAME set and token location in
15317 DECL_SOURCE_LOCATION. */
15319 static tree
15321 {
15325 {
15334 /* Build placeholder. */
15342 /* If the next token is not a `,', we're done. */
15345 /* Otherwise, consume the `,' token. */
15347 }
15349 /* Convert the vec into a TREE_VEC. */
15352 tree parm;
15358 }
15360 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15361 is an abstract declarator. */
15365 {
15370 }
15372 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15373 is an abstract declarator. */
15377 {
15381 else
15383 }
15385 /* Returns true if DECL represents a constrained-parameter. */
15389 {
15394 }
15396 /* Returns true if PARM declares a constrained-parameter. */
15400 {
15402 }
15404 /* Check that the type parameter is only a declarator-id, and that its
15405 type is not cv-qualified. */
15407 bool
15410 {
15415 {
15418 }
15420 /* Don't allow cv-qualified type parameters. */
15423 {
15426 }
15429 }
15431 /* Finish parsing/processing a template type parameter and checking
15432 various restrictions. */
15436 tree id,
15438 {
15441 else
15443 }
15445 static tree
15447 {
15448 /* FIXME: This should probably be copied, and we may need to adjust
15449 the template parameter depths. */
15459 }
15461 /* Finish parsing/processing a template template parameter by borrowing
15462 the template parameter list from the prototype parameter. */
15464 static tree
15466 tree proto,
15467 tree id,
15469 {
15473 }
15475 /* Create a new non-type template parameter from the given PARM
15476 declarator. */
15478 static tree
15481 {
15487 }
15489 /* Build a constrained template parameter based on the PARMDECL
15490 declarator. The type of PARMDECL is the constrained type, which
15491 refers to the prototype template parameter that ultimately
15492 specifies the type of the declared parameter. */
15494 static tree
15499 {
15505 /* A template parameter constrained by a variadic concept shall also
15506 be declared as a template parameter pack. */
15511 /* Build the parameter. Return an error if the declarator was invalid. */
15512 tree parm;
15517 parmdecl);
15518 else
15523 /* Finish the parameter decl and create a node attaching the
15524 default argument and constraint. */
15529 }
15531 /* Returns true if the parsed type actually represents the declaration
15532 of a type template-parameter. */
15536 {
15539 }
15542 /* Returns true if the parsed type actually represents the declaration of
15543 a template template-parameter. */
15545 static bool
15547 {
15550 }
15552 /* Parse a default argument for a type template-parameter.
15553 Note that diagnostics are handled in cp_parser_template_parameter. */
15555 static tree
15557 {
15560 /* Consume the `=' token. */
15565 /* Parse the default-argument. */
15571 {
15575 }
15578 }
15580 /* Parse a default argument for a template template-parameter. */
15582 static tree
15584 {
15589 /* Consume the `='. */
15591 /* Parse the id-expression. */
15593 /* save token before parsing the id-expression, for error
15594 reporting */
15596 tree default_argument
15604 /* If the id-expression was a template-id that refers to
15605 a template-class, we already have the declaration here,
15606 so no further lookup is needed. */
15607 ;
15608 else
15609 /* Look up the name. */
15610 default_argument
15612 none_type,
15618 /* See if the default argument is valid. */
15622 }
15624 /* Parse a template-parameter.
15626 template-parameter:
15627 type-parameter
15628 parameter-declaration
15630 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15631 the parameter. The TREE_PURPOSE is the default value, if any.
15632 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15633 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15634 set to true iff this parameter is a parameter pack. */
15636 static tree
15639 {
15642 tree parm;
15644 /* Assume it is a type parameter or a template parameter. */
15646 /* Assume it not a parameter pack. */
15648 /* Peek at the next token. */
15650 /* If it is `template', we have a type-parameter. */
15653 /* If it is `class' or `typename' we do not know yet whether it is a
15654 type parameter or a non-type parameter. Consider:
15656 template <typename T, typename T::X X> ...
15658 or:
15660 template <class C, class D*> ...
15662 Here, the first parameter is a type parameter, and the second is
15663 a non-type parameter. We can tell by looking at the token after
15664 the identifier -- if it is a `,', `=', or `>' then we have a type
15665 parameter. */
15667 {
15668 /* Peek at the token after `class' or `typename'. */
15670 /* If it's an ellipsis, we have a template type parameter
15671 pack. */
15674 /* If it's an identifier, skip it. */
15677 /* Now, see if the token looks like the end of a template
15678 parameter. */
15683 }
15685 /* Otherwise, it is a non-type parameter or a constrained parameter.
15687 [temp.param]
15689 When parsing a default template-argument for a non-type
15690 template-parameter, the first non-nested `>' is taken as the end
15691 of the template parameter-list rather than a greater-than
15692 operator. */
15693 parameter_declarator
15700 /* If the parameter declaration is marked as a parameter pack, set
15701 *IS_PARAMETER_PACK to notify the caller. */
15706 {
15707 /* Can happen in some cases of erroneous input (c++/34892). */
15709 /* Consume the `...' for better error recovery. */
15711 }
15713 // The parameter may have been constrained.
15716 parameter_declarator,
15717 is_non_type,
15718 is_parameter_pack);
15720 // Now we're sure that the parameter is a non-type parameter.
15731 }
15733 /* Parse a type-parameter.
15735 type-parameter:
15736 class identifier [opt]
15737 class identifier [opt] = type-id
15738 typename identifier [opt]
15739 typename identifier [opt] = type-id
15740 template < template-parameter-list > class identifier [opt]
15741 template < template-parameter-list > class identifier [opt]
15742 = id-expression
15744 GNU Extension (variadic templates):
15746 type-parameter:
15747 class ... identifier [opt]
15748 typename ... identifier [opt]
15750 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15751 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15752 the declaration of the parameter.
15754 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15756 static tree
15758 {
15760 tree parameter;
15762 /* Look for a keyword to tell us what kind of parameter this is. */
15768 {
15771 {
15772 tree identifier;
15773 tree default_argument;
15775 /* If the next token is an ellipsis, we have a template
15776 argument pack. */
15778 {
15779 /* Consume the `...' token. */
15784 }
15786 /* If the next token is an identifier, then it names the
15787 parameter. */
15790 else
15793 /* Create the parameter. */
15796 /* If the next token is an `=', we have a default argument. */
15798 {
15799 default_argument
15802 /* Template parameter packs cannot have default
15803 arguments. */
15805 {
15808 "template parameter pack %qD cannot have a "
15810 else
15812 "template parameter packs cannot have "
15815 }
15818 }
15819 else
15822 /* Create the combined representation of the parameter and the
15823 default argument. */
15825 }
15829 {
15830 tree identifier;
15831 tree default_argument;
15833 /* Look for the `<'. */
15835 /* Parse the template-parameter-list. */
15837 /* Look for the `>'. */
15840 // If template requirements are present, parse them.
15842 {
15847 }
15849 /* Look for the `class' or 'typename' keywords. */
15851 /* If the next token is an ellipsis, we have a template
15852 argument pack. */
15854 {
15855 /* Consume the `...' token. */
15860 }
15861 /* If the next token is an `=', then there is a
15862 default-argument. If the next token is a `>', we are at
15863 the end of the parameter-list. If the next token is a `,',
15864 then we are at the end of this parameter. */
15868 {
15870 /* Treat invalid names as if the parameter were nameless. */
15873 }
15874 else
15877 /* Create the template parameter. */
15879 identifier);
15881 /* If the next token is an `=', then there is a
15882 default-argument. */
15884 {
15885 default_argument
15888 /* Template parameter packs cannot have default
15889 arguments. */
15891 {
15894 "template parameter pack %qD cannot "
15896 identifier);
15897 else
15901 }
15902 }
15903 else
15906 /* Create the combined representation of the parameter and the
15907 default argument. */
15909 }
15915 }
15918 }
15920 /* Parse a template-id.
15922 template-id:
15923 template-name < template-argument-list [opt] >
15925 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15926 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15927 returned. Otherwise, if the template-name names a function, or set
15928 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15929 names a class, returns a TYPE_DECL for the specialization.
15931 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15932 uninstantiated templates. */
15934 static tree
15940 {
15941 tree templ;
15942 tree arguments;
15943 tree template_id;
15948 /* If the next token corresponds to a template-id, there is no need
15949 to reparse it. */
15952 {
15955 }
15957 /* Avoid performing name lookup if there is no possibility of
15958 finding a template-id. */
15961 && !cp_parser_nth_token_starts_template_argument_list_p
15963 {
15966 }
15968 /* Remember where the template-id starts. */
15974 /* Parse the template-name. */
15977 check_dependency_p,
15978 is_declaration,
15979 tag_type,
15982 {
15985 }
15987 /* Since we're going to preserve any side-effects from this parse, set up a
15988 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15989 in the template arguments. */
15992 /* If we find the sequence `[:' after a template-name, it's probably
15993 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15994 parse correctly the argument list. */
16001 {
16003 /* Change `:' into `::'. */
16005 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
16006 CPP_LESS. */
16009 /* Parse the arguments. */
16012 {
16013 /* If we couldn't parse an argument list, then we revert our changes
16014 and return simply an error. Maybe this is not a template-id
16015 after all. */
16020 }
16021 /* Otherwise, emit an error about the invalid digraph, but continue
16022 parsing because we got our argument list. */
16025 {
16028 "%<<:%> is an alternate spelling for %<[%>."
16031 {
16033 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
16036 }
16037 }
16038 }
16039 else
16040 {
16041 /* Look for the `<' that starts the template-argument-list. */
16043 {
16046 }
16047 /* Parse the arguments. */
16052 && !template_keyword_p
16055 {
16056 /* This didn't go well. */
16058 {
16059 /* C++2A says that "function-name < a;" is now ill-formed. */
16061 {
16064 "operand of %<<%> is ill-formed in C++2a; wrap the "
16066 }
16067 else
16068 /* We expect "f<targs>" to be followed by "(args)". */
16072 /* Purge all subsequent tokens. */
16074 }
16075 else
16079 }
16080 }
16082 /* Set the location to be of the form:
16083 template-name < template-argument-list [opt] >
16084 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
16085 with caret == start at the start of the template-name,
16086 ranging until the closing '>'. */
16087 location_t finish_loc
16089 location_t combined_loc
16092 /* Check for concepts autos where they don't belong. We could
16093 identify types in some cases of idnetifier TEMPL, looking ahead
16094 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
16095 types. We reject them in functions, but if what we have is an
16096 identifier, even with none_type we can't conclude it's NOT a
16097 type, we have to wait for template substitution. */
16100 /* Build a representation of the specialization. */
16103 TEMPLATE_ID_EXPR,
16107 {
16108 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
16109 template (rather than some instantiation thereof) only if
16110 is not nested within some other construct. For example, in
16111 "template <typename T> void f(T) { A<T>::", A<T> is just an
16112 instantiation of A. */
16113 bool entering_scope
16116 template_id
16118 }
16119 /* A template-like identifier may be a partial concept id. */
16125 {
16129 }
16130 else
16131 {
16132 /* If it's not a class-template or a template-template, it should be
16133 a function-template. */
16142 }
16144 /* If parsing tentatively, replace the sequence of tokens that makes
16145 up the template-id with a CPP_TEMPLATE_ID token. That way,
16146 should we re-parse the token stream, we will not have to repeat
16147 the effort required to do the parse, nor will we issue duplicate
16148 error messages about problems during instantiation of the
16149 template. */
16151 /* Don't do this if we had a parse error in a declarator; re-parsing
16152 might succeed if a name changes meaning (60361). */
16156 {
16157 /* Reset the contents of the START_OF_ID token. */
16161 /* Retrieve any deferred checks. Do not pop this access checks yet
16162 so the memory will not be reclaimed during token replacing below. */
16168 /* Purge all subsequent tokens. */
16171 /* ??? Can we actually assume that, if template_id ==
16172 error_mark_node, we will have issued a diagnostic to the
16173 user, as opposed to simply marking the tentative parse as
16174 failed? */
16177 }
16181 }
16183 /* Parse a template-name.
16185 template-name:
16186 identifier
16188 The standard should actually say:
16190 template-name:
16191 identifier
16192 operator-function-id
16194 A defect report has been filed about this issue.
16196 A conversion-function-id cannot be a template name because they cannot
16197 be part of a template-id. In fact, looking at this code:
16199 a.operator K<int>()
16201 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
16202 It is impossible to call a templated conversion-function-id with an
16203 explicit argument list, since the only allowed template parameter is
16204 the type to which it is converting.
16206 If TEMPLATE_KEYWORD_P is true, then we have just seen the
16207 `template' keyword, in a construction like:
16209 T::template f<3>()
16211 In that case `f' is taken to be a template-name, even though there
16212 is no way of knowing for sure.
16214 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
16215 name refers to a set of overloaded functions, at least one of which
16216 is a template, or an IDENTIFIER_NODE with the name of the template,
16217 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
16218 names are looked up inside uninstantiated templates. */
16220 static tree
16227 {
16228 tree identifier;
16229 tree decl;
16232 /* If the next token is `operator', then we have either an
16233 operator-function-id or a conversion-function-id. */
16235 {
16236 /* We don't know whether we're looking at an
16237 operator-function-id or a conversion-function-id. */
16239 /* Try an operator-function-id. */
16241 /* If that didn't work, try a conversion-function-id. */
16243 {
16246 }
16247 }
16248 /* Look for the identifier. */
16249 else
16252 /* If we didn't find an identifier, we don't have a template-id. */
16256 /* If the name immediately followed the `template' keyword, then it
16257 is a template-name. However, if the next token is not `<', then
16258 we do not treat it as a template-name, since it is not being used
16259 as part of a template-id. This enables us to handle constructs
16260 like:
16262 template <typename T> struct S { S(); };
16263 template <typename T> S<T>::S();
16265 correctly. We would treat `S' as a template -- if it were `S<T>'
16266 -- but we do not if there is no `<'. */
16270 {
16271 /* In a declaration, in a dependent context, we pretend that the
16272 "template" keyword was present in order to improve error
16273 recovery. For example, given:
16275 template <typename T> void f(T::X<int>);
16277 we want to treat "X<int>" as a template-id. */
16279 && !template_keyword_p
16281 && check_dependency_p
16283 /* Do not do this for dtors (or ctors), since they never
16284 need the template keyword before their name. */
16286 {
16289 /* Explain what went wrong. */
16291 identifier);
16294 /* If parsing tentatively, find the location of the "<" token. */
16297 /* Parse the template arguments so that we can issue error
16298 messages about them. */
16301 /* Skip tokens until we find a good place from which to
16302 continue parsing. */
16307 /* If parsing tentatively, permanently remove the
16308 template argument list. That will prevent duplicate
16309 error messages from being issued about the missing
16310 "template" keyword. */
16317 }
16319 /* If the "template" keyword is present, then there is generally
16320 no point in doing name-lookup, so we just return IDENTIFIER.
16321 But, if the qualifying scope is non-dependent then we can
16322 (and must) do name-lookup normally. */
16324 {
16330 {
16331 /* We're optimizing away the call to cp_parser_lookup_name, but
16332 we still need to do this. */
16335 }
16336 }
16337 }
16339 /* cp_parser_lookup_name clears OBJECT_TYPE. */
16343 /* Look up the name. */
16345 tag_type,
16348 check_dependency_p,
16354 /* If DECL is a template, then the name was a template-name. */
16356 {
16360 }
16361 else
16362 {
16363 /* The standard does not explicitly indicate whether a name that
16364 names a set of overloaded declarations, some of which are
16365 templates, is a template-name. However, such a name should
16366 be a template-name; otherwise, there is no way to form a
16367 template-id for the overloaded templates. */
16377 && !scoped_p
16379 {
16380 /* [temp.names] says "A name is also considered to refer to a template
16381 if it is an unqualified-id followed by a < and name lookup finds
16382 either one or more functions or finds nothing." */
16384 /* The "more functions" case. Just use the OVERLOAD as normally.
16385 We don't use is_overloaded_fn here to avoid considering
16386 BASELINKs. */
16388 /* Name lookup found one function. */
16391 /* Name lookup found nothing. */
16394 }
16397 {
16398 /* The name does not name a template. */
16401 }
16402 }
16405 }
16407 /* Parse a template-argument-list.
16409 template-argument-list:
16410 template-argument ... [opt]
16411 template-argument-list , template-argument ... [opt]
16413 Returns a TREE_VEC containing the arguments. */
16415 static tree
16417 {
16422 tree vec;
16429 /* Even if the template-id appears in an integral
16430 constant-expression, the contents of the argument list do
16431 not. */
16437 /* Parse the arguments. */
16438 do
16439 {
16440 tree argument;
16443 /* Consume the comma. */
16446 /* Parse the template-argument. */
16449 /* If the next token is an ellipsis, we're expanding a template
16450 argument pack. */
16452 {
16454 {
16458 }
16459 /* Consume the `...' token. */
16462 /* Make the argument into a TYPE_PACK_EXPANSION or
16463 EXPR_PACK_EXPANSION. */
16465 }
16468 {
16472 {
16475 }
16476 else
16478 }
16480 }
16496 }
16498 /* Parse a template-argument.
16500 template-argument:
16501 assignment-expression
16502 type-id
16503 id-expression
16505 The representation is that of an assignment-expression, type-id, or
16506 id-expression -- except that the qualified id-expression is
16507 evaluated, so that the value returned is either a DECL or an
16508 OVERLOAD.
16510 Although the standard says "assignment-expression", it forbids
16511 throw-expressions or assignments in the template argument.
16512 Therefore, we use "conditional-expression" instead. */
16514 static tree
16516 {
16517 tree argument;
16523 cp_id_kind idk;
16525 /* There's really no way to know what we're looking at, so we just
16526 try each alternative in order.
16528 [temp.arg]
16530 In a template-argument, an ambiguity between a type-id and an
16531 expression is resolved to a type-id, regardless of the form of
16532 the corresponding template-parameter.
16534 Therefore, we try a type-id first. */
16537 /* If there was no error parsing the type-id but the next token is a
16538 '>>', our behavior depends on which dialect of C++ we're
16539 parsing. In C++98, we probably found a typo for '> >'. But there
16540 are type-id which are also valid expressions. For instance:
16542 struct X { int operator >> (int); };
16543 template <int V> struct Foo {};
16544 Foo<X () >> 5> r;
16546 Here 'X()' is a valid type-id of a function type, but the user just
16547 wanted to write the expression "X() >> 5". Thus, we remember that we
16548 found a valid type-id, but we still try to parse the argument as an
16549 expression to see what happens.
16551 In C++0x, the '>>' will be considered two separate '>'
16552 tokens. */
16556 {
16559 }
16560 else
16561 {
16562 /* If the next token isn't a `,' or a `>', then this argument wasn't
16563 really finished. This means that the argument is not a valid
16564 type-id. */
16567 /* If that worked, we're done. */
16570 }
16571 /* We're still not sure what the argument will be. */
16573 /* Try a template. */
16581 /* If the next token isn't a `,' or a `>', then this argument wasn't
16582 really finished. */
16586 {
16587 /* Figure out what is being referred to. If the id-expression
16588 was for a class template specialization, then we will have a
16589 TYPE_DECL at this point. There is no need to do name lookup
16590 at this point in that case. */
16593 none_type,
16599 /* Handle a constrained-type-specifier for a non-type template
16600 parameter. */
16606 }
16608 {
16612 }
16613 /* It must be a non-type argument. In C++17 any constant-expression is
16614 allowed. */
16618 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16620 -- an integral constant-expression of integral or enumeration
16621 type; or
16623 -- the name of a non-type template-parameter; or
16625 -- the name of an object or function with external linkage...
16627 -- the address of an object or function with external linkage...
16629 -- a pointer to member... */
16630 /* Look for a non-type template parameter. */
16632 {
16644 }
16646 /* If the next token is "&", the argument must be the address of an
16647 object or function with external linkage. */
16650 {
16653 }
16654 /* See if we might have an id-expression. */
16661 {
16664 address_p,
16671 else
16672 {
16673 tree probe;
16676 {
16677 /* Strip the dereference temporarily. */
16680 }
16682 /* If we're in a template, we represent a qualified-id referring
16683 to a static data member as a SCOPE_REF even if the scope isn't
16684 dependent so that we can check access control later. */
16689 {
16690 /* A variable without external linkage might still be a
16691 valid constant-expression, so no error is issued here
16692 if the external-linkage check fails. */
16695 }
16697 /* All overloaded functions are allowed; if the external
16698 linkage test does not pass, an error will be issued
16699 later. */
16700 ;
16704 /* A pointer-to-member. */
16705 ;
16707 ;
16708 else
16712 {
16715 tf_warning_or_error);
16716 else
16719 }
16720 }
16721 }
16722 /* If the argument started with "&", there are no other valid
16723 alternatives at this point. */
16725 {
16728 }
16730 general_expr:
16731 /* If the argument wasn't successfully parsed as a type-id followed
16732 by '>>', the argument can only be a constant expression now.
16733 Otherwise, we try parsing the constant-expression tentatively,
16734 because the argument could really be a type-id. */
16740 else
16741 {
16742 /* With C++17 generalized non-type template arguments we need to handle
16743 lvalue constant expressions, too. */
16746 }
16754 /* We did our best to parse the argument as a non type-id, but that
16755 was the only alternative that matched (albeit with a '>' after
16756 it). We can assume it's just a typo from the user, and a
16757 diagnostic will then be issued. */
16759 }
16761 /* Parse an explicit-instantiation.
16763 explicit-instantiation:
16764 template declaration
16766 Although the standard says `declaration', what it really means is:
16768 explicit-instantiation:
16769 template decl-specifier-seq [opt] declarator [opt] ;
16771 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16772 supposed to be allowed. A defect report has been filed about this
16773 issue.
16775 GNU Extension:
16777 explicit-instantiation:
16778 storage-class-specifier template
16779 decl-specifier-seq [opt] declarator [opt] ;
16780 function-specifier template
16781 decl-specifier-seq [opt] declarator [opt] ; */
16783 static void
16785 {
16787 cp_decl_specifier_seq decl_specifiers;
16792 /* Look for an (optional) storage-class-specifier or
16793 function-specifier. */
16795 {
16796 extension_specifier
16799 extension_specifier
16802 }
16804 /* Look for the `template' keyword. */
16806 /* Let the front end know that we are processing an explicit
16807 instantiation. */
16809 /* [temp.explicit] says that we are supposed to ignore access
16810 control while processing explicit instantiation directives. */
16812 /* Parse a decl-specifier-seq. */
16814 CP_PARSER_FLAGS_OPTIONAL,
16817 /* If there was exactly one decl-specifier, and it declared a class,
16818 and there's no declarator, then we have an explicit type
16819 instantiation. */
16821 {
16822 tree type;
16826 /* Turn access control back on for names used during
16827 template instantiation. */
16832 }
16833 else
16834 {
16836 tree decl;
16838 /* Parse the declarator. */
16839 declarator
16850 {
16853 "explicit instantiation shall not use"
16857 "explicit instantiation shall not use"
16862 /* Turn access control back on for names used during
16863 template instantiation. */
16865 /* Do the explicit instantiation. */
16867 }
16868 else
16869 {
16871 /* Skip the body of the explicit instantiation. */
16873 }
16874 }
16875 /* We're done with the instantiation. */
16881 }
16883 /* Parse an explicit-specialization.
16885 explicit-specialization:
16886 template < > declaration
16888 Although the standard says `declaration', what it really means is:
16890 explicit-specialization:
16891 template <> decl-specifier [opt] init-declarator [opt] ;
16892 template <> function-definition
16893 template <> explicit-specialization
16894 template <> template-declaration */
16896 static void
16898 {
16902 /* Look for the `template' keyword. */
16904 /* Look for the `<'. */
16906 /* Look for the `>'. */
16908 /* We have processed another parameter list. */
16910 /* [temp]
16912 A template ... explicit specialization ... shall not have C
16913 linkage. */
16915 {
16918 /* Give it C++ linkage to avoid confusing other parts of the
16919 front end. */
16922 }
16923 else
16925 /* Let the front end know that we are beginning a specialization. */
16927 {
16930 }
16932 /* If the next keyword is `template', we need to figure out whether
16933 or not we're looking a template-declaration. */
16935 {
16940 else
16942 }
16943 else
16944 /* Parse the dependent declaration. */
16950 /* We're done with the specialization. */
16952 /* For the erroneous case of a template with C linkage, we pushed an
16953 implicit C++ linkage scope; exit that scope now. */
16956 /* We're done with this parameter list. */
16958 }
16960 /* Parse a type-specifier.
16962 type-specifier:
16963 simple-type-specifier
16964 class-specifier
16965 enum-specifier
16966 elaborated-type-specifier
16967 cv-qualifier
16969 GNU Extension:
16971 type-specifier:
16972 __complex__
16974 Returns a representation of the type-specifier. For a
16975 class-specifier, enum-specifier, or elaborated-type-specifier, a
16976 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16978 The parser flags FLAGS is used to control type-specifier parsing.
16980 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16981 in a decl-specifier-seq.
16983 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16984 class-specifier, enum-specifier, or elaborated-type-specifier, then
16985 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16986 if a type is declared; 2 if it is defined. Otherwise, it is set to
16987 zero.
16989 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16990 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16991 is set to FALSE. */
16993 static tree
16995 cp_parser_flags flags,
17000 {
17006 /* Assume this type-specifier does not declare a new type. */
17009 /* And that it does not specify a cv-qualifier. */
17012 /* Peek at the next token. */
17015 /* If we're looking at a keyword, we can use that to guide the
17016 production we choose. */
17019 {
17024 /* Look for the enum-specifier. */
17026 /* If that worked, we're done. */
17028 {
17033 type_spec,
17034 token,
17037 }
17038 else
17041 /* Any of these indicate either a class-specifier, or an
17042 elaborated-type-specifier. */
17049 /* Parse tentatively so that we can back up if we don't find a
17050 class-specifier. */
17052 /* Look for the class-specifier. */
17055 /* If that worked, we're done. */
17057 {
17062 type_spec,
17063 token,
17066 }
17068 /* Fall through. */
17069 elaborated_type_specifier:
17070 /* We're declaring (not defining) a class or enum. */
17074 /* Fall through. */
17076 /* Look for an elaborated-type-specifier. */
17077 type_spec
17078 = (cp_parser_elaborated_type_specifier
17081 is_declaration));
17084 type_spec,
17085 token,
17108 /* The `__complex__' keyword is a GNU extension. */
17114 }
17116 /* Handle simple keywords. */
17118 {
17120 {
17123 }
17125 }
17127 /* If we do not already have a type-specifier, assume we are looking
17128 at a simple-type-specifier. */
17130 decl_specs,
17131 flags);
17133 /* If we didn't find a type-specifier, and a type-specifier was not
17134 optional in this context, issue an error message. */
17136 {
17139 }
17142 }
17144 /* Parse a simple-type-specifier.
17146 simple-type-specifier:
17147 :: [opt] nested-name-specifier [opt] type-name
17148 :: [opt] nested-name-specifier template template-id
17149 char
17150 wchar_t
17151 bool
17152 short
17153 int
17154 long
17155 signed
17156 unsigned
17157 float
17158 double
17159 void
17161 C++11 Extension:
17163 simple-type-specifier:
17164 auto
17165 decltype ( expression )
17166 char16_t
17167 char32_t
17168 __underlying_type ( type-id )
17170 C++17 extension:
17172 nested-name-specifier(opt) template-name
17174 GNU Extension:
17176 simple-type-specifier:
17177 __int128
17178 __typeof__ unary-expression
17179 __typeof__ ( type-id )
17180 __typeof__ ( type-id ) { initializer-list , [opt] }
17182 Concepts Extension:
17184 simple-type-specifier:
17185 constrained-type-specifier
17187 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
17188 appropriately updated. */
17190 static tree
17193 cp_parser_flags flags)
17194 {
17199 /* Peek at the next token. */
17202 /* If we're looking at a keyword, things are easy. */
17204 {
17239 {
17242 }
17271 {
17272 /* The 'auto' might be the placeholder return type for a function decl
17273 with trailing return type. */
17282 {
17284 {
17291 }
17294 {
17297 }
17300 }
17304 {
17307 }
17310 {
17313 }
17314 else
17318 {
17321 "use of %<auto%> in lambda parameter declaration "
17322 "only available with "
17324 }
17327 "use of %<auto%> in parameter declaration "
17328 "only available with "
17332 "use of %<auto%> in parameter declaration "
17334 }
17335 else
17340 /* Since DR 743, decltype can either be a simple-type-specifier by
17341 itself or begin a nested-name-specifier. Parsing it will replace
17342 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17343 handling below decide what to do. */
17349 /* Consume the `typeof' token. */
17351 /* Parse the operand to `typeof'. */
17353 /* If it is not already a TYPE, take its type. */
17359 token,
17368 token,
17378 token,
17383 }
17385 /* If token is an already-parsed decltype not followed by ::,
17386 it's a simple-type-specifier. */
17389 {
17392 {
17394 token,
17396 /* Remember that we are handling a decltype in order to
17397 implement the resolution of DR 1510 when the argument
17398 isn't instantiation dependent. */
17400 }
17403 }
17405 /* If the type-specifier was for a built-in type, we're done. */
17407 {
17408 /* Record the type. */
17415 type,
17416 token,
17421 /* Consume the token. */
17427 /* There is no valid C++ program where a non-template type is
17428 followed by a "<". That usually indicates that the user thought
17429 that the type was a template. */
17434 }
17436 /* The type-specifier must be a user-defined type. */
17438 {
17442 /* Don't gobble tokens or issue error messages if this is an
17443 optional type-specifier. */
17449 /* Look for the optional `::' operator. */
17450 global_p
17454 /* Look for the nested-name specifier. */
17455 qualified_p
17462 /* If we have seen a nested-name-specifier, and the next token
17463 is `template', then we are using the template-id production. */
17466 {
17467 /* Look for the template-id. */
17471 none_type,
17473 /* If the template-id did not name a type, we are out of
17474 luck. */
17476 {
17479 }
17480 }
17481 /* Otherwise, look for a type-name. */
17482 else
17484 /* Keep track of all name-lookups performed in class scopes. */
17486 && !global_p
17487 && !qualified_p
17491 /* If it didn't work out, we don't have a TYPE. */
17496 {
17510 {
17512 none_type,
17522 else
17523 {
17528 }
17529 }
17530 else
17536 }
17539 token,
17541 }
17543 /* If we didn't get a type-name, issue an error message. */
17545 {
17548 }
17551 {
17552 /* See if TYPE is an Objective-C type, and if so, parse and
17553 accept any protocol references following it. Do this before
17554 the cp_parser_check_for_invalid_template_id() call, because
17555 Objective-C types can be followed by '<...>' which would
17556 enclose protocol names rather than template arguments, and so
17557 everything is fine. */
17560 {
17564 /* Clobber the "unqualified" type previously entered into
17565 DECL_SPECS with the new, improved protocol-qualified version. */
17570 }
17572 /* There is no valid C++ program where a non-template type is
17573 followed by a "<". That usually indicates that the user
17574 thought that the type was a template. */
17576 none_type,
17578 }
17581 }
17583 /* Parse a type-name.
17585 type-name:
17586 class-name
17587 enum-name
17588 typedef-name
17589 simple-template-id [in c++0x]
17591 enum-name:
17592 identifier
17594 typedef-name:
17595 identifier
17597 Concepts:
17599 type-name:
17600 concept-name
17601 partial-concept-id
17603 concept-name:
17604 identifier
17606 Returns a TYPE_DECL for the type. */
17608 static tree
17610 {
17612 }
17614 /* See above. */
17615 static tree
17617 {
17618 tree type_decl;
17620 /* We can't know yet whether it is a class-name or not. */
17622 /* Try a class-name. */
17624 typename_keyword_p,
17626 none_type,
17630 /* If it's not a class-name, keep looking. */
17632 {
17634 /* It must be a typedef-name or an enum-name. */
17638 /* It is either a simple-template-id representing an
17639 instantiation of an alias template... */
17643 none_type,
17645 /* Note that this must be an instantiation of an alias template
17646 because [temp.names]/6 says:
17648 A template-id that names an alias template specialization
17649 is a type-name.
17651 Whereas [temp.names]/7 says:
17653 A simple-template-id that names a class template
17654 specialization is a class-name.
17656 With concepts, this could also be a partial-concept-id that
17657 declares a non-type template parameter. */
17664 else
17668 /* ... Or a typedef-name or an enum-name. */
17670 }
17673 }
17675 /* Check if DECL and ARGS can form a constrained-type-specifier.
17676 If ARGS is non-null, we try to form a concept check of the
17677 form DECL<?, ARGS> where ? is a wildcard that matches any
17678 kind of template argument. If ARGS is NULL, then we try to
17679 form a concept check of the form DECL<?>. */
17681 static tree
17684 {
17687 /* If we a constrained-type-specifier cannot be deduced. */
17691 /* A constrained type specifier can only be found in an
17692 overload set or as a reference to a template declaration.
17694 FIXME: This might be masking a bug. It's possible that
17695 that the deduction below is causing template specializations
17696 to be formed with the wildcard as an argument. */
17700 /* Try to build a call expression that evaluates the
17701 concept. This can fail if the overload set refers
17702 only to non-templates. */
17708 /* Deduce the checked constraint and the prototype parameter.
17710 FIXME: In certain cases, failure to deduce should be a
17711 diagnosable error. */
17712 tree conc;
17713 tree proto;
17717 /* In template parameter scope, this results in a constrained
17718 parameter. Return a descriptor of that parm. */
17722 /* In a parameter-declaration-clause, constrained-type
17723 specifiers result in invented template parameters. */
17725 {
17728 }
17729 else
17730 {
17731 /* Otherwise, we're in a context where the constrained
17732 type name is deduced and the constraint applies
17733 after deduction. */
17735 }
17738 }
17740 /* If DECL refers to a concept, return a TYPE_DECL representing
17741 the result of using the constrained type specifier in the
17742 current context. DECL refers to a concept if
17744 - it is an overload set containing a function concept taking a single
17745 type argument, or
17747 - it is a variable concept taking a single type argument. */
17749 static tree
17751 {
17757 else
17759 }
17761 /* Check if DECL and ARGS form a partial-concept-id. If so,
17762 assign ID to the resulting constrained placeholder.
17764 Returns true if the partial-concept-id designates a placeholder
17765 and false otherwise. Note that *id is set to NULL_TREE in
17766 this case. */
17768 static tree
17770 {
17772 }
17774 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17775 or a concept-name.
17777 enum-name:
17778 identifier
17780 typedef-name:
17781 identifier
17783 concept-name:
17784 identifier
17786 Returns a TYPE_DECL for the type. */
17788 static tree
17790 {
17791 tree type_decl;
17792 tree identifier;
17799 /* Look up the type-name. */
17804 /* If we found an overload set, then it may refer to a concept-name. */
17810 {
17811 /* See if this is an Objective-C type. */
17816 }
17818 /* Issue an error if we did not find a type-name. */
17820 /* In Objective-C, we have the complication that class names are
17821 normally type names and start declarations (eg, the
17822 "NSObject" in "NSObject *object;"), but can be used in an
17823 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17824 is an expression. So, a classname followed by a dot is not a
17825 valid type-name. */
17828 {
17833 }
17834 /* Remember that the name was used in the definition of the
17835 current class so that we can check later to see if the
17836 meaning would have been different after the class was
17837 entirely defined. */
17843 }
17845 /* Parse an elaborated-type-specifier. Note that the grammar given
17846 here incorporates the resolution to DR68.
17848 elaborated-type-specifier:
17849 class-key :: [opt] nested-name-specifier [opt] identifier
17850 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17851 enum-key :: [opt] nested-name-specifier [opt] identifier
17852 typename :: [opt] nested-name-specifier identifier
17853 typename :: [opt] nested-name-specifier template [opt]
17854 template-id
17856 GNU extension:
17858 elaborated-type-specifier:
17859 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17860 class-key attributes :: [opt] nested-name-specifier [opt]
17861 template [opt] template-id
17862 enum attributes :: [opt] nested-name-specifier [opt] identifier
17864 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17865 declared `friend'. If IS_DECLARATION is TRUE, then this
17866 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17867 something is being declared.
17869 Returns the TYPE specified. */
17871 static tree
17875 {
17877 tree identifier;
17880 tree globalscope;
17883 /* See if we're looking at the `enum' keyword. */
17885 {
17886 /* Consume the `enum' token. */
17888 /* Remember that it's an enumeration type. */
17890 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17891 enums) is used here. */
17895 {
17902 /* Consume the `struct' or `class' and parse it anyway. */
17904 }
17905 /* Parse the attributes. */
17907 }
17908 /* Or, it might be `typename'. */
17910 RID_TYPENAME))
17911 {
17912 /* Consume the `typename' token. */
17914 /* Remember that it's a `typename' type. */
17916 }
17917 /* Otherwise it must be a class-key. */
17918 else
17919 {
17923 /* Parse the attributes. */
17925 }
17927 /* Look for the `::' operator. */
17930 /* Look for the nested-name-specifier. */
17931 tree nested_name_specifier;
17933 {
17934 nested_name_specifier
17939 is_declaration);
17942 }
17943 else
17944 /* Even though `typename' is not present, the proposed resolution
17945 to Core Issue 180 says that in `class A<T>::B', `B' should be
17946 considered a type-name, even if `A<T>' is dependent. */
17947 nested_name_specifier
17952 is_declaration);
17953 /* For everything but enumeration types, consider a template-id.
17954 For an enumeration type, consider only a plain identifier. */
17956 {
17958 tree decl;
17960 /* Allow the `template' keyword. */
17962 /* If we didn't see `template', we don't know if there's a
17963 template-id or not. */
17966 /* Parse the template-id. */
17970 tag_type,
17971 is_declaration);
17972 /* If we didn't find a template-id, look for an ordinary
17973 identifier. */
17975 ;
17976 /* We can get here when cp_parser_template_id, called by
17977 cp_parser_class_name with tag_type == none_type, succeeds
17978 and caches a BASELINK. Then, when called again here,
17979 instead of failing and returning an error_mark_node
17980 returns it (see template/typename17.C in C++11).
17981 ??? Could we diagnose this earlier? */
17983 {
17986 }
17987 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17988 in effect, then we must assume that, upon instantiation, the
17989 template will correspond to a class. */
17993 typename_type,
17995 /* If the `typename' keyword is in effect and DECL is not a type
17996 decl, then type is non existent. */
17998 ;
18000 {
18004 /* If the next token is a semicolon, this must be a specialization,
18005 instantiation, or friend declaration. Check the scope while we
18006 still know whether or not we had a nested-name-specifier. */
18011 }
18014 }
18017 {
18022 {
18025 }
18027 /* For a `typename', we needn't call xref_tag. */
18033 /* Template parameter lists apply only if we are not within a
18034 function parameter list. */
18035 bool template_parm_lists_apply
18044 /* Look up a qualified name in the usual way. */
18046 {
18047 tree decl;
18048 tree ambiguous_decls;
18051 tag_type,
18058 /* If the lookup was ambiguous, an error will already have been
18059 issued. */
18063 /* If we are parsing friend declaration, DECL may be a
18064 TEMPLATE_DECL tree node here. However, we need to check
18065 whether this TEMPLATE_DECL results in valid code. Consider
18066 the following example:
18068 namespace N {
18069 template <class T> class C {};
18070 }
18071 class X {
18072 template <class T> friend class N::C; // #1, valid code
18073 };
18074 template <class T> class Y {
18075 friend class N::C; // #2, invalid code
18076 };
18078 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
18079 name lookup of `N::C'. We see that friend declaration must
18080 be template for the code to be valid. Note that
18081 processing_template_decl does not work here since it is
18082 always 1 for the above two cases. */
18084 decl = (cp_parser_maybe_treat_template_as_class
18089 {
18091 identifier,
18094 }
18097 {
18101 allow_template);
18105 }
18107 /* Forward declarations of nested types, such as
18109 class C1::C2;
18110 class C1::C2::C3;
18112 are invalid unless all components preceding the final '::'
18113 are complete. If all enclosing types are complete, these
18114 declarations become merely pointless.
18116 Invalid forward declarations of nested types are errors
18117 caught elsewhere in parsing. Those that are pointless arrive
18118 here. */
18125 }
18126 else
18127 {
18128 /* An elaborated-type-specifier sometimes introduces a new type and
18129 sometimes names an existing type. Normally, the rule is that it
18130 introduces a new type only if there is not an existing type of
18131 the same name already in scope. For example, given:
18133 struct S {};
18134 void f() { struct S s; }
18136 the `struct S' in the body of `f' is the same `struct S' as in
18137 the global scope; the existing definition is used. However, if
18138 there were no global declaration, this would introduce a new
18139 local class named `S'.
18141 An exception to this rule applies to the following code:
18143 namespace N { struct S; }
18145 Here, the elaborated-type-specifier names a new type
18146 unconditionally; even if there is already an `S' in the
18147 containing scope this declaration names a new type.
18148 This exception only applies if the elaborated-type-specifier
18149 forms the complete declaration:
18151 [class.name]
18153 A declaration consisting solely of `class-key identifier ;' is
18154 either a redeclaration of the name in the current scope or a
18155 forward declaration of the identifier as a class name. It
18156 introduces the name into the current scope.
18158 We are in this situation precisely when the next token is a `;'.
18160 An exception to the exception is that a `friend' declaration does
18161 *not* name a new type; i.e., given:
18163 struct S { friend struct T; };
18165 `T' is not a new type in the scope of `S'.
18167 Also, `new struct S' or `sizeof (struct S)' never results in the
18168 definition of a new type; a new type can only be declared in a
18169 declaration context. */
18171 tag_scope ts;
18175 /* Friends have special name lookup rules. */
18179 CPP_SEMICOLON))
18180 /* This is a `class-key identifier ;' */
18182 else
18185 template_p =
18186 (template_parm_lists_apply
18189 /* An unqualified name was used to reference this type, so
18190 there were no qualifying templates. */
18199 }
18200 }
18205 /* Allow attributes on forward declarations of classes. */
18207 {
18217 else
18220 }
18223 {
18224 /* Indicate whether this class was declared as a `class' or as a
18225 `struct'. */
18229 }
18231 /* A "<" cannot follow an elaborated type specifier. If that
18232 happens, the user was probably trying to form a template-id. */
18237 }
18239 /* Parse an enum-specifier.
18241 enum-specifier:
18242 enum-head { enumerator-list [opt] }
18243 enum-head { enumerator-list , } [C++0x]
18245 enum-head:
18246 enum-key identifier [opt] enum-base [opt]
18247 enum-key nested-name-specifier identifier enum-base [opt]
18249 enum-key:
18250 enum
18251 enum class [C++0x]
18252 enum struct [C++0x]
18254 enum-base: [C++0x]
18255 : type-specifier-seq
18257 opaque-enum-specifier:
18258 enum-key identifier enum-base [opt] ;
18260 GNU Extensions:
18261 enum-key attributes[opt] identifier [opt] enum-base [opt]
18262 { enumerator-list [opt] }attributes[opt]
18263 enum-key attributes[opt] identifier [opt] enum-base [opt]
18264 { enumerator-list, }attributes[opt] [C++0x]
18266 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
18267 if the token stream isn't an enum-specifier after all. */
18269 static tree
18271 {
18272 tree identifier;
18274 tree prev_scope;
18276 tree attributes;
18289 /* Parse tentatively so that we can back up if we don't find a
18290 enum-specifier. */
18293 /* Caller guarantees that the current token is 'enum', an identifier
18294 possibly follows, and the token after that is an opening brace.
18295 If we don't have an identifier, fabricate an anonymous name for
18296 the enumeration being defined. */
18299 /* Parse the "class" or "struct", which indicates a scoped
18300 enumeration type in C++0x. */
18303 {
18307 /* Consume the `struct' or `class' token. */
18311 }
18315 /* Clear the qualification. */
18320 /* Figure out in what scope the declaration is being placed. */
18326 nested_name_specifier
18334 {
18335 tree name;
18339 enum_type,
18344 input_location);
18346 {
18349 {
18350 /* Are template enums allowed in ISO? */
18354 /* ignore a typename reference, for it will be solved by name
18355 in start_enum. */
18357 }
18358 }
18361 else
18362 {
18367 }
18368 }
18369 else
18370 {
18373 else
18374 {
18380 }
18381 }
18384 /* Check for the `:' that denotes a specified underlying type in C++0x.
18385 Note that a ':' could also indicate a bitfield width, however. */
18387 {
18388 cp_decl_specifier_seq type_specifiers;
18390 /* Consume the `:'. */
18393 /* Parse the type-specifier-seq. */
18398 /* At this point this is surely not elaborated type specifier. */
18407 /* If that didn't work, stop. */
18409 {
18415 }
18416 }
18418 /* Look for the `{' but don't consume it yet. */
18420 {
18422 {
18425 {
18428 }
18429 }
18430 /* An opaque-enum-specifier must have a ';' here. */
18433 {
18436 {
18439 }
18440 }
18441 }
18447 {
18449 {
18453 }
18455 {
18457 }
18458 }
18460 /* Issue an error message if type-definitions are forbidden here. */
18463 else
18464 /* Create the new type. We do this before consuming the opening
18465 brace so the enum will be recorded as being on the line of its
18466 tag (or the 'enum' keyword, if there is no tag). */
18470 /* If the next token is not '{' it is an opaque-enum-specifier or an
18471 elaborated-type-specifier. */
18473 {
18477 {
18478 /* The following catches invalid code such as:
18479 enum class S<int>::E { A, B, C }; */
18487 {
18491 nested_name_specifier);
18493 }
18496 {
18498 "%qT for enum declaration does not name a class "
18501 }
18502 /* If that scope does not contain the scope in which the
18503 class was originally declared, the program is invalid. */
18505 nested_name_specifier))
18506 {
18509 "declaration of %qD in namespace %qD which does not "
18512 else
18514 "declaration of %qD in %qD which does not "
18518 }
18519 /* If that scope is the scope where the declaration is being placed
18520 the program is invalid. */
18524 {
18528 }
18529 }
18534 /* Consume the opening brace. */
18535 matching_braces braces;
18542 {
18546 }
18547 else
18548 {
18554 }
18558 /* If the next token is not '}', then there are some enumerators. */
18560 {
18564 }
18565 else
18568 /* Consume the final '}'. */
18574 }
18575 else
18576 {
18577 /* If a ';' follows, then it is an opaque-enum-specifier
18578 and additional restrictions apply. */
18580 {
18587 }
18588 }
18590 /* Look for trailing attributes to apply to this enumeration, and
18591 apply them if appropriate. */
18593 {
18596 trailing_attr,
18598 }
18600 /* Finish up the enumeration. */
18602 {
18607 }
18610 {
18612 {
18615 }
18617 {
18619 }
18620 }
18621 out:
18624 }
18626 /* Parse an enumerator-list. The enumerators all have the indicated
18627 TYPE.
18629 enumerator-list:
18630 enumerator-definition
18631 enumerator-list , enumerator-definition */
18633 static void
18635 {
18637 {
18638 /* Parse an enumerator-definition. */
18641 /* If the next token is not a ',', we've reached the end of
18642 the list. */
18645 /* Otherwise, consume the `,' and keep going. */
18647 /* If the next token is a `}', there is a trailing comma. */
18649 {
18654 }
18655 }
18656 }
18658 /* Parse an enumerator-definition. The enumerator has the indicated
18659 TYPE.
18661 enumerator-definition:
18662 enumerator
18663 enumerator = constant-expression
18665 enumerator:
18666 identifier
18668 GNU Extensions:
18670 enumerator-definition:
18671 enumerator attributes [opt]
18672 enumerator attributes [opt] = constant-expression */
18674 static void
18676 {
18677 tree identifier;
18678 tree value;
18679 location_t loc;
18681 /* Save the input location because we are interested in the location
18682 of the identifier and not the location of the explicit value. */
18685 /* Look for the identifier. */
18690 /* Parse any specified attributes. */
18693 /* If the next token is an '=', then there is an explicit value. */
18695 {
18696 /* Consume the `=' token. */
18698 /* Parse the value. */
18700 }
18701 else
18704 /* If we are processing a template, make sure the initializer of the
18705 enumerator doesn't contain any bare template parameter pack. */
18709 /* Create the enumerator. */
18711 }
18713 /* Parse a namespace-name.
18715 namespace-name:
18716 original-namespace-name
18717 namespace-alias
18719 Returns the NAMESPACE_DECL for the namespace. */
18721 static tree
18723 {
18724 tree identifier;
18725 tree namespace_decl;
18729 /* Get the name of the namespace. */
18734 /* Look up the identifier in the currently active scope. Look only
18735 for namespaces, due to:
18737 [basic.lookup.udir]
18739 When looking up a namespace-name in a using-directive or alias
18740 definition, only namespace names are considered.
18742 And:
18744 [basic.lookup.qual]
18746 During the lookup of a name preceding the :: scope resolution
18747 operator, object, function, and enumerator names are ignored.
18749 (Note that cp_parser_qualifying_entity only calls this
18750 function if the token after the name is the scope resolution
18751 operator.) */
18753 none_type,
18759 /* If it's not a namespace, issue an error. */
18762 {
18764 {
18765 auto_diagnostic_group d;
18766 name_hint hint;
18770 identifier,
18773 {
18779 }
18780 else
18782 identifier);
18783 }
18784 else
18787 }
18790 }
18792 /* Parse a namespace-definition.
18794 namespace-definition:
18795 named-namespace-definition
18796 unnamed-namespace-definition
18798 named-namespace-definition:
18799 original-namespace-definition
18800 extension-namespace-definition
18802 original-namespace-definition:
18803 namespace identifier { namespace-body }
18805 extension-namespace-definition:
18806 namespace original-namespace-name { namespace-body }
18808 unnamed-namespace-definition:
18809 namespace { namespace-body } */
18811 static void
18813 {
18814 tree identifier;
18823 {
18826 }
18828 /* Look for the `namespace' keyword. */
18829 cp_token* token
18832 /* Parse any specified attributes before the identifier. */
18836 {
18840 {
18845 "standard attributes on namespaces must precede "
18848 /* Parse any attributes specified after the identifier. */
18850 }
18857 "nested namespace definitions only available with "
18860 /* Nested namespace names can create new namespaces (unlike
18861 other qualified-ids). */
18864 else
18867 }
18879 /* Start the namespace. */
18886 /* Look for the `{' to validate starting the namespace. */
18887 matching_braces braces;
18889 {
18890 /* Parse the body of the namespace. */
18893 /* Look for the final `}'. */
18895 }
18900 /* Pop the nested namespace definitions. */
18903 }
18905 /* Parse a namespace-body.
18907 namespace-body:
18908 declaration-seq [opt] */
18910 static void
18912 {
18914 }
18916 /* Parse a namespace-alias-definition.
18918 namespace-alias-definition:
18919 namespace identifier = qualified-namespace-specifier ; */
18921 static void
18923 {
18924 tree identifier;
18925 tree namespace_specifier;
18929 /* Look for the `namespace' keyword. */
18931 /* Look for the identifier. */
18935 /* Look for the `=' token. */
18938 {
18940 /* Skip the definition. */
18945 }
18947 /* Look for the qualified-namespace-specifier. */
18948 namespace_specifier
18950 /* Look for the `;' token. */
18953 /* Register the alias in the symbol table. */
18955 }
18957 /* Parse a qualified-namespace-specifier.
18959 qualified-namespace-specifier:
18960 :: [opt] nested-name-specifier [opt] namespace-name
18962 Returns a NAMESPACE_DECL corresponding to the specified
18963 namespace. */
18965 static tree
18967 {
18968 /* Look for the optional `::'. */
18972 /* Look for the optional nested-name-specifier. */
18980 }
18982 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18983 access declaration.
18985 using-declaration:
18986 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18987 using :: unqualified-id ;
18989 access-declaration:
18990 qualified-id ;
18992 */
18994 static bool
18997 {
19001 tree decl;
19002 tree identifier;
19003 tree qscope;
19008 {
19011 }
19012 else
19013 {
19014 /* Look for the `using' keyword. */
19017 again:
19018 /* Peek at the next token. */
19020 /* See if it's `typename'. */
19022 {
19023 /* Remember that we've seen it. */
19025 /* Consume the `typename' token. */
19027 }
19028 }
19030 /* Look for the optional global scope qualification. */
19031 global_scope_p
19036 /* If we saw `typename', or didn't see `::', then there must be a
19037 nested-name-specifier present. */
19039 {
19045 {
19048 }
19049 }
19050 /* Otherwise, we could be in either of the two productions. In that
19051 case, treat the nested-name-specifier as optional. */
19052 else
19064 /* Something has already gone wrong; there's no need to parse
19065 further. Since an error has occurred, the return value of
19066 cp_parser_parse_definitely will be false, as required. */
19070 /* Parse the unqualified-id. */
19078 {
19083 }
19085 {
19090 "pack expansion in using-declaration only available "
19093 }
19095 /* The function we call to handle a using-declaration is different
19096 depending on what scope we are in. */
19098 ;
19101 /* [namespace.udecl]
19103 A using declaration shall not name a template-id. */
19106 else
19107 {
19109 {
19110 /* Create the USING_DECL. */
19117 {
19120 }
19121 else
19122 /* Add it to the list of members in this class. */
19124 }
19125 else
19126 {
19128 identifier,
19135 {
19138 }
19141 else
19143 }
19144 }
19148 {
19152 "comma-separated list in using-declaration only available "
19155 }
19157 /* Look for the final `;'. */
19162 "access declarations are deprecated "
19163 "in favour of using-declarations; "
19167 }
19169 /* Parse an alias-declaration.
19171 alias-declaration:
19172 using identifier attribute-specifier-seq [opt] = type-id */
19174 static tree
19176 {
19180 cp_decl_specifier_seq decl_specs;
19184 /* Look for the `using' keyword. */
19185 cp_token *using_token
19207 /* Now we are going to parse the type-id of the declaration. */
19209 /*
19210 [dcl.type]/3 says:
19212 "A type-specifier-seq shall not define a class or enumeration
19213 unless it appears in the type-id of an alias-declaration (7.1.3) that
19214 is not the declaration of a template-declaration."
19216 In other words, if we currently are in an alias template, the
19217 type-id should not define a type.
19219 So let's set parser->type_definition_forbidden_message in that
19220 case; cp_parser_check_type_definition (called by
19221 cp_parser_class_specifier) will then emit an error if a type is
19222 defined in the type-id. */
19224 {
19228 }
19232 /* Restore the error message if need be. */
19238 {
19241 }
19243 /* A typedef-name can also be introduced by an alias-declaration. The
19244 identifier following the using keyword becomes a typedef-name. It has
19245 the same semantics as if it were introduced by the typedef
19246 specifier. In particular, it does not define a new type and it shall
19247 not appear in the type-id. */
19252 {
19255 ds_attribute,
19256 attrs_token);
19257 }
19259 ds_typedef,
19260 using_token);
19262 ds_alias,
19263 using_token);
19270 id_location,
19281 else
19287 // Attach constraints to the alias declaration.
19289 {
19293 }
19300 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19301 added into the symbol table; otherwise, return the TYPE_DECL. */
19305 {
19309 }
19312 }
19314 /* Parse a using-directive.
19316 using-directive:
19317 using namespace :: [opt] nested-name-specifier [opt]
19318 namespace-name ; */
19320 static void
19322 {
19323 tree namespace_decl;
19324 tree attribs;
19326 /* Look for the `using' keyword. */
19328 /* And the `namespace' keyword. */
19330 /* Look for the optional `::' operator. */
19332 /* And the optional nested-name-specifier. */
19338 /* Get the namespace being used. */
19340 /* And any specified attributes. */
19343 /* Update the symbol table. */
19346 else
19349 /* Look for the final `;'. */
19351 }
19353 /* Parse an asm-definition.
19355 asm-definition:
19356 asm ( string-literal ) ;
19358 GNU Extension:
19360 asm-definition:
19361 asm volatile [opt] ( string-literal ) ;
19362 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19363 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19364 : asm-operand-list [opt] ) ;
19365 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19366 : asm-operand-list [opt]
19367 : asm-clobber-list [opt] ) ;
19368 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19369 : asm-clobber-list [opt]
19370 : asm-goto-list ) ; */
19372 static void
19374 {
19375 tree string;
19380 tree asm_stmt;
19388 /* Look for the `asm' keyword. */
19393 {
19396 }
19398 /* See if the next token is `volatile'. */
19401 {
19402 /* Remember that we saw the `volatile' keyword. */
19404 /* Consume the token. */
19406 }
19410 {
19411 /* Remember that we saw the `goto' keyword. */
19413 /* Consume the token. */
19415 }
19416 /* Look for the opening `('. */
19419 /* Look for the string. */
19422 {
19426 }
19428 /* If we're allowing GNU extensions, check for the extended assembly
19429 syntax. Unfortunately, the `:' tokens need not be separated by
19430 a space in C, and so, for compatibility, we tolerate that here
19431 too. Doing that means that we have to treat the `::' operator as
19432 two `:' tokens. */
19437 {
19442 /* The extended syntax was used. */
19445 /* Look for outputs. */
19447 {
19448 /* Consume the `:'. */
19450 /* Parse the output-operands. */
19452 CPP_COLON)
19454 CPP_SCOPE)
19456 CPP_CLOSE_PAREN)
19458 {
19462 }
19463 }
19464 /* If the next token is `::', there are no outputs, and the
19465 next token is the beginning of the inputs. */
19467 /* The inputs are coming next. */
19470 /* Look for inputs. */
19473 {
19474 /* Consume the `:' or `::'. */
19476 /* Parse the output-operands. */
19478 CPP_COLON)
19480 CPP_SCOPE)
19482 CPP_CLOSE_PAREN))
19483 {
19487 }
19488 }
19490 /* The clobbers are coming next. */
19493 /* Look for clobbers. */
19496 {
19498 /* Consume the `:' or `::'. */
19500 /* Parse the clobbers. */
19502 CPP_COLON)
19504 CPP_CLOSE_PAREN))
19506 }
19509 /* The labels are coming next. */
19512 /* Look for labels. */
19515 {
19517 /* Consume the `:' or `::'. */
19519 /* Parse the labels. */
19521 }
19525 }
19529 /* Look for the closing `)'. */
19537 {
19538 /* Create the ASM_EXPR. */
19540 {
19543 /* If the extended syntax was not used, mark the ASM_EXPR. */
19545 {
19551 }
19552 }
19553 else
19555 }
19556 }
19558 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19559 type that comes from the decl-specifier-seq. */
19561 static tree
19563 {
19566 {
19579 }
19582 }
19584 /* Declarators [gram.dcl.decl] */
19586 /* Parse an init-declarator.
19588 init-declarator:
19589 declarator initializer [opt]
19591 GNU Extension:
19593 init-declarator:
19594 declarator asm-specification [opt] attributes [opt] initializer [opt]
19596 function-definition:
19597 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19598 function-body
19599 decl-specifier-seq [opt] declarator function-try-block
19601 GNU Extension:
19603 function-definition:
19604 __extension__ function-definition
19606 TM Extension:
19608 function-definition:
19609 decl-specifier-seq [opt] declarator function-transaction-block
19611 The DECL_SPECIFIERS apply to this declarator. Returns a
19612 representation of the entity declared. If MEMBER_P is TRUE, then
19613 this declarator appears in a class scope. The new DECL created by
19614 this declarator is returned.
19616 The CHECKS are access checks that should be performed once we know
19617 what entity is being declared (and, therefore, what classes have
19618 befriended it).
19620 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19621 for a function-definition here as well. If the declarator is a
19622 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19623 be TRUE upon return. By that point, the function-definition will
19624 have been completely parsed.
19626 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19627 is FALSE.
19629 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19630 parsed declaration if it is an uninitialized single declarator not followed
19631 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19632 if present, will not be consumed. If returned, this declarator will be
19633 created with SD_INITIALIZED but will not call cp_finish_decl.
19635 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19636 and there is an initializer, the pointed location_t is set to the
19637 location of the '=' or `(', or '{' in C++11 token introducing the
19638 initializer. */
19640 static tree
19651 {
19655 tree prefix_attributes;
19657 tree asm_specification;
19658 tree initializer;
19660 tree scope;
19662 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19663 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19664 "(...)". */
19675 /* Gather the attributes that were provided with the
19676 decl-specifiers. */
19679 /* Assume that this is not the declarator for a function
19680 definition. */
19684 /* Default arguments are only permitted for function parameters. */
19688 /* Defer access checks while parsing the declarator; we cannot know
19689 what names are accessible until we know what is being
19690 declared. */
19695 /* Parse the declarator. */
19696 declarator
19701 /* Gather up the deferred checks. */
19706 /* If the DECLARATOR was erroneous, there's no need to go
19707 further. */
19711 /* Check that the number of template-parameter-lists is OK. */
19721 /* Figure out what scope the entity declared by the DECLARATOR is
19722 located in. `grokdeclarator' sometimes changes the scope, so
19723 we compute it now. */
19726 /* Perform any lookups in the declared type which were thought to be
19727 dependent, but are not in the scope of the declarator. */
19728 decl_specifiers->type
19731 /* If we're allowing GNU extensions, look for an
19732 asm-specification. */
19734 {
19735 /* Look for an asm-specification. */
19738 }
19739 else
19742 /* Look for attributes. */
19746 /* Peek at the next token. */
19752 {
19753 /* Handle C++17 deduction guides. */
19757 {
19765 {
19769 }
19770 }
19772 /* Check to see if the token indicates the start of a
19773 function-definition. */
19775 {
19777 {
19778 /* If a function-definition should not appear here, issue an
19779 error message. */
19783 }
19785 location_t func_brace_location
19788 /* Neither attributes nor an asm-specification are allowed
19789 on a function-definition. */
19792 "an asm-specification is not allowed "
19796 "attributes are not allowed "
19798 /* This is a function-definition. */
19801 /* Parse the function definition. */
19804 decl_specifiers,
19805 declarator,
19806 prefix_attributes);
19807 else
19808 decl =
19809 (cp_parser_function_definition_from_specifiers_and_declarator
19813 {
19814 /* This is where the prologue starts... */
19817 }
19820 }
19821 }
19823 {
19824 /* A non-template declaration involving a function parameter list
19825 containing an implicit template parameter will be made into a
19826 template. If the resulting declaration is not going to be an
19827 actual function then finish the template scope here to prevent it.
19828 An error message will be issued once we have a decl to talk about.
19830 FIXME probably we should do type deduction rather than create an
19831 implicit template, but the standard currently doesn't allow it. */
19834 }
19836 /* [dcl.dcl]
19838 Only in function declarations for constructors, destructors, type
19839 conversions, and deduction guides can the decl-specifier-seq be omitted.
19841 We explicitly postpone this check past the point where we handle
19842 function-definitions because we tolerate function-definitions
19843 that are missing their return types in some modes. */
19845 {
19849 }
19851 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19855 {
19866 {
19872 }
19873 }
19874 else
19875 {
19876 /* If the init-declarator isn't initialized and isn't followed by a
19877 `,' or `;', it's not a valid init-declarator. */
19880 {
19883 else
19884 {
19888 }
19889 }
19892 }
19894 /* Because start_decl has side-effects, we should only call it if we
19895 know we're going ahead. By this point, we know that we cannot
19896 possibly be looking at any other construct. */
19899 /* Enter the newly declared entry in the symbol table. If we're
19900 processing a declaration in a class-specifier, we wait until
19901 after processing the initializer. */
19903 {
19911 /* Adjust location of decl if declarator->id_loc is more appropriate:
19912 set, and decl wasn't merged with another decl, in which case its
19913 location would be different from input_location, and more accurate. */
19918 }
19920 /* Enter the SCOPE. That way unqualified names appearing in the
19921 initializer will be looked up in SCOPE. */
19924 /* Perform deferred access control checks, now that we know in which
19925 SCOPE the declared entity resides. */
19927 {
19930 /* If the entity being declared is a function, pretend that we
19931 are in its scope. If it is a `friend', it may have access to
19932 things that would not otherwise be accessible. */
19934 {
19937 }
19939 /* Perform access checks for template parameters. */
19942 /* Perform the access control checks for the declarator and the
19943 decl-specifiers. */
19946 /* Restore the saved value. */
19949 }
19951 /* Parse the initializer. */
19956 {
19958 {
19961 else
19962 {
19963 /* If the declaration was erroneous, we don't really
19964 know what the user intended, so just silently
19965 consume the initializer. */
19972 }
19973 }
19974 else
19975 {
19976 /* We want to record the extra mangling scope for in-class
19977 initializers of class members and initializers of static data
19978 member templates. The former involves deferring
19979 parsing of the initializer until end of class as with default
19980 arguments. So right here we only handle the latter. */
19990 }
19991 }
19993 /* The old parser allows attributes to appear after a parenthesized
19994 initializer. Mark Mitchell proposed removing this functionality
19995 on the GCC mailing lists on 2002-08-13. This parser accepts the
19996 attributes -- but ignores them. Made a permerror in GCC 8. */
20002 {
20005 {
20009 }
20010 }
20012 /* And now complain about a non-function implicit template. */
20017 /* For an in-class declaration, use `grokfield' to create the
20018 declaration. */
20020 {
20022 {
20025 }
20034 }
20036 /* Finish processing the declaration. But, skip member
20037 declarations. */
20039 {
20042 asm_specification,
20043 /* If the initializer is in parentheses, then this is
20044 a direct-initialization, which means that an
20045 `explicit' constructor is OK. Otherwise, an
20046 `explicit' constructor cannot be used. */
20049 }
20052 /* Core issue #226 (C++0x only): A default template-argument
20053 shall not be specified in a friend class template
20054 declaration. */
20063 {
20066 else
20068 }
20075 }
20077 /* Parse a declarator.
20079 declarator:
20080 direct-declarator
20081 ptr-operator declarator
20083 abstract-declarator:
20084 ptr-operator abstract-declarator [opt]
20085 direct-abstract-declarator
20087 GNU Extensions:
20089 declarator:
20090 attributes [opt] direct-declarator
20091 attributes [opt] ptr-operator declarator
20093 abstract-declarator:
20094 attributes [opt] ptr-operator abstract-declarator [opt]
20095 attributes [opt] direct-abstract-declarator
20097 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
20098 detect constructors, destructors, deduction guides, or conversion operators.
20099 It is set to -1 if the declarator is a name, and +1 if it is a
20100 function. Otherwise it is set to zero. Usually you just want to
20101 test for >0, but internally the negative value is used.
20103 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
20104 a decl-specifier-seq unless it declares a constructor, destructor,
20105 or conversion. It might seem that we could check this condition in
20106 semantic analysis, rather than parsing, but that makes it difficult
20107 to handle something like `f()'. We want to notice that there are
20108 no decl-specifiers, and therefore realize that this is an
20109 expression, not a declaration.)
20111 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
20112 the declarator is a direct-declarator of the form "(...)".
20114 MEMBER_P is true iff this declarator is a member-declarator.
20116 FRIEND_P is true iff this declarator is a friend. */
20120 cp_parser_declarator_kind dcl_kind,
20124 {
20127 cp_cv_quals cv_quals;
20128 tree class_type;
20131 /* Assume this is not a constructor, destructor, or type-conversion
20132 operator. */
20139 /* Check for the ptr-operator production. */
20141 /* Parse the ptr-operator. */
20147 /* If that worked, then we have a ptr-operator. */
20149 {
20150 /* If a ptr-operator was found, then this declarator was not
20151 parenthesized. */
20154 /* The dependent declarator is optional if we are parsing an
20155 abstract-declarator. */
20159 /* Parse the dependent declarator. */
20164 friend_p);
20166 /* If we are parsing an abstract-declarator, we must handle the
20167 case where the dependent declarator is absent. */
20172 declarator = cp_parser_make_indirect_declarator
20174 }
20175 /* Everything else is a direct-declarator. */
20176 else
20177 {
20180 CPP_OPEN_PAREN);
20182 ctor_dtor_or_conv_p,
20184 }
20189 }
20191 /* Parse a direct-declarator or direct-abstract-declarator.
20193 direct-declarator:
20194 declarator-id
20195 direct-declarator ( parameter-declaration-clause )
20196 cv-qualifier-seq [opt]
20197 ref-qualifier [opt]
20198 exception-specification [opt]
20199 direct-declarator [ constant-expression [opt] ]
20200 ( declarator )
20202 direct-abstract-declarator:
20203 direct-abstract-declarator [opt]
20204 ( parameter-declaration-clause )
20205 cv-qualifier-seq [opt]
20206 ref-qualifier [opt]
20207 exception-specification [opt]
20208 direct-abstract-declarator [opt] [ constant-expression [opt] ]
20209 ( abstract-declarator )
20211 Returns a representation of the declarator. DCL_KIND is
20212 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
20213 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
20214 we are parsing a direct-declarator. It is
20215 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
20216 of ambiguity we prefer an abstract declarator, as per
20217 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
20218 as for cp_parser_declarator. */
20222 cp_parser_declarator_kind dcl_kind,
20225 {
20236 {
20237 /* Peek at the next token. */
20240 {
20241 /* This is either a parameter-declaration-clause, or a
20242 parenthesized declarator. When we know we are parsing a
20243 named declarator, it must be a parenthesized declarator
20244 if FIRST is true. For instance, `(int)' is a
20245 parameter-declaration-clause, with an omitted
20246 direct-abstract-declarator. But `((*))', is a
20247 parenthesized abstract declarator. Finally, when T is a
20248 template parameter `(T)' is a
20249 parameter-declaration-clause, and not a parenthesized
20250 named declarator.
20252 We first try and parse a parameter-declaration-clause,
20253 and then try a nested declarator (if FIRST is true).
20255 It is not an error for it not to be a
20256 parameter-declaration-clause, even when FIRST is
20257 false. Consider,
20259 int i (int);
20260 int i (3);
20262 The first is the declaration of a function while the
20263 second is the definition of a variable, including its
20264 initializer.
20266 Having seen only the parenthesis, we cannot know which of
20267 these two alternatives should be selected. Even more
20268 complex are examples like:
20270 int i (int (a));
20271 int i (int (3));
20273 The former is a function-declaration; the latter is a
20274 variable initialization.
20276 Thus again, we try a parameter-declaration-clause, and if
20277 that fails, we back out and return. */
20280 {
20281 tree params;
20286 /* In a member-declarator, the only valid interpretation
20287 of a parenthesis is the start of a
20288 parameter-declaration-clause. (It is invalid to
20289 initialize a static data member with a parenthesized
20290 initializer; only the "=" form of initialization is
20291 permitted.) */
20295 /* Consume the `('. */
20296 matching_parens parens;
20299 {
20300 /* If this is going to be an abstract declarator, we're
20301 in a declarator and we can't have default args. */
20304 }
20308 /* Parse the parameter-declaration-clause. */
20311 /* Consume the `)'. */
20314 /* If all went well, parse the cv-qualifier-seq,
20315 ref-qualifier and the exception-specification. */
20317 {
20318 cp_cv_quals cv_quals;
20319 cp_virt_specifiers virt_specifiers;
20320 cp_ref_qualifier ref_qual;
20321 tree exception_specification;
20322 tree late_return;
20323 tree attrs;
20333 /* Parse the cv-qualifier-seq. */
20335 /* Parse the ref-qualifier. */
20337 /* Parse the tx-qualifier. */
20339 /* And the exception-specification. */
20340 exception_specification
20345 /* In here, we handle cases where attribute is used after
20346 the function declaration. For example:
20347 void func (int x) __attribute__((vector(..))); */
20350 late_return = (cp_parser_late_return_type_opt
20354 /* Parse the virt-specifier-seq. */
20357 /* Create the function-declarator. */
20359 params,
20360 cv_quals,
20361 virt_specifiers,
20362 ref_qual,
20363 tx_qual,
20364 exception_specification,
20365 late_return,
20366 requires_clause);
20369 /* Any subsequent parameter lists are to do with
20370 return type, so are not those of the declared
20371 function. */
20373 }
20375 /* Remove the function parms from scope. */
20379 /* Repeat the main loop. */
20381 }
20383 /* If this is the first, we can try a parenthesized
20384 declarator. */
20386 {
20393 /* Consume the `('. */
20394 matching_parens parens;
20396 /* Parse the nested declarator. */
20399 declarator
20405 /* Expect a `)'. */
20413 }
20414 /* Otherwise, we must be done. */
20415 else
20417 }
20421 {
20422 /* Parse an array-declarator. */
20432 /* Consume the `['. */
20434 /* Peek at the next token. */
20436 /* If the next token is `]', then there is no
20437 constant-expression. */
20439 {
20441 bounds
20451 {
20452 /* Normally, the array bound must be an integral constant
20453 expression. However, as an extension, we allow VLAs
20454 in function scopes as long as they aren't part of a
20455 parameter declaration. */
20459 }
20462 {
20463 /* Remember this wasn't a constant-expression. */
20466 }
20467 }
20468 else
20470 /* Look for the closing `]'. */
20472 {
20475 }
20480 }
20482 {
20483 {
20484 tree qualifying_scope;
20485 tree unqualified_name;
20486 tree attrs;
20487 special_function_kind sfk;
20492 /* Parse a declarator-id */
20495 {
20498 /* If we see an ellipsis, we should be looking at a
20499 parameter pack. */
20501 {
20502 /* Consume the `...' */
20506 }
20507 }
20510 unqualified_name
20514 {
20518 {
20519 /* Check whether an error occurred. */
20522 /* We already consumed the ellipsis to mark a
20523 parameter pack, but we have no way to report it,
20524 so abort the tentative parse. We will be exiting
20525 immediately anyway. */
20527 }
20528 else
20534 && (qualifying_scope
20536 {
20539 }
20540 }
20545 {
20550 }
20556 {
20557 /* In the declaration of a member of a template class
20558 outside of the class itself, the SCOPE will sometimes
20559 be a TYPENAME_TYPE. For example, given:
20561 template <typename T>
20562 int S<T>::R::i = 3;
20564 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20565 this context, we must resolve S<T>::R to an ordinary
20566 type, rather than a typename type.
20568 The reason we normally avoid resolving TYPENAME_TYPEs
20569 is that a specialization of `S' might render
20570 `S<T>::R' not a type. However, if `S' is
20571 specialized, then this `i' will not be used, so there
20572 is no harm in resolving the types here. */
20573 tree type;
20575 /* Resolve the TYPENAME_TYPE. */
20578 /* If that failed, the declarator is invalid. */
20580 {
20583 "cannot define member of dependent typedef "
20585 else
20590 }
20592 }
20597 {
20598 tree class_type;
20603 else
20607 {
20611 {
20612 /* We do not attempt to print the declarator
20613 here because we do not have enough
20614 information about its original syntactic
20615 form. */
20619 }
20622 {
20626 "use %<%T::%D%> instead of %<%T::%D%> to "
20628 class_type,
20633 }
20635 }
20638 {
20645 for an unnamed type, even if the type
20646 got a name for linkage purposes. */
20648 /* Handle correctly (c++/19200):
20650 struct S {
20651 struct T{};
20652 friend void S(T);
20653 };
20655 and also:
20657 namespace N {
20658 void S();
20659 }
20661 struct S {
20662 friend void N::S();
20663 }; */
20666 class_type))
20675 }
20676 }
20678 unqualified_name,
20679 sfk);
20686 }
20688 handle_declarator:;
20691 {
20692 /* Any names that appear after the declarator-id for a
20693 member are looked up in the containing scope. */
20695 {
20696 /* But declarations with qualified-ids can't appear in a
20697 function. */
20701 }
20703 }
20707 /* Default args are only allowed on function
20708 declarations. */
20710 else
20714 }
20715 /* We're done. */
20716 else
20718 }
20720 /* For an abstract declarator, we might wind up with nothing at this
20721 point. That's an error; the declarator is not optional. */
20725 {
20726 /* Record overly parenthesized declarator so we can give a
20727 diagnostic about confusing decl/expr disambiguation. */
20729 {
20730 /* If the open and close parens are on different lines, this
20731 is probably a formatting thing, so ignore. */
20736 }
20739 }
20741 /* If we entered a scope, we must exit it now. */
20749 }
20751 /* Parse a ptr-operator.
20753 ptr-operator:
20754 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20755 * cv-qualifier-seq [opt]
20756 &
20757 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20758 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20760 GNU Extension:
20762 ptr-operator:
20763 & cv-qualifier-seq [opt]
20765 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20766 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20767 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20768 filled in with the TYPE containing the member. *CV_QUALS is
20769 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20770 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20771 Note that the tree codes returned by this function have nothing
20772 to do with the types of trees that will be eventually be created
20773 to represent the pointer or reference type being parsed. They are
20774 just constants with suggestive names. */
20775 static enum tree_code
20780 {
20785 /* Assume that it's not a pointer-to-member. */
20787 /* And that there are no cv-qualifiers. */
20790 /* Peek at the next token. */
20793 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20803 {
20804 /* Consume the `*', `&' or `&&'. */
20807 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20808 `&', if we are allowing GNU extensions. (The only qualifier
20809 that can legally appear after `&' is `restrict', but that is
20810 enforced during semantic analysis. */
20818 }
20819 else
20820 {
20821 /* Try the pointer-to-member case. */
20823 /* Look for the optional `::' operator. */
20826 /* Look for the nested-name specifier. */
20833 /* If we found it, and the next token is a `*', then we are
20834 indeed looking at a pointer-to-member operator. */
20837 {
20838 /* Indicate that the `*' operator was used. */
20846 else
20847 {
20848 /* The type of which the member is a member is given by the
20849 current SCOPE. */
20851 /* The next name will not be qualified. */
20855 /* Look for optional c++11 attributes. */
20859 /* Look for the optional cv-qualifier-seq. */
20861 }
20862 }
20863 /* If that didn't work we don't have a ptr-operator. */
20866 }
20869 }
20871 /* Parse an (optional) cv-qualifier-seq.
20873 cv-qualifier-seq:
20874 cv-qualifier cv-qualifier-seq [opt]
20876 cv-qualifier:
20877 const
20878 volatile
20880 GNU Extension:
20882 cv-qualifier:
20883 __restrict__
20885 Returns a bitmask representing the cv-qualifiers. */
20887 static cp_cv_quals
20889 {
20893 {
20895 cp_cv_quals cv_qualifier;
20897 /* Peek at the next token. */
20899 /* See if it's a cv-qualifier. */
20901 {
20917 }
20923 {
20928 }
20929 else
20930 {
20933 }
20934 }
20937 }
20939 /* Parse an (optional) ref-qualifier
20941 ref-qualifier:
20942 &
20943 &&
20945 Returns cp_ref_qualifier representing ref-qualifier. */
20947 static cp_ref_qualifier
20949 {
20952 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20957 {
20962 {
20974 }
20979 {
20982 }
20983 else
20984 {
20987 }
20988 }
20991 }
20993 /* Parse an optional tx-qualifier.
20995 tx-qualifier:
20996 transaction_safe
20997 transaction_safe_dynamic */
20999 static tree
21001 {
21004 {
21009 {
21013 {
21016 {
21019 }
21020 else
21022 }
21023 }
21024 }
21026 }
21028 /* Parse an (optional) virt-specifier-seq.
21030 virt-specifier-seq:
21031 virt-specifier virt-specifier-seq [opt]
21033 virt-specifier:
21034 override
21035 final
21037 Returns a bitmask representing the virt-specifiers. */
21039 static cp_virt_specifiers
21041 {
21045 {
21047 cp_virt_specifiers virt_specifier;
21049 /* Peek at the next token. */
21051 /* See if it's a virt-specifier-qualifier. */
21055 {
21058 }
21060 {
21063 }
21065 {
21067 }
21068 else
21072 {
21077 }
21078 else
21079 {
21082 }
21083 }
21085 }
21087 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
21088 is in scope even though it isn't real. */
21090 void
21092 {
21093 tree this_parm;
21096 {
21097 /* We don't clear this between NSDMIs. Is it already what we want? */
21104 }
21107 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
21109 current_class_ref
21112 }
21114 /* Return true iff our current scope is a non-static data member
21115 initializer. */
21117 bool
21119 {
21120 /* We recognize NSDMI context by the context-less 'this' pointer set up
21121 by the function above. */
21127 }
21129 /* Parse a late-specified return type, if any. This is not a separate
21130 non-terminal, but part of a function declarator, which looks like
21132 -> trailing-type-specifier-seq abstract-declarator(opt)
21134 Returns the type indicated by the type-id.
21136 In addition to this, parse any queued up #pragma omp declare simd
21137 clauses, and #pragma acc routine clauses.
21139 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
21140 function. */
21142 static tree
21145 {
21149 && declarator
21153 && declarator
21156 /* Peek at the next token. */
21158 /* A late-specified return type is indicated by an initial '->'. */
21169 {
21170 /* DR 1207: 'this' is in scope in the trailing return type. */
21172 }
21175 {
21176 /* Consume the ->. */
21180 }
21182 /* Function declarations may be followed by a trailing
21183 requires-clause. */
21187 declarator->attributes
21191 declarator->attributes
21196 {
21199 }
21202 }
21204 /* Parse a declarator-id.
21206 declarator-id:
21207 id-expression
21208 :: [opt] nested-name-specifier [opt] type-name
21210 In the `id-expression' case, the value returned is as for
21211 cp_parser_id_expression if the id-expression was an unqualified-id.
21212 If the id-expression was a qualified-id, then a SCOPE_REF is
21213 returned. The first operand is the scope (either a NAMESPACE_DECL
21214 or TREE_TYPE), but the second is still just a representation of an
21215 unqualified-id. */
21217 static tree
21219 {
21220 tree id;
21221 /* The expression must be an id-expression. Assume that qualified
21222 names are the names of types so that:
21224 template <class T>
21225 int S<T>::R::i = 3;
21227 will work; we must treat `S<T>::R' as the name of a type.
21228 Similarly, assume that qualified names are templates, where
21229 required, so that:
21231 template <class T>
21232 int S<T>::R<T>::i = 3;
21234 will work, too. */
21240 optional_p);
21244 }
21246 /* Parse a type-id.
21248 type-id:
21249 type-specifier-seq abstract-declarator [opt]
21251 Returns the TYPE specified. */
21253 static tree
21256 {
21257 cp_decl_specifier_seq type_specifier_seq;
21260 /* Parse the type-specifier-seq. */
21262 is_trailing_return,
21270 /* A bare template name as a template argument is a template template
21271 argument, not a placeholder, so fail parsing it as a type argument. */
21272 {
21276 }
21280 /* There might or might not be an abstract declarator. */
21282 /* Look for the declarator. */
21283 abstract_declarator
21288 /* Check to see if there really was a declarator. */
21293 /* The concepts TS allows 'auto' as a type-id. */
21295 /* None of the valid uses of 'auto' in C++14 involve the type-id
21296 nonterminal, but it is valid in a trailing-return-type. */
21299 {
21300 /* A type-id with type 'auto' is only ok if the abstract declarator
21301 is a function declarator with a late-specified return type.
21303 A type-id with 'auto' is also valid in a trailing-return-type
21304 in a compound-requirement. */
21311 else
21312 {
21315 {
21317 auto_node);
21319 tmpl);
21320 }
21321 else
21324 }
21325 }
21328 is_template_arg);
21329 }
21331 static tree
21333 {
21335 }
21337 static tree
21339 {
21340 tree r;
21342 parser->type_definition_forbidden_message
21347 {
21350 }
21352 }
21354 static tree
21356 {
21358 }
21360 /* Parse a type-specifier-seq.
21362 type-specifier-seq:
21363 type-specifier type-specifier-seq [opt]
21365 GNU extension:
21367 type-specifier-seq:
21368 attributes type-specifier-seq [opt]
21370 If IS_DECLARATION is true, we are at the start of a "condition" or
21371 exception-declaration, so we might be followed by a declarator-id.
21373 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21374 i.e. we've just seen "->".
21376 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21378 static void
21383 {
21388 /* Clear the TYPE_SPECIFIER_SEQ. */
21391 /* In the context of a trailing return type, enum E { } is an
21392 elaborated-type-specifier followed by a function-body, not an
21393 enum-specifier. */
21397 /* Parse the type-specifiers and attributes. */
21399 {
21400 tree type_specifier;
21403 /* Check for attributes first. */
21405 {
21406 type_specifier_seq->attributes
21410 }
21412 /* record the token of the beginning of the type specifier seq,
21413 for error reporting purposes*/
21417 /* Look for the type-specifier. */
21419 flags,
21420 type_specifier_seq,
21422 NULL,
21425 {
21426 /* If the first type-specifier could not be found, this is not a
21427 type-specifier-seq at all. */
21429 {
21430 /* Set in_declarator_p to avoid skipping to the semicolon. */
21442 }
21443 /* If subsequent type-specifiers could not be found, the
21444 type-specifier-seq is complete. */
21446 }
21449 /* The standard says that a condition can be:
21451 type-specifier-seq declarator = assignment-expression
21453 However, given:
21455 struct S {};
21456 if (int S = ...)
21458 we should treat the "S" as a declarator, not as a
21459 type-specifier. The standard doesn't say that explicitly for
21460 type-specifier-seq, but it does say that for
21461 decl-specifier-seq in an ordinary declaration. Perhaps it
21462 would be clearer just to allow a decl-specifier-seq here, and
21463 then add a semantic restriction that if any decl-specifiers
21464 that are not type-specifiers appear, the program is invalid. */
21467 }
21468 }
21470 /* Return whether the function currently being declared has an associated
21471 template parameter list. */
21473 static bool
21475 {
21488 }
21490 /* Parse a parameter-declaration-clause.
21492 parameter-declaration-clause:
21493 parameter-declaration-list [opt] ... [opt]
21494 parameter-declaration-list , ...
21496 Returns a representation for the parameter declarations. A return
21497 value of NULL indicates a parameter-declaration-clause consisting
21498 only of an ellipsis. */
21500 static tree
21502 {
21503 tree parameters;
21511 && !processing_template_parmlist
21512 && !processing_explicit_instantiation
21513 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21514 actual function or a random abstract declarator. */
21520 /* Peek at the next token. */
21522 /* Check for trivial parameter-declaration-clauses. */
21524 {
21525 /* Consume the `...' token. */
21528 }
21530 /* There are no parameters. */
21532 /* Check for `(void)', too, which is a special case. */
21536 {
21537 /* Consume the `void' token. */
21539 /* There are no parameters. */
21541 }
21543 /* Parse the parameter-declaration-list. */
21545 /* If a parse error occurred while parsing the
21546 parameter-declaration-list, then the entire
21547 parameter-declaration-clause is erroneous. */
21551 /* Peek at the next token. */
21553 /* If it's a `,', the clause should terminate with an ellipsis. */
21555 {
21556 /* Consume the `,'. */
21558 /* Expect an ellipsis. */
21559 ellipsis_p
21561 }
21562 /* It might also be `...' if the optional trailing `,' was
21563 omitted. */
21565 {
21566 /* Consume the `...' token. */
21568 /* And remember that we saw it. */
21570 }
21571 else
21574 /* Finish the parameter list. */
21579 }
21581 /* Parse a parameter-declaration-list.
21583 parameter-declaration-list:
21584 parameter-declaration
21585 parameter-declaration-list , parameter-declaration
21587 Returns a representation of the parameter-declaration-list, as for
21588 cp_parser_parameter_declaration_clause. However, the
21589 `void_list_node' is never appended to the list. */
21591 static tree
21593 {
21599 /* The special considerations that apply to a function within an
21600 unbraced linkage specifications do not apply to the parameters
21601 to the function. */
21602 saved_in_unbraced_linkage_specification_p
21606 /* Look for more parameters. */
21608 {
21613 /* Parse the parameter. */
21614 parameter
21619 /* We don't know yet if the enclosing context is deprecated, so wait
21620 and warn in grokparms if appropriate. */
21624 {
21627 PARM,
21632 }
21636 /* If a parse error occurred parsing the parameter declaration,
21637 then the entire parameter-declaration-list is erroneous. */
21639 {
21642 }
21652 {
21656 }
21658 /* Add the new parameter to the list. */
21662 /* Peek at the next token. */
21665 /* These are for Objective-C++ */
21668 /* The parameter-declaration-list is complete. */
21671 {
21674 /* Peek at the next token. */
21676 /* If it's an ellipsis, then the list is complete. */
21679 /* Otherwise, there must be more parameters. Consume the
21680 `,'. */
21682 /* When parsing something like:
21684 int i(float f, double d)
21686 we can tell after seeing the declaration for "f" that we
21687 are not looking at an initialization of a variable "i",
21688 but rather at the declaration of a function "i".
21690 Due to the fact that the parsing of template arguments
21691 (as specified to a template-id) requires backtracking we
21692 cannot use this technique when inside a template argument
21693 list. */
21697 /* However, a parameter-declaration of the form
21698 "float(f)" (which is a valid declaration of a
21699 parameter "f") can also be interpreted as an
21700 expression (the conversion of "f" to "float"). */
21703 }
21704 else
21705 {
21713 }
21714 }
21716 parser->in_unbraced_linkage_specification_p
21719 /* Reset implicit_template_scope if we are about to leave the function
21720 parameter list that introduced it. Note that for out-of-line member
21721 definitions, there will be one or more class scopes before we get to
21722 the template parameter scope. */
21726 {
21730 {
21733 }
21734 }
21737 }
21739 /* Parse a parameter declaration.
21741 parameter-declaration:
21742 decl-specifier-seq ... [opt] declarator
21743 decl-specifier-seq declarator = assignment-expression
21744 decl-specifier-seq ... [opt] abstract-declarator [opt]
21745 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21747 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21748 declares a template parameter. (In that case, a non-nested `>'
21749 token encountered during the parsing of the assignment-expression
21750 is not interpreted as a greater-than operator.)
21752 Returns a representation of the parameter, or NULL if an error
21753 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21754 true iff the declarator is of the form "(p)". */
21760 {
21762 cp_decl_specifier_seq decl_specifiers;
21764 tree default_argument;
21769 /* In a template parameter, `>' is not an operator.
21771 [temp.param]
21773 When parsing a default template-argument for a non-type
21774 template-parameter, the first non-nested `>' is taken as the end
21775 of the template parameter-list rather than a greater-than
21776 operator. */
21778 /* Type definitions may not appear in parameter types. */
21780 parser->type_definition_forbidden_message
21787 /* Parse the declaration-specifiers. */
21790 CP_PARSER_FLAGS_NONE,
21794 /* Complain about missing 'typename' or other invalid type names. */
21799 /* If an error occurred, there's no reason to attempt to parse the
21800 rest of the declaration. */
21802 {
21805 }
21807 /* Peek at the next token. */
21810 /* If the next token is a `)', `,', `=', `>', or `...', then there
21811 is no declarator. However, when variadic templates are enabled,
21812 there may be a declarator following `...'. */
21817 {
21821 }
21822 /* Otherwise, there should be a declarator. */
21823 else
21824 {
21828 /* After seeing a decl-specifier-seq, if the next token is not a
21829 "(", there is no possibility that the code is a valid
21830 expression. Therefore, if parsing tentatively, we commit at
21831 this point. */
21833 /* In an expression context, having seen:
21835 (int((char ...
21837 we cannot be sure whether we are looking at a
21838 function-type (taking a "char" as a parameter) or a cast
21839 of some object of type "char" to "int". */
21845 /* Parse the declarator. */
21848 CP_PARSER_DECLARATOR_EITHER,
21850 parenthesized_p,
21854 /* After the declarator, allow more attributes. */
21855 decl_specifiers.attributes
21859 /* If the declarator is a template parameter pack, remember that and
21860 clear the flag in the declarator itself so we don't get errors
21861 from grokdeclarator. */
21863 {
21866 }
21867 }
21869 /* If the next token is an ellipsis, and we have not seen a declarator
21870 name, and if either the type of the declarator contains parameter
21871 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21872 for, eg, abbreviated integral type names), then we actually have a
21873 parameter pack expansion expression. Otherwise, leave the ellipsis
21874 for a C-style variadic function. */
21877 /* If a function parameter pack was specified and an implicit template
21878 parameter was introduced during cp_parser_parameter_declaration,
21879 change any implicit parameters introduced into packs. */
21884 {
21892 }
21895 {
21906 {
21907 /* Consume the `...'. */
21911 /* Build a pack expansion type */
21916 else
21918 }
21919 }
21921 /* The restriction on defining new types applies only to the type
21922 of the parameter, not to the default argument. */
21925 /* If the next token is `=', then process a default argument. */
21927 {
21930 /* If we are defining a class, then the tokens that make up the
21931 default argument must be saved and processed later. */
21937 // A constrained-type-specifier may declare a type template-parameter.
21939 default_argument
21942 // A constrained-type-specifier may declare a template-template-parameter.
21944 default_argument
21947 /* Outside of a class definition, we can just parse the
21948 assignment-expression. */
21949 else
21950 default_argument
21954 {
21956 "default arguments are only "
21958 }
21960 || template_parameter_pack_p
21963 {
21964 /* Find the name of the parameter pack. */
21971 template_parm_p
21977 else
21979 template_parm_p
21986 }
21987 }
21988 else
21991 /* Generate a location for the parameter, ranging from the start of the
21992 initial token to the end of the final token (using input_location for
21993 the latter, set up by cp_lexer_set_source_position_from_token when
21994 consuming tokens).
21996 If we have a identifier, then use it for the caret location, e.g.
21998 extern int callee (int one, int (*two)(int, int), float three);
21999 ~~~~~~^~~~~~~~~~~~~~
22001 otherwise, reuse the start location for the caret location e.g.:
22003 extern int callee (int one, int (*)(int, int), float three);
22004 ^~~~~~~~~~~~~~~~~
22006 */
22012 input_location);
22015 declarator,
22016 default_argument,
22017 param_loc,
22018 template_parameter_pack_p);
22019 }
22021 /* Parse a default argument and return it.
22023 TEMPLATE_PARM_P is true if this is a default argument for a
22024 non-type template parameter. */
22025 static tree
22027 {
22033 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
22034 set correctly. */
22037 /* Local variable names (and the `this' keyword) may not
22038 appear in a default argument. */
22041 /* Parse the assignment-expression. */
22046 /* The "this" pointer is not valid in a default argument. */
22048 {
22053 }
22054 default_argument
22056 /* Restore the "this" pointer. */
22058 {
22061 }
22070 }
22072 /* Parse a function-body.
22074 function-body:
22075 compound_statement */
22077 static void
22079 {
22083 }
22085 /* Parse a ctor-initializer-opt followed by a function-body. Return
22086 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
22087 is true we are parsing a function-try-block. */
22089 static void
22092 {
22099 /* Begin the function body. */
22101 /* Parse the optional ctor-initializer. */
22104 /* If we're parsing a constexpr constructor definition, we need
22105 to check that the constructor body is indeed empty. However,
22106 before we get to cp_parser_function_body lot of junk has been
22107 generated, so we can't just check that we have an empty block.
22108 Rather we take a snapshot of the outermost block, and check whether
22109 cp_parser_function_body changed its state. */
22111 {
22115 }
22116 /* Parse the function-body. */
22120 /* Finish the function body. */
22122 }
22124 /* Parse an initializer.
22126 initializer:
22127 = initializer-clause
22128 ( expression-list )
22130 Returns an expression representing the initializer. If no
22131 initializer is present, NULL_TREE is returned.
22133 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
22134 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
22135 set to TRUE if there is no initializer present. If there is an
22136 initializer, and it is not a constant-expression, *NON_CONSTANT_P
22137 is set to true; otherwise it is set to false. */
22139 static tree
22142 {
22144 tree init;
22146 /* Peek at the next token. */
22149 /* Let our caller know whether or not this initializer was
22150 parenthesized. */
22152 /* Assume that the initializer is constant. */
22156 {
22157 /* Consume the `='. */
22159 /* Parse the initializer-clause. */
22161 }
22163 {
22168 non_constant_p);
22173 }
22175 {
22180 }
22181 else
22182 {
22183 /* Anything else is an error. */
22186 }
22192 }
22194 /* Parse an initializer-clause.
22196 initializer-clause:
22197 assignment-expression
22198 braced-init-list
22200 Returns an expression representing the initializer.
22202 If the `assignment-expression' production is used the value
22203 returned is simply a representation for the expression.
22205 Otherwise, calls cp_parser_braced_list. */
22207 static cp_expr
22209 {
22210 cp_expr initializer;
22212 /* Assume the expression is constant. */
22215 /* If it is not a `{', then we are looking at an
22216 assignment-expression. */
22218 {
22219 initializer
22222 non_constant_p);
22223 }
22224 else
22228 }
22230 /* Parse a brace-enclosed initializer list.
22232 braced-init-list:
22233 { initializer-list , [opt] }
22234 { designated-initializer-list , [opt] }
22235 { }
22237 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
22238 the elements of the initializer-list (or NULL, if the last
22239 production is used). The TREE_TYPE for the CONSTRUCTOR will be
22240 NULL_TREE. There is no way to detect whether or not the optional
22241 trailing `,' was provided. NON_CONSTANT_P is as for
22242 cp_parser_initializer. */
22244 static cp_expr
22246 {
22247 tree initializer;
22250 /* Consume the `{' token. */
22251 matching_braces braces;
22253 /* Create a CONSTRUCTOR to represent the braced-initializer. */
22255 /* If it's not a `}', then there is a non-trivial initializer. */
22257 {
22258 /* Parse the initializer list. */
22261 /* A trailing `,' token is allowed. */
22264 }
22265 else
22267 /* Now, there should be a trailing `}'. */
22273 /* Build a location of the form:
22274 { ... }
22275 ^~~~~~~
22276 with caret==start at the open brace, finish at the close brace. */
22280 }
22282 /* Consume tokens up to, and including, the next non-nested closing `]'.
22283 Returns true iff we found a closing `]'. */
22285 static bool
22287 {
22291 {
22295 {
22298 /* If we've run out of tokens, then there is no closing `]'. */
22307 {
22310 }
22315 }
22317 /* Consume the token. */
22319 }
22320 }
22322 /* Return true if we are looking at an array-designator, false otherwise. */
22324 static bool
22326 {
22327 /* Consume the `['. */
22332 /* Skip tokens until the next token is a closing square bracket.
22333 If we find the closing `]', and the next token is a `=', then
22334 we are looking at an array designator. */
22335 bool array_designator_p
22339 /* Roll back the tokens we skipped. */
22343 }
22345 /* Parse an initializer-list.
22347 initializer-list:
22348 initializer-clause ... [opt]
22349 initializer-list , initializer-clause ... [opt]
22351 C++2A Extension:
22353 designated-initializer-list:
22354 designated-initializer-clause
22355 designated-initializer-list , designated-initializer-clause
22357 designated-initializer-clause:
22358 designator brace-or-equal-initializer
22360 designator:
22361 . identifier
22363 GNU Extension:
22365 initializer-list:
22366 designation initializer-clause ...[opt]
22367 initializer-list , designation initializer-clause ...[opt]
22369 designation:
22370 . identifier =
22371 identifier :
22372 [ constant-expression ] =
22374 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22375 for the initializer. If the INDEX of the elt is non-NULL, it is the
22376 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22377 as for cp_parser_initializer. */
22381 {
22386 /* Assume all of the expressions are constant. */
22389 /* Parse the rest of the list. */
22391 {
22393 tree designator;
22394 tree initializer;
22398 /* Handle the C++2A syntax, '. id ='. */
22406 {
22409 "C++ designated initializers only available with "
22411 /* Consume the `.'. */
22413 /* Consume the identifier. */
22416 /* Consume the `='. */
22418 }
22419 /* Also, if the next token is an identifier and the following one is a
22420 colon, we are looking at the GNU designated-initializer
22421 syntax. */
22426 {
22427 /* Warn the user that they are using an extension. */
22430 /* Consume the identifier. */
22432 /* Consume the `:'. */
22434 }
22435 /* Also handle C99 array designators, '[ const ] ='. */
22439 {
22440 /* In C++11, [ could start a lambda-introducer. */
22446 {
22449 }
22450 else
22451 {
22456 }
22461 && (!require_potential_rvalue_constant_expression
22465 /* Warn the user that they are using an extension. */
22468 }
22469 else
22473 {
22476 }
22480 {
22484 }
22488 /* Parse the initializer. */
22491 /* If any clause is non-constant, so is the entire initializer. */
22495 /* If we have an ellipsis, this is an initializer pack
22496 expansion. */
22498 {
22501 /* Consume the `...'. */
22508 /* Turn the initializer into an initializer expansion. */
22510 }
22512 /* Add it to the vector. */
22515 /* If the next token is not a comma, we have reached the end of
22516 the list. */
22520 /* Peek at the next token. */
22522 /* If the next token is a `}', then we're still done. An
22523 initializer-clause can have a trailing `,' after the
22524 initializer-list and before the closing `}'. */
22528 /* Consume the `,' token. */
22530 }
22532 /* The same identifier shall not appear in multiple designators
22533 of a designated-initializer-list. */
22535 {
22540 {
22542 {
22544 "%<.%s%> designator used multiple times in "
22548 }
22549 else
22551 }
22555 }
22558 }
22560 /* Classes [gram.class] */
22562 /* Parse a class-name.
22564 class-name:
22565 identifier
22566 template-id
22568 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22569 to indicate that names looked up in dependent types should be
22570 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22571 keyword has been used to indicate that the name that appears next
22572 is a template. TAG_TYPE indicates the explicit tag given before
22573 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22574 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22575 is the class being defined in a class-head. If ENUM_OK is TRUE,
22576 enum-names are also accepted.
22578 Returns the TYPE_DECL representing the class. */
22580 static tree
22589 {
22590 tree decl;
22591 tree scope;
22596 /* All class-names start with an identifier. */
22599 {
22602 }
22604 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22605 to a template-id, so we save it here. */
22610 /* Any name names a type if we're following the `typename' keyword
22611 in a qualified name where the enclosing scope is type-dependent. */
22614 /* Handle the common case (an identifier, but not a template-id)
22615 efficiently. */
22618 {
22622 /* Look for the identifier. */
22626 /* If the next token isn't an identifier, we are certainly not
22627 looking at a class-name. */
22630 /* If we know this is a type-name, there's no need to look it
22631 up. */
22634 else
22635 {
22636 tree ambiguous_decls;
22637 /* If we already know that this lookup is ambiguous, then
22638 we've already issued an error message; there's no reason
22639 to check again. */
22641 {
22644 }
22645 /* If the next token is a `::', then the name must be a type
22646 name.
22648 [basic.lookup.qual]
22650 During the lookup for a name preceding the :: scope
22651 resolution operator, object, function, and enumerator
22652 names are ignored. */
22655 /* Look up the name. */
22657 tag_type,
22660 check_dependency_p,
22664 {
22668 }
22669 }
22670 }
22671 else
22672 {
22673 /* Try a template-id. */
22675 check_dependency_p,
22676 tag_type,
22677 is_declaration);
22680 }
22684 /* If this is a typename, create a TYPENAME_TYPE. */
22686 {
22691 }
22695 /* Check to see that it is really the name of a class. */
22699 /* Situations like this:
22701 template <typename T> struct A {
22702 typename T::template X<int>::I i;
22703 };
22705 are problematic. Is `T::template X<int>' a class-name? The
22706 standard does not seem to be definitive, but there is no other
22707 valid interpretation of the following `::'. Therefore, those
22708 names are considered class-names. */
22709 {
22713 }
22718 /* In Objective-C 2.0, a classname followed by '.' starts a
22719 dot-syntax expression, and it's not a type-name. */
22731 }
22733 /* Parse a class-specifier.
22735 class-specifier:
22736 class-head { member-specification [opt] }
22738 Returns the TREE_TYPE representing the class. */
22740 static tree
22742 {
22743 tree type;
22757 /* Parse the class-head. */
22760 /* If the class-head was a semantic disaster, skip the entire body
22761 of the class. */
22763 {
22767 }
22769 /* Look for the `{'. */
22770 matching_braces braces;
22772 {
22775 }
22780 /* Issue an error message if type-definitions are forbidden here. */
22782 /* Remember that we are defining one more class. */
22784 /* Inside the class, surrounding template-parameter-lists do not
22785 apply. */
22786 saved_num_template_parameter_lists
22789 /* We are not in a function body. */
22792 /* Or in a loop. */
22795 /* Or in a switch. */
22798 /* We are not immediately inside an extern "lang" block. */
22799 saved_in_unbraced_linkage_specification_p
22803 // Associate constraints with the type.
22807 /* Start the class. */
22809 {
22812 }
22816 /* If the type is erroneous, skip the entire body of the class. */
22818 else
22819 /* Parse the member-specification. */
22822 /* Look for the trailing `}'. */
22824 /* Look for trailing attributes to apply to this class. */
22832 /* We've finished a type definition. Check for the common syntax
22833 error of forgetting a semicolon after the definition. We need to
22834 be careful, as we can't just check for not-a-semicolon and be done
22835 with it; the user might have typed:
22837 class X { } c = ...;
22838 class X { } *p = ...;
22840 and so forth. Instead, enumerate all the possible tokens that
22841 might follow this production; if we don't see one of them, then
22842 complain and silently insert the semicolon. */
22843 {
22848 /* Don't try to parse c++11 attributes here. As per the
22849 grammar, that should be a task for
22850 cp_parser_decl_specifier_seq. */
22854 {
22865 /* While it's legal for type qualifiers and storage class
22866 specifiers to follow type definitions in the grammar, only
22867 compiler testsuites contain code like that. Assume that if
22868 we see such code, then what we're really seeing is a case
22869 like:
22871 class X { }
22872 const <type> var = ...;
22874 or
22876 class Y { }
22877 static <type> func (...) ...
22879 i.e. the qualifier or specifier applies to the next
22880 declaration. To do so, however, we need to look ahead one
22881 more token to see if *that* token is a type specifier.
22883 This code could be improved to handle:
22885 class Z { }
22886 static const <type> var = ...; */
22889 {
22892 /* Handling user-defined types here would be nice, but very
22893 tricky. */
22894 want_semicolon
22897 }
22901 }
22903 /* If we don't have a type, then something is very wrong and we
22904 shouldn't try to do anything clever. Likewise for not seeing the
22905 closing brace. */
22907 {
22908 /* Locate the closing brace. */
22909 cp_token_position prev
22914 /* We want to suggest insertion of a ';' immediately *after* the
22915 closing brace, so, if we can, offset the location by 1 column. */
22922 /* If we successfully offset the location, suggest the fix-it. */
22935 else
22938 /* Unget one token and smash it to look as though we encountered
22939 a semicolon in the input stream. */
22944 }
22945 }
22947 /* If this class is not itself within the scope of another class,
22948 then we need to parse the bodies of all of the queued function
22949 definitions. Note that the queued functions defined in a class
22950 are not always processed immediately following the
22951 class-specifier for that class. Consider:
22953 struct A {
22954 struct B { void f() { sizeof (A); } };
22955 };
22957 If `f' were processed before the processing of `A' were
22958 completed, there would be no way to compute the size of `A'.
22959 Note that the nesting we are interested in here is lexical --
22960 not the semantic nesting given by TYPE_CONTEXT. In particular,
22961 for:
22963 struct A { struct B; };
22964 struct A::B { void f() { } };
22966 there is no need to delay the parsing of `A::B::f'. */
22968 {
22969 tree decl;
22977 {
22978 /* Skip default arguments, NSDMIs, etc, in order to improve
22979 error recovery (c++/71169, c++/71832). */
22984 }
22986 /* In a first pass, parse default arguments to the functions.
22987 Then, in a second pass, parse the bodies of the functions.
22988 This two-phased approach handles cases like:
22990 struct S {
22991 void f() { g(); }
22992 void g(int i = 3);
22993 };
22995 */
22997 {
22999 /* If there are default arguments that have not yet been processed,
23000 take care of them now. */
23002 {
23007 }
23008 /* Make sure that any template parameters are in scope. */
23010 /* Parse the default argument expressions. */
23012 /* Remove any template parameters from the symbol table. */
23014 }
23016 /* Now parse any NSDMIs. */
23020 {
23022 {
23027 }
23030 }
23037 /* Now do some post-NSDMI bookkeeping. */
23043 /* Now parse the body of the functions. */
23045 {
23046 /* OpenMP UDRs need to be parsed before all other functions. */
23053 }
23054 else
23058 }
23059 else
23062 /* Put back any saved access checks. */
23065 /* Restore saved state. */
23069 parser->num_template_parameter_lists
23071 parser->in_unbraced_linkage_specification_p
23075 }
23077 static tree
23079 {
23080 tree ret;
23085 }
23087 /* Parse a class-head.
23089 class-head:
23090 class-key identifier [opt] base-clause [opt]
23091 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
23092 class-key nested-name-specifier [opt] template-id
23093 base-clause [opt]
23095 class-virt-specifier:
23096 final
23098 GNU Extensions:
23099 class-key attributes identifier [opt] base-clause [opt]
23100 class-key attributes nested-name-specifier identifier base-clause [opt]
23101 class-key attributes nested-name-specifier [opt] template-id
23102 base-clause [opt]
23104 Upon return BASES is initialized to the list of base classes (or
23105 NULL, if there are none) in the same form returned by
23106 cp_parser_base_clause.
23108 Returns the TYPE of the indicated class. Sets
23109 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
23110 involving a nested-name-specifier was used, and FALSE otherwise.
23112 Returns error_mark_node if this is not a class-head.
23114 Returns NULL_TREE if the class-head is syntactically valid, but
23115 semantically invalid in a way that means we should skip the entire
23116 body of the class. */
23118 static tree
23121 {
23122 tree nested_name_specifier;
23126 tree attributes;
23127 tree bases;
23137 /* Assume no nested-name-specifier will be present. */
23139 /* Assume no template parameter lists will be used in defining the
23140 type. */
23144 /* Look for the class-key. */
23151 /* Parse the attributes. */
23154 /* If the next token is `::', that is invalid -- but sometimes
23155 people do try to write:
23157 struct ::S {};
23159 Handle this gracefully by accepting the extra qualifier, and then
23160 issuing an error about it later if this really is a
23161 class-head. If it turns out just to be an elaborated type
23162 specifier, remain silent. */
23168 /* Determine the name of the class. Begin by looking for an
23169 optional nested-name-specifier. */
23171 nested_name_specifier
23177 /* If there was a nested-name-specifier, then there *must* be an
23178 identifier. */
23183 {
23185 /* Although the grammar says `identifier', it really means
23186 `class-name' or `template-name'. You are only allowed to
23187 define a class that has already been declared with this
23188 syntax.
23190 The proposed resolution for Core Issue 180 says that wherever
23191 you see `class T::X' you should treat `X' as a type-name.
23193 It is OK to define an inaccessible class; for example:
23195 class A { class B; };
23196 class A::B {};
23198 We do not know if we will see a class-name, or a
23199 template-name. We look for a class-name first, in case the
23200 class-name is a template-id; if we looked for the
23201 template-name first we would stop after the template-name. */
23208 class_type,
23212 /* If that didn't work, ignore the nested-name-specifier. */
23214 {
23220 }
23221 /* If we could not find a corresponding TYPE, treat this
23222 declaration like an unqualified declaration. */
23225 /* Otherwise, count the number of templates used in TYPE and its
23226 containing scopes. */
23227 else
23229 }
23230 /* Otherwise, the identifier is optional. */
23231 else
23232 {
23233 /* We don't know whether what comes next is a template-id,
23234 an identifier, or nothing at all. */
23236 /* Check for a template-id. */
23241 class_key,
23243 /* If that didn't work, it could still be an identifier. */
23245 {
23247 {
23250 }
23251 else
23253 }
23254 else
23255 {
23258 }
23259 }
23264 {
23266 class_key,
23268 }
23271 /* If it's not a `:' or a `{' then we can't really be looking at a
23272 class-head, since a class-head only appears as part of a
23273 class-specifier. We have to detect this situation before calling
23274 xref_tag, since that has irreversible side-effects. */
23276 {
23280 }
23282 /* At this point, we're going ahead with the class-specifier, even
23283 if some other problem occurs. */
23286 {
23291 }
23292 /* Issue the error about the overly-qualified name now. */
23294 {
23299 }
23301 {
23306 }
23308 {
23309 tree scope;
23312 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23313 keyword template shall not appear at the top level. */
23317 /* Reject typedef-names in class heads. */
23319 {
23322 type);
23325 }
23327 /* Figure out in what scope the declaration is being placed. */
23329 /* If that scope does not contain the scope in which the
23330 class was originally declared, the program is invalid. */
23332 {
23335 "declaration of %qD in namespace %qD which does not "
23338 else
23344 }
23345 /* [dcl.meaning]
23347 A declarator-id shall not be qualified except for the
23348 definition of a ... nested class outside of its class
23349 ... [or] the definition or explicit instantiation of a
23350 class member of a namespace outside of its namespace. */
23352 {
23357 }
23358 }
23359 /* An explicit-specialization must be preceded by "template <>". If
23360 it is not, try to recover gracefully. */
23363 && !processing_template_parmlist
23365 {
23366 /* Build a location of this form:
23367 struct typename <ARGS>
23368 ^~~~~~~~~~~~~~~~~~~~~~
23369 with caret==start at the start token, and
23370 finishing at the end of the type. */
23371 location_t reported_loc
23373 class_head_start_location,
23379 "an explicit specialization must be preceded by"
23382 /* Take the same action that would have been taken by
23383 cp_parser_explicit_specialization. */
23386 }
23387 /* There must be no "return" statements between this point and the
23388 end of this function; set "type "to the correct return value and
23389 use "goto done;" to return. */
23390 /* Make sure that the right number of template parameters were
23391 present. */
23393 template_id_p,
23396 {
23397 /* If something went wrong, there is no point in even trying to
23398 process the class-definition. */
23401 }
23403 /* Look up the type. */
23405 {
23409 {
23413 }
23414 else
23415 {
23419 /* Check the scope while we still know whether or not we had a
23420 nested-name-specifier. */
23423 }
23426 }
23428 {
23429 tree class_type;
23431 /* Given:
23433 template <typename T> struct S { struct T };
23434 template <typename T> struct S<T>::T { };
23436 we will get a TYPENAME_TYPE when processing the definition of
23437 `S::T'. We need to resolve it to the actual type before we
23438 try to define it. */
23440 {
23445 else
23446 {
23449 }
23450 }
23454 {
23457 }
23460 /* Enter the scope indicated by the nested-name-specifier. */
23462 /* Get the canonical version of this type. */
23464 /* Call push_template_decl if it seems like we should be defining a
23465 template either from the template headers or the type we're
23466 defining, so that we diagnose both extra and missing headers. */
23470 {
23473 {
23476 }
23477 }
23481 }
23483 {
23484 /* If the class was unnamed, create a dummy name. */
23488 ? ts_within_enclosing_non_class
23492 }
23494 /* Indicate whether this class was declared as a `class' or as a
23495 `struct'. */
23500 /* If this type was already complete, and we see another definition,
23501 that's an error. */
23503 {
23505 type);
23507 type);
23510 }
23515 {
23516 /* Apply attributes now, before any use of the class as a template
23517 argument in its base list. */
23520 }
23522 /* We will have entered the scope containing the class; the names of
23523 base classes should be looked up in that context. For example:
23525 struct A { struct B {}; struct C; };
23526 struct A::C : B {};
23528 is valid. */
23530 /* Get the list of base-classes, if there is one. */
23532 {
23533 /* PR59482: enter the class scope so that base-specifiers are looked
23534 up correctly. */
23538 /* PR59482: get out of the previously pushed class scope so that the
23539 subsequent pops pop the right thing. */
23542 }
23543 else
23546 /* If we're really defining a class, process the base classes.
23547 If they're invalid, fail. */
23551 done:
23552 /* Leave the scope given by the nested-name-specifier. We will
23553 enter the class scope itself while processing the members. */
23558 {
23561 }
23567 out:
23570 }
23572 /* Parse a class-key.
23574 class-key:
23575 class
23576 struct
23577 union
23579 Returns the kind of class-key specified, or none_type to indicate
23580 error. */
23582 static enum tag_types
23584 {
23588 /* Look for the class-key. */
23593 /* Check to see if the TOKEN is a class-key. */
23598 }
23600 /* Parse a type-parameter-key.
23602 type-parameter-key:
23603 class
23604 typename
23605 */
23607 static void
23609 {
23610 /* Look for the type-parameter-key. */
23614 {
23617 /* typename is not allowed in a template template parameter
23618 by the standard until C++17. */
23620 "ISO C++ forbids typename key in template template parameter;"
23622 }
23623 else
23627 }
23629 /* Parse an (optional) member-specification.
23631 member-specification:
23632 member-declaration member-specification [opt]
23633 access-specifier : member-specification [opt] */
23635 static void
23637 {
23639 {
23643 /* Peek at the next token. */
23645 /* If it's a `}', or EOF then we've seen all the members. */
23651 /* See if this token is a keyword. */
23654 {
23658 /* Consume the access-specifier. */
23660 /* Remember which access-specifier is active. */
23662 /* Look for the `:'. */
23667 /* Accept #pragmas at class scope. */
23669 {
23672 }
23674 /* Otherwise, the next construction must be a
23675 member-declaration. */
23677 }
23678 }
23679 }
23681 /* Parse a member-declaration.
23683 member-declaration:
23684 decl-specifier-seq [opt] member-declarator-list [opt] ;
23685 function-definition ; [opt]
23686 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23687 using-declaration
23688 template-declaration
23689 alias-declaration
23691 member-declarator-list:
23692 member-declarator
23693 member-declarator-list , member-declarator
23695 member-declarator:
23696 declarator pure-specifier [opt]
23697 declarator constant-initializer [opt]
23698 identifier [opt] : constant-expression
23700 GNU Extensions:
23702 member-declaration:
23703 __extension__ member-declaration
23705 member-declarator:
23706 declarator attributes [opt] pure-specifier [opt]
23707 declarator attributes [opt] constant-initializer [opt]
23708 identifier [opt] attributes [opt] : constant-expression
23710 C++0x Extensions:
23712 member-declaration:
23713 static_assert-declaration */
23715 static void
23717 {
23718 cp_decl_specifier_seq decl_specifiers;
23719 tree prefix_attributes;
23720 tree decl;
23729 /* Check for the `__extension__' keyword. */
23731 {
23732 /* Recurse. */
23734 /* Restore the old value of the PEDANTIC flag. */
23738 }
23740 /* Check for a template-declaration. */
23742 {
23743 /* An explicit specialization here is an error condition, and we
23744 expect the specialization handler to detect and report this. */
23748 else
23752 }
23753 /* Check for a template introduction. */
23757 /* Check for a using-declaration. */
23759 {
23761 {
23762 /* Parse the using-declaration. */
23766 }
23767 else
23768 {
23769 tree decl;
23773 /* Note that if we actually see the '=' token after the
23774 identifier, cp_parser_alias_declaration commits the
23775 tentative parse. In that case, we really expect an
23776 alias-declaration. Otherwise, we expect a using
23777 declaration. */
23778 alias_decl_expected =
23784 else
23788 }
23789 }
23791 /* Check for @defs. */
23793 {
23798 {
23803 }
23805 }
23807 /* If the next token is `static_assert' we have a static assertion. */
23809 {
23812 }
23819 /* Parse the decl-specifier-seq. */
23822 CP_PARSER_FLAGS_OPTIONAL,
23825 /* Check for an invalid type-name. */
23829 /* If there is no declarator, then the decl-specifier-seq should
23830 specify a type. */
23832 {
23833 /* If there was no decl-specifier-seq, and the next token is a
23834 `;', then we have something like:
23836 struct S { ; };
23838 [class.mem]
23840 Each member-declaration shall declare at least one member
23841 name of the class. */
23843 {
23846 {
23850 }
23851 }
23852 else
23853 {
23854 tree type;
23856 /* See if this declaration is a friend. */
23858 /* If there were decl-specifiers, check to see if there was
23859 a class-declaration. */
23862 /* Nested classes have already been added to the class, but
23863 a `friend' needs to be explicitly registered. */
23865 {
23866 /* If the `friend' keyword was present, the friend must
23867 be introduced with a class-key. */
23870 "in C++03 a class-key must be used "
23872 /* In this case:
23874 template <typename T> struct A {
23875 friend struct A<T>::B;
23876 };
23878 A<T>::B will be represented by a TYPENAME_TYPE, and
23879 therefore not recognized by check_tag_decl. */
23881 {
23885 }
23888 "friend declaration does not name a class or "
23890 else
23893 }
23894 /* If there is no TYPE, an error message will already have
23895 been issued. */
23897 ;
23898 /* An anonymous aggregate has to be handled specially; such
23899 a declaration really declares a data member (with a
23900 particular type), as opposed to a nested class. */
23902 {
23903 /* C++11 9.5/6. */
23906 "a storage class on an anonymous aggregate "
23909 /* Remove constructors and such from TYPE, now that we
23910 know it is an anonymous aggregate. */
23912 /* And make the corresponding data member. */
23915 /* Add it to the class. */
23917 }
23918 else
23919 cp_parser_check_access_in_redeclaration
23922 }
23923 }
23924 else
23925 {
23928 /* Clear attributes from the decl_specifiers but keep them
23929 around as prefix attributes that apply them to the entity
23930 being declared. */
23934 /* See if these declarations will be friends. */
23937 /* Keep going until we hit the `;' at the end of the
23938 declaration. */
23940 {
23942 tree first_attribute;
23943 tree initializer;
23946 /* Peek at the next token. */
23949 /* The following code wants to know early if it is a bit-field
23950 or some other declaration. Attributes can appear before
23951 the `:' token. Skip over them without consuming any tokens
23952 to peek if they are followed by `:'. */
23957 {
23958 size_t n
23961 }
23963 /* Check for a bitfield declaration. */
23969 {
23970 tree identifier;
23971 tree width;
23976 else
23979 /* Look for attributes that apply to the bitfield. */
23982 /* Consume the `:' token. */
23985 /* Get the width of the bitfield. */
23989 /* In C++2A and as extension for C++11 and above we allow
23990 default member initializers for bit-fields. */
23995 CPP_OPEN_BRACE)))
23996 {
23997 location_t loc
24003 "default member initializers for bit-fields "
24004 "only available with -std=c++2a or "
24009 {
24013 }
24014 }
24015 else
24016 {
24017 /* Look for attributes that apply to the bitfield after
24018 the `:' token and width. This is where GCC used to
24019 parse attributes in the past, pedwarn if there is
24020 a std attribute. */
24023 "ISO C++ allows bit-field attributes only "
24027 }
24031 /* Remember which attributes are prefix attributes and
24032 which are not. */
24034 /* Combine the attributes. */
24037 /* Create the bitfield declaration. */
24040 identifier,
24041 sfk_none)
24045 attributes);
24046 }
24047 else
24048 {
24050 tree asm_specification;
24053 /* Parse the declarator. */
24054 declarator
24059 friend_p);
24061 /* If something went wrong parsing the declarator, make sure
24062 that we at least consume some tokens. */
24064 {
24065 /* Skip to the end of the statement. */
24067 /* If the next token is not a semicolon, that is
24068 probably because we just skipped over the body of
24069 a function. So, we consume a semicolon if
24070 present, but do not issue an error message if it
24071 is not present. */
24073 CPP_SEMICOLON))
24076 }
24079 cp_parser_check_for_definition_in_return_type
24083 /* Look for an asm-specification. */
24085 /* Look for attributes that apply to the declaration. */
24087 /* Remember which attributes are prefix attributes and
24088 which are not. */
24090 /* Combine the attributes. */
24093 /* If it's an `=', then we have a constant-initializer or a
24094 pure-specifier. It is not correct to parse the
24095 initializer before registering the member declaration
24096 since the member declaration should be in scope while
24097 its initializer is processed. However, the rest of the
24098 front end does not yet provide an interface that allows
24099 us to handle this correctly. */
24101 {
24102 /* In [class.mem]:
24104 A pure-specifier shall be used only in the declaration of
24105 a virtual function.
24107 A member-declarator can contain a constant-initializer
24108 only if it declares a static member of integral or
24109 enumeration type.
24111 Therefore, if the DECLARATOR is for a function, we look
24112 for a pure-specifier; otherwise, we look for a
24113 constant-initializer. When we call `grokfield', it will
24114 perform more stringent semantics checks. */
24126 {
24128 /* Don't require a constant rvalue in C++11, since we
24129 might want a reference constant. We'll enforce
24130 constancy later. */
24132 /* Parse the initializer. */
24135 }
24136 else
24137 /* Parse the initializer. */
24139 }
24142 {
24146 else
24148 }
24149 /* Otherwise, there is no initializer. */
24150 else
24153 /* See if we are probably looking at a function
24154 definition. We are certainly not looking at a
24155 member-declarator. Calling `grokfield' has
24156 side-effects, so we must not do it unless we are sure
24157 that we are looking at a member-declarator. */
24160 {
24161 /* The grammar does not allow a pure-specifier to be
24162 used when a member function is defined. (It is
24163 possible that this fact is an oversight in the
24164 standard, since a pure function may be defined
24165 outside of the class-specifier. */
24171 declarator,
24172 attributes);
24175 /* If the member was not a friend, declare it here. */
24178 /* Peek at the next token. */
24180 /* If the next token is a semicolon, consume it. */
24182 {
24183 location_t semicolon_loc
24188 "extra %<;%> after in-class "
24190 }
24192 }
24193 else
24196 /* Create the declaration. */
24201 {
24204 else
24206 }
24207 }
24212 /* Reset PREFIX_ATTRIBUTES. */
24214 {
24219 }
24221 /* If there is any qualification still in effect, clear it
24222 now; we will be starting fresh with the next declarator. */
24226 /* If it's a `,', then there are more declarators. */
24228 {
24231 {
24237 }
24238 }
24239 /* If the next token isn't a `;', then we have a parse error. */
24241 CPP_SEMICOLON))
24242 {
24243 /* The next token might be a ways away from where the
24244 actual semicolon is missing. Find the previous token
24245 and use that for our error position. */
24252 /* Assume that the user meant to provide a semicolon. If
24253 we were to cp_parser_skip_to_end_of_statement, we might
24254 skip to a semicolon inside a member function definition
24255 and issue nonsensical error messages. */
24257 }
24260 {
24261 /* Add DECL to the list of members. */
24263 /* Explicitly include, eg, NSDMIs, for better error
24264 recovery (c++/58650). */
24272 /* Add DECL to the queue of NSDMI to be parsed later. */
24274 }
24278 }
24279 }
24282 out:
24284 }
24286 /* Parse a pure-specifier.
24288 pure-specifier:
24289 = 0
24291 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24292 Otherwise, ERROR_MARK_NODE is returned. */
24294 static tree
24296 {
24299 /* Look for the `=' token. */
24302 /* Look for the `0' token. */
24311 /* Accept = default or = delete in c++0x mode. */
24314 {
24317 }
24319 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24321 {
24326 }
24328 {
24331 }
24334 }
24336 /* Parse a constant-initializer.
24338 constant-initializer:
24339 = constant-expression
24341 Returns a representation of the constant-expression. */
24343 static tree
24345 {
24346 /* Look for the `=' token. */
24350 /* It is invalid to write:
24352 struct S { static const int i = { 7 }; };
24354 */
24356 {
24359 /* Consume the opening brace. */
24360 matching_braces braces;
24362 /* Skip the initializer. */
24364 /* Look for the trailing `}'. */
24368 }
24371 }
24373 /* Derived classes [gram.class.derived] */
24375 /* Parse a base-clause.
24377 base-clause:
24378 : base-specifier-list
24380 base-specifier-list:
24381 base-specifier ... [opt]
24382 base-specifier-list , base-specifier ... [opt]
24384 Returns a TREE_LIST representing the base-classes, in the order in
24385 which they were declared. The representation of each node is as
24386 described by cp_parser_base_specifier.
24388 In the case that no bases are specified, this function will return
24389 NULL_TREE, not ERROR_MARK_NODE. */
24391 static tree
24393 {
24396 /* Look for the `:' that begins the list. */
24399 /* Scan the base-specifier-list. */
24401 {
24403 tree base;
24406 /* Look for the base-specifier. */
24408 /* Look for the (optional) ellipsis. */
24410 {
24411 /* Consume the `...'. */
24415 }
24417 /* Add BASE to the front of the list. */
24419 {
24421 /* Make this a pack expansion type. */
24425 {
24428 }
24429 }
24430 /* Peek at the next token. */
24432 /* If it's not a comma, then the list is complete. */
24435 /* Consume the `,'. */
24437 }
24439 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24440 base class had a qualified name. However, the next name that
24441 appears is certainly not qualified. */
24447 }
24449 /* Parse a base-specifier.
24451 base-specifier:
24452 :: [opt] nested-name-specifier [opt] class-name
24453 virtual access-specifier [opt] :: [opt] nested-name-specifier
24454 [opt] class-name
24455 access-specifier virtual [opt] :: [opt] nested-name-specifier
24456 [opt] class-name
24458 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24459 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24460 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24461 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24463 static tree
24465 {
24473 tree type;
24475 /* Process the optional `virtual' and `access-specifier'. */
24477 {
24478 /* Peek at the next token. */
24480 /* Process `virtual'. */
24482 {
24484 /* If `virtual' appears more than once, issue an error. */
24486 {
24490 }
24494 /* Consume the `virtual' token. */
24502 /* If more than one access specifier appears, issue an
24503 error. */
24506 {
24510 }
24514 /* Consume the access-specifier. */
24522 }
24523 }
24524 /* It is not uncommon to see programs mechanically, erroneously, use
24525 the 'typename' keyword to denote (dependent) qualified types
24526 as base classes. */
24528 {
24533 else
24535 "keyword %<typename%> not allowed in this context "
24538 }
24540 /* Look for the optional `::' operator. */
24542 /* Look for the nested-name-specifier. The simplest way to
24543 implement:
24545 [temp.res]
24547 The keyword `typename' is not permitted in a base-specifier or
24548 mem-initializer; in these contexts a qualified name that
24549 depends on a template-parameter is implicitly assumed to be a
24550 type name.
24552 is to pretend that we have seen the `typename' keyword at this
24553 point. */
24559 /* If the base class is given by a qualified name, assume that names
24560 we see are type names or templates, as appropriate. */
24566 /* DR 950 allows decltype as a base-specifier. */
24568 else
24569 {
24570 /* Otherwise, look for the class-name. */
24572 class_scope_p,
24573 template_p,
24574 typename_type,
24579 }
24585 }
24587 /* Exception handling [gram.exception] */
24589 /* Parse an (optional) noexcept-specification.
24591 noexcept-specification:
24592 noexcept ( constant-expression ) [opt]
24594 If no noexcept-specification is present, returns NULL_TREE.
24595 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24596 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24597 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24598 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24599 in which case a boolean condition is returned instead. */
24601 static tree
24606 {
24610 /* Peek at the next token. */
24613 /* Is it a noexcept-specification? */
24615 {
24616 tree expr;
24620 {
24621 matching_parens parens;
24625 {
24626 /* Types may not be defined in an exception-specification. */
24628 parser->type_definition_forbidden_message
24633 /* Restore the saved message. */
24635 }
24636 else
24637 {
24640 }
24643 }
24644 else
24645 {
24649 }
24651 /* We cannot build a noexcept-spec right away because this will check
24652 that expr is a constexpr. */
24655 else
24657 }
24658 else
24660 }
24662 /* Parse an (optional) exception-specification.
24664 exception-specification:
24665 throw ( type-id-list [opt] )
24667 Returns a TREE_LIST representing the exception-specification. The
24668 TREE_VALUE of each node is a type. */
24670 static tree
24672 {
24674 tree type_id_list;
24677 /* Peek at the next token. */
24680 /* Is it a noexcept-specification? */
24686 /* If it's not `throw', then there's no exception-specification. */
24692 /* Consume the `throw'. */
24695 /* Look for the `('. */
24696 matching_parens parens;
24699 /* Peek at the next token. */
24701 /* If it's not a `)', then there is a type-id-list. */
24703 {
24704 /* Types may not be defined in an exception-specification. */
24706 parser->type_definition_forbidden_message
24708 /* Parse the type-id-list. */
24710 /* Restore the saved message. */
24714 {
24718 }
24721 "dynamic exception specifications are deprecated in "
24723 }
24724 /* In C++17, throw() is equivalent to noexcept (true). throw()
24725 is deprecated in C++11 and above as well, but is still widely used,
24726 so don't warn about it yet. */
24729 else
24732 /* Look for the `)'. */
24736 }
24738 /* Parse an (optional) type-id-list.
24740 type-id-list:
24741 type-id ... [opt]
24742 type-id-list , type-id ... [opt]
24744 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24745 in the order that the types were presented. */
24747 static tree
24749 {
24753 {
24755 tree type;
24759 /* Get the next type-id. */
24761 /* Check for invalid 'auto'. */
24763 {
24767 }
24768 /* Parse the optional ellipsis. */
24770 {
24771 /* Consume the `...'. */
24774 /* Turn the type into a pack expansion expression. */
24776 }
24777 /* Add it to the list. */
24779 /* Peek at the next token. */
24781 /* If it is not a `,', we are done. */
24784 /* Consume the `,'. */
24786 }
24789 }
24791 /* Parse a try-block.
24793 try-block:
24794 try compound-statement handler-seq */
24796 static tree
24798 {
24799 tree try_block;
24813 }
24815 /* Parse a function-try-block.
24817 function-try-block:
24818 try ctor-initializer [opt] function-body handler-seq */
24820 static void
24822 {
24823 tree compound_stmt;
24824 tree try_block;
24826 /* Look for the `try' keyword. */
24829 /* Let the rest of the front end know where we are. */
24831 /* Parse the function-body. */
24832 cp_parser_ctor_initializer_opt_and_function_body
24834 /* We're done with the `try' part. */
24836 /* Parse the handlers. */
24838 /* We're done with the handlers. */
24840 }
24842 /* Parse a handler-seq.
24844 handler-seq:
24845 handler handler-seq [opt] */
24847 static void
24849 {
24851 {
24854 /* Parse the handler. */
24856 /* Peek at the next token. */
24858 /* If it's not `catch' then there are no more handlers. */
24861 }
24862 }
24864 /* Parse a handler.
24866 handler:
24867 catch ( exception-declaration ) compound-statement */
24869 static void
24871 {
24872 tree handler;
24873 tree declaration;
24877 matching_parens parens;
24884 }
24886 /* Parse an exception-declaration.
24888 exception-declaration:
24889 type-specifier-seq declarator
24890 type-specifier-seq abstract-declarator
24891 type-specifier-seq
24892 ...
24894 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24895 ellipsis variant is used. */
24897 static tree
24899 {
24900 cp_decl_specifier_seq type_specifiers;
24904 /* If it's an ellipsis, it's easy to handle. */
24906 {
24907 /* Consume the `...' token. */
24910 }
24912 /* Types may not be defined in exception-declarations. */
24914 parser->type_definition_forbidden_message
24917 /* Parse the type-specifier-seq. */
24921 /* If it's a `)', then there is no declarator. */
24924 else
24931 /* Restore the saved message. */
24938 }
24940 /* Parse a throw-expression.
24942 throw-expression:
24943 throw assignment-expression [opt]
24945 Returns a THROW_EXPR representing the throw-expression. */
24947 static tree
24949 {
24950 tree expression;
24955 /* Figure out whether or not there is an assignment-expression
24956 following the "throw" keyword. */
24964 else
24968 }
24970 /* GNU Extensions */
24972 /* Parse an (optional) asm-specification.
24974 asm-specification:
24975 asm ( string-literal )
24977 If the asm-specification is present, returns a STRING_CST
24978 corresponding to the string-literal. Otherwise, returns
24979 NULL_TREE. */
24981 static tree
24983 {
24985 tree asm_specification;
24987 /* Peek at the next token. */
24989 /* If the next token isn't the `asm' keyword, then there's no
24990 asm-specification. */
24994 /* Consume the `asm' token. */
24996 /* Look for the `('. */
24997 matching_parens parens;
25000 /* Look for the string-literal. */
25003 /* Look for the `)'. */
25007 }
25009 /* Parse an asm-operand-list.
25011 asm-operand-list:
25012 asm-operand
25013 asm-operand-list , asm-operand
25015 asm-operand:
25016 string-literal ( expression )
25017 [ string-literal ] string-literal ( expression )
25019 Returns a TREE_LIST representing the operands. The TREE_VALUE of
25020 each node is the expression. The TREE_PURPOSE is itself a
25021 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
25022 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
25023 is a STRING_CST for the string literal before the parenthesis. Returns
25024 ERROR_MARK_NODE if any of the operands are invalid. */
25026 static tree
25028 {
25033 {
25034 tree string_literal;
25035 tree expression;
25036 tree name;
25039 {
25040 /* Consume the `[' token. */
25042 /* Read the operand name. */
25047 /* Look for the closing `]'. */
25049 }
25050 else
25052 /* Look for the string-literal. */
25055 /* Look for the `('. */
25056 matching_parens parens;
25058 /* Parse the expression. */
25060 /* Look for the `)'. */
25068 /* Add this operand to the list. */
25070 expression,
25071 asm_operands);
25072 /* If the next token is not a `,', there are no more
25073 operands. */
25076 /* Consume the `,'. */
25078 }
25081 }
25083 /* Parse an asm-clobber-list.
25085 asm-clobber-list:
25086 string-literal
25087 asm-clobber-list , string-literal
25089 Returns a TREE_LIST, indicating the clobbers in the order that they
25090 appeared. The TREE_VALUE of each node is a STRING_CST. */
25092 static tree
25094 {
25098 {
25099 tree string_literal;
25101 /* Look for the string literal. */
25103 /* Add it to the list. */
25105 /* If the next token is not a `,', then the list is
25106 complete. */
25109 /* Consume the `,' token. */
25111 }
25114 }
25116 /* Parse an asm-label-list.
25118 asm-label-list:
25119 identifier
25120 asm-label-list , identifier
25122 Returns a TREE_LIST, indicating the labels in the order that they
25123 appeared. The TREE_VALUE of each node is a label. */
25125 static tree
25127 {
25131 {
25134 /* Look for the identifier. */
25137 {
25140 {
25146 }
25147 }
25148 /* If the next token is not a `,', then the list is
25149 complete. */
25152 /* Consume the `,' token. */
25154 }
25157 }
25159 /* Return TRUE iff the next tokens in the stream are possibly the
25160 beginning of a GNU extension attribute. */
25162 static bool
25164 {
25166 }
25168 /* Return TRUE iff the next tokens in the stream are possibly the
25169 beginning of a standard C++-11 attribute specifier. */
25171 static bool
25173 {
25175 }
25177 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25178 beginning of a standard C++-11 attribute specifier. */
25180 static bool
25182 {
25190 }
25192 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25193 beginning of a GNU extension attribute. */
25195 static bool
25197 {
25201 }
25203 /* Return true iff the next tokens can be the beginning of either a
25204 GNU attribute list, or a standard C++11 attribute sequence. */
25206 static bool
25208 {
25211 }
25213 /* Return true iff the next Nth tokens can be the beginning of either
25214 a GNU attribute list, or a standard C++11 attribute sequence. */
25216 static bool
25218 {
25221 }
25223 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
25224 of GNU attributes, or return NULL. */
25226 static tree
25228 {
25232 }
25234 /* Parse an (optional) series of attributes.
25236 attributes:
25237 attributes attribute
25239 attribute:
25240 __attribute__ (( attribute-list [opt] ))
25242 The return value is as for cp_parser_gnu_attribute_list. */
25244 static tree
25246 {
25253 {
25255 tree attribute_list;
25258 /* Peek at the next token. */
25260 /* If it's not `__attribute__', then we're done. */
25264 /* Consume the `__attribute__' keyword. */
25266 /* Look for the two `(' tokens. */
25267 matching_parens outer_parens;
25269 matching_parens inner_parens;
25272 /* Peek at the next token. */
25275 /* Parse the attribute-list. */
25277 else
25278 /* If the next token is a `)', then there is no attribute
25279 list. */
25282 /* Look for the two `)' tokens. */
25290 /* Add these new attributes to the list. */
25292 }
25295 }
25297 /* Parse a GNU attribute-list.
25299 attribute-list:
25300 attribute
25301 attribute-list , attribute
25303 attribute:
25304 identifier
25305 identifier ( identifier )
25306 identifier ( identifier , expression-list )
25307 identifier ( expression-list )
25309 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25310 to an attribute. The TREE_PURPOSE of each node is the identifier
25311 indicating which attribute is in use. The TREE_VALUE represents
25312 the arguments, if any. */
25314 static tree
25316 {
25322 {
25324 tree identifier;
25325 tree attribute;
25327 /* Look for the identifier. We also allow keywords here; for
25328 example `__attribute__ ((const))' is legal. */
25332 {
25335 /* Consume the token, but save it since we need it for the
25336 SIMD enabled function parsing. */
25339 /* Save away the identifier that indicates which attribute
25340 this is. */
25342 /* For keywords, use the canonical spelling, not the
25343 parsed identifier. */
25350 /* Peek at the next token. */
25352 /* If it's an `(', then parse the attribute arguments. */
25354 {
25358 vec = cp_parser_parenthesized_expression_list
25364 else
25365 {
25368 }
25369 /* Save the arguments away. */
25371 }
25374 {
25375 /* Add this attribute to the list. */
25378 }
25381 }
25382 /* Now, look for more attributes. If the next token isn't a
25383 `,', we're done. */
25387 /* Consume the comma and keep going. */
25389 }
25392 /* We built up the list in reverse order. */
25394 }
25396 /* Parse a standard C++11 attribute.
25398 The returned representation is a TREE_LIST which TREE_PURPOSE is
25399 the scoped name of the attribute, and the TREE_VALUE is its
25400 arguments list.
25402 Note that the scoped name of the attribute is itself a TREE_LIST
25403 which TREE_PURPOSE is the namespace of the attribute, and
25404 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25405 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25406 and which TREE_PURPOSE is directly the attribute name.
25408 Clients of the attribute code should use get_attribute_namespace
25409 and get_attribute_name to get the actual namespace and name of
25410 attributes, regardless of their being GNU or C++11 attributes.
25412 attribute:
25413 attribute-token attribute-argument-clause [opt]
25415 attribute-token:
25416 identifier
25417 attribute-scoped-token
25419 attribute-scoped-token:
25420 attribute-namespace :: identifier
25422 attribute-namespace:
25423 identifier
25425 attribute-argument-clause:
25426 ( balanced-token-seq )
25428 balanced-token-seq:
25429 balanced-token [opt]
25430 balanced-token-seq balanced-token
25432 balanced-token:
25433 ( balanced-token-seq )
25434 [ balanced-token-seq ]
25435 { balanced-token-seq }. */
25437 static tree
25439 {
25446 /* First, parse name of the attribute, a.k.a attribute-token. */
25463 {
25464 /* We are seeing a scoped attribute token. */
25479 else
25480 {
25484 }
25489 NULL_TREE);
25491 }
25493 {
25497 NULL_TREE);
25498 }
25499 else
25500 {
25503 NULL_TREE);
25504 /* C++11 noreturn attribute is equivalent to GNU's. */
25507 /* C++14 deprecated attribute is equivalent to GNU's. */
25510 /* C++17 fallthrough attribute is equivalent to GNU's. */
25513 /* Transactional Memory TS optimize_for_synchronized attribute is
25514 equivalent to GNU transaction_callable. */
25518 /* Transactional Memory attributes are GNU attributes. */
25521 }
25523 /* Now parse the optional argument clause of the attribute. */
25528 {
25534 /* A GNU attribute that takes an identifier in parameter. */
25537 vec = cp_parser_parenthesized_expression_list
25543 else
25544 {
25547 }
25551 else
25553 }
25556 }
25558 /* Check that the attribute ATTRIBUTE appears at most once in the
25559 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25560 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25561 isn't implemented yet in GCC. */
25563 static void
25565 {
25567 {
25577 }
25578 }
25580 /* Parse a list of standard C++-11 attributes.
25582 attribute-list:
25583 attribute [opt]
25584 attribute-list , attribute[opt]
25585 attribute ...
25586 attribute-list , attribute ...
25587 */
25589 static tree
25591 {
25596 {
25601 {
25605 }
25608 {
25613 else
25614 {
25619 }
25621 }
25625 }
25628 }
25630 /* Parse a standard C++-11 attribute specifier.
25632 attribute-specifier:
25633 [ [ attribute-using-prefix [opt] attribute-list ] ]
25634 alignment-specifier
25636 attribute-using-prefix:
25637 using attribute-namespace :
25639 alignment-specifier:
25640 alignas ( type-id ... [opt] )
25641 alignas ( alignment-expression ... [opt] ). */
25643 static tree
25645 {
25651 {
25658 {
25669 {
25673 "attribute using prefix only available "
25679 }
25680 else
25682 }
25689 else
25690 /* Warn about parsing c++11 attribute in non-c++11 mode, only
25691 when we are sure that we have actually parsed them. */
25693 }
25694 else
25695 {
25696 tree alignas_expr;
25698 /* Look for an alignment-specifier. */
25709 matching_parens parens;
25717 {
25724 }
25729 /* Handle alignas (pack...). */
25731 {
25734 }
25736 /* Something went wrong, so don't build the attribute. */
25743 /* Build the C++-11 representation of an 'aligned'
25744 attribute. */
25745 attributes
25748 }
25751 }
25753 /* Parse a standard C++-11 attribute-specifier-seq.
25755 attribute-specifier-seq:
25756 attribute-specifier-seq [opt] attribute-specifier
25757 */
25759 static tree
25761 {
25766 {
25775 else
25778 }
25781 }
25783 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25784 return index of the first token after balanced-token, or N on failure. */
25786 static size_t
25788 {
25791 do
25793 {
25796 /* Ran out of tokens. */
25818 }
25821 }
25823 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25824 return index of the first token after the GNU attribute tokens, or N on
25825 failure. */
25827 static size_t
25829 {
25831 {
25843 }
25845 }
25847 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25848 next token), return index of the first token after the standard C++11
25849 attribute tokens, or N on failure. */
25851 static size_t
25853 {
25855 {
25858 {
25865 }
25868 {
25873 }
25874 else
25876 }
25878 }
25880 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25881 as the next token), return index of the first token after the attribute
25882 tokens, or N on failure. */
25884 static size_t
25886 {
25890 }
25892 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25893 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25894 current value of the PEDANTIC flag, regardless of whether or not
25895 the `__extension__' keyword is present. The caller is responsible
25896 for restoring the value of the PEDANTIC flag. */
25898 static bool
25900 {
25901 /* Save the old value of the PEDANTIC flag. */
25905 {
25906 /* Consume the `__extension__' token. */
25908 /* We're not being pedantic while the `__extension__' keyword is
25909 in effect. */
25913 }
25916 }
25918 /* Parse a label declaration.
25920 label-declaration:
25921 __label__ label-declarator-seq ;
25923 label-declarator-seq:
25924 identifier , label-declarator-seq
25925 identifier */
25927 static void
25929 {
25930 /* Look for the `__label__' keyword. */
25934 {
25935 tree identifier;
25937 /* Look for an identifier. */
25939 /* If we failed, stop. */
25942 /* Declare it as a label. */
25944 /* If the next token is a `;', stop. */
25947 /* Look for the `,' separating the label declarations. */
25949 }
25951 /* Look for the final `;'. */
25953 }
25955 // -------------------------------------------------------------------------- //
25956 // Requires Clause
25958 // Parse a requires clause.
25959 //
25960 // requires-clause:
25961 // 'requires' logical-or-expression
25962 //
25963 // The required logical-or-expression must be a constant expression. Note
25964 // that we don't check that the expression is constepxr here. We defer until
25965 // we analyze constraints and then, we only check atomic constraints.
25966 static tree
25968 {
25969 // Parse the requires clause so that it is not automatically folded.
25977 }
25979 // Optionally parse a requires clause:
25980 static tree
25982 {
25985 {
25988 {
25991 /* Parse and discard the requires-clause. */
25994 }
25996 }
25999 }
26002 /*---------------------------------------------------------------------------
26003 Requires expressions
26004 ---------------------------------------------------------------------------*/
26006 /* Parse a requires expression
26008 requirement-expression:
26009 'requires' requirement-parameter-list [opt] requirement-body */
26010 static tree
26012 {
26016 /* A requires-expression shall appear only within a concept
26017 definition or a requires-clause.
26019 TODO: Implement this diagnostic correctly. */
26021 {
26025 }
26028 {
26029 /* Local parameters are delared as variables within the scope
26030 of the expression. They are not visible past the end of
26031 the expression. Expressions within the requires-expression
26032 are unevaluated. */
26033 struct scope_sentinel
26034 {
26036 {
26039 }
26042 {
26045 }
26048 /* Parse the optional parameter list. */
26050 {
26054 }
26055 else
26058 /* Parse the requirement body. */
26062 }
26064 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
26065 the parm chain. */
26068 }
26070 /* Parse a parameterized requirement.
26072 requirement-parameter-list:
26073 '(' parameter-declaration-clause ')' */
26074 static tree
26076 {
26077 matching_parens parens;
26087 }
26089 /* Parse the body of a requirement.
26091 requirement-body:
26092 '{' requirement-list '}' */
26093 static tree
26095 {
26096 matching_braces braces;
26106 }
26108 /* Parse a list of requirements.
26110 requirement-list:
26111 requirement
26112 requirement-list ';' requirement[opt] */
26113 static tree
26115 {
26118 {
26125 /* If we see a semi-colon, consume it. */
26129 /* Stop processing at the end of the list. */
26132 }
26134 /* Reverse the order of requirements so they are analyzed in
26135 declaration order. */
26137 }
26139 /* Parse a syntactic requirement or type requirement.
26141 requirement:
26142 simple-requirement
26143 compound-requirement
26144 type-requirement
26145 nested-requirement */
26146 static tree
26148 {
26155 else
26157 }
26159 /* Parse a simple requirement.
26161 simple-requirement:
26162 expression ';' */
26163 static tree
26165 {
26174 }
26176 /* Parse a type requirement
26178 type-requirement
26179 nested-name-specifier [opt] required-type-name ';'
26181 required-type-name:
26182 type-name
26183 'template' [opt] simple-template-id */
26184 static tree
26186 {
26189 // Save the scope before parsing name specifiers.
26200 tree type;
26202 {
26211 }
26212 else
26231 }
26233 /* Parse a compound requirement
26235 compound-requirement:
26236 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
26237 static tree
26239 {
26240 /* Parse an expression enclosed in '{ }'s. */
26241 matching_braces braces;
26252 /* Parse the optional noexcept. */
26255 {
26258 }
26260 /* Parse the optional trailing return type. */
26263 {
26271 }
26274 }
26276 /* Parse a nested requirement. This is the same as a requires clause.
26278 nested-requirement:
26279 requires-clause */
26280 static tree
26282 {
26288 }
26290 /* Support Functions */
26292 /* Return the appropriate prefer_type argument for lookup_name_real based on
26293 tag_type and template_mem_access. */
26297 {
26298 /* DR 141: When looking in the current enclosing context for a template-name
26299 after -> or ., only consider class templates. */
26303 {
26307 }
26308 }
26310 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26311 NAME should have one of the representations used for an
26312 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26313 is returned. If PARSER->SCOPE is a dependent type, then a
26314 SCOPE_REF is returned.
26316 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26317 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26318 was formed. Abstractly, such entities should not be passed to this
26319 function, because they do not need to be looked up, but it is
26320 simpler to check for this special case here, rather than at the
26321 call-sites.
26323 In cases not explicitly covered above, this function returns a
26324 DECL, OVERLOAD, or baselink representing the result of the lookup.
26325 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26326 is returned.
26328 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26329 (e.g., "struct") that was used. In that case bindings that do not
26330 refer to types are ignored.
26332 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26333 ignored.
26335 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26336 are ignored.
26338 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26339 types.
26341 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26342 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26343 NULL_TREE otherwise. */
26345 static cp_expr
26352 location_t name_location)
26353 {
26354 tree decl;
26357 /* Assume that the lookup will be unambiguous. */
26361 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26362 no longer valid. Note that if we are parsing tentatively, and
26363 the parse fails, OBJECT_TYPE will be automatically restored. */
26369 /* A template-id has already been resolved; there is no lookup to
26370 do. */
26374 {
26378 }
26380 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26381 it should already have been checked to make sure that the name
26382 used matches the type being destroyed. */
26384 {
26385 tree type;
26387 /* Figure out to which type this destructor applies. */
26392 else
26394 /* If that's not a class type, there is no destructor. */
26405 }
26407 /* By this point, the NAME should be an ordinary identifier. If
26408 the id-expression was a qualified name, the qualifying scope is
26409 stored in PARSER->SCOPE at this point. */
26412 /* Perform the lookup. */
26414 {
26420 /* If the SCOPE is dependent, the lookup must be deferred until
26421 the template is instantiated -- unless we are explicitly
26422 looking up names in uninstantiated templates. Even then, we
26423 cannot look up the name if the scope is not a class type; it
26424 might, for example, be a template type parameter. */
26429 /* Defer lookup. */
26431 else
26432 {
26435 /* If PARSER->SCOPE is a dependent type, then it must be a
26436 class type, and we must not be checking dependencies;
26437 otherwise, we would have processed this lookup above. So
26438 that PARSER->SCOPE is not considered a dependent base by
26439 lookup_member, we must enter the scope here. */
26443 /* If the PARSER->SCOPE is a template specialization, it
26444 may be instantiated during name lookup. In that case,
26445 errors may be issued. Even if we rollback the current
26446 tentative parse, those errors are valid. */
26451 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26452 lookup result and the nested-name-specifier nominates a class C:
26453 * if the name specified after the nested-name-specifier, when
26454 looked up in C, is the injected-class-name of C (Clause 9), or
26455 * if the name specified after the nested-name-specifier is the
26456 same as the identifier or the simple-template-id's template-
26457 name in the last component of the nested-name-specifier,
26458 the name is instead considered to name the constructor of
26459 class C. [ Note: for example, the constructor is not an
26460 acceptable lookup result in an elaborated-type-specifier so
26461 the constructor would not be used in place of the
26462 injected-class-name. --end note ] Such a constructor name
26463 shall be used only in the declarator-id of a declaration that
26464 names a constructor or in a using-declaration. */
26472 /* If we have a single function from a using decl, pull it out. */
26479 }
26481 /* If the scope is a dependent type and either we deferred lookup or
26482 we did lookup but didn't find the name, rememeber the name. */
26485 {
26487 {
26488 tree type;
26490 /* The resolution to Core Issue 180 says that `struct
26491 A::B' should be considered a type-name, even if `A'
26492 is dependent. */
26497 }
26501 CPP_CLOSE_PAREN)))
26505 else
26508 is_template);
26509 }
26512 }
26514 {
26515 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26516 OBJECT_TYPE is not a class. */
26518 /* If the OBJECT_TYPE is a template specialization, it may
26519 be instantiated during name lookup. In that case, errors
26520 may be issued. Even if we rollback the current tentative
26521 parse, those errors are valid. */
26523 name,
26526 tf_warning_or_error);
26527 else
26531 /* Look it up in the enclosing context. DR 141: When looking for a
26532 template-name after -> or ., only consider class templates. */
26537 /* The object is type-dependent, so we can't look anything up; we used
26538 this to get the DR 141 behavior. */
26542 }
26543 else
26544 {
26550 }
26552 /* If the lookup failed, let our caller know. */
26556 /* Pull out the template from an injected-class-name (or multiple). */
26560 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26562 {
26565 /* The error message we have to print is too complicated for
26566 cp_parser_error, so we incorporate its actions directly. */
26568 {
26570 name);
26572 }
26574 }
26582 /* If we have resolved the name of a member declaration, check to
26583 see if the declaration is accessible. When the name resolves to
26584 set of overloaded functions, accessibility is checked when
26585 overload resolution is done.
26587 During an explicit instantiation, access is not checked at all,
26588 as per [temp.explicit]. */
26595 }
26597 /* Like cp_parser_lookup_name, but for use in the typical case where
26598 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26599 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26601 static tree
26603 {
26605 none_type,
26610 location);
26611 }
26613 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26614 the current context, return the TYPE_DECL. If TAG_NAME_P is
26615 true, the DECL indicates the class being defined in a class-head,
26616 or declared in an elaborated-type-specifier.
26618 Otherwise, return DECL. */
26620 static tree
26622 {
26623 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26624 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26626 struct A {
26627 template <typename T> struct B;
26628 };
26630 template <typename T> struct A::B {};
26632 Similarly, in an elaborated-type-specifier:
26634 namespace N { struct X{}; }
26636 struct A {
26637 template <typename T> friend struct N::X;
26638 };
26640 However, if the DECL refers to a class type, and we are in
26641 the scope of the class, then the name lookup automatically
26642 finds the TYPE_DECL created by build_self_reference rather
26643 than a TEMPLATE_DECL. For example, in:
26645 template <class T> struct S {
26646 S s;
26647 };
26649 there is no need to handle such case. */
26655 }
26657 /* If too many, or too few, template-parameter lists apply to the
26658 declarator, issue an error message. Returns TRUE if all went well,
26659 and FALSE otherwise. */
26661 static bool
26664 location_t declarator_location)
26665 {
26667 {
26669 {
26678 {
26679 /* If the DECLARATOR has the form `X<y>' then it uses one
26680 additional level of template parameters. */
26683 }
26685 return cp_parser_check_template_parameters
26687 declarator);
26688 }
26704 }
26706 }
26708 /* NUM_TEMPLATES were used in the current declaration. If that is
26709 invalid, return FALSE and issue an error messages. Otherwise,
26710 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26711 declarator and we can print more accurate diagnostics. */
26713 static bool
26717 location_t location,
26719 {
26720 /* If there are the same number of template classes and parameter
26721 lists, that's OK. */
26724 /* If there are more, but only one more, and the name ends in an identifier,
26725 then we are declaring a primary template. That's OK too. */
26729 /* If there are more template classes than parameter lists, we have
26730 something like:
26732 template <class T> void S<T>::R<T>::f (); */
26734 {
26744 else
26747 }
26748 /* Otherwise, there are too many template parameter lists. We have
26749 something like:
26751 template <class T> template <class U> void S::f(); */
26754 }
26756 /* Parse an optional `::' token indicating that the following name is
26757 from the global namespace. If so, PARSER->SCOPE is set to the
26758 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26759 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26760 Returns the new value of PARSER->SCOPE, if the `::' token is
26761 present, and NULL_TREE otherwise. */
26763 static tree
26765 {
26768 /* Peek at the next token. */
26770 /* If we're looking at a `::' token then we're starting from the
26771 global namespace, not our current location. */
26773 {
26774 /* Consume the `::' token. */
26776 /* Set the SCOPE so that we know where to start the lookup. */
26782 }
26784 {
26788 }
26791 }
26793 /* Returns TRUE if the upcoming token sequence is the start of a
26794 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26795 declarator is preceded by the `friend' specifier. */
26797 static bool
26799 {
26802 tree nested_name_specifier;
26805 /* The common case is that this is not a constructor declarator, so
26806 try to avoid doing lots of work if at all possible. It's not
26807 valid declare a constructor at function scope. */
26810 /* And only certain tokens can begin a constructor declarator. */
26818 /* Parse tentatively; we are going to roll back all of the tokens
26819 consumed here. */
26821 /* Assume that we are looking at a constructor declarator. */
26824 /* Look for the optional `::' operator. */
26827 /* Look for the nested-name-specifier. */
26828 nested_name_specifier
26839 /* Outside of a class-specifier, there must be a
26840 nested-name-specifier. Except in C++17 mode, where we
26841 might be declaring a guiding declaration. */
26848 /* If we have a class scope, this is easy; DR 147 says that S::S always
26849 names the constructor, and no other qualified name could. */
26852 {
26862 }
26863 /* If we still think that this might be a constructor-declarator,
26864 look for a class-name. */
26866 {
26867 /* If we have:
26869 template <typename T> struct S {
26870 S();
26871 };
26873 we must recognize that the nested `S' names a class. */
26877 tree type_decl;
26881 none_type,
26888 {
26894 none_type,
26899 else
26901 }
26903 /* If there was no class-name, then this is not a constructor.
26904 Otherwise, if we are in a class-specifier and we aren't
26905 handling a friend declaration, check that its type matches
26906 current_class_type (c++/38313). Note: error_mark_node
26907 is left alone for error recovery purposes. */
26909 && (outside_class_specifier_p
26915 /* If we're still considering a constructor, we have to see a `(',
26916 to begin the parameter-declaration-clause, followed by either a
26917 `)', an `...', or a decl-specifier. We need to check for a
26918 type-specifier to avoid being fooled into thinking that:
26920 S (f) (int);
26922 is a constructor. (It is actually a function named `f' that
26923 takes one parameter (of type `int') and returns a value of type
26924 `S'. */
26932 /* A parameter declaration begins with a decl-specifier,
26933 which is either the "attribute" keyword, a storage class
26934 specifier, or (usually) a type-specifier. */
26936 {
26937 tree type;
26941 /* Names appearing in the type-specifier should be looked up
26942 in the scope of the class. */
26946 {
26949 {
26953 {
26956 }
26957 }
26959 }
26961 /* Inside the constructor parameter list, surrounding
26962 template-parameter-lists do not apply. */
26963 saved_num_template_parameter_lists
26967 /* Look for the type-specifier. */
26969 CP_PARSER_FLAGS_NONE,
26975 parser->num_template_parameter_lists
26978 /* Leave the scope of the class. */
26983 }
26984 }
26986 /* We did not really want to consume any tokens. */
26990 }
26992 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26993 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26994 they must be performed once we are in the scope of the function.
26996 Returns the function defined. */
26998 static tree
26999 cp_parser_function_definition_from_specifiers_and_declarator
27002 tree attributes,
27004 {
27005 tree fn;
27008 /* Begin the function-definition. */
27011 /* The things we're about to see are not directly qualified by any
27012 template headers we've seen thus far. */
27015 /* If there were names looked up in the decl-specifier-seq that we
27016 did not check, check them now. We must wait until we are in the
27017 scope of the function to perform the checks, since the function
27018 might be a friend. */
27022 {
27027 }
27030 {
27031 /* Skip the entire function. */
27034 }
27036 {
27037 /* Seen already, skip it. An error message has already been output. */
27041 /* If this is a function from a class, pop the nested class. */
27044 }
27045 else
27046 {
27047 timevar_id_t tv;
27050 else
27056 }
27059 }
27061 /* Parse the part of a function-definition that follows the
27062 declarator. INLINE_P is TRUE iff this function is an inline
27063 function defined within a class-specifier.
27065 Returns the function defined. */
27067 static tree
27070 {
27071 tree fn;
27076 bool fully_implicit_function_template_p
27079 tree implicit_template_parms
27082 cp_binding_level* implicit_template_scope
27088 /* If the next token is `return', then the code may be trying to
27089 make use of the "named return value" extension that G++ used to
27090 support. */
27093 {
27094 /* Consume the `return' keyword. */
27096 /* Look for the identifier that indicates what value is to be
27097 returned. */
27099 /* Issue an error message. */
27102 /* Skip tokens until we reach the start of the function body. */
27104 {
27111 }
27112 }
27113 /* The `extern' in `extern "C" void f () { ... }' does not apply to
27114 anything declared inside `f'. */
27115 saved_in_unbraced_linkage_specification_p
27118 /* Inside the function, surrounding template-parameter-lists do not
27119 apply. */
27120 saved_num_template_parameter_lists
27124 /* If the next token is `try', `__transaction_atomic', or
27125 `__transaction_relaxed`, then we are looking at either function-try-block
27126 or function-transaction-block. Note that all of these include the
27127 function-body. */
27131 RID_TRANSACTION_RELAXED))
27135 else
27136 cp_parser_ctor_initializer_opt_and_function_body
27139 /* Finish the function. */
27141 /* Generate code for it, if necessary. */
27143 /* Restore the saved values. */
27144 parser->in_unbraced_linkage_specification_p
27146 parser->num_template_parameter_lists
27150 parser->fully_implicit_function_template_p
27152 parser->implicit_template_parms
27154 parser->implicit_template_scope
27161 }
27163 /* Parse a template-declaration body (following argument list). */
27165 static void
27167 tree parameter_list,
27169 {
27173 /* We just processed one more parameter list. */
27176 /* Get the deferred access checks from the parameter list. These
27177 will be checked once we know what is being declared, as for a
27178 member template the checks must be performed in the scope of the
27179 class containing the member. */
27182 /* Tentatively parse for a new template parameter list, which can either be
27183 the template keyword or a template introduction. */
27189 else
27190 {
27191 /* There are no access checks when parsing a template, as we do not
27192 know if a specialization will be a friend. */
27196 checks,
27197 member_p,
27202 /* If this is a member template declaration, let the front
27203 end know. */
27205 {
27210 }
27215 }
27216 /* We are done with the current parameter list. */
27221 /* Finish up. */
27224 /* Check the template arguments for a literal operator template. */
27228 {
27232 else
27233 {
27236 {
27240 /* OK, C++20 string literal operator template. We don't need
27241 to warn in lower dialects here because we will have already
27246 }
27248 {
27257 else
27258 /* http://cplusplus.github.io/EWG/ewg-active.html#66 */
27260 "ISO C++ did not adopt string literal operator templa"
27262 }
27263 else
27265 }
27267 {
27270 " Expected non-type template parameter pack <char...> "
27272 decl);
27273 else
27276 decl);
27277 }
27278 }
27280 /* Register member declarations. */
27283 /* If DECL is a function template, we must return to parse it later.
27284 (Even though there is no definition, there might be default
27285 arguments that need handling.) */
27289 }
27291 /* Parse a template introduction header for a template-declaration. Returns
27292 false if tentative parse fails. */
27294 static bool
27296 {
27303 /* Look for the optional `::' operator. */
27306 /* Look for the nested-name-specifier. */
27316 /* Look up the concept for which we will be matching
27317 template parameters. */
27327 /* Look for opening brace for introduction. */
27328 matching_braces braces;
27336 /* Build vector of placeholder parameters and grab
27337 matching identifiers. */
27340 /* Look for closing brace for introduction. */
27344 /* The introduction-list shall not be empty. */
27347 {
27348 /* In cp_parser_introduction_list we have already issued an error. */
27350 }
27353 {
27357 }
27359 /* Build and associate the constraint. */
27362 {
27364 member_p);
27366 }
27370 }
27372 /* Parse a normal template-declaration following the template keyword. */
27374 static void
27376 {
27377 tree parameter_list;
27381 /* Look for the `<' token. */
27385 {
27386 /* 14.5.2.2 [temp.mem]
27388 A local class shall not have member templates. */
27393 }
27394 /* [temp]
27396 A template ... shall not have C linkage. */
27398 {
27401 /* Give it C++ linkage to avoid confusing other parts of the
27402 front end. */
27405 }
27406 else
27409 /* We cannot perform access checks on the template parameter
27410 declarations until we know what is being declared, just as we
27411 cannot check the decl-specifier list. */
27414 /* If the next token is `>', then we have an invalid
27415 specialization. Rather than complain about an invalid template
27416 parameter, issue an error message here. */
27418 {
27422 }
27423 else
27424 {
27425 /* Parse the template parameters. */
27427 }
27429 /* Look for the `>'. */
27432 /* Manage template requirements */
27434 {
27439 }
27442 member_p);
27444 /* For the erroneous case of a template with C linkage, we pushed an
27445 implicit C++ linkage scope; exit that scope now. */
27448 }
27450 /* Parse a template-declaration, assuming that the `export' (and
27451 `extern') keywords, if present, has already been scanned. MEMBER_P
27452 is as for cp_parser_template_declaration. */
27454 static bool
27456 {
27458 {
27462 }
27467 }
27469 /* Perform the deferred access checks from a template-parameter-list.
27470 CHECKS is a TREE_LIST of access checks, as returned by
27471 get_deferred_access_checks. */
27473 static void
27474 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27475 {
27479 }
27481 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27482 `function-definition' sequence that follows a template header.
27483 If MEMBER_P is true, this declaration appears in a class scope.
27485 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27486 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27488 static tree
27494 {
27497 cp_decl_specifier_seq decl_specifiers;
27501 /* This function is only used when processing a template
27502 declaration. */
27506 /* Defer access checks until we know what is being declared. */
27509 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27510 alternative. */
27513 CP_PARSER_FLAGS_OPTIONAL,
27519 /* There are no template typedefs. */
27521 {
27525 }
27527 /* Gather up the access checks that occurred the
27528 decl-specifier-seq. */
27531 /* Check for the declaration of a template class. */
27533 {
27536 {
27537 // If this is a declaration, but not a definition, associate
27538 // any constraints with the type declaration. Constraints
27539 // are associated with definitions in cp_parser_class_specifier.
27545 /* In this case:
27547 struct C {
27548 friend template <typename T> struct A<T>::B;
27549 };
27551 A<T>::B will be represented by a TYPENAME_TYPE, and
27552 therefore not recognized by shadow_tag. */
27554 && !decl
27561 else
27564 /* Perform access checks for template parameters. */
27567 /* Give a helpful diagnostic for
27568 template <class T> struct A { } a;
27569 if we aren't already recovering from an error. */
27572 {
27574 "a class template declaration must not declare "
27578 }
27579 }
27580 }
27582 /* Complain about missing 'typename' or other invalid type names. */
27585 {
27586 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27587 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27588 the rest of this declaration. */
27591 }
27593 /* If it's not a template class, try for a template function. If
27594 the next token is a `;', then this declaration does not declare
27595 anything. But, if there were errors in the decl-specifiers, then
27596 the error might well have come from an attempted class-specifier.
27597 In that case, there's no need to warn about a missing declarator. */
27601 {
27604 checks,
27606 member_p,
27607 declares_class_or_enum,
27611 /* 7.1.1-1 [dcl.stc]
27613 A storage-class-specifier shall not be specified in an explicit
27614 specialization... */
27616 && explicit_specialization_p
27618 {
27622 }
27626 }
27628 /* Look for a trailing `;' after the declaration. */
27634 out:
27637 /* Clear any current qualification; whatever comes next is the start
27638 of something new. */
27644 }
27646 /* Parse a cast-expression that is not the operand of a unary "&". */
27648 static cp_expr
27650 {
27653 }
27655 /* Parse a functional cast to TYPE. Returns an expression
27656 representing the cast. */
27658 static cp_expr
27660 {
27662 tree expression_list;
27663 cp_expr cast;
27672 {
27682 /* Create a location of the form:
27683 type_name{i, f}
27684 ^~~~~~~~~~~~~~~
27685 with caret == start at the start of the type name,
27686 finishing at the closing brace. */
27687 location_t finish_loc
27690 finish_loc);
27693 }
27702 else
27703 {
27706 }
27709 tf_warning_or_error);
27710 /* [expr.const]/1: In an integral constant expression "only type
27711 conversions to integral or enumeration type can be used". */
27717 NIC_CONSTRUCTOR))
27720 /* Create a location of the form:
27721 float(i)
27722 ^~~~~~~~
27723 with caret == start at the start of the type name,
27724 finishing at the closing paren. */
27725 location_t finish_loc
27730 }
27732 /* Save the tokens that make up the body of a member function defined
27733 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27734 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27735 specifiers applied to the declaration. Returns the FUNCTION_DECL
27736 for the member function. */
27738 static tree
27742 tree attributes)
27743 {
27746 tree fn;
27749 /* Create the FUNCTION_DECL. */
27753 /* If something went badly wrong, bail out now. */
27755 {
27756 /* If there's a function-body, skip it. */
27761 }
27763 /* Remember it, if there default args to post process. */
27766 /* Save away the tokens that make up the body of the
27767 function. */
27773 RID_TRANSACTION_ATOMIC))
27774 {
27776 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27783 {
27789 }
27790 else
27793 {
27797 }
27798 }
27800 /* Handle function try blocks. */
27802 {
27805 }
27806 /* We can have braced-init-list mem-initializers before the fn body. */
27808 {
27811 {
27812 /* cache_group will stop after an un-nested { } pair, too. */
27816 /* variadic mem-inits have ... after the ')'. */
27819 }
27820 }
27822 /* Handle function try blocks. */
27828 /* Save away the inline definition; we will process it when the
27829 class is complete. */
27833 /* We need to know that this was defined in the class, so that
27834 friend templates are handled correctly. */
27837 /* Add FN to the queue of functions to be parsed later. */
27841 }
27843 /* Save the tokens that make up the in-class initializer for a non-static
27844 data member. Returns a DEFAULT_ARG. */
27846 static tree
27848 {
27850 }
27852 /* Parse a template-argument-list, as well as the trailing ">" (but
27853 not the opening "<"). See cp_parser_template_argument_list for the
27854 return value. */
27856 static tree
27858 {
27859 tree arguments;
27860 tree saved_scope;
27861 tree saved_qualifying_scope;
27862 tree saved_object_scope;
27865 /* [temp.names]
27867 When parsing a template-id, the first non-nested `>' is taken as
27868 the end of the template-argument-list rather than a greater-than
27869 operator. */
27870 saved_greater_than_is_operator_p
27873 /* Parsing the argument list may modify SCOPE, so we save it
27874 here. */
27878 /* We need to evaluate the template arguments, even though this
27879 template-id may be nested within a "sizeof". */
27880 cp_evaluated ev;
27881 /* Parse the template-argument-list itself. */
27885 else
27887 /* Look for the `>' that ends the template-argument-list. If we find
27888 a '>>' instead, it's probably just a typo. */
27890 {
27892 {
27893 /* In C++0x, a `>>' in a template argument list or cast
27894 expression is considered to be two separate `>'
27895 tokens. So, change the current token to a `>', but don't
27896 consume it: it will be consumed later when the outer
27897 template argument list (or cast expression) is parsed.
27898 Note that this replacement of `>' for `>>' is necessary
27899 even if we are parsing tentatively: in the tentative
27900 case, after calling
27901 cp_parser_enclosed_template_argument_list we will always
27902 throw away all of the template arguments and the first
27903 closing `>', either because the template argument list
27904 was erroneous or because we are replacing those tokens
27905 with a CPP_TEMPLATE_ID token. The second `>' (which will
27906 not have been thrown away) is needed either to close an
27907 outer template argument list or to complete a new-style
27908 cast. */
27911 }
27913 {
27914 /* If we're in a nested template argument list, the '>>' has
27915 to be a typo for '> >'. We emit the error message, but we
27916 continue parsing and we push a '>' as next token, so that
27917 the argument list will be parsed correctly. Note that the
27918 global source location is still on the token before the
27919 '>>', so we need to say explicitly where we want it. */
27927 }
27928 else
27929 {
27930 /* If this is not a nested template argument list, the '>>'
27931 is a typo for '>'. Emit an error message and continue.
27932 Same deal about the token location, but here we can get it
27933 right by consuming the '>>' before issuing the diagnostic. */
27936 "spurious %<>>%>, use %<>%> to terminate "
27938 }
27939 }
27940 else
27942 /* The `>' token might be a greater-than operator again now. */
27943 parser->greater_than_is_operator_p
27945 /* Restore the SAVED_SCOPE. */
27951 }
27953 /* MEMBER_FUNCTION is a member function, or a friend. If default
27954 arguments, or the body of the function have not yet been parsed,
27955 parse them now. */
27957 static void
27959 {
27961 /* If this member is a template, get the underlying
27962 FUNCTION_DECL. */
27966 /* There should not be any class definitions in progress at this
27967 point; the bodies of members are only parsed outside of all class
27968 definitions. */
27970 /* While we're parsing the member functions we might encounter more
27971 classes. We want to handle them right away, but we don't want
27972 them getting mixed up with functions that are currently in the
27973 queue. */
27976 /* Make sure that any template parameters are in scope. */
27979 /* If the body of the function has not yet been parsed, parse it
27980 now. */
27982 {
27983 tree function_scope;
27986 /* The function is no longer pending; we are processing it. */
27991 /* If this is a local class, enter the scope of the containing
27992 function. */
27997 /* Push the body of the function onto the lexer stack. */
28000 /* Let the front end know that we going to be defining this
28001 function. */
28005 /* Don't do access checking if it is a templated function. */
28009 /* #pragma omp declare reduction needs special parsing. */
28011 {
28016 }
28017 else
28018 /* Now, parse the body of the function. */
28025 /* Leave the scope of the containing function. */
28029 }
28031 /* Remove any template parameters from the symbol table. */
28034 /* Restore the queue. */
28037 }
28039 /* If DECL contains any default args, remember it on the unparsed
28040 functions queue. */
28042 static void
28044 {
28045 tree probe;
28048 probe;
28051 {
28055 }
28056 }
28058 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
28059 which is either a FIELD_DECL or PARM_DECL. Parse it and return
28060 the result. For a PARM_DECL, PARMTYPE is the corresponding type
28061 from the parameter-type-list. */
28063 static tree
28066 {
28068 tree parsed_arg;
28074 /* Push the saved tokens for the default argument onto the parser's
28075 lexer stack. */
28081 /* Parse the default argument. */
28092 {
28093 /* In a non-template class, check conversions now. In a template,
28094 we'll wait and instantiate these as needed. */
28097 tf_warning_or_error);
28100 else
28102 }
28104 /* If the token stream has not been completely used up, then
28105 there was extra junk after the end of the default
28106 argument. */
28108 {
28111 else
28113 }
28115 /* Revert to the main lexer. */
28119 }
28121 /* FIELD is a non-static data member with an initializer which we saved for
28122 later; parse it now. */
28124 static void
28126 {
28127 tree def;
28134 NULL_TREE);
28140 }
28142 /* FN is a FUNCTION_DECL which may contains a parameter with an
28143 unparsed DEFAULT_ARG. Parse the default args now. This function
28144 assumes that the current scope is the scope in which the default
28145 argument should be processed. */
28147 static void
28149 {
28153 /* While we're parsing the default args, we might (due to the
28154 statement expression extension) encounter more classes. We want
28155 to handle them right away, but we don't want them getting mixed
28156 up with default args that are currently in the queue. */
28159 /* Local variable names (and the `this' keyword) may not appear
28160 in a default argument. */
28171 {
28173 tree parsed_arg;
28175 tree copy;
28182 /* This can happen for a friend declaration for a function
28183 already declared with default arguments. */
28186 parsed_arg
28188 default_arg,
28192 /* Update any instantiations we've already created. */
28196 }
28200 /* Make sure no default arg is missing. */
28203 /* Restore the state of local_variables_forbidden_p. */
28206 /* Restore the queue. */
28208 }
28210 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
28212 sizeof ... ( identifier )
28214 where the 'sizeof' token has already been consumed. */
28216 static tree
28218 {
28219 /* Consume the `...'. */
28223 matching_parens parens;
28227 else
28235 /* The name is not qualified. */
28254 }
28256 /* Parse the operand of `sizeof' (or a similar operator). Returns
28257 either a TYPE or an expression, depending on the form of the
28258 input. The KEYWORD indicates which kind of expression we have
28259 encountered. */
28261 static tree
28263 {
28270 /* If it's a `...', then we are computing the length of a parameter
28271 pack. */
28276 /* Types cannot be defined in a `sizeof' expression. Save away the
28277 old message. */
28279 /* And create the new one. */
28285 /* The restrictions on constant-expressions do not apply inside
28286 sizeof expressions. */
28287 saved_integral_constant_expression_p
28289 saved_non_integral_constant_expression_p
28293 /* Do not actually evaluate the expression. */
28296 /* If it's a `(', then we might be looking at the type-id
28297 construction. */
28299 {
28302 /* We can't be sure yet whether we're looking at a type-id or an
28303 expression. */
28306 matching_parens parens;
28309 /* Note: as a GNU Extension, compound literals are considered
28310 postfix-expressions as they are in C99, so they are valid
28311 arguments to sizeof. See comment in cp_parser_cast_expression
28312 for details. */
28315 else
28316 {
28319 /* Look for the type-id. */
28321 /* Look for the closing `)'. */
28324 }
28326 /* If all went well, then we're done. */
28329 }
28331 /* If the type-id production did not work out, then we must be
28332 looking at the unary-expression production. */
28336 /* Go back to evaluating expressions. */
28340 /* Free the message we created. */
28342 /* And restore the old one. */
28344 parser->integral_constant_expression_p
28346 parser->non_integral_constant_expression_p
28350 }
28352 /* If the current declaration has no declarator, return true. */
28354 static bool
28356 {
28357 /* If the next token is a `;' or a `,' then there is no
28358 declarator. */
28361 }
28363 /* Update the DECL_SPECS to reflect the storage class indicated by
28364 KEYWORD. */
28366 static void
28371 {
28372 cp_storage_class storage_class;
28375 {
28379 }
28381 {
28384 }
28389 {
28392 }
28395 {
28413 }
28417 /* A storage class specifier cannot be applied alongside a typedef
28418 specifier. If there is a typedef specifier present then set
28419 conflicting_specifiers_p which will trigger an error later
28420 on in grokdeclarator. */
28423 }
28425 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28426 is true, the type is a class or enum definition. */
28428 static void
28430 tree type_spec,
28433 {
28436 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28437 (with, for example, in "typedef int wchar_t;") we remember that
28438 this is what happened. In system headers, we ignore these
28439 declarations so that G++ can work with system headers that are not
28440 C++-safe. */
28442 && !type_definition_p
28452 {
28455 ds_redefined_builtin_type_spec,
28456 token);
28458 {
28462 }
28463 }
28466 else
28467 {
28472 }
28473 }
28475 /* True iff TOKEN is the GNU keyword __thread. */
28477 static bool
28479 {
28482 }
28484 /* Set the location for a declarator specifier and check if it is
28485 duplicated.
28487 DECL_SPECS is the sequence of declarator specifiers onto which to
28488 set the location.
28490 DS is the single declarator specifier to set which location is to
28491 be set onto the existing sequence of declarators.
28493 LOCATION is the location for the declarator specifier to
28494 consider. */
28496 static void
28499 {
28508 {
28512 }
28513 else
28514 {
28516 {
28520 else
28521 {
28524 OPT_Wlong_long,
28526 }
28527 }
28529 {
28533 {
28537 }
28538 else
28539 {
28542 }
28543 }
28544 else
28545 {
28561 "__complex"
28562 };
28566 }
28567 }
28568 }
28570 /* Return true iff the declarator specifier DS is present in the
28571 sequence of declarator specifiers DECL_SPECS. */
28573 bool
28575 cp_decl_spec ds)
28576 {
28583 }
28585 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28586 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28588 static bool
28590 {
28592 }
28594 /* Issue an error message indicating that TOKEN_DESC was expected.
28595 If KEYWORD is true, it indicated this function is called by
28596 cp_parser_require_keword and the required token can only be
28597 a indicated keyword.
28599 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28600 within any error as the location of an "opening" token matching
28601 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28602 RT_CLOSE_PAREN). */
28604 static void
28606 required_token token_desc,
28608 location_t matching_location)
28609 {
28615 {
28684 }
28687 {
28689 {
28767 }
28768 }
28772 }
28775 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28776 issue an error message indicating that TOKEN_DESC was expected.
28778 Returns the token consumed, if the token had the appropriate type.
28779 Otherwise, returns NULL.
28781 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28782 within any error as the location of an "opening" token matching
28783 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28784 RT_CLOSE_PAREN). */
28789 required_token token_desc,
28790 location_t matching_location)
28791 {
28794 else
28795 {
28796 /* Output the MESSAGE -- unless we're parsing tentatively. */
28799 matching_location);
28801 }
28802 }
28804 /* An error message is produced if the next token is not '>'.
28805 All further tokens are skipped until the desired token is
28806 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28808 static void
28810 {
28811 /* Current level of '< ... >'. */
28813 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28816 /* Are we ready, yet? If not, issue error message. */
28820 /* Skip tokens until the desired token is found. */
28822 {
28823 /* Peek at the next token. */
28825 {
28833 /* C++0x views the `>>' operator as two `>' tokens, but
28834 C++98 does not. */
28837 {
28838 /* We've hit a `>>' where the first `>' closes the
28839 template argument list, and the second `>' is
28840 spurious. Just consume the `>>' and stop; we've
28841 already produced at least one error. */
28844 }
28845 /* Fall through for C++0x, so we handle the second `>' in
28846 the `>>'. */
28851 {
28852 /* We've reached the token we want, consume it and stop. */
28855 }
28874 /* The '>' was probably forgotten, don't look further. */
28879 }
28881 /* Consume this token. */
28883 }
28884 }
28886 /* If the next token is the indicated keyword, consume it. Otherwise,
28887 issue an error message indicating that TOKEN_DESC was expected.
28889 Returns the token consumed, if the token had the appropriate type.
28890 Otherwise, returns NULL. */
28895 required_token token_desc)
28896 {
28900 {
28902 UNKNOWN_LOCATION);
28904 }
28907 }
28909 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28910 function-definition. */
28912 static bool
28914 {
28917 /* A ctor-initializer begins with a `:'. */
28919 /* A function-try-block begins with `try'. */
28921 /* A function-transaction-block begins with `__transaction_atomic'
28922 or `__transaction_relaxed'. */
28925 /* The named return value extension begins with `return'. */
28927 }
28929 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28930 definition. */
28932 static bool
28934 {
28941 }
28943 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28944 C++0x) ending a template-argument. */
28946 static bool
28948 {
28956 }
28958 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28959 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28961 static bool
28964 {
28970 /* Check for the sequence `<::' in the original code. It would be lexed as
28971 `[:', where `[' is a digraph, and there is no whitespace before
28972 `:'. */
28974 {
28979 }
28981 }
28983 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28984 or none_type otherwise. */
28986 static enum tag_types
28988 {
28990 {
29000 }
29001 }
29003 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
29004 or none_type otherwise or if the token is null. */
29006 static enum tag_types
29008 {
29013 {
29021 }
29022 }
29024 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
29026 static void
29028 {
29032 {
29036 type))
29039 }
29040 }
29042 /* Issue an error message if DECL is redeclared with different
29043 access than its original declaration [class.access.spec/3].
29044 This applies to nested classes, nested class templates and
29045 enumerations [class.mem/1]. */
29047 static void
29049 {
29060 }
29062 /* Look for the `template' keyword, as a syntactic disambiguator.
29063 Return TRUE iff it is present, in which case it will be
29064 consumed. */
29066 static bool
29068 {
29070 {
29071 /* In C++98 the `template' keyword can only be used within templates;
29072 outside templates the parser can always figure out what is a
29073 template and what is not. In C++11, per the resolution of DR 468,
29074 `template' is allowed in cases where it is not strictly necessary. */
29077 {
29080 "in C++98 %<template%> (as a disambiguator) is only "
29082 /* If this part of the token stream is rescanned, the same
29083 error message would be generated. So, we purge the token
29084 from the stream. */
29087 }
29088 else
29089 {
29090 /* Consume the `template' keyword. */
29093 }
29094 }
29096 }
29098 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
29099 set PARSER->SCOPE, and perform other related actions. */
29101 static void
29103 {
29106 /* Get the stored value. */
29108 /* Set the scope from the stored value. */
29112 }
29114 /* Consume tokens up through a non-nested END token. Returns TRUE if we
29115 encounter the end of a block before what we were looking for. */
29117 static bool
29121 {
29123 {
29126 /* Abort a parenthesized expression if we encounter a semicolon. */
29130 /* If we've reached the end of the file, stop. */
29136 /* We've hit the end of an enclosing block, so there's been some
29137 kind of syntax error. */
29140 /* Consume the token. */
29142 /* See if it starts a new group. */
29144 {
29146 /* In theory this should probably check end == '}', but
29147 cp_parser_save_member_function_body needs it to exit
29148 after either '}' or ')' when called with ')'. */
29151 }
29153 {
29157 }
29162 }
29163 }
29165 /* Like above, for caching a default argument or NSDMI. Both of these are
29166 terminated by a non-nested comma, but it can be unclear whether or not a
29167 comma is nested in a template argument list unless we do more parsing.
29168 In order to handle this ambiguity, when we encounter a ',' after a '<'
29169 we try to parse what follows as a parameter-declaration-list (in the
29170 case of a default argument) or a member-declarator (in the case of an
29171 NSDMI). If that succeeds, then we stop caching. */
29173 static tree
29175 {
29180 tree default_argument;
29182 /* Add tokens until we have processed the entire default
29183 argument. We add the range [first_token, token). */
29186 {
29187 /* For list-initialization, this is straightforward. */
29190 }
29192 {
29195 /* Peek at the next token. */
29197 /* What we do depends on what token we have. */
29199 {
29200 /* In valid code, a default argument must be
29201 immediately followed by a `,' `)', or `...'. */
29204 {
29205 /* If we've seen a '<', we might be in a
29206 template-argument-list. Until Core issue 325 is
29207 resolved, we don't know how this situation ought
29208 to be handled, so try to DTRT. We check whether
29209 what comes after the comma is a valid parameter
29210 declaration list. If it is, then the comma ends
29211 the default argument; otherwise the default
29212 argument continues. */
29216 /* Set ITALP so cp_parser_parameter_declaration_list
29217 doesn't decide to commit to this parse. */
29224 {
29225 /* Parse declarators until we reach a non-comma or
29226 somthing that cannot be an initializer.
29227 Just checking whether we're looking at a single
29228 declarator is insufficient. Consider:
29229 int var = tuple<T,U>::x;
29230 The template parameter 'U' looks exactly like a
29231 declarator. */
29232 do
29233 {
29244 }
29246 /* If we met an '=' or ';' then the original comma
29247 was the end of the NSDMI. Otherwise assume
29248 we're still in the NSDMI. */
29251 }
29252 else
29253 {
29260 }
29267 }
29268 /* FALLTHRU */
29271 /* If we run into a non-nested `;', `}', or `]',
29272 then the code is invalid -- but the default
29273 argument is certainly over. */
29278 /* Handle correctly int n = sizeof ... ( p ); */
29281 /* Update DEPTH, if necessary. */
29296 /* This might be the comparison operator, or it might
29297 start a template argument list. */
29304 /* Fall through for C++0x, which treats the `>>'
29305 operator like two `>' tokens in certain
29306 cases. */
29311 {
29312 /* This might be an operator, or it might close a
29313 template argument list. But if a previous '<'
29314 started a template argument list, this will have
29315 closed it, so we can't be in one anymore. */
29319 }
29322 /* If we run out of tokens, issue an error message. */
29330 /* In these cases, we should look for template-ids.
29331 For example, if the default argument is
29332 `X<int, double>()', we need to do name lookup to
29333 figure out whether or not `X' is a template; if
29334 so, the `,' does not end the default argument.
29336 That is not yet done. */
29341 }
29343 /* If we've reached the end, stop. */
29347 /* Add the token to the token block. */
29349 }
29351 /* Create a DEFAULT_ARG to represent the unparsed default
29352 argument. */
29359 }
29361 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29363 location_t
29365 {
29370 }
29372 /* Begin parsing tentatively. We always save tokens while parsing
29373 tentatively so that if the tentative parsing fails we can restore the
29374 tokens. */
29376 static void
29378 {
29379 /* Enter a new parsing context. */
29381 /* Begin saving tokens. */
29383 /* In order to avoid repetitive access control error messages,
29384 access checks are queued up until we are no longer parsing
29385 tentatively. */
29387 }
29389 /* Commit to the currently active tentative parse. */
29391 static void
29393 {
29397 /* Mark all of the levels as committed. */
29400 {
29407 }
29408 }
29410 /* Commit to the topmost currently active tentative parse.
29412 Note that this function shouldn't be called when there are
29413 irreversible side-effects while in a tentative state. For
29414 example, we shouldn't create a permanent entry in the symbol
29415 table, or issue an error message that might not apply if the
29416 tentative parse is aborted. */
29418 static void
29420 {
29425 {
29433 }
29434 }
29436 /* Abort the currently active tentative parse. All consumed tokens
29437 will be rolled back, and no diagnostics will be issued. */
29439 static void
29441 {
29445 /* Now, pretend that we want to see if the construct was
29446 successfully parsed. */
29448 }
29450 /* Stop parsing tentatively. If a parse error has occurred, restore the
29451 token stream. Otherwise, commit to the tokens we have consumed.
29452 Returns true if no error occurred; false otherwise. */
29454 static bool
29456 {
29460 /* Remember whether or not an error occurred, since we are about to
29461 destroy that information. */
29463 /* Remove the topmost context from the stack. */
29466 /* If no parse errors occurred, commit to the tentative parse. */
29468 {
29469 /* Commit to the tokens read tentatively, unless that was
29470 already done. */
29475 }
29476 /* Otherwise, if errors occurred, roll back our state so that things
29477 are just as they were before we began the tentative parse. */
29478 else
29479 {
29482 }
29483 /* Add the context to the front of the free list. */
29488 }
29490 /* Returns true if we are parsing tentatively and are not committed to
29491 this tentative parse. */
29493 static bool
29495 {
29498 }
29500 /* Returns nonzero iff an error has occurred during the most recent
29501 tentative parse. */
29503 static bool
29505 {
29508 }
29510 /* Returns nonzero if GNU extensions are allowed. */
29512 static bool
29514 {
29516 }
29517 \f
29518 /* Objective-C++ Productions */
29521 /* Parse an Objective-C expression, which feeds into a primary-expression
29522 above.
29524 objc-expression:
29525 objc-message-expression
29526 objc-string-literal
29527 objc-encode-expression
29528 objc-protocol-expression
29529 objc-selector-expression
29531 Returns a tree representation of the expression. */
29533 static cp_expr
29535 {
29536 /* Try to figure out what kind of declaration is present. */
29540 {
29550 {
29562 }
29563 /* FALLTHRU */
29569 }
29572 }
29574 /* Parse an Objective-C message expression.
29576 objc-message-expression:
29577 [ objc-message-receiver objc-message-args ]
29579 Returns a representation of an Objective-C message. */
29581 static tree
29583 {
29595 /* Construct a location e.g.
29596 [self func1:5]
29597 ^~~~~~~~~~~~~~
29598 ranging from the '[' to the ']', with the caret at the start. */
29603 }
29605 /* Parse an objc-message-receiver.
29607 objc-message-receiver:
29608 expression
29609 simple-type-specifier
29611 Returns a representation of the type or expression. */
29613 static tree
29615 {
29616 tree rcv;
29618 /* An Objective-C message receiver may be either (1) a type
29619 or (2) an expression. */
29623 /* If that worked out, fine. */
29630 CP_PARSER_FLAGS_NONE);
29637 }
29639 /* Parse the arguments and selectors comprising an Objective-C message.
29641 objc-message-args:
29642 objc-selector
29643 objc-selector-args
29644 objc-selector-args , objc-comma-args
29646 objc-selector-args:
29647 objc-selector [opt] : assignment-expression
29648 objc-selector-args objc-selector [opt] : assignment-expression
29650 objc-comma-args:
29651 assignment-expression
29652 objc-comma-args , assignment-expression
29654 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29655 selector arguments and TREE_VALUE containing a list of comma
29656 arguments. */
29658 static tree
29660 {
29666 {
29672 /* Detect if we have a unary selector. */
29681 sel_args
29686 }
29688 /* Handle non-selector arguments, if any. */
29690 {
29691 tree arg;
29696 addl_args
29701 }
29704 {
29707 }
29710 }
29712 /* Parse an Objective-C encode expression.
29714 objc-encode-expression:
29715 @encode objc-typename
29717 Returns an encoded representation of the type argument. */
29719 static cp_expr
29721 {
29722 tree type;
29727 matching_parens parens;
29734 {
29738 }
29740 /* This happens if we find @encode(T) (where T is a template
29741 typename or something dependent on a template typename) when
29742 parsing a template. In that case, we can't compile it
29743 immediately, but we rather create an AT_ENCODE_EXPR which will
29744 need to be instantiated when the template is used.
29745 */
29747 {
29751 }
29754 /* Build a location of the form:
29755 @encode(int)
29756 ^~~~~~~~~~~~
29757 with caret==start at the @ token, finishing at the close paren. */
29758 location_t combined_loc
29763 }
29765 /* Parse an Objective-C @defs expression. */
29767 static tree
29769 {
29770 tree name;
29773 matching_parens parens;
29779 }
29781 /* Parse an Objective-C protocol expression.
29783 objc-protocol-expression:
29784 @protocol ( identifier )
29786 Returns a representation of the protocol expression. */
29788 static tree
29790 {
29791 tree proto;
29795 matching_parens parens;
29800 /* Build a location of the form:
29801 @protocol(prot)
29802 ^~~~~~~~~~~~~~~
29803 with caret==start at the @ token, finishing at the close paren. */
29804 location_t combined_loc
29810 }
29812 /* Parse an Objective-C selector expression.
29814 objc-selector-expression:
29815 @selector ( objc-method-signature )
29817 objc-method-signature:
29818 objc-selector
29819 objc-selector-seq
29821 objc-selector-seq:
29822 objc-selector :
29823 objc-selector-seq objc-selector :
29825 Returns a representation of the method selector. */
29827 static tree
29829 {
29836 matching_parens parens;
29842 {
29851 {
29852 /* Detect if we have a unary selector. */
29854 {
29857 }
29858 else
29859 {
29861 }
29862 }
29867 {
29868 sel_seq
29871 sel_seq
29874 }
29875 else
29876 sel_seq
29881 }
29883 finish_selector:
29887 /* Build a location of the form:
29888 @selector(func)
29889 ^~~~~~~~~~~~~~~
29890 with caret==start at the @ token, finishing at the close paren. */
29891 location_t combined_loc
29895 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29898 }
29900 /* Parse a list of identifiers.
29902 objc-identifier-list:
29903 identifier
29904 objc-identifier-list , identifier
29906 Returns a TREE_LIST of identifier nodes. */
29908 static tree
29910 {
29911 tree identifier;
29912 tree list;
29923 {
29930 identifier));
29932 }
29935 }
29937 /* Parse an Objective-C alias declaration.
29939 objc-alias-declaration:
29940 @compatibility_alias identifier identifier ;
29942 This function registers the alias mapping with the Objective-C front end.
29943 It returns nothing. */
29945 static void
29947 {
29955 }
29957 /* Parse an Objective-C class forward-declaration.
29959 objc-class-declaration:
29960 @class objc-identifier-list ;
29962 The function registers the forward declarations with the Objective-C
29963 front end. It returns nothing. */
29965 static void
29967 {
29970 {
29971 tree id;
29981 else
29983 }
29985 }
29987 /* Parse a list of Objective-C protocol references.
29989 objc-protocol-refs-opt:
29990 objc-protocol-refs [opt]
29992 objc-protocol-refs:
29993 < objc-identifier-list >
29995 Returns a TREE_LIST of identifiers, if any. */
29997 static tree
29999 {
30003 {
30007 }
30010 }
30012 /* Parse a Objective-C visibility specification. */
30014 static void
30016 {
30020 {
30035 }
30037 /* Eat '@private'/'@protected'/'@public'. */
30039 }
30041 /* Parse an Objective-C method type. Return 'true' if it is a class
30042 (+) method, and 'false' if it is an instance (-) method. */
30046 {
30049 else
30051 }
30053 /* Parse an Objective-C protocol qualifier. */
30055 static tree
30057 {
30070 {
30075 }
30078 }
30080 /* Parse an Objective-C typename. */
30082 static tree
30084 {
30088 {
30091 matching_parens parens;
30095 /* An ObjC type name may consist of just protocol qualifiers, in which
30096 case the type shall default to 'id'. */
30098 {
30101 /* If the type could not be parsed, an error has already
30102 been produced. For error recovery, behave as if it had
30103 not been specified, which will use the default type
30104 'id'. */
30106 {
30108 /* We need to skip to the closing parenthesis as
30109 cp_parser_type_id() does not seem to do it for
30110 us. */
30115 }
30116 }
30120 }
30123 }
30125 /* Check to see if TYPE refers to an Objective-C selector name. */
30127 static bool
30129 {
30135 }
30137 /* Parse an Objective-C selector. */
30139 static tree
30141 {
30145 {
30148 }
30150 /* C++ operator names are allowed to appear in ObjC selectors. */
30152 {
30165 }
30166 }
30168 /* Parse an Objective-C params list. */
30170 static tree
30172 {
30178 {
30188 /* Detect if we have a unary selector. */
30191 {
30194 }
30198 {
30199 /* Something went quite wrong. There should be a colon
30200 here, but there is not. Stop parsing parameters. */
30202 }
30204 /* New ObjC allows attributes on parameters too. */
30209 params
30212 type_name,
30213 identifier,
30214 parm_attr));
30217 }
30220 {
30223 }
30225 /* We allow tail attributes for the method. */
30227 {
30235 }
30238 {
30241 }
30243 }
30245 /* Parse the non-keyword Objective-C params. */
30247 static tree
30250 {
30256 {
30258 tree parm;
30264 {
30269 }
30271 /* TODO: parse attributes for tail parameters. */
30280 }
30282 /* We allow tail attributes for the method. */
30284 {
30286 {
30291 }
30292 else
30293 /* We have an error, but parse the attributes, so that we can
30294 carry on. */
30300 }
30303 }
30305 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30307 static void
30309 {
30312 /* If the next token is `extern' and the following token is a string
30313 literal, then we have a linkage specification. */
30315 && cp_parser_is_pure_string_literal
30318 /* Handle #pragma, if any. */
30321 /* Allow stray semicolons. */
30324 /* Mark methods as optional or required, when building protocols. */
30326 {
30329 }
30331 {
30334 }
30337 /* Other stray characters must generate errors. */
30339 {
30343 }
30344 /* Finally, try to parse a block-declaration, or a function-definition. */
30345 else
30347 }
30349 /* Parse a method signature. */
30351 static tree
30353 {
30369 }
30371 static bool
30373 {
30374 tree tattr;
30379 /* If the attributes are followed by a method introducer, this is not allowed.
30380 Dump the attributes and flag the situation. */
30385 /* Otherwise, the attributes introduce some interstitial code, possibly so
30386 rewind to allow that check. */
30389 }
30391 /* Parse an Objective-C method prototype list. */
30393 static void
30395 {
30399 {
30401 {
30406 else
30410 {
30414 }
30417 }
30423 OPT_Wattributes,
30425 else
30426 /* Allow for interspersed non-ObjC++ code. */
30430 }
30434 else
30438 }
30440 /* Parse an Objective-C method definition list. */
30442 static void
30444 {
30448 {
30449 tree meth;
30452 {
30458 else
30463 {
30467 }
30469 NULL_TREE);
30471 /* For historical reasons, we accept an optional semicolon. */
30478 {
30485 }
30486 }
30487 /* The following case will be removed once @synthesize is
30488 completely implemented. */
30499 else
30500 /* Allow for interspersed non-ObjC++ code. */
30504 }
30508 else
30512 }
30514 /* Parse Objective-C ivars. */
30516 static void
30518 {
30529 {
30530 cp_decl_specifier_seq declspecs;
30532 tree prefix_attributes;
30540 CP_PARSER_FLAGS_OPTIONAL,
30544 /* auto, register, static, extern, mutable. */
30546 {
30549 }
30551 /* thread_local. */
30553 {
30556 }
30558 /* typedef. */
30560 {
30563 }
30568 /* Keep going until we hit the `;' at the end of the
30569 declaration. */
30571 {
30576 /* Check for a (possibly unnamed) bitfield declaration. */
30584 {
30585 /* Get the name of the bitfield. */
30588 sfk_none);
30590 eat_colon:
30592 /* Get the width of the bitfield. */
30593 width
30595 }
30596 else
30597 {
30598 /* Parse the declarator. */
30599 declarator
30605 }
30607 /* Look for attributes that apply to the ivar. */
30609 /* Remember which attributes are prefix attributes and
30610 which are not. */
30612 /* Combine the attributes. */
30616 /* Create the bitfield declaration. */
30619 else
30624 /* Add the instance variable. */
30628 /* Reset PREFIX_ATTRIBUTES. */
30630 {
30635 }
30640 {
30643 }
30645 }
30649 }
30654 /* Do not consume the RID_AT_END, so it will be read again as terminating
30655 the @interface of @implementation. */
30659 /* For historical reasons, we accept an optional semicolon. */
30662 }
30664 /* Parse an Objective-C protocol declaration. */
30666 static void
30668 {
30674 {
30679 }
30681 /* See if we have a forward declaration or a definition. */
30684 /* Try a forward declaration first. */
30686 {
30688 {
30689 tree id;
30699 else
30701 }
30703 }
30705 /* Ok, we got a full-fledged definition (or at least should). */
30706 else
30707 {
30712 }
30713 }
30715 /* Parse an Objective-C superclass or category. */
30717 static void
30722 {
30728 {
30731 }
30733 {
30734 matching_parens parens;
30737 /* If there is no category name, and this is an @interface, we
30738 have a class extension. */
30740 {
30743 }
30744 else
30748 }
30749 }
30751 /* Parse an Objective-C class interface. */
30753 static void
30755 {
30762 {
30763 /* It's hard to recover because even if valid @interface stuff
30764 is to follow, we can't compile it (or validate it) if we
30765 don't even know which class it refers to. Let's assume this
30766 was a stray '@interface' token in the stream and skip it.
30767 */
30769 }
30774 /* We have either a class or a category on our hands. */
30777 else
30778 {
30780 /* Handle instance variable declarations, if any. */
30783 }
30786 }
30788 /* Parse an Objective-C class implementation. */
30790 static void
30792 {
30799 {
30800 /* It's hard to recover because even if valid @implementation
30801 stuff is to follow, we can't compile it (or validate it) if
30802 we don't even know which class it refers to. Let's assume
30803 this was a stray '@implementation' token in the stream and
30804 skip it.
30805 */
30807 }
30811 /* We have either a class or a category on our hands. */
30814 else
30815 {
30817 /* Handle instance variable declarations, if any. */
30820 }
30823 }
30825 /* Consume the @end token and finish off the implementation. */
30827 static void
30829 {
30832 }
30834 /* Parse an Objective-C declaration. */
30836 static void
30838 {
30839 /* Try to figure out what kind of declaration is present. */
30844 {
30860 }
30863 {
30886 }
30887 }
30889 /* Parse an Objective-C try-catch-finally statement.
30891 objc-try-catch-finally-stmt:
30892 @try compound-statement objc-catch-clause-seq [opt]
30893 objc-finally-clause [opt]
30895 objc-catch-clause-seq:
30896 objc-catch-clause objc-catch-clause-seq [opt]
30898 objc-catch-clause:
30899 @catch ( objc-exception-declaration ) compound-statement
30901 objc-finally-clause:
30902 @finally compound-statement
30904 objc-exception-declaration:
30905 parameter-declaration
30906 '...'
30908 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30910 Returns NULL_TREE.
30912 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30913 for C. Keep them in sync. */
30915 static tree
30917 {
30918 location_t location;
30919 tree stmt;
30924 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30925 node, lest it get absorbed into the surrounding block. */
30931 {
30935 matching_parens parens;
30941 {
30942 /* We have "@catch (...)" (where the '...' are literally
30943 what is in the code). Skip the '...'.
30944 parameter_declaration is set to NULL_TREE, and
30945 objc_being_catch_clauses() knows that that means
30946 '...'. */
30949 }
30950 else
30951 {
30952 /* We have "@catch (NSException *exception)" or something
30953 like that. Parse the parameter declaration. */
30957 else
30962 }
30965 else
30966 {
30967 /* If there was no open parenthesis, we are recovering from
30968 an error, and we are trying to figure out what mistake
30969 the user has made. */
30971 /* If there is an immediate closing parenthesis, the user
30972 probably forgot the opening one (ie, they typed "@catch
30973 NSException *e)". Parse the closing parenthesis and keep
30974 going. */
30978 /* If these is no immediate closing parenthesis, the user
30979 probably doesn't know that parenthesis are required at
30980 all (ie, they typed "@catch NSException *e"). So, just
30981 forget about the closing parenthesis and keep going. */
30982 }
30986 }
30988 {
30991 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30992 node, lest it get absorbed into the surrounding block. */
30996 }
30999 }
31001 /* Parse an Objective-C synchronized statement.
31003 objc-synchronized-stmt:
31004 @synchronized ( expression ) compound-statement
31006 Returns NULL_TREE. */
31008 static tree
31010 {
31011 location_t location;
31018 matching_parens parens;
31023 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
31024 node, lest it get absorbed into the surrounding block. */
31029 }
31031 /* Parse an Objective-C throw statement.
31033 objc-throw-stmt:
31034 @throw assignment-expression [opt] ;
31036 Returns a constructed '@throw' statement. */
31038 static tree
31040 {
31052 }
31054 /* Parse an Objective-C statement. */
31056 static tree
31058 {
31059 /* Try to figure out what kind of declaration is present. */
31063 {
31074 }
31077 }
31079 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
31080 look ahead to see if an objc keyword follows the attributes. This
31081 is to detect the use of prefix attributes on ObjC @interface and
31082 @protocol. */
31084 static bool
31086 {
31091 {
31094 }
31097 }
31099 /* This routine is a minimal replacement for
31100 c_parser_struct_declaration () used when parsing the list of
31101 types/names or ObjC++ properties. For example, when parsing the
31102 code
31104 @property (readonly) int a, b, c;
31106 this function is responsible for parsing "int a, int b, int c" and
31107 returning the declarations as CHAIN of DECLs.
31109 TODO: Share this code with cp_parser_objc_class_ivars. It's very
31110 similar parsing. */
31111 static tree
31113 {
31115 cp_decl_specifier_seq declspecs;
31117 tree prefix_attributes;
31120 CP_PARSER_FLAGS_NONE,
31127 /* auto, register, static, extern, mutable. */
31129 {
31132 }
31134 /* thread_local. */
31136 {
31139 }
31141 /* typedef. */
31143 {
31146 }
31151 /* Keep going until we hit the `;' at the end of the declaration. */
31153 {
31158 /* Parse the declarator. */
31162 /* Look for attributes that apply to the ivar. */
31164 /* Remember which attributes are prefix attributes and
31165 which are not. */
31167 /* Combine the attributes. */
31177 /* Reset PREFIX_ATTRIBUTES. */
31179 {
31184 }
31191 {
31194 }
31195 else
31197 }
31199 }
31201 /* Parse an Objective-C @property declaration. The syntax is:
31203 objc-property-declaration:
31204 '@property' objc-property-attributes[opt] struct-declaration ;
31206 objc-property-attributes:
31207 '(' objc-property-attribute-list ')'
31209 objc-property-attribute-list:
31210 objc-property-attribute
31211 objc-property-attribute-list, objc-property-attribute
31213 objc-property-attribute
31214 'getter' = identifier
31215 'setter' = identifier
31216 'readonly'
31217 'readwrite'
31218 'assign'
31219 'retain'
31220 'copy'
31221 'nonatomic'
31223 For example:
31224 @property NSString *name;
31225 @property (readonly) id object;
31226 @property (retain, nonatomic, getter=getTheName) id name;
31227 @property int a, b, c;
31229 PS: This function is identical to
31230 c_parser_objc_at_property_declaration for C. Keep them in sync. */
31231 static void
31233 {
31234 /* The following variables hold the attributes of the properties as
31235 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
31236 seen. When we see an attribute, we set them to 'true' (if they
31237 are boolean properties) or to the identifier (if they have an
31238 argument, ie, for getter and setter). Note that here we only
31239 parse the list of attributes, check the syntax and accumulate the
31240 attributes that we find. objc_add_property_declaration() will
31241 then process the information. */
31251 /* 'properties' is the list of properties that we read. Usually a
31252 single one, but maybe more (eg, in "@property int a, b, c;" there
31253 are three). */
31254 tree properties;
31255 location_t loc;
31261 /* Parse the optional attribute list... */
31263 {
31264 /* Eat the '('. */
31265 matching_parens parens;
31269 {
31275 {
31278 }
31282 {
31293 {
31297 else
31302 }
31305 {
31309 }
31311 {
31313 {
31316 }
31317 else
31321 else
31323 }
31324 else
31325 {
31327 {
31330 }
31331 else
31333 }
31339 }
31346 else
31348 }
31350 /* FIXME: "@property (setter, assign);" will generate a spurious
31351 "error: expected ‘)’ before ‘,’ token". This is because
31352 cp_parser_require, unlike the C counterpart, will produce an
31353 error even if we are in error recovery. */
31355 {
31360 }
31361 }
31363 /* ... and the property declaration(s). */
31367 {
31369 /* If the next token is now a `;', consume it. */
31373 }
31377 else
31378 {
31379 /* Comma-separated properties are chained together in
31380 reverse order; add them one by one. */
31389 }
31392 }
31394 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31396 objc-synthesize-declaration:
31397 @synthesize objc-synthesize-identifier-list ;
31399 objc-synthesize-identifier-list:
31400 objc-synthesize-identifier
31401 objc-synthesize-identifier-list, objc-synthesize-identifier
31403 objc-synthesize-identifier
31404 identifier
31405 identifier = identifier
31407 For example:
31408 @synthesize MyProperty;
31409 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31411 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31412 for C. Keep them in sync.
31413 */
31414 static void
31416 {
31418 location_t loc;
31423 {
31427 {
31430 }
31432 {
31436 {
31439 }
31440 }
31441 else
31446 else
31448 }
31451 }
31453 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31455 objc-dynamic-declaration:
31456 @dynamic identifier-list ;
31458 For example:
31459 @dynamic MyProperty;
31460 @dynamic MyProperty, AnotherProperty;
31462 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31463 for C. Keep them in sync.
31464 */
31465 static void
31467 {
31469 location_t loc;
31474 {
31475 tree property;
31478 {
31481 }
31485 else
31487 }
31490 }
31492 \f
31493 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 / 4.5 / 5.0 parsing routines. */
31495 /* Returns name of the next clause.
31496 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31497 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31498 returned and the token is consumed. */
31500 static pragma_omp_clause
31502 {
31518 {
31523 {
31710 }
31711 }
31717 }
31719 /* Validate that a clause of the given type does not already exist. */
31721 static void
31724 {
31725 tree c;
31729 {
31732 }
31733 }
31735 /* OpenMP 2.5:
31736 variable-list:
31737 identifier
31738 variable-list , identifier
31740 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31741 colon). An opening parenthesis will have been consumed by the caller.
31743 If KIND is nonzero, create the appropriate node and install the decl
31744 in OMP_CLAUSE_DECL and add the node to the head of the list.
31746 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31747 return the list created.
31749 COLON can be NULL if only closing parenthesis should end the list,
31750 or pointer to bool which will receive false if the list is terminated
31751 by closing parenthesis or true if the list is terminated by colon. */
31753 static tree
31756 {
31760 {
31763 }
31765 {
31772 && current_class_ptr
31774 {
31780 }
31781 else
31782 {
31789 {
31794 }
31798 else
31801 {
31807 }
31808 }
31810 ;
31812 {
31814 {
31816 /* The OpenACC cache directive explicitly only allows "array
31817 elements or subarrays". */
31819 {
31823 }
31824 /* FALLTHROUGH. */
31829 {
31830 location_t loc
31835 decl
31839 }
31840 /* FALLTHROUGH. */
31846 {
31854 parser->colon_corrects_to_scope_p
31858 else
31859 {
31860 /* Look for `:'. */
31862 {
31867 }
31871 CPP_CLOSE_SQUARE))
31873 }
31874 /* Look for the closing `]'. */
31876 RT_CLOSE_SQUARE))
31877 {
31882 }
31885 }
31889 }
31892 {
31896 {
31897 depend_lvalue:
31901 }
31902 else
31904 }
31910 }
31911 else
31914 get_comma:
31918 }
31924 {
31928 }
31931 {
31934 /* Try to resync to an unnested comma. Copied from
31935 cp_parser_parenthesized_expression_list. */
31936 skip_comma:
31945 }
31948 }
31950 /* Similarly, but expect leading and trailing parenthesis. This is a very
31951 common case for omp clauses. */
31953 static tree
31955 {
31959 }
31961 /* OpenACC 2.0:
31962 copy ( variable-list )
31963 copyin ( variable-list )
31964 copyout ( variable-list )
31965 create ( variable-list )
31966 delete ( variable-list )
31967 present ( variable-list ) */
31969 static tree
31971 tree list)
31972 {
31975 {
32008 }
32016 }
32018 /* OpenACC 2.0:
32019 deviceptr ( variable-list ) */
32021 static tree
32023 {
32027 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
32028 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
32029 variable-list must only allow for pointer variables. */
32032 {
32039 }
32042 }
32044 /* OpenACC 2.5:
32045 auto
32046 finalize
32047 independent
32048 nohost
32049 seq */
32051 static tree
32055 {
32060 }
32062 /* OpenACC:
32063 num_gangs ( expression )
32064 num_workers ( expression )
32065 vector_length ( expression ) */
32067 static tree
32070 {
32073 matching_parens parens;
32081 {
32086 }
32094 }
32096 /* OpenACC:
32098 gang [( gang-arg-list )]
32099 worker [( [num:] int-expr )]
32100 vector [( [length:] int-expr )]
32102 where gang-arg is one of:
32104 [num:] int-expr
32105 static: size-expr
32107 and size-expr may be:
32109 *
32110 int-expr
32111 */
32113 static tree
32116 {
32126 {
32127 matching_parens parens;
32130 do
32131 {
32135 /* Gang static argument. */
32138 {
32146 {
32149 }
32151 /* Check for the '*' argument. */
32155 CPP_CLOSE_PAREN)))
32156 {
32161 {
32164 }
32166 }
32167 }
32168 /* Worker num: argument and vector length: arguments. */
32172 {
32175 }
32177 /* Now collect the actual argument. */
32179 {
32182 }
32194 {
32197 }
32199 }
32204 }
32218 cleanup_error:
32221 }
32223 /* OpenACC 2.0:
32224 tile ( size-expr-list ) */
32226 static tree
32228 {
32232 /* Collapse and tile are mutually exclusive. (The spec doesn't say
32233 so, but the spec authors never considered such a case and have
32234 differing opinions on what it might mean, including 'not
32235 allowed'.) */
32238 clause_loc);
32243 do
32244 {
32251 {
32254 }
32255 else
32259 }
32262 /* Consume the trailing ')'. */
32270 }
32272 /* OpenACC 2.0
32273 Parse wait clause or directive parameters. */
32275 static tree
32277 {
32287 {
32292 }
32299 {
32303 {
32306 else
32307 {
32314 }
32315 }
32316 }
32319 }
32321 /* OpenACC:
32322 wait ( int-expr-list ) */
32324 static tree
32326 {
32335 }
32337 /* OpenMP 3.0:
32338 collapse ( constant-expression ) */
32340 static tree
32342 {
32344 location_t loc;
32345 HOST_WIDE_INT n;
32348 matching_parens parens;
32366 {
32369 }
32378 }
32380 /* OpenMP 2.5:
32381 default ( none | shared )
32383 OpenACC:
32384 default ( none | present ) */
32386 static tree
32389 {
32391 tree c;
32393 matching_parens parens;
32397 {
32402 {
32423 }
32426 }
32427 else
32428 {
32429 invalid_kind:
32432 else
32434 }
32451 }
32453 /* OpenMP 3.1:
32454 final ( expression ) */
32456 static tree
32458 {
32461 matching_parens parens;
32480 }
32482 /* OpenMP 2.5:
32483 if ( expression )
32485 OpenMP 4.5:
32486 if ( directive-name-modifier : expression )
32488 directive-name-modifier:
32489 parallel | task | taskloop | target data | target | target update
32490 | target enter data | target exit data
32492 OpenMP 5.0:
32493 directive-name-modifier:
32494 ... | simd | cancel */
32496 static tree
32499 {
32503 matching_parens parens;
32508 {
32524 {
32527 {
32540 else
32541 {
32542 location_t loc
32547 }
32550 {
32552 {
32557 }
32559 {
32560 location_t loc
32564 }
32565 }
32566 }
32567 }
32569 {
32571 {
32574 }
32575 else
32576 {
32578 {
32579 location_t loc
32582 }
32584 }
32585 }
32586 }
32598 {
32601 {
32604 {
32616 }
32618 p);
32620 }
32622 {
32625 else
32628 }
32631 {
32635 }
32636 }
32644 }
32646 /* OpenMP 3.1:
32647 mergeable */
32649 static tree
32652 {
32653 tree c;
32656 location);
32661 }
32663 /* OpenMP 2.5:
32664 nowait */
32666 static tree
32669 {
32670 tree c;
32677 }
32679 /* OpenMP 2.5:
32680 num_threads ( expression ) */
32682 static tree
32684 location_t location)
32685 {
32688 matching_parens parens;
32708 }
32710 /* OpenMP 4.5:
32711 num_tasks ( expression ) */
32713 static tree
32715 location_t location)
32716 {
32719 matching_parens parens;
32739 }
32741 /* OpenMP 4.5:
32742 grainsize ( expression ) */
32744 static tree
32746 location_t location)
32747 {
32750 matching_parens parens;
32770 }
32772 /* OpenMP 4.5:
32773 priority ( expression ) */
32775 static tree
32777 location_t location)
32778 {
32781 matching_parens parens;
32801 }
32803 /* OpenMP 4.5:
32804 hint ( expression ) */
32806 static tree
32808 {
32811 matching_parens parens;
32830 }
32832 /* OpenMP 4.5:
32833 defaultmap ( tofrom : scalar )
32835 OpenMP 5.0:
32836 defaultmap ( implicit-behavior [ : variable-category ] ) */
32838 static tree
32840 location_t location)
32841 {
32845 enum omp_clause_defaultmap_kind category
32848 matching_parens parens;
32855 {
32856 invalid_behavior:
32858 "%<tofrom%>, %<firstprivate%>, %<none%> "
32861 }
32862 else
32863 {
32866 }
32869 {
32873 else
32880 else
32889 else
32896 else
32905 else
32911 }
32915 {
32920 {
32921 invalid_category:
32925 }
32930 {
32934 else
32941 else
32948 else
32954 }
32957 }
32967 {
32974 {
32989 }
32992 p);
32993 else
32997 }
33004 out_err:
33009 }
33011 /* OpenMP 2.5:
33012 ordered
33014 OpenMP 4.5:
33015 ordered ( constant-expression ) */
33017 static tree
33020 {
33022 HOST_WIDE_INT n;
33028 {
33029 matching_parens parens;
33046 {
33048 "ordered argument needs positive constant integer "
33051 }
33052 }
33058 }
33060 /* OpenMP 2.5:
33061 reduction ( reduction-operator : variable-list )
33063 reduction-operator:
33064 One of: + * - & ^ | && ||
33066 OpenMP 3.1:
33068 reduction-operator:
33069 One of: + * - & ^ | && || min max
33071 OpenMP 4.0:
33073 reduction-operator:
33074 One of: + * - & ^ | && ||
33075 id-expression
33077 OpenMP 5.0:
33078 reduction ( reduction-modifier, reduction-operator : variable-list )
33079 in_reduction ( reduction-operator : variable-list )
33080 task_reduction ( reduction-operator : variable-list ) */
33082 static tree
33085 {
33095 {
33098 {
33101 }
33104 {
33110 {
33114 }
33116 {
33119 }
33120 }
33121 }
33124 {
33134 }
33138 else
33139 {
33150 {
33180 }
33181 else
33182 {
33184 resync_fail:
33189 }
33190 }
33196 NULL);
33198 {
33205 }
33208 }
33210 /* OpenMP 2.5:
33211 schedule ( schedule-kind )
33212 schedule ( schedule-kind , expression )
33214 schedule-kind:
33215 static | dynamic | guided | runtime | auto
33217 OpenMP 4.5:
33218 schedule ( schedule-modifier : schedule-kind )
33219 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
33221 schedule-modifier:
33222 simd
33223 monotonic
33224 nonmonotonic */
33226 static tree
33228 {
33232 matching_parens parens;
33239 {
33248 else
33254 else
33255 {
33258 }
33259 }
33262 {
33267 {
33288 }
33289 }
33294 else
33300 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
33302 {
33306 }
33309 {
33324 else
33329 }
33341 invalid_kind:
33343 resync_fail:
33348 }
33350 /* OpenMP 3.0:
33351 untied */
33353 static tree
33356 {
33357 tree c;
33364 }
33366 /* OpenMP 4.0:
33367 inbranch
33368 notinbranch */
33370 static tree
33373 {
33378 }
33380 /* OpenMP 4.0:
33381 parallel
33382 for
33383 sections
33384 taskgroup */
33386 static tree
33390 {
33394 }
33396 /* OpenMP 4.5:
33397 nogroup */
33399 static tree
33402 {
33407 }
33409 /* OpenMP 4.5:
33410 simd
33411 threads */
33413 static tree
33417 {
33422 }
33424 /* OpenMP 4.0:
33425 num_teams ( expression ) */
33427 static tree
33429 location_t location)
33430 {
33433 matching_parens parens;
33453 }
33455 /* OpenMP 4.0:
33456 thread_limit ( expression ) */
33458 static tree
33460 location_t location)
33461 {
33464 matching_parens parens;
33484 }
33486 /* OpenMP 4.0:
33487 aligned ( variable-list )
33488 aligned ( variable-list : constant-expression ) */
33490 static tree
33492 {
33496 matching_parens parens;
33504 {
33514 }
33520 }
33522 /* OpenMP 2.5:
33523 lastprivate ( variable-list )
33525 OpenMP 5.0:
33526 lastprivate ( [ lastprivate-modifier : ] variable-list ) */
33528 static tree
33530 {
33538 {
33543 {
33547 }
33548 }
33557 }
33559 /* OpenMP 4.0:
33560 linear ( variable-list )
33561 linear ( variable-list : expression )
33563 OpenMP 4.5:
33564 linear ( modifier ( variable-list ) )
33565 linear ( modifier ( variable-list ) : expression ) */
33567 static tree
33570 {
33575 matching_parens parens;
33580 {
33592 else
33594 }
33599 else
33600 {
33609 }
33612 {
33617 {
33628 {
33631 }
33634 }
33645 }
33648 {
33651 }
33654 }
33656 /* OpenMP 4.0:
33657 safelen ( constant-expression ) */
33659 static tree
33661 location_t location)
33662 {
33665 matching_parens parens;
33684 }
33686 /* OpenMP 4.0:
33687 simdlen ( constant-expression ) */
33689 static tree
33691 location_t location)
33692 {
33695 matching_parens parens;
33714 }
33716 /* OpenMP 4.5:
33717 vec:
33718 identifier [+/- integer]
33719 vec , identifier [+/- integer]
33720 */
33722 static tree
33724 tree list)
33725 {
33729 {
33732 }
33735 {
33742 else
33743 {
33744 t = cp_parser_lookup_name_simple
33749 id_loc);
33750 }
33756 {
33759 }
33763 {
33766 }
33770 {
33773 }
33776 add_to_vector:
33778 {
33782 }
33788 }
33791 {
33797 }
33799 }
33801 /* OpenMP 5.0:
33802 iterators ( iterators-definition )
33804 iterators-definition:
33805 iterator-specifier
33806 iterator-specifier , iterators-definition
33808 iterator-specifier:
33809 identifier = range-specification
33810 iterator-type identifier = range-specification
33812 range-specification:
33813 begin : end
33814 begin : end : step */
33816 static tree
33818 {
33822 matching_parens parens;
33826 bool saved_colon_corrects_to_scope_p
33828 bool saved_colon_doesnt_start_class_def_p
33831 do
33832 {
33833 tree iter_type;
33837 else
33838 {
33841 parser->type_definition_forbidden_message
33847 }
33851 {
33854 }
33874 {
33877 }
33892 {
33895 }
33897 }
33901 parser->colon_doesnt_start_class_def_p
33911 }
33913 /* OpenMP 4.0:
33914 depend ( depend-kind : variable-list )
33916 depend-kind:
33917 in | out | inout
33919 OpenMP 4.5:
33920 depend ( source )
33922 depend ( sink : vec )
33924 OpenMP 5.0:
33925 depend ( depend-modifier , depend-kind: variable-list )
33927 depend-kind:
33928 in | out | inout | mutexinoutset | depobj
33930 depend-modifier:
33931 iterator ( iterators-definition ) */
33933 static tree
33935 {
33939 matching_parens parens;
33943 do
33944 {
33952 {
33957 }
33972 else
33975 }
33982 {
33987 }
33990 {
34000 }
34007 else
34008 {
34013 {
34017 else
34019 }
34022 {
34027 }
34028 }
34031 invalid_kind:
34033 resync_fail:
34040 }
34042 /* OpenMP 4.0:
34043 map ( map-kind : variable-list )
34044 map ( variable-list )
34046 map-kind:
34047 alloc | to | from | tofrom
34049 OpenMP 4.5:
34050 map-kind:
34051 alloc | to | from | tofrom | release | delete
34053 map ( always [,] map-kind: variable-list ) */
34055 static tree
34057 {
34066 {
34071 {
34074 nth++;
34080 {
34085 }
34086 }
34087 }
34091 {
34105 else
34106 {
34112 }
34115 }
34118 {
34122 }
34125 NULL);
34131 }
34133 /* OpenMP 4.0:
34134 device ( expression ) */
34136 static tree
34138 location_t location)
34139 {
34142 matching_parens parens;
34162 }
34164 /* OpenMP 4.0:
34165 dist_schedule ( static )
34166 dist_schedule ( static , expression ) */
34168 static tree
34170 location_t location)
34171 {
34174 matching_parens parens;
34185 {
34196 }
34201 location);
34205 invalid_kind:
34207 resync_fail:
34212 }
34214 /* OpenMP 4.0:
34215 proc_bind ( proc-bind-kind )
34217 proc-bind-kind:
34218 master | close | spread */
34220 static tree
34222 location_t location)
34223 {
34224 tree c;
34231 {
34241 else
34243 }
34244 else
34253 location);
34258 invalid_kind:
34260 resync_fail:
34265 }
34267 /* OpenACC:
34268 async [( int-expr )] */
34270 static tree
34272 {
34279 {
34280 matching_parens parens;
34289 }
34299 }
34301 /* Parse all OpenACC clauses. The set clauses allowed by the directive
34302 is a bitmask in MASK. Return the list of clauses found. */
34304 static tree
34308 {
34313 {
34314 location_t here;
34315 pragma_omp_clause c_kind;
34316 omp_clause_code code;
34327 {
34384 clauses);
34402 OMP_CLAUSE_IF_PRESENT,
34408 OMP_CLAUSE_INDEPENDENT,
34420 clauses);
34426 clauses);
34434 clauses);
34438 clauses
34454 clauses);
34466 clauses);
34480 }
34485 {
34486 /* Remove the invalid clause(s) from the list to avoid
34487 confusing the rest of the compiler. */
34490 }
34491 }
34493 saw_error:
34500 }
34502 /* Parse all OpenMP clauses. The set clauses allowed by the directive
34503 is a bitmask in MASK. Return the list of clauses found; the result
34504 of clause default goes in *pdefault. */
34506 static tree
34510 {
34516 {
34517 pragma_omp_clause c_kind;
34528 {
34540 clauses);
34554 clauses);
34574 clauses);
34579 clauses);
34588 clauses
34628 clauses);
34632 clauses
34644 clauses);
34648 clauses
34650 OMP_CLAUSE_TASK_REDUCTION,
34666 clauses);
34671 OMP_CLAUSE_NOTINBRANCH,
34680 {
34681 clause_not_first:
34685 }
34715 clauses);
34716 else
34726 clauses);
34744 {
34749 }
34792 clauses
34798 clauses
34806 }
34811 {
34812 /* Remove the invalid clause(s) from the list to avoid
34813 confusing the rest of the compiler. */
34816 }
34817 }
34818 saw_error:
34821 {
34824 else
34826 }
34828 }
34830 /* OpenMP 2.5:
34831 structured-block:
34832 statement
34834 In practice, we're also interested in adding the statement to an
34835 outer node. So it is convenient if we work around the fact that
34836 cp_parser_statement calls add_stmt. */
34838 static unsigned
34840 {
34843 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34844 This preserves the "not within loop or switch" style error messages
34845 for nonsense cases like
34846 void foo() {
34847 #pragma omp single
34848 break;
34849 }
34850 */
34855 }
34857 static void
34859 {
34861 }
34863 static tree
34865 {
34873 }
34875 /* OpenMP 2.5:
34876 # pragma omp atomic new-line
34877 expression-stmt
34879 expression-stmt:
34880 x binop= expr | x++ | ++x | x-- | --x
34881 binop:
34882 +, *, -, /, &, ^, |, <<, >>
34884 where x is an lvalue expression with scalar type.
34886 OpenMP 3.1:
34887 # pragma omp atomic new-line
34888 update-stmt
34890 # pragma omp atomic read new-line
34891 read-stmt
34893 # pragma omp atomic write new-line
34894 write-stmt
34896 # pragma omp atomic update new-line
34897 update-stmt
34899 # pragma omp atomic capture new-line
34900 capture-stmt
34902 # pragma omp atomic capture new-line
34903 capture-block
34905 read-stmt:
34906 v = x
34907 write-stmt:
34908 x = expr
34909 update-stmt:
34910 expression-stmt | x = x binop expr
34911 capture-stmt:
34912 v = expression-stmt
34913 capture-block:
34914 { v = x; update-stmt; } | { update-stmt; v = x; }
34916 OpenMP 4.0:
34917 update-stmt:
34918 expression-stmt | x = x binop expr | x = expr binop x
34919 capture-stmt:
34920 v = update-stmt
34921 capture-block:
34922 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34924 where x and v are lvalue expressions with scalar type. */
34926 static void
34928 {
34939 {
34946 {
34951 enum omp_memory_order new_memory_order
34973 {
34977 }
34978 else
34979 {
34982 "%<capture%>, %<seq_cst%>, %<acq_rel%>, "
34984 }
34986 {
34988 {
34991 else
34993 }
34995 {
34998 else
35000 }
35003 }
35004 }
35006 }
35012 {
35013 omp_requires_mask
35018 {
35028 {
35039 }
35043 }
35044 }
35045 else
35047 {
35051 {
35055 }
35060 {
35064 }
35069 {
35073 }
35077 }
35080 {
35090 else
35095 {
35096 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
35097 opcode. */
35102 }
35106 {
35109 }
35110 else
35111 {
35117 }
35120 }
35122 restart:
35126 {
35133 /* FALLTHROUGH */
35143 /* FALLTHROUGH */
35158 /* Undo effects of boolean_increment for post {in,de}crement. */
35160 /* FALLTHRU */
35164 {
35165 /* Undo effects of boolean_increment. */
35167 {
35168 /* This is pre or post increment. */
35173 && !structured_block
35177 }
35178 }
35179 /* FALLTHRU */
35182 {
35217 {
35221 }
35224 {
35230 {
35235 }
35237 {
35249 {
35251 {
35256 }
35257 else
35259 }
35263 }
35266 {
35273 }
35277 }
35281 {
35284 {
35292 }
35294 {
35299 }
35334 }
35345 /* FALLTHROUGH */
35350 }
35357 }
35358 stmt_done:
35360 {
35371 }
35373 {
35376 }
35377 done:
35385 saw_error:
35388 {
35392 {
35396 }
35397 }
35398 }
35401 /* OpenMP 2.5:
35402 # pragma omp barrier new-line */
35404 static void
35406 {
35409 }
35411 /* OpenMP 2.5:
35412 # pragma omp critical [(name)] new-line
35413 structured-block
35415 OpenMP 4.5:
35416 # pragma omp critical [(name) [hint(expression)]] new-line
35417 structured-block */
35419 #define OMP_CRITICAL_CLAUSE_MASK \
35420 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
35422 static tree
35424 {
35428 {
35429 matching_parens parens;
35447 OMP_CRITICAL_CLAUSE_MASK,
35449 }
35450 else
35455 }
35457 /* OpenMP 5.0:
35458 # pragma omp depobj ( depobj ) depobj-clause new-line
35460 depobj-clause:
35461 depend (dependence-type : locator)
35462 destroy
35463 update (dependence-type)
35465 dependence-type:
35466 in
35467 out
35468 inout
35469 mutexinout */
35471 static void
35473 {
35475 matching_parens parens;
35477 {
35480 }
35493 {
35499 {
35505 }
35509 {
35510 matching_parens c_parens;
35512 {
35513 location_t c2_loc
35516 {
35529 }
35531 {
35535 }
35541 }
35542 else
35544 }
35545 }
35547 {
35550 }
35554 }
35557 /* OpenMP 2.5:
35558 # pragma omp flush flush-vars[opt] new-line
35560 flush-vars:
35561 ( variable-list )
35563 OpenMP 5.0:
35564 # pragma omp flush memory-order-clause new-line */
35566 static void
35568 {
35571 {
35580 else
35584 }
35586 {
35589 "%<flush%> list specified together with memory order "
35592 }
35596 }
35598 /* Helper function, to parse omp for increment expression. */
35600 static tree
35602 {
35607 {
35610 }
35613 {
35625 }
35627 /* If decl is an iterator, preserve LHS and RHS of the relational
35628 expr until finish_omp_for. */
35639 }
35641 /* Helper function, to parse omp for increment expression. */
35643 static tree
35645 {
35649 cp_id_kind idk;
35653 {
35662 }
35671 {
35676 }
35683 {
35687 }
35700 do
35701 {
35708 {
35710 {
35713 else
35715 tf_warning_or_error);
35716 }
35717 else
35720 }
35721 }
35725 {
35731 }
35732 else
35736 }
35738 /* Parse the initialization statement of an OpenMP for loop.
35740 Return true if the resulting construct should have an
35741 OMP_CLAUSE_PRIVATE added to it. */
35743 static tree
35751 {
35757 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
35759 init-expr:
35760 var = lb
35761 integer-type var = lb
35762 random-access-iterator-type var = lb
35763 pointer-type var = lb
35764 */
35765 cp_decl_specifier_seq type_specifiers;
35767 /* First, try to parse as an initialized declaration. See
35768 cp_parser_condition, from whence the bulk of this is copied. */
35775 {
35776 /* If parsing a type specifier seq succeeded, then this
35777 MUST be a initialized declaration. */
35782 CP_PARSER_DECLARATOR_NAMED,
35793 else
35794 {
35804 {
35806 CPP_OPEN_PAREN))
35809 else
35810 /* Trigger an error. */
35815 }
35819 {
35827 {
35830 auto_node);
35835 }
35838 asm_specification,
35839 LOOKUP_ONLYCONVERTING);
35842 {
35845 }
35846 else
35847 {
35850 {
35852 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
35854 {
35858 {
35862 }
35864 }
35866 {
35871 }
35872 }
35873 }
35875 }
35876 else
35877 {
35878 /* Consume '='. */
35882 non_class:
35885 else
35888 asm_specification,
35889 LOOKUP_ONLYCONVERTING);
35890 }
35894 }
35895 }
35896 else
35897 {
35898 cp_id_kind idk;
35899 /* If parsing a type specifier sequence failed, then
35900 this MUST be a simple expression. */
35906 && decl
35909 {
35920 {
35925 }
35930 }
35932 && decl
35935 {
35936 tree rhs;
35944 rhs,
35945 tf_warning_or_error));
35948 }
35949 else
35950 {
35955 {
35959 }
35960 }
35961 }
35963 }
35965 /* Helper for cp_parser_omp_for_loop, handle one range-for loop. */
35967 void
35971 {
35976 {
35980 /* do_auto_deduction doesn't mess with template init-lists. */
35982 {
35985 {
35991 }
35993 }
36000 }
36005 /* If an error happened previously do nothing or else a lot of
36006 unhelpful errors would be issued. */
36008 else
36009 {
36010 tree range_temp;
36014 /* Can't bind a reference to an array of runtime bound. */
36016 else
36017 {
36023 LOOKUP_ONLYCONVERTING);
36026 }
36029 }
36040 LOOKUP_ONLYCONVERTING);
36042 /* The new for initialization statement. */
36050 else
36051 {
36054 }
36057 LOOKUP_ONLYCONVERTING);
36059 /* The new for condition. */
36062 else
36068 /* The new increment expression. */
36071 else
36074 tf_warning_or_error);
36079 {
36082 }
36087 {
36092 {
36097 }
36098 }
36102 {
36104 tf_none);
36108 }
36115 {
36118 }
36120 }
36122 /* Helper for cp_parser_omp_for_loop, finalize part of range for
36123 inside of the collapsed body. */
36125 void
36127 {
36135 {
36139 }
36141 /* The declaration is initialized with *__begin inside the loop body. */
36144 tf_warning_or_error),
36146 LOOKUP_ONLYCONVERTING);
36149 }
36151 /* Parse the restricted form of the for statement allowed by OpenMP. */
36153 static tree
36156 {
36158 tree orig_decl;
36161 location_t loc_first;
36172 {
36175 }
36178 {
36181 }
36184 {
36190 }
36192 {
36195 {
36197 "%<linear%> clause may not be specified together "
36200 }
36201 else
36203 }
36217 {
36220 location_t loc;
36223 {
36227 }
36230 matching_parens parens;
36238 {
36239 /* Save tokens so that we can put them back. */
36242 /* Look for ':' that is not nested in () or {}. */
36243 bool is_range_for
36246 CPP_COLON,
36247 /*consume_paren=*/
36250 /* Roll back the tokens we skipped. */
36254 {
36255 bool saved_colon_corrects_to_scope_p
36258 /* A colon is used in range-based for. */
36261 /* Parse the declaration. */
36263 /*function_definition_allowed_p=*/
36265 parser->colon_corrects_to_scope_p
36277 {
36279 {
36285 }
36286 else
36288 }
36292 "%<ordered%> clause with parameter on "
36296 }
36297 }
36299 add_private_clause
36305 {
36308 {
36314 }
36315 else
36317 }
36324 {
36329 {
36333 }
36336 {
36337 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
36341 {
36344 }
36345 else
36346 {
36349 }
36351 }
36352 else
36353 {
36358 }
36359 }
36362 {
36363 tree c;
36365 {
36374 decl);
36379 decl);
36380 }
36382 {
36387 else
36392 {
36395 /* For linear, signal that we need to fill up
36396 the so far unknown linear step. */
36399 }
36400 }
36401 }
36410 {
36411 /* If decl is an iterator, preserve the operator on decl
36412 until finish_omp_for. */
36414 && ((processing_template_decl
36419 else
36423 }
36425 parse_close_paren:
36436 {
36439 }
36441 {
36445 }
36452 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
36453 in between the collapsed for loops to be still considered perfectly
36454 nested. Hopefully the final version clarifies this.
36455 For now handle (multiple) {'s and empty statements. */
36458 {
36462 {
36464 bracecount++;
36465 }
36469 else
36470 {
36477 }
36478 }
36481 {
36484 }
36485 }
36490 /* Note that we saved the original contents of this flag when we entered
36491 the structured block, and so we don't need to re-save it here. */
36494 /* Note that the grammar doesn't call for a structured block here,
36495 though the loop as a whole is a structured block. */
36497 {
36503 }
36504 else
36509 else
36514 else
36519 {
36521 {
36523 nbraces--;
36524 }
36527 else
36528 {
36530 {
36533 }
36538 }
36539 }
36542 {
36546 else
36548 }
36552 }
36554 /* Helper function for OpenMP parsing, split clauses and call
36555 finish_omp_clauses on each of the set of clauses afterwards. */
36557 static void
36560 {
36566 }
36568 /* OpenMP 4.0:
36569 #pragma omp simd simd-clause[optseq] new-line
36570 for-loop */
36572 #define OMP_SIMD_CLAUSE_MASK \
36573 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
36574 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36575 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36576 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36577 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36578 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36579 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36580 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
36581 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36582 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NONTEMPORAL))
36584 static tree
36588 {
36599 {
36603 OMP_CLAUSE_ORDERED);
36605 {
36607 "%<ordered%> clause with parameter may not be specified "
36610 }
36611 }
36623 }
36625 /* OpenMP 2.5:
36626 #pragma omp for for-clause[optseq] new-line
36627 for-loop
36629 OpenMP 4.0:
36630 #pragma omp for simd for-simd-clause[optseq] new-line
36631 for-loop */
36633 #define OMP_FOR_CLAUSE_MASK \
36634 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36635 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36636 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36638 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36639 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
36640 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
36641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36644 static tree
36648 {
36655 /* parallel for{, simd} disallows nowait clause, but for
36656 target {teams distribute ,}parallel for{, simd} it should be accepted. */
36659 /* Composite distribute parallel for{, simd} disallows ordered clause. */
36664 {
36669 {
36693 }
36694 }
36696 {
36699 }
36701 /* Composite distribute parallel for disallows linear clause. */
36708 {
36711 }
36723 }
36728 /* OpenMP 2.5:
36729 # pragma omp master new-line
36730 structured-block */
36732 static tree
36736 {
36744 {
36749 {
36767 }
36768 }
36770 {
36773 }
36776 {
36780 }
36781 else
36786 }
36788 /* OpenMP 2.5:
36789 # pragma omp ordered new-line
36790 structured-block
36792 OpenMP 4.5:
36793 # pragma omp ordered ordered-clauses new-line
36794 structured-block */
36796 #define OMP_ORDERED_CLAUSE_MASK \
36797 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
36798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
36800 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
36801 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
36803 static bool
36806 {
36810 {
36815 {
36817 {
36820 }
36822 {
36824 "%<depend%> clause may only be used in compound "
36828 }
36829 tree clauses
36831 OMP_ORDERED_DEPEND_CLAUSE_MASK,
36835 }
36836 }
36838 tree clauses
36849 }
36851 /* OpenMP 2.5:
36853 section-scope:
36854 { section-sequence }
36856 section-sequence:
36857 section-directive[opt] structured-block
36858 section-sequence section-directive structured-block */
36860 static tree
36862 {
36867 matching_braces braces;
36875 {
36879 }
36882 {
36890 {
36894 }
36896 {
36899 }
36904 }
36915 }
36917 /* OpenMP 2.5:
36918 # pragma omp sections sections-clause[optseq] newline
36919 sections-scope */
36921 #define OMP_SECTIONS_CLAUSE_MASK \
36922 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36923 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36924 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36925 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36928 static tree
36931 {
36943 {
36946 }
36953 }
36955 /* OpenMP 2.5:
36956 # pragma omp parallel parallel-clause[optseq] new-line
36957 structured-block
36958 # pragma omp parallel for parallel-for-clause[optseq] new-line
36959 structured-block
36960 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
36961 structured-block
36963 OpenMP 4.0:
36964 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
36965 structured-block */
36967 #define OMP_PARALLEL_CLAUSE_MASK \
36968 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
36972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
36974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
36976 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
36978 static tree
36982 {
36989 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
36995 {
37003 if_p);
37007 if_p);
37010 block);
37015 }
37016 /* When combined with distribute, parallel has to be followed by for.
37017 #pragma omp target parallel is allowed though. */
37021 {
37025 }
37027 {
37031 {
37042 block);
37047 }
37049 {
37052 }
37054 {
37064 block);
37067 }
37068 }
37070 {
37073 }
37078 {
37081 }
37089 }
37091 /* OpenMP 2.5:
37092 # pragma omp single single-clause[optseq] new-line
37093 structured-block */
37095 #define OMP_SINGLE_CLAUSE_MASK \
37096 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37097 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37098 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
37099 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37101 static tree
37103 {
37114 }
37116 /* OpenMP 3.0:
37117 # pragma omp task task-clause[optseq] new-line
37118 structured-block */
37120 #define OMP_TASK_CLAUSE_MASK \
37121 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
37131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
37133 static tree
37135 {
37146 }
37148 /* OpenMP 3.0:
37149 # pragma omp taskwait new-line
37151 OpenMP 5.0:
37152 # pragma omp taskwait taskwait-clause[opt] new-line */
37154 #define OMP_TASKWAIT_CLAUSE_MASK \
37155 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
37157 static void
37159 {
37160 tree clauses
37165 {
37172 }
37173 else
37175 }
37177 /* OpenMP 3.1:
37178 # pragma omp taskyield new-line */
37180 static void
37182 {
37185 }
37187 /* OpenMP 4.0:
37188 # pragma omp taskgroup new-line
37189 structured-block
37191 OpenMP 5.0:
37192 # pragma omp taskgroup taskgroup-clause[optseq] new-line */
37194 #define OMP_TASKGROUP_CLAUSE_MASK \
37195 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASK_REDUCTION))
37197 static tree
37199 {
37200 tree clauses
37205 if_p),
37206 clauses);
37207 }
37210 /* OpenMP 2.5:
37211 # pragma omp threadprivate (variable-list) */
37213 static void
37215 {
37216 tree vars;
37222 }
37224 /* OpenMP 4.0:
37225 # pragma omp cancel cancel-clause[optseq] new-line */
37227 #define OMP_CANCEL_CLAUSE_MASK \
37228 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
37229 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
37230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
37231 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
37232 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
37234 static void
37236 {
37240 }
37242 /* OpenMP 4.0:
37243 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
37245 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
37246 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
37247 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
37248 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
37249 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
37251 static void
37254 {
37255 tree clauses;
37259 {
37264 {
37267 }
37268 }
37270 {
37274 }
37277 {
37282 else
37286 }
37289 OMP_CANCELLATION_POINT_CLAUSE_MASK,
37291 pragma_tok);
37293 }
37295 /* OpenMP 4.0:
37296 #pragma omp distribute distribute-clause[optseq] new-line
37297 for-loop */
37299 #define OMP_DISTRIBUTE_CLAUSE_MASK \
37300 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37301 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37302 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37303 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
37304 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
37306 static tree
37310 {
37319 {
37327 else
37330 {
37336 {
37340 else
37343 }
37349 else
37363 }
37364 }
37366 {
37369 }
37374 {
37377 }
37389 }
37391 /* OpenMP 4.0:
37392 # pragma omp teams teams-clause[optseq] new-line
37393 structured-block */
37395 #define OMP_TEAMS_CLAUSE_MASK \
37396 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37397 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37399 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
37400 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
37401 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
37402 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
37404 static tree
37408 {
37417 {
37421 {
37447 }
37448 }
37450 {
37453 }
37458 {
37461 }
37471 }
37473 /* OpenMP 4.0:
37474 # pragma omp target data target-data-clause[optseq] new-line
37475 structured-block */
37477 #define OMP_TARGET_DATA_CLAUSE_MASK \
37478 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37479 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37480 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
37483 static tree
37485 {
37486 tree clauses
37491 {
37494 {
37511 "%<#pragma omp target data%> with map-type other "
37512 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
37516 }
37520 }
37523 {
37526 "%<#pragma omp target data%> must contain at least "
37529 }
37540 }
37542 /* OpenMP 4.5:
37543 # pragma omp target enter data target-enter-data-clause[optseq] new-line
37544 structured-block */
37546 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
37547 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37548 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37549 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37550 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37551 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37553 static tree
37556 {
37559 {
37564 {
37567 }
37568 }
37570 {
37574 }
37577 {
37583 }
37585 tree clauses
37590 {
37593 {
37606 "%<#pragma omp target enter data%> with map-type other "
37610 }
37612 }
37615 {
37618 "%<#pragma omp target enter data%> must contain at least "
37621 }
37628 }
37630 /* OpenMP 4.5:
37631 # pragma omp target exit data target-enter-data-clause[optseq] new-line
37632 structured-block */
37634 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
37635 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37636 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37638 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37639 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37641 static tree
37644 {
37647 {
37652 {
37655 }
37656 }
37658 {
37662 }
37665 {
37671 }
37673 tree clauses
37678 {
37681 {
37695 "%<#pragma omp target exit data%> with map-type other "
37696 "than %<from%>, %<release%> or %<delete%> on %<map%>"
37700 }
37702 }
37705 {
37708 "%<#pragma omp target exit data%> must contain at least "
37711 }
37718 }
37720 /* OpenMP 4.0:
37721 # pragma omp target update target-update-clause[optseq] new-line */
37723 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
37724 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
37725 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37726 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37727 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37728 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37729 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37731 static bool
37734 {
37736 {
37742 }
37744 tree clauses
37749 {
37751 "%<#pragma omp target update%> must contain at least one "
37754 }
37762 }
37764 /* OpenMP 4.0:
37765 # pragma omp target target-clause[optseq] new-line
37766 structured-block */
37768 #define OMP_TARGET_CLAUSE_MASK \
37769 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
37774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
37777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
37779 static bool
37782 {
37786 omp_requires_mask
37790 {
37802 {
37810 {
37811 tree stmt;
37813 {
37816 OMP_TARGET_CLAUSE_MASK,
37821 OMP_TARGET_CLAUSE_MASK,
37826 OMP_TARGET_CLAUSE_MASK,
37831 }
37833 }
37838 {
37842 if_p);
37847 if_p);
37852 if_p);
37856 }
37862 {
37863 /* For combined target teams, ensure the num_teams and
37864 thread_limit clause expressions are evaluated on the host,
37865 before entering the target construct. */
37866 tree c;
37872 {
37881 OMP_CLAUSE_FIRSTPRIVATE);
37886 }
37887 }
37897 }
37899 {
37902 }
37904 {
37908 }
37910 {
37914 }
37916 {
37920 }
37922 {
37925 }
37926 }
37928 {
37931 }
37946 check_clauses:
37948 {
37951 {
37965 "%<#pragma omp target%> with map-type other "
37966 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
37970 }
37972 }
37974 }
37976 /* OpenACC 2.0:
37977 # pragma acc cache (variable-list) new-line
37978 */
37980 static tree
37982 {
37997 }
37999 /* OpenACC 2.0:
38000 # pragma acc data oacc-data-clause[optseq] new-line
38001 structured-block */
38003 #define OACC_DATA_CLAUSE_MASK \
38004 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38005 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38007 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38008 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38009 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38010 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
38012 static tree
38014 {
38027 }
38029 /* OpenACC 2.0:
38030 # pragma acc host_data <clauses> new-line
38031 structured-block */
38033 #define OACC_HOST_DATA_CLAUSE_MASK \
38034 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
38036 static tree
38038 {
38051 }
38053 /* OpenACC 2.0:
38054 # pragma acc declare oacc-data-clause[optseq] new-line
38055 */
38057 #define OACC_DECLARE_CLAUSE_MASK \
38058 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
38064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
38065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
38067 static tree
38069 {
38078 {
38082 }
38085 {
38089 {
38093 }
38096 {
38108 {
38110 "%qD must be a global variable in "
38112 decl);
38115 }
38120 {
38124 }
38126 {
38128 "invalid use of %<extern%> variable %qD "
38132 }
38134 {
38136 "invalid use of %<global%> variable %qD "
38140 }
38142 }
38147 {
38152 }
38155 {
38156 tree id;
38160 else
38166 {
38169 {
38172 {
38176 }
38177 }
38178 }
38179 }
38180 }
38193 }
38195 /* OpenACC 2.0:
38196 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
38198 or
38200 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
38202 LOC is the location of the #pragma token.
38203 */
38205 #define OACC_ENTER_DATA_CLAUSE_MASK \
38206 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38207 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38208 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38209 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38210 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38212 #define OACC_EXIT_DATA_CLAUSE_MASK \
38213 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38216 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
38217 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
38218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38220 static tree
38223 {
38232 {
38237 }
38244 else
38249 {
38253 }
38261 }
38263 /* OpenACC 2.0:
38264 # pragma acc loop oacc-loop-clause[optseq] new-line
38265 structured-block */
38267 #define OACC_LOOP_CLAUSE_MASK \
38268 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
38269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
38270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
38271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
38272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
38273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
38274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
38275 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
38276 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
38277 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
38279 static tree
38282 {
38291 {
38297 }
38306 }
38308 /* OpenACC 2.0:
38309 # pragma acc kernels oacc-kernels-clause[optseq] new-line
38310 structured-block
38312 or
38314 # pragma acc parallel oacc-parallel-clause[optseq] new-line
38315 structured-block
38316 */
38318 #define OACC_KERNELS_CLAUSE_MASK \
38319 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38320 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38321 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38322 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38324 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
38325 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38326 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38327 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
38328 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
38329 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
38330 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
38331 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38333 #define OACC_PARALLEL_CLAUSE_MASK \
38334 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38335 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38336 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38337 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38338 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38339 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
38340 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38341 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
38342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
38344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
38345 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
38346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
38347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
38348 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
38349 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38351 static tree
38354 {
38355 omp_clause_mask mask;
38358 {
38371 }
38374 {
38378 {
38381 tree clauses;
38383 if_p);
38385 }
38386 }
38395 }
38397 /* OpenACC 2.0:
38398 # pragma acc update oacc-update-clause[optseq] new-line
38399 */
38401 #define OACC_UPDATE_CLAUSE_MASK \
38402 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38403 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
38404 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
38405 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38406 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
38407 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
38409 static tree
38411 {
38418 {
38420 "%<#pragma acc update%> must contain at least one "
38423 }
38431 }
38433 /* OpenACC 2.0:
38434 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
38436 LOC is the location of the #pragma token.
38437 */
38439 #define OACC_WAIT_CLAUSE_MASK \
38440 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
38442 static tree
38444 {
38458 }
38460 /* OpenMP 4.0:
38461 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
38463 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
38464 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
38465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
38466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
38467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
38468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
38469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
38471 static void
38474 {
38476 cp_omp_declare_simd_data data;
38478 {
38483 /* It is safe to take the address of a local variable; it will only be
38484 used while this scope is live. */
38486 }
38488 /* Store away all pragma tokens. */
38500 {
38504 {
38517 }
38522 "%<#pragma omp declare simd%> not immediately followed by "
38526 }
38527 }
38529 /* Finalize #pragma omp declare simd clauses after direct declarator has
38530 been parsed, and put that into "omp declare simd" attribute. */
38532 static tree
38534 {
38540 {
38544 }
38549 {
38567 }
38571 }
38574 /* OpenMP 4.0:
38575 # pragma omp declare target new-line
38576 declarations and definitions
38577 # pragma omp end declare target new-line
38579 OpenMP 4.5:
38580 # pragma omp declare target ( extended-list ) new-line
38582 # pragma omp declare target declare-target-clauses[seq] new-line */
38584 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
38585 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
38586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
38588 static void
38590 {
38593 clauses
38597 {
38599 clauses);
38602 }
38603 else
38604 {
38608 }
38611 "%<#pragma omp declare target%> with clauses in between "
38612 "%<#pragma omp declare target%> without clauses and "
38615 {
38621 {
38624 }
38625 else
38628 {
38630 "%qD specified both in declare target %<link%> and %<to%>"
38633 }
38635 {
38642 {
38645 {
38649 }
38650 }
38651 }
38652 }
38653 }
38655 static void
38657 {
38660 {
38663 }
38665 {
38669 {
38672 }
38675 else
38676 {
38680 }
38681 }
38682 else
38683 {
38687 }
38691 "%<#pragma omp end declare target%> without corresponding "
38693 else
38695 }
38697 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
38698 expression and optional initializer clause of
38699 #pragma omp declare reduction. We store the expression(s) as
38700 either 3, 6 or 7 special statements inside of the artificial function's
38701 body. The first two statements are DECL_EXPRs for the artificial
38702 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
38703 expression that uses those variables.
38704 If there was any INITIALIZER clause, this is followed by further statements,
38705 the fourth and fifth statements are DECL_EXPRs for the artificial
38706 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
38707 constructor variant (first token after open paren is not omp_priv),
38708 then the sixth statement is a statement with the function call expression
38709 that uses the OMP_PRIV and optionally OMP_ORIG variable.
38710 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
38711 to initialize the OMP_PRIV artificial variable and there is seventh
38712 statement, a DECL_EXPR of the OMP_PRIV statement again. */
38714 static bool
38716 {
38728 tree combiner;
38743 {
38746 }
38749 {
38751 matching_parens parens;
38757 {
38760 }
38776 {
38780 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
38784 == CPP_CLOSE_PAREN
38787 {
38791 }
38796 }
38797 else
38798 {
38814 {
38819 }
38821 tree arg;
38834 }
38845 }
38849 UNKNOWN_LOCATION);
38852 }
38854 /* OpenMP 4.0
38855 #pragma omp declare reduction (reduction-id : typename-list : expression) \
38856 initializer-clause[opt] new-line
38858 initializer-clause:
38859 initializer (omp_priv initializer)
38860 initializer (function-name (argument-list)) */
38862 static void
38865 {
38875 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
38882 {
38914 }
38926 /* Types may not be defined in declare reduction type list. */
38929 parser->type_definition_forbidden_message
38935 saved_colon_doesnt_start_class_def_p
38940 {
38944 ;
38963 else
38968 else
38970 }
38972 /* Restore the saved message. */
38975 parser->colon_doesnt_start_class_def_p
38980 {
38981 fail:
38984 }
38990 {
38991 tree fntype
38994 NULL_TREE);
39014 {
39019 }
39021 {
39023 {
39032 }
39039 }
39040 else
39041 {
39044 }
39047 else
39050 {
39053 }
39055 {
39058 else
39063 }
39068 else
39069 {
39078 }
39085 }
39089 done:
39090 /* Free any declarators allocated. */
39092 }
39094 /* OpenMP 4.0
39095 #pragma omp declare simd declare-simd-clauses[optseq] new-line
39096 #pragma omp declare reduction (reduction-id : typename-list : expression) \
39097 initializer-clause[opt] new-line
39098 #pragma omp declare target new-line */
39100 static bool
39103 {
39105 {
39110 {
39113 context);
39115 }
39118 {
39121 context);
39123 }
39125 {
39128 }
39130 {
39134 }
39135 }
39140 }
39142 /* OpenMP 5.0
39143 #pragma omp requires clauses[optseq] new-line */
39145 static bool
39147 {
39153 {
39160 {
39175 {
39178 matching_parens parens;
39180 {
39182 {
39187 this_req
39190 this_req
39193 this_req
39195 }
39197 {
39199 "expected %<seq_cst%>, %<relaxed%> or "
39202 CPP_CLOSE_PAREN))
39204 }
39205 else
39212 /*consume_paren=*/
39216 {
39219 }
39220 }
39222 }
39223 else
39224 {
39226 "%<unified_shared_memory%>, "
39227 "%<dynamic_allocators%>, "
39228 "%<reverse_offload%> "
39232 }
39239 {
39241 {
39248 }
39250 {
39254 }
39257 {
39260 this_req
39262 (omp_requires_mask
39264 }
39268 "lexically after first %<atomic%> construct "
39271 omp_requires_mask
39274 }
39275 }
39277 }
39283 }
39286 /* OpenMP 4.5:
39287 #pragma omp taskloop taskloop-clause[optseq] new-line
39288 for-loop
39290 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
39291 for-loop */
39293 #define OMP_TASKLOOP_CLAUSE_MASK \
39294 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
39295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
39296 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
39297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
39298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
39299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
39300 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
39301 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
39302 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
39303 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
39304 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
39305 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
39306 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
39307 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
39308 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
39309 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
39311 static tree
39315 {
39322 /* #pragma omp parallel master taskloop{, simd} disallow in_reduction
39323 clause. */
39328 {
39333 {
39357 }
39358 }
39360 {
39363 }
39368 {
39371 }
39378 if_p);
39384 }
39387 /* OpenACC 2.0:
39388 # pragma acc routine oacc-routine-clause[optseq] new-line
39389 function-definition
39391 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
39392 */
39394 #define OACC_ROUTINE_CLAUSE_MASK \
39395 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
39396 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
39397 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
39398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
39401 /* Parse the OpenACC routine pragma. This has an optional '( name )'
39402 component, which must resolve to a declared namespace-scope
39403 function. The clauses are either processed directly (for a named
39404 function), or defered until the immediatley following declaration
39405 is parsed. */
39407 static void
39410 {
39412 /* The checking for "another pragma following this one" in the "no optional
39413 '( name )'" case makes sure that we dont re-enter. */
39416 cp_oacc_routine_data data;
39422 /* It is safe to take the address of a local variable; it will only be
39423 used while this scope is live. */
39426 /* Look for optional '( name )'. */
39428 {
39429 matching_parens parens;
39432 /* We parse the name as an id-expression. If it resolves to
39433 anything other than a non-overloaded function at namespace
39434 scope, it's an error. */
39450 {
39454 }
39456 data.clauses
39464 {
39469 }
39471 /* Perhaps we should use the same rule as declarations in different
39472 namespaces? */
39474 {
39479 }
39482 {
39486 }
39490 }
39492 {
39493 /* Store away all pragma tokens. */
39504 /* Emit a helpful diagnostic if there's another pragma following this
39505 one. */
39507 {
39510 /* ..., and then just keep going. */
39512 }
39514 /* We only have to consider the pragma_external case here. */
39519 else
39522 }
39523 }
39525 /* Finalize #pragma acc routine clauses after direct declarator has
39526 been parsed. */
39528 static tree
39530 {
39535 {
39537 "%<#pragma acc routine%> not immediately followed by "
39540 }
39557 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
39558 fndecl_seen. */
39561 }
39563 /* Apply any saved OpenACC routine clauses to a just-parsed
39564 declaration. */
39566 static void
39568 {
39570 {
39571 /* Keep going if we're in error reporting mode. */
39577 {
39579 "%<#pragma acc routine%> not immediately followed by"
39583 }
39585 {
39588 }
39591 {
39596 }
39599 {
39607 }
39609 /* Process the routine's dimension clauses. */
39613 /* Add an "omp declare target" attribute. */
39618 /* Don't unset parser->oacc_routine here: we may still need it to
39619 diagnose wrong usage. But, remember that we've used this "#pragma acc
39620 routine". */
39622 }
39623 }
39625 /* Main entry point to OpenMP statement pragmas. */
39627 static void
39629 {
39630 tree stmt;
39635 {
39658 if_p);
39663 if_p);
39680 if_p);
39685 if_p);
39690 if_p);
39695 if_p);
39704 if_p);
39718 if_p);
39723 if_p);
39727 }
39730 }
39731 \f
39732 /* Transactional Memory parsing routines. */
39734 /* Parse a transaction attribute.
39736 txn-attribute:
39737 attribute
39738 [ [ identifier ] ]
39740 We use this instead of cp_parser_attributes_opt for transactions to avoid
39741 the pedwarn in C++98 mode. */
39743 static tree
39745 {
39760 {
39764 /* For keywords, use the canonical spelling,
39765 not the parsed identifier. */
39769 }
39770 else
39774 error1:
39777 }
39779 /* Parse a __transaction_atomic or __transaction_relaxed statement.
39781 transaction-statement:
39782 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
39783 compound-statement
39784 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
39785 */
39787 static tree
39789 {
39800 else
39801 {
39805 }
39807 /* Parse a noexcept specification. */
39811 {
39812 /* cancel-and-throw is unimplemented. */
39815 }
39816 else
39819 /* Keep track if we're in the lexical scope of an outer transaction. */
39831 }
39833 /* Parse a __transaction_atomic or __transaction_relaxed expression.
39835 transaction-expression:
39836 __transaction_atomic txn-noexcept-spec[opt] ( expression )
39837 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
39838 */
39840 static tree
39842 {
39855 keyword == RID_TRANSACTION_RELAXED
39869 /* Set this early. This might mean that we allow transaction_cancel in
39870 an expression that we find out later actually has to be a constexpr.
39871 However, we expect that cxx_constant_value will be able to deal with
39872 this; also, if the noexcept has no constexpr, then what we parse next
39873 really is a transaction's body. */
39876 /* Parse a noexcept specification. */
39882 {
39883 matching_parens parens;
39890 }
39891 else
39892 {
39893 /* The only expression that is available got parsed for the noexcept
39894 already. noexcept is true then. */
39897 }
39906 }
39908 /* Parse a function-transaction-block.
39910 function-transaction-block:
39911 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
39912 function-body
39913 __transaction_atomic txn-attribute[opt] function-try-block
39914 __transaction_relaxed ctor-initializer[opt] function-body
39915 __transaction_relaxed function-try-block
39916 */
39918 static void
39920 {
39935 else
39936 {
39940 }
39948 else
39949 cp_parser_ctor_initializer_opt_and_function_body
39955 }
39957 /* Parse a __transaction_cancel statement.
39959 cancel-statement:
39960 __transaction_cancel txn-attribute[opt] ;
39961 __transaction_cancel txn-attribute[opt] throw-expression ;
39963 ??? Cancel and throw is not yet implemented. */
39965 static tree
39967 {
39973 RT_TRANSACTION_CANCEL);
39980 /* ??? Parse cancel-and-throw here. */
39985 {
39989 }
39991 {
39995 }
39997 {
40000 {
40006 }
40007 }
40009 {
40013 }
40019 }
40020 \f
40021 /* The parser. */
40025 \f
40026 /* Special handling for the first token or line in the file. The first
40027 thing in the file might be #pragma GCC pch_preprocess, which loads a
40028 PCH file, which is a GC collection point. So we need to handle this
40029 first pragma without benefit of an existing lexer structure.
40031 Always returns one token to the caller in *FIRST_TOKEN. This is
40032 either the true first token of the file, or the first token after
40033 the initial pragma. */
40035 static void
40037 {
40046 {
40053 }
40054 else
40057 /* Skip to the end of the pragma. */
40061 /* Now actually load the PCH file. */
40065 /* Read one more token to return to our caller. We have to do this
40066 after reading the PCH file in, since its pointers have to be
40067 live. */
40069 }
40071 /* Parse a pragma GCC ivdep. */
40073 static bool
40075 {
40078 }
40080 /* Parse a pragma GCC unroll. */
40082 static unsigned short
40084 {
40094 {
40096 " assignment-expression that evaluates to a non-negative"
40099 }
40100 else
40101 {
40105 }
40108 }
40110 /* Normal parsing of a pragma token. Here we can (and must) use the
40111 regular lexer. */
40113 static bool
40115 {
40118 tree stmt;
40129 {
40137 {
40147 }
40152 {
40162 }
40167 {
40177 }
40182 {
40193 }
40198 {
40209 }
40214 {
40225 }
40245 {
40250 }
40258 {
40263 }
40271 {
40275 }
40281 {
40286 }
40294 {
40299 }
40357 "%<#pragma omp section%> may only be used in "
40362 {
40364 {
40368 }
40374 {
40378 }
40379 else
40385 {
40388 }
40391 }
40394 {
40396 {
40400 }
40401 const unsigned short unroll
40407 {
40411 }
40412 else
40418 {
40421 }
40424 }
40431 bad_stmt:
40434 }
40438 }
40440 /* The interface the pragma parsers have to the lexer. */
40442 enum cpp_ttype
40444 {
40456 else
40457 {
40461 }
40464 }
40466 \f
40467 /* External interface. */
40469 /* Parse one entire translation unit. */
40471 void
40473 {
40488 }
40490 /* Create an identifier for a generic parameter type (a synthesized
40491 template parameter implied by `auto' or a concept identifier). */
40494 static tree
40496 {
40500 }
40502 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
40503 (creating a new template parameter list if necessary). Returns the newly
40504 created template type parm. */
40506 static tree
40508 {
40511 /* Before committing to modifying any scope, if we're in an
40512 implicit template scope, and we're trying to synthesize a
40513 constrained parameter, try to find a previous parameter with
40514 the same name. This is the same-type rule for abbreviated
40515 function templates.
40517 NOTE: We can generate implicit parameters when tentatively
40518 parsing a nested name specifier, only to reject that parse
40519 later. However, matching the same template-id as part of a
40520 direct-declarator should generate an identical template
40521 parameter, so this rule will merge them. */
40523 {
40526 {
40528 {
40531 /* Return the TEMPLATE_PARM_INDEX. */
40534 }
40536 }
40537 }
40539 /* We are either continuing a function template that already contains implicit
40540 template parameters, creating a new fully-implicit function template, or
40541 extending an existing explicit function template with implicit template
40542 parameters. */
40550 {
40554 }
40555 else
40556 {
40557 /* Roll back to the existing template parameter scope (in the case of
40558 extending an explicit function template) or introduce a new template
40559 parameter scope ahead of the function parameter scope (or class scope
40560 in the case of out-of-line member definitions). The function scope is
40561 added back after template parameter synthesis below. */
40566 {
40569 }
40571 {
40572 /* If not defining a class, then any class scope is a scope level in
40573 an out-of-line member definition. In this case simply wind back
40574 beyond the first such scope to inject the template parameter list.
40575 Otherwise wind back to the class being defined. The latter can
40576 occur in class member friend declarations such as:
40578 class A {
40579 void foo (auto);
40580 };
40581 class B {
40582 friend void A::foo (auto);
40583 };
40585 The template parameter list synthesized for the friend declaration
40586 must be injected in the scope of 'B'. This can also occur in
40587 erroneous cases such as:
40589 struct A {
40590 struct B {
40591 void foo (auto);
40592 };
40593 void B::foo (auto) {}
40594 };
40596 Here the attempted definition of 'B::foo' within 'A' is ill-formed
40597 but, nevertheless, the template parameter list synthesized for the
40598 declarator should be injected into the scope of 'A' as if the
40599 ill-formed template was specified explicitly. */
40602 {
40605 }
40606 }
40612 {
40613 /* Introduce a new template parameter list for implicit template
40614 parameters. */
40618 parser->implicit_template_scope
40625 }
40626 else
40627 {
40628 /* Synthesize implicit template parameters at the end of the explicit
40629 template parameter list. */
40636 parser->implicit_template_parms
40638 }
40639 }
40641 /* Synthesize a new template parameter and track the current template
40642 parameter chain with implicit_template_parms. */
40646 tree synth_tmpl_parm;
40650 synth_tmpl_parm
40653 synth_tmpl_parm
40655 else
40656 {
40660 }
40662 // Attach the constraint to the parm before processing.
40665 tree new_parm
40667 input_location,
40668 node,
40672 // Chain the new parameter to the list of implicit parameters.
40674 parser->implicit_template_parms
40676 else
40681 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
40684 /* If creating a fully implicit function template, start the new implicit
40685 template parameter list with this synthesized type, otherwise grow the
40686 current template parameter list. */
40689 {
40696 }
40697 else
40698 {
40703 }
40705 // If the new parameter was constrained, we need to add that to the
40706 // constraints in the template parameter list.
40708 {
40712 }
40717 }
40719 /* Finish the declaration of a fully implicit function template. Such a
40720 template has no explicit template parameter list so has not been through the
40721 normal template head and tail processing. synthesize_implicit_template_parm
40722 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
40723 provided if the declaration is a class member such that its template
40724 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
40725 form is returned. Otherwise NULL_TREE is returned. */
40727 static tree
40729 {
40734 {
40738 }
40750 }
40752 /* Like finish_fully_implicit_template, but to be used in error
40753 recovery, rearranging scopes so that we restore the state we had
40754 before synthesize_implicit_template_parm inserted the implement
40755 template parms scope. */
40757 static void
40759 {
40764 {
40773 }
40774 else
40780 }
40782 /* Helper function for diagnostics that have complained about things
40783 being used with 'extern "C"' linkage.
40785 Attempt to issue a note showing where the 'extern "C"' linkage began. */
40787 void
40789 {
40793 }