| blob | 88fc426102b04168273b69ac14e5fc5576821caa |
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. */
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. */
1484 }
1486 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1487 of modifiers such as const or volatile to apply to the pointer
1488 type, represented as identifiers. ATTRIBUTES represent the attributes that
1489 appertain to the pointer or reference. */
1491 cp_declarator *
1493 tree attributes)
1494 {
1502 {
1506 }
1507 else
1513 }
1515 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1516 represent the attributes that appertain to the pointer or
1517 reference. */
1519 cp_declarator *
1522 {
1530 {
1534 }
1535 else
1541 }
1543 /* Like make_pointer_declarator -- but for a pointer to a non-static
1544 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1545 appertain to the pointer or reference. */
1547 cp_declarator *
1550 tree attributes)
1551 {
1560 {
1563 }
1564 else
1570 }
1572 /* Make a declarator for the function given by TARGET, with the
1573 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1574 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1575 indicates what exceptions can be thrown. */
1577 cp_declarator *
1579 tree parms,
1580 cp_cv_quals cv_qualifiers,
1581 cp_virt_specifiers virt_specifiers,
1582 cp_ref_qualifier ref_qualifier,
1583 tree tx_qualifier,
1584 tree exception_specification,
1585 tree late_return_type,
1586 tree requires_clause)
1587 {
1601 {
1605 }
1606 else
1610 }
1612 /* Make a declarator for an array of BOUNDS elements, each of which is
1613 defined by ELEMENT. */
1615 cp_declarator *
1617 {
1624 {
1628 }
1629 else
1633 }
1635 /* Determine whether the declarator we've seen so far can be a
1636 parameter pack, when followed by an ellipsis. */
1637 static bool
1639 {
1641 /* We already saw an ellipsis. */
1644 /* Search for a declarator name, or any other declarator that goes
1645 after the point where the ellipsis could appear in a parameter
1646 pack. If we find any of these, then this declarator can not be
1647 made into a parameter pack. */
1650 {
1652 {
1665 }
1666 }
1669 }
1673 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1674 DECLARATOR and DEFAULT_ARGUMENT. */
1676 cp_parameter_declarator *
1679 tree default_argument,
1680 location_t loc,
1682 {
1690 else
1698 }
1700 /* Returns true iff DECLARATOR is a declaration for a function. */
1702 static bool
1704 {
1706 {
1715 }
1717 }
1719 /* The parser. */
1721 /* Overview
1722 --------
1724 A cp_parser parses the token stream as specified by the C++
1725 grammar. Its job is purely parsing, not semantic analysis. For
1726 example, the parser breaks the token stream into declarators,
1727 expressions, statements, and other similar syntactic constructs.
1728 It does not check that the types of the expressions on either side
1729 of an assignment-statement are compatible, or that a function is
1730 not declared with a parameter of type `void'.
1732 The parser invokes routines elsewhere in the compiler to perform
1733 semantic analysis and to build up the abstract syntax tree for the
1734 code processed.
1736 The parser (and the template instantiation code, which is, in a
1737 way, a close relative of parsing) are the only parts of the
1738 compiler that should be calling push_scope and pop_scope, or
1739 related functions. The parser (and template instantiation code)
1740 keeps track of what scope is presently active; everything else
1741 should simply honor that. (The code that generates static
1742 initializers may also need to set the scope, in order to check
1743 access control correctly when emitting the initializers.)
1745 Methodology
1746 -----------
1748 The parser is of the standard recursive-descent variety. Upcoming
1749 tokens in the token stream are examined in order to determine which
1750 production to use when parsing a non-terminal. Some C++ constructs
1751 require arbitrary look ahead to disambiguate. For example, it is
1752 impossible, in the general case, to tell whether a statement is an
1753 expression or declaration without scanning the entire statement.
1754 Therefore, the parser is capable of "parsing tentatively." When the
1755 parser is not sure what construct comes next, it enters this mode.
1756 Then, while we attempt to parse the construct, the parser queues up
1757 error messages, rather than issuing them immediately, and saves the
1758 tokens it consumes. If the construct is parsed successfully, the
1759 parser "commits", i.e., it issues any queued error messages and
1760 the tokens that were being preserved are permanently discarded.
1761 If, however, the construct is not parsed successfully, the parser
1762 rolls back its state completely so that it can resume parsing using
1763 a different alternative.
1765 Future Improvements
1766 -------------------
1768 The performance of the parser could probably be improved substantially.
1769 We could often eliminate the need to parse tentatively by looking ahead
1770 a little bit. In some places, this approach might not entirely eliminate
1771 the need to parse tentatively, but it might still speed up the average
1772 case. */
1774 /* Flags that are passed to some parsing functions. These values can
1775 be bitwise-ored together. */
1777 enum
1778 {
1779 /* No flags. */
1781 /* The construct is optional. If it is not present, then no error
1782 should be issued. */
1784 /* When parsing a type-specifier, treat user-defined type-names
1785 as non-type identifiers. */
1787 /* When parsing a type-specifier, do not try to parse a class-specifier
1788 or enum-specifier. */
1790 /* When parsing a decl-specifier-seq, only allow type-specifier or
1791 constexpr. */
1793 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1795 };
1797 /* This type is used for parameters and variables which hold
1798 combinations of the above flags. */
1801 /* The different kinds of declarators we want to parse. */
1803 enum cp_parser_declarator_kind
1804 {
1805 /* We want an abstract declarator. */
1806 CP_PARSER_DECLARATOR_ABSTRACT,
1807 /* We want a named declarator. */
1808 CP_PARSER_DECLARATOR_NAMED,
1809 /* We don't mind, but the name must be an unqualified-id. */
1810 CP_PARSER_DECLARATOR_EITHER
1811 };
1813 /* The precedence values used to parse binary expressions. The minimum value
1814 of PREC must be 1, because zero is reserved to quickly discriminate
1815 binary operators from other tokens. */
1817 enum cp_parser_prec
1818 {
1819 PREC_NOT_OPERATOR,
1820 PREC_LOGICAL_OR_EXPRESSION,
1821 PREC_LOGICAL_AND_EXPRESSION,
1822 PREC_INCLUSIVE_OR_EXPRESSION,
1823 PREC_EXCLUSIVE_OR_EXPRESSION,
1824 PREC_AND_EXPRESSION,
1825 PREC_EQUALITY_EXPRESSION,
1826 PREC_RELATIONAL_EXPRESSION,
1827 PREC_SHIFT_EXPRESSION,
1828 PREC_ADDITIVE_EXPRESSION,
1829 PREC_MULTIPLICATIVE_EXPRESSION,
1830 PREC_PM_EXPRESSION,
1831 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1832 };
1834 /* A mapping from a token type to a corresponding tree node type, with a
1835 precedence value. */
1837 struct cp_parser_binary_operations_map_node
1838 {
1839 /* The token type. */
1841 /* The corresponding tree code. */
1843 /* The precedence of this operator. */
1845 };
1847 struct cp_parser_expression_stack_entry
1848 {
1849 /* Left hand side of the binary operation we are currently
1850 parsing. */
1851 cp_expr lhs;
1852 /* Original tree code for left hand side, if it was a binary
1853 expression itself (used for -Wparentheses). */
1855 /* Tree code for the binary operation we are parsing. */
1857 /* Precedence of the binary operation we are parsing. */
1859 /* Location of the binary operation we are parsing. */
1860 location_t loc;
1861 };
1863 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1864 entries because precedence levels on the stack are monotonically
1865 increasing. */
1869 /* Prototypes. */
1871 /* Constructors and destructors. */
1876 /* Class variables. */
1880 /* The operator-precedence table used by cp_parser_binary_expression.
1881 Transformed into an associative array (binops_by_token) by
1882 cp_parser_new. */
1915 };
1917 /* The same as binops, but initialized by cp_parser_new so that
1918 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1919 for speed. */
1922 /* Constructors and destructors. */
1924 /* Construct a new context. The context below this one on the stack
1925 is given by NEXT. */
1929 {
1932 /* Allocate the storage. */
1934 {
1935 /* Pull the first entry from the free list. */
1939 }
1940 else
1943 /* No errors have occurred yet in this context. */
1945 /* If this is not the bottommost context, copy information that we
1946 need from the previous context. */
1948 {
1949 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1950 expression, then we are parsing one in this context, too. */
1952 /* Thread the stack. */
1954 }
1957 }
1959 /* Managing the unparsed function queues. */
1961 #define unparsed_funs_with_default_args \
1962 parser->unparsed_queues->last ().funs_with_default_args
1963 #define unparsed_funs_with_definitions \
1964 parser->unparsed_queues->last ().funs_with_definitions
1965 #define unparsed_nsdmis \
1966 parser->unparsed_queues->last ().nsdmis
1967 #define unparsed_classes \
1968 parser->unparsed_queues->last ().classes
1970 static void
1972 {
1975 }
1977 static void
1979 {
1982 }
1984 /* Prototypes. */
1986 /* Constructors and destructors. */
1991 /* Routines to parse various constructs.
1993 Those that return `tree' will return the error_mark_node (rather
1994 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1995 Sometimes, they will return an ordinary node if error-recovery was
1996 attempted, even though a parse error occurred. So, to check
1997 whether or not a parse error occurred, you should always use
1998 cp_parser_error_occurred. If the construct is optional (indicated
1999 either by an `_opt' in the name of the function that does the
2000 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2001 the construct is not present. */
2003 /* Lexical conventions [gram.lex] */
2005 static cp_expr cp_parser_identifier
2007 static cp_expr cp_parser_string_literal
2009 static cp_expr cp_parser_userdef_char_literal
2011 static tree cp_parser_userdef_string_literal
2013 static cp_expr cp_parser_userdef_numeric_literal
2016 /* Basic concepts [gram.basic] */
2020 /* Expressions [gram.expr] */
2022 static cp_expr cp_parser_primary_expression
2024 static cp_expr cp_parser_id_expression
2026 static cp_expr cp_parser_unqualified_id
2028 static tree cp_parser_nested_name_specifier_opt
2030 static tree cp_parser_nested_name_specifier
2032 static tree cp_parser_qualifying_entity
2034 static cp_expr cp_parser_postfix_expression
2036 static tree cp_parser_postfix_open_square_expression
2038 static tree cp_parser_postfix_dot_deref_expression
2043 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2045 static void cp_parser_pseudo_destructor_name
2047 static cp_expr cp_parser_unary_expression
2049 static enum tree_code cp_parser_unary_operator
2051 static tree cp_parser_new_expression
2055 static tree cp_parser_new_type_id
2063 static tree cp_parser_delete_expression
2065 static cp_expr cp_parser_cast_expression
2067 static cp_expr cp_parser_binary_expression
2069 static tree cp_parser_question_colon_clause
2071 static cp_expr cp_parser_assignment_expression
2073 static enum tree_code cp_parser_assignment_operator_opt
2075 static cp_expr cp_parser_expression
2077 static cp_expr cp_parser_constant_expression
2079 static cp_expr cp_parser_builtin_offsetof
2081 static cp_expr cp_parser_lambda_expression
2083 static void cp_parser_lambda_introducer
2085 static bool cp_parser_lambda_declarator_opt
2087 static void cp_parser_lambda_body
2090 /* Statements [gram.stmt.stmt] */
2092 static void cp_parser_statement
2094 static void cp_parser_label_for_labeled_statement
2096 static tree cp_parser_expression_statement
2098 static tree cp_parser_compound_statement
2100 static void cp_parser_statement_seq_opt
2102 static tree cp_parser_selection_statement
2104 static tree cp_parser_condition
2106 static tree cp_parser_iteration_statement
2108 static bool cp_parser_init_statement
2110 static tree cp_parser_for
2112 static tree cp_parser_c_for
2114 static tree cp_parser_range_for
2116 static void do_range_for_auto_deduction
2118 static tree cp_parser_perform_range_for_lookup
2120 static tree cp_parser_range_for_member_function
2122 static tree cp_parser_jump_statement
2124 static void cp_parser_declaration_statement
2127 static tree cp_parser_implicitly_scoped_statement
2129 static void cp_parser_already_scoped_statement
2132 /* Declarations [gram.dcl.dcl] */
2134 static void cp_parser_declaration_seq_opt
2136 static void cp_parser_declaration
2138 static void cp_parser_toplevel_declaration
2140 static void cp_parser_block_declaration
2142 static void cp_parser_simple_declaration
2144 static void cp_parser_decl_specifier_seq
2146 static tree cp_parser_storage_class_specifier_opt
2148 static tree cp_parser_function_specifier_opt
2150 static tree cp_parser_type_specifier
2153 static tree cp_parser_simple_type_specifier
2155 static tree cp_parser_type_name
2157 static tree cp_parser_type_name
2159 static tree cp_parser_nonclass_name
2161 static tree cp_parser_elaborated_type_specifier
2163 static tree cp_parser_enum_specifier
2165 static void cp_parser_enumerator_list
2167 static void cp_parser_enumerator_definition
2169 static tree cp_parser_namespace_name
2171 static void cp_parser_namespace_definition
2173 static void cp_parser_namespace_body
2175 static tree cp_parser_qualified_namespace_specifier
2177 static void cp_parser_namespace_alias_definition
2179 static bool cp_parser_using_declaration
2181 static void cp_parser_using_directive
2183 static tree cp_parser_alias_declaration
2185 static void cp_parser_asm_definition
2187 static void cp_parser_linkage_specification
2189 static void cp_parser_static_assert
2191 static tree cp_parser_decltype
2193 static tree cp_parser_decomposition_declaration
2196 /* Declarators [gram.dcl.decl] */
2198 static tree cp_parser_init_declarator
2205 static enum tree_code cp_parser_ptr_operator
2207 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2209 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2211 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2213 static tree cp_parser_tx_qualifier_opt
2215 static tree cp_parser_late_return_type_opt
2217 static tree cp_parser_declarator_id
2219 static tree cp_parser_type_id
2221 static tree cp_parser_template_type_arg
2224 static tree cp_parser_type_id_1
2226 static void cp_parser_type_specifier_seq
2228 static tree cp_parser_parameter_declaration_clause
2230 static tree cp_parser_parameter_declaration_list
2234 static tree cp_parser_default_argument
2236 static void cp_parser_function_body
2238 static tree cp_parser_initializer
2240 static cp_expr cp_parser_initializer_clause
2242 static cp_expr cp_parser_braced_list
2247 static void cp_parser_ctor_initializer_opt_and_function_body
2250 static tree cp_parser_late_parsing_omp_declare_simd
2253 static tree cp_parser_late_parsing_oacc_routine
2256 static tree synthesize_implicit_template_parm
2258 static tree finish_fully_implicit_template
2260 static void abort_fully_implicit_template
2263 /* Classes [gram.class] */
2265 static tree cp_parser_class_name
2267 static tree cp_parser_class_specifier
2269 static tree cp_parser_class_head
2271 static enum tag_types cp_parser_class_key
2273 static void cp_parser_type_parameter_key
2275 static void cp_parser_member_specification_opt
2277 static void cp_parser_member_declaration
2279 static tree cp_parser_pure_specifier
2281 static tree cp_parser_constant_initializer
2284 /* Derived classes [gram.class.derived] */
2286 static tree cp_parser_base_clause
2288 static tree cp_parser_base_specifier
2291 /* Special member functions [gram.special] */
2293 static tree cp_parser_conversion_function_id
2295 static tree cp_parser_conversion_type_id
2299 static void cp_parser_ctor_initializer_opt
2301 static void cp_parser_mem_initializer_list
2303 static tree cp_parser_mem_initializer
2305 static tree cp_parser_mem_initializer_id
2308 /* Overloading [gram.over] */
2310 static cp_expr cp_parser_operator_function_id
2312 static cp_expr cp_parser_operator
2315 /* Templates [gram.temp] */
2317 static void cp_parser_template_declaration
2319 static tree cp_parser_template_parameter_list
2321 static tree cp_parser_template_parameter
2323 static tree cp_parser_type_parameter
2325 static tree cp_parser_template_id
2327 static tree cp_parser_template_name
2329 static tree cp_parser_template_argument_list
2331 static tree cp_parser_template_argument
2333 static void cp_parser_explicit_instantiation
2335 static void cp_parser_explicit_specialization
2338 /* Exception handling [gram.exception] */
2340 static tree cp_parser_try_block
2342 static void cp_parser_function_try_block
2344 static void cp_parser_handler_seq
2346 static void cp_parser_handler
2348 static tree cp_parser_exception_declaration
2350 static tree cp_parser_throw_expression
2352 static tree cp_parser_exception_specification_opt
2354 static tree cp_parser_type_id_list
2357 /* GNU Extensions */
2359 static tree cp_parser_asm_specification_opt
2361 static tree cp_parser_asm_operand_list
2363 static tree cp_parser_asm_clobber_list
2365 static tree cp_parser_asm_label_list
2367 static bool cp_next_tokens_can_be_attribute_p
2369 static bool cp_next_tokens_can_be_gnu_attribute_p
2371 static bool cp_next_tokens_can_be_std_attribute_p
2373 static bool cp_nth_tokens_can_be_std_attribute_p
2375 static bool cp_nth_tokens_can_be_gnu_attribute_p
2377 static bool cp_nth_tokens_can_be_attribute_p
2379 static tree cp_parser_attributes_opt
2381 static tree cp_parser_gnu_attributes_opt
2383 static tree cp_parser_gnu_attribute_list
2385 static tree cp_parser_std_attribute
2387 static tree cp_parser_std_attribute_spec
2389 static tree cp_parser_std_attribute_spec_seq
2391 static size_t cp_parser_skip_attributes_opt
2393 static bool cp_parser_extension_opt
2395 static void cp_parser_label_declaration
2398 /* Concept Extensions */
2400 static tree cp_parser_requires_clause
2402 static tree cp_parser_requires_clause_opt
2404 static tree cp_parser_requires_expression
2406 static tree cp_parser_requirement_parameter_list
2408 static tree cp_parser_requirement_body
2410 static tree cp_parser_requirement_list
2412 static tree cp_parser_requirement
2414 static tree cp_parser_simple_requirement
2416 static tree cp_parser_compound_requirement
2418 static tree cp_parser_type_requirement
2420 static tree cp_parser_nested_requirement
2423 /* Transactional Memory Extensions */
2425 static tree cp_parser_transaction
2427 static tree cp_parser_transaction_expression
2429 static void cp_parser_function_transaction
2431 static tree cp_parser_transaction_cancel
2435 pragma_external,
2436 pragma_member,
2437 pragma_objc_icode,
2438 pragma_stmt,
2439 pragma_compound
2440 };
2441 static bool cp_parser_pragma
2444 /* Objective-C++ Productions */
2446 static tree cp_parser_objc_message_receiver
2448 static tree cp_parser_objc_message_args
2450 static tree cp_parser_objc_message_expression
2452 static cp_expr cp_parser_objc_encode_expression
2454 static tree cp_parser_objc_defs_expression
2456 static tree cp_parser_objc_protocol_expression
2458 static tree cp_parser_objc_selector_expression
2460 static cp_expr cp_parser_objc_expression
2462 static bool cp_parser_objc_selector_p
2464 static tree cp_parser_objc_selector
2466 static tree cp_parser_objc_protocol_refs_opt
2468 static void cp_parser_objc_declaration
2470 static tree cp_parser_objc_statement
2472 static bool cp_parser_objc_valid_prefix_attributes
2474 static void cp_parser_objc_at_property_declaration
2476 static void cp_parser_objc_at_synthesize_declaration
2478 static void cp_parser_objc_at_dynamic_declaration
2480 static tree cp_parser_objc_struct_declaration
2483 /* Utility Routines */
2485 static cp_expr cp_parser_lookup_name
2487 static tree cp_parser_lookup_name_simple
2489 static tree cp_parser_maybe_treat_template_as_class
2491 static bool cp_parser_check_declarator_template_parameters
2493 static bool cp_parser_check_template_parameters
2495 static cp_expr cp_parser_simple_cast_expression
2497 static tree cp_parser_global_scope_opt
2499 static bool cp_parser_constructor_declarator_p
2501 static tree cp_parser_function_definition_from_specifiers_and_declarator
2503 static tree cp_parser_function_definition_after_declarator
2505 static bool cp_parser_template_declaration_after_export
2507 static void cp_parser_perform_template_parameter_access_checks
2509 static tree cp_parser_single_declaration
2511 static cp_expr cp_parser_functional_cast
2513 static tree cp_parser_save_member_function_body
2515 static tree cp_parser_save_nsdmi
2517 static tree cp_parser_enclosed_template_argument_list
2519 static void cp_parser_save_default_args
2521 static void cp_parser_late_parsing_for_member
2523 static tree cp_parser_late_parse_one_default_arg
2525 static void cp_parser_late_parsing_nsdmi
2527 static void cp_parser_late_parsing_default_args
2529 static tree cp_parser_sizeof_operand
2531 static cp_expr cp_parser_trait_expr
2533 static bool cp_parser_declares_only_class_p
2535 static void cp_parser_set_storage_class
2537 static void cp_parser_set_decl_spec_type
2539 static void set_and_check_decl_spec_loc
2542 static bool cp_parser_friend_p
2544 static void cp_parser_required_error
2550 static bool cp_parser_token_starts_function_definition_p
2552 static bool cp_parser_next_token_starts_class_definition_p
2554 static bool cp_parser_next_token_ends_template_argument_p
2556 static bool cp_parser_nth_token_starts_template_argument_list_p
2558 static enum tag_types cp_parser_token_is_class_key
2560 static enum tag_types cp_parser_token_is_type_parameter_key
2562 static void cp_parser_check_class_key
2564 static void cp_parser_check_access_in_redeclaration
2566 static bool cp_parser_optional_template_keyword
2568 static void cp_parser_pre_parsed_nested_name_specifier
2570 static bool cp_parser_cache_group
2572 static tree cp_parser_cache_defarg
2574 static void cp_parser_parse_tentatively
2576 static void cp_parser_commit_to_tentative_parse
2578 static void cp_parser_commit_to_topmost_tentative_parse
2580 static void cp_parser_abort_tentative_parse
2582 static bool cp_parser_parse_definitely
2586 static bool cp_parser_uncommitted_to_tentative_parse_p
2588 static void cp_parser_error
2590 static void cp_parser_name_lookup_error
2592 static bool cp_parser_simulate_error
2594 static bool cp_parser_check_type_definition
2596 static void cp_parser_check_for_definition_in_return_type
2598 static void cp_parser_check_for_invalid_template_id
2600 static bool cp_parser_non_integral_constant_expression
2602 static void cp_parser_diagnose_invalid_type_name
2604 static bool cp_parser_parse_and_diagnose_invalid_type_name
2606 static int cp_parser_skip_to_closing_parenthesis
2608 static void cp_parser_skip_to_end_of_statement
2610 static void cp_parser_consume_semicolon_at_end_of_statement
2612 static void cp_parser_skip_to_end_of_block_or_statement
2614 static bool cp_parser_skip_to_closing_brace
2616 static void cp_parser_skip_to_end_of_template_parameter_list
2618 static void cp_parser_skip_to_pragma_eol
2620 static bool cp_parser_error_occurred
2622 static bool cp_parser_allow_gnu_extensions_p
2624 static bool cp_parser_is_pure_string_literal
2626 static bool cp_parser_is_string_literal
2628 static bool cp_parser_is_keyword
2630 static tree cp_parser_make_typename_type
2634 static bool cp_parser_compound_literal_p
2636 static bool cp_parser_array_designator_p
2638 static bool cp_parser_init_statement_p
2640 static bool cp_parser_skip_to_closing_square_bracket
2643 /* Concept-related syntactic transformations */
2648 // -------------------------------------------------------------------------- //
2649 // Unevaluated Operand Guard
2650 //
2651 // Implementation of an RAII helper for unevaluated operand parsing.
2653 {
2656 }
2659 {
2662 }
2664 // -------------------------------------------------------------------------- //
2665 // Tentative Parsing
2667 /* Returns nonzero if we are parsing tentatively. */
2671 {
2673 }
2675 /* Returns nonzero if TOKEN is a string literal. */
2677 static bool
2679 {
2685 }
2687 /* Returns nonzero if TOKEN is a string literal
2688 of a user-defined string literal. */
2690 static bool
2692 {
2699 }
2701 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2703 static bool
2705 {
2707 }
2709 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2710 PRAGMA_NONE. */
2712 static enum pragma_kind
2714 {
2717 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2719 }
2721 /* Helper function for cp_parser_error.
2722 Having peeked a token of kind TOK1_KIND that might signify
2723 a conflict marker, peek successor tokens to determine
2724 if we actually do have a conflict marker.
2725 Specifically, we consider a run of 7 '<', '=' or '>' characters
2726 at the start of a line as a conflict marker.
2727 These come through the lexer as three pairs and a single,
2728 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2729 If it returns true, *OUT_LOC is written to with the location/range
2730 of the marker. */
2732 static bool
2735 {
2746 /* It must be at the start of the line. */
2751 /* We have a conflict marker. Construct a location of the form:
2752 <<<<<<<
2753 ^~~~~~~
2754 with start == caret, finishing at the end of the marker. */
2759 }
2761 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2762 RT_CLOSE_PAREN. */
2766 {
2768 {
2776 }
2777 }
2779 /* Attempt to convert TOKEN_DESC from a required_token to an
2780 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2782 static enum cpp_ttype
2784 {
2786 {
2807 /* Use CPP_EOF as a "no completions possible" code. */
2809 }
2810 }
2813 /* Subroutine of cp_parser_error and cp_parser_required_error.
2815 Issue a diagnostic of the form
2816 FILE:LINE: MESSAGE before TOKEN
2817 where TOKEN is the next token in the input stream. MESSAGE
2818 (specified by the caller) is usually of the form "expected
2819 OTHER-TOKEN".
2821 This bypasses the check for tentative passing, and potentially
2822 adds material needed by cp_parser_required_error.
2824 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2825 suggesting insertion of the missing token.
2827 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2828 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2829 location. */
2831 static void
2833 required_token missing_token_desc,
2834 location_t matching_location)
2835 {
2837 /* This diagnostic makes more sense if it is tagged to the line
2838 of the token we just peeked at. */
2842 {
2847 }
2849 /* If this is actually a conflict marker, report it as such. */
2853 {
2854 location_t loc;
2856 {
2859 /* Consume tokens until the end of the source line. */
2861 {
2871 }
2873 }
2874 }
2881 {
2882 /* Potentially supply a fix-it hint, suggesting to add the
2883 missing token immediately after the *previous* token.
2884 This may move the primary location within richloc. */
2886 location_t prev_token_loc
2890 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2891 Attempt to consolidate diagnostics by printing it as a
2892 secondary range within the main diagnostic. */
2894 added_matching_location
2896 }
2898 /* Actually emit the error. */
2900 /* Because c_parser_error does not understand
2901 CPP_KEYWORD, keywords are treated like
2902 identifiers. */
2907 {
2908 /* If we weren't able to consolidate matching_location, then
2909 print it as a secondary diagnostic. */
2914 }
2915 }
2917 /* If not parsing tentatively, issue a diagnostic of the form
2918 FILE:LINE: MESSAGE before TOKEN
2919 where TOKEN is the next token in the input stream. MESSAGE
2920 (specified by the caller) is usually of the form "expected
2921 OTHER-TOKEN". */
2923 static void
2925 {
2928 }
2930 /* Issue an error about name-lookup failing. NAME is the
2931 IDENTIFIER_NODE DECL is the result of
2932 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2933 the thing that we hoped to find. */
2935 static void
2937 tree name,
2938 tree decl,
2939 name_lookup_error desired,
2940 location_t location)
2941 {
2942 /* If name lookup completely failed, tell the user that NAME was not
2943 declared. */
2945 {
2958 else
2960 }
2962 {
2964 {
2981 }
2982 }
2984 {
2986 {
2996 name);
3000 }
3001 }
3002 else
3003 {
3005 {
3018 }
3019 }
3020 }
3022 /* If we are parsing tentatively, remember that an error has occurred
3023 during this tentative parse. Returns true if the error was
3024 simulated; false if a message should be issued by the caller. */
3026 static bool
3028 {
3030 {
3033 }
3035 }
3037 /* This function is called when a type is defined. If type
3038 definitions are forbidden at this point, an error message is
3039 issued. */
3041 static bool
3043 {
3044 /* If types are forbidden here, issue a message. */
3046 {
3047 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3048 in the message need to be interpreted. */
3051 }
3053 }
3055 /* This function is called when the DECLARATOR is processed. The TYPE
3056 was a type defined in the decl-specifiers. If it is invalid to
3057 define a type in the decl-specifiers for DECLARATOR, an error is
3058 issued. TYPE_LOCATION is the location of TYPE and is used
3059 for error reporting. */
3061 static void
3064 {
3065 /* [dcl.fct] forbids type definitions in return types.
3066 Unfortunately, it's not easy to know whether or not we are
3067 processing a return type until after the fact. */
3075 {
3080 type);
3081 }
3082 }
3084 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3085 "<" in any valid C++ program. If the next token is indeed "<",
3086 issue a message warning the user about what appears to be an
3087 invalid attempt to form a template-id. LOCATION is the location
3088 of the type-specifier (TYPE) */
3090 static void
3092 tree type,
3094 location_t location)
3095 {
3099 {
3105 {
3108 else
3110 }
3111 else
3113 /* Remember the location of the invalid "<". */
3116 /* Consume the "<". */
3118 /* Parse the template arguments. */
3120 /* Permanently remove the invalid template arguments so that
3121 this error message is not issued again. */
3124 }
3125 }
3127 /* If parsing an integral constant-expression, issue an error message
3128 about the fact that THING appeared and return true. Otherwise,
3129 return false. In either case, set
3130 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3132 static bool
3134 non_integral_constant thing)
3135 {
3138 {
3140 {
3143 {
3146 "ISO C++ forbids using a floating-point literal "
3151 "enumeration type cannot appear in a "
3242 }
3246 }
3247 }
3249 }
3251 /* Emit a diagnostic for an invalid type name. This function commits
3252 to the current active tentative parse, if any. (Otherwise, the
3253 problematic construct might be encountered again later, resulting
3254 in duplicate error messages.) LOCATION is the location of ID. */
3256 static void
3258 location_t location)
3259 {
3262 /* Try to lookup the identifier. */
3269 /* If the lookup was ambiguous, an error will already have
3270 been issued. */
3272 /* If the lookup found a template-name, it means that the user forgot
3273 to specify an argument list. Emit a useful error message. */
3275 {
3276 auto_diagnostic_group d;
3279 decl);
3284 }
3288 /* Something like 'unsigned A a;' */
3291 {
3292 /* Issue an error message. */
3293 auto_diagnostic_group d;
3294 name_hint hint;
3298 {
3304 }
3305 else
3307 /* If we're in a template class, it's possible that the user was
3308 referring to a type from a base class. For example:
3310 template <typename T> struct A { typedef T X; };
3311 template <typename T> struct B : public A<T> { X x; };
3313 The user should have said "typename A<T>::X". */
3329 {
3330 tree b;
3333 b;
3335 {
3339 {
3340 tree field;
3341 /* Go from a particular instantiation of the
3342 template (which will have an empty TYPE_FIELDs),
3343 to the main version. */
3346 field;
3350 {
3355 }
3358 }
3359 }
3360 }
3361 }
3362 /* Here we diagnose qualified-ids where the scope is actually correct,
3363 but the identifier does not resolve to a valid type name. */
3365 {
3367 {
3368 auto_diagnostic_group d;
3369 name_hint hint;
3378 {
3381 "%qE in namespace %qE does not name a template"
3384 else
3388 }
3390 {
3393 "%qE in namespace %qE does not name a template"
3396 else
3398 "%qE in namespace %qE does not name a template"
3401 }
3402 else
3403 {
3406 "%qE in namespace %qE does not name a type"
3409 else
3413 }
3416 }
3419 {
3420 /* A<T>::A<T>() */
3421 auto_diagnostic_group d;
3427 }
3430 {
3435 "need %<typename%> before %<%T::%D::%E%> because "
3439 id,
3442 else
3446 }
3448 {
3449 auto_diagnostic_group d;
3461 else
3467 }
3468 else
3470 }
3471 }
3473 /* Check for a common situation where a type-name should be present,
3474 but is not, and issue a sensible error message. Returns true if an
3475 invalid type-name was detected.
3477 The situation handled by this function are variable declarations of the
3478 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3479 Usually, `ID' should name a type, but if we got here it means that it
3480 does not. We try to emit the best possible error message depending on
3481 how exactly the id-expression looks like. */
3483 static bool
3485 {
3486 tree id;
3489 /* Avoid duplicate error about ambiguous lookup. */
3491 {
3495 }
3504 /* If the next token is a (, this is a function with no explicit return
3505 type, i.e. constructor, destructor or conversion op. */
3508 {
3511 }
3515 /* Emit a diagnostic for the invalid type. */
3517 out:
3518 /* If we aren't in the middle of a declarator (i.e. in a
3519 parameter-declaration-clause), skip to the end of the declaration;
3520 there's no point in trying to process it. */
3524 }
3526 /* Consume tokens up to, and including, the next non-nested closing `)'.
3527 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3528 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3529 found an unnested token of that type. */
3531 static int
3534 cpp_ttype or_ttype,
3536 {
3547 {
3550 /* Have we found what we're looking for before the closing paren? */
3556 {
3559 /* If we've run out of tokens, then there is no closing `)'. */
3562 /* This is good for lambda expression capture-lists. */
3572 /* This matches the processing in skip_to_end_of_statement. */
3592 {
3596 }
3606 condop_depth--;
3611 }
3613 /* Consume the token. */
3615 }
3616 }
3618 /* Consume tokens up to, and including, the next non-nested closing `)'.
3619 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3620 are doing error recovery. Returns -1 if OR_COMMA is true and we
3621 found an unnested token of that type. */
3623 static int
3628 {
3632 }
3634 /* Consume tokens until we reach the end of the current statement.
3635 Normally, that will be just before consuming a `;'. However, if a
3636 non-nested `}' comes first, then we stop before consuming that. */
3638 static void
3640 {
3643 /* Unwind generic function template scope if necessary. */
3648 {
3652 {
3655 /* If we've run out of tokens, stop. */
3659 /* If the next token is a `;', we have reached the end of the
3660 statement. */
3666 /* If this is a non-nested '}', stop before consuming it.
3667 That way, when confronted with something like:
3669 { 3 + }
3671 we stop before consuming the closing '}', even though we
3672 have not yet reached a `;'. */
3676 /* If it is the closing '}' for a block that we have
3677 scanned, stop -- but only after consuming the token.
3678 That way given:
3680 void f g () { ... }
3681 typedef int I;
3683 we will stop after the body of the erroneously declared
3684 function, but before consuming the following `typedef'
3685 declaration. */
3687 {
3690 }
3699 }
3701 /* Consume the token. */
3703 }
3704 }
3706 /* This function is called at the end of a statement or declaration.
3707 If the next token is a semicolon, it is consumed; otherwise, error
3708 recovery is attempted. */
3710 static void
3712 {
3713 /* Look for the trailing `;'. */
3715 {
3716 /* If there is additional (erroneous) input, skip to the end of
3717 the statement. */
3719 /* If the next token is now a `;', consume it. */
3722 }
3723 }
3725 /* Skip tokens until we have consumed an entire block, or until we
3726 have consumed a non-nested `;'. */
3728 static void
3730 {
3733 /* Unwind generic function template scope if necessary. */
3738 {
3742 {
3745 /* If we've run out of tokens, stop. */
3749 /* Stop if this is an unnested ';'. */
3755 /* Stop if this is an unnested '}', or closes the outermost
3756 nesting level. */
3757 nesting_depth--;
3765 /* Nest. */
3766 nesting_depth++;
3771 }
3773 /* Consume the token. */
3775 }
3776 }
3778 /* Skip tokens until a non-nested closing curly brace is the next
3779 token, or there are no more tokens. Return true in the first case,
3780 false otherwise. */
3782 static bool
3784 {
3788 {
3792 {
3795 /* If we've run out of tokens, stop. */
3799 /* If the next token is a non-nested `}', then we have reached
3800 the end of the current block. */
3806 /* If it the next token is a `{', then we are entering a new
3807 block. Consume the entire block. */
3813 }
3815 /* Consume the token. */
3817 }
3818 }
3820 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3821 parameter is the PRAGMA token, allowing us to purge the entire pragma
3822 sequence. */
3824 static void
3826 {
3831 do
3835 /* Ensure that the pragma is not parsed again. */
3837 }
3839 /* Require pragma end of line, resyncing with it as necessary. The
3840 arguments are as for cp_parser_skip_to_pragma_eol. */
3842 static void
3844 {
3848 }
3850 /* This is a simple wrapper around make_typename_type. When the id is
3851 an unresolved identifier node, we can provide a superior diagnostic
3852 using cp_parser_diagnose_invalid_type_name. */
3854 static tree
3856 location_t id_location)
3857 {
3858 tree result;
3860 {
3866 }
3868 }
3870 /* This is a wrapper around the
3871 make_{pointer,ptrmem,reference}_declarator functions that decides
3872 which one to call based on the CODE and CLASS_TYPE arguments. The
3873 CODE argument should be one of the values returned by
3874 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3875 appertain to the pointer or reference. */
3879 cp_cv_quals cv_qualifiers,
3881 tree attributes)
3882 {
3889 else
3899 }
3901 /* Create a new C++ parser. */
3905 {
3910 /* cp_lexer_new_main is called before doing GC allocation because
3911 cp_lexer_new_main might load a PCH file. */
3914 /* Initialize the binops_by_token so that we can get the tree
3915 directly from the token. */
3923 /* For now, we always accept GNU extensions. */
3926 /* The `>' token is a greater-than operator, not the end of a
3927 template-id. */
3932 /* We are not parsing a constant-expression. */
3937 /* Local variable names are not forbidden. */
3940 /* We are not processing an `extern "C"' declaration. */
3943 /* We are not processing a declarator. */
3946 /* We are not processing a template-argument-list. */
3949 /* We are not in an iteration statement. */
3952 /* We are not in a switch statement. */
3955 /* We are not parsing a type-id inside an expression. */
3958 /* String literals should be translated to the execution character set. */
3961 /* We are not parsing a function body. */
3964 /* We can correct until told otherwise. */
3967 /* The unparsed function queue is empty. */
3970 /* There are no classes being defined. */
3973 /* No template parameters apply. */
3976 /* Special parsing data structures. */
3980 /* Not declaring an implicit function template. */
3986 /* Allow constrained-type-specifiers. */
3989 /* We haven't yet seen an 'extern "C"'. */
3993 }
3995 /* Create a cp_lexer structure which will emit the tokens in CACHE
3996 and push it onto the parser's lexer stack. This is used for delayed
3997 parsing of in-class method bodies and default arguments, and should
3998 not be confused with tentative parsing. */
3999 static void
4001 {
4006 /* Move the current source position to that of the first token in the
4007 new lexer. */
4009 }
4011 /* Pop the top lexer off the parser stack. This is never used for the
4012 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
4013 static void
4015 {
4020 /* Put the current source position back where it was before this
4021 lexer was pushed. */
4023 }
4025 /* Lexical conventions [gram.lex] */
4027 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
4028 identifier. */
4030 static cp_expr
4032 {
4035 /* Look for the identifier. */
4037 /* Return the value. */
4040 else
4042 }
4044 /* Parse a sequence of adjacent string constants. Returns a
4045 TREE_STRING representing the combined, nul-terminated string
4046 constant. If TRANSLATE is true, translate the string to the
4047 execution character set. If WIDE_OK is true, a wide string is
4048 invalid here.
4050 C++98 [lex.string] says that if a narrow string literal token is
4051 adjacent to a wide string literal token, the behavior is undefined.
4052 However, C99 6.4.5p4 says that this results in a wide string literal.
4053 We follow C99 here, for consistency with the C front end.
4055 This code is largely lifted from lex_string() in c-lex.c.
4057 FUTURE: ObjC++ will need to handle @-strings here. */
4058 static cp_expr
4061 {
4062 tree value;
4070 tree string_tree;
4076 {
4079 }
4084 {
4088 }
4089 else
4090 {
4093 }
4096 /* Try to avoid the overhead of creating and destroying an obstack
4097 for the common case of just one string. */
4100 {
4108 {
4112 }
4113 else
4117 }
4118 else
4119 {
4125 do
4126 {
4128 count++;
4133 {
4136 {
4139 }
4142 {
4147 }
4149 }
4150 else
4154 {
4158 {
4162 "unsupported non-standard concatenation "
4164 }
4165 }
4174 {
4178 }
4179 else
4180 {
4184 }
4185 }
4188 /* A string literal built by concatenation has its caret=start at
4189 the start of the initial string, and its finish at the finish of
4190 the final string literal. */
4194 }
4197 {
4200 }
4204 {
4208 {
4212 }
4215 {
4230 }
4235 {
4240 else
4242 }
4243 }
4244 else
4245 /* cpp_interpret_string has issued an error. */
4249 {
4252 }
4255 }
4257 /* Look up a literal operator with the name and the exact arguments. */
4259 static tree
4261 {
4267 {
4271 {
4278 {
4288 }
4292 /* May be this should be sufficient_parms_p instead,
4293 depending on how exactly should user-defined literals
4294 work in presence of default arguments on the literal
4295 operator parameters. */
4298 }
4299 }
4302 }
4304 /* Parse a user-defined char constant. Returns a call to a user-defined
4305 literal operator taking the character as an argument. */
4307 static cp_expr
4309 {
4317 /* Build up a call to the user-defined operator */
4318 /* Lookup the name we got back from the id-expression. */
4323 {
4328 }
4332 }
4334 /* A subroutine of cp_parser_userdef_numeric_literal to
4335 create a char... template parameter pack from a string node. */
4337 static tree
4339 {
4340 tree charvec;
4346 /* Fill in CHARVEC with all of the parameters. */
4349 {
4358 }
4360 /* Build the argument packs. */
4366 }
4368 /* A subroutine of cp_parser_userdef_numeric_literal to
4369 create a char... template parameter pack from a string node. */
4371 static tree
4373 {
4374 tree charvec;
4385 /* First template parm is character type. */
4388 /* Fill in CHARVEC with all of the parameters. */
4395 /* Build the argument packs. */
4401 }
4403 /* Parse a user-defined numeric constant. returns a call to a user-defined
4404 literal operator. */
4406 static cp_expr
4408 {
4419 /* Look for a literal operator taking the exact type of numeric argument
4420 as the literal value. */
4425 {
4427 tf_warning_or_error);
4430 {
4433 long_long_unsigned_type_node);
4434 }
4435 else
4436 {
4440 long_double_type_node);
4444 }
4448 }
4451 /* If the numeric argument didn't work, look for a raw literal
4452 operator taking a const char* argument consisting of the number
4453 in string format. */
4458 {
4460 tf_warning_or_error);
4463 }
4466 /* If the raw literal didn't work, look for a non-type template
4467 function with parameter pack char.... Call the function with
4468 template parameter characters representing the number. */
4472 {
4475 {
4477 num_string);
4479 }
4482 tf_warning_or_error);
4485 }
4489 /* In C++14 the standard library defines complex number suffixes that
4490 conflict with GNU extensions. Prefer them if <complex> is #included. */
4500 {
4505 {
4506 /* No <complex>, so pedwarn and use GNU semantics. */
4509 }
4510 }
4512 bool complained
4519 {
4521 "(from <complex>) to enable the C++14 user-defined literal "
4526 }
4533 else
4534 {
4535 /* Use the built-in semantics. */
4536 tree type;
4538 {
4541 else
4543 }
4552 }
4555 /* Avoid repeated diagnostics. */
4558 }
4560 /* Parse a user-defined string constant. Returns a call to a user-defined
4561 literal operator taking a character pointer and the length of the string
4562 as arguments. */
4564 static tree
4566 {
4572 tree decl;
4574 /* Build up a call to the user-defined operator. */
4575 /* Lookup the name we got back from the id-expression. */
4576 releasing_vec rargs;
4584 tf_warning_or_error);
4586 /* Look for a suitable template function, either (C++20) with a single
4587 parameter of class type, or (N3599) with typename parameter CharT and
4588 parameter pack CharT... */
4592 {
4593 /* Use resolve_nondeduced_context to try to choose one form of template
4594 or the other. */
4601 else
4602 {
4607 }
4611 tf_warning_or_error);
4612 }
4617 }
4620 /* Basic concepts [gram.basic] */
4622 /* Parse a translation-unit.
4624 translation-unit:
4625 declaration-seq [opt] */
4627 static void
4629 {
4632 /* Create the declarator obstack. */
4634 /* Create the error declarator. */
4636 /* Create the empty parameter list. */
4638 UNKNOWN_LOCATION);
4639 /* Remember where the base of the declarator obstack lies. */
4645 {
4648 /* If we're entering or exiting a region that's implicitly
4649 extern "C", modify the lang context appropriately. */
4652 {
4656 else
4658 }
4664 {
4667 /* If the next token is now a `;', consume it. */
4670 }
4671 else
4673 }
4675 /* Get rid of the token array; we don't need it any more. */
4679 /* The EOF should have reset this. */
4682 /* Make sure the declarator obstack was fully cleaned up. */
4685 }
4687 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4688 decltype context. */
4692 {
4697 }
4699 /* We're about to parse a collection of statements. If we're currently
4700 parsing tentatively, set up a firewall so that any nested
4701 cp_parser_commit_to_tentative_parse won't affect the current context. */
4703 static cp_token_position
4705 {
4712 }
4714 /* We've finished parsing the collection of statements. Wrap up the
4715 firewall and replace the relevant tokens with the parsed form. */
4717 static void
4719 tree expr)
4720 {
4724 /* Finish the firewall level. */
4726 /* And remember the result of the parse for when we try again. */
4732 }
4734 /* Like the above functions, but let the user modify the tokens. Used by
4735 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4736 later parses, so it makes sense to localize the effects of
4737 cp_parser_commit_to_tentative_parse. */
4739 struct tentative_firewall
4740 {
4745 {
4746 /* If we're currently parsing tentatively, start a committed level as a
4747 firewall and then an inner tentative parse. */
4749 {
4753 }
4754 }
4757 {
4759 {
4760 /* Finish the inner tentative parse and the firewall, propagating any
4761 uncommitted error state to the outer tentative parse. */
4767 }
4768 }
4769 };
4771 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4772 This class is for tracking such a matching pair of symbols.
4773 In particular, it tracks the location of the first token,
4774 so that if the second token is missing, we can highlight the
4775 location of the first token when notifying the user about the
4776 problem. */
4779 class token_pair
4780 {
4782 /* token_pair's ctor. */
4785 /* If the next token is the opening symbol for this pair, consume it and
4786 return true.
4787 Otherwise, issue an error and return false.
4788 In either case, record the location of the opening token. */
4791 {
4795 }
4797 /* Consume the next token from PARSER, recording its location as
4798 that of the opening token within the pair. */
4801 {
4806 }
4808 /* If the next token is the closing symbol for this pair, consume it
4809 and return it.
4810 Otherwise, issue an error, highlighting the location of the
4811 corresponding opening token, and return NULL. */
4814 {
4817 m_open_loc);
4818 }
4821 location_t m_open_loc;
4822 };
4824 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4826 struct matching_paren_traits
4827 {
4832 };
4834 /* "matching_parens" is a token_pair<T> class for tracking matching
4835 pairs of parentheses. */
4839 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4841 struct matching_brace_traits
4842 {
4847 };
4849 /* "matching_braces" is a token_pair<T> class for tracking matching
4850 pairs of braces. */
4855 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4856 enclosing parentheses. */
4858 static cp_expr
4860 {
4863 /* Consume the '('. */
4865 matching_parens parens;
4867 /* Start the statement-expression. */
4869 /* Parse the compound-statement. */
4871 /* Finish up. */
4873 /* Consume the ')'. */
4881 }
4883 /* Expressions [gram.expr] */
4885 /* Parse a fold-operator.
4887 fold-operator:
4888 - * / % ^ & | = < > << >>
4889 = -= *= /= %= ^= &= |= <<= >>=
4890 == != <= >= && || , .* ->*
4892 This returns the tree code corresponding to the matched operator
4893 as an int. When the current token matches a compound assignment
4894 opertor, the resulting tree code is the negative value of the
4895 non-assignment operator. */
4897 static int
4899 {
4901 {
4941 }
4942 }
4944 /* Returns true if CODE indicates a binary expression, which is not allowed in
4945 the LHS of a fold-expression. More codes will need to be added to use this
4946 function in other contexts. */
4948 static bool
4950 {
4952 {
4985 }
4986 }
4988 /* If the next token is a suitable fold operator, consume it and return as
4989 the function above. */
4991 static int
4993 {
4999 }
5001 /* Parse a fold-expression.
5003 fold-expression:
5004 ( ... folding-operator cast-expression)
5005 ( cast-expression folding-operator ... )
5006 ( cast-expression folding operator ... folding-operator cast-expression)
5008 Note that the '(' and ')' are matched in primary expression. */
5010 static cp_expr
5012 {
5013 cp_id_kind pidk;
5015 // Left fold.
5017 {
5021 {
5024 }
5031 }
5036 {
5039 }
5042 {
5045 }
5048 /* The operands of a fold-expression are cast-expressions, so binary or
5049 conditional expressions are not allowed. We check this here to avoid
5050 tentative parsing. */
5062 // Right fold.
5067 {
5070 }
5073 // Binary left or right fold.
5078 }
5080 /* Parse a primary-expression.
5082 primary-expression:
5083 literal
5084 this
5085 ( expression )
5086 id-expression
5087 lambda-expression (C++11)
5089 GNU Extensions:
5091 primary-expression:
5092 ( compound-statement )
5093 __builtin_va_arg ( assignment-expression , type-id )
5094 __builtin_offsetof ( type-id , offsetof-expression )
5096 C++ Extensions:
5097 __has_nothrow_assign ( type-id )
5098 __has_nothrow_constructor ( type-id )
5099 __has_nothrow_copy ( type-id )
5100 __has_trivial_assign ( type-id )
5101 __has_trivial_constructor ( type-id )
5102 __has_trivial_copy ( type-id )
5103 __has_trivial_destructor ( type-id )
5104 __has_virtual_destructor ( type-id )
5105 __is_abstract ( type-id )
5106 __is_base_of ( type-id , type-id )
5107 __is_class ( type-id )
5108 __is_empty ( type-id )
5109 __is_enum ( type-id )
5110 __is_final ( type-id )
5111 __is_literal_type ( type-id )
5112 __is_pod ( type-id )
5113 __is_polymorphic ( type-id )
5114 __is_std_layout ( type-id )
5115 __is_trivial ( type-id )
5116 __is_union ( type-id )
5118 Objective-C++ Extension:
5120 primary-expression:
5121 objc-expression
5123 literal:
5124 __null
5126 ADDRESS_P is true iff this expression was immediately preceded by
5127 "&" and therefore might denote a pointer-to-member. CAST_P is true
5128 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5129 true iff this expression is a template argument.
5131 Returns a representation of the expression. Upon return, *IDK
5132 indicates what kind of id-expression (if any) was present. */
5134 static cp_expr
5141 {
5144 /* Assume the primary expression is not an id-expression. */
5147 /* Peek at the next token. */
5150 {
5151 /* literal:
5152 integer-literal
5153 character-literal
5154 floating-literal
5155 string-literal
5156 boolean-literal
5157 pointer-literal
5158 user-defined-literal */
5170 {
5174 }
5175 /* Floating-point literals are only allowed in an integral
5176 constant expression if they are cast to an integral or
5177 enumeration type. */
5181 {
5182 /* CAST_P will be set even in invalid code like "int(2.7 +
5183 ...)". Therefore, we have to check that the next token
5184 is sure to end the cast. */
5186 {
5191 enumerator-definition. */
5193 /* The curly brace at the end of an enum-specifier. */
5195 /* The end of a statement. */
5197 /* The end of the cast-expression. */
5199 /* The end of an array bound. */
5201 /* The closing ">" in a template-argument-list. */
5204 /* C++0x only: A ">>" treated like two ">" tokens,
5205 in a template-argument-list. */
5210 }
5212 /* If we are within a cast, then the constraint that the
5213 cast is to an integral or enumeration type will be
5214 checked at that point. If we are not within a cast, then
5215 this code is invalid. */
5218 }
5238 /* ??? Should wide strings be allowed when parser->translate_strings_p
5239 is false (i.e. in attributes)? If not, we can kill the third
5240 argument to cp_parser_string_literal. */
5246 /* If we see `( { ' then we are looking at the beginning of
5247 a GNU statement-expression. */
5250 {
5251 /* Statement-expressions are not allowed by the standard. */
5255 /* And they're not allowed outside of a function-body; you
5256 cannot, for example, write:
5258 int i = ({ int j = 3; j + 1; });
5260 at class or namespace scope. */
5263 {
5265 "statement-expressions are not allowed outside "
5271 }
5272 else
5274 }
5275 /* Otherwise it's a normal parenthesized expression. */
5276 {
5277 cp_expr expr;
5282 /* Consume the `('. */
5283 matching_parens parens;
5285 /* Within a parenthesized expression, a `>' token is always
5286 the greater-than operator. */
5287 saved_greater_than_is_operator_p
5292 /* Left fold expression. */
5294 else
5295 /* Parse the parenthesized expression. */
5300 {
5307 }
5308 else
5309 /* Let the front end know that this expression was
5310 enclosed in parentheses. This matters in case, for
5311 example, the expression is of the form `A::B', since
5312 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5313 not. */
5316 /* DR 705: Wrapping an unqualified name in parentheses
5317 suppresses arg-dependent lookup. We want to pass back
5318 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5319 (c++/37862), but none of the others. */
5323 /* The `>' token might be the end of a template-id or
5324 template-parameter-list now. */
5325 parser->greater_than_is_operator_p
5328 /* Consume the `)'. */
5337 }
5340 {
5342 {
5343 /* We might have an Objective-C++ message. */
5346 /* If that works out, we're done ... */
5349 /* ... else, fall though to see if it's a lambda. */
5350 }
5352 /* Don't warn about a failed tentative parse. */
5357 }
5361 /* We have an Objective-C++ string literal. */
5368 {
5369 /* These two are the boolean literals. */
5377 /* The `__null' literal. */
5382 /* The `nullptr' literal. */
5387 /* Recognize the `this' keyword. */
5391 {
5395 }
5396 /* Pointers cannot appear in constant-expressions. */
5401 /* The `operator' keyword can be the beginning of an
5402 id-expression. */
5409 {
5410 non_integral_constant name;
5412 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5413 __func__ are the names of variables -- but they are
5414 treated specially. Therefore, they are handled here,
5415 rather than relying on the generic id-expression logic
5416 below. Grammatically, these names are id-expressions.
5418 Consume the token. */
5422 {
5434 }
5439 /* Look up the name. */
5441 }
5444 {
5445 tree expression;
5446 tree type;
5447 location_t type_location;
5448 location_t start_loc
5450 /* The `__builtin_va_arg' construct is used to handle
5451 `va_arg'. Consume the `__builtin_va_arg' token. */
5453 /* Look for the opening `('. */
5454 matching_parens parens;
5456 /* Now, parse the assignment-expression. */
5458 /* Look for the `,'. */
5461 /* Parse the type-id. */
5462 {
5465 }
5466 /* Look for the closing `)'. */
5467 location_t finish_loc
5470 /* Using `va_arg' in a constant-expression is not
5471 allowed. */
5473 NIC_VA_ARG))
5475 /* Construct a location of the form:
5476 __builtin_va_arg (v, int)
5477 ~~~~~~~~~~~~~~~~~~~~~^~~~
5478 with the caret at the type, ranging from the start of the
5479 "__builtin_va_arg" token to the close paren. */
5480 location_t combined_loc
5483 }
5518 // C++ concepts
5522 /* Objective-C++ expressions. */
5532 {
5537 }
5538 /* FALLTHRU */
5542 }
5544 /* An id-expression can start with either an identifier, a
5545 `::' as the beginning of a qualified-id, or the "operator"
5546 keyword. */
5551 {
5552 id_expression:
5553 cp_expr id_expression;
5554 cp_expr decl;
5560 /* Parse the id-expression. */
5561 id_expression
5578 /* If we have a template-id, then no further lookup is
5579 required. If the template-id was for a template-class, we
5580 will sometimes have a TYPE_DECL at this point. */
5584 /* Look up the name. */
5585 else
5586 {
5587 tree ambiguous_decls;
5589 /* If we already know that this lookup is ambiguous, then
5590 we've already issued an error message; there's no reason
5591 to check again. */
5594 {
5597 }
5600 none_type,
5601 template_p,
5606 /* If the lookup was ambiguous, an error will already have
5607 been issued. */
5611 /* In Objective-C++, we may have an Objective-C 2.0
5612 dot-syntax for classes here. */
5617 {
5618 tree component;
5625 component);
5626 /* Build a location of the form:
5627 expr.component
5628 ~~~~~^~~~~~~~~
5629 with caret at the start of the component name (at
5630 input_location), ranging from the start of the id_expression
5631 to the end of the component name. */
5632 location_t combined_loc
5637 }
5639 /* In Objective-C++, an instance variable (ivar) may be preferred
5640 to whatever cp_parser_lookup_name() found.
5641 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5642 rest of c-family, we have to do a little extra work to preserve
5643 any location information in cp_expr "decl". Given that
5644 objc_lookup_ivar is implemented in "c-family" and "objc", we
5645 have a trip through the pure "tree" type, rather than cp_expr.
5646 Naively copying it back to "decl" would implicitly give the
5647 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5648 store an EXPR_LOCATION. Hence we only update "decl" (and
5649 hence its location_t) if we get back a different tree node. */
5651 id_expression);
5655 /* If name lookup gives us a SCOPE_REF, then the
5656 qualifying scope was dependent. */
5658 {
5659 /* At this point, we do not know if DECL is a valid
5660 integral constant expression. We assume that it is
5661 in fact such an expression, so that code like:
5663 template <int N> struct A {
5664 int a[B<N>::i];
5665 };
5667 is accepted. At template-instantiation time, we
5668 will check that B<N>::i is actually a constant. */
5670 }
5671 /* Check to see if DECL is a local variable in a context
5672 where that is forbidden. */
5675 {
5680 }
5681 }
5683 decl = (finish_id_expression
5685 idk,
5690 template_arg_p,
5697 }
5699 /* Anything else is an error. */
5703 }
5704 }
5712 {
5715 }
5717 /* Parse an id-expression.
5719 id-expression:
5720 unqualified-id
5721 qualified-id
5723 qualified-id:
5724 :: [opt] nested-name-specifier template [opt] unqualified-id
5725 :: identifier
5726 :: operator-function-id
5727 :: template-id
5729 Return a representation of the unqualified portion of the
5730 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5731 a `::' or nested-name-specifier.
5733 Often, if the id-expression was a qualified-id, the caller will
5734 want to make a SCOPE_REF to represent the qualified-id. This
5735 function does not do this in order to avoid wastefully creating
5736 SCOPE_REFs when they are not required.
5738 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5739 `template' keyword.
5741 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5742 uninstantiated templates.
5744 If *TEMPLATE_P is non-NULL, it is set to true iff the
5745 `template' keyword is used to explicitly indicate that the entity
5746 named is a template.
5748 If DECLARATOR_P is true, the id-expression is appearing as part of
5749 a declarator, rather than as part of an expression. */
5751 static cp_expr
5758 {
5762 /* Assume the `template' keyword was not used. */
5766 /* Look for the optional `::' operator. */
5767 global_scope_p
5768 = (!template_keyword_p
5773 /* Look for the optional nested-name-specifier. */
5774 nested_name_specifier_p
5777 check_dependency_p,
5779 declarator_p,
5780 template_keyword_p)
5783 /* If there is a nested-name-specifier, then we are looking at
5784 the first qualified-id production. */
5786 {
5787 tree saved_scope;
5788 tree saved_object_scope;
5789 tree saved_qualifying_scope;
5790 cp_expr unqualified_id;
5793 /* See if the next token is the `template' keyword. */
5797 /* Name lookup we do during the processing of the
5798 unqualified-id might obliterate SCOPE. */
5802 /* Process the final unqualified-id. */
5804 check_dependency_p,
5805 declarator_p,
5807 /* Restore the SAVED_SCOPE for our caller. */
5813 }
5814 /* Otherwise, if we are in global scope, then we are looking at one
5815 of the other qualified-id productions. */
5817 {
5819 tree id;
5821 /* Peek at the next token. */
5824 /* If it's an identifier, and the next token is not a "<", then
5825 we can avoid the template-id case. This is an optimization
5826 for this common case. */
5828 && !cp_parser_nth_token_starts_template_argument_list_p
5833 /* Try a template-id. */
5837 none_type,
5838 declarator_p);
5839 /* If that worked, we're done. */
5843 /* Peek at the next token. (Changes in the token buffer may
5844 have invalidated the pointer obtained above.) */
5848 {
5855 /* Fall through. */
5860 }
5861 }
5862 else
5865 declarator_p,
5866 optional_p);
5867 }
5869 /* Parse an unqualified-id.
5871 unqualified-id:
5872 identifier
5873 operator-function-id
5874 conversion-function-id
5875 ~ class-name
5876 template-id
5878 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5879 keyword, in a construct like `A::template ...'.
5881 Returns a representation of unqualified-id. For the `identifier'
5882 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5883 production a BIT_NOT_EXPR is returned; the operand of the
5884 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5885 other productions, see the documentation accompanying the
5886 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5887 names are looked up in uninstantiated templates. If DECLARATOR_P
5888 is true, the unqualified-id is appearing as part of a declarator,
5889 rather than as part of an expression. */
5891 static cp_expr
5897 {
5900 /* Peek at the next token. */
5904 {
5906 {
5907 tree id;
5909 /* We don't know yet whether or not this will be a
5910 template-id. */
5912 /* Try a template-id. */
5914 check_dependency_p,
5915 none_type,
5916 declarator_p);
5917 /* If it worked, we're done. */
5920 /* Otherwise, it's an ordinary identifier. */
5922 }
5926 check_dependency_p,
5927 none_type,
5928 declarator_p);
5931 {
5932 tree type_decl;
5933 tree qualifying_scope;
5934 tree object_scope;
5935 tree scope;
5938 /* Consume the `~' token. */
5940 /* Parse the class-name. The standard, as written, seems to
5941 say that:
5943 template <typename T> struct S { ~S (); };
5944 template <typename T> S<T>::~S() {}
5946 is invalid, since `~' must be followed by a class-name, but
5947 `S<T>' is dependent, and so not known to be a class.
5948 That's not right; we need to look in uninstantiated
5949 templates. A further complication arises from:
5951 template <typename T> void f(T t) {
5952 t.T::~T();
5953 }
5955 Here, it is not possible to look up `T' in the scope of `T'
5956 itself. We must look in both the current scope, and the
5957 scope of the containing complete expression.
5959 Yet another issue is:
5961 struct S {
5962 int S;
5963 ~S();
5964 };
5966 S::~S() {}
5968 The standard does not seem to say that the `S' in `~S'
5969 should refer to the type `S' and not the data member
5970 `S::S'. */
5972 /* DR 244 says that we look up the name after the "~" in the
5973 same scope as we looked up the qualifying name. That idea
5974 isn't fully worked out; it's more complicated than that. */
5979 /* Check for invalid scopes. */
5981 {
5985 }
5987 {
5991 scope);
5996 }
5999 /* If the name is of the form "X::~X" it's OK even if X is a
6000 typedef. */
6009 {
6012 }
6014 /* ~auto means the destructor of whatever the object is. */
6016 {
6019 "%<~auto%> only available with "
6023 }
6025 /* If there was an explicit qualification (S::~T), first look
6026 in the scope given by the qualification (i.e., S).
6028 Note: in the calls to cp_parser_class_name below we pass
6029 typename_type so that lookup finds the injected-class-name
6030 rather than the constructor. */
6034 {
6039 typename_type,
6042 declarator_p);
6045 }
6046 /* In "N::S::~S", look in "N" as well. */
6048 {
6053 type_decl
6057 typename_type,
6060 declarator_p);
6063 }
6064 /* In "p->S::~T", look in the scope given by "*p" as well. */
6066 {
6071 type_decl
6075 typename_type,
6078 declarator_p);
6081 }
6082 /* Look in the surrounding context. */
6084 {
6090 type_decl
6094 typename_type,
6097 declarator_p);
6100 {
6101 /* We couldn't find a type with this name. If we're parsing
6102 tentatively, fail and try something else. */
6104 {
6107 }
6108 /* Otherwise, accept it and check for a match at instantiation
6109 time. */
6114 }
6115 }
6116 /* If an error occurred, assume that the name of the
6117 destructor is the same as the name of the qualifying
6118 class. That allows us to keep parsing after running
6119 into ill-formed destructor names. */
6125 /* Check that destructor name and scope match. */
6127 {
6134 }
6136 /* [class.dtor]
6138 A typedef-name that names a class shall not be used as the
6139 identifier in the declarator for a destructor declaration. */
6146 type_decl);
6149 }
6153 {
6154 cp_expr id;
6156 /* This could be a template-id, so we try that first. */
6158 /* Try a template-id. */
6161 none_type,
6162 declarator_p);
6163 /* If that worked, we're done. */
6166 /* We still don't know whether we're looking at an
6167 operator-function-id or a conversion-function-id. */
6169 /* Try an operator-function-id. */
6171 /* If that didn't work, try a conversion-function-id. */
6176 }
6177 /* Fall through. */
6184 }
6185 }
6187 /* Parse an (optional) nested-name-specifier.
6189 nested-name-specifier: [C++98]
6190 class-or-namespace-name :: nested-name-specifier [opt]
6191 class-or-namespace-name :: template nested-name-specifier [opt]
6193 nested-name-specifier: [C++0x]
6194 type-name ::
6195 namespace-name ::
6196 nested-name-specifier identifier ::
6197 nested-name-specifier template [opt] simple-template-id ::
6199 PARSER->SCOPE should be set appropriately before this function is
6200 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6201 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6202 in name lookups.
6204 Sets PARSER->SCOPE to the class (TYPE) or namespace
6205 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6206 it unchanged if there is no nested-name-specifier. Returns the new
6207 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6209 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6210 part of a declaration and/or decl-specifier. */
6212 static tree
6219 {
6224 /* Remember where the nested-name-specifier starts. */
6226 {
6229 }
6232 {
6233 tree new_scope;
6234 tree old_scope;
6235 tree saved_qualifying_scope;
6237 /* Spot cases that cannot be the beginning of a
6238 nested-name-specifier. */
6241 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6242 the already parsed nested-name-specifier. */
6244 {
6245 /* Grab the nested-name-specifier and continue the loop. */
6247 /* If we originally encountered this nested-name-specifier
6248 with IS_DECLARATION set to false, we will not have
6249 resolved TYPENAME_TYPEs, so we must do so here. */
6252 {
6257 }
6260 }
6262 /* Spot cases that cannot be the beginning of a
6263 nested-name-specifier. On the second and subsequent times
6264 through the loop, we look for the `template' keyword. */
6266 ;
6267 /* A template-id can start a nested-name-specifier. */
6269 ;
6270 /* DR 743: decltype can be used in a nested-name-specifier. */
6272 ;
6273 else
6274 {
6275 /* If the next token is not an identifier, then it is
6276 definitely not a type-name or namespace-name. */
6279 /* If the following token is neither a `<' (to begin a
6280 template-id), nor a `::', then we are not looking at a
6281 nested-name-specifier. */
6287 {
6291 "found %<:%> in nested-name-specifier, "
6294 }
6297 && !cp_parser_nth_token_starts_template_argument_list_p
6300 }
6302 /* The nested-name-specifier is optional, so we parse
6303 tentatively. */
6306 /* Look for the optional `template' keyword, if this isn't the
6307 first time through the loop. */
6311 /* Save the old scope since the name lookup we are about to do
6312 might destroy it. */
6315 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6316 look up names in "X<T>::I" in order to determine that "Y" is
6317 a template. So, if we have a typename at this point, we make
6318 an effort to look through it. */
6320 && !typename_keyword_p
6325 /* Parse the qualifying entity. */
6326 new_scope
6328 typename_keyword_p,
6329 template_keyword_p,
6330 check_dependency_p,
6331 type_p,
6332 is_declaration);
6333 /* Look for the `::' token. */
6336 /* If we found what we wanted, we keep going; otherwise, we're
6337 done. */
6339 {
6342 /* Restore the OLD_SCOPE since it was valid before the
6343 failed attempt at finding the last
6344 class-or-namespace-name. */
6348 /* If the next token is a decltype, and the one after that is a
6349 `::', then the decltype has failed to resolve to a class or
6350 enumeration type. Give this error even when parsing
6351 tentatively since it can't possibly be valid--and we're going
6352 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6353 won't get another chance.*/
6357 {
6364 /* As below. */
6367 }
6371 {
6372 /* If we have a non-type template-id followed by ::, it can't
6373 possibly be valid. */
6378 {
6381 {
6387 }
6388 else
6389 {
6390 /* Variable template. */
6395 }
6402 /* As below. */
6406 }
6407 }
6411 /* If the next token is an identifier, and the one after
6412 that is a `::', then any valid interpretation would have
6413 found a class-or-namespace-name. */
6419 {
6422 {
6424 {
6425 tree decl;
6426 tree ambiguous_decls;
6429 none_type,
6438 decl);
6440 {
6441 // cp_parser_lookup_name has the same diagnostic,
6442 // thus make sure to emit it at most once.
6445 {
6450 }
6452 }
6453 else
6454 {
6456 cp_parser_name_lookup_error
6459 else
6460 cp_parser_name_lookup_error
6463 }
6464 }
6467 /* Treat this as a successful nested-name-specifier
6468 due to:
6470 [basic.lookup.qual]
6472 If the name found is not a class-name (clause
6473 _class_) or namespace-name (_namespace.def_), the
6474 program is ill-formed. */
6476 }
6478 }
6480 }
6481 /* We've found one valid nested-name-specifier. */
6483 /* Name lookup always gives us a DECL. */
6486 /* Uses of "template" must be followed by actual templates. */
6498 new_scope);
6499 /* If it is a class scope, try to complete it; we are about to
6500 be looking up names inside the class. */
6502 /* Since checking types for dependency can be expensive,
6503 avoid doing it if the type is already complete. */
6505 /* Do not try to complete dependent types. */
6507 {
6509 /* If it is a typedef to current class, use the current
6510 class instead, as the typedef won't have any names inside
6511 it yet. */
6515 }
6516 /* Make sure we look in the right scope the next time through
6517 the loop. */
6519 }
6521 /* If parsing tentatively, replace the sequence of tokens that makes
6522 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6523 token. That way, should we re-parse the token stream, we will
6524 not have to repeat the effort required to do the parse, nor will
6525 we issue duplicate error messages. */
6527 {
6531 /* Reset the contents of the START token. */
6533 /* Retrieve any deferred checks. Do not pop this access checks yet
6534 so the memory will not be reclaimed during token replacing below. */
6542 /* Purge all subsequent tokens. */
6544 }
6550 }
6552 /* Parse a nested-name-specifier. See
6553 cp_parser_nested_name_specifier_opt for details. This function
6554 behaves identically, except that it will an issue an error if no
6555 nested-name-specifier is present. */
6557 static tree
6563 {
6564 tree scope;
6566 /* Look for the nested-name-specifier. */
6568 typename_keyword_p,
6569 check_dependency_p,
6570 type_p,
6571 is_declaration);
6572 /* If it was not present, issue an error message. */
6574 {
6577 }
6580 }
6582 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6583 this is either a class-name or a namespace-name (which corresponds
6584 to the class-or-namespace-name production in the grammar). For
6585 C++0x, it can also be a type-name that refers to an enumeration
6586 type or a simple-template-id.
6588 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6589 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6590 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6591 TYPE_P is TRUE iff the next name should be taken as a class-name,
6592 even the same name is declared to be another entity in the same
6593 scope.
6595 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6596 specified by the class-or-namespace-name. If neither is found the
6597 ERROR_MARK_NODE is returned. */
6599 static tree
6606 {
6607 tree saved_scope;
6608 tree saved_qualifying_scope;
6609 tree saved_object_scope;
6610 tree scope;
6614 /* DR 743: decltype can appear in a nested-name-specifier. */
6616 {
6620 {
6623 }
6627 }
6629 /* Before we try to parse the class-name, we must save away the
6630 current PARSER->SCOPE since cp_parser_class_name will destroy
6631 it. */
6635 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6636 there is no need to look for a namespace-name. */
6637 only_class_p = template_keyword_p
6642 typename_keyword_p,
6643 template_keyword_p,
6645 check_dependency_p,
6647 is_declaration,
6650 /* If that didn't work, try for a namespace-name. */
6652 {
6653 /* Restore the saved scope. */
6657 /* If we are not looking at an identifier followed by the scope
6658 resolution operator, then this is not part of a
6659 nested-name-specifier. (Note that this function is only used
6660 to parse the components of a nested-name-specifier.) */
6665 }
6668 }
6670 /* Return true if we are looking at a compound-literal, false otherwise. */
6672 static bool
6674 {
6677 /* Skip tokens until the next token is a closing parenthesis.
6678 If we find the closing `)', and the next token is a `{', then
6679 we are looking at a compound-literal. */
6680 bool compound_literal_p
6685 /* Roll back the tokens we skipped. */
6689 }
6691 /* Return true if EXPR is the integer constant zero or a complex constant
6692 of zero, without any folding, but ignoring location wrappers. */
6694 bool
6696 {
6699 }
6701 /* Parse a postfix-expression.
6703 postfix-expression:
6704 primary-expression
6705 postfix-expression [ expression ]
6706 postfix-expression ( expression-list [opt] )
6707 simple-type-specifier ( expression-list [opt] )
6708 typename :: [opt] nested-name-specifier identifier
6709 ( expression-list [opt] )
6710 typename :: [opt] nested-name-specifier template [opt] template-id
6711 ( expression-list [opt] )
6712 postfix-expression . template [opt] id-expression
6713 postfix-expression -> template [opt] id-expression
6714 postfix-expression . pseudo-destructor-name
6715 postfix-expression -> pseudo-destructor-name
6716 postfix-expression ++
6717 postfix-expression --
6718 dynamic_cast < type-id > ( expression )
6719 static_cast < type-id > ( expression )
6720 reinterpret_cast < type-id > ( expression )
6721 const_cast < type-id > ( expression )
6722 typeid ( expression )
6723 typeid ( type-id )
6725 GNU Extension:
6727 postfix-expression:
6728 ( type-id ) { initializer-list , [opt] }
6730 This extension is a GNU version of the C99 compound-literal
6731 construct. (The C99 grammar uses `type-name' instead of `type-id',
6732 but they are essentially the same concept.)
6734 If ADDRESS_P is true, the postfix expression is the operand of the
6735 `&' operator. CAST_P is true if this expression is the target of a
6736 cast.
6738 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6739 class member access expressions [expr.ref].
6741 Returns a representation of the expression. */
6743 static cp_expr
6747 {
6749 location_t loc;
6755 /* Peek at the next token. */
6760 /* Some of the productions are determined by keywords. */
6763 {
6768 {
6769 tree type;
6770 cp_expr expression;
6774 /* All of these can be handled in the same way from the point
6775 of view of parsing. Begin by consuming the token
6776 identifying the cast. */
6779 /* New types cannot be defined in the cast. */
6781 parser->type_definition_forbidden_message
6784 /* Look for the opening `<'. */
6786 /* Parse the type to which we are casting. */
6791 /* Look for the closing `>'. */
6793 /* Restore the old message. */
6796 bool saved_greater_than_is_operator_p
6800 /* And the expression which is being cast. */
6801 matching_parens parens;
6805 RT_CLOSE_PAREN);
6809 parser->greater_than_is_operator_p
6812 /* Only type conversions to integral or enumeration types
6813 can be used in constant-expressions. */
6816 {
6819 }
6822 {
6824 postfix_expression
6828 postfix_expression
6832 postfix_expression
6834 tf_warning_or_error);
6837 postfix_expression
6842 }
6844 /* Construct a location e.g. :
6845 reinterpret_cast <int *> (expr)
6846 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6847 ranging from the start of the "*_cast" token to the final closing
6848 paren, with the caret at the start. */
6851 }
6855 {
6856 tree type;
6860 /* Consume the `typeid' token. */
6862 /* Look for the `(' token. */
6863 matching_parens parens;
6865 /* Types cannot be defined in a `typeid' expression. */
6867 parser->type_definition_forbidden_message
6869 /* We can't be sure yet whether we're looking at a type-id or an
6870 expression. */
6872 /* Try a type-id first. */
6877 /* Look for the `)' token. Otherwise, we can't be sure that
6878 we're not looking at an expression: consider `typeid (int
6879 (3))', for example. */
6881 /* If all went well, simply lookup the type-id. */
6884 /* Otherwise, fall back to the expression variant. */
6885 else
6886 {
6887 tree expression;
6889 /* Look for an expression. */
6891 /* Compute its typeid. */
6893 /* Look for the `)' token. */
6895 }
6896 /* Restore the saved message. */
6898 /* `typeid' may not appear in an integral constant expression. */
6902 /* Construct a location e.g. :
6903 typeid (expr)
6904 ^~~~~~~~~~~~~
6905 ranging from the start of the "typeid" token to the final closing
6906 paren, with the caret at the start. */
6908 {
6909 location_t typeid_loc
6913 }
6914 }
6918 {
6919 tree type;
6920 /* The syntax permitted here is the same permitted for an
6921 elaborated-type-specifier. */
6928 }
6934 {
6937 tree p;
6944 {
6947 }
6953 {
6956 postfix_expression
6958 else
6959 {
6963 }
6969 tf_warning_or_error);
6970 else
6971 {
6975 }
6980 postfix_expression
6984 postfix_expression
6987 else
6988 {
6992 }
6997 }
6999 }
7002 {
7003 tree type;
7005 /* If the next thing is a simple-type-specifier, we may be
7006 looking at a functional cast. We could also be looking at
7007 an id-expression. So, we try the functional cast, and if
7008 that doesn't work we fall back to the primary-expression. */
7010 /* Look for the simple-type-specifier. */
7014 CP_PARSER_FLAGS_NONE);
7016 /* Parse the cast itself. */
7018 postfix_expression
7020 /* If that worked, we're done. */
7024 /* If the functional-cast didn't work out, try a
7025 compound-literal. */
7028 {
7033 matching_parens parens;
7036 /* Avoid calling cp_parser_type_id pointlessly, see comment
7037 in cp_parser_cast_expression about c++/29234. */
7040 else
7041 {
7042 /* Parse the type. */
7048 }
7050 /* If things aren't going well, there's no need to
7051 keep going. */
7053 {
7055 /* Parse the brace-enclosed initializer list. */
7058 }
7059 /* If that worked, we're definitely looking at a
7060 compound-literal expression. */
7062 {
7063 /* Warn the user that a compound literal is not
7064 allowed in standard C++. */
7067 /* For simplicity, we disallow compound literals in
7068 constant-expressions. We could
7069 allow compound literals of integer type, whose
7070 initializer was a constant, in constant
7071 expressions. Permitting that usage, as a further
7072 extension, would not change the meaning of any
7073 currently accepted programs. (Of course, as
7074 compound literals are not part of ISO C++, the
7075 standard has nothing to say.) */
7077 NIC_NCC))
7078 {
7081 }
7082 /* Form the representation of the compound-literal. */
7083 postfix_expression
7088 }
7089 }
7091 /* It must be a primary-expression. */
7092 postfix_expression
7095 decltype_p,
7097 }
7099 }
7101 /* Note that we don't need to worry about calling build_cplus_new on a
7102 class-valued CALL_EXPR in decltype when it isn't the end of the
7103 postfix-expression; unary_complex_lvalue will take care of that for
7104 all these cases. */
7106 /* Keep looping until the postfix-expression is complete. */
7108 {
7112 /* It is not a Koenig lookup function call. */
7113 postfix_expression
7116 /* Peek at the next token. */
7120 {
7123 {
7125 "two consecutive %<[%> shall "
7128 }
7129 postfix_expression
7131 postfix_expression,
7133 decltype_p);
7142 /* postfix-expression ( expression-list [opt] ) */
7143 {
7154 is_builtin_constant_p
7157 {
7158 /* The whole point of __builtin_constant_p is to allow
7159 non-constant expressions to appear as arguments. */
7160 saved_integral_constant_expression_p
7162 saved_non_integral_constant_expression_p
7165 }
7166 args = (cp_parser_parenthesized_expression_list
7173 {
7174 parser->integral_constant_expression_p
7176 parser->non_integral_constant_expression_p
7178 }
7181 {
7184 }
7186 /* Function calls are not permitted in
7187 constant-expressions. */
7190 NIC_FUNC_CALL))
7191 {
7195 }
7200 {
7202 /* In C++2A, we may need to perform ADL for a template
7203 name. */
7206 {
7208 {
7211 postfix_expression
7213 complain);
7214 }
7215 else
7216 postfix_expression
7218 }
7219 /* We do not perform argument-dependent lookup if
7220 normal lookup finds a non-function, in accordance
7221 with the expected resolution of DR 218. */
7224 {
7228 /* Do not do argument dependent lookup if regular
7229 lookup finds a member function or a block-scope
7230 function declaration. [basic.lookup.argdep]/3 */
7233 {
7236 postfix_expression
7238 complain);
7239 }
7240 }
7241 }
7244 {
7254 {
7256 postfix_expression
7260 }
7263 {
7264 postfix_expression
7265 = (build_new_method_call
7271 complain));
7272 }
7273 else
7274 postfix_expression
7278 complain);
7279 }
7283 postfix_expression = (build_offset_ref_call_from_tree
7285 complain));
7287 /* A call to a static class member, or a namespace-scope
7288 function. */
7289 postfix_expression
7292 koenig_p,
7293 complain);
7294 else
7295 /* All other function calls. */
7296 postfix_expression
7299 koenig_p,
7300 complain);
7303 {
7305 start_loc,
7306 close_paren_loc);
7308 }
7310 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7314 }
7319 /* postfix-expression . template [opt] id-expression
7320 postfix-expression . pseudo-destructor-name
7321 postfix-expression -> template [opt] id-expression
7322 postfix-expression -> pseudo-destructor-name */
7324 /* Consume the `.' or `->' operator. */
7327 postfix_expression
7329 postfix_expression,
7336 /* postfix-expression ++ */
7337 /* Consume the `++' token. */
7339 /* Generate a representation for the complete expression. */
7340 postfix_expression
7342 POSTINCREMENT_EXPR);
7343 /* Increments may not appear in constant-expressions. */
7351 /* postfix-expression -- */
7352 /* Consume the `--' token. */
7354 /* Generate a representation for the complete expression. */
7355 postfix_expression
7357 POSTDECREMENT_EXPR);
7358 /* Decrements may not appear in constant-expressions. */
7369 return is_member_access
7370 ? postfix_expression
7372 else
7374 }
7375 }
7377 /* We should never get here. */
7380 }
7382 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7383 by cp_parser_builtin_offsetof. We're looking for
7385 postfix-expression [ expression ]
7386 postfix-expression [ braced-init-list ] (C++11)
7388 FOR_OFFSETOF is set if we're being called in that context, which
7389 changes how we deal with integer constant expressions. */
7391 static tree
7393 tree postfix_expression,
7396 {
7401 /* Consume the `[' token. */
7407 /* Parse the index expression. */
7408 /* ??? For offsetof, there is a question of what to allow here. If
7409 offsetof is not being used in an integral constant expression context,
7410 then we *could* get the right answer by computing the value at runtime.
7411 If we are in an integral constant expression context, then we might
7412 could accept any constant expression; hard to say without analysis.
7413 Rather than open the barn door too wide right away, allow only integer
7414 constant expressions here. */
7417 else
7418 {
7420 {
7425 }
7426 else
7428 }
7432 /* Look for the closing `]'. */
7435 /* Build the ARRAY_REF. */
7439 /* When not doing offsetof, array references are not permitted in
7440 constant-expressions. */
7446 }
7448 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7449 dereference of incomplete type, returns true if error_mark_node should
7450 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7451 and *DEPENDENT_P. */
7453 bool
7456 {
7457 /* In a template, be permissive by treating an object expression
7458 of incomplete type as dependent (after a pedwarn). */
7459 diagnostic_t kind = (processing_template_decl
7463 {
7475 /* Don't emit any diagnostic for OVERLOADs. */
7479 /* Avoid clobbering e.g. DECLs. */
7483 }
7495 {
7498 }
7500 }
7502 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7503 by cp_parser_builtin_offsetof. We're looking for
7505 postfix-expression . template [opt] id-expression
7506 postfix-expression . pseudo-destructor-name
7507 postfix-expression -> template [opt] id-expression
7508 postfix-expression -> pseudo-destructor-name
7510 FOR_OFFSETOF is set if we're being called in that context. That sorta
7511 limits what of the above we'll actually accept, but nevermind.
7512 TOKEN_TYPE is the "." or "->" token, which will already have been
7513 removed from the stream. */
7515 static tree
7518 cp_expr postfix_expression,
7520 location_t location)
7521 {
7522 tree name;
7528 /* If this is a `->' operator, dereference the pointer. */
7531 tf_warning_or_error);
7532 /* Check to see whether or not the expression is type-dependent and
7533 not the current instantiation. */
7535 /* The identifier following the `->' or `.' is not qualified. */
7541 /* Enter the scope corresponding to the type of the object
7542 given by the POSTFIX_EXPRESSION. */
7544 {
7546 /* According to the standard, no expression should ever have
7547 reference type. Unfortunately, we do not currently match
7548 the standard in this respect in that our internal representation
7549 of an expression may have reference type even when the standard
7550 says it does not. Therefore, we have to manually obtain the
7551 underlying type here. */
7553 /* The type of the POSTFIX_EXPRESSION must be complete. */
7554 /* Unlike the object expression in other contexts, *this is not
7555 required to be of complete type for purposes of class member
7556 access (5.2.5) outside the member function body. */
7560 {
7566 }
7569 {
7570 /* Let the name lookup machinery know that we are processing a
7571 class member access expression. */
7573 /* If something went wrong, we want to be able to discern that case,
7574 as opposed to the case where there was no SCOPE due to the type
7575 of expression being dependent. */
7578 /* If the SCOPE was erroneous, make the various semantic analysis
7579 functions exit quickly -- and without issuing additional error
7580 messages. */
7583 }
7584 }
7587 /* Tell cp_parser_lookup_name that there was an object, even though it's
7588 type-dependent. */
7591 /* Assume this expression is not a pseudo-destructor access. */
7594 /* If the SCOPE is a scalar type, then, if this is a valid program,
7595 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7596 is type dependent, it can be pseudo-destructor-name or something else.
7597 Try to parse it as pseudo-destructor-name first. */
7599 {
7600 tree s;
7601 tree type;
7604 /* Parse the pseudo-destructor-name. */
7613 {
7615 postfix_expression
7618 }
7619 }
7622 {
7623 /* If the SCOPE is not a scalar type, we are looking at an
7624 ordinary class member access expression, rather than a
7625 pseudo-destructor-name. */
7628 /* Parse the id-expression. */
7629 name = (cp_parser_id_expression
7636 /* In general, build a SCOPE_REF if the member name is qualified.
7637 However, if the name was not dependent and has already been
7638 resolved; there is no need to build the SCOPE_REF. For example;
7640 struct X { void f(); };
7641 template <typename T> void f(T* t) { t->X::f(); }
7643 Even though "t" is dependent, "X::f" is not and has been resolved
7644 to a BASELINK; there is no need to include scope information. */
7646 /* But we do need to remember that there was an explicit scope for
7647 virtual function calls. */
7651 /* If the name is a template-id that names a type, we will get a
7652 TYPE_DECL here. That is invalid code. */
7654 {
7657 }
7658 else
7659 {
7661 {
7663 {
7667 }
7668 else
7671 name,
7672 template_p);
7676 }
7678 adjust_result_of_qualified_name_lookup
7680 postfix_expression
7682 template_p,
7683 tf_warning_or_error);
7684 /* Build a location e.g.:
7685 ptr->access_expr
7686 ~~~^~~~~~~~~~~~~
7687 where the caret is at the deref token, ranging from
7688 the start of postfix_expression to the end of the access expr. */
7689 location_t end_loc
7691 location_t combined_loc
7694 }
7695 }
7697 /* We no longer need to look up names in the scope of the object on
7698 the left-hand side of the `.' or `->' operator. */
7701 /* Outside of offsetof, these operators may not appear in
7702 constant-expressions. */
7704 && (cp_parser_non_integral_constant_expression
7709 }
7711 /* Parse a parenthesized expression-list.
7713 expression-list:
7714 assignment-expression
7715 expression-list, assignment-expression
7717 attribute-list:
7718 expression-list
7719 identifier
7720 identifier, expression-list
7722 CAST_P is true if this expression is the target of a cast.
7724 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7725 argument pack.
7727 WRAP_LOCATIONS_P is true if expressions within this list for which
7728 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7729 their source locations.
7731 Returns a vector of trees. Each element is a representation of an
7732 assignment-expression. NULL is returned if the ( and or ) are
7733 missing. An empty, but allocated, vector is returned on no
7734 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7735 if we are parsing an attribute list for an attribute that wants a
7736 plain identifier argument, normal_attr for an attribute that wants
7737 an expression, or non_attr if we aren't parsing an attribute list. If
7738 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7739 not all of the expressions in the list were constant.
7740 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7741 will be written to with the location of the closing parenthesis. If
7742 an error occurs, it may or may not be written to. */
7752 {
7758 /* Assume all the expressions will be constant. */
7762 matching_parens parens;
7768 /* Within a parenthesized expression, a `>' token is always
7769 the greater-than operator. */
7770 saved_greater_than_is_operator_p
7776 /* Consume expressions until there are no more. */
7779 {
7780 /* At the beginning of attribute lists, check to see if the
7781 next token is an identifier. */
7784 {
7787 /* Consume the identifier. */
7789 /* Save the identifier. */
7791 }
7792 else
7793 {
7796 /* Parse the next assignment-expression. */
7798 {
7799 /* A braced-init-list. */
7805 }
7807 {
7808 expr = (cp_parser_constant_expression
7813 }
7814 else
7816 cast_p);
7821 /* If we have an ellipsis, then this is an expression
7822 expansion. */
7825 {
7826 /* Consume the `...'. */
7829 /* Build the argument pack. */
7831 }
7836 /* Add it to the list. We add error_mark_node
7837 expressions to the list, so that we can still tell if
7838 the correct form for a parenthesized expression-list
7839 is found. That gives better errors. */
7844 }
7846 /* After the first item, attribute lists look the same as
7847 expression lists. */
7850 get_comma:;
7851 /* If the next token isn't a `,', then we are done. */
7855 /* Otherwise, consume the `,' and keep going. */
7857 }
7863 {
7866 skip_comma:;
7867 /* We try and resync to an unnested comma, as that will give the
7868 user better diagnostics. */
7876 {
7877 parser->greater_than_is_operator_p
7880 }
7881 }
7883 parser->greater_than_is_operator_p
7890 }
7892 /* Parse a pseudo-destructor-name.
7894 pseudo-destructor-name:
7895 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7896 :: [opt] nested-name-specifier template template-id :: ~ type-name
7897 :: [opt] nested-name-specifier [opt] ~ type-name
7899 If either of the first two productions is used, sets *SCOPE to the
7900 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7901 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7902 or ERROR_MARK_NODE if the parse fails. */
7904 static void
7906 tree object,
7909 {
7912 /* Handle ~auto. */
7916 {
7919 "%<~auto%> only available with "
7926 }
7928 /* Assume that things will not work out. */
7931 /* Look for the optional `::' operator. */
7933 /* Look for the optional nested-name-specifier. */
7934 nested_name_specifier_p
7941 /* Now, if we saw a nested-name-specifier, we might be doing the
7942 second production. */
7945 {
7946 /* Consume the `template' keyword. */
7948 /* Parse the template-id. */
7952 class_type,
7954 /* Look for the `::' token. */
7956 }
7957 /* If the next token is not a `~', then there might be some
7958 additional qualification. */
7960 {
7961 /* At this point, we're looking for "type-name :: ~". The type-name
7962 must not be a class-name, since this is a pseudo-destructor. So,
7963 it must be either an enum-name, or a typedef-name -- both of which
7964 are just identifiers. So, we peek ahead to check that the "::"
7965 and "~" tokens are present; if they are not, then we can avoid
7966 calling type_name. */
7970 {
7973 }
7975 /* Look for the type-name. */
7980 /* Look for the `::' token. */
7982 }
7983 else
7986 /* Look for the `~'. */
7989 /* Once we see the ~, this has to be a pseudo-destructor. */
7993 /* Look for the type-name again. We are not responsible for
7994 checking that it matches the first type-name. */
7996 }
7998 /* Parse a unary-expression.
8000 unary-expression:
8001 postfix-expression
8002 ++ cast-expression
8003 -- cast-expression
8004 unary-operator cast-expression
8005 sizeof unary-expression
8006 sizeof ( type-id )
8007 alignof ( type-id ) [C++0x]
8008 new-expression
8009 delete-expression
8011 GNU Extensions:
8013 unary-expression:
8014 __extension__ cast-expression
8015 __alignof__ unary-expression
8016 __alignof__ ( type-id )
8017 alignof unary-expression [C++0x]
8018 __real__ cast-expression
8019 __imag__ cast-expression
8020 && identifier
8021 sizeof ( type-id ) { initializer-list , [opt] }
8022 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
8023 __alignof__ ( type-id ) { initializer-list , [opt] }
8025 ADDRESS_P is true iff the unary-expression is appearing as the
8026 operand of the `&' operator. CAST_P is true if this expression is
8027 the target of a cast.
8029 Returns a representation of the expression. */
8031 static cp_expr
8034 {
8038 /* Peek at the next token. */
8040 /* Some keywords give away the kind of expression. */
8042 {
8046 {
8049 {
8057 /* Consume the token. */
8059 /* Parse the operand. */
8065 else
8066 {
8067 /* ISO C++ defines alignof only with types, not with
8068 expressions. So pedwarn if alignof is used with a non-
8069 type expression. However, __alignof__ is ok. */
8072 "ISO C++ does not allow %<alignof%> "
8076 }
8077 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8078 SIZEOF_EXPR with the original operand. */
8080 {
8082 {
8084 {
8087 error_mark_node));
8089 }
8090 else
8094 }
8095 }
8097 /* Construct a location e.g. :
8098 alignof (expr)
8099 ^~~~~~~~~~~~~~
8100 with start == caret at the start of the "alignof"/"sizeof"
8101 token, with the endpoint at the final closing paren. */
8102 location_t finish_loc
8104 location_t compound_loc
8111 }
8120 {
8121 /* The saved value of the PEDANTIC flag. */
8123 tree expr;
8125 /* Save away the PEDANTIC flag. */
8127 /* Parse the cast-expression. */
8129 /* Restore the PEDANTIC flag. */
8133 }
8137 {
8138 tree expression;
8140 /* Consume the `__real__' or `__imag__' token. */
8142 /* Parse the cast-expression. */
8144 /* Create the complete representation. */
8148 expression,
8149 tf_warning_or_error);
8150 }
8158 {
8159 tree expr;
8168 matching_parens parens;
8172 parser->type_definition_forbidden_message
8175 saved_integral_constant_expression_p
8177 saved_non_integral_constant_expression_p
8181 saved_greater_than_is_operator_p
8193 parser->greater_than_is_operator_p
8196 parser->integral_constant_expression_p
8198 parser->non_integral_constant_expression_p
8203 location_t finish_loc
8207 /* Construct a location of the form:
8208 noexcept (expr)
8209 ^~~~~~~~~~~~~~~
8210 with start == caret, finishing at the close-paren. */
8211 location_t noexcept_loc
8215 noexcept_loc);
8216 }
8220 }
8221 }
8223 /* Look for the `:: new' and `:: delete', which also signal the
8224 beginning of a new-expression, or delete-expression,
8225 respectively. If the next token is `::', then it might be one of
8226 these. */
8228 {
8231 /* See if the token after the `::' is one of the keywords in
8232 which we're interested. */
8234 /* If it's `new', we have a new-expression. */
8237 /* Similarly, for `delete'. */
8240 }
8242 /* Look for a unary operator. */
8244 /* The `++' and `--' operators can be handled similarly, even though
8245 they are not technically unary-operators in the grammar. */
8247 {
8252 /* Handle the GNU address-of-label extension. */
8255 {
8256 tree identifier;
8257 tree expression;
8260 /* Consume the '&&' token. */
8262 /* Look for the identifier. */
8263 location_t finish_loc
8266 /* Construct a location of the form:
8267 &&label
8268 ^~~~~~~
8269 with caret==start at the "&&", finish at the end of the label. */
8270 location_t combined_loc
8272 /* Create an expression representing the address. */
8275 NIC_ADDR_LABEL))
8278 }
8279 }
8281 {
8282 cp_expr cast_expression;
8288 /* Consume the operator token. */
8292 /* Parse the cast-expression. */
8293 cast_expression
8298 pidk);
8300 /* Make a location:
8301 OP_TOKEN CAST_EXPRESSION
8302 ^~~~~~~~~~~~~~~~~~~~~~~~~
8303 with start==caret at the operator token, and
8304 extending to the end of the cast_expression. */
8307 /* Now, build an appropriate representation. */
8309 {
8313 RO_UNARY_STAR,
8314 complain);
8315 /* TODO: build_x_indirect_ref does not always honor the
8316 location, so ensure it is set. */
8322 /* Fall through. */
8325 cast_expression,
8326 complain);
8327 /* TODO: build_x_unary_op does not always honor the location,
8328 so ensure it is set. */
8336 /* Fall through. */
8338 /* Immediately fold negation of a constant, unless the constant is 0
8339 (since -0 == 0) or it would overflow. */
8344 {
8347 cast_expression);
8349 {
8352 }
8353 }
8354 /* Fall through. */
8363 }
8367 non_constant_p))
8371 }
8375 decltype_p,
8376 pidk);
8377 }
8379 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8380 unary-operator, the corresponding tree code is returned. */
8382 static enum tree_code
8384 {
8386 {
8407 }
8408 }
8410 /* Parse a new-expression.
8412 new-expression:
8413 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8414 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8416 Returns a representation of the expression. */
8418 static tree
8420 {
8423 tree type;
8426 tree ret;
8430 /* Look for the optional `::' operator. */
8431 global_scope_p
8435 /* Look for the `new' operator. */
8437 /* There's no easy way to tell a new-placement from the
8438 `( type-id )' construct. */
8440 /* Look for a new-placement. */
8442 /* If that didn't work out, there's no new-placement. */
8444 {
8448 }
8450 /* If the next token is a `(', then we have a parenthesized
8451 type-id. */
8453 {
8457 /* Consume the `('. */
8458 matching_parens parens;
8461 /* Parse the type-id. */
8462 parser->type_definition_forbidden_message
8464 {
8467 }
8470 /* Look for the closing `)'. */
8473 /* There should not be a direct-new-declarator in this production,
8474 but GCC used to allowed this, so we check and emit a sensible error
8475 message for this case. */
8477 {
8483 }
8484 }
8485 /* Otherwise, there must be a new-type-id. */
8486 else
8489 /* If the next token is a `(' or '{', then we have a new-initializer. */
8494 else
8497 /* A new-expression may not appear in an integral constant
8498 expression. */
8501 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8502 of a new-type-id or type-id of a new-expression, the new-expression shall
8503 contain a new-initializer of the form ( assignment-expression )".
8504 Additionally, consistently with the spirit of DR 1467, we want to accept
8505 'new auto { 2 }' too. */
8511 {
8513 "initialization of new-expression for type %<auto%> "
8516 }
8517 else
8518 {
8519 /* Construct a location e.g.:
8520 ptr = new int[100]
8521 ^~~~~~~~~~~~
8522 with caret == start at the start of the "new" token, and the end
8523 at the end of the final token we consumed. */
8528 /* Create a representation of the new-expression. */
8530 tf_warning_or_error);
8532 }
8540 }
8542 /* Parse a new-placement.
8544 new-placement:
8545 ( expression-list )
8547 Returns the same representation as for an expression-list. */
8551 {
8554 /* Parse the expression-list. */
8555 expression_list = (cp_parser_parenthesized_expression_list
8564 }
8566 /* Parse a new-type-id.
8568 new-type-id:
8569 type-specifier-seq new-declarator [opt]
8571 Returns the TYPE allocated. If the new-type-id indicates an array
8572 type, *NELTS is set to the number of elements in the last array
8573 bound; the TYPE will not include the last array bound. */
8575 static tree
8577 {
8578 cp_decl_specifier_seq type_specifier_seq;
8584 /* The type-specifier sequence must not contain type definitions.
8585 (It cannot contain declarations of new types either, but if they
8586 are not definitions we will catch that because they are not
8587 complete.) */
8589 parser->type_definition_forbidden_message
8591 /* Parse the type-specifier-seq. */
8595 /* Restore the old message. */
8601 /* Parse the new-declarator. */
8604 /* Determine the number of elements in the last array dimension, if
8605 any. */
8607 /* Skip down to the last array dimension. */
8612 {
8615 }
8620 {
8623 }
8626 {
8633 else
8635 }
8638 }
8640 /* Parse an (optional) new-declarator.
8642 new-declarator:
8643 ptr-operator new-declarator [opt]
8644 direct-new-declarator
8646 Returns the declarator. */
8650 {
8653 cp_cv_quals cv_quals;
8655 /* We don't know if there's a ptr-operator next, or not. */
8657 /* Look for a ptr-operator. */
8659 /* If that worked, look for more new-declarators. */
8661 {
8664 /* Parse another optional declarator. */
8667 declarator = cp_parser_make_indirect_declarator
8671 }
8673 /* If the next token is a `[', there is a direct-new-declarator. */
8678 }
8680 /* Parse a direct-new-declarator.
8682 direct-new-declarator:
8683 [ expression ]
8684 direct-new-declarator [constant-expression]
8686 */
8690 {
8694 {
8695 tree expression;
8698 /* Look for the opening `['. */
8703 /* The standard requires that the expression have integral
8704 type. DR 74 adds enumeration types. We believe that the
8705 real intent is that these expressions be handled like the
8706 expression in a `switch' condition, which also allows
8707 classes with a single conversion to integral or
8708 enumeration type. */
8710 {
8711 expression
8713 expression,
8716 {
8718 "expression in new-declarator must have integral "
8721 }
8722 }
8724 /* Look for the closing `]'. */
8727 /* Add this bound to the declarator. */
8730 /* If the next token is not a `[', then there are no more
8731 bounds. */
8734 }
8737 }
8739 /* Parse a new-initializer.
8741 new-initializer:
8742 ( expression-list [opt] )
8743 braced-init-list
8745 Returns a representation of the expression-list. */
8749 {
8753 {
8754 tree t;
8761 }
8762 else
8763 expression_list = (cp_parser_parenthesized_expression_list
8769 }
8771 /* Parse a delete-expression.
8773 delete-expression:
8774 :: [opt] delete cast-expression
8775 :: [opt] delete [ ] cast-expression
8777 Returns a representation of the expression. */
8779 static tree
8781 {
8784 tree expression;
8786 /* Look for the optional `::' operator. */
8787 global_scope_p
8791 /* Look for the `delete' keyword. */
8793 /* See if the array syntax is in use. */
8795 {
8796 /* Consume the `[' token. */
8798 /* Look for the `]' token. */
8800 /* Remember that this is the `[]' construct. */
8802 }
8803 else
8806 /* Parse the cast-expression. */
8809 /* A delete-expression may not appear in an integral constant
8810 expression. */
8815 tf_warning_or_error);
8816 }
8818 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8819 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8820 0 otherwise. */
8822 static int
8824 {
8827 {
8869 /* In ((type ()) () the last () isn't a valid cast-expression,
8870 so the whole must be parsed as postfix-expression. */
8875 /* '[' may start a primary-expression in obj-c++ and in C++11,
8876 as a lambda-expression, eg, '(void)[]{}'. */
8883 /* '++' and '--' may or may not start a cast-expression:
8885 struct T { void operator++(int); };
8886 void f() { (T())++; }
8888 vs
8890 int a;
8891 (int)++a; */
8896 }
8897 }
8899 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8900 in the order: const_cast, static_cast, reinterpret_cast.
8902 Don't suggest dynamic_cast.
8904 Return the first legal cast kind found, or NULL otherwise. */
8908 {
8909 tree trial;
8911 /* Reuse the parser logic by attempting to build the various kinds of
8912 cast, with "complain" disabled.
8913 Identify the first such cast that is valid. */
8915 /* Don't attempt to run such logic within template processing. */
8919 /* First try const_cast. */
8924 /* If that fails, try static_cast. */
8929 /* Finally, try reinterpret_cast. */
8934 /* No such cast possible. */
8936 }
8938 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8939 suggesting how to convert a C-style cast of the form:
8941 (DST_TYPE)ORIG_EXPR
8943 to a C++-style cast.
8945 The primary range of RICHLOC is asssumed to be that of the original
8946 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8947 of the parens in the C-style cast. */
8949 static void
8952 tree dst_type)
8953 {
8954 /* This function is non-trivial, so bail out now if the warning isn't
8955 going to be emitted. */
8959 /* Try to find a legal C++ cast, trying them in order:
8960 const_cast, static_cast, reinterpret_cast. */
8965 /* Replace the open paren with "CAST_SUGGESTION<". */
8966 pretty_printer pp;
8970 /* Replace the close paren with "> (". */
8973 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8975 }
8978 /* Parse a cast-expression.
8980 cast-expression:
8981 unary-expression
8982 ( type-id ) cast-expression
8984 ADDRESS_P is true iff the unary-expression is appearing as the
8985 operand of the `&' operator. CAST_P is true if this expression is
8986 the target of a cast.
8988 Returns a representation of the expression. */
8990 static cp_expr
8993 {
8994 /* If it's a `(', then we might be looking at a cast. */
8996 {
9002 /* There's no way to know yet whether or not this is a cast.
9003 For example, `(int (3))' is a unary-expression, while `(int)
9004 3' is a cast. So, we resort to parsing tentatively. */
9006 /* Types may not be defined in a cast. */
9008 parser->type_definition_forbidden_message
9010 /* Consume the `('. */
9011 matching_parens parens;
9016 /* A very tricky bit is that `(struct S) { 3 }' is a
9017 compound-literal (which we permit in C++ as an extension).
9018 But, that construct is not a cast-expression -- it is a
9019 postfix-expression. (The reason is that `(struct S) { 3 }.i'
9020 is legal; if the compound-literal were a cast-expression,
9021 you'd need an extra set of parentheses.) But, if we parse
9022 the type-id, and it happens to be a class-specifier, then we
9023 will commit to the parse at that point, because we cannot
9024 undo the action that is done when creating a new class. So,
9025 then we cannot back up and do a postfix-expression.
9027 Another tricky case is the following (c++/29234):
9029 struct S { void operator () (); };
9031 void foo ()
9032 {
9033 ( S()() );
9034 }
9036 As a type-id we parse the parenthesized S()() as a function
9037 returning a function, groktypename complains and we cannot
9038 back up in this case either.
9040 Therefore, we scan ahead to the closing `)', and check to see
9041 if the tokens after the `)' can start a cast-expression. Otherwise
9042 we are dealing with an unary-expression, a postfix-expression
9043 or something else.
9045 Yet another tricky case, in C++11, is the following (c++/54891):
9047 (void)[]{};
9049 The issue is that usually, besides the case of lambda-expressions,
9050 the parenthesized type-id cannot be followed by '[', and, eg, we
9051 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
9052 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
9053 we don't commit, we try a cast-expression, then an unary-expression.
9055 Save tokens so that we can put them back. */
9058 /* We may be looking at a cast-expression. */
9061 cast_expression
9064 /* Roll back the tokens we skipped. */
9066 /* If we aren't looking at a cast-expression, simulate an error so
9067 that the call to cp_parser_error_occurred below returns true. */
9070 else
9071 {
9074 /* Look for the type-id. */
9076 /* Look for the closing `)'. */
9081 }
9083 /* Restore the saved message. */
9086 /* At this point this can only be either a cast or a
9087 parenthesized ctor such as `(T ())' that looks like a cast to
9088 function returning T. */
9090 {
9091 /* Only commit if the cast-expression doesn't start with
9092 '++', '--', or '[' in C++11. */
9100 pidk);
9103 {
9104 /* Warn about old-style casts, if so requested. */
9109 {
9115 }
9117 /* Only type conversions to integral or enumeration types
9118 can be used in constant-expressions. */
9121 NIC_CAST))
9124 /* Perform the cast. */
9125 /* Make a location:
9126 (TYPE) EXPR
9127 ^~~~~~~~~~~
9128 with start==caret at the open paren, extending to the
9129 end of "expr". */
9131 open_paren_loc,
9135 }
9136 }
9137 else
9139 }
9141 /* If we get here, then it's not a cast, so it must be a
9142 unary-expression. */
9145 }
9147 /* Parse a binary expression of the general form:
9149 pm-expression:
9150 cast-expression
9151 pm-expression .* cast-expression
9152 pm-expression ->* cast-expression
9154 multiplicative-expression:
9155 pm-expression
9156 multiplicative-expression * pm-expression
9157 multiplicative-expression / pm-expression
9158 multiplicative-expression % pm-expression
9160 additive-expression:
9161 multiplicative-expression
9162 additive-expression + multiplicative-expression
9163 additive-expression - multiplicative-expression
9165 shift-expression:
9166 additive-expression
9167 shift-expression << additive-expression
9168 shift-expression >> additive-expression
9170 relational-expression:
9171 shift-expression
9172 relational-expression < shift-expression
9173 relational-expression > shift-expression
9174 relational-expression <= shift-expression
9175 relational-expression >= shift-expression
9177 GNU Extension:
9179 relational-expression:
9180 relational-expression <? shift-expression
9181 relational-expression >? shift-expression
9183 equality-expression:
9184 relational-expression
9185 equality-expression == relational-expression
9186 equality-expression != relational-expression
9188 and-expression:
9189 equality-expression
9190 and-expression & equality-expression
9192 exclusive-or-expression:
9193 and-expression
9194 exclusive-or-expression ^ and-expression
9196 inclusive-or-expression:
9197 exclusive-or-expression
9198 inclusive-or-expression | exclusive-or-expression
9200 logical-and-expression:
9201 inclusive-or-expression
9202 logical-and-expression && inclusive-or-expression
9204 logical-or-expression:
9205 logical-and-expression
9206 logical-or-expression || logical-and-expression
9208 All these are implemented with a single function like:
9210 binary-expression:
9211 simple-cast-expression
9212 binary-expression <token> binary-expression
9214 CAST_P is true if this expression is the target of a cast.
9216 The binops_by_token map is used to get the tree codes for each <token> type.
9217 binary-expressions are associated according to a precedence table. */
9219 #define TOKEN_PRECEDENCE(token) \
9220 (((token->type == CPP_GREATER \
9221 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9222 && !parser->greater_than_is_operator_p) \
9223 ? PREC_NOT_OPERATOR \
9224 : binops_by_token[token->type].prec)
9226 static cp_expr
9232 {
9233 cp_parser_expression_stack stack;
9235 cp_parser_expression_stack_entry current;
9236 cp_expr rhs;
9240 tree overload;
9242 /* Parse the first expression. */
9253 {
9254 /* Get an operator token. */
9260 {
9262 "%<>>%> operator is treated"
9266 }
9271 /* This is a fold-expression; handle it later. */
9274 /* Popping an entry off the stack means we completed a subexpression:
9275 - either we found a token which is not an operator (`>' where it is not
9276 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9277 will happen repeatedly;
9278 - or, we found an operator which has lower priority. This is the case
9279 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9280 parsing `3 * 4'. */
9282 {
9285 else
9287 }
9289 get_rhs:
9293 /* We used the operator token. */
9296 /* For "false && x" or "true || x", x will never be executed;
9297 disable warnings while evaluating it. */
9299 c_inhibit_evaluation_warnings +=
9302 c_inhibit_evaluation_warnings +=
9305 /* Extract another operand. It may be the RHS of this expression
9306 or the LHS of a new, higher priority expression. */
9311 /* Get another operator token. Look up its precedence to avoid
9312 building a useless (immediately popped) stack entry for common
9313 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9320 {
9321 /* ... and prepare to parse the RHS of the new, higher priority
9322 expression. Since precedence levels on the stack are
9323 monotonically increasing, we do not have to care about
9324 stack overflows. */
9333 pop:
9335 /* If the stack is not empty, we have parsed into LHS the right side
9336 (`4' in the example above) of an expression we had suspended.
9337 We can use the information on the stack to recover the LHS (`3')
9338 from the stack together with the tree code (`MULT_EXPR'), and
9339 the precedence of the higher level subexpression
9340 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9341 which will be used to actually build the additive expression. */
9346 }
9348 /* Undo the disabling of warnings done above. */
9350 c_inhibit_evaluation_warnings -=
9353 c_inhibit_evaluation_warnings -=
9359 /* Avoid warning for !!x == y. */
9364 /* Avoid warning for !b == y where b is boolean. */
9368 /* Avoid warning for !!b == y where b is boolean. */
9381 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9382 ERROR_MARK for everything that is not a binary expression.
9383 This makes warn_about_parentheses miss some warnings that
9384 involve unary operators. For unary expressions we should
9385 pass the correct tree_code unless the unary expression was
9386 surrounded by parentheses.
9387 */
9391 {
9394 else
9395 {
9396 current.lhs
9399 == tcc_comparison
9403 }
9404 }
9405 else
9406 {
9411 /* TODO: build_x_binary_op doesn't always honor the location. */
9413 }
9416 /* If the binary operator required the use of an overloaded operator,
9417 then this expression cannot be an integral constant-expression.
9418 An overloaded operator can be used even if both operands are
9419 otherwise permissible in an integral constant-expression if at
9420 least one of the operands is of enumeration type. */
9424 NIC_OVERLOADED))
9426 }
9429 }
9431 static cp_expr
9436 {
9439 }
9441 /* Parse the `? expression : assignment-expression' part of a
9442 conditional-expression. The LOGICAL_OR_EXPR is the
9443 logical-or-expression that started the conditional-expression.
9444 Returns a representation of the entire conditional-expression.
9446 This routine is used by cp_parser_assignment_expression.
9448 ? expression : assignment-expression
9450 GNU Extensions:
9452 ? : assignment-expression */
9454 static tree
9456 {
9458 cp_expr assignment_expr;
9462 /* Consume the `?' token. */
9467 {
9470 /* Implicit true clause. */
9472 c_inhibit_evaluation_warnings +=
9475 }
9476 else
9477 {
9480 /* Parse the expression. */
9481 c_inhibit_evaluation_warnings +=
9484 c_inhibit_evaluation_warnings +=
9488 }
9490 /* The next token should be a `:'. */
9492 /* Parse the assignment-expression. */
9494 c_inhibit_evaluation_warnings -=
9497 /* Make a location:
9498 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9499 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9500 with the caret at the "?", ranging from the start of
9501 the logical_or_expr to the end of the assignment_expr. */
9506 /* Build the conditional-expression. */
9508 expr,
9509 assignment_expr,
9510 tf_warning_or_error);
9511 }
9513 /* Parse an assignment-expression.
9515 assignment-expression:
9516 conditional-expression
9517 logical-or-expression assignment-operator assignment_expression
9518 throw-expression
9520 CAST_P is true if this expression is the target of a cast.
9521 DECLTYPE_P is true if this expression is the operand of decltype.
9523 Returns a representation for the expression. */
9525 static cp_expr
9528 {
9529 cp_expr expr;
9531 /* If the next token is the `throw' keyword, then we're looking at
9532 a throw-expression. */
9535 /* Otherwise, it must be that we are looking at a
9536 logical-or-expression. */
9537 else
9538 {
9539 /* Parse the binary expressions (logical-or-expression). */
9541 decltype_p,
9543 /* If the next token is a `?' then we're actually looking at a
9544 conditional-expression. */
9547 else
9548 {
9551 /* If it's an assignment-operator, we're using the second
9552 production. */
9553 enum tree_code assignment_operator
9556 {
9559 /* Parse the right-hand side of the assignment. */
9566 /* An assignment may not appear in a
9567 constant-expression. */
9569 NIC_ASSIGNMENT))
9571 /* Build the assignment expression. Its default
9572 location:
9573 LHS = RHS
9574 ~~~~^~~~~
9575 is the location of the '=' token as the
9576 caret, ranging from the start of the lhs to the
9577 end of the rhs. */
9582 assignment_operator,
9583 rhs,
9585 /* TODO: build_x_modify_expr doesn't honor the location,
9586 so we must set it here. */
9588 }
9589 }
9590 }
9593 }
9595 /* Parse an (optional) assignment-operator.
9597 assignment-operator: one of
9598 = *= /= %= += -= >>= <<= &= ^= |=
9600 GNU Extension:
9602 assignment-operator: one of
9603 <?= >?=
9605 If the next token is an assignment operator, the corresponding tree
9606 code is returned, and the token is consumed. For example, for
9607 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9608 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9609 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9610 operator, ERROR_MARK is returned. */
9612 static enum tree_code
9614 {
9618 /* Peek at the next token. */
9622 {
9668 /* Nothing else is an assignment operator. */
9670 }
9672 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9677 /* If it was an assignment operator, consume it. */
9682 }
9684 /* Parse an expression.
9686 expression:
9687 assignment-expression
9688 expression , assignment-expression
9690 CAST_P is true if this expression is the target of a cast.
9691 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9692 except possibly parenthesized or on the RHS of a comma (N3276).
9694 Returns a representation of the expression. */
9696 static cp_expr
9699 {
9704 {
9705 cp_expr assignment_expression;
9707 /* Parse the next assignment-expression. */
9708 assignment_expression
9711 /* We don't create a temporary for a call that is the immediate operand
9712 of decltype or on the RHS of a comma. But when we see a comma, we
9713 need to create a temporary for a call on the LHS. */
9718 assignment_expression
9722 /* If this is the first assignment-expression, we can just
9723 save it away. */
9726 else
9727 {
9728 /* Create a location with caret at the comma, ranging
9729 from the start of the LHS to the end of the RHS. */
9734 assignment_expression,
9737 }
9738 /* If the next token is not a comma, or we're in a fold-expression, then
9739 we are done with the expression. */
9743 /* Consume the `,'. */
9746 /* A comma operator cannot appear in a constant-expression. */
9749 }
9752 }
9754 /* Parse a constant-expression.
9756 constant-expression:
9757 conditional-expression
9759 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9760 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9761 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9762 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9763 only parse a conditional-expression, otherwise parse an
9764 assignment-expression. See below for rationale. */
9766 static cp_expr
9771 {
9775 cp_expr expression;
9777 /* It might seem that we could simply parse the
9778 conditional-expression, and then check to see if it were
9779 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9780 one that the compiler can figure out is constant, possibly after
9781 doing some simplifications or optimizations. The standard has a
9782 precise definition of constant-expression, and we must honor
9783 that, even though it is somewhat more restrictive.
9785 For example:
9787 int i[(2, 3)];
9789 is not a legal declaration, because `(2, 3)' is not a
9790 constant-expression. The `,' operator is forbidden in a
9791 constant-expression. However, GCC's constant-folding machinery
9792 will fold this operation to an INTEGER_CST for `3'. */
9794 /* Save the old settings. */
9796 saved_allow_non_integral_constant_expression_p
9799 /* We are now parsing a constant-expression. */
9801 parser->allow_non_integral_constant_expression_p
9804 /* Although the grammar says "conditional-expression", when not STRICT_P,
9805 we parse an "assignment-expression", which also permits
9806 "throw-expression" and the use of assignment operators. In the case
9807 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9808 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9809 actually essential that we look for an assignment-expression.
9810 For example, cp_parser_initializer_clauses uses this function to
9811 determine whether a particular assignment-expression is in fact
9812 constant. */
9814 {
9815 /* Parse the binary expressions (logical-or-expression). */
9818 /* If the next token is a `?' then we're actually looking at
9819 a conditional-expression; otherwise we're done. */
9822 }
9823 else
9825 /* Restore the old settings. */
9826 parser->integral_constant_expression_p
9828 parser->allow_non_integral_constant_expression_p
9831 {
9832 /* Require an rvalue constant expression here; that's what our
9833 callers expect. Reference constant expressions are handled
9834 separately in e.g. cp_parser_template_argument. */
9843 }
9846 parser->non_integral_constant_expression_p
9850 }
9852 /* Parse __builtin_offsetof.
9854 offsetof-expression:
9855 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9857 offsetof-member-designator:
9858 id-expression
9859 | offsetof-member-designator "." id-expression
9860 | offsetof-member-designator "[" expression "]"
9861 | offsetof-member-designator "->" id-expression */
9863 static cp_expr
9865 {
9867 tree type;
9868 cp_expr expr;
9869 cp_id_kind dummy;
9871 location_t finish_loc;
9873 /* We're about to accept non-integral-constant things, but will
9874 definitely yield an integral constant expression. Save and
9875 restore these values around our local parsing. */
9881 /* Consume the "__builtin_offsetof" token. */
9883 /* Consume the opening `('. */
9884 matching_parens parens;
9886 /* Parse the type-id. */
9888 {
9890 parser->type_definition_forbidden_message
9894 }
9895 /* Look for the `,'. */
9899 /* Build the (type *)null that begins the traditional offsetof macro. */
9900 tree object_ptr
9902 tf_warning_or_error);
9904 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9908 {
9911 {
9913 /* offsetof-member-designator "[" expression "]" */
9919 /* offsetof-member-designator "->" identifier */
9922 /* FALLTHRU */
9925 /* offsetof-member-designator "." identifier */
9933 /* Consume the ")" token. */
9939 /* Error. We know the following require will fail, but
9940 that gives the proper error message. */
9945 }
9946 }
9948 success:
9949 /* Make a location of the form:
9950 __builtin_offsetof (struct s, f)
9951 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9952 with caret at the type-id, ranging from the start of the
9953 "_builtin_offsetof" token to the close paren. */
9955 /* The result will be an INTEGER_CST, so we need to explicitly
9956 preserve the location. */
9959 failure:
9965 }
9967 /* Parse a trait expression.
9969 Returns a representation of the expression, the underlying type
9970 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9972 static cp_expr
9974 {
9975 cp_trait_kind kind;
9981 {
10083 }
10085 /* Get location of initial token. */
10088 /* Consume the token. */
10091 matching_parens parens;
10094 {
10097 }
10103 {
10106 {
10109 }
10113 }
10115 {
10117 {
10121 {
10124 }
10128 }
10129 }
10134 /* Construct a location of the form:
10135 __is_trivially_copyable(_Tp)
10136 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10137 with start == caret, finishing at the close-paren. */
10140 /* Complete the trait expression, which may mean either processing
10141 the trait expr now or saving it for template instantiation. */
10143 {
10152 }
10153 }
10155 /* Parse a lambda expression.
10157 lambda-expression:
10158 lambda-introducer lambda-declarator [opt] compound-statement
10160 Returns a representation of the expression. */
10162 static cp_expr
10164 {
10166 tree type;
10176 {
10178 {
10180 "lambda-expression in unevaluated context"
10183 }
10185 }
10187 {
10189 {
10193 }
10195 }
10197 /* We may be in the middle of deferred access check. Disable
10198 it now. */
10211 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10214 /* Now that we've started the type, add the capture fields for any
10215 explicit captures. */
10218 {
10219 /* Inside the class, surrounding template-parameter-lists do not apply. */
10220 unsigned int saved_num_template_parameter_lists
10224 bool fully_implicit_function_template_p
10228 bool auto_is_implicit_function_template_parm_p
10239 /* By virtue of defining a local class, a lambda expression has access to
10240 the private variables of enclosing classes. */
10251 {
10253 }
10255 {
10258 }
10260 /* The capture list was built up in reverse order; fix that now. */
10272 parser->fully_implicit_function_template_p
10276 parser->auto_is_implicit_function_template_parm_p
10278 }
10280 /* This field is only used during parsing of the lambda. */
10283 /* This lambda shouldn't have any proxies left at this point. */
10285 /* And now that we're done, push proxies for an enclosing lambda. */
10288 /* Update the lambda expression to a range. */
10296 else
10304 }
10306 /* Parse the beginning of a lambda expression.
10308 lambda-introducer:
10309 [ lambda-capture [opt] ]
10311 LAMBDA_EXPR is the current representation of the lambda expression. */
10313 static void
10315 {
10316 /* Need commas after the first capture. */
10319 /* Eat the leading `['. */
10322 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10330 {
10336 }
10339 {
10341 tree capture_id;
10342 tree capture_init_expr;
10346 enum capture_kind_type
10347 {
10348 BY_COPY,
10349 BY_REFERENCE
10350 };
10354 {
10357 }
10361 else
10364 /* Possibly capture `this'. */
10366 {
10377 explicit_init_p);
10379 }
10381 /* Possibly capture `*this'. */
10384 {
10395 explicit_init_p);
10397 }
10401 {
10408 }
10410 /* Remember whether we want to capture as a reference or not. */
10412 {
10415 }
10417 /* Get the identifier. */
10422 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10423 delimiters, but I modified this to stop on unnested ']' as well. It
10424 was already changed to stop on unnested '}', so the
10425 "closing_parenthesis" name is no more misleading with my change. */
10426 {
10432 }
10434 /* Find the initializer for this capture. */
10438 {
10440 /* An explicit initializer exists. */
10443 "lambda capture initializers "
10449 {
10452 }
10455 }
10456 else
10457 {
10460 /* Turn the identifier into an id-expression. */
10461 capture_init_expr
10466 {
10469 }
10472 {
10475 capture_init_expr);
10480 }
10483 {
10486 capture_init_expr))
10490 }
10492 capture_init_expr
10493 = finish_id_expression
10495 capture_init_expr,
10509 {
10512 }
10513 }
10517 {
10522 capture_id);
10526 "capture of %qD redundant with by-reference capture "
10528 }
10531 capture_id,
10532 capture_init_expr,
10534 explicit_init_p);
10536 /* If there is any qualification still in effect, clear it
10537 now; we will be starting fresh with the next capture. */
10541 }
10544 }
10546 /* Parse the (optional) middle of a lambda expression.
10548 lambda-declarator:
10549 < template-parameter-list [opt] >
10550 ( parameter-declaration-clause [opt] )
10551 attribute-specifier [opt]
10552 decl-specifier-seq [opt]
10553 exception-specification [opt]
10554 lambda-return-type-clause [opt]
10556 LAMBDA_EXPR is the current representation of the lambda expression. */
10558 static bool
10560 {
10561 /* 5.1.1.4 of the standard says:
10562 If a lambda-expression does not include a lambda-declarator, it is as if
10563 the lambda-declarator were ().
10564 This means an empty parameter list, no attributes, and no exception
10565 specification. */
10572 cp_decl_specifier_seq lambda_specs;
10575 /* The template-parameter-list is optional, but must begin with
10576 an opening angle if present. */
10578 {
10581 "lambda templates are only available with "
10585 "lambda templates are only available with "
10594 /* We just processed one more parameter list. */
10596 }
10598 /* The parameter-declaration-clause is optional (unless
10599 template-parameter-list was given), but must begin with an
10600 opening parenthesis if present. */
10602 {
10603 matching_parens parens;
10608 /* Parse parameters. */
10611 /* Default arguments shall not be specified in the
10612 parameter-declaration-clause of a lambda-declarator. */
10621 /* In the decl-specifier-seq of the lambda-declarator, each
10622 decl-specifier shall either be mutable or constexpr. */
10626 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10629 {
10634 }
10638 /* Parse optional exception specification. */
10643 /* Parse optional trailing return type. */
10645 {
10648 }
10650 /* The function parameters must be in scope all the way until after the
10651 trailing-return-type in case of decltype. */
10653 }
10657 /* Create the function call operator.
10659 Messing with declarators like this is no uglier than building up the
10660 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10661 other code. */
10662 {
10663 cp_decl_specifier_seq return_type_specs;
10665 tree fco;
10673 {
10677 else
10680 }
10690 VIRT_SPEC_UNSPECIFIED,
10691 REF_QUAL_NONE,
10692 tx_qual,
10693 exception_spec,
10694 return_type,
10699 declarator,
10700 NULL_TREE);
10702 {
10705 /* Give the object parameter a different name. */
10708 }
10710 {
10714 }
10723 }
10724 }
10726 /* Parse the body of a lambda expression, which is simply
10728 compound-statement
10730 but which requires special handling.
10731 LAMBDA_EXPR is the current representation of the lambda expression. */
10733 static void
10735 {
10740 /* The body of a lambda-expression is not a subexpression of the enclosing
10741 expression. */
10742 cp_evaluated ev;
10746 else
10747 /* Still increment function_depth so that we don't GC in the
10748 middle of an expression. */
10753 /* Clear this in case we're in the middle of a default argument. */
10757 {
10761 matching_braces braces;
10764 {
10767 /* Originally C++11 required us to peek for 'return expr'; and
10768 process it specially here to deduce the return type. N3638
10769 removed the need for that. */
10777 }
10780 }
10787 else
10789 }
10791 /* Statements [gram.stmt.stmt] */
10793 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10795 static void
10797 {
10801 /* A concept is never expanded normally. */
10807 }
10809 /* Parse a statement.
10811 statement:
10812 labeled-statement
10813 expression-statement
10814 compound-statement
10815 selection-statement
10816 iteration-statement
10817 jump-statement
10818 declaration-statement
10819 try-block
10821 C++11:
10823 statement:
10824 labeled-statement
10825 attribute-specifier-seq (opt) expression-statement
10826 attribute-specifier-seq (opt) compound-statement
10827 attribute-specifier-seq (opt) selection-statement
10828 attribute-specifier-seq (opt) iteration-statement
10829 attribute-specifier-seq (opt) jump-statement
10830 declaration-statement
10831 attribute-specifier-seq (opt) try-block
10833 init-statement:
10834 expression-statement
10835 simple-declaration
10837 TM Extension:
10839 statement:
10840 atomic-statement
10842 IN_COMPOUND is true when the statement is nested inside a
10843 cp_parser_compound_statement; this matters for certain pragmas.
10845 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10846 is a (possibly labeled) if statement which is not enclosed in braces
10847 and has an else clause. This is used to implement -Wparentheses.
10849 CHAIN is a vector of if-else-if conditions. */
10851 static void
10855 {
10860 restart:
10863 /* There is no statement yet. */
10869 /* In obj-c++, seeing '[[' might be the either the beginning of
10870 c++11 attributes, or a nested objc-message-expression. So
10871 let's parse the c++11 attributes tentatively. */
10875 {
10878 }
10880 /* Peek at the next token. */
10882 /* Remember the location of the first token in the statement. */
10886 /* If this is a keyword, then that will often determine what kind of
10887 statement we have. */
10889 {
10893 {
10896 /* Looks like a labeled-statement with a case label.
10897 Parse the label, and then use tail recursion to parse
10898 the statement. */
10924 /* Objective-C++ exception-handling constructs. */
10940 /* This must be a namespace alias definition. */
10942 {
10943 /* Attributes should be parsed as part of the the
10944 declaration, so let's un-parse them. */
10947 }
10965 /* It might be a keyword like `int' that can start a
10966 declaration-statement. */
10968 }
10969 }
10971 {
10972 /* If the next token is a `:', then we are looking at a
10973 labeled-statement. */
10976 {
10977 /* Looks like a labeled-statement with an ordinary label.
10978 Parse the label, and then use tail recursion to parse
10979 the statement. */
10984 }
10985 }
10986 /* Anything that starts with a `{' must be a compound-statement. */
10989 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10990 a statement all its own. */
10992 {
10993 /* Only certain OpenMP pragmas are attached to statements, and thus
10994 are considered statements themselves. All others are not. In
10995 the context of a compound, accept the pragma as a "statement" and
10996 return so that we can check for a close brace. Otherwise we
10997 require a real statement and must go back and read one. */
11003 }
11005 {
11008 }
11010 /* Everything else must be a declaration-statement or an
11011 expression-statement. Try for the declaration-statement
11012 first, unless we are looking at a `;', in which case we know that
11013 we have an expression-statement. */
11015 {
11017 {
11019 /* Attributes should be parsed as part of the declaration,
11020 so let's un-parse them. */
11024 /* Try to parse the declaration-statement. */
11026 /* If that worked, we're done. */
11029 /* It didn't work, restore the post-attribute position. */
11032 }
11033 /* All preceding labels have been parsed at this point. */
11039 /* Look for an expression-statement instead. */
11042 /* Handle [[fallthrough]];. */
11044 {
11045 /* The next token after the fallthrough attribute is ';'. */
11047 {
11048 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11050 IFN_FALLTHROUGH,
11053 }
11054 else
11058 }
11059 }
11061 /* Set the line number for the statement. */
11065 /* Allow "[[fallthrough]];", but warn otherwise. */
11068 OPT_Wattributes,
11070 }
11072 /* Append ATTR to attribute list ATTRS. */
11074 static tree
11076 {
11082 }
11084 /* Parse the label for a labeled-statement, i.e.
11086 identifier :
11087 case constant-expression :
11088 default :
11090 GNU Extension:
11091 case constant-expression ... constant-expression : statement
11093 When a label is parsed without errors, the label is added to the
11094 parse tree by the finish_* functions, so this function doesn't
11095 have to return the label. */
11097 static void
11099 {
11104 /* The next token should be an identifier. */
11108 {
11111 }
11113 /* Remember whether this case or a user-defined label is allowed to fall
11114 through to. */
11119 {
11121 {
11125 /* Consume the `case' token. */
11127 /* Parse the constant-expression. */
11134 {
11135 /* Consume the `...' token. */
11141 /* We don't need to emit warnings here, as the common code
11142 will do this for us. */
11143 }
11144 else
11148 {
11151 {
11154 }
11155 }
11156 else
11159 expr);
11160 }
11164 /* Consume the `default' token. */
11168 {
11171 {
11174 }
11175 }
11176 else
11181 /* Anything else must be an ordinary label. */
11186 }
11188 /* Require the `:' token. */
11191 /* An ordinary label may optionally be followed by attributes.
11192 However, this is only permitted if the attributes are then
11193 followed by a semicolon. This is because, for backward
11194 compatibility, when parsing
11195 lab: __attribute__ ((unused)) int i;
11196 we want the attribute to attach to "i", not "lab". */
11199 {
11200 tree attrs;
11204 /* And fallthrough always binds to the expression-statement. */
11209 ;
11210 else
11212 }
11218 }
11220 /* Parse an expression-statement.
11222 expression-statement:
11223 expression [opt] ;
11225 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11226 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11227 indicates whether this expression-statement is part of an
11228 expression statement. */
11230 static tree
11232 {
11237 /* There might be attribute fallthrough. */
11240 /* If the next token is a ';', then there is no expression
11241 statement. */
11243 {
11247 {
11250 }
11251 }
11253 /* Handle [[fallthrough]];. */
11255 {
11256 /* The next token after the fallthrough attribute is ';'. */
11258 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11261 else
11265 }
11267 /* Allow "[[fallthrough]];", but warn otherwise. */
11272 /* Give a helpful message for "A<T>::type t;" and the like. */
11275 {
11282 {
11283 /* A::A a; */
11288 }
11289 }
11291 /* Consume the final `;'. */
11296 /* This is the final expression statement of a statement
11297 expression. */
11303 }
11305 /* Parse a compound-statement.
11307 compound-statement:
11308 { statement-seq [opt] }
11310 GNU extension:
11312 compound-statement:
11313 { label-declaration-seq [opt] statement-seq [opt] }
11315 label-declaration-seq:
11316 label-declaration
11317 label-declaration-seq label-declaration
11319 Returns a tree representing the statement. */
11321 static tree
11324 {
11325 tree compound_stmt;
11326 matching_braces braces;
11328 /* Consume the `{'. */
11335 /* Begin the compound-statement. */
11337 /* If the next keyword is `__label__' we have a label declaration. */
11340 /* Parse an (optional) statement-seq. */
11342 /* Finish the compound-statement. */
11344 /* Consume the `}'. */
11348 }
11350 /* Parse an (optional) statement-seq.
11352 statement-seq:
11353 statement
11354 statement-seq [opt] statement */
11356 static void
11358 {
11359 /* Scan statements until there aren't any more. */
11361 {
11364 /* If we are looking at a `}', then we have run out of
11365 statements; the same is true if we have reached the end
11366 of file, or have stumbled upon a stray '@end'. */
11373 /* If we are in a compound statement and find 'else' then
11374 something went wrong. */
11376 {
11379 else
11380 {
11383 }
11384 }
11386 /* Parse the statement. */
11388 }
11389 }
11391 /* Return true if this is the C++20 version of range-based-for with
11392 init-statement. */
11394 static bool
11396 {
11399 /* Save tokens so that we can put them back. */
11402 /* There has to be an unnested ; followed by an unnested :. */
11405 CPP_SEMICOLON,
11409 /* We found the semicolon, eat it now. */
11412 /* Now look for ':' that is not nested in () or {}. */
11415 CPP_COLON,
11418 out:
11419 /* Roll back the tokens we skipped. */
11423 }
11425 /* Return true if we're looking at (init; cond), false otherwise. */
11427 static bool
11429 {
11430 /* Save tokens so that we can put them back. */
11433 /* Look for ';' that is not nested in () or {}. */
11436 CPP_SEMICOLON,
11439 /* Roll back the tokens we skipped. */
11443 }
11445 /* Parse a selection-statement.
11447 selection-statement:
11448 if ( init-statement [opt] condition ) statement
11449 if ( init-statement [opt] condition ) statement else statement
11450 switch ( init-statement [opt] condition ) statement
11452 Returns the new IF_STMT or SWITCH_STMT.
11454 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11455 is a (possibly labeled) if statement which is not enclosed in
11456 braces and has an else clause. This is used to implement
11457 -Wparentheses.
11459 CHAIN is a vector of if-else-if conditions. This is used to implement
11460 -Wduplicated-cond. */
11462 static tree
11465 {
11468 token_indent_info guard_tinfo;
11473 /* Peek at the next token. */
11477 /* See what kind of keyword it is. */
11480 {
11483 {
11484 tree statement;
11485 tree condition;
11490 RID_CONSTEXPR))
11491 {
11497 }
11499 /* Look for the `('. */
11500 matching_parens parens;
11502 {
11505 }
11507 /* Begin the selection-statement. */
11509 {
11512 }
11513 else
11516 /* Parse the optional init-statement. */
11518 {
11519 tree decl;
11522 "init-statement in selection statements only available "
11525 }
11527 /* Parse the condition. */
11529 /* Look for the `)'. */
11535 {
11539 /* Add the condition. */
11546 /* Parse the then-clause. */
11550 /* Outside a template, the non-selected branch of a constexpr
11551 if is a 'discarded statement', i.e. unevaluated. */
11556 {
11559 }
11562 guard_tinfo);
11569 {
11573 }
11575 /* If the next token is `else', parse the else-clause. */
11577 RID_ELSE))
11578 {
11582 {
11585 }
11587 guard_tinfo
11589 /* Consume the `else' keyword. */
11592 {
11594 RID_IF)
11596 {
11597 /* We've got "if (COND) else if (COND2)". Start
11598 the condition chain and add COND as the first
11599 element. */
11603 {
11604 /* Wrap it in a NOP_EXPR so that we can set the
11605 location of the condition. */
11607 condition);
11610 }
11611 }
11613 RID_IF))
11614 {
11615 /* This is if-else without subsequent if. Zap the
11616 condition chain; we would have already warned at
11617 this point. */
11620 }
11621 }
11623 /* Parse the else-clause. */
11629 /* If we are currently parsing a then-clause, then
11630 IF_P will not be NULL. We set it to true to
11631 indicate that this if statement has an else clause.
11632 This may trigger the Wparentheses warning below
11633 when we get back up to the parent if statement. */
11638 {
11642 }
11643 }
11644 else
11645 {
11646 /* This if statement does not have an else clause. If
11647 NESTED_IF is true, then the then-clause has an if
11648 statement which does have an else clause. We warn
11649 about the potential ambiguity. */
11652 "suggest explicit braces to avoid ambiguous"
11655 {
11656 /* We don't need the condition chain anymore. */
11659 }
11660 }
11662 /* Now we're all done with the if-statement. */
11664 }
11665 else
11666 {
11670 /* Add the condition. */
11673 /* Parse the body of the switch-statement. */
11679 guard_tinfo);
11683 /* Now we're all done with the switch-statement. */
11685 }
11688 }
11694 }
11695 }
11697 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
11698 If we have seen at least one decl-specifier, and the next token
11699 is not a parenthesis, then we must be looking at a declaration.
11700 (After "int (" we might be looking at a functional cast.) */
11702 static void
11705 {
11711 }
11713 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
11714 The declarator shall not specify a function or an array. Returns
11715 TRUE if the declarator is valid, FALSE otherwise. */
11717 static bool
11720 location_t loc)
11721 {
11725 {
11730 else
11738 }
11739 else
11741 }
11743 /* Parse a condition.
11745 condition:
11746 expression
11747 type-specifier-seq declarator = initializer-clause
11748 type-specifier-seq declarator braced-init-list
11750 GNU Extension:
11752 condition:
11753 type-specifier-seq declarator asm-specification [opt]
11754 attributes [opt] = assignment-expression
11756 Returns the expression that should be tested. */
11758 static tree
11760 {
11761 cp_decl_specifier_seq type_specifiers;
11765 /* Try the declaration first. */
11767 /* New types are not allowed in the type-specifier-seq for a
11768 condition. */
11770 parser->type_definition_forbidden_message
11772 /* Parse the type-specifier-seq. */
11774 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11777 /* Restore the saved message. */
11783 /* If all is well, we might be looking at a declaration. */
11785 {
11786 tree decl;
11787 tree asm_specification;
11788 tree attributes;
11793 /* Parse the declarator. */
11799 /* Parse the attributes. */
11801 /* Parse the asm-specification. */
11803 /* If the next token is not an `=' or '{', then we might still be
11804 looking at an expression. For example:
11806 if (A(a).x)
11808 looks like a decl-specifier-seq and a declarator -- but then
11809 there is no `=', so this is an expression. */
11814 /* If we did see an `=' or '{', then we are looking at a declaration
11815 for sure. */
11817 {
11818 tree pushed_scope;
11825 /* Create the declaration. */
11831 /* Parse the initializer. */
11833 {
11837 }
11839 {
11840 /* Consume the `='. */
11844 }
11845 else
11846 {
11849 }
11853 /* Process the initializer. */
11856 asm_specification,
11857 flags);
11863 }
11864 }
11865 /* If we didn't even get past the declarator successfully, we are
11866 definitely not looking at a declaration. */
11867 else
11870 /* Otherwise, we are looking at an expression. */
11872 }
11874 /* Parses a for-statement or range-for-statement until the closing ')',
11875 not included. */
11877 static tree
11879 {
11883 /* Begin the for-statement. */
11886 /* Parse the initialization. */
11892 else
11894 }
11896 static tree
11899 {
11900 /* Normal for loop */
11903 tree stmt;
11906 /* The init-statement has already been parsed in
11907 cp_parser_init_statement, so no work is needed here. */
11910 /* If there's a condition, process it. */
11914 {
11918 }
11920 {
11924 }
11926 /* Look for the `;'. */
11929 /* If there's an expression, process it. */
11935 }
11937 /* Tries to parse a range-based for-statement:
11939 range-based-for:
11940 decl-specifier-seq declarator : expression
11942 The decl-specifier-seq declarator and the `:' are already parsed by
11943 cp_parser_init_statement. If processing_template_decl it returns a
11944 newly created RANGE_FOR_STMT; if not, it is converted to a
11945 regular FOR_STMT. */
11947 static tree
11950 {
11957 /* Get the range declaration momentarily out of the way so that
11958 the range expression doesn't clash with it. */
11960 {
11962 {
11964 /* For decomposition declaration get all of the corresponding
11965 declarations out of the way. */
11969 {
11975 {
11981 }
11982 }
11983 }
11985 {
11990 }
11991 }
11994 {
11997 }
11998 else
12001 /* Put the range declaration(s) back into scope. */
12003 {
12007 }
12009 /* finish_omp_for has its own code for the following, so just
12010 return the range_expr instead. */
12014 /* If in template, STMT is converted to a normal for-statement
12015 at instantiation. If not, it is done just ahead. */
12017 {
12027 /* do_auto_deduction doesn't mess with template init-lists. */
12030 }
12031 else
12032 {
12036 unroll);
12037 }
12039 }
12041 /* Subroutine of cp_convert_range_for: given the initializer expression,
12042 builds up the range temporary. */
12044 static tree
12046 {
12049 /* Find out the type deduced by the declaration
12050 `auto &&__range = range_expr'. */
12055 /* Create the __range variable. */
12057 range_type);
12062 }
12064 /* Used by cp_parser_range_for in template context: we aren't going to
12065 do a full conversion yet, but we still need to resolve auto in the
12066 type of the for-range-declaration if present. This is basically
12067 a shortcut version of cp_convert_range_for. */
12069 static void
12071 {
12074 {
12077 iter_type = (cp_parser_perform_range_for_lookup
12080 {
12082 iter_type);
12084 RO_UNARY_STAR,
12085 tf_warning_or_error);
12088 }
12089 }
12090 }
12092 /* Converts a range-based for-statement into a normal
12093 for-statement, as per the definition.
12095 for (RANGE_DECL : RANGE_EXPR)
12096 BLOCK
12098 should be equivalent to:
12100 {
12101 auto &&__range = RANGE_EXPR;
12102 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
12103 __begin != __end;
12104 ++__begin)
12105 {
12106 RANGE_DECL = *__begin;
12107 BLOCK
12108 }
12109 }
12111 If RANGE_EXPR is an array:
12112 BEGIN_EXPR = __range
12113 END_EXPR = __range + ARRAY_SIZE(__range)
12114 Else if RANGE_EXPR has a member 'begin' or 'end':
12115 BEGIN_EXPR = __range.begin()
12116 END_EXPR = __range.end()
12117 Else:
12118 BEGIN_EXPR = begin(__range)
12119 END_EXPR = end(__range);
12121 If __range has a member 'begin' but not 'end', or vice versa, we must
12122 still use the second alternative (it will surely fail, however).
12123 When calling begin()/end() in the third alternative we must use
12124 argument dependent lookup, but always considering 'std' as an associated
12125 namespace. */
12127 tree
12131 {
12139 /* If an error happened previously do nothing or else a lot of
12140 unhelpful errors would be issued. */
12142 else
12143 {
12144 tree range_temp;
12148 /* Can't bind a reference to an array of runtime bound. */
12150 else
12151 {
12156 LOOKUP_ONLYCONVERTING);
12158 }
12161 }
12163 /* The new for initialization statement. */
12165 iter_type);
12171 LOOKUP_ONLYCONVERTING);
12181 LOOKUP_ONLYCONVERTING);
12185 /* The new for condition. */
12192 /* The new increment expression. */
12195 tf_warning_or_error);
12201 /* The declaration is initialized with *__begin inside the loop body. */
12204 tf_warning_or_error),
12206 LOOKUP_ONLYCONVERTING);
12211 }
12213 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12214 We need to solve both at the same time because the method used
12215 depends on the existence of members begin or end.
12216 Returns the type deduced for the iterator expression. */
12218 static tree
12220 {
12222 {
12225 }
12228 {
12233 }
12235 {
12236 /* If RANGE is an array, we will use pointer arithmetic. */
12239 range,
12243 }
12244 else
12245 {
12246 /* If it is not an array, we must do a bit of magic. */
12256 tf_warning_or_error);
12259 tf_warning_or_error);
12262 {
12263 /* Use the member functions. */
12266 }
12267 else
12268 {
12269 /* Use global functions with ADL. */
12276 tf_warning_or_error);
12278 tf_warning_or_error);
12280 tf_warning_or_error);
12282 tf_warning_or_error);
12285 }
12287 /* Last common checks. */
12289 {
12290 /* If one of the expressions is an error do no more checks. */
12293 }
12296 /* Can happen, when, eg, in a template context, Koenig lookup
12297 can't resolve begin/end (c++/58503). */
12299 else
12300 {
12302 /* The unqualified type of the __begin and __end temporaries should
12303 be the same, as required by the multiple auto declaration. */
12305 {
12312 /* P0184R0 allows __begin and __end to have different types,
12313 but make sure they are comparable so we can give a better
12315 else
12319 }
12321 }
12322 }
12323 }
12325 /* Helper function for cp_parser_perform_range_for_lookup.
12326 Builds a tree for RANGE.IDENTIFIER(). */
12328 static tree
12330 {
12343 tf_warning_or_error);
12346 }
12348 /* Parse an iteration-statement.
12350 iteration-statement:
12351 while ( condition ) statement
12352 do statement while ( expression ) ;
12353 for ( init-statement condition [opt] ; expression [opt] )
12354 statement
12356 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12358 static tree
12361 {
12364 tree statement;
12366 token_indent_info guard_tinfo;
12368 /* Peek at the next token. */
12375 /* Remember whether or not we are already within an iteration
12376 statement. */
12379 /* See what kind of keyword it is. */
12382 {
12384 {
12385 tree condition;
12387 /* Begin the while-statement. */
12389 /* Look for the `('. */
12390 matching_parens parens;
12392 /* Parse the condition. */
12395 /* Look for the `)'. */
12397 /* Parse the dependent statement. */
12403 /* We're done with the while-statement. */
12405 }
12409 {
12410 tree expression;
12412 /* Begin the do-statement. */
12414 /* Parse the body of the do-statement. */
12421 /* Look for the `while' keyword. */
12423 /* Look for the `('. */
12424 matching_parens parens;
12426 /* Parse the expression. */
12428 /* We're done with the do-statement. */
12430 /* Look for the `)'. */
12432 /* Look for the `;'. */
12434 }
12438 {
12439 /* Look for the `('. */
12440 matching_parens parens;
12445 /* Look for the `)'. */
12448 /* Parse the body of the for-statement. */
12455 /* We're done with the for-statement. */
12457 }
12464 }
12467 }
12469 /* Parse a init-statement or the declarator of a range-based-for.
12470 Returns true if a range-based-for declaration is seen.
12472 init-statement:
12473 expression-statement
12474 simple-declaration */
12476 static bool
12478 {
12479 /* If the next token is a `;', then we have an empty
12480 expression-statement. Grammatically, this is also a
12481 simple-declaration, but an invalid one, because it does not
12482 declare anything. Therefore, if we did not handle this case
12483 specially, we would issue an error message about an invalid
12484 declaration. */
12486 {
12490 /* Try to parse the init-statement. */
12492 {
12493 tree dummy;
12495 /* Parse the declaration. */
12501 /* That didn't work, try to parse it as an expression-statement. */
12505 {
12507 "range-based %<for%> loops with initializer only "
12510 }
12511 }
12513 /* A colon is used in range-based for. */
12516 /* We're going to speculatively look for a declaration, falling back
12517 to an expression, if necessary. */
12519 /* Parse the declaration. */
12522 decl);
12525 {
12526 /* It is a range-for, consume the ':'. */
12531 "range-based %<for%> loops only available with "
12533 }
12534 else
12535 /* The ';' is not consumed yet because we told
12536 cp_parser_simple_declaration not to. */
12541 /* If the tentative parse failed, then we shall need to look for an
12542 expression-statement. */
12543 }
12544 /* If we are here, it is an expression-statement. */
12547 }
12549 /* Parse a jump-statement.
12551 jump-statement:
12552 break ;
12553 continue ;
12554 return expression [opt] ;
12555 return braced-init-list ;
12556 goto identifier ;
12558 GNU extension:
12560 jump-statement:
12561 goto * expression ;
12563 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12565 static tree
12567 {
12573 /* Peek at the next token. */
12578 /* See what kind of keyword it is. */
12581 {
12585 {
12602 }
12608 {
12612 /* Fall through. */
12622 }
12627 {
12628 tree expr;
12632 {
12636 }
12639 else
12640 /* If the next token is a `;', then there is no
12641 expression. */
12643 /* Build the return-statement. */
12646 else
12648 /* Look for the final `;'. */
12650 }
12656 {
12659 }
12661 /* Create the goto-statement. */
12663 {
12664 /* Issue a warning about this use of a GNU extension. */
12666 /* Consume the '*' token. */
12668 /* Parse the dependent expression. */
12670 }
12671 else
12673 /* Look for the final `;'. */
12680 }
12683 }
12685 /* Parse a declaration-statement.
12687 declaration-statement:
12688 block-declaration */
12690 static void
12692 {
12695 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12698 /* Parse the block-declaration. */
12701 /* Free any declarators allocated. */
12703 }
12705 /* Some dependent statements (like `if (cond) statement'), are
12706 implicitly in their own scope. In other words, if the statement is
12707 a single statement (as opposed to a compound-statement), it is
12708 none-the-less treated as if it were enclosed in braces. Any
12709 declarations appearing in the dependent statement are out of scope
12710 after control passes that point. This function parses a statement,
12711 but ensures that is in its own scope, even if it is not a
12712 compound-statement.
12714 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12715 is a (possibly labeled) if statement which is not enclosed in
12716 braces and has an else clause. This is used to implement
12717 -Wparentheses.
12719 CHAIN is a vector of if-else-if conditions. This is used to implement
12720 -Wduplicated-cond.
12722 Returns the new statement. */
12724 static tree
12728 {
12729 tree statement;
12732 token_indent_info body_tinfo
12738 /* Mark if () ; with a special NOP_EXPR. */
12740 {
12751 }
12752 /* if a compound is opened, we simply parse the statement directly. */
12755 /* If the token is not a `{', then we must take special action. */
12756 else
12757 {
12758 /* Create a compound-statement. */
12760 /* Parse the dependent-statement. */
12763 /* Finish the dummy compound-statement. */
12765 }
12767 token_indent_info next_tinfo
12776 /* Return the statement. */
12778 }
12780 /* For some dependent statements (like `while (cond) statement'), we
12781 have already created a scope. Therefore, even if the dependent
12782 statement is a compound-statement, we do not want to create another
12783 scope. */
12785 static void
12788 {
12789 /* If the token is a `{', then we must take special action. */
12791 {
12792 token_indent_info body_tinfo
12798 token_indent_info next_tinfo
12807 }
12808 else
12809 {
12810 /* Avoid calling cp_parser_compound_statement, so that we
12811 don't create a new scope. Do everything else by hand. */
12812 matching_braces braces;
12814 /* If the next keyword is `__label__' we have a label declaration. */
12817 /* Parse an (optional) statement-seq. */
12820 }
12821 }
12823 /* Declarations [gram.dcl.dcl] */
12825 /* Parse an optional declaration-sequence.
12827 declaration-seq:
12828 declaration
12829 declaration-seq declaration */
12831 static void
12833 {
12835 {
12841 else
12843 }
12844 }
12846 /* Parse a declaration.
12848 declaration:
12849 block-declaration
12850 function-definition
12851 template-declaration
12852 explicit-instantiation
12853 explicit-specialization
12854 linkage-specification
12855 namespace-definition
12857 C++17:
12858 deduction-guide
12860 GNU extension:
12862 declaration:
12863 __extension__ declaration */
12865 static void
12867 {
12868 cp_token token1;
12869 cp_token token2;
12874 /* Check for the `__extension__' keyword. */
12876 {
12877 /* Parse the qualified declaration. */
12879 /* Restore the PEDANTIC flag. */
12883 }
12885 /* Try to figure out what kind of declaration is present. */
12890 else
12891 {
12894 }
12896 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12899 /* If the next token is `extern' and the following token is a string
12900 literal, then we have a linkage specification. */
12904 /* If the next token is `template', then we have either a template
12905 declaration, an explicit instantiation, or an explicit
12906 specialization. */
12908 {
12909 /* `template <>' indicates a template specialization. */
12913 /* `template <' indicates a template declaration. */
12916 /* Anything else must be an explicit instantiation. */
12917 else
12919 }
12920 /* If the next token is `export', then we have a template
12921 declaration. */
12924 /* If the next token is `extern', 'static' or 'inline' and the one
12925 after that is `template', we have a GNU extended explicit
12926 instantiation directive. */
12933 /* If the next token is `namespace', check for a named or unnamed
12934 namespace definition. */
12943 /* An unnamed namespace definition. */
12947 /* An inline (associated) namespace definition. */
12951 /* Objective-C++ declaration/definition. */
12958 /* At this point we may have a template declared by a concept
12959 introduction. */
12964 else
12965 /* Try to parse a block-declaration, or a function-definition. */
12968 /* Free any declarators allocated. */
12970 }
12972 /* Parse a namespace-scope declaration. */
12974 static void
12976 {
12980 /* A top-level declaration can consist solely of a #pragma. A
12981 nested declaration cannot, so this is done here and not in
12982 cp_parser_declaration. (A #pragma at block scope is
12983 handled in cp_parser_statement.) */
12986 {
12987 /* A declaration consisting of a single semicolon is
12988 invalid. Allow it unless we're being pedantic. */
12992 }
12993 else
12994 /* Parse the declaration itself. */
12996 }
12998 /* Parse a block-declaration.
13000 block-declaration:
13001 simple-declaration
13002 asm-definition
13003 namespace-alias-definition
13004 using-declaration
13005 using-directive
13007 GNU Extension:
13009 block-declaration:
13010 __extension__ block-declaration
13012 C++0x Extension:
13014 block-declaration:
13015 static_assert-declaration
13017 If STATEMENT_P is TRUE, then this block-declaration is occurring as
13018 part of a declaration-statement. */
13020 static void
13023 {
13027 /* Check for the `__extension__' keyword. */
13029 {
13030 /* Parse the qualified declaration. */
13032 /* Restore the PEDANTIC flag. */
13036 }
13038 /* Peek at the next token to figure out which kind of declaration is
13039 present. */
13042 /* If the next keyword is `asm', we have an asm-definition. */
13044 {
13048 }
13049 /* If the next keyword is `namespace', we have a
13050 namespace-alias-definition. */
13053 /* If the next keyword is `using', we have a
13054 using-declaration, a using-directive, or an alias-declaration. */
13056 {
13061 /* If the token after `using' is `namespace', then we have a
13062 using-directive. */
13066 /* If the second token after 'using' is '=', then we have an
13067 alias-declaration. */
13073 /* Otherwise, it's a using-declaration. */
13074 else
13077 }
13078 /* If the next keyword is `__label__' we have a misplaced label
13079 declaration. */
13081 {
13085 /* If the next token is now a `;', consume it. */
13088 }
13089 /* If the next token is `static_assert' we have a static assertion. */
13092 /* Anything else must be a simple-declaration. */
13093 else
13096 }
13098 /* Parse a simple-declaration.
13100 simple-declaration:
13101 decl-specifier-seq [opt] init-declarator-list [opt] ;
13102 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13103 brace-or-equal-initializer ;
13105 init-declarator-list:
13106 init-declarator
13107 init-declarator-list , init-declarator
13109 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
13110 function-definition as a simple-declaration.
13112 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
13113 parsed declaration if it is an uninitialized single declarator not followed
13114 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
13115 if present, will not be consumed. */
13117 static void
13121 {
13122 cp_decl_specifier_seq decl_specifiers;
13131 /* Defer access checks until we know what is being declared; the
13132 checks for names appearing in the decl-specifier-seq should be
13133 done as if we were in the scope of the thing being declared. */
13136 /* Parse the decl-specifier-seq. We have to keep track of whether
13137 or not the decl-specifier-seq declares a named class or
13138 enumeration type, since that is the only case in which the
13139 init-declarator-list is allowed to be empty.
13141 [dcl.dcl]
13143 In a simple-declaration, the optional init-declarator-list can be
13144 omitted only when declaring a class or enumeration, that is when
13145 the decl-specifier-seq contains either a class-specifier, an
13146 elaborated-type-specifier, or an enum-specifier. */
13148 CP_PARSER_FLAGS_OPTIONAL,
13151 /* We no longer need to defer access checks. */
13154 /* In a block scope, a valid declaration must always have a
13155 decl-specifier-seq. By not trying to parse declarators, we can
13156 resolve the declaration/expression ambiguity more quickly. */
13159 {
13162 }
13164 /* If the next two tokens are both identifiers, the code is
13165 erroneous. The usual cause of this situation is code like:
13167 T t;
13169 where "T" should name a type -- but does not. */
13172 {
13173 /* If parsing tentatively, we should commit; we really are
13174 looking at a declaration. */
13176 /* Give up. */
13178 }
13183 /* Look for C++17 decomposition declaration. */
13191 {
13192 tree decl
13194 maybe_range_for_decl,
13197 /* The next token should be either a `,' or a `;'. */
13199 /* If it's a `;', we are done. */
13203 {
13207 }
13208 /* Anything else is an error. */
13209 else
13210 {
13211 /* If we have already issued an error message we don't need
13212 to issue another one. */
13217 /* Skip tokens until we reach the end of the statement. */
13219 /* If the next token is now a `;', consume it. */
13223 }
13224 }
13225 else
13228 tree last_type;
13230 /* NULL_TREE if both variable and function declaration are allowed,
13231 error_mark_node if function declaration are not allowed and
13232 a FUNCTION_DECL that should be diagnosed if it is followed by
13233 variable declarations. */
13234 tree auto_function_declaration;
13237 auto_specifier_p
13241 /* Keep going until we hit the `;' at the end of the simple
13242 declaration. */
13245 CPP_SEMICOLON))
13246 {
13249 tree decl;
13253 {
13254 /* If we are processing next declarator, comma is expected */
13259 {
13263 }
13264 }
13265 else
13268 /* Parse the init-declarator. */
13271 function_definition_allowed_p,
13273 declares_class_or_enum,
13275 maybe_range_for_decl,
13278 /* If an error occurred while parsing tentatively, exit quickly.
13279 (That usually happens when in the body of a function; each
13280 statement is treated as a declaration-statement until proven
13281 otherwise.) */
13286 {
13287 /* If the init-declarator-list contains more than one
13288 init-declarator, they shall all form declarations of
13289 variables. */
13291 auto_function_declaration
13295 {
13297 "non-variable %qD in declaration with more than one "
13302 }
13303 }
13307 {
13311 {
13312 /* If the list of declarators contains more than one declarator,
13313 the type of each declared variable is determined as described
13314 above. If the type deduced for the template parameter U is not
13315 the same in each deduction, the program is ill-formed. */
13320 }
13321 else
13323 }
13325 /* Handle function definitions specially. */
13327 {
13328 /* If the next token is a `,', then we are probably
13329 processing something like:
13331 void f() {}, *p;
13333 which is erroneous. */
13335 {
13338 "mixing"
13340 }
13341 /* Otherwise, we're done with the list of declarators. */
13342 else
13343 {
13346 }
13347 }
13350 /* The next token should be either a `,' or a `;'. */
13352 /* If it's a `,', there are more declarators to come. */
13355 /* If it's a `;', we are done. */
13359 {
13364 }
13365 /* Anything else is an error. */
13366 else
13367 {
13368 /* If we have already issued an error message we don't need
13369 to issue another one. */
13374 /* Skip tokens until we reach the end of the statement. */
13376 /* If the next token is now a `;', consume it. */
13380 }
13381 /* After the first time around, a function-definition is not
13382 allowed -- even if it was OK at first. For example:
13384 int i, f() {}
13386 is not valid. */
13388 }
13390 /* Issue an error message if no declarators are present, and the
13391 decl-specifier-seq does not itself declare a class or
13392 enumeration: [dcl.dcl]/3. */
13394 {
13396 {
13400 /* Ensure an error is issued anyway when finish_decltype_type,
13401 called via cp_parser_decl_specifier_seq, returns a class or
13402 an enumeration (c++/51786). */
13405 }
13406 /* Perform any deferred access checks. */
13408 }
13410 /* Consume the `;'. */
13411 finish:
13415 {
13421 }
13423 done:
13425 }
13427 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13428 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13429 initializer ; */
13431 static tree
13436 {
13441 /* Parse the identifier-list. */
13445 {
13453 }
13457 {
13463 else
13464 {
13467 }
13468 }
13474 tree pushed_scope;
13481 NULL_TREE);
13488 cp_expr e;
13489 cp_decl_specifier_seq decl_specs;
13494 {
13498 else
13499 {
13502 }
13503 tree elt_pushed_scope;
13509 {
13510 /* Ensure we've diagnosed redeclaration if we aren't creating
13511 a new VAR_DECL. */
13514 }
13515 else
13519 }
13522 {
13525 }
13529 {
13537 || (is_direct_init
13540 {
13544 }
13547 {
13552 }
13553 }
13555 {
13557 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13558 the underlying DECL. */
13560 }
13566 {
13569 }
13572 }
13574 /* Parse a decl-specifier-seq.
13576 decl-specifier-seq:
13577 decl-specifier-seq [opt] decl-specifier
13578 decl-specifier attribute-specifier-seq [opt] (C++11)
13580 decl-specifier:
13581 storage-class-specifier
13582 type-specifier
13583 function-specifier
13584 friend
13585 typedef
13587 GNU Extension:
13589 decl-specifier:
13590 attributes
13592 Concepts Extension:
13594 decl-specifier:
13595 concept
13597 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13599 The parser flags FLAGS is used to control type-specifier parsing.
13601 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13602 flags:
13604 1: one of the decl-specifiers is an elaborated-type-specifier
13605 (i.e., a type declaration)
13606 2: one of the decl-specifiers is an enum-specifier or a
13607 class-specifier (i.e., a type definition)
13609 */
13611 static void
13613 cp_parser_flags flags,
13616 {
13620 cp_decl_spec ds;
13622 /* Clear DECL_SPECS. */
13625 /* Assume no class or enumeration type is declared. */
13628 /* Keep reading specifiers until there are no more to read. */
13630 {
13635 /* Peek at the next token. */
13638 /* Save the first token of the decl spec list for error
13639 reporting. */
13642 /* Handle attributes. */
13644 {
13645 /* Parse the attributes. */
13648 /* In a sequence of declaration specifiers, c++11 attributes
13649 appertain to the type that precede them. In that case
13650 [dcl.spec]/1 says:
13652 The attribute-specifier-seq affects the type only for
13653 the declaration it appears in, not other declarations
13654 involving the same type.
13656 But for now let's force the user to position the
13657 attribute either at the beginning of the declaration or
13658 after the declarator-id, which would clearly mean that it
13659 applies to the declarator. */
13661 {
13663 /* The c++11 attribute is at the beginning of the
13664 declaration. It appertains to the entity being
13666 else
13667 {
13669 {
13670 /* This is an attribute following a
13671 class-specifier. */
13676 }
13677 else
13678 {
13679 decl_specs->std_attributes
13683 }
13685 }
13686 }
13688 decl_specs->attributes
13693 }
13694 /* Assume we will find a decl-specifier keyword. */
13696 /* If the next token is an appropriate keyword, we can simply
13697 add it to the list. */
13699 {
13700 /* decl-specifier:
13701 friend
13702 constexpr */
13705 {
13710 }
13711 else
13712 {
13714 /* Consume the token. */
13716 }
13729 /* function-specifier:
13730 inline
13731 virtual
13732 explicit */
13739 /* decl-specifier:
13740 typedef */
13743 /* Consume the token. */
13745 /* A constructor declarator cannot appear in a typedef. */
13747 /* The "typedef" keyword can only occur in a declaration; we
13748 may as well commit at this point. */
13755 /* storage-class-specifier:
13756 auto
13757 register
13758 static
13759 extern
13760 mutable
13762 GNU Extension:
13763 thread */
13766 {
13767 /* Consume the token. */
13770 /* Complain about `auto' as a storage specifier, if
13771 we're complaining about C++0x compatibility. */
13775 "%<auto%> changes meaning in C++11; "
13778 /* Set the storage class anyway. */
13780 token);
13781 }
13782 else
13783 /* C++0x auto type-specifier. */
13791 /* Consume the token. */
13794 token);
13797 /* Consume the token. */
13803 /* We did not yet find a decl-specifier yet. */
13806 }
13823 /* Constructors are a special case. The `S' in `S()' is not a
13824 decl-specifier; it is the beginning of the declarator. */
13825 constructor_p
13826 = (!found_decl_spec
13827 && constructor_possible_p
13828 && (cp_parser_constructor_declarator_p
13831 /* If we don't have a DECL_SPEC yet, then we must be looking at
13832 a type-specifier. */
13834 {
13837 tree type_spec;
13839 type_spec
13841 decl_specs,
13847 /* If this type-specifier referenced a user-defined type
13848 (a typedef, class-name, etc.), then we can't allow any
13849 more such type-specifiers henceforth.
13851 [dcl.spec]
13853 The longest sequence of decl-specifiers that could
13854 possibly be a type name is taken as the
13855 decl-specifier-seq of a declaration. The sequence shall
13856 be self-consistent as described below.
13858 [dcl.type]
13860 As a general rule, at most one type-specifier is allowed
13861 in the complete decl-specifier-seq of a declaration. The
13862 only exceptions are the following:
13864 -- const or volatile can be combined with any other
13865 type-specifier.
13867 -- signed or unsigned can be combined with char, long,
13868 short, or int.
13870 -- ..
13872 Example:
13874 typedef char* Pc;
13875 void g (const int Pc);
13877 Here, Pc is *not* part of the decl-specifier seq; it's
13878 the declarator. Therefore, once we see a type-specifier
13879 (other than a cv-qualifier), we forbid any additional
13880 user-defined types. We *do* still allow things like `int
13881 int' to be considered a decl-specifier-seq, and issue the
13882 error message later. */
13885 /* A constructor declarator cannot follow a type-specifier. */
13887 {
13895 }
13896 }
13898 /* If we still do not have a DECL_SPEC, then there are no more
13899 decl-specifiers. */
13904 /* After we see one decl-specifier, further decl-specifiers are
13905 always optional. */
13907 }
13909 /* Don't allow a friend specifier with a class definition. */
13914 }
13916 /* Parse an (optional) storage-class-specifier.
13918 storage-class-specifier:
13919 auto
13920 register
13921 static
13922 extern
13923 mutable
13925 GNU Extension:
13927 storage-class-specifier:
13928 thread
13930 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13932 static tree
13934 {
13936 {
13940 /* Fall through for C++98. */
13948 /* Consume the token. */
13953 }
13954 }
13956 /* Parse an (optional) function-specifier.
13958 function-specifier:
13959 inline
13960 virtual
13961 explicit
13963 C++2A Extension:
13964 explicit(constant-expression)
13966 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13967 Updates DECL_SPECS, if it is non-NULL. */
13969 static tree
13972 {
13975 {
13981 /* 14.5.2.3 [temp.mem]
13983 A member function template shall not be virtual. */
13987 else
13992 {
13994 /* If we see '(', it's C++20 explicit(bool). */
13995 tree expr;
13997 {
13998 matching_parens parens;
14001 /* New types are not allowed in an explicit-specifier. */
14004 parser->type_definition_forbidden_message
14009 "%<explicit(bool)%> only available with -std=c++2a "
14012 /* Parse the constant-expression. */
14015 /* Restore the saved message. */
14018 }
14019 else
14020 /* The explicit-specifier explicit without a constant-expression is
14021 equivalent to the explicit-specifier explicit(true). */
14024 /* [dcl.fct.spec]
14025 "the constant-expression, if supplied, shall be a contextually
14026 converted constant expression of type bool." */
14028 /* We could evaluate it -- mark the decl as appropriate. */
14034 /* The expression was value-dependent. Remember it so that we can
14035 substitute it later. */
14038 }
14042 }
14044 /* Consume the token. */
14046 }
14048 /* Parse a linkage-specification.
14050 linkage-specification:
14051 extern string-literal { declaration-seq [opt] }
14052 extern string-literal declaration */
14054 static void
14056 {
14057 tree linkage;
14059 /* Look for the `extern' keyword. */
14060 cp_token *extern_token
14063 /* Look for the string-literal. */
14067 /* Transform the literal into an identifier. If the literal is a
14068 wide-character string, or contains embedded NULs, then we can't
14069 handle it as the user wants. */
14072 {
14074 /* Assume C++ linkage. */
14076 }
14077 else
14080 /* We're now using the new linkage. */
14083 /* Preserve the location of the the innermost linkage specification,
14084 tracking the locations of nested specifications via a local. */
14085 location_t saved_location
14087 /* Construct a location ranging from the start of the "extern" to
14088 the end of the string-literal, with the caret at the start, e.g.:
14089 extern "C" {
14090 ^~~~~~~~~~
14091 */
14092 parser->innermost_linkage_specification_location
14097 /* If the next token is a `{', then we're using the first
14098 production. */
14100 {
14104 /* Consume the `{' token. */
14105 matching_braces braces;
14107 /* Parse the declarations. */
14109 /* Look for the closing `}'. */
14111 }
14112 /* Otherwise, there's just one declaration. */
14113 else
14114 {
14117 saved_in_unbraced_linkage_specification_p
14121 parser->in_unbraced_linkage_specification_p
14123 }
14125 /* We're done with the linkage-specification. */
14128 /* Restore location of parent linkage specification, if any. */
14130 }
14132 /* Parse a static_assert-declaration.
14134 static_assert-declaration:
14135 static_assert ( constant-expression , string-literal ) ;
14136 static_assert ( constant-expression ) ; (C++17)
14138 If MEMBER_P, this static_assert is a class member. */
14140 static void
14142 {
14143 cp_expr condition;
14144 location_t token_loc;
14145 tree message;
14148 /* Peek at the `static_assert' token so we can keep track of exactly
14149 where the static assertion started. */
14152 /* Look for the `static_assert' keyword. */
14154 RT_STATIC_ASSERT))
14157 /* We know we are in a static assertion; commit to any tentative
14158 parse. */
14162 /* Parse the `(' starting the static assertion condition. */
14163 matching_parens parens;
14166 /* Parse the constant-expression. Allow a non-constant expression
14167 here in order to give better diagnostics in finish_static_assert. */
14168 condition =
14174 {
14177 "static_assert without a message "
14179 /* Eat the ')' */
14184 }
14185 else
14186 {
14187 /* Parse the separating `,'. */
14190 /* Parse the string-literal message. */
14195 /* A `)' completes the static assertion. */
14201 }
14203 /* A semicolon terminates the declaration. */
14206 /* Get the location for the static assertion. Use that of the
14207 condition if available, otherwise, use that of the "static_assert"
14208 token. */
14213 /* Complete the static assertion, which may mean either processing
14214 the static assert now or saving it for template instantiation. */
14216 }
14218 /* Parse the expression in decltype ( expression ). */
14220 static tree
14223 {
14225 tree expr;
14227 /* Since we're going to preserve any side-effects from this parse, set up a
14228 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14229 in the expression. */
14232 /* First, try parsing an id-expression. */
14243 {
14246 cp_id_kind idk;
14250 /* Lookup the name we got back from the id-expression. */
14255 /* A template without args is not a complete id-expression. */
14264 {
14265 /* Complete lookup of the id-expression. */
14266 expr = (finish_id_expression
14279 /* We found an id-expression, but it was something that we
14280 should not have found. This is an error, not something
14281 we can recover from, so note that we found an
14282 id-expression and we'll recover as gracefully as
14283 possible. */
14285 }
14290 /* We have an id-expression. */
14292 }
14295 {
14296 /* Abort the id-expression parse. */
14299 /* Parsing tentatively, again. */
14302 /* Parse a class member access. */
14310 /* We have an id-expression. */
14312 }
14315 /* We have parsed the complete id-expression or member access. */
14317 else
14318 {
14319 /* Abort our attempt to parse an id-expression or member access
14320 expression. */
14323 /* Commit to the tentative_firewall so we get syntax errors. */
14326 /* Parse a full expression. */
14329 }
14332 }
14334 /* Parse a `decltype' type. Returns the type.
14336 simple-type-specifier:
14337 decltype ( expression )
14338 C++14 proposal:
14339 decltype ( auto ) */
14341 static tree
14343 {
14348 {
14349 /* Already parsed. */
14352 }
14354 /* Look for the `decltype' token. */
14358 /* Parse the opening `('. */
14359 matching_parens parens;
14369 /* decltype (auto) */
14371 else
14372 {
14373 /* decltype (expression) */
14375 /* Types cannot be defined in a `decltype' expression. Save away the
14376 old message and set the new one. */
14378 parser->type_definition_forbidden_message
14381 /* The restrictions on constant-expressions do not apply inside
14382 decltype expressions. */
14383 bool saved_integral_constant_expression_p
14385 bool saved_non_integral_constant_expression_p
14389 /* Within a parenthesized expression, a `>' token is always
14390 the greater-than operator. */
14391 bool saved_greater_than_is_operator_p
14395 /* Do not actually evaluate the expression. */
14398 /* Do not warn about problems with the expression. */
14403 /* Go back to evaluating expressions. */
14407 /* The `>' token might be the end of a template-id or
14408 template-parameter-list now. */
14409 parser->greater_than_is_operator_p
14412 /* Restore the old message and the integral constant expression
14413 flags. */
14415 parser->integral_constant_expression_p
14417 parser->non_integral_constant_expression_p
14419 }
14421 /* Parse to the closing `)'. */
14423 {
14428 }
14431 {
14432 /* Build auto. */
14435 }
14436 else
14438 tf_warning_or_error);
14440 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14441 it again. */
14452 }
14454 /* Special member functions [gram.special] */
14456 /* Parse a conversion-function-id.
14458 conversion-function-id:
14459 operator conversion-type-id
14461 Returns an IDENTIFIER_NODE representing the operator. */
14463 static tree
14465 {
14466 tree type;
14467 tree saved_scope;
14468 tree saved_qualifying_scope;
14469 tree saved_object_scope;
14472 /* Look for the `operator' token. */
14475 /* When we parse the conversion-type-id, the current scope will be
14476 reset. However, we need that information in able to look up the
14477 conversion function later, so we save it here. */
14481 /* We must enter the scope of the class so that the names of
14482 entities declared within the class are available in the
14483 conversion-type-id. For example, consider:
14485 struct S {
14486 typedef int I;
14487 operator I();
14488 };
14490 S::operator I() { ... }
14492 In order to see that `I' is a type-name in the definition, we
14493 must be in the scope of `S'. */
14496 /* Parse the conversion-type-id. */
14498 /* Leave the scope of the class, if any. */
14501 /* Restore the saved scope. */
14505 /* If the TYPE is invalid, indicate failure. */
14509 }
14511 /* Parse a conversion-type-id:
14513 conversion-type-id:
14514 type-specifier-seq conversion-declarator [opt]
14516 Returns the TYPE specified. */
14518 static tree
14520 {
14521 tree attributes;
14522 cp_decl_specifier_seq type_specifiers;
14524 tree type_specified;
14527 /* Parse the attributes. */
14531 parser->type_definition_forbidden_message
14534 /* Parse the type-specifiers. */
14541 /* If that didn't work, stop. */
14544 /* Parse the conversion-declarator. */
14552 /* Don't give this error when parsing tentatively. This happens to
14553 work because we always parse this definitively once. */
14556 {
14558 {
14561 }
14565 }
14568 }
14570 /* Parse an (optional) conversion-declarator.
14572 conversion-declarator:
14573 ptr-operator conversion-declarator [opt]
14575 */
14579 {
14582 cp_cv_quals cv_quals;
14584 /* We don't know if there's a ptr-operator next, or not. */
14586 /* Try the ptr-operator. */
14589 /* If it worked, look for more conversion-declarators. */
14591 {
14594 /* Parse another optional declarator. */
14597 declarator = cp_parser_make_indirect_declarator
14601 }
14604 }
14606 /* Parse an (optional) ctor-initializer.
14608 ctor-initializer:
14609 : mem-initializer-list */
14611 static void
14613 {
14614 /* If the next token is not a `:', then there is no
14615 ctor-initializer. */
14617 {
14618 /* Do default initialization of any bases and members. */
14622 }
14624 /* Consume the `:' token. */
14626 /* And the mem-initializer-list. */
14628 }
14630 /* Parse a mem-initializer-list.
14632 mem-initializer-list:
14633 mem-initializer ... [opt]
14634 mem-initializer ... [opt] , mem-initializer-list */
14636 static void
14638 {
14643 /* Let the semantic analysis code know that we are starting the
14644 mem-initializer-list. */
14649 /* Loop through the list. */
14651 {
14652 tree mem_initializer;
14655 /* Parse the mem-initializer. */
14657 /* If the next token is a `...', we're expanding member initializers. */
14663 {
14664 /* Consume the `...'. */
14668 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14669 can be expanded but members cannot. */
14672 {
14677 }
14679 /* Construct the pack expansion type. */
14682 }
14685 {
14689 }
14690 /* Look for a target constructor. */
14694 {
14697 {
14701 }
14703 }
14704 /* Add it to the list, unless it was erroneous. */
14706 {
14709 }
14710 /* If the next token is not a `,', we're done. */
14713 /* Consume the `,' token. */
14715 }
14717 /* Perform semantic analysis. */
14720 }
14722 /* Parse a mem-initializer.
14724 mem-initializer:
14725 mem-initializer-id ( expression-list [opt] )
14726 mem-initializer-id braced-init-list
14728 GNU extension:
14730 mem-initializer:
14731 ( expression-list [opt] )
14733 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14734 class) or FIELD_DECL (for a non-static data member) to initialize;
14735 the TREE_VALUE is the expression-list. An empty initialization
14736 list is represented by void_list_node. */
14738 static tree
14740 {
14741 tree mem_initializer_id;
14742 tree expression_list;
14743 tree member;
14746 /* Find out what is being initialized. */
14748 {
14752 }
14753 else
14754 {
14758 }
14764 {
14771 }
14772 else
14773 {
14783 }
14793 }
14795 /* Parse a mem-initializer-id.
14797 mem-initializer-id:
14798 :: [opt] nested-name-specifier [opt] class-name
14799 decltype-specifier (C++11)
14800 identifier
14802 Returns a TYPE indicating the class to be initialized for the first
14803 production (and the second in C++11). Returns an IDENTIFIER_NODE
14804 indicating the data member to be initialized for the last production. */
14806 static tree
14808 {
14812 tree id;
14816 /* `typename' is not allowed in this context ([temp.res]). */
14818 {
14820 "keyword %<typename%> not allowed in this context (a qualified "
14823 }
14824 /* Look for the optional `::' operator. */
14825 global_scope_p
14829 /* Look for the optional nested-name-specifier. The simplest way to
14830 implement:
14832 [temp.res]
14834 The keyword `typename' is not permitted in a base-specifier or
14835 mem-initializer; in these contexts a qualified name that
14836 depends on a template-parameter is implicitly assumed to be a
14837 type name.
14839 is to assume that we have seen the `typename' keyword at this
14840 point. */
14841 nested_name_specifier_p
14850 /* If there is a `::' operator or a nested-name-specifier, then we
14851 are definitely looking for a class-name. */
14856 typename_type,
14860 /* Otherwise, we could also be looking for an ordinary identifier. */
14863 /* Try a decltype-specifier. */
14865 else
14866 /* Otherwise, try a class-name. */
14870 none_type,
14874 /* If we found one, we're done. */
14877 /* Otherwise, look for an ordinary identifier. */
14879 }
14881 /* Overloading [gram.over] */
14883 /* Parse an operator-function-id.
14885 operator-function-id:
14886 operator operator
14888 Returns an IDENTIFIER_NODE for the operator which is a
14889 human-readable spelling of the identifier, e.g., `operator +'. */
14891 static cp_expr
14893 {
14894 /* Look for the `operator' keyword. */
14897 /* And then the name of the operator itself. */
14899 }
14901 /* Return an identifier node for a user-defined literal operator.
14902 The suffix identifier is chained to the operator name identifier. */
14904 tree
14906 {
14907 tree identifier;
14914 }
14916 /* Parse an operator.
14918 operator:
14919 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14920 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14921 || ++ -- , ->* -> () []
14923 GNU Extensions:
14925 operator:
14926 <? >? <?= >?=
14928 Returns an IDENTIFIER_NODE for the operator which is a
14929 human-readable spelling of the identifier, e.g., `operator +'. */
14931 static cp_expr
14933 {
14938 /* Peek at the next token. */
14943 /* Figure out which operator we have. */
14948 {
14950 {
14951 /* The keyword should be either `new' or `delete'. */
14956 else
14959 /* Consume the `new' or `delete' token. */
14962 /* Peek at the next token. */
14964 /* If it's a `[' token then this is the array variant of the
14965 operator. */
14967 {
14968 /* Consume the `[' token. */
14970 /* Look for the `]' token. */
14975 }
14979 }
15137 {
15138 /* Consume the `('. */
15139 matching_parens parens;
15141 /* Look for the matching `)'. */
15146 }
15149 /* Consume the `['. */
15151 /* Look for the matching `]'. */
15160 /* FALLTHRU */
15169 {
15176 /* Consume the string. */
15182 {
15185 }
15186 else
15187 {
15189 /* Look for the suffix identifier. */
15194 {
15198 }
15199 else
15200 {
15203 }
15204 }
15209 {
15212 }
15215 {
15218 }
15220 {
15223 }
15225 }
15228 /* Anything else is an error. */
15230 }
15232 /* If we have selected an identifier, we need to consume the
15233 operator token. */
15235 {
15239 }
15240 /* Otherwise, no valid operator name was present. */
15241 else
15242 {
15245 }
15248 }
15250 /* Parse a template-declaration.
15252 template-declaration:
15253 export [opt] template < template-parameter-list > declaration
15255 If MEMBER_P is TRUE, this template-declaration occurs within a
15256 class-specifier.
15258 The grammar rule given by the standard isn't correct. What
15259 is really meant is:
15261 template-declaration:
15262 export [opt] template-parameter-list-seq
15263 decl-specifier-seq [opt] init-declarator [opt] ;
15264 export [opt] template-parameter-list-seq
15265 function-definition
15267 template-parameter-list-seq:
15268 template-parameter-list-seq [opt]
15269 template < template-parameter-list >
15271 Concept Extensions:
15273 template-parameter-list-seq:
15274 template < template-parameter-list > requires-clause [opt]
15276 requires-clause:
15277 requires logical-or-expression */
15279 static void
15281 {
15282 /* Check for `export'. */
15284 {
15285 /* Consume the `export' token. */
15287 /* Warn that we do not support `export'. */
15289 }
15292 }
15294 /* Parse a template-parameter-list.
15296 template-parameter-list:
15297 template-parameter
15298 template-parameter-list , template-parameter
15300 Returns a TREE_LIST. Each node represents a template parameter.
15301 The nodes are connected via their TREE_CHAINs. */
15303 static tree
15305 {
15310 /* The loop below parses the template parms. We first need to know
15311 the total number of template parms to be able to compute proper
15312 canonical types of each dependent type. So after the loop, when
15313 we know the total number of template parms,
15314 end_template_parm_list computes the proper canonical types and
15315 fixes up the dependent types accordingly. */
15317 {
15318 tree parameter;
15321 location_t parm_loc;
15323 /* Parse the template-parameter. */
15328 /* Add it to the list. */
15331 parm_loc,
15332 parameter,
15333 is_non_type,
15334 is_parameter_pack);
15335 else
15336 {
15339 }
15341 /* If the next token is not a `,', we're done. */
15344 /* Otherwise, consume the `,' token. */
15346 }
15349 }
15351 /* Parse a introduction-list.
15353 introduction-list:
15354 introduced-parameter
15355 introduction-list , introduced-parameter
15357 introduced-parameter:
15358 ...[opt] identifier
15360 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15361 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15362 WILDCARD_DECL will also have DECL_NAME set and token location in
15363 DECL_SOURCE_LOCATION. */
15365 static tree
15367 {
15371 {
15380 /* Build placeholder. */
15388 /* If the next token is not a `,', we're done. */
15391 /* Otherwise, consume the `,' token. */
15393 }
15395 /* Convert the vec into a TREE_VEC. */
15398 tree parm;
15404 }
15406 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15407 is an abstract declarator. */
15411 {
15416 }
15418 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15419 is an abstract declarator. */
15423 {
15427 else
15429 }
15431 /* Returns true if DECL represents a constrained-parameter. */
15435 {
15440 }
15442 /* Returns true if PARM declares a constrained-parameter. */
15446 {
15448 }
15450 /* Check that the type parameter is only a declarator-id, and that its
15451 type is not cv-qualified. */
15453 bool
15456 {
15461 {
15464 }
15466 /* Don't allow cv-qualified type parameters. */
15469 {
15472 }
15475 }
15477 /* Finish parsing/processing a template type parameter and checking
15478 various restrictions. */
15482 tree id,
15484 {
15487 else
15489 }
15491 static tree
15493 {
15494 /* FIXME: This should probably be copied, and we may need to adjust
15495 the template parameter depths. */
15505 }
15507 /* Finish parsing/processing a template template parameter by borrowing
15508 the template parameter list from the prototype parameter. */
15510 static tree
15512 tree proto,
15513 tree id,
15515 {
15519 }
15521 /* Create a new non-type template parameter from the given PARM
15522 declarator. */
15524 static tree
15527 {
15533 }
15535 /* Build a constrained template parameter based on the PARMDECL
15536 declarator. The type of PARMDECL is the constrained type, which
15537 refers to the prototype template parameter that ultimately
15538 specifies the type of the declared parameter. */
15540 static tree
15545 {
15551 /* A template parameter constrained by a variadic concept shall also
15552 be declared as a template parameter pack. */
15557 /* Build the parameter. Return an error if the declarator was invalid. */
15558 tree parm;
15563 parmdecl);
15564 else
15569 /* Finish the parameter decl and create a node attaching the
15570 default argument and constraint. */
15575 }
15577 /* Returns true if the parsed type actually represents the declaration
15578 of a type template-parameter. */
15582 {
15585 }
15588 /* Returns true if the parsed type actually represents the declaration of
15589 a template template-parameter. */
15591 static bool
15593 {
15596 }
15598 /* Parse a default argument for a type template-parameter.
15599 Note that diagnostics are handled in cp_parser_template_parameter. */
15601 static tree
15603 {
15606 /* Consume the `=' token. */
15611 /* Parse the default-argument. */
15617 {
15621 }
15624 }
15626 /* Parse a default argument for a template template-parameter. */
15628 static tree
15630 {
15635 /* Consume the `='. */
15637 /* Parse the id-expression. */
15639 /* save token before parsing the id-expression, for error
15640 reporting */
15642 tree default_argument
15650 /* If the id-expression was a template-id that refers to
15651 a template-class, we already have the declaration here,
15652 so no further lookup is needed. */
15653 ;
15654 else
15655 /* Look up the name. */
15656 default_argument
15658 none_type,
15664 /* See if the default argument is valid. */
15668 }
15670 /* Parse a template-parameter.
15672 template-parameter:
15673 type-parameter
15674 parameter-declaration
15676 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15677 the parameter. The TREE_PURPOSE is the default value, if any.
15678 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15679 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15680 set to true iff this parameter is a parameter pack. */
15682 static tree
15685 {
15688 tree parm;
15690 /* Assume it is a type parameter or a template parameter. */
15692 /* Assume it not a parameter pack. */
15694 /* Peek at the next token. */
15696 /* If it is `template', we have a type-parameter. */
15699 /* If it is `class' or `typename' we do not know yet whether it is a
15700 type parameter or a non-type parameter. Consider:
15702 template <typename T, typename T::X X> ...
15704 or:
15706 template <class C, class D*> ...
15708 Here, the first parameter is a type parameter, and the second is
15709 a non-type parameter. We can tell by looking at the token after
15710 the identifier -- if it is a `,', `=', or `>' then we have a type
15711 parameter. */
15713 {
15714 /* Peek at the token after `class' or `typename'. */
15716 /* If it's an ellipsis, we have a template type parameter
15717 pack. */
15720 /* If it's an identifier, skip it. */
15723 /* Now, see if the token looks like the end of a template
15724 parameter. */
15729 }
15731 /* Otherwise, it is a non-type parameter or a constrained parameter.
15733 [temp.param]
15735 When parsing a default template-argument for a non-type
15736 template-parameter, the first non-nested `>' is taken as the end
15737 of the template parameter-list rather than a greater-than
15738 operator. */
15739 parameter_declarator
15746 /* If the parameter declaration is marked as a parameter pack, set
15747 *IS_PARAMETER_PACK to notify the caller. */
15752 {
15753 /* Can happen in some cases of erroneous input (c++/34892). */
15755 /* Consume the `...' for better error recovery. */
15757 }
15759 // The parameter may have been constrained.
15762 parameter_declarator,
15763 is_non_type,
15764 is_parameter_pack);
15766 // Now we're sure that the parameter is a non-type parameter.
15777 }
15779 /* Parse a type-parameter.
15781 type-parameter:
15782 class identifier [opt]
15783 class identifier [opt] = type-id
15784 typename identifier [opt]
15785 typename identifier [opt] = type-id
15786 template < template-parameter-list > class identifier [opt]
15787 template < template-parameter-list > class identifier [opt]
15788 = id-expression
15790 GNU Extension (variadic templates):
15792 type-parameter:
15793 class ... identifier [opt]
15794 typename ... identifier [opt]
15796 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15797 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15798 the declaration of the parameter.
15800 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15802 static tree
15804 {
15806 tree parameter;
15808 /* Look for a keyword to tell us what kind of parameter this is. */
15814 {
15817 {
15818 tree identifier;
15819 tree default_argument;
15821 /* If the next token is an ellipsis, we have a template
15822 argument pack. */
15824 {
15825 /* Consume the `...' token. */
15830 }
15832 /* If the next token is an identifier, then it names the
15833 parameter. */
15836 else
15839 /* Create the parameter. */
15842 /* If the next token is an `=', we have a default argument. */
15844 {
15845 default_argument
15848 /* Template parameter packs cannot have default
15849 arguments. */
15851 {
15854 "template parameter pack %qD cannot have a "
15856 else
15858 "template parameter packs cannot have "
15861 }
15864 }
15865 else
15868 /* Create the combined representation of the parameter and the
15869 default argument. */
15871 }
15875 {
15876 tree identifier;
15877 tree default_argument;
15879 /* Look for the `<'. */
15881 /* Parse the template-parameter-list. */
15883 /* Look for the `>'. */
15886 // If template requirements are present, parse them.
15888 {
15893 }
15895 /* Look for the `class' or 'typename' keywords. */
15897 /* If the next token is an ellipsis, we have a template
15898 argument pack. */
15900 {
15901 /* Consume the `...' token. */
15906 }
15907 /* If the next token is an `=', then there is a
15908 default-argument. If the next token is a `>', we are at
15909 the end of the parameter-list. If the next token is a `,',
15910 then we are at the end of this parameter. */
15914 {
15916 /* Treat invalid names as if the parameter were nameless. */
15919 }
15920 else
15923 /* Create the template parameter. */
15925 identifier);
15927 /* If the next token is an `=', then there is a
15928 default-argument. */
15930 {
15931 default_argument
15934 /* Template parameter packs cannot have default
15935 arguments. */
15937 {
15940 "template parameter pack %qD cannot "
15942 identifier);
15943 else
15947 }
15948 }
15949 else
15952 /* Create the combined representation of the parameter and the
15953 default argument. */
15955 }
15961 }
15964 }
15966 /* Parse a template-id.
15968 template-id:
15969 template-name < template-argument-list [opt] >
15971 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15972 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15973 returned. Otherwise, if the template-name names a function, or set
15974 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15975 names a class, returns a TYPE_DECL for the specialization.
15977 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15978 uninstantiated templates. */
15980 static tree
15986 {
15987 tree templ;
15988 tree arguments;
15989 tree template_id;
15994 /* If the next token corresponds to a template-id, there is no need
15995 to reparse it. */
15998 {
16001 }
16003 /* Avoid performing name lookup if there is no possibility of
16004 finding a template-id. */
16007 && !cp_parser_nth_token_starts_template_argument_list_p
16009 {
16012 }
16014 /* Remember where the template-id starts. */
16020 /* Parse the template-name. */
16023 check_dependency_p,
16024 is_declaration,
16025 tag_type,
16028 {
16031 }
16033 /* Since we're going to preserve any side-effects from this parse, set up a
16034 firewall to protect our callers from cp_parser_commit_to_tentative_parse
16035 in the template arguments. */
16038 /* If we find the sequence `[:' after a template-name, it's probably
16039 a digraph-typo for `< ::'. Substitute the tokens and check if we can
16040 parse correctly the argument list. */
16047 {
16049 /* Change `:' into `::'. */
16051 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
16052 CPP_LESS. */
16055 /* Parse the arguments. */
16058 {
16059 /* If we couldn't parse an argument list, then we revert our changes
16060 and return simply an error. Maybe this is not a template-id
16061 after all. */
16066 }
16067 /* Otherwise, emit an error about the invalid digraph, but continue
16068 parsing because we got our argument list. */
16071 {
16074 "%<<:%> is an alternate spelling for %<[%>."
16077 {
16079 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
16082 }
16083 }
16084 }
16085 else
16086 {
16087 /* Look for the `<' that starts the template-argument-list. */
16089 {
16092 }
16093 /* Parse the arguments. */
16098 && !template_keyword_p
16101 {
16102 /* This didn't go well. */
16104 {
16105 /* C++2A says that "function-name < a;" is now ill-formed. */
16107 {
16110 "operand of %<<%> is ill-formed in C++2a; wrap the "
16112 }
16113 else
16114 /* We expect "f<targs>" to be followed by "(args)". */
16118 /* Purge all subsequent tokens. */
16120 }
16121 else
16125 }
16126 }
16128 /* Set the location to be of the form:
16129 template-name < template-argument-list [opt] >
16130 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
16131 with caret == start at the start of the template-name,
16132 ranging until the closing '>'. */
16133 location_t finish_loc
16135 location_t combined_loc
16138 /* Check for concepts autos where they don't belong. We could
16139 identify types in some cases of idnetifier TEMPL, looking ahead
16140 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
16141 types. We reject them in functions, but if what we have is an
16142 identifier, even with none_type we can't conclude it's NOT a
16143 type, we have to wait for template substitution. */
16146 /* Build a representation of the specialization. */
16149 TEMPLATE_ID_EXPR,
16153 {
16154 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
16155 template (rather than some instantiation thereof) only if
16156 is not nested within some other construct. For example, in
16157 "template <typename T> void f(T) { A<T>::", A<T> is just an
16158 instantiation of A. */
16159 bool entering_scope
16162 template_id
16164 }
16165 /* A template-like identifier may be a partial concept id. */
16171 {
16175 }
16176 else
16177 {
16178 /* If it's not a class-template or a template-template, it should be
16179 a function-template. */
16188 }
16190 /* If parsing tentatively, replace the sequence of tokens that makes
16191 up the template-id with a CPP_TEMPLATE_ID token. That way,
16192 should we re-parse the token stream, we will not have to repeat
16193 the effort required to do the parse, nor will we issue duplicate
16194 error messages about problems during instantiation of the
16195 template. */
16197 /* Don't do this if we had a parse error in a declarator; re-parsing
16198 might succeed if a name changes meaning (60361). */
16202 {
16203 /* Reset the contents of the START_OF_ID token. */
16207 /* Retrieve any deferred checks. Do not pop this access checks yet
16208 so the memory will not be reclaimed during token replacing below. */
16214 /* Purge all subsequent tokens. */
16217 /* ??? Can we actually assume that, if template_id ==
16218 error_mark_node, we will have issued a diagnostic to the
16219 user, as opposed to simply marking the tentative parse as
16220 failed? */
16223 }
16227 }
16229 /* Parse a template-name.
16231 template-name:
16232 identifier
16234 The standard should actually say:
16236 template-name:
16237 identifier
16238 operator-function-id
16240 A defect report has been filed about this issue.
16242 A conversion-function-id cannot be a template name because they cannot
16243 be part of a template-id. In fact, looking at this code:
16245 a.operator K<int>()
16247 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
16248 It is impossible to call a templated conversion-function-id with an
16249 explicit argument list, since the only allowed template parameter is
16250 the type to which it is converting.
16252 If TEMPLATE_KEYWORD_P is true, then we have just seen the
16253 `template' keyword, in a construction like:
16255 T::template f<3>()
16257 In that case `f' is taken to be a template-name, even though there
16258 is no way of knowing for sure.
16260 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
16261 name refers to a set of overloaded functions, at least one of which
16262 is a template, or an IDENTIFIER_NODE with the name of the template,
16263 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
16264 names are looked up inside uninstantiated templates. */
16266 static tree
16273 {
16274 tree identifier;
16275 tree decl;
16278 /* If the next token is `operator', then we have either an
16279 operator-function-id or a conversion-function-id. */
16281 {
16282 /* We don't know whether we're looking at an
16283 operator-function-id or a conversion-function-id. */
16285 /* Try an operator-function-id. */
16287 /* If that didn't work, try a conversion-function-id. */
16289 {
16292 }
16293 }
16294 /* Look for the identifier. */
16295 else
16298 /* If we didn't find an identifier, we don't have a template-id. */
16302 /* If the name immediately followed the `template' keyword, then it
16303 is a template-name. However, if the next token is not `<', then
16304 we do not treat it as a template-name, since it is not being used
16305 as part of a template-id. This enables us to handle constructs
16306 like:
16308 template <typename T> struct S { S(); };
16309 template <typename T> S<T>::S();
16311 correctly. We would treat `S' as a template -- if it were `S<T>'
16312 -- but we do not if there is no `<'. */
16316 {
16317 /* In a declaration, in a dependent context, we pretend that the
16318 "template" keyword was present in order to improve error
16319 recovery. For example, given:
16321 template <typename T> void f(T::X<int>);
16323 we want to treat "X<int>" as a template-id. */
16325 && !template_keyword_p
16327 && check_dependency_p
16329 /* Do not do this for dtors (or ctors), since they never
16330 need the template keyword before their name. */
16332 {
16335 /* Explain what went wrong. */
16337 identifier);
16340 /* If parsing tentatively, find the location of the "<" token. */
16343 /* Parse the template arguments so that we can issue error
16344 messages about them. */
16347 /* Skip tokens until we find a good place from which to
16348 continue parsing. */
16353 /* If parsing tentatively, permanently remove the
16354 template argument list. That will prevent duplicate
16355 error messages from being issued about the missing
16356 "template" keyword. */
16363 }
16365 /* If the "template" keyword is present, then there is generally
16366 no point in doing name-lookup, so we just return IDENTIFIER.
16367 But, if the qualifying scope is non-dependent then we can
16368 (and must) do name-lookup normally. */
16370 {
16376 {
16377 /* We're optimizing away the call to cp_parser_lookup_name, but
16378 we still need to do this. */
16381 }
16382 }
16383 }
16385 /* cp_parser_lookup_name clears OBJECT_TYPE. */
16389 /* Look up the name. */
16391 tag_type,
16394 check_dependency_p,
16400 /* If DECL is a template, then the name was a template-name. */
16402 {
16406 }
16407 else
16408 {
16409 /* The standard does not explicitly indicate whether a name that
16410 names a set of overloaded declarations, some of which are
16411 templates, is a template-name. However, such a name should
16412 be a template-name; otherwise, there is no way to form a
16413 template-id for the overloaded templates. */
16423 && !scoped_p
16425 {
16426 /* [temp.names] says "A name is also considered to refer to a template
16427 if it is an unqualified-id followed by a < and name lookup finds
16428 either one or more functions or finds nothing." */
16430 /* The "more functions" case. Just use the OVERLOAD as normally.
16431 We don't use is_overloaded_fn here to avoid considering
16432 BASELINKs. */
16434 /* Name lookup found one function. */
16437 /* Name lookup found nothing. */
16440 }
16443 {
16444 /* The name does not name a template. */
16447 }
16448 }
16451 }
16453 /* Parse a template-argument-list.
16455 template-argument-list:
16456 template-argument ... [opt]
16457 template-argument-list , template-argument ... [opt]
16459 Returns a TREE_VEC containing the arguments. */
16461 static tree
16463 {
16468 tree vec;
16475 /* Even if the template-id appears in an integral
16476 constant-expression, the contents of the argument list do
16477 not. */
16483 /* Parse the arguments. */
16484 do
16485 {
16486 tree argument;
16489 /* Consume the comma. */
16492 /* Parse the template-argument. */
16495 /* If the next token is an ellipsis, we're expanding a template
16496 argument pack. */
16498 {
16500 {
16504 }
16505 /* Consume the `...' token. */
16508 /* Make the argument into a TYPE_PACK_EXPANSION or
16509 EXPR_PACK_EXPANSION. */
16511 }
16514 {
16518 {
16521 }
16522 else
16524 }
16526 }
16542 }
16544 /* Parse a template-argument.
16546 template-argument:
16547 assignment-expression
16548 type-id
16549 id-expression
16551 The representation is that of an assignment-expression, type-id, or
16552 id-expression -- except that the qualified id-expression is
16553 evaluated, so that the value returned is either a DECL or an
16554 OVERLOAD.
16556 Although the standard says "assignment-expression", it forbids
16557 throw-expressions or assignments in the template argument.
16558 Therefore, we use "conditional-expression" instead. */
16560 static tree
16562 {
16563 tree argument;
16569 cp_id_kind idk;
16571 /* There's really no way to know what we're looking at, so we just
16572 try each alternative in order.
16574 [temp.arg]
16576 In a template-argument, an ambiguity between a type-id and an
16577 expression is resolved to a type-id, regardless of the form of
16578 the corresponding template-parameter.
16580 Therefore, we try a type-id first. */
16583 /* If there was no error parsing the type-id but the next token is a
16584 '>>', our behavior depends on which dialect of C++ we're
16585 parsing. In C++98, we probably found a typo for '> >'. But there
16586 are type-id which are also valid expressions. For instance:
16588 struct X { int operator >> (int); };
16589 template <int V> struct Foo {};
16590 Foo<X () >> 5> r;
16592 Here 'X()' is a valid type-id of a function type, but the user just
16593 wanted to write the expression "X() >> 5". Thus, we remember that we
16594 found a valid type-id, but we still try to parse the argument as an
16595 expression to see what happens.
16597 In C++0x, the '>>' will be considered two separate '>'
16598 tokens. */
16602 {
16605 }
16606 else
16607 {
16608 /* If the next token isn't a `,' or a `>', then this argument wasn't
16609 really finished. This means that the argument is not a valid
16610 type-id. */
16613 /* If that worked, we're done. */
16616 }
16617 /* We're still not sure what the argument will be. */
16619 /* Try a template. */
16627 /* If the next token isn't a `,' or a `>', then this argument wasn't
16628 really finished. */
16632 {
16633 /* Figure out what is being referred to. If the id-expression
16634 was for a class template specialization, then we will have a
16635 TYPE_DECL at this point. There is no need to do name lookup
16636 at this point in that case. */
16639 none_type,
16645 /* Handle a constrained-type-specifier for a non-type template
16646 parameter. */
16652 }
16654 {
16658 }
16659 /* It must be a non-type argument. In C++17 any constant-expression is
16660 allowed. */
16664 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16666 -- an integral constant-expression of integral or enumeration
16667 type; or
16669 -- the name of a non-type template-parameter; or
16671 -- the name of an object or function with external linkage...
16673 -- the address of an object or function with external linkage...
16675 -- a pointer to member... */
16676 /* Look for a non-type template parameter. */
16678 {
16690 }
16692 /* If the next token is "&", the argument must be the address of an
16693 object or function with external linkage. */
16696 {
16699 }
16700 /* See if we might have an id-expression. */
16707 {
16710 address_p,
16717 else
16718 {
16719 tree probe;
16722 {
16723 /* Strip the dereference temporarily. */
16726 }
16728 /* If we're in a template, we represent a qualified-id referring
16729 to a static data member as a SCOPE_REF even if the scope isn't
16730 dependent so that we can check access control later. */
16735 {
16736 /* A variable without external linkage might still be a
16737 valid constant-expression, so no error is issued here
16738 if the external-linkage check fails. */
16741 }
16743 /* All overloaded functions are allowed; if the external
16744 linkage test does not pass, an error will be issued
16745 later. */
16746 ;
16750 /* A pointer-to-member. */
16751 ;
16753 ;
16754 else
16758 {
16761 tf_warning_or_error);
16762 else
16765 }
16766 }
16767 }
16768 /* If the argument started with "&", there are no other valid
16769 alternatives at this point. */
16771 {
16774 }
16776 general_expr:
16777 /* If the argument wasn't successfully parsed as a type-id followed
16778 by '>>', the argument can only be a constant expression now.
16779 Otherwise, we try parsing the constant-expression tentatively,
16780 because the argument could really be a type-id. */
16786 else
16787 {
16788 /* With C++17 generalized non-type template arguments we need to handle
16789 lvalue constant expressions, too. */
16792 }
16800 /* We did our best to parse the argument as a non type-id, but that
16801 was the only alternative that matched (albeit with a '>' after
16802 it). We can assume it's just a typo from the user, and a
16803 diagnostic will then be issued. */
16805 }
16807 /* Parse an explicit-instantiation.
16809 explicit-instantiation:
16810 template declaration
16812 Although the standard says `declaration', what it really means is:
16814 explicit-instantiation:
16815 template decl-specifier-seq [opt] declarator [opt] ;
16817 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16818 supposed to be allowed. A defect report has been filed about this
16819 issue.
16821 GNU Extension:
16823 explicit-instantiation:
16824 storage-class-specifier template
16825 decl-specifier-seq [opt] declarator [opt] ;
16826 function-specifier template
16827 decl-specifier-seq [opt] declarator [opt] ; */
16829 static void
16831 {
16833 cp_decl_specifier_seq decl_specifiers;
16838 /* Look for an (optional) storage-class-specifier or
16839 function-specifier. */
16841 {
16842 extension_specifier
16845 extension_specifier
16848 }
16850 /* Look for the `template' keyword. */
16852 /* Let the front end know that we are processing an explicit
16853 instantiation. */
16855 /* [temp.explicit] says that we are supposed to ignore access
16856 control while processing explicit instantiation directives. */
16858 /* Parse a decl-specifier-seq. */
16860 CP_PARSER_FLAGS_OPTIONAL,
16863 /* If there was exactly one decl-specifier, and it declared a class,
16864 and there's no declarator, then we have an explicit type
16865 instantiation. */
16867 {
16868 tree type;
16872 /* Turn access control back on for names used during
16873 template instantiation. */
16878 }
16879 else
16880 {
16882 tree decl;
16884 /* Parse the declarator. */
16885 declarator
16896 {
16899 "explicit instantiation shall not use"
16903 "explicit instantiation shall not use"
16908 /* Turn access control back on for names used during
16909 template instantiation. */
16911 /* Do the explicit instantiation. */
16913 }
16914 else
16915 {
16917 /* Skip the body of the explicit instantiation. */
16919 }
16920 }
16921 /* We're done with the instantiation. */
16927 }
16929 /* Parse an explicit-specialization.
16931 explicit-specialization:
16932 template < > declaration
16934 Although the standard says `declaration', what it really means is:
16936 explicit-specialization:
16937 template <> decl-specifier [opt] init-declarator [opt] ;
16938 template <> function-definition
16939 template <> explicit-specialization
16940 template <> template-declaration */
16942 static void
16944 {
16948 /* Look for the `template' keyword. */
16950 /* Look for the `<'. */
16952 /* Look for the `>'. */
16954 /* We have processed another parameter list. */
16956 /* [temp]
16958 A template ... explicit specialization ... shall not have C
16959 linkage. */
16961 {
16964 /* Give it C++ linkage to avoid confusing other parts of the
16965 front end. */
16968 }
16969 else
16971 /* Let the front end know that we are beginning a specialization. */
16973 {
16976 }
16978 /* If the next keyword is `template', we need to figure out whether
16979 or not we're looking a template-declaration. */
16981 {
16986 else
16988 }
16989 else
16990 /* Parse the dependent declaration. */
16996 /* We're done with the specialization. */
16998 /* For the erroneous case of a template with C linkage, we pushed an
16999 implicit C++ linkage scope; exit that scope now. */
17002 /* We're done with this parameter list. */
17004 }
17006 /* Parse a type-specifier.
17008 type-specifier:
17009 simple-type-specifier
17010 class-specifier
17011 enum-specifier
17012 elaborated-type-specifier
17013 cv-qualifier
17015 GNU Extension:
17017 type-specifier:
17018 __complex__
17020 Returns a representation of the type-specifier. For a
17021 class-specifier, enum-specifier, or elaborated-type-specifier, a
17022 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
17024 The parser flags FLAGS is used to control type-specifier parsing.
17026 If IS_DECLARATION is TRUE, then this type-specifier is appearing
17027 in a decl-specifier-seq.
17029 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
17030 class-specifier, enum-specifier, or elaborated-type-specifier, then
17031 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
17032 if a type is declared; 2 if it is defined. Otherwise, it is set to
17033 zero.
17035 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
17036 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
17037 is set to FALSE. */
17039 static tree
17041 cp_parser_flags flags,
17046 {
17052 /* Assume this type-specifier does not declare a new type. */
17055 /* And that it does not specify a cv-qualifier. */
17058 /* Peek at the next token. */
17061 /* If we're looking at a keyword, we can use that to guide the
17062 production we choose. */
17065 {
17070 /* Look for the enum-specifier. */
17072 /* If that worked, we're done. */
17074 {
17079 type_spec,
17080 token,
17083 }
17084 else
17087 /* Any of these indicate either a class-specifier, or an
17088 elaborated-type-specifier. */
17095 /* Parse tentatively so that we can back up if we don't find a
17096 class-specifier. */
17098 /* Look for the class-specifier. */
17101 /* If that worked, we're done. */
17103 {
17108 type_spec,
17109 token,
17112 }
17114 /* Fall through. */
17115 elaborated_type_specifier:
17116 /* We're declaring (not defining) a class or enum. */
17120 /* Fall through. */
17122 /* Look for an elaborated-type-specifier. */
17123 type_spec
17124 = (cp_parser_elaborated_type_specifier
17127 is_declaration));
17130 type_spec,
17131 token,
17154 /* The `__complex__' keyword is a GNU extension. */
17160 }
17162 /* Handle simple keywords. */
17164 {
17166 {
17169 }
17171 }
17173 /* If we do not already have a type-specifier, assume we are looking
17174 at a simple-type-specifier. */
17176 decl_specs,
17177 flags);
17179 /* If we didn't find a type-specifier, and a type-specifier was not
17180 optional in this context, issue an error message. */
17182 {
17185 }
17188 }
17190 /* Parse a simple-type-specifier.
17192 simple-type-specifier:
17193 :: [opt] nested-name-specifier [opt] type-name
17194 :: [opt] nested-name-specifier template template-id
17195 char
17196 wchar_t
17197 bool
17198 short
17199 int
17200 long
17201 signed
17202 unsigned
17203 float
17204 double
17205 void
17207 C++11 Extension:
17209 simple-type-specifier:
17210 auto
17211 decltype ( expression )
17212 char16_t
17213 char32_t
17214 __underlying_type ( type-id )
17216 C++17 extension:
17218 nested-name-specifier(opt) template-name
17220 GNU Extension:
17222 simple-type-specifier:
17223 __int128
17224 __typeof__ unary-expression
17225 __typeof__ ( type-id )
17226 __typeof__ ( type-id ) { initializer-list , [opt] }
17228 Concepts Extension:
17230 simple-type-specifier:
17231 constrained-type-specifier
17233 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
17234 appropriately updated. */
17236 static tree
17239 cp_parser_flags flags)
17240 {
17245 /* Peek at the next token. */
17248 /* If we're looking at a keyword, things are easy. */
17250 {
17285 {
17288 }
17317 {
17318 /* The 'auto' might be the placeholder return type for a function decl
17319 with trailing return type. */
17328 {
17330 {
17337 }
17340 {
17343 }
17346 }
17350 {
17353 }
17356 {
17359 }
17360 else
17364 {
17367 "use of %<auto%> in lambda parameter declaration "
17368 "only available with "
17370 }
17373 "use of %<auto%> in parameter declaration "
17374 "only available with "
17378 "use of %<auto%> in parameter declaration "
17380 }
17381 else
17386 /* Since DR 743, decltype can either be a simple-type-specifier by
17387 itself or begin a nested-name-specifier. Parsing it will replace
17388 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17389 handling below decide what to do. */
17395 /* Consume the `typeof' token. */
17397 /* Parse the operand to `typeof'. */
17399 /* If it is not already a TYPE, take its type. */
17405 token,
17414 token,
17424 token,
17429 }
17431 /* If token is an already-parsed decltype not followed by ::,
17432 it's a simple-type-specifier. */
17435 {
17438 {
17440 token,
17442 /* Remember that we are handling a decltype in order to
17443 implement the resolution of DR 1510 when the argument
17444 isn't instantiation dependent. */
17446 }
17449 }
17451 /* If the type-specifier was for a built-in type, we're done. */
17453 {
17454 /* Record the type. */
17461 type,
17462 token,
17467 /* Consume the token. */
17473 /* There is no valid C++ program where a non-template type is
17474 followed by a "<". That usually indicates that the user thought
17475 that the type was a template. */
17480 }
17482 /* The type-specifier must be a user-defined type. */
17484 {
17488 /* Don't gobble tokens or issue error messages if this is an
17489 optional type-specifier. */
17495 /* Look for the optional `::' operator. */
17496 global_p
17500 /* Look for the nested-name specifier. */
17501 qualified_p
17508 /* If we have seen a nested-name-specifier, and the next token
17509 is `template', then we are using the template-id production. */
17512 {
17513 /* Look for the template-id. */
17517 none_type,
17519 /* If the template-id did not name a type, we are out of
17520 luck. */
17522 {
17525 }
17526 }
17527 /* Otherwise, look for a type-name. */
17528 else
17530 /* Keep track of all name-lookups performed in class scopes. */
17532 && !global_p
17533 && !qualified_p
17537 /* If it didn't work out, we don't have a TYPE. */
17542 {
17556 {
17558 none_type,
17568 else
17569 {
17574 }
17575 }
17576 else
17582 }
17585 token,
17587 }
17589 /* If we didn't get a type-name, issue an error message. */
17591 {
17594 }
17597 {
17598 /* See if TYPE is an Objective-C type, and if so, parse and
17599 accept any protocol references following it. Do this before
17600 the cp_parser_check_for_invalid_template_id() call, because
17601 Objective-C types can be followed by '<...>' which would
17602 enclose protocol names rather than template arguments, and so
17603 everything is fine. */
17606 {
17610 /* Clobber the "unqualified" type previously entered into
17611 DECL_SPECS with the new, improved protocol-qualified version. */
17616 }
17618 /* There is no valid C++ program where a non-template type is
17619 followed by a "<". That usually indicates that the user
17620 thought that the type was a template. */
17622 none_type,
17624 }
17627 }
17629 /* Parse a type-name.
17631 type-name:
17632 class-name
17633 enum-name
17634 typedef-name
17635 simple-template-id [in c++0x]
17637 enum-name:
17638 identifier
17640 typedef-name:
17641 identifier
17643 Concepts:
17645 type-name:
17646 concept-name
17647 partial-concept-id
17649 concept-name:
17650 identifier
17652 Returns a TYPE_DECL for the type. */
17654 static tree
17656 {
17658 }
17660 /* See above. */
17661 static tree
17663 {
17664 tree type_decl;
17666 /* We can't know yet whether it is a class-name or not. */
17668 /* Try a class-name. */
17670 typename_keyword_p,
17672 none_type,
17676 /* If it's not a class-name, keep looking. */
17678 {
17680 /* It must be a typedef-name or an enum-name. */
17684 /* It is either a simple-template-id representing an
17685 instantiation of an alias template... */
17689 none_type,
17691 /* Note that this must be an instantiation of an alias template
17692 because [temp.names]/6 says:
17694 A template-id that names an alias template specialization
17695 is a type-name.
17697 Whereas [temp.names]/7 says:
17699 A simple-template-id that names a class template
17700 specialization is a class-name.
17702 With concepts, this could also be a partial-concept-id that
17703 declares a non-type template parameter. */
17710 else
17714 /* ... Or a typedef-name or an enum-name. */
17716 }
17719 }
17721 /* Check if DECL and ARGS can form a constrained-type-specifier.
17722 If ARGS is non-null, we try to form a concept check of the
17723 form DECL<?, ARGS> where ? is a wildcard that matches any
17724 kind of template argument. If ARGS is NULL, then we try to
17725 form a concept check of the form DECL<?>. */
17727 static tree
17730 {
17733 /* If we a constrained-type-specifier cannot be deduced. */
17737 /* A constrained type specifier can only be found in an
17738 overload set or as a reference to a template declaration.
17740 FIXME: This might be masking a bug. It's possible that
17741 that the deduction below is causing template specializations
17742 to be formed with the wildcard as an argument. */
17746 /* Try to build a call expression that evaluates the
17747 concept. This can fail if the overload set refers
17748 only to non-templates. */
17754 /* Deduce the checked constraint and the prototype parameter.
17756 FIXME: In certain cases, failure to deduce should be a
17757 diagnosable error. */
17758 tree conc;
17759 tree proto;
17763 /* In template parameter scope, this results in a constrained
17764 parameter. Return a descriptor of that parm. */
17768 /* In a parameter-declaration-clause, constrained-type
17769 specifiers result in invented template parameters. */
17771 {
17774 }
17775 else
17776 {
17777 /* Otherwise, we're in a context where the constrained
17778 type name is deduced and the constraint applies
17779 after deduction. */
17781 }
17784 }
17786 /* If DECL refers to a concept, return a TYPE_DECL representing
17787 the result of using the constrained type specifier in the
17788 current context. DECL refers to a concept if
17790 - it is an overload set containing a function concept taking a single
17791 type argument, or
17793 - it is a variable concept taking a single type argument. */
17795 static tree
17797 {
17803 else
17805 }
17807 /* Check if DECL and ARGS form a partial-concept-id. If so,
17808 assign ID to the resulting constrained placeholder.
17810 Returns true if the partial-concept-id designates a placeholder
17811 and false otherwise. Note that *id is set to NULL_TREE in
17812 this case. */
17814 static tree
17816 {
17818 }
17820 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17821 or a concept-name.
17823 enum-name:
17824 identifier
17826 typedef-name:
17827 identifier
17829 concept-name:
17830 identifier
17832 Returns a TYPE_DECL for the type. */
17834 static tree
17836 {
17837 tree type_decl;
17838 tree identifier;
17845 /* Look up the type-name. */
17850 /* If we found an overload set, then it may refer to a concept-name. */
17856 {
17857 /* See if this is an Objective-C type. */
17862 }
17864 /* Issue an error if we did not find a type-name. */
17866 /* In Objective-C, we have the complication that class names are
17867 normally type names and start declarations (eg, the
17868 "NSObject" in "NSObject *object;"), but can be used in an
17869 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17870 is an expression. So, a classname followed by a dot is not a
17871 valid type-name. */
17874 {
17879 }
17880 /* Remember that the name was used in the definition of the
17881 current class so that we can check later to see if the
17882 meaning would have been different after the class was
17883 entirely defined. */
17889 }
17891 /* Parse an elaborated-type-specifier. Note that the grammar given
17892 here incorporates the resolution to DR68.
17894 elaborated-type-specifier:
17895 class-key :: [opt] nested-name-specifier [opt] identifier
17896 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17897 enum-key :: [opt] nested-name-specifier [opt] identifier
17898 typename :: [opt] nested-name-specifier identifier
17899 typename :: [opt] nested-name-specifier template [opt]
17900 template-id
17902 GNU extension:
17904 elaborated-type-specifier:
17905 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17906 class-key attributes :: [opt] nested-name-specifier [opt]
17907 template [opt] template-id
17908 enum attributes :: [opt] nested-name-specifier [opt] identifier
17910 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17911 declared `friend'. If IS_DECLARATION is TRUE, then this
17912 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17913 something is being declared.
17915 Returns the TYPE specified. */
17917 static tree
17921 {
17923 tree identifier;
17926 tree globalscope;
17929 /* See if we're looking at the `enum' keyword. */
17931 {
17932 /* Consume the `enum' token. */
17934 /* Remember that it's an enumeration type. */
17936 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17937 enums) is used here. */
17941 {
17948 /* Consume the `struct' or `class' and parse it anyway. */
17950 }
17951 /* Parse the attributes. */
17953 }
17954 /* Or, it might be `typename'. */
17956 RID_TYPENAME))
17957 {
17958 /* Consume the `typename' token. */
17960 /* Remember that it's a `typename' type. */
17962 }
17963 /* Otherwise it must be a class-key. */
17964 else
17965 {
17969 /* Parse the attributes. */
17971 }
17973 /* Look for the `::' operator. */
17976 /* Look for the nested-name-specifier. */
17977 tree nested_name_specifier;
17979 {
17980 nested_name_specifier
17985 is_declaration);
17988 }
17989 else
17990 /* Even though `typename' is not present, the proposed resolution
17991 to Core Issue 180 says that in `class A<T>::B', `B' should be
17992 considered a type-name, even if `A<T>' is dependent. */
17993 nested_name_specifier
17998 is_declaration);
17999 /* For everything but enumeration types, consider a template-id.
18000 For an enumeration type, consider only a plain identifier. */
18002 {
18004 tree decl;
18006 /* Allow the `template' keyword. */
18008 /* If we didn't see `template', we don't know if there's a
18009 template-id or not. */
18012 /* Parse the template-id. */
18016 tag_type,
18017 is_declaration);
18018 /* If we didn't find a template-id, look for an ordinary
18019 identifier. */
18021 ;
18022 /* We can get here when cp_parser_template_id, called by
18023 cp_parser_class_name with tag_type == none_type, succeeds
18024 and caches a BASELINK. Then, when called again here,
18025 instead of failing and returning an error_mark_node
18026 returns it (see template/typename17.C in C++11).
18027 ??? Could we diagnose this earlier? */
18029 {
18032 }
18033 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
18034 in effect, then we must assume that, upon instantiation, the
18035 template will correspond to a class. */
18039 typename_type,
18041 /* If the `typename' keyword is in effect and DECL is not a type
18042 decl, then type is non existent. */
18044 ;
18046 {
18050 /* If the next token is a semicolon, this must be a specialization,
18051 instantiation, or friend declaration. Check the scope while we
18052 still know whether or not we had a nested-name-specifier. */
18057 }
18060 }
18063 {
18068 {
18071 }
18073 /* For a `typename', we needn't call xref_tag. */
18079 /* Template parameter lists apply only if we are not within a
18080 function parameter list. */
18081 bool template_parm_lists_apply
18090 /* Look up a qualified name in the usual way. */
18092 {
18093 tree decl;
18094 tree ambiguous_decls;
18097 tag_type,
18104 /* If the lookup was ambiguous, an error will already have been
18105 issued. */
18109 /* If we are parsing friend declaration, DECL may be a
18110 TEMPLATE_DECL tree node here. However, we need to check
18111 whether this TEMPLATE_DECL results in valid code. Consider
18112 the following example:
18114 namespace N {
18115 template <class T> class C {};
18116 }
18117 class X {
18118 template <class T> friend class N::C; // #1, valid code
18119 };
18120 template <class T> class Y {
18121 friend class N::C; // #2, invalid code
18122 };
18124 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
18125 name lookup of `N::C'. We see that friend declaration must
18126 be template for the code to be valid. Note that
18127 processing_template_decl does not work here since it is
18128 always 1 for the above two cases. */
18130 decl = (cp_parser_maybe_treat_template_as_class
18135 {
18137 identifier,
18140 }
18143 {
18147 allow_template);
18151 }
18153 /* Forward declarations of nested types, such as
18155 class C1::C2;
18156 class C1::C2::C3;
18158 are invalid unless all components preceding the final '::'
18159 are complete. If all enclosing types are complete, these
18160 declarations become merely pointless.
18162 Invalid forward declarations of nested types are errors
18163 caught elsewhere in parsing. Those that are pointless arrive
18164 here. */
18171 }
18172 else
18173 {
18174 /* An elaborated-type-specifier sometimes introduces a new type and
18175 sometimes names an existing type. Normally, the rule is that it
18176 introduces a new type only if there is not an existing type of
18177 the same name already in scope. For example, given:
18179 struct S {};
18180 void f() { struct S s; }
18182 the `struct S' in the body of `f' is the same `struct S' as in
18183 the global scope; the existing definition is used. However, if
18184 there were no global declaration, this would introduce a new
18185 local class named `S'.
18187 An exception to this rule applies to the following code:
18189 namespace N { struct S; }
18191 Here, the elaborated-type-specifier names a new type
18192 unconditionally; even if there is already an `S' in the
18193 containing scope this declaration names a new type.
18194 This exception only applies if the elaborated-type-specifier
18195 forms the complete declaration:
18197 [class.name]
18199 A declaration consisting solely of `class-key identifier ;' is
18200 either a redeclaration of the name in the current scope or a
18201 forward declaration of the identifier as a class name. It
18202 introduces the name into the current scope.
18204 We are in this situation precisely when the next token is a `;'.
18206 An exception to the exception is that a `friend' declaration does
18207 *not* name a new type; i.e., given:
18209 struct S { friend struct T; };
18211 `T' is not a new type in the scope of `S'.
18213 Also, `new struct S' or `sizeof (struct S)' never results in the
18214 definition of a new type; a new type can only be declared in a
18215 declaration context. */
18217 tag_scope ts;
18221 /* Friends have special name lookup rules. */
18225 CPP_SEMICOLON))
18226 /* This is a `class-key identifier ;' */
18228 else
18231 template_p =
18232 (template_parm_lists_apply
18235 /* An unqualified name was used to reference this type, so
18236 there were no qualifying templates. */
18245 }
18246 }
18251 /* Allow attributes on forward declarations of classes. */
18253 {
18263 else
18266 }
18269 {
18270 /* Indicate whether this class was declared as a `class' or as a
18271 `struct'. */
18275 }
18277 /* A "<" cannot follow an elaborated type specifier. If that
18278 happens, the user was probably trying to form a template-id. */
18283 }
18285 /* Parse an enum-specifier.
18287 enum-specifier:
18288 enum-head { enumerator-list [opt] }
18289 enum-head { enumerator-list , } [C++0x]
18291 enum-head:
18292 enum-key identifier [opt] enum-base [opt]
18293 enum-key nested-name-specifier identifier enum-base [opt]
18295 enum-key:
18296 enum
18297 enum class [C++0x]
18298 enum struct [C++0x]
18300 enum-base: [C++0x]
18301 : type-specifier-seq
18303 opaque-enum-specifier:
18304 enum-key identifier enum-base [opt] ;
18306 GNU Extensions:
18307 enum-key attributes[opt] identifier [opt] enum-base [opt]
18308 { enumerator-list [opt] }attributes[opt]
18309 enum-key attributes[opt] identifier [opt] enum-base [opt]
18310 { enumerator-list, }attributes[opt] [C++0x]
18312 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
18313 if the token stream isn't an enum-specifier after all. */
18315 static tree
18317 {
18318 tree identifier;
18320 tree prev_scope;
18322 tree attributes;
18335 /* Parse tentatively so that we can back up if we don't find a
18336 enum-specifier. */
18339 /* Caller guarantees that the current token is 'enum', an identifier
18340 possibly follows, and the token after that is an opening brace.
18341 If we don't have an identifier, fabricate an anonymous name for
18342 the enumeration being defined. */
18345 /* Parse the "class" or "struct", which indicates a scoped
18346 enumeration type in C++0x. */
18349 {
18353 /* Consume the `struct' or `class' token. */
18357 }
18361 /* Clear the qualification. */
18366 /* Figure out in what scope the declaration is being placed. */
18372 nested_name_specifier
18380 {
18381 tree name;
18385 enum_type,
18390 input_location);
18392 {
18395 {
18396 /* Are template enums allowed in ISO? */
18400 /* ignore a typename reference, for it will be solved by name
18401 in start_enum. */
18403 }
18404 }
18407 else
18408 {
18413 }
18414 }
18415 else
18416 {
18419 else
18420 {
18426 }
18427 }
18430 /* Check for the `:' that denotes a specified underlying type in C++0x.
18431 Note that a ':' could also indicate a bitfield width, however. */
18433 {
18434 cp_decl_specifier_seq type_specifiers;
18436 /* Consume the `:'. */
18439 /* Parse the type-specifier-seq. */
18444 /* At this point this is surely not elaborated type specifier. */
18453 /* If that didn't work, stop. */
18455 {
18461 }
18462 }
18464 /* Look for the `{' but don't consume it yet. */
18466 {
18468 {
18471 {
18474 }
18475 }
18476 /* An opaque-enum-specifier must have a ';' here. */
18479 {
18482 {
18485 }
18486 }
18487 }
18493 {
18495 {
18499 }
18501 {
18503 }
18504 }
18506 /* Issue an error message if type-definitions are forbidden here. */
18509 else
18510 /* Create the new type. We do this before consuming the opening
18511 brace so the enum will be recorded as being on the line of its
18512 tag (or the 'enum' keyword, if there is no tag). */
18516 /* If the next token is not '{' it is an opaque-enum-specifier or an
18517 elaborated-type-specifier. */
18519 {
18523 {
18524 /* The following catches invalid code such as:
18525 enum class S<int>::E { A, B, C }; */
18533 {
18537 nested_name_specifier);
18539 }
18542 {
18544 "%qT for enum declaration does not name a class "
18547 }
18548 /* If that scope does not contain the scope in which the
18549 class was originally declared, the program is invalid. */
18551 nested_name_specifier))
18552 {
18555 "declaration of %qD in namespace %qD which does not "
18558 else
18560 "declaration of %qD in %qD which does not "
18564 }
18565 /* If that scope is the scope where the declaration is being placed
18566 the program is invalid. */
18570 {
18574 }
18575 }
18580 /* Consume the opening brace. */
18581 matching_braces braces;
18588 {
18592 }
18593 else
18594 {
18600 }
18604 /* If the next token is not '}', then there are some enumerators. */
18606 {
18610 }
18611 else
18614 /* Consume the final '}'. */
18620 }
18621 else
18622 {
18623 /* If a ';' follows, then it is an opaque-enum-specifier
18624 and additional restrictions apply. */
18626 {
18633 }
18634 }
18636 /* Look for trailing attributes to apply to this enumeration, and
18637 apply them if appropriate. */
18639 {
18642 trailing_attr,
18644 }
18646 /* Finish up the enumeration. */
18648 {
18653 }
18656 {
18658 {
18661 }
18663 {
18665 }
18666 }
18667 out:
18670 }
18672 /* Parse an enumerator-list. The enumerators all have the indicated
18673 TYPE.
18675 enumerator-list:
18676 enumerator-definition
18677 enumerator-list , enumerator-definition */
18679 static void
18681 {
18683 {
18684 /* Parse an enumerator-definition. */
18687 /* If the next token is not a ',', we've reached the end of
18688 the list. */
18691 /* Otherwise, consume the `,' and keep going. */
18693 /* If the next token is a `}', there is a trailing comma. */
18695 {
18700 }
18701 }
18702 }
18704 /* Parse an enumerator-definition. The enumerator has the indicated
18705 TYPE.
18707 enumerator-definition:
18708 enumerator
18709 enumerator = constant-expression
18711 enumerator:
18712 identifier
18714 GNU Extensions:
18716 enumerator-definition:
18717 enumerator attributes [opt]
18718 enumerator attributes [opt] = constant-expression */
18720 static void
18722 {
18723 tree identifier;
18724 tree value;
18725 location_t loc;
18727 /* Save the input location because we are interested in the location
18728 of the identifier and not the location of the explicit value. */
18731 /* Look for the identifier. */
18736 /* Parse any specified attributes. */
18739 /* If the next token is an '=', then there is an explicit value. */
18741 {
18742 /* Consume the `=' token. */
18744 /* Parse the value. */
18746 }
18747 else
18750 /* If we are processing a template, make sure the initializer of the
18751 enumerator doesn't contain any bare template parameter pack. */
18755 /* Create the enumerator. */
18757 }
18759 /* Parse a namespace-name.
18761 namespace-name:
18762 original-namespace-name
18763 namespace-alias
18765 Returns the NAMESPACE_DECL for the namespace. */
18767 static tree
18769 {
18770 tree identifier;
18771 tree namespace_decl;
18775 /* Get the name of the namespace. */
18780 /* Look up the identifier in the currently active scope. Look only
18781 for namespaces, due to:
18783 [basic.lookup.udir]
18785 When looking up a namespace-name in a using-directive or alias
18786 definition, only namespace names are considered.
18788 And:
18790 [basic.lookup.qual]
18792 During the lookup of a name preceding the :: scope resolution
18793 operator, object, function, and enumerator names are ignored.
18795 (Note that cp_parser_qualifying_entity only calls this
18796 function if the token after the name is the scope resolution
18797 operator.) */
18799 none_type,
18805 /* If it's not a namespace, issue an error. */
18808 {
18810 {
18811 auto_diagnostic_group d;
18812 name_hint hint;
18816 identifier,
18819 {
18825 }
18826 else
18828 identifier);
18829 }
18830 else
18833 }
18836 }
18838 /* Parse a namespace-definition.
18840 namespace-definition:
18841 named-namespace-definition
18842 unnamed-namespace-definition
18844 named-namespace-definition:
18845 original-namespace-definition
18846 extension-namespace-definition
18848 original-namespace-definition:
18849 namespace identifier { namespace-body }
18851 extension-namespace-definition:
18852 namespace original-namespace-name { namespace-body }
18854 unnamed-namespace-definition:
18855 namespace { namespace-body } */
18857 static void
18859 {
18860 tree identifier;
18869 {
18872 }
18874 /* Look for the `namespace' keyword. */
18875 cp_token* token
18878 /* Parse any specified attributes before the identifier. */
18882 {
18886 {
18891 "standard attributes on namespaces must precede "
18894 /* Parse any attributes specified after the identifier. */
18896 }
18903 "nested namespace definitions only available with "
18906 /* Nested namespace names can create new namespaces (unlike
18907 other qualified-ids). */
18910 else
18913 }
18925 /* Start the namespace. */
18932 /* Look for the `{' to validate starting the namespace. */
18933 matching_braces braces;
18935 {
18936 /* Parse the body of the namespace. */
18939 /* Look for the final `}'. */
18941 }
18946 /* Pop the nested namespace definitions. */
18949 }
18951 /* Parse a namespace-body.
18953 namespace-body:
18954 declaration-seq [opt] */
18956 static void
18958 {
18960 }
18962 /* Parse a namespace-alias-definition.
18964 namespace-alias-definition:
18965 namespace identifier = qualified-namespace-specifier ; */
18967 static void
18969 {
18970 tree identifier;
18971 tree namespace_specifier;
18975 /* Look for the `namespace' keyword. */
18977 /* Look for the identifier. */
18981 /* Look for the `=' token. */
18984 {
18986 /* Skip the definition. */
18991 }
18993 /* Look for the qualified-namespace-specifier. */
18994 namespace_specifier
18996 /* Look for the `;' token. */
18999 /* Register the alias in the symbol table. */
19001 }
19003 /* Parse a qualified-namespace-specifier.
19005 qualified-namespace-specifier:
19006 :: [opt] nested-name-specifier [opt] namespace-name
19008 Returns a NAMESPACE_DECL corresponding to the specified
19009 namespace. */
19011 static tree
19013 {
19014 /* Look for the optional `::'. */
19018 /* Look for the optional nested-name-specifier. */
19026 }
19028 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
19029 access declaration.
19031 using-declaration:
19032 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
19033 using :: unqualified-id ;
19035 access-declaration:
19036 qualified-id ;
19038 */
19040 static bool
19043 {
19047 tree decl;
19048 tree identifier;
19049 tree qscope;
19054 {
19057 }
19058 else
19059 {
19060 /* Look for the `using' keyword. */
19063 again:
19064 /* Peek at the next token. */
19066 /* See if it's `typename'. */
19068 {
19069 /* Remember that we've seen it. */
19071 /* Consume the `typename' token. */
19073 }
19074 }
19076 /* Look for the optional global scope qualification. */
19077 global_scope_p
19082 /* If we saw `typename', or didn't see `::', then there must be a
19083 nested-name-specifier present. */
19085 {
19091 {
19094 }
19095 }
19096 /* Otherwise, we could be in either of the two productions. In that
19097 case, treat the nested-name-specifier as optional. */
19098 else
19110 /* Something has already gone wrong; there's no need to parse
19111 further. Since an error has occurred, the return value of
19112 cp_parser_parse_definitely will be false, as required. */
19116 /* Parse the unqualified-id. */
19124 {
19129 }
19131 {
19136 "pack expansion in using-declaration only available "
19139 }
19141 /* The function we call to handle a using-declaration is different
19142 depending on what scope we are in. */
19144 ;
19147 /* [namespace.udecl]
19149 A using declaration shall not name a template-id. */
19152 else
19153 {
19155 {
19156 /* Create the USING_DECL. */
19163 {
19166 }
19167 else
19168 /* Add it to the list of members in this class. */
19170 }
19171 else
19172 {
19174 identifier,
19181 {
19184 }
19187 else
19189 }
19190 }
19194 {
19198 "comma-separated list in using-declaration only available "
19201 }
19203 /* Look for the final `;'. */
19208 "access declarations are deprecated "
19209 "in favour of using-declarations; "
19213 }
19215 /* Parse an alias-declaration.
19217 alias-declaration:
19218 using identifier attribute-specifier-seq [opt] = type-id */
19220 static tree
19222 {
19226 cp_decl_specifier_seq decl_specs;
19230 /* Look for the `using' keyword. */
19231 cp_token *using_token
19253 /* Now we are going to parse the type-id of the declaration. */
19255 /*
19256 [dcl.type]/3 says:
19258 "A type-specifier-seq shall not define a class or enumeration
19259 unless it appears in the type-id of an alias-declaration (7.1.3) that
19260 is not the declaration of a template-declaration."
19262 In other words, if we currently are in an alias template, the
19263 type-id should not define a type.
19265 So let's set parser->type_definition_forbidden_message in that
19266 case; cp_parser_check_type_definition (called by
19267 cp_parser_class_specifier) will then emit an error if a type is
19268 defined in the type-id. */
19270 {
19274 }
19278 /* Restore the error message if need be. */
19284 {
19287 }
19289 /* A typedef-name can also be introduced by an alias-declaration. The
19290 identifier following the using keyword becomes a typedef-name. It has
19291 the same semantics as if it were introduced by the typedef
19292 specifier. In particular, it does not define a new type and it shall
19293 not appear in the type-id. */
19298 {
19301 ds_attribute,
19302 attrs_token);
19303 }
19305 ds_typedef,
19306 using_token);
19308 ds_alias,
19309 using_token);
19316 id_location,
19326 else
19332 // Attach constraints to the alias declaration.
19334 {
19338 }
19345 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19346 added into the symbol table; otherwise, return the TYPE_DECL. */
19350 {
19354 }
19357 }
19359 /* Parse a using-directive.
19361 using-directive:
19362 using namespace :: [opt] nested-name-specifier [opt]
19363 namespace-name ; */
19365 static void
19367 {
19368 tree namespace_decl;
19369 tree attribs;
19371 /* Look for the `using' keyword. */
19373 /* And the `namespace' keyword. */
19375 /* Look for the optional `::' operator. */
19377 /* And the optional nested-name-specifier. */
19383 /* Get the namespace being used. */
19385 /* And any specified attributes. */
19388 /* Update the symbol table. */
19391 else
19394 /* Look for the final `;'. */
19396 }
19398 /* Parse an asm-definition.
19400 asm-definition:
19401 asm ( string-literal ) ;
19403 GNU Extension:
19405 asm-definition:
19406 asm volatile [opt] ( string-literal ) ;
19407 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19408 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19409 : asm-operand-list [opt] ) ;
19410 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19411 : asm-operand-list [opt]
19412 : asm-clobber-list [opt] ) ;
19413 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19414 : asm-clobber-list [opt]
19415 : asm-goto-list ) ; */
19417 static void
19419 {
19420 tree string;
19425 tree asm_stmt;
19433 /* Look for the `asm' keyword. */
19438 {
19441 }
19443 /* See if the next token is `volatile'. */
19446 {
19447 /* Remember that we saw the `volatile' keyword. */
19449 /* Consume the token. */
19451 }
19455 {
19456 /* Remember that we saw the `goto' keyword. */
19458 /* Consume the token. */
19460 }
19461 /* Look for the opening `('. */
19464 /* Look for the string. */
19467 {
19471 }
19473 /* If we're allowing GNU extensions, check for the extended assembly
19474 syntax. Unfortunately, the `:' tokens need not be separated by
19475 a space in C, and so, for compatibility, we tolerate that here
19476 too. Doing that means that we have to treat the `::' operator as
19477 two `:' tokens. */
19482 {
19487 /* The extended syntax was used. */
19490 /* Look for outputs. */
19492 {
19493 /* Consume the `:'. */
19495 /* Parse the output-operands. */
19497 CPP_COLON)
19499 CPP_SCOPE)
19501 CPP_CLOSE_PAREN)
19503 {
19507 }
19508 }
19509 /* If the next token is `::', there are no outputs, and the
19510 next token is the beginning of the inputs. */
19512 /* The inputs are coming next. */
19515 /* Look for inputs. */
19518 {
19519 /* Consume the `:' or `::'. */
19521 /* Parse the output-operands. */
19523 CPP_COLON)
19525 CPP_SCOPE)
19527 CPP_CLOSE_PAREN))
19528 {
19532 }
19533 }
19535 /* The clobbers are coming next. */
19538 /* Look for clobbers. */
19541 {
19543 /* Consume the `:' or `::'. */
19545 /* Parse the clobbers. */
19547 CPP_COLON)
19549 CPP_CLOSE_PAREN))
19551 }
19554 /* The labels are coming next. */
19557 /* Look for labels. */
19560 {
19562 /* Consume the `:' or `::'. */
19564 /* Parse the labels. */
19566 }
19570 }
19574 /* Look for the closing `)'. */
19582 {
19583 /* Create the ASM_EXPR. */
19585 {
19588 /* If the extended syntax was not used, mark the ASM_EXPR. */
19590 {
19596 }
19597 }
19598 else
19600 }
19601 }
19603 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19604 type that comes from the decl-specifier-seq. */
19606 static tree
19608 {
19611 {
19624 }
19627 }
19629 /* Declarators [gram.dcl.decl] */
19631 /* Parse an init-declarator.
19633 init-declarator:
19634 declarator initializer [opt]
19636 GNU Extension:
19638 init-declarator:
19639 declarator asm-specification [opt] attributes [opt] initializer [opt]
19641 function-definition:
19642 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19643 function-body
19644 decl-specifier-seq [opt] declarator function-try-block
19646 GNU Extension:
19648 function-definition:
19649 __extension__ function-definition
19651 TM Extension:
19653 function-definition:
19654 decl-specifier-seq [opt] declarator function-transaction-block
19656 The DECL_SPECIFIERS apply to this declarator. Returns a
19657 representation of the entity declared. If MEMBER_P is TRUE, then
19658 this declarator appears in a class scope. The new DECL created by
19659 this declarator is returned.
19661 The CHECKS are access checks that should be performed once we know
19662 what entity is being declared (and, therefore, what classes have
19663 befriended it).
19665 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19666 for a function-definition here as well. If the declarator is a
19667 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19668 be TRUE upon return. By that point, the function-definition will
19669 have been completely parsed.
19671 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19672 is FALSE.
19674 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19675 parsed declaration if it is an uninitialized single declarator not followed
19676 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19677 if present, will not be consumed. If returned, this declarator will be
19678 created with SD_INITIALIZED but will not call cp_finish_decl.
19680 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19681 and there is an initializer, the pointed location_t is set to the
19682 location of the '=' or `(', or '{' in C++11 token introducing the
19683 initializer. */
19685 static tree
19696 {
19700 tree prefix_attributes;
19702 tree asm_specification;
19703 tree initializer;
19705 tree scope;
19707 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19708 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19709 "(...)". */
19720 /* Gather the attributes that were provided with the
19721 decl-specifiers. */
19724 /* Assume that this is not the declarator for a function
19725 definition. */
19729 /* Default arguments are only permitted for function parameters. */
19733 /* Defer access checks while parsing the declarator; we cannot know
19734 what names are accessible until we know what is being
19735 declared. */
19740 /* Parse the declarator. */
19741 declarator
19746 /* Gather up the deferred checks. */
19751 /* If the DECLARATOR was erroneous, there's no need to go
19752 further. */
19756 /* Check that the number of template-parameter-lists is OK. */
19766 /* Figure out what scope the entity declared by the DECLARATOR is
19767 located in. `grokdeclarator' sometimes changes the scope, so
19768 we compute it now. */
19771 /* Perform any lookups in the declared type which were thought to be
19772 dependent, but are not in the scope of the declarator. */
19773 decl_specifiers->type
19776 /* If we're allowing GNU extensions, look for an
19777 asm-specification. */
19779 {
19780 /* Look for an asm-specification. */
19783 }
19784 else
19787 /* Look for attributes. */
19791 /* Peek at the next token. */
19797 {
19798 /* Handle C++17 deduction guides. */
19802 {
19810 {
19814 }
19815 }
19817 /* Check to see if the token indicates the start of a
19818 function-definition. */
19820 {
19822 {
19823 /* If a function-definition should not appear here, issue an
19824 error message. */
19828 }
19830 location_t func_brace_location
19833 /* Neither attributes nor an asm-specification are allowed
19834 on a function-definition. */
19837 "an asm-specification is not allowed "
19841 "attributes are not allowed "
19843 /* This is a function-definition. */
19846 /* Parse the function definition. */
19849 decl_specifiers,
19850 declarator,
19851 prefix_attributes);
19852 else
19853 decl =
19854 (cp_parser_function_definition_from_specifiers_and_declarator
19858 {
19859 /* This is where the prologue starts... */
19862 }
19865 }
19866 }
19868 {
19869 /* A non-template declaration involving a function parameter list
19870 containing an implicit template parameter will be made into a
19871 template. If the resulting declaration is not going to be an
19872 actual function then finish the template scope here to prevent it.
19873 An error message will be issued once we have a decl to talk about.
19875 FIXME probably we should do type deduction rather than create an
19876 implicit template, but the standard currently doesn't allow it. */
19879 }
19881 /* [dcl.dcl]
19883 Only in function declarations for constructors, destructors, type
19884 conversions, and deduction guides can the decl-specifier-seq be omitted.
19886 We explicitly postpone this check past the point where we handle
19887 function-definitions because we tolerate function-definitions
19888 that are missing their return types in some modes. */
19890 {
19894 }
19896 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19900 {
19911 {
19917 }
19918 }
19919 else
19920 {
19921 /* If the init-declarator isn't initialized and isn't followed by a
19922 `,' or `;', it's not a valid init-declarator. */
19925 {
19928 else
19929 {
19933 }
19934 }
19937 }
19939 /* Because start_decl has side-effects, we should only call it if we
19940 know we're going ahead. By this point, we know that we cannot
19941 possibly be looking at any other construct. */
19944 /* Enter the newly declared entry in the symbol table. If we're
19945 processing a declaration in a class-specifier, we wait until
19946 after processing the initializer. */
19948 {
19956 /* Adjust location of decl if declarator->id_loc is more appropriate:
19957 set, and decl wasn't merged with another decl, in which case its
19958 location would be different from input_location, and more accurate. */
19963 }
19965 /* Enter the SCOPE. That way unqualified names appearing in the
19966 initializer will be looked up in SCOPE. */
19969 /* Perform deferred access control checks, now that we know in which
19970 SCOPE the declared entity resides. */
19972 {
19975 /* If the entity being declared is a function, pretend that we
19976 are in its scope. If it is a `friend', it may have access to
19977 things that would not otherwise be accessible. */
19979 {
19982 }
19984 /* Perform access checks for template parameters. */
19987 /* Perform the access control checks for the declarator and the
19988 decl-specifiers. */
19991 /* Restore the saved value. */
19994 }
19996 /* Parse the initializer. */
20001 {
20003 {
20006 else
20007 {
20008 /* If the declaration was erroneous, we don't really
20009 know what the user intended, so just silently
20010 consume the initializer. */
20017 }
20018 }
20019 else
20020 {
20021 /* We want to record the extra mangling scope for in-class
20022 initializers of class members and initializers of static data
20023 member templates. The former involves deferring
20024 parsing of the initializer until end of class as with default
20025 arguments. So right here we only handle the latter. */
20035 }
20036 }
20038 /* The old parser allows attributes to appear after a parenthesized
20039 initializer. Mark Mitchell proposed removing this functionality
20040 on the GCC mailing lists on 2002-08-13. This parser accepts the
20041 attributes -- but ignores them. Made a permerror in GCC 8. */
20047 {
20050 {
20054 }
20055 }
20057 /* And now complain about a non-function implicit template. */
20062 /* For an in-class declaration, use `grokfield' to create the
20063 declaration. */
20065 {
20067 {
20070 }
20079 }
20081 /* Finish processing the declaration. But, skip member
20082 declarations. */
20084 {
20087 asm_specification,
20088 /* If the initializer is in parentheses, then this is
20089 a direct-initialization, which means that an
20090 `explicit' constructor is OK. Otherwise, an
20091 `explicit' constructor cannot be used. */
20094 }
20097 /* Core issue #226 (C++0x only): A default template-argument
20098 shall not be specified in a friend class template
20099 declaration. */
20108 {
20111 else
20113 }
20120 }
20122 /* Parse a declarator.
20124 declarator:
20125 direct-declarator
20126 ptr-operator declarator
20128 abstract-declarator:
20129 ptr-operator abstract-declarator [opt]
20130 direct-abstract-declarator
20132 GNU Extensions:
20134 declarator:
20135 attributes [opt] direct-declarator
20136 attributes [opt] ptr-operator declarator
20138 abstract-declarator:
20139 attributes [opt] ptr-operator abstract-declarator [opt]
20140 attributes [opt] direct-abstract-declarator
20142 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
20143 detect constructors, destructors, deduction guides, or conversion operators.
20144 It is set to -1 if the declarator is a name, and +1 if it is a
20145 function. Otherwise it is set to zero. Usually you just want to
20146 test for >0, but internally the negative value is used.
20148 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
20149 a decl-specifier-seq unless it declares a constructor, destructor,
20150 or conversion. It might seem that we could check this condition in
20151 semantic analysis, rather than parsing, but that makes it difficult
20152 to handle something like `f()'. We want to notice that there are
20153 no decl-specifiers, and therefore realize that this is an
20154 expression, not a declaration.)
20156 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
20157 the declarator is a direct-declarator of the form "(...)".
20159 MEMBER_P is true iff this declarator is a member-declarator.
20161 FRIEND_P is true iff this declarator is a friend. */
20165 cp_parser_declarator_kind dcl_kind,
20169 {
20172 cp_cv_quals cv_quals;
20173 tree class_type;
20176 /* Assume this is not a constructor, destructor, or type-conversion
20177 operator. */
20184 /* Check for the ptr-operator production. */
20186 /* Parse the ptr-operator. */
20192 /* If that worked, then we have a ptr-operator. */
20194 {
20195 /* If a ptr-operator was found, then this declarator was not
20196 parenthesized. */
20199 /* The dependent declarator is optional if we are parsing an
20200 abstract-declarator. */
20204 /* Parse the dependent declarator. */
20209 friend_p);
20211 /* If we are parsing an abstract-declarator, we must handle the
20212 case where the dependent declarator is absent. */
20217 declarator = cp_parser_make_indirect_declarator
20219 }
20220 /* Everything else is a direct-declarator. */
20221 else
20222 {
20225 CPP_OPEN_PAREN);
20227 ctor_dtor_or_conv_p,
20229 }
20234 }
20236 /* Parse a direct-declarator or direct-abstract-declarator.
20238 direct-declarator:
20239 declarator-id
20240 direct-declarator ( parameter-declaration-clause )
20241 cv-qualifier-seq [opt]
20242 ref-qualifier [opt]
20243 exception-specification [opt]
20244 direct-declarator [ constant-expression [opt] ]
20245 ( declarator )
20247 direct-abstract-declarator:
20248 direct-abstract-declarator [opt]
20249 ( parameter-declaration-clause )
20250 cv-qualifier-seq [opt]
20251 ref-qualifier [opt]
20252 exception-specification [opt]
20253 direct-abstract-declarator [opt] [ constant-expression [opt] ]
20254 ( abstract-declarator )
20256 Returns a representation of the declarator. DCL_KIND is
20257 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
20258 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
20259 we are parsing a direct-declarator. It is
20260 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
20261 of ambiguity we prefer an abstract declarator, as per
20262 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
20263 as for cp_parser_declarator. */
20267 cp_parser_declarator_kind dcl_kind,
20270 {
20281 {
20282 /* Peek at the next token. */
20285 {
20286 /* This is either a parameter-declaration-clause, or a
20287 parenthesized declarator. When we know we are parsing a
20288 named declarator, it must be a parenthesized declarator
20289 if FIRST is true. For instance, `(int)' is a
20290 parameter-declaration-clause, with an omitted
20291 direct-abstract-declarator. But `((*))', is a
20292 parenthesized abstract declarator. Finally, when T is a
20293 template parameter `(T)' is a
20294 parameter-declaration-clause, and not a parenthesized
20295 named declarator.
20297 We first try and parse a parameter-declaration-clause,
20298 and then try a nested declarator (if FIRST is true).
20300 It is not an error for it not to be a
20301 parameter-declaration-clause, even when FIRST is
20302 false. Consider,
20304 int i (int);
20305 int i (3);
20307 The first is the declaration of a function while the
20308 second is the definition of a variable, including its
20309 initializer.
20311 Having seen only the parenthesis, we cannot know which of
20312 these two alternatives should be selected. Even more
20313 complex are examples like:
20315 int i (int (a));
20316 int i (int (3));
20318 The former is a function-declaration; the latter is a
20319 variable initialization.
20321 Thus again, we try a parameter-declaration-clause, and if
20322 that fails, we back out and return. */
20325 {
20326 tree params;
20331 /* In a member-declarator, the only valid interpretation
20332 of a parenthesis is the start of a
20333 parameter-declaration-clause. (It is invalid to
20334 initialize a static data member with a parenthesized
20335 initializer; only the "=" form of initialization is
20336 permitted.) */
20340 /* Consume the `('. */
20341 matching_parens parens;
20344 {
20345 /* If this is going to be an abstract declarator, we're
20346 in a declarator and we can't have default args. */
20349 }
20353 /* Parse the parameter-declaration-clause. */
20356 /* Consume the `)'. */
20359 /* If all went well, parse the cv-qualifier-seq,
20360 ref-qualifier and the exception-specification. */
20362 {
20363 cp_cv_quals cv_quals;
20364 cp_virt_specifiers virt_specifiers;
20365 cp_ref_qualifier ref_qual;
20366 tree exception_specification;
20367 tree late_return;
20368 tree attrs;
20378 /* Parse the cv-qualifier-seq. */
20380 /* Parse the ref-qualifier. */
20382 /* Parse the tx-qualifier. */
20384 /* And the exception-specification. */
20385 exception_specification
20390 /* In here, we handle cases where attribute is used after
20391 the function declaration. For example:
20392 void func (int x) __attribute__((vector(..))); */
20395 late_return = (cp_parser_late_return_type_opt
20399 /* Parse the virt-specifier-seq. */
20402 /* Create the function-declarator. */
20404 params,
20405 cv_quals,
20406 virt_specifiers,
20407 ref_qual,
20408 tx_qual,
20409 exception_specification,
20410 late_return,
20411 requires_clause);
20414 /* Any subsequent parameter lists are to do with
20415 return type, so are not those of the declared
20416 function. */
20418 }
20420 /* Remove the function parms from scope. */
20424 /* Repeat the main loop. */
20426 }
20428 /* If this is the first, we can try a parenthesized
20429 declarator. */
20431 {
20438 /* Consume the `('. */
20439 matching_parens parens;
20441 /* Parse the nested declarator. */
20444 declarator
20450 /* Expect a `)'. */
20458 }
20459 /* Otherwise, we must be done. */
20460 else
20462 }
20466 {
20467 /* Parse an array-declarator. */
20477 /* Consume the `['. */
20479 /* Peek at the next token. */
20481 /* If the next token is `]', then there is no
20482 constant-expression. */
20484 {
20486 bounds
20496 {
20497 /* Normally, the array bound must be an integral constant
20498 expression. However, as an extension, we allow VLAs
20499 in function scopes as long as they aren't part of a
20500 parameter declaration. */
20504 }
20507 {
20508 /* Remember this wasn't a constant-expression. */
20511 }
20512 }
20513 else
20515 /* Look for the closing `]'. */
20517 {
20520 }
20525 }
20527 {
20528 {
20529 tree qualifying_scope;
20530 tree unqualified_name;
20531 tree attrs;
20532 special_function_kind sfk;
20537 /* Parse a declarator-id */
20540 {
20543 /* If we see an ellipsis, we should be looking at a
20544 parameter pack. */
20546 {
20547 /* Consume the `...' */
20551 }
20552 }
20555 unqualified_name
20559 {
20563 {
20564 /* Check whether an error occurred. */
20567 /* We already consumed the ellipsis to mark a
20568 parameter pack, but we have no way to report it,
20569 so abort the tentative parse. We will be exiting
20570 immediately anyway. */
20572 }
20573 else
20579 && (qualifying_scope
20581 {
20584 }
20585 }
20590 {
20595 }
20601 {
20602 /* In the declaration of a member of a template class
20603 outside of the class itself, the SCOPE will sometimes
20604 be a TYPENAME_TYPE. For example, given:
20606 template <typename T>
20607 int S<T>::R::i = 3;
20609 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20610 this context, we must resolve S<T>::R to an ordinary
20611 type, rather than a typename type.
20613 The reason we normally avoid resolving TYPENAME_TYPEs
20614 is that a specialization of `S' might render
20615 `S<T>::R' not a type. However, if `S' is
20616 specialized, then this `i' will not be used, so there
20617 is no harm in resolving the types here. */
20618 tree type;
20620 /* Resolve the TYPENAME_TYPE. */
20623 /* If that failed, the declarator is invalid. */
20625 {
20628 "cannot define member of dependent typedef "
20630 else
20635 }
20637 }
20642 {
20643 tree class_type;
20648 else
20652 {
20656 {
20657 /* We do not attempt to print the declarator
20658 here because we do not have enough
20659 information about its original syntactic
20660 form. */
20664 }
20667 {
20671 "use %<%T::%D%> instead of %<%T::%D%> to "
20673 class_type,
20678 }
20680 }
20683 {
20690 for an unnamed type, even if the type
20691 got a name for linkage purposes. */
20693 /* Handle correctly (c++/19200):
20695 struct S {
20696 struct T{};
20697 friend void S(T);
20698 };
20700 and also:
20702 namespace N {
20703 void S();
20704 }
20706 struct S {
20707 friend void N::S();
20708 }; */
20711 class_type))
20720 }
20721 }
20723 unqualified_name,
20730 }
20732 handle_declarator:;
20735 {
20736 /* Any names that appear after the declarator-id for a
20737 member are looked up in the containing scope. */
20739 {
20740 /* But declarations with qualified-ids can't appear in a
20741 function. */
20745 }
20747 }
20751 /* Default args are only allowed on function
20752 declarations. */
20754 else
20758 }
20759 /* We're done. */
20760 else
20762 }
20764 /* For an abstract declarator, we might wind up with nothing at this
20765 point. That's an error; the declarator is not optional. */
20769 {
20770 /* Record overly parenthesized declarator so we can give a
20771 diagnostic about confusing decl/expr disambiguation. */
20773 {
20774 /* If the open and close parens are on different lines, this
20775 is probably a formatting thing, so ignore. */
20780 }
20783 }
20785 /* If we entered a scope, we must exit it now. */
20793 }
20795 /* Parse a ptr-operator.
20797 ptr-operator:
20798 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20799 * cv-qualifier-seq [opt]
20800 &
20801 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20802 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20804 GNU Extension:
20806 ptr-operator:
20807 & cv-qualifier-seq [opt]
20809 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20810 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20811 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20812 filled in with the TYPE containing the member. *CV_QUALS is
20813 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20814 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20815 Note that the tree codes returned by this function have nothing
20816 to do with the types of trees that will be eventually be created
20817 to represent the pointer or reference type being parsed. They are
20818 just constants with suggestive names. */
20819 static enum tree_code
20824 {
20829 /* Assume that it's not a pointer-to-member. */
20831 /* And that there are no cv-qualifiers. */
20834 /* Peek at the next token. */
20837 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20847 {
20848 /* Consume the `*', `&' or `&&'. */
20851 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20852 `&', if we are allowing GNU extensions. (The only qualifier
20853 that can legally appear after `&' is `restrict', but that is
20854 enforced during semantic analysis. */
20862 }
20863 else
20864 {
20865 /* Try the pointer-to-member case. */
20867 /* Look for the optional `::' operator. */
20870 /* Look for the nested-name specifier. */
20877 /* If we found it, and the next token is a `*', then we are
20878 indeed looking at a pointer-to-member operator. */
20881 {
20882 /* Indicate that the `*' operator was used. */
20890 else
20891 {
20892 /* The type of which the member is a member is given by the
20893 current SCOPE. */
20895 /* The next name will not be qualified. */
20899 /* Look for optional c++11 attributes. */
20903 /* Look for the optional cv-qualifier-seq. */
20905 }
20906 }
20907 /* If that didn't work we don't have a ptr-operator. */
20910 }
20913 }
20915 /* Parse an (optional) cv-qualifier-seq.
20917 cv-qualifier-seq:
20918 cv-qualifier cv-qualifier-seq [opt]
20920 cv-qualifier:
20921 const
20922 volatile
20924 GNU Extension:
20926 cv-qualifier:
20927 __restrict__
20929 Returns a bitmask representing the cv-qualifiers. */
20931 static cp_cv_quals
20933 {
20937 {
20939 cp_cv_quals cv_qualifier;
20941 /* Peek at the next token. */
20943 /* See if it's a cv-qualifier. */
20945 {
20961 }
20967 {
20972 }
20973 else
20974 {
20977 }
20978 }
20981 }
20983 /* Parse an (optional) ref-qualifier
20985 ref-qualifier:
20986 &
20987 &&
20989 Returns cp_ref_qualifier representing ref-qualifier. */
20991 static cp_ref_qualifier
20993 {
20996 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
21001 {
21006 {
21018 }
21023 {
21026 }
21027 else
21028 {
21031 }
21032 }
21035 }
21037 /* Parse an optional tx-qualifier.
21039 tx-qualifier:
21040 transaction_safe
21041 transaction_safe_dynamic */
21043 static tree
21045 {
21048 {
21053 {
21057 {
21060 {
21063 }
21064 else
21066 }
21067 }
21068 }
21070 }
21072 /* Parse an (optional) virt-specifier-seq.
21074 virt-specifier-seq:
21075 virt-specifier virt-specifier-seq [opt]
21077 virt-specifier:
21078 override
21079 final
21081 Returns a bitmask representing the virt-specifiers. */
21083 static cp_virt_specifiers
21085 {
21089 {
21091 cp_virt_specifiers virt_specifier;
21093 /* Peek at the next token. */
21095 /* See if it's a virt-specifier-qualifier. */
21099 {
21102 }
21104 {
21107 }
21109 {
21111 }
21112 else
21116 {
21121 }
21122 else
21123 {
21126 }
21127 }
21129 }
21131 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
21132 is in scope even though it isn't real. */
21134 void
21136 {
21137 tree this_parm;
21140 {
21141 /* We don't clear this between NSDMIs. Is it already what we want? */
21148 }
21151 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
21153 current_class_ref
21156 }
21158 /* Return true iff our current scope is a non-static data member
21159 initializer. */
21161 bool
21163 {
21164 /* We recognize NSDMI context by the context-less 'this' pointer set up
21165 by the function above. */
21171 }
21173 /* Parse a late-specified return type, if any. This is not a separate
21174 non-terminal, but part of a function declarator, which looks like
21176 -> trailing-type-specifier-seq abstract-declarator(opt)
21178 Returns the type indicated by the type-id.
21180 In addition to this, parse any queued up #pragma omp declare simd
21181 clauses, and #pragma acc routine clauses.
21183 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
21184 function. */
21186 static tree
21189 {
21193 && declarator
21197 && declarator
21200 /* Peek at the next token. */
21202 /* A late-specified return type is indicated by an initial '->'. */
21213 {
21214 /* DR 1207: 'this' is in scope in the trailing return type. */
21216 }
21219 {
21220 /* Consume the ->. */
21224 }
21226 /* Function declarations may be followed by a trailing
21227 requires-clause. */
21231 declarator->attributes
21235 declarator->attributes
21240 {
21243 }
21246 }
21248 /* Parse a declarator-id.
21250 declarator-id:
21251 id-expression
21252 :: [opt] nested-name-specifier [opt] type-name
21254 In the `id-expression' case, the value returned is as for
21255 cp_parser_id_expression if the id-expression was an unqualified-id.
21256 If the id-expression was a qualified-id, then a SCOPE_REF is
21257 returned. The first operand is the scope (either a NAMESPACE_DECL
21258 or TREE_TYPE), but the second is still just a representation of an
21259 unqualified-id. */
21261 static tree
21263 {
21264 tree id;
21265 /* The expression must be an id-expression. Assume that qualified
21266 names are the names of types so that:
21268 template <class T>
21269 int S<T>::R::i = 3;
21271 will work; we must treat `S<T>::R' as the name of a type.
21272 Similarly, assume that qualified names are templates, where
21273 required, so that:
21275 template <class T>
21276 int S<T>::R<T>::i = 3;
21278 will work, too. */
21284 optional_p);
21288 }
21290 /* Parse a type-id.
21292 type-id:
21293 type-specifier-seq abstract-declarator [opt]
21295 Returns the TYPE specified. */
21297 static tree
21300 {
21301 cp_decl_specifier_seq type_specifier_seq;
21304 /* Parse the type-specifier-seq. */
21306 is_trailing_return,
21314 /* A bare template name as a template argument is a template template
21315 argument, not a placeholder, so fail parsing it as a type argument. */
21316 {
21320 }
21324 /* There might or might not be an abstract declarator. */
21326 /* Look for the declarator. */
21327 abstract_declarator
21332 /* Check to see if there really was a declarator. */
21337 /* The concepts TS allows 'auto' as a type-id. */
21339 /* None of the valid uses of 'auto' in C++14 involve the type-id
21340 nonterminal, but it is valid in a trailing-return-type. */
21343 {
21344 /* A type-id with type 'auto' is only ok if the abstract declarator
21345 is a function declarator with a late-specified return type.
21347 A type-id with 'auto' is also valid in a trailing-return-type
21348 in a compound-requirement. */
21355 else
21356 {
21359 {
21361 auto_node);
21363 tmpl);
21364 }
21365 else
21368 }
21369 }
21372 is_template_arg);
21373 }
21375 static tree
21377 {
21379 }
21381 static tree
21383 {
21384 tree r;
21386 parser->type_definition_forbidden_message
21391 {
21394 }
21396 }
21398 static tree
21400 {
21402 }
21404 /* Parse a type-specifier-seq.
21406 type-specifier-seq:
21407 type-specifier type-specifier-seq [opt]
21409 GNU extension:
21411 type-specifier-seq:
21412 attributes type-specifier-seq [opt]
21414 If IS_DECLARATION is true, we are at the start of a "condition" or
21415 exception-declaration, so we might be followed by a declarator-id.
21417 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21418 i.e. we've just seen "->".
21420 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21422 static void
21427 {
21432 /* Clear the TYPE_SPECIFIER_SEQ. */
21435 /* In the context of a trailing return type, enum E { } is an
21436 elaborated-type-specifier followed by a function-body, not an
21437 enum-specifier. */
21441 /* Parse the type-specifiers and attributes. */
21443 {
21444 tree type_specifier;
21447 /* Check for attributes first. */
21449 {
21450 type_specifier_seq->attributes
21454 }
21456 /* record the token of the beginning of the type specifier seq,
21457 for error reporting purposes*/
21461 /* Look for the type-specifier. */
21463 flags,
21464 type_specifier_seq,
21466 NULL,
21469 {
21470 /* If the first type-specifier could not be found, this is not a
21471 type-specifier-seq at all. */
21473 {
21474 /* Set in_declarator_p to avoid skipping to the semicolon. */
21486 }
21487 /* If subsequent type-specifiers could not be found, the
21488 type-specifier-seq is complete. */
21490 }
21493 /* The standard says that a condition can be:
21495 type-specifier-seq declarator = assignment-expression
21497 However, given:
21499 struct S {};
21500 if (int S = ...)
21502 we should treat the "S" as a declarator, not as a
21503 type-specifier. The standard doesn't say that explicitly for
21504 type-specifier-seq, but it does say that for
21505 decl-specifier-seq in an ordinary declaration. Perhaps it
21506 would be clearer just to allow a decl-specifier-seq here, and
21507 then add a semantic restriction that if any decl-specifiers
21508 that are not type-specifiers appear, the program is invalid. */
21511 }
21512 }
21514 /* Return whether the function currently being declared has an associated
21515 template parameter list. */
21517 static bool
21519 {
21532 }
21534 /* Parse a parameter-declaration-clause.
21536 parameter-declaration-clause:
21537 parameter-declaration-list [opt] ... [opt]
21538 parameter-declaration-list , ...
21540 Returns a representation for the parameter declarations. A return
21541 value of NULL indicates a parameter-declaration-clause consisting
21542 only of an ellipsis. */
21544 static tree
21546 {
21547 tree parameters;
21555 && !processing_template_parmlist
21556 && !processing_explicit_instantiation
21557 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21558 actual function or a random abstract declarator. */
21564 /* Peek at the next token. */
21566 /* Check for trivial parameter-declaration-clauses. */
21568 {
21569 /* Consume the `...' token. */
21572 }
21574 /* There are no parameters. */
21576 /* Check for `(void)', too, which is a special case. */
21580 {
21581 /* Consume the `void' token. */
21583 /* There are no parameters. */
21585 }
21587 /* Parse the parameter-declaration-list. */
21589 /* If a parse error occurred while parsing the
21590 parameter-declaration-list, then the entire
21591 parameter-declaration-clause is erroneous. */
21595 /* Peek at the next token. */
21597 /* If it's a `,', the clause should terminate with an ellipsis. */
21599 {
21600 /* Consume the `,'. */
21602 /* Expect an ellipsis. */
21603 ellipsis_p
21605 }
21606 /* It might also be `...' if the optional trailing `,' was
21607 omitted. */
21609 {
21610 /* Consume the `...' token. */
21612 /* And remember that we saw it. */
21614 }
21615 else
21618 /* Finish the parameter list. */
21623 }
21625 /* Parse a parameter-declaration-list.
21627 parameter-declaration-list:
21628 parameter-declaration
21629 parameter-declaration-list , parameter-declaration
21631 Returns a representation of the parameter-declaration-list, as for
21632 cp_parser_parameter_declaration_clause. However, the
21633 `void_list_node' is never appended to the list. */
21635 static tree
21637 {
21643 /* The special considerations that apply to a function within an
21644 unbraced linkage specifications do not apply to the parameters
21645 to the function. */
21646 saved_in_unbraced_linkage_specification_p
21650 /* Look for more parameters. */
21652 {
21657 /* Parse the parameter. */
21658 parameter
21663 /* We don't know yet if the enclosing context is deprecated, so wait
21664 and warn in grokparms if appropriate. */
21668 {
21671 PARM,
21676 }
21680 /* If a parse error occurred parsing the parameter declaration,
21681 then the entire parameter-declaration-list is erroneous. */
21683 {
21686 }
21696 {
21700 }
21702 /* Add the new parameter to the list. */
21706 /* Peek at the next token. */
21709 /* These are for Objective-C++ */
21712 /* The parameter-declaration-list is complete. */
21715 {
21718 /* Peek at the next token. */
21720 /* If it's an ellipsis, then the list is complete. */
21723 /* Otherwise, there must be more parameters. Consume the
21724 `,'. */
21726 /* When parsing something like:
21728 int i(float f, double d)
21730 we can tell after seeing the declaration for "f" that we
21731 are not looking at an initialization of a variable "i",
21732 but rather at the declaration of a function "i".
21734 Due to the fact that the parsing of template arguments
21735 (as specified to a template-id) requires backtracking we
21736 cannot use this technique when inside a template argument
21737 list. */
21741 /* However, a parameter-declaration of the form
21742 "float(f)" (which is a valid declaration of a
21743 parameter "f") can also be interpreted as an
21744 expression (the conversion of "f" to "float"). */
21747 }
21748 else
21749 {
21757 }
21758 }
21760 parser->in_unbraced_linkage_specification_p
21763 /* Reset implicit_template_scope if we are about to leave the function
21764 parameter list that introduced it. Note that for out-of-line member
21765 definitions, there will be one or more class scopes before we get to
21766 the template parameter scope. */
21770 {
21774 {
21777 }
21778 }
21781 }
21783 /* Parse a parameter declaration.
21785 parameter-declaration:
21786 decl-specifier-seq ... [opt] declarator
21787 decl-specifier-seq declarator = assignment-expression
21788 decl-specifier-seq ... [opt] abstract-declarator [opt]
21789 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21791 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21792 declares a template parameter. (In that case, a non-nested `>'
21793 token encountered during the parsing of the assignment-expression
21794 is not interpreted as a greater-than operator.)
21796 Returns a representation of the parameter, or NULL if an error
21797 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21798 true iff the declarator is of the form "(p)". */
21804 {
21806 cp_decl_specifier_seq decl_specifiers;
21808 tree default_argument;
21813 /* In a template parameter, `>' is not an operator.
21815 [temp.param]
21817 When parsing a default template-argument for a non-type
21818 template-parameter, the first non-nested `>' is taken as the end
21819 of the template parameter-list rather than a greater-than
21820 operator. */
21822 /* Type definitions may not appear in parameter types. */
21824 parser->type_definition_forbidden_message
21831 /* Parse the declaration-specifiers. */
21834 CP_PARSER_FLAGS_NONE,
21838 /* Complain about missing 'typename' or other invalid type names. */
21843 /* If an error occurred, there's no reason to attempt to parse the
21844 rest of the declaration. */
21846 {
21849 }
21851 /* Peek at the next token. */
21854 /* If the next token is a `)', `,', `=', `>', or `...', then there
21855 is no declarator. However, when variadic templates are enabled,
21856 there may be a declarator following `...'. */
21861 {
21865 }
21866 /* Otherwise, there should be a declarator. */
21867 else
21868 {
21872 /* After seeing a decl-specifier-seq, if the next token is not a
21873 "(", there is no possibility that the code is a valid
21874 expression. Therefore, if parsing tentatively, we commit at
21875 this point. */
21877 /* In an expression context, having seen:
21879 (int((char ...
21881 we cannot be sure whether we are looking at a
21882 function-type (taking a "char" as a parameter) or a cast
21883 of some object of type "char" to "int". */
21889 /* Parse the declarator. */
21892 CP_PARSER_DECLARATOR_EITHER,
21894 parenthesized_p,
21898 /* After the declarator, allow more attributes. */
21899 decl_specifiers.attributes
21903 /* If the declarator is a template parameter pack, remember that and
21904 clear the flag in the declarator itself so we don't get errors
21905 from grokdeclarator. */
21907 {
21910 }
21911 }
21913 /* If the next token is an ellipsis, and we have not seen a declarator
21914 name, and if either the type of the declarator contains parameter
21915 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21916 for, eg, abbreviated integral type names), then we actually have a
21917 parameter pack expansion expression. Otherwise, leave the ellipsis
21918 for a C-style variadic function. */
21921 /* If a function parameter pack was specified and an implicit template
21922 parameter was introduced during cp_parser_parameter_declaration,
21923 change any implicit parameters introduced into packs. */
21928 {
21936 }
21939 {
21950 {
21951 /* Consume the `...'. */
21955 /* Build a pack expansion type */
21960 else
21962 }
21963 }
21965 /* The restriction on defining new types applies only to the type
21966 of the parameter, not to the default argument. */
21969 /* If the next token is `=', then process a default argument. */
21971 {
21974 /* If we are defining a class, then the tokens that make up the
21975 default argument must be saved and processed later. */
21981 // A constrained-type-specifier may declare a type template-parameter.
21983 default_argument
21986 // A constrained-type-specifier may declare a template-template-parameter.
21988 default_argument
21991 /* Outside of a class definition, we can just parse the
21992 assignment-expression. */
21993 else
21994 default_argument
21998 {
22000 "default arguments are only "
22002 }
22004 || template_parameter_pack_p
22007 {
22008 /* Find the name of the parameter pack. */
22015 template_parm_p
22021 else
22023 template_parm_p
22030 }
22031 }
22032 else
22035 /* Generate a location for the parameter, ranging from the start of the
22036 initial token to the end of the final token (using input_location for
22037 the latter, set up by cp_lexer_set_source_position_from_token when
22038 consuming tokens).
22040 If we have a identifier, then use it for the caret location, e.g.
22042 extern int callee (int one, int (*two)(int, int), float three);
22043 ~~~~~~^~~~~~~~~~~~~~
22045 otherwise, reuse the start location for the caret location e.g.:
22047 extern int callee (int one, int (*)(int, int), float three);
22048 ^~~~~~~~~~~~~~~~~
22050 */
22056 input_location);
22059 declarator,
22060 default_argument,
22061 param_loc,
22062 template_parameter_pack_p);
22063 }
22065 /* Parse a default argument and return it.
22067 TEMPLATE_PARM_P is true if this is a default argument for a
22068 non-type template parameter. */
22069 static tree
22071 {
22077 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
22078 set correctly. */
22081 /* Local variable names (and the `this' keyword) may not
22082 appear in a default argument. */
22085 /* Parse the assignment-expression. */
22090 /* The "this" pointer is not valid in a default argument. */
22092 {
22097 }
22098 default_argument
22100 /* Restore the "this" pointer. */
22102 {
22105 }
22114 }
22116 /* Parse a function-body.
22118 function-body:
22119 compound_statement */
22121 static void
22123 {
22127 }
22129 /* Parse a ctor-initializer-opt followed by a function-body. Return
22130 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
22131 is true we are parsing a function-try-block. */
22133 static void
22136 {
22143 /* Begin the function body. */
22145 /* Parse the optional ctor-initializer. */
22148 /* If we're parsing a constexpr constructor definition, we need
22149 to check that the constructor body is indeed empty. However,
22150 before we get to cp_parser_function_body lot of junk has been
22151 generated, so we can't just check that we have an empty block.
22152 Rather we take a snapshot of the outermost block, and check whether
22153 cp_parser_function_body changed its state. */
22155 {
22159 }
22160 /* Parse the function-body. */
22164 /* Finish the function body. */
22166 }
22168 /* Parse an initializer.
22170 initializer:
22171 = initializer-clause
22172 ( expression-list )
22174 Returns an expression representing the initializer. If no
22175 initializer is present, NULL_TREE is returned.
22177 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
22178 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
22179 set to TRUE if there is no initializer present. If there is an
22180 initializer, and it is not a constant-expression, *NON_CONSTANT_P
22181 is set to true; otherwise it is set to false. */
22183 static tree
22186 {
22188 tree init;
22190 /* Peek at the next token. */
22193 /* Let our caller know whether or not this initializer was
22194 parenthesized. */
22196 /* Assume that the initializer is constant. */
22200 {
22201 /* Consume the `='. */
22203 /* Parse the initializer-clause. */
22205 }
22207 {
22212 non_constant_p);
22217 }
22219 {
22224 }
22225 else
22226 {
22227 /* Anything else is an error. */
22230 }
22236 }
22238 /* Parse an initializer-clause.
22240 initializer-clause:
22241 assignment-expression
22242 braced-init-list
22244 Returns an expression representing the initializer.
22246 If the `assignment-expression' production is used the value
22247 returned is simply a representation for the expression.
22249 Otherwise, calls cp_parser_braced_list. */
22251 static cp_expr
22253 {
22254 cp_expr initializer;
22256 /* Assume the expression is constant. */
22259 /* If it is not a `{', then we are looking at an
22260 assignment-expression. */
22262 {
22263 initializer
22266 non_constant_p);
22267 }
22268 else
22272 }
22274 /* Parse a brace-enclosed initializer list.
22276 braced-init-list:
22277 { initializer-list , [opt] }
22278 { designated-initializer-list , [opt] }
22279 { }
22281 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
22282 the elements of the initializer-list (or NULL, if the last
22283 production is used). The TREE_TYPE for the CONSTRUCTOR will be
22284 NULL_TREE. There is no way to detect whether or not the optional
22285 trailing `,' was provided. NON_CONSTANT_P is as for
22286 cp_parser_initializer. */
22288 static cp_expr
22290 {
22291 tree initializer;
22294 /* Consume the `{' token. */
22295 matching_braces braces;
22297 /* Create a CONSTRUCTOR to represent the braced-initializer. */
22299 /* If it's not a `}', then there is a non-trivial initializer. */
22301 {
22302 /* Parse the initializer list. */
22305 /* A trailing `,' token is allowed. */
22308 }
22309 else
22311 /* Now, there should be a trailing `}'. */
22317 /* Build a location of the form:
22318 { ... }
22319 ^~~~~~~
22320 with caret==start at the open brace, finish at the close brace. */
22324 }
22326 /* Consume tokens up to, and including, the next non-nested closing `]'.
22327 Returns true iff we found a closing `]'. */
22329 static bool
22331 {
22335 {
22339 {
22342 /* If we've run out of tokens, then there is no closing `]'. */
22351 {
22354 }
22359 }
22361 /* Consume the token. */
22363 }
22364 }
22366 /* Return true if we are looking at an array-designator, false otherwise. */
22368 static bool
22370 {
22371 /* Consume the `['. */
22376 /* Skip tokens until the next token is a closing square bracket.
22377 If we find the closing `]', and the next token is a `=', then
22378 we are looking at an array designator. */
22379 bool array_designator_p
22383 /* Roll back the tokens we skipped. */
22387 }
22389 /* Parse an initializer-list.
22391 initializer-list:
22392 initializer-clause ... [opt]
22393 initializer-list , initializer-clause ... [opt]
22395 C++2A Extension:
22397 designated-initializer-list:
22398 designated-initializer-clause
22399 designated-initializer-list , designated-initializer-clause
22401 designated-initializer-clause:
22402 designator brace-or-equal-initializer
22404 designator:
22405 . identifier
22407 GNU Extension:
22409 initializer-list:
22410 designation initializer-clause ...[opt]
22411 initializer-list , designation initializer-clause ...[opt]
22413 designation:
22414 . identifier =
22415 identifier :
22416 [ constant-expression ] =
22418 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22419 for the initializer. If the INDEX of the elt is non-NULL, it is the
22420 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22421 as for cp_parser_initializer. */
22425 {
22430 /* Assume all of the expressions are constant. */
22433 /* Parse the rest of the list. */
22435 {
22437 tree designator;
22438 tree initializer;
22442 /* Handle the C++2A syntax, '. id ='. */
22450 {
22453 "C++ designated initializers only available with "
22455 /* Consume the `.'. */
22457 /* Consume the identifier. */
22460 /* Consume the `='. */
22462 }
22463 /* Also, if the next token is an identifier and the following one is a
22464 colon, we are looking at the GNU designated-initializer
22465 syntax. */
22470 {
22471 /* Warn the user that they are using an extension. */
22474 /* Consume the identifier. */
22476 /* Consume the `:'. */
22478 }
22479 /* Also handle C99 array designators, '[ const ] ='. */
22483 {
22484 /* In C++11, [ could start a lambda-introducer. */
22490 {
22493 }
22494 else
22495 {
22500 }
22505 && (!require_potential_rvalue_constant_expression
22509 /* Warn the user that they are using an extension. */
22512 }
22513 else
22517 {
22520 }
22524 {
22528 }
22532 /* Parse the initializer. */
22535 /* If any clause is non-constant, so is the entire initializer. */
22539 /* If we have an ellipsis, this is an initializer pack
22540 expansion. */
22542 {
22545 /* Consume the `...'. */
22552 /* Turn the initializer into an initializer expansion. */
22554 }
22556 /* Add it to the vector. */
22559 /* If the next token is not a comma, we have reached the end of
22560 the list. */
22564 /* Peek at the next token. */
22566 /* If the next token is a `}', then we're still done. An
22567 initializer-clause can have a trailing `,' after the
22568 initializer-list and before the closing `}'. */
22572 /* Consume the `,' token. */
22574 }
22576 /* The same identifier shall not appear in multiple designators
22577 of a designated-initializer-list. */
22579 {
22584 {
22586 {
22588 "%<.%s%> designator used multiple times in "
22592 }
22593 else
22595 }
22599 }
22602 }
22604 /* Classes [gram.class] */
22606 /* Parse a class-name.
22608 class-name:
22609 identifier
22610 template-id
22612 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22613 to indicate that names looked up in dependent types should be
22614 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22615 keyword has been used to indicate that the name that appears next
22616 is a template. TAG_TYPE indicates the explicit tag given before
22617 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22618 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22619 is the class being defined in a class-head. If ENUM_OK is TRUE,
22620 enum-names are also accepted.
22622 Returns the TYPE_DECL representing the class. */
22624 static tree
22633 {
22634 tree decl;
22635 tree scope;
22640 /* All class-names start with an identifier. */
22643 {
22646 }
22648 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22649 to a template-id, so we save it here. */
22654 /* Any name names a type if we're following the `typename' keyword
22655 in a qualified name where the enclosing scope is type-dependent. */
22658 /* Handle the common case (an identifier, but not a template-id)
22659 efficiently. */
22662 {
22666 /* Look for the identifier. */
22670 /* If the next token isn't an identifier, we are certainly not
22671 looking at a class-name. */
22674 /* If we know this is a type-name, there's no need to look it
22675 up. */
22678 else
22679 {
22680 tree ambiguous_decls;
22681 /* If we already know that this lookup is ambiguous, then
22682 we've already issued an error message; there's no reason
22683 to check again. */
22685 {
22688 }
22689 /* If the next token is a `::', then the name must be a type
22690 name.
22692 [basic.lookup.qual]
22694 During the lookup for a name preceding the :: scope
22695 resolution operator, object, function, and enumerator
22696 names are ignored. */
22699 /* Look up the name. */
22701 tag_type,
22704 check_dependency_p,
22708 {
22712 }
22713 }
22714 }
22715 else
22716 {
22717 /* Try a template-id. */
22719 check_dependency_p,
22720 tag_type,
22721 is_declaration);
22724 }
22728 /* If this is a typename, create a TYPENAME_TYPE. */
22730 {
22735 }
22739 /* Check to see that it is really the name of a class. */
22743 /* Situations like this:
22745 template <typename T> struct A {
22746 typename T::template X<int>::I i;
22747 };
22749 are problematic. Is `T::template X<int>' a class-name? The
22750 standard does not seem to be definitive, but there is no other
22751 valid interpretation of the following `::'. Therefore, those
22752 names are considered class-names. */
22753 {
22757 }
22762 /* In Objective-C 2.0, a classname followed by '.' starts a
22763 dot-syntax expression, and it's not a type-name. */
22775 }
22777 /* Parse a class-specifier.
22779 class-specifier:
22780 class-head { member-specification [opt] }
22782 Returns the TREE_TYPE representing the class. */
22784 static tree
22786 {
22787 tree type;
22801 /* Parse the class-head. */
22804 /* If the class-head was a semantic disaster, skip the entire body
22805 of the class. */
22807 {
22811 }
22813 /* Look for the `{'. */
22814 matching_braces braces;
22816 {
22819 }
22824 /* Issue an error message if type-definitions are forbidden here. */
22826 /* Remember that we are defining one more class. */
22828 /* Inside the class, surrounding template-parameter-lists do not
22829 apply. */
22830 saved_num_template_parameter_lists
22833 /* We are not in a function body. */
22836 /* Or in a loop. */
22839 /* Or in a switch. */
22842 /* We are not immediately inside an extern "lang" block. */
22843 saved_in_unbraced_linkage_specification_p
22847 // Associate constraints with the type.
22851 /* Start the class. */
22853 {
22856 }
22860 /* If the type is erroneous, skip the entire body of the class. */
22862 else
22863 /* Parse the member-specification. */
22866 /* Look for the trailing `}'. */
22868 /* Look for trailing attributes to apply to this class. */
22876 /* We've finished a type definition. Check for the common syntax
22877 error of forgetting a semicolon after the definition. We need to
22878 be careful, as we can't just check for not-a-semicolon and be done
22879 with it; the user might have typed:
22881 class X { } c = ...;
22882 class X { } *p = ...;
22884 and so forth. Instead, enumerate all the possible tokens that
22885 might follow this production; if we don't see one of them, then
22886 complain and silently insert the semicolon. */
22887 {
22892 /* Don't try to parse c++11 attributes here. As per the
22893 grammar, that should be a task for
22894 cp_parser_decl_specifier_seq. */
22898 {
22909 /* While it's legal for type qualifiers and storage class
22910 specifiers to follow type definitions in the grammar, only
22911 compiler testsuites contain code like that. Assume that if
22912 we see such code, then what we're really seeing is a case
22913 like:
22915 class X { }
22916 const <type> var = ...;
22918 or
22920 class Y { }
22921 static <type> func (...) ...
22923 i.e. the qualifier or specifier applies to the next
22924 declaration. To do so, however, we need to look ahead one
22925 more token to see if *that* token is a type specifier.
22927 This code could be improved to handle:
22929 class Z { }
22930 static const <type> var = ...; */
22933 {
22936 /* Handling user-defined types here would be nice, but very
22937 tricky. */
22938 want_semicolon
22941 }
22945 }
22947 /* If we don't have a type, then something is very wrong and we
22948 shouldn't try to do anything clever. Likewise for not seeing the
22949 closing brace. */
22951 {
22952 /* Locate the closing brace. */
22953 cp_token_position prev
22958 /* We want to suggest insertion of a ';' immediately *after* the
22959 closing brace, so, if we can, offset the location by 1 column. */
22966 /* If we successfully offset the location, suggest the fix-it. */
22979 else
22982 /* Unget one token and smash it to look as though we encountered
22983 a semicolon in the input stream. */
22988 }
22989 }
22991 /* If this class is not itself within the scope of another class,
22992 then we need to parse the bodies of all of the queued function
22993 definitions. Note that the queued functions defined in a class
22994 are not always processed immediately following the
22995 class-specifier for that class. Consider:
22997 struct A {
22998 struct B { void f() { sizeof (A); } };
22999 };
23001 If `f' were processed before the processing of `A' were
23002 completed, there would be no way to compute the size of `A'.
23003 Note that the nesting we are interested in here is lexical --
23004 not the semantic nesting given by TYPE_CONTEXT. In particular,
23005 for:
23007 struct A { struct B; };
23008 struct A::B { void f() { } };
23010 there is no need to delay the parsing of `A::B::f'. */
23012 {
23013 tree decl;
23021 {
23022 /* Skip default arguments, NSDMIs, etc, in order to improve
23023 error recovery (c++/71169, c++/71832). */
23028 }
23030 /* In a first pass, parse default arguments to the functions.
23031 Then, in a second pass, parse the bodies of the functions.
23032 This two-phased approach handles cases like:
23034 struct S {
23035 void f() { g(); }
23036 void g(int i = 3);
23037 };
23039 */
23041 {
23043 /* If there are default arguments that have not yet been processed,
23044 take care of them now. */
23046 {
23051 }
23052 /* Make sure that any template parameters are in scope. */
23054 /* Parse the default argument expressions. */
23056 /* Remove any template parameters from the symbol table. */
23058 }
23060 /* Now parse any NSDMIs. */
23064 {
23066 {
23071 }
23074 }
23081 /* Now do some post-NSDMI bookkeeping. */
23087 /* Now parse the body of the functions. */
23089 {
23090 /* OpenMP UDRs need to be parsed before all other functions. */
23097 }
23098 else
23102 }
23103 else
23106 /* Put back any saved access checks. */
23109 /* Restore saved state. */
23113 parser->num_template_parameter_lists
23115 parser->in_unbraced_linkage_specification_p
23119 }
23121 static tree
23123 {
23124 tree ret;
23129 }
23131 /* Parse a class-head.
23133 class-head:
23134 class-key identifier [opt] base-clause [opt]
23135 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
23136 class-key nested-name-specifier [opt] template-id
23137 base-clause [opt]
23139 class-virt-specifier:
23140 final
23142 GNU Extensions:
23143 class-key attributes identifier [opt] base-clause [opt]
23144 class-key attributes nested-name-specifier identifier base-clause [opt]
23145 class-key attributes nested-name-specifier [opt] template-id
23146 base-clause [opt]
23148 Upon return BASES is initialized to the list of base classes (or
23149 NULL, if there are none) in the same form returned by
23150 cp_parser_base_clause.
23152 Returns the TYPE of the indicated class. Sets
23153 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
23154 involving a nested-name-specifier was used, and FALSE otherwise.
23156 Returns error_mark_node if this is not a class-head.
23158 Returns NULL_TREE if the class-head is syntactically valid, but
23159 semantically invalid in a way that means we should skip the entire
23160 body of the class. */
23162 static tree
23165 {
23166 tree nested_name_specifier;
23170 tree attributes;
23171 tree bases;
23181 /* Assume no nested-name-specifier will be present. */
23183 /* Assume no template parameter lists will be used in defining the
23184 type. */
23188 /* Look for the class-key. */
23195 /* Parse the attributes. */
23198 /* If the next token is `::', that is invalid -- but sometimes
23199 people do try to write:
23201 struct ::S {};
23203 Handle this gracefully by accepting the extra qualifier, and then
23204 issuing an error about it later if this really is a
23205 class-head. If it turns out just to be an elaborated type
23206 specifier, remain silent. */
23212 /* Determine the name of the class. Begin by looking for an
23213 optional nested-name-specifier. */
23215 nested_name_specifier
23221 /* If there was a nested-name-specifier, then there *must* be an
23222 identifier. */
23227 {
23229 /* Although the grammar says `identifier', it really means
23230 `class-name' or `template-name'. You are only allowed to
23231 define a class that has already been declared with this
23232 syntax.
23234 The proposed resolution for Core Issue 180 says that wherever
23235 you see `class T::X' you should treat `X' as a type-name.
23237 It is OK to define an inaccessible class; for example:
23239 class A { class B; };
23240 class A::B {};
23242 We do not know if we will see a class-name, or a
23243 template-name. We look for a class-name first, in case the
23244 class-name is a template-id; if we looked for the
23245 template-name first we would stop after the template-name. */
23252 class_type,
23256 /* If that didn't work, ignore the nested-name-specifier. */
23258 {
23264 }
23265 /* If we could not find a corresponding TYPE, treat this
23266 declaration like an unqualified declaration. */
23269 /* Otherwise, count the number of templates used in TYPE and its
23270 containing scopes. */
23271 else
23273 }
23274 /* Otherwise, the identifier is optional. */
23275 else
23276 {
23277 /* We don't know whether what comes next is a template-id,
23278 an identifier, or nothing at all. */
23280 /* Check for a template-id. */
23285 class_key,
23287 /* If that didn't work, it could still be an identifier. */
23289 {
23291 {
23294 }
23295 else
23297 }
23298 else
23299 {
23302 }
23303 }
23308 {
23310 class_key,
23312 }
23315 /* If it's not a `:' or a `{' then we can't really be looking at a
23316 class-head, since a class-head only appears as part of a
23317 class-specifier. We have to detect this situation before calling
23318 xref_tag, since that has irreversible side-effects. */
23320 {
23324 }
23326 /* At this point, we're going ahead with the class-specifier, even
23327 if some other problem occurs. */
23330 {
23335 }
23336 /* Issue the error about the overly-qualified name now. */
23338 {
23343 }
23345 {
23350 }
23352 {
23353 tree scope;
23356 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23357 keyword template shall not appear at the top level. */
23361 /* Reject typedef-names in class heads. */
23363 {
23366 type);
23369 }
23371 /* Figure out in what scope the declaration is being placed. */
23373 /* If that scope does not contain the scope in which the
23374 class was originally declared, the program is invalid. */
23376 {
23379 "declaration of %qD in namespace %qD which does not "
23382 else
23388 }
23389 /* [dcl.meaning]
23391 A declarator-id shall not be qualified except for the
23392 definition of a ... nested class outside of its class
23393 ... [or] the definition or explicit instantiation of a
23394 class member of a namespace outside of its namespace. */
23396 {
23401 }
23402 }
23403 /* An explicit-specialization must be preceded by "template <>". If
23404 it is not, try to recover gracefully. */
23407 && !processing_template_parmlist
23409 {
23410 /* Build a location of this form:
23411 struct typename <ARGS>
23412 ^~~~~~~~~~~~~~~~~~~~~~
23413 with caret==start at the start token, and
23414 finishing at the end of the type. */
23415 location_t reported_loc
23417 class_head_start_location,
23423 "an explicit specialization must be preceded by"
23426 /* Take the same action that would have been taken by
23427 cp_parser_explicit_specialization. */
23430 }
23431 /* There must be no "return" statements between this point and the
23432 end of this function; set "type "to the correct return value and
23433 use "goto done;" to return. */
23434 /* Make sure that the right number of template parameters were
23435 present. */
23437 template_id_p,
23440 {
23441 /* If something went wrong, there is no point in even trying to
23442 process the class-definition. */
23445 }
23447 /* Look up the type. */
23449 {
23453 {
23457 }
23458 else
23459 {
23463 /* Check the scope while we still know whether or not we had a
23464 nested-name-specifier. */
23467 }
23470 }
23472 {
23473 tree class_type;
23475 /* Given:
23477 template <typename T> struct S { struct T };
23478 template <typename T> struct S<T>::T { };
23480 we will get a TYPENAME_TYPE when processing the definition of
23481 `S::T'. We need to resolve it to the actual type before we
23482 try to define it. */
23484 {
23489 else
23490 {
23493 }
23494 }
23498 {
23501 }
23504 /* Enter the scope indicated by the nested-name-specifier. */
23506 /* Get the canonical version of this type. */
23508 /* Call push_template_decl if it seems like we should be defining a
23509 template either from the template headers or the type we're
23510 defining, so that we diagnose both extra and missing headers. */
23514 {
23517 {
23520 }
23521 }
23525 }
23527 {
23528 /* If the class was unnamed, create a dummy name. */
23532 ? ts_within_enclosing_non_class
23536 }
23538 /* Indicate whether this class was declared as a `class' or as a
23539 `struct'. */
23544 /* If this type was already complete, and we see another definition,
23545 that's an error. */
23547 {
23549 type);
23551 type);
23554 }
23559 {
23560 /* Apply attributes now, before any use of the class as a template
23561 argument in its base list. */
23564 }
23566 /* We will have entered the scope containing the class; the names of
23567 base classes should be looked up in that context. For example:
23569 struct A { struct B {}; struct C; };
23570 struct A::C : B {};
23572 is valid. */
23574 /* Get the list of base-classes, if there is one. */
23576 {
23577 /* PR59482: enter the class scope so that base-specifiers are looked
23578 up correctly. */
23582 /* PR59482: get out of the previously pushed class scope so that the
23583 subsequent pops pop the right thing. */
23586 }
23587 else
23590 /* If we're really defining a class, process the base classes.
23591 If they're invalid, fail. */
23595 done:
23596 /* Leave the scope given by the nested-name-specifier. We will
23597 enter the class scope itself while processing the members. */
23602 {
23605 }
23611 out:
23614 }
23616 /* Parse a class-key.
23618 class-key:
23619 class
23620 struct
23621 union
23623 Returns the kind of class-key specified, or none_type to indicate
23624 error. */
23626 static enum tag_types
23628 {
23632 /* Look for the class-key. */
23637 /* Check to see if the TOKEN is a class-key. */
23642 }
23644 /* Parse a type-parameter-key.
23646 type-parameter-key:
23647 class
23648 typename
23649 */
23651 static void
23653 {
23654 /* Look for the type-parameter-key. */
23658 {
23661 /* typename is not allowed in a template template parameter
23662 by the standard until C++17. */
23664 "ISO C++ forbids typename key in template template parameter;"
23666 }
23667 else
23671 }
23673 /* Parse an (optional) member-specification.
23675 member-specification:
23676 member-declaration member-specification [opt]
23677 access-specifier : member-specification [opt] */
23679 static void
23681 {
23683 {
23687 /* Peek at the next token. */
23689 /* If it's a `}', or EOF then we've seen all the members. */
23695 /* See if this token is a keyword. */
23698 {
23702 /* Consume the access-specifier. */
23704 /* Remember which access-specifier is active. */
23706 /* Look for the `:'. */
23711 /* Accept #pragmas at class scope. */
23713 {
23716 }
23718 /* Otherwise, the next construction must be a
23719 member-declaration. */
23721 }
23722 }
23723 }
23725 /* Parse a member-declaration.
23727 member-declaration:
23728 decl-specifier-seq [opt] member-declarator-list [opt] ;
23729 function-definition ; [opt]
23730 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23731 using-declaration
23732 template-declaration
23733 alias-declaration
23735 member-declarator-list:
23736 member-declarator
23737 member-declarator-list , member-declarator
23739 member-declarator:
23740 declarator pure-specifier [opt]
23741 declarator constant-initializer [opt]
23742 identifier [opt] : constant-expression
23744 GNU Extensions:
23746 member-declaration:
23747 __extension__ member-declaration
23749 member-declarator:
23750 declarator attributes [opt] pure-specifier [opt]
23751 declarator attributes [opt] constant-initializer [opt]
23752 identifier [opt] attributes [opt] : constant-expression
23754 C++0x Extensions:
23756 member-declaration:
23757 static_assert-declaration */
23759 static void
23761 {
23762 cp_decl_specifier_seq decl_specifiers;
23763 tree prefix_attributes;
23764 tree decl;
23773 /* Check for the `__extension__' keyword. */
23775 {
23776 /* Recurse. */
23778 /* Restore the old value of the PEDANTIC flag. */
23782 }
23784 /* Check for a template-declaration. */
23786 {
23787 /* An explicit specialization here is an error condition, and we
23788 expect the specialization handler to detect and report this. */
23792 else
23796 }
23797 /* Check for a template introduction. */
23801 /* Check for a using-declaration. */
23803 {
23805 {
23806 /* Parse the using-declaration. */
23810 }
23811 else
23812 {
23813 tree decl;
23817 /* Note that if we actually see the '=' token after the
23818 identifier, cp_parser_alias_declaration commits the
23819 tentative parse. In that case, we really expect an
23820 alias-declaration. Otherwise, we expect a using
23821 declaration. */
23822 alias_decl_expected =
23828 else
23832 }
23833 }
23835 /* Check for @defs. */
23837 {
23842 {
23847 }
23849 }
23851 /* If the next token is `static_assert' we have a static assertion. */
23853 {
23856 }
23863 /* Parse the decl-specifier-seq. */
23866 CP_PARSER_FLAGS_OPTIONAL,
23869 /* Check for an invalid type-name. */
23873 /* If there is no declarator, then the decl-specifier-seq should
23874 specify a type. */
23876 {
23877 /* If there was no decl-specifier-seq, and the next token is a
23878 `;', then we have something like:
23880 struct S { ; };
23882 [class.mem]
23884 Each member-declaration shall declare at least one member
23885 name of the class. */
23887 {
23890 {
23894 }
23895 }
23896 else
23897 {
23898 tree type;
23900 /* See if this declaration is a friend. */
23902 /* If there were decl-specifiers, check to see if there was
23903 a class-declaration. */
23906 /* Nested classes have already been added to the class, but
23907 a `friend' needs to be explicitly registered. */
23909 {
23910 /* If the `friend' keyword was present, the friend must
23911 be introduced with a class-key. */
23914 "in C++03 a class-key must be used "
23916 /* In this case:
23918 template <typename T> struct A {
23919 friend struct A<T>::B;
23920 };
23922 A<T>::B will be represented by a TYPENAME_TYPE, and
23923 therefore not recognized by check_tag_decl. */
23925 {
23929 }
23932 "friend declaration does not name a class or "
23934 else
23937 }
23938 /* If there is no TYPE, an error message will already have
23939 been issued. */
23941 ;
23942 /* An anonymous aggregate has to be handled specially; such
23943 a declaration really declares a data member (with a
23944 particular type), as opposed to a nested class. */
23946 {
23947 /* C++11 9.5/6. */
23950 "a storage class on an anonymous aggregate "
23953 /* Remove constructors and such from TYPE, now that we
23954 know it is an anonymous aggregate. */
23956 /* And make the corresponding data member. */
23959 /* Add it to the class. */
23961 }
23962 else
23963 cp_parser_check_access_in_redeclaration
23966 }
23967 }
23968 else
23969 {
23972 /* Clear attributes from the decl_specifiers but keep them
23973 around as prefix attributes that apply them to the entity
23974 being declared. */
23978 /* See if these declarations will be friends. */
23981 /* Keep going until we hit the `;' at the end of the
23982 declaration. */
23984 {
23986 tree first_attribute;
23987 tree initializer;
23990 /* Peek at the next token. */
23993 /* The following code wants to know early if it is a bit-field
23994 or some other declaration. Attributes can appear before
23995 the `:' token. Skip over them without consuming any tokens
23996 to peek if they are followed by `:'. */
24001 {
24002 size_t n
24005 }
24007 /* Check for a bitfield declaration. */
24013 {
24014 tree identifier;
24015 tree width;
24017 location_t id_location
24022 else
24025 /* Look for attributes that apply to the bitfield. */
24028 /* Consume the `:' token. */
24031 /* Get the width of the bitfield. */
24035 /* In C++2A and as extension for C++11 and above we allow
24036 default member initializers for bit-fields. */
24041 CPP_OPEN_BRACE)))
24042 {
24043 location_t loc
24049 "default member initializers for bit-fields "
24050 "only available with -std=c++2a or "
24055 {
24059 }
24060 }
24061 else
24062 {
24063 /* Look for attributes that apply to the bitfield after
24064 the `:' token and width. This is where GCC used to
24065 parse attributes in the past, pedwarn if there is
24066 a std attribute. */
24069 "ISO C++ allows bit-field attributes only "
24073 }
24077 /* Remember which attributes are prefix attributes and
24078 which are not. */
24080 /* Combine the attributes. */
24083 /* Create the bitfield declaration. */
24086 identifier,
24087 sfk_none,
24088 id_location)
24092 attributes);
24093 }
24094 else
24095 {
24097 tree asm_specification;
24100 /* Parse the declarator. */
24101 declarator
24106 friend_p);
24108 /* If something went wrong parsing the declarator, make sure
24109 that we at least consume some tokens. */
24111 {
24112 /* Skip to the end of the statement. */
24114 /* If the next token is not a semicolon, that is
24115 probably because we just skipped over the body of
24116 a function. So, we consume a semicolon if
24117 present, but do not issue an error message if it
24118 is not present. */
24120 CPP_SEMICOLON))
24123 }
24126 cp_parser_check_for_definition_in_return_type
24130 /* Look for an asm-specification. */
24132 /* Look for attributes that apply to the declaration. */
24134 /* Remember which attributes are prefix attributes and
24135 which are not. */
24137 /* Combine the attributes. */
24140 /* If it's an `=', then we have a constant-initializer or a
24141 pure-specifier. It is not correct to parse the
24142 initializer before registering the member declaration
24143 since the member declaration should be in scope while
24144 its initializer is processed. However, the rest of the
24145 front end does not yet provide an interface that allows
24146 us to handle this correctly. */
24148 {
24149 /* In [class.mem]:
24151 A pure-specifier shall be used only in the declaration of
24152 a virtual function.
24154 A member-declarator can contain a constant-initializer
24155 only if it declares a static member of integral or
24156 enumeration type.
24158 Therefore, if the DECLARATOR is for a function, we look
24159 for a pure-specifier; otherwise, we look for a
24160 constant-initializer. When we call `grokfield', it will
24161 perform more stringent semantics checks. */
24173 {
24175 /* Don't require a constant rvalue in C++11, since we
24176 might want a reference constant. We'll enforce
24177 constancy later. */
24179 /* Parse the initializer. */
24182 }
24183 else
24184 /* Parse the initializer. */
24186 }
24189 {
24193 else
24195 }
24196 /* Otherwise, there is no initializer. */
24197 else
24200 /* See if we are probably looking at a function
24201 definition. We are certainly not looking at a
24202 member-declarator. Calling `grokfield' has
24203 side-effects, so we must not do it unless we are sure
24204 that we are looking at a member-declarator. */
24207 {
24208 /* The grammar does not allow a pure-specifier to be
24209 used when a member function is defined. (It is
24210 possible that this fact is an oversight in the
24211 standard, since a pure function may be defined
24212 outside of the class-specifier. */
24218 declarator,
24219 attributes);
24222 /* If the member was not a friend, declare it here. */
24225 /* Peek at the next token. */
24227 /* If the next token is a semicolon, consume it. */
24229 {
24230 location_t semicolon_loc
24235 "extra %<;%> after in-class "
24237 }
24239 }
24240 else
24243 /* Create the declaration. */
24248 {
24251 else
24253 }
24254 }
24259 /* Reset PREFIX_ATTRIBUTES. */
24261 {
24266 }
24268 /* If there is any qualification still in effect, clear it
24269 now; we will be starting fresh with the next declarator. */
24273 /* If it's a `,', then there are more declarators. */
24275 {
24278 {
24284 }
24285 }
24286 /* If the next token isn't a `;', then we have a parse error. */
24288 CPP_SEMICOLON))
24289 {
24290 /* The next token might be a ways away from where the
24291 actual semicolon is missing. Find the previous token
24292 and use that for our error position. */
24299 /* Assume that the user meant to provide a semicolon. If
24300 we were to cp_parser_skip_to_end_of_statement, we might
24301 skip to a semicolon inside a member function definition
24302 and issue nonsensical error messages. */
24304 }
24307 {
24308 /* Add DECL to the list of members. */
24310 /* Explicitly include, eg, NSDMIs, for better error
24311 recovery (c++/58650). */
24319 /* Add DECL to the queue of NSDMI to be parsed later. */
24321 }
24325 }
24326 }
24329 out:
24331 }
24333 /* Parse a pure-specifier.
24335 pure-specifier:
24336 = 0
24338 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24339 Otherwise, ERROR_MARK_NODE is returned. */
24341 static tree
24343 {
24346 /* Look for the `=' token. */
24349 /* Look for the `0' token. */
24358 /* Accept = default or = delete in c++0x mode. */
24361 {
24364 }
24366 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24368 {
24373 }
24375 {
24378 }
24381 }
24383 /* Parse a constant-initializer.
24385 constant-initializer:
24386 = constant-expression
24388 Returns a representation of the constant-expression. */
24390 static tree
24392 {
24393 /* Look for the `=' token. */
24397 /* It is invalid to write:
24399 struct S { static const int i = { 7 }; };
24401 */
24403 {
24406 /* Consume the opening brace. */
24407 matching_braces braces;
24409 /* Skip the initializer. */
24411 /* Look for the trailing `}'. */
24415 }
24418 }
24420 /* Derived classes [gram.class.derived] */
24422 /* Parse a base-clause.
24424 base-clause:
24425 : base-specifier-list
24427 base-specifier-list:
24428 base-specifier ... [opt]
24429 base-specifier-list , base-specifier ... [opt]
24431 Returns a TREE_LIST representing the base-classes, in the order in
24432 which they were declared. The representation of each node is as
24433 described by cp_parser_base_specifier.
24435 In the case that no bases are specified, this function will return
24436 NULL_TREE, not ERROR_MARK_NODE. */
24438 static tree
24440 {
24443 /* Look for the `:' that begins the list. */
24446 /* Scan the base-specifier-list. */
24448 {
24450 tree base;
24453 /* Look for the base-specifier. */
24455 /* Look for the (optional) ellipsis. */
24457 {
24458 /* Consume the `...'. */
24462 }
24464 /* Add BASE to the front of the list. */
24466 {
24468 /* Make this a pack expansion type. */
24472 {
24475 }
24476 }
24477 /* Peek at the next token. */
24479 /* If it's not a comma, then the list is complete. */
24482 /* Consume the `,'. */
24484 }
24486 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24487 base class had a qualified name. However, the next name that
24488 appears is certainly not qualified. */
24494 }
24496 /* Parse a base-specifier.
24498 base-specifier:
24499 :: [opt] nested-name-specifier [opt] class-name
24500 virtual access-specifier [opt] :: [opt] nested-name-specifier
24501 [opt] class-name
24502 access-specifier virtual [opt] :: [opt] nested-name-specifier
24503 [opt] class-name
24505 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24506 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24507 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24508 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24510 static tree
24512 {
24520 tree type;
24522 /* Process the optional `virtual' and `access-specifier'. */
24524 {
24525 /* Peek at the next token. */
24527 /* Process `virtual'. */
24529 {
24531 /* If `virtual' appears more than once, issue an error. */
24533 {
24537 }
24541 /* Consume the `virtual' token. */
24549 /* If more than one access specifier appears, issue an
24550 error. */
24553 {
24557 }
24561 /* Consume the access-specifier. */
24569 }
24570 }
24571 /* It is not uncommon to see programs mechanically, erroneously, use
24572 the 'typename' keyword to denote (dependent) qualified types
24573 as base classes. */
24575 {
24580 else
24582 "keyword %<typename%> not allowed in this context "
24585 }
24587 /* Look for the optional `::' operator. */
24589 /* Look for the nested-name-specifier. The simplest way to
24590 implement:
24592 [temp.res]
24594 The keyword `typename' is not permitted in a base-specifier or
24595 mem-initializer; in these contexts a qualified name that
24596 depends on a template-parameter is implicitly assumed to be a
24597 type name.
24599 is to pretend that we have seen the `typename' keyword at this
24600 point. */
24606 /* If the base class is given by a qualified name, assume that names
24607 we see are type names or templates, as appropriate. */
24613 /* DR 950 allows decltype as a base-specifier. */
24615 else
24616 {
24617 /* Otherwise, look for the class-name. */
24619 class_scope_p,
24620 template_p,
24621 typename_type,
24626 }
24632 }
24634 /* Exception handling [gram.exception] */
24636 /* Parse an (optional) noexcept-specification.
24638 noexcept-specification:
24639 noexcept ( constant-expression ) [opt]
24641 If no noexcept-specification is present, returns NULL_TREE.
24642 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24643 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24644 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24645 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24646 in which case a boolean condition is returned instead. */
24648 static tree
24653 {
24657 /* Peek at the next token. */
24660 /* Is it a noexcept-specification? */
24662 {
24663 tree expr;
24667 {
24668 matching_parens parens;
24678 {
24679 /* Types may not be defined in an exception-specification. */
24681 parser->type_definition_forbidden_message
24686 /* Restore the saved message. */
24688 }
24689 else
24690 {
24693 }
24699 }
24700 else
24701 {
24705 }
24707 /* We cannot build a noexcept-spec right away because this will check
24708 that expr is a constexpr. */
24711 else
24713 }
24714 else
24716 }
24718 /* Parse an (optional) exception-specification.
24720 exception-specification:
24721 throw ( type-id-list [opt] )
24723 Returns a TREE_LIST representing the exception-specification. The
24724 TREE_VALUE of each node is a type. */
24726 static tree
24728 {
24730 tree type_id_list;
24733 /* Peek at the next token. */
24736 /* Is it a noexcept-specification? */
24742 /* If it's not `throw', then there's no exception-specification. */
24748 /* Consume the `throw'. */
24751 /* Look for the `('. */
24752 matching_parens parens;
24755 /* Peek at the next token. */
24757 /* If it's not a `)', then there is a type-id-list. */
24759 {
24760 /* Types may not be defined in an exception-specification. */
24762 parser->type_definition_forbidden_message
24764 /* Parse the type-id-list. */
24766 /* Restore the saved message. */
24770 {
24774 }
24777 "dynamic exception specifications are deprecated in "
24779 }
24780 /* In C++17, throw() is equivalent to noexcept (true). throw()
24781 is deprecated in C++11 and above as well, but is still widely used,
24782 so don't warn about it yet. */
24785 else
24788 /* Look for the `)'. */
24792 }
24794 /* Parse an (optional) type-id-list.
24796 type-id-list:
24797 type-id ... [opt]
24798 type-id-list , type-id ... [opt]
24800 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24801 in the order that the types were presented. */
24803 static tree
24805 {
24809 {
24811 tree type;
24815 /* Get the next type-id. */
24817 /* Check for invalid 'auto'. */
24819 {
24823 }
24824 /* Parse the optional ellipsis. */
24826 {
24827 /* Consume the `...'. */
24830 /* Turn the type into a pack expansion expression. */
24832 }
24833 /* Add it to the list. */
24835 /* Peek at the next token. */
24837 /* If it is not a `,', we are done. */
24840 /* Consume the `,'. */
24842 }
24845 }
24847 /* Parse a try-block.
24849 try-block:
24850 try compound-statement handler-seq */
24852 static tree
24854 {
24855 tree try_block;
24869 }
24871 /* Parse a function-try-block.
24873 function-try-block:
24874 try ctor-initializer [opt] function-body handler-seq */
24876 static void
24878 {
24879 tree compound_stmt;
24880 tree try_block;
24882 /* Look for the `try' keyword. */
24885 /* Let the rest of the front end know where we are. */
24887 /* Parse the function-body. */
24888 cp_parser_ctor_initializer_opt_and_function_body
24890 /* We're done with the `try' part. */
24892 /* Parse the handlers. */
24894 /* We're done with the handlers. */
24896 }
24898 /* Parse a handler-seq.
24900 handler-seq:
24901 handler handler-seq [opt] */
24903 static void
24905 {
24907 {
24910 /* Parse the handler. */
24912 /* Peek at the next token. */
24914 /* If it's not `catch' then there are no more handlers. */
24917 }
24918 }
24920 /* Parse a handler.
24922 handler:
24923 catch ( exception-declaration ) compound-statement */
24925 static void
24927 {
24928 tree handler;
24929 tree declaration;
24933 matching_parens parens;
24940 }
24942 /* Parse an exception-declaration.
24944 exception-declaration:
24945 type-specifier-seq declarator
24946 type-specifier-seq abstract-declarator
24947 type-specifier-seq
24948 ...
24950 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24951 ellipsis variant is used. */
24953 static tree
24955 {
24956 cp_decl_specifier_seq type_specifiers;
24960 /* If it's an ellipsis, it's easy to handle. */
24962 {
24963 /* Consume the `...' token. */
24966 }
24968 /* Types may not be defined in exception-declarations. */
24970 parser->type_definition_forbidden_message
24973 /* Parse the type-specifier-seq. */
24977 /* If it's a `)', then there is no declarator. */
24980 else
24987 /* Restore the saved message. */
24994 }
24996 /* Parse a throw-expression.
24998 throw-expression:
24999 throw assignment-expression [opt]
25001 Returns a THROW_EXPR representing the throw-expression. */
25003 static tree
25005 {
25006 tree expression;
25011 /* Figure out whether or not there is an assignment-expression
25012 following the "throw" keyword. */
25020 else
25024 }
25026 /* GNU Extensions */
25028 /* Parse an (optional) asm-specification.
25030 asm-specification:
25031 asm ( string-literal )
25033 If the asm-specification is present, returns a STRING_CST
25034 corresponding to the string-literal. Otherwise, returns
25035 NULL_TREE. */
25037 static tree
25039 {
25041 tree asm_specification;
25043 /* Peek at the next token. */
25045 /* If the next token isn't the `asm' keyword, then there's no
25046 asm-specification. */
25050 /* Consume the `asm' token. */
25052 /* Look for the `('. */
25053 matching_parens parens;
25056 /* Look for the string-literal. */
25059 /* Look for the `)'. */
25063 }
25065 /* Parse an asm-operand-list.
25067 asm-operand-list:
25068 asm-operand
25069 asm-operand-list , asm-operand
25071 asm-operand:
25072 string-literal ( expression )
25073 [ string-literal ] string-literal ( expression )
25075 Returns a TREE_LIST representing the operands. The TREE_VALUE of
25076 each node is the expression. The TREE_PURPOSE is itself a
25077 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
25078 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
25079 is a STRING_CST for the string literal before the parenthesis. Returns
25080 ERROR_MARK_NODE if any of the operands are invalid. */
25082 static tree
25084 {
25089 {
25090 tree string_literal;
25091 tree expression;
25092 tree name;
25095 {
25096 /* Consume the `[' token. */
25098 /* Read the operand name. */
25103 /* Look for the closing `]'. */
25105 }
25106 else
25108 /* Look for the string-literal. */
25111 /* Look for the `('. */
25112 matching_parens parens;
25114 /* Parse the expression. */
25116 /* Look for the `)'. */
25124 /* Add this operand to the list. */
25126 expression,
25127 asm_operands);
25128 /* If the next token is not a `,', there are no more
25129 operands. */
25132 /* Consume the `,'. */
25134 }
25137 }
25139 /* Parse an asm-clobber-list.
25141 asm-clobber-list:
25142 string-literal
25143 asm-clobber-list , string-literal
25145 Returns a TREE_LIST, indicating the clobbers in the order that they
25146 appeared. The TREE_VALUE of each node is a STRING_CST. */
25148 static tree
25150 {
25154 {
25155 tree string_literal;
25157 /* Look for the string literal. */
25159 /* Add it to the list. */
25161 /* If the next token is not a `,', then the list is
25162 complete. */
25165 /* Consume the `,' token. */
25167 }
25170 }
25172 /* Parse an asm-label-list.
25174 asm-label-list:
25175 identifier
25176 asm-label-list , identifier
25178 Returns a TREE_LIST, indicating the labels in the order that they
25179 appeared. The TREE_VALUE of each node is a label. */
25181 static tree
25183 {
25187 {
25190 /* Look for the identifier. */
25193 {
25196 {
25202 }
25203 }
25204 /* If the next token is not a `,', then the list is
25205 complete. */
25208 /* Consume the `,' token. */
25210 }
25213 }
25215 /* Return TRUE iff the next tokens in the stream are possibly the
25216 beginning of a GNU extension attribute. */
25218 static bool
25220 {
25222 }
25224 /* Return TRUE iff the next tokens in the stream are possibly the
25225 beginning of a standard C++-11 attribute specifier. */
25227 static bool
25229 {
25231 }
25233 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25234 beginning of a standard C++-11 attribute specifier. */
25236 static bool
25238 {
25246 }
25248 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25249 beginning of a GNU extension attribute. */
25251 static bool
25253 {
25257 }
25259 /* Return true iff the next tokens can be the beginning of either a
25260 GNU attribute list, or a standard C++11 attribute sequence. */
25262 static bool
25264 {
25267 }
25269 /* Return true iff the next Nth tokens can be the beginning of either
25270 a GNU attribute list, or a standard C++11 attribute sequence. */
25272 static bool
25274 {
25277 }
25279 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
25280 of GNU attributes, or return NULL. */
25282 static tree
25284 {
25288 }
25290 /* Parse an (optional) series of attributes.
25292 attributes:
25293 attributes attribute
25295 attribute:
25296 __attribute__ (( attribute-list [opt] ))
25298 The return value is as for cp_parser_gnu_attribute_list. */
25300 static tree
25302 {
25309 {
25311 tree attribute_list;
25314 /* Peek at the next token. */
25316 /* If it's not `__attribute__', then we're done. */
25320 /* Consume the `__attribute__' keyword. */
25322 /* Look for the two `(' tokens. */
25323 matching_parens outer_parens;
25325 matching_parens inner_parens;
25328 /* Peek at the next token. */
25331 /* Parse the attribute-list. */
25333 else
25334 /* If the next token is a `)', then there is no attribute
25335 list. */
25338 /* Look for the two `)' tokens. */
25346 /* Add these new attributes to the list. */
25348 }
25351 }
25353 /* Parse a GNU attribute-list.
25355 attribute-list:
25356 attribute
25357 attribute-list , attribute
25359 attribute:
25360 identifier
25361 identifier ( identifier )
25362 identifier ( identifier , expression-list )
25363 identifier ( expression-list )
25365 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25366 to an attribute. The TREE_PURPOSE of each node is the identifier
25367 indicating which attribute is in use. The TREE_VALUE represents
25368 the arguments, if any. */
25370 static tree
25372 {
25378 {
25380 tree identifier;
25381 tree attribute;
25383 /* Look for the identifier. We also allow keywords here; for
25384 example `__attribute__ ((const))' is legal. */
25388 {
25391 /* Consume the token, but save it since we need it for the
25392 SIMD enabled function parsing. */
25395 /* Save away the identifier that indicates which attribute
25396 this is. */
25398 /* For keywords, use the canonical spelling, not the
25399 parsed identifier. */
25406 /* Peek at the next token. */
25408 /* If it's an `(', then parse the attribute arguments. */
25410 {
25414 vec = cp_parser_parenthesized_expression_list
25420 else
25421 {
25424 }
25425 /* Save the arguments away. */
25427 }
25430 {
25431 /* Add this attribute to the list. */
25434 }
25437 }
25438 /* Now, look for more attributes. If the next token isn't a
25439 `,', we're done. */
25443 /* Consume the comma and keep going. */
25445 }
25448 /* We built up the list in reverse order. */
25450 }
25452 /* Parse a standard C++11 attribute.
25454 The returned representation is a TREE_LIST which TREE_PURPOSE is
25455 the scoped name of the attribute, and the TREE_VALUE is its
25456 arguments list.
25458 Note that the scoped name of the attribute is itself a TREE_LIST
25459 which TREE_PURPOSE is the namespace of the attribute, and
25460 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25461 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25462 and which TREE_PURPOSE is directly the attribute name.
25464 Clients of the attribute code should use get_attribute_namespace
25465 and get_attribute_name to get the actual namespace and name of
25466 attributes, regardless of their being GNU or C++11 attributes.
25468 attribute:
25469 attribute-token attribute-argument-clause [opt]
25471 attribute-token:
25472 identifier
25473 attribute-scoped-token
25475 attribute-scoped-token:
25476 attribute-namespace :: identifier
25478 attribute-namespace:
25479 identifier
25481 attribute-argument-clause:
25482 ( balanced-token-seq )
25484 balanced-token-seq:
25485 balanced-token [opt]
25486 balanced-token-seq balanced-token
25488 balanced-token:
25489 ( balanced-token-seq )
25490 [ balanced-token-seq ]
25491 { balanced-token-seq }. */
25493 static tree
25495 {
25502 /* First, parse name of the attribute, a.k.a attribute-token. */
25519 {
25520 /* We are seeing a scoped attribute token. */
25535 else
25536 {
25540 }
25545 NULL_TREE);
25547 }
25549 {
25553 NULL_TREE);
25554 }
25555 else
25556 {
25559 NULL_TREE);
25560 /* C++11 noreturn attribute is equivalent to GNU's. */
25563 /* C++14 deprecated attribute is equivalent to GNU's. */
25566 /* C++17 fallthrough attribute is equivalent to GNU's. */
25569 /* Transactional Memory TS optimize_for_synchronized attribute is
25570 equivalent to GNU transaction_callable. */
25574 /* Transactional Memory attributes are GNU attributes. */
25577 }
25579 /* Now parse the optional argument clause of the attribute. */
25584 {
25590 /* A GNU attribute that takes an identifier in parameter. */
25593 vec = cp_parser_parenthesized_expression_list
25599 else
25600 {
25603 }
25607 else
25609 }
25612 }
25614 /* Check that the attribute ATTRIBUTE appears at most once in the
25615 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25616 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25617 isn't implemented yet in GCC. */
25619 static void
25621 {
25623 {
25633 }
25634 }
25636 /* Parse a list of standard C++-11 attributes.
25638 attribute-list:
25639 attribute [opt]
25640 attribute-list , attribute[opt]
25641 attribute ...
25642 attribute-list , attribute ...
25643 */
25645 static tree
25647 {
25652 {
25657 {
25661 }
25664 {
25669 else
25670 {
25675 }
25677 }
25681 }
25684 }
25686 /* Parse a standard C++-11 attribute specifier.
25688 attribute-specifier:
25689 [ [ attribute-using-prefix [opt] attribute-list ] ]
25690 alignment-specifier
25692 attribute-using-prefix:
25693 using attribute-namespace :
25695 alignment-specifier:
25696 alignas ( type-id ... [opt] )
25697 alignas ( alignment-expression ... [opt] ). */
25699 static tree
25701 {
25707 {
25714 {
25725 {
25729 "attribute using prefix only available "
25735 }
25736 else
25738 }
25745 else
25746 /* Warn about parsing c++11 attribute in non-c++11 mode, only
25747 when we are sure that we have actually parsed them. */
25749 }
25750 else
25751 {
25752 tree alignas_expr;
25754 /* Look for an alignment-specifier. */
25765 matching_parens parens;
25773 {
25780 }
25785 /* Handle alignas (pack...). */
25787 {
25790 }
25792 /* Something went wrong, so don't build the attribute. */
25799 /* Build the C++-11 representation of an 'aligned'
25800 attribute. */
25801 attributes
25804 }
25807 }
25809 /* Parse a standard C++-11 attribute-specifier-seq.
25811 attribute-specifier-seq:
25812 attribute-specifier-seq [opt] attribute-specifier
25813 */
25815 static tree
25817 {
25822 {
25831 else
25834 }
25837 }
25839 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25840 return index of the first token after balanced-token, or N on failure. */
25842 static size_t
25844 {
25847 do
25849 {
25852 /* Ran out of tokens. */
25874 }
25877 }
25879 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25880 return index of the first token after the GNU attribute tokens, or N on
25881 failure. */
25883 static size_t
25885 {
25887 {
25899 }
25901 }
25903 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25904 next token), return index of the first token after the standard C++11
25905 attribute tokens, or N on failure. */
25907 static size_t
25909 {
25911 {
25914 {
25921 }
25924 {
25929 }
25930 else
25932 }
25934 }
25936 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25937 as the next token), return index of the first token after the attribute
25938 tokens, or N on failure. */
25940 static size_t
25942 {
25946 }
25948 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25949 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25950 current value of the PEDANTIC flag, regardless of whether or not
25951 the `__extension__' keyword is present. The caller is responsible
25952 for restoring the value of the PEDANTIC flag. */
25954 static bool
25956 {
25957 /* Save the old value of the PEDANTIC flag. */
25961 {
25962 /* Consume the `__extension__' token. */
25964 /* We're not being pedantic while the `__extension__' keyword is
25965 in effect. */
25969 }
25972 }
25974 /* Parse a label declaration.
25976 label-declaration:
25977 __label__ label-declarator-seq ;
25979 label-declarator-seq:
25980 identifier , label-declarator-seq
25981 identifier */
25983 static void
25985 {
25986 /* Look for the `__label__' keyword. */
25990 {
25991 tree identifier;
25993 /* Look for an identifier. */
25995 /* If we failed, stop. */
25998 /* Declare it as a label. */
26000 /* If the next token is a `;', stop. */
26003 /* Look for the `,' separating the label declarations. */
26005 }
26007 /* Look for the final `;'. */
26009 }
26011 // -------------------------------------------------------------------------- //
26012 // Requires Clause
26014 // Parse a requires clause.
26015 //
26016 // requires-clause:
26017 // 'requires' logical-or-expression
26018 //
26019 // The required logical-or-expression must be a constant expression. Note
26020 // that we don't check that the expression is constepxr here. We defer until
26021 // we analyze constraints and then, we only check atomic constraints.
26022 static tree
26024 {
26025 // Parse the requires clause so that it is not automatically folded.
26033 }
26035 // Optionally parse a requires clause:
26036 static tree
26038 {
26041 {
26044 {
26047 /* Parse and discard the requires-clause. */
26050 }
26052 }
26055 }
26058 /*---------------------------------------------------------------------------
26059 Requires expressions
26060 ---------------------------------------------------------------------------*/
26062 /* Parse a requires expression
26064 requirement-expression:
26065 'requires' requirement-parameter-list [opt] requirement-body */
26066 static tree
26068 {
26072 /* A requires-expression shall appear only within a concept
26073 definition or a requires-clause.
26075 TODO: Implement this diagnostic correctly. */
26077 {
26081 }
26084 {
26085 /* Local parameters are delared as variables within the scope
26086 of the expression. They are not visible past the end of
26087 the expression. Expressions within the requires-expression
26088 are unevaluated. */
26089 struct scope_sentinel
26090 {
26092 {
26095 }
26098 {
26101 }
26104 /* Parse the optional parameter list. */
26106 {
26110 }
26111 else
26114 /* Parse the requirement body. */
26118 }
26120 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
26121 the parm chain. */
26124 }
26126 /* Parse a parameterized requirement.
26128 requirement-parameter-list:
26129 '(' parameter-declaration-clause ')' */
26130 static tree
26132 {
26133 matching_parens parens;
26143 }
26145 /* Parse the body of a requirement.
26147 requirement-body:
26148 '{' requirement-list '}' */
26149 static tree
26151 {
26152 matching_braces braces;
26162 }
26164 /* Parse a list of requirements.
26166 requirement-list:
26167 requirement
26168 requirement-list ';' requirement[opt] */
26169 static tree
26171 {
26174 {
26181 /* If we see a semi-colon, consume it. */
26185 /* Stop processing at the end of the list. */
26188 }
26190 /* Reverse the order of requirements so they are analyzed in
26191 declaration order. */
26193 }
26195 /* Parse a syntactic requirement or type requirement.
26197 requirement:
26198 simple-requirement
26199 compound-requirement
26200 type-requirement
26201 nested-requirement */
26202 static tree
26204 {
26211 else
26213 }
26215 /* Parse a simple requirement.
26217 simple-requirement:
26218 expression ';' */
26219 static tree
26221 {
26230 }
26232 /* Parse a type requirement
26234 type-requirement
26235 nested-name-specifier [opt] required-type-name ';'
26237 required-type-name:
26238 type-name
26239 'template' [opt] simple-template-id */
26240 static tree
26242 {
26245 // Save the scope before parsing name specifiers.
26256 tree type;
26258 {
26267 }
26268 else
26287 }
26289 /* Parse a compound requirement
26291 compound-requirement:
26292 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
26293 static tree
26295 {
26296 /* Parse an expression enclosed in '{ }'s. */
26297 matching_braces braces;
26308 /* Parse the optional noexcept. */
26311 {
26314 }
26316 /* Parse the optional trailing return type. */
26319 {
26327 }
26330 }
26332 /* Parse a nested requirement. This is the same as a requires clause.
26334 nested-requirement:
26335 requires-clause */
26336 static tree
26338 {
26344 }
26346 /* Support Functions */
26348 /* Return the appropriate prefer_type argument for lookup_name_real based on
26349 tag_type and template_mem_access. */
26353 {
26354 /* DR 141: When looking in the current enclosing context for a template-name
26355 after -> or ., only consider class templates. */
26359 {
26363 }
26364 }
26366 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26367 NAME should have one of the representations used for an
26368 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26369 is returned. If PARSER->SCOPE is a dependent type, then a
26370 SCOPE_REF is returned.
26372 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26373 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26374 was formed. Abstractly, such entities should not be passed to this
26375 function, because they do not need to be looked up, but it is
26376 simpler to check for this special case here, rather than at the
26377 call-sites.
26379 In cases not explicitly covered above, this function returns a
26380 DECL, OVERLOAD, or baselink representing the result of the lookup.
26381 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26382 is returned.
26384 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26385 (e.g., "struct") that was used. In that case bindings that do not
26386 refer to types are ignored.
26388 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26389 ignored.
26391 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26392 are ignored.
26394 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26395 types.
26397 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26398 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26399 NULL_TREE otherwise. */
26401 static cp_expr
26408 location_t name_location)
26409 {
26410 tree decl;
26413 /* Assume that the lookup will be unambiguous. */
26417 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26418 no longer valid. Note that if we are parsing tentatively, and
26419 the parse fails, OBJECT_TYPE will be automatically restored. */
26425 /* A template-id has already been resolved; there is no lookup to
26426 do. */
26430 {
26434 }
26436 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26437 it should already have been checked to make sure that the name
26438 used matches the type being destroyed. */
26440 {
26441 tree type;
26443 /* Figure out to which type this destructor applies. */
26448 else
26450 /* If that's not a class type, there is no destructor. */
26461 }
26463 /* By this point, the NAME should be an ordinary identifier. If
26464 the id-expression was a qualified name, the qualifying scope is
26465 stored in PARSER->SCOPE at this point. */
26468 /* Perform the lookup. */
26470 {
26476 /* If the SCOPE is dependent, the lookup must be deferred until
26477 the template is instantiated -- unless we are explicitly
26478 looking up names in uninstantiated templates. Even then, we
26479 cannot look up the name if the scope is not a class type; it
26480 might, for example, be a template type parameter. */
26485 /* Defer lookup. */
26487 else
26488 {
26491 /* If PARSER->SCOPE is a dependent type, then it must be a
26492 class type, and we must not be checking dependencies;
26493 otherwise, we would have processed this lookup above. So
26494 that PARSER->SCOPE is not considered a dependent base by
26495 lookup_member, we must enter the scope here. */
26499 /* If the PARSER->SCOPE is a template specialization, it
26500 may be instantiated during name lookup. In that case,
26501 errors may be issued. Even if we rollback the current
26502 tentative parse, those errors are valid. */
26507 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26508 lookup result and the nested-name-specifier nominates a class C:
26509 * if the name specified after the nested-name-specifier, when
26510 looked up in C, is the injected-class-name of C (Clause 9), or
26511 * if the name specified after the nested-name-specifier is the
26512 same as the identifier or the simple-template-id's template-
26513 name in the last component of the nested-name-specifier,
26514 the name is instead considered to name the constructor of
26515 class C. [ Note: for example, the constructor is not an
26516 acceptable lookup result in an elaborated-type-specifier so
26517 the constructor would not be used in place of the
26518 injected-class-name. --end note ] Such a constructor name
26519 shall be used only in the declarator-id of a declaration that
26520 names a constructor or in a using-declaration. */
26528 /* If we have a single function from a using decl, pull it out. */
26535 }
26537 /* If the scope is a dependent type and either we deferred lookup or
26538 we did lookup but didn't find the name, rememeber the name. */
26541 {
26543 {
26544 tree type;
26546 /* The resolution to Core Issue 180 says that `struct
26547 A::B' should be considered a type-name, even if `A'
26548 is dependent. */
26553 }
26557 CPP_CLOSE_PAREN)))
26561 else
26564 is_template);
26565 }
26568 }
26570 {
26571 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26572 OBJECT_TYPE is not a class. */
26574 /* If the OBJECT_TYPE is a template specialization, it may
26575 be instantiated during name lookup. In that case, errors
26576 may be issued. Even if we rollback the current tentative
26577 parse, those errors are valid. */
26579 name,
26582 tf_warning_or_error);
26583 else
26587 /* Look it up in the enclosing context. DR 141: When looking for a
26588 template-name after -> or ., only consider class templates. */
26593 /* The object is type-dependent, so we can't look anything up; we used
26594 this to get the DR 141 behavior. */
26598 }
26599 else
26600 {
26606 }
26608 /* If the lookup failed, let our caller know. */
26612 /* Pull out the template from an injected-class-name (or multiple). */
26616 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26618 {
26621 /* The error message we have to print is too complicated for
26622 cp_parser_error, so we incorporate its actions directly. */
26624 {
26626 name);
26628 }
26630 }
26638 /* If we have resolved the name of a member declaration, check to
26639 see if the declaration is accessible. When the name resolves to
26640 set of overloaded functions, accessibility is checked when
26641 overload resolution is done.
26643 During an explicit instantiation, access is not checked at all,
26644 as per [temp.explicit]. */
26651 }
26653 /* Like cp_parser_lookup_name, but for use in the typical case where
26654 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26655 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26657 static tree
26659 {
26661 none_type,
26666 location);
26667 }
26669 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26670 the current context, return the TYPE_DECL. If TAG_NAME_P is
26671 true, the DECL indicates the class being defined in a class-head,
26672 or declared in an elaborated-type-specifier.
26674 Otherwise, return DECL. */
26676 static tree
26678 {
26679 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26680 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26682 struct A {
26683 template <typename T> struct B;
26684 };
26686 template <typename T> struct A::B {};
26688 Similarly, in an elaborated-type-specifier:
26690 namespace N { struct X{}; }
26692 struct A {
26693 template <typename T> friend struct N::X;
26694 };
26696 However, if the DECL refers to a class type, and we are in
26697 the scope of the class, then the name lookup automatically
26698 finds the TYPE_DECL created by build_self_reference rather
26699 than a TEMPLATE_DECL. For example, in:
26701 template <class T> struct S {
26702 S s;
26703 };
26705 there is no need to handle such case. */
26711 }
26713 /* If too many, or too few, template-parameter lists apply to the
26714 declarator, issue an error message. Returns TRUE if all went well,
26715 and FALSE otherwise. */
26717 static bool
26720 location_t declarator_location)
26721 {
26723 {
26725 {
26734 {
26735 /* If the DECLARATOR has the form `X<y>' then it uses one
26736 additional level of template parameters. */
26739 }
26741 return cp_parser_check_template_parameters
26743 declarator);
26744 }
26760 }
26762 }
26764 /* NUM_TEMPLATES were used in the current declaration. If that is
26765 invalid, return FALSE and issue an error messages. Otherwise,
26766 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26767 declarator and we can print more accurate diagnostics. */
26769 static bool
26773 location_t location,
26775 {
26776 /* If there are the same number of template classes and parameter
26777 lists, that's OK. */
26780 /* If there are more, but only one more, and the name ends in an identifier,
26781 then we are declaring a primary template. That's OK too. */
26785 /* If there are more template classes than parameter lists, we have
26786 something like:
26788 template <class T> void S<T>::R<T>::f (); */
26790 {
26800 else
26803 }
26804 /* Otherwise, there are too many template parameter lists. We have
26805 something like:
26807 template <class T> template <class U> void S::f(); */
26810 }
26812 /* Parse an optional `::' token indicating that the following name is
26813 from the global namespace. If so, PARSER->SCOPE is set to the
26814 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26815 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26816 Returns the new value of PARSER->SCOPE, if the `::' token is
26817 present, and NULL_TREE otherwise. */
26819 static tree
26821 {
26824 /* Peek at the next token. */
26826 /* If we're looking at a `::' token then we're starting from the
26827 global namespace, not our current location. */
26829 {
26830 /* Consume the `::' token. */
26832 /* Set the SCOPE so that we know where to start the lookup. */
26838 }
26840 {
26844 }
26847 }
26849 /* Returns TRUE if the upcoming token sequence is the start of a
26850 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26851 declarator is preceded by the `friend' specifier. */
26853 static bool
26855 {
26858 tree nested_name_specifier;
26861 /* The common case is that this is not a constructor declarator, so
26862 try to avoid doing lots of work if at all possible. It's not
26863 valid declare a constructor at function scope. */
26866 /* And only certain tokens can begin a constructor declarator. */
26874 /* Parse tentatively; we are going to roll back all of the tokens
26875 consumed here. */
26877 /* Assume that we are looking at a constructor declarator. */
26880 /* Look for the optional `::' operator. */
26883 /* Look for the nested-name-specifier. */
26884 nested_name_specifier
26895 /* Outside of a class-specifier, there must be a
26896 nested-name-specifier. Except in C++17 mode, where we
26897 might be declaring a guiding declaration. */
26904 /* If we have a class scope, this is easy; DR 147 says that S::S always
26905 names the constructor, and no other qualified name could. */
26908 {
26918 }
26919 /* If we still think that this might be a constructor-declarator,
26920 look for a class-name. */
26922 {
26923 /* If we have:
26925 template <typename T> struct S {
26926 S();
26927 };
26929 we must recognize that the nested `S' names a class. */
26933 tree type_decl;
26937 none_type,
26944 {
26950 none_type,
26955 else
26957 }
26959 /* If there was no class-name, then this is not a constructor.
26960 Otherwise, if we are in a class-specifier and we aren't
26961 handling a friend declaration, check that its type matches
26962 current_class_type (c++/38313). Note: error_mark_node
26963 is left alone for error recovery purposes. */
26965 && (outside_class_specifier_p
26971 /* If we're still considering a constructor, we have to see a `(',
26972 to begin the parameter-declaration-clause, followed by either a
26973 `)', an `...', or a decl-specifier. We need to check for a
26974 type-specifier to avoid being fooled into thinking that:
26976 S (f) (int);
26978 is a constructor. (It is actually a function named `f' that
26979 takes one parameter (of type `int') and returns a value of type
26980 `S'. */
26988 /* A parameter declaration begins with a decl-specifier,
26989 which is either the "attribute" keyword, a storage class
26990 specifier, or (usually) a type-specifier. */
26992 {
26993 tree type;
26997 /* Names appearing in the type-specifier should be looked up
26998 in the scope of the class. */
27002 {
27005 {
27009 {
27012 }
27013 }
27015 }
27017 /* Inside the constructor parameter list, surrounding
27018 template-parameter-lists do not apply. */
27019 saved_num_template_parameter_lists
27023 /* Look for the type-specifier. */
27025 CP_PARSER_FLAGS_NONE,
27031 parser->num_template_parameter_lists
27034 /* Leave the scope of the class. */
27039 }
27040 }
27042 /* We did not really want to consume any tokens. */
27046 }
27048 /* Parse the definition of the function given by the DECL_SPECIFIERS,
27049 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
27050 they must be performed once we are in the scope of the function.
27052 Returns the function defined. */
27054 static tree
27055 cp_parser_function_definition_from_specifiers_and_declarator
27058 tree attributes,
27060 {
27061 tree fn;
27064 /* Begin the function-definition. */
27067 /* The things we're about to see are not directly qualified by any
27068 template headers we've seen thus far. */
27071 /* If there were names looked up in the decl-specifier-seq that we
27072 did not check, check them now. We must wait until we are in the
27073 scope of the function to perform the checks, since the function
27074 might be a friend. */
27078 {
27083 }
27086 {
27087 /* Skip the entire function. */
27090 }
27092 {
27093 /* Seen already, skip it. An error message has already been output. */
27097 /* If this is a function from a class, pop the nested class. */
27100 }
27101 else
27102 {
27103 timevar_id_t tv;
27106 else
27112 }
27115 }
27117 /* Parse the part of a function-definition that follows the
27118 declarator. INLINE_P is TRUE iff this function is an inline
27119 function defined within a class-specifier.
27121 Returns the function defined. */
27123 static tree
27126 {
27127 tree fn;
27132 bool fully_implicit_function_template_p
27135 tree implicit_template_parms
27138 cp_binding_level* implicit_template_scope
27144 /* If the next token is `return', then the code may be trying to
27145 make use of the "named return value" extension that G++ used to
27146 support. */
27149 {
27150 /* Consume the `return' keyword. */
27152 /* Look for the identifier that indicates what value is to be
27153 returned. */
27155 /* Issue an error message. */
27158 /* Skip tokens until we reach the start of the function body. */
27160 {
27167 }
27168 }
27169 /* The `extern' in `extern "C" void f () { ... }' does not apply to
27170 anything declared inside `f'. */
27171 saved_in_unbraced_linkage_specification_p
27174 /* Inside the function, surrounding template-parameter-lists do not
27175 apply. */
27176 saved_num_template_parameter_lists
27180 /* If the next token is `try', `__transaction_atomic', or
27181 `__transaction_relaxed`, then we are looking at either function-try-block
27182 or function-transaction-block. Note that all of these include the
27183 function-body. */
27187 RID_TRANSACTION_RELAXED))
27191 else
27192 cp_parser_ctor_initializer_opt_and_function_body
27195 /* Finish the function. */
27197 /* Generate code for it, if necessary. */
27199 /* Restore the saved values. */
27200 parser->in_unbraced_linkage_specification_p
27202 parser->num_template_parameter_lists
27206 parser->fully_implicit_function_template_p
27208 parser->implicit_template_parms
27210 parser->implicit_template_scope
27217 }
27219 /* Parse a template-declaration body (following argument list). */
27221 static void
27223 tree parameter_list,
27225 {
27229 /* We just processed one more parameter list. */
27232 /* Get the deferred access checks from the parameter list. These
27233 will be checked once we know what is being declared, as for a
27234 member template the checks must be performed in the scope of the
27235 class containing the member. */
27238 /* Tentatively parse for a new template parameter list, which can either be
27239 the template keyword or a template introduction. */
27245 else
27246 {
27247 /* There are no access checks when parsing a template, as we do not
27248 know if a specialization will be a friend. */
27252 checks,
27253 member_p,
27258 /* If this is a member template declaration, let the front
27259 end know. */
27261 {
27266 }
27271 }
27272 /* We are done with the current parameter list. */
27277 /* Finish up. */
27280 /* Check the template arguments for a literal operator template. */
27284 {
27288 else
27289 {
27292 {
27296 /* OK, C++20 string literal operator template. We don't need
27297 to warn in lower dialects here because we will have already
27302 }
27304 {
27313 else
27314 /* http://cplusplus.github.io/EWG/ewg-active.html#66 */
27316 "ISO C++ did not adopt string literal operator templa"
27318 }
27319 else
27321 }
27323 {
27326 " Expected non-type template parameter pack <char...> "
27328 decl);
27329 else
27332 decl);
27333 }
27334 }
27336 /* Register member declarations. */
27339 /* If DECL is a function template, we must return to parse it later.
27340 (Even though there is no definition, there might be default
27341 arguments that need handling.) */
27345 }
27347 /* Parse a template introduction header for a template-declaration. Returns
27348 false if tentative parse fails. */
27350 static bool
27352 {
27359 /* Look for the optional `::' operator. */
27362 /* Look for the nested-name-specifier. */
27372 /* Look up the concept for which we will be matching
27373 template parameters. */
27383 /* Look for opening brace for introduction. */
27384 matching_braces braces;
27392 /* Build vector of placeholder parameters and grab
27393 matching identifiers. */
27396 /* Look for closing brace for introduction. */
27400 /* The introduction-list shall not be empty. */
27403 {
27404 /* In cp_parser_introduction_list we have already issued an error. */
27406 }
27409 {
27413 }
27415 /* Build and associate the constraint. */
27418 {
27420 member_p);
27422 }
27426 }
27428 /* Parse a normal template-declaration following the template keyword. */
27430 static void
27432 {
27433 tree parameter_list;
27437 /* Look for the `<' token. */
27441 {
27442 /* 14.5.2.2 [temp.mem]
27444 A local class shall not have member templates. */
27449 }
27450 /* [temp]
27452 A template ... shall not have C linkage. */
27454 {
27457 /* Give it C++ linkage to avoid confusing other parts of the
27458 front end. */
27461 }
27462 else
27465 /* We cannot perform access checks on the template parameter
27466 declarations until we know what is being declared, just as we
27467 cannot check the decl-specifier list. */
27470 /* If the next token is `>', then we have an invalid
27471 specialization. Rather than complain about an invalid template
27472 parameter, issue an error message here. */
27474 {
27478 }
27479 else
27480 {
27481 /* Parse the template parameters. */
27483 }
27485 /* Look for the `>'. */
27488 /* Manage template requirements */
27490 {
27495 }
27498 member_p);
27500 /* For the erroneous case of a template with C linkage, we pushed an
27501 implicit C++ linkage scope; exit that scope now. */
27504 }
27506 /* Parse a template-declaration, assuming that the `export' (and
27507 `extern') keywords, if present, has already been scanned. MEMBER_P
27508 is as for cp_parser_template_declaration. */
27510 static bool
27512 {
27514 {
27518 }
27523 }
27525 /* Perform the deferred access checks from a template-parameter-list.
27526 CHECKS is a TREE_LIST of access checks, as returned by
27527 get_deferred_access_checks. */
27529 static void
27530 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27531 {
27535 }
27537 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27538 `function-definition' sequence that follows a template header.
27539 If MEMBER_P is true, this declaration appears in a class scope.
27541 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27542 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27544 static tree
27550 {
27553 cp_decl_specifier_seq decl_specifiers;
27557 /* This function is only used when processing a template
27558 declaration. */
27562 /* Defer access checks until we know what is being declared. */
27565 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27566 alternative. */
27569 CP_PARSER_FLAGS_OPTIONAL,
27575 /* There are no template typedefs. */
27577 {
27581 }
27583 /* Gather up the access checks that occurred the
27584 decl-specifier-seq. */
27587 /* Check for the declaration of a template class. */
27589 {
27592 {
27593 // If this is a declaration, but not a definition, associate
27594 // any constraints with the type declaration. Constraints
27595 // are associated with definitions in cp_parser_class_specifier.
27601 /* In this case:
27603 struct C {
27604 friend template <typename T> struct A<T>::B;
27605 };
27607 A<T>::B will be represented by a TYPENAME_TYPE, and
27608 therefore not recognized by shadow_tag. */
27610 && !decl
27617 else
27620 /* Perform access checks for template parameters. */
27623 /* Give a helpful diagnostic for
27624 template <class T> struct A { } a;
27625 if we aren't already recovering from an error. */
27628 {
27630 "a class template declaration must not declare "
27634 }
27635 }
27636 }
27638 /* Complain about missing 'typename' or other invalid type names. */
27641 {
27642 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27643 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27644 the rest of this declaration. */
27647 }
27649 /* If it's not a template class, try for a template function. If
27650 the next token is a `;', then this declaration does not declare
27651 anything. But, if there were errors in the decl-specifiers, then
27652 the error might well have come from an attempted class-specifier.
27653 In that case, there's no need to warn about a missing declarator. */
27657 {
27660 checks,
27662 member_p,
27663 declares_class_or_enum,
27667 /* 7.1.1-1 [dcl.stc]
27669 A storage-class-specifier shall not be specified in an explicit
27670 specialization... */
27672 && explicit_specialization_p
27674 {
27678 }
27682 }
27684 /* Look for a trailing `;' after the declaration. */
27690 out:
27693 /* Clear any current qualification; whatever comes next is the start
27694 of something new. */
27700 }
27702 /* Parse a cast-expression that is not the operand of a unary "&". */
27704 static cp_expr
27706 {
27709 }
27711 /* Parse a functional cast to TYPE. Returns an expression
27712 representing the cast. */
27714 static cp_expr
27716 {
27718 tree expression_list;
27719 cp_expr cast;
27728 {
27738 /* Create a location of the form:
27739 type_name{i, f}
27740 ^~~~~~~~~~~~~~~
27741 with caret == start at the start of the type name,
27742 finishing at the closing brace. */
27743 location_t finish_loc
27746 finish_loc);
27749 }
27758 else
27759 {
27762 }
27765 tf_warning_or_error);
27766 /* [expr.const]/1: In an integral constant expression "only type
27767 conversions to integral or enumeration type can be used". */
27773 NIC_CONSTRUCTOR))
27776 /* Create a location of the form:
27777 float(i)
27778 ^~~~~~~~
27779 with caret == start at the start of the type name,
27780 finishing at the closing paren. */
27781 location_t finish_loc
27786 }
27788 /* Save the tokens that make up the body of a member function defined
27789 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27790 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27791 specifiers applied to the declaration. Returns the FUNCTION_DECL
27792 for the member function. */
27794 static tree
27798 tree attributes)
27799 {
27802 tree fn;
27805 /* Create the FUNCTION_DECL. */
27809 /* If something went badly wrong, bail out now. */
27811 {
27812 /* If there's a function-body, skip it. */
27817 }
27819 /* Remember it, if there default args to post process. */
27822 /* Save away the tokens that make up the body of the
27823 function. */
27829 RID_TRANSACTION_ATOMIC))
27830 {
27832 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27839 {
27845 }
27846 else
27849 {
27853 }
27854 }
27856 /* Handle function try blocks. */
27858 {
27861 }
27862 /* We can have braced-init-list mem-initializers before the fn body. */
27864 {
27867 {
27868 /* cache_group will stop after an un-nested { } pair, too. */
27872 /* variadic mem-inits have ... after the ')'. */
27875 }
27876 }
27878 /* Handle function try blocks. */
27884 /* Save away the inline definition; we will process it when the
27885 class is complete. */
27889 /* We need to know that this was defined in the class, so that
27890 friend templates are handled correctly. */
27893 /* Add FN to the queue of functions to be parsed later. */
27897 }
27899 /* Save the tokens that make up the in-class initializer for a non-static
27900 data member. Returns a DEFAULT_ARG. */
27902 static tree
27904 {
27906 }
27908 /* Parse a template-argument-list, as well as the trailing ">" (but
27909 not the opening "<"). See cp_parser_template_argument_list for the
27910 return value. */
27912 static tree
27914 {
27915 tree arguments;
27916 tree saved_scope;
27917 tree saved_qualifying_scope;
27918 tree saved_object_scope;
27921 /* [temp.names]
27923 When parsing a template-id, the first non-nested `>' is taken as
27924 the end of the template-argument-list rather than a greater-than
27925 operator. */
27926 saved_greater_than_is_operator_p
27929 /* Parsing the argument list may modify SCOPE, so we save it
27930 here. */
27934 /* We need to evaluate the template arguments, even though this
27935 template-id may be nested within a "sizeof". */
27936 cp_evaluated ev;
27937 /* Parse the template-argument-list itself. */
27941 else
27943 /* Look for the `>' that ends the template-argument-list. If we find
27944 a '>>' instead, it's probably just a typo. */
27946 {
27948 {
27949 /* In C++0x, a `>>' in a template argument list or cast
27950 expression is considered to be two separate `>'
27951 tokens. So, change the current token to a `>', but don't
27952 consume it: it will be consumed later when the outer
27953 template argument list (or cast expression) is parsed.
27954 Note that this replacement of `>' for `>>' is necessary
27955 even if we are parsing tentatively: in the tentative
27956 case, after calling
27957 cp_parser_enclosed_template_argument_list we will always
27958 throw away all of the template arguments and the first
27959 closing `>', either because the template argument list
27960 was erroneous or because we are replacing those tokens
27961 with a CPP_TEMPLATE_ID token. The second `>' (which will
27962 not have been thrown away) is needed either to close an
27963 outer template argument list or to complete a new-style
27964 cast. */
27967 }
27969 {
27970 /* If we're in a nested template argument list, the '>>' has
27971 to be a typo for '> >'. We emit the error message, but we
27972 continue parsing and we push a '>' as next token, so that
27973 the argument list will be parsed correctly. Note that the
27974 global source location is still on the token before the
27975 '>>', so we need to say explicitly where we want it. */
27983 }
27984 else
27985 {
27986 /* If this is not a nested template argument list, the '>>'
27987 is a typo for '>'. Emit an error message and continue.
27988 Same deal about the token location, but here we can get it
27989 right by consuming the '>>' before issuing the diagnostic. */
27992 "spurious %<>>%>, use %<>%> to terminate "
27994 }
27995 }
27996 else
27998 /* The `>' token might be a greater-than operator again now. */
27999 parser->greater_than_is_operator_p
28001 /* Restore the SAVED_SCOPE. */
28007 }
28009 /* MEMBER_FUNCTION is a member function, or a friend. If default
28010 arguments, or the body of the function have not yet been parsed,
28011 parse them now. */
28013 static void
28015 {
28017 /* If this member is a template, get the underlying
28018 FUNCTION_DECL. */
28022 /* There should not be any class definitions in progress at this
28023 point; the bodies of members are only parsed outside of all class
28024 definitions. */
28026 /* While we're parsing the member functions we might encounter more
28027 classes. We want to handle them right away, but we don't want
28028 them getting mixed up with functions that are currently in the
28029 queue. */
28032 /* Make sure that any template parameters are in scope. */
28035 /* If the body of the function has not yet been parsed, parse it
28036 now. */
28038 {
28039 tree function_scope;
28042 /* The function is no longer pending; we are processing it. */
28047 /* If this is a local class, enter the scope of the containing
28048 function. */
28053 /* Push the body of the function onto the lexer stack. */
28056 /* Let the front end know that we going to be defining this
28057 function. */
28061 /* Don't do access checking if it is a templated function. */
28065 /* #pragma omp declare reduction needs special parsing. */
28067 {
28072 }
28073 else
28074 /* Now, parse the body of the function. */
28081 /* Leave the scope of the containing function. */
28085 }
28087 /* Remove any template parameters from the symbol table. */
28090 /* Restore the queue. */
28093 }
28095 /* If DECL contains any default args, remember it on the unparsed
28096 functions queue. */
28098 static void
28100 {
28101 tree probe;
28104 probe;
28107 {
28111 }
28112 }
28114 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
28115 which is either a FIELD_DECL or PARM_DECL. Parse it and return
28116 the result. For a PARM_DECL, PARMTYPE is the corresponding type
28117 from the parameter-type-list. */
28119 static tree
28122 {
28124 tree parsed_arg;
28130 /* Push the saved tokens for the default argument onto the parser's
28131 lexer stack. */
28137 /* Parse the default argument. */
28148 {
28149 /* In a non-template class, check conversions now. In a template,
28150 we'll wait and instantiate these as needed. */
28153 tf_warning_or_error);
28156 else
28158 }
28160 /* If the token stream has not been completely used up, then
28161 there was extra junk after the end of the default
28162 argument. */
28164 {
28167 else
28169 }
28171 /* Revert to the main lexer. */
28175 }
28177 /* FIELD is a non-static data member with an initializer which we saved for
28178 later; parse it now. */
28180 static void
28182 {
28183 tree def;
28190 NULL_TREE);
28196 }
28198 /* FN is a FUNCTION_DECL which may contains a parameter with an
28199 unparsed DEFAULT_ARG. Parse the default args now. This function
28200 assumes that the current scope is the scope in which the default
28201 argument should be processed. */
28203 static void
28205 {
28209 /* While we're parsing the default args, we might (due to the
28210 statement expression extension) encounter more classes. We want
28211 to handle them right away, but we don't want them getting mixed
28212 up with default args that are currently in the queue. */
28215 /* Local variable names (and the `this' keyword) may not appear
28216 in a default argument. */
28227 {
28229 tree parsed_arg;
28231 tree copy;
28238 /* This can happen for a friend declaration for a function
28239 already declared with default arguments. */
28242 parsed_arg
28244 default_arg,
28248 /* Update any instantiations we've already created. */
28252 }
28256 /* Make sure no default arg is missing. */
28259 /* Restore the state of local_variables_forbidden_p. */
28262 /* Restore the queue. */
28264 }
28266 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
28268 sizeof ... ( identifier )
28270 where the 'sizeof' token has already been consumed. */
28272 static tree
28274 {
28275 /* Consume the `...'. */
28279 matching_parens parens;
28283 else
28291 /* The name is not qualified. */
28310 }
28312 /* Parse the operand of `sizeof' (or a similar operator). Returns
28313 either a TYPE or an expression, depending on the form of the
28314 input. The KEYWORD indicates which kind of expression we have
28315 encountered. */
28317 static tree
28319 {
28326 /* If it's a `...', then we are computing the length of a parameter
28327 pack. */
28332 /* Types cannot be defined in a `sizeof' expression. Save away the
28333 old message. */
28335 /* And create the new one. */
28341 /* The restrictions on constant-expressions do not apply inside
28342 sizeof expressions. */
28343 saved_integral_constant_expression_p
28345 saved_non_integral_constant_expression_p
28349 /* Do not actually evaluate the expression. */
28352 /* If it's a `(', then we might be looking at the type-id
28353 construction. */
28355 {
28358 /* We can't be sure yet whether we're looking at a type-id or an
28359 expression. */
28362 matching_parens parens;
28365 /* Note: as a GNU Extension, compound literals are considered
28366 postfix-expressions as they are in C99, so they are valid
28367 arguments to sizeof. See comment in cp_parser_cast_expression
28368 for details. */
28371 else
28372 {
28375 /* Look for the type-id. */
28377 /* Look for the closing `)'. */
28380 }
28382 /* If all went well, then we're done. */
28385 }
28387 /* If the type-id production did not work out, then we must be
28388 looking at the unary-expression production. */
28392 /* Go back to evaluating expressions. */
28396 /* Free the message we created. */
28398 /* And restore the old one. */
28400 parser->integral_constant_expression_p
28402 parser->non_integral_constant_expression_p
28406 }
28408 /* If the current declaration has no declarator, return true. */
28410 static bool
28412 {
28413 /* If the next token is a `;' or a `,' then there is no
28414 declarator. */
28417 }
28419 /* Update the DECL_SPECS to reflect the storage class indicated by
28420 KEYWORD. */
28422 static void
28427 {
28428 cp_storage_class storage_class;
28431 {
28435 }
28437 {
28440 }
28445 {
28448 }
28451 {
28469 }
28473 /* A storage class specifier cannot be applied alongside a typedef
28474 specifier. If there is a typedef specifier present then set
28475 conflicting_specifiers_p which will trigger an error later
28476 on in grokdeclarator. */
28479 }
28481 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28482 is true, the type is a class or enum definition. */
28484 static void
28486 tree type_spec,
28489 {
28492 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28493 (with, for example, in "typedef int wchar_t;") we remember that
28494 this is what happened. In system headers, we ignore these
28495 declarations so that G++ can work with system headers that are not
28496 C++-safe. */
28498 && !type_definition_p
28508 {
28511 ds_redefined_builtin_type_spec,
28512 token);
28514 {
28518 }
28519 }
28522 else
28523 {
28528 }
28529 }
28531 /* True iff TOKEN is the GNU keyword __thread. */
28533 static bool
28535 {
28538 }
28540 /* Set the location for a declarator specifier and check if it is
28541 duplicated.
28543 DECL_SPECS is the sequence of declarator specifiers onto which to
28544 set the location.
28546 DS is the single declarator specifier to set which location is to
28547 be set onto the existing sequence of declarators.
28549 LOCATION is the location for the declarator specifier to
28550 consider. */
28552 static void
28555 {
28564 {
28568 }
28569 else
28570 {
28572 {
28576 else
28577 {
28580 OPT_Wlong_long,
28582 }
28583 }
28585 {
28589 {
28593 }
28594 else
28595 {
28598 }
28599 }
28600 else
28601 {
28617 "__complex"
28618 };
28622 }
28623 }
28624 }
28626 /* Return true iff the declarator specifier DS is present in the
28627 sequence of declarator specifiers DECL_SPECS. */
28629 bool
28631 cp_decl_spec ds)
28632 {
28639 }
28641 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28642 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28644 static bool
28646 {
28648 }
28650 /* Issue an error message indicating that TOKEN_DESC was expected.
28651 If KEYWORD is true, it indicated this function is called by
28652 cp_parser_require_keword and the required token can only be
28653 a indicated keyword.
28655 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28656 within any error as the location of an "opening" token matching
28657 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28658 RT_CLOSE_PAREN). */
28660 static void
28662 required_token token_desc,
28664 location_t matching_location)
28665 {
28671 {
28740 }
28743 {
28745 {
28823 }
28824 }
28828 }
28831 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28832 issue an error message indicating that TOKEN_DESC was expected.
28834 Returns the token consumed, if the token had the appropriate type.
28835 Otherwise, returns NULL.
28837 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28838 within any error as the location of an "opening" token matching
28839 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28840 RT_CLOSE_PAREN). */
28845 required_token token_desc,
28846 location_t matching_location)
28847 {
28850 else
28851 {
28852 /* Output the MESSAGE -- unless we're parsing tentatively. */
28855 matching_location);
28857 }
28858 }
28860 /* An error message is produced if the next token is not '>'.
28861 All further tokens are skipped until the desired token is
28862 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28864 static void
28866 {
28867 /* Current level of '< ... >'. */
28869 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28872 /* Are we ready, yet? If not, issue error message. */
28876 /* Skip tokens until the desired token is found. */
28878 {
28879 /* Peek at the next token. */
28881 {
28889 /* C++0x views the `>>' operator as two `>' tokens, but
28890 C++98 does not. */
28893 {
28894 /* We've hit a `>>' where the first `>' closes the
28895 template argument list, and the second `>' is
28896 spurious. Just consume the `>>' and stop; we've
28897 already produced at least one error. */
28900 }
28901 /* Fall through for C++0x, so we handle the second `>' in
28902 the `>>'. */
28907 {
28908 /* We've reached the token we want, consume it and stop. */
28911 }
28930 /* The '>' was probably forgotten, don't look further. */
28935 }
28937 /* Consume this token. */
28939 }
28940 }
28942 /* If the next token is the indicated keyword, consume it. Otherwise,
28943 issue an error message indicating that TOKEN_DESC was expected.
28945 Returns the token consumed, if the token had the appropriate type.
28946 Otherwise, returns NULL. */
28951 required_token token_desc)
28952 {
28956 {
28958 UNKNOWN_LOCATION);
28960 }
28963 }
28965 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28966 function-definition. */
28968 static bool
28970 {
28973 /* A ctor-initializer begins with a `:'. */
28975 /* A function-try-block begins with `try'. */
28977 /* A function-transaction-block begins with `__transaction_atomic'
28978 or `__transaction_relaxed'. */
28981 /* The named return value extension begins with `return'. */
28983 }
28985 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28986 definition. */
28988 static bool
28990 {
28997 }
28999 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
29000 C++0x) ending a template-argument. */
29002 static bool
29004 {
29012 }
29014 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
29015 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
29017 static bool
29020 {
29026 /* Check for the sequence `<::' in the original code. It would be lexed as
29027 `[:', where `[' is a digraph, and there is no whitespace before
29028 `:'. */
29030 {
29035 }
29037 }
29039 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
29040 or none_type otherwise. */
29042 static enum tag_types
29044 {
29046 {
29056 }
29057 }
29059 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
29060 or none_type otherwise or if the token is null. */
29062 static enum tag_types
29064 {
29069 {
29077 }
29078 }
29080 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
29082 static void
29084 {
29088 {
29092 type))
29095 }
29096 }
29098 /* Issue an error message if DECL is redeclared with different
29099 access than its original declaration [class.access.spec/3].
29100 This applies to nested classes, nested class templates and
29101 enumerations [class.mem/1]. */
29103 static void
29105 {
29116 }
29118 /* Look for the `template' keyword, as a syntactic disambiguator.
29119 Return TRUE iff it is present, in which case it will be
29120 consumed. */
29122 static bool
29124 {
29126 {
29127 /* In C++98 the `template' keyword can only be used within templates;
29128 outside templates the parser can always figure out what is a
29129 template and what is not. In C++11, per the resolution of DR 468,
29130 `template' is allowed in cases where it is not strictly necessary. */
29133 {
29136 "in C++98 %<template%> (as a disambiguator) is only "
29138 /* If this part of the token stream is rescanned, the same
29139 error message would be generated. So, we purge the token
29140 from the stream. */
29143 }
29144 else
29145 {
29146 /* Consume the `template' keyword. */
29149 }
29150 }
29152 }
29154 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
29155 set PARSER->SCOPE, and perform other related actions. */
29157 static void
29159 {
29162 /* Get the stored value. */
29164 /* Set the scope from the stored value. */
29168 }
29170 /* Consume tokens up through a non-nested END token. Returns TRUE if we
29171 encounter the end of a block before what we were looking for. */
29173 static bool
29177 {
29179 {
29182 /* Abort a parenthesized expression if we encounter a semicolon. */
29186 /* If we've reached the end of the file, stop. */
29192 /* We've hit the end of an enclosing block, so there's been some
29193 kind of syntax error. */
29196 /* Consume the token. */
29198 /* See if it starts a new group. */
29200 {
29202 /* In theory this should probably check end == '}', but
29203 cp_parser_save_member_function_body needs it to exit
29204 after either '}' or ')' when called with ')'. */
29207 }
29209 {
29213 }
29218 }
29219 }
29221 /* Like above, for caching a default argument or NSDMI. Both of these are
29222 terminated by a non-nested comma, but it can be unclear whether or not a
29223 comma is nested in a template argument list unless we do more parsing.
29224 In order to handle this ambiguity, when we encounter a ',' after a '<'
29225 we try to parse what follows as a parameter-declaration-list (in the
29226 case of a default argument) or a member-declarator (in the case of an
29227 NSDMI). If that succeeds, then we stop caching. */
29229 static tree
29231 {
29236 tree default_argument;
29238 /* Add tokens until we have processed the entire default
29239 argument. We add the range [first_token, token). */
29242 {
29243 /* For list-initialization, this is straightforward. */
29246 }
29248 {
29251 /* Peek at the next token. */
29253 /* What we do depends on what token we have. */
29255 {
29256 /* In valid code, a default argument must be
29257 immediately followed by a `,' `)', or `...'. */
29260 {
29261 /* If we've seen a '<', we might be in a
29262 template-argument-list. Until Core issue 325 is
29263 resolved, we don't know how this situation ought
29264 to be handled, so try to DTRT. We check whether
29265 what comes after the comma is a valid parameter
29266 declaration list. If it is, then the comma ends
29267 the default argument; otherwise the default
29268 argument continues. */
29272 /* Set ITALP so cp_parser_parameter_declaration_list
29273 doesn't decide to commit to this parse. */
29280 {
29281 /* Parse declarators until we reach a non-comma or
29282 somthing that cannot be an initializer.
29283 Just checking whether we're looking at a single
29284 declarator is insufficient. Consider:
29285 int var = tuple<T,U>::x;
29286 The template parameter 'U' looks exactly like a
29287 declarator. */
29288 do
29289 {
29300 }
29302 /* If we met an '=' or ';' then the original comma
29303 was the end of the NSDMI. Otherwise assume
29304 we're still in the NSDMI. */
29307 }
29308 else
29309 {
29316 }
29323 }
29324 /* FALLTHRU */
29327 /* If we run into a non-nested `;', `}', or `]',
29328 then the code is invalid -- but the default
29329 argument is certainly over. */
29334 /* Handle correctly int n = sizeof ... ( p ); */
29337 /* Update DEPTH, if necessary. */
29352 /* This might be the comparison operator, or it might
29353 start a template argument list. */
29360 /* Fall through for C++0x, which treats the `>>'
29361 operator like two `>' tokens in certain
29362 cases. */
29367 {
29368 /* This might be an operator, or it might close a
29369 template argument list. But if a previous '<'
29370 started a template argument list, this will have
29371 closed it, so we can't be in one anymore. */
29375 }
29378 /* If we run out of tokens, issue an error message. */
29386 /* In these cases, we should look for template-ids.
29387 For example, if the default argument is
29388 `X<int, double>()', we need to do name lookup to
29389 figure out whether or not `X' is a template; if
29390 so, the `,' does not end the default argument.
29392 That is not yet done. */
29397 }
29399 /* If we've reached the end, stop. */
29403 /* Add the token to the token block. */
29405 }
29407 /* Create a DEFAULT_ARG to represent the unparsed default
29408 argument. */
29415 }
29417 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29419 location_t
29421 {
29426 }
29428 /* Begin parsing tentatively. We always save tokens while parsing
29429 tentatively so that if the tentative parsing fails we can restore the
29430 tokens. */
29432 static void
29434 {
29435 /* Enter a new parsing context. */
29437 /* Begin saving tokens. */
29439 /* In order to avoid repetitive access control error messages,
29440 access checks are queued up until we are no longer parsing
29441 tentatively. */
29443 }
29445 /* Commit to the currently active tentative parse. */
29447 static void
29449 {
29453 /* Mark all of the levels as committed. */
29456 {
29463 }
29464 }
29466 /* Commit to the topmost currently active tentative parse.
29468 Note that this function shouldn't be called when there are
29469 irreversible side-effects while in a tentative state. For
29470 example, we shouldn't create a permanent entry in the symbol
29471 table, or issue an error message that might not apply if the
29472 tentative parse is aborted. */
29474 static void
29476 {
29481 {
29489 }
29490 }
29492 /* Abort the currently active tentative parse. All consumed tokens
29493 will be rolled back, and no diagnostics will be issued. */
29495 static void
29497 {
29501 /* Now, pretend that we want to see if the construct was
29502 successfully parsed. */
29504 }
29506 /* Stop parsing tentatively. If a parse error has occurred, restore the
29507 token stream. Otherwise, commit to the tokens we have consumed.
29508 Returns true if no error occurred; false otherwise. */
29510 static bool
29512 {
29516 /* Remember whether or not an error occurred, since we are about to
29517 destroy that information. */
29519 /* Remove the topmost context from the stack. */
29522 /* If no parse errors occurred, commit to the tentative parse. */
29524 {
29525 /* Commit to the tokens read tentatively, unless that was
29526 already done. */
29531 }
29532 /* Otherwise, if errors occurred, roll back our state so that things
29533 are just as they were before we began the tentative parse. */
29534 else
29535 {
29538 }
29539 /* Add the context to the front of the free list. */
29544 }
29546 /* Returns true if we are parsing tentatively and are not committed to
29547 this tentative parse. */
29549 static bool
29551 {
29554 }
29556 /* Returns nonzero iff an error has occurred during the most recent
29557 tentative parse. */
29559 static bool
29561 {
29564 }
29566 /* Returns nonzero if GNU extensions are allowed. */
29568 static bool
29570 {
29572 }
29573 \f
29574 /* Objective-C++ Productions */
29577 /* Parse an Objective-C expression, which feeds into a primary-expression
29578 above.
29580 objc-expression:
29581 objc-message-expression
29582 objc-string-literal
29583 objc-encode-expression
29584 objc-protocol-expression
29585 objc-selector-expression
29587 Returns a tree representation of the expression. */
29589 static cp_expr
29591 {
29592 /* Try to figure out what kind of declaration is present. */
29596 {
29606 {
29618 }
29619 /* FALLTHRU */
29625 }
29628 }
29630 /* Parse an Objective-C message expression.
29632 objc-message-expression:
29633 [ objc-message-receiver objc-message-args ]
29635 Returns a representation of an Objective-C message. */
29637 static tree
29639 {
29651 /* Construct a location e.g.
29652 [self func1:5]
29653 ^~~~~~~~~~~~~~
29654 ranging from the '[' to the ']', with the caret at the start. */
29659 }
29661 /* Parse an objc-message-receiver.
29663 objc-message-receiver:
29664 expression
29665 simple-type-specifier
29667 Returns a representation of the type or expression. */
29669 static tree
29671 {
29672 tree rcv;
29674 /* An Objective-C message receiver may be either (1) a type
29675 or (2) an expression. */
29679 /* If that worked out, fine. */
29686 CP_PARSER_FLAGS_NONE);
29693 }
29695 /* Parse the arguments and selectors comprising an Objective-C message.
29697 objc-message-args:
29698 objc-selector
29699 objc-selector-args
29700 objc-selector-args , objc-comma-args
29702 objc-selector-args:
29703 objc-selector [opt] : assignment-expression
29704 objc-selector-args objc-selector [opt] : assignment-expression
29706 objc-comma-args:
29707 assignment-expression
29708 objc-comma-args , assignment-expression
29710 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29711 selector arguments and TREE_VALUE containing a list of comma
29712 arguments. */
29714 static tree
29716 {
29722 {
29728 /* Detect if we have a unary selector. */
29737 sel_args
29742 }
29744 /* Handle non-selector arguments, if any. */
29746 {
29747 tree arg;
29752 addl_args
29757 }
29760 {
29763 }
29766 }
29768 /* Parse an Objective-C encode expression.
29770 objc-encode-expression:
29771 @encode objc-typename
29773 Returns an encoded representation of the type argument. */
29775 static cp_expr
29777 {
29778 tree type;
29783 matching_parens parens;
29790 {
29794 }
29796 /* This happens if we find @encode(T) (where T is a template
29797 typename or something dependent on a template typename) when
29798 parsing a template. In that case, we can't compile it
29799 immediately, but we rather create an AT_ENCODE_EXPR which will
29800 need to be instantiated when the template is used.
29801 */
29803 {
29807 }
29810 /* Build a location of the form:
29811 @encode(int)
29812 ^~~~~~~~~~~~
29813 with caret==start at the @ token, finishing at the close paren. */
29814 location_t combined_loc
29819 }
29821 /* Parse an Objective-C @defs expression. */
29823 static tree
29825 {
29826 tree name;
29829 matching_parens parens;
29835 }
29837 /* Parse an Objective-C protocol expression.
29839 objc-protocol-expression:
29840 @protocol ( identifier )
29842 Returns a representation of the protocol expression. */
29844 static tree
29846 {
29847 tree proto;
29851 matching_parens parens;
29856 /* Build a location of the form:
29857 @protocol(prot)
29858 ^~~~~~~~~~~~~~~
29859 with caret==start at the @ token, finishing at the close paren. */
29860 location_t combined_loc
29866 }
29868 /* Parse an Objective-C selector expression.
29870 objc-selector-expression:
29871 @selector ( objc-method-signature )
29873 objc-method-signature:
29874 objc-selector
29875 objc-selector-seq
29877 objc-selector-seq:
29878 objc-selector :
29879 objc-selector-seq objc-selector :
29881 Returns a representation of the method selector. */
29883 static tree
29885 {
29892 matching_parens parens;
29898 {
29907 {
29908 /* Detect if we have a unary selector. */
29910 {
29913 }
29914 else
29915 {
29917 }
29918 }
29923 {
29924 sel_seq
29927 sel_seq
29930 }
29931 else
29932 sel_seq
29937 }
29939 finish_selector:
29943 /* Build a location of the form:
29944 @selector(func)
29945 ^~~~~~~~~~~~~~~
29946 with caret==start at the @ token, finishing at the close paren. */
29947 location_t combined_loc
29951 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29954 }
29956 /* Parse a list of identifiers.
29958 objc-identifier-list:
29959 identifier
29960 objc-identifier-list , identifier
29962 Returns a TREE_LIST of identifier nodes. */
29964 static tree
29966 {
29967 tree identifier;
29968 tree list;
29979 {
29986 identifier));
29988 }
29991 }
29993 /* Parse an Objective-C alias declaration.
29995 objc-alias-declaration:
29996 @compatibility_alias identifier identifier ;
29998 This function registers the alias mapping with the Objective-C front end.
29999 It returns nothing. */
30001 static void
30003 {
30011 }
30013 /* Parse an Objective-C class forward-declaration.
30015 objc-class-declaration:
30016 @class objc-identifier-list ;
30018 The function registers the forward declarations with the Objective-C
30019 front end. It returns nothing. */
30021 static void
30023 {
30026 {
30027 tree id;
30037 else
30039 }
30041 }
30043 /* Parse a list of Objective-C protocol references.
30045 objc-protocol-refs-opt:
30046 objc-protocol-refs [opt]
30048 objc-protocol-refs:
30049 < objc-identifier-list >
30051 Returns a TREE_LIST of identifiers, if any. */
30053 static tree
30055 {
30059 {
30063 }
30066 }
30068 /* Parse a Objective-C visibility specification. */
30070 static void
30072 {
30076 {
30091 }
30093 /* Eat '@private'/'@protected'/'@public'. */
30095 }
30097 /* Parse an Objective-C method type. Return 'true' if it is a class
30098 (+) method, and 'false' if it is an instance (-) method. */
30102 {
30105 else
30107 }
30109 /* Parse an Objective-C protocol qualifier. */
30111 static tree
30113 {
30126 {
30131 }
30134 }
30136 /* Parse an Objective-C typename. */
30138 static tree
30140 {
30144 {
30147 matching_parens parens;
30151 /* An ObjC type name may consist of just protocol qualifiers, in which
30152 case the type shall default to 'id'. */
30154 {
30157 /* If the type could not be parsed, an error has already
30158 been produced. For error recovery, behave as if it had
30159 not been specified, which will use the default type
30160 'id'. */
30162 {
30164 /* We need to skip to the closing parenthesis as
30165 cp_parser_type_id() does not seem to do it for
30166 us. */
30171 }
30172 }
30176 }
30179 }
30181 /* Check to see if TYPE refers to an Objective-C selector name. */
30183 static bool
30185 {
30191 }
30193 /* Parse an Objective-C selector. */
30195 static tree
30197 {
30201 {
30204 }
30206 /* C++ operator names are allowed to appear in ObjC selectors. */
30208 {
30221 }
30222 }
30224 /* Parse an Objective-C params list. */
30226 static tree
30228 {
30234 {
30244 /* Detect if we have a unary selector. */
30247 {
30250 }
30254 {
30255 /* Something went quite wrong. There should be a colon
30256 here, but there is not. Stop parsing parameters. */
30258 }
30260 /* New ObjC allows attributes on parameters too. */
30265 params
30268 type_name,
30269 identifier,
30270 parm_attr));
30273 }
30276 {
30279 }
30281 /* We allow tail attributes for the method. */
30283 {
30291 }
30294 {
30297 }
30299 }
30301 /* Parse the non-keyword Objective-C params. */
30303 static tree
30306 {
30312 {
30314 tree parm;
30320 {
30325 }
30327 /* TODO: parse attributes for tail parameters. */
30336 }
30338 /* We allow tail attributes for the method. */
30340 {
30342 {
30347 }
30348 else
30349 /* We have an error, but parse the attributes, so that we can
30350 carry on. */
30356 }
30359 }
30361 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30363 static void
30365 {
30368 /* If the next token is `extern' and the following token is a string
30369 literal, then we have a linkage specification. */
30371 && cp_parser_is_pure_string_literal
30374 /* Handle #pragma, if any. */
30377 /* Allow stray semicolons. */
30380 /* Mark methods as optional or required, when building protocols. */
30382 {
30385 }
30387 {
30390 }
30393 /* Other stray characters must generate errors. */
30395 {
30399 }
30400 /* Finally, try to parse a block-declaration, or a function-definition. */
30401 else
30403 }
30405 /* Parse a method signature. */
30407 static tree
30409 {
30425 }
30427 static bool
30429 {
30430 tree tattr;
30435 /* If the attributes are followed by a method introducer, this is not allowed.
30436 Dump the attributes and flag the situation. */
30441 /* Otherwise, the attributes introduce some interstitial code, possibly so
30442 rewind to allow that check. */
30445 }
30447 /* Parse an Objective-C method prototype list. */
30449 static void
30451 {
30455 {
30457 {
30462 else
30466 {
30470 }
30473 }
30479 OPT_Wattributes,
30481 else
30482 /* Allow for interspersed non-ObjC++ code. */
30486 }
30490 else
30494 }
30496 /* Parse an Objective-C method definition list. */
30498 static void
30500 {
30504 {
30505 tree meth;
30508 {
30514 else
30519 {
30523 }
30525 NULL_TREE);
30527 /* For historical reasons, we accept an optional semicolon. */
30534 {
30541 }
30542 }
30543 /* The following case will be removed once @synthesize is
30544 completely implemented. */
30555 else
30556 /* Allow for interspersed non-ObjC++ code. */
30560 }
30564 else
30568 }
30570 /* Parse Objective-C ivars. */
30572 static void
30574 {
30585 {
30586 cp_decl_specifier_seq declspecs;
30588 tree prefix_attributes;
30596 CP_PARSER_FLAGS_OPTIONAL,
30600 /* auto, register, static, extern, mutable. */
30602 {
30605 }
30607 /* thread_local. */
30609 {
30612 }
30614 /* typedef. */
30616 {
30619 }
30624 /* Keep going until we hit the `;' at the end of the
30625 declaration. */
30627 {
30632 /* Check for a (possibly unnamed) bitfield declaration. */
30640 {
30641 /* Get the name of the bitfield. */
30646 eat_colon:
30648 /* Get the width of the bitfield. */
30649 width
30651 }
30652 else
30653 {
30654 /* Parse the declarator. */
30655 declarator
30661 }
30663 /* Look for attributes that apply to the ivar. */
30665 /* Remember which attributes are prefix attributes and
30666 which are not. */
30668 /* Combine the attributes. */
30672 /* Create the bitfield declaration. */
30675 else
30680 /* Add the instance variable. */
30684 /* Reset PREFIX_ATTRIBUTES. */
30686 {
30691 }
30696 {
30699 }
30701 }
30705 }
30710 /* Do not consume the RID_AT_END, so it will be read again as terminating
30711 the @interface of @implementation. */
30715 /* For historical reasons, we accept an optional semicolon. */
30718 }
30720 /* Parse an Objective-C protocol declaration. */
30722 static void
30724 {
30730 {
30735 }
30737 /* See if we have a forward declaration or a definition. */
30740 /* Try a forward declaration first. */
30742 {
30744 {
30745 tree id;
30755 else
30757 }
30759 }
30761 /* Ok, we got a full-fledged definition (or at least should). */
30762 else
30763 {
30768 }
30769 }
30771 /* Parse an Objective-C superclass or category. */
30773 static void
30778 {
30784 {
30787 }
30789 {
30790 matching_parens parens;
30793 /* If there is no category name, and this is an @interface, we
30794 have a class extension. */
30796 {
30799 }
30800 else
30804 }
30805 }
30807 /* Parse an Objective-C class interface. */
30809 static void
30811 {
30818 {
30819 /* It's hard to recover because even if valid @interface stuff
30820 is to follow, we can't compile it (or validate it) if we
30821 don't even know which class it refers to. Let's assume this
30822 was a stray '@interface' token in the stream and skip it.
30823 */
30825 }
30830 /* We have either a class or a category on our hands. */
30833 else
30834 {
30836 /* Handle instance variable declarations, if any. */
30839 }
30842 }
30844 /* Parse an Objective-C class implementation. */
30846 static void
30848 {
30855 {
30856 /* It's hard to recover because even if valid @implementation
30857 stuff is to follow, we can't compile it (or validate it) if
30858 we don't even know which class it refers to. Let's assume
30859 this was a stray '@implementation' token in the stream and
30860 skip it.
30861 */
30863 }
30867 /* We have either a class or a category on our hands. */
30870 else
30871 {
30873 /* Handle instance variable declarations, if any. */
30876 }
30879 }
30881 /* Consume the @end token and finish off the implementation. */
30883 static void
30885 {
30888 }
30890 /* Parse an Objective-C declaration. */
30892 static void
30894 {
30895 /* Try to figure out what kind of declaration is present. */
30900 {
30916 }
30919 {
30942 }
30943 }
30945 /* Parse an Objective-C try-catch-finally statement.
30947 objc-try-catch-finally-stmt:
30948 @try compound-statement objc-catch-clause-seq [opt]
30949 objc-finally-clause [opt]
30951 objc-catch-clause-seq:
30952 objc-catch-clause objc-catch-clause-seq [opt]
30954 objc-catch-clause:
30955 @catch ( objc-exception-declaration ) compound-statement
30957 objc-finally-clause:
30958 @finally compound-statement
30960 objc-exception-declaration:
30961 parameter-declaration
30962 '...'
30964 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30966 Returns NULL_TREE.
30968 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30969 for C. Keep them in sync. */
30971 static tree
30973 {
30974 location_t location;
30975 tree stmt;
30980 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30981 node, lest it get absorbed into the surrounding block. */
30987 {
30991 matching_parens parens;
30997 {
30998 /* We have "@catch (...)" (where the '...' are literally
30999 what is in the code). Skip the '...'.
31000 parameter_declaration is set to NULL_TREE, and
31001 objc_being_catch_clauses() knows that that means
31002 '...'. */
31005 }
31006 else
31007 {
31008 /* We have "@catch (NSException *exception)" or something
31009 like that. Parse the parameter declaration. */
31013 else
31018 }
31021 else
31022 {
31023 /* If there was no open parenthesis, we are recovering from
31024 an error, and we are trying to figure out what mistake
31025 the user has made. */
31027 /* If there is an immediate closing parenthesis, the user
31028 probably forgot the opening one (ie, they typed "@catch
31029 NSException *e)". Parse the closing parenthesis and keep
31030 going. */
31034 /* If these is no immediate closing parenthesis, the user
31035 probably doesn't know that parenthesis are required at
31036 all (ie, they typed "@catch NSException *e"). So, just
31037 forget about the closing parenthesis and keep going. */
31038 }
31042 }
31044 {
31047 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
31048 node, lest it get absorbed into the surrounding block. */
31052 }
31055 }
31057 /* Parse an Objective-C synchronized statement.
31059 objc-synchronized-stmt:
31060 @synchronized ( expression ) compound-statement
31062 Returns NULL_TREE. */
31064 static tree
31066 {
31067 location_t location;
31074 matching_parens parens;
31079 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
31080 node, lest it get absorbed into the surrounding block. */
31085 }
31087 /* Parse an Objective-C throw statement.
31089 objc-throw-stmt:
31090 @throw assignment-expression [opt] ;
31092 Returns a constructed '@throw' statement. */
31094 static tree
31096 {
31108 }
31110 /* Parse an Objective-C statement. */
31112 static tree
31114 {
31115 /* Try to figure out what kind of declaration is present. */
31119 {
31130 }
31133 }
31135 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
31136 look ahead to see if an objc keyword follows the attributes. This
31137 is to detect the use of prefix attributes on ObjC @interface and
31138 @protocol. */
31140 static bool
31142 {
31147 {
31150 }
31153 }
31155 /* This routine is a minimal replacement for
31156 c_parser_struct_declaration () used when parsing the list of
31157 types/names or ObjC++ properties. For example, when parsing the
31158 code
31160 @property (readonly) int a, b, c;
31162 this function is responsible for parsing "int a, int b, int c" and
31163 returning the declarations as CHAIN of DECLs.
31165 TODO: Share this code with cp_parser_objc_class_ivars. It's very
31166 similar parsing. */
31167 static tree
31169 {
31171 cp_decl_specifier_seq declspecs;
31173 tree prefix_attributes;
31176 CP_PARSER_FLAGS_NONE,
31183 /* auto, register, static, extern, mutable. */
31185 {
31188 }
31190 /* thread_local. */
31192 {
31195 }
31197 /* typedef. */
31199 {
31202 }
31207 /* Keep going until we hit the `;' at the end of the declaration. */
31209 {
31214 /* Parse the declarator. */
31218 /* Look for attributes that apply to the ivar. */
31220 /* Remember which attributes are prefix attributes and
31221 which are not. */
31223 /* Combine the attributes. */
31233 /* Reset PREFIX_ATTRIBUTES. */
31235 {
31240 }
31247 {
31250 }
31251 else
31253 }
31255 }
31257 /* Parse an Objective-C @property declaration. The syntax is:
31259 objc-property-declaration:
31260 '@property' objc-property-attributes[opt] struct-declaration ;
31262 objc-property-attributes:
31263 '(' objc-property-attribute-list ')'
31265 objc-property-attribute-list:
31266 objc-property-attribute
31267 objc-property-attribute-list, objc-property-attribute
31269 objc-property-attribute
31270 'getter' = identifier
31271 'setter' = identifier
31272 'readonly'
31273 'readwrite'
31274 'assign'
31275 'retain'
31276 'copy'
31277 'nonatomic'
31279 For example:
31280 @property NSString *name;
31281 @property (readonly) id object;
31282 @property (retain, nonatomic, getter=getTheName) id name;
31283 @property int a, b, c;
31285 PS: This function is identical to
31286 c_parser_objc_at_property_declaration for C. Keep them in sync. */
31287 static void
31289 {
31290 /* The following variables hold the attributes of the properties as
31291 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
31292 seen. When we see an attribute, we set them to 'true' (if they
31293 are boolean properties) or to the identifier (if they have an
31294 argument, ie, for getter and setter). Note that here we only
31295 parse the list of attributes, check the syntax and accumulate the
31296 attributes that we find. objc_add_property_declaration() will
31297 then process the information. */
31307 /* 'properties' is the list of properties that we read. Usually a
31308 single one, but maybe more (eg, in "@property int a, b, c;" there
31309 are three). */
31310 tree properties;
31311 location_t loc;
31317 /* Parse the optional attribute list... */
31319 {
31320 /* Eat the '('. */
31321 matching_parens parens;
31325 {
31331 {
31334 }
31338 {
31349 {
31353 else
31358 }
31361 {
31365 }
31367 {
31369 {
31372 }
31373 else
31377 else
31379 }
31380 else
31381 {
31383 {
31386 }
31387 else
31389 }
31395 }
31402 else
31404 }
31406 /* FIXME: "@property (setter, assign);" will generate a spurious
31407 "error: expected ‘)’ before ‘,’ token". This is because
31408 cp_parser_require, unlike the C counterpart, will produce an
31409 error even if we are in error recovery. */
31411 {
31416 }
31417 }
31419 /* ... and the property declaration(s). */
31423 {
31425 /* If the next token is now a `;', consume it. */
31429 }
31433 else
31434 {
31435 /* Comma-separated properties are chained together in
31436 reverse order; add them one by one. */
31445 }
31448 }
31450 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31452 objc-synthesize-declaration:
31453 @synthesize objc-synthesize-identifier-list ;
31455 objc-synthesize-identifier-list:
31456 objc-synthesize-identifier
31457 objc-synthesize-identifier-list, objc-synthesize-identifier
31459 objc-synthesize-identifier
31460 identifier
31461 identifier = identifier
31463 For example:
31464 @synthesize MyProperty;
31465 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31467 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31468 for C. Keep them in sync.
31469 */
31470 static void
31472 {
31474 location_t loc;
31479 {
31483 {
31486 }
31488 {
31492 {
31495 }
31496 }
31497 else
31502 else
31504 }
31507 }
31509 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31511 objc-dynamic-declaration:
31512 @dynamic identifier-list ;
31514 For example:
31515 @dynamic MyProperty;
31516 @dynamic MyProperty, AnotherProperty;
31518 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31519 for C. Keep them in sync.
31520 */
31521 static void
31523 {
31525 location_t loc;
31530 {
31531 tree property;
31534 {
31537 }
31541 else
31543 }
31546 }
31548 \f
31549 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 / 4.5 / 5.0 parsing routines. */
31551 /* Returns name of the next clause.
31552 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31553 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31554 returned and the token is consumed. */
31556 static pragma_omp_clause
31558 {
31574 {
31579 {
31766 }
31767 }
31773 }
31775 /* Validate that a clause of the given type does not already exist. */
31777 static void
31780 {
31781 tree c;
31785 {
31788 }
31789 }
31791 /* OpenMP 2.5:
31792 variable-list:
31793 identifier
31794 variable-list , identifier
31796 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31797 colon). An opening parenthesis will have been consumed by the caller.
31799 If KIND is nonzero, create the appropriate node and install the decl
31800 in OMP_CLAUSE_DECL and add the node to the head of the list.
31802 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31803 return the list created.
31805 COLON can be NULL if only closing parenthesis should end the list,
31806 or pointer to bool which will receive false if the list is terminated
31807 by closing parenthesis or true if the list is terminated by colon. */
31809 static tree
31812 {
31816 {
31819 }
31821 {
31828 && current_class_ptr
31830 {
31836 }
31837 else
31838 {
31845 {
31850 }
31854 else
31857 {
31863 }
31864 }
31866 ;
31868 {
31870 {
31872 /* The OpenACC cache directive explicitly only allows "array
31873 elements or subarrays". */
31875 {
31879 }
31880 /* FALLTHROUGH. */
31885 {
31886 location_t loc
31891 decl
31895 }
31896 /* FALLTHROUGH. */
31902 {
31910 parser->colon_corrects_to_scope_p
31914 else
31915 {
31916 /* Look for `:'. */
31918 {
31923 }
31927 CPP_CLOSE_SQUARE))
31929 }
31930 /* Look for the closing `]'. */
31932 RT_CLOSE_SQUARE))
31933 {
31938 }
31941 }
31945 }
31948 {
31952 {
31953 depend_lvalue:
31957 }
31958 else
31960 }
31966 }
31967 else
31970 get_comma:
31974 }
31980 {
31984 }
31987 {
31990 /* Try to resync to an unnested comma. Copied from
31991 cp_parser_parenthesized_expression_list. */
31992 skip_comma:
32001 }
32004 }
32006 /* Similarly, but expect leading and trailing parenthesis. This is a very
32007 common case for omp clauses. */
32009 static tree
32011 {
32015 }
32017 /* OpenACC 2.0:
32018 copy ( variable-list )
32019 copyin ( variable-list )
32020 copyout ( variable-list )
32021 create ( variable-list )
32022 delete ( variable-list )
32023 present ( variable-list ) */
32025 static tree
32027 tree list)
32028 {
32031 {
32064 }
32072 }
32074 /* OpenACC 2.0:
32075 deviceptr ( variable-list ) */
32077 static tree
32079 {
32083 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
32084 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
32085 variable-list must only allow for pointer variables. */
32088 {
32095 }
32098 }
32100 /* OpenACC 2.5:
32101 auto
32102 finalize
32103 independent
32104 nohost
32105 seq */
32107 static tree
32111 {
32116 }
32118 /* OpenACC:
32119 num_gangs ( expression )
32120 num_workers ( expression )
32121 vector_length ( expression ) */
32123 static tree
32126 {
32129 matching_parens parens;
32137 {
32142 }
32150 }
32152 /* OpenACC:
32154 gang [( gang-arg-list )]
32155 worker [( [num:] int-expr )]
32156 vector [( [length:] int-expr )]
32158 where gang-arg is one of:
32160 [num:] int-expr
32161 static: size-expr
32163 and size-expr may be:
32165 *
32166 int-expr
32167 */
32169 static tree
32172 {
32182 {
32183 matching_parens parens;
32186 do
32187 {
32191 /* Gang static argument. */
32194 {
32202 {
32205 }
32207 /* Check for the '*' argument. */
32211 CPP_CLOSE_PAREN)))
32212 {
32217 {
32220 }
32222 }
32223 }
32224 /* Worker num: argument and vector length: arguments. */
32228 {
32231 }
32233 /* Now collect the actual argument. */
32235 {
32238 }
32250 {
32253 }
32255 }
32260 }
32274 cleanup_error:
32277 }
32279 /* OpenACC 2.0:
32280 tile ( size-expr-list ) */
32282 static tree
32284 {
32288 /* Collapse and tile are mutually exclusive. (The spec doesn't say
32289 so, but the spec authors never considered such a case and have
32290 differing opinions on what it might mean, including 'not
32291 allowed'.) */
32294 clause_loc);
32299 do
32300 {
32307 {
32310 }
32311 else
32315 }
32318 /* Consume the trailing ')'. */
32326 }
32328 /* OpenACC 2.0
32329 Parse wait clause or directive parameters. */
32331 static tree
32333 {
32343 {
32348 }
32355 {
32359 {
32362 else
32363 {
32370 }
32371 }
32372 }
32375 }
32377 /* OpenACC:
32378 wait ( int-expr-list ) */
32380 static tree
32382 {
32391 }
32393 /* OpenMP 3.0:
32394 collapse ( constant-expression ) */
32396 static tree
32398 {
32400 location_t loc;
32401 HOST_WIDE_INT n;
32404 matching_parens parens;
32422 {
32425 }
32434 }
32436 /* OpenMP 2.5:
32437 default ( none | shared )
32439 OpenACC:
32440 default ( none | present ) */
32442 static tree
32445 {
32447 tree c;
32449 matching_parens parens;
32453 {
32458 {
32479 }
32482 }
32483 else
32484 {
32485 invalid_kind:
32488 else
32490 }
32507 }
32509 /* OpenMP 3.1:
32510 final ( expression ) */
32512 static tree
32514 {
32517 matching_parens parens;
32536 }
32538 /* OpenMP 2.5:
32539 if ( expression )
32541 OpenMP 4.5:
32542 if ( directive-name-modifier : expression )
32544 directive-name-modifier:
32545 parallel | task | taskloop | target data | target | target update
32546 | target enter data | target exit data
32548 OpenMP 5.0:
32549 directive-name-modifier:
32550 ... | simd | cancel */
32552 static tree
32555 {
32559 matching_parens parens;
32564 {
32580 {
32583 {
32596 else
32597 {
32598 location_t loc
32603 }
32606 {
32608 {
32613 }
32615 {
32616 location_t loc
32620 }
32621 }
32622 }
32623 }
32625 {
32627 {
32630 }
32631 else
32632 {
32634 {
32635 location_t loc
32638 }
32640 }
32641 }
32642 }
32654 {
32657 {
32660 {
32672 }
32674 p);
32676 }
32678 {
32681 else
32684 }
32687 {
32691 }
32692 }
32700 }
32702 /* OpenMP 3.1:
32703 mergeable */
32705 static tree
32708 {
32709 tree c;
32712 location);
32717 }
32719 /* OpenMP 2.5:
32720 nowait */
32722 static tree
32725 {
32726 tree c;
32733 }
32735 /* OpenMP 2.5:
32736 num_threads ( expression ) */
32738 static tree
32740 location_t location)
32741 {
32744 matching_parens parens;
32764 }
32766 /* OpenMP 4.5:
32767 num_tasks ( expression ) */
32769 static tree
32771 location_t location)
32772 {
32775 matching_parens parens;
32795 }
32797 /* OpenMP 4.5:
32798 grainsize ( expression ) */
32800 static tree
32802 location_t location)
32803 {
32806 matching_parens parens;
32826 }
32828 /* OpenMP 4.5:
32829 priority ( expression ) */
32831 static tree
32833 location_t location)
32834 {
32837 matching_parens parens;
32857 }
32859 /* OpenMP 4.5:
32860 hint ( expression ) */
32862 static tree
32864 {
32867 matching_parens parens;
32886 }
32888 /* OpenMP 4.5:
32889 defaultmap ( tofrom : scalar )
32891 OpenMP 5.0:
32892 defaultmap ( implicit-behavior [ : variable-category ] ) */
32894 static tree
32896 location_t location)
32897 {
32901 enum omp_clause_defaultmap_kind category
32904 matching_parens parens;
32911 {
32912 invalid_behavior:
32914 "%<tofrom%>, %<firstprivate%>, %<none%> "
32917 }
32918 else
32919 {
32922 }
32925 {
32929 else
32936 else
32945 else
32952 else
32961 else
32967 }
32971 {
32976 {
32977 invalid_category:
32981 }
32986 {
32990 else
32997 else
33004 else
33010 }
33013 }
33023 {
33030 {
33045 }
33048 p);
33049 else
33053 }
33060 out_err:
33065 }
33067 /* OpenMP 2.5:
33068 ordered
33070 OpenMP 4.5:
33071 ordered ( constant-expression ) */
33073 static tree
33076 {
33078 HOST_WIDE_INT n;
33084 {
33085 matching_parens parens;
33102 {
33104 "ordered argument needs positive constant integer "
33107 }
33108 }
33114 }
33116 /* OpenMP 2.5:
33117 reduction ( reduction-operator : variable-list )
33119 reduction-operator:
33120 One of: + * - & ^ | && ||
33122 OpenMP 3.1:
33124 reduction-operator:
33125 One of: + * - & ^ | && || min max
33127 OpenMP 4.0:
33129 reduction-operator:
33130 One of: + * - & ^ | && ||
33131 id-expression
33133 OpenMP 5.0:
33134 reduction ( reduction-modifier, reduction-operator : variable-list )
33135 in_reduction ( reduction-operator : variable-list )
33136 task_reduction ( reduction-operator : variable-list ) */
33138 static tree
33141 {
33151 {
33154 {
33157 }
33160 {
33166 {
33170 }
33172 {
33175 }
33176 }
33177 }
33180 {
33190 }
33194 else
33195 {
33206 {
33236 }
33237 else
33238 {
33240 resync_fail:
33245 }
33246 }
33252 NULL);
33254 {
33261 }
33264 }
33266 /* OpenMP 2.5:
33267 schedule ( schedule-kind )
33268 schedule ( schedule-kind , expression )
33270 schedule-kind:
33271 static | dynamic | guided | runtime | auto
33273 OpenMP 4.5:
33274 schedule ( schedule-modifier : schedule-kind )
33275 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
33277 schedule-modifier:
33278 simd
33279 monotonic
33280 nonmonotonic */
33282 static tree
33284 {
33288 matching_parens parens;
33295 {
33304 else
33310 else
33311 {
33314 }
33315 }
33318 {
33323 {
33344 }
33345 }
33350 else
33356 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
33358 {
33362 }
33365 {
33380 else
33385 }
33397 invalid_kind:
33399 resync_fail:
33404 }
33406 /* OpenMP 3.0:
33407 untied */
33409 static tree
33412 {
33413 tree c;
33420 }
33422 /* OpenMP 4.0:
33423 inbranch
33424 notinbranch */
33426 static tree
33429 {
33434 }
33436 /* OpenMP 4.0:
33437 parallel
33438 for
33439 sections
33440 taskgroup */
33442 static tree
33446 {
33450 }
33452 /* OpenMP 4.5:
33453 nogroup */
33455 static tree
33458 {
33463 }
33465 /* OpenMP 4.5:
33466 simd
33467 threads */
33469 static tree
33473 {
33478 }
33480 /* OpenMP 4.0:
33481 num_teams ( expression ) */
33483 static tree
33485 location_t location)
33486 {
33489 matching_parens parens;
33509 }
33511 /* OpenMP 4.0:
33512 thread_limit ( expression ) */
33514 static tree
33516 location_t location)
33517 {
33520 matching_parens parens;
33540 }
33542 /* OpenMP 4.0:
33543 aligned ( variable-list )
33544 aligned ( variable-list : constant-expression ) */
33546 static tree
33548 {
33552 matching_parens parens;
33560 {
33570 }
33576 }
33578 /* OpenMP 2.5:
33579 lastprivate ( variable-list )
33581 OpenMP 5.0:
33582 lastprivate ( [ lastprivate-modifier : ] variable-list ) */
33584 static tree
33586 {
33594 {
33599 {
33603 }
33604 }
33613 }
33615 /* OpenMP 4.0:
33616 linear ( variable-list )
33617 linear ( variable-list : expression )
33619 OpenMP 4.5:
33620 linear ( modifier ( variable-list ) )
33621 linear ( modifier ( variable-list ) : expression ) */
33623 static tree
33626 {
33631 matching_parens parens;
33636 {
33648 else
33650 }
33655 else
33656 {
33665 }
33668 {
33673 {
33684 {
33687 }
33690 }
33701 }
33704 {
33707 }
33710 }
33712 /* OpenMP 4.0:
33713 safelen ( constant-expression ) */
33715 static tree
33717 location_t location)
33718 {
33721 matching_parens parens;
33740 }
33742 /* OpenMP 4.0:
33743 simdlen ( constant-expression ) */
33745 static tree
33747 location_t location)
33748 {
33751 matching_parens parens;
33770 }
33772 /* OpenMP 4.5:
33773 vec:
33774 identifier [+/- integer]
33775 vec , identifier [+/- integer]
33776 */
33778 static tree
33780 tree list)
33781 {
33785 {
33788 }
33791 {
33798 else
33799 {
33800 t = cp_parser_lookup_name_simple
33805 id_loc);
33806 }
33812 {
33815 }
33819 {
33822 }
33826 {
33829 }
33832 add_to_vector:
33834 {
33838 }
33844 }
33847 {
33853 }
33855 }
33857 /* OpenMP 5.0:
33858 iterators ( iterators-definition )
33860 iterators-definition:
33861 iterator-specifier
33862 iterator-specifier , iterators-definition
33864 iterator-specifier:
33865 identifier = range-specification
33866 iterator-type identifier = range-specification
33868 range-specification:
33869 begin : end
33870 begin : end : step */
33872 static tree
33874 {
33878 matching_parens parens;
33882 bool saved_colon_corrects_to_scope_p
33884 bool saved_colon_doesnt_start_class_def_p
33887 do
33888 {
33889 tree iter_type;
33893 else
33894 {
33897 parser->type_definition_forbidden_message
33903 }
33907 {
33910 }
33930 {
33933 }
33948 {
33951 }
33953 }
33957 parser->colon_doesnt_start_class_def_p
33967 }
33969 /* OpenMP 4.0:
33970 depend ( depend-kind : variable-list )
33972 depend-kind:
33973 in | out | inout
33975 OpenMP 4.5:
33976 depend ( source )
33978 depend ( sink : vec )
33980 OpenMP 5.0:
33981 depend ( depend-modifier , depend-kind: variable-list )
33983 depend-kind:
33984 in | out | inout | mutexinoutset | depobj
33986 depend-modifier:
33987 iterator ( iterators-definition ) */
33989 static tree
33991 {
33995 matching_parens parens;
33999 do
34000 {
34008 {
34013 }
34028 else
34031 }
34038 {
34043 }
34046 {
34056 }
34063 else
34064 {
34069 {
34073 else
34075 }
34078 {
34083 }
34084 }
34087 invalid_kind:
34089 resync_fail:
34096 }
34098 /* OpenMP 4.0:
34099 map ( map-kind : variable-list )
34100 map ( variable-list )
34102 map-kind:
34103 alloc | to | from | tofrom
34105 OpenMP 4.5:
34106 map-kind:
34107 alloc | to | from | tofrom | release | delete
34109 map ( always [,] map-kind: variable-list ) */
34111 static tree
34113 {
34122 {
34127 {
34130 nth++;
34136 {
34141 }
34142 }
34143 }
34147 {
34161 else
34162 {
34168 }
34171 }
34174 {
34178 }
34181 NULL);
34187 }
34189 /* OpenMP 4.0:
34190 device ( expression ) */
34192 static tree
34194 location_t location)
34195 {
34198 matching_parens parens;
34218 }
34220 /* OpenMP 4.0:
34221 dist_schedule ( static )
34222 dist_schedule ( static , expression ) */
34224 static tree
34226 location_t location)
34227 {
34230 matching_parens parens;
34241 {
34252 }
34257 location);
34261 invalid_kind:
34263 resync_fail:
34268 }
34270 /* OpenMP 4.0:
34271 proc_bind ( proc-bind-kind )
34273 proc-bind-kind:
34274 master | close | spread */
34276 static tree
34278 location_t location)
34279 {
34280 tree c;
34287 {
34297 else
34299 }
34300 else
34309 location);
34314 invalid_kind:
34316 resync_fail:
34321 }
34323 /* OpenACC:
34324 async [( int-expr )] */
34326 static tree
34328 {
34335 {
34336 matching_parens parens;
34345 }
34355 }
34357 /* Parse all OpenACC clauses. The set clauses allowed by the directive
34358 is a bitmask in MASK. Return the list of clauses found. */
34360 static tree
34364 {
34369 {
34370 location_t here;
34371 pragma_omp_clause c_kind;
34372 omp_clause_code code;
34383 {
34440 clauses);
34458 OMP_CLAUSE_IF_PRESENT,
34464 OMP_CLAUSE_INDEPENDENT,
34476 clauses);
34482 clauses);
34490 clauses);
34494 clauses
34510 clauses);
34522 clauses);
34536 }
34541 {
34542 /* Remove the invalid clause(s) from the list to avoid
34543 confusing the rest of the compiler. */
34546 }
34547 }
34549 saw_error:
34556 }
34558 /* Parse all OpenMP clauses. The set clauses allowed by the directive
34559 is a bitmask in MASK. Return the list of clauses found; the result
34560 of clause default goes in *pdefault. */
34562 static tree
34566 {
34572 {
34573 pragma_omp_clause c_kind;
34584 {
34596 clauses);
34610 clauses);
34630 clauses);
34635 clauses);
34644 clauses
34684 clauses);
34688 clauses
34700 clauses);
34704 clauses
34706 OMP_CLAUSE_TASK_REDUCTION,
34722 clauses);
34727 OMP_CLAUSE_NOTINBRANCH,
34736 {
34737 clause_not_first:
34741 }
34771 clauses);
34772 else
34782 clauses);
34800 {
34805 }
34848 clauses
34854 clauses
34862 }
34867 {
34868 /* Remove the invalid clause(s) from the list to avoid
34869 confusing the rest of the compiler. */
34872 }
34873 }
34874 saw_error:
34877 {
34880 else
34882 }
34884 }
34886 /* OpenMP 2.5:
34887 structured-block:
34888 statement
34890 In practice, we're also interested in adding the statement to an
34891 outer node. So it is convenient if we work around the fact that
34892 cp_parser_statement calls add_stmt. */
34894 static unsigned
34896 {
34899 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34900 This preserves the "not within loop or switch" style error messages
34901 for nonsense cases like
34902 void foo() {
34903 #pragma omp single
34904 break;
34905 }
34906 */
34911 }
34913 static void
34915 {
34917 }
34919 static tree
34921 {
34929 }
34931 /* OpenMP 2.5:
34932 # pragma omp atomic new-line
34933 expression-stmt
34935 expression-stmt:
34936 x binop= expr | x++ | ++x | x-- | --x
34937 binop:
34938 +, *, -, /, &, ^, |, <<, >>
34940 where x is an lvalue expression with scalar type.
34942 OpenMP 3.1:
34943 # pragma omp atomic new-line
34944 update-stmt
34946 # pragma omp atomic read new-line
34947 read-stmt
34949 # pragma omp atomic write new-line
34950 write-stmt
34952 # pragma omp atomic update new-line
34953 update-stmt
34955 # pragma omp atomic capture new-line
34956 capture-stmt
34958 # pragma omp atomic capture new-line
34959 capture-block
34961 read-stmt:
34962 v = x
34963 write-stmt:
34964 x = expr
34965 update-stmt:
34966 expression-stmt | x = x binop expr
34967 capture-stmt:
34968 v = expression-stmt
34969 capture-block:
34970 { v = x; update-stmt; } | { update-stmt; v = x; }
34972 OpenMP 4.0:
34973 update-stmt:
34974 expression-stmt | x = x binop expr | x = expr binop x
34975 capture-stmt:
34976 v = update-stmt
34977 capture-block:
34978 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34980 where x and v are lvalue expressions with scalar type. */
34982 static void
34984 {
34995 {
35002 {
35007 enum omp_memory_order new_memory_order
35029 {
35033 }
35034 else
35035 {
35038 "%<capture%>, %<seq_cst%>, %<acq_rel%>, "
35040 }
35042 {
35044 {
35047 else
35049 }
35051 {
35054 else
35056 }
35059 }
35060 }
35062 }
35068 {
35069 omp_requires_mask
35074 {
35084 {
35095 }
35099 }
35100 }
35101 else
35103 {
35107 {
35111 }
35116 {
35120 }
35125 {
35129 }
35133 }
35136 {
35146 else
35151 {
35152 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
35153 opcode. */
35158 }
35162 {
35165 }
35166 else
35167 {
35173 }
35176 }
35178 restart:
35182 {
35189 /* FALLTHROUGH */
35199 /* FALLTHROUGH */
35214 /* Undo effects of boolean_increment for post {in,de}crement. */
35216 /* FALLTHRU */
35220 {
35221 /* Undo effects of boolean_increment. */
35223 {
35224 /* This is pre or post increment. */
35229 && !structured_block
35233 }
35234 }
35235 /* FALLTHRU */
35238 {
35273 {
35277 }
35280 {
35286 {
35291 }
35293 {
35305 {
35307 {
35312 }
35313 else
35315 }
35319 }
35322 {
35329 }
35333 }
35337 {
35340 {
35348 }
35350 {
35355 }
35390 }
35401 /* FALLTHROUGH */
35406 }
35413 }
35414 stmt_done:
35416 {
35427 }
35429 {
35432 }
35433 done:
35441 saw_error:
35444 {
35448 {
35452 }
35453 }
35454 }
35457 /* OpenMP 2.5:
35458 # pragma omp barrier new-line */
35460 static void
35462 {
35465 }
35467 /* OpenMP 2.5:
35468 # pragma omp critical [(name)] new-line
35469 structured-block
35471 OpenMP 4.5:
35472 # pragma omp critical [(name) [hint(expression)]] new-line
35473 structured-block */
35475 #define OMP_CRITICAL_CLAUSE_MASK \
35476 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
35478 static tree
35480 {
35484 {
35485 matching_parens parens;
35503 OMP_CRITICAL_CLAUSE_MASK,
35505 }
35506 else
35511 }
35513 /* OpenMP 5.0:
35514 # pragma omp depobj ( depobj ) depobj-clause new-line
35516 depobj-clause:
35517 depend (dependence-type : locator)
35518 destroy
35519 update (dependence-type)
35521 dependence-type:
35522 in
35523 out
35524 inout
35525 mutexinout */
35527 static void
35529 {
35531 matching_parens parens;
35533 {
35536 }
35549 {
35555 {
35561 }
35565 {
35566 matching_parens c_parens;
35568 {
35569 location_t c2_loc
35572 {
35585 }
35587 {
35591 }
35597 }
35598 else
35600 }
35601 }
35603 {
35606 }
35610 }
35613 /* OpenMP 2.5:
35614 # pragma omp flush flush-vars[opt] new-line
35616 flush-vars:
35617 ( variable-list )
35619 OpenMP 5.0:
35620 # pragma omp flush memory-order-clause new-line */
35622 static void
35624 {
35627 {
35636 else
35640 }
35642 {
35645 "%<flush%> list specified together with memory order "
35648 }
35652 }
35654 /* Helper function, to parse omp for increment expression. */
35656 static tree
35658 {
35663 {
35666 }
35669 {
35681 }
35683 /* If decl is an iterator, preserve LHS and RHS of the relational
35684 expr until finish_omp_for. */
35695 }
35697 /* Helper function, to parse omp for increment expression. */
35699 static tree
35701 {
35705 cp_id_kind idk;
35709 {
35718 }
35727 {
35732 }
35739 {
35743 }
35756 do
35757 {
35764 {
35766 {
35769 else
35771 tf_warning_or_error);
35772 }
35773 else
35776 }
35777 }
35781 {
35787 }
35788 else
35792 }
35794 /* Parse the initialization statement of an OpenMP for loop.
35796 Return true if the resulting construct should have an
35797 OMP_CLAUSE_PRIVATE added to it. */
35799 static tree
35807 {
35813 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
35815 init-expr:
35816 var = lb
35817 integer-type var = lb
35818 random-access-iterator-type var = lb
35819 pointer-type var = lb
35820 */
35821 cp_decl_specifier_seq type_specifiers;
35823 /* First, try to parse as an initialized declaration. See
35824 cp_parser_condition, from whence the bulk of this is copied. */
35831 {
35832 /* If parsing a type specifier seq succeeded, then this
35833 MUST be a initialized declaration. */
35838 CP_PARSER_DECLARATOR_NAMED,
35849 else
35850 {
35860 {
35862 CPP_OPEN_PAREN))
35865 else
35866 /* Trigger an error. */
35871 }
35875 {
35883 {
35886 auto_node);
35891 }
35894 asm_specification,
35895 LOOKUP_ONLYCONVERTING);
35898 {
35901 }
35902 else
35903 {
35906 {
35908 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
35910 {
35914 {
35918 }
35920 }
35922 {
35927 }
35928 }
35929 }
35931 }
35932 else
35933 {
35934 /* Consume '='. */
35938 non_class:
35941 else
35944 asm_specification,
35945 LOOKUP_ONLYCONVERTING);
35946 }
35950 }
35951 }
35952 else
35953 {
35954 cp_id_kind idk;
35955 /* If parsing a type specifier sequence failed, then
35956 this MUST be a simple expression. */
35962 && decl
35965 {
35976 {
35981 }
35986 }
35988 && decl
35991 {
35992 tree rhs;
36000 rhs,
36001 tf_warning_or_error));
36004 }
36005 else
36006 {
36011 {
36015 }
36016 }
36017 }
36019 }
36021 /* Helper for cp_parser_omp_for_loop, handle one range-for loop. */
36023 void
36027 {
36032 {
36036 /* do_auto_deduction doesn't mess with template init-lists. */
36038 {
36041 {
36047 }
36049 }
36056 }
36061 /* If an error happened previously do nothing or else a lot of
36062 unhelpful errors would be issued. */
36064 else
36065 {
36066 tree range_temp;
36070 /* Can't bind a reference to an array of runtime bound. */
36072 else
36073 {
36079 LOOKUP_ONLYCONVERTING);
36082 }
36085 }
36096 LOOKUP_ONLYCONVERTING);
36098 /* The new for initialization statement. */
36106 else
36107 {
36110 }
36113 LOOKUP_ONLYCONVERTING);
36115 /* The new for condition. */
36118 else
36124 /* The new increment expression. */
36127 else
36130 tf_warning_or_error);
36135 {
36138 }
36143 {
36148 {
36153 }
36154 }
36158 {
36160 tf_none);
36164 }
36171 {
36174 }
36176 }
36178 /* Helper for cp_parser_omp_for_loop, finalize part of range for
36179 inside of the collapsed body. */
36181 void
36183 {
36191 {
36195 }
36197 /* The declaration is initialized with *__begin inside the loop body. */
36200 tf_warning_or_error),
36202 LOOKUP_ONLYCONVERTING);
36205 }
36207 /* Parse the restricted form of the for statement allowed by OpenMP. */
36209 static tree
36212 {
36214 tree orig_decl;
36217 location_t loc_first;
36228 {
36231 }
36234 {
36237 }
36240 {
36246 }
36248 {
36251 {
36253 "%<linear%> clause may not be specified together "
36256 }
36257 else
36259 }
36273 {
36276 location_t loc;
36279 {
36283 }
36286 matching_parens parens;
36294 {
36295 /* Save tokens so that we can put them back. */
36298 /* Look for ':' that is not nested in () or {}. */
36299 bool is_range_for
36302 CPP_COLON,
36303 /*consume_paren=*/
36306 /* Roll back the tokens we skipped. */
36310 {
36311 bool saved_colon_corrects_to_scope_p
36314 /* A colon is used in range-based for. */
36317 /* Parse the declaration. */
36319 /*function_definition_allowed_p=*/
36321 parser->colon_corrects_to_scope_p
36333 {
36335 {
36341 }
36342 else
36344 }
36348 "%<ordered%> clause with parameter on "
36352 }
36353 }
36355 add_private_clause
36361 {
36364 {
36370 }
36371 else
36373 }
36380 {
36385 {
36389 }
36392 {
36393 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
36397 {
36400 }
36401 else
36402 {
36405 }
36407 }
36408 else
36409 {
36414 }
36415 }
36418 {
36419 tree c;
36421 {
36430 decl);
36435 decl);
36436 }
36438 {
36443 else
36448 {
36451 /* For linear, signal that we need to fill up
36452 the so far unknown linear step. */
36455 }
36456 }
36457 }
36466 {
36467 /* If decl is an iterator, preserve the operator on decl
36468 until finish_omp_for. */
36470 && ((processing_template_decl
36475 else
36479 }
36481 parse_close_paren:
36492 {
36495 }
36497 {
36501 }
36508 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
36509 in between the collapsed for loops to be still considered perfectly
36510 nested. Hopefully the final version clarifies this.
36511 For now handle (multiple) {'s and empty statements. */
36514 {
36518 {
36520 bracecount++;
36521 }
36525 else
36526 {
36533 }
36534 }
36537 {
36540 }
36541 }
36546 /* Note that we saved the original contents of this flag when we entered
36547 the structured block, and so we don't need to re-save it here. */
36550 /* Note that the grammar doesn't call for a structured block here,
36551 though the loop as a whole is a structured block. */
36553 {
36559 }
36560 else
36565 else
36570 else
36575 {
36577 {
36579 nbraces--;
36580 }
36583 else
36584 {
36586 {
36589 }
36594 }
36595 }
36598 {
36602 else
36604 }
36608 }
36610 /* Helper function for OpenMP parsing, split clauses and call
36611 finish_omp_clauses on each of the set of clauses afterwards. */
36613 static void
36616 {
36622 }
36624 /* OpenMP 4.0:
36625 #pragma omp simd simd-clause[optseq] new-line
36626 for-loop */
36628 #define OMP_SIMD_CLAUSE_MASK \
36629 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
36630 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36631 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36632 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36633 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36634 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36635 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36636 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
36637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36638 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NONTEMPORAL))
36640 static tree
36644 {
36655 {
36659 OMP_CLAUSE_ORDERED);
36661 {
36663 "%<ordered%> clause with parameter may not be specified "
36666 }
36667 }
36679 }
36681 /* OpenMP 2.5:
36682 #pragma omp for for-clause[optseq] new-line
36683 for-loop
36685 OpenMP 4.0:
36686 #pragma omp for simd for-simd-clause[optseq] new-line
36687 for-loop */
36689 #define OMP_FOR_CLAUSE_MASK \
36690 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36691 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36693 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
36696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
36697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36700 static tree
36704 {
36711 /* parallel for{, simd} disallows nowait clause, but for
36712 target {teams distribute ,}parallel for{, simd} it should be accepted. */
36715 /* Composite distribute parallel for{, simd} disallows ordered clause. */
36720 {
36725 {
36749 }
36750 }
36752 {
36755 }
36757 /* Composite distribute parallel for disallows linear clause. */
36764 {
36767 }
36779 }
36784 /* OpenMP 2.5:
36785 # pragma omp master new-line
36786 structured-block */
36788 static tree
36792 {
36800 {
36805 {
36823 }
36824 }
36826 {
36829 }
36832 {
36836 }
36837 else
36842 }
36844 /* OpenMP 2.5:
36845 # pragma omp ordered new-line
36846 structured-block
36848 OpenMP 4.5:
36849 # pragma omp ordered ordered-clauses new-line
36850 structured-block */
36852 #define OMP_ORDERED_CLAUSE_MASK \
36853 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
36854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
36856 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
36857 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
36859 static bool
36862 {
36866 {
36871 {
36873 {
36876 }
36878 {
36880 "%<depend%> clause may only be used in compound "
36884 }
36885 tree clauses
36887 OMP_ORDERED_DEPEND_CLAUSE_MASK,
36891 }
36892 }
36894 tree clauses
36905 }
36907 /* OpenMP 2.5:
36909 section-scope:
36910 { section-sequence }
36912 section-sequence:
36913 section-directive[opt] structured-block
36914 section-sequence section-directive structured-block */
36916 static tree
36918 {
36923 matching_braces braces;
36931 {
36935 }
36938 {
36946 {
36950 }
36952 {
36955 }
36960 }
36971 }
36973 /* OpenMP 2.5:
36974 # pragma omp sections sections-clause[optseq] newline
36975 sections-scope */
36977 #define OMP_SECTIONS_CLAUSE_MASK \
36978 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36979 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36980 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36981 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36982 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36984 static tree
36987 {
36999 {
37002 }
37009 }
37011 /* OpenMP 2.5:
37012 # pragma omp parallel parallel-clause[optseq] new-line
37013 structured-block
37014 # pragma omp parallel for parallel-for-clause[optseq] new-line
37015 structured-block
37016 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
37017 structured-block
37019 OpenMP 4.0:
37020 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
37021 structured-block */
37023 #define OMP_PARALLEL_CLAUSE_MASK \
37024 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37025 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37026 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
37030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
37031 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
37032 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
37034 static tree
37038 {
37045 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
37051 {
37059 if_p);
37063 if_p);
37066 block);
37071 }
37072 /* When combined with distribute, parallel has to be followed by for.
37073 #pragma omp target parallel is allowed though. */
37077 {
37081 }
37083 {
37087 {
37098 block);
37103 }
37105 {
37108 }
37110 {
37120 block);
37123 }
37124 }
37126 {
37129 }
37134 {
37137 }
37145 }
37147 /* OpenMP 2.5:
37148 # pragma omp single single-clause[optseq] new-line
37149 structured-block */
37151 #define OMP_SINGLE_CLAUSE_MASK \
37152 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37153 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37154 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
37155 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37157 static tree
37159 {
37170 }
37172 /* OpenMP 3.0:
37173 # pragma omp task task-clause[optseq] new-line
37174 structured-block */
37176 #define OMP_TASK_CLAUSE_MASK \
37177 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37178 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37179 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37180 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37181 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37182 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37183 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37184 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37185 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37186 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
37187 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
37189 static tree
37191 {
37202 }
37204 /* OpenMP 3.0:
37205 # pragma omp taskwait new-line
37207 OpenMP 5.0:
37208 # pragma omp taskwait taskwait-clause[opt] new-line */
37210 #define OMP_TASKWAIT_CLAUSE_MASK \
37211 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
37213 static void
37215 {
37216 tree clauses
37221 {
37228 }
37229 else
37231 }
37233 /* OpenMP 3.1:
37234 # pragma omp taskyield new-line */
37236 static void
37238 {
37241 }
37243 /* OpenMP 4.0:
37244 # pragma omp taskgroup new-line
37245 structured-block
37247 OpenMP 5.0:
37248 # pragma omp taskgroup taskgroup-clause[optseq] new-line */
37250 #define OMP_TASKGROUP_CLAUSE_MASK \
37251 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASK_REDUCTION))
37253 static tree
37255 {
37256 tree clauses
37261 if_p),
37262 clauses);
37263 }
37266 /* OpenMP 2.5:
37267 # pragma omp threadprivate (variable-list) */
37269 static void
37271 {
37272 tree vars;
37278 }
37280 /* OpenMP 4.0:
37281 # pragma omp cancel cancel-clause[optseq] new-line */
37283 #define OMP_CANCEL_CLAUSE_MASK \
37284 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
37285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
37286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
37287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
37288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
37290 static void
37292 {
37296 }
37298 /* OpenMP 4.0:
37299 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
37301 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
37302 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
37303 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
37304 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
37305 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
37307 static void
37310 {
37311 tree clauses;
37315 {
37320 {
37323 }
37324 }
37326 {
37330 }
37333 {
37338 else
37342 }
37345 OMP_CANCELLATION_POINT_CLAUSE_MASK,
37347 pragma_tok);
37349 }
37351 /* OpenMP 4.0:
37352 #pragma omp distribute distribute-clause[optseq] new-line
37353 for-loop */
37355 #define OMP_DISTRIBUTE_CLAUSE_MASK \
37356 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37359 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
37360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
37362 static tree
37366 {
37375 {
37383 else
37386 {
37392 {
37396 else
37399 }
37405 else
37419 }
37420 }
37422 {
37425 }
37430 {
37433 }
37445 }
37447 /* OpenMP 4.0:
37448 # pragma omp teams teams-clause[optseq] new-line
37449 structured-block */
37451 #define OMP_TEAMS_CLAUSE_MASK \
37452 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37453 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37454 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37455 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
37456 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
37457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
37458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
37460 static tree
37464 {
37473 {
37477 {
37503 }
37504 }
37506 {
37509 }
37514 {
37517 }
37527 }
37529 /* OpenMP 4.0:
37530 # pragma omp target data target-data-clause[optseq] new-line
37531 structured-block */
37533 #define OMP_TARGET_DATA_CLAUSE_MASK \
37534 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
37539 static tree
37541 {
37542 tree clauses
37547 {
37550 {
37567 "%<#pragma omp target data%> with map-type other "
37568 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
37572 }
37576 }
37579 {
37582 "%<#pragma omp target data%> must contain at least "
37585 }
37596 }
37598 /* OpenMP 4.5:
37599 # pragma omp target enter data target-enter-data-clause[optseq] new-line
37600 structured-block */
37602 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
37603 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37604 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37605 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37606 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37607 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37609 static tree
37612 {
37615 {
37620 {
37623 }
37624 }
37626 {
37630 }
37633 {
37639 }
37641 tree clauses
37646 {
37649 {
37662 "%<#pragma omp target enter data%> with map-type other "
37666 }
37668 }
37671 {
37674 "%<#pragma omp target enter data%> must contain at least "
37677 }
37684 }
37686 /* OpenMP 4.5:
37687 # pragma omp target exit data target-enter-data-clause[optseq] new-line
37688 structured-block */
37690 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
37691 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37693 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37697 static tree
37700 {
37703 {
37708 {
37711 }
37712 }
37714 {
37718 }
37721 {
37727 }
37729 tree clauses
37734 {
37737 {
37751 "%<#pragma omp target exit data%> with map-type other "
37752 "than %<from%>, %<release%> or %<delete%> on %<map%>"
37756 }
37758 }
37761 {
37764 "%<#pragma omp target exit data%> must contain at least "
37767 }
37774 }
37776 /* OpenMP 4.0:
37777 # pragma omp target update target-update-clause[optseq] new-line */
37779 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
37780 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
37781 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37782 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37787 static bool
37790 {
37792 {
37798 }
37800 tree clauses
37805 {
37807 "%<#pragma omp target update%> must contain at least one "
37810 }
37818 }
37820 /* OpenMP 4.0:
37821 # pragma omp target target-clause[optseq] new-line
37822 structured-block */
37824 #define OMP_TARGET_CLAUSE_MASK \
37825 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
37830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
37833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
37835 static bool
37838 {
37842 omp_requires_mask
37846 {
37858 {
37866 {
37867 tree stmt;
37869 {
37872 OMP_TARGET_CLAUSE_MASK,
37877 OMP_TARGET_CLAUSE_MASK,
37882 OMP_TARGET_CLAUSE_MASK,
37887 }
37889 }
37894 {
37898 if_p);
37903 if_p);
37908 if_p);
37912 }
37918 {
37919 /* For combined target teams, ensure the num_teams and
37920 thread_limit clause expressions are evaluated on the host,
37921 before entering the target construct. */
37922 tree c;
37928 {
37937 OMP_CLAUSE_FIRSTPRIVATE);
37942 }
37943 }
37953 }
37955 {
37958 }
37960 {
37964 }
37966 {
37970 }
37972 {
37976 }
37978 {
37981 }
37982 }
37984 {
37987 }
38002 check_clauses:
38004 {
38007 {
38021 "%<#pragma omp target%> with map-type other "
38022 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
38026 }
38028 }
38030 }
38032 /* OpenACC 2.0:
38033 # pragma acc cache (variable-list) new-line
38034 */
38036 static tree
38038 {
38053 }
38055 /* OpenACC 2.0:
38056 # pragma acc data oacc-data-clause[optseq] new-line
38057 structured-block */
38059 #define OACC_DATA_CLAUSE_MASK \
38060 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
38068 static tree
38070 {
38083 }
38085 /* OpenACC 2.0:
38086 # pragma acc host_data <clauses> new-line
38087 structured-block */
38089 #define OACC_HOST_DATA_CLAUSE_MASK \
38090 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
38092 static tree
38094 {
38107 }
38109 /* OpenACC 2.0:
38110 # pragma acc declare oacc-data-clause[optseq] new-line
38111 */
38113 #define OACC_DECLARE_CLAUSE_MASK \
38114 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38115 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38116 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38117 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38118 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
38120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
38121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
38123 static tree
38125 {
38134 {
38138 }
38141 {
38145 {
38149 }
38152 {
38164 {
38166 "%qD must be a global variable in "
38168 decl);
38171 }
38176 {
38180 }
38182 {
38184 "invalid use of %<extern%> variable %qD "
38188 }
38190 {
38192 "invalid use of %<global%> variable %qD "
38196 }
38198 }
38203 {
38208 }
38211 {
38212 tree id;
38216 else
38222 {
38225 {
38228 {
38232 }
38233 }
38234 }
38235 }
38236 }
38249 }
38251 /* OpenACC 2.0:
38252 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
38254 or
38256 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
38258 LOC is the location of the #pragma token.
38259 */
38261 #define OACC_ENTER_DATA_CLAUSE_MASK \
38262 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38263 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38264 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38265 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38268 #define OACC_EXIT_DATA_CLAUSE_MASK \
38269 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
38273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
38274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38276 static tree
38279 {
38288 {
38293 }
38300 else
38305 {
38309 }
38317 }
38319 /* OpenACC 2.0:
38320 # pragma acc loop oacc-loop-clause[optseq] new-line
38321 structured-block */
38323 #define OACC_LOOP_CLAUSE_MASK \
38324 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
38325 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
38326 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
38327 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
38328 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
38329 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
38330 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
38331 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
38332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
38333 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
38335 static tree
38338 {
38347 {
38353 }
38362 }
38364 /* OpenACC 2.0:
38365 # pragma acc kernels oacc-kernels-clause[optseq] new-line
38366 structured-block
38368 or
38370 # pragma acc parallel oacc-parallel-clause[optseq] new-line
38371 structured-block
38372 */
38374 #define OACC_KERNELS_CLAUSE_MASK \
38375 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38377 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38378 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38379 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38380 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
38381 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38382 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
38384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
38385 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
38386 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
38387 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38389 #define OACC_PARALLEL_CLAUSE_MASK \
38390 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38391 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
38396 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38397 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
38398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38399 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
38400 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
38401 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
38402 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
38403 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
38404 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
38405 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38407 static tree
38410 {
38411 omp_clause_mask mask;
38414 {
38427 }
38430 {
38434 {
38437 tree clauses;
38439 if_p);
38441 }
38442 }
38451 }
38453 /* OpenACC 2.0:
38454 # pragma acc update oacc-update-clause[optseq] new-line
38455 */
38457 #define OACC_UPDATE_CLAUSE_MASK \
38458 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
38460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
38461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
38463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
38465 static tree
38467 {
38474 {
38476 "%<#pragma acc update%> must contain at least one "
38479 }
38487 }
38489 /* OpenACC 2.0:
38490 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
38492 LOC is the location of the #pragma token.
38493 */
38495 #define OACC_WAIT_CLAUSE_MASK \
38496 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
38498 static tree
38500 {
38514 }
38516 /* OpenMP 4.0:
38517 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
38519 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
38520 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
38521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
38522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
38523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
38524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
38525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
38527 static void
38530 {
38532 cp_omp_declare_simd_data data;
38534 {
38539 /* It is safe to take the address of a local variable; it will only be
38540 used while this scope is live. */
38542 }
38544 /* Store away all pragma tokens. */
38556 {
38560 {
38573 }
38578 "%<#pragma omp declare simd%> not immediately followed by "
38582 }
38583 }
38585 /* Finalize #pragma omp declare simd clauses after direct declarator has
38586 been parsed, and put that into "omp declare simd" attribute. */
38588 static tree
38590 {
38596 {
38600 }
38605 {
38623 }
38627 }
38630 /* OpenMP 4.0:
38631 # pragma omp declare target new-line
38632 declarations and definitions
38633 # pragma omp end declare target new-line
38635 OpenMP 4.5:
38636 # pragma omp declare target ( extended-list ) new-line
38638 # pragma omp declare target declare-target-clauses[seq] new-line */
38640 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
38641 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
38642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
38644 static void
38646 {
38649 clauses
38653 {
38655 clauses);
38658 }
38659 else
38660 {
38664 }
38667 "%<#pragma omp declare target%> with clauses in between "
38668 "%<#pragma omp declare target%> without clauses and "
38671 {
38677 {
38680 }
38681 else
38684 {
38686 "%qD specified both in declare target %<link%> and %<to%>"
38689 }
38691 {
38698 {
38701 {
38705 }
38706 }
38707 }
38708 }
38709 }
38711 static void
38713 {
38716 {
38719 }
38721 {
38725 {
38728 }
38731 else
38732 {
38736 }
38737 }
38738 else
38739 {
38743 }
38747 "%<#pragma omp end declare target%> without corresponding "
38749 else
38751 }
38753 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
38754 expression and optional initializer clause of
38755 #pragma omp declare reduction. We store the expression(s) as
38756 either 3, 6 or 7 special statements inside of the artificial function's
38757 body. The first two statements are DECL_EXPRs for the artificial
38758 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
38759 expression that uses those variables.
38760 If there was any INITIALIZER clause, this is followed by further statements,
38761 the fourth and fifth statements are DECL_EXPRs for the artificial
38762 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
38763 constructor variant (first token after open paren is not omp_priv),
38764 then the sixth statement is a statement with the function call expression
38765 that uses the OMP_PRIV and optionally OMP_ORIG variable.
38766 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
38767 to initialize the OMP_PRIV artificial variable and there is seventh
38768 statement, a DECL_EXPR of the OMP_PRIV statement again. */
38770 static bool
38772 {
38784 tree combiner;
38799 {
38802 }
38805 {
38807 matching_parens parens;
38813 {
38816 }
38832 {
38836 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
38840 == CPP_CLOSE_PAREN
38843 {
38847 }
38852 }
38853 else
38854 {
38870 {
38875 }
38877 tree arg;
38890 }
38901 }
38905 UNKNOWN_LOCATION);
38908 }
38910 /* OpenMP 4.0
38911 #pragma omp declare reduction (reduction-id : typename-list : expression) \
38912 initializer-clause[opt] new-line
38914 initializer-clause:
38915 initializer (omp_priv initializer)
38916 initializer (function-name (argument-list)) */
38918 static void
38921 {
38931 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
38938 {
38970 }
38982 /* Types may not be defined in declare reduction type list. */
38985 parser->type_definition_forbidden_message
38991 saved_colon_doesnt_start_class_def_p
38996 {
39000 ;
39019 else
39024 else
39026 }
39028 /* Restore the saved message. */
39031 parser->colon_doesnt_start_class_def_p
39036 {
39037 fail:
39040 }
39046 {
39047 tree fntype
39050 NULL_TREE);
39070 {
39075 }
39077 {
39079 {
39088 }
39095 }
39096 else
39097 {
39100 }
39103 else
39106 {
39109 }
39111 {
39114 else
39119 }
39124 else
39125 {
39134 }
39141 }
39145 done:
39146 /* Free any declarators allocated. */
39148 }
39150 /* OpenMP 4.0
39151 #pragma omp declare simd declare-simd-clauses[optseq] new-line
39152 #pragma omp declare reduction (reduction-id : typename-list : expression) \
39153 initializer-clause[opt] new-line
39154 #pragma omp declare target new-line */
39156 static bool
39159 {
39161 {
39166 {
39169 context);
39171 }
39174 {
39177 context);
39179 }
39181 {
39184 }
39186 {
39190 }
39191 }
39196 }
39198 /* OpenMP 5.0
39199 #pragma omp requires clauses[optseq] new-line */
39201 static bool
39203 {
39209 {
39216 {
39231 {
39234 matching_parens parens;
39236 {
39238 {
39243 this_req
39246 this_req
39249 this_req
39251 }
39253 {
39255 "expected %<seq_cst%>, %<relaxed%> or "
39258 CPP_CLOSE_PAREN))
39260 }
39261 else
39268 /*consume_paren=*/
39272 {
39275 }
39276 }
39278 }
39279 else
39280 {
39282 "%<unified_shared_memory%>, "
39283 "%<dynamic_allocators%>, "
39284 "%<reverse_offload%> "
39288 }
39295 {
39297 {
39304 }
39306 {
39310 }
39313 {
39316 this_req
39318 (omp_requires_mask
39320 }
39324 "lexically after first %<atomic%> construct "
39327 omp_requires_mask
39330 }
39331 }
39333 }
39339 }
39342 /* OpenMP 4.5:
39343 #pragma omp taskloop taskloop-clause[optseq] new-line
39344 for-loop
39346 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
39347 for-loop */
39349 #define OMP_TASKLOOP_CLAUSE_MASK \
39350 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
39351 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
39352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
39353 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
39354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
39355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
39356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
39357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
39358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
39359 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
39360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
39361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
39362 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
39363 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
39364 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
39365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
39367 static tree
39371 {
39378 /* #pragma omp parallel master taskloop{, simd} disallow in_reduction
39379 clause. */
39384 {
39389 {
39413 }
39414 }
39416 {
39419 }
39424 {
39427 }
39434 if_p);
39440 }
39443 /* OpenACC 2.0:
39444 # pragma acc routine oacc-routine-clause[optseq] new-line
39445 function-definition
39447 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
39448 */
39450 #define OACC_ROUTINE_CLAUSE_MASK \
39451 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
39452 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
39453 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
39454 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
39457 /* Parse the OpenACC routine pragma. This has an optional '( name )'
39458 component, which must resolve to a declared namespace-scope
39459 function. The clauses are either processed directly (for a named
39460 function), or defered until the immediatley following declaration
39461 is parsed. */
39463 static void
39466 {
39468 /* The checking for "another pragma following this one" in the "no optional
39469 '( name )'" case makes sure that we dont re-enter. */
39472 cp_oacc_routine_data data;
39478 /* It is safe to take the address of a local variable; it will only be
39479 used while this scope is live. */
39482 /* Look for optional '( name )'. */
39484 {
39485 matching_parens parens;
39488 /* We parse the name as an id-expression. If it resolves to
39489 anything other than a non-overloaded function at namespace
39490 scope, it's an error. */
39506 {
39510 }
39512 data.clauses
39520 {
39525 }
39527 /* Perhaps we should use the same rule as declarations in different
39528 namespaces? */
39530 {
39535 }
39538 {
39542 }
39546 }
39548 {
39549 /* Store away all pragma tokens. */
39560 /* Emit a helpful diagnostic if there's another pragma following this
39561 one. */
39563 {
39566 /* ..., and then just keep going. */
39568 }
39570 /* We only have to consider the pragma_external case here. */
39575 else
39578 }
39579 }
39581 /* Finalize #pragma acc routine clauses after direct declarator has
39582 been parsed. */
39584 static tree
39586 {
39591 {
39593 "%<#pragma acc routine%> not immediately followed by "
39596 }
39613 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
39614 fndecl_seen. */
39617 }
39619 /* Apply any saved OpenACC routine clauses to a just-parsed
39620 declaration. */
39622 static void
39624 {
39626 {
39627 /* Keep going if we're in error reporting mode. */
39633 {
39635 "%<#pragma acc routine%> not immediately followed by"
39639 }
39641 {
39644 }
39647 {
39652 }
39655 {
39663 }
39665 /* Process the routine's dimension clauses. */
39669 /* Add an "omp declare target" attribute. */
39674 /* Don't unset parser->oacc_routine here: we may still need it to
39675 diagnose wrong usage. But, remember that we've used this "#pragma acc
39676 routine". */
39678 }
39679 }
39681 /* Main entry point to OpenMP statement pragmas. */
39683 static void
39685 {
39686 tree stmt;
39691 {
39714 if_p);
39719 if_p);
39736 if_p);
39741 if_p);
39746 if_p);
39751 if_p);
39760 if_p);
39774 if_p);
39779 if_p);
39783 }
39786 }
39787 \f
39788 /* Transactional Memory parsing routines. */
39790 /* Parse a transaction attribute.
39792 txn-attribute:
39793 attribute
39794 [ [ identifier ] ]
39796 We use this instead of cp_parser_attributes_opt for transactions to avoid
39797 the pedwarn in C++98 mode. */
39799 static tree
39801 {
39816 {
39820 /* For keywords, use the canonical spelling,
39821 not the parsed identifier. */
39825 }
39826 else
39830 error1:
39833 }
39835 /* Parse a __transaction_atomic or __transaction_relaxed statement.
39837 transaction-statement:
39838 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
39839 compound-statement
39840 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
39841 */
39843 static tree
39845 {
39856 else
39857 {
39861 }
39863 /* Parse a noexcept specification. */
39867 {
39868 /* cancel-and-throw is unimplemented. */
39871 }
39872 else
39875 /* Keep track if we're in the lexical scope of an outer transaction. */
39887 }
39889 /* Parse a __transaction_atomic or __transaction_relaxed expression.
39891 transaction-expression:
39892 __transaction_atomic txn-noexcept-spec[opt] ( expression )
39893 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
39894 */
39896 static tree
39898 {
39911 keyword == RID_TRANSACTION_RELAXED
39925 /* Set this early. This might mean that we allow transaction_cancel in
39926 an expression that we find out later actually has to be a constexpr.
39927 However, we expect that cxx_constant_value will be able to deal with
39928 this; also, if the noexcept has no constexpr, then what we parse next
39929 really is a transaction's body. */
39932 /* Parse a noexcept specification. */
39938 {
39939 matching_parens parens;
39946 }
39947 else
39948 {
39949 /* The only expression that is available got parsed for the noexcept
39950 already. noexcept is true then. */
39953 }
39962 }
39964 /* Parse a function-transaction-block.
39966 function-transaction-block:
39967 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
39968 function-body
39969 __transaction_atomic txn-attribute[opt] function-try-block
39970 __transaction_relaxed ctor-initializer[opt] function-body
39971 __transaction_relaxed function-try-block
39972 */
39974 static void
39976 {
39991 else
39992 {
39996 }
40004 else
40005 cp_parser_ctor_initializer_opt_and_function_body
40011 }
40013 /* Parse a __transaction_cancel statement.
40015 cancel-statement:
40016 __transaction_cancel txn-attribute[opt] ;
40017 __transaction_cancel txn-attribute[opt] throw-expression ;
40019 ??? Cancel and throw is not yet implemented. */
40021 static tree
40023 {
40029 RT_TRANSACTION_CANCEL);
40036 /* ??? Parse cancel-and-throw here. */
40041 {
40045 }
40047 {
40051 }
40053 {
40056 {
40062 }
40063 }
40065 {
40069 }
40075 }
40076 \f
40077 /* The parser. */
40081 \f
40082 /* Special handling for the first token or line in the file. The first
40083 thing in the file might be #pragma GCC pch_preprocess, which loads a
40084 PCH file, which is a GC collection point. So we need to handle this
40085 first pragma without benefit of an existing lexer structure.
40087 Always returns one token to the caller in *FIRST_TOKEN. This is
40088 either the true first token of the file, or the first token after
40089 the initial pragma. */
40091 static void
40093 {
40102 {
40109 }
40110 else
40113 /* Skip to the end of the pragma. */
40117 /* Now actually load the PCH file. */
40121 /* Read one more token to return to our caller. We have to do this
40122 after reading the PCH file in, since its pointers have to be
40123 live. */
40125 }
40127 /* Parse a pragma GCC ivdep. */
40129 static bool
40131 {
40134 }
40136 /* Parse a pragma GCC unroll. */
40138 static unsigned short
40140 {
40150 {
40152 " assignment-expression that evaluates to a non-negative"
40155 }
40156 else
40157 {
40161 }
40164 }
40166 /* Normal parsing of a pragma token. Here we can (and must) use the
40167 regular lexer. */
40169 static bool
40171 {
40174 tree stmt;
40185 {
40193 {
40203 }
40208 {
40218 }
40223 {
40233 }
40238 {
40249 }
40254 {
40265 }
40270 {
40281 }
40301 {
40306 }
40314 {
40319 }
40327 {
40331 }
40337 {
40342 }
40350 {
40355 }
40413 "%<#pragma omp section%> may only be used in "
40418 {
40420 {
40424 }
40430 {
40434 }
40435 else
40441 {
40444 }
40447 }
40450 {
40452 {
40456 }
40457 const unsigned short unroll
40463 {
40467 }
40468 else
40474 {
40477 }
40480 }
40487 bad_stmt:
40490 }
40494 }
40496 /* The interface the pragma parsers have to the lexer. */
40498 enum cpp_ttype
40500 {
40512 else
40513 {
40517 }
40520 }
40522 \f
40523 /* External interface. */
40525 /* Parse one entire translation unit. */
40527 void
40529 {
40544 }
40546 /* Create an identifier for a generic parameter type (a synthesized
40547 template parameter implied by `auto' or a concept identifier). */
40550 static tree
40552 {
40556 }
40558 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
40559 (creating a new template parameter list if necessary). Returns the newly
40560 created template type parm. */
40562 static tree
40564 {
40567 /* Before committing to modifying any scope, if we're in an
40568 implicit template scope, and we're trying to synthesize a
40569 constrained parameter, try to find a previous parameter with
40570 the same name. This is the same-type rule for abbreviated
40571 function templates.
40573 NOTE: We can generate implicit parameters when tentatively
40574 parsing a nested name specifier, only to reject that parse
40575 later. However, matching the same template-id as part of a
40576 direct-declarator should generate an identical template
40577 parameter, so this rule will merge them. */
40579 {
40582 {
40584 {
40587 /* Return the TEMPLATE_PARM_INDEX. */
40590 }
40592 }
40593 }
40595 /* We are either continuing a function template that already contains implicit
40596 template parameters, creating a new fully-implicit function template, or
40597 extending an existing explicit function template with implicit template
40598 parameters. */
40606 {
40610 }
40611 else
40612 {
40613 /* Roll back to the existing template parameter scope (in the case of
40614 extending an explicit function template) or introduce a new template
40615 parameter scope ahead of the function parameter scope (or class scope
40616 in the case of out-of-line member definitions). The function scope is
40617 added back after template parameter synthesis below. */
40622 {
40625 }
40627 {
40628 /* If not defining a class, then any class scope is a scope level in
40629 an out-of-line member definition. In this case simply wind back
40630 beyond the first such scope to inject the template parameter list.
40631 Otherwise wind back to the class being defined. The latter can
40632 occur in class member friend declarations such as:
40634 class A {
40635 void foo (auto);
40636 };
40637 class B {
40638 friend void A::foo (auto);
40639 };
40641 The template parameter list synthesized for the friend declaration
40642 must be injected in the scope of 'B'. This can also occur in
40643 erroneous cases such as:
40645 struct A {
40646 struct B {
40647 void foo (auto);
40648 };
40649 void B::foo (auto) {}
40650 };
40652 Here the attempted definition of 'B::foo' within 'A' is ill-formed
40653 but, nevertheless, the template parameter list synthesized for the
40654 declarator should be injected into the scope of 'A' as if the
40655 ill-formed template was specified explicitly. */
40658 {
40661 }
40662 }
40668 {
40669 /* Introduce a new template parameter list for implicit template
40670 parameters. */
40674 parser->implicit_template_scope
40681 }
40682 else
40683 {
40684 /* Synthesize implicit template parameters at the end of the explicit
40685 template parameter list. */
40692 parser->implicit_template_parms
40694 }
40695 }
40697 /* Synthesize a new template parameter and track the current template
40698 parameter chain with implicit_template_parms. */
40702 tree synth_tmpl_parm;
40706 synth_tmpl_parm
40709 synth_tmpl_parm
40711 else
40712 {
40716 }
40718 // Attach the constraint to the parm before processing.
40721 tree new_parm
40723 input_location,
40724 node,
40728 // Chain the new parameter to the list of implicit parameters.
40730 parser->implicit_template_parms
40732 else
40737 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
40740 /* If creating a fully implicit function template, start the new implicit
40741 template parameter list with this synthesized type, otherwise grow the
40742 current template parameter list. */
40745 {
40752 }
40753 else
40754 {
40759 }
40761 // If the new parameter was constrained, we need to add that to the
40762 // constraints in the template parameter list.
40764 {
40768 }
40773 }
40775 /* Finish the declaration of a fully implicit function template. Such a
40776 template has no explicit template parameter list so has not been through the
40777 normal template head and tail processing. synthesize_implicit_template_parm
40778 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
40779 provided if the declaration is a class member such that its template
40780 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
40781 form is returned. Otherwise NULL_TREE is returned. */
40783 static tree
40785 {
40790 {
40794 }
40806 }
40808 /* Like finish_fully_implicit_template, but to be used in error
40809 recovery, rearranging scopes so that we restore the state we had
40810 before synthesize_implicit_template_parm inserted the implement
40811 template parms scope. */
40813 static void
40815 {
40820 {
40829 }
40830 else
40836 }
40838 /* Helper function for diagnostics that have complained about things
40839 being used with 'extern "C"' linkage.
40841 Attempt to issue a note showing where the 'extern "C"' linkage began. */
40843 void
40845 {
40849 }