| blob | 3a98ed900cdd5a9061bf81cf575d72f134946710 |
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_has_attribute_expression
2053 static tree cp_parser_new_expression
2057 static tree cp_parser_new_type_id
2065 static tree cp_parser_delete_expression
2067 static cp_expr cp_parser_cast_expression
2069 static cp_expr cp_parser_binary_expression
2071 static tree cp_parser_question_colon_clause
2073 static cp_expr cp_parser_assignment_expression
2075 static enum tree_code cp_parser_assignment_operator_opt
2077 static cp_expr cp_parser_expression
2079 static cp_expr cp_parser_constant_expression
2081 static cp_expr cp_parser_builtin_offsetof
2083 static cp_expr cp_parser_lambda_expression
2085 static void cp_parser_lambda_introducer
2087 static bool cp_parser_lambda_declarator_opt
2089 static void cp_parser_lambda_body
2092 /* Statements [gram.stmt.stmt] */
2094 static void cp_parser_statement
2096 static void cp_parser_label_for_labeled_statement
2098 static tree cp_parser_expression_statement
2100 static tree cp_parser_compound_statement
2102 static void cp_parser_statement_seq_opt
2104 static tree cp_parser_selection_statement
2106 static tree cp_parser_condition
2108 static tree cp_parser_iteration_statement
2110 static bool cp_parser_init_statement
2112 static tree cp_parser_for
2114 static tree cp_parser_c_for
2116 static tree cp_parser_range_for
2118 static void do_range_for_auto_deduction
2120 static tree cp_parser_perform_range_for_lookup
2122 static tree cp_parser_range_for_member_function
2124 static tree cp_parser_jump_statement
2126 static void cp_parser_declaration_statement
2129 static tree cp_parser_implicitly_scoped_statement
2131 static void cp_parser_already_scoped_statement
2134 /* Declarations [gram.dcl.dcl] */
2136 static void cp_parser_declaration_seq_opt
2138 static void cp_parser_declaration
2140 static void cp_parser_toplevel_declaration
2142 static void cp_parser_block_declaration
2144 static void cp_parser_simple_declaration
2146 static void cp_parser_decl_specifier_seq
2148 static tree cp_parser_storage_class_specifier_opt
2150 static tree cp_parser_function_specifier_opt
2152 static tree cp_parser_type_specifier
2155 static tree cp_parser_simple_type_specifier
2157 static tree cp_parser_type_name
2159 static tree cp_parser_type_name
2161 static tree cp_parser_nonclass_name
2163 static tree cp_parser_elaborated_type_specifier
2165 static tree cp_parser_enum_specifier
2167 static void cp_parser_enumerator_list
2169 static void cp_parser_enumerator_definition
2171 static tree cp_parser_namespace_name
2173 static void cp_parser_namespace_definition
2175 static void cp_parser_namespace_body
2177 static tree cp_parser_qualified_namespace_specifier
2179 static void cp_parser_namespace_alias_definition
2181 static bool cp_parser_using_declaration
2183 static void cp_parser_using_directive
2185 static tree cp_parser_alias_declaration
2187 static void cp_parser_asm_definition
2189 static void cp_parser_linkage_specification
2191 static void cp_parser_static_assert
2193 static tree cp_parser_decltype
2195 static tree cp_parser_decomposition_declaration
2198 /* Declarators [gram.dcl.decl] */
2200 static tree cp_parser_init_declarator
2207 static enum tree_code cp_parser_ptr_operator
2209 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2211 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2213 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2215 static tree cp_parser_tx_qualifier_opt
2217 static tree cp_parser_late_return_type_opt
2219 static tree cp_parser_declarator_id
2221 static tree cp_parser_type_id
2223 static tree cp_parser_template_type_arg
2226 static tree cp_parser_type_id_1
2228 static void cp_parser_type_specifier_seq
2230 static tree cp_parser_parameter_declaration_clause
2232 static tree cp_parser_parameter_declaration_list
2236 static tree cp_parser_default_argument
2238 static void cp_parser_function_body
2240 static tree cp_parser_initializer
2242 static cp_expr cp_parser_initializer_clause
2244 static cp_expr cp_parser_braced_list
2249 static void cp_parser_ctor_initializer_opt_and_function_body
2252 static tree cp_parser_late_parsing_omp_declare_simd
2255 static tree cp_parser_late_parsing_oacc_routine
2258 static tree synthesize_implicit_template_parm
2260 static tree finish_fully_implicit_template
2262 static void abort_fully_implicit_template
2265 /* Classes [gram.class] */
2267 static tree cp_parser_class_name
2269 static tree cp_parser_class_specifier
2271 static tree cp_parser_class_head
2273 static enum tag_types cp_parser_class_key
2275 static void cp_parser_type_parameter_key
2277 static void cp_parser_member_specification_opt
2279 static void cp_parser_member_declaration
2281 static tree cp_parser_pure_specifier
2283 static tree cp_parser_constant_initializer
2286 /* Derived classes [gram.class.derived] */
2288 static tree cp_parser_base_clause
2290 static tree cp_parser_base_specifier
2293 /* Special member functions [gram.special] */
2295 static tree cp_parser_conversion_function_id
2297 static tree cp_parser_conversion_type_id
2301 static void cp_parser_ctor_initializer_opt
2303 static void cp_parser_mem_initializer_list
2305 static tree cp_parser_mem_initializer
2307 static tree cp_parser_mem_initializer_id
2310 /* Overloading [gram.over] */
2312 static cp_expr cp_parser_operator_function_id
2314 static cp_expr cp_parser_operator
2317 /* Templates [gram.temp] */
2319 static void cp_parser_template_declaration
2321 static tree cp_parser_template_parameter_list
2323 static tree cp_parser_template_parameter
2325 static tree cp_parser_type_parameter
2327 static tree cp_parser_template_id
2329 static tree cp_parser_template_name
2331 static tree cp_parser_template_argument_list
2333 static tree cp_parser_template_argument
2335 static void cp_parser_explicit_instantiation
2337 static void cp_parser_explicit_specialization
2340 /* Exception handling [gram.exception] */
2342 static tree cp_parser_try_block
2344 static void cp_parser_function_try_block
2346 static void cp_parser_handler_seq
2348 static void cp_parser_handler
2350 static tree cp_parser_exception_declaration
2352 static tree cp_parser_throw_expression
2354 static tree cp_parser_exception_specification_opt
2356 static tree cp_parser_type_id_list
2359 /* GNU Extensions */
2361 static tree cp_parser_asm_specification_opt
2363 static tree cp_parser_asm_operand_list
2365 static tree cp_parser_asm_clobber_list
2367 static tree cp_parser_asm_label_list
2369 static bool cp_next_tokens_can_be_attribute_p
2371 static bool cp_next_tokens_can_be_gnu_attribute_p
2373 static bool cp_next_tokens_can_be_std_attribute_p
2375 static bool cp_nth_tokens_can_be_std_attribute_p
2377 static bool cp_nth_tokens_can_be_gnu_attribute_p
2379 static bool cp_nth_tokens_can_be_attribute_p
2381 static tree cp_parser_attributes_opt
2383 static tree cp_parser_gnu_attributes_opt
2385 static tree cp_parser_gnu_attribute_list
2387 static tree cp_parser_std_attribute
2389 static tree cp_parser_std_attribute_spec
2391 static tree cp_parser_std_attribute_spec_seq
2393 static size_t cp_parser_skip_attributes_opt
2395 static bool cp_parser_extension_opt
2397 static void cp_parser_label_declaration
2400 /* Concept Extensions */
2402 static tree cp_parser_requires_clause
2404 static tree cp_parser_requires_clause_opt
2406 static tree cp_parser_requires_expression
2408 static tree cp_parser_requirement_parameter_list
2410 static tree cp_parser_requirement_body
2412 static tree cp_parser_requirement_list
2414 static tree cp_parser_requirement
2416 static tree cp_parser_simple_requirement
2418 static tree cp_parser_compound_requirement
2420 static tree cp_parser_type_requirement
2422 static tree cp_parser_nested_requirement
2425 /* Transactional Memory Extensions */
2427 static tree cp_parser_transaction
2429 static tree cp_parser_transaction_expression
2431 static void cp_parser_function_transaction
2433 static tree cp_parser_transaction_cancel
2437 pragma_external,
2438 pragma_member,
2439 pragma_objc_icode,
2440 pragma_stmt,
2441 pragma_compound
2442 };
2443 static bool cp_parser_pragma
2446 /* Objective-C++ Productions */
2448 static tree cp_parser_objc_message_receiver
2450 static tree cp_parser_objc_message_args
2452 static tree cp_parser_objc_message_expression
2454 static cp_expr cp_parser_objc_encode_expression
2456 static tree cp_parser_objc_defs_expression
2458 static tree cp_parser_objc_protocol_expression
2460 static tree cp_parser_objc_selector_expression
2462 static cp_expr cp_parser_objc_expression
2464 static bool cp_parser_objc_selector_p
2466 static tree cp_parser_objc_selector
2468 static tree cp_parser_objc_protocol_refs_opt
2470 static void cp_parser_objc_declaration
2472 static tree cp_parser_objc_statement
2474 static bool cp_parser_objc_valid_prefix_attributes
2476 static void cp_parser_objc_at_property_declaration
2478 static void cp_parser_objc_at_synthesize_declaration
2480 static void cp_parser_objc_at_dynamic_declaration
2482 static tree cp_parser_objc_struct_declaration
2485 /* Utility Routines */
2487 static cp_expr cp_parser_lookup_name
2489 static tree cp_parser_lookup_name_simple
2491 static tree cp_parser_maybe_treat_template_as_class
2493 static bool cp_parser_check_declarator_template_parameters
2495 static bool cp_parser_check_template_parameters
2497 static cp_expr cp_parser_simple_cast_expression
2499 static tree cp_parser_global_scope_opt
2501 static bool cp_parser_constructor_declarator_p
2503 static tree cp_parser_function_definition_from_specifiers_and_declarator
2505 static tree cp_parser_function_definition_after_declarator
2507 static bool cp_parser_template_declaration_after_export
2509 static void cp_parser_perform_template_parameter_access_checks
2511 static tree cp_parser_single_declaration
2513 static cp_expr cp_parser_functional_cast
2515 static tree cp_parser_save_member_function_body
2517 static tree cp_parser_save_nsdmi
2519 static tree cp_parser_enclosed_template_argument_list
2521 static void cp_parser_save_default_args
2523 static void cp_parser_late_parsing_for_member
2525 static tree cp_parser_late_parse_one_default_arg
2527 static void cp_parser_late_parsing_nsdmi
2529 static void cp_parser_late_parsing_default_args
2531 static tree cp_parser_sizeof_operand
2533 static cp_expr cp_parser_trait_expr
2535 static bool cp_parser_declares_only_class_p
2537 static void cp_parser_set_storage_class
2539 static void cp_parser_set_decl_spec_type
2541 static void set_and_check_decl_spec_loc
2544 static bool cp_parser_friend_p
2546 static void cp_parser_required_error
2552 static bool cp_parser_token_starts_function_definition_p
2554 static bool cp_parser_next_token_starts_class_definition_p
2556 static bool cp_parser_next_token_ends_template_argument_p
2558 static bool cp_parser_nth_token_starts_template_argument_list_p
2560 static enum tag_types cp_parser_token_is_class_key
2562 static enum tag_types cp_parser_token_is_type_parameter_key
2564 static void cp_parser_check_class_key
2566 static void cp_parser_check_access_in_redeclaration
2568 static bool cp_parser_optional_template_keyword
2570 static void cp_parser_pre_parsed_nested_name_specifier
2572 static bool cp_parser_cache_group
2574 static tree cp_parser_cache_defarg
2576 static void cp_parser_parse_tentatively
2578 static void cp_parser_commit_to_tentative_parse
2580 static void cp_parser_commit_to_topmost_tentative_parse
2582 static void cp_parser_abort_tentative_parse
2584 static bool cp_parser_parse_definitely
2588 static bool cp_parser_uncommitted_to_tentative_parse_p
2590 static void cp_parser_error
2592 static void cp_parser_name_lookup_error
2594 static bool cp_parser_simulate_error
2596 static bool cp_parser_check_type_definition
2598 static void cp_parser_check_for_definition_in_return_type
2600 static void cp_parser_check_for_invalid_template_id
2602 static bool cp_parser_non_integral_constant_expression
2604 static void cp_parser_diagnose_invalid_type_name
2606 static bool cp_parser_parse_and_diagnose_invalid_type_name
2608 static int cp_parser_skip_to_closing_parenthesis
2610 static void cp_parser_skip_to_end_of_statement
2612 static void cp_parser_consume_semicolon_at_end_of_statement
2614 static void cp_parser_skip_to_end_of_block_or_statement
2616 static bool cp_parser_skip_to_closing_brace
2618 static void cp_parser_skip_to_end_of_template_parameter_list
2620 static void cp_parser_skip_to_pragma_eol
2622 static bool cp_parser_error_occurred
2624 static bool cp_parser_allow_gnu_extensions_p
2626 static bool cp_parser_is_pure_string_literal
2628 static bool cp_parser_is_string_literal
2630 static bool cp_parser_is_keyword
2632 static tree cp_parser_make_typename_type
2636 static bool cp_parser_compound_literal_p
2638 static bool cp_parser_array_designator_p
2640 static bool cp_parser_init_statement_p
2642 static bool cp_parser_skip_to_closing_square_bracket
2645 /* Concept-related syntactic transformations */
2650 // -------------------------------------------------------------------------- //
2651 // Unevaluated Operand Guard
2652 //
2653 // Implementation of an RAII helper for unevaluated operand parsing.
2655 {
2658 }
2661 {
2664 }
2666 // -------------------------------------------------------------------------- //
2667 // Tentative Parsing
2669 /* Returns nonzero if we are parsing tentatively. */
2673 {
2675 }
2677 /* Returns nonzero if TOKEN is a string literal. */
2679 static bool
2681 {
2687 }
2689 /* Returns nonzero if TOKEN is a string literal
2690 of a user-defined string literal. */
2692 static bool
2694 {
2701 }
2703 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2705 static bool
2707 {
2709 }
2711 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2712 PRAGMA_NONE. */
2714 static enum pragma_kind
2716 {
2719 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2721 }
2723 /* Helper function for cp_parser_error.
2724 Having peeked a token of kind TOK1_KIND that might signify
2725 a conflict marker, peek successor tokens to determine
2726 if we actually do have a conflict marker.
2727 Specifically, we consider a run of 7 '<', '=' or '>' characters
2728 at the start of a line as a conflict marker.
2729 These come through the lexer as three pairs and a single,
2730 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2731 If it returns true, *OUT_LOC is written to with the location/range
2732 of the marker. */
2734 static bool
2737 {
2748 /* It must be at the start of the line. */
2753 /* We have a conflict marker. Construct a location of the form:
2754 <<<<<<<
2755 ^~~~~~~
2756 with start == caret, finishing at the end of the marker. */
2761 }
2763 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2764 RT_CLOSE_PAREN. */
2768 {
2770 {
2778 }
2779 }
2781 /* Attempt to convert TOKEN_DESC from a required_token to an
2782 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2784 static enum cpp_ttype
2786 {
2788 {
2809 /* Use CPP_EOF as a "no completions possible" code. */
2811 }
2812 }
2815 /* Subroutine of cp_parser_error and cp_parser_required_error.
2817 Issue a diagnostic of the form
2818 FILE:LINE: MESSAGE before TOKEN
2819 where TOKEN is the next token in the input stream. MESSAGE
2820 (specified by the caller) is usually of the form "expected
2821 OTHER-TOKEN".
2823 This bypasses the check for tentative passing, and potentially
2824 adds material needed by cp_parser_required_error.
2826 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2827 suggesting insertion of the missing token.
2829 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2830 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2831 location. */
2833 static void
2835 required_token missing_token_desc,
2836 location_t matching_location)
2837 {
2839 /* This diagnostic makes more sense if it is tagged to the line
2840 of the token we just peeked at. */
2844 {
2849 }
2851 /* If this is actually a conflict marker, report it as such. */
2855 {
2856 location_t loc;
2858 {
2861 /* Consume tokens until the end of the source line. */
2863 {
2873 }
2875 }
2876 }
2883 {
2884 /* Potentially supply a fix-it hint, suggesting to add the
2885 missing token immediately after the *previous* token.
2886 This may move the primary location within richloc. */
2888 location_t prev_token_loc
2892 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2893 Attempt to consolidate diagnostics by printing it as a
2894 secondary range within the main diagnostic. */
2896 added_matching_location
2898 }
2900 /* Actually emit the error. */
2902 /* Because c_parser_error does not understand
2903 CPP_KEYWORD, keywords are treated like
2904 identifiers. */
2909 {
2910 /* If we weren't able to consolidate matching_location, then
2911 print it as a secondary diagnostic. */
2916 }
2917 }
2919 /* If not parsing tentatively, issue a diagnostic of the form
2920 FILE:LINE: MESSAGE before TOKEN
2921 where TOKEN is the next token in the input stream. MESSAGE
2922 (specified by the caller) is usually of the form "expected
2923 OTHER-TOKEN". */
2925 static void
2927 {
2930 }
2932 /* Issue an error about name-lookup failing. NAME is the
2933 IDENTIFIER_NODE DECL is the result of
2934 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2935 the thing that we hoped to find. */
2937 static void
2939 tree name,
2940 tree decl,
2941 name_lookup_error desired,
2942 location_t location)
2943 {
2944 /* If name lookup completely failed, tell the user that NAME was not
2945 declared. */
2947 {
2960 else
2962 }
2964 {
2966 {
2983 }
2984 }
2986 {
2988 {
2998 name);
3002 }
3003 }
3004 else
3005 {
3007 {
3020 }
3021 }
3022 }
3024 /* If we are parsing tentatively, remember that an error has occurred
3025 during this tentative parse. Returns true if the error was
3026 simulated; false if a message should be issued by the caller. */
3028 static bool
3030 {
3032 {
3035 }
3037 }
3039 /* This function is called when a type is defined. If type
3040 definitions are forbidden at this point, an error message is
3041 issued. */
3043 static bool
3045 {
3046 /* If types are forbidden here, issue a message. */
3048 {
3049 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3050 in the message need to be interpreted. */
3053 }
3055 }
3057 /* This function is called when the DECLARATOR is processed. The TYPE
3058 was a type defined in the decl-specifiers. If it is invalid to
3059 define a type in the decl-specifiers for DECLARATOR, an error is
3060 issued. TYPE_LOCATION is the location of TYPE and is used
3061 for error reporting. */
3063 static void
3066 {
3067 /* [dcl.fct] forbids type definitions in return types.
3068 Unfortunately, it's not easy to know whether or not we are
3069 processing a return type until after the fact. */
3077 {
3082 type);
3083 }
3084 }
3086 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3087 "<" in any valid C++ program. If the next token is indeed "<",
3088 issue a message warning the user about what appears to be an
3089 invalid attempt to form a template-id. LOCATION is the location
3090 of the type-specifier (TYPE) */
3092 static void
3094 tree type,
3096 location_t location)
3097 {
3101 {
3107 {
3110 else
3112 }
3113 else
3115 /* Remember the location of the invalid "<". */
3118 /* Consume the "<". */
3120 /* Parse the template arguments. */
3122 /* Permanently remove the invalid template arguments so that
3123 this error message is not issued again. */
3126 }
3127 }
3129 /* If parsing an integral constant-expression, issue an error message
3130 about the fact that THING appeared and return true. Otherwise,
3131 return false. In either case, set
3132 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3134 static bool
3136 non_integral_constant thing)
3137 {
3140 {
3142 {
3145 {
3148 "ISO C++ forbids using a floating-point literal "
3153 "enumeration type cannot appear in a "
3244 }
3248 }
3249 }
3251 }
3253 /* Emit a diagnostic for an invalid type name. This function commits
3254 to the current active tentative parse, if any. (Otherwise, the
3255 problematic construct might be encountered again later, resulting
3256 in duplicate error messages.) LOCATION is the location of ID. */
3258 static void
3260 location_t location)
3261 {
3264 /* Try to lookup the identifier. */
3271 /* If the lookup was ambiguous, an error will already have
3272 been issued. */
3274 /* If the lookup found a template-name, it means that the user forgot
3275 to specify an argument list. Emit a useful error message. */
3277 {
3278 auto_diagnostic_group d;
3281 decl);
3286 }
3290 /* Something like 'unsigned A a;' */
3293 {
3294 /* Issue an error message. */
3295 auto_diagnostic_group d;
3296 name_hint hint;
3300 {
3306 }
3307 else
3309 /* If we're in a template class, it's possible that the user was
3310 referring to a type from a base class. For example:
3312 template <typename T> struct A { typedef T X; };
3313 template <typename T> struct B : public A<T> { X x; };
3315 The user should have said "typename A<T>::X". */
3331 {
3332 tree b;
3335 b;
3337 {
3341 {
3342 tree field;
3343 /* Go from a particular instantiation of the
3344 template (which will have an empty TYPE_FIELDs),
3345 to the main version. */
3348 field;
3352 {
3357 }
3360 }
3361 }
3362 }
3363 }
3364 /* Here we diagnose qualified-ids where the scope is actually correct,
3365 but the identifier does not resolve to a valid type name. */
3367 {
3369 {
3370 auto_diagnostic_group d;
3371 name_hint hint;
3380 {
3383 "%qE in namespace %qE does not name a template"
3386 else
3390 }
3392 {
3395 "%qE in namespace %qE does not name a template"
3398 else
3400 "%qE in namespace %qE does not name a template"
3403 }
3404 else
3405 {
3408 "%qE in namespace %qE does not name a type"
3411 else
3415 }
3418 }
3421 {
3422 /* A<T>::A<T>() */
3423 auto_diagnostic_group d;
3429 }
3432 {
3437 "need %<typename%> before %<%T::%D::%E%> because "
3441 id,
3444 else
3448 }
3450 {
3451 auto_diagnostic_group d;
3463 else
3469 }
3470 else
3472 }
3473 }
3475 /* Check for a common situation where a type-name should be present,
3476 but is not, and issue a sensible error message. Returns true if an
3477 invalid type-name was detected.
3479 The situation handled by this function are variable declarations of the
3480 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3481 Usually, `ID' should name a type, but if we got here it means that it
3482 does not. We try to emit the best possible error message depending on
3483 how exactly the id-expression looks like. */
3485 static bool
3487 {
3488 tree id;
3491 /* Avoid duplicate error about ambiguous lookup. */
3493 {
3497 }
3506 /* If the next token is a (, this is a function with no explicit return
3507 type, i.e. constructor, destructor or conversion op. */
3510 {
3513 }
3517 /* Emit a diagnostic for the invalid type. */
3519 out:
3520 /* If we aren't in the middle of a declarator (i.e. in a
3521 parameter-declaration-clause), skip to the end of the declaration;
3522 there's no point in trying to process it. */
3526 }
3528 /* Consume tokens up to, and including, the next non-nested closing `)'.
3529 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3530 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3531 found an unnested token of that type. */
3533 static int
3536 cpp_ttype or_ttype,
3538 {
3549 {
3552 /* Have we found what we're looking for before the closing paren? */
3558 {
3561 /* If we've run out of tokens, then there is no closing `)'. */
3564 /* This is good for lambda expression capture-lists. */
3574 /* This matches the processing in skip_to_end_of_statement. */
3594 {
3598 }
3608 condop_depth--;
3613 }
3615 /* Consume the token. */
3617 }
3618 }
3620 /* Consume tokens up to, and including, the next non-nested closing `)'.
3621 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3622 are doing error recovery. Returns -1 if OR_COMMA is true and we
3623 found an unnested token of that type. */
3625 static int
3630 {
3634 }
3636 /* Consume tokens until we reach the end of the current statement.
3637 Normally, that will be just before consuming a `;'. However, if a
3638 non-nested `}' comes first, then we stop before consuming that. */
3640 static void
3642 {
3645 /* Unwind generic function template scope if necessary. */
3650 {
3654 {
3657 /* If we've run out of tokens, stop. */
3661 /* If the next token is a `;', we have reached the end of the
3662 statement. */
3668 /* If this is a non-nested '}', stop before consuming it.
3669 That way, when confronted with something like:
3671 { 3 + }
3673 we stop before consuming the closing '}', even though we
3674 have not yet reached a `;'. */
3678 /* If it is the closing '}' for a block that we have
3679 scanned, stop -- but only after consuming the token.
3680 That way given:
3682 void f g () { ... }
3683 typedef int I;
3685 we will stop after the body of the erroneously declared
3686 function, but before consuming the following `typedef'
3687 declaration. */
3689 {
3692 }
3701 }
3703 /* Consume the token. */
3705 }
3706 }
3708 /* This function is called at the end of a statement or declaration.
3709 If the next token is a semicolon, it is consumed; otherwise, error
3710 recovery is attempted. */
3712 static void
3714 {
3715 /* Look for the trailing `;'. */
3717 {
3718 /* If there is additional (erroneous) input, skip to the end of
3719 the statement. */
3721 /* If the next token is now a `;', consume it. */
3724 }
3725 }
3727 /* Skip tokens until we have consumed an entire block, or until we
3728 have consumed a non-nested `;'. */
3730 static void
3732 {
3735 /* Unwind generic function template scope if necessary. */
3740 {
3744 {
3747 /* If we've run out of tokens, stop. */
3751 /* Stop if this is an unnested ';'. */
3757 /* Stop if this is an unnested '}', or closes the outermost
3758 nesting level. */
3759 nesting_depth--;
3767 /* Nest. */
3768 nesting_depth++;
3773 }
3775 /* Consume the token. */
3777 }
3778 }
3780 /* Skip tokens until a non-nested closing curly brace is the next
3781 token, or there are no more tokens. Return true in the first case,
3782 false otherwise. */
3784 static bool
3786 {
3790 {
3794 {
3797 /* If we've run out of tokens, stop. */
3801 /* If the next token is a non-nested `}', then we have reached
3802 the end of the current block. */
3808 /* If it the next token is a `{', then we are entering a new
3809 block. Consume the entire block. */
3815 }
3817 /* Consume the token. */
3819 }
3820 }
3822 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3823 parameter is the PRAGMA token, allowing us to purge the entire pragma
3824 sequence. */
3826 static void
3828 {
3833 do
3837 /* Ensure that the pragma is not parsed again. */
3839 }
3841 /* Require pragma end of line, resyncing with it as necessary. The
3842 arguments are as for cp_parser_skip_to_pragma_eol. */
3844 static void
3846 {
3850 }
3852 /* This is a simple wrapper around make_typename_type. When the id is
3853 an unresolved identifier node, we can provide a superior diagnostic
3854 using cp_parser_diagnose_invalid_type_name. */
3856 static tree
3858 location_t id_location)
3859 {
3860 tree result;
3862 {
3868 }
3870 }
3872 /* This is a wrapper around the
3873 make_{pointer,ptrmem,reference}_declarator functions that decides
3874 which one to call based on the CODE and CLASS_TYPE arguments. The
3875 CODE argument should be one of the values returned by
3876 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3877 appertain to the pointer or reference. */
3881 cp_cv_quals cv_qualifiers,
3883 tree attributes)
3884 {
3891 else
3901 }
3903 /* Create a new C++ parser. */
3907 {
3912 /* cp_lexer_new_main is called before doing GC allocation because
3913 cp_lexer_new_main might load a PCH file. */
3916 /* Initialize the binops_by_token so that we can get the tree
3917 directly from the token. */
3925 /* For now, we always accept GNU extensions. */
3928 /* The `>' token is a greater-than operator, not the end of a
3929 template-id. */
3934 /* We are not parsing a constant-expression. */
3939 /* Local variable names are not forbidden. */
3942 /* We are not processing an `extern "C"' declaration. */
3945 /* We are not processing a declarator. */
3948 /* We are not processing a template-argument-list. */
3951 /* We are not in an iteration statement. */
3954 /* We are not in a switch statement. */
3957 /* We are not parsing a type-id inside an expression. */
3960 /* String literals should be translated to the execution character set. */
3963 /* We are not parsing a function body. */
3966 /* We can correct until told otherwise. */
3969 /* The unparsed function queue is empty. */
3972 /* There are no classes being defined. */
3975 /* No template parameters apply. */
3978 /* Special parsing data structures. */
3982 /* Not declaring an implicit function template. */
3988 /* Allow constrained-type-specifiers. */
3991 /* We haven't yet seen an 'extern "C"'. */
3995 }
3997 /* Create a cp_lexer structure which will emit the tokens in CACHE
3998 and push it onto the parser's lexer stack. This is used for delayed
3999 parsing of in-class method bodies and default arguments, and should
4000 not be confused with tentative parsing. */
4001 static void
4003 {
4008 /* Move the current source position to that of the first token in the
4009 new lexer. */
4011 }
4013 /* Pop the top lexer off the parser stack. This is never used for the
4014 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
4015 static void
4017 {
4022 /* Put the current source position back where it was before this
4023 lexer was pushed. */
4025 }
4027 /* Lexical conventions [gram.lex] */
4029 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
4030 identifier. */
4032 static cp_expr
4034 {
4037 /* Look for the identifier. */
4039 /* Return the value. */
4042 else
4044 }
4046 /* Parse a sequence of adjacent string constants. Returns a
4047 TREE_STRING representing the combined, nul-terminated string
4048 constant. If TRANSLATE is true, translate the string to the
4049 execution character set. If WIDE_OK is true, a wide string is
4050 invalid here.
4052 C++98 [lex.string] says that if a narrow string literal token is
4053 adjacent to a wide string literal token, the behavior is undefined.
4054 However, C99 6.4.5p4 says that this results in a wide string literal.
4055 We follow C99 here, for consistency with the C front end.
4057 This code is largely lifted from lex_string() in c-lex.c.
4059 FUTURE: ObjC++ will need to handle @-strings here. */
4060 static cp_expr
4063 {
4064 tree value;
4072 tree string_tree;
4078 {
4081 }
4086 {
4090 }
4091 else
4092 {
4095 }
4098 /* Try to avoid the overhead of creating and destroying an obstack
4099 for the common case of just one string. */
4102 {
4110 {
4114 }
4115 else
4119 }
4120 else
4121 {
4127 do
4128 {
4130 count++;
4135 {
4138 {
4141 }
4144 {
4149 }
4151 }
4152 else
4156 {
4160 {
4164 "unsupported non-standard concatenation "
4166 }
4167 }
4176 {
4180 }
4181 else
4182 {
4186 }
4187 }
4190 /* A string literal built by concatenation has its caret=start at
4191 the start of the initial string, and its finish at the finish of
4192 the final string literal. */
4196 }
4199 {
4202 }
4206 {
4210 {
4214 }
4217 {
4232 }
4237 {
4242 else
4244 }
4245 }
4246 else
4247 /* cpp_interpret_string has issued an error. */
4251 {
4254 }
4257 }
4259 /* Look up a literal operator with the name and the exact arguments. */
4261 static tree
4263 {
4269 {
4273 {
4280 {
4290 }
4294 /* May be this should be sufficient_parms_p instead,
4295 depending on how exactly should user-defined literals
4296 work in presence of default arguments on the literal
4297 operator parameters. */
4300 }
4301 }
4304 }
4306 /* Parse a user-defined char constant. Returns a call to a user-defined
4307 literal operator taking the character as an argument. */
4309 static cp_expr
4311 {
4319 /* Build up a call to the user-defined operator */
4320 /* Lookup the name we got back from the id-expression. */
4325 {
4330 }
4334 }
4336 /* A subroutine of cp_parser_userdef_numeric_literal to
4337 create a char... template parameter pack from a string node. */
4339 static tree
4341 {
4342 tree charvec;
4348 /* Fill in CHARVEC with all of the parameters. */
4351 {
4360 }
4362 /* Build the argument packs. */
4368 }
4370 /* A subroutine of cp_parser_userdef_numeric_literal to
4371 create a char... template parameter pack from a string node. */
4373 static tree
4375 {
4376 tree charvec;
4387 /* First template parm is character type. */
4390 /* Fill in CHARVEC with all of the parameters. */
4397 /* Build the argument packs. */
4403 }
4405 /* Parse a user-defined numeric constant. returns a call to a user-defined
4406 literal operator. */
4408 static cp_expr
4410 {
4421 /* Look for a literal operator taking the exact type of numeric argument
4422 as the literal value. */
4427 {
4429 tf_warning_or_error);
4432 {
4435 long_long_unsigned_type_node);
4436 }
4437 else
4438 {
4442 long_double_type_node);
4446 }
4450 }
4453 /* If the numeric argument didn't work, look for a raw literal
4454 operator taking a const char* argument consisting of the number
4455 in string format. */
4460 {
4462 tf_warning_or_error);
4465 }
4468 /* If the raw literal didn't work, look for a non-type template
4469 function with parameter pack char.... Call the function with
4470 template parameter characters representing the number. */
4474 {
4477 {
4479 num_string);
4481 }
4484 tf_warning_or_error);
4487 }
4491 /* In C++14 the standard library defines complex number suffixes that
4492 conflict with GNU extensions. Prefer them if <complex> is #included. */
4502 {
4507 {
4508 /* No <complex>, so pedwarn and use GNU semantics. */
4511 }
4512 }
4514 bool complained
4521 {
4523 "(from <complex>) to enable the C++14 user-defined literal "
4528 }
4535 else
4536 {
4537 /* Use the built-in semantics. */
4538 tree type;
4540 {
4543 else
4545 }
4554 }
4557 /* Avoid repeated diagnostics. */
4560 }
4562 /* Parse a user-defined string constant. Returns a call to a user-defined
4563 literal operator taking a character pointer and the length of the string
4564 as arguments. */
4566 static tree
4568 {
4574 tree decl;
4576 /* Build up a call to the user-defined operator. */
4577 /* Lookup the name we got back from the id-expression. */
4578 releasing_vec rargs;
4586 tf_warning_or_error);
4588 /* Look for a suitable template function, either (C++20) with a single
4589 parameter of class type, or (N3599) with typename parameter CharT and
4590 parameter pack CharT... */
4594 {
4595 /* Use resolve_nondeduced_context to try to choose one form of template
4596 or the other. */
4603 else
4604 {
4609 }
4613 tf_warning_or_error);
4614 }
4619 }
4622 /* Basic concepts [gram.basic] */
4624 /* Parse a translation-unit.
4626 translation-unit:
4627 declaration-seq [opt] */
4629 static void
4631 {
4634 /* Create the declarator obstack. */
4636 /* Create the error declarator. */
4638 /* Create the empty parameter list. */
4640 UNKNOWN_LOCATION);
4641 /* Remember where the base of the declarator obstack lies. */
4647 {
4650 /* If we're entering or exiting a region that's implicitly
4651 extern "C", modify the lang context appropriately. */
4654 {
4658 else
4660 }
4666 {
4669 /* If the next token is now a `;', consume it. */
4672 }
4673 else
4675 }
4677 /* Get rid of the token array; we don't need it any more. */
4681 /* The EOF should have reset this. */
4684 /* Make sure the declarator obstack was fully cleaned up. */
4687 }
4689 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4690 decltype context. */
4694 {
4699 }
4701 /* We're about to parse a collection of statements. If we're currently
4702 parsing tentatively, set up a firewall so that any nested
4703 cp_parser_commit_to_tentative_parse won't affect the current context. */
4705 static cp_token_position
4707 {
4714 }
4716 /* We've finished parsing the collection of statements. Wrap up the
4717 firewall and replace the relevant tokens with the parsed form. */
4719 static void
4721 tree expr)
4722 {
4726 /* Finish the firewall level. */
4728 /* And remember the result of the parse for when we try again. */
4734 }
4736 /* Like the above functions, but let the user modify the tokens. Used by
4737 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4738 later parses, so it makes sense to localize the effects of
4739 cp_parser_commit_to_tentative_parse. */
4741 struct tentative_firewall
4742 {
4747 {
4748 /* If we're currently parsing tentatively, start a committed level as a
4749 firewall and then an inner tentative parse. */
4751 {
4755 }
4756 }
4759 {
4761 {
4762 /* Finish the inner tentative parse and the firewall, propagating any
4763 uncommitted error state to the outer tentative parse. */
4769 }
4770 }
4771 };
4773 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4774 This class is for tracking such a matching pair of symbols.
4775 In particular, it tracks the location of the first token,
4776 so that if the second token is missing, we can highlight the
4777 location of the first token when notifying the user about the
4778 problem. */
4781 class token_pair
4782 {
4784 /* token_pair's ctor. */
4787 /* If the next token is the opening symbol for this pair, consume it and
4788 return true.
4789 Otherwise, issue an error and return false.
4790 In either case, record the location of the opening token. */
4793 {
4797 }
4799 /* Consume the next token from PARSER, recording its location as
4800 that of the opening token within the pair. */
4803 {
4808 }
4810 /* If the next token is the closing symbol for this pair, consume it
4811 and return it.
4812 Otherwise, issue an error, highlighting the location of the
4813 corresponding opening token, and return NULL. */
4816 {
4819 m_open_loc);
4820 }
4823 location_t m_open_loc;
4824 };
4826 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4828 struct matching_paren_traits
4829 {
4834 };
4836 /* "matching_parens" is a token_pair<T> class for tracking matching
4837 pairs of parentheses. */
4841 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4843 struct matching_brace_traits
4844 {
4849 };
4851 /* "matching_braces" is a token_pair<T> class for tracking matching
4852 pairs of braces. */
4857 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4858 enclosing parentheses. */
4860 static cp_expr
4862 {
4865 /* Consume the '('. */
4867 matching_parens parens;
4869 /* Start the statement-expression. */
4871 /* Parse the compound-statement. */
4873 /* Finish up. */
4875 /* Consume the ')'. */
4883 }
4885 /* Expressions [gram.expr] */
4887 /* Parse a fold-operator.
4889 fold-operator:
4890 - * / % ^ & | = < > << >>
4891 = -= *= /= %= ^= &= |= <<= >>=
4892 == != <= >= && || , .* ->*
4894 This returns the tree code corresponding to the matched operator
4895 as an int. When the current token matches a compound assignment
4896 opertor, the resulting tree code is the negative value of the
4897 non-assignment operator. */
4899 static int
4901 {
4903 {
4943 }
4944 }
4946 /* Returns true if CODE indicates a binary expression, which is not allowed in
4947 the LHS of a fold-expression. More codes will need to be added to use this
4948 function in other contexts. */
4950 static bool
4952 {
4954 {
4987 }
4988 }
4990 /* If the next token is a suitable fold operator, consume it and return as
4991 the function above. */
4993 static int
4995 {
5001 }
5003 /* Parse a fold-expression.
5005 fold-expression:
5006 ( ... folding-operator cast-expression)
5007 ( cast-expression folding-operator ... )
5008 ( cast-expression folding operator ... folding-operator cast-expression)
5010 Note that the '(' and ')' are matched in primary expression. */
5012 static cp_expr
5014 {
5015 cp_id_kind pidk;
5017 // Left fold.
5019 {
5023 {
5026 }
5033 }
5038 {
5041 }
5044 {
5047 }
5050 /* The operands of a fold-expression are cast-expressions, so binary or
5051 conditional expressions are not allowed. We check this here to avoid
5052 tentative parsing. */
5064 // Right fold.
5069 {
5072 }
5075 // Binary left or right fold.
5080 }
5082 /* Parse a primary-expression.
5084 primary-expression:
5085 literal
5086 this
5087 ( expression )
5088 id-expression
5089 lambda-expression (C++11)
5091 GNU Extensions:
5093 primary-expression:
5094 ( compound-statement )
5095 __builtin_va_arg ( assignment-expression , type-id )
5096 __builtin_offsetof ( type-id , offsetof-expression )
5098 C++ Extensions:
5099 __has_nothrow_assign ( type-id )
5100 __has_nothrow_constructor ( type-id )
5101 __has_nothrow_copy ( type-id )
5102 __has_trivial_assign ( type-id )
5103 __has_trivial_constructor ( type-id )
5104 __has_trivial_copy ( type-id )
5105 __has_trivial_destructor ( type-id )
5106 __has_virtual_destructor ( type-id )
5107 __is_abstract ( type-id )
5108 __is_base_of ( type-id , type-id )
5109 __is_class ( type-id )
5110 __is_empty ( type-id )
5111 __is_enum ( type-id )
5112 __is_final ( type-id )
5113 __is_literal_type ( type-id )
5114 __is_pod ( type-id )
5115 __is_polymorphic ( type-id )
5116 __is_std_layout ( type-id )
5117 __is_trivial ( type-id )
5118 __is_union ( type-id )
5120 Objective-C++ Extension:
5122 primary-expression:
5123 objc-expression
5125 literal:
5126 __null
5128 ADDRESS_P is true iff this expression was immediately preceded by
5129 "&" and therefore might denote a pointer-to-member. CAST_P is true
5130 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5131 true iff this expression is a template argument.
5133 Returns a representation of the expression. Upon return, *IDK
5134 indicates what kind of id-expression (if any) was present. */
5136 static cp_expr
5143 {
5146 /* Assume the primary expression is not an id-expression. */
5149 /* Peek at the next token. */
5152 {
5153 /* literal:
5154 integer-literal
5155 character-literal
5156 floating-literal
5157 string-literal
5158 boolean-literal
5159 pointer-literal
5160 user-defined-literal */
5172 {
5176 }
5177 /* Floating-point literals are only allowed in an integral
5178 constant expression if they are cast to an integral or
5179 enumeration type. */
5183 {
5184 /* CAST_P will be set even in invalid code like "int(2.7 +
5185 ...)". Therefore, we have to check that the next token
5186 is sure to end the cast. */
5188 {
5193 enumerator-definition. */
5195 /* The curly brace at the end of an enum-specifier. */
5197 /* The end of a statement. */
5199 /* The end of the cast-expression. */
5201 /* The end of an array bound. */
5203 /* The closing ">" in a template-argument-list. */
5206 /* C++0x only: A ">>" treated like two ">" tokens,
5207 in a template-argument-list. */
5212 }
5214 /* If we are within a cast, then the constraint that the
5215 cast is to an integral or enumeration type will be
5216 checked at that point. If we are not within a cast, then
5217 this code is invalid. */
5220 }
5240 /* ??? Should wide strings be allowed when parser->translate_strings_p
5241 is false (i.e. in attributes)? If not, we can kill the third
5242 argument to cp_parser_string_literal. */
5248 /* If we see `( { ' then we are looking at the beginning of
5249 a GNU statement-expression. */
5252 {
5253 /* Statement-expressions are not allowed by the standard. */
5257 /* And they're not allowed outside of a function-body; you
5258 cannot, for example, write:
5260 int i = ({ int j = 3; j + 1; });
5262 at class or namespace scope. */
5265 {
5267 "statement-expressions are not allowed outside "
5273 }
5274 else
5276 }
5277 /* Otherwise it's a normal parenthesized expression. */
5278 {
5279 cp_expr expr;
5284 /* Consume the `('. */
5285 matching_parens parens;
5287 /* Within a parenthesized expression, a `>' token is always
5288 the greater-than operator. */
5289 saved_greater_than_is_operator_p
5294 /* Left fold expression. */
5296 else
5297 /* Parse the parenthesized expression. */
5302 {
5309 }
5310 else
5311 /* Let the front end know that this expression was
5312 enclosed in parentheses. This matters in case, for
5313 example, the expression is of the form `A::B', since
5314 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5315 not. */
5318 /* DR 705: Wrapping an unqualified name in parentheses
5319 suppresses arg-dependent lookup. We want to pass back
5320 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5321 (c++/37862), but none of the others. */
5325 /* The `>' token might be the end of a template-id or
5326 template-parameter-list now. */
5327 parser->greater_than_is_operator_p
5330 /* Consume the `)'. */
5339 }
5342 {
5344 {
5345 /* We might have an Objective-C++ message. */
5348 /* If that works out, we're done ... */
5351 /* ... else, fall though to see if it's a lambda. */
5352 }
5354 /* Don't warn about a failed tentative parse. */
5359 }
5363 /* We have an Objective-C++ string literal. */
5370 {
5371 /* These two are the boolean literals. */
5379 /* The `__null' literal. */
5384 /* The `nullptr' literal. */
5389 /* Recognize the `this' keyword. */
5393 {
5397 }
5398 /* Pointers cannot appear in constant-expressions. */
5403 /* The `operator' keyword can be the beginning of an
5404 id-expression. */
5411 {
5412 non_integral_constant name;
5414 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5415 __func__ are the names of variables -- but they are
5416 treated specially. Therefore, they are handled here,
5417 rather than relying on the generic id-expression logic
5418 below. Grammatically, these names are id-expressions.
5420 Consume the token. */
5424 {
5436 }
5441 /* Look up the name. */
5443 }
5446 {
5447 tree expression;
5448 tree type;
5449 location_t type_location;
5450 location_t start_loc
5452 /* The `__builtin_va_arg' construct is used to handle
5453 `va_arg'. Consume the `__builtin_va_arg' token. */
5455 /* Look for the opening `('. */
5456 matching_parens parens;
5458 /* Now, parse the assignment-expression. */
5460 /* Look for the `,'. */
5463 /* Parse the type-id. */
5464 {
5467 }
5468 /* Look for the closing `)'. */
5469 location_t finish_loc
5472 /* Using `va_arg' in a constant-expression is not
5473 allowed. */
5475 NIC_VA_ARG))
5477 /* Construct a location of the form:
5478 __builtin_va_arg (v, int)
5479 ~~~~~~~~~~~~~~~~~~~~~^~~~
5480 with the caret at the type, ranging from the start of the
5481 "__builtin_va_arg" token to the close paren. */
5482 location_t combined_loc
5485 }
5520 // C++ concepts
5524 /* Objective-C++ expressions. */
5534 {
5539 }
5540 /* FALLTHRU */
5544 }
5546 /* An id-expression can start with either an identifier, a
5547 `::' as the beginning of a qualified-id, or the "operator"
5548 keyword. */
5553 {
5554 id_expression:
5555 cp_expr id_expression;
5556 cp_expr decl;
5562 /* Parse the id-expression. */
5563 id_expression
5580 /* If we have a template-id, then no further lookup is
5581 required. If the template-id was for a template-class, we
5582 will sometimes have a TYPE_DECL at this point. */
5586 /* Look up the name. */
5587 else
5588 {
5589 tree ambiguous_decls;
5591 /* If we already know that this lookup is ambiguous, then
5592 we've already issued an error message; there's no reason
5593 to check again. */
5596 {
5599 }
5602 none_type,
5603 template_p,
5608 /* If the lookup was ambiguous, an error will already have
5609 been issued. */
5613 /* In Objective-C++, we may have an Objective-C 2.0
5614 dot-syntax for classes here. */
5619 {
5620 tree component;
5627 component);
5628 /* Build a location of the form:
5629 expr.component
5630 ~~~~~^~~~~~~~~
5631 with caret at the start of the component name (at
5632 input_location), ranging from the start of the id_expression
5633 to the end of the component name. */
5634 location_t combined_loc
5639 }
5641 /* In Objective-C++, an instance variable (ivar) may be preferred
5642 to whatever cp_parser_lookup_name() found.
5643 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5644 rest of c-family, we have to do a little extra work to preserve
5645 any location information in cp_expr "decl". Given that
5646 objc_lookup_ivar is implemented in "c-family" and "objc", we
5647 have a trip through the pure "tree" type, rather than cp_expr.
5648 Naively copying it back to "decl" would implicitly give the
5649 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5650 store an EXPR_LOCATION. Hence we only update "decl" (and
5651 hence its location_t) if we get back a different tree node. */
5653 id_expression);
5657 /* If name lookup gives us a SCOPE_REF, then the
5658 qualifying scope was dependent. */
5660 {
5661 /* At this point, we do not know if DECL is a valid
5662 integral constant expression. We assume that it is
5663 in fact such an expression, so that code like:
5665 template <int N> struct A {
5666 int a[B<N>::i];
5667 };
5669 is accepted. At template-instantiation time, we
5670 will check that B<N>::i is actually a constant. */
5672 }
5673 /* Check to see if DECL is a local variable in a context
5674 where that is forbidden. */
5677 {
5682 }
5683 }
5685 decl = (finish_id_expression
5687 idk,
5692 template_arg_p,
5700 }
5702 /* Anything else is an error. */
5706 }
5707 }
5715 {
5718 }
5720 /* Parse an id-expression.
5722 id-expression:
5723 unqualified-id
5724 qualified-id
5726 qualified-id:
5727 :: [opt] nested-name-specifier template [opt] unqualified-id
5728 :: identifier
5729 :: operator-function-id
5730 :: template-id
5732 Return a representation of the unqualified portion of the
5733 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5734 a `::' or nested-name-specifier.
5736 Often, if the id-expression was a qualified-id, the caller will
5737 want to make a SCOPE_REF to represent the qualified-id. This
5738 function does not do this in order to avoid wastefully creating
5739 SCOPE_REFs when they are not required.
5741 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5742 `template' keyword.
5744 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5745 uninstantiated templates.
5747 If *TEMPLATE_P is non-NULL, it is set to true iff the
5748 `template' keyword is used to explicitly indicate that the entity
5749 named is a template.
5751 If DECLARATOR_P is true, the id-expression is appearing as part of
5752 a declarator, rather than as part of an expression. */
5754 static cp_expr
5761 {
5765 /* Assume the `template' keyword was not used. */
5769 /* Look for the optional `::' operator. */
5770 global_scope_p
5771 = (!template_keyword_p
5776 /* Look for the optional nested-name-specifier. */
5777 nested_name_specifier_p
5780 check_dependency_p,
5782 declarator_p,
5783 template_keyword_p)
5786 /* If there is a nested-name-specifier, then we are looking at
5787 the first qualified-id production. */
5789 {
5790 tree saved_scope;
5791 tree saved_object_scope;
5792 tree saved_qualifying_scope;
5793 cp_expr unqualified_id;
5796 /* See if the next token is the `template' keyword. */
5800 /* Name lookup we do during the processing of the
5801 unqualified-id might obliterate SCOPE. */
5805 /* Process the final unqualified-id. */
5807 check_dependency_p,
5808 declarator_p,
5810 /* Restore the SAVED_SCOPE for our caller. */
5816 }
5817 /* Otherwise, if we are in global scope, then we are looking at one
5818 of the other qualified-id productions. */
5820 {
5822 tree id;
5824 /* Peek at the next token. */
5827 /* If it's an identifier, and the next token is not a "<", then
5828 we can avoid the template-id case. This is an optimization
5829 for this common case. */
5831 && !cp_parser_nth_token_starts_template_argument_list_p
5836 /* Try a template-id. */
5840 none_type,
5841 declarator_p);
5842 /* If that worked, we're done. */
5846 /* Peek at the next token. (Changes in the token buffer may
5847 have invalidated the pointer obtained above.) */
5851 {
5858 /* Fall through. */
5863 }
5864 }
5865 else
5868 declarator_p,
5869 optional_p);
5870 }
5872 /* Parse an unqualified-id.
5874 unqualified-id:
5875 identifier
5876 operator-function-id
5877 conversion-function-id
5878 ~ class-name
5879 template-id
5881 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5882 keyword, in a construct like `A::template ...'.
5884 Returns a representation of unqualified-id. For the `identifier'
5885 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5886 production a BIT_NOT_EXPR is returned; the operand of the
5887 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5888 other productions, see the documentation accompanying the
5889 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5890 names are looked up in uninstantiated templates. If DECLARATOR_P
5891 is true, the unqualified-id is appearing as part of a declarator,
5892 rather than as part of an expression. */
5894 static cp_expr
5900 {
5903 /* Peek at the next token. */
5907 {
5909 {
5910 tree id;
5912 /* We don't know yet whether or not this will be a
5913 template-id. */
5915 /* Try a template-id. */
5917 check_dependency_p,
5918 none_type,
5919 declarator_p);
5920 /* If it worked, we're done. */
5923 /* Otherwise, it's an ordinary identifier. */
5925 }
5929 check_dependency_p,
5930 none_type,
5931 declarator_p);
5934 {
5935 tree type_decl;
5936 tree qualifying_scope;
5937 tree object_scope;
5938 tree scope;
5941 /* Consume the `~' token. */
5943 /* Parse the class-name. The standard, as written, seems to
5944 say that:
5946 template <typename T> struct S { ~S (); };
5947 template <typename T> S<T>::~S() {}
5949 is invalid, since `~' must be followed by a class-name, but
5950 `S<T>' is dependent, and so not known to be a class.
5951 That's not right; we need to look in uninstantiated
5952 templates. A further complication arises from:
5954 template <typename T> void f(T t) {
5955 t.T::~T();
5956 }
5958 Here, it is not possible to look up `T' in the scope of `T'
5959 itself. We must look in both the current scope, and the
5960 scope of the containing complete expression.
5962 Yet another issue is:
5964 struct S {
5965 int S;
5966 ~S();
5967 };
5969 S::~S() {}
5971 The standard does not seem to say that the `S' in `~S'
5972 should refer to the type `S' and not the data member
5973 `S::S'. */
5975 /* DR 244 says that we look up the name after the "~" in the
5976 same scope as we looked up the qualifying name. That idea
5977 isn't fully worked out; it's more complicated than that. */
5982 /* Check for invalid scopes. */
5984 {
5988 }
5990 {
5994 scope);
5999 }
6002 /* If the name is of the form "X::~X" it's OK even if X is a
6003 typedef. */
6012 {
6015 }
6017 /* ~auto means the destructor of whatever the object is. */
6019 {
6022 "%<~auto%> only available with "
6026 }
6028 /* If there was an explicit qualification (S::~T), first look
6029 in the scope given by the qualification (i.e., S).
6031 Note: in the calls to cp_parser_class_name below we pass
6032 typename_type so that lookup finds the injected-class-name
6033 rather than the constructor. */
6037 {
6042 typename_type,
6045 declarator_p);
6048 }
6049 /* In "N::S::~S", look in "N" as well. */
6051 {
6056 type_decl
6060 typename_type,
6063 declarator_p);
6066 }
6067 /* In "p->S::~T", look in the scope given by "*p" as well. */
6069 {
6074 type_decl
6078 typename_type,
6081 declarator_p);
6084 }
6085 /* Look in the surrounding context. */
6087 {
6093 type_decl
6097 typename_type,
6100 declarator_p);
6103 {
6104 /* We couldn't find a type with this name. If we're parsing
6105 tentatively, fail and try something else. */
6107 {
6110 }
6111 /* Otherwise, accept it and check for a match at instantiation
6112 time. */
6117 }
6118 }
6119 /* If an error occurred, assume that the name of the
6120 destructor is the same as the name of the qualifying
6121 class. That allows us to keep parsing after running
6122 into ill-formed destructor names. */
6128 /* Check that destructor name and scope match. */
6130 {
6137 }
6139 /* [class.dtor]
6141 A typedef-name that names a class shall not be used as the
6142 identifier in the declarator for a destructor declaration. */
6149 type_decl);
6152 }
6156 {
6157 cp_expr id;
6159 /* This could be a template-id, so we try that first. */
6161 /* Try a template-id. */
6164 none_type,
6165 declarator_p);
6166 /* If that worked, we're done. */
6169 /* We still don't know whether we're looking at an
6170 operator-function-id or a conversion-function-id. */
6172 /* Try an operator-function-id. */
6174 /* If that didn't work, try a conversion-function-id. */
6179 }
6180 /* Fall through. */
6187 }
6188 }
6190 /* Parse an (optional) nested-name-specifier.
6192 nested-name-specifier: [C++98]
6193 class-or-namespace-name :: nested-name-specifier [opt]
6194 class-or-namespace-name :: template nested-name-specifier [opt]
6196 nested-name-specifier: [C++0x]
6197 type-name ::
6198 namespace-name ::
6199 nested-name-specifier identifier ::
6200 nested-name-specifier template [opt] simple-template-id ::
6202 PARSER->SCOPE should be set appropriately before this function is
6203 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6204 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6205 in name lookups.
6207 Sets PARSER->SCOPE to the class (TYPE) or namespace
6208 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6209 it unchanged if there is no nested-name-specifier. Returns the new
6210 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6212 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6213 part of a declaration and/or decl-specifier. */
6215 static tree
6222 {
6227 /* Remember where the nested-name-specifier starts. */
6229 {
6232 }
6235 {
6236 tree new_scope;
6237 tree old_scope;
6238 tree saved_qualifying_scope;
6240 /* Spot cases that cannot be the beginning of a
6241 nested-name-specifier. */
6244 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6245 the already parsed nested-name-specifier. */
6247 {
6248 /* Grab the nested-name-specifier and continue the loop. */
6250 /* If we originally encountered this nested-name-specifier
6251 with IS_DECLARATION set to false, we will not have
6252 resolved TYPENAME_TYPEs, so we must do so here. */
6255 {
6260 }
6263 }
6265 /* Spot cases that cannot be the beginning of a
6266 nested-name-specifier. On the second and subsequent times
6267 through the loop, we look for the `template' keyword. */
6269 ;
6270 /* A template-id can start a nested-name-specifier. */
6272 ;
6273 /* DR 743: decltype can be used in a nested-name-specifier. */
6275 ;
6276 else
6277 {
6278 /* If the next token is not an identifier, then it is
6279 definitely not a type-name or namespace-name. */
6282 /* If the following token is neither a `<' (to begin a
6283 template-id), nor a `::', then we are not looking at a
6284 nested-name-specifier. */
6290 {
6294 "found %<:%> in nested-name-specifier, "
6297 }
6300 && !cp_parser_nth_token_starts_template_argument_list_p
6303 }
6305 /* The nested-name-specifier is optional, so we parse
6306 tentatively. */
6309 /* Look for the optional `template' keyword, if this isn't the
6310 first time through the loop. */
6314 /* Save the old scope since the name lookup we are about to do
6315 might destroy it. */
6318 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6319 look up names in "X<T>::I" in order to determine that "Y" is
6320 a template. So, if we have a typename at this point, we make
6321 an effort to look through it. */
6323 && !typename_keyword_p
6328 /* Parse the qualifying entity. */
6329 new_scope
6331 typename_keyword_p,
6332 template_keyword_p,
6333 check_dependency_p,
6334 type_p,
6335 is_declaration);
6336 /* Look for the `::' token. */
6339 /* If we found what we wanted, we keep going; otherwise, we're
6340 done. */
6342 {
6345 /* Restore the OLD_SCOPE since it was valid before the
6346 failed attempt at finding the last
6347 class-or-namespace-name. */
6351 /* If the next token is a decltype, and the one after that is a
6352 `::', then the decltype has failed to resolve to a class or
6353 enumeration type. Give this error even when parsing
6354 tentatively since it can't possibly be valid--and we're going
6355 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6356 won't get another chance.*/
6360 {
6367 /* As below. */
6370 }
6374 {
6375 /* If we have a non-type template-id followed by ::, it can't
6376 possibly be valid. */
6381 {
6384 {
6390 }
6391 else
6392 {
6393 /* Variable template. */
6398 }
6405 /* As below. */
6409 }
6410 }
6414 /* If the next token is an identifier, and the one after
6415 that is a `::', then any valid interpretation would have
6416 found a class-or-namespace-name. */
6422 {
6425 {
6427 {
6428 tree decl;
6429 tree ambiguous_decls;
6432 none_type,
6441 decl);
6443 {
6444 // cp_parser_lookup_name has the same diagnostic,
6445 // thus make sure to emit it at most once.
6448 {
6453 }
6455 }
6456 else
6457 {
6459 cp_parser_name_lookup_error
6462 else
6463 cp_parser_name_lookup_error
6466 }
6467 }
6470 /* Treat this as a successful nested-name-specifier
6471 due to:
6473 [basic.lookup.qual]
6475 If the name found is not a class-name (clause
6476 _class_) or namespace-name (_namespace.def_), the
6477 program is ill-formed. */
6479 }
6481 }
6483 }
6484 /* We've found one valid nested-name-specifier. */
6486 /* Name lookup always gives us a DECL. */
6489 /* Uses of "template" must be followed by actual templates. */
6501 new_scope);
6502 /* If it is a class scope, try to complete it; we are about to
6503 be looking up names inside the class. */
6505 /* Since checking types for dependency can be expensive,
6506 avoid doing it if the type is already complete. */
6508 /* Do not try to complete dependent types. */
6510 {
6512 /* If it is a typedef to current class, use the current
6513 class instead, as the typedef won't have any names inside
6514 it yet. */
6518 }
6519 /* Make sure we look in the right scope the next time through
6520 the loop. */
6522 }
6524 /* If parsing tentatively, replace the sequence of tokens that makes
6525 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6526 token. That way, should we re-parse the token stream, we will
6527 not have to repeat the effort required to do the parse, nor will
6528 we issue duplicate error messages. */
6530 {
6534 /* Reset the contents of the START token. */
6536 /* Retrieve any deferred checks. Do not pop this access checks yet
6537 so the memory will not be reclaimed during token replacing below. */
6545 /* Purge all subsequent tokens. */
6547 }
6553 }
6555 /* Parse a nested-name-specifier. See
6556 cp_parser_nested_name_specifier_opt for details. This function
6557 behaves identically, except that it will an issue an error if no
6558 nested-name-specifier is present. */
6560 static tree
6566 {
6567 tree scope;
6569 /* Look for the nested-name-specifier. */
6571 typename_keyword_p,
6572 check_dependency_p,
6573 type_p,
6574 is_declaration);
6575 /* If it was not present, issue an error message. */
6577 {
6580 }
6583 }
6585 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6586 this is either a class-name or a namespace-name (which corresponds
6587 to the class-or-namespace-name production in the grammar). For
6588 C++0x, it can also be a type-name that refers to an enumeration
6589 type or a simple-template-id.
6591 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6592 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6593 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6594 TYPE_P is TRUE iff the next name should be taken as a class-name,
6595 even the same name is declared to be another entity in the same
6596 scope.
6598 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6599 specified by the class-or-namespace-name. If neither is found the
6600 ERROR_MARK_NODE is returned. */
6602 static tree
6609 {
6610 tree saved_scope;
6611 tree saved_qualifying_scope;
6612 tree saved_object_scope;
6613 tree scope;
6617 /* DR 743: decltype can appear in a nested-name-specifier. */
6619 {
6623 {
6626 }
6630 }
6632 /* Before we try to parse the class-name, we must save away the
6633 current PARSER->SCOPE since cp_parser_class_name will destroy
6634 it. */
6638 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6639 there is no need to look for a namespace-name. */
6640 only_class_p = template_keyword_p
6645 typename_keyword_p,
6646 template_keyword_p,
6648 check_dependency_p,
6650 is_declaration,
6653 /* If that didn't work, try for a namespace-name. */
6655 {
6656 /* Restore the saved scope. */
6660 /* If we are not looking at an identifier followed by the scope
6661 resolution operator, then this is not part of a
6662 nested-name-specifier. (Note that this function is only used
6663 to parse the components of a nested-name-specifier.) */
6668 }
6671 }
6673 /* Return true if we are looking at a compound-literal, false otherwise. */
6675 static bool
6677 {
6680 /* Skip tokens until the next token is a closing parenthesis.
6681 If we find the closing `)', and the next token is a `{', then
6682 we are looking at a compound-literal. */
6683 bool compound_literal_p
6688 /* Roll back the tokens we skipped. */
6692 }
6694 /* Return true if EXPR is the integer constant zero or a complex constant
6695 of zero, without any folding, but ignoring location wrappers. */
6697 bool
6699 {
6702 }
6704 /* Parse a postfix-expression.
6706 postfix-expression:
6707 primary-expression
6708 postfix-expression [ expression ]
6709 postfix-expression ( expression-list [opt] )
6710 simple-type-specifier ( expression-list [opt] )
6711 typename :: [opt] nested-name-specifier identifier
6712 ( expression-list [opt] )
6713 typename :: [opt] nested-name-specifier template [opt] template-id
6714 ( expression-list [opt] )
6715 postfix-expression . template [opt] id-expression
6716 postfix-expression -> template [opt] id-expression
6717 postfix-expression . pseudo-destructor-name
6718 postfix-expression -> pseudo-destructor-name
6719 postfix-expression ++
6720 postfix-expression --
6721 dynamic_cast < type-id > ( expression )
6722 static_cast < type-id > ( expression )
6723 reinterpret_cast < type-id > ( expression )
6724 const_cast < type-id > ( expression )
6725 typeid ( expression )
6726 typeid ( type-id )
6728 GNU Extension:
6730 postfix-expression:
6731 ( type-id ) { initializer-list , [opt] }
6733 This extension is a GNU version of the C99 compound-literal
6734 construct. (The C99 grammar uses `type-name' instead of `type-id',
6735 but they are essentially the same concept.)
6737 If ADDRESS_P is true, the postfix expression is the operand of the
6738 `&' operator. CAST_P is true if this expression is the target of a
6739 cast.
6741 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6742 class member access expressions [expr.ref].
6744 Returns a representation of the expression. */
6746 static cp_expr
6750 {
6752 location_t loc;
6758 /* Peek at the next token. */
6763 /* Some of the productions are determined by keywords. */
6766 {
6771 {
6772 tree type;
6773 cp_expr expression;
6777 /* All of these can be handled in the same way from the point
6778 of view of parsing. Begin by consuming the token
6779 identifying the cast. */
6782 /* New types cannot be defined in the cast. */
6784 parser->type_definition_forbidden_message
6787 /* Look for the opening `<'. */
6789 /* Parse the type to which we are casting. */
6794 /* Look for the closing `>'. */
6796 /* Restore the old message. */
6799 bool saved_greater_than_is_operator_p
6803 /* And the expression which is being cast. */
6804 matching_parens parens;
6808 RT_CLOSE_PAREN);
6812 parser->greater_than_is_operator_p
6815 /* Only type conversions to integral or enumeration types
6816 can be used in constant-expressions. */
6819 {
6822 }
6825 {
6827 postfix_expression
6831 postfix_expression
6835 postfix_expression
6837 tf_warning_or_error);
6840 postfix_expression
6845 }
6847 /* Construct a location e.g. :
6848 reinterpret_cast <int *> (expr)
6849 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6850 ranging from the start of the "*_cast" token to the final closing
6851 paren, with the caret at the start. */
6854 }
6858 {
6859 tree type;
6863 /* Consume the `typeid' token. */
6865 /* Look for the `(' token. */
6866 matching_parens parens;
6868 /* Types cannot be defined in a `typeid' expression. */
6870 parser->type_definition_forbidden_message
6872 /* We can't be sure yet whether we're looking at a type-id or an
6873 expression. */
6875 /* Try a type-id first. */
6880 /* Look for the `)' token. Otherwise, we can't be sure that
6881 we're not looking at an expression: consider `typeid (int
6882 (3))', for example. */
6884 /* If all went well, simply lookup the type-id. */
6887 /* Otherwise, fall back to the expression variant. */
6888 else
6889 {
6890 tree expression;
6892 /* Look for an expression. */
6894 /* Compute its typeid. */
6896 /* Look for the `)' token. */
6898 }
6899 /* Restore the saved message. */
6901 /* `typeid' may not appear in an integral constant expression. */
6905 /* Construct a location e.g. :
6906 typeid (expr)
6907 ^~~~~~~~~~~~~
6908 ranging from the start of the "typeid" token to the final closing
6909 paren, with the caret at the start. */
6911 {
6912 location_t typeid_loc
6916 }
6917 }
6921 {
6922 tree type;
6923 /* The syntax permitted here is the same permitted for an
6924 elaborated-type-specifier. */
6931 }
6937 {
6940 tree p;
6947 {
6950 }
6956 {
6959 postfix_expression
6961 else
6962 {
6966 }
6972 tf_warning_or_error);
6973 else
6974 {
6978 }
6983 postfix_expression
6987 postfix_expression
6990 else
6991 {
6995 }
7000 }
7002 }
7005 {
7006 tree type;
7008 /* If the next thing is a simple-type-specifier, we may be
7009 looking at a functional cast. We could also be looking at
7010 an id-expression. So, we try the functional cast, and if
7011 that doesn't work we fall back to the primary-expression. */
7013 /* Look for the simple-type-specifier. */
7017 CP_PARSER_FLAGS_NONE);
7019 /* Parse the cast itself. */
7021 postfix_expression
7023 /* If that worked, we're done. */
7027 /* If the functional-cast didn't work out, try a
7028 compound-literal. */
7031 {
7036 matching_parens parens;
7039 /* Avoid calling cp_parser_type_id pointlessly, see comment
7040 in cp_parser_cast_expression about c++/29234. */
7043 else
7044 {
7045 /* Parse the type. */
7051 }
7053 /* If things aren't going well, there's no need to
7054 keep going. */
7056 {
7058 /* Parse the brace-enclosed initializer list. */
7061 }
7062 /* If that worked, we're definitely looking at a
7063 compound-literal expression. */
7065 {
7066 /* Warn the user that a compound literal is not
7067 allowed in standard C++. */
7070 /* For simplicity, we disallow compound literals in
7071 constant-expressions. We could
7072 allow compound literals of integer type, whose
7073 initializer was a constant, in constant
7074 expressions. Permitting that usage, as a further
7075 extension, would not change the meaning of any
7076 currently accepted programs. (Of course, as
7077 compound literals are not part of ISO C++, the
7078 standard has nothing to say.) */
7080 NIC_NCC))
7081 {
7084 }
7085 /* Form the representation of the compound-literal. */
7086 postfix_expression
7091 }
7092 }
7094 /* It must be a primary-expression. */
7095 postfix_expression
7098 decltype_p,
7100 }
7102 }
7104 /* Note that we don't need to worry about calling build_cplus_new on a
7105 class-valued CALL_EXPR in decltype when it isn't the end of the
7106 postfix-expression; unary_complex_lvalue will take care of that for
7107 all these cases. */
7109 /* Keep looping until the postfix-expression is complete. */
7111 {
7115 /* It is not a Koenig lookup function call. */
7116 postfix_expression
7119 /* Peek at the next token. */
7123 {
7126 {
7128 "two consecutive %<[%> shall "
7131 }
7132 postfix_expression
7134 postfix_expression,
7136 decltype_p);
7145 /* postfix-expression ( expression-list [opt] ) */
7146 {
7157 is_builtin_constant_p
7160 {
7161 /* The whole point of __builtin_constant_p is to allow
7162 non-constant expressions to appear as arguments. */
7163 saved_integral_constant_expression_p
7165 saved_non_integral_constant_expression_p
7168 }
7169 args = (cp_parser_parenthesized_expression_list
7176 {
7177 parser->integral_constant_expression_p
7179 parser->non_integral_constant_expression_p
7181 }
7184 {
7187 }
7189 /* Function calls are not permitted in
7190 constant-expressions. */
7193 NIC_FUNC_CALL))
7194 {
7198 }
7203 {
7205 /* In C++2A, we may need to perform ADL for a template
7206 name. */
7209 {
7211 {
7214 postfix_expression
7216 complain);
7217 }
7218 else
7219 postfix_expression
7221 }
7222 /* We do not perform argument-dependent lookup if
7223 normal lookup finds a non-function, in accordance
7224 with the expected resolution of DR 218. */
7227 {
7231 /* Do not do argument dependent lookup if regular
7232 lookup finds a member function or a block-scope
7233 function declaration. [basic.lookup.argdep]/3 */
7236 {
7239 postfix_expression
7241 complain);
7242 }
7243 }
7244 }
7247 {
7257 {
7259 postfix_expression
7263 }
7266 {
7267 postfix_expression
7268 = (build_new_method_call
7274 complain));
7275 }
7276 else
7277 postfix_expression
7281 complain);
7282 }
7286 postfix_expression = (build_offset_ref_call_from_tree
7288 complain));
7290 /* A call to a static class member, or a namespace-scope
7291 function. */
7292 postfix_expression
7295 koenig_p,
7296 complain);
7297 else
7298 /* All other function calls. */
7299 postfix_expression
7302 koenig_p,
7303 complain);
7306 {
7308 start_loc,
7309 close_paren_loc);
7311 }
7313 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7317 }
7322 /* postfix-expression . template [opt] id-expression
7323 postfix-expression . pseudo-destructor-name
7324 postfix-expression -> template [opt] id-expression
7325 postfix-expression -> pseudo-destructor-name */
7327 /* Consume the `.' or `->' operator. */
7330 postfix_expression
7332 postfix_expression,
7339 /* postfix-expression ++ */
7340 /* Consume the `++' token. */
7342 /* Generate a representation for the complete expression. */
7343 postfix_expression
7345 POSTINCREMENT_EXPR);
7346 /* Increments may not appear in constant-expressions. */
7354 /* postfix-expression -- */
7355 /* Consume the `--' token. */
7357 /* Generate a representation for the complete expression. */
7358 postfix_expression
7360 POSTDECREMENT_EXPR);
7361 /* Decrements may not appear in constant-expressions. */
7372 return is_member_access
7373 ? postfix_expression
7375 else
7377 }
7378 }
7380 /* We should never get here. */
7383 }
7385 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7386 by cp_parser_builtin_offsetof. We're looking for
7388 postfix-expression [ expression ]
7389 postfix-expression [ braced-init-list ] (C++11)
7391 FOR_OFFSETOF is set if we're being called in that context, which
7392 changes how we deal with integer constant expressions. */
7394 static tree
7396 tree postfix_expression,
7399 {
7404 /* Consume the `[' token. */
7410 /* Parse the index expression. */
7411 /* ??? For offsetof, there is a question of what to allow here. If
7412 offsetof is not being used in an integral constant expression context,
7413 then we *could* get the right answer by computing the value at runtime.
7414 If we are in an integral constant expression context, then we might
7415 could accept any constant expression; hard to say without analysis.
7416 Rather than open the barn door too wide right away, allow only integer
7417 constant expressions here. */
7420 else
7421 {
7423 {
7428 }
7429 else
7431 }
7435 /* Look for the closing `]'. */
7438 /* Build the ARRAY_REF. */
7442 /* When not doing offsetof, array references are not permitted in
7443 constant-expressions. */
7449 }
7451 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7452 dereference of incomplete type, returns true if error_mark_node should
7453 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7454 and *DEPENDENT_P. */
7456 bool
7459 {
7460 /* In a template, be permissive by treating an object expression
7461 of incomplete type as dependent (after a pedwarn). */
7462 diagnostic_t kind = (processing_template_decl
7466 {
7478 /* Don't emit any diagnostic for OVERLOADs. */
7482 /* Avoid clobbering e.g. DECLs. */
7486 }
7498 {
7501 }
7503 }
7505 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7506 by cp_parser_builtin_offsetof. We're looking for
7508 postfix-expression . template [opt] id-expression
7509 postfix-expression . pseudo-destructor-name
7510 postfix-expression -> template [opt] id-expression
7511 postfix-expression -> pseudo-destructor-name
7513 FOR_OFFSETOF is set if we're being called in that context. That sorta
7514 limits what of the above we'll actually accept, but nevermind.
7515 TOKEN_TYPE is the "." or "->" token, which will already have been
7516 removed from the stream. */
7518 static tree
7521 cp_expr postfix_expression,
7523 location_t location)
7524 {
7525 tree name;
7531 /* If this is a `->' operator, dereference the pointer. */
7534 tf_warning_or_error);
7535 /* Check to see whether or not the expression is type-dependent and
7536 not the current instantiation. */
7538 /* The identifier following the `->' or `.' is not qualified. */
7544 /* Enter the scope corresponding to the type of the object
7545 given by the POSTFIX_EXPRESSION. */
7547 {
7549 /* According to the standard, no expression should ever have
7550 reference type. Unfortunately, we do not currently match
7551 the standard in this respect in that our internal representation
7552 of an expression may have reference type even when the standard
7553 says it does not. Therefore, we have to manually obtain the
7554 underlying type here. */
7556 /* The type of the POSTFIX_EXPRESSION must be complete. */
7557 /* Unlike the object expression in other contexts, *this is not
7558 required to be of complete type for purposes of class member
7559 access (5.2.5) outside the member function body. */
7563 {
7569 }
7572 {
7573 /* Let the name lookup machinery know that we are processing a
7574 class member access expression. */
7576 /* If something went wrong, we want to be able to discern that case,
7577 as opposed to the case where there was no SCOPE due to the type
7578 of expression being dependent. */
7581 /* If the SCOPE was erroneous, make the various semantic analysis
7582 functions exit quickly -- and without issuing additional error
7583 messages. */
7586 }
7587 }
7590 /* Tell cp_parser_lookup_name that there was an object, even though it's
7591 type-dependent. */
7594 /* Assume this expression is not a pseudo-destructor access. */
7597 /* If the SCOPE is a scalar type, then, if this is a valid program,
7598 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7599 is type dependent, it can be pseudo-destructor-name or something else.
7600 Try to parse it as pseudo-destructor-name first. */
7602 {
7603 tree s;
7604 tree type;
7607 /* Parse the pseudo-destructor-name. */
7616 {
7618 postfix_expression
7621 }
7622 }
7625 {
7626 /* If the SCOPE is not a scalar type, we are looking at an
7627 ordinary class member access expression, rather than a
7628 pseudo-destructor-name. */
7631 /* Parse the id-expression. */
7632 name = (cp_parser_id_expression
7639 /* In general, build a SCOPE_REF if the member name is qualified.
7640 However, if the name was not dependent and has already been
7641 resolved; there is no need to build the SCOPE_REF. For example;
7643 struct X { void f(); };
7644 template <typename T> void f(T* t) { t->X::f(); }
7646 Even though "t" is dependent, "X::f" is not and has been resolved
7647 to a BASELINK; there is no need to include scope information. */
7649 /* But we do need to remember that there was an explicit scope for
7650 virtual function calls. */
7654 /* If the name is a template-id that names a type, we will get a
7655 TYPE_DECL here. That is invalid code. */
7657 {
7660 }
7661 else
7662 {
7664 {
7666 {
7670 }
7671 else
7674 name,
7675 template_p);
7679 }
7681 adjust_result_of_qualified_name_lookup
7683 postfix_expression
7685 template_p,
7686 tf_warning_or_error);
7687 /* Build a location e.g.:
7688 ptr->access_expr
7689 ~~~^~~~~~~~~~~~~
7690 where the caret is at the deref token, ranging from
7691 the start of postfix_expression to the end of the access expr. */
7692 location_t end_loc
7694 location_t combined_loc
7697 }
7698 }
7700 /* We no longer need to look up names in the scope of the object on
7701 the left-hand side of the `.' or `->' operator. */
7704 /* Outside of offsetof, these operators may not appear in
7705 constant-expressions. */
7707 && (cp_parser_non_integral_constant_expression
7712 }
7714 /* Parse a parenthesized expression-list.
7716 expression-list:
7717 assignment-expression
7718 expression-list, assignment-expression
7720 attribute-list:
7721 expression-list
7722 identifier
7723 identifier, expression-list
7725 CAST_P is true if this expression is the target of a cast.
7727 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7728 argument pack.
7730 WRAP_LOCATIONS_P is true if expressions within this list for which
7731 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7732 their source locations.
7734 Returns a vector of trees. Each element is a representation of an
7735 assignment-expression. NULL is returned if the ( and or ) are
7736 missing. An empty, but allocated, vector is returned on no
7737 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7738 if we are parsing an attribute list for an attribute that wants a
7739 plain identifier argument, normal_attr for an attribute that wants
7740 an expression, or non_attr if we aren't parsing an attribute list. If
7741 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7742 not all of the expressions in the list were constant.
7743 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7744 will be written to with the location of the closing parenthesis. If
7745 an error occurs, it may or may not be written to. */
7755 {
7761 /* Assume all the expressions will be constant. */
7765 matching_parens parens;
7771 /* Within a parenthesized expression, a `>' token is always
7772 the greater-than operator. */
7773 saved_greater_than_is_operator_p
7779 /* Consume expressions until there are no more. */
7782 {
7783 /* At the beginning of attribute lists, check to see if the
7784 next token is an identifier. */
7787 {
7790 /* Consume the identifier. */
7792 /* Save the identifier. */
7794 }
7795 else
7796 {
7799 /* Parse the next assignment-expression. */
7801 {
7802 /* A braced-init-list. */
7808 }
7810 {
7811 expr = (cp_parser_constant_expression
7816 }
7817 else
7819 cast_p);
7824 /* If we have an ellipsis, then this is an expression
7825 expansion. */
7828 {
7829 /* Consume the `...'. */
7832 /* Build the argument pack. */
7834 }
7839 /* Add it to the list. We add error_mark_node
7840 expressions to the list, so that we can still tell if
7841 the correct form for a parenthesized expression-list
7842 is found. That gives better errors. */
7847 }
7849 /* After the first item, attribute lists look the same as
7850 expression lists. */
7853 get_comma:;
7854 /* If the next token isn't a `,', then we are done. */
7858 /* Otherwise, consume the `,' and keep going. */
7860 }
7866 {
7869 skip_comma:;
7870 /* We try and resync to an unnested comma, as that will give the
7871 user better diagnostics. */
7879 {
7880 parser->greater_than_is_operator_p
7883 }
7884 }
7886 parser->greater_than_is_operator_p
7893 }
7895 /* Parse a pseudo-destructor-name.
7897 pseudo-destructor-name:
7898 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7899 :: [opt] nested-name-specifier template template-id :: ~ type-name
7900 :: [opt] nested-name-specifier [opt] ~ type-name
7902 If either of the first two productions is used, sets *SCOPE to the
7903 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7904 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7905 or ERROR_MARK_NODE if the parse fails. */
7907 static void
7909 tree object,
7912 {
7915 /* Handle ~auto. */
7919 {
7922 "%<~auto%> only available with "
7929 }
7931 /* Assume that things will not work out. */
7934 /* Look for the optional `::' operator. */
7936 /* Look for the optional nested-name-specifier. */
7937 nested_name_specifier_p
7944 /* Now, if we saw a nested-name-specifier, we might be doing the
7945 second production. */
7948 {
7949 /* Consume the `template' keyword. */
7951 /* Parse the template-id. */
7955 class_type,
7957 /* Look for the `::' token. */
7959 }
7960 /* If the next token is not a `~', then there might be some
7961 additional qualification. */
7963 {
7964 /* At this point, we're looking for "type-name :: ~". The type-name
7965 must not be a class-name, since this is a pseudo-destructor. So,
7966 it must be either an enum-name, or a typedef-name -- both of which
7967 are just identifiers. So, we peek ahead to check that the "::"
7968 and "~" tokens are present; if they are not, then we can avoid
7969 calling type_name. */
7973 {
7976 }
7978 /* Look for the type-name. */
7983 /* Look for the `::' token. */
7985 }
7986 else
7989 /* Look for the `~'. */
7992 /* Once we see the ~, this has to be a pseudo-destructor. */
7996 /* Look for the type-name again. We are not responsible for
7997 checking that it matches the first type-name. */
7999 }
8001 /* Parse a unary-expression.
8003 unary-expression:
8004 postfix-expression
8005 ++ cast-expression
8006 -- cast-expression
8007 unary-operator cast-expression
8008 sizeof unary-expression
8009 sizeof ( type-id )
8010 alignof ( type-id ) [C++0x]
8011 new-expression
8012 delete-expression
8014 GNU Extensions:
8016 unary-expression:
8017 __extension__ cast-expression
8018 __alignof__ unary-expression
8019 __alignof__ ( type-id )
8020 alignof unary-expression [C++0x]
8021 __real__ cast-expression
8022 __imag__ cast-expression
8023 && identifier
8024 sizeof ( type-id ) { initializer-list , [opt] }
8025 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
8026 __alignof__ ( type-id ) { initializer-list , [opt] }
8028 ADDRESS_P is true iff the unary-expression is appearing as the
8029 operand of the `&' operator. CAST_P is true if this expression is
8030 the target of a cast.
8032 Returns a representation of the expression. */
8034 static cp_expr
8037 {
8041 /* Peek at the next token. */
8043 /* Some keywords give away the kind of expression. */
8045 {
8049 {
8052 {
8060 /* Consume the token. */
8062 /* Parse the operand. */
8068 else
8069 {
8070 /* ISO C++ defines alignof only with types, not with
8071 expressions. So pedwarn if alignof is used with a non-
8072 type expression. However, __alignof__ is ok. */
8075 "ISO C++ does not allow %<alignof%> "
8079 }
8080 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8081 SIZEOF_EXPR with the original operand. */
8083 {
8085 {
8087 {
8090 error_mark_node));
8092 }
8093 else
8097 }
8098 }
8100 /* Construct a location e.g. :
8101 alignof (expr)
8102 ^~~~~~~~~~~~~~
8103 with start == caret at the start of the "alignof"/"sizeof"
8104 token, with the endpoint at the final closing paren. */
8105 location_t finish_loc
8107 location_t compound_loc
8114 }
8126 {
8127 /* The saved value of the PEDANTIC flag. */
8129 tree expr;
8131 /* Save away the PEDANTIC flag. */
8133 /* Parse the cast-expression. */
8135 /* Restore the PEDANTIC flag. */
8139 }
8143 {
8144 tree expression;
8146 /* Consume the `__real__' or `__imag__' token. */
8148 /* Parse the cast-expression. */
8150 /* Create the complete representation. */
8154 expression,
8155 tf_warning_or_error);
8156 }
8164 {
8165 tree expr;
8174 matching_parens parens;
8178 parser->type_definition_forbidden_message
8181 saved_integral_constant_expression_p
8183 saved_non_integral_constant_expression_p
8187 saved_greater_than_is_operator_p
8199 parser->greater_than_is_operator_p
8202 parser->integral_constant_expression_p
8204 parser->non_integral_constant_expression_p
8209 location_t finish_loc
8213 /* Construct a location of the form:
8214 noexcept (expr)
8215 ^~~~~~~~~~~~~~~
8216 with start == caret, finishing at the close-paren. */
8217 location_t noexcept_loc
8221 noexcept_loc);
8222 }
8226 }
8227 }
8229 /* Look for the `:: new' and `:: delete', which also signal the
8230 beginning of a new-expression, or delete-expression,
8231 respectively. If the next token is `::', then it might be one of
8232 these. */
8234 {
8237 /* See if the token after the `::' is one of the keywords in
8238 which we're interested. */
8240 /* If it's `new', we have a new-expression. */
8243 /* Similarly, for `delete'. */
8246 }
8248 /* Look for a unary operator. */
8250 /* The `++' and `--' operators can be handled similarly, even though
8251 they are not technically unary-operators in the grammar. */
8253 {
8258 /* Handle the GNU address-of-label extension. */
8261 {
8262 tree identifier;
8263 tree expression;
8266 /* Consume the '&&' token. */
8268 /* Look for the identifier. */
8269 location_t finish_loc
8272 /* Construct a location of the form:
8273 &&label
8274 ^~~~~~~
8275 with caret==start at the "&&", finish at the end of the label. */
8276 location_t combined_loc
8278 /* Create an expression representing the address. */
8281 NIC_ADDR_LABEL))
8284 }
8285 }
8287 {
8288 cp_expr cast_expression;
8294 /* Consume the operator token. */
8298 /* Parse the cast-expression. */
8299 cast_expression
8304 pidk);
8306 /* Make a location:
8307 OP_TOKEN CAST_EXPRESSION
8308 ^~~~~~~~~~~~~~~~~~~~~~~~~
8309 with start==caret at the operator token, and
8310 extending to the end of the cast_expression. */
8313 /* Now, build an appropriate representation. */
8315 {
8319 RO_UNARY_STAR,
8320 complain);
8321 /* TODO: build_x_indirect_ref does not always honor the
8322 location, so ensure it is set. */
8328 /* Fall through. */
8331 cast_expression,
8332 complain);
8333 /* TODO: build_x_unary_op does not always honor the location,
8334 so ensure it is set. */
8342 /* Fall through. */
8344 /* Immediately fold negation of a constant, unless the constant is 0
8345 (since -0 == 0) or it would overflow. */
8350 {
8353 cast_expression);
8355 {
8358 }
8359 }
8360 /* Fall through. */
8369 }
8373 non_constant_p))
8377 }
8381 decltype_p,
8382 pidk);
8383 }
8385 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8386 unary-operator, the corresponding tree code is returned. */
8388 static enum tree_code
8390 {
8392 {
8413 }
8414 }
8416 /* Parse a __builtin_has_attribute([expr|type], attribute-spec) expression.
8417 Returns a representation of the expression. */
8419 static tree
8421 {
8424 /* Consume the __builtin_has_attribute token. */
8427 matching_parens parens;
8431 /* Types cannot be defined in a `sizeof' expression. Save away the
8432 old message. */
8434 /* And create the new one. */
8441 /* The restrictions on constant-expressions do not apply inside
8442 sizeof expressions. */
8443 bool saved_integral_constant_expression_p
8445 bool saved_non_integral_constant_expression_p
8449 /* Do not actually evaluate the expression. */
8455 /* We can't be sure yet whether we're looking at a type-id or an
8456 expression. */
8461 /* Look for the type-id. */
8467 /* If the type-id production did not work out, then we must be
8468 looking at the unary-expression production. */
8472 /* Go back to evaluating expressions. */
8476 /* Free the message we created. */
8478 /* And restore the old one. */
8480 parser->integral_constant_expression_p
8482 parser->non_integral_constant_expression_p
8485 /* Consume the comma if it's there. */
8487 {
8491 }
8493 /* Parse the attribute specification. */
8497 {
8499 {
8500 /* Fold constant expressions used in attributes first. */
8503 /* Finally, see if OPER has been declared with ATTR. */
8505 }
8508 }
8509 else
8510 {
8513 }
8515 /* Construct a location e.g. :
8516 __builtin_has_attribute (oper, attr)
8517 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
8518 with start == caret at the start of the built-in token,
8519 and with the endpoint at the final closing paren. */
8520 location_t finish_loc
8522 location_t compound_loc
8529 }
8531 /* Parse a new-expression.
8533 new-expression:
8534 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8535 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8537 Returns a representation of the expression. */
8539 static tree
8541 {
8544 tree type;
8547 tree ret;
8551 /* Look for the optional `::' operator. */
8552 global_scope_p
8556 /* Look for the `new' operator. */
8558 /* There's no easy way to tell a new-placement from the
8559 `( type-id )' construct. */
8561 /* Look for a new-placement. */
8563 /* If that didn't work out, there's no new-placement. */
8565 {
8569 }
8571 /* If the next token is a `(', then we have a parenthesized
8572 type-id. */
8574 {
8578 /* Consume the `('. */
8579 matching_parens parens;
8582 /* Parse the type-id. */
8583 parser->type_definition_forbidden_message
8585 {
8588 }
8591 /* Look for the closing `)'. */
8594 /* There should not be a direct-new-declarator in this production,
8595 but GCC used to allowed this, so we check and emit a sensible error
8596 message for this case. */
8598 {
8604 }
8605 }
8606 /* Otherwise, there must be a new-type-id. */
8607 else
8610 /* If the next token is a `(' or '{', then we have a new-initializer. */
8615 else
8618 /* A new-expression may not appear in an integral constant
8619 expression. */
8622 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8623 of a new-type-id or type-id of a new-expression, the new-expression shall
8624 contain a new-initializer of the form ( assignment-expression )".
8625 Additionally, consistently with the spirit of DR 1467, we want to accept
8626 'new auto { 2 }' too. */
8632 {
8634 "initialization of new-expression for type %<auto%> "
8637 }
8638 else
8639 {
8640 /* Construct a location e.g.:
8641 ptr = new int[100]
8642 ^~~~~~~~~~~~
8643 with caret == start at the start of the "new" token, and the end
8644 at the end of the final token we consumed. */
8649 /* Create a representation of the new-expression. */
8651 tf_warning_or_error);
8653 }
8661 }
8663 /* Parse a new-placement.
8665 new-placement:
8666 ( expression-list )
8668 Returns the same representation as for an expression-list. */
8672 {
8675 /* Parse the expression-list. */
8676 expression_list = (cp_parser_parenthesized_expression_list
8685 }
8687 /* Parse a new-type-id.
8689 new-type-id:
8690 type-specifier-seq new-declarator [opt]
8692 Returns the TYPE allocated. If the new-type-id indicates an array
8693 type, *NELTS is set to the number of elements in the last array
8694 bound; the TYPE will not include the last array bound. */
8696 static tree
8698 {
8699 cp_decl_specifier_seq type_specifier_seq;
8705 /* The type-specifier sequence must not contain type definitions.
8706 (It cannot contain declarations of new types either, but if they
8707 are not definitions we will catch that because they are not
8708 complete.) */
8710 parser->type_definition_forbidden_message
8712 /* Parse the type-specifier-seq. */
8716 /* Restore the old message. */
8722 /* Parse the new-declarator. */
8725 /* Determine the number of elements in the last array dimension, if
8726 any. */
8728 /* Skip down to the last array dimension. */
8733 {
8736 }
8741 {
8744 }
8747 {
8754 else
8756 }
8759 }
8761 /* Parse an (optional) new-declarator.
8763 new-declarator:
8764 ptr-operator new-declarator [opt]
8765 direct-new-declarator
8767 Returns the declarator. */
8771 {
8774 cp_cv_quals cv_quals;
8776 /* We don't know if there's a ptr-operator next, or not. */
8778 /* Look for a ptr-operator. */
8780 /* If that worked, look for more new-declarators. */
8782 {
8785 /* Parse another optional declarator. */
8788 declarator = cp_parser_make_indirect_declarator
8792 }
8794 /* If the next token is a `[', there is a direct-new-declarator. */
8799 }
8801 /* Parse a direct-new-declarator.
8803 direct-new-declarator:
8804 [ expression ]
8805 direct-new-declarator [constant-expression]
8807 */
8811 {
8815 {
8816 tree expression;
8819 /* Look for the opening `['. */
8824 /* The standard requires that the expression have integral
8825 type. DR 74 adds enumeration types. We believe that the
8826 real intent is that these expressions be handled like the
8827 expression in a `switch' condition, which also allows
8828 classes with a single conversion to integral or
8829 enumeration type. */
8831 {
8832 expression
8834 expression,
8837 {
8839 "expression in new-declarator must have integral "
8842 }
8843 }
8845 /* Look for the closing `]'. */
8848 /* Add this bound to the declarator. */
8851 /* If the next token is not a `[', then there are no more
8852 bounds. */
8855 }
8858 }
8860 /* Parse a new-initializer.
8862 new-initializer:
8863 ( expression-list [opt] )
8864 braced-init-list
8866 Returns a representation of the expression-list. */
8870 {
8874 {
8875 tree t;
8882 }
8883 else
8884 expression_list = (cp_parser_parenthesized_expression_list
8890 }
8892 /* Parse a delete-expression.
8894 delete-expression:
8895 :: [opt] delete cast-expression
8896 :: [opt] delete [ ] cast-expression
8898 Returns a representation of the expression. */
8900 static tree
8902 {
8905 tree expression;
8907 /* Look for the optional `::' operator. */
8908 global_scope_p
8912 /* Look for the `delete' keyword. */
8914 /* See if the array syntax is in use. */
8916 {
8917 /* Consume the `[' token. */
8919 /* Look for the `]' token. */
8921 /* Remember that this is the `[]' construct. */
8923 }
8924 else
8927 /* Parse the cast-expression. */
8930 /* A delete-expression may not appear in an integral constant
8931 expression. */
8936 tf_warning_or_error);
8937 }
8939 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8940 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8941 0 otherwise. */
8943 static int
8945 {
8948 {
8990 /* In ((type ()) () the last () isn't a valid cast-expression,
8991 so the whole must be parsed as postfix-expression. */
8996 /* '[' may start a primary-expression in obj-c++ and in C++11,
8997 as a lambda-expression, eg, '(void)[]{}'. */
9004 /* '++' and '--' may or may not start a cast-expression:
9006 struct T { void operator++(int); };
9007 void f() { (T())++; }
9009 vs
9011 int a;
9012 (int)++a; */
9017 }
9018 }
9020 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
9021 in the order: const_cast, static_cast, reinterpret_cast.
9023 Don't suggest dynamic_cast.
9025 Return the first legal cast kind found, or NULL otherwise. */
9029 {
9030 tree trial;
9032 /* Reuse the parser logic by attempting to build the various kinds of
9033 cast, with "complain" disabled.
9034 Identify the first such cast that is valid. */
9036 /* Don't attempt to run such logic within template processing. */
9040 /* First try const_cast. */
9045 /* If that fails, try static_cast. */
9050 /* Finally, try reinterpret_cast. */
9055 /* No such cast possible. */
9057 }
9059 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
9060 suggesting how to convert a C-style cast of the form:
9062 (DST_TYPE)ORIG_EXPR
9064 to a C++-style cast.
9066 The primary range of RICHLOC is asssumed to be that of the original
9067 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
9068 of the parens in the C-style cast. */
9070 static void
9073 tree dst_type)
9074 {
9075 /* This function is non-trivial, so bail out now if the warning isn't
9076 going to be emitted. */
9080 /* Try to find a legal C++ cast, trying them in order:
9081 const_cast, static_cast, reinterpret_cast. */
9086 /* Replace the open paren with "CAST_SUGGESTION<". */
9087 pretty_printer pp;
9091 /* Replace the close paren with "> (". */
9094 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
9096 }
9099 /* Parse a cast-expression.
9101 cast-expression:
9102 unary-expression
9103 ( type-id ) cast-expression
9105 ADDRESS_P is true iff the unary-expression is appearing as the
9106 operand of the `&' operator. CAST_P is true if this expression is
9107 the target of a cast.
9109 Returns a representation of the expression. */
9111 static cp_expr
9114 {
9115 /* If it's a `(', then we might be looking at a cast. */
9117 {
9123 /* There's no way to know yet whether or not this is a cast.
9124 For example, `(int (3))' is a unary-expression, while `(int)
9125 3' is a cast. So, we resort to parsing tentatively. */
9127 /* Types may not be defined in a cast. */
9129 parser->type_definition_forbidden_message
9131 /* Consume the `('. */
9132 matching_parens parens;
9137 /* A very tricky bit is that `(struct S) { 3 }' is a
9138 compound-literal (which we permit in C++ as an extension).
9139 But, that construct is not a cast-expression -- it is a
9140 postfix-expression. (The reason is that `(struct S) { 3 }.i'
9141 is legal; if the compound-literal were a cast-expression,
9142 you'd need an extra set of parentheses.) But, if we parse
9143 the type-id, and it happens to be a class-specifier, then we
9144 will commit to the parse at that point, because we cannot
9145 undo the action that is done when creating a new class. So,
9146 then we cannot back up and do a postfix-expression.
9148 Another tricky case is the following (c++/29234):
9150 struct S { void operator () (); };
9152 void foo ()
9153 {
9154 ( S()() );
9155 }
9157 As a type-id we parse the parenthesized S()() as a function
9158 returning a function, groktypename complains and we cannot
9159 back up in this case either.
9161 Therefore, we scan ahead to the closing `)', and check to see
9162 if the tokens after the `)' can start a cast-expression. Otherwise
9163 we are dealing with an unary-expression, a postfix-expression
9164 or something else.
9166 Yet another tricky case, in C++11, is the following (c++/54891):
9168 (void)[]{};
9170 The issue is that usually, besides the case of lambda-expressions,
9171 the parenthesized type-id cannot be followed by '[', and, eg, we
9172 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
9173 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
9174 we don't commit, we try a cast-expression, then an unary-expression.
9176 Save tokens so that we can put them back. */
9179 /* We may be looking at a cast-expression. */
9182 cast_expression
9185 /* Roll back the tokens we skipped. */
9187 /* If we aren't looking at a cast-expression, simulate an error so
9188 that the call to cp_parser_error_occurred below returns true. */
9191 else
9192 {
9195 /* Look for the type-id. */
9197 /* Look for the closing `)'. */
9202 }
9204 /* Restore the saved message. */
9207 /* At this point this can only be either a cast or a
9208 parenthesized ctor such as `(T ())' that looks like a cast to
9209 function returning T. */
9211 {
9212 /* Only commit if the cast-expression doesn't start with
9213 '++', '--', or '[' in C++11. */
9221 pidk);
9224 {
9225 /* Warn about old-style casts, if so requested. */
9230 {
9236 }
9238 /* Only type conversions to integral or enumeration types
9239 can be used in constant-expressions. */
9242 NIC_CAST))
9245 /* Perform the cast. */
9246 /* Make a location:
9247 (TYPE) EXPR
9248 ^~~~~~~~~~~
9249 with start==caret at the open paren, extending to the
9250 end of "expr". */
9252 open_paren_loc,
9256 }
9257 }
9258 else
9260 }
9262 /* If we get here, then it's not a cast, so it must be a
9263 unary-expression. */
9266 }
9268 /* Parse a binary expression of the general form:
9270 pm-expression:
9271 cast-expression
9272 pm-expression .* cast-expression
9273 pm-expression ->* cast-expression
9275 multiplicative-expression:
9276 pm-expression
9277 multiplicative-expression * pm-expression
9278 multiplicative-expression / pm-expression
9279 multiplicative-expression % pm-expression
9281 additive-expression:
9282 multiplicative-expression
9283 additive-expression + multiplicative-expression
9284 additive-expression - multiplicative-expression
9286 shift-expression:
9287 additive-expression
9288 shift-expression << additive-expression
9289 shift-expression >> additive-expression
9291 relational-expression:
9292 shift-expression
9293 relational-expression < shift-expression
9294 relational-expression > shift-expression
9295 relational-expression <= shift-expression
9296 relational-expression >= shift-expression
9298 GNU Extension:
9300 relational-expression:
9301 relational-expression <? shift-expression
9302 relational-expression >? shift-expression
9304 equality-expression:
9305 relational-expression
9306 equality-expression == relational-expression
9307 equality-expression != relational-expression
9309 and-expression:
9310 equality-expression
9311 and-expression & equality-expression
9313 exclusive-or-expression:
9314 and-expression
9315 exclusive-or-expression ^ and-expression
9317 inclusive-or-expression:
9318 exclusive-or-expression
9319 inclusive-or-expression | exclusive-or-expression
9321 logical-and-expression:
9322 inclusive-or-expression
9323 logical-and-expression && inclusive-or-expression
9325 logical-or-expression:
9326 logical-and-expression
9327 logical-or-expression || logical-and-expression
9329 All these are implemented with a single function like:
9331 binary-expression:
9332 simple-cast-expression
9333 binary-expression <token> binary-expression
9335 CAST_P is true if this expression is the target of a cast.
9337 The binops_by_token map is used to get the tree codes for each <token> type.
9338 binary-expressions are associated according to a precedence table. */
9340 #define TOKEN_PRECEDENCE(token) \
9341 (((token->type == CPP_GREATER \
9342 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9343 && !parser->greater_than_is_operator_p) \
9344 ? PREC_NOT_OPERATOR \
9345 : binops_by_token[token->type].prec)
9347 static cp_expr
9353 {
9354 cp_parser_expression_stack stack;
9356 cp_parser_expression_stack_entry current;
9357 cp_expr rhs;
9361 tree overload;
9363 /* Parse the first expression. */
9374 {
9375 /* Get an operator token. */
9381 {
9383 "%<>>%> operator is treated"
9387 }
9392 /* This is a fold-expression; handle it later. */
9395 /* Popping an entry off the stack means we completed a subexpression:
9396 - either we found a token which is not an operator (`>' where it is not
9397 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9398 will happen repeatedly;
9399 - or, we found an operator which has lower priority. This is the case
9400 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9401 parsing `3 * 4'. */
9403 {
9406 else
9408 }
9410 get_rhs:
9414 /* We used the operator token. */
9417 /* For "false && x" or "true || x", x will never be executed;
9418 disable warnings while evaluating it. */
9420 c_inhibit_evaluation_warnings +=
9423 c_inhibit_evaluation_warnings +=
9426 /* Extract another operand. It may be the RHS of this expression
9427 or the LHS of a new, higher priority expression. */
9432 /* Get another operator token. Look up its precedence to avoid
9433 building a useless (immediately popped) stack entry for common
9434 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9441 {
9442 /* ... and prepare to parse the RHS of the new, higher priority
9443 expression. Since precedence levels on the stack are
9444 monotonically increasing, we do not have to care about
9445 stack overflows. */
9454 pop:
9456 /* If the stack is not empty, we have parsed into LHS the right side
9457 (`4' in the example above) of an expression we had suspended.
9458 We can use the information on the stack to recover the LHS (`3')
9459 from the stack together with the tree code (`MULT_EXPR'), and
9460 the precedence of the higher level subexpression
9461 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9462 which will be used to actually build the additive expression. */
9467 }
9469 /* Undo the disabling of warnings done above. */
9471 c_inhibit_evaluation_warnings -=
9474 c_inhibit_evaluation_warnings -=
9480 /* Avoid warning for !!x == y. */
9485 /* Avoid warning for !b == y where b is boolean. */
9489 /* Avoid warning for !!b == y where b is boolean. */
9502 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9503 ERROR_MARK for everything that is not a binary expression.
9504 This makes warn_about_parentheses miss some warnings that
9505 involve unary operators. For unary expressions we should
9506 pass the correct tree_code unless the unary expression was
9507 surrounded by parentheses.
9508 */
9512 {
9515 else
9516 {
9517 current.lhs
9520 == tcc_comparison
9524 }
9525 }
9526 else
9527 {
9532 /* TODO: build_x_binary_op doesn't always honor the location. */
9534 }
9537 /* If the binary operator required the use of an overloaded operator,
9538 then this expression cannot be an integral constant-expression.
9539 An overloaded operator can be used even if both operands are
9540 otherwise permissible in an integral constant-expression if at
9541 least one of the operands is of enumeration type. */
9545 NIC_OVERLOADED))
9547 }
9550 }
9552 static cp_expr
9557 {
9560 }
9562 /* Parse the `? expression : assignment-expression' part of a
9563 conditional-expression. The LOGICAL_OR_EXPR is the
9564 logical-or-expression that started the conditional-expression.
9565 Returns a representation of the entire conditional-expression.
9567 This routine is used by cp_parser_assignment_expression.
9569 ? expression : assignment-expression
9571 GNU Extensions:
9573 ? : assignment-expression */
9575 static tree
9577 {
9579 cp_expr assignment_expr;
9583 /* Consume the `?' token. */
9588 {
9591 /* Implicit true clause. */
9593 c_inhibit_evaluation_warnings +=
9596 }
9597 else
9598 {
9601 /* Parse the expression. */
9602 c_inhibit_evaluation_warnings +=
9605 c_inhibit_evaluation_warnings +=
9609 }
9611 /* The next token should be a `:'. */
9613 /* Parse the assignment-expression. */
9615 c_inhibit_evaluation_warnings -=
9618 /* Make a location:
9619 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9620 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9621 with the caret at the "?", ranging from the start of
9622 the logical_or_expr to the end of the assignment_expr. */
9627 /* Build the conditional-expression. */
9629 expr,
9630 assignment_expr,
9631 tf_warning_or_error);
9632 }
9634 /* Parse an assignment-expression.
9636 assignment-expression:
9637 conditional-expression
9638 logical-or-expression assignment-operator assignment_expression
9639 throw-expression
9641 CAST_P is true if this expression is the target of a cast.
9642 DECLTYPE_P is true if this expression is the operand of decltype.
9644 Returns a representation for the expression. */
9646 static cp_expr
9649 {
9650 cp_expr expr;
9652 /* If the next token is the `throw' keyword, then we're looking at
9653 a throw-expression. */
9656 /* Otherwise, it must be that we are looking at a
9657 logical-or-expression. */
9658 else
9659 {
9660 /* Parse the binary expressions (logical-or-expression). */
9662 decltype_p,
9664 /* If the next token is a `?' then we're actually looking at a
9665 conditional-expression. */
9668 else
9669 {
9672 /* If it's an assignment-operator, we're using the second
9673 production. */
9674 enum tree_code assignment_operator
9677 {
9680 /* Parse the right-hand side of the assignment. */
9687 /* An assignment may not appear in a
9688 constant-expression. */
9690 NIC_ASSIGNMENT))
9692 /* Build the assignment expression. Its default
9693 location:
9694 LHS = RHS
9695 ~~~~^~~~~
9696 is the location of the '=' token as the
9697 caret, ranging from the start of the lhs to the
9698 end of the rhs. */
9703 assignment_operator,
9704 rhs,
9706 /* TODO: build_x_modify_expr doesn't honor the location,
9707 so we must set it here. */
9709 }
9710 }
9711 }
9714 }
9716 /* Parse an (optional) assignment-operator.
9718 assignment-operator: one of
9719 = *= /= %= += -= >>= <<= &= ^= |=
9721 GNU Extension:
9723 assignment-operator: one of
9724 <?= >?=
9726 If the next token is an assignment operator, the corresponding tree
9727 code is returned, and the token is consumed. For example, for
9728 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9729 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9730 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9731 operator, ERROR_MARK is returned. */
9733 static enum tree_code
9735 {
9739 /* Peek at the next token. */
9743 {
9789 /* Nothing else is an assignment operator. */
9791 }
9793 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9798 /* If it was an assignment operator, consume it. */
9803 }
9805 /* Parse an expression.
9807 expression:
9808 assignment-expression
9809 expression , assignment-expression
9811 CAST_P is true if this expression is the target of a cast.
9812 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9813 except possibly parenthesized or on the RHS of a comma (N3276).
9815 Returns a representation of the expression. */
9817 static cp_expr
9820 {
9825 {
9826 cp_expr assignment_expression;
9828 /* Parse the next assignment-expression. */
9829 assignment_expression
9832 /* We don't create a temporary for a call that is the immediate operand
9833 of decltype or on the RHS of a comma. But when we see a comma, we
9834 need to create a temporary for a call on the LHS. */
9839 assignment_expression
9843 /* If this is the first assignment-expression, we can just
9844 save it away. */
9847 else
9848 {
9849 /* Create a location with caret at the comma, ranging
9850 from the start of the LHS to the end of the RHS. */
9855 assignment_expression,
9858 }
9859 /* If the next token is not a comma, or we're in a fold-expression, then
9860 we are done with the expression. */
9864 /* Consume the `,'. */
9867 /* A comma operator cannot appear in a constant-expression. */
9870 }
9873 }
9875 /* Parse a constant-expression.
9877 constant-expression:
9878 conditional-expression
9880 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9881 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9882 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9883 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9884 only parse a conditional-expression, otherwise parse an
9885 assignment-expression. See below for rationale. */
9887 static cp_expr
9892 {
9896 cp_expr expression;
9898 /* It might seem that we could simply parse the
9899 conditional-expression, and then check to see if it were
9900 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9901 one that the compiler can figure out is constant, possibly after
9902 doing some simplifications or optimizations. The standard has a
9903 precise definition of constant-expression, and we must honor
9904 that, even though it is somewhat more restrictive.
9906 For example:
9908 int i[(2, 3)];
9910 is not a legal declaration, because `(2, 3)' is not a
9911 constant-expression. The `,' operator is forbidden in a
9912 constant-expression. However, GCC's constant-folding machinery
9913 will fold this operation to an INTEGER_CST for `3'. */
9915 /* Save the old settings. */
9917 saved_allow_non_integral_constant_expression_p
9920 /* We are now parsing a constant-expression. */
9922 parser->allow_non_integral_constant_expression_p
9925 /* Although the grammar says "conditional-expression", when not STRICT_P,
9926 we parse an "assignment-expression", which also permits
9927 "throw-expression" and the use of assignment operators. In the case
9928 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9929 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9930 actually essential that we look for an assignment-expression.
9931 For example, cp_parser_initializer_clauses uses this function to
9932 determine whether a particular assignment-expression is in fact
9933 constant. */
9935 {
9936 /* Parse the binary expressions (logical-or-expression). */
9939 /* If the next token is a `?' then we're actually looking at
9940 a conditional-expression; otherwise we're done. */
9943 }
9944 else
9946 /* Restore the old settings. */
9947 parser->integral_constant_expression_p
9949 parser->allow_non_integral_constant_expression_p
9952 {
9953 /* Require an rvalue constant expression here; that's what our
9954 callers expect. Reference constant expressions are handled
9955 separately in e.g. cp_parser_template_argument. */
9964 }
9967 parser->non_integral_constant_expression_p
9971 }
9973 /* Parse __builtin_offsetof.
9975 offsetof-expression:
9976 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9978 offsetof-member-designator:
9979 id-expression
9980 | offsetof-member-designator "." id-expression
9981 | offsetof-member-designator "[" expression "]"
9982 | offsetof-member-designator "->" id-expression */
9984 static cp_expr
9986 {
9988 tree type;
9989 cp_expr expr;
9990 cp_id_kind dummy;
9992 location_t finish_loc;
9994 /* We're about to accept non-integral-constant things, but will
9995 definitely yield an integral constant expression. Save and
9996 restore these values around our local parsing. */
10002 /* Consume the "__builtin_offsetof" token. */
10004 /* Consume the opening `('. */
10005 matching_parens parens;
10007 /* Parse the type-id. */
10009 {
10011 parser->type_definition_forbidden_message
10015 }
10016 /* Look for the `,'. */
10020 /* Build the (type *)null that begins the traditional offsetof macro. */
10021 tree object_ptr
10023 tf_warning_or_error);
10025 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
10029 {
10032 {
10034 /* offsetof-member-designator "[" expression "]" */
10040 /* offsetof-member-designator "->" identifier */
10043 /* FALLTHRU */
10046 /* offsetof-member-designator "." identifier */
10054 /* Consume the ")" token. */
10060 /* Error. We know the following require will fail, but
10061 that gives the proper error message. */
10066 }
10067 }
10069 success:
10070 /* Make a location of the form:
10071 __builtin_offsetof (struct s, f)
10072 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
10073 with caret at the type-id, ranging from the start of the
10074 "_builtin_offsetof" token to the close paren. */
10076 /* The result will be an INTEGER_CST, so we need to explicitly
10077 preserve the location. */
10080 failure:
10086 }
10088 /* Parse a trait expression.
10090 Returns a representation of the expression, the underlying type
10091 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
10093 static cp_expr
10095 {
10096 cp_trait_kind kind;
10102 {
10204 }
10206 /* Get location of initial token. */
10209 /* Consume the token. */
10212 matching_parens parens;
10215 {
10218 }
10224 {
10227 {
10230 }
10234 }
10236 {
10238 {
10242 {
10245 }
10249 }
10250 }
10255 /* Construct a location of the form:
10256 __is_trivially_copyable(_Tp)
10257 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10258 with start == caret, finishing at the close-paren. */
10261 /* Complete the trait expression, which may mean either processing
10262 the trait expr now or saving it for template instantiation. */
10264 {
10273 }
10274 }
10276 /* Parse a lambda expression.
10278 lambda-expression:
10279 lambda-introducer lambda-declarator [opt] compound-statement
10281 Returns a representation of the expression. */
10283 static cp_expr
10285 {
10287 tree type;
10297 {
10299 {
10301 "lambda-expression in unevaluated context"
10304 }
10306 }
10308 {
10310 {
10314 }
10316 }
10318 /* We may be in the middle of deferred access check. Disable
10319 it now. */
10332 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10335 /* Now that we've started the type, add the capture fields for any
10336 explicit captures. */
10339 {
10340 /* Inside the class, surrounding template-parameter-lists do not apply. */
10341 unsigned int saved_num_template_parameter_lists
10345 bool fully_implicit_function_template_p
10349 bool auto_is_implicit_function_template_parm_p
10360 /* By virtue of defining a local class, a lambda expression has access to
10361 the private variables of enclosing classes. */
10372 {
10374 }
10376 {
10379 }
10381 /* The capture list was built up in reverse order; fix that now. */
10393 parser->fully_implicit_function_template_p
10397 parser->auto_is_implicit_function_template_parm_p
10399 }
10401 /* This field is only used during parsing of the lambda. */
10404 /* This lambda shouldn't have any proxies left at this point. */
10406 /* And now that we're done, push proxies for an enclosing lambda. */
10409 /* Update the lambda expression to a range. */
10417 else
10425 }
10427 /* Parse the beginning of a lambda expression.
10429 lambda-introducer:
10430 [ lambda-capture [opt] ]
10432 LAMBDA_EXPR is the current representation of the lambda expression. */
10434 static void
10436 {
10437 /* Need commas after the first capture. */
10440 /* Eat the leading `['. */
10443 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10451 {
10457 }
10460 {
10462 tree capture_id;
10463 tree capture_init_expr;
10467 enum capture_kind_type
10468 {
10469 BY_COPY,
10470 BY_REFERENCE
10471 };
10475 {
10478 }
10482 else
10485 /* Possibly capture `this'. */
10487 {
10498 explicit_init_p);
10500 }
10502 /* Possibly capture `*this'. */
10505 {
10516 explicit_init_p);
10518 }
10522 {
10529 }
10531 /* Remember whether we want to capture as a reference or not. */
10533 {
10536 }
10538 /* Get the identifier. */
10543 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10544 delimiters, but I modified this to stop on unnested ']' as well. It
10545 was already changed to stop on unnested '}', so the
10546 "closing_parenthesis" name is no more misleading with my change. */
10547 {
10553 }
10555 /* Find the initializer for this capture. */
10559 {
10561 /* An explicit initializer exists. */
10564 "lambda capture initializers "
10570 {
10573 }
10576 }
10577 else
10578 {
10581 /* Turn the identifier into an id-expression. */
10582 capture_init_expr
10587 {
10590 }
10593 {
10596 capture_init_expr);
10601 }
10604 {
10607 capture_init_expr))
10611 }
10613 capture_init_expr
10614 = finish_id_expression
10616 capture_init_expr,
10630 {
10633 }
10634 }
10638 {
10643 capture_id);
10647 "capture of %qD redundant with by-reference capture "
10649 }
10652 capture_id,
10653 capture_init_expr,
10655 explicit_init_p);
10657 /* If there is any qualification still in effect, clear it
10658 now; we will be starting fresh with the next capture. */
10662 }
10665 }
10667 /* Parse the (optional) middle of a lambda expression.
10669 lambda-declarator:
10670 < template-parameter-list [opt] >
10671 ( parameter-declaration-clause [opt] )
10672 attribute-specifier [opt]
10673 decl-specifier-seq [opt]
10674 exception-specification [opt]
10675 lambda-return-type-clause [opt]
10677 LAMBDA_EXPR is the current representation of the lambda expression. */
10679 static bool
10681 {
10682 /* 5.1.1.4 of the standard says:
10683 If a lambda-expression does not include a lambda-declarator, it is as if
10684 the lambda-declarator were ().
10685 This means an empty parameter list, no attributes, and no exception
10686 specification. */
10693 cp_decl_specifier_seq lambda_specs;
10696 /* The template-parameter-list is optional, but must begin with
10697 an opening angle if present. */
10699 {
10702 "lambda templates are only available with "
10706 "lambda templates are only available with "
10715 /* We just processed one more parameter list. */
10717 }
10719 /* The parameter-declaration-clause is optional (unless
10720 template-parameter-list was given), but must begin with an
10721 opening parenthesis if present. */
10723 {
10724 matching_parens parens;
10729 /* Parse parameters. */
10732 /* Default arguments shall not be specified in the
10733 parameter-declaration-clause of a lambda-declarator. */
10742 /* In the decl-specifier-seq of the lambda-declarator, each
10743 decl-specifier shall either be mutable or constexpr. */
10747 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10750 {
10755 }
10759 /* Parse optional exception specification. */
10764 /* Parse optional trailing return type. */
10766 {
10769 }
10771 /* The function parameters must be in scope all the way until after the
10772 trailing-return-type in case of decltype. */
10774 }
10778 /* Create the function call operator.
10780 Messing with declarators like this is no uglier than building up the
10781 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10782 other code. */
10783 {
10784 cp_decl_specifier_seq return_type_specs;
10786 tree fco;
10794 {
10798 else
10801 }
10811 VIRT_SPEC_UNSPECIFIED,
10812 REF_QUAL_NONE,
10813 tx_qual,
10814 exception_spec,
10815 return_type,
10820 declarator,
10821 NULL_TREE);
10823 {
10826 /* Give the object parameter a different name. */
10829 }
10831 {
10835 }
10844 }
10845 }
10847 /* Parse the body of a lambda expression, which is simply
10849 compound-statement
10851 but which requires special handling.
10852 LAMBDA_EXPR is the current representation of the lambda expression. */
10854 static void
10856 {
10861 /* The body of a lambda-expression is not a subexpression of the enclosing
10862 expression. */
10863 cp_evaluated ev;
10867 else
10868 /* Still increment function_depth so that we don't GC in the
10869 middle of an expression. */
10874 /* Clear this in case we're in the middle of a default argument. */
10878 {
10882 matching_braces braces;
10885 {
10888 /* Originally C++11 required us to peek for 'return expr'; and
10889 process it specially here to deduce the return type. N3638
10890 removed the need for that. */
10898 }
10901 }
10908 else
10910 }
10912 /* Statements [gram.stmt.stmt] */
10914 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10916 static void
10918 {
10922 /* A concept is never expanded normally. */
10928 }
10930 /* Parse a statement.
10932 statement:
10933 labeled-statement
10934 expression-statement
10935 compound-statement
10936 selection-statement
10937 iteration-statement
10938 jump-statement
10939 declaration-statement
10940 try-block
10942 C++11:
10944 statement:
10945 labeled-statement
10946 attribute-specifier-seq (opt) expression-statement
10947 attribute-specifier-seq (opt) compound-statement
10948 attribute-specifier-seq (opt) selection-statement
10949 attribute-specifier-seq (opt) iteration-statement
10950 attribute-specifier-seq (opt) jump-statement
10951 declaration-statement
10952 attribute-specifier-seq (opt) try-block
10954 init-statement:
10955 expression-statement
10956 simple-declaration
10958 TM Extension:
10960 statement:
10961 atomic-statement
10963 IN_COMPOUND is true when the statement is nested inside a
10964 cp_parser_compound_statement; this matters for certain pragmas.
10966 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10967 is a (possibly labeled) if statement which is not enclosed in braces
10968 and has an else clause. This is used to implement -Wparentheses.
10970 CHAIN is a vector of if-else-if conditions. */
10972 static void
10976 {
10981 restart:
10984 /* There is no statement yet. */
10990 /* In obj-c++, seeing '[[' might be the either the beginning of
10991 c++11 attributes, or a nested objc-message-expression. So
10992 let's parse the c++11 attributes tentatively. */
10996 {
10999 }
11001 /* Peek at the next token. */
11003 /* Remember the location of the first token in the statement. */
11007 /* If this is a keyword, then that will often determine what kind of
11008 statement we have. */
11010 {
11014 {
11017 /* Looks like a labeled-statement with a case label.
11018 Parse the label, and then use tail recursion to parse
11019 the statement. */
11045 /* Objective-C++ exception-handling constructs. */
11061 /* This must be a namespace alias definition. */
11063 {
11064 /* Attributes should be parsed as part of the the
11065 declaration, so let's un-parse them. */
11068 }
11086 /* It might be a keyword like `int' that can start a
11087 declaration-statement. */
11089 }
11090 }
11092 {
11093 /* If the next token is a `:', then we are looking at a
11094 labeled-statement. */
11097 {
11098 /* Looks like a labeled-statement with an ordinary label.
11099 Parse the label, and then use tail recursion to parse
11100 the statement. */
11105 }
11106 }
11107 /* Anything that starts with a `{' must be a compound-statement. */
11110 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
11111 a statement all its own. */
11113 {
11114 /* Only certain OpenMP pragmas are attached to statements, and thus
11115 are considered statements themselves. All others are not. In
11116 the context of a compound, accept the pragma as a "statement" and
11117 return so that we can check for a close brace. Otherwise we
11118 require a real statement and must go back and read one. */
11124 }
11126 {
11129 }
11131 /* Everything else must be a declaration-statement or an
11132 expression-statement. Try for the declaration-statement
11133 first, unless we are looking at a `;', in which case we know that
11134 we have an expression-statement. */
11136 {
11138 {
11140 /* Attributes should be parsed as part of the declaration,
11141 so let's un-parse them. */
11145 /* Try to parse the declaration-statement. */
11147 /* If that worked, we're done. */
11150 /* It didn't work, restore the post-attribute position. */
11153 }
11154 /* All preceding labels have been parsed at this point. */
11160 /* Look for an expression-statement instead. */
11163 /* Handle [[fallthrough]];. */
11165 {
11166 /* The next token after the fallthrough attribute is ';'. */
11168 {
11169 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11171 IFN_FALLTHROUGH,
11174 }
11175 else
11179 }
11180 }
11182 /* Set the line number for the statement. */
11186 /* Allow "[[fallthrough]];", but warn otherwise. */
11189 OPT_Wattributes,
11191 }
11193 /* Append ATTR to attribute list ATTRS. */
11195 static tree
11197 {
11203 }
11205 /* Parse the label for a labeled-statement, i.e.
11207 identifier :
11208 case constant-expression :
11209 default :
11211 GNU Extension:
11212 case constant-expression ... constant-expression : statement
11214 When a label is parsed without errors, the label is added to the
11215 parse tree by the finish_* functions, so this function doesn't
11216 have to return the label. */
11218 static void
11220 {
11225 /* The next token should be an identifier. */
11229 {
11232 }
11234 /* Remember whether this case or a user-defined label is allowed to fall
11235 through to. */
11240 {
11242 {
11246 /* Consume the `case' token. */
11248 /* Parse the constant-expression. */
11255 {
11256 /* Consume the `...' token. */
11262 /* We don't need to emit warnings here, as the common code
11263 will do this for us. */
11264 }
11265 else
11269 {
11272 {
11275 }
11276 }
11277 else
11280 expr);
11281 }
11285 /* Consume the `default' token. */
11289 {
11292 {
11295 }
11296 }
11297 else
11302 /* Anything else must be an ordinary label. */
11307 }
11309 /* Require the `:' token. */
11312 /* An ordinary label may optionally be followed by attributes.
11313 However, this is only permitted if the attributes are then
11314 followed by a semicolon. This is because, for backward
11315 compatibility, when parsing
11316 lab: __attribute__ ((unused)) int i;
11317 we want the attribute to attach to "i", not "lab". */
11320 {
11321 tree attrs;
11325 /* And fallthrough always binds to the expression-statement. */
11330 ;
11331 else
11333 }
11339 }
11341 /* Parse an expression-statement.
11343 expression-statement:
11344 expression [opt] ;
11346 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11347 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11348 indicates whether this expression-statement is part of an
11349 expression statement. */
11351 static tree
11353 {
11358 /* There might be attribute fallthrough. */
11361 /* If the next token is a ';', then there is no expression
11362 statement. */
11364 {
11368 {
11371 }
11372 }
11374 /* Handle [[fallthrough]];. */
11376 {
11377 /* The next token after the fallthrough attribute is ';'. */
11379 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11382 else
11386 }
11388 /* Allow "[[fallthrough]];", but warn otherwise. */
11393 /* Give a helpful message for "A<T>::type t;" and the like. */
11396 {
11403 {
11404 /* A::A a; */
11409 }
11410 }
11412 /* Consume the final `;'. */
11417 /* This is the final expression statement of a statement
11418 expression. */
11424 }
11426 /* Parse a compound-statement.
11428 compound-statement:
11429 { statement-seq [opt] }
11431 GNU extension:
11433 compound-statement:
11434 { label-declaration-seq [opt] statement-seq [opt] }
11436 label-declaration-seq:
11437 label-declaration
11438 label-declaration-seq label-declaration
11440 Returns a tree representing the statement. */
11442 static tree
11445 {
11446 tree compound_stmt;
11447 matching_braces braces;
11449 /* Consume the `{'. */
11456 /* Begin the compound-statement. */
11458 /* If the next keyword is `__label__' we have a label declaration. */
11461 /* Parse an (optional) statement-seq. */
11463 /* Finish the compound-statement. */
11465 /* Consume the `}'. */
11469 }
11471 /* Parse an (optional) statement-seq.
11473 statement-seq:
11474 statement
11475 statement-seq [opt] statement */
11477 static void
11479 {
11480 /* Scan statements until there aren't any more. */
11482 {
11485 /* If we are looking at a `}', then we have run out of
11486 statements; the same is true if we have reached the end
11487 of file, or have stumbled upon a stray '@end'. */
11494 /* If we are in a compound statement and find 'else' then
11495 something went wrong. */
11497 {
11500 else
11501 {
11504 }
11505 }
11507 /* Parse the statement. */
11509 }
11510 }
11512 /* Return true if this is the C++20 version of range-based-for with
11513 init-statement. */
11515 static bool
11517 {
11520 /* Save tokens so that we can put them back. */
11523 /* There has to be an unnested ; followed by an unnested :. */
11526 CPP_SEMICOLON,
11530 /* We found the semicolon, eat it now. */
11533 /* Now look for ':' that is not nested in () or {}. */
11536 CPP_COLON,
11539 out:
11540 /* Roll back the tokens we skipped. */
11544 }
11546 /* Return true if we're looking at (init; cond), false otherwise. */
11548 static bool
11550 {
11551 /* Save tokens so that we can put them back. */
11554 /* Look for ';' that is not nested in () or {}. */
11557 CPP_SEMICOLON,
11560 /* Roll back the tokens we skipped. */
11564 }
11566 /* Parse a selection-statement.
11568 selection-statement:
11569 if ( init-statement [opt] condition ) statement
11570 if ( init-statement [opt] condition ) statement else statement
11571 switch ( init-statement [opt] condition ) statement
11573 Returns the new IF_STMT or SWITCH_STMT.
11575 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11576 is a (possibly labeled) if statement which is not enclosed in
11577 braces and has an else clause. This is used to implement
11578 -Wparentheses.
11580 CHAIN is a vector of if-else-if conditions. This is used to implement
11581 -Wduplicated-cond. */
11583 static tree
11586 {
11589 token_indent_info guard_tinfo;
11594 /* Peek at the next token. */
11598 /* See what kind of keyword it is. */
11601 {
11604 {
11605 tree statement;
11606 tree condition;
11611 RID_CONSTEXPR))
11612 {
11618 }
11620 /* Look for the `('. */
11621 matching_parens parens;
11623 {
11626 }
11628 /* Begin the selection-statement. */
11630 {
11633 }
11634 else
11637 /* Parse the optional init-statement. */
11639 {
11640 tree decl;
11643 "init-statement in selection statements only available "
11646 }
11648 /* Parse the condition. */
11650 /* Look for the `)'. */
11656 {
11660 /* Add the condition. */
11667 /* Parse the then-clause. */
11671 /* Outside a template, the non-selected branch of a constexpr
11672 if is a 'discarded statement', i.e. unevaluated. */
11677 {
11680 }
11683 guard_tinfo);
11690 {
11694 }
11696 /* If the next token is `else', parse the else-clause. */
11698 RID_ELSE))
11699 {
11703 {
11706 }
11708 guard_tinfo
11710 /* Consume the `else' keyword. */
11713 {
11715 RID_IF)
11717 {
11718 /* We've got "if (COND) else if (COND2)". Start
11719 the condition chain and add COND as the first
11720 element. */
11724 {
11725 /* Wrap it in a NOP_EXPR so that we can set the
11726 location of the condition. */
11728 condition);
11731 }
11732 }
11734 RID_IF))
11735 {
11736 /* This is if-else without subsequent if. Zap the
11737 condition chain; we would have already warned at
11738 this point. */
11741 }
11742 }
11744 /* Parse the else-clause. */
11750 /* If we are currently parsing a then-clause, then
11751 IF_P will not be NULL. We set it to true to
11752 indicate that this if statement has an else clause.
11753 This may trigger the Wparentheses warning below
11754 when we get back up to the parent if statement. */
11759 {
11763 }
11764 }
11765 else
11766 {
11767 /* This if statement does not have an else clause. If
11768 NESTED_IF is true, then the then-clause has an if
11769 statement which does have an else clause. We warn
11770 about the potential ambiguity. */
11773 "suggest explicit braces to avoid ambiguous"
11776 {
11777 /* We don't need the condition chain anymore. */
11780 }
11781 }
11783 /* Now we're all done with the if-statement. */
11785 }
11786 else
11787 {
11791 /* Add the condition. */
11794 /* Parse the body of the switch-statement. */
11800 guard_tinfo);
11804 /* Now we're all done with the switch-statement. */
11806 }
11809 }
11815 }
11816 }
11818 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
11819 If we have seen at least one decl-specifier, and the next token
11820 is not a parenthesis, then we must be looking at a declaration.
11821 (After "int (" we might be looking at a functional cast.) */
11823 static void
11826 {
11832 }
11834 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
11835 The declarator shall not specify a function or an array. Returns
11836 TRUE if the declarator is valid, FALSE otherwise. */
11838 static bool
11841 location_t loc)
11842 {
11846 {
11851 else
11859 }
11860 else
11862 }
11864 /* Parse a condition.
11866 condition:
11867 expression
11868 type-specifier-seq declarator = initializer-clause
11869 type-specifier-seq declarator braced-init-list
11871 GNU Extension:
11873 condition:
11874 type-specifier-seq declarator asm-specification [opt]
11875 attributes [opt] = assignment-expression
11877 Returns the expression that should be tested. */
11879 static tree
11881 {
11882 cp_decl_specifier_seq type_specifiers;
11886 /* Try the declaration first. */
11888 /* New types are not allowed in the type-specifier-seq for a
11889 condition. */
11891 parser->type_definition_forbidden_message
11893 /* Parse the type-specifier-seq. */
11895 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11898 /* Restore the saved message. */
11904 /* If all is well, we might be looking at a declaration. */
11906 {
11907 tree decl;
11908 tree asm_specification;
11909 tree attributes;
11914 /* Parse the declarator. */
11920 /* Parse the attributes. */
11922 /* Parse the asm-specification. */
11924 /* If the next token is not an `=' or '{', then we might still be
11925 looking at an expression. For example:
11927 if (A(a).x)
11929 looks like a decl-specifier-seq and a declarator -- but then
11930 there is no `=', so this is an expression. */
11935 /* If we did see an `=' or '{', then we are looking at a declaration
11936 for sure. */
11938 {
11939 tree pushed_scope;
11946 /* Create the declaration. */
11952 /* Parse the initializer. */
11954 {
11958 }
11960 {
11961 /* Consume the `='. */
11965 }
11966 else
11967 {
11970 }
11974 /* Process the initializer. */
11977 asm_specification,
11978 flags);
11984 }
11985 }
11986 /* If we didn't even get past the declarator successfully, we are
11987 definitely not looking at a declaration. */
11988 else
11991 /* Otherwise, we are looking at an expression. */
11993 }
11995 /* Parses a for-statement or range-for-statement until the closing ')',
11996 not included. */
11998 static tree
12000 {
12004 /* Begin the for-statement. */
12007 /* Parse the initialization. */
12013 else
12015 }
12017 static tree
12020 {
12021 /* Normal for loop */
12024 tree stmt;
12027 /* The init-statement has already been parsed in
12028 cp_parser_init_statement, so no work is needed here. */
12031 /* If there's a condition, process it. */
12035 {
12039 }
12041 {
12045 }
12047 /* Look for the `;'. */
12050 /* If there's an expression, process it. */
12056 }
12058 /* Tries to parse a range-based for-statement:
12060 range-based-for:
12061 decl-specifier-seq declarator : expression
12063 The decl-specifier-seq declarator and the `:' are already parsed by
12064 cp_parser_init_statement. If processing_template_decl it returns a
12065 newly created RANGE_FOR_STMT; if not, it is converted to a
12066 regular FOR_STMT. */
12068 static tree
12071 {
12078 /* Get the range declaration momentarily out of the way so that
12079 the range expression doesn't clash with it. */
12081 {
12083 {
12085 /* For decomposition declaration get all of the corresponding
12086 declarations out of the way. */
12090 {
12096 {
12102 }
12103 }
12104 }
12106 {
12111 }
12112 }
12115 {
12118 }
12119 else
12122 /* Put the range declaration(s) back into scope. */
12124 {
12128 }
12130 /* finish_omp_for has its own code for the following, so just
12131 return the range_expr instead. */
12135 /* If in template, STMT is converted to a normal for-statement
12136 at instantiation. If not, it is done just ahead. */
12138 {
12148 /* do_auto_deduction doesn't mess with template init-lists. */
12151 }
12152 else
12153 {
12157 unroll);
12158 }
12160 }
12162 /* Subroutine of cp_convert_range_for: given the initializer expression,
12163 builds up the range temporary. */
12165 static tree
12167 {
12170 /* Find out the type deduced by the declaration
12171 `auto &&__range = range_expr'. */
12176 /* Create the __range variable. */
12178 range_type);
12183 }
12185 /* Used by cp_parser_range_for in template context: we aren't going to
12186 do a full conversion yet, but we still need to resolve auto in the
12187 type of the for-range-declaration if present. This is basically
12188 a shortcut version of cp_convert_range_for. */
12190 static void
12192 {
12195 {
12198 iter_type = (cp_parser_perform_range_for_lookup
12201 {
12203 iter_type);
12205 RO_UNARY_STAR,
12206 tf_warning_or_error);
12209 }
12210 }
12211 }
12213 /* Converts a range-based for-statement into a normal
12214 for-statement, as per the definition.
12216 for (RANGE_DECL : RANGE_EXPR)
12217 BLOCK
12219 should be equivalent to:
12221 {
12222 auto &&__range = RANGE_EXPR;
12223 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
12224 __begin != __end;
12225 ++__begin)
12226 {
12227 RANGE_DECL = *__begin;
12228 BLOCK
12229 }
12230 }
12232 If RANGE_EXPR is an array:
12233 BEGIN_EXPR = __range
12234 END_EXPR = __range + ARRAY_SIZE(__range)
12235 Else if RANGE_EXPR has a member 'begin' or 'end':
12236 BEGIN_EXPR = __range.begin()
12237 END_EXPR = __range.end()
12238 Else:
12239 BEGIN_EXPR = begin(__range)
12240 END_EXPR = end(__range);
12242 If __range has a member 'begin' but not 'end', or vice versa, we must
12243 still use the second alternative (it will surely fail, however).
12244 When calling begin()/end() in the third alternative we must use
12245 argument dependent lookup, but always considering 'std' as an associated
12246 namespace. */
12248 tree
12252 {
12260 /* If an error happened previously do nothing or else a lot of
12261 unhelpful errors would be issued. */
12263 else
12264 {
12265 tree range_temp;
12269 /* Can't bind a reference to an array of runtime bound. */
12271 else
12272 {
12277 LOOKUP_ONLYCONVERTING);
12279 }
12282 }
12284 /* The new for initialization statement. */
12286 iter_type);
12292 LOOKUP_ONLYCONVERTING);
12302 LOOKUP_ONLYCONVERTING);
12306 /* The new for condition. */
12313 /* The new increment expression. */
12316 tf_warning_or_error);
12322 /* The declaration is initialized with *__begin inside the loop body. */
12325 tf_warning_or_error),
12327 LOOKUP_ONLYCONVERTING);
12332 }
12334 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12335 We need to solve both at the same time because the method used
12336 depends on the existence of members begin or end.
12337 Returns the type deduced for the iterator expression. */
12339 static tree
12341 {
12343 {
12346 }
12349 {
12354 }
12356 {
12357 /* If RANGE is an array, we will use pointer arithmetic. */
12360 range,
12364 }
12365 else
12366 {
12367 /* If it is not an array, we must do a bit of magic. */
12377 tf_warning_or_error);
12380 tf_warning_or_error);
12383 {
12384 /* Use the member functions. */
12387 }
12388 else
12389 {
12390 /* Use global functions with ADL. */
12397 tf_warning_or_error);
12399 tf_warning_or_error);
12401 tf_warning_or_error);
12403 tf_warning_or_error);
12406 }
12408 /* Last common checks. */
12410 {
12411 /* If one of the expressions is an error do no more checks. */
12414 }
12417 /* Can happen, when, eg, in a template context, Koenig lookup
12418 can't resolve begin/end (c++/58503). */
12420 else
12421 {
12423 /* The unqualified type of the __begin and __end temporaries should
12424 be the same, as required by the multiple auto declaration. */
12426 {
12433 /* P0184R0 allows __begin and __end to have different types,
12434 but make sure they are comparable so we can give a better
12436 else
12440 }
12442 }
12443 }
12444 }
12446 /* Helper function for cp_parser_perform_range_for_lookup.
12447 Builds a tree for RANGE.IDENTIFIER(). */
12449 static tree
12451 {
12464 tf_warning_or_error);
12467 }
12469 /* Parse an iteration-statement.
12471 iteration-statement:
12472 while ( condition ) statement
12473 do statement while ( expression ) ;
12474 for ( init-statement condition [opt] ; expression [opt] )
12475 statement
12477 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12479 static tree
12482 {
12485 tree statement;
12487 token_indent_info guard_tinfo;
12489 /* Peek at the next token. */
12496 /* Remember whether or not we are already within an iteration
12497 statement. */
12500 /* See what kind of keyword it is. */
12503 {
12505 {
12506 tree condition;
12508 /* Begin the while-statement. */
12510 /* Look for the `('. */
12511 matching_parens parens;
12513 /* Parse the condition. */
12516 /* Look for the `)'. */
12518 /* Parse the dependent statement. */
12524 /* We're done with the while-statement. */
12526 }
12530 {
12531 tree expression;
12533 /* Begin the do-statement. */
12535 /* Parse the body of the do-statement. */
12542 /* Look for the `while' keyword. */
12544 /* Look for the `('. */
12545 matching_parens parens;
12547 /* Parse the expression. */
12549 /* We're done with the do-statement. */
12551 /* Look for the `)'. */
12553 /* Look for the `;'. */
12555 }
12559 {
12560 /* Look for the `('. */
12561 matching_parens parens;
12566 /* Look for the `)'. */
12569 /* Parse the body of the for-statement. */
12576 /* We're done with the for-statement. */
12578 }
12585 }
12588 }
12590 /* Parse a init-statement or the declarator of a range-based-for.
12591 Returns true if a range-based-for declaration is seen.
12593 init-statement:
12594 expression-statement
12595 simple-declaration */
12597 static bool
12599 {
12600 /* If the next token is a `;', then we have an empty
12601 expression-statement. Grammatically, this is also a
12602 simple-declaration, but an invalid one, because it does not
12603 declare anything. Therefore, if we did not handle this case
12604 specially, we would issue an error message about an invalid
12605 declaration. */
12607 {
12611 /* Try to parse the init-statement. */
12613 {
12614 tree dummy;
12616 /* Parse the declaration. */
12622 /* That didn't work, try to parse it as an expression-statement. */
12626 {
12628 "range-based %<for%> loops with initializer only "
12631 }
12632 }
12634 /* A colon is used in range-based for. */
12637 /* We're going to speculatively look for a declaration, falling back
12638 to an expression, if necessary. */
12640 /* Parse the declaration. */
12643 decl);
12646 {
12647 /* It is a range-for, consume the ':'. */
12652 "range-based %<for%> loops only available with "
12654 }
12655 else
12656 /* The ';' is not consumed yet because we told
12657 cp_parser_simple_declaration not to. */
12662 /* If the tentative parse failed, then we shall need to look for an
12663 expression-statement. */
12664 }
12665 /* If we are here, it is an expression-statement. */
12668 }
12670 /* Parse a jump-statement.
12672 jump-statement:
12673 break ;
12674 continue ;
12675 return expression [opt] ;
12676 return braced-init-list ;
12677 goto identifier ;
12679 GNU extension:
12681 jump-statement:
12682 goto * expression ;
12684 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12686 static tree
12688 {
12694 /* Peek at the next token. */
12699 /* See what kind of keyword it is. */
12702 {
12706 {
12723 }
12729 {
12733 /* Fall through. */
12743 }
12748 {
12749 tree expr;
12753 {
12757 }
12760 else
12761 /* If the next token is a `;', then there is no
12762 expression. */
12764 /* Build the return-statement. */
12767 else
12769 /* Look for the final `;'. */
12771 }
12777 {
12780 }
12782 /* Create the goto-statement. */
12784 {
12785 /* Issue a warning about this use of a GNU extension. */
12787 /* Consume the '*' token. */
12789 /* Parse the dependent expression. */
12791 }
12792 else
12794 /* Look for the final `;'. */
12801 }
12804 }
12806 /* Parse a declaration-statement.
12808 declaration-statement:
12809 block-declaration */
12811 static void
12813 {
12816 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12819 /* Parse the block-declaration. */
12822 /* Free any declarators allocated. */
12824 }
12826 /* Some dependent statements (like `if (cond) statement'), are
12827 implicitly in their own scope. In other words, if the statement is
12828 a single statement (as opposed to a compound-statement), it is
12829 none-the-less treated as if it were enclosed in braces. Any
12830 declarations appearing in the dependent statement are out of scope
12831 after control passes that point. This function parses a statement,
12832 but ensures that is in its own scope, even if it is not a
12833 compound-statement.
12835 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12836 is a (possibly labeled) if statement which is not enclosed in
12837 braces and has an else clause. This is used to implement
12838 -Wparentheses.
12840 CHAIN is a vector of if-else-if conditions. This is used to implement
12841 -Wduplicated-cond.
12843 Returns the new statement. */
12845 static tree
12849 {
12850 tree statement;
12853 token_indent_info body_tinfo
12859 /* Mark if () ; with a special NOP_EXPR. */
12861 {
12872 }
12873 /* if a compound is opened, we simply parse the statement directly. */
12876 /* If the token is not a `{', then we must take special action. */
12877 else
12878 {
12879 /* Create a compound-statement. */
12881 /* Parse the dependent-statement. */
12884 /* Finish the dummy compound-statement. */
12886 }
12888 token_indent_info next_tinfo
12897 /* Return the statement. */
12899 }
12901 /* For some dependent statements (like `while (cond) statement'), we
12902 have already created a scope. Therefore, even if the dependent
12903 statement is a compound-statement, we do not want to create another
12904 scope. */
12906 static void
12909 {
12910 /* If the token is a `{', then we must take special action. */
12912 {
12913 token_indent_info body_tinfo
12919 token_indent_info next_tinfo
12928 }
12929 else
12930 {
12931 /* Avoid calling cp_parser_compound_statement, so that we
12932 don't create a new scope. Do everything else by hand. */
12933 matching_braces braces;
12935 /* If the next keyword is `__label__' we have a label declaration. */
12938 /* Parse an (optional) statement-seq. */
12941 }
12942 }
12944 /* Declarations [gram.dcl.dcl] */
12946 /* Parse an optional declaration-sequence.
12948 declaration-seq:
12949 declaration
12950 declaration-seq declaration */
12952 static void
12954 {
12956 {
12962 else
12964 }
12965 }
12967 /* Parse a declaration.
12969 declaration:
12970 block-declaration
12971 function-definition
12972 template-declaration
12973 explicit-instantiation
12974 explicit-specialization
12975 linkage-specification
12976 namespace-definition
12978 C++17:
12979 deduction-guide
12981 GNU extension:
12983 declaration:
12984 __extension__ declaration */
12986 static void
12988 {
12989 cp_token token1;
12990 cp_token token2;
12995 /* Check for the `__extension__' keyword. */
12997 {
12998 /* Parse the qualified declaration. */
13000 /* Restore the PEDANTIC flag. */
13004 }
13006 /* Try to figure out what kind of declaration is present. */
13011 else
13012 {
13015 }
13017 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
13020 /* If the next token is `extern' and the following token is a string
13021 literal, then we have a linkage specification. */
13025 /* If the next token is `template', then we have either a template
13026 declaration, an explicit instantiation, or an explicit
13027 specialization. */
13029 {
13030 /* `template <>' indicates a template specialization. */
13034 /* `template <' indicates a template declaration. */
13037 /* Anything else must be an explicit instantiation. */
13038 else
13040 }
13041 /* If the next token is `export', then we have a template
13042 declaration. */
13045 /* If the next token is `extern', 'static' or 'inline' and the one
13046 after that is `template', we have a GNU extended explicit
13047 instantiation directive. */
13054 /* If the next token is `namespace', check for a named or unnamed
13055 namespace definition. */
13064 /* An unnamed namespace definition. */
13068 /* An inline (associated) namespace definition. */
13072 /* Objective-C++ declaration/definition. */
13079 /* At this point we may have a template declared by a concept
13080 introduction. */
13085 else
13086 /* Try to parse a block-declaration, or a function-definition. */
13089 /* Free any declarators allocated. */
13091 }
13093 /* Parse a namespace-scope declaration. */
13095 static void
13097 {
13101 /* A top-level declaration can consist solely of a #pragma. A
13102 nested declaration cannot, so this is done here and not in
13103 cp_parser_declaration. (A #pragma at block scope is
13104 handled in cp_parser_statement.) */
13107 {
13108 /* A declaration consisting of a single semicolon is
13109 invalid. Allow it unless we're being pedantic. */
13113 }
13114 else
13115 /* Parse the declaration itself. */
13117 }
13119 /* Parse a block-declaration.
13121 block-declaration:
13122 simple-declaration
13123 asm-definition
13124 namespace-alias-definition
13125 using-declaration
13126 using-directive
13128 GNU Extension:
13130 block-declaration:
13131 __extension__ block-declaration
13133 C++0x Extension:
13135 block-declaration:
13136 static_assert-declaration
13138 If STATEMENT_P is TRUE, then this block-declaration is occurring as
13139 part of a declaration-statement. */
13141 static void
13144 {
13148 /* Check for the `__extension__' keyword. */
13150 {
13151 /* Parse the qualified declaration. */
13153 /* Restore the PEDANTIC flag. */
13157 }
13159 /* Peek at the next token to figure out which kind of declaration is
13160 present. */
13163 /* If the next keyword is `asm', we have an asm-definition. */
13165 {
13169 }
13170 /* If the next keyword is `namespace', we have a
13171 namespace-alias-definition. */
13174 /* If the next keyword is `using', we have a
13175 using-declaration, a using-directive, or an alias-declaration. */
13177 {
13182 /* If the token after `using' is `namespace', then we have a
13183 using-directive. */
13187 /* If the second token after 'using' is '=', then we have an
13188 alias-declaration. */
13194 /* Otherwise, it's a using-declaration. */
13195 else
13198 }
13199 /* If the next keyword is `__label__' we have a misplaced label
13200 declaration. */
13202 {
13206 /* If the next token is now a `;', consume it. */
13209 }
13210 /* If the next token is `static_assert' we have a static assertion. */
13213 /* Anything else must be a simple-declaration. */
13214 else
13217 }
13219 /* Parse a simple-declaration.
13221 simple-declaration:
13222 decl-specifier-seq [opt] init-declarator-list [opt] ;
13223 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13224 brace-or-equal-initializer ;
13226 init-declarator-list:
13227 init-declarator
13228 init-declarator-list , init-declarator
13230 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
13231 function-definition as a simple-declaration.
13233 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
13234 parsed declaration if it is an uninitialized single declarator not followed
13235 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
13236 if present, will not be consumed. */
13238 static void
13242 {
13243 cp_decl_specifier_seq decl_specifiers;
13252 /* Defer access checks until we know what is being declared; the
13253 checks for names appearing in the decl-specifier-seq should be
13254 done as if we were in the scope of the thing being declared. */
13257 /* Parse the decl-specifier-seq. We have to keep track of whether
13258 or not the decl-specifier-seq declares a named class or
13259 enumeration type, since that is the only case in which the
13260 init-declarator-list is allowed to be empty.
13262 [dcl.dcl]
13264 In a simple-declaration, the optional init-declarator-list can be
13265 omitted only when declaring a class or enumeration, that is when
13266 the decl-specifier-seq contains either a class-specifier, an
13267 elaborated-type-specifier, or an enum-specifier. */
13269 CP_PARSER_FLAGS_OPTIONAL,
13272 /* We no longer need to defer access checks. */
13275 /* In a block scope, a valid declaration must always have a
13276 decl-specifier-seq. By not trying to parse declarators, we can
13277 resolve the declaration/expression ambiguity more quickly. */
13280 {
13283 }
13285 /* If the next two tokens are both identifiers, the code is
13286 erroneous. The usual cause of this situation is code like:
13288 T t;
13290 where "T" should name a type -- but does not. */
13293 {
13294 /* If parsing tentatively, we should commit; we really are
13295 looking at a declaration. */
13297 /* Give up. */
13299 }
13304 /* Look for C++17 decomposition declaration. */
13312 {
13313 tree decl
13315 maybe_range_for_decl,
13318 /* The next token should be either a `,' or a `;'. */
13320 /* If it's a `;', we are done. */
13324 {
13328 }
13329 /* Anything else is an error. */
13330 else
13331 {
13332 /* If we have already issued an error message we don't need
13333 to issue another one. */
13338 /* Skip tokens until we reach the end of the statement. */
13340 /* If the next token is now a `;', consume it. */
13344 }
13345 }
13346 else
13349 tree last_type;
13351 /* NULL_TREE if both variable and function declaration are allowed,
13352 error_mark_node if function declaration are not allowed and
13353 a FUNCTION_DECL that should be diagnosed if it is followed by
13354 variable declarations. */
13355 tree auto_function_declaration;
13358 auto_specifier_p
13362 /* Keep going until we hit the `;' at the end of the simple
13363 declaration. */
13366 CPP_SEMICOLON))
13367 {
13370 tree decl;
13374 {
13375 /* If we are processing next declarator, comma is expected */
13380 {
13384 }
13385 }
13386 else
13389 /* Parse the init-declarator. */
13392 function_definition_allowed_p,
13394 declares_class_or_enum,
13396 maybe_range_for_decl,
13399 /* If an error occurred while parsing tentatively, exit quickly.
13400 (That usually happens when in the body of a function; each
13401 statement is treated as a declaration-statement until proven
13402 otherwise.) */
13407 {
13408 /* If the init-declarator-list contains more than one
13409 init-declarator, they shall all form declarations of
13410 variables. */
13412 auto_function_declaration
13416 {
13418 "non-variable %qD in declaration with more than one "
13423 }
13424 }
13428 {
13432 {
13433 /* If the list of declarators contains more than one declarator,
13434 the type of each declared variable is determined as described
13435 above. If the type deduced for the template parameter U is not
13436 the same in each deduction, the program is ill-formed. */
13441 }
13442 else
13444 }
13446 /* Handle function definitions specially. */
13448 {
13449 /* If the next token is a `,', then we are probably
13450 processing something like:
13452 void f() {}, *p;
13454 which is erroneous. */
13456 {
13459 "mixing"
13461 }
13462 /* Otherwise, we're done with the list of declarators. */
13463 else
13464 {
13467 }
13468 }
13471 /* The next token should be either a `,' or a `;'. */
13473 /* If it's a `,', there are more declarators to come. */
13476 /* If it's a `;', we are done. */
13480 {
13485 }
13486 /* Anything else is an error. */
13487 else
13488 {
13489 /* If we have already issued an error message we don't need
13490 to issue another one. */
13495 /* Skip tokens until we reach the end of the statement. */
13497 /* If the next token is now a `;', consume it. */
13501 }
13502 /* After the first time around, a function-definition is not
13503 allowed -- even if it was OK at first. For example:
13505 int i, f() {}
13507 is not valid. */
13509 }
13511 /* Issue an error message if no declarators are present, and the
13512 decl-specifier-seq does not itself declare a class or
13513 enumeration: [dcl.dcl]/3. */
13515 {
13517 {
13521 /* Ensure an error is issued anyway when finish_decltype_type,
13522 called via cp_parser_decl_specifier_seq, returns a class or
13523 an enumeration (c++/51786). */
13526 }
13527 /* Perform any deferred access checks. */
13529 }
13531 /* Consume the `;'. */
13532 finish:
13536 {
13542 }
13544 done:
13546 }
13548 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13549 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13550 initializer ; */
13552 static tree
13557 {
13562 /* Parse the identifier-list. */
13566 {
13574 }
13578 {
13584 else
13585 {
13588 }
13589 }
13595 tree pushed_scope;
13602 NULL_TREE);
13609 cp_expr e;
13610 cp_decl_specifier_seq decl_specs;
13615 {
13619 else
13620 {
13623 }
13624 tree elt_pushed_scope;
13630 {
13631 /* Ensure we've diagnosed redeclaration if we aren't creating
13632 a new VAR_DECL. */
13635 }
13636 else
13640 }
13643 {
13646 }
13650 {
13658 || (is_direct_init
13661 {
13665 }
13668 {
13673 }
13674 }
13676 {
13678 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13679 the underlying DECL. */
13681 }
13687 {
13690 }
13693 }
13695 /* Parse a decl-specifier-seq.
13697 decl-specifier-seq:
13698 decl-specifier-seq [opt] decl-specifier
13699 decl-specifier attribute-specifier-seq [opt] (C++11)
13701 decl-specifier:
13702 storage-class-specifier
13703 type-specifier
13704 function-specifier
13705 friend
13706 typedef
13708 GNU Extension:
13710 decl-specifier:
13711 attributes
13713 Concepts Extension:
13715 decl-specifier:
13716 concept
13718 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13720 The parser flags FLAGS is used to control type-specifier parsing.
13722 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13723 flags:
13725 1: one of the decl-specifiers is an elaborated-type-specifier
13726 (i.e., a type declaration)
13727 2: one of the decl-specifiers is an enum-specifier or a
13728 class-specifier (i.e., a type definition)
13730 */
13732 static void
13734 cp_parser_flags flags,
13737 {
13741 cp_decl_spec ds;
13743 /* Clear DECL_SPECS. */
13746 /* Assume no class or enumeration type is declared. */
13749 /* Keep reading specifiers until there are no more to read. */
13751 {
13756 /* Peek at the next token. */
13759 /* Save the first token of the decl spec list for error
13760 reporting. */
13763 /* Handle attributes. */
13765 {
13766 /* Parse the attributes. */
13769 /* In a sequence of declaration specifiers, c++11 attributes
13770 appertain to the type that precede them. In that case
13771 [dcl.spec]/1 says:
13773 The attribute-specifier-seq affects the type only for
13774 the declaration it appears in, not other declarations
13775 involving the same type.
13777 But for now let's force the user to position the
13778 attribute either at the beginning of the declaration or
13779 after the declarator-id, which would clearly mean that it
13780 applies to the declarator. */
13782 {
13784 /* The c++11 attribute is at the beginning of the
13785 declaration. It appertains to the entity being
13787 else
13788 {
13790 {
13791 /* This is an attribute following a
13792 class-specifier. */
13797 }
13798 else
13799 {
13800 decl_specs->std_attributes
13804 }
13806 }
13807 }
13809 decl_specs->attributes
13814 }
13815 /* Assume we will find a decl-specifier keyword. */
13817 /* If the next token is an appropriate keyword, we can simply
13818 add it to the list. */
13820 {
13821 /* decl-specifier:
13822 friend
13823 constexpr */
13826 {
13831 }
13832 else
13833 {
13835 /* Consume the token. */
13837 }
13850 /* function-specifier:
13851 inline
13852 virtual
13853 explicit */
13860 /* decl-specifier:
13861 typedef */
13864 /* Consume the token. */
13866 /* A constructor declarator cannot appear in a typedef. */
13868 /* The "typedef" keyword can only occur in a declaration; we
13869 may as well commit at this point. */
13876 /* storage-class-specifier:
13877 auto
13878 register
13879 static
13880 extern
13881 mutable
13883 GNU Extension:
13884 thread */
13887 {
13888 /* Consume the token. */
13891 /* Complain about `auto' as a storage specifier, if
13892 we're complaining about C++0x compatibility. */
13896 "%<auto%> changes meaning in C++11; "
13899 /* Set the storage class anyway. */
13901 token);
13902 }
13903 else
13904 /* C++0x auto type-specifier. */
13912 /* Consume the token. */
13915 token);
13918 /* Consume the token. */
13924 /* We did not yet find a decl-specifier yet. */
13927 }
13944 /* Constructors are a special case. The `S' in `S()' is not a
13945 decl-specifier; it is the beginning of the declarator. */
13946 constructor_p
13947 = (!found_decl_spec
13948 && constructor_possible_p
13949 && (cp_parser_constructor_declarator_p
13952 /* If we don't have a DECL_SPEC yet, then we must be looking at
13953 a type-specifier. */
13955 {
13958 tree type_spec;
13960 type_spec
13962 decl_specs,
13968 /* If this type-specifier referenced a user-defined type
13969 (a typedef, class-name, etc.), then we can't allow any
13970 more such type-specifiers henceforth.
13972 [dcl.spec]
13974 The longest sequence of decl-specifiers that could
13975 possibly be a type name is taken as the
13976 decl-specifier-seq of a declaration. The sequence shall
13977 be self-consistent as described below.
13979 [dcl.type]
13981 As a general rule, at most one type-specifier is allowed
13982 in the complete decl-specifier-seq of a declaration. The
13983 only exceptions are the following:
13985 -- const or volatile can be combined with any other
13986 type-specifier.
13988 -- signed or unsigned can be combined with char, long,
13989 short, or int.
13991 -- ..
13993 Example:
13995 typedef char* Pc;
13996 void g (const int Pc);
13998 Here, Pc is *not* part of the decl-specifier seq; it's
13999 the declarator. Therefore, once we see a type-specifier
14000 (other than a cv-qualifier), we forbid any additional
14001 user-defined types. We *do* still allow things like `int
14002 int' to be considered a decl-specifier-seq, and issue the
14003 error message later. */
14006 /* A constructor declarator cannot follow a type-specifier. */
14008 {
14016 }
14017 }
14019 /* If we still do not have a DECL_SPEC, then there are no more
14020 decl-specifiers. */
14025 /* After we see one decl-specifier, further decl-specifiers are
14026 always optional. */
14028 }
14030 /* Don't allow a friend specifier with a class definition. */
14035 }
14037 /* Parse an (optional) storage-class-specifier.
14039 storage-class-specifier:
14040 auto
14041 register
14042 static
14043 extern
14044 mutable
14046 GNU Extension:
14048 storage-class-specifier:
14049 thread
14051 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
14053 static tree
14055 {
14057 {
14061 /* Fall through for C++98. */
14069 /* Consume the token. */
14074 }
14075 }
14077 /* Parse an (optional) function-specifier.
14079 function-specifier:
14080 inline
14081 virtual
14082 explicit
14084 C++2A Extension:
14085 explicit(constant-expression)
14087 Returns an IDENTIFIER_NODE corresponding to the keyword used.
14088 Updates DECL_SPECS, if it is non-NULL. */
14090 static tree
14093 {
14096 {
14102 /* 14.5.2.3 [temp.mem]
14104 A member function template shall not be virtual. */
14108 else
14113 {
14115 /* If we see '(', it's C++20 explicit(bool). */
14116 tree expr;
14118 {
14119 matching_parens parens;
14122 /* New types are not allowed in an explicit-specifier. */
14125 parser->type_definition_forbidden_message
14130 "%<explicit(bool)%> only available with -std=c++2a "
14133 /* Parse the constant-expression. */
14136 /* Restore the saved message. */
14139 }
14140 else
14141 /* The explicit-specifier explicit without a constant-expression is
14142 equivalent to the explicit-specifier explicit(true). */
14145 /* [dcl.fct.spec]
14146 "the constant-expression, if supplied, shall be a contextually
14147 converted constant expression of type bool." */
14149 /* We could evaluate it -- mark the decl as appropriate. */
14155 /* The expression was value-dependent. Remember it so that we can
14156 substitute it later. */
14159 }
14163 }
14165 /* Consume the token. */
14167 }
14169 /* Parse a linkage-specification.
14171 linkage-specification:
14172 extern string-literal { declaration-seq [opt] }
14173 extern string-literal declaration */
14175 static void
14177 {
14178 tree linkage;
14180 /* Look for the `extern' keyword. */
14181 cp_token *extern_token
14184 /* Look for the string-literal. */
14188 /* Transform the literal into an identifier. If the literal is a
14189 wide-character string, or contains embedded NULs, then we can't
14190 handle it as the user wants. */
14193 {
14195 /* Assume C++ linkage. */
14197 }
14198 else
14201 /* We're now using the new linkage. */
14204 /* Preserve the location of the the innermost linkage specification,
14205 tracking the locations of nested specifications via a local. */
14206 location_t saved_location
14208 /* Construct a location ranging from the start of the "extern" to
14209 the end of the string-literal, with the caret at the start, e.g.:
14210 extern "C" {
14211 ^~~~~~~~~~
14212 */
14213 parser->innermost_linkage_specification_location
14218 /* If the next token is a `{', then we're using the first
14219 production. */
14221 {
14225 /* Consume the `{' token. */
14226 matching_braces braces;
14228 /* Parse the declarations. */
14230 /* Look for the closing `}'. */
14232 }
14233 /* Otherwise, there's just one declaration. */
14234 else
14235 {
14238 saved_in_unbraced_linkage_specification_p
14242 parser->in_unbraced_linkage_specification_p
14244 }
14246 /* We're done with the linkage-specification. */
14249 /* Restore location of parent linkage specification, if any. */
14251 }
14253 /* Parse a static_assert-declaration.
14255 static_assert-declaration:
14256 static_assert ( constant-expression , string-literal ) ;
14257 static_assert ( constant-expression ) ; (C++17)
14259 If MEMBER_P, this static_assert is a class member. */
14261 static void
14263 {
14264 cp_expr condition;
14265 location_t token_loc;
14266 tree message;
14269 /* Peek at the `static_assert' token so we can keep track of exactly
14270 where the static assertion started. */
14273 /* Look for the `static_assert' keyword. */
14275 RT_STATIC_ASSERT))
14278 /* We know we are in a static assertion; commit to any tentative
14279 parse. */
14283 /* Parse the `(' starting the static assertion condition. */
14284 matching_parens parens;
14287 /* Parse the constant-expression. Allow a non-constant expression
14288 here in order to give better diagnostics in finish_static_assert. */
14289 condition =
14295 {
14298 "static_assert without a message "
14300 /* Eat the ')' */
14305 }
14306 else
14307 {
14308 /* Parse the separating `,'. */
14311 /* Parse the string-literal message. */
14316 /* A `)' completes the static assertion. */
14322 }
14324 /* A semicolon terminates the declaration. */
14327 /* Get the location for the static assertion. Use that of the
14328 condition if available, otherwise, use that of the "static_assert"
14329 token. */
14334 /* Complete the static assertion, which may mean either processing
14335 the static assert now or saving it for template instantiation. */
14337 }
14339 /* Parse the expression in decltype ( expression ). */
14341 static tree
14344 {
14346 tree expr;
14348 /* Since we're going to preserve any side-effects from this parse, set up a
14349 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14350 in the expression. */
14353 /* First, try parsing an id-expression. */
14364 {
14367 cp_id_kind idk;
14371 /* Lookup the name we got back from the id-expression. */
14376 /* A template without args is not a complete id-expression. */
14385 {
14386 /* Complete lookup of the id-expression. */
14387 expr = (finish_id_expression
14400 /* We found an id-expression, but it was something that we
14401 should not have found. This is an error, not something
14402 we can recover from, so note that we found an
14403 id-expression and we'll recover as gracefully as
14404 possible. */
14406 }
14411 /* We have an id-expression. */
14413 }
14416 {
14417 /* Abort the id-expression parse. */
14420 /* Parsing tentatively, again. */
14423 /* Parse a class member access. */
14431 /* We have an id-expression. */
14433 }
14436 /* We have parsed the complete id-expression or member access. */
14438 else
14439 {
14440 /* Abort our attempt to parse an id-expression or member access
14441 expression. */
14444 /* Commit to the tentative_firewall so we get syntax errors. */
14447 /* Parse a full expression. */
14450 }
14453 }
14455 /* Parse a `decltype' type. Returns the type.
14457 simple-type-specifier:
14458 decltype ( expression )
14459 C++14 proposal:
14460 decltype ( auto ) */
14462 static tree
14464 {
14469 {
14470 /* Already parsed. */
14473 }
14475 /* Look for the `decltype' token. */
14479 /* Parse the opening `('. */
14480 matching_parens parens;
14490 /* decltype (auto) */
14492 else
14493 {
14494 /* decltype (expression) */
14496 /* Types cannot be defined in a `decltype' expression. Save away the
14497 old message and set the new one. */
14499 parser->type_definition_forbidden_message
14502 /* The restrictions on constant-expressions do not apply inside
14503 decltype expressions. */
14504 bool saved_integral_constant_expression_p
14506 bool saved_non_integral_constant_expression_p
14510 /* Within a parenthesized expression, a `>' token is always
14511 the greater-than operator. */
14512 bool saved_greater_than_is_operator_p
14516 /* Do not actually evaluate the expression. */
14519 /* Do not warn about problems with the expression. */
14524 /* Go back to evaluating expressions. */
14528 /* The `>' token might be the end of a template-id or
14529 template-parameter-list now. */
14530 parser->greater_than_is_operator_p
14533 /* Restore the old message and the integral constant expression
14534 flags. */
14536 parser->integral_constant_expression_p
14538 parser->non_integral_constant_expression_p
14540 }
14542 /* Parse to the closing `)'. */
14544 {
14549 }
14552 {
14553 /* Build auto. */
14556 }
14557 else
14559 tf_warning_or_error);
14561 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14562 it again. */
14573 }
14575 /* Special member functions [gram.special] */
14577 /* Parse a conversion-function-id.
14579 conversion-function-id:
14580 operator conversion-type-id
14582 Returns an IDENTIFIER_NODE representing the operator. */
14584 static tree
14586 {
14587 tree type;
14588 tree saved_scope;
14589 tree saved_qualifying_scope;
14590 tree saved_object_scope;
14593 /* Look for the `operator' token. */
14596 /* When we parse the conversion-type-id, the current scope will be
14597 reset. However, we need that information in able to look up the
14598 conversion function later, so we save it here. */
14602 /* We must enter the scope of the class so that the names of
14603 entities declared within the class are available in the
14604 conversion-type-id. For example, consider:
14606 struct S {
14607 typedef int I;
14608 operator I();
14609 };
14611 S::operator I() { ... }
14613 In order to see that `I' is a type-name in the definition, we
14614 must be in the scope of `S'. */
14617 /* Parse the conversion-type-id. */
14619 /* Leave the scope of the class, if any. */
14622 /* Restore the saved scope. */
14626 /* If the TYPE is invalid, indicate failure. */
14630 }
14632 /* Parse a conversion-type-id:
14634 conversion-type-id:
14635 type-specifier-seq conversion-declarator [opt]
14637 Returns the TYPE specified. */
14639 static tree
14641 {
14642 tree attributes;
14643 cp_decl_specifier_seq type_specifiers;
14645 tree type_specified;
14648 /* Parse the attributes. */
14652 parser->type_definition_forbidden_message
14655 /* Parse the type-specifiers. */
14662 /* If that didn't work, stop. */
14665 /* Parse the conversion-declarator. */
14673 /* Don't give this error when parsing tentatively. This happens to
14674 work because we always parse this definitively once. */
14677 {
14679 {
14682 }
14686 }
14689 }
14691 /* Parse an (optional) conversion-declarator.
14693 conversion-declarator:
14694 ptr-operator conversion-declarator [opt]
14696 */
14700 {
14703 cp_cv_quals cv_quals;
14705 /* We don't know if there's a ptr-operator next, or not. */
14707 /* Try the ptr-operator. */
14710 /* If it worked, look for more conversion-declarators. */
14712 {
14715 /* Parse another optional declarator. */
14718 declarator = cp_parser_make_indirect_declarator
14722 }
14725 }
14727 /* Parse an (optional) ctor-initializer.
14729 ctor-initializer:
14730 : mem-initializer-list */
14732 static void
14734 {
14735 /* If the next token is not a `:', then there is no
14736 ctor-initializer. */
14738 {
14739 /* Do default initialization of any bases and members. */
14743 }
14745 /* Consume the `:' token. */
14747 /* And the mem-initializer-list. */
14749 }
14751 /* Parse a mem-initializer-list.
14753 mem-initializer-list:
14754 mem-initializer ... [opt]
14755 mem-initializer ... [opt] , mem-initializer-list */
14757 static void
14759 {
14764 /* Let the semantic analysis code know that we are starting the
14765 mem-initializer-list. */
14770 /* Loop through the list. */
14772 {
14773 tree mem_initializer;
14776 /* Parse the mem-initializer. */
14778 /* If the next token is a `...', we're expanding member initializers. */
14784 {
14785 /* Consume the `...'. */
14789 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14790 can be expanded but members cannot. */
14793 {
14798 }
14800 /* Construct the pack expansion type. */
14803 }
14806 {
14810 }
14811 /* Look for a target constructor. */
14815 {
14818 {
14822 }
14824 }
14825 /* Add it to the list, unless it was erroneous. */
14827 {
14830 }
14831 /* If the next token is not a `,', we're done. */
14834 /* Consume the `,' token. */
14836 }
14838 /* Perform semantic analysis. */
14841 }
14843 /* Parse a mem-initializer.
14845 mem-initializer:
14846 mem-initializer-id ( expression-list [opt] )
14847 mem-initializer-id braced-init-list
14849 GNU extension:
14851 mem-initializer:
14852 ( expression-list [opt] )
14854 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14855 class) or FIELD_DECL (for a non-static data member) to initialize;
14856 the TREE_VALUE is the expression-list. An empty initialization
14857 list is represented by void_list_node. */
14859 static tree
14861 {
14862 tree mem_initializer_id;
14863 tree expression_list;
14864 tree member;
14867 /* Find out what is being initialized. */
14869 {
14873 }
14874 else
14875 {
14879 }
14885 {
14892 }
14893 else
14894 {
14904 }
14914 }
14916 /* Parse a mem-initializer-id.
14918 mem-initializer-id:
14919 :: [opt] nested-name-specifier [opt] class-name
14920 decltype-specifier (C++11)
14921 identifier
14923 Returns a TYPE indicating the class to be initialized for the first
14924 production (and the second in C++11). Returns an IDENTIFIER_NODE
14925 indicating the data member to be initialized for the last production. */
14927 static tree
14929 {
14933 tree id;
14937 /* `typename' is not allowed in this context ([temp.res]). */
14939 {
14941 "keyword %<typename%> not allowed in this context (a qualified "
14944 }
14945 /* Look for the optional `::' operator. */
14946 global_scope_p
14950 /* Look for the optional nested-name-specifier. The simplest way to
14951 implement:
14953 [temp.res]
14955 The keyword `typename' is not permitted in a base-specifier or
14956 mem-initializer; in these contexts a qualified name that
14957 depends on a template-parameter is implicitly assumed to be a
14958 type name.
14960 is to assume that we have seen the `typename' keyword at this
14961 point. */
14962 nested_name_specifier_p
14971 /* If there is a `::' operator or a nested-name-specifier, then we
14972 are definitely looking for a class-name. */
14977 typename_type,
14981 /* Otherwise, we could also be looking for an ordinary identifier. */
14984 /* Try a decltype-specifier. */
14986 else
14987 /* Otherwise, try a class-name. */
14991 none_type,
14995 /* If we found one, we're done. */
14998 /* Otherwise, look for an ordinary identifier. */
15000 }
15002 /* Overloading [gram.over] */
15004 /* Parse an operator-function-id.
15006 operator-function-id:
15007 operator operator
15009 Returns an IDENTIFIER_NODE for the operator which is a
15010 human-readable spelling of the identifier, e.g., `operator +'. */
15012 static cp_expr
15014 {
15016 /* Look for the `operator' keyword. */
15019 /* And then the name of the operator itself. */
15021 }
15023 /* Return an identifier node for a user-defined literal operator.
15024 The suffix identifier is chained to the operator name identifier. */
15026 tree
15028 {
15029 tree identifier;
15036 }
15038 /* Parse an operator.
15040 operator:
15041 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
15042 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
15043 || ++ -- , ->* -> () []
15045 GNU Extensions:
15047 operator:
15048 <? >? <?= >?=
15050 Returns an IDENTIFIER_NODE for the operator which is a
15051 human-readable spelling of the identifier, e.g., `operator +'. */
15053 static cp_expr
15055 {
15060 /* Peek at the next token. */
15065 /* Figure out which operator we have. */
15070 {
15072 {
15073 /* The keyword should be either `new' or `delete'. */
15078 else
15081 /* Consume the `new' or `delete' token. */
15084 /* Peek at the next token. */
15086 /* If it's a `[' token then this is the array variant of the
15087 operator. */
15089 {
15090 /* Consume the `[' token. */
15092 /* Look for the `]' token. */
15097 }
15100 }
15258 {
15259 /* Consume the `('. */
15260 matching_parens parens;
15262 /* Look for the matching `)'. */
15269 }
15272 /* Consume the `['. */
15274 /* Look for the matching `]'. */
15285 /* FALLTHRU */
15294 {
15295 cp_expr str;
15296 tree string_tree;
15302 /* Consume the string. */
15308 {
15312 }
15313 else
15314 {
15316 /* Look for the suffix identifier. */
15319 {
15322 }
15324 {
15328 }
15329 else
15330 {
15333 }
15334 }
15339 {
15342 }
15345 {
15348 }
15350 {
15353 }
15356 }
15359 /* Anything else is an error. */
15361 }
15363 /* If we have selected an identifier, we need to consume the
15364 operator token. */
15366 {
15370 }
15371 /* Otherwise, no valid operator name was present. */
15372 else
15373 {
15376 }
15380 }
15382 /* Parse a template-declaration.
15384 template-declaration:
15385 export [opt] template < template-parameter-list > declaration
15387 If MEMBER_P is TRUE, this template-declaration occurs within a
15388 class-specifier.
15390 The grammar rule given by the standard isn't correct. What
15391 is really meant is:
15393 template-declaration:
15394 export [opt] template-parameter-list-seq
15395 decl-specifier-seq [opt] init-declarator [opt] ;
15396 export [opt] template-parameter-list-seq
15397 function-definition
15399 template-parameter-list-seq:
15400 template-parameter-list-seq [opt]
15401 template < template-parameter-list >
15403 Concept Extensions:
15405 template-parameter-list-seq:
15406 template < template-parameter-list > requires-clause [opt]
15408 requires-clause:
15409 requires logical-or-expression */
15411 static void
15413 {
15414 /* Check for `export'. */
15416 {
15417 /* Consume the `export' token. */
15419 /* Warn that we do not support `export'. */
15421 }
15424 }
15426 /* Parse a template-parameter-list.
15428 template-parameter-list:
15429 template-parameter
15430 template-parameter-list , template-parameter
15432 Returns a TREE_LIST. Each node represents a template parameter.
15433 The nodes are connected via their TREE_CHAINs. */
15435 static tree
15437 {
15442 /* The loop below parses the template parms. We first need to know
15443 the total number of template parms to be able to compute proper
15444 canonical types of each dependent type. So after the loop, when
15445 we know the total number of template parms,
15446 end_template_parm_list computes the proper canonical types and
15447 fixes up the dependent types accordingly. */
15449 {
15450 tree parameter;
15453 location_t parm_loc;
15455 /* Parse the template-parameter. */
15460 /* Add it to the list. */
15463 parm_loc,
15464 parameter,
15465 is_non_type,
15466 is_parameter_pack);
15467 else
15468 {
15471 }
15473 /* If the next token is not a `,', we're done. */
15476 /* Otherwise, consume the `,' token. */
15478 }
15481 }
15483 /* Parse a introduction-list.
15485 introduction-list:
15486 introduced-parameter
15487 introduction-list , introduced-parameter
15489 introduced-parameter:
15490 ...[opt] identifier
15492 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15493 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15494 WILDCARD_DECL will also have DECL_NAME set and token location in
15495 DECL_SOURCE_LOCATION. */
15497 static tree
15499 {
15503 {
15512 /* Build placeholder. */
15520 /* If the next token is not a `,', we're done. */
15523 /* Otherwise, consume the `,' token. */
15525 }
15527 /* Convert the vec into a TREE_VEC. */
15530 tree parm;
15536 }
15538 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15539 is an abstract declarator. */
15543 {
15548 }
15550 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15551 is an abstract declarator. */
15555 {
15559 else
15561 }
15563 /* Returns true if DECL represents a constrained-parameter. */
15567 {
15572 }
15574 /* Returns true if PARM declares a constrained-parameter. */
15578 {
15580 }
15582 /* Check that the type parameter is only a declarator-id, and that its
15583 type is not cv-qualified. */
15585 bool
15588 {
15593 {
15596 }
15598 /* Don't allow cv-qualified type parameters. */
15601 {
15604 }
15607 }
15609 /* Finish parsing/processing a template type parameter and checking
15610 various restrictions. */
15614 tree id,
15616 {
15619 else
15621 }
15623 static tree
15625 {
15626 /* FIXME: This should probably be copied, and we may need to adjust
15627 the template parameter depths. */
15637 }
15639 /* Finish parsing/processing a template template parameter by borrowing
15640 the template parameter list from the prototype parameter. */
15642 static tree
15644 tree proto,
15645 tree id,
15647 {
15651 }
15653 /* Create a new non-type template parameter from the given PARM
15654 declarator. */
15656 static tree
15659 {
15665 }
15667 /* Build a constrained template parameter based on the PARMDECL
15668 declarator. The type of PARMDECL is the constrained type, which
15669 refers to the prototype template parameter that ultimately
15670 specifies the type of the declared parameter. */
15672 static tree
15677 {
15683 /* A template parameter constrained by a variadic concept shall also
15684 be declared as a template parameter pack. */
15689 /* Build the parameter. Return an error if the declarator was invalid. */
15690 tree parm;
15695 parmdecl);
15696 else
15701 /* Finish the parameter decl and create a node attaching the
15702 default argument and constraint. */
15707 }
15709 /* Returns true if the parsed type actually represents the declaration
15710 of a type template-parameter. */
15714 {
15717 }
15720 /* Returns true if the parsed type actually represents the declaration of
15721 a template template-parameter. */
15723 static bool
15725 {
15728 }
15730 /* Parse a default argument for a type template-parameter.
15731 Note that diagnostics are handled in cp_parser_template_parameter. */
15733 static tree
15735 {
15738 /* Consume the `=' token. */
15743 /* Parse the default-argument. */
15749 {
15753 }
15756 }
15758 /* Parse a default argument for a template template-parameter. */
15760 static tree
15762 {
15767 /* Consume the `='. */
15769 /* Parse the id-expression. */
15771 /* save token before parsing the id-expression, for error
15772 reporting */
15774 tree default_argument
15782 /* If the id-expression was a template-id that refers to
15783 a template-class, we already have the declaration here,
15784 so no further lookup is needed. */
15785 ;
15786 else
15787 /* Look up the name. */
15788 default_argument
15790 none_type,
15796 /* See if the default argument is valid. */
15800 }
15802 /* Parse a template-parameter.
15804 template-parameter:
15805 type-parameter
15806 parameter-declaration
15808 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15809 the parameter. The TREE_PURPOSE is the default value, if any.
15810 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15811 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15812 set to true iff this parameter is a parameter pack. */
15814 static tree
15817 {
15820 tree parm;
15822 /* Assume it is a type parameter or a template parameter. */
15824 /* Assume it not a parameter pack. */
15826 /* Peek at the next token. */
15828 /* If it is `template', we have a type-parameter. */
15831 /* If it is `class' or `typename' we do not know yet whether it is a
15832 type parameter or a non-type parameter. Consider:
15834 template <typename T, typename T::X X> ...
15836 or:
15838 template <class C, class D*> ...
15840 Here, the first parameter is a type parameter, and the second is
15841 a non-type parameter. We can tell by looking at the token after
15842 the identifier -- if it is a `,', `=', or `>' then we have a type
15843 parameter. */
15845 {
15846 /* Peek at the token after `class' or `typename'. */
15848 /* If it's an ellipsis, we have a template type parameter
15849 pack. */
15852 /* If it's an identifier, skip it. */
15855 /* Now, see if the token looks like the end of a template
15856 parameter. */
15861 }
15863 /* Otherwise, it is a non-type parameter or a constrained parameter.
15865 [temp.param]
15867 When parsing a default template-argument for a non-type
15868 template-parameter, the first non-nested `>' is taken as the end
15869 of the template parameter-list rather than a greater-than
15870 operator. */
15871 parameter_declarator
15878 /* If the parameter declaration is marked as a parameter pack, set
15879 *IS_PARAMETER_PACK to notify the caller. */
15884 {
15885 /* Can happen in some cases of erroneous input (c++/34892). */
15887 /* Consume the `...' for better error recovery. */
15889 }
15891 // The parameter may have been constrained.
15894 parameter_declarator,
15895 is_non_type,
15896 is_parameter_pack);
15898 // Now we're sure that the parameter is a non-type parameter.
15909 }
15911 /* Parse a type-parameter.
15913 type-parameter:
15914 class identifier [opt]
15915 class identifier [opt] = type-id
15916 typename identifier [opt]
15917 typename identifier [opt] = type-id
15918 template < template-parameter-list > class identifier [opt]
15919 template < template-parameter-list > class identifier [opt]
15920 = id-expression
15922 GNU Extension (variadic templates):
15924 type-parameter:
15925 class ... identifier [opt]
15926 typename ... identifier [opt]
15928 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15929 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15930 the declaration of the parameter.
15932 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15934 static tree
15936 {
15938 tree parameter;
15940 /* Look for a keyword to tell us what kind of parameter this is. */
15946 {
15949 {
15950 tree identifier;
15951 tree default_argument;
15953 /* If the next token is an ellipsis, we have a template
15954 argument pack. */
15956 {
15957 /* Consume the `...' token. */
15962 }
15964 /* If the next token is an identifier, then it names the
15965 parameter. */
15968 else
15971 /* Create the parameter. */
15974 /* If the next token is an `=', we have a default argument. */
15976 {
15977 default_argument
15980 /* Template parameter packs cannot have default
15981 arguments. */
15983 {
15986 "template parameter pack %qD cannot have a "
15988 else
15990 "template parameter packs cannot have "
15993 }
15996 }
15997 else
16000 /* Create the combined representation of the parameter and the
16001 default argument. */
16003 }
16007 {
16008 tree identifier;
16009 tree default_argument;
16011 /* Look for the `<'. */
16013 /* Parse the template-parameter-list. */
16015 /* Look for the `>'. */
16018 // If template requirements are present, parse them.
16020 {
16025 }
16027 /* Look for the `class' or 'typename' keywords. */
16029 /* If the next token is an ellipsis, we have a template
16030 argument pack. */
16032 {
16033 /* Consume the `...' token. */
16038 }
16039 /* If the next token is an `=', then there is a
16040 default-argument. If the next token is a `>', we are at
16041 the end of the parameter-list. If the next token is a `,',
16042 then we are at the end of this parameter. */
16046 {
16048 /* Treat invalid names as if the parameter were nameless. */
16051 }
16052 else
16055 /* Create the template parameter. */
16057 identifier);
16059 /* If the next token is an `=', then there is a
16060 default-argument. */
16062 {
16063 default_argument
16066 /* Template parameter packs cannot have default
16067 arguments. */
16069 {
16072 "template parameter pack %qD cannot "
16074 identifier);
16075 else
16079 }
16080 }
16081 else
16084 /* Create the combined representation of the parameter and the
16085 default argument. */
16087 }
16093 }
16096 }
16098 /* Parse a template-id.
16100 template-id:
16101 template-name < template-argument-list [opt] >
16103 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
16104 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
16105 returned. Otherwise, if the template-name names a function, or set
16106 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
16107 names a class, returns a TYPE_DECL for the specialization.
16109 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
16110 uninstantiated templates. */
16112 static tree
16118 {
16119 tree templ;
16120 tree arguments;
16121 tree template_id;
16126 /* If the next token corresponds to a template-id, there is no need
16127 to reparse it. */
16130 {
16133 }
16135 /* Avoid performing name lookup if there is no possibility of
16136 finding a template-id. */
16139 && !cp_parser_nth_token_starts_template_argument_list_p
16141 {
16144 }
16146 /* Remember where the template-id starts. */
16152 /* Parse the template-name. */
16155 check_dependency_p,
16156 is_declaration,
16157 tag_type,
16160 {
16163 }
16165 /* Since we're going to preserve any side-effects from this parse, set up a
16166 firewall to protect our callers from cp_parser_commit_to_tentative_parse
16167 in the template arguments. */
16170 /* If we find the sequence `[:' after a template-name, it's probably
16171 a digraph-typo for `< ::'. Substitute the tokens and check if we can
16172 parse correctly the argument list. */
16179 {
16181 /* Change `:' into `::'. */
16183 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
16184 CPP_LESS. */
16187 /* Parse the arguments. */
16190 {
16191 /* If we couldn't parse an argument list, then we revert our changes
16192 and return simply an error. Maybe this is not a template-id
16193 after all. */
16198 }
16199 /* Otherwise, emit an error about the invalid digraph, but continue
16200 parsing because we got our argument list. */
16203 {
16206 "%<<:%> is an alternate spelling for %<[%>."
16209 {
16211 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
16214 }
16215 }
16216 }
16217 else
16218 {
16219 /* Look for the `<' that starts the template-argument-list. */
16221 {
16224 }
16225 /* Parse the arguments. */
16230 && !template_keyword_p
16233 {
16234 /* This didn't go well. */
16236 {
16237 /* C++2A says that "function-name < a;" is now ill-formed. */
16239 {
16242 "operand of %<<%> is ill-formed in C++2a; wrap the "
16244 }
16245 else
16246 /* We expect "f<targs>" to be followed by "(args)". */
16250 /* Purge all subsequent tokens. */
16252 }
16253 else
16257 }
16258 }
16260 /* Set the location to be of the form:
16261 template-name < template-argument-list [opt] >
16262 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
16263 with caret == start at the start of the template-name,
16264 ranging until the closing '>'. */
16265 location_t finish_loc
16267 location_t combined_loc
16270 /* Check for concepts autos where they don't belong. We could
16271 identify types in some cases of idnetifier TEMPL, looking ahead
16272 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
16273 types. We reject them in functions, but if what we have is an
16274 identifier, even with none_type we can't conclude it's NOT a
16275 type, we have to wait for template substitution. */
16278 /* Build a representation of the specialization. */
16281 TEMPLATE_ID_EXPR,
16285 {
16286 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
16287 template (rather than some instantiation thereof) only if
16288 is not nested within some other construct. For example, in
16289 "template <typename T> void f(T) { A<T>::", A<T> is just an
16290 instantiation of A. */
16291 bool entering_scope
16294 template_id
16296 }
16297 /* A template-like identifier may be a partial concept id. */
16303 {
16307 }
16308 else
16309 {
16310 /* If it's not a class-template or a template-template, it should be
16311 a function-template. */
16320 }
16322 /* If parsing tentatively, replace the sequence of tokens that makes
16323 up the template-id with a CPP_TEMPLATE_ID token. That way,
16324 should we re-parse the token stream, we will not have to repeat
16325 the effort required to do the parse, nor will we issue duplicate
16326 error messages about problems during instantiation of the
16327 template. */
16329 /* Don't do this if we had a parse error in a declarator; re-parsing
16330 might succeed if a name changes meaning (60361). */
16334 {
16335 /* Reset the contents of the START_OF_ID token. */
16339 /* Retrieve any deferred checks. Do not pop this access checks yet
16340 so the memory will not be reclaimed during token replacing below. */
16346 /* Purge all subsequent tokens. */
16349 /* ??? Can we actually assume that, if template_id ==
16350 error_mark_node, we will have issued a diagnostic to the
16351 user, as opposed to simply marking the tentative parse as
16352 failed? */
16355 }
16359 }
16361 /* Parse a template-name.
16363 template-name:
16364 identifier
16366 The standard should actually say:
16368 template-name:
16369 identifier
16370 operator-function-id
16372 A defect report has been filed about this issue.
16374 A conversion-function-id cannot be a template name because they cannot
16375 be part of a template-id. In fact, looking at this code:
16377 a.operator K<int>()
16379 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
16380 It is impossible to call a templated conversion-function-id with an
16381 explicit argument list, since the only allowed template parameter is
16382 the type to which it is converting.
16384 If TEMPLATE_KEYWORD_P is true, then we have just seen the
16385 `template' keyword, in a construction like:
16387 T::template f<3>()
16389 In that case `f' is taken to be a template-name, even though there
16390 is no way of knowing for sure.
16392 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
16393 name refers to a set of overloaded functions, at least one of which
16394 is a template, or an IDENTIFIER_NODE with the name of the template,
16395 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
16396 names are looked up inside uninstantiated templates. */
16398 static tree
16405 {
16406 tree identifier;
16407 tree decl;
16410 /* If the next token is `operator', then we have either an
16411 operator-function-id or a conversion-function-id. */
16413 {
16414 /* We don't know whether we're looking at an
16415 operator-function-id or a conversion-function-id. */
16417 /* Try an operator-function-id. */
16419 /* If that didn't work, try a conversion-function-id. */
16421 {
16424 }
16425 }
16426 /* Look for the identifier. */
16427 else
16430 /* If we didn't find an identifier, we don't have a template-id. */
16434 /* If the name immediately followed the `template' keyword, then it
16435 is a template-name. However, if the next token is not `<', then
16436 we do not treat it as a template-name, since it is not being used
16437 as part of a template-id. This enables us to handle constructs
16438 like:
16440 template <typename T> struct S { S(); };
16441 template <typename T> S<T>::S();
16443 correctly. We would treat `S' as a template -- if it were `S<T>'
16444 -- but we do not if there is no `<'. */
16448 {
16449 /* In a declaration, in a dependent context, we pretend that the
16450 "template" keyword was present in order to improve error
16451 recovery. For example, given:
16453 template <typename T> void f(T::X<int>);
16455 we want to treat "X<int>" as a template-id. */
16457 && !template_keyword_p
16459 && check_dependency_p
16461 /* Do not do this for dtors (or ctors), since they never
16462 need the template keyword before their name. */
16464 {
16467 /* Explain what went wrong. */
16469 identifier);
16472 /* If parsing tentatively, find the location of the "<" token. */
16475 /* Parse the template arguments so that we can issue error
16476 messages about them. */
16479 /* Skip tokens until we find a good place from which to
16480 continue parsing. */
16485 /* If parsing tentatively, permanently remove the
16486 template argument list. That will prevent duplicate
16487 error messages from being issued about the missing
16488 "template" keyword. */
16495 }
16497 /* If the "template" keyword is present, then there is generally
16498 no point in doing name-lookup, so we just return IDENTIFIER.
16499 But, if the qualifying scope is non-dependent then we can
16500 (and must) do name-lookup normally. */
16502 {
16508 {
16509 /* We're optimizing away the call to cp_parser_lookup_name, but
16510 we still need to do this. */
16513 }
16514 }
16515 }
16517 /* cp_parser_lookup_name clears OBJECT_TYPE. */
16521 /* Look up the name. */
16523 tag_type,
16526 check_dependency_p,
16532 /* If DECL is a template, then the name was a template-name. */
16534 {
16538 }
16539 else
16540 {
16541 /* The standard does not explicitly indicate whether a name that
16542 names a set of overloaded declarations, some of which are
16543 templates, is a template-name. However, such a name should
16544 be a template-name; otherwise, there is no way to form a
16545 template-id for the overloaded templates. */
16555 && !scoped_p
16557 {
16558 /* [temp.names] says "A name is also considered to refer to a template
16559 if it is an unqualified-id followed by a < and name lookup finds
16560 either one or more functions or finds nothing." */
16562 /* The "more functions" case. Just use the OVERLOAD as normally.
16563 We don't use is_overloaded_fn here to avoid considering
16564 BASELINKs. */
16566 /* Name lookup found one function. */
16569 /* Name lookup found nothing. */
16572 }
16575 {
16576 /* The name does not name a template. */
16579 }
16580 }
16583 }
16585 /* Parse a template-argument-list.
16587 template-argument-list:
16588 template-argument ... [opt]
16589 template-argument-list , template-argument ... [opt]
16591 Returns a TREE_VEC containing the arguments. */
16593 static tree
16595 {
16600 tree vec;
16607 /* Even if the template-id appears in an integral
16608 constant-expression, the contents of the argument list do
16609 not. */
16615 /* Parse the arguments. */
16616 do
16617 {
16618 tree argument;
16621 /* Consume the comma. */
16624 /* Parse the template-argument. */
16627 /* If the next token is an ellipsis, we're expanding a template
16628 argument pack. */
16630 {
16632 {
16636 }
16637 /* Consume the `...' token. */
16640 /* Make the argument into a TYPE_PACK_EXPANSION or
16641 EXPR_PACK_EXPANSION. */
16643 }
16646 {
16650 {
16653 }
16654 else
16656 }
16658 }
16674 }
16676 /* Parse a template-argument.
16678 template-argument:
16679 assignment-expression
16680 type-id
16681 id-expression
16683 The representation is that of an assignment-expression, type-id, or
16684 id-expression -- except that the qualified id-expression is
16685 evaluated, so that the value returned is either a DECL or an
16686 OVERLOAD.
16688 Although the standard says "assignment-expression", it forbids
16689 throw-expressions or assignments in the template argument.
16690 Therefore, we use "conditional-expression" instead. */
16692 static tree
16694 {
16695 tree argument;
16701 cp_id_kind idk;
16703 /* There's really no way to know what we're looking at, so we just
16704 try each alternative in order.
16706 [temp.arg]
16708 In a template-argument, an ambiguity between a type-id and an
16709 expression is resolved to a type-id, regardless of the form of
16710 the corresponding template-parameter.
16712 Therefore, we try a type-id first. */
16715 /* If there was no error parsing the type-id but the next token is a
16716 '>>', our behavior depends on which dialect of C++ we're
16717 parsing. In C++98, we probably found a typo for '> >'. But there
16718 are type-id which are also valid expressions. For instance:
16720 struct X { int operator >> (int); };
16721 template <int V> struct Foo {};
16722 Foo<X () >> 5> r;
16724 Here 'X()' is a valid type-id of a function type, but the user just
16725 wanted to write the expression "X() >> 5". Thus, we remember that we
16726 found a valid type-id, but we still try to parse the argument as an
16727 expression to see what happens.
16729 In C++0x, the '>>' will be considered two separate '>'
16730 tokens. */
16734 {
16737 }
16738 else
16739 {
16740 /* If the next token isn't a `,' or a `>', then this argument wasn't
16741 really finished. This means that the argument is not a valid
16742 type-id. */
16745 /* If that worked, we're done. */
16748 }
16749 /* We're still not sure what the argument will be. */
16751 /* Try a template. */
16759 /* If the next token isn't a `,' or a `>', then this argument wasn't
16760 really finished. */
16764 {
16765 /* Figure out what is being referred to. If the id-expression
16766 was for a class template specialization, then we will have a
16767 TYPE_DECL at this point. There is no need to do name lookup
16768 at this point in that case. */
16771 none_type,
16777 /* Handle a constrained-type-specifier for a non-type template
16778 parameter. */
16784 }
16786 {
16790 }
16791 /* It must be a non-type argument. In C++17 any constant-expression is
16792 allowed. */
16796 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16798 -- an integral constant-expression of integral or enumeration
16799 type; or
16801 -- the name of a non-type template-parameter; or
16803 -- the name of an object or function with external linkage...
16805 -- the address of an object or function with external linkage...
16807 -- a pointer to member... */
16808 /* Look for a non-type template parameter. */
16810 {
16822 }
16824 /* If the next token is "&", the argument must be the address of an
16825 object or function with external linkage. */
16828 {
16831 }
16832 /* See if we might have an id-expression. */
16839 {
16842 address_p,
16849 else
16850 {
16851 tree probe;
16854 {
16855 /* Strip the dereference temporarily. */
16858 }
16860 /* If we're in a template, we represent a qualified-id referring
16861 to a static data member as a SCOPE_REF even if the scope isn't
16862 dependent so that we can check access control later. */
16867 {
16868 /* A variable without external linkage might still be a
16869 valid constant-expression, so no error is issued here
16870 if the external-linkage check fails. */
16873 }
16875 /* All overloaded functions are allowed; if the external
16876 linkage test does not pass, an error will be issued
16877 later. */
16878 ;
16882 /* A pointer-to-member. */
16883 ;
16885 ;
16886 else
16890 {
16893 tf_warning_or_error);
16894 else
16897 }
16898 }
16899 }
16900 /* If the argument started with "&", there are no other valid
16901 alternatives at this point. */
16903 {
16906 }
16908 general_expr:
16909 /* If the argument wasn't successfully parsed as a type-id followed
16910 by '>>', the argument can only be a constant expression now.
16911 Otherwise, we try parsing the constant-expression tentatively,
16912 because the argument could really be a type-id. */
16918 else
16919 {
16920 /* With C++17 generalized non-type template arguments we need to handle
16921 lvalue constant expressions, too. */
16924 }
16932 /* We did our best to parse the argument as a non type-id, but that
16933 was the only alternative that matched (albeit with a '>' after
16934 it). We can assume it's just a typo from the user, and a
16935 diagnostic will then be issued. */
16937 }
16939 /* Parse an explicit-instantiation.
16941 explicit-instantiation:
16942 template declaration
16944 Although the standard says `declaration', what it really means is:
16946 explicit-instantiation:
16947 template decl-specifier-seq [opt] declarator [opt] ;
16949 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16950 supposed to be allowed. A defect report has been filed about this
16951 issue.
16953 GNU Extension:
16955 explicit-instantiation:
16956 storage-class-specifier template
16957 decl-specifier-seq [opt] declarator [opt] ;
16958 function-specifier template
16959 decl-specifier-seq [opt] declarator [opt] ; */
16961 static void
16963 {
16965 cp_decl_specifier_seq decl_specifiers;
16970 /* Look for an (optional) storage-class-specifier or
16971 function-specifier. */
16973 {
16974 extension_specifier
16977 extension_specifier
16980 }
16982 /* Look for the `template' keyword. */
16984 /* Let the front end know that we are processing an explicit
16985 instantiation. */
16987 /* [temp.explicit] says that we are supposed to ignore access
16988 control while processing explicit instantiation directives. */
16990 /* Parse a decl-specifier-seq. */
16992 CP_PARSER_FLAGS_OPTIONAL,
16995 /* If there was exactly one decl-specifier, and it declared a class,
16996 and there's no declarator, then we have an explicit type
16997 instantiation. */
16999 {
17000 tree type;
17004 /* Turn access control back on for names used during
17005 template instantiation. */
17010 }
17011 else
17012 {
17014 tree decl;
17016 /* Parse the declarator. */
17017 declarator
17028 {
17031 "explicit instantiation shall not use"
17035 "explicit instantiation shall not use"
17040 /* Turn access control back on for names used during
17041 template instantiation. */
17043 /* Do the explicit instantiation. */
17045 }
17046 else
17047 {
17049 /* Skip the body of the explicit instantiation. */
17051 }
17052 }
17053 /* We're done with the instantiation. */
17059 }
17061 /* Parse an explicit-specialization.
17063 explicit-specialization:
17064 template < > declaration
17066 Although the standard says `declaration', what it really means is:
17068 explicit-specialization:
17069 template <> decl-specifier [opt] init-declarator [opt] ;
17070 template <> function-definition
17071 template <> explicit-specialization
17072 template <> template-declaration */
17074 static void
17076 {
17080 /* Look for the `template' keyword. */
17082 /* Look for the `<'. */
17084 /* Look for the `>'. */
17086 /* We have processed another parameter list. */
17088 /* [temp]
17090 A template ... explicit specialization ... shall not have C
17091 linkage. */
17093 {
17096 /* Give it C++ linkage to avoid confusing other parts of the
17097 front end. */
17100 }
17101 else
17103 /* Let the front end know that we are beginning a specialization. */
17105 {
17108 }
17110 /* If the next keyword is `template', we need to figure out whether
17111 or not we're looking a template-declaration. */
17113 {
17118 else
17120 }
17121 else
17122 /* Parse the dependent declaration. */
17128 /* We're done with the specialization. */
17130 /* For the erroneous case of a template with C linkage, we pushed an
17131 implicit C++ linkage scope; exit that scope now. */
17134 /* We're done with this parameter list. */
17136 }
17138 /* Parse a type-specifier.
17140 type-specifier:
17141 simple-type-specifier
17142 class-specifier
17143 enum-specifier
17144 elaborated-type-specifier
17145 cv-qualifier
17147 GNU Extension:
17149 type-specifier:
17150 __complex__
17152 Returns a representation of the type-specifier. For a
17153 class-specifier, enum-specifier, or elaborated-type-specifier, a
17154 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
17156 The parser flags FLAGS is used to control type-specifier parsing.
17158 If IS_DECLARATION is TRUE, then this type-specifier is appearing
17159 in a decl-specifier-seq.
17161 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
17162 class-specifier, enum-specifier, or elaborated-type-specifier, then
17163 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
17164 if a type is declared; 2 if it is defined. Otherwise, it is set to
17165 zero.
17167 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
17168 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
17169 is set to FALSE. */
17171 static tree
17173 cp_parser_flags flags,
17178 {
17184 /* Assume this type-specifier does not declare a new type. */
17187 /* And that it does not specify a cv-qualifier. */
17190 /* Peek at the next token. */
17193 /* If we're looking at a keyword, we can use that to guide the
17194 production we choose. */
17197 {
17202 /* Look for the enum-specifier. */
17204 /* If that worked, we're done. */
17206 {
17211 type_spec,
17212 token,
17215 }
17216 else
17219 /* Any of these indicate either a class-specifier, or an
17220 elaborated-type-specifier. */
17227 /* Parse tentatively so that we can back up if we don't find a
17228 class-specifier. */
17230 /* Look for the class-specifier. */
17233 /* If that worked, we're done. */
17235 {
17240 type_spec,
17241 token,
17244 }
17246 /* Fall through. */
17247 elaborated_type_specifier:
17248 /* We're declaring (not defining) a class or enum. */
17252 /* Fall through. */
17254 /* Look for an elaborated-type-specifier. */
17255 type_spec
17256 = (cp_parser_elaborated_type_specifier
17259 is_declaration));
17262 type_spec,
17263 token,
17286 /* The `__complex__' keyword is a GNU extension. */
17292 }
17294 /* Handle simple keywords. */
17296 {
17298 {
17301 }
17303 }
17305 /* If we do not already have a type-specifier, assume we are looking
17306 at a simple-type-specifier. */
17308 decl_specs,
17309 flags);
17311 /* If we didn't find a type-specifier, and a type-specifier was not
17312 optional in this context, issue an error message. */
17314 {
17317 }
17320 }
17322 /* Parse a simple-type-specifier.
17324 simple-type-specifier:
17325 :: [opt] nested-name-specifier [opt] type-name
17326 :: [opt] nested-name-specifier template template-id
17327 char
17328 wchar_t
17329 bool
17330 short
17331 int
17332 long
17333 signed
17334 unsigned
17335 float
17336 double
17337 void
17339 C++11 Extension:
17341 simple-type-specifier:
17342 auto
17343 decltype ( expression )
17344 char16_t
17345 char32_t
17346 __underlying_type ( type-id )
17348 C++17 extension:
17350 nested-name-specifier(opt) template-name
17352 GNU Extension:
17354 simple-type-specifier:
17355 __int128
17356 __typeof__ unary-expression
17357 __typeof__ ( type-id )
17358 __typeof__ ( type-id ) { initializer-list , [opt] }
17360 Concepts Extension:
17362 simple-type-specifier:
17363 constrained-type-specifier
17365 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
17366 appropriately updated. */
17368 static tree
17371 cp_parser_flags flags)
17372 {
17377 /* Peek at the next token. */
17380 /* If we're looking at a keyword, things are easy. */
17382 {
17417 {
17420 }
17449 {
17450 /* The 'auto' might be the placeholder return type for a function decl
17451 with trailing return type. */
17460 {
17462 {
17469 }
17472 {
17475 }
17478 }
17482 {
17485 }
17488 {
17491 }
17492 else
17496 {
17499 "use of %<auto%> in lambda parameter declaration "
17500 "only available with "
17502 }
17505 "use of %<auto%> in parameter declaration "
17506 "only available with "
17510 "use of %<auto%> in parameter declaration "
17512 }
17513 else
17518 /* Since DR 743, decltype can either be a simple-type-specifier by
17519 itself or begin a nested-name-specifier. Parsing it will replace
17520 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17521 handling below decide what to do. */
17527 /* Consume the `typeof' token. */
17529 /* Parse the operand to `typeof'. */
17531 /* If it is not already a TYPE, take its type. */
17537 token,
17546 token,
17556 token,
17561 }
17563 /* If token is an already-parsed decltype not followed by ::,
17564 it's a simple-type-specifier. */
17567 {
17570 {
17572 token,
17574 /* Remember that we are handling a decltype in order to
17575 implement the resolution of DR 1510 when the argument
17576 isn't instantiation dependent. */
17578 }
17581 }
17583 /* If the type-specifier was for a built-in type, we're done. */
17585 {
17586 /* Record the type. */
17593 type,
17594 token,
17599 /* Consume the token. */
17605 /* There is no valid C++ program where a non-template type is
17606 followed by a "<". That usually indicates that the user thought
17607 that the type was a template. */
17612 }
17614 /* The type-specifier must be a user-defined type. */
17616 {
17620 /* Don't gobble tokens or issue error messages if this is an
17621 optional type-specifier. */
17627 /* Look for the optional `::' operator. */
17628 global_p
17632 /* Look for the nested-name specifier. */
17633 qualified_p
17640 /* If we have seen a nested-name-specifier, and the next token
17641 is `template', then we are using the template-id production. */
17644 {
17645 /* Look for the template-id. */
17649 none_type,
17651 /* If the template-id did not name a type, we are out of
17652 luck. */
17654 {
17657 }
17658 }
17659 /* Otherwise, look for a type-name. */
17660 else
17662 /* Keep track of all name-lookups performed in class scopes. */
17664 && !global_p
17665 && !qualified_p
17669 /* If it didn't work out, we don't have a TYPE. */
17674 {
17688 {
17690 none_type,
17700 else
17701 {
17706 }
17707 }
17708 else
17714 }
17717 token,
17719 }
17721 /* If we didn't get a type-name, issue an error message. */
17723 {
17726 }
17729 {
17730 /* See if TYPE is an Objective-C type, and if so, parse and
17731 accept any protocol references following it. Do this before
17732 the cp_parser_check_for_invalid_template_id() call, because
17733 Objective-C types can be followed by '<...>' which would
17734 enclose protocol names rather than template arguments, and so
17735 everything is fine. */
17738 {
17742 /* Clobber the "unqualified" type previously entered into
17743 DECL_SPECS with the new, improved protocol-qualified version. */
17748 }
17750 /* There is no valid C++ program where a non-template type is
17751 followed by a "<". That usually indicates that the user
17752 thought that the type was a template. */
17754 none_type,
17756 }
17759 }
17761 /* Parse a type-name.
17763 type-name:
17764 class-name
17765 enum-name
17766 typedef-name
17767 simple-template-id [in c++0x]
17769 enum-name:
17770 identifier
17772 typedef-name:
17773 identifier
17775 Concepts:
17777 type-name:
17778 concept-name
17779 partial-concept-id
17781 concept-name:
17782 identifier
17784 Returns a TYPE_DECL for the type. */
17786 static tree
17788 {
17790 }
17792 /* See above. */
17793 static tree
17795 {
17796 tree type_decl;
17798 /* We can't know yet whether it is a class-name or not. */
17800 /* Try a class-name. */
17802 typename_keyword_p,
17804 none_type,
17808 /* If it's not a class-name, keep looking. */
17810 {
17812 /* It must be a typedef-name or an enum-name. */
17816 /* It is either a simple-template-id representing an
17817 instantiation of an alias template... */
17821 none_type,
17823 /* Note that this must be an instantiation of an alias template
17824 because [temp.names]/6 says:
17826 A template-id that names an alias template specialization
17827 is a type-name.
17829 Whereas [temp.names]/7 says:
17831 A simple-template-id that names a class template
17832 specialization is a class-name.
17834 With concepts, this could also be a partial-concept-id that
17835 declares a non-type template parameter. */
17842 else
17846 /* ... Or a typedef-name or an enum-name. */
17848 }
17851 }
17853 /* Check if DECL and ARGS can form a constrained-type-specifier.
17854 If ARGS is non-null, we try to form a concept check of the
17855 form DECL<?, ARGS> where ? is a wildcard that matches any
17856 kind of template argument. If ARGS is NULL, then we try to
17857 form a concept check of the form DECL<?>. */
17859 static tree
17862 {
17865 /* If we a constrained-type-specifier cannot be deduced. */
17869 /* A constrained type specifier can only be found in an
17870 overload set or as a reference to a template declaration.
17872 FIXME: This might be masking a bug. It's possible that
17873 that the deduction below is causing template specializations
17874 to be formed with the wildcard as an argument. */
17878 /* Try to build a call expression that evaluates the
17879 concept. This can fail if the overload set refers
17880 only to non-templates. */
17886 /* Deduce the checked constraint and the prototype parameter.
17888 FIXME: In certain cases, failure to deduce should be a
17889 diagnosable error. */
17890 tree conc;
17891 tree proto;
17895 /* In template parameter scope, this results in a constrained
17896 parameter. Return a descriptor of that parm. */
17900 /* In a parameter-declaration-clause, constrained-type
17901 specifiers result in invented template parameters. */
17903 {
17906 }
17907 else
17908 {
17909 /* Otherwise, we're in a context where the constrained
17910 type name is deduced and the constraint applies
17911 after deduction. */
17913 }
17916 }
17918 /* If DECL refers to a concept, return a TYPE_DECL representing
17919 the result of using the constrained type specifier in the
17920 current context. DECL refers to a concept if
17922 - it is an overload set containing a function concept taking a single
17923 type argument, or
17925 - it is a variable concept taking a single type argument. */
17927 static tree
17929 {
17935 else
17937 }
17939 /* Check if DECL and ARGS form a partial-concept-id. If so,
17940 assign ID to the resulting constrained placeholder.
17942 Returns true if the partial-concept-id designates a placeholder
17943 and false otherwise. Note that *id is set to NULL_TREE in
17944 this case. */
17946 static tree
17948 {
17950 }
17952 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17953 or a concept-name.
17955 enum-name:
17956 identifier
17958 typedef-name:
17959 identifier
17961 concept-name:
17962 identifier
17964 Returns a TYPE_DECL for the type. */
17966 static tree
17968 {
17969 tree type_decl;
17970 tree identifier;
17977 /* Look up the type-name. */
17982 /* If we found an overload set, then it may refer to a concept-name. */
17988 {
17989 /* See if this is an Objective-C type. */
17994 }
17996 /* Issue an error if we did not find a type-name. */
17998 /* In Objective-C, we have the complication that class names are
17999 normally type names and start declarations (eg, the
18000 "NSObject" in "NSObject *object;"), but can be used in an
18001 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
18002 is an expression. So, a classname followed by a dot is not a
18003 valid type-name. */
18006 {
18011 }
18012 /* Remember that the name was used in the definition of the
18013 current class so that we can check later to see if the
18014 meaning would have been different after the class was
18015 entirely defined. */
18021 }
18023 /* Parse an elaborated-type-specifier. Note that the grammar given
18024 here incorporates the resolution to DR68.
18026 elaborated-type-specifier:
18027 class-key :: [opt] nested-name-specifier [opt] identifier
18028 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
18029 enum-key :: [opt] nested-name-specifier [opt] identifier
18030 typename :: [opt] nested-name-specifier identifier
18031 typename :: [opt] nested-name-specifier template [opt]
18032 template-id
18034 GNU extension:
18036 elaborated-type-specifier:
18037 class-key attributes :: [opt] nested-name-specifier [opt] identifier
18038 class-key attributes :: [opt] nested-name-specifier [opt]
18039 template [opt] template-id
18040 enum attributes :: [opt] nested-name-specifier [opt] identifier
18042 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
18043 declared `friend'. If IS_DECLARATION is TRUE, then this
18044 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
18045 something is being declared.
18047 Returns the TYPE specified. */
18049 static tree
18053 {
18055 tree identifier;
18058 tree globalscope;
18061 /* See if we're looking at the `enum' keyword. */
18063 {
18064 /* Consume the `enum' token. */
18066 /* Remember that it's an enumeration type. */
18068 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
18069 enums) is used here. */
18073 {
18080 /* Consume the `struct' or `class' and parse it anyway. */
18082 }
18083 /* Parse the attributes. */
18085 }
18086 /* Or, it might be `typename'. */
18088 RID_TYPENAME))
18089 {
18090 /* Consume the `typename' token. */
18092 /* Remember that it's a `typename' type. */
18094 }
18095 /* Otherwise it must be a class-key. */
18096 else
18097 {
18101 /* Parse the attributes. */
18103 }
18105 /* Look for the `::' operator. */
18108 /* Look for the nested-name-specifier. */
18109 tree nested_name_specifier;
18111 {
18112 nested_name_specifier
18117 is_declaration);
18120 }
18121 else
18122 /* Even though `typename' is not present, the proposed resolution
18123 to Core Issue 180 says that in `class A<T>::B', `B' should be
18124 considered a type-name, even if `A<T>' is dependent. */
18125 nested_name_specifier
18130 is_declaration);
18131 /* For everything but enumeration types, consider a template-id.
18132 For an enumeration type, consider only a plain identifier. */
18134 {
18136 tree decl;
18138 /* Allow the `template' keyword. */
18140 /* If we didn't see `template', we don't know if there's a
18141 template-id or not. */
18144 /* The `template' keyword must follow a nested-name-specifier. */
18146 {
18150 }
18152 /* Parse the template-id. */
18156 tag_type,
18157 is_declaration);
18158 /* If we didn't find a template-id, look for an ordinary
18159 identifier. */
18161 ;
18162 /* We can get here when cp_parser_template_id, called by
18163 cp_parser_class_name with tag_type == none_type, succeeds
18164 and caches a BASELINK. Then, when called again here,
18165 instead of failing and returning an error_mark_node
18166 returns it (see template/typename17.C in C++11).
18167 ??? Could we diagnose this earlier? */
18169 {
18172 }
18173 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
18174 in effect, then we must assume that, upon instantiation, the
18175 template will correspond to a class. */
18179 typename_type,
18181 /* If the `typename' keyword is in effect and DECL is not a type
18182 decl, then type is non existent. */
18184 ;
18186 {
18190 /* If the next token is a semicolon, this must be a specialization,
18191 instantiation, or friend declaration. Check the scope while we
18192 still know whether or not we had a nested-name-specifier. */
18197 }
18200 }
18203 {
18208 {
18211 }
18213 /* For a `typename', we needn't call xref_tag. */
18219 /* Template parameter lists apply only if we are not within a
18220 function parameter list. */
18221 bool template_parm_lists_apply
18230 /* Look up a qualified name in the usual way. */
18232 {
18233 tree decl;
18234 tree ambiguous_decls;
18237 tag_type,
18244 /* If the lookup was ambiguous, an error will already have been
18245 issued. */
18249 /* If we are parsing friend declaration, DECL may be a
18250 TEMPLATE_DECL tree node here. However, we need to check
18251 whether this TEMPLATE_DECL results in valid code. Consider
18252 the following example:
18254 namespace N {
18255 template <class T> class C {};
18256 }
18257 class X {
18258 template <class T> friend class N::C; // #1, valid code
18259 };
18260 template <class T> class Y {
18261 friend class N::C; // #2, invalid code
18262 };
18264 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
18265 name lookup of `N::C'. We see that friend declaration must
18266 be template for the code to be valid. Note that
18267 processing_template_decl does not work here since it is
18268 always 1 for the above two cases. */
18270 decl = (cp_parser_maybe_treat_template_as_class
18275 {
18277 identifier,
18280 }
18283 {
18287 allow_template);
18291 }
18293 /* Forward declarations of nested types, such as
18295 class C1::C2;
18296 class C1::C2::C3;
18298 are invalid unless all components preceding the final '::'
18299 are complete. If all enclosing types are complete, these
18300 declarations become merely pointless.
18302 Invalid forward declarations of nested types are errors
18303 caught elsewhere in parsing. Those that are pointless arrive
18304 here. */
18311 }
18312 else
18313 {
18314 /* An elaborated-type-specifier sometimes introduces a new type and
18315 sometimes names an existing type. Normally, the rule is that it
18316 introduces a new type only if there is not an existing type of
18317 the same name already in scope. For example, given:
18319 struct S {};
18320 void f() { struct S s; }
18322 the `struct S' in the body of `f' is the same `struct S' as in
18323 the global scope; the existing definition is used. However, if
18324 there were no global declaration, this would introduce a new
18325 local class named `S'.
18327 An exception to this rule applies to the following code:
18329 namespace N { struct S; }
18331 Here, the elaborated-type-specifier names a new type
18332 unconditionally; even if there is already an `S' in the
18333 containing scope this declaration names a new type.
18334 This exception only applies if the elaborated-type-specifier
18335 forms the complete declaration:
18337 [class.name]
18339 A declaration consisting solely of `class-key identifier ;' is
18340 either a redeclaration of the name in the current scope or a
18341 forward declaration of the identifier as a class name. It
18342 introduces the name into the current scope.
18344 We are in this situation precisely when the next token is a `;'.
18346 An exception to the exception is that a `friend' declaration does
18347 *not* name a new type; i.e., given:
18349 struct S { friend struct T; };
18351 `T' is not a new type in the scope of `S'.
18353 Also, `new struct S' or `sizeof (struct S)' never results in the
18354 definition of a new type; a new type can only be declared in a
18355 declaration context. */
18357 tag_scope ts;
18361 /* Friends have special name lookup rules. */
18365 CPP_SEMICOLON))
18366 /* This is a `class-key identifier ;' */
18368 else
18371 template_p =
18372 (template_parm_lists_apply
18375 /* An unqualified name was used to reference this type, so
18376 there were no qualifying templates. */
18385 }
18386 }
18391 /* Allow attributes on forward declarations of classes. */
18393 {
18403 else
18406 }
18409 {
18410 /* Indicate whether this class was declared as a `class' or as a
18411 `struct'. */
18415 }
18417 /* A "<" cannot follow an elaborated type specifier. If that
18418 happens, the user was probably trying to form a template-id. */
18423 }
18425 /* Parse an enum-specifier.
18427 enum-specifier:
18428 enum-head { enumerator-list [opt] }
18429 enum-head { enumerator-list , } [C++0x]
18431 enum-head:
18432 enum-key identifier [opt] enum-base [opt]
18433 enum-key nested-name-specifier identifier enum-base [opt]
18435 enum-key:
18436 enum
18437 enum class [C++0x]
18438 enum struct [C++0x]
18440 enum-base: [C++0x]
18441 : type-specifier-seq
18443 opaque-enum-specifier:
18444 enum-key identifier enum-base [opt] ;
18446 GNU Extensions:
18447 enum-key attributes[opt] identifier [opt] enum-base [opt]
18448 { enumerator-list [opt] }attributes[opt]
18449 enum-key attributes[opt] identifier [opt] enum-base [opt]
18450 { enumerator-list, }attributes[opt] [C++0x]
18452 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
18453 if the token stream isn't an enum-specifier after all. */
18455 static tree
18457 {
18458 tree identifier;
18460 tree prev_scope;
18462 tree attributes;
18475 /* Parse tentatively so that we can back up if we don't find a
18476 enum-specifier. */
18479 /* Caller guarantees that the current token is 'enum', an identifier
18480 possibly follows, and the token after that is an opening brace.
18481 If we don't have an identifier, fabricate an anonymous name for
18482 the enumeration being defined. */
18485 /* Parse the "class" or "struct", which indicates a scoped
18486 enumeration type in C++0x. */
18489 {
18493 /* Consume the `struct' or `class' token. */
18497 }
18501 /* Clear the qualification. */
18506 /* Figure out in what scope the declaration is being placed. */
18512 nested_name_specifier
18520 {
18521 tree name;
18525 enum_type,
18530 input_location);
18532 {
18535 {
18536 /* Are template enums allowed in ISO? */
18540 /* ignore a typename reference, for it will be solved by name
18541 in start_enum. */
18543 }
18544 }
18547 else
18548 {
18553 }
18554 }
18555 else
18556 {
18559 else
18560 {
18566 }
18567 }
18570 /* Check for the `:' that denotes a specified underlying type in C++0x.
18571 Note that a ':' could also indicate a bitfield width, however. */
18573 {
18574 cp_decl_specifier_seq type_specifiers;
18576 /* Consume the `:'. */
18579 /* Parse the type-specifier-seq. */
18584 /* At this point this is surely not elaborated type specifier. */
18593 /* If that didn't work, stop. */
18595 {
18601 }
18602 }
18604 /* Look for the `{' but don't consume it yet. */
18606 {
18608 {
18611 {
18614 }
18615 }
18616 /* An opaque-enum-specifier must have a ';' here. */
18619 {
18622 {
18625 }
18626 }
18627 }
18633 {
18635 {
18639 }
18641 {
18643 }
18644 }
18646 /* Issue an error message if type-definitions are forbidden here. */
18649 else
18650 /* Create the new type. We do this before consuming the opening
18651 brace so the enum will be recorded as being on the line of its
18652 tag (or the 'enum' keyword, if there is no tag). */
18656 /* If the next token is not '{' it is an opaque-enum-specifier or an
18657 elaborated-type-specifier. */
18659 {
18663 {
18664 /* The following catches invalid code such as:
18665 enum class S<int>::E { A, B, C }; */
18673 {
18677 nested_name_specifier);
18679 }
18682 {
18684 "%qT for enum declaration does not name a class "
18687 }
18688 /* If that scope does not contain the scope in which the
18689 class was originally declared, the program is invalid. */
18691 nested_name_specifier))
18692 {
18695 "declaration of %qD in namespace %qD which does not "
18698 else
18700 "declaration of %qD in %qD which does not "
18704 }
18705 /* If that scope is the scope where the declaration is being placed
18706 the program is invalid. */
18710 {
18714 }
18715 }
18720 /* Consume the opening brace. */
18721 matching_braces braces;
18728 {
18732 }
18733 else
18734 {
18740 }
18744 /* If the next token is not '}', then there are some enumerators. */
18746 {
18750 }
18751 else
18754 /* Consume the final '}'. */
18760 }
18761 else
18762 {
18763 /* If a ';' follows, then it is an opaque-enum-specifier
18764 and additional restrictions apply. */
18766 {
18773 }
18774 }
18776 /* Look for trailing attributes to apply to this enumeration, and
18777 apply them if appropriate. */
18779 {
18782 trailing_attr,
18784 }
18786 /* Finish up the enumeration. */
18788 {
18793 }
18796 {
18798 {
18801 }
18803 {
18805 }
18806 }
18807 out:
18810 }
18812 /* Parse an enumerator-list. The enumerators all have the indicated
18813 TYPE.
18815 enumerator-list:
18816 enumerator-definition
18817 enumerator-list , enumerator-definition */
18819 static void
18821 {
18823 {
18824 /* Parse an enumerator-definition. */
18827 /* If the next token is not a ',', we've reached the end of
18828 the list. */
18831 /* Otherwise, consume the `,' and keep going. */
18833 /* If the next token is a `}', there is a trailing comma. */
18835 {
18840 }
18841 }
18842 }
18844 /* Parse an enumerator-definition. The enumerator has the indicated
18845 TYPE.
18847 enumerator-definition:
18848 enumerator
18849 enumerator = constant-expression
18851 enumerator:
18852 identifier
18854 GNU Extensions:
18856 enumerator-definition:
18857 enumerator attributes [opt]
18858 enumerator attributes [opt] = constant-expression */
18860 static void
18862 {
18863 tree identifier;
18864 tree value;
18865 location_t loc;
18867 /* Save the input location because we are interested in the location
18868 of the identifier and not the location of the explicit value. */
18871 /* Look for the identifier. */
18876 /* Parse any specified attributes. */
18879 /* If the next token is an '=', then there is an explicit value. */
18881 {
18882 /* Consume the `=' token. */
18884 /* Parse the value. */
18886 }
18887 else
18890 /* If we are processing a template, make sure the initializer of the
18891 enumerator doesn't contain any bare template parameter pack. */
18895 /* Create the enumerator. */
18897 }
18899 /* Parse a namespace-name.
18901 namespace-name:
18902 original-namespace-name
18903 namespace-alias
18905 Returns the NAMESPACE_DECL for the namespace. */
18907 static tree
18909 {
18910 tree identifier;
18911 tree namespace_decl;
18915 /* Get the name of the namespace. */
18920 /* Look up the identifier in the currently active scope. Look only
18921 for namespaces, due to:
18923 [basic.lookup.udir]
18925 When looking up a namespace-name in a using-directive or alias
18926 definition, only namespace names are considered.
18928 And:
18930 [basic.lookup.qual]
18932 During the lookup of a name preceding the :: scope resolution
18933 operator, object, function, and enumerator names are ignored.
18935 (Note that cp_parser_qualifying_entity only calls this
18936 function if the token after the name is the scope resolution
18937 operator.) */
18939 none_type,
18945 /* If it's not a namespace, issue an error. */
18948 {
18950 {
18951 auto_diagnostic_group d;
18952 name_hint hint;
18956 identifier,
18959 {
18965 }
18966 else
18968 identifier);
18969 }
18970 else
18973 }
18976 }
18978 /* Parse a namespace-definition.
18980 namespace-definition:
18981 named-namespace-definition
18982 unnamed-namespace-definition
18984 named-namespace-definition:
18985 original-namespace-definition
18986 extension-namespace-definition
18988 original-namespace-definition:
18989 namespace identifier { namespace-body }
18991 extension-namespace-definition:
18992 namespace original-namespace-name { namespace-body }
18994 unnamed-namespace-definition:
18995 namespace { namespace-body } */
18997 static void
18999 {
19000 tree identifier;
19009 {
19012 }
19014 /* Look for the `namespace' keyword. */
19015 cp_token* token
19018 /* Parse any specified attributes before the identifier. */
19022 {
19026 {
19031 "standard attributes on namespaces must precede "
19034 /* Parse any attributes specified after the identifier. */
19036 }
19043 "nested namespace definitions only available with "
19046 /* Nested namespace names can create new namespaces (unlike
19047 other qualified-ids). */
19050 else
19053 }
19065 /* Start the namespace. */
19072 /* Look for the `{' to validate starting the namespace. */
19073 matching_braces braces;
19075 {
19076 /* Parse the body of the namespace. */
19079 /* Look for the final `}'. */
19081 }
19086 /* Pop the nested namespace definitions. */
19089 }
19091 /* Parse a namespace-body.
19093 namespace-body:
19094 declaration-seq [opt] */
19096 static void
19098 {
19100 }
19102 /* Parse a namespace-alias-definition.
19104 namespace-alias-definition:
19105 namespace identifier = qualified-namespace-specifier ; */
19107 static void
19109 {
19110 tree identifier;
19111 tree namespace_specifier;
19115 /* Look for the `namespace' keyword. */
19117 /* Look for the identifier. */
19121 /* Look for the `=' token. */
19124 {
19126 /* Skip the definition. */
19131 }
19133 /* Look for the qualified-namespace-specifier. */
19134 namespace_specifier
19136 /* Look for the `;' token. */
19139 /* Register the alias in the symbol table. */
19141 }
19143 /* Parse a qualified-namespace-specifier.
19145 qualified-namespace-specifier:
19146 :: [opt] nested-name-specifier [opt] namespace-name
19148 Returns a NAMESPACE_DECL corresponding to the specified
19149 namespace. */
19151 static tree
19153 {
19154 /* Look for the optional `::'. */
19158 /* Look for the optional nested-name-specifier. */
19166 }
19168 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
19169 access declaration.
19171 using-declaration:
19172 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
19173 using :: unqualified-id ;
19175 access-declaration:
19176 qualified-id ;
19178 */
19180 static bool
19183 {
19187 tree decl;
19188 tree identifier;
19189 tree qscope;
19194 {
19197 }
19198 else
19199 {
19200 /* Look for the `using' keyword. */
19203 again:
19204 /* Peek at the next token. */
19206 /* See if it's `typename'. */
19208 {
19209 /* Remember that we've seen it. */
19211 /* Consume the `typename' token. */
19213 }
19214 }
19216 /* Look for the optional global scope qualification. */
19217 global_scope_p
19222 /* If we saw `typename', or didn't see `::', then there must be a
19223 nested-name-specifier present. */
19225 {
19231 {
19234 }
19235 }
19236 /* Otherwise, we could be in either of the two productions. In that
19237 case, treat the nested-name-specifier as optional. */
19238 else
19250 /* Something has already gone wrong; there's no need to parse
19251 further. Since an error has occurred, the return value of
19252 cp_parser_parse_definitely will be false, as required. */
19256 /* Parse the unqualified-id. */
19264 {
19269 }
19271 {
19276 "pack expansion in using-declaration only available "
19279 }
19281 /* The function we call to handle a using-declaration is different
19282 depending on what scope we are in. */
19284 ;
19287 /* [namespace.udecl]
19289 A using declaration shall not name a template-id. */
19292 else
19293 {
19295 {
19296 /* Create the USING_DECL. */
19303 {
19306 }
19307 else
19308 /* Add it to the list of members in this class. */
19310 }
19311 else
19312 {
19314 identifier,
19321 {
19324 }
19327 else
19329 }
19330 }
19334 {
19338 "comma-separated list in using-declaration only available "
19341 }
19343 /* Look for the final `;'. */
19348 "access declarations are deprecated "
19349 "in favour of using-declarations; "
19353 }
19355 /* Parse an alias-declaration.
19357 alias-declaration:
19358 using identifier attribute-specifier-seq [opt] = type-id */
19360 static tree
19362 {
19366 cp_decl_specifier_seq decl_specs;
19370 /* Look for the `using' keyword. */
19371 cp_token *using_token
19393 /* Now we are going to parse the type-id of the declaration. */
19395 /*
19396 [dcl.type]/3 says:
19398 "A type-specifier-seq shall not define a class or enumeration
19399 unless it appears in the type-id of an alias-declaration (7.1.3) that
19400 is not the declaration of a template-declaration."
19402 In other words, if we currently are in an alias template, the
19403 type-id should not define a type.
19405 So let's set parser->type_definition_forbidden_message in that
19406 case; cp_parser_check_type_definition (called by
19407 cp_parser_class_specifier) will then emit an error if a type is
19408 defined in the type-id. */
19410 {
19414 }
19418 /* Restore the error message if need be. */
19424 {
19427 }
19429 /* A typedef-name can also be introduced by an alias-declaration. The
19430 identifier following the using keyword becomes a typedef-name. It has
19431 the same semantics as if it were introduced by the typedef
19432 specifier. In particular, it does not define a new type and it shall
19433 not appear in the type-id. */
19438 {
19441 ds_attribute,
19442 attrs_token);
19443 }
19445 ds_typedef,
19446 using_token);
19448 ds_alias,
19449 using_token);
19456 id_location,
19466 else
19472 // Attach constraints to the alias declaration.
19474 {
19478 }
19485 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19486 added into the symbol table; otherwise, return the TYPE_DECL. */
19490 {
19494 }
19497 }
19499 /* Parse a using-directive.
19501 using-directive:
19502 using namespace :: [opt] nested-name-specifier [opt]
19503 namespace-name ; */
19505 static void
19507 {
19508 tree namespace_decl;
19509 tree attribs;
19511 /* Look for the `using' keyword. */
19513 /* And the `namespace' keyword. */
19515 /* Look for the optional `::' operator. */
19517 /* And the optional nested-name-specifier. */
19523 /* Get the namespace being used. */
19525 /* And any specified attributes. */
19528 /* Update the symbol table. */
19531 else
19534 /* Look for the final `;'. */
19536 }
19538 /* Parse an asm-definition.
19540 asm-definition:
19541 asm ( string-literal ) ;
19543 GNU Extension:
19545 asm-definition:
19546 asm volatile [opt] ( string-literal ) ;
19547 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19548 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19549 : asm-operand-list [opt] ) ;
19550 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19551 : asm-operand-list [opt]
19552 : asm-clobber-list [opt] ) ;
19553 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19554 : asm-clobber-list [opt]
19555 : asm-goto-list ) ; */
19557 static void
19559 {
19560 tree string;
19565 tree asm_stmt;
19573 /* Look for the `asm' keyword. */
19578 {
19581 }
19583 /* See if the next token is `volatile'. */
19586 {
19587 /* Remember that we saw the `volatile' keyword. */
19589 /* Consume the token. */
19591 }
19595 {
19596 /* Remember that we saw the `goto' keyword. */
19598 /* Consume the token. */
19600 }
19601 /* Look for the opening `('. */
19604 /* Look for the string. */
19607 {
19611 }
19613 /* If we're allowing GNU extensions, check for the extended assembly
19614 syntax. Unfortunately, the `:' tokens need not be separated by
19615 a space in C, and so, for compatibility, we tolerate that here
19616 too. Doing that means that we have to treat the `::' operator as
19617 two `:' tokens. */
19622 {
19627 /* The extended syntax was used. */
19630 /* Look for outputs. */
19632 {
19633 /* Consume the `:'. */
19635 /* Parse the output-operands. */
19637 CPP_COLON)
19639 CPP_SCOPE)
19641 CPP_CLOSE_PAREN)
19643 {
19647 }
19648 }
19649 /* If the next token is `::', there are no outputs, and the
19650 next token is the beginning of the inputs. */
19652 /* The inputs are coming next. */
19655 /* Look for inputs. */
19658 {
19659 /* Consume the `:' or `::'. */
19661 /* Parse the output-operands. */
19663 CPP_COLON)
19665 CPP_SCOPE)
19667 CPP_CLOSE_PAREN))
19668 {
19672 }
19673 }
19675 /* The clobbers are coming next. */
19678 /* Look for clobbers. */
19681 {
19683 /* Consume the `:' or `::'. */
19685 /* Parse the clobbers. */
19687 CPP_COLON)
19689 CPP_CLOSE_PAREN))
19691 }
19694 /* The labels are coming next. */
19697 /* Look for labels. */
19700 {
19702 /* Consume the `:' or `::'. */
19704 /* Parse the labels. */
19706 }
19710 }
19714 /* Look for the closing `)'. */
19722 {
19723 /* Create the ASM_EXPR. */
19725 {
19728 /* If the extended syntax was not used, mark the ASM_EXPR. */
19730 {
19736 }
19737 }
19738 else
19740 }
19741 }
19743 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19744 type that comes from the decl-specifier-seq. */
19746 static tree
19748 {
19751 {
19764 }
19767 }
19769 /* Declarators [gram.dcl.decl] */
19771 /* Parse an init-declarator.
19773 init-declarator:
19774 declarator initializer [opt]
19776 GNU Extension:
19778 init-declarator:
19779 declarator asm-specification [opt] attributes [opt] initializer [opt]
19781 function-definition:
19782 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19783 function-body
19784 decl-specifier-seq [opt] declarator function-try-block
19786 GNU Extension:
19788 function-definition:
19789 __extension__ function-definition
19791 TM Extension:
19793 function-definition:
19794 decl-specifier-seq [opt] declarator function-transaction-block
19796 The DECL_SPECIFIERS apply to this declarator. Returns a
19797 representation of the entity declared. If MEMBER_P is TRUE, then
19798 this declarator appears in a class scope. The new DECL created by
19799 this declarator is returned.
19801 The CHECKS are access checks that should be performed once we know
19802 what entity is being declared (and, therefore, what classes have
19803 befriended it).
19805 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19806 for a function-definition here as well. If the declarator is a
19807 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19808 be TRUE upon return. By that point, the function-definition will
19809 have been completely parsed.
19811 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19812 is FALSE.
19814 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19815 parsed declaration if it is an uninitialized single declarator not followed
19816 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19817 if present, will not be consumed. If returned, this declarator will be
19818 created with SD_INITIALIZED but will not call cp_finish_decl.
19820 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19821 and there is an initializer, the pointed location_t is set to the
19822 location of the '=' or `(', or '{' in C++11 token introducing the
19823 initializer. */
19825 static tree
19836 {
19840 tree prefix_attributes;
19842 tree asm_specification;
19843 tree initializer;
19845 tree scope;
19847 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19848 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19849 "(...)". */
19860 /* Gather the attributes that were provided with the
19861 decl-specifiers. */
19864 /* Assume that this is not the declarator for a function
19865 definition. */
19869 /* Default arguments are only permitted for function parameters. */
19873 /* Defer access checks while parsing the declarator; we cannot know
19874 what names are accessible until we know what is being
19875 declared. */
19880 /* Parse the declarator. */
19881 declarator
19886 /* Gather up the deferred checks. */
19891 /* If the DECLARATOR was erroneous, there's no need to go
19892 further. */
19896 /* Check that the number of template-parameter-lists is OK. */
19906 /* Figure out what scope the entity declared by the DECLARATOR is
19907 located in. `grokdeclarator' sometimes changes the scope, so
19908 we compute it now. */
19911 /* Perform any lookups in the declared type which were thought to be
19912 dependent, but are not in the scope of the declarator. */
19913 decl_specifiers->type
19916 /* If we're allowing GNU extensions, look for an
19917 asm-specification. */
19919 {
19920 /* Look for an asm-specification. */
19923 }
19924 else
19927 /* Look for attributes. */
19931 /* Peek at the next token. */
19937 {
19938 /* Handle C++17 deduction guides. */
19942 {
19950 {
19954 }
19955 }
19957 /* Check to see if the token indicates the start of a
19958 function-definition. */
19960 {
19962 {
19963 /* If a function-definition should not appear here, issue an
19964 error message. */
19968 }
19970 location_t func_brace_location
19973 /* Neither attributes nor an asm-specification are allowed
19974 on a function-definition. */
19977 "an asm-specification is not allowed "
19981 "attributes are not allowed "
19983 /* This is a function-definition. */
19986 /* Parse the function definition. */
19989 decl_specifiers,
19990 declarator,
19991 prefix_attributes);
19992 else
19993 decl =
19994 (cp_parser_function_definition_from_specifiers_and_declarator
19998 {
19999 /* This is where the prologue starts... */
20002 }
20005 }
20006 }
20008 {
20009 /* A non-template declaration involving a function parameter list
20010 containing an implicit template parameter will be made into a
20011 template. If the resulting declaration is not going to be an
20012 actual function then finish the template scope here to prevent it.
20013 An error message will be issued once we have a decl to talk about.
20015 FIXME probably we should do type deduction rather than create an
20016 implicit template, but the standard currently doesn't allow it. */
20019 }
20021 /* [dcl.dcl]
20023 Only in function declarations for constructors, destructors, type
20024 conversions, and deduction guides can the decl-specifier-seq be omitted.
20026 We explicitly postpone this check past the point where we handle
20027 function-definitions because we tolerate function-definitions
20028 that are missing their return types in some modes. */
20030 {
20034 }
20036 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
20040 {
20051 {
20057 }
20058 }
20059 else
20060 {
20061 /* If the init-declarator isn't initialized and isn't followed by a
20062 `,' or `;', it's not a valid init-declarator. */
20065 {
20068 else
20069 {
20073 }
20074 }
20077 }
20079 /* Because start_decl has side-effects, we should only call it if we
20080 know we're going ahead. By this point, we know that we cannot
20081 possibly be looking at any other construct. */
20084 /* Enter the newly declared entry in the symbol table. If we're
20085 processing a declaration in a class-specifier, we wait until
20086 after processing the initializer. */
20088 {
20096 /* Adjust location of decl if declarator->id_loc is more appropriate:
20097 set, and decl wasn't merged with another decl, in which case its
20098 location would be different from input_location, and more accurate. */
20103 }
20105 /* Enter the SCOPE. That way unqualified names appearing in the
20106 initializer will be looked up in SCOPE. */
20109 /* Perform deferred access control checks, now that we know in which
20110 SCOPE the declared entity resides. */
20112 {
20115 /* If the entity being declared is a function, pretend that we
20116 are in its scope. If it is a `friend', it may have access to
20117 things that would not otherwise be accessible. */
20119 {
20122 }
20124 /* Perform access checks for template parameters. */
20127 /* Perform the access control checks for the declarator and the
20128 decl-specifiers. */
20131 /* Restore the saved value. */
20134 }
20136 /* Parse the initializer. */
20141 {
20143 {
20146 else
20147 {
20148 /* If the declaration was erroneous, we don't really
20149 know what the user intended, so just silently
20150 consume the initializer. */
20157 }
20158 }
20159 else
20160 {
20161 /* We want to record the extra mangling scope for in-class
20162 initializers of class members and initializers of static data
20163 member templates. The former involves deferring
20164 parsing of the initializer until end of class as with default
20165 arguments. So right here we only handle the latter. */
20175 }
20176 }
20178 /* The old parser allows attributes to appear after a parenthesized
20179 initializer. Mark Mitchell proposed removing this functionality
20180 on the GCC mailing lists on 2002-08-13. This parser accepts the
20181 attributes -- but ignores them. Made a permerror in GCC 8. */
20187 {
20190 {
20194 }
20195 }
20197 /* And now complain about a non-function implicit template. */
20202 /* For an in-class declaration, use `grokfield' to create the
20203 declaration. */
20205 {
20207 {
20210 }
20219 }
20221 /* Finish processing the declaration. But, skip member
20222 declarations. */
20224 {
20227 asm_specification,
20228 /* If the initializer is in parentheses, then this is
20229 a direct-initialization, which means that an
20230 `explicit' constructor is OK. Otherwise, an
20231 `explicit' constructor cannot be used. */
20234 }
20237 /* Core issue #226 (C++0x only): A default template-argument
20238 shall not be specified in a friend class template
20239 declaration. */
20248 {
20251 else
20253 }
20260 }
20262 /* Parse a declarator.
20264 declarator:
20265 direct-declarator
20266 ptr-operator declarator
20268 abstract-declarator:
20269 ptr-operator abstract-declarator [opt]
20270 direct-abstract-declarator
20272 GNU Extensions:
20274 declarator:
20275 attributes [opt] direct-declarator
20276 attributes [opt] ptr-operator declarator
20278 abstract-declarator:
20279 attributes [opt] ptr-operator abstract-declarator [opt]
20280 attributes [opt] direct-abstract-declarator
20282 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
20283 detect constructors, destructors, deduction guides, or conversion operators.
20284 It is set to -1 if the declarator is a name, and +1 if it is a
20285 function. Otherwise it is set to zero. Usually you just want to
20286 test for >0, but internally the negative value is used.
20288 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
20289 a decl-specifier-seq unless it declares a constructor, destructor,
20290 or conversion. It might seem that we could check this condition in
20291 semantic analysis, rather than parsing, but that makes it difficult
20292 to handle something like `f()'. We want to notice that there are
20293 no decl-specifiers, and therefore realize that this is an
20294 expression, not a declaration.)
20296 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
20297 the declarator is a direct-declarator of the form "(...)".
20299 MEMBER_P is true iff this declarator is a member-declarator.
20301 FRIEND_P is true iff this declarator is a friend. */
20305 cp_parser_declarator_kind dcl_kind,
20309 {
20312 cp_cv_quals cv_quals;
20313 tree class_type;
20316 /* Assume this is not a constructor, destructor, or type-conversion
20317 operator. */
20324 /* Check for the ptr-operator production. */
20326 /* Parse the ptr-operator. */
20332 /* If that worked, then we have a ptr-operator. */
20334 {
20335 /* If a ptr-operator was found, then this declarator was not
20336 parenthesized. */
20339 /* The dependent declarator is optional if we are parsing an
20340 abstract-declarator. */
20344 /* Parse the dependent declarator. */
20349 friend_p);
20351 /* If we are parsing an abstract-declarator, we must handle the
20352 case where the dependent declarator is absent. */
20357 declarator = cp_parser_make_indirect_declarator
20359 }
20360 /* Everything else is a direct-declarator. */
20361 else
20362 {
20365 CPP_OPEN_PAREN);
20367 ctor_dtor_or_conv_p,
20369 }
20374 }
20376 /* Parse a direct-declarator or direct-abstract-declarator.
20378 direct-declarator:
20379 declarator-id
20380 direct-declarator ( parameter-declaration-clause )
20381 cv-qualifier-seq [opt]
20382 ref-qualifier [opt]
20383 exception-specification [opt]
20384 direct-declarator [ constant-expression [opt] ]
20385 ( declarator )
20387 direct-abstract-declarator:
20388 direct-abstract-declarator [opt]
20389 ( parameter-declaration-clause )
20390 cv-qualifier-seq [opt]
20391 ref-qualifier [opt]
20392 exception-specification [opt]
20393 direct-abstract-declarator [opt] [ constant-expression [opt] ]
20394 ( abstract-declarator )
20396 Returns a representation of the declarator. DCL_KIND is
20397 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
20398 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
20399 we are parsing a direct-declarator. It is
20400 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
20401 of ambiguity we prefer an abstract declarator, as per
20402 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
20403 as for cp_parser_declarator. */
20407 cp_parser_declarator_kind dcl_kind,
20410 {
20421 {
20422 /* Peek at the next token. */
20425 {
20426 /* This is either a parameter-declaration-clause, or a
20427 parenthesized declarator. When we know we are parsing a
20428 named declarator, it must be a parenthesized declarator
20429 if FIRST is true. For instance, `(int)' is a
20430 parameter-declaration-clause, with an omitted
20431 direct-abstract-declarator. But `((*))', is a
20432 parenthesized abstract declarator. Finally, when T is a
20433 template parameter `(T)' is a
20434 parameter-declaration-clause, and not a parenthesized
20435 named declarator.
20437 We first try and parse a parameter-declaration-clause,
20438 and then try a nested declarator (if FIRST is true).
20440 It is not an error for it not to be a
20441 parameter-declaration-clause, even when FIRST is
20442 false. Consider,
20444 int i (int);
20445 int i (3);
20447 The first is the declaration of a function while the
20448 second is the definition of a variable, including its
20449 initializer.
20451 Having seen only the parenthesis, we cannot know which of
20452 these two alternatives should be selected. Even more
20453 complex are examples like:
20455 int i (int (a));
20456 int i (int (3));
20458 The former is a function-declaration; the latter is a
20459 variable initialization.
20461 Thus again, we try a parameter-declaration-clause, and if
20462 that fails, we back out and return. */
20465 {
20466 tree params;
20471 /* In a member-declarator, the only valid interpretation
20472 of a parenthesis is the start of a
20473 parameter-declaration-clause. (It is invalid to
20474 initialize a static data member with a parenthesized
20475 initializer; only the "=" form of initialization is
20476 permitted.) */
20480 /* Consume the `('. */
20481 matching_parens parens;
20484 {
20485 /* If this is going to be an abstract declarator, we're
20486 in a declarator and we can't have default args. */
20489 }
20493 /* Parse the parameter-declaration-clause. */
20496 /* Consume the `)'. */
20499 /* If all went well, parse the cv-qualifier-seq,
20500 ref-qualifier and the exception-specification. */
20502 {
20503 cp_cv_quals cv_quals;
20504 cp_virt_specifiers virt_specifiers;
20505 cp_ref_qualifier ref_qual;
20506 tree exception_specification;
20507 tree late_return;
20508 tree attrs;
20518 /* Parse the cv-qualifier-seq. */
20520 /* Parse the ref-qualifier. */
20522 /* Parse the tx-qualifier. */
20524 /* And the exception-specification. */
20525 exception_specification
20530 /* In here, we handle cases where attribute is used after
20531 the function declaration. For example:
20532 void func (int x) __attribute__((vector(..))); */
20535 late_return = (cp_parser_late_return_type_opt
20539 /* Parse the virt-specifier-seq. */
20542 /* Create the function-declarator. */
20544 params,
20545 cv_quals,
20546 virt_specifiers,
20547 ref_qual,
20548 tx_qual,
20549 exception_specification,
20550 late_return,
20551 requires_clause);
20554 /* Any subsequent parameter lists are to do with
20555 return type, so are not those of the declared
20556 function. */
20558 }
20560 /* Remove the function parms from scope. */
20564 /* Repeat the main loop. */
20566 }
20568 /* If this is the first, we can try a parenthesized
20569 declarator. */
20571 {
20578 /* Consume the `('. */
20579 matching_parens parens;
20581 /* Parse the nested declarator. */
20584 declarator
20590 /* Expect a `)'. */
20598 }
20599 /* Otherwise, we must be done. */
20600 else
20602 }
20606 {
20607 /* Parse an array-declarator. */
20617 /* Consume the `['. */
20619 /* Peek at the next token. */
20621 /* If the next token is `]', then there is no
20622 constant-expression. */
20624 {
20626 bounds
20636 {
20637 /* Normally, the array bound must be an integral constant
20638 expression. However, as an extension, we allow VLAs
20639 in function scopes as long as they aren't part of a
20640 parameter declaration. */
20644 }
20647 {
20648 /* Remember this wasn't a constant-expression. */
20651 }
20652 }
20653 else
20655 /* Look for the closing `]'. */
20657 {
20660 }
20665 }
20667 {
20668 {
20669 tree qualifying_scope;
20670 tree unqualified_name;
20671 tree attrs;
20672 special_function_kind sfk;
20677 /* Parse a declarator-id */
20680 {
20683 /* If we see an ellipsis, we should be looking at a
20684 parameter pack. */
20686 {
20687 /* Consume the `...' */
20691 }
20692 }
20695 unqualified_name
20699 {
20703 {
20704 /* Check whether an error occurred. */
20707 /* We already consumed the ellipsis to mark a
20708 parameter pack, but we have no way to report it,
20709 so abort the tentative parse. We will be exiting
20710 immediately anyway. */
20712 }
20713 else
20719 && (qualifying_scope
20721 {
20724 }
20725 }
20730 {
20735 }
20741 {
20742 /* In the declaration of a member of a template class
20743 outside of the class itself, the SCOPE will sometimes
20744 be a TYPENAME_TYPE. For example, given:
20746 template <typename T>
20747 int S<T>::R::i = 3;
20749 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20750 this context, we must resolve S<T>::R to an ordinary
20751 type, rather than a typename type.
20753 The reason we normally avoid resolving TYPENAME_TYPEs
20754 is that a specialization of `S' might render
20755 `S<T>::R' not a type. However, if `S' is
20756 specialized, then this `i' will not be used, so there
20757 is no harm in resolving the types here. */
20758 tree type;
20760 /* Resolve the TYPENAME_TYPE. */
20763 /* If that failed, the declarator is invalid. */
20765 {
20768 "cannot define member of dependent typedef "
20770 else
20775 }
20777 }
20782 {
20783 tree class_type;
20788 else
20792 {
20796 {
20797 /* We do not attempt to print the declarator
20798 here because we do not have enough
20799 information about its original syntactic
20800 form. */
20804 }
20807 {
20811 "use %<%T::%D%> instead of %<%T::%D%> to "
20813 class_type,
20818 }
20820 }
20823 {
20830 for an unnamed type, even if the type
20831 got a name for linkage purposes. */
20833 /* Handle correctly (c++/19200):
20835 struct S {
20836 struct T{};
20837 friend void S(T);
20838 };
20840 and also:
20842 namespace N {
20843 void S();
20844 }
20846 struct S {
20847 friend void N::S();
20848 }; */
20851 class_type))
20860 }
20861 }
20863 unqualified_name,
20870 }
20872 handle_declarator:;
20875 {
20876 /* Any names that appear after the declarator-id for a
20877 member are looked up in the containing scope. */
20879 {
20880 /* But declarations with qualified-ids can't appear in a
20881 function. */
20885 }
20887 }
20891 /* Default args are only allowed on function
20892 declarations. */
20894 else
20898 }
20899 /* We're done. */
20900 else
20902 }
20904 /* For an abstract declarator, we might wind up with nothing at this
20905 point. That's an error; the declarator is not optional. */
20909 {
20910 /* Record overly parenthesized declarator so we can give a
20911 diagnostic about confusing decl/expr disambiguation. */
20913 {
20914 /* If the open and close parens are on different lines, this
20915 is probably a formatting thing, so ignore. */
20920 }
20923 }
20925 /* If we entered a scope, we must exit it now. */
20933 }
20935 /* Parse a ptr-operator.
20937 ptr-operator:
20938 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20939 * cv-qualifier-seq [opt]
20940 &
20941 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20942 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20944 GNU Extension:
20946 ptr-operator:
20947 & cv-qualifier-seq [opt]
20949 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20950 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20951 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20952 filled in with the TYPE containing the member. *CV_QUALS is
20953 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20954 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20955 Note that the tree codes returned by this function have nothing
20956 to do with the types of trees that will be eventually be created
20957 to represent the pointer or reference type being parsed. They are
20958 just constants with suggestive names. */
20959 static enum tree_code
20964 {
20969 /* Assume that it's not a pointer-to-member. */
20971 /* And that there are no cv-qualifiers. */
20974 /* Peek at the next token. */
20977 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20987 {
20988 /* Consume the `*', `&' or `&&'. */
20991 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20992 `&', if we are allowing GNU extensions. (The only qualifier
20993 that can legally appear after `&' is `restrict', but that is
20994 enforced during semantic analysis. */
21002 }
21003 else
21004 {
21005 /* Try the pointer-to-member case. */
21007 /* Look for the optional `::' operator. */
21010 /* Look for the nested-name specifier. */
21017 /* If we found it, and the next token is a `*', then we are
21018 indeed looking at a pointer-to-member operator. */
21021 {
21022 /* Indicate that the `*' operator was used. */
21030 else
21031 {
21032 /* The type of which the member is a member is given by the
21033 current SCOPE. */
21035 /* The next name will not be qualified. */
21039 /* Look for optional c++11 attributes. */
21043 /* Look for the optional cv-qualifier-seq. */
21045 }
21046 }
21047 /* If that didn't work we don't have a ptr-operator. */
21050 }
21053 }
21055 /* Parse an (optional) cv-qualifier-seq.
21057 cv-qualifier-seq:
21058 cv-qualifier cv-qualifier-seq [opt]
21060 cv-qualifier:
21061 const
21062 volatile
21064 GNU Extension:
21066 cv-qualifier:
21067 __restrict__
21069 Returns a bitmask representing the cv-qualifiers. */
21071 static cp_cv_quals
21073 {
21077 {
21079 cp_cv_quals cv_qualifier;
21081 /* Peek at the next token. */
21083 /* See if it's a cv-qualifier. */
21085 {
21101 }
21107 {
21112 }
21113 else
21114 {
21117 }
21118 }
21121 }
21123 /* Parse an (optional) ref-qualifier
21125 ref-qualifier:
21126 &
21127 &&
21129 Returns cp_ref_qualifier representing ref-qualifier. */
21131 static cp_ref_qualifier
21133 {
21136 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
21141 {
21146 {
21158 }
21163 {
21166 }
21167 else
21168 {
21171 }
21172 }
21175 }
21177 /* Parse an optional tx-qualifier.
21179 tx-qualifier:
21180 transaction_safe
21181 transaction_safe_dynamic */
21183 static tree
21185 {
21188 {
21193 {
21197 {
21200 {
21203 }
21204 else
21206 }
21207 }
21208 }
21210 }
21212 /* Parse an (optional) virt-specifier-seq.
21214 virt-specifier-seq:
21215 virt-specifier virt-specifier-seq [opt]
21217 virt-specifier:
21218 override
21219 final
21221 Returns a bitmask representing the virt-specifiers. */
21223 static cp_virt_specifiers
21225 {
21229 {
21231 cp_virt_specifiers virt_specifier;
21233 /* Peek at the next token. */
21235 /* See if it's a virt-specifier-qualifier. */
21239 {
21242 }
21244 {
21247 }
21249 {
21251 }
21252 else
21256 {
21261 }
21262 else
21263 {
21266 }
21267 }
21269 }
21271 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
21272 is in scope even though it isn't real. */
21274 void
21276 {
21277 tree this_parm;
21280 {
21281 /* We don't clear this between NSDMIs. Is it already what we want? */
21288 }
21291 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
21293 current_class_ref
21296 }
21298 /* Return true iff our current scope is a non-static data member
21299 initializer. */
21301 bool
21303 {
21304 /* We recognize NSDMI context by the context-less 'this' pointer set up
21305 by the function above. */
21311 }
21313 /* Parse a late-specified return type, if any. This is not a separate
21314 non-terminal, but part of a function declarator, which looks like
21316 -> trailing-type-specifier-seq abstract-declarator(opt)
21318 Returns the type indicated by the type-id.
21320 In addition to this, parse any queued up #pragma omp declare simd
21321 clauses, and #pragma acc routine clauses.
21323 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
21324 function. */
21326 static tree
21329 {
21333 && declarator
21337 && declarator
21340 /* Peek at the next token. */
21342 /* A late-specified return type is indicated by an initial '->'. */
21353 {
21354 /* DR 1207: 'this' is in scope in the trailing return type. */
21356 }
21359 {
21360 /* Consume the ->. */
21364 }
21366 /* Function declarations may be followed by a trailing
21367 requires-clause. */
21371 declarator->attributes
21375 declarator->attributes
21380 {
21383 }
21386 }
21388 /* Parse a declarator-id.
21390 declarator-id:
21391 id-expression
21392 :: [opt] nested-name-specifier [opt] type-name
21394 In the `id-expression' case, the value returned is as for
21395 cp_parser_id_expression if the id-expression was an unqualified-id.
21396 If the id-expression was a qualified-id, then a SCOPE_REF is
21397 returned. The first operand is the scope (either a NAMESPACE_DECL
21398 or TREE_TYPE), but the second is still just a representation of an
21399 unqualified-id. */
21401 static tree
21403 {
21404 tree id;
21405 /* The expression must be an id-expression. Assume that qualified
21406 names are the names of types so that:
21408 template <class T>
21409 int S<T>::R::i = 3;
21411 will work; we must treat `S<T>::R' as the name of a type.
21412 Similarly, assume that qualified names are templates, where
21413 required, so that:
21415 template <class T>
21416 int S<T>::R<T>::i = 3;
21418 will work, too. */
21424 optional_p);
21428 }
21430 /* Parse a type-id.
21432 type-id:
21433 type-specifier-seq abstract-declarator [opt]
21435 Returns the TYPE specified. */
21437 static tree
21440 {
21441 cp_decl_specifier_seq type_specifier_seq;
21444 /* Parse the type-specifier-seq. */
21446 is_trailing_return,
21454 /* A bare template name as a template argument is a template template
21455 argument, not a placeholder, so fail parsing it as a type argument. */
21456 {
21460 }
21464 /* There might or might not be an abstract declarator. */
21466 /* Look for the declarator. */
21467 abstract_declarator
21472 /* Check to see if there really was a declarator. */
21477 /* The concepts TS allows 'auto' as a type-id. */
21479 /* None of the valid uses of 'auto' in C++14 involve the type-id
21480 nonterminal, but it is valid in a trailing-return-type. */
21483 {
21484 /* A type-id with type 'auto' is only ok if the abstract declarator
21485 is a function declarator with a late-specified return type.
21487 A type-id with 'auto' is also valid in a trailing-return-type
21488 in a compound-requirement. */
21495 else
21496 {
21499 {
21501 auto_node);
21503 tmpl);
21504 }
21505 else
21508 }
21509 }
21512 is_template_arg);
21513 }
21515 static tree
21517 {
21519 }
21521 static tree
21523 {
21524 tree r;
21526 parser->type_definition_forbidden_message
21531 {
21534 }
21536 }
21538 static tree
21540 {
21542 }
21544 /* Parse a type-specifier-seq.
21546 type-specifier-seq:
21547 type-specifier type-specifier-seq [opt]
21549 GNU extension:
21551 type-specifier-seq:
21552 attributes type-specifier-seq [opt]
21554 If IS_DECLARATION is true, we are at the start of a "condition" or
21555 exception-declaration, so we might be followed by a declarator-id.
21557 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21558 i.e. we've just seen "->".
21560 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21562 static void
21567 {
21572 /* Clear the TYPE_SPECIFIER_SEQ. */
21575 /* In the context of a trailing return type, enum E { } is an
21576 elaborated-type-specifier followed by a function-body, not an
21577 enum-specifier. */
21581 /* Parse the type-specifiers and attributes. */
21583 {
21584 tree type_specifier;
21587 /* Check for attributes first. */
21589 {
21590 type_specifier_seq->attributes
21594 }
21596 /* record the token of the beginning of the type specifier seq,
21597 for error reporting purposes*/
21601 /* Look for the type-specifier. */
21603 flags,
21604 type_specifier_seq,
21606 NULL,
21609 {
21610 /* If the first type-specifier could not be found, this is not a
21611 type-specifier-seq at all. */
21613 {
21614 /* Set in_declarator_p to avoid skipping to the semicolon. */
21626 }
21627 /* If subsequent type-specifiers could not be found, the
21628 type-specifier-seq is complete. */
21630 }
21633 /* The standard says that a condition can be:
21635 type-specifier-seq declarator = assignment-expression
21637 However, given:
21639 struct S {};
21640 if (int S = ...)
21642 we should treat the "S" as a declarator, not as a
21643 type-specifier. The standard doesn't say that explicitly for
21644 type-specifier-seq, but it does say that for
21645 decl-specifier-seq in an ordinary declaration. Perhaps it
21646 would be clearer just to allow a decl-specifier-seq here, and
21647 then add a semantic restriction that if any decl-specifiers
21648 that are not type-specifiers appear, the program is invalid. */
21651 }
21652 }
21654 /* Return whether the function currently being declared has an associated
21655 template parameter list. */
21657 static bool
21659 {
21672 }
21674 /* Parse a parameter-declaration-clause.
21676 parameter-declaration-clause:
21677 parameter-declaration-list [opt] ... [opt]
21678 parameter-declaration-list , ...
21680 Returns a representation for the parameter declarations. A return
21681 value of NULL indicates a parameter-declaration-clause consisting
21682 only of an ellipsis. */
21684 static tree
21686 {
21687 tree parameters;
21695 && !processing_template_parmlist
21696 && !processing_explicit_instantiation
21697 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21698 actual function or a random abstract declarator. */
21704 /* Peek at the next token. */
21706 /* Check for trivial parameter-declaration-clauses. */
21708 {
21709 /* Consume the `...' token. */
21712 }
21714 /* There are no parameters. */
21716 /* Check for `(void)', too, which is a special case. */
21720 {
21721 /* Consume the `void' token. */
21723 /* There are no parameters. */
21725 }
21727 /* Parse the parameter-declaration-list. */
21729 /* If a parse error occurred while parsing the
21730 parameter-declaration-list, then the entire
21731 parameter-declaration-clause is erroneous. */
21735 /* Peek at the next token. */
21737 /* If it's a `,', the clause should terminate with an ellipsis. */
21739 {
21740 /* Consume the `,'. */
21742 /* Expect an ellipsis. */
21743 ellipsis_p
21745 }
21746 /* It might also be `...' if the optional trailing `,' was
21747 omitted. */
21749 {
21750 /* Consume the `...' token. */
21752 /* And remember that we saw it. */
21754 }
21755 else
21758 /* Finish the parameter list. */
21763 }
21765 /* Parse a parameter-declaration-list.
21767 parameter-declaration-list:
21768 parameter-declaration
21769 parameter-declaration-list , parameter-declaration
21771 Returns a representation of the parameter-declaration-list, as for
21772 cp_parser_parameter_declaration_clause. However, the
21773 `void_list_node' is never appended to the list. */
21775 static tree
21777 {
21783 /* The special considerations that apply to a function within an
21784 unbraced linkage specifications do not apply to the parameters
21785 to the function. */
21786 saved_in_unbraced_linkage_specification_p
21790 /* Look for more parameters. */
21792 {
21797 /* Parse the parameter. */
21798 parameter
21803 /* We don't know yet if the enclosing context is deprecated, so wait
21804 and warn in grokparms if appropriate. */
21808 {
21811 PARM,
21816 }
21820 /* If a parse error occurred parsing the parameter declaration,
21821 then the entire parameter-declaration-list is erroneous. */
21823 {
21826 }
21836 {
21840 }
21842 /* Add the new parameter to the list. */
21846 /* Peek at the next token. */
21849 /* These are for Objective-C++ */
21852 /* The parameter-declaration-list is complete. */
21855 {
21858 /* Peek at the next token. */
21860 /* If it's an ellipsis, then the list is complete. */
21863 /* Otherwise, there must be more parameters. Consume the
21864 `,'. */
21866 /* When parsing something like:
21868 int i(float f, double d)
21870 we can tell after seeing the declaration for "f" that we
21871 are not looking at an initialization of a variable "i",
21872 but rather at the declaration of a function "i".
21874 Due to the fact that the parsing of template arguments
21875 (as specified to a template-id) requires backtracking we
21876 cannot use this technique when inside a template argument
21877 list. */
21881 /* However, a parameter-declaration of the form
21882 "float(f)" (which is a valid declaration of a
21883 parameter "f") can also be interpreted as an
21884 expression (the conversion of "f" to "float"). */
21887 }
21888 else
21889 {
21897 }
21898 }
21900 parser->in_unbraced_linkage_specification_p
21903 /* Reset implicit_template_scope if we are about to leave the function
21904 parameter list that introduced it. Note that for out-of-line member
21905 definitions, there will be one or more class scopes before we get to
21906 the template parameter scope. */
21910 {
21914 {
21917 }
21918 }
21921 }
21923 /* Parse a parameter declaration.
21925 parameter-declaration:
21926 decl-specifier-seq ... [opt] declarator
21927 decl-specifier-seq declarator = assignment-expression
21928 decl-specifier-seq ... [opt] abstract-declarator [opt]
21929 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21931 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21932 declares a template parameter. (In that case, a non-nested `>'
21933 token encountered during the parsing of the assignment-expression
21934 is not interpreted as a greater-than operator.)
21936 Returns a representation of the parameter, or NULL if an error
21937 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21938 true iff the declarator is of the form "(p)". */
21944 {
21946 cp_decl_specifier_seq decl_specifiers;
21948 tree default_argument;
21953 /* In a template parameter, `>' is not an operator.
21955 [temp.param]
21957 When parsing a default template-argument for a non-type
21958 template-parameter, the first non-nested `>' is taken as the end
21959 of the template parameter-list rather than a greater-than
21960 operator. */
21962 /* Type definitions may not appear in parameter types. */
21964 parser->type_definition_forbidden_message
21971 /* Parse the declaration-specifiers. */
21974 CP_PARSER_FLAGS_NONE,
21978 /* Complain about missing 'typename' or other invalid type names. */
21983 /* If an error occurred, there's no reason to attempt to parse the
21984 rest of the declaration. */
21986 {
21989 }
21991 /* Peek at the next token. */
21994 /* If the next token is a `)', `,', `=', `>', or `...', then there
21995 is no declarator. However, when variadic templates are enabled,
21996 there may be a declarator following `...'. */
22001 {
22005 }
22006 /* Otherwise, there should be a declarator. */
22007 else
22008 {
22012 /* After seeing a decl-specifier-seq, if the next token is not a
22013 "(", there is no possibility that the code is a valid
22014 expression. Therefore, if parsing tentatively, we commit at
22015 this point. */
22017 /* In an expression context, having seen:
22019 (int((char ...
22021 we cannot be sure whether we are looking at a
22022 function-type (taking a "char" as a parameter) or a cast
22023 of some object of type "char" to "int". */
22029 /* Parse the declarator. */
22032 CP_PARSER_DECLARATOR_EITHER,
22034 parenthesized_p,
22038 /* After the declarator, allow more attributes. */
22039 decl_specifiers.attributes
22043 /* If the declarator is a template parameter pack, remember that and
22044 clear the flag in the declarator itself so we don't get errors
22045 from grokdeclarator. */
22047 {
22050 }
22051 }
22053 /* If the next token is an ellipsis, and we have not seen a declarator
22054 name, and if either the type of the declarator contains parameter
22055 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
22056 for, eg, abbreviated integral type names), then we actually have a
22057 parameter pack expansion expression. Otherwise, leave the ellipsis
22058 for a C-style variadic function. */
22061 /* If a function parameter pack was specified and an implicit template
22062 parameter was introduced during cp_parser_parameter_declaration,
22063 change any implicit parameters introduced into packs. */
22068 {
22076 }
22079 {
22090 {
22091 /* Consume the `...'. */
22095 /* Build a pack expansion type */
22100 else
22102 }
22103 }
22105 /* The restriction on defining new types applies only to the type
22106 of the parameter, not to the default argument. */
22109 /* If the next token is `=', then process a default argument. */
22111 {
22114 /* If we are defining a class, then the tokens that make up the
22115 default argument must be saved and processed later. */
22121 // A constrained-type-specifier may declare a type template-parameter.
22123 default_argument
22126 // A constrained-type-specifier may declare a template-template-parameter.
22128 default_argument
22131 /* Outside of a class definition, we can just parse the
22132 assignment-expression. */
22133 else
22134 default_argument
22138 {
22140 "default arguments are only "
22142 }
22144 || template_parameter_pack_p
22147 {
22148 /* Find the name of the parameter pack. */
22155 template_parm_p
22161 else
22163 template_parm_p
22170 }
22171 }
22172 else
22175 /* Generate a location for the parameter, ranging from the start of the
22176 initial token to the end of the final token (using input_location for
22177 the latter, set up by cp_lexer_set_source_position_from_token when
22178 consuming tokens).
22180 If we have a identifier, then use it for the caret location, e.g.
22182 extern int callee (int one, int (*two)(int, int), float three);
22183 ~~~~~~^~~~~~~~~~~~~~
22185 otherwise, reuse the start location for the caret location e.g.:
22187 extern int callee (int one, int (*)(int, int), float three);
22188 ^~~~~~~~~~~~~~~~~
22190 */
22196 input_location);
22199 declarator,
22200 default_argument,
22201 param_loc,
22202 template_parameter_pack_p);
22203 }
22205 /* Parse a default argument and return it.
22207 TEMPLATE_PARM_P is true if this is a default argument for a
22208 non-type template parameter. */
22209 static tree
22211 {
22217 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
22218 set correctly. */
22221 /* Local variable names (and the `this' keyword) may not
22222 appear in a default argument. */
22225 /* Parse the assignment-expression. */
22230 /* The "this" pointer is not valid in a default argument. */
22232 {
22237 }
22238 default_argument
22240 /* Restore the "this" pointer. */
22242 {
22245 }
22254 }
22256 /* Parse a function-body.
22258 function-body:
22259 compound_statement */
22261 static void
22263 {
22267 }
22269 /* Parse a ctor-initializer-opt followed by a function-body. Return
22270 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
22271 is true we are parsing a function-try-block. */
22273 static void
22276 {
22283 /* Begin the function body. */
22285 /* Parse the optional ctor-initializer. */
22288 /* If we're parsing a constexpr constructor definition, we need
22289 to check that the constructor body is indeed empty. However,
22290 before we get to cp_parser_function_body lot of junk has been
22291 generated, so we can't just check that we have an empty block.
22292 Rather we take a snapshot of the outermost block, and check whether
22293 cp_parser_function_body changed its state. */
22295 {
22299 }
22300 /* Parse the function-body. */
22304 /* Finish the function body. */
22306 }
22308 /* Parse an initializer.
22310 initializer:
22311 = initializer-clause
22312 ( expression-list )
22314 Returns an expression representing the initializer. If no
22315 initializer is present, NULL_TREE is returned.
22317 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
22318 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
22319 set to TRUE if there is no initializer present. If there is an
22320 initializer, and it is not a constant-expression, *NON_CONSTANT_P
22321 is set to true; otherwise it is set to false. */
22323 static tree
22326 {
22328 tree init;
22330 /* Peek at the next token. */
22333 /* Let our caller know whether or not this initializer was
22334 parenthesized. */
22336 /* Assume that the initializer is constant. */
22340 {
22341 /* Consume the `='. */
22343 /* Parse the initializer-clause. */
22345 }
22347 {
22352 non_constant_p);
22357 }
22359 {
22364 }
22365 else
22366 {
22367 /* Anything else is an error. */
22370 }
22376 }
22378 /* Parse an initializer-clause.
22380 initializer-clause:
22381 assignment-expression
22382 braced-init-list
22384 Returns an expression representing the initializer.
22386 If the `assignment-expression' production is used the value
22387 returned is simply a representation for the expression.
22389 Otherwise, calls cp_parser_braced_list. */
22391 static cp_expr
22393 {
22394 cp_expr initializer;
22396 /* Assume the expression is constant. */
22399 /* If it is not a `{', then we are looking at an
22400 assignment-expression. */
22402 {
22403 initializer
22406 non_constant_p);
22407 }
22408 else
22412 }
22414 /* Parse a brace-enclosed initializer list.
22416 braced-init-list:
22417 { initializer-list , [opt] }
22418 { designated-initializer-list , [opt] }
22419 { }
22421 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
22422 the elements of the initializer-list (or NULL, if the last
22423 production is used). The TREE_TYPE for the CONSTRUCTOR will be
22424 NULL_TREE. There is no way to detect whether or not the optional
22425 trailing `,' was provided. NON_CONSTANT_P is as for
22426 cp_parser_initializer. */
22428 static cp_expr
22430 {
22431 tree initializer;
22434 /* Consume the `{' token. */
22435 matching_braces braces;
22437 /* Create a CONSTRUCTOR to represent the braced-initializer. */
22439 /* If it's not a `}', then there is a non-trivial initializer. */
22441 {
22442 /* Parse the initializer list. */
22445 /* A trailing `,' token is allowed. */
22448 }
22449 else
22451 /* Now, there should be a trailing `}'. */
22457 /* Build a location of the form:
22458 { ... }
22459 ^~~~~~~
22460 with caret==start at the open brace, finish at the close brace. */
22464 }
22466 /* Consume tokens up to, and including, the next non-nested closing `]'.
22467 Returns true iff we found a closing `]'. */
22469 static bool
22471 {
22475 {
22479 {
22482 /* If we've run out of tokens, then there is no closing `]'. */
22491 {
22494 }
22499 }
22501 /* Consume the token. */
22503 }
22504 }
22506 /* Return true if we are looking at an array-designator, false otherwise. */
22508 static bool
22510 {
22511 /* Consume the `['. */
22516 /* Skip tokens until the next token is a closing square bracket.
22517 If we find the closing `]', and the next token is a `=', then
22518 we are looking at an array designator. */
22519 bool array_designator_p
22523 /* Roll back the tokens we skipped. */
22527 }
22529 /* Parse an initializer-list.
22531 initializer-list:
22532 initializer-clause ... [opt]
22533 initializer-list , initializer-clause ... [opt]
22535 C++2A Extension:
22537 designated-initializer-list:
22538 designated-initializer-clause
22539 designated-initializer-list , designated-initializer-clause
22541 designated-initializer-clause:
22542 designator brace-or-equal-initializer
22544 designator:
22545 . identifier
22547 GNU Extension:
22549 initializer-list:
22550 designation initializer-clause ...[opt]
22551 initializer-list , designation initializer-clause ...[opt]
22553 designation:
22554 . identifier =
22555 identifier :
22556 [ constant-expression ] =
22558 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22559 for the initializer. If the INDEX of the elt is non-NULL, it is the
22560 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22561 as for cp_parser_initializer. */
22565 {
22570 /* Assume all of the expressions are constant. */
22573 /* Parse the rest of the list. */
22575 {
22577 tree designator;
22578 tree initializer;
22582 /* Handle the C++2A syntax, '. id ='. */
22590 {
22593 "C++ designated initializers only available with "
22595 /* Consume the `.'. */
22597 /* Consume the identifier. */
22600 /* Consume the `='. */
22602 }
22603 /* Also, if the next token is an identifier and the following one is a
22604 colon, we are looking at the GNU designated-initializer
22605 syntax. */
22610 {
22611 /* Warn the user that they are using an extension. */
22614 /* Consume the identifier. */
22616 /* Consume the `:'. */
22618 }
22619 /* Also handle C99 array designators, '[ const ] ='. */
22623 {
22624 /* In C++11, [ could start a lambda-introducer. */
22630 {
22633 }
22634 else
22635 {
22640 }
22645 && (!require_potential_rvalue_constant_expression
22649 /* Warn the user that they are using an extension. */
22652 }
22653 else
22657 {
22660 }
22664 {
22668 }
22672 /* Parse the initializer. */
22675 /* If any clause is non-constant, so is the entire initializer. */
22679 /* If we have an ellipsis, this is an initializer pack
22680 expansion. */
22682 {
22685 /* Consume the `...'. */
22692 /* Turn the initializer into an initializer expansion. */
22694 }
22696 /* Add it to the vector. */
22699 /* If the next token is not a comma, we have reached the end of
22700 the list. */
22704 /* Peek at the next token. */
22706 /* If the next token is a `}', then we're still done. An
22707 initializer-clause can have a trailing `,' after the
22708 initializer-list and before the closing `}'. */
22712 /* Consume the `,' token. */
22714 }
22716 /* The same identifier shall not appear in multiple designators
22717 of a designated-initializer-list. */
22719 {
22724 {
22726 {
22728 "%<.%s%> designator used multiple times in "
22732 }
22733 else
22735 }
22739 }
22742 }
22744 /* Classes [gram.class] */
22746 /* Parse a class-name.
22748 class-name:
22749 identifier
22750 template-id
22752 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22753 to indicate that names looked up in dependent types should be
22754 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22755 keyword has been used to indicate that the name that appears next
22756 is a template. TAG_TYPE indicates the explicit tag given before
22757 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22758 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22759 is the class being defined in a class-head. If ENUM_OK is TRUE,
22760 enum-names are also accepted.
22762 Returns the TYPE_DECL representing the class. */
22764 static tree
22773 {
22774 tree decl;
22775 tree scope;
22780 /* All class-names start with an identifier. */
22783 {
22786 }
22788 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22789 to a template-id, so we save it here. */
22794 /* Any name names a type if we're following the `typename' keyword
22795 in a qualified name where the enclosing scope is type-dependent. */
22798 /* Handle the common case (an identifier, but not a template-id)
22799 efficiently. */
22802 {
22806 /* Look for the identifier. */
22810 /* If the next token isn't an identifier, we are certainly not
22811 looking at a class-name. */
22814 /* If we know this is a type-name, there's no need to look it
22815 up. */
22818 else
22819 {
22820 tree ambiguous_decls;
22821 /* If we already know that this lookup is ambiguous, then
22822 we've already issued an error message; there's no reason
22823 to check again. */
22825 {
22828 }
22829 /* If the next token is a `::', then the name must be a type
22830 name.
22832 [basic.lookup.qual]
22834 During the lookup for a name preceding the :: scope
22835 resolution operator, object, function, and enumerator
22836 names are ignored. */
22839 /* Look up the name. */
22841 tag_type,
22844 check_dependency_p,
22848 {
22852 }
22853 }
22854 }
22855 else
22856 {
22857 /* Try a template-id. */
22859 check_dependency_p,
22860 tag_type,
22861 is_declaration);
22864 }
22868 /* If this is a typename, create a TYPENAME_TYPE. */
22870 {
22875 }
22879 /* Check to see that it is really the name of a class. */
22883 /* Situations like this:
22885 template <typename T> struct A {
22886 typename T::template X<int>::I i;
22887 };
22889 are problematic. Is `T::template X<int>' a class-name? The
22890 standard does not seem to be definitive, but there is no other
22891 valid interpretation of the following `::'. Therefore, those
22892 names are considered class-names. */
22893 {
22897 }
22902 /* In Objective-C 2.0, a classname followed by '.' starts a
22903 dot-syntax expression, and it's not a type-name. */
22915 }
22917 /* Parse a class-specifier.
22919 class-specifier:
22920 class-head { member-specification [opt] }
22922 Returns the TREE_TYPE representing the class. */
22924 static tree
22926 {
22927 tree type;
22941 /* Parse the class-head. */
22944 /* If the class-head was a semantic disaster, skip the entire body
22945 of the class. */
22947 {
22951 }
22953 /* Look for the `{'. */
22954 matching_braces braces;
22956 {
22959 }
22964 /* Issue an error message if type-definitions are forbidden here. */
22966 /* Remember that we are defining one more class. */
22968 /* Inside the class, surrounding template-parameter-lists do not
22969 apply. */
22970 saved_num_template_parameter_lists
22973 /* We are not in a function body. */
22976 /* Or in a loop. */
22979 /* Or in a switch. */
22982 /* We are not immediately inside an extern "lang" block. */
22983 saved_in_unbraced_linkage_specification_p
22987 // Associate constraints with the type.
22991 /* Start the class. */
22993 {
22996 }
23000 /* If the type is erroneous, skip the entire body of the class. */
23002 else
23003 /* Parse the member-specification. */
23006 /* Look for the trailing `}'. */
23008 /* Look for trailing attributes to apply to this class. */
23016 /* We've finished a type definition. Check for the common syntax
23017 error of forgetting a semicolon after the definition. We need to
23018 be careful, as we can't just check for not-a-semicolon and be done
23019 with it; the user might have typed:
23021 class X { } c = ...;
23022 class X { } *p = ...;
23024 and so forth. Instead, enumerate all the possible tokens that
23025 might follow this production; if we don't see one of them, then
23026 complain and silently insert the semicolon. */
23027 {
23032 /* Don't try to parse c++11 attributes here. As per the
23033 grammar, that should be a task for
23034 cp_parser_decl_specifier_seq. */
23038 {
23049 /* While it's legal for type qualifiers and storage class
23050 specifiers to follow type definitions in the grammar, only
23051 compiler testsuites contain code like that. Assume that if
23052 we see such code, then what we're really seeing is a case
23053 like:
23055 class X { }
23056 const <type> var = ...;
23058 or
23060 class Y { }
23061 static <type> func (...) ...
23063 i.e. the qualifier or specifier applies to the next
23064 declaration. To do so, however, we need to look ahead one
23065 more token to see if *that* token is a type specifier.
23067 This code could be improved to handle:
23069 class Z { }
23070 static const <type> var = ...; */
23073 {
23076 /* Handling user-defined types here would be nice, but very
23077 tricky. */
23078 want_semicolon
23081 }
23085 }
23087 /* If we don't have a type, then something is very wrong and we
23088 shouldn't try to do anything clever. Likewise for not seeing the
23089 closing brace. */
23091 {
23092 /* Locate the closing brace. */
23093 cp_token_position prev
23098 /* We want to suggest insertion of a ';' immediately *after* the
23099 closing brace, so, if we can, offset the location by 1 column. */
23106 /* If we successfully offset the location, suggest the fix-it. */
23119 else
23122 /* Unget one token and smash it to look as though we encountered
23123 a semicolon in the input stream. */
23128 }
23129 }
23131 /* If this class is not itself within the scope of another class,
23132 then we need to parse the bodies of all of the queued function
23133 definitions. Note that the queued functions defined in a class
23134 are not always processed immediately following the
23135 class-specifier for that class. Consider:
23137 struct A {
23138 struct B { void f() { sizeof (A); } };
23139 };
23141 If `f' were processed before the processing of `A' were
23142 completed, there would be no way to compute the size of `A'.
23143 Note that the nesting we are interested in here is lexical --
23144 not the semantic nesting given by TYPE_CONTEXT. In particular,
23145 for:
23147 struct A { struct B; };
23148 struct A::B { void f() { } };
23150 there is no need to delay the parsing of `A::B::f'. */
23152 {
23153 tree decl;
23161 {
23162 /* Skip default arguments, NSDMIs, etc, in order to improve
23163 error recovery (c++/71169, c++/71832). */
23168 }
23170 /* In a first pass, parse default arguments to the functions.
23171 Then, in a second pass, parse the bodies of the functions.
23172 This two-phased approach handles cases like:
23174 struct S {
23175 void f() { g(); }
23176 void g(int i = 3);
23177 };
23179 */
23181 {
23183 /* If there are default arguments that have not yet been processed,
23184 take care of them now. */
23186 {
23191 }
23192 /* Make sure that any template parameters are in scope. */
23194 /* Parse the default argument expressions. */
23196 /* Remove any template parameters from the symbol table. */
23198 }
23200 /* Now parse any NSDMIs. */
23204 {
23206 {
23211 }
23214 }
23221 /* Now do some post-NSDMI bookkeeping. */
23227 /* Now parse the body of the functions. */
23229 {
23230 /* OpenMP UDRs need to be parsed before all other functions. */
23237 }
23238 else
23242 }
23243 else
23246 /* Put back any saved access checks. */
23249 /* Restore saved state. */
23253 parser->num_template_parameter_lists
23255 parser->in_unbraced_linkage_specification_p
23259 }
23261 static tree
23263 {
23264 tree ret;
23269 }
23271 /* Parse a class-head.
23273 class-head:
23274 class-key identifier [opt] base-clause [opt]
23275 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
23276 class-key nested-name-specifier [opt] template-id
23277 base-clause [opt]
23279 class-virt-specifier:
23280 final
23282 GNU Extensions:
23283 class-key attributes identifier [opt] base-clause [opt]
23284 class-key attributes nested-name-specifier identifier base-clause [opt]
23285 class-key attributes nested-name-specifier [opt] template-id
23286 base-clause [opt]
23288 Upon return BASES is initialized to the list of base classes (or
23289 NULL, if there are none) in the same form returned by
23290 cp_parser_base_clause.
23292 Returns the TYPE of the indicated class. Sets
23293 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
23294 involving a nested-name-specifier was used, and FALSE otherwise.
23296 Returns error_mark_node if this is not a class-head.
23298 Returns NULL_TREE if the class-head is syntactically valid, but
23299 semantically invalid in a way that means we should skip the entire
23300 body of the class. */
23302 static tree
23305 {
23306 tree nested_name_specifier;
23310 tree attributes;
23311 tree bases;
23321 /* Assume no nested-name-specifier will be present. */
23323 /* Assume no template parameter lists will be used in defining the
23324 type. */
23328 /* Look for the class-key. */
23335 /* Parse the attributes. */
23338 /* If the next token is `::', that is invalid -- but sometimes
23339 people do try to write:
23341 struct ::S {};
23343 Handle this gracefully by accepting the extra qualifier, and then
23344 issuing an error about it later if this really is a
23345 class-head. If it turns out just to be an elaborated type
23346 specifier, remain silent. */
23352 /* Determine the name of the class. Begin by looking for an
23353 optional nested-name-specifier. */
23355 nested_name_specifier
23361 /* If there was a nested-name-specifier, then there *must* be an
23362 identifier. */
23367 {
23369 /* Although the grammar says `identifier', it really means
23370 `class-name' or `template-name'. You are only allowed to
23371 define a class that has already been declared with this
23372 syntax.
23374 The proposed resolution for Core Issue 180 says that wherever
23375 you see `class T::X' you should treat `X' as a type-name.
23377 It is OK to define an inaccessible class; for example:
23379 class A { class B; };
23380 class A::B {};
23382 We do not know if we will see a class-name, or a
23383 template-name. We look for a class-name first, in case the
23384 class-name is a template-id; if we looked for the
23385 template-name first we would stop after the template-name. */
23392 class_type,
23396 /* If that didn't work, ignore the nested-name-specifier. */
23398 {
23404 }
23405 /* If we could not find a corresponding TYPE, treat this
23406 declaration like an unqualified declaration. */
23409 /* Otherwise, count the number of templates used in TYPE and its
23410 containing scopes. */
23411 else
23413 }
23414 /* Otherwise, the identifier is optional. */
23415 else
23416 {
23417 /* We don't know whether what comes next is a template-id,
23418 an identifier, or nothing at all. */
23420 /* Check for a template-id. */
23425 class_key,
23427 /* If that didn't work, it could still be an identifier. */
23429 {
23431 {
23434 }
23435 else
23437 }
23438 else
23439 {
23442 }
23443 }
23448 {
23450 class_key,
23452 }
23455 /* If it's not a `:' or a `{' then we can't really be looking at a
23456 class-head, since a class-head only appears as part of a
23457 class-specifier. We have to detect this situation before calling
23458 xref_tag, since that has irreversible side-effects. */
23460 {
23464 }
23466 /* At this point, we're going ahead with the class-specifier, even
23467 if some other problem occurs. */
23470 {
23475 }
23476 /* Issue the error about the overly-qualified name now. */
23478 {
23483 }
23485 {
23490 }
23492 {
23493 tree scope;
23496 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23497 keyword template shall not appear at the top level. */
23501 /* Reject typedef-names in class heads. */
23503 {
23506 type);
23509 }
23511 /* Figure out in what scope the declaration is being placed. */
23513 /* If that scope does not contain the scope in which the
23514 class was originally declared, the program is invalid. */
23516 {
23519 "declaration of %qD in namespace %qD which does not "
23522 else
23528 }
23529 /* [dcl.meaning]
23531 A declarator-id shall not be qualified except for the
23532 definition of a ... nested class outside of its class
23533 ... [or] the definition or explicit instantiation of a
23534 class member of a namespace outside of its namespace. */
23536 {
23541 }
23542 }
23543 /* An explicit-specialization must be preceded by "template <>". If
23544 it is not, try to recover gracefully. */
23547 && !processing_template_parmlist
23549 {
23550 /* Build a location of this form:
23551 struct typename <ARGS>
23552 ^~~~~~~~~~~~~~~~~~~~~~
23553 with caret==start at the start token, and
23554 finishing at the end of the type. */
23555 location_t reported_loc
23557 class_head_start_location,
23563 "an explicit specialization must be preceded by"
23566 /* Take the same action that would have been taken by
23567 cp_parser_explicit_specialization. */
23570 }
23571 /* There must be no "return" statements between this point and the
23572 end of this function; set "type "to the correct return value and
23573 use "goto done;" to return. */
23574 /* Make sure that the right number of template parameters were
23575 present. */
23577 template_id_p,
23580 {
23581 /* If something went wrong, there is no point in even trying to
23582 process the class-definition. */
23585 }
23587 /* Look up the type. */
23589 {
23593 {
23597 }
23598 else
23599 {
23603 /* Check the scope while we still know whether or not we had a
23604 nested-name-specifier. */
23607 }
23610 }
23612 {
23613 tree class_type;
23615 /* Given:
23617 template <typename T> struct S { struct T };
23618 template <typename T> struct S<T>::T { };
23620 we will get a TYPENAME_TYPE when processing the definition of
23621 `S::T'. We need to resolve it to the actual type before we
23622 try to define it. */
23624 {
23629 else
23630 {
23633 }
23634 }
23638 {
23641 }
23644 /* Enter the scope indicated by the nested-name-specifier. */
23646 /* Get the canonical version of this type. */
23648 /* Call push_template_decl if it seems like we should be defining a
23649 template either from the template headers or the type we're
23650 defining, so that we diagnose both extra and missing headers. */
23654 {
23657 {
23660 }
23661 }
23665 }
23667 {
23668 /* If the class was unnamed, create a dummy name. */
23672 ? ts_within_enclosing_non_class
23676 }
23678 /* Indicate whether this class was declared as a `class' or as a
23679 `struct'. */
23684 /* If this type was already complete, and we see another definition,
23685 that's an error. */
23687 {
23689 type);
23691 type);
23694 }
23699 {
23700 /* Apply attributes now, before any use of the class as a template
23701 argument in its base list. */
23704 }
23706 /* We will have entered the scope containing the class; the names of
23707 base classes should be looked up in that context. For example:
23709 struct A { struct B {}; struct C; };
23710 struct A::C : B {};
23712 is valid. */
23714 /* Get the list of base-classes, if there is one. */
23716 {
23717 /* PR59482: enter the class scope so that base-specifiers are looked
23718 up correctly. */
23722 /* PR59482: get out of the previously pushed class scope so that the
23723 subsequent pops pop the right thing. */
23726 }
23727 else
23730 /* If we're really defining a class, process the base classes.
23731 If they're invalid, fail. */
23735 done:
23736 /* Leave the scope given by the nested-name-specifier. We will
23737 enter the class scope itself while processing the members. */
23742 {
23745 }
23751 out:
23754 }
23756 /* Parse a class-key.
23758 class-key:
23759 class
23760 struct
23761 union
23763 Returns the kind of class-key specified, or none_type to indicate
23764 error. */
23766 static enum tag_types
23768 {
23772 /* Look for the class-key. */
23777 /* Check to see if the TOKEN is a class-key. */
23782 }
23784 /* Parse a type-parameter-key.
23786 type-parameter-key:
23787 class
23788 typename
23789 */
23791 static void
23793 {
23794 /* Look for the type-parameter-key. */
23798 {
23801 /* typename is not allowed in a template template parameter
23802 by the standard until C++17. */
23804 "ISO C++ forbids typename key in template template parameter;"
23806 }
23807 else
23811 }
23813 /* Parse an (optional) member-specification.
23815 member-specification:
23816 member-declaration member-specification [opt]
23817 access-specifier : member-specification [opt] */
23819 static void
23821 {
23823 {
23827 /* Peek at the next token. */
23829 /* If it's a `}', or EOF then we've seen all the members. */
23835 /* See if this token is a keyword. */
23838 {
23842 /* Consume the access-specifier. */
23844 /* Remember which access-specifier is active. */
23846 /* Look for the `:'. */
23851 /* Accept #pragmas at class scope. */
23853 {
23856 }
23858 /* Otherwise, the next construction must be a
23859 member-declaration. */
23861 }
23862 }
23863 }
23865 /* Parse a member-declaration.
23867 member-declaration:
23868 decl-specifier-seq [opt] member-declarator-list [opt] ;
23869 function-definition ; [opt]
23870 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23871 using-declaration
23872 template-declaration
23873 alias-declaration
23875 member-declarator-list:
23876 member-declarator
23877 member-declarator-list , member-declarator
23879 member-declarator:
23880 declarator pure-specifier [opt]
23881 declarator constant-initializer [opt]
23882 identifier [opt] : constant-expression
23884 GNU Extensions:
23886 member-declaration:
23887 __extension__ member-declaration
23889 member-declarator:
23890 declarator attributes [opt] pure-specifier [opt]
23891 declarator attributes [opt] constant-initializer [opt]
23892 identifier [opt] attributes [opt] : constant-expression
23894 C++0x Extensions:
23896 member-declaration:
23897 static_assert-declaration */
23899 static void
23901 {
23902 cp_decl_specifier_seq decl_specifiers;
23903 tree prefix_attributes;
23904 tree decl;
23913 /* Check for the `__extension__' keyword. */
23915 {
23916 /* Recurse. */
23918 /* Restore the old value of the PEDANTIC flag. */
23922 }
23924 /* Check for a template-declaration. */
23926 {
23927 /* An explicit specialization here is an error condition, and we
23928 expect the specialization handler to detect and report this. */
23932 else
23936 }
23937 /* Check for a template introduction. */
23941 /* Check for a using-declaration. */
23943 {
23945 {
23946 /* Parse the using-declaration. */
23950 }
23951 else
23952 {
23953 tree decl;
23957 /* Note that if we actually see the '=' token after the
23958 identifier, cp_parser_alias_declaration commits the
23959 tentative parse. In that case, we really expect an
23960 alias-declaration. Otherwise, we expect a using
23961 declaration. */
23962 alias_decl_expected =
23968 else
23972 }
23973 }
23975 /* Check for @defs. */
23977 {
23982 {
23987 }
23989 }
23991 /* If the next token is `static_assert' we have a static assertion. */
23993 {
23996 }
24003 /* Parse the decl-specifier-seq. */
24006 CP_PARSER_FLAGS_OPTIONAL,
24009 /* Check for an invalid type-name. */
24013 /* If there is no declarator, then the decl-specifier-seq should
24014 specify a type. */
24016 {
24017 /* If there was no decl-specifier-seq, and the next token is a
24018 `;', then we have something like:
24020 struct S { ; };
24022 [class.mem]
24024 Each member-declaration shall declare at least one member
24025 name of the class. */
24027 {
24030 {
24034 }
24035 }
24036 else
24037 {
24038 tree type;
24040 /* See if this declaration is a friend. */
24042 /* If there were decl-specifiers, check to see if there was
24043 a class-declaration. */
24046 /* Nested classes have already been added to the class, but
24047 a `friend' needs to be explicitly registered. */
24049 {
24050 /* If the `friend' keyword was present, the friend must
24051 be introduced with a class-key. */
24054 "in C++03 a class-key must be used "
24056 /* In this case:
24058 template <typename T> struct A {
24059 friend struct A<T>::B;
24060 };
24062 A<T>::B will be represented by a TYPENAME_TYPE, and
24063 therefore not recognized by check_tag_decl. */
24065 {
24069 }
24072 "friend declaration does not name a class or "
24074 else
24077 }
24078 /* If there is no TYPE, an error message will already have
24079 been issued. */
24081 ;
24082 /* An anonymous aggregate has to be handled specially; such
24083 a declaration really declares a data member (with a
24084 particular type), as opposed to a nested class. */
24086 {
24087 /* C++11 9.5/6. */
24090 "a storage class on an anonymous aggregate "
24093 /* Remove constructors and such from TYPE, now that we
24094 know it is an anonymous aggregate. */
24096 /* And make the corresponding data member. */
24099 /* Add it to the class. */
24101 }
24102 else
24103 cp_parser_check_access_in_redeclaration
24106 }
24107 }
24108 else
24109 {
24112 /* Clear attributes from the decl_specifiers but keep them
24113 around as prefix attributes that apply them to the entity
24114 being declared. */
24118 /* See if these declarations will be friends. */
24121 /* Keep going until we hit the `;' at the end of the
24122 declaration. */
24124 {
24126 tree first_attribute;
24127 tree initializer;
24130 /* Peek at the next token. */
24133 /* The following code wants to know early if it is a bit-field
24134 or some other declaration. Attributes can appear before
24135 the `:' token. Skip over them without consuming any tokens
24136 to peek if they are followed by `:'. */
24141 {
24142 size_t n
24145 }
24147 /* Check for a bitfield declaration. */
24153 {
24154 tree identifier;
24155 tree width;
24157 location_t id_location
24162 else
24165 /* Look for attributes that apply to the bitfield. */
24168 /* Consume the `:' token. */
24171 /* Get the width of the bitfield. */
24175 /* In C++2A and as extension for C++11 and above we allow
24176 default member initializers for bit-fields. */
24181 CPP_OPEN_BRACE)))
24182 {
24183 location_t loc
24189 "default member initializers for bit-fields "
24190 "only available with -std=c++2a or "
24195 {
24199 }
24200 }
24201 else
24202 {
24203 /* Look for attributes that apply to the bitfield after
24204 the `:' token and width. This is where GCC used to
24205 parse attributes in the past, pedwarn if there is
24206 a std attribute. */
24209 "ISO C++ allows bit-field attributes only "
24213 }
24217 /* Remember which attributes are prefix attributes and
24218 which are not. */
24220 /* Combine the attributes. */
24223 /* Create the bitfield declaration. */
24226 identifier,
24227 sfk_none,
24228 id_location)
24232 attributes);
24233 }
24234 else
24235 {
24237 tree asm_specification;
24240 /* Parse the declarator. */
24241 declarator
24246 friend_p);
24248 /* If something went wrong parsing the declarator, make sure
24249 that we at least consume some tokens. */
24251 {
24252 /* Skip to the end of the statement. */
24254 /* If the next token is not a semicolon, that is
24255 probably because we just skipped over the body of
24256 a function. So, we consume a semicolon if
24257 present, but do not issue an error message if it
24258 is not present. */
24260 CPP_SEMICOLON))
24263 }
24266 cp_parser_check_for_definition_in_return_type
24270 /* Look for an asm-specification. */
24272 /* Look for attributes that apply to the declaration. */
24274 /* Remember which attributes are prefix attributes and
24275 which are not. */
24277 /* Combine the attributes. */
24280 /* If it's an `=', then we have a constant-initializer or a
24281 pure-specifier. It is not correct to parse the
24282 initializer before registering the member declaration
24283 since the member declaration should be in scope while
24284 its initializer is processed. However, the rest of the
24285 front end does not yet provide an interface that allows
24286 us to handle this correctly. */
24288 {
24289 /* In [class.mem]:
24291 A pure-specifier shall be used only in the declaration of
24292 a virtual function.
24294 A member-declarator can contain a constant-initializer
24295 only if it declares a static member of integral or
24296 enumeration type.
24298 Therefore, if the DECLARATOR is for a function, we look
24299 for a pure-specifier; otherwise, we look for a
24300 constant-initializer. When we call `grokfield', it will
24301 perform more stringent semantics checks. */
24313 {
24315 /* Don't require a constant rvalue in C++11, since we
24316 might want a reference constant. We'll enforce
24317 constancy later. */
24319 /* Parse the initializer. */
24322 }
24323 else
24324 /* Parse the initializer. */
24326 }
24329 {
24333 else
24335 }
24336 /* Otherwise, there is no initializer. */
24337 else
24340 /* See if we are probably looking at a function
24341 definition. We are certainly not looking at a
24342 member-declarator. Calling `grokfield' has
24343 side-effects, so we must not do it unless we are sure
24344 that we are looking at a member-declarator. */
24347 {
24348 /* The grammar does not allow a pure-specifier to be
24349 used when a member function is defined. (It is
24350 possible that this fact is an oversight in the
24351 standard, since a pure function may be defined
24352 outside of the class-specifier. */
24358 declarator,
24359 attributes);
24362 /* If the member was not a friend, declare it here. */
24365 /* Peek at the next token. */
24367 /* If the next token is a semicolon, consume it. */
24369 {
24370 location_t semicolon_loc
24375 "extra %<;%> after in-class "
24377 }
24379 }
24380 else
24383 /* Create the declaration. */
24388 {
24391 else
24393 }
24394 }
24399 /* Reset PREFIX_ATTRIBUTES. */
24401 {
24406 }
24408 /* If there is any qualification still in effect, clear it
24409 now; we will be starting fresh with the next declarator. */
24413 /* If it's a `,', then there are more declarators. */
24415 {
24418 {
24424 }
24425 }
24426 /* If the next token isn't a `;', then we have a parse error. */
24428 CPP_SEMICOLON))
24429 {
24430 /* The next token might be a ways away from where the
24431 actual semicolon is missing. Find the previous token
24432 and use that for our error position. */
24439 /* Assume that the user meant to provide a semicolon. If
24440 we were to cp_parser_skip_to_end_of_statement, we might
24441 skip to a semicolon inside a member function definition
24442 and issue nonsensical error messages. */
24444 }
24447 {
24448 /* Add DECL to the list of members. */
24450 /* Explicitly include, eg, NSDMIs, for better error
24451 recovery (c++/58650). */
24459 /* Add DECL to the queue of NSDMI to be parsed later. */
24461 }
24465 }
24466 }
24469 out:
24471 }
24473 /* Parse a pure-specifier.
24475 pure-specifier:
24476 = 0
24478 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24479 Otherwise, ERROR_MARK_NODE is returned. */
24481 static tree
24483 {
24486 /* Look for the `=' token. */
24489 /* Look for the `0' token. */
24498 /* Accept = default or = delete in c++0x mode. */
24501 {
24504 }
24506 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24508 {
24513 }
24515 {
24518 }
24521 }
24523 /* Parse a constant-initializer.
24525 constant-initializer:
24526 = constant-expression
24528 Returns a representation of the constant-expression. */
24530 static tree
24532 {
24533 /* Look for the `=' token. */
24537 /* It is invalid to write:
24539 struct S { static const int i = { 7 }; };
24541 */
24543 {
24546 /* Consume the opening brace. */
24547 matching_braces braces;
24549 /* Skip the initializer. */
24551 /* Look for the trailing `}'. */
24555 }
24558 }
24560 /* Derived classes [gram.class.derived] */
24562 /* Parse a base-clause.
24564 base-clause:
24565 : base-specifier-list
24567 base-specifier-list:
24568 base-specifier ... [opt]
24569 base-specifier-list , base-specifier ... [opt]
24571 Returns a TREE_LIST representing the base-classes, in the order in
24572 which they were declared. The representation of each node is as
24573 described by cp_parser_base_specifier.
24575 In the case that no bases are specified, this function will return
24576 NULL_TREE, not ERROR_MARK_NODE. */
24578 static tree
24580 {
24583 /* Look for the `:' that begins the list. */
24586 /* Scan the base-specifier-list. */
24588 {
24590 tree base;
24593 /* Look for the base-specifier. */
24595 /* Look for the (optional) ellipsis. */
24597 {
24598 /* Consume the `...'. */
24602 }
24604 /* Add BASE to the front of the list. */
24606 {
24608 /* Make this a pack expansion type. */
24612 {
24615 }
24616 }
24617 /* Peek at the next token. */
24619 /* If it's not a comma, then the list is complete. */
24622 /* Consume the `,'. */
24624 }
24626 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24627 base class had a qualified name. However, the next name that
24628 appears is certainly not qualified. */
24634 }
24636 /* Parse a base-specifier.
24638 base-specifier:
24639 :: [opt] nested-name-specifier [opt] class-name
24640 virtual access-specifier [opt] :: [opt] nested-name-specifier
24641 [opt] class-name
24642 access-specifier virtual [opt] :: [opt] nested-name-specifier
24643 [opt] class-name
24645 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24646 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24647 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24648 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24650 static tree
24652 {
24660 tree type;
24662 /* Process the optional `virtual' and `access-specifier'. */
24664 {
24665 /* Peek at the next token. */
24667 /* Process `virtual'. */
24669 {
24671 /* If `virtual' appears more than once, issue an error. */
24673 {
24677 }
24681 /* Consume the `virtual' token. */
24689 /* If more than one access specifier appears, issue an
24690 error. */
24693 {
24697 }
24701 /* Consume the access-specifier. */
24709 }
24710 }
24711 /* It is not uncommon to see programs mechanically, erroneously, use
24712 the 'typename' keyword to denote (dependent) qualified types
24713 as base classes. */
24715 {
24720 else
24722 "keyword %<typename%> not allowed in this context "
24725 }
24727 /* Look for the optional `::' operator. */
24729 /* Look for the nested-name-specifier. The simplest way to
24730 implement:
24732 [temp.res]
24734 The keyword `typename' is not permitted in a base-specifier or
24735 mem-initializer; in these contexts a qualified name that
24736 depends on a template-parameter is implicitly assumed to be a
24737 type name.
24739 is to pretend that we have seen the `typename' keyword at this
24740 point. */
24746 /* If the base class is given by a qualified name, assume that names
24747 we see are type names or templates, as appropriate. */
24753 /* DR 950 allows decltype as a base-specifier. */
24755 else
24756 {
24757 /* Otherwise, look for the class-name. */
24759 class_scope_p,
24760 template_p,
24761 typename_type,
24766 }
24772 }
24774 /* Exception handling [gram.exception] */
24776 /* Parse an (optional) noexcept-specification.
24778 noexcept-specification:
24779 noexcept ( constant-expression ) [opt]
24781 If no noexcept-specification is present, returns NULL_TREE.
24782 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24783 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24784 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24785 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24786 in which case a boolean condition is returned instead. */
24788 static tree
24793 {
24797 /* Peek at the next token. */
24800 /* Is it a noexcept-specification? */
24802 {
24803 tree expr;
24807 {
24808 matching_parens parens;
24818 {
24819 /* Types may not be defined in an exception-specification. */
24821 parser->type_definition_forbidden_message
24826 /* Restore the saved message. */
24828 }
24829 else
24830 {
24833 }
24839 }
24840 else
24841 {
24845 }
24847 /* We cannot build a noexcept-spec right away because this will check
24848 that expr is a constexpr. */
24851 else
24853 }
24854 else
24856 }
24858 /* Parse an (optional) exception-specification.
24860 exception-specification:
24861 throw ( type-id-list [opt] )
24863 Returns a TREE_LIST representing the exception-specification. The
24864 TREE_VALUE of each node is a type. */
24866 static tree
24868 {
24870 tree type_id_list;
24873 /* Peek at the next token. */
24876 /* Is it a noexcept-specification? */
24882 /* If it's not `throw', then there's no exception-specification. */
24888 /* Consume the `throw'. */
24891 /* Look for the `('. */
24892 matching_parens parens;
24895 /* Peek at the next token. */
24897 /* If it's not a `)', then there is a type-id-list. */
24899 {
24900 /* Types may not be defined in an exception-specification. */
24902 parser->type_definition_forbidden_message
24904 /* Parse the type-id-list. */
24906 /* Restore the saved message. */
24910 {
24914 }
24917 "dynamic exception specifications are deprecated in "
24919 }
24920 /* In C++17, throw() is equivalent to noexcept (true). throw()
24921 is deprecated in C++11 and above as well, but is still widely used,
24922 so don't warn about it yet. */
24925 else
24928 /* Look for the `)'. */
24932 }
24934 /* Parse an (optional) type-id-list.
24936 type-id-list:
24937 type-id ... [opt]
24938 type-id-list , type-id ... [opt]
24940 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24941 in the order that the types were presented. */
24943 static tree
24945 {
24949 {
24951 tree type;
24955 /* Get the next type-id. */
24957 /* Check for invalid 'auto'. */
24959 {
24963 }
24964 /* Parse the optional ellipsis. */
24966 {
24967 /* Consume the `...'. */
24970 /* Turn the type into a pack expansion expression. */
24972 }
24973 /* Add it to the list. */
24975 /* Peek at the next token. */
24977 /* If it is not a `,', we are done. */
24980 /* Consume the `,'. */
24982 }
24985 }
24987 /* Parse a try-block.
24989 try-block:
24990 try compound-statement handler-seq */
24992 static tree
24994 {
24995 tree try_block;
25009 }
25011 /* Parse a function-try-block.
25013 function-try-block:
25014 try ctor-initializer [opt] function-body handler-seq */
25016 static void
25018 {
25019 tree compound_stmt;
25020 tree try_block;
25022 /* Look for the `try' keyword. */
25025 /* Let the rest of the front end know where we are. */
25027 /* Parse the function-body. */
25028 cp_parser_ctor_initializer_opt_and_function_body
25030 /* We're done with the `try' part. */
25032 /* Parse the handlers. */
25034 /* We're done with the handlers. */
25036 }
25038 /* Parse a handler-seq.
25040 handler-seq:
25041 handler handler-seq [opt] */
25043 static void
25045 {
25047 {
25050 /* Parse the handler. */
25052 /* Peek at the next token. */
25054 /* If it's not `catch' then there are no more handlers. */
25057 }
25058 }
25060 /* Parse a handler.
25062 handler:
25063 catch ( exception-declaration ) compound-statement */
25065 static void
25067 {
25068 tree handler;
25069 tree declaration;
25073 matching_parens parens;
25080 }
25082 /* Parse an exception-declaration.
25084 exception-declaration:
25085 type-specifier-seq declarator
25086 type-specifier-seq abstract-declarator
25087 type-specifier-seq
25088 ...
25090 Returns a VAR_DECL for the declaration, or NULL_TREE if the
25091 ellipsis variant is used. */
25093 static tree
25095 {
25096 cp_decl_specifier_seq type_specifiers;
25100 /* If it's an ellipsis, it's easy to handle. */
25102 {
25103 /* Consume the `...' token. */
25106 }
25108 /* Types may not be defined in exception-declarations. */
25110 parser->type_definition_forbidden_message
25113 /* Parse the type-specifier-seq. */
25117 /* If it's a `)', then there is no declarator. */
25120 else
25127 /* Restore the saved message. */
25134 }
25136 /* Parse a throw-expression.
25138 throw-expression:
25139 throw assignment-expression [opt]
25141 Returns a THROW_EXPR representing the throw-expression. */
25143 static tree
25145 {
25146 tree expression;
25151 /* Figure out whether or not there is an assignment-expression
25152 following the "throw" keyword. */
25160 else
25164 }
25166 /* GNU Extensions */
25168 /* Parse an (optional) asm-specification.
25170 asm-specification:
25171 asm ( string-literal )
25173 If the asm-specification is present, returns a STRING_CST
25174 corresponding to the string-literal. Otherwise, returns
25175 NULL_TREE. */
25177 static tree
25179 {
25181 tree asm_specification;
25183 /* Peek at the next token. */
25185 /* If the next token isn't the `asm' keyword, then there's no
25186 asm-specification. */
25190 /* Consume the `asm' token. */
25192 /* Look for the `('. */
25193 matching_parens parens;
25196 /* Look for the string-literal. */
25199 /* Look for the `)'. */
25203 }
25205 /* Parse an asm-operand-list.
25207 asm-operand-list:
25208 asm-operand
25209 asm-operand-list , asm-operand
25211 asm-operand:
25212 string-literal ( expression )
25213 [ string-literal ] string-literal ( expression )
25215 Returns a TREE_LIST representing the operands. The TREE_VALUE of
25216 each node is the expression. The TREE_PURPOSE is itself a
25217 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
25218 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
25219 is a STRING_CST for the string literal before the parenthesis. Returns
25220 ERROR_MARK_NODE if any of the operands are invalid. */
25222 static tree
25224 {
25229 {
25230 tree string_literal;
25231 tree expression;
25232 tree name;
25235 {
25236 /* Consume the `[' token. */
25238 /* Read the operand name. */
25243 /* Look for the closing `]'. */
25245 }
25246 else
25248 /* Look for the string-literal. */
25251 /* Look for the `('. */
25252 matching_parens parens;
25254 /* Parse the expression. */
25256 /* Look for the `)'. */
25264 /* Add this operand to the list. */
25266 expression,
25267 asm_operands);
25268 /* If the next token is not a `,', there are no more
25269 operands. */
25272 /* Consume the `,'. */
25274 }
25277 }
25279 /* Parse an asm-clobber-list.
25281 asm-clobber-list:
25282 string-literal
25283 asm-clobber-list , string-literal
25285 Returns a TREE_LIST, indicating the clobbers in the order that they
25286 appeared. The TREE_VALUE of each node is a STRING_CST. */
25288 static tree
25290 {
25294 {
25295 tree string_literal;
25297 /* Look for the string literal. */
25299 /* Add it to the list. */
25301 /* If the next token is not a `,', then the list is
25302 complete. */
25305 /* Consume the `,' token. */
25307 }
25310 }
25312 /* Parse an asm-label-list.
25314 asm-label-list:
25315 identifier
25316 asm-label-list , identifier
25318 Returns a TREE_LIST, indicating the labels in the order that they
25319 appeared. The TREE_VALUE of each node is a label. */
25321 static tree
25323 {
25327 {
25330 /* Look for the identifier. */
25333 {
25336 {
25342 }
25343 }
25344 /* If the next token is not a `,', then the list is
25345 complete. */
25348 /* Consume the `,' token. */
25350 }
25353 }
25355 /* Return TRUE iff the next tokens in the stream are possibly the
25356 beginning of a GNU extension attribute. */
25358 static bool
25360 {
25362 }
25364 /* Return TRUE iff the next tokens in the stream are possibly the
25365 beginning of a standard C++-11 attribute specifier. */
25367 static bool
25369 {
25371 }
25373 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25374 beginning of a standard C++-11 attribute specifier. */
25376 static bool
25378 {
25386 }
25388 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25389 beginning of a GNU extension attribute. */
25391 static bool
25393 {
25397 }
25399 /* Return true iff the next tokens can be the beginning of either a
25400 GNU attribute list, or a standard C++11 attribute sequence. */
25402 static bool
25404 {
25407 }
25409 /* Return true iff the next Nth tokens can be the beginning of either
25410 a GNU attribute list, or a standard C++11 attribute sequence. */
25412 static bool
25414 {
25417 }
25419 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
25420 of GNU attributes, or return NULL. */
25422 static tree
25424 {
25428 }
25430 /* Parse an (optional) series of attributes.
25432 attributes:
25433 attributes attribute
25435 attribute:
25436 __attribute__ (( attribute-list [opt] ))
25438 The return value is as for cp_parser_gnu_attribute_list. */
25440 static tree
25442 {
25449 {
25451 tree attribute_list;
25454 /* Peek at the next token. */
25456 /* If it's not `__attribute__', then we're done. */
25460 /* Consume the `__attribute__' keyword. */
25462 /* Look for the two `(' tokens. */
25463 matching_parens outer_parens;
25465 matching_parens inner_parens;
25468 /* Peek at the next token. */
25471 /* Parse the attribute-list. */
25473 else
25474 /* If the next token is a `)', then there is no attribute
25475 list. */
25478 /* Look for the two `)' tokens. */
25486 /* Add these new attributes to the list. */
25488 }
25491 }
25493 /* Parse a GNU attribute-list.
25495 attribute-list:
25496 attribute
25497 attribute-list , attribute
25499 attribute:
25500 identifier
25501 identifier ( identifier )
25502 identifier ( identifier , expression-list )
25503 identifier ( expression-list )
25505 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25506 to an attribute. The TREE_PURPOSE of each node is the identifier
25507 indicating which attribute is in use. The TREE_VALUE represents
25508 the arguments, if any. */
25510 static tree
25512 {
25518 {
25520 tree identifier;
25521 tree attribute;
25523 /* Look for the identifier. We also allow keywords here; for
25524 example `__attribute__ ((const))' is legal. */
25528 {
25531 /* Consume the token, but save it since we need it for the
25532 SIMD enabled function parsing. */
25535 /* Save away the identifier that indicates which attribute
25536 this is. */
25538 /* For keywords, use the canonical spelling, not the
25539 parsed identifier. */
25546 /* Peek at the next token. */
25548 /* If it's an `(', then parse the attribute arguments. */
25550 {
25554 vec = cp_parser_parenthesized_expression_list
25560 else
25561 {
25564 }
25565 /* Save the arguments away. */
25567 }
25570 {
25571 /* Add this attribute to the list. */
25574 }
25577 }
25578 /* Unless EXACTLY_ONE is set look for more attributes.
25579 If the next token isn't a `,', we're done. */
25583 /* Consume the comma and keep going. */
25585 }
25588 /* We built up the list in reverse order. */
25590 }
25592 /* Parse a standard C++11 attribute.
25594 The returned representation is a TREE_LIST which TREE_PURPOSE is
25595 the scoped name of the attribute, and the TREE_VALUE is its
25596 arguments list.
25598 Note that the scoped name of the attribute is itself a TREE_LIST
25599 which TREE_PURPOSE is the namespace of the attribute, and
25600 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25601 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25602 and which TREE_PURPOSE is directly the attribute name.
25604 Clients of the attribute code should use get_attribute_namespace
25605 and get_attribute_name to get the actual namespace and name of
25606 attributes, regardless of their being GNU or C++11 attributes.
25608 attribute:
25609 attribute-token attribute-argument-clause [opt]
25611 attribute-token:
25612 identifier
25613 attribute-scoped-token
25615 attribute-scoped-token:
25616 attribute-namespace :: identifier
25618 attribute-namespace:
25619 identifier
25621 attribute-argument-clause:
25622 ( balanced-token-seq )
25624 balanced-token-seq:
25625 balanced-token [opt]
25626 balanced-token-seq balanced-token
25628 balanced-token:
25629 ( balanced-token-seq )
25630 [ balanced-token-seq ]
25631 { balanced-token-seq }. */
25633 static tree
25635 {
25642 /* First, parse name of the attribute, a.k.a attribute-token. */
25659 {
25660 /* We are seeing a scoped attribute token. */
25675 else
25676 {
25680 }
25685 NULL_TREE);
25687 }
25689 {
25693 NULL_TREE);
25694 }
25695 else
25696 {
25699 NULL_TREE);
25700 /* C++11 noreturn attribute is equivalent to GNU's. */
25703 /* C++14 deprecated attribute is equivalent to GNU's. */
25706 /* C++17 fallthrough attribute is equivalent to GNU's. */
25709 /* Transactional Memory TS optimize_for_synchronized attribute is
25710 equivalent to GNU transaction_callable. */
25714 /* Transactional Memory attributes are GNU attributes. */
25717 }
25719 /* Now parse the optional argument clause of the attribute. */
25724 {
25730 /* A GNU attribute that takes an identifier in parameter. */
25733 vec = cp_parser_parenthesized_expression_list
25739 else
25740 {
25743 }
25747 else
25749 }
25752 }
25754 /* Check that the attribute ATTRIBUTE appears at most once in the
25755 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25756 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25757 isn't implemented yet in GCC. */
25759 static void
25761 {
25763 {
25773 }
25774 }
25776 /* Parse a list of standard C++-11 attributes.
25778 attribute-list:
25779 attribute [opt]
25780 attribute-list , attribute[opt]
25781 attribute ...
25782 attribute-list , attribute ...
25783 */
25785 static tree
25787 {
25792 {
25797 {
25801 }
25804 {
25809 else
25810 {
25815 }
25817 }
25821 }
25824 }
25826 /* Parse a standard C++-11 attribute specifier.
25828 attribute-specifier:
25829 [ [ attribute-using-prefix [opt] attribute-list ] ]
25830 alignment-specifier
25832 attribute-using-prefix:
25833 using attribute-namespace :
25835 alignment-specifier:
25836 alignas ( type-id ... [opt] )
25837 alignas ( alignment-expression ... [opt] ). */
25839 static tree
25841 {
25847 {
25854 {
25865 {
25869 "attribute using prefix only available "
25875 }
25876 else
25878 }
25885 else
25886 /* Warn about parsing c++11 attribute in non-c++11 mode, only
25887 when we are sure that we have actually parsed them. */
25889 }
25890 else
25891 {
25892 tree alignas_expr;
25894 /* Look for an alignment-specifier. */
25905 matching_parens parens;
25913 {
25920 }
25925 /* Handle alignas (pack...). */
25927 {
25930 }
25932 /* Something went wrong, so don't build the attribute. */
25939 /* Build the C++-11 representation of an 'aligned'
25940 attribute. */
25941 attributes
25944 }
25947 }
25949 /* Parse a standard C++-11 attribute-specifier-seq.
25951 attribute-specifier-seq:
25952 attribute-specifier-seq [opt] attribute-specifier
25953 */
25955 static tree
25957 {
25962 {
25971 else
25974 }
25977 }
25979 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25980 return index of the first token after balanced-token, or N on failure. */
25982 static size_t
25984 {
25987 do
25989 {
25992 /* Ran out of tokens. */
26014 }
26017 }
26019 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
26020 return index of the first token after the GNU attribute tokens, or N on
26021 failure. */
26023 static size_t
26025 {
26027 {
26039 }
26041 }
26043 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
26044 next token), return index of the first token after the standard C++11
26045 attribute tokens, or N on failure. */
26047 static size_t
26049 {
26051 {
26054 {
26061 }
26064 {
26069 }
26070 else
26072 }
26074 }
26076 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
26077 as the next token), return index of the first token after the attribute
26078 tokens, or N on failure. */
26080 static size_t
26082 {
26086 }
26088 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
26089 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
26090 current value of the PEDANTIC flag, regardless of whether or not
26091 the `__extension__' keyword is present. The caller is responsible
26092 for restoring the value of the PEDANTIC flag. */
26094 static bool
26096 {
26097 /* Save the old value of the PEDANTIC flag. */
26101 {
26102 /* Consume the `__extension__' token. */
26104 /* We're not being pedantic while the `__extension__' keyword is
26105 in effect. */
26109 }
26112 }
26114 /* Parse a label declaration.
26116 label-declaration:
26117 __label__ label-declarator-seq ;
26119 label-declarator-seq:
26120 identifier , label-declarator-seq
26121 identifier */
26123 static void
26125 {
26126 /* Look for the `__label__' keyword. */
26130 {
26131 tree identifier;
26133 /* Look for an identifier. */
26135 /* If we failed, stop. */
26138 /* Declare it as a label. */
26140 /* If the next token is a `;', stop. */
26143 /* Look for the `,' separating the label declarations. */
26145 }
26147 /* Look for the final `;'. */
26149 }
26151 // -------------------------------------------------------------------------- //
26152 // Requires Clause
26154 // Parse a requires clause.
26155 //
26156 // requires-clause:
26157 // 'requires' logical-or-expression
26158 //
26159 // The required logical-or-expression must be a constant expression. Note
26160 // that we don't check that the expression is constepxr here. We defer until
26161 // we analyze constraints and then, we only check atomic constraints.
26162 static tree
26164 {
26165 // Parse the requires clause so that it is not automatically folded.
26173 }
26175 // Optionally parse a requires clause:
26176 static tree
26178 {
26181 {
26184 {
26187 /* Parse and discard the requires-clause. */
26190 }
26192 }
26195 }
26198 /*---------------------------------------------------------------------------
26199 Requires expressions
26200 ---------------------------------------------------------------------------*/
26202 /* Parse a requires expression
26204 requirement-expression:
26205 'requires' requirement-parameter-list [opt] requirement-body */
26206 static tree
26208 {
26212 /* A requires-expression shall appear only within a concept
26213 definition or a requires-clause.
26215 TODO: Implement this diagnostic correctly. */
26217 {
26221 }
26224 {
26225 /* Local parameters are delared as variables within the scope
26226 of the expression. They are not visible past the end of
26227 the expression. Expressions within the requires-expression
26228 are unevaluated. */
26229 struct scope_sentinel
26230 {
26232 {
26235 }
26238 {
26241 }
26244 /* Parse the optional parameter list. */
26246 {
26250 }
26251 else
26254 /* Parse the requirement body. */
26258 }
26260 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
26261 the parm chain. */
26264 }
26266 /* Parse a parameterized requirement.
26268 requirement-parameter-list:
26269 '(' parameter-declaration-clause ')' */
26270 static tree
26272 {
26273 matching_parens parens;
26283 }
26285 /* Parse the body of a requirement.
26287 requirement-body:
26288 '{' requirement-list '}' */
26289 static tree
26291 {
26292 matching_braces braces;
26302 }
26304 /* Parse a list of requirements.
26306 requirement-list:
26307 requirement
26308 requirement-list ';' requirement[opt] */
26309 static tree
26311 {
26314 {
26321 /* If we see a semi-colon, consume it. */
26325 /* Stop processing at the end of the list. */
26328 }
26330 /* Reverse the order of requirements so they are analyzed in
26331 declaration order. */
26333 }
26335 /* Parse a syntactic requirement or type requirement.
26337 requirement:
26338 simple-requirement
26339 compound-requirement
26340 type-requirement
26341 nested-requirement */
26342 static tree
26344 {
26351 else
26353 }
26355 /* Parse a simple requirement.
26357 simple-requirement:
26358 expression ';' */
26359 static tree
26361 {
26370 }
26372 /* Parse a type requirement
26374 type-requirement
26375 nested-name-specifier [opt] required-type-name ';'
26377 required-type-name:
26378 type-name
26379 'template' [opt] simple-template-id */
26380 static tree
26382 {
26385 // Save the scope before parsing name specifiers.
26396 tree type;
26398 {
26407 }
26408 else
26427 }
26429 /* Parse a compound requirement
26431 compound-requirement:
26432 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
26433 static tree
26435 {
26436 /* Parse an expression enclosed in '{ }'s. */
26437 matching_braces braces;
26448 /* Parse the optional noexcept. */
26451 {
26454 }
26456 /* Parse the optional trailing return type. */
26459 {
26467 }
26470 }
26472 /* Parse a nested requirement. This is the same as a requires clause.
26474 nested-requirement:
26475 requires-clause */
26476 static tree
26478 {
26484 }
26486 /* Support Functions */
26488 /* Return the appropriate prefer_type argument for lookup_name_real based on
26489 tag_type and template_mem_access. */
26493 {
26494 /* DR 141: When looking in the current enclosing context for a template-name
26495 after -> or ., only consider class templates. */
26499 {
26503 }
26504 }
26506 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26507 NAME should have one of the representations used for an
26508 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26509 is returned. If PARSER->SCOPE is a dependent type, then a
26510 SCOPE_REF is returned.
26512 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26513 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26514 was formed. Abstractly, such entities should not be passed to this
26515 function, because they do not need to be looked up, but it is
26516 simpler to check for this special case here, rather than at the
26517 call-sites.
26519 In cases not explicitly covered above, this function returns a
26520 DECL, OVERLOAD, or baselink representing the result of the lookup.
26521 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26522 is returned.
26524 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26525 (e.g., "struct") that was used. In that case bindings that do not
26526 refer to types are ignored.
26528 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26529 ignored.
26531 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26532 are ignored.
26534 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26535 types.
26537 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26538 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26539 NULL_TREE otherwise. */
26541 static cp_expr
26548 location_t name_location)
26549 {
26550 tree decl;
26553 /* Assume that the lookup will be unambiguous. */
26557 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26558 no longer valid. Note that if we are parsing tentatively, and
26559 the parse fails, OBJECT_TYPE will be automatically restored. */
26565 /* A template-id has already been resolved; there is no lookup to
26566 do. */
26570 {
26574 }
26576 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26577 it should already have been checked to make sure that the name
26578 used matches the type being destroyed. */
26580 {
26581 tree type;
26583 /* Figure out to which type this destructor applies. */
26588 else
26590 /* If that's not a class type, there is no destructor. */
26601 }
26603 /* By this point, the NAME should be an ordinary identifier. If
26604 the id-expression was a qualified name, the qualifying scope is
26605 stored in PARSER->SCOPE at this point. */
26608 /* Perform the lookup. */
26610 {
26616 /* If the SCOPE is dependent, the lookup must be deferred until
26617 the template is instantiated -- unless we are explicitly
26618 looking up names in uninstantiated templates. Even then, we
26619 cannot look up the name if the scope is not a class type; it
26620 might, for example, be a template type parameter. */
26625 /* Defer lookup. */
26627 else
26628 {
26631 /* If PARSER->SCOPE is a dependent type, then it must be a
26632 class type, and we must not be checking dependencies;
26633 otherwise, we would have processed this lookup above. So
26634 that PARSER->SCOPE is not considered a dependent base by
26635 lookup_member, we must enter the scope here. */
26639 /* If the PARSER->SCOPE is a template specialization, it
26640 may be instantiated during name lookup. In that case,
26641 errors may be issued. Even if we rollback the current
26642 tentative parse, those errors are valid. */
26647 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26648 lookup result and the nested-name-specifier nominates a class C:
26649 * if the name specified after the nested-name-specifier, when
26650 looked up in C, is the injected-class-name of C (Clause 9), or
26651 * if the name specified after the nested-name-specifier is the
26652 same as the identifier or the simple-template-id's template-
26653 name in the last component of the nested-name-specifier,
26654 the name is instead considered to name the constructor of
26655 class C. [ Note: for example, the constructor is not an
26656 acceptable lookup result in an elaborated-type-specifier so
26657 the constructor would not be used in place of the
26658 injected-class-name. --end note ] Such a constructor name
26659 shall be used only in the declarator-id of a declaration that
26660 names a constructor or in a using-declaration. */
26668 /* If we have a single function from a using decl, pull it out. */
26675 }
26677 /* If the scope is a dependent type and either we deferred lookup or
26678 we did lookup but didn't find the name, rememeber the name. */
26681 {
26683 {
26684 tree type;
26686 /* The resolution to Core Issue 180 says that `struct
26687 A::B' should be considered a type-name, even if `A'
26688 is dependent. */
26693 }
26697 CPP_CLOSE_PAREN)))
26701 else
26704 is_template);
26705 }
26708 }
26710 {
26711 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26712 OBJECT_TYPE is not a class. */
26714 /* If the OBJECT_TYPE is a template specialization, it may
26715 be instantiated during name lookup. In that case, errors
26716 may be issued. Even if we rollback the current tentative
26717 parse, those errors are valid. */
26719 name,
26722 tf_warning_or_error);
26723 else
26727 /* Look it up in the enclosing context. DR 141: When looking for a
26728 template-name after -> or ., only consider class templates. */
26733 /* The object is type-dependent, so we can't look anything up; we used
26734 this to get the DR 141 behavior. */
26738 }
26739 else
26740 {
26746 }
26748 /* If the lookup failed, let our caller know. */
26752 /* Pull out the template from an injected-class-name (or multiple). */
26756 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26758 {
26761 /* The error message we have to print is too complicated for
26762 cp_parser_error, so we incorporate its actions directly. */
26764 {
26766 name);
26768 }
26770 }
26778 /* If we have resolved the name of a member declaration, check to
26779 see if the declaration is accessible. When the name resolves to
26780 set of overloaded functions, accessibility is checked when
26781 overload resolution is done.
26783 During an explicit instantiation, access is not checked at all,
26784 as per [temp.explicit]. */
26791 }
26793 /* Like cp_parser_lookup_name, but for use in the typical case where
26794 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26795 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26797 static tree
26799 {
26801 none_type,
26806 location);
26807 }
26809 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26810 the current context, return the TYPE_DECL. If TAG_NAME_P is
26811 true, the DECL indicates the class being defined in a class-head,
26812 or declared in an elaborated-type-specifier.
26814 Otherwise, return DECL. */
26816 static tree
26818 {
26819 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26820 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26822 struct A {
26823 template <typename T> struct B;
26824 };
26826 template <typename T> struct A::B {};
26828 Similarly, in an elaborated-type-specifier:
26830 namespace N { struct X{}; }
26832 struct A {
26833 template <typename T> friend struct N::X;
26834 };
26836 However, if the DECL refers to a class type, and we are in
26837 the scope of the class, then the name lookup automatically
26838 finds the TYPE_DECL created by build_self_reference rather
26839 than a TEMPLATE_DECL. For example, in:
26841 template <class T> struct S {
26842 S s;
26843 };
26845 there is no need to handle such case. */
26851 }
26853 /* If too many, or too few, template-parameter lists apply to the
26854 declarator, issue an error message. Returns TRUE if all went well,
26855 and FALSE otherwise. */
26857 static bool
26860 location_t declarator_location)
26861 {
26863 {
26865 {
26874 {
26875 /* If the DECLARATOR has the form `X<y>' then it uses one
26876 additional level of template parameters. */
26879 }
26881 return cp_parser_check_template_parameters
26883 declarator);
26884 }
26900 }
26902 }
26904 /* NUM_TEMPLATES were used in the current declaration. If that is
26905 invalid, return FALSE and issue an error messages. Otherwise,
26906 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26907 declarator and we can print more accurate diagnostics. */
26909 static bool
26913 location_t location,
26915 {
26916 /* If there are the same number of template classes and parameter
26917 lists, that's OK. */
26920 /* If there are more, but only one more, and the name ends in an identifier,
26921 then we are declaring a primary template. That's OK too. */
26925 /* If there are more template classes than parameter lists, we have
26926 something like:
26928 template <class T> void S<T>::R<T>::f (); */
26930 {
26940 else
26943 }
26944 /* Otherwise, there are too many template parameter lists. We have
26945 something like:
26947 template <class T> template <class U> void S::f(); */
26950 }
26952 /* Parse an optional `::' token indicating that the following name is
26953 from the global namespace. If so, PARSER->SCOPE is set to the
26954 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26955 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26956 Returns the new value of PARSER->SCOPE, if the `::' token is
26957 present, and NULL_TREE otherwise. */
26959 static tree
26961 {
26964 /* Peek at the next token. */
26966 /* If we're looking at a `::' token then we're starting from the
26967 global namespace, not our current location. */
26969 {
26970 /* Consume the `::' token. */
26972 /* Set the SCOPE so that we know where to start the lookup. */
26978 }
26980 {
26984 }
26987 }
26989 /* Returns TRUE if the upcoming token sequence is the start of a
26990 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26991 declarator is preceded by the `friend' specifier. */
26993 static bool
26995 {
26998 tree nested_name_specifier;
27001 /* The common case is that this is not a constructor declarator, so
27002 try to avoid doing lots of work if at all possible. It's not
27003 valid declare a constructor at function scope. */
27006 /* And only certain tokens can begin a constructor declarator. */
27014 /* Parse tentatively; we are going to roll back all of the tokens
27015 consumed here. */
27017 /* Assume that we are looking at a constructor declarator. */
27020 /* Look for the optional `::' operator. */
27023 /* Look for the nested-name-specifier. */
27024 nested_name_specifier
27035 /* Outside of a class-specifier, there must be a
27036 nested-name-specifier. Except in C++17 mode, where we
27037 might be declaring a guiding declaration. */
27044 /* If we have a class scope, this is easy; DR 147 says that S::S always
27045 names the constructor, and no other qualified name could. */
27048 {
27058 }
27059 /* If we still think that this might be a constructor-declarator,
27060 look for a class-name. */
27062 {
27063 /* If we have:
27065 template <typename T> struct S {
27066 S();
27067 };
27069 we must recognize that the nested `S' names a class. */
27073 tree type_decl;
27077 none_type,
27084 {
27090 none_type,
27095 else
27097 }
27099 /* If there was no class-name, then this is not a constructor.
27100 Otherwise, if we are in a class-specifier and we aren't
27101 handling a friend declaration, check that its type matches
27102 current_class_type (c++/38313). Note: error_mark_node
27103 is left alone for error recovery purposes. */
27105 && (outside_class_specifier_p
27111 /* If we're still considering a constructor, we have to see a `(',
27112 to begin the parameter-declaration-clause, followed by either a
27113 `)', an `...', or a decl-specifier. We need to check for a
27114 type-specifier to avoid being fooled into thinking that:
27116 S (f) (int);
27118 is a constructor. (It is actually a function named `f' that
27119 takes one parameter (of type `int') and returns a value of type
27120 `S'. */
27128 /* A parameter declaration begins with a decl-specifier,
27129 which is either the "attribute" keyword, a storage class
27130 specifier, or (usually) a type-specifier. */
27132 {
27133 tree type;
27137 /* Names appearing in the type-specifier should be looked up
27138 in the scope of the class. */
27142 {
27145 {
27149 {
27152 }
27153 }
27155 }
27157 /* Inside the constructor parameter list, surrounding
27158 template-parameter-lists do not apply. */
27159 saved_num_template_parameter_lists
27163 /* Look for the type-specifier. */
27165 CP_PARSER_FLAGS_NONE,
27171 parser->num_template_parameter_lists
27174 /* Leave the scope of the class. */
27179 }
27180 }
27182 /* We did not really want to consume any tokens. */
27186 }
27188 /* Parse the definition of the function given by the DECL_SPECIFIERS,
27189 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
27190 they must be performed once we are in the scope of the function.
27192 Returns the function defined. */
27194 static tree
27195 cp_parser_function_definition_from_specifiers_and_declarator
27198 tree attributes,
27200 {
27201 tree fn;
27204 /* Begin the function-definition. */
27207 /* The things we're about to see are not directly qualified by any
27208 template headers we've seen thus far. */
27211 /* If there were names looked up in the decl-specifier-seq that we
27212 did not check, check them now. We must wait until we are in the
27213 scope of the function to perform the checks, since the function
27214 might be a friend. */
27218 {
27223 }
27226 {
27227 /* Skip the entire function. */
27230 }
27232 {
27233 /* Seen already, skip it. An error message has already been output. */
27237 /* If this is a function from a class, pop the nested class. */
27240 }
27241 else
27242 {
27243 timevar_id_t tv;
27246 else
27252 }
27255 }
27257 /* Parse the part of a function-definition that follows the
27258 declarator. INLINE_P is TRUE iff this function is an inline
27259 function defined within a class-specifier.
27261 Returns the function defined. */
27263 static tree
27266 {
27267 tree fn;
27272 bool fully_implicit_function_template_p
27275 tree implicit_template_parms
27278 cp_binding_level* implicit_template_scope
27284 /* If the next token is `return', then the code may be trying to
27285 make use of the "named return value" extension that G++ used to
27286 support. */
27289 {
27290 /* Consume the `return' keyword. */
27292 /* Look for the identifier that indicates what value is to be
27293 returned. */
27295 /* Issue an error message. */
27298 /* Skip tokens until we reach the start of the function body. */
27300 {
27307 }
27308 }
27309 /* The `extern' in `extern "C" void f () { ... }' does not apply to
27310 anything declared inside `f'. */
27311 saved_in_unbraced_linkage_specification_p
27314 /* Inside the function, surrounding template-parameter-lists do not
27315 apply. */
27316 saved_num_template_parameter_lists
27320 /* If the next token is `try', `__transaction_atomic', or
27321 `__transaction_relaxed`, then we are looking at either function-try-block
27322 or function-transaction-block. Note that all of these include the
27323 function-body. */
27327 RID_TRANSACTION_RELAXED))
27331 else
27332 cp_parser_ctor_initializer_opt_and_function_body
27335 /* Finish the function. */
27337 /* Generate code for it, if necessary. */
27339 /* Restore the saved values. */
27340 parser->in_unbraced_linkage_specification_p
27342 parser->num_template_parameter_lists
27346 parser->fully_implicit_function_template_p
27348 parser->implicit_template_parms
27350 parser->implicit_template_scope
27357 }
27359 /* Parse a template-declaration body (following argument list). */
27361 static void
27363 tree parameter_list,
27365 {
27369 /* We just processed one more parameter list. */
27372 /* Get the deferred access checks from the parameter list. These
27373 will be checked once we know what is being declared, as for a
27374 member template the checks must be performed in the scope of the
27375 class containing the member. */
27378 /* Tentatively parse for a new template parameter list, which can either be
27379 the template keyword or a template introduction. */
27385 else
27386 {
27387 /* There are no access checks when parsing a template, as we do not
27388 know if a specialization will be a friend. */
27392 checks,
27393 member_p,
27398 /* If this is a member template declaration, let the front
27399 end know. */
27401 {
27406 }
27411 }
27412 /* We are done with the current parameter list. */
27417 /* Finish up. */
27420 /* Check the template arguments for a literal operator template. */
27424 {
27428 else
27429 {
27432 {
27436 /* OK, C++20 string literal operator template. We don't need
27437 to warn in lower dialects here because we will have already
27442 }
27444 {
27453 else
27454 /* http://cplusplus.github.io/EWG/ewg-active.html#66 */
27456 "ISO C++ did not adopt string literal operator templa"
27458 }
27459 else
27461 }
27463 {
27466 " Expected non-type template parameter pack <char...> "
27468 decl);
27469 else
27472 decl);
27473 }
27474 }
27476 /* Register member declarations. */
27479 /* If DECL is a function template, we must return to parse it later.
27480 (Even though there is no definition, there might be default
27481 arguments that need handling.) */
27485 }
27487 /* Parse a template introduction header for a template-declaration. Returns
27488 false if tentative parse fails. */
27490 static bool
27492 {
27499 /* Look for the optional `::' operator. */
27502 /* Look for the nested-name-specifier. */
27512 /* Look up the concept for which we will be matching
27513 template parameters. */
27523 /* Look for opening brace for introduction. */
27524 matching_braces braces;
27532 /* Build vector of placeholder parameters and grab
27533 matching identifiers. */
27536 /* Look for closing brace for introduction. */
27540 /* The introduction-list shall not be empty. */
27543 {
27544 /* In cp_parser_introduction_list we have already issued an error. */
27546 }
27549 {
27553 }
27555 /* Build and associate the constraint. */
27558 {
27560 member_p);
27562 }
27566 }
27568 /* Parse a normal template-declaration following the template keyword. */
27570 static void
27572 {
27573 tree parameter_list;
27577 /* Look for the `<' token. */
27581 {
27582 /* 14.5.2.2 [temp.mem]
27584 A local class shall not have member templates. */
27589 }
27590 /* [temp]
27592 A template ... shall not have C linkage. */
27594 {
27597 /* Give it C++ linkage to avoid confusing other parts of the
27598 front end. */
27601 }
27602 else
27605 /* We cannot perform access checks on the template parameter
27606 declarations until we know what is being declared, just as we
27607 cannot check the decl-specifier list. */
27610 /* If the next token is `>', then we have an invalid
27611 specialization. Rather than complain about an invalid template
27612 parameter, issue an error message here. */
27614 {
27618 }
27619 else
27620 {
27621 /* Parse the template parameters. */
27623 }
27625 /* Look for the `>'. */
27628 /* Manage template requirements */
27630 {
27635 }
27638 member_p);
27640 /* For the erroneous case of a template with C linkage, we pushed an
27641 implicit C++ linkage scope; exit that scope now. */
27644 }
27646 /* Parse a template-declaration, assuming that the `export' (and
27647 `extern') keywords, if present, has already been scanned. MEMBER_P
27648 is as for cp_parser_template_declaration. */
27650 static bool
27652 {
27654 {
27658 }
27663 }
27665 /* Perform the deferred access checks from a template-parameter-list.
27666 CHECKS is a TREE_LIST of access checks, as returned by
27667 get_deferred_access_checks. */
27669 static void
27670 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27671 {
27675 }
27677 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27678 `function-definition' sequence that follows a template header.
27679 If MEMBER_P is true, this declaration appears in a class scope.
27681 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27682 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27684 static tree
27690 {
27693 cp_decl_specifier_seq decl_specifiers;
27697 /* This function is only used when processing a template
27698 declaration. */
27702 /* Defer access checks until we know what is being declared. */
27705 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27706 alternative. */
27709 CP_PARSER_FLAGS_OPTIONAL,
27715 /* There are no template typedefs. */
27717 {
27721 }
27723 /* Gather up the access checks that occurred the
27724 decl-specifier-seq. */
27727 /* Check for the declaration of a template class. */
27729 {
27732 {
27733 // If this is a declaration, but not a definition, associate
27734 // any constraints with the type declaration. Constraints
27735 // are associated with definitions in cp_parser_class_specifier.
27741 /* In this case:
27743 struct C {
27744 friend template <typename T> struct A<T>::B;
27745 };
27747 A<T>::B will be represented by a TYPENAME_TYPE, and
27748 therefore not recognized by shadow_tag. */
27750 && !decl
27757 else
27760 /* Perform access checks for template parameters. */
27763 /* Give a helpful diagnostic for
27764 template <class T> struct A { } a;
27765 if we aren't already recovering from an error. */
27768 {
27770 "a class template declaration must not declare "
27774 }
27775 }
27776 }
27778 /* Complain about missing 'typename' or other invalid type names. */
27781 {
27782 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27783 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27784 the rest of this declaration. */
27787 }
27789 /* If it's not a template class, try for a template function. If
27790 the next token is a `;', then this declaration does not declare
27791 anything. But, if there were errors in the decl-specifiers, then
27792 the error might well have come from an attempted class-specifier.
27793 In that case, there's no need to warn about a missing declarator. */
27797 {
27800 checks,
27802 member_p,
27803 declares_class_or_enum,
27807 /* 7.1.1-1 [dcl.stc]
27809 A storage-class-specifier shall not be specified in an explicit
27810 specialization... */
27812 && explicit_specialization_p
27814 {
27818 }
27822 }
27824 /* Look for a trailing `;' after the declaration. */
27830 out:
27833 /* Clear any current qualification; whatever comes next is the start
27834 of something new. */
27840 }
27842 /* Parse a cast-expression that is not the operand of a unary "&". */
27844 static cp_expr
27846 {
27849 }
27851 /* Parse a functional cast to TYPE. Returns an expression
27852 representing the cast. */
27854 static cp_expr
27856 {
27858 tree expression_list;
27859 cp_expr cast;
27868 {
27878 /* Create a location of the form:
27879 type_name{i, f}
27880 ^~~~~~~~~~~~~~~
27881 with caret == start at the start of the type name,
27882 finishing at the closing brace. */
27883 location_t finish_loc
27886 finish_loc);
27889 }
27898 else
27899 {
27902 }
27905 tf_warning_or_error);
27906 /* [expr.const]/1: In an integral constant expression "only type
27907 conversions to integral or enumeration type can be used". */
27913 NIC_CONSTRUCTOR))
27916 /* Create a location of the form:
27917 float(i)
27918 ^~~~~~~~
27919 with caret == start at the start of the type name,
27920 finishing at the closing paren. */
27921 location_t finish_loc
27926 }
27928 /* Save the tokens that make up the body of a member function defined
27929 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27930 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27931 specifiers applied to the declaration. Returns the FUNCTION_DECL
27932 for the member function. */
27934 static tree
27938 tree attributes)
27939 {
27942 tree fn;
27945 /* Create the FUNCTION_DECL. */
27949 /* If something went badly wrong, bail out now. */
27951 {
27952 /* If there's a function-body, skip it. */
27957 }
27959 /* Remember it, if there default args to post process. */
27962 /* Save away the tokens that make up the body of the
27963 function. */
27969 RID_TRANSACTION_ATOMIC))
27970 {
27972 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27979 {
27985 }
27986 else
27989 {
27993 }
27994 }
27996 /* Handle function try blocks. */
27998 {
28001 }
28002 /* We can have braced-init-list mem-initializers before the fn body. */
28004 {
28007 {
28008 /* cache_group will stop after an un-nested { } pair, too. */
28012 /* variadic mem-inits have ... after the ')'. */
28015 }
28016 }
28018 /* Handle function try blocks. */
28024 /* Save away the inline definition; we will process it when the
28025 class is complete. */
28029 /* We need to know that this was defined in the class, so that
28030 friend templates are handled correctly. */
28033 /* Add FN to the queue of functions to be parsed later. */
28037 }
28039 /* Save the tokens that make up the in-class initializer for a non-static
28040 data member. Returns a DEFAULT_ARG. */
28042 static tree
28044 {
28046 }
28048 /* Parse a template-argument-list, as well as the trailing ">" (but
28049 not the opening "<"). See cp_parser_template_argument_list for the
28050 return value. */
28052 static tree
28054 {
28055 tree arguments;
28056 tree saved_scope;
28057 tree saved_qualifying_scope;
28058 tree saved_object_scope;
28061 /* [temp.names]
28063 When parsing a template-id, the first non-nested `>' is taken as
28064 the end of the template-argument-list rather than a greater-than
28065 operator. */
28066 saved_greater_than_is_operator_p
28069 /* Parsing the argument list may modify SCOPE, so we save it
28070 here. */
28074 /* We need to evaluate the template arguments, even though this
28075 template-id may be nested within a "sizeof". */
28076 cp_evaluated ev;
28077 /* Parse the template-argument-list itself. */
28081 else
28083 /* Look for the `>' that ends the template-argument-list. If we find
28084 a '>>' instead, it's probably just a typo. */
28086 {
28088 {
28089 /* In C++0x, a `>>' in a template argument list or cast
28090 expression is considered to be two separate `>'
28091 tokens. So, change the current token to a `>', but don't
28092 consume it: it will be consumed later when the outer
28093 template argument list (or cast expression) is parsed.
28094 Note that this replacement of `>' for `>>' is necessary
28095 even if we are parsing tentatively: in the tentative
28096 case, after calling
28097 cp_parser_enclosed_template_argument_list we will always
28098 throw away all of the template arguments and the first
28099 closing `>', either because the template argument list
28100 was erroneous or because we are replacing those tokens
28101 with a CPP_TEMPLATE_ID token. The second `>' (which will
28102 not have been thrown away) is needed either to close an
28103 outer template argument list or to complete a new-style
28104 cast. */
28107 }
28109 {
28110 /* If we're in a nested template argument list, the '>>' has
28111 to be a typo for '> >'. We emit the error message, but we
28112 continue parsing and we push a '>' as next token, so that
28113 the argument list will be parsed correctly. Note that the
28114 global source location is still on the token before the
28115 '>>', so we need to say explicitly where we want it. */
28123 }
28124 else
28125 {
28126 /* If this is not a nested template argument list, the '>>'
28127 is a typo for '>'. Emit an error message and continue.
28128 Same deal about the token location, but here we can get it
28129 right by consuming the '>>' before issuing the diagnostic. */
28132 "spurious %<>>%>, use %<>%> to terminate "
28134 }
28135 }
28136 else
28138 /* The `>' token might be a greater-than operator again now. */
28139 parser->greater_than_is_operator_p
28141 /* Restore the SAVED_SCOPE. */
28147 }
28149 /* MEMBER_FUNCTION is a member function, or a friend. If default
28150 arguments, or the body of the function have not yet been parsed,
28151 parse them now. */
28153 static void
28155 {
28157 /* If this member is a template, get the underlying
28158 FUNCTION_DECL. */
28162 /* There should not be any class definitions in progress at this
28163 point; the bodies of members are only parsed outside of all class
28164 definitions. */
28166 /* While we're parsing the member functions we might encounter more
28167 classes. We want to handle them right away, but we don't want
28168 them getting mixed up with functions that are currently in the
28169 queue. */
28172 /* Make sure that any template parameters are in scope. */
28175 /* If the body of the function has not yet been parsed, parse it
28176 now. */
28178 {
28179 tree function_scope;
28182 /* The function is no longer pending; we are processing it. */
28187 /* If this is a local class, enter the scope of the containing
28188 function. */
28193 /* Push the body of the function onto the lexer stack. */
28196 /* Let the front end know that we going to be defining this
28197 function. */
28201 /* Don't do access checking if it is a templated function. */
28205 /* #pragma omp declare reduction needs special parsing. */
28207 {
28212 }
28213 else
28214 /* Now, parse the body of the function. */
28221 /* Leave the scope of the containing function. */
28225 }
28227 /* Remove any template parameters from the symbol table. */
28230 /* Restore the queue. */
28233 }
28235 /* If DECL contains any default args, remember it on the unparsed
28236 functions queue. */
28238 static void
28240 {
28241 tree probe;
28244 probe;
28247 {
28251 }
28252 }
28254 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
28255 which is either a FIELD_DECL or PARM_DECL. Parse it and return
28256 the result. For a PARM_DECL, PARMTYPE is the corresponding type
28257 from the parameter-type-list. */
28259 static tree
28262 {
28264 tree parsed_arg;
28270 /* Push the saved tokens for the default argument onto the parser's
28271 lexer stack. */
28277 /* Parse the default argument. */
28288 {
28289 /* In a non-template class, check conversions now. In a template,
28290 we'll wait and instantiate these as needed. */
28293 tf_warning_or_error);
28296 else
28298 }
28300 /* If the token stream has not been completely used up, then
28301 there was extra junk after the end of the default
28302 argument. */
28304 {
28307 else
28309 }
28311 /* Revert to the main lexer. */
28315 }
28317 /* FIELD is a non-static data member with an initializer which we saved for
28318 later; parse it now. */
28320 static void
28322 {
28323 tree def;
28330 NULL_TREE);
28336 }
28338 /* FN is a FUNCTION_DECL which may contains a parameter with an
28339 unparsed DEFAULT_ARG. Parse the default args now. This function
28340 assumes that the current scope is the scope in which the default
28341 argument should be processed. */
28343 static void
28345 {
28349 /* While we're parsing the default args, we might (due to the
28350 statement expression extension) encounter more classes. We want
28351 to handle them right away, but we don't want them getting mixed
28352 up with default args that are currently in the queue. */
28355 /* Local variable names (and the `this' keyword) may not appear
28356 in a default argument. */
28367 {
28369 tree parsed_arg;
28371 tree copy;
28378 /* This can happen for a friend declaration for a function
28379 already declared with default arguments. */
28382 parsed_arg
28384 default_arg,
28388 /* Update any instantiations we've already created. */
28392 }
28396 /* Make sure no default arg is missing. */
28399 /* Restore the state of local_variables_forbidden_p. */
28402 /* Restore the queue. */
28404 }
28406 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
28408 sizeof ... ( identifier )
28410 where the 'sizeof' token has already been consumed. */
28412 static tree
28414 {
28415 /* Consume the `...'. */
28419 matching_parens parens;
28423 else
28431 /* The name is not qualified. */
28450 }
28452 /* Parse the operand of `sizeof' (or a similar operator). Returns
28453 either a TYPE or an expression, depending on the form of the
28454 input. The KEYWORD indicates which kind of expression we have
28455 encountered. */
28457 static tree
28459 {
28466 /* If it's a `...', then we are computing the length of a parameter
28467 pack. */
28472 /* Types cannot be defined in a `sizeof' expression. Save away the
28473 old message. */
28475 /* And create the new one. */
28481 /* The restrictions on constant-expressions do not apply inside
28482 sizeof expressions. */
28483 saved_integral_constant_expression_p
28485 saved_non_integral_constant_expression_p
28489 /* Do not actually evaluate the expression. */
28492 /* If it's a `(', then we might be looking at the type-id
28493 construction. */
28495 {
28498 /* We can't be sure yet whether we're looking at a type-id or an
28499 expression. */
28502 matching_parens parens;
28505 /* Note: as a GNU Extension, compound literals are considered
28506 postfix-expressions as they are in C99, so they are valid
28507 arguments to sizeof. See comment in cp_parser_cast_expression
28508 for details. */
28511 else
28512 {
28515 /* Look for the type-id. */
28517 /* Look for the closing `)'. */
28520 }
28522 /* If all went well, then we're done. */
28525 }
28527 /* If the type-id production did not work out, then we must be
28528 looking at the unary-expression production. */
28532 /* Go back to evaluating expressions. */
28536 /* Free the message we created. */
28538 /* And restore the old one. */
28540 parser->integral_constant_expression_p
28542 parser->non_integral_constant_expression_p
28546 }
28548 /* If the current declaration has no declarator, return true. */
28550 static bool
28552 {
28553 /* If the next token is a `;' or a `,' then there is no
28554 declarator. */
28557 }
28559 /* Update the DECL_SPECS to reflect the storage class indicated by
28560 KEYWORD. */
28562 static void
28567 {
28568 cp_storage_class storage_class;
28571 {
28575 }
28577 {
28580 }
28585 {
28588 }
28591 {
28609 }
28613 /* A storage class specifier cannot be applied alongside a typedef
28614 specifier. If there is a typedef specifier present then set
28615 conflicting_specifiers_p which will trigger an error later
28616 on in grokdeclarator. */
28619 }
28621 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28622 is true, the type is a class or enum definition. */
28624 static void
28626 tree type_spec,
28629 {
28632 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28633 (with, for example, in "typedef int wchar_t;") we remember that
28634 this is what happened. In system headers, we ignore these
28635 declarations so that G++ can work with system headers that are not
28636 C++-safe. */
28638 && !type_definition_p
28648 {
28651 ds_redefined_builtin_type_spec,
28652 token);
28654 {
28658 }
28659 }
28662 else
28663 {
28668 }
28669 }
28671 /* True iff TOKEN is the GNU keyword __thread. */
28673 static bool
28675 {
28678 }
28680 /* Set the location for a declarator specifier and check if it is
28681 duplicated.
28683 DECL_SPECS is the sequence of declarator specifiers onto which to
28684 set the location.
28686 DS is the single declarator specifier to set which location is to
28687 be set onto the existing sequence of declarators.
28689 LOCATION is the location for the declarator specifier to
28690 consider. */
28692 static void
28695 {
28704 {
28708 }
28709 else
28710 {
28712 {
28716 else
28717 {
28720 OPT_Wlong_long,
28722 }
28723 }
28725 {
28729 {
28733 }
28734 else
28735 {
28738 }
28739 }
28740 else
28741 {
28757 "__complex"
28758 };
28762 }
28763 }
28764 }
28766 /* Return true iff the declarator specifier DS is present in the
28767 sequence of declarator specifiers DECL_SPECS. */
28769 bool
28771 cp_decl_spec ds)
28772 {
28779 }
28781 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28782 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28784 static bool
28786 {
28788 }
28790 /* Issue an error message indicating that TOKEN_DESC was expected.
28791 If KEYWORD is true, it indicated this function is called by
28792 cp_parser_require_keword and the required token can only be
28793 a indicated keyword.
28795 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28796 within any error as the location of an "opening" token matching
28797 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28798 RT_CLOSE_PAREN). */
28800 static void
28802 required_token token_desc,
28804 location_t matching_location)
28805 {
28811 {
28880 }
28883 {
28885 {
28963 }
28964 }
28968 }
28971 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28972 issue an error message indicating that TOKEN_DESC was expected.
28974 Returns the token consumed, if the token had the appropriate type.
28975 Otherwise, returns NULL.
28977 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28978 within any error as the location of an "opening" token matching
28979 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28980 RT_CLOSE_PAREN). */
28985 required_token token_desc,
28986 location_t matching_location)
28987 {
28990 else
28991 {
28992 /* Output the MESSAGE -- unless we're parsing tentatively. */
28995 matching_location);
28997 }
28998 }
29000 /* An error message is produced if the next token is not '>'.
29001 All further tokens are skipped until the desired token is
29002 found or '{', '}', ';' or an unbalanced ')' or ']'. */
29004 static void
29006 {
29007 /* Current level of '< ... >'. */
29009 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
29012 /* Are we ready, yet? If not, issue error message. */
29016 /* Skip tokens until the desired token is found. */
29018 {
29019 /* Peek at the next token. */
29021 {
29029 /* C++0x views the `>>' operator as two `>' tokens, but
29030 C++98 does not. */
29033 {
29034 /* We've hit a `>>' where the first `>' closes the
29035 template argument list, and the second `>' is
29036 spurious. Just consume the `>>' and stop; we've
29037 already produced at least one error. */
29040 }
29041 /* Fall through for C++0x, so we handle the second `>' in
29042 the `>>'. */
29047 {
29048 /* We've reached the token we want, consume it and stop. */
29051 }
29070 /* The '>' was probably forgotten, don't look further. */
29075 }
29077 /* Consume this token. */
29079 }
29080 }
29082 /* If the next token is the indicated keyword, consume it. Otherwise,
29083 issue an error message indicating that TOKEN_DESC was expected.
29085 Returns the token consumed, if the token had the appropriate type.
29086 Otherwise, returns NULL. */
29091 required_token token_desc)
29092 {
29096 {
29098 UNKNOWN_LOCATION);
29100 }
29103 }
29105 /* Returns TRUE iff TOKEN is a token that can begin the body of a
29106 function-definition. */
29108 static bool
29110 {
29113 /* A ctor-initializer begins with a `:'. */
29115 /* A function-try-block begins with `try'. */
29117 /* A function-transaction-block begins with `__transaction_atomic'
29118 or `__transaction_relaxed'. */
29121 /* The named return value extension begins with `return'. */
29123 }
29125 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
29126 definition. */
29128 static bool
29130 {
29137 }
29139 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
29140 C++0x) ending a template-argument. */
29142 static bool
29144 {
29152 }
29154 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
29155 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
29157 static bool
29160 {
29166 /* Check for the sequence `<::' in the original code. It would be lexed as
29167 `[:', where `[' is a digraph, and there is no whitespace before
29168 `:'. */
29170 {
29175 }
29177 }
29179 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
29180 or none_type otherwise. */
29182 static enum tag_types
29184 {
29186 {
29196 }
29197 }
29199 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
29200 or none_type otherwise or if the token is null. */
29202 static enum tag_types
29204 {
29209 {
29217 }
29218 }
29220 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
29222 static void
29224 {
29228 {
29232 type))
29235 }
29236 }
29238 /* Issue an error message if DECL is redeclared with different
29239 access than its original declaration [class.access.spec/3].
29240 This applies to nested classes, nested class templates and
29241 enumerations [class.mem/1]. */
29243 static void
29245 {
29256 }
29258 /* Look for the `template' keyword, as a syntactic disambiguator.
29259 Return TRUE iff it is present, in which case it will be
29260 consumed. */
29262 static bool
29264 {
29266 {
29267 /* In C++98 the `template' keyword can only be used within templates;
29268 outside templates the parser can always figure out what is a
29269 template and what is not. In C++11, per the resolution of DR 468,
29270 `template' is allowed in cases where it is not strictly necessary. */
29273 {
29276 "in C++98 %<template%> (as a disambiguator) is only "
29278 /* If this part of the token stream is rescanned, the same
29279 error message would be generated. So, we purge the token
29280 from the stream. */
29283 }
29284 else
29285 {
29286 /* Consume the `template' keyword. */
29289 }
29290 }
29292 }
29294 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
29295 set PARSER->SCOPE, and perform other related actions. */
29297 static void
29299 {
29302 /* Get the stored value. */
29304 /* Set the scope from the stored value. */
29308 }
29310 /* Consume tokens up through a non-nested END token. Returns TRUE if we
29311 encounter the end of a block before what we were looking for. */
29313 static bool
29317 {
29319 {
29322 /* Abort a parenthesized expression if we encounter a semicolon. */
29326 /* If we've reached the end of the file, stop. */
29332 /* We've hit the end of an enclosing block, so there's been some
29333 kind of syntax error. */
29336 /* Consume the token. */
29338 /* See if it starts a new group. */
29340 {
29342 /* In theory this should probably check end == '}', but
29343 cp_parser_save_member_function_body needs it to exit
29344 after either '}' or ')' when called with ')'. */
29347 }
29349 {
29353 }
29358 }
29359 }
29361 /* Like above, for caching a default argument or NSDMI. Both of these are
29362 terminated by a non-nested comma, but it can be unclear whether or not a
29363 comma is nested in a template argument list unless we do more parsing.
29364 In order to handle this ambiguity, when we encounter a ',' after a '<'
29365 we try to parse what follows as a parameter-declaration-list (in the
29366 case of a default argument) or a member-declarator (in the case of an
29367 NSDMI). If that succeeds, then we stop caching. */
29369 static tree
29371 {
29376 tree default_argument;
29378 /* Add tokens until we have processed the entire default
29379 argument. We add the range [first_token, token). */
29382 {
29383 /* For list-initialization, this is straightforward. */
29386 }
29388 {
29391 /* Peek at the next token. */
29393 /* What we do depends on what token we have. */
29395 {
29396 /* In valid code, a default argument must be
29397 immediately followed by a `,' `)', or `...'. */
29400 {
29401 /* If we've seen a '<', we might be in a
29402 template-argument-list. Until Core issue 325 is
29403 resolved, we don't know how this situation ought
29404 to be handled, so try to DTRT. We check whether
29405 what comes after the comma is a valid parameter
29406 declaration list. If it is, then the comma ends
29407 the default argument; otherwise the default
29408 argument continues. */
29412 /* Set ITALP so cp_parser_parameter_declaration_list
29413 doesn't decide to commit to this parse. */
29420 {
29421 /* Parse declarators until we reach a non-comma or
29422 somthing that cannot be an initializer.
29423 Just checking whether we're looking at a single
29424 declarator is insufficient. Consider:
29425 int var = tuple<T,U>::x;
29426 The template parameter 'U' looks exactly like a
29427 declarator. */
29428 do
29429 {
29440 }
29442 /* If we met an '=' or ';' then the original comma
29443 was the end of the NSDMI. Otherwise assume
29444 we're still in the NSDMI. */
29447 }
29448 else
29449 {
29456 }
29463 }
29464 /* FALLTHRU */
29467 /* If we run into a non-nested `;', `}', or `]',
29468 then the code is invalid -- but the default
29469 argument is certainly over. */
29474 /* Handle correctly int n = sizeof ... ( p ); */
29477 /* Update DEPTH, if necessary. */
29492 /* This might be the comparison operator, or it might
29493 start a template argument list. */
29500 /* Fall through for C++0x, which treats the `>>'
29501 operator like two `>' tokens in certain
29502 cases. */
29507 {
29508 /* This might be an operator, or it might close a
29509 template argument list. But if a previous '<'
29510 started a template argument list, this will have
29511 closed it, so we can't be in one anymore. */
29515 }
29518 /* If we run out of tokens, issue an error message. */
29526 /* In these cases, we should look for template-ids.
29527 For example, if the default argument is
29528 `X<int, double>()', we need to do name lookup to
29529 figure out whether or not `X' is a template; if
29530 so, the `,' does not end the default argument.
29532 That is not yet done. */
29537 }
29539 /* If we've reached the end, stop. */
29543 /* Add the token to the token block. */
29545 }
29547 /* Create a DEFAULT_ARG to represent the unparsed default
29548 argument. */
29555 }
29557 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29559 location_t
29561 {
29566 }
29568 /* Begin parsing tentatively. We always save tokens while parsing
29569 tentatively so that if the tentative parsing fails we can restore the
29570 tokens. */
29572 static void
29574 {
29575 /* Enter a new parsing context. */
29577 /* Begin saving tokens. */
29579 /* In order to avoid repetitive access control error messages,
29580 access checks are queued up until we are no longer parsing
29581 tentatively. */
29583 }
29585 /* Commit to the currently active tentative parse. */
29587 static void
29589 {
29593 /* Mark all of the levels as committed. */
29596 {
29603 }
29604 }
29606 /* Commit to the topmost currently active tentative parse.
29608 Note that this function shouldn't be called when there are
29609 irreversible side-effects while in a tentative state. For
29610 example, we shouldn't create a permanent entry in the symbol
29611 table, or issue an error message that might not apply if the
29612 tentative parse is aborted. */
29614 static void
29616 {
29621 {
29629 }
29630 }
29632 /* Abort the currently active tentative parse. All consumed tokens
29633 will be rolled back, and no diagnostics will be issued. */
29635 static void
29637 {
29641 /* Now, pretend that we want to see if the construct was
29642 successfully parsed. */
29644 }
29646 /* Stop parsing tentatively. If a parse error has occurred, restore the
29647 token stream. Otherwise, commit to the tokens we have consumed.
29648 Returns true if no error occurred; false otherwise. */
29650 static bool
29652 {
29656 /* Remember whether or not an error occurred, since we are about to
29657 destroy that information. */
29659 /* Remove the topmost context from the stack. */
29662 /* If no parse errors occurred, commit to the tentative parse. */
29664 {
29665 /* Commit to the tokens read tentatively, unless that was
29666 already done. */
29671 }
29672 /* Otherwise, if errors occurred, roll back our state so that things
29673 are just as they were before we began the tentative parse. */
29674 else
29675 {
29678 }
29679 /* Add the context to the front of the free list. */
29684 }
29686 /* Returns true if we are parsing tentatively and are not committed to
29687 this tentative parse. */
29689 static bool
29691 {
29694 }
29696 /* Returns nonzero iff an error has occurred during the most recent
29697 tentative parse. */
29699 static bool
29701 {
29704 }
29706 /* Returns nonzero if GNU extensions are allowed. */
29708 static bool
29710 {
29712 }
29713 \f
29714 /* Objective-C++ Productions */
29717 /* Parse an Objective-C expression, which feeds into a primary-expression
29718 above.
29720 objc-expression:
29721 objc-message-expression
29722 objc-string-literal
29723 objc-encode-expression
29724 objc-protocol-expression
29725 objc-selector-expression
29727 Returns a tree representation of the expression. */
29729 static cp_expr
29731 {
29732 /* Try to figure out what kind of declaration is present. */
29736 {
29746 {
29758 }
29759 /* FALLTHRU */
29765 }
29768 }
29770 /* Parse an Objective-C message expression.
29772 objc-message-expression:
29773 [ objc-message-receiver objc-message-args ]
29775 Returns a representation of an Objective-C message. */
29777 static tree
29779 {
29791 /* Construct a location e.g.
29792 [self func1:5]
29793 ^~~~~~~~~~~~~~
29794 ranging from the '[' to the ']', with the caret at the start. */
29799 }
29801 /* Parse an objc-message-receiver.
29803 objc-message-receiver:
29804 expression
29805 simple-type-specifier
29807 Returns a representation of the type or expression. */
29809 static tree
29811 {
29812 tree rcv;
29814 /* An Objective-C message receiver may be either (1) a type
29815 or (2) an expression. */
29819 /* If that worked out, fine. */
29826 CP_PARSER_FLAGS_NONE);
29833 }
29835 /* Parse the arguments and selectors comprising an Objective-C message.
29837 objc-message-args:
29838 objc-selector
29839 objc-selector-args
29840 objc-selector-args , objc-comma-args
29842 objc-selector-args:
29843 objc-selector [opt] : assignment-expression
29844 objc-selector-args objc-selector [opt] : assignment-expression
29846 objc-comma-args:
29847 assignment-expression
29848 objc-comma-args , assignment-expression
29850 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29851 selector arguments and TREE_VALUE containing a list of comma
29852 arguments. */
29854 static tree
29856 {
29862 {
29868 /* Detect if we have a unary selector. */
29877 sel_args
29882 }
29884 /* Handle non-selector arguments, if any. */
29886 {
29887 tree arg;
29892 addl_args
29897 }
29900 {
29903 }
29906 }
29908 /* Parse an Objective-C encode expression.
29910 objc-encode-expression:
29911 @encode objc-typename
29913 Returns an encoded representation of the type argument. */
29915 static cp_expr
29917 {
29918 tree type;
29923 matching_parens parens;
29930 {
29934 }
29936 /* This happens if we find @encode(T) (where T is a template
29937 typename or something dependent on a template typename) when
29938 parsing a template. In that case, we can't compile it
29939 immediately, but we rather create an AT_ENCODE_EXPR which will
29940 need to be instantiated when the template is used.
29941 */
29943 {
29947 }
29950 /* Build a location of the form:
29951 @encode(int)
29952 ^~~~~~~~~~~~
29953 with caret==start at the @ token, finishing at the close paren. */
29954 location_t combined_loc
29959 }
29961 /* Parse an Objective-C @defs expression. */
29963 static tree
29965 {
29966 tree name;
29969 matching_parens parens;
29975 }
29977 /* Parse an Objective-C protocol expression.
29979 objc-protocol-expression:
29980 @protocol ( identifier )
29982 Returns a representation of the protocol expression. */
29984 static tree
29986 {
29987 tree proto;
29991 matching_parens parens;
29996 /* Build a location of the form:
29997 @protocol(prot)
29998 ^~~~~~~~~~~~~~~
29999 with caret==start at the @ token, finishing at the close paren. */
30000 location_t combined_loc
30006 }
30008 /* Parse an Objective-C selector expression.
30010 objc-selector-expression:
30011 @selector ( objc-method-signature )
30013 objc-method-signature:
30014 objc-selector
30015 objc-selector-seq
30017 objc-selector-seq:
30018 objc-selector :
30019 objc-selector-seq objc-selector :
30021 Returns a representation of the method selector. */
30023 static tree
30025 {
30032 matching_parens parens;
30038 {
30047 {
30048 /* Detect if we have a unary selector. */
30050 {
30053 }
30054 else
30055 {
30057 }
30058 }
30063 {
30064 sel_seq
30067 sel_seq
30070 }
30071 else
30072 sel_seq
30077 }
30079 finish_selector:
30083 /* Build a location of the form:
30084 @selector(func)
30085 ^~~~~~~~~~~~~~~
30086 with caret==start at the @ token, finishing at the close paren. */
30087 location_t combined_loc
30091 /* TODO: objc_build_selector_expr doesn't always honor the location. */
30094 }
30096 /* Parse a list of identifiers.
30098 objc-identifier-list:
30099 identifier
30100 objc-identifier-list , identifier
30102 Returns a TREE_LIST of identifier nodes. */
30104 static tree
30106 {
30107 tree identifier;
30108 tree list;
30119 {
30126 identifier));
30128 }
30131 }
30133 /* Parse an Objective-C alias declaration.
30135 objc-alias-declaration:
30136 @compatibility_alias identifier identifier ;
30138 This function registers the alias mapping with the Objective-C front end.
30139 It returns nothing. */
30141 static void
30143 {
30151 }
30153 /* Parse an Objective-C class forward-declaration.
30155 objc-class-declaration:
30156 @class objc-identifier-list ;
30158 The function registers the forward declarations with the Objective-C
30159 front end. It returns nothing. */
30161 static void
30163 {
30166 {
30167 tree id;
30177 else
30179 }
30181 }
30183 /* Parse a list of Objective-C protocol references.
30185 objc-protocol-refs-opt:
30186 objc-protocol-refs [opt]
30188 objc-protocol-refs:
30189 < objc-identifier-list >
30191 Returns a TREE_LIST of identifiers, if any. */
30193 static tree
30195 {
30199 {
30203 }
30206 }
30208 /* Parse a Objective-C visibility specification. */
30210 static void
30212 {
30216 {
30231 }
30233 /* Eat '@private'/'@protected'/'@public'. */
30235 }
30237 /* Parse an Objective-C method type. Return 'true' if it is a class
30238 (+) method, and 'false' if it is an instance (-) method. */
30242 {
30245 else
30247 }
30249 /* Parse an Objective-C protocol qualifier. */
30251 static tree
30253 {
30266 {
30271 }
30274 }
30276 /* Parse an Objective-C typename. */
30278 static tree
30280 {
30284 {
30287 matching_parens parens;
30291 /* An ObjC type name may consist of just protocol qualifiers, in which
30292 case the type shall default to 'id'. */
30294 {
30297 /* If the type could not be parsed, an error has already
30298 been produced. For error recovery, behave as if it had
30299 not been specified, which will use the default type
30300 'id'. */
30302 {
30304 /* We need to skip to the closing parenthesis as
30305 cp_parser_type_id() does not seem to do it for
30306 us. */
30311 }
30312 }
30316 }
30319 }
30321 /* Check to see if TYPE refers to an Objective-C selector name. */
30323 static bool
30325 {
30331 }
30333 /* Parse an Objective-C selector. */
30335 static tree
30337 {
30341 {
30344 }
30346 /* C++ operator names are allowed to appear in ObjC selectors. */
30348 {
30361 }
30362 }
30364 /* Parse an Objective-C params list. */
30366 static tree
30368 {
30374 {
30384 /* Detect if we have a unary selector. */
30387 {
30390 }
30394 {
30395 /* Something went quite wrong. There should be a colon
30396 here, but there is not. Stop parsing parameters. */
30398 }
30400 /* New ObjC allows attributes on parameters too. */
30405 params
30408 type_name,
30409 identifier,
30410 parm_attr));
30413 }
30416 {
30419 }
30421 /* We allow tail attributes for the method. */
30423 {
30431 }
30434 {
30437 }
30439 }
30441 /* Parse the non-keyword Objective-C params. */
30443 static tree
30446 {
30452 {
30454 tree parm;
30460 {
30465 }
30467 /* TODO: parse attributes for tail parameters. */
30476 }
30478 /* We allow tail attributes for the method. */
30480 {
30482 {
30487 }
30488 else
30489 /* We have an error, but parse the attributes, so that we can
30490 carry on. */
30496 }
30499 }
30501 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30503 static void
30505 {
30508 /* If the next token is `extern' and the following token is a string
30509 literal, then we have a linkage specification. */
30511 && cp_parser_is_pure_string_literal
30514 /* Handle #pragma, if any. */
30517 /* Allow stray semicolons. */
30520 /* Mark methods as optional or required, when building protocols. */
30522 {
30525 }
30527 {
30530 }
30533 /* Other stray characters must generate errors. */
30535 {
30539 }
30540 /* Finally, try to parse a block-declaration, or a function-definition. */
30541 else
30543 }
30545 /* Parse a method signature. */
30547 static tree
30549 {
30565 }
30567 static bool
30569 {
30570 tree tattr;
30575 /* If the attributes are followed by a method introducer, this is not allowed.
30576 Dump the attributes and flag the situation. */
30581 /* Otherwise, the attributes introduce some interstitial code, possibly so
30582 rewind to allow that check. */
30585 }
30587 /* Parse an Objective-C method prototype list. */
30589 static void
30591 {
30595 {
30597 {
30602 else
30606 {
30610 }
30613 }
30619 OPT_Wattributes,
30621 else
30622 /* Allow for interspersed non-ObjC++ code. */
30626 }
30630 else
30634 }
30636 /* Parse an Objective-C method definition list. */
30638 static void
30640 {
30644 {
30645 tree meth;
30648 {
30654 else
30659 {
30663 }
30665 NULL_TREE);
30667 /* For historical reasons, we accept an optional semicolon. */
30674 {
30681 }
30682 }
30683 /* The following case will be removed once @synthesize is
30684 completely implemented. */
30695 else
30696 /* Allow for interspersed non-ObjC++ code. */
30700 }
30704 else
30708 }
30710 /* Parse Objective-C ivars. */
30712 static void
30714 {
30725 {
30726 cp_decl_specifier_seq declspecs;
30728 tree prefix_attributes;
30736 CP_PARSER_FLAGS_OPTIONAL,
30740 /* auto, register, static, extern, mutable. */
30742 {
30745 }
30747 /* thread_local. */
30749 {
30752 }
30754 /* typedef. */
30756 {
30759 }
30764 /* Keep going until we hit the `;' at the end of the
30765 declaration. */
30767 {
30772 /* Check for a (possibly unnamed) bitfield declaration. */
30780 {
30781 /* Get the name of the bitfield. */
30786 eat_colon:
30788 /* Get the width of the bitfield. */
30789 width
30791 }
30792 else
30793 {
30794 /* Parse the declarator. */
30795 declarator
30801 }
30803 /* Look for attributes that apply to the ivar. */
30805 /* Remember which attributes are prefix attributes and
30806 which are not. */
30808 /* Combine the attributes. */
30812 /* Create the bitfield declaration. */
30815 else
30820 /* Add the instance variable. */
30824 /* Reset PREFIX_ATTRIBUTES. */
30826 {
30831 }
30836 {
30839 }
30841 }
30845 }
30850 /* Do not consume the RID_AT_END, so it will be read again as terminating
30851 the @interface of @implementation. */
30855 /* For historical reasons, we accept an optional semicolon. */
30858 }
30860 /* Parse an Objective-C protocol declaration. */
30862 static void
30864 {
30870 {
30875 }
30877 /* See if we have a forward declaration or a definition. */
30880 /* Try a forward declaration first. */
30882 {
30884 {
30885 tree id;
30895 else
30897 }
30899 }
30901 /* Ok, we got a full-fledged definition (or at least should). */
30902 else
30903 {
30908 }
30909 }
30911 /* Parse an Objective-C superclass or category. */
30913 static void
30918 {
30924 {
30927 }
30929 {
30930 matching_parens parens;
30933 /* If there is no category name, and this is an @interface, we
30934 have a class extension. */
30936 {
30939 }
30940 else
30944 }
30945 }
30947 /* Parse an Objective-C class interface. */
30949 static void
30951 {
30958 {
30959 /* It's hard to recover because even if valid @interface stuff
30960 is to follow, we can't compile it (or validate it) if we
30961 don't even know which class it refers to. Let's assume this
30962 was a stray '@interface' token in the stream and skip it.
30963 */
30965 }
30970 /* We have either a class or a category on our hands. */
30973 else
30974 {
30976 /* Handle instance variable declarations, if any. */
30979 }
30982 }
30984 /* Parse an Objective-C class implementation. */
30986 static void
30988 {
30995 {
30996 /* It's hard to recover because even if valid @implementation
30997 stuff is to follow, we can't compile it (or validate it) if
30998 we don't even know which class it refers to. Let's assume
30999 this was a stray '@implementation' token in the stream and
31000 skip it.
31001 */
31003 }
31007 /* We have either a class or a category on our hands. */
31010 else
31011 {
31013 /* Handle instance variable declarations, if any. */
31016 }
31019 }
31021 /* Consume the @end token and finish off the implementation. */
31023 static void
31025 {
31028 }
31030 /* Parse an Objective-C declaration. */
31032 static void
31034 {
31035 /* Try to figure out what kind of declaration is present. */
31040 {
31056 }
31059 {
31082 }
31083 }
31085 /* Parse an Objective-C try-catch-finally statement.
31087 objc-try-catch-finally-stmt:
31088 @try compound-statement objc-catch-clause-seq [opt]
31089 objc-finally-clause [opt]
31091 objc-catch-clause-seq:
31092 objc-catch-clause objc-catch-clause-seq [opt]
31094 objc-catch-clause:
31095 @catch ( objc-exception-declaration ) compound-statement
31097 objc-finally-clause:
31098 @finally compound-statement
31100 objc-exception-declaration:
31101 parameter-declaration
31102 '...'
31104 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
31106 Returns NULL_TREE.
31108 PS: This function is identical to c_parser_objc_try_catch_finally_statement
31109 for C. Keep them in sync. */
31111 static tree
31113 {
31114 location_t location;
31115 tree stmt;
31120 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
31121 node, lest it get absorbed into the surrounding block. */
31127 {
31131 matching_parens parens;
31137 {
31138 /* We have "@catch (...)" (where the '...' are literally
31139 what is in the code). Skip the '...'.
31140 parameter_declaration is set to NULL_TREE, and
31141 objc_being_catch_clauses() knows that that means
31142 '...'. */
31145 }
31146 else
31147 {
31148 /* We have "@catch (NSException *exception)" or something
31149 like that. Parse the parameter declaration. */
31153 else
31158 }
31161 else
31162 {
31163 /* If there was no open parenthesis, we are recovering from
31164 an error, and we are trying to figure out what mistake
31165 the user has made. */
31167 /* If there is an immediate closing parenthesis, the user
31168 probably forgot the opening one (ie, they typed "@catch
31169 NSException *e)". Parse the closing parenthesis and keep
31170 going. */
31174 /* If these is no immediate closing parenthesis, the user
31175 probably doesn't know that parenthesis are required at
31176 all (ie, they typed "@catch NSException *e"). So, just
31177 forget about the closing parenthesis and keep going. */
31178 }
31182 }
31184 {
31187 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
31188 node, lest it get absorbed into the surrounding block. */
31192 }
31195 }
31197 /* Parse an Objective-C synchronized statement.
31199 objc-synchronized-stmt:
31200 @synchronized ( expression ) compound-statement
31202 Returns NULL_TREE. */
31204 static tree
31206 {
31207 location_t location;
31214 matching_parens parens;
31219 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
31220 node, lest it get absorbed into the surrounding block. */
31225 }
31227 /* Parse an Objective-C throw statement.
31229 objc-throw-stmt:
31230 @throw assignment-expression [opt] ;
31232 Returns a constructed '@throw' statement. */
31234 static tree
31236 {
31248 }
31250 /* Parse an Objective-C statement. */
31252 static tree
31254 {
31255 /* Try to figure out what kind of declaration is present. */
31259 {
31270 }
31273 }
31275 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
31276 look ahead to see if an objc keyword follows the attributes. This
31277 is to detect the use of prefix attributes on ObjC @interface and
31278 @protocol. */
31280 static bool
31282 {
31287 {
31290 }
31293 }
31295 /* This routine is a minimal replacement for
31296 c_parser_struct_declaration () used when parsing the list of
31297 types/names or ObjC++ properties. For example, when parsing the
31298 code
31300 @property (readonly) int a, b, c;
31302 this function is responsible for parsing "int a, int b, int c" and
31303 returning the declarations as CHAIN of DECLs.
31305 TODO: Share this code with cp_parser_objc_class_ivars. It's very
31306 similar parsing. */
31307 static tree
31309 {
31311 cp_decl_specifier_seq declspecs;
31313 tree prefix_attributes;
31316 CP_PARSER_FLAGS_NONE,
31323 /* auto, register, static, extern, mutable. */
31325 {
31328 }
31330 /* thread_local. */
31332 {
31335 }
31337 /* typedef. */
31339 {
31342 }
31347 /* Keep going until we hit the `;' at the end of the declaration. */
31349 {
31354 /* Parse the declarator. */
31358 /* Look for attributes that apply to the ivar. */
31360 /* Remember which attributes are prefix attributes and
31361 which are not. */
31363 /* Combine the attributes. */
31373 /* Reset PREFIX_ATTRIBUTES. */
31375 {
31380 }
31387 {
31390 }
31391 else
31393 }
31395 }
31397 /* Parse an Objective-C @property declaration. The syntax is:
31399 objc-property-declaration:
31400 '@property' objc-property-attributes[opt] struct-declaration ;
31402 objc-property-attributes:
31403 '(' objc-property-attribute-list ')'
31405 objc-property-attribute-list:
31406 objc-property-attribute
31407 objc-property-attribute-list, objc-property-attribute
31409 objc-property-attribute
31410 'getter' = identifier
31411 'setter' = identifier
31412 'readonly'
31413 'readwrite'
31414 'assign'
31415 'retain'
31416 'copy'
31417 'nonatomic'
31419 For example:
31420 @property NSString *name;
31421 @property (readonly) id object;
31422 @property (retain, nonatomic, getter=getTheName) id name;
31423 @property int a, b, c;
31425 PS: This function is identical to
31426 c_parser_objc_at_property_declaration for C. Keep them in sync. */
31427 static void
31429 {
31430 /* The following variables hold the attributes of the properties as
31431 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
31432 seen. When we see an attribute, we set them to 'true' (if they
31433 are boolean properties) or to the identifier (if they have an
31434 argument, ie, for getter and setter). Note that here we only
31435 parse the list of attributes, check the syntax and accumulate the
31436 attributes that we find. objc_add_property_declaration() will
31437 then process the information. */
31447 /* 'properties' is the list of properties that we read. Usually a
31448 single one, but maybe more (eg, in "@property int a, b, c;" there
31449 are three). */
31450 tree properties;
31451 location_t loc;
31457 /* Parse the optional attribute list... */
31459 {
31460 /* Eat the '('. */
31461 matching_parens parens;
31465 {
31471 {
31474 }
31478 {
31489 {
31493 else
31498 }
31501 {
31505 }
31507 {
31509 {
31512 }
31513 else
31517 else
31519 }
31520 else
31521 {
31523 {
31526 }
31527 else
31529 }
31535 }
31542 else
31544 }
31546 /* FIXME: "@property (setter, assign);" will generate a spurious
31547 "error: expected ‘)’ before ‘,’ token". This is because
31548 cp_parser_require, unlike the C counterpart, will produce an
31549 error even if we are in error recovery. */
31551 {
31556 }
31557 }
31559 /* ... and the property declaration(s). */
31563 {
31565 /* If the next token is now a `;', consume it. */
31569 }
31573 else
31574 {
31575 /* Comma-separated properties are chained together in
31576 reverse order; add them one by one. */
31585 }
31588 }
31590 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31592 objc-synthesize-declaration:
31593 @synthesize objc-synthesize-identifier-list ;
31595 objc-synthesize-identifier-list:
31596 objc-synthesize-identifier
31597 objc-synthesize-identifier-list, objc-synthesize-identifier
31599 objc-synthesize-identifier
31600 identifier
31601 identifier = identifier
31603 For example:
31604 @synthesize MyProperty;
31605 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31607 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31608 for C. Keep them in sync.
31609 */
31610 static void
31612 {
31614 location_t loc;
31619 {
31623 {
31626 }
31628 {
31632 {
31635 }
31636 }
31637 else
31642 else
31644 }
31647 }
31649 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31651 objc-dynamic-declaration:
31652 @dynamic identifier-list ;
31654 For example:
31655 @dynamic MyProperty;
31656 @dynamic MyProperty, AnotherProperty;
31658 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31659 for C. Keep them in sync.
31660 */
31661 static void
31663 {
31665 location_t loc;
31670 {
31671 tree property;
31674 {
31677 }
31681 else
31683 }
31686 }
31688 \f
31689 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 / 4.5 / 5.0 parsing routines. */
31691 /* Returns name of the next clause.
31692 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31693 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31694 returned and the token is consumed. */
31696 static pragma_omp_clause
31698 {
31714 {
31719 {
31906 }
31907 }
31913 }
31915 /* Validate that a clause of the given type does not already exist. */
31917 static void
31920 {
31921 tree c;
31925 {
31928 }
31929 }
31931 /* OpenMP 2.5:
31932 variable-list:
31933 identifier
31934 variable-list , identifier
31936 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31937 colon). An opening parenthesis will have been consumed by the caller.
31939 If KIND is nonzero, create the appropriate node and install the decl
31940 in OMP_CLAUSE_DECL and add the node to the head of the list.
31942 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31943 return the list created.
31945 COLON can be NULL if only closing parenthesis should end the list,
31946 or pointer to bool which will receive false if the list is terminated
31947 by closing parenthesis or true if the list is terminated by colon. */
31949 static tree
31952 {
31956 {
31959 }
31961 {
31968 && current_class_ptr
31970 {
31976 }
31977 else
31978 {
31985 {
31990 }
31994 else
31997 {
32003 }
32004 }
32006 ;
32008 {
32010 {
32012 /* The OpenACC cache directive explicitly only allows "array
32013 elements or subarrays". */
32015 {
32019 }
32020 /* FALLTHROUGH. */
32025 {
32026 location_t loc
32031 decl
32035 }
32036 /* FALLTHROUGH. */
32042 {
32050 parser->colon_corrects_to_scope_p
32054 else
32055 {
32056 /* Look for `:'. */
32058 {
32063 }
32067 CPP_CLOSE_SQUARE))
32069 }
32070 /* Look for the closing `]'. */
32072 RT_CLOSE_SQUARE))
32073 {
32078 }
32081 }
32085 }
32088 {
32092 {
32093 depend_lvalue:
32097 }
32098 else
32100 }
32106 }
32107 else
32110 get_comma:
32114 }
32120 {
32124 }
32127 {
32130 /* Try to resync to an unnested comma. Copied from
32131 cp_parser_parenthesized_expression_list. */
32132 skip_comma:
32141 }
32144 }
32146 /* Similarly, but expect leading and trailing parenthesis. This is a very
32147 common case for omp clauses. */
32149 static tree
32151 {
32155 }
32157 /* OpenACC 2.0:
32158 copy ( variable-list )
32159 copyin ( variable-list )
32160 copyout ( variable-list )
32161 create ( variable-list )
32162 delete ( variable-list )
32163 present ( variable-list ) */
32165 static tree
32167 tree list)
32168 {
32171 {
32204 }
32212 }
32214 /* OpenACC 2.0:
32215 deviceptr ( variable-list ) */
32217 static tree
32219 {
32223 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
32224 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
32225 variable-list must only allow for pointer variables. */
32228 {
32235 }
32238 }
32240 /* OpenACC 2.5:
32241 auto
32242 finalize
32243 independent
32244 nohost
32245 seq */
32247 static tree
32251 {
32256 }
32258 /* OpenACC:
32259 num_gangs ( expression )
32260 num_workers ( expression )
32261 vector_length ( expression ) */
32263 static tree
32266 {
32269 matching_parens parens;
32277 {
32282 }
32290 }
32292 /* OpenACC:
32294 gang [( gang-arg-list )]
32295 worker [( [num:] int-expr )]
32296 vector [( [length:] int-expr )]
32298 where gang-arg is one of:
32300 [num:] int-expr
32301 static: size-expr
32303 and size-expr may be:
32305 *
32306 int-expr
32307 */
32309 static tree
32312 {
32322 {
32323 matching_parens parens;
32326 do
32327 {
32331 /* Gang static argument. */
32334 {
32342 {
32345 }
32347 /* Check for the '*' argument. */
32351 CPP_CLOSE_PAREN)))
32352 {
32357 {
32360 }
32362 }
32363 }
32364 /* Worker num: argument and vector length: arguments. */
32368 {
32371 }
32373 /* Now collect the actual argument. */
32375 {
32378 }
32390 {
32393 }
32395 }
32400 }
32414 cleanup_error:
32417 }
32419 /* OpenACC 2.0:
32420 tile ( size-expr-list ) */
32422 static tree
32424 {
32428 /* Collapse and tile are mutually exclusive. (The spec doesn't say
32429 so, but the spec authors never considered such a case and have
32430 differing opinions on what it might mean, including 'not
32431 allowed'.) */
32434 clause_loc);
32439 do
32440 {
32447 {
32450 }
32451 else
32455 }
32458 /* Consume the trailing ')'. */
32466 }
32468 /* OpenACC 2.0
32469 Parse wait clause or directive parameters. */
32471 static tree
32473 {
32483 {
32488 }
32495 {
32499 {
32502 else
32503 {
32510 }
32511 }
32512 }
32515 }
32517 /* OpenACC:
32518 wait ( int-expr-list ) */
32520 static tree
32522 {
32531 }
32533 /* OpenMP 3.0:
32534 collapse ( constant-expression ) */
32536 static tree
32538 {
32540 location_t loc;
32541 HOST_WIDE_INT n;
32544 matching_parens parens;
32562 {
32565 }
32574 }
32576 /* OpenMP 2.5:
32577 default ( none | shared )
32579 OpenACC:
32580 default ( none | present ) */
32582 static tree
32585 {
32587 tree c;
32589 matching_parens parens;
32593 {
32598 {
32619 }
32622 }
32623 else
32624 {
32625 invalid_kind:
32628 else
32630 }
32647 }
32649 /* OpenMP 3.1:
32650 final ( expression ) */
32652 static tree
32654 {
32657 matching_parens parens;
32676 }
32678 /* OpenMP 2.5:
32679 if ( expression )
32681 OpenMP 4.5:
32682 if ( directive-name-modifier : expression )
32684 directive-name-modifier:
32685 parallel | task | taskloop | target data | target | target update
32686 | target enter data | target exit data
32688 OpenMP 5.0:
32689 directive-name-modifier:
32690 ... | simd | cancel */
32692 static tree
32695 {
32699 matching_parens parens;
32704 {
32720 {
32723 {
32736 else
32737 {
32738 location_t loc
32743 }
32746 {
32748 {
32753 }
32755 {
32756 location_t loc
32760 }
32761 }
32762 }
32763 }
32765 {
32767 {
32770 }
32771 else
32772 {
32774 {
32775 location_t loc
32778 }
32780 }
32781 }
32782 }
32794 {
32797 {
32800 {
32812 }
32814 p);
32816 }
32818 {
32821 else
32824 }
32827 {
32831 }
32832 }
32840 }
32842 /* OpenMP 3.1:
32843 mergeable */
32845 static tree
32848 {
32849 tree c;
32852 location);
32857 }
32859 /* OpenMP 2.5:
32860 nowait */
32862 static tree
32865 {
32866 tree c;
32873 }
32875 /* OpenMP 2.5:
32876 num_threads ( expression ) */
32878 static tree
32880 location_t location)
32881 {
32884 matching_parens parens;
32904 }
32906 /* OpenMP 4.5:
32907 num_tasks ( expression ) */
32909 static tree
32911 location_t location)
32912 {
32915 matching_parens parens;
32935 }
32937 /* OpenMP 4.5:
32938 grainsize ( expression ) */
32940 static tree
32942 location_t location)
32943 {
32946 matching_parens parens;
32966 }
32968 /* OpenMP 4.5:
32969 priority ( expression ) */
32971 static tree
32973 location_t location)
32974 {
32977 matching_parens parens;
32997 }
32999 /* OpenMP 4.5:
33000 hint ( expression ) */
33002 static tree
33004 {
33007 matching_parens parens;
33026 }
33028 /* OpenMP 4.5:
33029 defaultmap ( tofrom : scalar )
33031 OpenMP 5.0:
33032 defaultmap ( implicit-behavior [ : variable-category ] ) */
33034 static tree
33036 location_t location)
33037 {
33041 enum omp_clause_defaultmap_kind category
33044 matching_parens parens;
33051 {
33052 invalid_behavior:
33054 "%<tofrom%>, %<firstprivate%>, %<none%> "
33057 }
33058 else
33059 {
33062 }
33065 {
33069 else
33076 else
33085 else
33092 else
33101 else
33107 }
33111 {
33116 {
33117 invalid_category:
33121 }
33126 {
33130 else
33137 else
33144 else
33150 }
33153 }
33163 {
33170 {
33185 }
33188 p);
33189 else
33193 }
33200 out_err:
33205 }
33207 /* OpenMP 2.5:
33208 ordered
33210 OpenMP 4.5:
33211 ordered ( constant-expression ) */
33213 static tree
33216 {
33218 HOST_WIDE_INT n;
33224 {
33225 matching_parens parens;
33242 {
33244 "ordered argument needs positive constant integer "
33247 }
33248 }
33254 }
33256 /* OpenMP 2.5:
33257 reduction ( reduction-operator : variable-list )
33259 reduction-operator:
33260 One of: + * - & ^ | && ||
33262 OpenMP 3.1:
33264 reduction-operator:
33265 One of: + * - & ^ | && || min max
33267 OpenMP 4.0:
33269 reduction-operator:
33270 One of: + * - & ^ | && ||
33271 id-expression
33273 OpenMP 5.0:
33274 reduction ( reduction-modifier, reduction-operator : variable-list )
33275 in_reduction ( reduction-operator : variable-list )
33276 task_reduction ( reduction-operator : variable-list ) */
33278 static tree
33281 {
33291 {
33294 {
33297 }
33300 {
33306 {
33310 }
33312 {
33315 }
33316 }
33317 }
33320 {
33330 }
33334 else
33335 {
33346 {
33376 }
33377 else
33378 {
33380 resync_fail:
33385 }
33386 }
33392 NULL);
33394 {
33401 }
33404 }
33406 /* OpenMP 2.5:
33407 schedule ( schedule-kind )
33408 schedule ( schedule-kind , expression )
33410 schedule-kind:
33411 static | dynamic | guided | runtime | auto
33413 OpenMP 4.5:
33414 schedule ( schedule-modifier : schedule-kind )
33415 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
33417 schedule-modifier:
33418 simd
33419 monotonic
33420 nonmonotonic */
33422 static tree
33424 {
33428 matching_parens parens;
33435 {
33444 else
33450 else
33451 {
33454 }
33455 }
33458 {
33463 {
33484 }
33485 }
33490 else
33496 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
33498 {
33502 }
33505 {
33520 else
33525 }
33537 invalid_kind:
33539 resync_fail:
33544 }
33546 /* OpenMP 3.0:
33547 untied */
33549 static tree
33552 {
33553 tree c;
33560 }
33562 /* OpenMP 4.0:
33563 inbranch
33564 notinbranch */
33566 static tree
33569 {
33574 }
33576 /* OpenMP 4.0:
33577 parallel
33578 for
33579 sections
33580 taskgroup */
33582 static tree
33586 {
33590 }
33592 /* OpenMP 4.5:
33593 nogroup */
33595 static tree
33598 {
33603 }
33605 /* OpenMP 4.5:
33606 simd
33607 threads */
33609 static tree
33613 {
33618 }
33620 /* OpenMP 4.0:
33621 num_teams ( expression ) */
33623 static tree
33625 location_t location)
33626 {
33629 matching_parens parens;
33649 }
33651 /* OpenMP 4.0:
33652 thread_limit ( expression ) */
33654 static tree
33656 location_t location)
33657 {
33660 matching_parens parens;
33680 }
33682 /* OpenMP 4.0:
33683 aligned ( variable-list )
33684 aligned ( variable-list : constant-expression ) */
33686 static tree
33688 {
33692 matching_parens parens;
33700 {
33710 }
33716 }
33718 /* OpenMP 2.5:
33719 lastprivate ( variable-list )
33721 OpenMP 5.0:
33722 lastprivate ( [ lastprivate-modifier : ] variable-list ) */
33724 static tree
33726 {
33734 {
33739 {
33743 }
33744 }
33753 }
33755 /* OpenMP 4.0:
33756 linear ( variable-list )
33757 linear ( variable-list : expression )
33759 OpenMP 4.5:
33760 linear ( modifier ( variable-list ) )
33761 linear ( modifier ( variable-list ) : expression ) */
33763 static tree
33766 {
33771 matching_parens parens;
33776 {
33788 else
33790 }
33795 else
33796 {
33805 }
33808 {
33813 {
33824 {
33827 }
33830 }
33841 }
33844 {
33847 }
33850 }
33852 /* OpenMP 4.0:
33853 safelen ( constant-expression ) */
33855 static tree
33857 location_t location)
33858 {
33861 matching_parens parens;
33880 }
33882 /* OpenMP 4.0:
33883 simdlen ( constant-expression ) */
33885 static tree
33887 location_t location)
33888 {
33891 matching_parens parens;
33910 }
33912 /* OpenMP 4.5:
33913 vec:
33914 identifier [+/- integer]
33915 vec , identifier [+/- integer]
33916 */
33918 static tree
33920 tree list)
33921 {
33925 {
33928 }
33931 {
33938 else
33939 {
33940 t = cp_parser_lookup_name_simple
33945 id_loc);
33946 }
33952 {
33955 }
33959 {
33962 }
33966 {
33969 }
33972 add_to_vector:
33974 {
33978 }
33984 }
33987 {
33993 }
33995 }
33997 /* OpenMP 5.0:
33998 iterators ( iterators-definition )
34000 iterators-definition:
34001 iterator-specifier
34002 iterator-specifier , iterators-definition
34004 iterator-specifier:
34005 identifier = range-specification
34006 iterator-type identifier = range-specification
34008 range-specification:
34009 begin : end
34010 begin : end : step */
34012 static tree
34014 {
34018 matching_parens parens;
34022 bool saved_colon_corrects_to_scope_p
34024 bool saved_colon_doesnt_start_class_def_p
34027 do
34028 {
34029 tree iter_type;
34033 else
34034 {
34037 parser->type_definition_forbidden_message
34043 }
34047 {
34050 }
34070 {
34073 }
34088 {
34091 }
34093 }
34097 parser->colon_doesnt_start_class_def_p
34107 }
34109 /* OpenMP 4.0:
34110 depend ( depend-kind : variable-list )
34112 depend-kind:
34113 in | out | inout
34115 OpenMP 4.5:
34116 depend ( source )
34118 depend ( sink : vec )
34120 OpenMP 5.0:
34121 depend ( depend-modifier , depend-kind: variable-list )
34123 depend-kind:
34124 in | out | inout | mutexinoutset | depobj
34126 depend-modifier:
34127 iterator ( iterators-definition ) */
34129 static tree
34131 {
34135 matching_parens parens;
34139 do
34140 {
34148 {
34153 }
34168 else
34171 }
34178 {
34183 }
34186 {
34196 }
34203 else
34204 {
34209 {
34213 else
34215 }
34218 {
34223 }
34224 }
34227 invalid_kind:
34229 resync_fail:
34236 }
34238 /* OpenMP 4.0:
34239 map ( map-kind : variable-list )
34240 map ( variable-list )
34242 map-kind:
34243 alloc | to | from | tofrom
34245 OpenMP 4.5:
34246 map-kind:
34247 alloc | to | from | tofrom | release | delete
34249 map ( always [,] map-kind: variable-list ) */
34251 static tree
34253 {
34262 {
34267 {
34270 nth++;
34276 {
34281 }
34282 }
34283 }
34287 {
34301 else
34302 {
34308 }
34311 }
34314 {
34318 }
34321 NULL);
34327 }
34329 /* OpenMP 4.0:
34330 device ( expression ) */
34332 static tree
34334 location_t location)
34335 {
34338 matching_parens parens;
34358 }
34360 /* OpenMP 4.0:
34361 dist_schedule ( static )
34362 dist_schedule ( static , expression ) */
34364 static tree
34366 location_t location)
34367 {
34370 matching_parens parens;
34381 {
34392 }
34397 location);
34401 invalid_kind:
34403 resync_fail:
34408 }
34410 /* OpenMP 4.0:
34411 proc_bind ( proc-bind-kind )
34413 proc-bind-kind:
34414 master | close | spread */
34416 static tree
34418 location_t location)
34419 {
34420 tree c;
34427 {
34437 else
34439 }
34440 else
34449 location);
34454 invalid_kind:
34456 resync_fail:
34461 }
34463 /* OpenACC:
34464 async [( int-expr )] */
34466 static tree
34468 {
34475 {
34476 matching_parens parens;
34485 }
34495 }
34497 /* Parse all OpenACC clauses. The set clauses allowed by the directive
34498 is a bitmask in MASK. Return the list of clauses found. */
34500 static tree
34504 {
34509 {
34510 location_t here;
34511 pragma_omp_clause c_kind;
34512 omp_clause_code code;
34523 {
34580 clauses);
34598 OMP_CLAUSE_IF_PRESENT,
34604 OMP_CLAUSE_INDEPENDENT,
34616 clauses);
34622 clauses);
34630 clauses);
34634 clauses
34650 clauses);
34662 clauses);
34676 }
34681 {
34682 /* Remove the invalid clause(s) from the list to avoid
34683 confusing the rest of the compiler. */
34686 }
34687 }
34689 saw_error:
34696 }
34698 /* Parse all OpenMP clauses. The set clauses allowed by the directive
34699 is a bitmask in MASK. Return the list of clauses found; the result
34700 of clause default goes in *pdefault. */
34702 static tree
34706 {
34712 {
34713 pragma_omp_clause c_kind;
34724 {
34736 clauses);
34750 clauses);
34770 clauses);
34775 clauses);
34784 clauses
34824 clauses);
34828 clauses
34840 clauses);
34844 clauses
34846 OMP_CLAUSE_TASK_REDUCTION,
34862 clauses);
34867 OMP_CLAUSE_NOTINBRANCH,
34876 {
34877 clause_not_first:
34881 }
34911 clauses);
34912 else
34922 clauses);
34940 {
34945 }
34988 clauses
34994 clauses
35002 }
35007 {
35008 /* Remove the invalid clause(s) from the list to avoid
35009 confusing the rest of the compiler. */
35012 }
35013 }
35014 saw_error:
35017 {
35020 else
35022 }
35024 }
35026 /* OpenMP 2.5:
35027 structured-block:
35028 statement
35030 In practice, we're also interested in adding the statement to an
35031 outer node. So it is convenient if we work around the fact that
35032 cp_parser_statement calls add_stmt. */
35034 static unsigned
35036 {
35039 /* Only move the values to IN_OMP_BLOCK if they weren't false.
35040 This preserves the "not within loop or switch" style error messages
35041 for nonsense cases like
35042 void foo() {
35043 #pragma omp single
35044 break;
35045 }
35046 */
35051 }
35053 static void
35055 {
35057 }
35059 static tree
35061 {
35069 }
35071 /* OpenMP 2.5:
35072 # pragma omp atomic new-line
35073 expression-stmt
35075 expression-stmt:
35076 x binop= expr | x++ | ++x | x-- | --x
35077 binop:
35078 +, *, -, /, &, ^, |, <<, >>
35080 where x is an lvalue expression with scalar type.
35082 OpenMP 3.1:
35083 # pragma omp atomic new-line
35084 update-stmt
35086 # pragma omp atomic read new-line
35087 read-stmt
35089 # pragma omp atomic write new-line
35090 write-stmt
35092 # pragma omp atomic update new-line
35093 update-stmt
35095 # pragma omp atomic capture new-line
35096 capture-stmt
35098 # pragma omp atomic capture new-line
35099 capture-block
35101 read-stmt:
35102 v = x
35103 write-stmt:
35104 x = expr
35105 update-stmt:
35106 expression-stmt | x = x binop expr
35107 capture-stmt:
35108 v = expression-stmt
35109 capture-block:
35110 { v = x; update-stmt; } | { update-stmt; v = x; }
35112 OpenMP 4.0:
35113 update-stmt:
35114 expression-stmt | x = x binop expr | x = expr binop x
35115 capture-stmt:
35116 v = update-stmt
35117 capture-block:
35118 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
35120 where x and v are lvalue expressions with scalar type. */
35122 static void
35124 {
35135 {
35142 {
35147 enum omp_memory_order new_memory_order
35169 {
35173 }
35174 else
35175 {
35178 "%<capture%>, %<seq_cst%>, %<acq_rel%>, "
35180 }
35182 {
35184 {
35187 else
35189 }
35191 {
35194 else
35196 }
35199 }
35200 }
35202 }
35208 {
35209 omp_requires_mask
35214 {
35224 {
35235 }
35239 }
35240 }
35241 else
35243 {
35247 {
35251 }
35256 {
35260 }
35265 {
35269 }
35273 }
35276 {
35286 else
35291 {
35292 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
35293 opcode. */
35298 }
35302 {
35305 }
35306 else
35307 {
35313 }
35316 }
35318 restart:
35322 {
35329 /* FALLTHROUGH */
35339 /* FALLTHROUGH */
35354 /* Undo effects of boolean_increment for post {in,de}crement. */
35356 /* FALLTHRU */
35360 {
35361 /* Undo effects of boolean_increment. */
35363 {
35364 /* This is pre or post increment. */
35369 && !structured_block
35373 }
35374 }
35375 /* FALLTHRU */
35378 {
35413 {
35417 }
35420 {
35426 {
35431 }
35433 {
35445 {
35447 {
35452 }
35453 else
35455 }
35459 }
35462 {
35469 }
35473 }
35477 {
35480 {
35488 }
35490 {
35495 }
35530 }
35541 /* FALLTHROUGH */
35546 }
35553 }
35554 stmt_done:
35556 {
35567 }
35569 {
35572 }
35573 done:
35581 saw_error:
35584 {
35588 {
35592 }
35593 }
35594 }
35597 /* OpenMP 2.5:
35598 # pragma omp barrier new-line */
35600 static void
35602 {
35605 }
35607 /* OpenMP 2.5:
35608 # pragma omp critical [(name)] new-line
35609 structured-block
35611 OpenMP 4.5:
35612 # pragma omp critical [(name) [hint(expression)]] new-line
35613 structured-block */
35615 #define OMP_CRITICAL_CLAUSE_MASK \
35616 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
35618 static tree
35620 {
35624 {
35625 matching_parens parens;
35643 OMP_CRITICAL_CLAUSE_MASK,
35645 }
35646 else
35651 }
35653 /* OpenMP 5.0:
35654 # pragma omp depobj ( depobj ) depobj-clause new-line
35656 depobj-clause:
35657 depend (dependence-type : locator)
35658 destroy
35659 update (dependence-type)
35661 dependence-type:
35662 in
35663 out
35664 inout
35665 mutexinout */
35667 static void
35669 {
35671 matching_parens parens;
35673 {
35676 }
35689 {
35695 {
35701 }
35705 {
35706 matching_parens c_parens;
35708 {
35709 location_t c2_loc
35712 {
35725 }
35727 {
35731 }
35737 }
35738 else
35740 }
35741 }
35743 {
35746 }
35750 }
35753 /* OpenMP 2.5:
35754 # pragma omp flush flush-vars[opt] new-line
35756 flush-vars:
35757 ( variable-list )
35759 OpenMP 5.0:
35760 # pragma omp flush memory-order-clause new-line */
35762 static void
35764 {
35767 {
35776 else
35780 }
35782 {
35785 "%<flush%> list specified together with memory order "
35788 }
35792 }
35794 /* Helper function, to parse omp for increment expression. */
35796 static tree
35798 {
35803 {
35806 }
35809 {
35821 }
35823 /* If decl is an iterator, preserve LHS and RHS of the relational
35824 expr until finish_omp_for. */
35835 }
35837 /* Helper function, to parse omp for increment expression. */
35839 static tree
35841 {
35845 cp_id_kind idk;
35849 {
35858 }
35867 {
35872 }
35879 {
35883 }
35896 do
35897 {
35904 {
35906 {
35909 else
35911 tf_warning_or_error);
35912 }
35913 else
35916 }
35917 }
35921 {
35927 }
35928 else
35932 }
35934 /* Parse the initialization statement of an OpenMP for loop.
35936 Return true if the resulting construct should have an
35937 OMP_CLAUSE_PRIVATE added to it. */
35939 static tree
35947 {
35953 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
35955 init-expr:
35956 var = lb
35957 integer-type var = lb
35958 random-access-iterator-type var = lb
35959 pointer-type var = lb
35960 */
35961 cp_decl_specifier_seq type_specifiers;
35963 /* First, try to parse as an initialized declaration. See
35964 cp_parser_condition, from whence the bulk of this is copied. */
35971 {
35972 /* If parsing a type specifier seq succeeded, then this
35973 MUST be a initialized declaration. */
35978 CP_PARSER_DECLARATOR_NAMED,
35989 else
35990 {
36000 {
36002 CPP_OPEN_PAREN))
36005 else
36006 /* Trigger an error. */
36011 }
36015 {
36023 {
36026 auto_node);
36031 }
36034 asm_specification,
36035 LOOKUP_ONLYCONVERTING);
36038 {
36041 }
36042 else
36043 {
36046 {
36048 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
36050 {
36054 {
36058 }
36060 }
36062 {
36067 }
36068 }
36069 }
36071 }
36072 else
36073 {
36074 /* Consume '='. */
36078 non_class:
36081 else
36084 asm_specification,
36085 LOOKUP_ONLYCONVERTING);
36086 }
36090 }
36091 }
36092 else
36093 {
36094 cp_id_kind idk;
36095 /* If parsing a type specifier sequence failed, then
36096 this MUST be a simple expression. */
36102 && decl
36105 {
36116 {
36121 }
36126 }
36128 && decl
36131 {
36132 tree rhs;
36140 rhs,
36141 tf_warning_or_error));
36144 }
36145 else
36146 {
36151 {
36155 }
36156 }
36157 }
36159 }
36161 /* Helper for cp_parser_omp_for_loop, handle one range-for loop. */
36163 void
36167 {
36172 {
36176 /* do_auto_deduction doesn't mess with template init-lists. */
36178 {
36181 {
36187 }
36189 }
36196 }
36201 /* If an error happened previously do nothing or else a lot of
36202 unhelpful errors would be issued. */
36204 else
36205 {
36206 tree range_temp;
36210 /* Can't bind a reference to an array of runtime bound. */
36212 else
36213 {
36219 LOOKUP_ONLYCONVERTING);
36222 }
36225 }
36236 LOOKUP_ONLYCONVERTING);
36238 /* The new for initialization statement. */
36246 else
36247 {
36250 }
36253 LOOKUP_ONLYCONVERTING);
36255 /* The new for condition. */
36258 else
36264 /* The new increment expression. */
36267 else
36270 tf_warning_or_error);
36275 {
36278 }
36283 {
36288 {
36293 }
36294 }
36298 {
36300 tf_none);
36304 }
36311 {
36314 }
36316 }
36318 /* Helper for cp_parser_omp_for_loop, finalize part of range for
36319 inside of the collapsed body. */
36321 void
36323 {
36331 {
36335 }
36337 /* The declaration is initialized with *__begin inside the loop body. */
36340 tf_warning_or_error),
36342 LOOKUP_ONLYCONVERTING);
36345 }
36347 /* Parse the restricted form of the for statement allowed by OpenMP. */
36349 static tree
36352 {
36354 tree orig_decl;
36357 location_t loc_first;
36368 {
36371 }
36374 {
36377 }
36380 {
36386 }
36388 {
36391 {
36393 "%<linear%> clause may not be specified together "
36396 }
36397 else
36399 }
36413 {
36416 location_t loc;
36419 {
36423 }
36426 matching_parens parens;
36434 {
36435 /* Save tokens so that we can put them back. */
36438 /* Look for ':' that is not nested in () or {}. */
36439 bool is_range_for
36442 CPP_COLON,
36443 /*consume_paren=*/
36446 /* Roll back the tokens we skipped. */
36450 {
36451 bool saved_colon_corrects_to_scope_p
36454 /* A colon is used in range-based for. */
36457 /* Parse the declaration. */
36459 /*function_definition_allowed_p=*/
36461 parser->colon_corrects_to_scope_p
36473 {
36475 {
36481 }
36482 else
36484 }
36488 "%<ordered%> clause with parameter on "
36492 }
36493 }
36495 add_private_clause
36501 {
36504 {
36510 }
36511 else
36513 }
36520 {
36525 {
36529 }
36532 {
36533 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
36537 {
36540 }
36541 else
36542 {
36545 }
36547 }
36548 else
36549 {
36554 }
36555 }
36558 {
36559 tree c;
36561 {
36570 decl);
36575 decl);
36576 }
36578 {
36583 else
36588 {
36591 /* For linear, signal that we need to fill up
36592 the so far unknown linear step. */
36595 }
36596 }
36597 }
36606 {
36607 /* If decl is an iterator, preserve the operator on decl
36608 until finish_omp_for. */
36610 && ((processing_template_decl
36615 else
36619 }
36621 parse_close_paren:
36632 {
36635 }
36637 {
36641 }
36648 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
36649 in between the collapsed for loops to be still considered perfectly
36650 nested. Hopefully the final version clarifies this.
36651 For now handle (multiple) {'s and empty statements. */
36654 {
36658 {
36660 bracecount++;
36661 }
36665 else
36666 {
36673 }
36674 }
36677 {
36680 }
36681 }
36686 /* Note that we saved the original contents of this flag when we entered
36687 the structured block, and so we don't need to re-save it here. */
36690 /* Note that the grammar doesn't call for a structured block here,
36691 though the loop as a whole is a structured block. */
36693 {
36699 }
36700 else
36705 else
36710 else
36715 {
36717 {
36719 nbraces--;
36720 }
36723 else
36724 {
36726 {
36729 }
36734 }
36735 }
36738 {
36742 else
36744 }
36748 }
36750 /* Helper function for OpenMP parsing, split clauses and call
36751 finish_omp_clauses on each of the set of clauses afterwards. */
36753 static void
36756 {
36762 }
36764 /* OpenMP 4.0:
36765 #pragma omp simd simd-clause[optseq] new-line
36766 for-loop */
36768 #define OMP_SIMD_CLAUSE_MASK \
36769 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
36770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
36777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NONTEMPORAL))
36780 static tree
36784 {
36795 {
36799 OMP_CLAUSE_ORDERED);
36801 {
36803 "%<ordered%> clause with parameter may not be specified "
36806 }
36807 }
36819 }
36821 /* OpenMP 2.5:
36822 #pragma omp for for-clause[optseq] new-line
36823 for-loop
36825 OpenMP 4.0:
36826 #pragma omp for simd for-simd-clause[optseq] new-line
36827 for-loop */
36829 #define OMP_FOR_CLAUSE_MASK \
36830 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
36836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
36837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36840 static tree
36844 {
36851 /* parallel for{, simd} disallows nowait clause, but for
36852 target {teams distribute ,}parallel for{, simd} it should be accepted. */
36855 /* Composite distribute parallel for{, simd} disallows ordered clause. */
36860 {
36865 {
36889 }
36890 }
36892 {
36895 }
36897 /* Composite distribute parallel for disallows linear clause. */
36904 {
36907 }
36919 }
36924 /* OpenMP 2.5:
36925 # pragma omp master new-line
36926 structured-block */
36928 static tree
36932 {
36940 {
36945 {
36963 }
36964 }
36966 {
36969 }
36972 {
36976 }
36977 else
36982 }
36984 /* OpenMP 2.5:
36985 # pragma omp ordered new-line
36986 structured-block
36988 OpenMP 4.5:
36989 # pragma omp ordered ordered-clauses new-line
36990 structured-block */
36992 #define OMP_ORDERED_CLAUSE_MASK \
36993 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
36994 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
36996 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
36997 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
36999 static bool
37002 {
37006 {
37011 {
37013 {
37016 }
37018 {
37020 "%<depend%> clause may only be used in compound "
37024 }
37025 tree clauses
37027 OMP_ORDERED_DEPEND_CLAUSE_MASK,
37031 }
37032 }
37034 tree clauses
37045 }
37047 /* OpenMP 2.5:
37049 section-scope:
37050 { section-sequence }
37052 section-sequence:
37053 section-directive[opt] structured-block
37054 section-sequence section-directive structured-block */
37056 static tree
37058 {
37063 matching_braces braces;
37071 {
37075 }
37078 {
37086 {
37090 }
37092 {
37095 }
37100 }
37111 }
37113 /* OpenMP 2.5:
37114 # pragma omp sections sections-clause[optseq] newline
37115 sections-scope */
37117 #define OMP_SECTIONS_CLAUSE_MASK \
37118 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
37122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37124 static tree
37127 {
37139 {
37142 }
37149 }
37151 /* OpenMP 2.5:
37152 # pragma omp parallel parallel-clause[optseq] new-line
37153 structured-block
37154 # pragma omp parallel for parallel-for-clause[optseq] new-line
37155 structured-block
37156 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
37157 structured-block
37159 OpenMP 4.0:
37160 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
37161 structured-block */
37163 #define OMP_PARALLEL_CLAUSE_MASK \
37164 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37165 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37166 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37167 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37168 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37169 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
37170 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
37171 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
37172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
37174 static tree
37178 {
37185 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
37191 {
37199 if_p);
37203 if_p);
37206 block);
37211 }
37212 /* When combined with distribute, parallel has to be followed by for.
37213 #pragma omp target parallel is allowed though. */
37217 {
37221 }
37223 {
37227 {
37238 block);
37243 }
37245 {
37248 }
37250 {
37260 block);
37263 }
37264 }
37266 {
37269 }
37274 {
37277 }
37285 }
37287 /* OpenMP 2.5:
37288 # pragma omp single single-clause[optseq] new-line
37289 structured-block */
37291 #define OMP_SINGLE_CLAUSE_MASK \
37292 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37293 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
37295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37297 static tree
37299 {
37310 }
37312 /* OpenMP 3.0:
37313 # pragma omp task task-clause[optseq] new-line
37314 structured-block */
37316 #define OMP_TASK_CLAUSE_MASK \
37317 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37318 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37319 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37320 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37321 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37322 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37324 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37325 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37326 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
37327 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
37329 static tree
37331 {
37342 }
37344 /* OpenMP 3.0:
37345 # pragma omp taskwait new-line
37347 OpenMP 5.0:
37348 # pragma omp taskwait taskwait-clause[opt] new-line */
37350 #define OMP_TASKWAIT_CLAUSE_MASK \
37351 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
37353 static void
37355 {
37356 tree clauses
37361 {
37368 }
37369 else
37371 }
37373 /* OpenMP 3.1:
37374 # pragma omp taskyield new-line */
37376 static void
37378 {
37381 }
37383 /* OpenMP 4.0:
37384 # pragma omp taskgroup new-line
37385 structured-block
37387 OpenMP 5.0:
37388 # pragma omp taskgroup taskgroup-clause[optseq] new-line */
37390 #define OMP_TASKGROUP_CLAUSE_MASK \
37391 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASK_REDUCTION))
37393 static tree
37395 {
37396 tree clauses
37401 if_p),
37402 clauses);
37403 }
37406 /* OpenMP 2.5:
37407 # pragma omp threadprivate (variable-list) */
37409 static void
37411 {
37412 tree vars;
37418 }
37420 /* OpenMP 4.0:
37421 # pragma omp cancel cancel-clause[optseq] new-line */
37423 #define OMP_CANCEL_CLAUSE_MASK \
37424 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
37425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
37426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
37427 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
37428 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
37430 static void
37432 {
37436 }
37438 /* OpenMP 4.0:
37439 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
37441 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
37442 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
37443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
37444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
37445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
37447 static void
37450 {
37451 tree clauses;
37455 {
37460 {
37463 }
37464 }
37466 {
37470 }
37473 {
37478 else
37482 }
37485 OMP_CANCELLATION_POINT_CLAUSE_MASK,
37487 pragma_tok);
37489 }
37491 /* OpenMP 4.0:
37492 #pragma omp distribute distribute-clause[optseq] new-line
37493 for-loop */
37495 #define OMP_DISTRIBUTE_CLAUSE_MASK \
37496 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37497 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37498 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37499 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
37500 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
37502 static tree
37506 {
37515 {
37523 else
37526 {
37532 {
37536 else
37539 }
37545 else
37559 }
37560 }
37562 {
37565 }
37570 {
37573 }
37585 }
37587 /* OpenMP 4.0:
37588 # pragma omp teams teams-clause[optseq] new-line
37589 structured-block */
37591 #define OMP_TEAMS_CLAUSE_MASK \
37592 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37595 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
37596 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
37597 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
37598 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
37600 static tree
37604 {
37613 {
37617 {
37643 }
37644 }
37646 {
37649 }
37654 {
37657 }
37667 }
37669 /* OpenMP 4.0:
37670 # pragma omp target data target-data-clause[optseq] new-line
37671 structured-block */
37673 #define OMP_TARGET_DATA_CLAUSE_MASK \
37674 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37675 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37676 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37677 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
37679 static tree
37681 {
37682 tree clauses
37687 {
37690 {
37707 "%<#pragma omp target data%> with map-type other "
37708 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
37712 }
37716 }
37719 {
37722 "%<#pragma omp target data%> must contain at least "
37725 }
37736 }
37738 /* OpenMP 4.5:
37739 # pragma omp target enter data target-enter-data-clause[optseq] new-line
37740 structured-block */
37742 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
37743 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37749 static tree
37752 {
37755 {
37760 {
37763 }
37764 }
37766 {
37770 }
37773 {
37779 }
37781 tree clauses
37786 {
37789 {
37802 "%<#pragma omp target enter data%> with map-type other "
37806 }
37808 }
37811 {
37814 "%<#pragma omp target enter data%> must contain at least "
37817 }
37824 }
37826 /* OpenMP 4.5:
37827 # pragma omp target exit data target-enter-data-clause[optseq] new-line
37828 structured-block */
37830 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
37831 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37837 static tree
37840 {
37843 {
37848 {
37851 }
37852 }
37854 {
37858 }
37861 {
37867 }
37869 tree clauses
37874 {
37877 {
37891 "%<#pragma omp target exit data%> with map-type other "
37892 "than %<from%>, %<release%> or %<delete%> on %<map%>"
37896 }
37898 }
37901 {
37904 "%<#pragma omp target exit data%> must contain at least "
37907 }
37914 }
37916 /* OpenMP 4.0:
37917 # pragma omp target update target-update-clause[optseq] new-line */
37919 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
37920 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
37921 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37922 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37923 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37924 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37925 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
37927 static bool
37930 {
37932 {
37938 }
37940 tree clauses
37945 {
37947 "%<#pragma omp target update%> must contain at least one "
37950 }
37958 }
37960 /* OpenMP 4.0:
37961 # pragma omp target target-clause[optseq] new-line
37962 structured-block */
37964 #define OMP_TARGET_CLAUSE_MASK \
37965 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
37966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
37967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
37969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
37970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
37973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
37975 static bool
37978 {
37982 omp_requires_mask
37986 {
37998 {
38006 {
38007 tree stmt;
38009 {
38012 OMP_TARGET_CLAUSE_MASK,
38017 OMP_TARGET_CLAUSE_MASK,
38022 OMP_TARGET_CLAUSE_MASK,
38027 }
38029 }
38034 {
38038 if_p);
38043 if_p);
38048 if_p);
38052 }
38058 {
38059 /* For combined target teams, ensure the num_teams and
38060 thread_limit clause expressions are evaluated on the host,
38061 before entering the target construct. */
38062 tree c;
38068 {
38077 OMP_CLAUSE_FIRSTPRIVATE);
38082 }
38083 }
38093 }
38095 {
38098 }
38100 {
38104 }
38106 {
38110 }
38112 {
38116 }
38118 {
38121 }
38122 }
38124 {
38127 }
38142 check_clauses:
38144 {
38147 {
38161 "%<#pragma omp target%> with map-type other "
38162 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
38166 }
38168 }
38170 }
38172 /* OpenACC 2.0:
38173 # pragma acc cache (variable-list) new-line
38174 */
38176 static tree
38178 {
38193 }
38195 /* OpenACC 2.0:
38196 # pragma acc data oacc-data-clause[optseq] new-line
38197 structured-block */
38199 #define OACC_DATA_CLAUSE_MASK \
38200 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38201 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38202 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38203 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38204 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38205 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38206 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
38208 static tree
38210 {
38223 }
38225 /* OpenACC 2.0:
38226 # pragma acc host_data <clauses> new-line
38227 structured-block */
38229 #define OACC_HOST_DATA_CLAUSE_MASK \
38230 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
38232 static tree
38234 {
38247 }
38249 /* OpenACC 2.0:
38250 # pragma acc declare oacc-data-clause[optseq] new-line
38251 */
38253 #define OACC_DECLARE_CLAUSE_MASK \
38254 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38255 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38256 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38257 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38258 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38259 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
38260 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
38261 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
38263 static tree
38265 {
38274 {
38278 }
38281 {
38285 {
38289 }
38292 {
38304 {
38306 "%qD must be a global variable in "
38308 decl);
38311 }
38316 {
38320 }
38322 {
38324 "invalid use of %<extern%> variable %qD "
38328 }
38330 {
38332 "invalid use of %<global%> variable %qD "
38336 }
38338 }
38343 {
38348 }
38351 {
38352 tree id;
38356 else
38362 {
38365 {
38368 {
38372 }
38373 }
38374 }
38375 }
38376 }
38389 }
38391 /* OpenACC 2.0:
38392 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
38394 or
38396 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
38398 LOC is the location of the #pragma token.
38399 */
38401 #define OACC_ENTER_DATA_CLAUSE_MASK \
38402 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38403 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38404 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38405 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38406 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38408 #define OACC_EXIT_DATA_CLAUSE_MASK \
38409 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38410 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
38413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
38414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38416 static tree
38419 {
38428 {
38433 }
38440 else
38445 {
38449 }
38457 }
38459 /* OpenACC 2.0:
38460 # pragma acc loop oacc-loop-clause[optseq] new-line
38461 structured-block */
38463 #define OACC_LOOP_CLAUSE_MASK \
38464 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
38465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
38466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
38467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
38468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
38469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
38470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
38471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
38472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
38473 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
38475 static tree
38478 {
38487 {
38493 }
38502 }
38504 /* OpenACC 2.0:
38505 # pragma acc kernels oacc-kernels-clause[optseq] new-line
38506 structured-block
38508 or
38510 # pragma acc parallel oacc-parallel-clause[optseq] new-line
38511 structured-block
38512 */
38514 #define OACC_KERNELS_CLAUSE_MASK \
38515 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38517 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38518 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38519 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38520 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
38521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
38524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
38525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
38526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
38527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38529 #define OACC_PARALLEL_CLAUSE_MASK \
38530 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38531 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
38532 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
38533 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
38534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
38535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
38536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
38537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
38538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
38540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
38541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
38542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
38543 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
38544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
38545 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
38547 static tree
38550 {
38551 omp_clause_mask mask;
38554 {
38567 }
38570 {
38574 {
38577 tree clauses;
38579 if_p);
38581 }
38582 }
38591 }
38593 /* OpenACC 2.0:
38594 # pragma acc update oacc-update-clause[optseq] new-line
38595 */
38597 #define OACC_UPDATE_CLAUSE_MASK \
38598 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
38599 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
38600 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
38601 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
38602 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
38603 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
38605 static tree
38607 {
38614 {
38616 "%<#pragma acc update%> must contain at least one "
38619 }
38627 }
38629 /* OpenACC 2.0:
38630 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
38632 LOC is the location of the #pragma token.
38633 */
38635 #define OACC_WAIT_CLAUSE_MASK \
38636 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
38638 static tree
38640 {
38654 }
38656 /* OpenMP 4.0:
38657 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
38659 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
38660 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
38661 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
38662 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
38663 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
38664 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
38665 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
38667 static void
38670 {
38672 cp_omp_declare_simd_data data;
38674 {
38679 /* It is safe to take the address of a local variable; it will only be
38680 used while this scope is live. */
38682 }
38684 /* Store away all pragma tokens. */
38696 {
38700 {
38713 }
38718 "%<#pragma omp declare simd%> not immediately followed by "
38722 }
38723 }
38725 /* Finalize #pragma omp declare simd clauses after direct declarator has
38726 been parsed, and put that into "omp declare simd" attribute. */
38728 static tree
38730 {
38736 {
38740 }
38745 {
38763 }
38767 }
38770 /* OpenMP 4.0:
38771 # pragma omp declare target new-line
38772 declarations and definitions
38773 # pragma omp end declare target new-line
38775 OpenMP 4.5:
38776 # pragma omp declare target ( extended-list ) new-line
38778 # pragma omp declare target declare-target-clauses[seq] new-line */
38780 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
38781 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
38782 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
38784 static void
38786 {
38789 clauses
38793 {
38795 clauses);
38798 }
38799 else
38800 {
38804 }
38807 "%<#pragma omp declare target%> with clauses in between "
38808 "%<#pragma omp declare target%> without clauses and "
38811 {
38817 {
38820 }
38821 else
38824 {
38826 "%qD specified both in declare target %<link%> and %<to%>"
38829 }
38831 {
38838 {
38841 {
38845 }
38846 }
38847 }
38848 }
38849 }
38851 static void
38853 {
38856 {
38859 }
38861 {
38865 {
38868 }
38871 else
38872 {
38876 }
38877 }
38878 else
38879 {
38883 }
38887 "%<#pragma omp end declare target%> without corresponding "
38889 else
38891 }
38893 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
38894 expression and optional initializer clause of
38895 #pragma omp declare reduction. We store the expression(s) as
38896 either 3, 6 or 7 special statements inside of the artificial function's
38897 body. The first two statements are DECL_EXPRs for the artificial
38898 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
38899 expression that uses those variables.
38900 If there was any INITIALIZER clause, this is followed by further statements,
38901 the fourth and fifth statements are DECL_EXPRs for the artificial
38902 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
38903 constructor variant (first token after open paren is not omp_priv),
38904 then the sixth statement is a statement with the function call expression
38905 that uses the OMP_PRIV and optionally OMP_ORIG variable.
38906 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
38907 to initialize the OMP_PRIV artificial variable and there is seventh
38908 statement, a DECL_EXPR of the OMP_PRIV statement again. */
38910 static bool
38912 {
38924 tree combiner;
38939 {
38942 }
38945 {
38947 matching_parens parens;
38953 {
38956 }
38972 {
38976 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
38980 == CPP_CLOSE_PAREN
38983 {
38987 }
38992 }
38993 else
38994 {
39010 {
39015 }
39017 tree arg;
39030 }
39041 }
39045 UNKNOWN_LOCATION);
39048 }
39050 /* OpenMP 4.0
39051 #pragma omp declare reduction (reduction-id : typename-list : expression) \
39052 initializer-clause[opt] new-line
39054 initializer-clause:
39055 initializer (omp_priv initializer)
39056 initializer (function-name (argument-list)) */
39058 static void
39061 {
39071 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
39078 {
39110 }
39122 /* Types may not be defined in declare reduction type list. */
39125 parser->type_definition_forbidden_message
39131 saved_colon_doesnt_start_class_def_p
39136 {
39140 ;
39159 else
39164 else
39166 }
39168 /* Restore the saved message. */
39171 parser->colon_doesnt_start_class_def_p
39176 {
39177 fail:
39180 }
39186 {
39187 tree fntype
39190 NULL_TREE);
39210 {
39215 }
39217 {
39219 {
39228 }
39235 }
39236 else
39237 {
39240 }
39243 else
39246 {
39249 }
39251 {
39254 else
39259 }
39264 else
39265 {
39274 }
39281 }
39285 done:
39286 /* Free any declarators allocated. */
39288 }
39290 /* OpenMP 4.0
39291 #pragma omp declare simd declare-simd-clauses[optseq] new-line
39292 #pragma omp declare reduction (reduction-id : typename-list : expression) \
39293 initializer-clause[opt] new-line
39294 #pragma omp declare target new-line */
39296 static bool
39299 {
39301 {
39306 {
39309 context);
39311 }
39314 {
39317 context);
39319 }
39321 {
39324 }
39326 {
39330 }
39331 }
39336 }
39338 /* OpenMP 5.0
39339 #pragma omp requires clauses[optseq] new-line */
39341 static bool
39343 {
39349 {
39356 {
39371 {
39374 matching_parens parens;
39376 {
39378 {
39383 this_req
39386 this_req
39389 this_req
39391 }
39393 {
39395 "expected %<seq_cst%>, %<relaxed%> or "
39398 CPP_CLOSE_PAREN))
39400 }
39401 else
39408 /*consume_paren=*/
39412 {
39415 }
39416 }
39418 }
39419 else
39420 {
39422 "%<unified_shared_memory%>, "
39423 "%<dynamic_allocators%>, "
39424 "%<reverse_offload%> "
39428 }
39435 {
39437 {
39444 }
39446 {
39450 }
39453 {
39456 this_req
39458 (omp_requires_mask
39460 }
39464 "lexically after first %<atomic%> construct "
39467 omp_requires_mask
39470 }
39471 }
39473 }
39479 }
39482 /* OpenMP 4.5:
39483 #pragma omp taskloop taskloop-clause[optseq] new-line
39484 for-loop
39486 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
39487 for-loop */
39489 #define OMP_TASKLOOP_CLAUSE_MASK \
39490 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
39491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
39492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
39493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
39494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
39495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
39496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
39497 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
39498 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
39499 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
39500 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
39501 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
39502 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
39503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY) \
39504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
39505 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IN_REDUCTION))
39507 static tree
39511 {
39518 /* #pragma omp parallel master taskloop{, simd} disallow in_reduction
39519 clause. */
39524 {
39529 {
39553 }
39554 }
39556 {
39559 }
39564 {
39567 }
39574 if_p);
39580 }
39583 /* OpenACC 2.0:
39584 # pragma acc routine oacc-routine-clause[optseq] new-line
39585 function-definition
39587 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
39588 */
39590 #define OACC_ROUTINE_CLAUSE_MASK \
39591 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
39592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
39593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
39594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
39597 /* Parse the OpenACC routine pragma. This has an optional '( name )'
39598 component, which must resolve to a declared namespace-scope
39599 function. The clauses are either processed directly (for a named
39600 function), or defered until the immediatley following declaration
39601 is parsed. */
39603 static void
39606 {
39608 /* The checking for "another pragma following this one" in the "no optional
39609 '( name )'" case makes sure that we dont re-enter. */
39612 cp_oacc_routine_data data;
39618 /* It is safe to take the address of a local variable; it will only be
39619 used while this scope is live. */
39622 /* Look for optional '( name )'. */
39624 {
39625 matching_parens parens;
39628 /* We parse the name as an id-expression. If it resolves to
39629 anything other than a non-overloaded function at namespace
39630 scope, it's an error. */
39646 {
39650 }
39652 data.clauses
39660 {
39665 }
39667 /* Perhaps we should use the same rule as declarations in different
39668 namespaces? */
39670 {
39675 }
39678 {
39682 }
39686 }
39688 {
39689 /* Store away all pragma tokens. */
39700 /* Emit a helpful diagnostic if there's another pragma following this
39701 one. */
39703 {
39706 /* ..., and then just keep going. */
39708 }
39710 /* We only have to consider the pragma_external case here. */
39715 else
39718 }
39719 }
39721 /* Finalize #pragma acc routine clauses after direct declarator has
39722 been parsed. */
39724 static tree
39726 {
39731 {
39733 "%<#pragma acc routine%> not immediately followed by "
39736 }
39753 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
39754 fndecl_seen. */
39757 }
39759 /* Apply any saved OpenACC routine clauses to a just-parsed
39760 declaration. */
39762 static void
39764 {
39766 {
39767 /* Keep going if we're in error reporting mode. */
39773 {
39775 "%<#pragma acc routine%> not immediately followed by"
39779 }
39781 {
39784 }
39787 {
39792 }
39795 {
39803 }
39805 /* Process the routine's dimension clauses. */
39809 /* Add an "omp declare target" attribute. */
39814 /* Don't unset parser->oacc_routine here: we may still need it to
39815 diagnose wrong usage. But, remember that we've used this "#pragma acc
39816 routine". */
39818 }
39819 }
39821 /* Main entry point to OpenMP statement pragmas. */
39823 static void
39825 {
39826 tree stmt;
39831 {
39854 if_p);
39859 if_p);
39876 if_p);
39881 if_p);
39886 if_p);
39891 if_p);
39900 if_p);
39914 if_p);
39919 if_p);
39923 }
39926 }
39927 \f
39928 /* Transactional Memory parsing routines. */
39930 /* Parse a transaction attribute.
39932 txn-attribute:
39933 attribute
39934 [ [ identifier ] ]
39936 We use this instead of cp_parser_attributes_opt for transactions to avoid
39937 the pedwarn in C++98 mode. */
39939 static tree
39941 {
39956 {
39960 /* For keywords, use the canonical spelling,
39961 not the parsed identifier. */
39965 }
39966 else
39970 error1:
39973 }
39975 /* Parse a __transaction_atomic or __transaction_relaxed statement.
39977 transaction-statement:
39978 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
39979 compound-statement
39980 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
39981 */
39983 static tree
39985 {
39996 else
39997 {
40001 }
40003 /* Parse a noexcept specification. */
40007 {
40008 /* cancel-and-throw is unimplemented. */
40011 }
40012 else
40015 /* Keep track if we're in the lexical scope of an outer transaction. */
40027 }
40029 /* Parse a __transaction_atomic or __transaction_relaxed expression.
40031 transaction-expression:
40032 __transaction_atomic txn-noexcept-spec[opt] ( expression )
40033 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
40034 */
40036 static tree
40038 {
40051 keyword == RID_TRANSACTION_RELAXED
40065 /* Set this early. This might mean that we allow transaction_cancel in
40066 an expression that we find out later actually has to be a constexpr.
40067 However, we expect that cxx_constant_value will be able to deal with
40068 this; also, if the noexcept has no constexpr, then what we parse next
40069 really is a transaction's body. */
40072 /* Parse a noexcept specification. */
40078 {
40079 matching_parens parens;
40086 }
40087 else
40088 {
40089 /* The only expression that is available got parsed for the noexcept
40090 already. noexcept is true then. */
40093 }
40102 }
40104 /* Parse a function-transaction-block.
40106 function-transaction-block:
40107 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
40108 function-body
40109 __transaction_atomic txn-attribute[opt] function-try-block
40110 __transaction_relaxed ctor-initializer[opt] function-body
40111 __transaction_relaxed function-try-block
40112 */
40114 static void
40116 {
40131 else
40132 {
40136 }
40144 else
40145 cp_parser_ctor_initializer_opt_and_function_body
40151 }
40153 /* Parse a __transaction_cancel statement.
40155 cancel-statement:
40156 __transaction_cancel txn-attribute[opt] ;
40157 __transaction_cancel txn-attribute[opt] throw-expression ;
40159 ??? Cancel and throw is not yet implemented. */
40161 static tree
40163 {
40169 RT_TRANSACTION_CANCEL);
40176 /* ??? Parse cancel-and-throw here. */
40181 {
40185 }
40187 {
40191 }
40193 {
40196 {
40202 }
40203 }
40205 {
40209 }
40215 }
40216 \f
40217 /* The parser. */
40221 \f
40222 /* Special handling for the first token or line in the file. The first
40223 thing in the file might be #pragma GCC pch_preprocess, which loads a
40224 PCH file, which is a GC collection point. So we need to handle this
40225 first pragma without benefit of an existing lexer structure.
40227 Always returns one token to the caller in *FIRST_TOKEN. This is
40228 either the true first token of the file, or the first token after
40229 the initial pragma. */
40231 static void
40233 {
40242 {
40249 }
40250 else
40253 /* Skip to the end of the pragma. */
40257 /* Now actually load the PCH file. */
40261 /* Read one more token to return to our caller. We have to do this
40262 after reading the PCH file in, since its pointers have to be
40263 live. */
40265 }
40267 /* Parse a pragma GCC ivdep. */
40269 static bool
40271 {
40274 }
40276 /* Parse a pragma GCC unroll. */
40278 static unsigned short
40280 {
40290 {
40292 " assignment-expression that evaluates to a non-negative"
40295 }
40296 else
40297 {
40301 }
40304 }
40306 /* Normal parsing of a pragma token. Here we can (and must) use the
40307 regular lexer. */
40309 static bool
40311 {
40314 tree stmt;
40325 {
40333 {
40343 }
40348 {
40358 }
40363 {
40373 }
40378 {
40389 }
40394 {
40405 }
40410 {
40421 }
40441 {
40446 }
40454 {
40459 }
40467 {
40471 }
40477 {
40482 }
40490 {
40495 }
40553 "%<#pragma omp section%> may only be used in "
40558 {
40560 {
40564 }
40570 {
40574 }
40575 else
40581 {
40584 }
40587 }
40590 {
40592 {
40596 }
40597 const unsigned short unroll
40603 {
40607 }
40608 else
40614 {
40617 }
40620 }
40627 bad_stmt:
40630 }
40634 }
40636 /* The interface the pragma parsers have to the lexer. */
40638 enum cpp_ttype
40640 {
40652 else
40653 {
40657 }
40660 }
40662 \f
40663 /* External interface. */
40665 /* Parse one entire translation unit. */
40667 void
40669 {
40684 }
40686 /* Create an identifier for a generic parameter type (a synthesized
40687 template parameter implied by `auto' or a concept identifier). */
40690 static tree
40692 {
40696 }
40698 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
40699 (creating a new template parameter list if necessary). Returns the newly
40700 created template type parm. */
40702 static tree
40704 {
40707 /* Before committing to modifying any scope, if we're in an
40708 implicit template scope, and we're trying to synthesize a
40709 constrained parameter, try to find a previous parameter with
40710 the same name. This is the same-type rule for abbreviated
40711 function templates.
40713 NOTE: We can generate implicit parameters when tentatively
40714 parsing a nested name specifier, only to reject that parse
40715 later. However, matching the same template-id as part of a
40716 direct-declarator should generate an identical template
40717 parameter, so this rule will merge them. */
40719 {
40722 {
40724 {
40727 /* Return the TEMPLATE_PARM_INDEX. */
40730 }
40732 }
40733 }
40735 /* We are either continuing a function template that already contains implicit
40736 template parameters, creating a new fully-implicit function template, or
40737 extending an existing explicit function template with implicit template
40738 parameters. */
40746 {
40750 }
40751 else
40752 {
40753 /* Roll back to the existing template parameter scope (in the case of
40754 extending an explicit function template) or introduce a new template
40755 parameter scope ahead of the function parameter scope (or class scope
40756 in the case of out-of-line member definitions). The function scope is
40757 added back after template parameter synthesis below. */
40762 {
40765 }
40767 {
40768 /* If not defining a class, then any class scope is a scope level in
40769 an out-of-line member definition. In this case simply wind back
40770 beyond the first such scope to inject the template parameter list.
40771 Otherwise wind back to the class being defined. The latter can
40772 occur in class member friend declarations such as:
40774 class A {
40775 void foo (auto);
40776 };
40777 class B {
40778 friend void A::foo (auto);
40779 };
40781 The template parameter list synthesized for the friend declaration
40782 must be injected in the scope of 'B'. This can also occur in
40783 erroneous cases such as:
40785 struct A {
40786 struct B {
40787 void foo (auto);
40788 };
40789 void B::foo (auto) {}
40790 };
40792 Here the attempted definition of 'B::foo' within 'A' is ill-formed
40793 but, nevertheless, the template parameter list synthesized for the
40794 declarator should be injected into the scope of 'A' as if the
40795 ill-formed template was specified explicitly. */
40798 {
40801 }
40802 }
40808 {
40809 /* Introduce a new template parameter list for implicit template
40810 parameters. */
40814 parser->implicit_template_scope
40821 }
40822 else
40823 {
40824 /* Synthesize implicit template parameters at the end of the explicit
40825 template parameter list. */
40832 parser->implicit_template_parms
40834 }
40835 }
40837 /* Synthesize a new template parameter and track the current template
40838 parameter chain with implicit_template_parms. */
40842 tree synth_tmpl_parm;
40846 synth_tmpl_parm
40849 synth_tmpl_parm
40851 else
40852 {
40856 }
40858 // Attach the constraint to the parm before processing.
40861 tree new_parm
40863 input_location,
40864 node,
40868 // Chain the new parameter to the list of implicit parameters.
40870 parser->implicit_template_parms
40872 else
40877 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
40880 /* If creating a fully implicit function template, start the new implicit
40881 template parameter list with this synthesized type, otherwise grow the
40882 current template parameter list. */
40885 {
40892 }
40893 else
40894 {
40899 }
40901 // If the new parameter was constrained, we need to add that to the
40902 // constraints in the template parameter list.
40904 {
40908 }
40913 }
40915 /* Finish the declaration of a fully implicit function template. Such a
40916 template has no explicit template parameter list so has not been through the
40917 normal template head and tail processing. synthesize_implicit_template_parm
40918 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
40919 provided if the declaration is a class member such that its template
40920 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
40921 form is returned. Otherwise NULL_TREE is returned. */
40923 static tree
40925 {
40930 {
40934 }
40946 }
40948 /* Like finish_fully_implicit_template, but to be used in error
40949 recovery, rearranging scopes so that we restore the state we had
40950 before synthesize_implicit_template_parm inserted the implement
40951 template parms scope. */
40953 static void
40955 {
40960 {
40969 }
40970 else
40976 }
40978 /* Helper function for diagnostics that have complained about things
40979 being used with 'extern "C"' linkage.
40981 Attempt to issue a note showing where the 'extern "C"' linkage began. */
40983 void
40985 {
40989 }