| blob | c2bd4421e14ec638ca3b2f7991b00f6b571f3c48 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2016 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/>. */
46 \f
47 /* The lexer. */
49 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
50 and c-lex.c) and the C++ parser. */
53 {
55 };
57 /* The various kinds of non integral constant we encounter. */
59 NIC_NONE,
60 /* floating-point literal */
61 NIC_FLOAT,
62 /* %<this%> */
63 NIC_THIS,
64 /* %<__FUNCTION__%> */
65 NIC_FUNC_NAME,
66 /* %<__PRETTY_FUNCTION__%> */
67 NIC_PRETTY_FUNC,
68 /* %<__func__%> */
69 NIC_C99_FUNC,
70 /* "%<va_arg%> */
71 NIC_VA_ARG,
72 /* a cast */
73 NIC_CAST,
74 /* %<typeid%> operator */
75 NIC_TYPEID,
76 /* non-constant compound literals */
77 NIC_NCC,
78 /* a function call */
79 NIC_FUNC_CALL,
80 /* an increment */
81 NIC_INC,
82 /* an decrement */
83 NIC_DEC,
84 /* an array reference */
85 NIC_ARRAY_REF,
86 /* %<->%> */
87 NIC_ARROW,
88 /* %<.%> */
89 NIC_POINT,
90 /* the address of a label */
91 NIC_ADDR_LABEL,
92 /* %<*%> */
93 NIC_STAR,
94 /* %<&%> */
95 NIC_ADDR,
96 /* %<++%> */
97 NIC_PREINCREMENT,
98 /* %<--%> */
99 NIC_PREDECREMENT,
100 /* %<new%> */
101 NIC_NEW,
102 /* %<delete%> */
103 NIC_DEL,
104 /* calls to overloaded operators */
105 NIC_OVERLOADED,
106 /* an assignment */
107 NIC_ASSIGNMENT,
108 /* a comma operator */
109 NIC_COMMA,
110 /* a call to a constructor */
111 NIC_CONSTRUCTOR,
112 /* a transaction expression */
113 NIC_TRANSACTION
114 };
116 /* The various kinds of errors about name-lookup failing. */
118 /* NULL */
119 NLE_NULL,
120 /* is not a type */
121 NLE_TYPE,
122 /* is not a class or namespace */
123 NLE_CXX98,
124 /* is not a class, namespace, or enumeration */
125 NLE_NOT_CXX98
126 };
128 /* The various kinds of required token */
130 RT_NONE,
152 /* The type is CPP_KEYWORD */
181 RT_TRANSACTION_CANCEL /* __transaction_cancel */
182 };
184 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
185 reverting it on destruction. */
187 class type_id_in_expr_sentinel
188 {
198 };
200 /* Prototypes. */
206 static void cp_lexer_destroy
208 static int cp_lexer_saving_tokens
212 static void cp_lexer_get_preprocessor_token
220 static bool cp_lexer_next_token_is_not
222 static bool cp_lexer_next_token_is_keyword
226 static void cp_lexer_purge_token
228 static void cp_lexer_purge_tokens_after
230 static void cp_lexer_save_tokens
232 static void cp_lexer_commit_tokens
234 static void cp_lexer_rollback_tokens
236 static void cp_lexer_print_token
240 static void cp_lexer_start_debugging
242 static void cp_lexer_stop_debugging
248 static void cp_parser_initial_pragma
251 static tree cp_literal_operator_id
254 static void cp_parser_cilk_simd
256 static tree cp_parser_cilk_for
258 static bool cp_parser_omp_declare_reduction_exprs
260 static tree cp_parser_cilk_simd_vectorlength
262 static void cp_finalize_oacc_routine
265 /* Manifest constants. */
266 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
267 #define CP_SAVED_TOKEN_STACK 5
269 /* Variables. */
271 /* The stream to which debugging output should be written. */
274 /* Nonzero if we are parsing an unevaluated operand: an operand to
275 sizeof, typeof, or alignof. */
278 /* Dump up to NUM tokens in BUFFER to FILE starting with token
279 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
280 first token in BUFFER. If NUM is 0, dump all the tokens. If
281 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
282 highlighted by surrounding it in [[ ]]. */
284 static void
288 {
305 {
308 }
313 {
320 nprinted++;
330 {
340 }
341 }
344 {
347 }
350 }
353 /* Dump all tokens in BUFFER to stderr. */
355 void
357 {
359 }
361 DEBUG_FUNCTION void
363 {
365 }
367 DEBUG_FUNCTION void
369 {
372 else
374 }
377 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
378 description for T. */
380 static void
382 {
384 {
387 }
388 }
391 /* Dump parser context C to FILE. */
393 static void
395 {
400 }
403 /* Print the stack of parsing contexts to FILE starting with FIRST. */
405 static void
407 {
413 {
416 }
417 }
420 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
422 static void
424 {
427 }
430 /* Print an unparsed function entry UF to FILE. */
432 static void
434 {
437 tree fn;
442 i++)
443 {
449 }
454 {
457 }
463 {
466 }
468 }
471 /* Print the stack of unparsed member functions S to FILE. */
473 static void
476 {
482 {
485 }
486 }
489 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
490 the given PARSER. If FILE is NULL, the output is printed on stderr. */
492 static void
494 {
506 next_token);
507 }
510 /* Dump debugging information for the given PARSER. If FILE is NULL,
511 the output is printed on stderr. */
513 void
515 {
518 expanded_location eloc;
596 }
598 DEBUG_FUNCTION void
600 {
602 }
604 DEBUG_FUNCTION void
606 {
609 else
611 }
613 /* Allocate memory for a new lexer object and return it. */
617 {
622 /* Allocate the memory. */
625 /* Initially we are not debugging. */
630 /* Create the buffer. */
634 }
637 /* Create a new main C++ lexer, the lexer that gets tokens from the
638 preprocessor. */
642 {
644 cp_token token;
646 /* It's possible that parsing the first pragma will load a PCH file,
647 which is a GC collection point. So we have to do that before
648 allocating any memory. */
653 /* Put the first token in the buffer. */
656 /* Get the remaining tokens from the preprocessor. */
658 {
661 }
670 /* Subsequent preprocessor diagnostics should use compiler
671 diagnostic functions to get the compiler source location. */
676 }
678 /* Create a new lexer whose token stream is primed with the tokens in
679 CACHE. When these tokens are exhausted, no new tokens will be read. */
683 {
688 /* We do not own the buffer. */
695 /* Initially we are not debugging. */
700 }
702 /* Frees all resources associated with LEXER. */
704 static void
706 {
710 }
712 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
713 be used. The point of this flag is to help the compiler to fold away calls
714 to cp_lexer_debugging_p within this source file at compile time, when the
715 lexer is not being debugged. */
717 #define LEXER_DEBUGGING_ENABLED_P false
719 /* Returns nonzero if debugging information should be output. */
723 {
728 }
733 {
737 }
741 {
743 }
747 {
749 }
753 {
756 else
758 }
762 {
765 /* Skip past purged tokens. */
767 {
769 tp--;
770 }
773 }
775 /* nonzero if we are presently saving tokens. */
779 {
781 }
783 /* Store the next token from the preprocessor in *TOKEN. Return true
784 if we reach EOF. If LEXER is NULL, assume we are handling an
785 initial #pragma pch_preprocess, and thus want the lexer to return
786 processed strings. */
788 static void
790 {
793 /* Get a new token from the preprocessor. */
794 token->type
801 /* On some systems, some header files are surrounded by an
802 implicit extern "C" block. Set a flag in the token if it
803 comes from such a header. */
808 /* Check to see if this token is a keyword. */
810 {
812 {
813 /* Mark this token as a keyword. */
815 /* Record which keyword. */
817 }
818 else
819 {
823 {
824 /* Warn about the C++0x keyword (but still treat it as
825 an identifier). */
830 /* Clear out the C_RID_CODE so we don't warn about this
831 particular identifier-turned-keyword again. */
833 }
836 }
837 }
839 {
840 /* This only happens in Objective-C++; it must be a keyword. */
843 {
844 /* Replace 'class' with '@class', 'private' with '@private',
845 etc. This prevents confusion with the C++ keyword
846 'class', and makes the tokens consistent with other
847 Objective-C 'AT' keywords. For example '@class' is
848 reported as RID_AT_CLASS which is consistent with
849 '@synchronized', which is reported as
850 RID_AT_SYNCHRONIZED.
851 */
861 }
862 }
863 }
865 /* Update the globals input_location and the input file stack from TOKEN. */
868 {
870 {
872 }
873 }
875 /* Update the globals input_location and the input file stack from LEXER. */
878 {
881 }
883 /* Return a pointer to the next token in the token stream, but do not
884 consume it. */
888 {
890 {
894 }
896 }
898 /* Return true if the next token has the indicated TYPE. */
902 {
904 }
906 /* Return true if the next token does not have the indicated TYPE. */
910 {
912 }
914 /* Return true if the next token is the indicated KEYWORD. */
918 {
920 }
924 {
926 }
930 {
932 }
934 /* Return true if the next token is not the indicated KEYWORD. */
938 {
940 }
942 /* Return true if KEYWORD can start a decl-specifier. */
944 bool
946 {
948 {
949 /* auto specifier: storage-class-specifier in C++,
950 simple-type-specifier in C++0x. */
952 /* Storage classes. */
958 /* Elaborated type specifiers. */
964 /* Simple type specifiers. */
978 /* GNU extensions. */
981 /* C++0x extensions. */
993 }
994 }
996 /* Return true if the next token is a keyword for a decl-specifier. */
998 static bool
1000 {
1005 }
1007 /* Returns TRUE iff the token T begins a decltype type. */
1009 static bool
1011 {
1014 }
1016 /* Returns TRUE iff the next token begins a decltype type. */
1018 static bool
1020 {
1023 }
1025 /* Called when processing a token with tree_check_value; perform or defer the
1026 associated checks and return the value. */
1028 static tree
1030 {
1031 /* Perform any access checks that were deferred. */
1036 {
1042 }
1043 /* Return the stored value. */
1045 }
1047 /* Return a pointer to the Nth token in the token stream. If N is 1,
1048 then this is precisely equivalent to cp_lexer_peek_token (except
1049 that it is not inline). One would like to disallow that case, but
1050 there is one case (cp_parser_nth_token_starts_template_id) where
1051 the caller passes a variable for N and it might be 1. */
1055 {
1058 /* N is 1-based, not zero-based. */
1069 {
1072 {
1075 }
1079 }
1082 {
1085 }
1088 }
1090 /* Return the next token, and advance the lexer's next_token pointer
1091 to point to the next non-purged token. */
1095 {
1101 do
1102 {
1105 {
1108 }
1110 }
1115 /* Provide debugging output. */
1117 {
1121 }
1124 }
1126 /* Permanently remove the next token from the token stream, and
1127 advance the next_token pointer to refer to the next non-purged
1128 token. */
1130 static void
1132 {
1141 do
1142 {
1143 tok++;
1145 {
1148 }
1149 }
1152 }
1154 /* Permanently remove all tokens after TOK, up to, but not
1155 including, the token that will be returned next by
1156 cp_lexer_peek_token. */
1158 static void
1160 {
1169 {
1174 }
1175 }
1177 /* Begin saving tokens. All tokens consumed after this point will be
1178 preserved. */
1180 static void
1182 {
1183 /* Provide debugging output. */
1188 }
1190 /* Commit to the portion of the token stream most recently saved. */
1192 static void
1194 {
1195 /* Provide debugging output. */
1200 }
1202 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1203 to the token stream. Stop saving tokens. */
1205 static void
1207 {
1208 /* Provide debugging output. */
1213 }
1215 /* RAII wrapper around the above functions, with sanity checking. Creating
1216 a variable saves tokens, which are committed when the variable is
1217 destroyed unless they are explicitly rolled back by calling the rollback
1218 member function. */
1220 struct saved_token_sentinel
1221 {
1226 {
1229 }
1231 {
1234 }
1236 {
1240 }
1241 };
1243 /* Print a representation of the TOKEN on the STREAM. */
1245 static void
1247 {
1248 /* We don't use cpp_type2name here because the parser defines
1249 a few tokens of its own. */
1251 /* cpplib-defined token types */
1252 #define OP(e, s) #e,
1253 #define TK(e, s) #e,
1254 TTYPE_TABLE
1255 #undef OP
1256 #undef TK
1257 /* C++ parser token types - see "Manifest constants", above. */
1261 };
1263 /* For some tokens, print the associated data. */
1265 {
1267 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1268 For example, `struct' is mapped to an INTEGER_CST. */
1271 /* fall through */
1289 /* If we have a name for the token, print it out. Otherwise, we
1290 simply give the numeric code. */
1293 else
1296 }
1297 }
1299 DEBUG_FUNCTION void
1301 {
1304 }
1306 DEBUG_FUNCTION void
1308 {
1311 else
1313 }
1316 /* Start emitting debugging information. */
1318 static void
1320 {
1327 }
1329 /* Stop emitting debugging information. */
1331 static void
1333 {
1340 }
1342 /* Create a new cp_token_cache, representing a range of tokens. */
1346 {
1351 }
1353 /* Diagnose if #pragma omp declare simd isn't followed immediately
1354 by function declaration or definition. */
1358 {
1360 {
1364 }
1365 }
1367 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1368 and put that into "omp declare simd" attribute. */
1372 {
1374 {
1376 {
1379 }
1381 {
1384 }
1385 }
1386 }
1388 /* Diagnose if #pragma acc routine isn't followed immediately by function
1389 declaration or definition. */
1393 {
1395 {
1397 "%<#pragma acc routine%> not immediately followed by "
1400 }
1401 }
1402 \f
1403 /* Decl-specifiers. */
1405 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1407 static void
1409 {
1411 }
1413 /* Declarators. */
1415 /* Nothing other than the parser should be creating declarators;
1416 declarators are a semi-syntactic representation of C++ entities.
1417 Other parts of the front end that need to create entities (like
1418 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1421 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1431 /* An erroneous declarator. */
1434 /* The obstack on which declarators and related data structures are
1435 allocated. */
1438 /* Alloc BYTES from the declarator memory pool. */
1442 {
1444 }
1446 /* Allocate a declarator of the indicated KIND. Clear fields that are
1447 common to all declarators. */
1451 {
1463 }
1465 /* Make a declarator for a generalized identifier. If
1466 QUALIFYING_SCOPE is non-NULL, the identifier is
1467 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1468 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1469 is, if any. */
1473 special_function_kind sfk)
1474 {
1477 /* It is valid to write:
1479 class C { void f(); };
1480 typedef C D;
1481 void D::f();
1483 The standard is not clear about whether `typedef const C D' is
1484 legal; as of 2002-09-15 the committee is considering that
1485 question. EDG 3.0 allows that syntax. Therefore, we do as
1486 well. */
1500 }
1502 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1503 of modifiers such as const or volatile to apply to the pointer
1504 type, represented as identifiers. ATTRIBUTES represent the attributes that
1505 appertain to the pointer or reference. */
1507 cp_declarator *
1509 tree attributes)
1510 {
1518 {
1522 }
1523 else
1529 }
1531 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1532 represent the attributes that appertain to the pointer or
1533 reference. */
1535 cp_declarator *
1538 {
1546 {
1550 }
1551 else
1557 }
1559 /* Like make_pointer_declarator -- but for a pointer to a non-static
1560 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1561 appertain to the pointer or reference. */
1563 cp_declarator *
1566 tree attributes)
1567 {
1576 {
1579 }
1580 else
1586 }
1588 /* Make a declarator for the function given by TARGET, with the
1589 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1590 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1591 indicates what exceptions can be thrown. */
1593 cp_declarator *
1595 tree parms,
1596 cp_cv_quals cv_qualifiers,
1597 cp_virt_specifiers virt_specifiers,
1598 cp_ref_qualifier ref_qualifier,
1599 tree tx_qualifier,
1600 tree exception_specification,
1601 tree late_return_type,
1602 tree requires_clause)
1603 {
1617 {
1621 }
1622 else
1626 }
1628 /* Make a declarator for an array of BOUNDS elements, each of which is
1629 defined by ELEMENT. */
1631 cp_declarator *
1633 {
1640 {
1644 }
1645 else
1649 }
1651 /* Determine whether the declarator we've seen so far can be a
1652 parameter pack, when followed by an ellipsis. */
1653 static bool
1655 {
1657 /* We already saw an ellipsis. */
1660 /* Search for a declarator name, or any other declarator that goes
1661 after the point where the ellipsis could appear in a parameter
1662 pack. If we find any of these, then this declarator can not be
1663 made into a parameter pack. */
1666 {
1668 {
1680 }
1681 }
1684 }
1688 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1689 DECLARATOR and DEFAULT_ARGUMENT. */
1691 cp_parameter_declarator *
1694 tree default_argument,
1696 {
1704 else
1711 }
1713 /* Returns true iff DECLARATOR is a declaration for a function. */
1715 static bool
1717 {
1719 {
1727 }
1729 }
1731 /* The parser. */
1733 /* Overview
1734 --------
1736 A cp_parser parses the token stream as specified by the C++
1737 grammar. Its job is purely parsing, not semantic analysis. For
1738 example, the parser breaks the token stream into declarators,
1739 expressions, statements, and other similar syntactic constructs.
1740 It does not check that the types of the expressions on either side
1741 of an assignment-statement are compatible, or that a function is
1742 not declared with a parameter of type `void'.
1744 The parser invokes routines elsewhere in the compiler to perform
1745 semantic analysis and to build up the abstract syntax tree for the
1746 code processed.
1748 The parser (and the template instantiation code, which is, in a
1749 way, a close relative of parsing) are the only parts of the
1750 compiler that should be calling push_scope and pop_scope, or
1751 related functions. The parser (and template instantiation code)
1752 keeps track of what scope is presently active; everything else
1753 should simply honor that. (The code that generates static
1754 initializers may also need to set the scope, in order to check
1755 access control correctly when emitting the initializers.)
1757 Methodology
1758 -----------
1760 The parser is of the standard recursive-descent variety. Upcoming
1761 tokens in the token stream are examined in order to determine which
1762 production to use when parsing a non-terminal. Some C++ constructs
1763 require arbitrary look ahead to disambiguate. For example, it is
1764 impossible, in the general case, to tell whether a statement is an
1765 expression or declaration without scanning the entire statement.
1766 Therefore, the parser is capable of "parsing tentatively." When the
1767 parser is not sure what construct comes next, it enters this mode.
1768 Then, while we attempt to parse the construct, the parser queues up
1769 error messages, rather than issuing them immediately, and saves the
1770 tokens it consumes. If the construct is parsed successfully, the
1771 parser "commits", i.e., it issues any queued error messages and
1772 the tokens that were being preserved are permanently discarded.
1773 If, however, the construct is not parsed successfully, the parser
1774 rolls back its state completely so that it can resume parsing using
1775 a different alternative.
1777 Future Improvements
1778 -------------------
1780 The performance of the parser could probably be improved substantially.
1781 We could often eliminate the need to parse tentatively by looking ahead
1782 a little bit. In some places, this approach might not entirely eliminate
1783 the need to parse tentatively, but it might still speed up the average
1784 case. */
1786 /* Flags that are passed to some parsing functions. These values can
1787 be bitwise-ored together. */
1789 enum
1790 {
1791 /* No flags. */
1793 /* The construct is optional. If it is not present, then no error
1794 should be issued. */
1796 /* When parsing a type-specifier, treat user-defined type-names
1797 as non-type identifiers. */
1799 /* When parsing a type-specifier, do not try to parse a class-specifier
1800 or enum-specifier. */
1802 /* When parsing a decl-specifier-seq, only allow type-specifier or
1803 constexpr. */
1805 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1807 };
1809 /* This type is used for parameters and variables which hold
1810 combinations of the above flags. */
1813 /* The different kinds of declarators we want to parse. */
1815 enum cp_parser_declarator_kind
1816 {
1817 /* We want an abstract declarator. */
1818 CP_PARSER_DECLARATOR_ABSTRACT,
1819 /* We want a named declarator. */
1820 CP_PARSER_DECLARATOR_NAMED,
1821 /* We don't mind, but the name must be an unqualified-id. */
1822 CP_PARSER_DECLARATOR_EITHER
1823 };
1825 /* The precedence values used to parse binary expressions. The minimum value
1826 of PREC must be 1, because zero is reserved to quickly discriminate
1827 binary operators from other tokens. */
1829 enum cp_parser_prec
1830 {
1831 PREC_NOT_OPERATOR,
1832 PREC_LOGICAL_OR_EXPRESSION,
1833 PREC_LOGICAL_AND_EXPRESSION,
1834 PREC_INCLUSIVE_OR_EXPRESSION,
1835 PREC_EXCLUSIVE_OR_EXPRESSION,
1836 PREC_AND_EXPRESSION,
1837 PREC_EQUALITY_EXPRESSION,
1838 PREC_RELATIONAL_EXPRESSION,
1839 PREC_SHIFT_EXPRESSION,
1840 PREC_ADDITIVE_EXPRESSION,
1841 PREC_MULTIPLICATIVE_EXPRESSION,
1842 PREC_PM_EXPRESSION,
1843 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1844 };
1846 /* A mapping from a token type to a corresponding tree node type, with a
1847 precedence value. */
1849 struct cp_parser_binary_operations_map_node
1850 {
1851 /* The token type. */
1853 /* The corresponding tree code. */
1855 /* The precedence of this operator. */
1857 };
1859 struct cp_parser_expression_stack_entry
1860 {
1861 /* Left hand side of the binary operation we are currently
1862 parsing. */
1863 cp_expr lhs;
1864 /* Original tree code for left hand side, if it was a binary
1865 expression itself (used for -Wparentheses). */
1867 /* Tree code for the binary operation we are parsing. */
1869 /* Precedence of the binary operation we are parsing. */
1871 /* Location of the binary operation we are parsing. */
1872 location_t loc;
1873 };
1875 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1876 entries because precedence levels on the stack are monotonically
1877 increasing. */
1881 /* Prototypes. */
1883 /* Constructors and destructors. */
1888 /* Class variables. */
1892 /* The operator-precedence table used by cp_parser_binary_expression.
1893 Transformed into an associative array (binops_by_token) by
1894 cp_parser_new. */
1927 };
1929 /* The same as binops, but initialized by cp_parser_new so that
1930 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1931 for speed. */
1934 /* Constructors and destructors. */
1936 /* Construct a new context. The context below this one on the stack
1937 is given by NEXT. */
1941 {
1944 /* Allocate the storage. */
1946 {
1947 /* Pull the first entry from the free list. */
1951 }
1952 else
1955 /* No errors have occurred yet in this context. */
1957 /* If this is not the bottommost context, copy information that we
1958 need from the previous context. */
1960 {
1961 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1962 expression, then we are parsing one in this context, too. */
1964 /* Thread the stack. */
1966 }
1969 }
1971 /* Managing the unparsed function queues. */
1973 #define unparsed_funs_with_default_args \
1974 parser->unparsed_queues->last ().funs_with_default_args
1975 #define unparsed_funs_with_definitions \
1976 parser->unparsed_queues->last ().funs_with_definitions
1977 #define unparsed_nsdmis \
1978 parser->unparsed_queues->last ().nsdmis
1979 #define unparsed_classes \
1980 parser->unparsed_queues->last ().classes
1982 static void
1984 {
1987 }
1989 static void
1991 {
1994 }
1996 /* Prototypes. */
1998 /* Constructors and destructors. */
2003 /* Routines to parse various constructs.
2005 Those that return `tree' will return the error_mark_node (rather
2006 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2007 Sometimes, they will return an ordinary node if error-recovery was
2008 attempted, even though a parse error occurred. So, to check
2009 whether or not a parse error occurred, you should always use
2010 cp_parser_error_occurred. If the construct is optional (indicated
2011 either by an `_opt' in the name of the function that does the
2012 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2013 the construct is not present. */
2015 /* Lexical conventions [gram.lex] */
2017 static cp_expr cp_parser_identifier
2019 static cp_expr cp_parser_string_literal
2021 static cp_expr cp_parser_userdef_char_literal
2023 static tree cp_parser_userdef_string_literal
2025 static cp_expr cp_parser_userdef_numeric_literal
2028 /* Basic concepts [gram.basic] */
2030 static bool cp_parser_translation_unit
2033 /* Expressions [gram.expr] */
2035 static cp_expr cp_parser_primary_expression
2037 static cp_expr cp_parser_id_expression
2039 static cp_expr cp_parser_unqualified_id
2041 static tree cp_parser_nested_name_specifier_opt
2043 static tree cp_parser_nested_name_specifier
2045 static tree cp_parser_qualifying_entity
2047 static cp_expr cp_parser_postfix_expression
2049 static tree cp_parser_postfix_open_square_expression
2051 static tree cp_parser_postfix_dot_deref_expression
2055 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2057 static void cp_parser_pseudo_destructor_name
2059 static cp_expr cp_parser_unary_expression
2061 static enum tree_code cp_parser_unary_operator
2063 static tree cp_parser_new_expression
2067 static tree cp_parser_new_type_id
2075 static tree cp_parser_delete_expression
2077 static cp_expr cp_parser_cast_expression
2079 static cp_expr cp_parser_binary_expression
2081 static tree cp_parser_question_colon_clause
2083 static cp_expr cp_parser_assignment_expression
2085 static enum tree_code cp_parser_assignment_operator_opt
2087 static cp_expr cp_parser_expression
2089 static cp_expr cp_parser_constant_expression
2091 static cp_expr cp_parser_builtin_offsetof
2093 static cp_expr cp_parser_lambda_expression
2095 static void cp_parser_lambda_introducer
2097 static bool cp_parser_lambda_declarator_opt
2099 static void cp_parser_lambda_body
2102 /* Statements [gram.stmt.stmt] */
2104 static void cp_parser_statement
2106 static void cp_parser_label_for_labeled_statement
2108 static tree cp_parser_expression_statement
2110 static tree cp_parser_compound_statement
2112 static void cp_parser_statement_seq_opt
2114 static tree cp_parser_selection_statement
2116 static tree cp_parser_condition
2118 static tree cp_parser_iteration_statement
2120 static bool cp_parser_init_statement
2122 static tree cp_parser_for
2124 static tree cp_parser_c_for
2126 static tree cp_parser_range_for
2128 static void do_range_for_auto_deduction
2130 static tree cp_parser_perform_range_for_lookup
2132 static tree cp_parser_range_for_member_function
2134 static tree cp_parser_jump_statement
2136 static void cp_parser_declaration_statement
2139 static tree cp_parser_implicitly_scoped_statement
2141 static void cp_parser_already_scoped_statement
2144 /* Declarations [gram.dcl.dcl] */
2146 static void cp_parser_declaration_seq_opt
2148 static void cp_parser_declaration
2150 static void cp_parser_block_declaration
2152 static void cp_parser_simple_declaration
2154 static void cp_parser_decl_specifier_seq
2156 static tree cp_parser_storage_class_specifier_opt
2158 static tree cp_parser_function_specifier_opt
2160 static tree cp_parser_type_specifier
2163 static tree cp_parser_simple_type_specifier
2165 static tree cp_parser_type_name
2167 static tree cp_parser_type_name
2169 static tree cp_parser_nonclass_name
2171 static tree cp_parser_elaborated_type_specifier
2173 static tree cp_parser_enum_specifier
2175 static void cp_parser_enumerator_list
2177 static void cp_parser_enumerator_definition
2179 static tree cp_parser_namespace_name
2181 static void cp_parser_namespace_definition
2183 static void cp_parser_namespace_body
2185 static tree cp_parser_qualified_namespace_specifier
2187 static void cp_parser_namespace_alias_definition
2189 static bool cp_parser_using_declaration
2191 static void cp_parser_using_directive
2193 static tree cp_parser_alias_declaration
2195 static void cp_parser_asm_definition
2197 static void cp_parser_linkage_specification
2199 static void cp_parser_static_assert
2201 static tree cp_parser_decltype
2204 /* Declarators [gram.dcl.decl] */
2206 static tree cp_parser_init_declarator
2213 static enum tree_code cp_parser_ptr_operator
2215 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2217 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2219 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2221 static tree cp_parser_tx_qualifier_opt
2223 static tree cp_parser_late_return_type_opt
2225 static tree cp_parser_declarator_id
2227 static tree cp_parser_type_id
2229 static tree cp_parser_template_type_arg
2232 static tree cp_parser_type_id_1
2234 static void cp_parser_type_specifier_seq
2236 static tree cp_parser_parameter_declaration_clause
2238 static tree cp_parser_parameter_declaration_list
2242 static tree cp_parser_default_argument
2244 static void cp_parser_function_body
2246 static tree cp_parser_initializer
2248 static cp_expr cp_parser_initializer_clause
2250 static cp_expr cp_parser_braced_list
2255 static bool cp_parser_ctor_initializer_opt_and_function_body
2258 static tree cp_parser_late_parsing_omp_declare_simd
2261 static tree cp_parser_late_parsing_cilk_simd_fn_info
2264 static tree cp_parser_late_parsing_oacc_routine
2267 static tree synthesize_implicit_template_parm
2269 static tree finish_fully_implicit_template
2272 /* Classes [gram.class] */
2274 static tree cp_parser_class_name
2276 static tree cp_parser_class_specifier
2278 static tree cp_parser_class_head
2280 static enum tag_types cp_parser_class_key
2282 static void cp_parser_type_parameter_key
2284 static void cp_parser_member_specification_opt
2286 static void cp_parser_member_declaration
2288 static tree cp_parser_pure_specifier
2290 static tree cp_parser_constant_initializer
2293 /* Derived classes [gram.class.derived] */
2295 static tree cp_parser_base_clause
2297 static tree cp_parser_base_specifier
2300 /* Special member functions [gram.special] */
2302 static tree cp_parser_conversion_function_id
2304 static tree cp_parser_conversion_type_id
2308 static bool cp_parser_ctor_initializer_opt
2310 static void cp_parser_mem_initializer_list
2312 static tree cp_parser_mem_initializer
2314 static tree cp_parser_mem_initializer_id
2317 /* Overloading [gram.over] */
2319 static cp_expr cp_parser_operator_function_id
2321 static cp_expr cp_parser_operator
2324 /* Templates [gram.temp] */
2326 static void cp_parser_template_declaration
2328 static tree cp_parser_template_parameter_list
2330 static tree cp_parser_template_parameter
2332 static tree cp_parser_type_parameter
2334 static tree cp_parser_template_id
2336 static tree cp_parser_template_name
2338 static tree cp_parser_template_argument_list
2340 static tree cp_parser_template_argument
2342 static void cp_parser_explicit_instantiation
2344 static void cp_parser_explicit_specialization
2347 /* Exception handling [gram.exception] */
2349 static tree cp_parser_try_block
2351 static bool cp_parser_function_try_block
2353 static void cp_parser_handler_seq
2355 static void cp_parser_handler
2357 static tree cp_parser_exception_declaration
2359 static tree cp_parser_throw_expression
2361 static tree cp_parser_exception_specification_opt
2363 static tree cp_parser_type_id_list
2366 /* GNU Extensions */
2368 static tree cp_parser_asm_specification_opt
2370 static tree cp_parser_asm_operand_list
2372 static tree cp_parser_asm_clobber_list
2374 static tree cp_parser_asm_label_list
2376 static bool cp_next_tokens_can_be_attribute_p
2378 static bool cp_next_tokens_can_be_gnu_attribute_p
2380 static bool cp_next_tokens_can_be_std_attribute_p
2382 static bool cp_nth_tokens_can_be_std_attribute_p
2384 static bool cp_nth_tokens_can_be_gnu_attribute_p
2386 static bool cp_nth_tokens_can_be_attribute_p
2388 static tree cp_parser_attributes_opt
2390 static tree cp_parser_gnu_attributes_opt
2392 static tree cp_parser_gnu_attribute_list
2394 static tree cp_parser_std_attribute
2396 static tree cp_parser_std_attribute_spec
2398 static tree cp_parser_std_attribute_spec_seq
2400 static bool cp_parser_extension_opt
2402 static void cp_parser_label_declaration
2405 /* Concept Extensions */
2407 static tree cp_parser_requires_clause
2409 static tree cp_parser_requires_clause_opt
2411 static tree cp_parser_requires_expression
2413 static tree cp_parser_requirement_parameter_list
2415 static tree cp_parser_requirement_body
2417 static tree cp_parser_requirement_list
2419 static tree cp_parser_requirement
2421 static tree cp_parser_simple_requirement
2423 static tree cp_parser_compound_requirement
2425 static tree cp_parser_type_requirement
2427 static tree cp_parser_nested_requirement
2430 /* Transactional Memory Extensions */
2432 static tree cp_parser_transaction
2434 static tree cp_parser_transaction_expression
2436 static bool cp_parser_function_transaction
2438 static tree cp_parser_transaction_cancel
2442 pragma_external,
2443 pragma_member,
2444 pragma_objc_icode,
2445 pragma_stmt,
2446 pragma_compound
2447 };
2448 static bool cp_parser_pragma
2451 /* Objective-C++ Productions */
2453 static tree cp_parser_objc_message_receiver
2455 static tree cp_parser_objc_message_args
2457 static tree cp_parser_objc_message_expression
2459 static cp_expr cp_parser_objc_encode_expression
2461 static tree cp_parser_objc_defs_expression
2463 static tree cp_parser_objc_protocol_expression
2465 static tree cp_parser_objc_selector_expression
2467 static cp_expr cp_parser_objc_expression
2469 static bool cp_parser_objc_selector_p
2471 static tree cp_parser_objc_selector
2473 static tree cp_parser_objc_protocol_refs_opt
2475 static void cp_parser_objc_declaration
2477 static tree cp_parser_objc_statement
2479 static bool cp_parser_objc_valid_prefix_attributes
2481 static void cp_parser_objc_at_property_declaration
2483 static void cp_parser_objc_at_synthesize_declaration
2485 static void cp_parser_objc_at_dynamic_declaration
2487 static tree cp_parser_objc_struct_declaration
2490 /* Utility Routines */
2492 static cp_expr cp_parser_lookup_name
2494 static tree cp_parser_lookup_name_simple
2496 static tree cp_parser_maybe_treat_template_as_class
2498 static bool cp_parser_check_declarator_template_parameters
2500 static bool cp_parser_check_template_parameters
2502 static cp_expr cp_parser_simple_cast_expression
2504 static tree cp_parser_global_scope_opt
2506 static bool cp_parser_constructor_declarator_p
2508 static tree cp_parser_function_definition_from_specifiers_and_declarator
2510 static tree cp_parser_function_definition_after_declarator
2512 static bool cp_parser_template_declaration_after_export
2514 static void cp_parser_perform_template_parameter_access_checks
2516 static tree cp_parser_single_declaration
2518 static cp_expr cp_parser_functional_cast
2520 static tree cp_parser_save_member_function_body
2522 static tree cp_parser_save_nsdmi
2524 static tree cp_parser_enclosed_template_argument_list
2526 static void cp_parser_save_default_args
2528 static void cp_parser_late_parsing_for_member
2530 static tree cp_parser_late_parse_one_default_arg
2532 static void cp_parser_late_parsing_nsdmi
2534 static void cp_parser_late_parsing_default_args
2536 static tree cp_parser_sizeof_operand
2538 static tree cp_parser_trait_expr
2540 static bool cp_parser_declares_only_class_p
2542 static void cp_parser_set_storage_class
2544 static void cp_parser_set_decl_spec_type
2546 static void set_and_check_decl_spec_loc
2549 static bool cp_parser_friend_p
2551 static void cp_parser_required_error
2557 static bool cp_parser_token_starts_function_definition_p
2559 static bool cp_parser_next_token_starts_class_definition_p
2561 static bool cp_parser_next_token_ends_template_argument_p
2563 static bool cp_parser_nth_token_starts_template_argument_list_p
2565 static enum tag_types cp_parser_token_is_class_key
2567 static enum tag_types cp_parser_token_is_type_parameter_key
2569 static void cp_parser_check_class_key
2571 static void cp_parser_check_access_in_redeclaration
2573 static bool cp_parser_optional_template_keyword
2575 static void cp_parser_pre_parsed_nested_name_specifier
2577 static bool cp_parser_cache_group
2579 static tree cp_parser_cache_defarg
2581 static void cp_parser_parse_tentatively
2583 static void cp_parser_commit_to_tentative_parse
2585 static void cp_parser_commit_to_topmost_tentative_parse
2587 static void cp_parser_abort_tentative_parse
2589 static bool cp_parser_parse_definitely
2593 static bool cp_parser_uncommitted_to_tentative_parse_p
2595 static void cp_parser_error
2597 static void cp_parser_name_lookup_error
2599 static bool cp_parser_simulate_error
2601 static bool cp_parser_check_type_definition
2603 static void cp_parser_check_for_definition_in_return_type
2605 static void cp_parser_check_for_invalid_template_id
2607 static bool cp_parser_non_integral_constant_expression
2609 static void cp_parser_diagnose_invalid_type_name
2611 static bool cp_parser_parse_and_diagnose_invalid_type_name
2613 static int cp_parser_skip_to_closing_parenthesis
2615 static void cp_parser_skip_to_end_of_statement
2617 static void cp_parser_consume_semicolon_at_end_of_statement
2619 static void cp_parser_skip_to_end_of_block_or_statement
2621 static bool cp_parser_skip_to_closing_brace
2623 static void cp_parser_skip_to_end_of_template_parameter_list
2625 static void cp_parser_skip_to_pragma_eol
2627 static bool cp_parser_error_occurred
2629 static bool cp_parser_allow_gnu_extensions_p
2631 static bool cp_parser_is_pure_string_literal
2633 static bool cp_parser_is_string_literal
2635 static bool cp_parser_is_keyword
2637 static tree cp_parser_make_typename_type
2641 static bool cp_parser_compound_literal_p
2643 static bool cp_parser_array_designator_p
2645 static bool cp_parser_init_statement_p
2647 static bool cp_parser_skip_to_closing_square_bracket
2650 /* Concept-related syntactic transformations */
2655 // -------------------------------------------------------------------------- //
2656 // Unevaluated Operand Guard
2657 //
2658 // Implementation of an RAII helper for unevaluated operand parsing.
2660 {
2663 }
2666 {
2669 }
2671 // -------------------------------------------------------------------------- //
2672 // Tentative Parsing
2674 /* Returns nonzero if we are parsing tentatively. */
2678 {
2680 }
2682 /* Returns nonzero if TOKEN is a string literal. */
2684 static bool
2686 {
2692 }
2694 /* Returns nonzero if TOKEN is a string literal
2695 of a user-defined string literal. */
2697 static bool
2699 {
2706 }
2708 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2710 static bool
2712 {
2714 }
2716 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2717 PRAGMA_NONE. */
2719 static enum pragma_kind
2721 {
2724 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2726 }
2728 /* Helper function for cp_parser_error.
2729 Having peeked a token of kind TOK1_KIND that might signify
2730 a conflict marker, peek successor tokens to determine
2731 if we actually do have a conflict marker.
2732 Specifically, we consider a run of 7 '<', '=' or '>' characters
2733 at the start of a line as a conflict marker.
2734 These come through the lexer as three pairs and a single,
2735 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2736 If it returns true, *OUT_LOC is written to with the location/range
2737 of the marker. */
2739 static bool
2742 {
2753 /* It must be at the start of the line. */
2758 /* We have a conflict marker. Construct a location of the form:
2759 <<<<<<<
2760 ^~~~~~~
2761 with start == caret, finishing at the end of the marker. */
2766 }
2768 /* If not parsing tentatively, issue a diagnostic of the form
2769 FILE:LINE: MESSAGE before TOKEN
2770 where TOKEN is the next token in the input stream. MESSAGE
2771 (specified by the caller) is usually of the form "expected
2772 OTHER-TOKEN". */
2774 static void
2776 {
2778 {
2780 /* This diagnostic makes more sense if it is tagged to the line
2781 of the token we just peeked at. */
2785 {
2790 }
2792 /* If this is actually a conflict marker, report it as such. */
2796 {
2797 location_t loc;
2799 {
2802 }
2803 }
2806 /* Because c_parser_error does not understand
2807 CPP_KEYWORD, keywords are treated like
2808 identifiers. */
2811 }
2812 }
2814 /* Issue an error about name-lookup failing. NAME is the
2815 IDENTIFIER_NODE DECL is the result of
2816 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2817 the thing that we hoped to find. */
2819 static void
2821 tree name,
2822 tree decl,
2823 name_lookup_error desired,
2824 location_t location)
2825 {
2826 /* If name lookup completely failed, tell the user that NAME was not
2827 declared. */
2829 {
2842 else
2844 }
2846 {
2848 {
2865 }
2866 }
2868 {
2870 {
2880 name);
2884 }
2885 }
2886 else
2887 {
2889 {
2902 }
2903 }
2904 }
2906 /* If we are parsing tentatively, remember that an error has occurred
2907 during this tentative parse. Returns true if the error was
2908 simulated; false if a message should be issued by the caller. */
2910 static bool
2912 {
2914 {
2917 }
2919 }
2921 /* This function is called when a type is defined. If type
2922 definitions are forbidden at this point, an error message is
2923 issued. */
2925 static bool
2927 {
2928 /* If types are forbidden here, issue a message. */
2930 {
2931 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2932 in the message need to be interpreted. */
2935 }
2937 }
2939 /* This function is called when the DECLARATOR is processed. The TYPE
2940 was a type defined in the decl-specifiers. If it is invalid to
2941 define a type in the decl-specifiers for DECLARATOR, an error is
2942 issued. TYPE_LOCATION is the location of TYPE and is used
2943 for error reporting. */
2945 static void
2948 {
2949 /* [dcl.fct] forbids type definitions in return types.
2950 Unfortunately, it's not easy to know whether or not we are
2951 processing a return type until after the fact. */
2959 {
2964 type);
2965 }
2966 }
2968 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2969 "<" in any valid C++ program. If the next token is indeed "<",
2970 issue a message warning the user about what appears to be an
2971 invalid attempt to form a template-id. LOCATION is the location
2972 of the type-specifier (TYPE) */
2974 static void
2976 tree type,
2978 location_t location)
2979 {
2983 {
2987 {
2990 else
2992 }
2993 else
2995 /* Remember the location of the invalid "<". */
2998 /* Consume the "<". */
3000 /* Parse the template arguments. */
3002 /* Permanently remove the invalid template arguments so that
3003 this error message is not issued again. */
3006 }
3007 }
3009 /* If parsing an integral constant-expression, issue an error message
3010 about the fact that THING appeared and return true. Otherwise,
3011 return false. In either case, set
3012 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3014 static bool
3016 non_integral_constant thing)
3017 {
3020 {
3022 {
3025 {
3032 "enumeration type cannot appear in a "
3123 }
3127 }
3128 }
3130 }
3132 /* Emit a diagnostic for an invalid type name. This function commits
3133 to the current active tentative parse, if any. (Otherwise, the
3134 problematic construct might be encountered again later, resulting
3135 in duplicate error messages.) LOCATION is the location of ID. */
3137 static void
3139 location_t location)
3140 {
3143 /* Try to lookup the identifier. */
3150 /* If the lookup was ambiguous, an error will already have
3151 been issued. */
3153 /* If the lookup found a template-name, it means that the user forgot
3154 to specify an argument list. Emit a useful error message. */
3156 {
3159 decl);
3164 }
3168 /* Something like 'unsigned A a;' */
3171 {
3172 /* Issue an error message. */
3177 {
3183 }
3184 else
3186 /* If we're in a template class, it's possible that the user was
3187 referring to a type from a base class. For example:
3189 template <typename T> struct A { typedef T X; };
3190 template <typename T> struct B : public A<T> { X x; };
3192 The user should have said "typename A<T>::X". */
3208 {
3209 tree b;
3212 b;
3214 {
3218 {
3219 tree field;
3220 /* Go from a particular instantiation of the
3221 template (which will have an empty TYPE_FIELDs),
3222 to the main version. */
3225 field;
3229 {
3234 }
3237 }
3238 }
3239 }
3240 }
3241 /* Here we diagnose qualified-ids where the scope is actually correct,
3242 but the identifier does not resolve to a valid type name. */
3244 {
3246 {
3251 else
3257 }
3260 {
3261 /* A<T>::A<T>() */
3267 }
3274 {
3279 else
3285 }
3286 else
3288 }
3289 }
3291 /* Check for a common situation where a type-name should be present,
3292 but is not, and issue a sensible error message. Returns true if an
3293 invalid type-name was detected.
3295 The situation handled by this function are variable declarations of the
3296 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3297 Usually, `ID' should name a type, but if we got here it means that it
3298 does not. We try to emit the best possible error message depending on
3299 how exactly the id-expression looks like. */
3301 static bool
3303 {
3304 tree id;
3307 /* Avoid duplicate error about ambiguous lookup. */
3309 {
3313 }
3322 /* If the next token is a (, this is a function with no explicit return
3323 type, i.e. constructor, destructor or conversion op. */
3326 {
3329 }
3333 /* Emit a diagnostic for the invalid type. */
3335 out:
3336 /* If we aren't in the middle of a declarator (i.e. in a
3337 parameter-declaration-clause), skip to the end of the declaration;
3338 there's no point in trying to process it. */
3342 }
3344 /* Consume tokens up to, and including, the next non-nested closing `)'.
3345 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3346 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3347 found an unnested token of that type. */
3349 static int
3352 cpp_ttype or_ttype,
3354 {
3364 {
3367 /* Have we found what we're looking for before the closing paren? */
3373 {
3376 /* If we've run out of tokens, then there is no closing `)'. */
3379 /* This is good for lambda expression capture-lists. */
3389 /* This matches the processing in skip_to_end_of_statement. */
3409 {
3413 }
3418 }
3420 /* Consume the token. */
3422 }
3423 }
3425 /* Consume tokens up to, and including, the next non-nested closing `)'.
3426 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3427 are doing error recovery. Returns -1 if OR_COMMA is true and we
3428 found an unnested token of that type. */
3430 static int
3435 {
3439 }
3441 /* Consume tokens until we reach the end of the current statement.
3442 Normally, that will be just before consuming a `;'. However, if a
3443 non-nested `}' comes first, then we stop before consuming that. */
3445 static void
3447 {
3450 /* Unwind generic function template scope if necessary. */
3455 {
3459 {
3462 /* If we've run out of tokens, stop. */
3466 /* If the next token is a `;', we have reached the end of the
3467 statement. */
3473 /* If this is a non-nested '}', stop before consuming it.
3474 That way, when confronted with something like:
3476 { 3 + }
3478 we stop before consuming the closing '}', even though we
3479 have not yet reached a `;'. */
3483 /* If it is the closing '}' for a block that we have
3484 scanned, stop -- but only after consuming the token.
3485 That way given:
3487 void f g () { ... }
3488 typedef int I;
3490 we will stop after the body of the erroneously declared
3491 function, but before consuming the following `typedef'
3492 declaration. */
3494 {
3497 }
3506 }
3508 /* Consume the token. */
3510 }
3511 }
3513 /* This function is called at the end of a statement or declaration.
3514 If the next token is a semicolon, it is consumed; otherwise, error
3515 recovery is attempted. */
3517 static void
3519 {
3520 /* Look for the trailing `;'. */
3522 {
3523 /* If there is additional (erroneous) input, skip to the end of
3524 the statement. */
3526 /* If the next token is now a `;', consume it. */
3529 }
3530 }
3532 /* Skip tokens until we have consumed an entire block, or until we
3533 have consumed a non-nested `;'. */
3535 static void
3537 {
3540 /* Unwind generic function template scope if necessary. */
3545 {
3549 {
3552 /* If we've run out of tokens, stop. */
3556 /* Stop if this is an unnested ';'. */
3562 /* Stop if this is an unnested '}', or closes the outermost
3563 nesting level. */
3564 nesting_depth--;
3572 /* Nest. */
3573 nesting_depth++;
3578 }
3580 /* Consume the token. */
3582 }
3583 }
3585 /* Skip tokens until a non-nested closing curly brace is the next
3586 token, or there are no more tokens. Return true in the first case,
3587 false otherwise. */
3589 static bool
3591 {
3595 {
3599 {
3602 /* If we've run out of tokens, stop. */
3606 /* If the next token is a non-nested `}', then we have reached
3607 the end of the current block. */
3613 /* If it the next token is a `{', then we are entering a new
3614 block. Consume the entire block. */
3620 }
3622 /* Consume the token. */
3624 }
3625 }
3627 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3628 parameter is the PRAGMA token, allowing us to purge the entire pragma
3629 sequence. */
3631 static void
3633 {
3638 do
3642 /* Ensure that the pragma is not parsed again. */
3644 }
3646 /* Require pragma end of line, resyncing with it as necessary. The
3647 arguments are as for cp_parser_skip_to_pragma_eol. */
3649 static void
3651 {
3655 }
3657 /* This is a simple wrapper around make_typename_type. When the id is
3658 an unresolved identifier node, we can provide a superior diagnostic
3659 using cp_parser_diagnose_invalid_type_name. */
3661 static tree
3663 location_t id_location)
3664 {
3665 tree result;
3667 {
3673 }
3675 }
3677 /* This is a wrapper around the
3678 make_{pointer,ptrmem,reference}_declarator functions that decides
3679 which one to call based on the CODE and CLASS_TYPE arguments. The
3680 CODE argument should be one of the values returned by
3681 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3682 appertain to the pointer or reference. */
3686 cp_cv_quals cv_qualifiers,
3688 tree attributes)
3689 {
3696 else
3706 }
3708 /* Create a new C++ parser. */
3712 {
3717 /* cp_lexer_new_main is called before doing GC allocation because
3718 cp_lexer_new_main might load a PCH file. */
3721 /* Initialize the binops_by_token so that we can get the tree
3722 directly from the token. */
3730 /* For now, we always accept GNU extensions. */
3733 /* The `>' token is a greater-than operator, not the end of a
3734 template-id. */
3739 /* We are not parsing a constant-expression. */
3744 /* Local variable names are not forbidden. */
3747 /* We are not processing an `extern "C"' declaration. */
3750 /* We are not processing a declarator. */
3753 /* We are not processing a template-argument-list. */
3756 /* We are not in an iteration statement. */
3759 /* We are not in a switch statement. */
3762 /* We are not parsing a type-id inside an expression. */
3765 /* Declarations aren't implicitly extern "C". */
3768 /* String literals should be translated to the execution character set. */
3771 /* We are not parsing a function body. */
3774 /* We can correct until told otherwise. */
3777 /* The unparsed function queue is empty. */
3780 /* There are no classes being defined. */
3783 /* No template parameters apply. */
3786 /* Special parsing data structures. */
3791 /* Not declaring an implicit function template. */
3797 /* Allow constrained-type-specifiers. */
3801 }
3803 /* Create a cp_lexer structure which will emit the tokens in CACHE
3804 and push it onto the parser's lexer stack. This is used for delayed
3805 parsing of in-class method bodies and default arguments, and should
3806 not be confused with tentative parsing. */
3807 static void
3809 {
3814 /* Move the current source position to that of the first token in the
3815 new lexer. */
3817 }
3819 /* Pop the top lexer off the parser stack. This is never used for the
3820 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3821 static void
3823 {
3828 /* Put the current source position back where it was before this
3829 lexer was pushed. */
3831 }
3833 /* Lexical conventions [gram.lex] */
3835 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3836 identifier. */
3838 static cp_expr
3840 {
3843 /* Look for the identifier. */
3845 /* Return the value. */
3848 else
3850 }
3852 /* Parse a sequence of adjacent string constants. Returns a
3853 TREE_STRING representing the combined, nul-terminated string
3854 constant. If TRANSLATE is true, translate the string to the
3855 execution character set. If WIDE_OK is true, a wide string is
3856 invalid here.
3858 C++98 [lex.string] says that if a narrow string literal token is
3859 adjacent to a wide string literal token, the behavior is undefined.
3860 However, C99 6.4.5p4 says that this results in a wide string literal.
3861 We follow C99 here, for consistency with the C front end.
3863 This code is largely lifted from lex_string() in c-lex.c.
3865 FUTURE: ObjC++ will need to handle @-strings here. */
3866 static cp_expr
3869 {
3870 tree value;
3877 tree string_tree;
3883 {
3886 }
3891 {
3895 }
3896 else
3897 {
3900 }
3903 /* Try to avoid the overhead of creating and destroying an obstack
3904 for the common case of just one string. */
3907 {
3915 {
3919 }
3920 else
3924 }
3925 else
3926 {
3931 do
3932 {
3934 count++;
3939 {
3942 {
3945 }
3948 {
3953 }
3955 }
3956 else
3960 {
3964 {
3968 "unsupported non-standard concatenation "
3970 }
3971 }
3979 {
3983 }
3984 else
3985 {
3989 }
3990 }
3993 /* A string literal built by concatenation has its caret=start at
3994 the start of the initial string, and its finish at the finish of
3995 the final string literal. */
3999 }
4002 {
4005 }
4009 {
4014 {
4029 }
4034 {
4039 else
4041 }
4042 }
4043 else
4044 /* cpp_interpret_string has issued an error. */
4051 }
4053 /* Look up a literal operator with the name and the exact arguments. */
4055 static tree
4057 {
4064 {
4070 {
4073 {
4083 }
4086 /* May be this should be sufficient_parms_p instead,
4087 depending on how exactly should user-defined literals
4088 work in presence of default arguments on the literal
4089 operator parameters. */
4092 }
4093 }
4096 }
4098 /* Parse a user-defined char constant. Returns a call to a user-defined
4099 literal operator taking the character as an argument. */
4101 static cp_expr
4103 {
4111 /* Build up a call to the user-defined operator */
4112 /* Lookup the name we got back from the id-expression. */
4117 {
4122 }
4126 }
4128 /* A subroutine of cp_parser_userdef_numeric_literal to
4129 create a char... template parameter pack from a string node. */
4131 static tree
4133 {
4134 tree charvec;
4140 /* Fill in CHARVEC with all of the parameters. */
4145 /* Build the argument packs. */
4152 }
4154 /* A subroutine of cp_parser_userdef_numeric_literal to
4155 create a char... template parameter pack from a string node. */
4157 static tree
4159 {
4160 tree charvec;
4171 /* First template parm is character type. */
4174 /* Fill in CHARVEC with all of the parameters. */
4181 /* Build the argument packs. */
4188 }
4190 /* Parse a user-defined numeric constant. returns a call to a user-defined
4191 literal operator. */
4193 static cp_expr
4195 {
4206 /* Look for a literal operator taking the exact type of numeric argument
4207 as the literal value. */
4212 {
4214 tf_warning_or_error);
4217 {
4220 long_long_unsigned_type_node);
4221 }
4222 else
4223 {
4227 long_double_type_node);
4231 }
4235 }
4238 /* If the numeric argument didn't work, look for a raw literal
4239 operator taking a const char* argument consisting of the number
4240 in string format. */
4245 {
4247 tf_warning_or_error);
4250 }
4253 /* If the raw literal didn't work, look for a non-type template
4254 function with parameter pack char.... Call the function with
4255 template parameter characters representing the number. */
4259 {
4263 tf_warning_or_error);
4266 }
4275 }
4277 /* Parse a user-defined string constant. Returns a call to a user-defined
4278 literal operator taking a character pointer and the length of the string
4279 as arguments. */
4281 static tree
4283 {
4292 /* Build up a call to the user-defined operator. */
4293 /* Lookup the name we got back from the id-expression. */
4300 {
4302 tf_warning_or_error);
4305 }
4308 /* Look for a template function with typename parameter CharT
4309 and parameter pack CharT... Call the function with
4310 template parameter characters representing the string. */
4314 {
4318 tf_warning_or_error);
4321 }
4327 }
4330 /* Basic concepts [gram.basic] */
4332 /* Parse a translation-unit.
4334 translation-unit:
4335 declaration-seq [opt]
4337 Returns TRUE if all went well. */
4339 static bool
4341 {
4342 /* The address of the first non-permanent object on the declarator
4343 obstack. */
4348 /* Create the declarator obstack, if necessary. */
4350 {
4352 /* Create the error declarator. */
4354 /* Create the empty parameter list. */
4356 /* Remember where the base of the declarator obstack lies. */
4358 }
4362 /* If there are no tokens left then all went well. */
4364 {
4365 /* Get rid of the token array; we don't need it any more. */
4369 /* This file might have been a context that's implicitly extern
4370 "C". If so, pop the lang context. (Only relevant for PCH.) */
4372 {
4375 }
4377 /* Finish up. */
4381 }
4382 else
4383 {
4386 }
4388 /* Make sure the declarator obstack was fully cleaned up. */
4392 /* All went well. */
4394 }
4396 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4397 decltype context. */
4401 {
4406 }
4408 /* We're about to parse a collection of statements. If we're currently
4409 parsing tentatively, set up a firewall so that any nested
4410 cp_parser_commit_to_tentative_parse won't affect the current context. */
4412 static cp_token_position
4414 {
4421 }
4423 /* We've finished parsing the collection of statements. Wrap up the
4424 firewall and replace the relevant tokens with the parsed form. */
4426 static void
4428 tree expr)
4429 {
4433 /* Finish the firewall level. */
4435 /* And remember the result of the parse for when we try again. */
4441 }
4443 /* Like the above functions, but let the user modify the tokens. Used by
4444 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4445 later parses, so it makes sense to localize the effects of
4446 cp_parser_commit_to_tentative_parse. */
4448 struct tentative_firewall
4449 {
4454 {
4455 /* If we're currently parsing tentatively, start a committed level as a
4456 firewall and then an inner tentative parse. */
4458 {
4462 }
4463 }
4466 {
4468 {
4469 /* Finish the inner tentative parse and the firewall, propagating any
4470 uncommitted error state to the outer tentative parse. */
4476 }
4477 }
4478 };
4480 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4481 enclosing parentheses. */
4483 static cp_expr
4485 {
4488 /* Consume the '('. */
4491 /* Start the statement-expression. */
4493 /* Parse the compound-statement. */
4495 /* Finish up. */
4497 /* Consume the ')'. */
4505 }
4507 /* Expressions [gram.expr] */
4509 /* Parse a fold-operator.
4511 fold-operator:
4512 - * / % ^ & | = < > << >>
4513 = -= *= /= %= ^= &= |= <<= >>=
4514 == != <= >= && || , .* ->*
4516 This returns the tree code corresponding to the matched operator
4517 as an int. When the current token matches a compound assignment
4518 opertor, the resulting tree code is the negative value of the
4519 non-assignment operator. */
4521 static int
4523 {
4525 {
4565 }
4566 }
4568 /* Returns true if CODE indicates a binary expression, which is not allowed in
4569 the LHS of a fold-expression. More codes will need to be added to use this
4570 function in other contexts. */
4572 static bool
4574 {
4576 {
4609 }
4610 }
4612 /* If the next token is a suitable fold operator, consume it and return as
4613 the function above. */
4615 static int
4617 {
4623 }
4625 /* Parse a fold-expression.
4627 fold-expression:
4628 ( ... folding-operator cast-expression)
4629 ( cast-expression folding-operator ... )
4630 ( cast-expression folding operator ... folding-operator cast-expression)
4632 Note that the '(' and ')' are matched in primary expression. */
4634 static cp_expr
4636 {
4637 cp_id_kind pidk;
4639 // Left fold.
4641 {
4645 {
4648 }
4655 }
4660 {
4663 }
4666 {
4669 }
4672 /* The operands of a fold-expression are cast-expressions, so binary or
4673 conditional expressions are not allowed. We check this here to avoid
4674 tentative parsing. */
4682 // Right fold.
4687 {
4690 }
4693 // Binary left or right fold.
4698 }
4700 /* Parse a primary-expression.
4702 primary-expression:
4703 literal
4704 this
4705 ( expression )
4706 id-expression
4707 lambda-expression (C++11)
4709 GNU Extensions:
4711 primary-expression:
4712 ( compound-statement )
4713 __builtin_va_arg ( assignment-expression , type-id )
4714 __builtin_offsetof ( type-id , offsetof-expression )
4716 C++ Extensions:
4717 __has_nothrow_assign ( type-id )
4718 __has_nothrow_constructor ( type-id )
4719 __has_nothrow_copy ( type-id )
4720 __has_trivial_assign ( type-id )
4721 __has_trivial_constructor ( type-id )
4722 __has_trivial_copy ( type-id )
4723 __has_trivial_destructor ( type-id )
4724 __has_virtual_destructor ( type-id )
4725 __is_abstract ( type-id )
4726 __is_base_of ( type-id , type-id )
4727 __is_class ( type-id )
4728 __is_empty ( type-id )
4729 __is_enum ( type-id )
4730 __is_final ( type-id )
4731 __is_literal_type ( type-id )
4732 __is_pod ( type-id )
4733 __is_polymorphic ( type-id )
4734 __is_std_layout ( type-id )
4735 __is_trivial ( type-id )
4736 __is_union ( type-id )
4738 Objective-C++ Extension:
4740 primary-expression:
4741 objc-expression
4743 literal:
4744 __null
4746 ADDRESS_P is true iff this expression was immediately preceded by
4747 "&" and therefore might denote a pointer-to-member. CAST_P is true
4748 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4749 true iff this expression is a template argument.
4751 Returns a representation of the expression. Upon return, *IDK
4752 indicates what kind of id-expression (if any) was present. */
4754 static cp_expr
4761 {
4764 /* Assume the primary expression is not an id-expression. */
4767 /* Peek at the next token. */
4770 {
4771 /* literal:
4772 integer-literal
4773 character-literal
4774 floating-literal
4775 string-literal
4776 boolean-literal
4777 pointer-literal
4778 user-defined-literal */
4790 {
4794 }
4795 /* Floating-point literals are only allowed in an integral
4796 constant expression if they are cast to an integral or
4797 enumeration type. */
4801 {
4802 /* CAST_P will be set even in invalid code like "int(2.7 +
4803 ...)". Therefore, we have to check that the next token
4804 is sure to end the cast. */
4806 {
4811 enumerator-definition. */
4813 /* The curly brace at the end of an enum-specifier. */
4815 /* The end of a statement. */
4817 /* The end of the cast-expression. */
4819 /* The end of an array bound. */
4821 /* The closing ">" in a template-argument-list. */
4824 /* C++0x only: A ">>" treated like two ">" tokens,
4825 in a template-argument-list. */
4830 }
4832 /* If we are within a cast, then the constraint that the
4833 cast is to an integral or enumeration type will be
4834 checked at that point. If we are not within a cast, then
4835 this code is invalid. */
4838 }
4858 /* ??? Should wide strings be allowed when parser->translate_strings_p
4859 is false (i.e. in attributes)? If not, we can kill the third
4860 argument to cp_parser_string_literal. */
4866 /* If we see `( { ' then we are looking at the beginning of
4867 a GNU statement-expression. */
4870 {
4871 /* Statement-expressions are not allowed by the standard. */
4875 /* And they're not allowed outside of a function-body; you
4876 cannot, for example, write:
4878 int i = ({ int j = 3; j + 1; });
4880 at class or namespace scope. */
4883 {
4885 "statement-expressions are not allowed outside "
4891 }
4892 else
4894 }
4895 /* Otherwise it's a normal parenthesized expression. */
4896 {
4897 cp_expr expr;
4902 /* Consume the `('. */
4904 /* Within a parenthesized expression, a `>' token is always
4905 the greater-than operator. */
4906 saved_greater_than_is_operator_p
4911 /* Left fold expression. */
4913 else
4914 /* Parse the parenthesized expression. */
4919 {
4926 }
4927 else
4928 /* Let the front end know that this expression was
4929 enclosed in parentheses. This matters in case, for
4930 example, the expression is of the form `A::B', since
4931 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4932 not. */
4935 /* DR 705: Wrapping an unqualified name in parentheses
4936 suppresses arg-dependent lookup. We want to pass back
4937 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4938 (c++/37862), but none of the others. */
4942 /* The `>' token might be the end of a template-id or
4943 template-parameter-list now. */
4944 parser->greater_than_is_operator_p
4947 /* Consume the `)'. */
4956 }
4959 {
4961 {
4962 /* We might have an Objective-C++ message. */
4965 /* If that works out, we're done ... */
4968 /* ... else, fall though to see if it's a lambda. */
4969 }
4971 /* Don't warn about a failed tentative parse. */
4976 }
4980 /* We have an Objective-C++ string literal. */
4987 {
4988 /* These two are the boolean literals. */
4996 /* The `__null' literal. */
5001 /* The `nullptr' literal. */
5006 /* Recognize the `this' keyword. */
5010 {
5014 }
5015 /* Pointers cannot appear in constant-expressions. */
5020 /* The `operator' keyword can be the beginning of an
5021 id-expression. */
5028 {
5029 non_integral_constant name;
5031 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5032 __func__ are the names of variables -- but they are
5033 treated specially. Therefore, they are handled here,
5034 rather than relying on the generic id-expression logic
5035 below. Grammatically, these names are id-expressions.
5037 Consume the token. */
5041 {
5053 }
5058 /* Look up the name. */
5060 }
5063 {
5064 tree expression;
5065 tree type;
5066 source_location type_location;
5067 location_t start_loc
5069 /* The `__builtin_va_arg' construct is used to handle
5070 `va_arg'. Consume the `__builtin_va_arg' token. */
5072 /* Look for the opening `('. */
5074 /* Now, parse the assignment-expression. */
5076 /* Look for the `,'. */
5079 /* Parse the type-id. */
5080 {
5083 }
5084 /* Look for the closing `)'. */
5085 location_t finish_loc
5088 /* Using `va_arg' in a constant-expression is not
5089 allowed. */
5091 NIC_VA_ARG))
5093 /* Construct a location of the form:
5094 __builtin_va_arg (v, int)
5095 ~~~~~~~~~~~~~~~~~~~~~^~~~
5096 with the caret at the type, ranging from the start of the
5097 "__builtin_va_arg" token to the close paren. */
5098 location_t combined_loc
5101 }
5133 // C++ concepts
5137 /* Objective-C++ expressions. */
5147 {
5152 }
5153 /* FALLTHRU */
5157 }
5159 /* An id-expression can start with either an identifier, a
5160 `::' as the beginning of a qualified-id, or the "operator"
5161 keyword. */
5166 {
5167 id_expression:
5168 cp_expr id_expression;
5169 cp_expr decl;
5175 /* Parse the id-expression. */
5176 id_expression
5193 /* If we have a template-id, then no further lookup is
5194 required. If the template-id was for a template-class, we
5195 will sometimes have a TYPE_DECL at this point. */
5199 /* Look up the name. */
5200 else
5201 {
5202 tree ambiguous_decls;
5204 /* If we already know that this lookup is ambiguous, then
5205 we've already issued an error message; there's no reason
5206 to check again. */
5209 {
5212 }
5215 none_type,
5216 template_p,
5221 /* If the lookup was ambiguous, an error will already have
5222 been issued. */
5226 /* In Objective-C++, we may have an Objective-C 2.0
5227 dot-syntax for classes here. */
5232 {
5233 tree component;
5240 component);
5241 /* Build a location of the form:
5242 expr.component
5243 ~~~~~^~~~~~~~~
5244 with caret at the start of the component name (at
5245 input_location), ranging from the start of the id_expression
5246 to the end of the component name. */
5247 location_t combined_loc
5252 }
5254 /* In Objective-C++, an instance variable (ivar) may be preferred
5255 to whatever cp_parser_lookup_name() found.
5256 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5257 rest of c-family, we have to do a little extra work to preserve
5258 any location information in cp_expr "decl". Given that
5259 objc_lookup_ivar is implemented in "c-family" and "objc", we
5260 have a trip through the pure "tree" type, rather than cp_expr.
5261 Naively copying it back to "decl" would implicitly give the
5262 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5263 store an EXPR_LOCATION. Hence we only update "decl" (and
5264 hence its location_t) if we get back a different tree node. */
5266 id_expression);
5270 /* If name lookup gives us a SCOPE_REF, then the
5271 qualifying scope was dependent. */
5273 {
5274 /* At this point, we do not know if DECL is a valid
5275 integral constant expression. We assume that it is
5276 in fact such an expression, so that code like:
5278 template <int N> struct A {
5279 int a[B<N>::i];
5280 };
5282 is accepted. At template-instantiation time, we
5283 will check that B<N>::i is actually a constant. */
5285 }
5286 /* Check to see if DECL is a local variable in a context
5287 where that is forbidden. */
5290 {
5291 /* It might be that we only found DECL because we are
5292 trying to be generous with pre-ISO scoping rules.
5293 For example, consider:
5295 int i;
5296 void g() {
5297 for (int i = 0; i < 10; ++i) {}
5298 extern void f(int j = i);
5299 }
5301 Here, name look up will originally find the out
5302 of scope `i'. We need to issue a warning message,
5303 but then use the global `i'. */
5306 {
5311 }
5312 }
5313 }
5315 decl = (finish_id_expression
5317 idk,
5322 template_arg_p,
5329 }
5331 /* Anything else is an error. */
5335 }
5336 }
5344 {
5347 }
5349 /* Parse an id-expression.
5351 id-expression:
5352 unqualified-id
5353 qualified-id
5355 qualified-id:
5356 :: [opt] nested-name-specifier template [opt] unqualified-id
5357 :: identifier
5358 :: operator-function-id
5359 :: template-id
5361 Return a representation of the unqualified portion of the
5362 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5363 a `::' or nested-name-specifier.
5365 Often, if the id-expression was a qualified-id, the caller will
5366 want to make a SCOPE_REF to represent the qualified-id. This
5367 function does not do this in order to avoid wastefully creating
5368 SCOPE_REFs when they are not required.
5370 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5371 `template' keyword.
5373 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5374 uninstantiated templates.
5376 If *TEMPLATE_P is non-NULL, it is set to true iff the
5377 `template' keyword is used to explicitly indicate that the entity
5378 named is a template.
5380 If DECLARATOR_P is true, the id-expression is appearing as part of
5381 a declarator, rather than as part of an expression. */
5383 static cp_expr
5390 {
5394 /* Assume the `template' keyword was not used. */
5398 /* Look for the optional `::' operator. */
5399 global_scope_p
5402 /* Look for the optional nested-name-specifier. */
5403 nested_name_specifier_p
5406 check_dependency_p,
5408 declarator_p)
5410 /* If there is a nested-name-specifier, then we are looking at
5411 the first qualified-id production. */
5413 {
5414 tree saved_scope;
5415 tree saved_object_scope;
5416 tree saved_qualifying_scope;
5417 tree unqualified_id;
5420 /* See if the next token is the `template' keyword. */
5424 /* Name lookup we do during the processing of the
5425 unqualified-id might obliterate SCOPE. */
5429 /* Process the final unqualified-id. */
5431 check_dependency_p,
5432 declarator_p,
5434 /* Restore the SAVED_SCOPE for our caller. */
5440 }
5441 /* Otherwise, if we are in global scope, then we are looking at one
5442 of the other qualified-id productions. */
5444 {
5446 tree id;
5448 /* Peek at the next token. */
5451 /* If it's an identifier, and the next token is not a "<", then
5452 we can avoid the template-id case. This is an optimization
5453 for this common case. */
5455 && !cp_parser_nth_token_starts_template_argument_list_p
5460 /* Try a template-id. */
5464 none_type,
5465 declarator_p);
5466 /* If that worked, we're done. */
5470 /* Peek at the next token. (Changes in the token buffer may
5471 have invalidated the pointer obtained above.) */
5475 {
5482 /* Fall through. */
5487 }
5488 }
5489 else
5492 declarator_p,
5493 optional_p);
5494 }
5496 /* Parse an unqualified-id.
5498 unqualified-id:
5499 identifier
5500 operator-function-id
5501 conversion-function-id
5502 ~ class-name
5503 template-id
5505 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5506 keyword, in a construct like `A::template ...'.
5508 Returns a representation of unqualified-id. For the `identifier'
5509 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5510 production a BIT_NOT_EXPR is returned; the operand of the
5511 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5512 other productions, see the documentation accompanying the
5513 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5514 names are looked up in uninstantiated templates. If DECLARATOR_P
5515 is true, the unqualified-id is appearing as part of a declarator,
5516 rather than as part of an expression. */
5518 static cp_expr
5524 {
5527 /* Peek at the next token. */
5531 {
5533 {
5534 tree id;
5536 /* We don't know yet whether or not this will be a
5537 template-id. */
5539 /* Try a template-id. */
5541 check_dependency_p,
5542 none_type,
5543 declarator_p);
5544 /* If it worked, we're done. */
5547 /* Otherwise, it's an ordinary identifier. */
5549 }
5553 check_dependency_p,
5554 none_type,
5555 declarator_p);
5558 {
5559 tree type_decl;
5560 tree qualifying_scope;
5561 tree object_scope;
5562 tree scope;
5565 /* Consume the `~' token. */
5567 /* Parse the class-name. The standard, as written, seems to
5568 say that:
5570 template <typename T> struct S { ~S (); };
5571 template <typename T> S<T>::~S() {}
5573 is invalid, since `~' must be followed by a class-name, but
5574 `S<T>' is dependent, and so not known to be a class.
5575 That's not right; we need to look in uninstantiated
5576 templates. A further complication arises from:
5578 template <typename T> void f(T t) {
5579 t.T::~T();
5580 }
5582 Here, it is not possible to look up `T' in the scope of `T'
5583 itself. We must look in both the current scope, and the
5584 scope of the containing complete expression.
5586 Yet another issue is:
5588 struct S {
5589 int S;
5590 ~S();
5591 };
5593 S::~S() {}
5595 The standard does not seem to say that the `S' in `~S'
5596 should refer to the type `S' and not the data member
5597 `S::S'. */
5599 /* DR 244 says that we look up the name after the "~" in the
5600 same scope as we looked up the qualifying name. That idea
5601 isn't fully worked out; it's more complicated than that. */
5606 /* Check for invalid scopes. */
5608 {
5612 }
5614 {
5618 scope);
5623 }
5626 /* If the name is of the form "X::~X" it's OK even if X is a
5627 typedef. */
5636 {
5639 }
5641 /* ~auto means the destructor of whatever the object is. */
5643 {
5646 "%<~auto%> only available with "
5650 }
5652 /* If there was an explicit qualification (S::~T), first look
5653 in the scope given by the qualification (i.e., S).
5655 Note: in the calls to cp_parser_class_name below we pass
5656 typename_type so that lookup finds the injected-class-name
5657 rather than the constructor. */
5661 {
5666 typename_type,
5669 declarator_p);
5672 }
5673 /* In "N::S::~S", look in "N" as well. */
5675 {
5680 type_decl
5684 typename_type,
5687 declarator_p);
5690 }
5691 /* In "p->S::~T", look in the scope given by "*p" as well. */
5693 {
5698 type_decl
5702 typename_type,
5705 declarator_p);
5708 }
5709 /* Look in the surrounding context. */
5711 {
5717 type_decl
5721 typename_type,
5724 declarator_p);
5727 {
5728 /* We couldn't find a type with this name. If we're parsing
5729 tentatively, fail and try something else. */
5731 {
5734 }
5735 /* Otherwise, accept it and check for a match at instantiation
5736 time. */
5741 }
5742 }
5743 /* If an error occurred, assume that the name of the
5744 destructor is the same as the name of the qualifying
5745 class. That allows us to keep parsing after running
5746 into ill-formed destructor names. */
5752 /* Check that destructor name and scope match. */
5754 {
5761 }
5763 /* [class.dtor]
5765 A typedef-name that names a class shall not be used as the
5766 identifier in the declarator for a destructor declaration. */
5773 type_decl);
5776 }
5780 {
5781 cp_expr id;
5783 /* This could be a template-id, so we try that first. */
5785 /* Try a template-id. */
5788 none_type,
5789 declarator_p);
5790 /* If that worked, we're done. */
5793 /* We still don't know whether we're looking at an
5794 operator-function-id or a conversion-function-id. */
5796 /* Try an operator-function-id. */
5798 /* If that didn't work, try a conversion-function-id. */
5802 {
5803 /* 17.6.3.3.5 */
5809 }
5812 }
5813 /* Fall through. */
5820 }
5821 }
5823 /* Parse an (optional) nested-name-specifier.
5825 nested-name-specifier: [C++98]
5826 class-or-namespace-name :: nested-name-specifier [opt]
5827 class-or-namespace-name :: template nested-name-specifier [opt]
5829 nested-name-specifier: [C++0x]
5830 type-name ::
5831 namespace-name ::
5832 nested-name-specifier identifier ::
5833 nested-name-specifier template [opt] simple-template-id ::
5835 PARSER->SCOPE should be set appropriately before this function is
5836 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5837 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5838 in name lookups.
5840 Sets PARSER->SCOPE to the class (TYPE) or namespace
5841 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5842 it unchanged if there is no nested-name-specifier. Returns the new
5843 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5845 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5846 part of a declaration and/or decl-specifier. */
5848 static tree
5854 {
5859 /* Remember where the nested-name-specifier starts. */
5861 {
5864 }
5867 {
5868 tree new_scope;
5869 tree old_scope;
5870 tree saved_qualifying_scope;
5873 /* Spot cases that cannot be the beginning of a
5874 nested-name-specifier. */
5877 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5878 the already parsed nested-name-specifier. */
5880 {
5881 /* Grab the nested-name-specifier and continue the loop. */
5883 /* If we originally encountered this nested-name-specifier
5884 with IS_DECLARATION set to false, we will not have
5885 resolved TYPENAME_TYPEs, so we must do so here. */
5888 {
5893 }
5896 }
5898 /* Spot cases that cannot be the beginning of a
5899 nested-name-specifier. On the second and subsequent times
5900 through the loop, we look for the `template' keyword. */
5902 ;
5903 /* A template-id can start a nested-name-specifier. */
5905 ;
5906 /* DR 743: decltype can be used in a nested-name-specifier. */
5908 ;
5909 else
5910 {
5911 /* If the next token is not an identifier, then it is
5912 definitely not a type-name or namespace-name. */
5915 /* If the following token is neither a `<' (to begin a
5916 template-id), nor a `::', then we are not looking at a
5917 nested-name-specifier. */
5923 {
5927 }
5930 && !cp_parser_nth_token_starts_template_argument_list_p
5933 }
5935 /* The nested-name-specifier is optional, so we parse
5936 tentatively. */
5939 /* Look for the optional `template' keyword, if this isn't the
5940 first time through the loop. */
5943 else
5946 /* Save the old scope since the name lookup we are about to do
5947 might destroy it. */
5950 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5951 look up names in "X<T>::I" in order to determine that "Y" is
5952 a template. So, if we have a typename at this point, we make
5953 an effort to look through it. */
5955 && !typename_keyword_p
5960 /* Parse the qualifying entity. */
5961 new_scope
5963 typename_keyword_p,
5964 template_keyword_p,
5965 check_dependency_p,
5966 type_p,
5967 is_declaration);
5968 /* Look for the `::' token. */
5971 /* If we found what we wanted, we keep going; otherwise, we're
5972 done. */
5974 {
5977 /* Restore the OLD_SCOPE since it was valid before the
5978 failed attempt at finding the last
5979 class-or-namespace-name. */
5983 /* If the next token is a decltype, and the one after that is a
5984 `::', then the decltype has failed to resolve to a class or
5985 enumeration type. Give this error even when parsing
5986 tentatively since it can't possibly be valid--and we're going
5987 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5988 won't get another chance.*/
5992 {
5999 /* As below. */
6002 }
6006 {
6007 /* If we have a non-type template-id followed by ::, it can't
6008 possibly be valid. */
6013 {
6016 {
6022 }
6023 else
6024 {
6025 /* Variable template. */
6030 }
6037 /* As below. */
6041 }
6042 }
6046 /* If the next token is an identifier, and the one after
6047 that is a `::', then any valid interpretation would have
6048 found a class-or-namespace-name. */
6054 {
6057 {
6059 {
6060 tree decl;
6061 tree ambiguous_decls;
6064 none_type,
6073 decl);
6075 {
6076 // cp_parser_lookup_name has the same diagnostic,
6077 // thus make sure to emit it at most once.
6080 {
6085 }
6087 }
6088 else
6089 {
6091 cp_parser_name_lookup_error
6094 else
6095 cp_parser_name_lookup_error
6098 }
6099 }
6102 /* Treat this as a successful nested-name-specifier
6103 due to:
6105 [basic.lookup.qual]
6107 If the name found is not a class-name (clause
6108 _class_) or namespace-name (_namespace.def_), the
6109 program is ill-formed. */
6111 }
6113 }
6115 }
6116 /* We've found one valid nested-name-specifier. */
6118 /* Name lookup always gives us a DECL. */
6121 /* Uses of "template" must be followed by actual templates. */
6133 new_scope);
6134 /* If it is a class scope, try to complete it; we are about to
6135 be looking up names inside the class. */
6137 /* Since checking types for dependency can be expensive,
6138 avoid doing it if the type is already complete. */
6140 /* Do not try to complete dependent types. */
6142 {
6144 /* If it is a typedef to current class, use the current
6145 class instead, as the typedef won't have any names inside
6146 it yet. */
6150 }
6151 /* Make sure we look in the right scope the next time through
6152 the loop. */
6154 }
6156 /* If parsing tentatively, replace the sequence of tokens that makes
6157 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6158 token. That way, should we re-parse the token stream, we will
6159 not have to repeat the effort required to do the parse, nor will
6160 we issue duplicate error messages. */
6162 {
6166 /* Reset the contents of the START token. */
6168 /* Retrieve any deferred checks. Do not pop this access checks yet
6169 so the memory will not be reclaimed during token replacing below. */
6177 /* Purge all subsequent tokens. */
6179 }
6185 }
6187 /* Parse a nested-name-specifier. See
6188 cp_parser_nested_name_specifier_opt for details. This function
6189 behaves identically, except that it will an issue an error if no
6190 nested-name-specifier is present. */
6192 static tree
6198 {
6199 tree scope;
6201 /* Look for the nested-name-specifier. */
6203 typename_keyword_p,
6204 check_dependency_p,
6205 type_p,
6206 is_declaration);
6207 /* If it was not present, issue an error message. */
6209 {
6212 }
6215 }
6217 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6218 this is either a class-name or a namespace-name (which corresponds
6219 to the class-or-namespace-name production in the grammar). For
6220 C++0x, it can also be a type-name that refers to an enumeration
6221 type or a simple-template-id.
6223 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6224 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6225 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6226 TYPE_P is TRUE iff the next name should be taken as a class-name,
6227 even the same name is declared to be another entity in the same
6228 scope.
6230 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6231 specified by the class-or-namespace-name. If neither is found the
6232 ERROR_MARK_NODE is returned. */
6234 static tree
6241 {
6242 tree saved_scope;
6243 tree saved_qualifying_scope;
6244 tree saved_object_scope;
6245 tree scope;
6249 /* DR 743: decltype can appear in a nested-name-specifier. */
6251 {
6255 {
6258 }
6262 }
6264 /* Before we try to parse the class-name, we must save away the
6265 current PARSER->SCOPE since cp_parser_class_name will destroy
6266 it. */
6270 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6271 there is no need to look for a namespace-name. */
6272 only_class_p = template_keyword_p
6277 typename_keyword_p,
6278 template_keyword_p,
6280 check_dependency_p,
6282 is_declaration,
6285 /* If that didn't work, try for a namespace-name. */
6287 {
6288 /* Restore the saved scope. */
6292 /* If we are not looking at an identifier followed by the scope
6293 resolution operator, then this is not part of a
6294 nested-name-specifier. (Note that this function is only used
6295 to parse the components of a nested-name-specifier.) */
6300 }
6303 }
6305 /* Return true if we are looking at a compound-literal, false otherwise. */
6307 static bool
6309 {
6310 /* Consume the `('. */
6315 /* Skip tokens until the next token is a closing parenthesis.
6316 If we find the closing `)', and the next token is a `{', then
6317 we are looking at a compound-literal. */
6318 bool compound_literal_p
6323 /* Roll back the tokens we skipped. */
6327 }
6329 /* Parse a postfix-expression.
6331 postfix-expression:
6332 primary-expression
6333 postfix-expression [ expression ]
6334 postfix-expression ( expression-list [opt] )
6335 simple-type-specifier ( expression-list [opt] )
6336 typename :: [opt] nested-name-specifier identifier
6337 ( expression-list [opt] )
6338 typename :: [opt] nested-name-specifier template [opt] template-id
6339 ( expression-list [opt] )
6340 postfix-expression . template [opt] id-expression
6341 postfix-expression -> template [opt] id-expression
6342 postfix-expression . pseudo-destructor-name
6343 postfix-expression -> pseudo-destructor-name
6344 postfix-expression ++
6345 postfix-expression --
6346 dynamic_cast < type-id > ( expression )
6347 static_cast < type-id > ( expression )
6348 reinterpret_cast < type-id > ( expression )
6349 const_cast < type-id > ( expression )
6350 typeid ( expression )
6351 typeid ( type-id )
6353 GNU Extension:
6355 postfix-expression:
6356 ( type-id ) { initializer-list , [opt] }
6358 This extension is a GNU version of the C99 compound-literal
6359 construct. (The C99 grammar uses `type-name' instead of `type-id',
6360 but they are essentially the same concept.)
6362 If ADDRESS_P is true, the postfix expression is the operand of the
6363 `&' operator. CAST_P is true if this expression is the target of a
6364 cast.
6366 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6367 class member access expressions [expr.ref].
6369 Returns a representation of the expression. */
6371 static cp_expr
6375 {
6377 location_t loc;
6384 /* Peek at the next token. */
6389 /* Some of the productions are determined by keywords. */
6392 {
6397 {
6398 tree type;
6399 cp_expr expression;
6403 /* All of these can be handled in the same way from the point
6404 of view of parsing. Begin by consuming the token
6405 identifying the cast. */
6408 /* New types cannot be defined in the cast. */
6410 parser->type_definition_forbidden_message
6413 /* Look for the opening `<'. */
6415 /* Parse the type to which we are casting. */
6420 /* Look for the closing `>'. */
6422 /* Restore the old message. */
6425 bool saved_greater_than_is_operator_p
6429 /* And the expression which is being cast. */
6433 RT_CLOSE_PAREN);
6437 parser->greater_than_is_operator_p
6440 /* Only type conversions to integral or enumeration types
6441 can be used in constant-expressions. */
6447 {
6449 postfix_expression
6453 postfix_expression
6457 postfix_expression
6459 tf_warning_or_error);
6462 postfix_expression
6467 }
6469 /* Construct a location e.g. :
6470 reinterpret_cast <int *> (expr)
6471 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6472 ranging from the start of the "*_cast" token to the final closing
6473 paren, with the caret at the start. */
6476 }
6480 {
6481 tree type;
6485 /* Consume the `typeid' token. */
6487 /* Look for the `(' token. */
6489 /* Types cannot be defined in a `typeid' expression. */
6491 parser->type_definition_forbidden_message
6493 /* We can't be sure yet whether we're looking at a type-id or an
6494 expression. */
6496 /* Try a type-id first. */
6501 /* Look for the `)' token. Otherwise, we can't be sure that
6502 we're not looking at an expression: consider `typeid (int
6503 (3))', for example. */
6505 /* If all went well, simply lookup the type-id. */
6508 /* Otherwise, fall back to the expression variant. */
6509 else
6510 {
6511 tree expression;
6513 /* Look for an expression. */
6515 /* Compute its typeid. */
6517 /* Look for the `)' token. */
6519 }
6520 /* Restore the saved message. */
6522 /* `typeid' may not appear in an integral constant expression. */
6525 }
6529 {
6530 tree type;
6531 /* The syntax permitted here is the same permitted for an
6532 elaborated-type-specifier. */
6539 }
6543 {
6544 location_t cilk_spawn_loc
6549 {
6554 }
6556 {
6561 }
6562 else
6563 {
6564 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6567 }
6569 postfix_expression =
6573 {
6577 }
6579 {
6584 }
6585 else
6586 {
6589 postfix_expression);
6590 /* Build a location of the form:
6591 _Cilk_spawn expr
6592 ~~~~~~~~~~~~^~~~
6593 with caret at the expr, ranging from the start of the
6594 _Cilk_spawn token to the end of the expression. */
6595 location_t combined_loc =
6601 }
6603 }
6606 {
6609 tree p;
6623 tf_warning_or_error);
6626 tf_warning_or_error);
6627 else
6628 {
6632 }
6634 }
6637 {
6638 tree type;
6640 /* If the next thing is a simple-type-specifier, we may be
6641 looking at a functional cast. We could also be looking at
6642 an id-expression. So, we try the functional cast, and if
6643 that doesn't work we fall back to the primary-expression. */
6645 /* Look for the simple-type-specifier. */
6649 CP_PARSER_FLAGS_NONE);
6651 /* Parse the cast itself. */
6653 postfix_expression
6655 /* If that worked, we're done. */
6659 /* If the functional-cast didn't work out, try a
6660 compound-literal. */
6663 {
6668 /* Avoid calling cp_parser_type_id pointlessly, see comment
6669 in cp_parser_cast_expression about c++/29234. */
6672 else
6673 {
6674 /* Parse the type. */
6679 /* Look for the `)'. */
6681 }
6683 /* If things aren't going well, there's no need to
6684 keep going. */
6686 {
6688 /* Parse the brace-enclosed initializer list. */
6691 }
6692 /* If that worked, we're definitely looking at a
6693 compound-literal expression. */
6695 {
6696 /* Warn the user that a compound literal is not
6697 allowed in standard C++. */
6700 /* For simplicity, we disallow compound literals in
6701 constant-expressions. We could
6702 allow compound literals of integer type, whose
6703 initializer was a constant, in constant
6704 expressions. Permitting that usage, as a further
6705 extension, would not change the meaning of any
6706 currently accepted programs. (Of course, as
6707 compound literals are not part of ISO C++, the
6708 standard has nothing to say.) */
6710 NIC_NCC))
6711 {
6714 }
6715 /* Form the representation of the compound-literal. */
6716 postfix_expression
6718 tf_warning_or_error);
6721 }
6722 }
6724 /* It must be a primary-expression. */
6725 postfix_expression
6728 decltype_p,
6730 }
6732 }
6734 /* Note that we don't need to worry about calling build_cplus_new on a
6735 class-valued CALL_EXPR in decltype when it isn't the end of the
6736 postfix-expression; unary_complex_lvalue will take care of that for
6737 all these cases. */
6739 /* Keep looping until the postfix-expression is complete. */
6741 {
6745 /* It is not a Koenig lookup function call. */
6746 postfix_expression
6749 /* Peek at the next token. */
6753 {
6756 {
6758 "two consecutive %<[%> shall "
6761 }
6762 postfix_expression
6764 postfix_expression,
6766 decltype_p);
6775 /* postfix-expression ( expression-list [opt] ) */
6776 {
6787 is_builtin_constant_p
6790 {
6791 /* The whole point of __builtin_constant_p is to allow
6792 non-constant expressions to appear as arguments. */
6793 saved_integral_constant_expression_p
6795 saved_non_integral_constant_expression_p
6798 }
6799 args = (cp_parser_parenthesized_expression_list
6805 {
6806 parser->integral_constant_expression_p
6808 parser->non_integral_constant_expression_p
6810 }
6813 {
6816 }
6818 /* Function calls are not permitted in
6819 constant-expressions. */
6822 NIC_FUNC_CALL))
6823 {
6827 }
6832 {
6834 {
6836 {
6839 postfix_expression
6841 complain);
6842 }
6843 else
6844 postfix_expression
6846 }
6847 /* We do not perform argument-dependent lookup if
6848 normal lookup finds a non-function, in accordance
6849 with the expected resolution of DR 218. */
6852 {
6856 /* Do not do argument dependent lookup if regular
6857 lookup finds a member function or a block-scope
6858 function declaration. [basic.lookup.argdep]/3 */
6861 {
6864 postfix_expression
6866 complain);
6867 }
6868 }
6869 }
6875 {
6884 }
6887 {
6897 {
6898 postfix_expression
6902 }
6905 {
6906 postfix_expression
6907 = (build_new_method_call
6913 complain));
6914 }
6915 else
6916 postfix_expression
6920 complain);
6921 }
6925 postfix_expression = (build_offset_ref_call_from_tree
6927 complain));
6929 /* A call to a static class member, or a namespace-scope
6930 function. */
6931 postfix_expression
6934 koenig_p,
6935 complain);
6936 else
6937 /* All other function calls. */
6938 postfix_expression
6941 koenig_p,
6942 complain);
6945 {
6947 start_loc,
6948 close_paren_loc);
6950 }
6952 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6956 }
6961 /* postfix-expression . template [opt] id-expression
6962 postfix-expression . pseudo-destructor-name
6963 postfix-expression -> template [opt] id-expression
6964 postfix-expression -> pseudo-destructor-name */
6966 /* Consume the `.' or `->' operator. */
6969 postfix_expression
6971 postfix_expression,
6978 /* postfix-expression ++ */
6979 /* Consume the `++' token. */
6981 /* Generate a representation for the complete expression. */
6982 postfix_expression
6984 POSTINCREMENT_EXPR);
6985 /* Increments may not appear in constant-expressions. */
6993 /* postfix-expression -- */
6994 /* Consume the `--' token. */
6996 /* Generate a representation for the complete expression. */
6997 postfix_expression
6999 POSTDECREMENT_EXPR);
7000 /* Decrements may not appear in constant-expressions. */
7011 return is_member_access
7012 ? postfix_expression
7014 else
7016 }
7017 }
7019 /* We should never get here. */
7022 }
7024 /* This function parses Cilk Plus array notations. If a normal array expr. is
7025 parsed then the array index is passed back to the caller through *INIT_INDEX
7026 and the function returns a NULL_TREE. If array notation expr. is parsed,
7027 then *INIT_INDEX is ignored by the caller and the function returns
7028 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7029 error_mark_node. */
7031 static tree
7033 tree array_value)
7034 {
7038 {
7041 }
7050 {
7053 }
7055 {
7056 /* Consume the ':'. */
7059 /* If we are here, then we have a case like this A[:]. */
7061 {
7065 }
7069 }
7070 else
7071 {
7072 /* If we are here, then there are three valid possibilities:
7073 1. ARRAY [ EXP ]
7074 2. ARRAY [ EXP : EXP ]
7075 3. ARRAY [ EXP : EXP : EXP ] */
7079 {
7080 /* This indicates that we have a normal array expression. */
7083 }
7085 /* Consume the ':'. */
7089 {
7092 }
7093 }
7098 {
7102 }
7108 }
7110 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7111 by cp_parser_builtin_offsetof. We're looking for
7113 postfix-expression [ expression ]
7114 postfix-expression [ braced-init-list ] (C++11)
7116 FOR_OFFSETOF is set if we're being called in that context, which
7117 changes how we deal with integer constant expressions. */
7119 static tree
7121 tree postfix_expression,
7124 {
7129 /* Consume the `[' token. */
7135 /* Parse the index expression. */
7136 /* ??? For offsetof, there is a question of what to allow here. If
7137 offsetof is not being used in an integral constant expression context,
7138 then we *could* get the right answer by computing the value at runtime.
7139 If we are in an integral constant expression context, then we might
7140 could accept any constant expression; hard to say without analysis.
7141 Rather than open the barn door too wide right away, allow only integer
7142 constant expressions here. */
7145 else
7146 {
7148 {
7155 {
7157 "braced list index is not allowed with array "
7161 }
7162 }
7164 {
7165 /* Here are have these two options:
7166 ARRAY[EXP : EXP] - Array notation expr with default
7167 stride of 1.
7168 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7169 stride. */
7171 postfix_expression);
7174 }
7175 else
7177 }
7181 /* Look for the closing `]'. */
7184 /* Build the ARRAY_REF. */
7188 /* When not doing offsetof, array references are not permitted in
7189 constant-expressions. */
7195 }
7197 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7198 by cp_parser_builtin_offsetof. We're looking for
7200 postfix-expression . template [opt] id-expression
7201 postfix-expression . pseudo-destructor-name
7202 postfix-expression -> template [opt] id-expression
7203 postfix-expression -> pseudo-destructor-name
7205 FOR_OFFSETOF is set if we're being called in that context. That sorta
7206 limits what of the above we'll actually accept, but nevermind.
7207 TOKEN_TYPE is the "." or "->" token, which will already have been
7208 removed from the stream. */
7210 static tree
7213 cp_expr postfix_expression,
7215 location_t location)
7216 {
7217 tree name;
7223 /* If this is a `->' operator, dereference the pointer. */
7226 tf_warning_or_error);
7227 /* Check to see whether or not the expression is type-dependent and
7228 not the current instantiation. */
7230 /* The identifier following the `->' or `.' is not qualified. */
7236 /* Enter the scope corresponding to the type of the object
7237 given by the POSTFIX_EXPRESSION. */
7239 {
7241 /* According to the standard, no expression should ever have
7242 reference type. Unfortunately, we do not currently match
7243 the standard in this respect in that our internal representation
7244 of an expression may have reference type even when the standard
7245 says it does not. Therefore, we have to manually obtain the
7246 underlying type here. */
7248 /* The type of the POSTFIX_EXPRESSION must be complete. */
7249 /* Unlike the object expression in other contexts, *this is not
7250 required to be of complete type for purposes of class member
7251 access (5.2.5) outside the member function body. */
7253 && !(processing_template_decl
7254 && current_class_type
7255 && (same_type_ignoring_top_level_qualifiers_p
7258 /* Let the name lookup machinery know that we are processing a
7259 class member access expression. */
7261 /* If something went wrong, we want to be able to discern that case,
7262 as opposed to the case where there was no SCOPE due to the type
7263 of expression being dependent. */
7266 /* If the SCOPE was erroneous, make the various semantic analysis
7267 functions exit quickly -- and without issuing additional error
7268 messages. */
7271 }
7272 else
7273 /* Tell cp_parser_lookup_name that there was an object, even though it's
7274 type-dependent. */
7277 /* Assume this expression is not a pseudo-destructor access. */
7280 /* If the SCOPE is a scalar type, then, if this is a valid program,
7281 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7282 is type dependent, it can be pseudo-destructor-name or something else.
7283 Try to parse it as pseudo-destructor-name first. */
7285 {
7286 tree s;
7287 tree type;
7290 /* Parse the pseudo-destructor-name. */
7299 {
7301 postfix_expression
7304 }
7305 }
7308 {
7309 /* If the SCOPE is not a scalar type, we are looking at an
7310 ordinary class member access expression, rather than a
7311 pseudo-destructor-name. */
7314 /* Parse the id-expression. */
7315 name = (cp_parser_id_expression
7322 /* In general, build a SCOPE_REF if the member name is qualified.
7323 However, if the name was not dependent and has already been
7324 resolved; there is no need to build the SCOPE_REF. For example;
7326 struct X { void f(); };
7327 template <typename T> void f(T* t) { t->X::f(); }
7329 Even though "t" is dependent, "X::f" is not and has been resolved
7330 to a BASELINK; there is no need to include scope information. */
7332 /* But we do need to remember that there was an explicit scope for
7333 virtual function calls. */
7337 /* If the name is a template-id that names a type, we will get a
7338 TYPE_DECL here. That is invalid code. */
7340 {
7343 }
7344 else
7345 {
7347 {
7349 {
7353 }
7354 else
7357 name,
7358 template_p);
7362 }
7364 adjust_result_of_qualified_name_lookup
7366 postfix_expression
7368 template_p,
7369 tf_warning_or_error);
7370 /* Build a location e.g.:
7371 ptr->access_expr
7372 ~~~^~~~~~~~~~~~~
7373 where the caret is at the deref token, ranging from
7374 the start of postfix_expression to the end of the access expr. */
7375 location_t end_loc
7377 location_t combined_loc
7380 }
7381 }
7383 /* We no longer need to look up names in the scope of the object on
7384 the left-hand side of the `.' or `->' operator. */
7387 /* Outside of offsetof, these operators may not appear in
7388 constant-expressions. */
7390 && (cp_parser_non_integral_constant_expression
7395 }
7397 /* Parse a parenthesized expression-list.
7399 expression-list:
7400 assignment-expression
7401 expression-list, assignment-expression
7403 attribute-list:
7404 expression-list
7405 identifier
7406 identifier, expression-list
7408 CAST_P is true if this expression is the target of a cast.
7410 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7411 argument pack.
7413 Returns a vector of trees. Each element is a representation of an
7414 assignment-expression. NULL is returned if the ( and or ) are
7415 missing. An empty, but allocated, vector is returned on no
7416 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7417 if we are parsing an attribute list for an attribute that wants a
7418 plain identifier argument, normal_attr for an attribute that wants
7419 an expression, or non_attr if we aren't parsing an attribute list. If
7420 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7421 not all of the expressions in the list were constant.
7422 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7423 will be written to with the location of the closing parenthesis. If
7424 an error occurs, it may or may not be written to. */
7433 {
7439 /* Assume all the expressions will be constant. */
7448 /* Within a parenthesized expression, a `>' token is always
7449 the greater-than operator. */
7450 saved_greater_than_is_operator_p
7454 /* Consume expressions until there are no more. */
7457 {
7458 tree expr;
7460 /* At the beginning of attribute lists, check to see if the
7461 next token is an identifier. */
7464 {
7467 /* Consume the identifier. */
7469 /* Save the identifier. */
7471 }
7472 else
7473 {
7476 /* Parse the next assignment-expression. */
7478 {
7479 /* A braced-init-list. */
7485 }
7487 {
7488 expr = (cp_parser_constant_expression
7493 }
7494 else
7496 cast_p);
7501 /* If we have an ellipsis, then this is an expression
7502 expansion. */
7505 {
7506 /* Consume the `...'. */
7509 /* Build the argument pack. */
7511 }
7513 /* Add it to the list. We add error_mark_node
7514 expressions to the list, so that we can still tell if
7515 the correct form for a parenthesized expression-list
7516 is found. That gives better errors. */
7521 }
7523 /* After the first item, attribute lists look the same as
7524 expression lists. */
7527 get_comma:;
7528 /* If the next token isn't a `,', then we are done. */
7532 /* Otherwise, consume the `,' and keep going. */
7534 }
7540 {
7543 skip_comma:;
7544 /* We try and resync to an unnested comma, as that will give the
7545 user better diagnostics. */
7553 {
7554 parser->greater_than_is_operator_p
7557 }
7558 }
7560 parser->greater_than_is_operator_p
7567 }
7569 /* Parse a pseudo-destructor-name.
7571 pseudo-destructor-name:
7572 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7573 :: [opt] nested-name-specifier template template-id :: ~ type-name
7574 :: [opt] nested-name-specifier [opt] ~ type-name
7576 If either of the first two productions is used, sets *SCOPE to the
7577 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7578 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7579 or ERROR_MARK_NODE if the parse fails. */
7581 static void
7583 tree object,
7586 {
7589 /* Handle ~auto. */
7593 {
7596 "%<~auto%> only available with "
7603 }
7605 /* Assume that things will not work out. */
7608 /* Look for the optional `::' operator. */
7610 /* Look for the optional nested-name-specifier. */
7611 nested_name_specifier_p
7618 /* Now, if we saw a nested-name-specifier, we might be doing the
7619 second production. */
7622 {
7623 /* Consume the `template' keyword. */
7625 /* Parse the template-id. */
7629 class_type,
7631 /* Look for the `::' token. */
7633 }
7634 /* If the next token is not a `~', then there might be some
7635 additional qualification. */
7637 {
7638 /* At this point, we're looking for "type-name :: ~". The type-name
7639 must not be a class-name, since this is a pseudo-destructor. So,
7640 it must be either an enum-name, or a typedef-name -- both of which
7641 are just identifiers. So, we peek ahead to check that the "::"
7642 and "~" tokens are present; if they are not, then we can avoid
7643 calling type_name. */
7647 {
7650 }
7652 /* Look for the type-name. */
7657 /* Look for the `::' token. */
7659 }
7660 else
7663 /* Look for the `~'. */
7666 /* Once we see the ~, this has to be a pseudo-destructor. */
7670 /* Look for the type-name again. We are not responsible for
7671 checking that it matches the first type-name. */
7673 }
7675 /* Parse a unary-expression.
7677 unary-expression:
7678 postfix-expression
7679 ++ cast-expression
7680 -- cast-expression
7681 unary-operator cast-expression
7682 sizeof unary-expression
7683 sizeof ( type-id )
7684 alignof ( type-id ) [C++0x]
7685 new-expression
7686 delete-expression
7688 GNU Extensions:
7690 unary-expression:
7691 __extension__ cast-expression
7692 __alignof__ unary-expression
7693 __alignof__ ( type-id )
7694 alignof unary-expression [C++0x]
7695 __real__ cast-expression
7696 __imag__ cast-expression
7697 && identifier
7698 sizeof ( type-id ) { initializer-list , [opt] }
7699 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7700 __alignof__ ( type-id ) { initializer-list , [opt] }
7702 ADDRESS_P is true iff the unary-expression is appearing as the
7703 operand of the `&' operator. CAST_P is true if this expression is
7704 the target of a cast.
7706 Returns a representation of the expression. */
7708 static cp_expr
7711 {
7715 /* Peek at the next token. */
7717 /* Some keywords give away the kind of expression. */
7719 {
7723 {
7726 {
7729 location_t first_loc;
7732 /* Consume the token. */
7735 /* Parse the operand. */
7740 else
7741 {
7742 /* ISO C++ defines alignof only with types, not with
7743 expressions. So pedwarn if alignof is used with a non-
7744 type expression. However, __alignof__ is ok. */
7747 "ISO C++ does not allow %<alignof%> "
7751 }
7752 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7753 SIZEOF_EXPR with the original operand. */
7755 {
7757 {
7759 {
7762 error_mark_node));
7764 }
7765 else
7769 }
7771 }
7773 }
7782 {
7783 /* The saved value of the PEDANTIC flag. */
7785 tree expr;
7787 /* Save away the PEDANTIC flag. */
7789 /* Parse the cast-expression. */
7791 /* Restore the PEDANTIC flag. */
7795 }
7799 {
7800 tree expression;
7802 /* Consume the `__real__' or `__imag__' token. */
7804 /* Parse the cast-expression. */
7806 /* Create the complete representation. */
7810 expression,
7811 tf_warning_or_error);
7812 }
7820 {
7821 tree expr;
7831 parser->type_definition_forbidden_message
7834 saved_integral_constant_expression_p
7836 saved_non_integral_constant_expression_p
7840 saved_greater_than_is_operator_p
7852 parser->greater_than_is_operator_p
7855 parser->integral_constant_expression_p
7857 parser->non_integral_constant_expression_p
7864 }
7868 }
7869 }
7871 /* Look for the `:: new' and `:: delete', which also signal the
7872 beginning of a new-expression, or delete-expression,
7873 respectively. If the next token is `::', then it might be one of
7874 these. */
7876 {
7879 /* See if the token after the `::' is one of the keywords in
7880 which we're interested. */
7882 /* If it's `new', we have a new-expression. */
7885 /* Similarly, for `delete'. */
7888 }
7890 /* Look for a unary operator. */
7892 /* The `++' and `--' operators can be handled similarly, even though
7893 they are not technically unary-operators in the grammar. */
7895 {
7900 /* Handle the GNU address-of-label extension. */
7903 {
7904 tree identifier;
7905 tree expression;
7908 /* Consume the '&&' token. */
7910 /* Look for the identifier. */
7911 location_t finish_loc
7914 /* Construct a location of the form:
7915 &&label
7916 ^~~~~~~
7917 with caret==start at the "&&", finish at the end of the label. */
7918 location_t combined_loc
7920 /* Create an expression representing the address. */
7923 NIC_ADDR_LABEL))
7926 }
7927 }
7929 {
7930 cp_expr cast_expression;
7936 /* Consume the operator token. */
7940 /* Parse the cast-expression. */
7941 cast_expression
7946 pidk);
7948 /* Make a location:
7949 OP_TOKEN CAST_EXPRESSION
7950 ^~~~~~~~~~~~~~~~~~~~~~~~~
7951 with start==caret at the operator token, and
7952 extending to the end of the cast_expression. */
7955 /* Now, build an appropriate representation. */
7957 {
7961 RO_UNARY_STAR,
7962 complain);
7963 /* TODO: build_x_indirect_ref does not always honor the
7964 location, so ensure it is set. */
7970 /* Fall through. */
7973 cast_expression,
7974 complain);
7975 /* TODO: build_x_unary_op does not always honor the location,
7976 so ensure it is set. */
7984 /* Fall through. */
7986 /* Immediately fold negation of a constant, unless the constant is 0
7987 (since -0 == 0) or it would overflow. */
7992 {
7995 cast_expression);
7997 {
8000 }
8001 }
8002 /* Fall through. */
8011 }
8015 non_constant_p))
8019 }
8023 decltype_p,
8024 pidk);
8025 }
8027 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8028 unary-operator, the corresponding tree code is returned. */
8030 static enum tree_code
8032 {
8034 {
8055 }
8056 }
8058 /* Parse a new-expression.
8060 new-expression:
8061 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8062 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8064 Returns a representation of the expression. */
8066 static tree
8068 {
8071 tree type;
8074 tree ret;
8078 /* Look for the optional `::' operator. */
8079 global_scope_p
8083 /* Look for the `new' operator. */
8085 /* There's no easy way to tell a new-placement from the
8086 `( type-id )' construct. */
8088 /* Look for a new-placement. */
8090 /* If that didn't work out, there's no new-placement. */
8092 {
8096 }
8098 /* If the next token is a `(', then we have a parenthesized
8099 type-id. */
8101 {
8105 /* Consume the `('. */
8108 /* Parse the type-id. */
8109 parser->type_definition_forbidden_message
8111 {
8114 }
8117 /* Look for the closing `)'. */
8120 /* There should not be a direct-new-declarator in this production,
8121 but GCC used to allowed this, so we check and emit a sensible error
8122 message for this case. */
8124 {
8130 }
8131 }
8132 /* Otherwise, there must be a new-type-id. */
8133 else
8136 /* If the next token is a `(' or '{', then we have a new-initializer. */
8141 else
8144 /* A new-expression may not appear in an integral constant
8145 expression. */
8148 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8149 of a new-type-id or type-id of a new-expression, the new-expression shall
8150 contain a new-initializer of the form ( assignment-expression )".
8151 Additionally, consistently with the spirit of DR 1467, we want to accept
8152 'new auto { 2 }' too. */
8157 {
8159 "initialization of new-expression for type %<auto%> "
8162 }
8163 else
8164 {
8165 /* Construct a location e.g.:
8166 ptr = new int[100]
8167 ^~~~~~~~~~~~
8168 with caret == start at the start of the "new" token, and the end
8169 at the end of the final token we consumed. */
8174 /* Create a representation of the new-expression. */
8176 tf_warning_or_error);
8178 }
8186 }
8188 /* Parse a new-placement.
8190 new-placement:
8191 ( expression-list )
8193 Returns the same representation as for an expression-list. */
8197 {
8200 /* Parse the expression-list. */
8201 expression_list = (cp_parser_parenthesized_expression_list
8210 }
8212 /* Parse a new-type-id.
8214 new-type-id:
8215 type-specifier-seq new-declarator [opt]
8217 Returns the TYPE allocated. If the new-type-id indicates an array
8218 type, *NELTS is set to the number of elements in the last array
8219 bound; the TYPE will not include the last array bound. */
8221 static tree
8223 {
8224 cp_decl_specifier_seq type_specifier_seq;
8230 /* The type-specifier sequence must not contain type definitions.
8231 (It cannot contain declarations of new types either, but if they
8232 are not definitions we will catch that because they are not
8233 complete.) */
8235 parser->type_definition_forbidden_message
8237 /* Parse the type-specifier-seq. */
8241 /* Restore the old message. */
8247 /* Parse the new-declarator. */
8250 /* Determine the number of elements in the last array dimension, if
8251 any. */
8253 /* Skip down to the last array dimension. */
8258 {
8261 }
8266 {
8269 }
8272 {
8279 else
8281 }
8284 }
8286 /* Parse an (optional) new-declarator.
8288 new-declarator:
8289 ptr-operator new-declarator [opt]
8290 direct-new-declarator
8292 Returns the declarator. */
8296 {
8299 cp_cv_quals cv_quals;
8301 /* We don't know if there's a ptr-operator next, or not. */
8303 /* Look for a ptr-operator. */
8305 /* If that worked, look for more new-declarators. */
8307 {
8310 /* Parse another optional declarator. */
8313 declarator = cp_parser_make_indirect_declarator
8317 }
8319 /* If the next token is a `[', there is a direct-new-declarator. */
8324 }
8326 /* Parse a direct-new-declarator.
8328 direct-new-declarator:
8329 [ expression ]
8330 direct-new-declarator [constant-expression]
8332 */
8336 {
8340 {
8341 tree expression;
8344 /* Look for the opening `['. */
8349 /* The standard requires that the expression have integral
8350 type. DR 74 adds enumeration types. We believe that the
8351 real intent is that these expressions be handled like the
8352 expression in a `switch' condition, which also allows
8353 classes with a single conversion to integral or
8354 enumeration type. */
8356 {
8357 expression
8359 expression,
8362 {
8364 "expression in new-declarator must have integral "
8367 }
8368 }
8370 /* Look for the closing `]'. */
8373 /* Add this bound to the declarator. */
8376 /* If the next token is not a `[', then there are no more
8377 bounds. */
8380 }
8383 }
8385 /* Parse a new-initializer.
8387 new-initializer:
8388 ( expression-list [opt] )
8389 braced-init-list
8391 Returns a representation of the expression-list. */
8395 {
8399 {
8400 tree t;
8407 }
8408 else
8409 expression_list = (cp_parser_parenthesized_expression_list
8415 }
8417 /* Parse a delete-expression.
8419 delete-expression:
8420 :: [opt] delete cast-expression
8421 :: [opt] delete [ ] cast-expression
8423 Returns a representation of the expression. */
8425 static tree
8427 {
8430 tree expression;
8432 /* Look for the optional `::' operator. */
8433 global_scope_p
8437 /* Look for the `delete' keyword. */
8439 /* See if the array syntax is in use. */
8441 {
8442 /* Consume the `[' token. */
8444 /* Look for the `]' token. */
8446 /* Remember that this is the `[]' construct. */
8448 }
8449 else
8452 /* Parse the cast-expression. */
8455 /* A delete-expression may not appear in an integral constant
8456 expression. */
8461 tf_warning_or_error);
8462 }
8464 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8465 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8466 0 otherwise. */
8468 static int
8470 {
8473 {
8515 /* In ((type ()) () the last () isn't a valid cast-expression,
8516 so the whole must be parsed as postfix-expression. */
8521 /* '[' may start a primary-expression in obj-c++ and in C++11,
8522 as a lambda-expression, eg, '(void)[]{}'. */
8529 /* '++' and '--' may or may not start a cast-expression:
8531 struct T { void operator++(int); };
8532 void f() { (T())++; }
8534 vs
8536 int a;
8537 (int)++a; */
8542 }
8543 }
8545 /* Parse a cast-expression.
8547 cast-expression:
8548 unary-expression
8549 ( type-id ) cast-expression
8551 ADDRESS_P is true iff the unary-expression is appearing as the
8552 operand of the `&' operator. CAST_P is true if this expression is
8553 the target of a cast.
8555 Returns a representation of the expression. */
8557 static cp_expr
8560 {
8561 /* If it's a `(', then we might be looking at a cast. */
8563 {
8569 /* There's no way to know yet whether or not this is a cast.
8570 For example, `(int (3))' is a unary-expression, while `(int)
8571 3' is a cast. So, we resort to parsing tentatively. */
8573 /* Types may not be defined in a cast. */
8575 parser->type_definition_forbidden_message
8577 /* Consume the `('. */
8581 /* A very tricky bit is that `(struct S) { 3 }' is a
8582 compound-literal (which we permit in C++ as an extension).
8583 But, that construct is not a cast-expression -- it is a
8584 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8585 is legal; if the compound-literal were a cast-expression,
8586 you'd need an extra set of parentheses.) But, if we parse
8587 the type-id, and it happens to be a class-specifier, then we
8588 will commit to the parse at that point, because we cannot
8589 undo the action that is done when creating a new class. So,
8590 then we cannot back up and do a postfix-expression.
8592 Another tricky case is the following (c++/29234):
8594 struct S { void operator () (); };
8596 void foo ()
8597 {
8598 ( S()() );
8599 }
8601 As a type-id we parse the parenthesized S()() as a function
8602 returning a function, groktypename complains and we cannot
8603 back up in this case either.
8605 Therefore, we scan ahead to the closing `)', and check to see
8606 if the tokens after the `)' can start a cast-expression. Otherwise
8607 we are dealing with an unary-expression, a postfix-expression
8608 or something else.
8610 Yet another tricky case, in C++11, is the following (c++/54891):
8612 (void)[]{};
8614 The issue is that usually, besides the case of lambda-expressions,
8615 the parenthesized type-id cannot be followed by '[', and, eg, we
8616 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8617 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8618 we don't commit, we try a cast-expression, then an unary-expression.
8620 Save tokens so that we can put them back. */
8623 /* We may be looking at a cast-expression. */
8626 cast_expression
8629 /* Roll back the tokens we skipped. */
8631 /* If we aren't looking at a cast-expression, simulate an error so
8632 that the call to cp_parser_error_occurred below returns true. */
8635 else
8636 {
8639 /* Look for the type-id. */
8641 /* Look for the closing `)'. */
8644 }
8646 /* Restore the saved message. */
8649 /* At this point this can only be either a cast or a
8650 parenthesized ctor such as `(T ())' that looks like a cast to
8651 function returning T. */
8653 {
8654 /* Only commit if the cast-expression doesn't start with
8655 '++', '--', or '[' in C++11. */
8663 pidk);
8666 {
8667 /* Warn about old-style casts, if so requested. */
8674 /* Only type conversions to integral or enumeration types
8675 can be used in constant-expressions. */
8678 NIC_CAST))
8681 /* Perform the cast. */
8682 /* Make a location:
8683 (TYPE) EXPR
8684 ^~~~~~~~~~~
8685 with start==caret at the open paren, extending to the
8686 end of "expr". */
8688 open_paren_loc,
8692 }
8693 }
8694 else
8696 }
8698 /* If we get here, then it's not a cast, so it must be a
8699 unary-expression. */
8702 }
8704 /* Parse a binary expression of the general form:
8706 pm-expression:
8707 cast-expression
8708 pm-expression .* cast-expression
8709 pm-expression ->* cast-expression
8711 multiplicative-expression:
8712 pm-expression
8713 multiplicative-expression * pm-expression
8714 multiplicative-expression / pm-expression
8715 multiplicative-expression % pm-expression
8717 additive-expression:
8718 multiplicative-expression
8719 additive-expression + multiplicative-expression
8720 additive-expression - multiplicative-expression
8722 shift-expression:
8723 additive-expression
8724 shift-expression << additive-expression
8725 shift-expression >> additive-expression
8727 relational-expression:
8728 shift-expression
8729 relational-expression < shift-expression
8730 relational-expression > shift-expression
8731 relational-expression <= shift-expression
8732 relational-expression >= shift-expression
8734 GNU Extension:
8736 relational-expression:
8737 relational-expression <? shift-expression
8738 relational-expression >? shift-expression
8740 equality-expression:
8741 relational-expression
8742 equality-expression == relational-expression
8743 equality-expression != relational-expression
8745 and-expression:
8746 equality-expression
8747 and-expression & equality-expression
8749 exclusive-or-expression:
8750 and-expression
8751 exclusive-or-expression ^ and-expression
8753 inclusive-or-expression:
8754 exclusive-or-expression
8755 inclusive-or-expression | exclusive-or-expression
8757 logical-and-expression:
8758 inclusive-or-expression
8759 logical-and-expression && inclusive-or-expression
8761 logical-or-expression:
8762 logical-and-expression
8763 logical-or-expression || logical-and-expression
8765 All these are implemented with a single function like:
8767 binary-expression:
8768 simple-cast-expression
8769 binary-expression <token> binary-expression
8771 CAST_P is true if this expression is the target of a cast.
8773 The binops_by_token map is used to get the tree codes for each <token> type.
8774 binary-expressions are associated according to a precedence table. */
8776 #define TOKEN_PRECEDENCE(token) \
8777 (((token->type == CPP_GREATER \
8778 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8779 && !parser->greater_than_is_operator_p) \
8780 ? PREC_NOT_OPERATOR \
8781 : binops_by_token[token->type].prec)
8783 static cp_expr
8789 {
8790 cp_parser_expression_stack stack;
8792 cp_parser_expression_stack_entry current;
8793 cp_expr rhs;
8797 tree overload;
8799 /* Parse the first expression. */
8810 {
8811 /* Get an operator token. */
8817 {
8819 "%<>>%> operator is treated"
8823 }
8828 /* This is a fold-expression; handle it later. */
8831 /* Popping an entry off the stack means we completed a subexpression:
8832 - either we found a token which is not an operator (`>' where it is not
8833 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8834 will happen repeatedly;
8835 - or, we found an operator which has lower priority. This is the case
8836 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8837 parsing `3 * 4'. */
8839 {
8842 else
8844 }
8846 get_rhs:
8850 /* We used the operator token. */
8853 /* For "false && x" or "true || x", x will never be executed;
8854 disable warnings while evaluating it. */
8856 c_inhibit_evaluation_warnings +=
8859 c_inhibit_evaluation_warnings +=
8862 /* Extract another operand. It may be the RHS of this expression
8863 or the LHS of a new, higher priority expression. */
8868 /* Get another operator token. Look up its precedence to avoid
8869 building a useless (immediately popped) stack entry for common
8870 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8877 {
8878 /* ... and prepare to parse the RHS of the new, higher priority
8879 expression. Since precedence levels on the stack are
8880 monotonically increasing, we do not have to care about
8881 stack overflows. */
8890 pop:
8892 /* If the stack is not empty, we have parsed into LHS the right side
8893 (`4' in the example above) of an expression we had suspended.
8894 We can use the information on the stack to recover the LHS (`3')
8895 from the stack together with the tree code (`MULT_EXPR'), and
8896 the precedence of the higher level subexpression
8897 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8898 which will be used to actually build the additive expression. */
8903 }
8905 /* Undo the disabling of warnings done above. */
8907 c_inhibit_evaluation_warnings -=
8910 c_inhibit_evaluation_warnings -=
8916 /* Avoid warning for !!x == y. */
8921 /* Avoid warning for !b == y where b is boolean. */
8925 /* Avoid warning for !!b == y where b is boolean. */
8938 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8939 ERROR_MARK for everything that is not a binary expression.
8940 This makes warn_about_parentheses miss some warnings that
8941 involve unary operators. For unary expressions we should
8942 pass the correct tree_code unless the unary expression was
8943 surrounded by parentheses.
8944 */
8951 == tcc_comparison
8954 else
8955 {
8960 /* TODO: build_x_binary_op doesn't always honor the location. */
8962 }
8965 /* If the binary operator required the use of an overloaded operator,
8966 then this expression cannot be an integral constant-expression.
8967 An overloaded operator can be used even if both operands are
8968 otherwise permissible in an integral constant-expression if at
8969 least one of the operands is of enumeration type. */
8973 NIC_OVERLOADED))
8975 }
8978 }
8980 static cp_expr
8985 {
8988 }
8990 /* Parse the `? expression : assignment-expression' part of a
8991 conditional-expression. The LOGICAL_OR_EXPR is the
8992 logical-or-expression that started the conditional-expression.
8993 Returns a representation of the entire conditional-expression.
8995 This routine is used by cp_parser_assignment_expression.
8997 ? expression : assignment-expression
8999 GNU Extensions:
9001 ? : assignment-expression */
9003 static tree
9005 {
9007 cp_expr assignment_expr;
9011 /* Consume the `?' token. */
9016 {
9019 /* Implicit true clause. */
9021 c_inhibit_evaluation_warnings +=
9024 }
9025 else
9026 {
9029 /* Parse the expression. */
9030 c_inhibit_evaluation_warnings +=
9033 c_inhibit_evaluation_warnings +=
9037 }
9039 /* The next token should be a `:'. */
9041 /* Parse the assignment-expression. */
9043 c_inhibit_evaluation_warnings -=
9046 /* Make a location:
9047 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9048 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9049 with the caret at the "?", ranging from the start of
9050 the logical_or_expr to the end of the assignment_expr. */
9055 /* Build the conditional-expression. */
9057 expr,
9058 assignment_expr,
9059 tf_warning_or_error);
9060 }
9062 /* Parse an assignment-expression.
9064 assignment-expression:
9065 conditional-expression
9066 logical-or-expression assignment-operator assignment_expression
9067 throw-expression
9069 CAST_P is true if this expression is the target of a cast.
9070 DECLTYPE_P is true if this expression is the operand of decltype.
9072 Returns a representation for the expression. */
9074 static cp_expr
9077 {
9078 cp_expr expr;
9080 /* If the next token is the `throw' keyword, then we're looking at
9081 a throw-expression. */
9084 /* Otherwise, it must be that we are looking at a
9085 logical-or-expression. */
9086 else
9087 {
9088 /* Parse the binary expressions (logical-or-expression). */
9090 decltype_p,
9092 /* If the next token is a `?' then we're actually looking at a
9093 conditional-expression. */
9096 else
9097 {
9100 /* If it's an assignment-operator, we're using the second
9101 production. */
9102 enum tree_code assignment_operator
9105 {
9108 /* Parse the right-hand side of the assignment. */
9115 /* An assignment may not appear in a
9116 constant-expression. */
9118 NIC_ASSIGNMENT))
9120 /* Build the assignment expression. Its default
9121 location:
9122 LHS = RHS
9123 ~~~~^~~~~
9124 is the location of the '=' token as the
9125 caret, ranging from the start of the lhs to the
9126 end of the rhs. */
9131 assignment_operator,
9132 rhs,
9134 /* TODO: build_x_modify_expr doesn't honor the location,
9135 so we must set it here. */
9137 }
9138 }
9139 }
9142 }
9144 /* Parse an (optional) assignment-operator.
9146 assignment-operator: one of
9147 = *= /= %= += -= >>= <<= &= ^= |=
9149 GNU Extension:
9151 assignment-operator: one of
9152 <?= >?=
9154 If the next token is an assignment operator, the corresponding tree
9155 code is returned, and the token is consumed. For example, for
9156 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9157 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9158 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9159 operator, ERROR_MARK is returned. */
9161 static enum tree_code
9163 {
9167 /* Peek at the next token. */
9171 {
9217 /* Nothing else is an assignment operator. */
9219 }
9221 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9226 /* If it was an assignment operator, consume it. */
9231 }
9233 /* Parse an expression.
9235 expression:
9236 assignment-expression
9237 expression , assignment-expression
9239 CAST_P is true if this expression is the target of a cast.
9240 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9241 except possibly parenthesized or on the RHS of a comma (N3276).
9243 Returns a representation of the expression. */
9245 static cp_expr
9248 {
9253 {
9254 cp_expr assignment_expression;
9256 /* Parse the next assignment-expression. */
9257 assignment_expression
9260 /* We don't create a temporary for a call that is the immediate operand
9261 of decltype or on the RHS of a comma. But when we see a comma, we
9262 need to create a temporary for a call on the LHS. */
9267 assignment_expression
9271 /* If this is the first assignment-expression, we can just
9272 save it away. */
9275 else
9276 {
9277 /* Create a location with caret at the comma, ranging
9278 from the start of the LHS to the end of the RHS. */
9283 assignment_expression,
9286 }
9287 /* If the next token is not a comma, or we're in a fold-expression, then
9288 we are done with the expression. */
9292 /* Consume the `,'. */
9295 /* A comma operator cannot appear in a constant-expression. */
9298 }
9301 }
9303 /* Parse a constant-expression.
9305 constant-expression:
9306 conditional-expression
9308 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9309 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9310 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9311 is false, NON_CONSTANT_P should be NULL. */
9313 static cp_expr
9317 {
9321 cp_expr expression;
9323 /* It might seem that we could simply parse the
9324 conditional-expression, and then check to see if it were
9325 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9326 one that the compiler can figure out is constant, possibly after
9327 doing some simplifications or optimizations. The standard has a
9328 precise definition of constant-expression, and we must honor
9329 that, even though it is somewhat more restrictive.
9331 For example:
9333 int i[(2, 3)];
9335 is not a legal declaration, because `(2, 3)' is not a
9336 constant-expression. The `,' operator is forbidden in a
9337 constant-expression. However, GCC's constant-folding machinery
9338 will fold this operation to an INTEGER_CST for `3'. */
9340 /* Save the old settings. */
9342 saved_allow_non_integral_constant_expression_p
9345 /* We are now parsing a constant-expression. */
9347 parser->allow_non_integral_constant_expression_p
9350 /* Although the grammar says "conditional-expression", we parse an
9351 "assignment-expression", which also permits "throw-expression"
9352 and the use of assignment operators. In the case that
9353 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9354 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9355 actually essential that we look for an assignment-expression.
9356 For example, cp_parser_initializer_clauses uses this function to
9357 determine whether a particular assignment-expression is in fact
9358 constant. */
9360 /* Restore the old settings. */
9361 parser->integral_constant_expression_p
9363 parser->allow_non_integral_constant_expression_p
9366 {
9367 /* Require an rvalue constant expression here; that's what our
9368 callers expect. Reference constant expressions are handled
9369 separately in e.g. cp_parser_template_argument. */
9374 }
9377 parser->non_integral_constant_expression_p
9381 }
9383 /* Parse __builtin_offsetof.
9385 offsetof-expression:
9386 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9388 offsetof-member-designator:
9389 id-expression
9390 | offsetof-member-designator "." id-expression
9391 | offsetof-member-designator "[" expression "]"
9392 | offsetof-member-designator "->" id-expression */
9394 static cp_expr
9396 {
9398 tree type;
9399 cp_expr expr;
9400 cp_id_kind dummy;
9402 location_t finish_loc;
9404 /* We're about to accept non-integral-constant things, but will
9405 definitely yield an integral constant expression. Save and
9406 restore these values around our local parsing. */
9412 /* Consume the "__builtin_offsetof" token. */
9414 /* Consume the opening `('. */
9416 /* Parse the type-id. */
9419 /* Look for the `,'. */
9423 /* Build the (type *)null that begins the traditional offsetof macro. */
9425 tf_warning_or_error);
9427 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9431 {
9434 {
9436 /* offsetof-member-designator "[" expression "]" */
9442 /* offsetof-member-designator "->" identifier */
9445 /* FALLTHRU */
9448 /* offsetof-member-designator "." identifier */
9456 /* Consume the ")" token. */
9462 /* Error. We know the following require will fail, but
9463 that gives the proper error message. */
9468 }
9469 }
9471 success:
9472 /* Make a location of the form:
9473 __builtin_offsetof (struct s, f)
9474 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9475 with caret at the type-id, ranging from the start of the
9476 "_builtin_offsetof" token to the close paren. */
9478 /* The result will be an INTEGER_CST, so we need to explicitly
9479 preserve the location. */
9482 failure:
9487 }
9489 /* Parse a trait expression.
9491 Returns a representation of the expression, the underlying type
9492 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9494 static tree
9496 {
9497 cp_trait_kind kind;
9503 {
9594 }
9596 /* Consume the token. */
9601 {
9604 }
9610 {
9613 {
9616 }
9620 }
9622 {
9624 {
9628 {
9631 }
9635 }
9636 }
9640 /* Complete the trait expression, which may mean either processing
9641 the trait expr now or saving it for template instantiation. */
9643 {
9652 }
9653 }
9655 /* Lambdas that appear in variable initializer or default argument scope
9656 get that in their mangling, so we need to record it. We might as well
9657 use the count for function and namespace scopes as well. */
9661 {
9662 tree t;
9664 };
9667 static void
9669 {
9670 tree_int ti;
9672 /* Once we're inside a function, we ignore other scopes and just push
9673 the function again so that popping works properly. */
9680 {
9681 /* Don't reset the count if we're still in the same function. */
9684 }
9685 }
9687 static void
9689 {
9692 }
9694 static void
9696 {
9699 {
9702 }
9704 }
9706 /* Parse a lambda expression.
9708 lambda-expression:
9709 lambda-introducer lambda-declarator [opt] compound-statement
9711 Returns a representation of the expression. */
9713 static cp_expr
9715 {
9717 tree type;
9725 {
9727 {
9731 }
9733 }
9735 {
9737 {
9740 }
9742 }
9744 /* We may be in the middle of deferred access check. Disable
9745 it now. */
9756 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9759 /* Now that we've started the type, add the capture fields for any
9760 explicit captures. */
9763 {
9764 /* Inside the class, surrounding template-parameter-lists do not apply. */
9765 unsigned int saved_num_template_parameter_lists
9769 bool fully_implicit_function_template_p
9773 bool auto_is_implicit_function_template_parm_p
9784 /* By virtue of defining a local class, a lambda expression has access to
9785 the private variables of enclosing classes. */
9793 {
9798 }
9800 {
9803 }
9805 /* The capture list was built up in reverse order; fix that now. */
9817 parser->fully_implicit_function_template_p
9821 parser->auto_is_implicit_function_template_parm_p
9823 }
9825 /* This field is only used during parsing of the lambda. */
9828 /* This lambda shouldn't have any proxies left at this point. */
9830 /* And now that we're done, push proxies for an enclosing lambda. */
9835 else
9843 }
9845 /* Parse the beginning of a lambda expression.
9847 lambda-introducer:
9848 [ lambda-capture [opt] ]
9850 LAMBDA_EXPR is the current representation of the lambda expression. */
9852 static void
9854 {
9855 /* Need commas after the first capture. */
9858 /* Eat the leading `['. */
9861 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9869 {
9872 }
9875 {
9877 tree capture_id;
9878 tree capture_init_expr;
9882 enum capture_kind_type
9883 {
9884 BY_COPY,
9885 BY_REFERENCE
9886 };
9890 {
9893 }
9897 else
9900 /* Possibly capture `this'. */
9902 {
9912 explicit_init_p);
9914 }
9916 /* Possibly capture `*this'. */
9919 {
9930 explicit_init_p);
9932 }
9934 /* Remember whether we want to capture as a reference or not. */
9936 {
9939 }
9941 /* Get the identifier. */
9946 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9947 delimiters, but I modified this to stop on unnested ']' as well. It
9948 was already changed to stop on unnested '}', so the
9949 "closing_parenthesis" name is no more misleading with my change. */
9950 {
9956 }
9958 /* Find the initializer for this capture. */
9962 {
9964 /* An explicit initializer exists. */
9967 "lambda capture initializers "
9973 {
9976 }
9977 }
9978 else
9979 {
9982 /* Turn the identifier into an id-expression. */
9983 capture_init_expr
9988 {
9991 }
9995 {
9998 capture_init_expr);
10002 }
10005 {
10008 capture_init_expr))
10012 }
10014 capture_init_expr
10015 = finish_id_expression
10017 capture_init_expr,
10031 {
10034 }
10035 else
10037 }
10041 {
10046 capture_id);
10050 "capture of %qD redundant with by-reference capture "
10052 }
10055 capture_id,
10056 capture_init_expr,
10058 explicit_init_p);
10059 }
10062 }
10064 /* Parse the (optional) middle of a lambda expression.
10066 lambda-declarator:
10067 < template-parameter-list [opt] >
10068 ( parameter-declaration-clause [opt] )
10069 attribute-specifier [opt]
10070 decl-specifier-seq [opt]
10071 exception-specification [opt]
10072 lambda-return-type-clause [opt]
10074 LAMBDA_EXPR is the current representation of the lambda expression. */
10076 static bool
10078 {
10079 /* 5.1.1.4 of the standard says:
10080 If a lambda-expression does not include a lambda-declarator, it is as if
10081 the lambda-declarator were ().
10082 This means an empty parameter list, no attributes, and no exception
10083 specification. */
10089 cp_decl_specifier_seq lambda_specs;
10092 /* The template-parameter-list is optional, but must begin with
10093 an opening angle if present. */
10095 {
10098 "lambda templates are only available with "
10107 /* We just processed one more parameter list. */
10109 }
10111 /* The parameter-declaration-clause is optional (unless
10112 template-parameter-list was given), but must begin with an
10113 opening parenthesis if present. */
10115 {
10120 /* Parse parameters. */
10123 /* Default arguments shall not be specified in the
10124 parameter-declaration-clause of a lambda-declarator. */
10135 /* In the decl-specifier-seq of the lambda-declarator, each
10136 decl-specifier shall either be mutable or constexpr. */
10140 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10143 {
10148 }
10152 /* Parse optional exception specification. */
10155 /* Parse optional trailing return type. */
10157 {
10161 }
10163 /* The function parameters must be in scope all the way until after the
10164 trailing-return-type in case of decltype. */
10166 }
10170 /* Create the function call operator.
10172 Messing with declarators like this is no uglier than building up the
10173 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10174 other code. */
10175 {
10176 cp_decl_specifier_seq return_type_specs;
10178 tree fco;
10185 else
10186 /* Maybe we will deduce the return type later. */
10190 {
10194 else
10197 }
10202 sfk_none);
10207 VIRT_SPEC_UNSPECIFIED,
10208 REF_QUAL_NONE,
10209 tx_qual,
10210 exception_spec,
10216 declarator,
10217 attributes);
10219 {
10222 /* Give the object parameter a different name. */
10226 }
10228 {
10232 }
10241 }
10242 }
10244 /* Parse the body of a lambda expression, which is simply
10246 compound-statement
10248 but which requires special handling.
10249 LAMBDA_EXPR is the current representation of the lambda expression. */
10251 static void
10253 {
10258 else
10259 /* Still increment function_depth so that we don't GC in the
10260 middle of an expression. */
10264 /* Clear this in case we're in the middle of a default argument. */
10267 /* Finish the function call operator
10268 - class_specifier
10269 + late_parsing_for_member
10270 + function_definition_after_declarator
10271 + ctor_initializer_opt_and_function_body */
10272 {
10274 tree body;
10276 tree compound_stmt;
10277 tree cap;
10279 /* Let the front end know that we are going to be defining this
10280 function. */
10282 NULL_TREE,
10291 /* Push the proxies for any explicit captures. */
10298 /* 5.1.1.4 of the standard says:
10299 If a lambda-expression does not include a trailing-return-type, it
10300 is as if the trailing-return-type denotes the following type:
10301 * if the compound-statement is of the form
10302 { return attribute-specifier [opt] expression ; }
10303 the type of the returned expression after lvalue-to-rvalue
10304 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10305 (_conv.array_ 4.2), and function-to-pointer conversion
10306 (_conv.func_ 4.3);
10307 * otherwise, void. */
10309 /* In a lambda that has neither a lambda-return-type-clause
10310 nor a deducible form, errors should be reported for return statements
10311 in the body. Since we used void as the placeholder return type, parsing
10312 the body as usual will give such desired behavior. */
10316 {
10320 /* Parse tentatively in case there's more after the initial return
10321 statement. */
10332 {
10334 {
10339 }
10341 /* Will get error here if type not deduced yet. */
10345 }
10346 }
10349 {
10354 }
10358 out:
10362 /* Finish the function and generate code for it if necessary. */
10365 /* Only expand if the call op is not a template. */
10368 }
10374 else
10376 }
10378 /* Statements [gram.stmt.stmt] */
10380 /* Parse a statement.
10382 statement:
10383 labeled-statement
10384 expression-statement
10385 compound-statement
10386 selection-statement
10387 iteration-statement
10388 jump-statement
10389 declaration-statement
10390 try-block
10392 C++11:
10394 statement:
10395 labeled-statement
10396 attribute-specifier-seq (opt) expression-statement
10397 attribute-specifier-seq (opt) compound-statement
10398 attribute-specifier-seq (opt) selection-statement
10399 attribute-specifier-seq (opt) iteration-statement
10400 attribute-specifier-seq (opt) jump-statement
10401 declaration-statement
10402 attribute-specifier-seq (opt) try-block
10404 init-statement:
10405 expression-statement
10406 simple-declaration
10408 TM Extension:
10410 statement:
10411 atomic-statement
10413 IN_COMPOUND is true when the statement is nested inside a
10414 cp_parser_compound_statement; this matters for certain pragmas.
10416 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10417 is a (possibly labeled) if statement which is not enclosed in braces
10418 and has an else clause. This is used to implement -Wparentheses.
10420 CHAIN is a vector of if-else-if conditions. */
10422 static void
10425 {
10430 restart:
10433 /* There is no statement yet. */
10439 /* In obj-c++, seeing '[[' might be the either the beginning of
10440 c++11 attributes, or a nested objc-message-expression. So
10441 let's parse the c++11 attributes tentatively. */
10445 {
10448 }
10450 /* Peek at the next token. */
10452 /* Remember the location of the first token in the statement. */
10454 /* If this is a keyword, then that will often determine what kind of
10455 statement we have. */
10457 {
10461 {
10464 /* Looks like a labeled-statement with a case label.
10465 Parse the label, and then use tail recursion to parse
10466 the statement. */
10484 {
10489 }
10490 else
10504 {
10509 }
10510 else
10511 {
10515 }
10519 /* Objective-C++ exception-handling constructs. */
10533 /* This must be a namespace alias definition. */
10549 /* It might be a keyword like `int' that can start a
10550 declaration-statement. */
10552 }
10553 }
10555 {
10556 /* If the next token is a `:', then we are looking at a
10557 labeled-statement. */
10560 {
10561 /* Looks like a labeled-statement with an ordinary label.
10562 Parse the label, and then use tail recursion to parse
10563 the statement. */
10568 }
10569 }
10570 /* Anything that starts with a `{' must be a compound-statement. */
10573 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10574 a statement all its own. */
10576 {
10577 /* Only certain OpenMP pragmas are attached to statements, and thus
10578 are considered statements themselves. All others are not. In
10579 the context of a compound, accept the pragma as a "statement" and
10580 return so that we can check for a close brace. Otherwise we
10581 require a real statement and must go back and read one. */
10587 }
10589 {
10592 }
10594 /* Everything else must be a declaration-statement or an
10595 expression-statement. Try for the declaration-statement
10596 first, unless we are looking at a `;', in which case we know that
10597 we have an expression-statement. */
10599 {
10601 {
10603 {
10604 /* Attributes should be parsed as part of the the
10605 declaration, so let's un-parse them. */
10608 }
10611 /* Try to parse the declaration-statement. */
10613 /* If that worked, we're done. */
10616 }
10617 /* Look for an expression-statement instead. */
10620 /* Handle [[fallthrough]];. */
10622 {
10623 /* The next token after the fallthrough attribute is ';'. */
10625 {
10626 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10628 IFN_FALLTHROUGH,
10631 }
10632 else
10636 }
10637 }
10639 /* Set the line number for the statement. */
10643 /* Allow "[[fallthrough]];", but warn otherwise. */
10646 OPT_Wattributes,
10648 }
10650 /* Parse the label for a labeled-statement, i.e.
10652 identifier :
10653 case constant-expression :
10654 default :
10656 GNU Extension:
10657 case constant-expression ... constant-expression : statement
10659 When a label is parsed without errors, the label is added to the
10660 parse tree by the finish_* functions, so this function doesn't
10661 have to return the label. */
10663 static void
10665 {
10670 /* The next token should be an identifier. */
10674 {
10677 }
10679 /* Remember whether this case or a user-defined label is allowed to fall
10680 through to. */
10685 {
10687 {
10691 /* Consume the `case' token. */
10693 /* Parse the constant-expression. */
10700 {
10701 /* Consume the `...' token. */
10707 /* We don't need to emit warnings here, as the common code
10708 will do this for us. */
10709 }
10710 else
10714 {
10718 }
10719 else
10722 expr);
10723 }
10727 /* Consume the `default' token. */
10731 {
10735 }
10736 else
10741 /* Anything else must be an ordinary label. */
10746 }
10748 /* Require the `:' token. */
10751 /* An ordinary label may optionally be followed by attributes.
10752 However, this is only permitted if the attributes are then
10753 followed by a semicolon. This is because, for backward
10754 compatibility, when parsing
10755 lab: __attribute__ ((unused)) int i;
10756 we want the attribute to attach to "i", not "lab". */
10759 {
10760 tree attrs;
10767 ;
10768 else
10770 }
10776 }
10778 /* Parse an expression-statement.
10780 expression-statement:
10781 expression [opt] ;
10783 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10784 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10785 indicates whether this expression-statement is part of an
10786 expression statement. */
10788 static tree
10790 {
10795 /* There might be attribute fallthrough. */
10798 /* If the next token is a ';', then there is no expression
10799 statement. */
10801 {
10805 {
10808 }
10809 }
10811 /* Handle [[fallthrough]];. */
10813 {
10814 /* The next token after the fallthrough attribute is ';'. */
10816 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10819 else
10823 }
10825 /* Allow "[[fallthrough]];", but warn otherwise. */
10830 /* Give a helpful message for "A<T>::type t;" and the like. */
10833 {
10840 {
10841 /* A::A a; */
10846 }
10847 }
10849 /* Consume the final `;'. */
10854 /* This is the final expression statement of a statement
10855 expression. */
10861 }
10863 /* Parse a compound-statement.
10865 compound-statement:
10866 { statement-seq [opt] }
10868 GNU extension:
10870 compound-statement:
10871 { label-declaration-seq [opt] statement-seq [opt] }
10873 label-declaration-seq:
10874 label-declaration
10875 label-declaration-seq label-declaration
10877 Returns a tree representing the statement. */
10879 static tree
10882 {
10883 tree compound_stmt;
10885 /* Consume the `{'. */
10892 /* Begin the compound-statement. */
10894 /* If the next keyword is `__label__' we have a label declaration. */
10897 /* Parse an (optional) statement-seq. */
10899 /* Finish the compound-statement. */
10901 /* Consume the `}'. */
10905 }
10907 /* Parse an (optional) statement-seq.
10909 statement-seq:
10910 statement
10911 statement-seq [opt] statement */
10913 static void
10915 {
10916 /* Scan statements until there aren't any more. */
10918 {
10921 /* If we are looking at a `}', then we have run out of
10922 statements; the same is true if we have reached the end
10923 of file, or have stumbled upon a stray '@end'. */
10930 /* If we are in a compound statement and find 'else' then
10931 something went wrong. */
10933 {
10936 else
10937 {
10940 }
10941 }
10943 /* Parse the statement. */
10945 }
10946 }
10948 /* Return true if we're looking at (init; cond), false otherwise. */
10950 static bool
10952 {
10953 /* Save tokens so that we can put them back. */
10956 /* Look for ';' that is not nested in () or {}. */
10959 CPP_SEMICOLON,
10962 /* Roll back the tokens we skipped. */
10966 }
10968 /* Parse a selection-statement.
10970 selection-statement:
10971 if ( init-statement [opt] condition ) statement
10972 if ( init-statement [opt] condition ) statement else statement
10973 switch ( init-statement [opt] condition ) statement
10975 Returns the new IF_STMT or SWITCH_STMT.
10977 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10978 is a (possibly labeled) if statement which is not enclosed in
10979 braces and has an else clause. This is used to implement
10980 -Wparentheses.
10982 CHAIN is a vector of if-else-if conditions. This is used to implement
10983 -Wduplicated-cond. */
10985 static tree
10988 {
10991 token_indent_info guard_tinfo;
10996 /* Peek at the next token. */
11000 /* See what kind of keyword it is. */
11003 {
11006 {
11007 tree statement;
11008 tree condition;
11013 RID_CONSTEXPR))
11014 {
11020 }
11022 /* Look for the `('. */
11024 {
11027 }
11029 /* Begin the selection-statement. */
11031 {
11034 }
11035 else
11038 /* Parse the optional init-statement. */
11040 {
11041 tree decl;
11044 "init-statement in selection statements only available "
11047 }
11049 /* Parse the condition. */
11051 /* Look for the `)'. */
11057 {
11061 /* Add the condition. */
11068 /* Parse the then-clause. */
11072 /* Outside a template, the non-selected branch of a constexpr
11073 if is a 'discarded statement', i.e. unevaluated. */
11078 {
11081 }
11084 guard_tinfo);
11091 {
11095 }
11097 /* If the next token is `else', parse the else-clause. */
11099 RID_ELSE))
11100 {
11104 {
11107 }
11109 guard_tinfo
11111 /* Consume the `else' keyword. */
11114 {
11116 RID_IF)
11118 {
11119 /* We've got "if (COND) else if (COND2)". Start
11120 the condition chain and add COND as the first
11121 element. */
11125 {
11126 /* Wrap it in a NOP_EXPR so that we can set the
11127 location of the condition. */
11129 condition);
11132 }
11133 }
11135 RID_IF))
11136 {
11137 /* This is if-else without subsequent if. Zap the
11138 condition chain; we would have already warned at
11139 this point. */
11142 }
11143 }
11145 /* Parse the else-clause. */
11151 /* If we are currently parsing a then-clause, then
11152 IF_P will not be NULL. We set it to true to
11153 indicate that this if statement has an else clause.
11154 This may trigger the Wparentheses warning below
11155 when we get back up to the parent if statement. */
11160 {
11164 }
11165 }
11166 else
11167 {
11168 /* This if statement does not have an else clause. If
11169 NESTED_IF is true, then the then-clause has an if
11170 statement which does have an else clause. We warn
11171 about the potential ambiguity. */
11174 "suggest explicit braces to avoid ambiguous"
11177 {
11178 /* We don't need the condition chain anymore. */
11181 }
11182 }
11184 /* Now we're all done with the if-statement. */
11186 }
11187 else
11188 {
11192 /* Add the condition. */
11195 /* Parse the body of the switch-statement. */
11201 guard_tinfo);
11205 /* Now we're all done with the switch-statement. */
11207 }
11210 }
11216 }
11217 }
11219 /* Parse a condition.
11221 condition:
11222 expression
11223 type-specifier-seq declarator = initializer-clause
11224 type-specifier-seq declarator braced-init-list
11226 GNU Extension:
11228 condition:
11229 type-specifier-seq declarator asm-specification [opt]
11230 attributes [opt] = assignment-expression
11232 Returns the expression that should be tested. */
11234 static tree
11236 {
11237 cp_decl_specifier_seq type_specifiers;
11241 /* Try the declaration first. */
11243 /* New types are not allowed in the type-specifier-seq for a
11244 condition. */
11246 parser->type_definition_forbidden_message
11248 /* Parse the type-specifier-seq. */
11250 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11253 /* Restore the saved message. */
11255 /* If all is well, we might be looking at a declaration. */
11257 {
11258 tree decl;
11259 tree asm_specification;
11260 tree attributes;
11264 /* Parse the declarator. */
11270 /* Parse the attributes. */
11272 /* Parse the asm-specification. */
11274 /* If the next token is not an `=' or '{', then we might still be
11275 looking at an expression. For example:
11277 if (A(a).x)
11279 looks like a decl-specifier-seq and a declarator -- but then
11280 there is no `=', so this is an expression. */
11285 /* If we did see an `=' or '{', then we are looking at a declaration
11286 for sure. */
11288 {
11289 tree pushed_scope;
11293 /* Create the declaration. */
11299 /* Parse the initializer. */
11301 {
11305 }
11306 else
11307 {
11308 /* Consume the `='. */
11311 }
11315 /* Process the initializer. */
11318 asm_specification,
11319 flags);
11325 }
11326 }
11327 /* If we didn't even get past the declarator successfully, we are
11328 definitely not looking at a declaration. */
11329 else
11332 /* Otherwise, we are looking at an expression. */
11334 }
11336 /* Parses a for-statement or range-for-statement until the closing ')',
11337 not included. */
11339 static tree
11341 {
11345 /* Begin the for-statement. */
11348 /* Parse the initialization. */
11353 else
11355 }
11357 static tree
11359 {
11360 /* Normal for loop */
11363 tree stmt;
11366 /* The init-statement has already been parsed in
11367 cp_parser_init_statement, so no work is needed here. */
11370 /* If there's a condition, process it. */
11374 {
11378 }
11380 /* Look for the `;'. */
11383 /* If there's an expression, process it. */
11389 }
11391 /* Tries to parse a range-based for-statement:
11393 range-based-for:
11394 decl-specifier-seq declarator : expression
11396 The decl-specifier-seq declarator and the `:' are already parsed by
11397 cp_parser_init_statement. If processing_template_decl it returns a
11398 newly created RANGE_FOR_STMT; if not, it is converted to a
11399 regular FOR_STMT. */
11401 static tree
11404 {
11409 /* Get the range declaration momentarily out of the way so that
11410 the range expression doesn't clash with it. */
11412 {
11416 }
11419 {
11422 }
11423 else
11426 /* Put the range declaration back into scope. */
11428 {
11431 }
11433 /* If in template, STMT is converted to a normal for-statement
11434 at instantiation. If not, it is done just ahead. */
11436 {
11444 /* do_auto_deduction doesn't mess with template init-lists. */
11447 }
11448 else
11449 {
11452 }
11454 }
11456 /* Subroutine of cp_convert_range_for: given the initializer expression,
11457 builds up the range temporary. */
11459 static tree
11461 {
11464 /* Find out the type deduced by the declaration
11465 `auto &&__range = range_expr'. */
11470 /* Create the __range variable. */
11477 }
11479 /* Used by cp_parser_range_for in template context: we aren't going to
11480 do a full conversion yet, but we still need to resolve auto in the
11481 type of the for-range-declaration if present. This is basically
11482 a shortcut version of cp_convert_range_for. */
11484 static void
11486 {
11489 {
11492 iter_type = (cp_parser_perform_range_for_lookup
11495 {
11497 iter_type);
11499 tf_warning_or_error);
11502 }
11503 }
11504 }
11506 /* Converts a range-based for-statement into a normal
11507 for-statement, as per the definition.
11509 for (RANGE_DECL : RANGE_EXPR)
11510 BLOCK
11512 should be equivalent to:
11514 {
11515 auto &&__range = RANGE_EXPR;
11516 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11517 __begin != __end;
11518 ++__begin)
11519 {
11520 RANGE_DECL = *__begin;
11521 BLOCK
11522 }
11523 }
11525 If RANGE_EXPR is an array:
11526 BEGIN_EXPR = __range
11527 END_EXPR = __range + ARRAY_SIZE(__range)
11528 Else if RANGE_EXPR has a member 'begin' or 'end':
11529 BEGIN_EXPR = __range.begin()
11530 END_EXPR = __range.end()
11531 Else:
11532 BEGIN_EXPR = begin(__range)
11533 END_EXPR = end(__range);
11535 If __range has a member 'begin' but not 'end', or vice versa, we must
11536 still use the second alternative (it will surely fail, however).
11537 When calling begin()/end() in the third alternative we must use
11538 argument dependent lookup, but always considering 'std' as an associated
11539 namespace. */
11541 tree
11544 {
11550 /* If an error happened previously do nothing or else a lot of
11551 unhelpful errors would be issued. */
11553 else
11554 {
11555 tree range_temp;
11559 /* Can't bind a reference to an array of runtime bound. */
11561 else
11562 {
11567 LOOKUP_ONLYCONVERTING);
11569 }
11572 }
11574 /* The new for initialization statement. */
11582 LOOKUP_ONLYCONVERTING);
11593 LOOKUP_ONLYCONVERTING);
11597 /* The new for condition. */
11604 /* The new increment expression. */
11607 tf_warning_or_error);
11610 /* The declaration is initialized with *__begin inside the loop body. */
11613 tf_warning_or_error),
11615 LOOKUP_ONLYCONVERTING);
11618 }
11620 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11621 We need to solve both at the same time because the method used
11622 depends on the existence of members begin or end.
11623 Returns the type deduced for the iterator expression. */
11625 static tree
11627 {
11629 {
11632 }
11635 {
11640 }
11642 {
11643 /* If RANGE is an array, we will use pointer arithmetic. */
11646 range,
11650 }
11651 else
11652 {
11653 /* If it is not an array, we must do a bit of magic. */
11663 tf_warning_or_error);
11666 tf_warning_or_error);
11669 {
11670 /* Use the member functions. */
11673 else
11679 else
11682 }
11683 else
11684 {
11685 /* Use global functions with ADL. */
11692 tf_warning_or_error);
11694 tf_warning_or_error);
11696 tf_warning_or_error);
11698 tf_warning_or_error);
11701 }
11703 /* Last common checks. */
11705 {
11706 /* If one of the expressions is an error do no more checks. */
11709 }
11712 /* Can happen, when, eg, in a template context, Koenig lookup
11713 can't resolve begin/end (c++/58503). */
11715 else
11716 {
11718 /* The unqualified type of the __begin and __end temporaries should
11719 be the same, as required by the multiple auto declaration. */
11721 {
11728 /* P0184R0 allows __begin and __end to have different types,
11729 but make sure they are comparable so we can give a better
11731 else
11735 }
11737 }
11738 }
11739 }
11741 /* Helper function for cp_parser_perform_range_for_lookup.
11742 Builds a tree for RANGE.IDENTIFIER(). */
11744 static tree
11746 {
11759 tf_warning_or_error);
11762 }
11764 /* Parse an iteration-statement.
11766 iteration-statement:
11767 while ( condition ) statement
11768 do statement while ( expression ) ;
11769 for ( init-statement condition [opt] ; expression [opt] )
11770 statement
11772 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11774 static tree
11776 {
11779 tree statement;
11781 token_indent_info guard_tinfo;
11783 /* Peek at the next token. */
11790 /* Remember whether or not we are already within an iteration
11791 statement. */
11794 /* See what kind of keyword it is. */
11797 {
11799 {
11800 tree condition;
11802 /* Begin the while-statement. */
11804 /* Look for the `('. */
11806 /* Parse the condition. */
11809 /* Look for the `)'. */
11811 /* Parse the dependent statement. */
11815 /* We're done with the while-statement. */
11817 }
11821 {
11822 tree expression;
11824 /* Begin the do-statement. */
11826 /* Parse the body of the do-statement. */
11831 /* Look for the `while' keyword. */
11833 /* Look for the `('. */
11835 /* Parse the expression. */
11837 /* We're done with the do-statement. */
11839 /* Look for the `)'. */
11841 /* Look for the `;'. */
11843 }
11847 {
11848 /* Look for the `('. */
11853 /* Look for the `)'. */
11856 /* Parse the body of the for-statement. */
11861 /* We're done with the for-statement. */
11863 }
11870 }
11873 }
11875 /* Parse a init-statement or the declarator of a range-based-for.
11876 Returns true if a range-based-for declaration is seen.
11878 init-statement:
11879 expression-statement
11880 simple-declaration */
11882 static bool
11884 {
11885 /* If the next token is a `;', then we have an empty
11886 expression-statement. Grammatically, this is also a
11887 simple-declaration, but an invalid one, because it does not
11888 declare anything. Therefore, if we did not handle this case
11889 specially, we would issue an error message about an invalid
11890 declaration. */
11892 {
11896 /* A colon is used in range-based for. */
11899 /* We're going to speculatively look for a declaration, falling back
11900 to an expression, if necessary. */
11902 /* Parse the declaration. */
11905 decl);
11908 {
11909 /* It is a range-for, consume the ':' */
11913 {
11915 "range-based %<for%> loops only available with "
11918 }
11919 }
11920 else
11921 /* The ';' is not consumed yet because we told
11922 cp_parser_simple_declaration not to. */
11927 /* If the tentative parse failed, then we shall need to look for an
11928 expression-statement. */
11929 }
11930 /* If we are here, it is an expression-statement. */
11933 }
11935 /* Parse a jump-statement.
11937 jump-statement:
11938 break ;
11939 continue ;
11940 return expression [opt] ;
11941 return braced-init-list ;
11942 goto identifier ;
11944 GNU extension:
11946 jump-statement:
11947 goto * expression ;
11949 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
11951 static tree
11953 {
11959 /* Peek at the next token. */
11964 /* See what kind of keyword it is. */
11967 {
11971 {
11991 }
11997 {
12004 /* Fall through. */
12014 }
12019 {
12020 tree expr;
12024 {
12028 }
12031 else
12032 /* If the next token is a `;', then there is no
12033 expression. */
12035 /* Build the return-statement. */
12038 else
12040 /* Look for the final `;'. */
12042 }
12048 {
12051 }
12053 /* Create the goto-statement. */
12055 {
12056 /* Issue a warning about this use of a GNU extension. */
12058 /* Consume the '*' token. */
12060 /* Parse the dependent expression. */
12062 }
12063 else
12065 /* Look for the final `;'. */
12072 }
12075 }
12077 /* Parse a declaration-statement.
12079 declaration-statement:
12080 block-declaration */
12082 static void
12084 {
12087 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12090 /* Parse the block-declaration. */
12093 /* Free any declarators allocated. */
12095 }
12097 /* Some dependent statements (like `if (cond) statement'), are
12098 implicitly in their own scope. In other words, if the statement is
12099 a single statement (as opposed to a compound-statement), it is
12100 none-the-less treated as if it were enclosed in braces. Any
12101 declarations appearing in the dependent statement are out of scope
12102 after control passes that point. This function parses a statement,
12103 but ensures that is in its own scope, even if it is not a
12104 compound-statement.
12106 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12107 is a (possibly labeled) if statement which is not enclosed in
12108 braces and has an else clause. This is used to implement
12109 -Wparentheses.
12111 CHAIN is a vector of if-else-if conditions. This is used to implement
12112 -Wduplicated-cond.
12114 Returns the new statement. */
12116 static tree
12120 {
12121 tree statement;
12123 token_indent_info body_tinfo
12129 /* Mark if () ; with a special NOP_EXPR. */
12131 {
12142 }
12143 /* if a compound is opened, we simply parse the statement directly. */
12146 /* If the token is not a `{', then we must take special action. */
12147 else
12148 {
12149 /* Create a compound-statement. */
12151 /* Parse the dependent-statement. */
12153 /* Finish the dummy compound-statement. */
12155 }
12157 token_indent_info next_tinfo
12161 /* Return the statement. */
12163 }
12165 /* For some dependent statements (like `while (cond) statement'), we
12166 have already created a scope. Therefore, even if the dependent
12167 statement is a compound-statement, we do not want to create another
12168 scope. */
12170 static void
12173 {
12174 /* If the token is a `{', then we must take special action. */
12176 {
12177 token_indent_info body_tinfo
12181 token_indent_info next_tinfo
12184 }
12185 else
12186 {
12187 /* Avoid calling cp_parser_compound_statement, so that we
12188 don't create a new scope. Do everything else by hand. */
12190 /* If the next keyword is `__label__' we have a label declaration. */
12193 /* Parse an (optional) statement-seq. */
12196 }
12197 }
12199 /* Declarations [gram.dcl.dcl] */
12201 /* Parse an optional declaration-sequence.
12203 declaration-seq:
12204 declaration
12205 declaration-seq declaration */
12207 static void
12209 {
12211 {
12222 {
12223 /* A declaration consisting of a single semicolon is
12224 invalid. Allow it unless we're being pedantic. */
12229 }
12231 /* If we're entering or exiting a region that's implicitly
12232 extern "C", modify the lang context appropriately. */
12234 {
12237 }
12239 {
12242 }
12245 {
12246 /* A top-level declaration can consist solely of a #pragma.
12247 A nested declaration cannot, so this is done here and not
12248 in cp_parser_declaration. (A #pragma at block scope is
12249 handled in cp_parser_statement.) */
12252 }
12254 /* Parse the declaration itself. */
12256 }
12257 }
12259 /* Parse a declaration.
12261 declaration:
12262 block-declaration
12263 function-definition
12264 template-declaration
12265 explicit-instantiation
12266 explicit-specialization
12267 linkage-specification
12268 namespace-definition
12270 C++17:
12271 deduction-guide
12273 GNU extension:
12275 declaration:
12276 __extension__ declaration */
12278 static void
12280 {
12281 cp_token token1;
12282 cp_token token2;
12287 /* Check for the `__extension__' keyword. */
12289 {
12290 /* Parse the qualified declaration. */
12292 /* Restore the PEDANTIC flag. */
12296 }
12298 /* Try to figure out what kind of declaration is present. */
12303 else
12304 {
12307 }
12309 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12312 /* If the next token is `extern' and the following token is a string
12313 literal, then we have a linkage specification. */
12317 /* If the next token is `template', then we have either a template
12318 declaration, an explicit instantiation, or an explicit
12319 specialization. */
12321 {
12322 /* `template <>' indicates a template specialization. */
12326 /* `template <' indicates a template declaration. */
12329 /* Anything else must be an explicit instantiation. */
12330 else
12332 }
12333 /* If the next token is `export', then we have a template
12334 declaration. */
12337 /* If the next token is `extern', 'static' or 'inline' and the one
12338 after that is `template', we have a GNU extended explicit
12339 instantiation directive. */
12346 /* If the next token is `namespace', check for a named or unnamed
12347 namespace definition. */
12356 /* An unnamed namespace definition. */
12360 /* An inline (associated) namespace definition. */
12364 /* Objective-C++ declaration/definition. */
12371 /* At this point we may have a template declared by a concept
12372 introduction. */
12377 else
12378 /* Try to parse a block-declaration, or a function-definition. */
12381 /* Free any declarators allocated. */
12383 }
12385 /* Parse a block-declaration.
12387 block-declaration:
12388 simple-declaration
12389 asm-definition
12390 namespace-alias-definition
12391 using-declaration
12392 using-directive
12394 GNU Extension:
12396 block-declaration:
12397 __extension__ block-declaration
12399 C++0x Extension:
12401 block-declaration:
12402 static_assert-declaration
12404 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12405 part of a declaration-statement. */
12407 static void
12410 {
12414 /* Check for the `__extension__' keyword. */
12416 {
12417 /* Parse the qualified declaration. */
12419 /* Restore the PEDANTIC flag. */
12423 }
12425 /* Peek at the next token to figure out which kind of declaration is
12426 present. */
12429 /* If the next keyword is `asm', we have an asm-definition. */
12431 {
12435 }
12436 /* If the next keyword is `namespace', we have a
12437 namespace-alias-definition. */
12440 /* If the next keyword is `using', we have a
12441 using-declaration, a using-directive, or an alias-declaration. */
12443 {
12448 /* If the token after `using' is `namespace', then we have a
12449 using-directive. */
12453 /* If the second token after 'using' is '=', then we have an
12454 alias-declaration. */
12460 /* Otherwise, it's a using-declaration. */
12461 else
12464 }
12465 /* If the next keyword is `__label__' we have a misplaced label
12466 declaration. */
12468 {
12472 /* If the next token is now a `;', consume it. */
12475 }
12476 /* If the next token is `static_assert' we have a static assertion. */
12479 /* Anything else must be a simple-declaration. */
12480 else
12483 }
12485 /* Parse a simple-declaration.
12487 simple-declaration:
12488 decl-specifier-seq [opt] init-declarator-list [opt] ;
12490 init-declarator-list:
12491 init-declarator
12492 init-declarator-list , init-declarator
12494 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12495 function-definition as a simple-declaration.
12497 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12498 parsed declaration if it is an uninitialized single declarator not followed
12499 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12500 if present, will not be consumed. */
12502 static void
12506 {
12507 cp_decl_specifier_seq decl_specifiers;
12516 /* Defer access checks until we know what is being declared; the
12517 checks for names appearing in the decl-specifier-seq should be
12518 done as if we were in the scope of the thing being declared. */
12521 /* Parse the decl-specifier-seq. We have to keep track of whether
12522 or not the decl-specifier-seq declares a named class or
12523 enumeration type, since that is the only case in which the
12524 init-declarator-list is allowed to be empty.
12526 [dcl.dcl]
12528 In a simple-declaration, the optional init-declarator-list can be
12529 omitted only when declaring a class or enumeration, that is when
12530 the decl-specifier-seq contains either a class-specifier, an
12531 elaborated-type-specifier, or an enum-specifier. */
12533 CP_PARSER_FLAGS_OPTIONAL,
12536 /* We no longer need to defer access checks. */
12539 /* In a block scope, a valid declaration must always have a
12540 decl-specifier-seq. By not trying to parse declarators, we can
12541 resolve the declaration/expression ambiguity more quickly. */
12544 {
12547 }
12549 /* If the next two tokens are both identifiers, the code is
12550 erroneous. The usual cause of this situation is code like:
12552 T t;
12554 where "T" should name a type -- but does not. */
12557 {
12558 /* If parsing tentatively, we should commit; we really are
12559 looking at a declaration. */
12561 /* Give up. */
12563 }
12565 /* If we have seen at least one decl-specifier, and the next token
12566 is not a parenthesis, then we must be looking at a declaration.
12567 (After "int (" we might be looking at a functional cast.) */
12574 tree last_type;
12578 /* Keep going until we hit the `;' at the end of the simple
12579 declaration. */
12582 CPP_SEMICOLON))
12583 {
12586 tree decl;
12590 {
12591 /* If we are processing next declarator, comma is expected */
12596 {
12600 }
12601 }
12602 else
12605 /* Parse the init-declarator. */
12608 function_definition_allowed_p,
12610 declares_class_or_enum,
12612 maybe_range_for_decl,
12615 /* If an error occurred while parsing tentatively, exit quickly.
12616 (That usually happens when in the body of a function; each
12617 statement is treated as a declaration-statement until proven
12618 otherwise.) */
12623 {
12626 {
12627 /* If the list of declarators contains more than one declarator,
12628 the type of each declared variable is determined as described
12629 above. If the type deduced for the template parameter U is not
12630 the same in each deduction, the program is ill-formed. */
12635 }
12636 else
12638 }
12640 /* Handle function definitions specially. */
12642 {
12643 /* If the next token is a `,', then we are probably
12644 processing something like:
12646 void f() {}, *p;
12648 which is erroneous. */
12650 {
12653 "mixing"
12655 }
12656 /* Otherwise, we're done with the list of declarators. */
12657 else
12658 {
12661 }
12662 }
12665 /* The next token should be either a `,' or a `;'. */
12667 /* If it's a `,', there are more declarators to come. */
12670 /* If it's a `;', we are done. */
12674 {
12679 }
12680 /* Anything else is an error. */
12681 else
12682 {
12683 /* If we have already issued an error message we don't need
12684 to issue another one. */
12689 /* Skip tokens until we reach the end of the statement. */
12691 /* If the next token is now a `;', consume it. */
12695 }
12696 /* After the first time around, a function-definition is not
12697 allowed -- even if it was OK at first. For example:
12699 int i, f() {}
12701 is not valid. */
12703 }
12705 /* Issue an error message if no declarators are present, and the
12706 decl-specifier-seq does not itself declare a class or
12707 enumeration: [dcl.dcl]/3. */
12709 {
12711 {
12715 /* Ensure an error is issued anyway when finish_decltype_type,
12716 called via cp_parser_decl_specifier_seq, returns a class or
12717 an enumeration (c++/51786). */
12720 }
12721 /* Perform any deferred access checks. */
12723 }
12725 /* Consume the `;'. */
12729 {
12735 }
12737 done:
12739 }
12741 /* Parse a decl-specifier-seq.
12743 decl-specifier-seq:
12744 decl-specifier-seq [opt] decl-specifier
12745 decl-specifier attribute-specifier-seq [opt] (C++11)
12747 decl-specifier:
12748 storage-class-specifier
12749 type-specifier
12750 function-specifier
12751 friend
12752 typedef
12754 GNU Extension:
12756 decl-specifier:
12757 attributes
12759 Concepts Extension:
12761 decl-specifier:
12762 concept
12764 Set *DECL_SPECS to a representation of the decl-specifier-seq.
12766 The parser flags FLAGS is used to control type-specifier parsing.
12768 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
12769 flags:
12771 1: one of the decl-specifiers is an elaborated-type-specifier
12772 (i.e., a type declaration)
12773 2: one of the decl-specifiers is an enum-specifier or a
12774 class-specifier (i.e., a type definition)
12776 */
12778 static void
12780 cp_parser_flags flags,
12783 {
12787 cp_decl_spec ds;
12789 /* Clear DECL_SPECS. */
12792 /* Assume no class or enumeration type is declared. */
12795 /* Keep reading specifiers until there are no more to read. */
12797 {
12802 /* Peek at the next token. */
12805 /* Save the first token of the decl spec list for error
12806 reporting. */
12809 /* Handle attributes. */
12811 {
12812 /* Parse the attributes. */
12815 /* In a sequence of declaration specifiers, c++11 attributes
12816 appertain to the type that precede them. In that case
12817 [dcl.spec]/1 says:
12819 The attribute-specifier-seq affects the type only for
12820 the declaration it appears in, not other declarations
12821 involving the same type.
12823 But for now let's force the user to position the
12824 attribute either at the beginning of the declaration or
12825 after the declarator-id, which would clearly mean that it
12826 applies to the declarator. */
12828 {
12830 /* The c++11 attribute is at the beginning of the
12831 declaration. It appertains to the entity being
12833 else
12834 {
12836 {
12837 /* This is an attribute following a
12838 class-specifier. */
12843 }
12844 else
12845 {
12846 decl_specs->std_attributes
12848 attrs);
12851 }
12853 }
12854 }
12856 decl_specs->attributes
12858 attrs);
12862 }
12863 /* Assume we will find a decl-specifier keyword. */
12865 /* If the next token is an appropriate keyword, we can simply
12866 add it to the list. */
12868 {
12869 /* decl-specifier:
12870 friend
12871 constexpr */
12874 {
12877 }
12878 else
12879 {
12881 /* Consume the token. */
12883 }
12896 /* function-specifier:
12897 inline
12898 virtual
12899 explicit */
12906 /* decl-specifier:
12907 typedef */
12910 /* Consume the token. */
12912 /* A constructor declarator cannot appear in a typedef. */
12914 /* The "typedef" keyword can only occur in a declaration; we
12915 may as well commit at this point. */
12922 /* storage-class-specifier:
12923 auto
12924 register
12925 static
12926 extern
12927 mutable
12929 GNU Extension:
12930 thread */
12933 {
12934 /* Consume the token. */
12937 /* Complain about `auto' as a storage specifier, if
12938 we're complaining about C++0x compatibility. */
12942 /* Set the storage class anyway. */
12944 token);
12945 }
12946 else
12947 /* C++0x auto type-specifier. */
12955 /* Consume the token. */
12958 token);
12961 /* Consume the token. */
12967 /* We did not yet find a decl-specifier yet. */
12970 }
12987 /* Constructors are a special case. The `S' in `S()' is not a
12988 decl-specifier; it is the beginning of the declarator. */
12989 constructor_p
12990 = (!found_decl_spec
12991 && constructor_possible_p
12992 && (cp_parser_constructor_declarator_p
12995 /* If we don't have a DECL_SPEC yet, then we must be looking at
12996 a type-specifier. */
12998 {
13001 tree type_spec;
13003 type_spec
13005 decl_specs,
13011 /* If this type-specifier referenced a user-defined type
13012 (a typedef, class-name, etc.), then we can't allow any
13013 more such type-specifiers henceforth.
13015 [dcl.spec]
13017 The longest sequence of decl-specifiers that could
13018 possibly be a type name is taken as the
13019 decl-specifier-seq of a declaration. The sequence shall
13020 be self-consistent as described below.
13022 [dcl.type]
13024 As a general rule, at most one type-specifier is allowed
13025 in the complete decl-specifier-seq of a declaration. The
13026 only exceptions are the following:
13028 -- const or volatile can be combined with any other
13029 type-specifier.
13031 -- signed or unsigned can be combined with char, long,
13032 short, or int.
13034 -- ..
13036 Example:
13038 typedef char* Pc;
13039 void g (const int Pc);
13041 Here, Pc is *not* part of the decl-specifier seq; it's
13042 the declarator. Therefore, once we see a type-specifier
13043 (other than a cv-qualifier), we forbid any additional
13044 user-defined types. We *do* still allow things like `int
13045 int' to be considered a decl-specifier-seq, and issue the
13046 error message later. */
13049 /* A constructor declarator cannot follow a type-specifier. */
13051 {
13056 }
13057 }
13059 /* If we still do not have a DECL_SPEC, then there are no more
13060 decl-specifiers. */
13065 /* After we see one decl-specifier, further decl-specifiers are
13066 always optional. */
13068 }
13070 /* Don't allow a friend specifier with a class definition. */
13075 }
13077 /* Parse an (optional) storage-class-specifier.
13079 storage-class-specifier:
13080 auto
13081 register
13082 static
13083 extern
13084 mutable
13086 GNU Extension:
13088 storage-class-specifier:
13089 thread
13091 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13093 static tree
13095 {
13097 {
13101 /* Fall through for C++98. */
13109 /* Consume the token. */
13114 }
13115 }
13117 /* Parse an (optional) function-specifier.
13119 function-specifier:
13120 inline
13121 virtual
13122 explicit
13124 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13125 Updates DECL_SPECS, if it is non-NULL. */
13127 static tree
13130 {
13133 {
13139 /* 14.5.2.3 [temp.mem]
13141 A member function template shall not be virtual. */
13145 else
13155 }
13157 /* Consume the token. */
13159 }
13161 /* Parse a linkage-specification.
13163 linkage-specification:
13164 extern string-literal { declaration-seq [opt] }
13165 extern string-literal declaration */
13167 static void
13169 {
13170 tree linkage;
13172 /* Look for the `extern' keyword. */
13175 /* Look for the string-literal. */
13178 /* Transform the literal into an identifier. If the literal is a
13179 wide-character string, or contains embedded NULs, then we can't
13180 handle it as the user wants. */
13183 {
13185 /* Assume C++ linkage. */
13187 }
13188 else
13191 /* We're now using the new linkage. */
13194 /* If the next token is a `{', then we're using the first
13195 production. */
13197 {
13201 /* Consume the `{' token. */
13203 /* Parse the declarations. */
13205 /* Look for the closing `}'. */
13207 }
13208 /* Otherwise, there's just one declaration. */
13209 else
13210 {
13213 saved_in_unbraced_linkage_specification_p
13217 parser->in_unbraced_linkage_specification_p
13219 }
13221 /* We're done with the linkage-specification. */
13223 }
13225 /* Parse a static_assert-declaration.
13227 static_assert-declaration:
13228 static_assert ( constant-expression , string-literal ) ;
13229 static_assert ( constant-expression ) ; (C++1Z)
13231 If MEMBER_P, this static_assert is a class member. */
13233 static void
13235 {
13236 tree condition;
13237 tree message;
13239 location_t saved_loc;
13242 /* Peek at the `static_assert' token so we can keep track of exactly
13243 where the static assertion started. */
13247 /* Look for the `static_assert' keyword. */
13249 RT_STATIC_ASSERT))
13252 /* We know we are in a static assertion; commit to any tentative
13253 parse. */
13257 /* Parse the `(' starting the static assertion condition. */
13260 /* Parse the constant-expression. Allow a non-constant expression
13261 here in order to give better diagnostics in finish_static_assert. */
13262 condition =
13268 {
13271 "static_assert without a message "
13273 /* Eat the ')' */
13278 }
13279 else
13280 {
13281 /* Parse the separating `,'. */
13284 /* Parse the string-literal message. */
13289 /* A `)' completes the static assertion. */
13295 }
13297 /* A semicolon terminates the declaration. */
13300 /* Complete the static assertion, which may mean either processing
13301 the static assert now or saving it for template instantiation. */
13303 }
13305 /* Parse the expression in decltype ( expression ). */
13307 static tree
13310 {
13312 tree expr;
13314 /* Since we're going to preserve any side-effects from this parse, set up a
13315 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13316 in the expression. */
13319 /* First, try parsing an id-expression. */
13330 {
13333 cp_id_kind idk;
13337 /* Lookup the name we got back from the id-expression. */
13347 {
13348 /* Complete lookup of the id-expression. */
13349 expr = (finish_id_expression
13362 /* We found an id-expression, but it was something that we
13363 should not have found. This is an error, not something
13364 we can recover from, so note that we found an
13365 id-expression and we'll recover as gracefully as
13366 possible. */
13368 }
13373 /* We have an id-expression. */
13375 }
13378 {
13379 /* Abort the id-expression parse. */
13382 /* Parsing tentatively, again. */
13385 /* Parse a class member access. */
13393 /* We have an id-expression. */
13395 }
13398 /* We have parsed the complete id-expression or member access. */
13400 else
13401 {
13402 /* Abort our attempt to parse an id-expression or member access
13403 expression. */
13406 /* Parse a full expression. */
13409 }
13412 }
13414 /* Parse a `decltype' type. Returns the type.
13416 simple-type-specifier:
13417 decltype ( expression )
13418 C++14 proposal:
13419 decltype ( auto ) */
13421 static tree
13423 {
13424 tree expr;
13433 {
13434 /* Already parsed. */
13437 }
13439 /* Look for the `decltype' token. */
13443 /* Parse the opening `('. */
13447 /* decltype (auto) */
13450 {
13457 }
13459 /* Types cannot be defined in a `decltype' expression. Save away the
13460 old message. */
13463 /* And create the new one. */
13464 parser->type_definition_forbidden_message
13467 /* The restrictions on constant-expressions do not apply inside
13468 decltype expressions. */
13469 saved_integral_constant_expression_p
13471 saved_non_integral_constant_expression_p
13475 /* Within a parenthesized expression, a `>' token is always
13476 the greater-than operator. */
13477 saved_greater_than_is_operator_p
13481 /* Do not actually evaluate the expression. */
13484 /* Do not warn about problems with the expression. */
13489 /* Go back to evaluating expressions. */
13493 /* The `>' token might be the end of a template-id or
13494 template-parameter-list now. */
13495 parser->greater_than_is_operator_p
13498 /* Restore the old message and the integral constant expression
13499 flags. */
13501 parser->integral_constant_expression_p
13503 parser->non_integral_constant_expression_p
13506 /* Parse to the closing `)'. */
13508 {
13512 }
13515 tf_warning_or_error);
13517 rewrite:
13518 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13519 it again. */
13528 }
13530 /* Special member functions [gram.special] */
13532 /* Parse a conversion-function-id.
13534 conversion-function-id:
13535 operator conversion-type-id
13537 Returns an IDENTIFIER_NODE representing the operator. */
13539 static tree
13541 {
13542 tree type;
13543 tree saved_scope;
13544 tree saved_qualifying_scope;
13545 tree saved_object_scope;
13548 /* Look for the `operator' token. */
13551 /* When we parse the conversion-type-id, the current scope will be
13552 reset. However, we need that information in able to look up the
13553 conversion function later, so we save it here. */
13557 /* We must enter the scope of the class so that the names of
13558 entities declared within the class are available in the
13559 conversion-type-id. For example, consider:
13561 struct S {
13562 typedef int I;
13563 operator I();
13564 };
13566 S::operator I() { ... }
13568 In order to see that `I' is a type-name in the definition, we
13569 must be in the scope of `S'. */
13572 /* Parse the conversion-type-id. */
13574 /* Leave the scope of the class, if any. */
13577 /* Restore the saved scope. */
13581 /* If the TYPE is invalid, indicate failure. */
13585 }
13587 /* Parse a conversion-type-id:
13589 conversion-type-id:
13590 type-specifier-seq conversion-declarator [opt]
13592 Returns the TYPE specified. */
13594 static tree
13596 {
13597 tree attributes;
13598 cp_decl_specifier_seq type_specifiers;
13600 tree type_specified;
13603 /* Parse the attributes. */
13607 parser->type_definition_forbidden_message
13610 /* Parse the type-specifiers. */
13617 /* If that didn't work, stop. */
13620 /* Parse the conversion-declarator. */
13628 /* Don't give this error when parsing tentatively. This happens to
13629 work because we always parse this definitively once. */
13632 {
13634 {
13637 }
13641 }
13644 }
13646 /* Parse an (optional) conversion-declarator.
13648 conversion-declarator:
13649 ptr-operator conversion-declarator [opt]
13651 */
13655 {
13658 cp_cv_quals cv_quals;
13660 /* We don't know if there's a ptr-operator next, or not. */
13662 /* Try the ptr-operator. */
13665 /* If it worked, look for more conversion-declarators. */
13667 {
13670 /* Parse another optional declarator. */
13673 declarator = cp_parser_make_indirect_declarator
13677 }
13680 }
13682 /* Parse an (optional) ctor-initializer.
13684 ctor-initializer:
13685 : mem-initializer-list
13687 Returns TRUE iff the ctor-initializer was actually present. */
13689 static bool
13691 {
13692 /* If the next token is not a `:', then there is no
13693 ctor-initializer. */
13695 {
13696 /* Do default initialization of any bases and members. */
13701 }
13703 /* Consume the `:' token. */
13705 /* And the mem-initializer-list. */
13709 }
13711 /* Parse a mem-initializer-list.
13713 mem-initializer-list:
13714 mem-initializer ... [opt]
13715 mem-initializer ... [opt] , mem-initializer-list */
13717 static void
13719 {
13724 /* Let the semantic analysis code know that we are starting the
13725 mem-initializer-list. */
13730 /* Loop through the list. */
13732 {
13733 tree mem_initializer;
13736 /* Parse the mem-initializer. */
13738 /* If the next token is a `...', we're expanding member initializers. */
13740 {
13741 /* Consume the `...'. */
13744 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
13745 can be expanded but members cannot. */
13748 {
13753 }
13755 /* Construct the pack expansion type. */
13758 }
13761 {
13765 }
13766 /* Look for a target constructor. */
13770 {
13773 {
13777 }
13779 }
13780 /* Add it to the list, unless it was erroneous. */
13782 {
13785 }
13786 /* If the next token is not a `,', we're done. */
13789 /* Consume the `,' token. */
13791 }
13793 /* Perform semantic analysis. */
13796 }
13798 /* Parse a mem-initializer.
13800 mem-initializer:
13801 mem-initializer-id ( expression-list [opt] )
13802 mem-initializer-id braced-init-list
13804 GNU extension:
13806 mem-initializer:
13807 ( expression-list [opt] )
13809 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
13810 class) or FIELD_DECL (for a non-static data member) to initialize;
13811 the TREE_VALUE is the expression-list. An empty initialization
13812 list is represented by void_list_node. */
13814 static tree
13816 {
13817 tree mem_initializer_id;
13818 tree expression_list;
13819 tree member;
13822 /* Find out what is being initialized. */
13824 {
13828 }
13829 else
13830 {
13834 }
13840 {
13847 }
13848 else
13849 {
13859 }
13869 }
13871 /* Parse a mem-initializer-id.
13873 mem-initializer-id:
13874 :: [opt] nested-name-specifier [opt] class-name
13875 decltype-specifier (C++11)
13876 identifier
13878 Returns a TYPE indicating the class to be initialized for the first
13879 production (and the second in C++11). Returns an IDENTIFIER_NODE
13880 indicating the data member to be initialized for the last production. */
13882 static tree
13884 {
13888 tree id;
13892 /* `typename' is not allowed in this context ([temp.res]). */
13894 {
13896 "keyword %<typename%> not allowed in this context (a qualified "
13899 }
13900 /* Look for the optional `::' operator. */
13901 global_scope_p
13905 /* Look for the optional nested-name-specifier. The simplest way to
13906 implement:
13908 [temp.res]
13910 The keyword `typename' is not permitted in a base-specifier or
13911 mem-initializer; in these contexts a qualified name that
13912 depends on a template-parameter is implicitly assumed to be a
13913 type name.
13915 is to assume that we have seen the `typename' keyword at this
13916 point. */
13917 nested_name_specifier_p
13926 /* If there is a `::' operator or a nested-name-specifier, then we
13927 are definitely looking for a class-name. */
13932 typename_type,
13936 /* Otherwise, we could also be looking for an ordinary identifier. */
13939 /* Try a decltype-specifier. */
13941 else
13942 /* Otherwise, try a class-name. */
13946 none_type,
13950 /* If we found one, we're done. */
13953 /* Otherwise, look for an ordinary identifier. */
13955 }
13957 /* Overloading [gram.over] */
13959 /* Parse an operator-function-id.
13961 operator-function-id:
13962 operator operator
13964 Returns an IDENTIFIER_NODE for the operator which is a
13965 human-readable spelling of the identifier, e.g., `operator +'. */
13967 static cp_expr
13969 {
13970 /* Look for the `operator' keyword. */
13973 /* And then the name of the operator itself. */
13975 }
13977 /* Return an identifier node for a user-defined literal operator.
13978 The suffix identifier is chained to the operator name identifier. */
13980 static tree
13982 {
13983 tree identifier;
13990 }
13992 /* Parse an operator.
13994 operator:
13995 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
13996 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
13997 || ++ -- , ->* -> () []
13999 GNU Extensions:
14001 operator:
14002 <? >? <?= >?=
14004 Returns an IDENTIFIER_NODE for the operator which is a
14005 human-readable spelling of the identifier, e.g., `operator +'. */
14007 static cp_expr
14009 {
14014 /* Peek at the next token. */
14019 /* Figure out which operator we have. */
14021 {
14023 {
14026 /* The keyword should be either `new' or `delete'. */
14031 else
14034 /* Consume the `new' or `delete' token. */
14037 /* Peek at the next token. */
14039 /* If it's a `[' token then this is the array variant of the
14040 operator. */
14042 {
14043 /* Consume the `[' token. */
14045 /* Look for the `]' token. */
14051 }
14052 /* Otherwise, we have the non-array variant. */
14053 else
14059 }
14206 /* Consume the `('. */
14208 /* Look for the matching `)'. */
14213 /* Consume the `['. */
14215 /* Look for the matching `]'. */
14222 /* FALLTHRU */
14231 {
14238 /* Consume the string. */
14244 {
14247 }
14248 else
14249 {
14251 /* Look for the suffix identifier. */
14256 {
14260 }
14261 else
14262 {
14265 }
14266 }
14271 {
14274 }
14277 {
14280 }
14282 {
14285 }
14287 }
14290 /* Anything else is an error. */
14292 }
14294 /* If we have selected an identifier, we need to consume the
14295 operator token. */
14298 /* Otherwise, no valid operator name was present. */
14299 else
14300 {
14303 }
14306 }
14308 /* Parse a template-declaration.
14310 template-declaration:
14311 export [opt] template < template-parameter-list > declaration
14313 If MEMBER_P is TRUE, this template-declaration occurs within a
14314 class-specifier.
14316 The grammar rule given by the standard isn't correct. What
14317 is really meant is:
14319 template-declaration:
14320 export [opt] template-parameter-list-seq
14321 decl-specifier-seq [opt] init-declarator [opt] ;
14322 export [opt] template-parameter-list-seq
14323 function-definition
14325 template-parameter-list-seq:
14326 template-parameter-list-seq [opt]
14327 template < template-parameter-list >
14329 Concept Extensions:
14331 template-parameter-list-seq:
14332 template < template-parameter-list > requires-clause [opt]
14334 requires-clause:
14335 requires logical-or-expression */
14337 static void
14339 {
14340 /* Check for `export'. */
14342 {
14343 /* Consume the `export' token. */
14345 /* Warn that we do not support `export'. */
14347 }
14350 }
14352 /* Parse a template-parameter-list.
14354 template-parameter-list:
14355 template-parameter
14356 template-parameter-list , template-parameter
14358 Returns a TREE_LIST. Each node represents a template parameter.
14359 The nodes are connected via their TREE_CHAINs. */
14361 static tree
14363 {
14368 /* The loop below parses the template parms. We first need to know
14369 the total number of template parms to be able to compute proper
14370 canonical types of each dependent type. So after the loop, when
14371 we know the total number of template parms,
14372 end_template_parm_list computes the proper canonical types and
14373 fixes up the dependent types accordingly. */
14375 {
14376 tree parameter;
14379 location_t parm_loc;
14381 /* Parse the template-parameter. */
14386 /* Add it to the list. */
14389 parm_loc,
14390 parameter,
14391 is_non_type,
14392 is_parameter_pack);
14393 else
14394 {
14397 }
14399 /* If the next token is not a `,', we're done. */
14402 /* Otherwise, consume the `,' token. */
14404 }
14407 }
14409 /* Parse a introduction-list.
14411 introduction-list:
14412 introduced-parameter
14413 introduction-list , introduced-parameter
14415 introduced-parameter:
14416 ...[opt] identifier
14418 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14419 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14420 WILDCARD_DECL will also have DECL_NAME set and token location in
14421 DECL_SOURCE_LOCATION. */
14423 static tree
14425 {
14429 {
14434 /* Build placeholder. */
14442 /* If the next token is not a `,', we're done. */
14445 /* Otherwise, consume the `,' token. */
14447 }
14449 /* Convert the vec into a TREE_VEC. */
14452 tree parm;
14458 }
14460 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14461 is an abstract declarator. */
14465 {
14470 }
14472 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14473 is an abstract declarator. */
14477 {
14481 else
14483 }
14485 /* Returns true if DECL represents a constrained-parameter. */
14489 {
14494 }
14496 /* Returns true if PARM declares a constrained-parameter. */
14500 {
14502 }
14504 /* Check that the type parameter is only a declarator-id, and that its
14505 type is not cv-qualified. */
14507 bool
14510 {
14515 {
14518 }
14520 /* Don't allow cv-qualified type parameters. */
14523 {
14526 }
14529 }
14531 /* Finish parsing/processing a template type parameter and checking
14532 various restrictions. */
14536 tree id,
14538 {
14541 else
14543 }
14545 static tree
14547 {
14548 /* FIXME: This should probably be copied, and we may need to adjust
14549 the template parameter depths. */
14559 }
14561 /* Finish parsing/processing a template template parameter by borrowing
14562 the template parameter list from the prototype parameter. */
14564 static tree
14566 tree proto,
14567 tree id,
14569 {
14573 }
14575 /* Create a new non-type template parameter from the given PARM
14576 declarator. */
14578 static tree
14581 {
14587 }
14589 /* Build a constrained template parameter based on the PARMDECL
14590 declarator. The type of PARMDECL is the constrained type, which
14591 refers to the prototype template parameter that ultimately
14592 specifies the type of the declared parameter. */
14594 static tree
14599 {
14605 /* A template parameter constrained by a variadic concept shall also
14606 be declared as a template parameter pack. */
14611 /* Build the parameter. Return an error if the declarator was invalid. */
14612 tree parm;
14617 parmdecl);
14618 else
14623 /* Finish the parameter decl and create a node attaching the
14624 default argument and constraint. */
14629 }
14631 /* Returns true if the parsed type actually represents the declaration
14632 of a type template-parameter. */
14636 {
14639 }
14642 /* Returns true if the parsed type actually represents the declaration of
14643 a template template-parameter. */
14645 static bool
14647 {
14650 }
14652 /* Parse a default argument for a type template-parameter.
14653 Note that diagnostics are handled in cp_parser_template_parameter. */
14655 static tree
14657 {
14660 /* Consume the `=' token. */
14665 /* Parse the default-argument. */
14671 {
14675 }
14678 }
14680 /* Parse a default argument for a template template-parameter. */
14682 static tree
14684 {
14689 /* Consume the `='. */
14691 /* Parse the id-expression. */
14693 /* save token before parsing the id-expression, for error
14694 reporting */
14696 tree default_argument
14704 /* If the id-expression was a template-id that refers to
14705 a template-class, we already have the declaration here,
14706 so no further lookup is needed. */
14707 ;
14708 else
14709 /* Look up the name. */
14710 default_argument
14712 none_type,
14718 /* See if the default argument is valid. */
14722 }
14724 /* Parse a template-parameter.
14726 template-parameter:
14727 type-parameter
14728 parameter-declaration
14730 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
14731 the parameter. The TREE_PURPOSE is the default value, if any.
14732 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
14733 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
14734 set to true iff this parameter is a parameter pack. */
14736 static tree
14739 {
14742 tree parm;
14744 /* Assume it is a type parameter or a template parameter. */
14746 /* Assume it not a parameter pack. */
14748 /* Peek at the next token. */
14750 /* If it is `class' or `template', we have a type-parameter. */
14753 /* If it is `class' or `typename' we do not know yet whether it is a
14754 type parameter or a non-type parameter. Consider:
14756 template <typename T, typename T::X X> ...
14758 or:
14760 template <class C, class D*> ...
14762 Here, the first parameter is a type parameter, and the second is
14763 a non-type parameter. We can tell by looking at the token after
14764 the identifier -- if it is a `,', `=', or `>' then we have a type
14765 parameter. */
14767 {
14768 /* Peek at the token after `class' or `typename'. */
14770 /* If it's an ellipsis, we have a template type parameter
14771 pack. */
14774 /* If it's an identifier, skip it. */
14777 /* Now, see if the token looks like the end of a template
14778 parameter. */
14783 }
14785 /* Otherwise, it is a non-type parameter or a constrained parameter.
14787 [temp.param]
14789 When parsing a default template-argument for a non-type
14790 template-parameter, the first non-nested `>' is taken as the end
14791 of the template parameter-list rather than a greater-than
14792 operator. */
14793 parameter_declarator
14800 /* If the parameter declaration is marked as a parameter pack, set
14801 *IS_PARAMETER_PACK to notify the caller. */
14806 {
14807 /* Can happen in some cases of erroneous input (c++/34892). */
14809 /* Consume the `...' for better error recovery. */
14811 }
14813 // The parameter may have been constrained.
14816 parameter_declarator,
14817 is_non_type,
14818 is_parameter_pack);
14820 // Now we're sure that the parameter is a non-type parameter.
14831 }
14833 /* Parse a type-parameter.
14835 type-parameter:
14836 class identifier [opt]
14837 class identifier [opt] = type-id
14838 typename identifier [opt]
14839 typename identifier [opt] = type-id
14840 template < template-parameter-list > class identifier [opt]
14841 template < template-parameter-list > class identifier [opt]
14842 = id-expression
14844 GNU Extension (variadic templates):
14846 type-parameter:
14847 class ... identifier [opt]
14848 typename ... identifier [opt]
14850 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
14851 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
14852 the declaration of the parameter.
14854 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
14856 static tree
14858 {
14860 tree parameter;
14862 /* Look for a keyword to tell us what kind of parameter this is. */
14868 {
14871 {
14872 tree identifier;
14873 tree default_argument;
14875 /* If the next token is an ellipsis, we have a template
14876 argument pack. */
14878 {
14879 /* Consume the `...' token. */
14884 }
14886 /* If the next token is an identifier, then it names the
14887 parameter. */
14890 else
14893 /* Create the parameter. */
14896 /* If the next token is an `=', we have a default argument. */
14898 {
14899 default_argument
14902 /* Template parameter packs cannot have default
14903 arguments. */
14905 {
14908 "template parameter pack %qD cannot have a "
14910 else
14912 "template parameter packs cannot have "
14915 }
14918 }
14919 else
14922 /* Create the combined representation of the parameter and the
14923 default argument. */
14925 }
14929 {
14930 tree identifier;
14931 tree default_argument;
14933 /* Look for the `<'. */
14935 /* Parse the template-parameter-list. */
14937 /* Look for the `>'. */
14940 // If template requirements are present, parse them.
14942 {
14947 }
14949 /* Look for the `class' or 'typename' keywords. */
14951 /* If the next token is an ellipsis, we have a template
14952 argument pack. */
14954 {
14955 /* Consume the `...' token. */
14960 }
14961 /* If the next token is an `=', then there is a
14962 default-argument. If the next token is a `>', we are at
14963 the end of the parameter-list. If the next token is a `,',
14964 then we are at the end of this parameter. */
14968 {
14970 /* Treat invalid names as if the parameter were nameless. */
14973 }
14974 else
14977 /* Create the template parameter. */
14979 identifier);
14981 /* If the next token is an `=', then there is a
14982 default-argument. */
14984 {
14985 default_argument
14988 /* Template parameter packs cannot have default
14989 arguments. */
14991 {
14994 "template parameter pack %qD cannot "
14996 identifier);
14997 else
15001 }
15002 }
15003 else
15006 /* Create the combined representation of the parameter and the
15007 default argument. */
15009 }
15015 }
15018 }
15020 /* Parse a template-id.
15022 template-id:
15023 template-name < template-argument-list [opt] >
15025 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15026 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15027 returned. Otherwise, if the template-name names a function, or set
15028 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15029 names a class, returns a TYPE_DECL for the specialization.
15031 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15032 uninstantiated templates. */
15034 static tree
15040 {
15041 tree templ;
15042 tree arguments;
15043 tree template_id;
15048 /* If the next token corresponds to a template-id, there is no need
15049 to reparse it. */
15052 {
15055 }
15057 /* Avoid performing name lookup if there is no possibility of
15058 finding a template-id. */
15061 && !cp_parser_nth_token_starts_template_argument_list_p
15063 {
15066 }
15068 /* Remember where the template-id starts. */
15074 /* Parse the template-name. */
15077 check_dependency_p,
15078 is_declaration,
15079 tag_type,
15082 {
15085 }
15087 /* Since we're going to preserve any side-effects from this parse, set up a
15088 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15089 in the template arguments. */
15092 /* If we find the sequence `[:' after a template-name, it's probably
15093 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15094 parse correctly the argument list. */
15101 {
15103 /* Change `:' into `::'. */
15105 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15106 CPP_LESS. */
15109 /* Parse the arguments. */
15112 {
15113 /* If we couldn't parse an argument list, then we revert our changes
15114 and return simply an error. Maybe this is not a template-id
15115 after all. */
15120 }
15121 /* Otherwise, emit an error about the invalid digraph, but continue
15122 parsing because we got our argument list. */
15125 {
15128 "%<<:%> is an alternate spelling for %<[%>."
15131 {
15133 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15136 }
15137 }
15138 }
15139 else
15140 {
15141 /* Look for the `<' that starts the template-argument-list. */
15143 {
15146 }
15147 /* Parse the arguments. */
15149 }
15151 /* Build a representation of the specialization. */
15154 TEMPLATE_ID_EXPR,
15158 {
15160 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15161 template (rather than some instantiation thereof) only if
15162 is not nested within some other construct. For example, in
15163 "template <typename T> void f(T) { A<T>::", A<T> is just an
15164 instantiation of A. */
15167 CPP_SCOPE));
15168 template_id
15170 }
15171 /* A template-like identifier may be a partial concept id. */
15177 {
15181 }
15182 else
15183 {
15184 /* If it's not a class-template or a template-template, it should be
15185 a function-template. */
15193 }
15195 /* If parsing tentatively, replace the sequence of tokens that makes
15196 up the template-id with a CPP_TEMPLATE_ID token. That way,
15197 should we re-parse the token stream, we will not have to repeat
15198 the effort required to do the parse, nor will we issue duplicate
15199 error messages about problems during instantiation of the
15200 template. */
15202 /* Don't do this if we had a parse error in a declarator; re-parsing
15203 might succeed if a name changes meaning (60361). */
15207 {
15210 /* Reset the contents of the START_OF_ID token. */
15213 /* Update the location to be of the form:
15214 template-name < template-argument-list [opt] >
15215 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15216 with caret == start at the start of the template-name,
15217 ranging until the closing '>'. */
15218 location_t finish_loc
15220 location_t combined_loc
15224 /* Retrieve any deferred checks. Do not pop this access checks yet
15225 so the memory will not be reclaimed during token replacing below. */
15231 /* Purge all subsequent tokens. */
15234 /* ??? Can we actually assume that, if template_id ==
15235 error_mark_node, we will have issued a diagnostic to the
15236 user, as opposed to simply marking the tentative parse as
15237 failed? */
15240 }
15244 }
15246 /* Parse a template-name.
15248 template-name:
15249 identifier
15251 The standard should actually say:
15253 template-name:
15254 identifier
15255 operator-function-id
15257 A defect report has been filed about this issue.
15259 A conversion-function-id cannot be a template name because they cannot
15260 be part of a template-id. In fact, looking at this code:
15262 a.operator K<int>()
15264 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15265 It is impossible to call a templated conversion-function-id with an
15266 explicit argument list, since the only allowed template parameter is
15267 the type to which it is converting.
15269 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15270 `template' keyword, in a construction like:
15272 T::template f<3>()
15274 In that case `f' is taken to be a template-name, even though there
15275 is no way of knowing for sure.
15277 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15278 name refers to a set of overloaded functions, at least one of which
15279 is a template, or an IDENTIFIER_NODE with the name of the template,
15280 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15281 names are looked up inside uninstantiated templates. */
15283 static tree
15290 {
15291 tree identifier;
15292 tree decl;
15293 tree fns;
15296 /* If the next token is `operator', then we have either an
15297 operator-function-id or a conversion-function-id. */
15299 {
15300 /* We don't know whether we're looking at an
15301 operator-function-id or a conversion-function-id. */
15303 /* Try an operator-function-id. */
15305 /* If that didn't work, try a conversion-function-id. */
15307 {
15310 }
15311 }
15312 /* Look for the identifier. */
15313 else
15316 /* If we didn't find an identifier, we don't have a template-id. */
15320 /* If the name immediately followed the `template' keyword, then it
15321 is a template-name. However, if the next token is not `<', then
15322 we do not treat it as a template-name, since it is not being used
15323 as part of a template-id. This enables us to handle constructs
15324 like:
15326 template <typename T> struct S { S(); };
15327 template <typename T> S<T>::S();
15329 correctly. We would treat `S' as a template -- if it were `S<T>'
15330 -- but we do not if there is no `<'. */
15334 {
15335 /* In a declaration, in a dependent context, we pretend that the
15336 "template" keyword was present in order to improve error
15337 recovery. For example, given:
15339 template <typename T> void f(T::X<int>);
15341 we want to treat "X<int>" as a template-id. */
15343 && !template_keyword_p
15345 && check_dependency_p
15347 /* Do not do this for dtors (or ctors), since they never
15348 need the template keyword before their name. */
15350 {
15353 /* Explain what went wrong. */
15355 identifier);
15358 /* If parsing tentatively, find the location of the "<" token. */
15361 /* Parse the template arguments so that we can issue error
15362 messages about them. */
15365 /* Skip tokens until we find a good place from which to
15366 continue parsing. */
15371 /* If parsing tentatively, permanently remove the
15372 template argument list. That will prevent duplicate
15373 error messages from being issued about the missing
15374 "template" keyword. */
15380 }
15382 /* If the "template" keyword is present, then there is generally
15383 no point in doing name-lookup, so we just return IDENTIFIER.
15384 But, if the qualifying scope is non-dependent then we can
15385 (and must) do name-lookup normally. */
15391 }
15393 /* Look up the name. */
15395 tag_type,
15398 check_dependency_p,
15404 /* If DECL is a template, then the name was a template-name. */
15406 {
15410 }
15411 else
15412 {
15415 /* The standard does not explicitly indicate whether a name that
15416 names a set of overloaded declarations, some of which are
15417 templates, is a template-name. However, such a name should
15418 be a template-name; otherwise, there is no way to form a
15419 template-id for the overloaded templates. */
15427 {
15428 /* The name does not name a template. */
15431 }
15432 }
15434 /* If DECL is dependent, and refers to a function, then just return
15435 its name; we will look it up again during template instantiation. */
15437 {
15441 }
15444 }
15446 /* Parse a template-argument-list.
15448 template-argument-list:
15449 template-argument ... [opt]
15450 template-argument-list , template-argument ... [opt]
15452 Returns a TREE_VEC containing the arguments. */
15454 static tree
15456 {
15461 tree vec;
15468 /* Even if the template-id appears in an integral
15469 constant-expression, the contents of the argument list do
15470 not. */
15476 /* Parse the arguments. */
15477 do
15478 {
15479 tree argument;
15482 /* Consume the comma. */
15485 /* Parse the template-argument. */
15488 /* If the next token is an ellipsis, we're expanding a template
15489 argument pack. */
15491 {
15493 {
15497 }
15498 /* Consume the `...' token. */
15501 /* Make the argument into a TYPE_PACK_EXPANSION or
15502 EXPR_PACK_EXPANSION. */
15504 }
15507 {
15511 {
15514 }
15515 else
15517 }
15519 }
15535 }
15537 /* Parse a template-argument.
15539 template-argument:
15540 assignment-expression
15541 type-id
15542 id-expression
15544 The representation is that of an assignment-expression, type-id, or
15545 id-expression -- except that the qualified id-expression is
15546 evaluated, so that the value returned is either a DECL or an
15547 OVERLOAD.
15549 Although the standard says "assignment-expression", it forbids
15550 throw-expressions or assignments in the template argument.
15551 Therefore, we use "conditional-expression" instead. */
15553 static tree
15555 {
15556 tree argument;
15562 cp_id_kind idk;
15564 /* There's really no way to know what we're looking at, so we just
15565 try each alternative in order.
15567 [temp.arg]
15569 In a template-argument, an ambiguity between a type-id and an
15570 expression is resolved to a type-id, regardless of the form of
15571 the corresponding template-parameter.
15573 Therefore, we try a type-id first. */
15576 /* If there was no error parsing the type-id but the next token is a
15577 '>>', our behavior depends on which dialect of C++ we're
15578 parsing. In C++98, we probably found a typo for '> >'. But there
15579 are type-id which are also valid expressions. For instance:
15581 struct X { int operator >> (int); };
15582 template <int V> struct Foo {};
15583 Foo<X () >> 5> r;
15585 Here 'X()' is a valid type-id of a function type, but the user just
15586 wanted to write the expression "X() >> 5". Thus, we remember that we
15587 found a valid type-id, but we still try to parse the argument as an
15588 expression to see what happens.
15590 In C++0x, the '>>' will be considered two separate '>'
15591 tokens. */
15595 {
15598 }
15599 else
15600 {
15601 /* If the next token isn't a `,' or a `>', then this argument wasn't
15602 really finished. This means that the argument is not a valid
15603 type-id. */
15606 /* If that worked, we're done. */
15609 }
15610 /* We're still not sure what the argument will be. */
15612 /* Try a template. */
15620 /* If the next token isn't a `,' or a `>', then this argument wasn't
15621 really finished. */
15625 {
15626 /* Figure out what is being referred to. If the id-expression
15627 was for a class template specialization, then we will have a
15628 TYPE_DECL at this point. There is no need to do name lookup
15629 at this point in that case. */
15632 none_type,
15638 /* Handle a constrained-type-specifier for a non-type template
15639 parameter. */
15645 }
15647 {
15651 }
15652 /* It must be a non-type argument. In C++17 any constant-expression is
15653 allowed. */
15657 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
15659 -- an integral constant-expression of integral or enumeration
15660 type; or
15662 -- the name of a non-type template-parameter; or
15664 -- the name of an object or function with external linkage...
15666 -- the address of an object or function with external linkage...
15668 -- a pointer to member... */
15669 /* Look for a non-type template parameter. */
15671 {
15683 }
15685 /* If the next token is "&", the argument must be the address of an
15686 object or function with external linkage. */
15689 {
15692 }
15693 /* See if we might have an id-expression. */
15700 {
15703 address_p,
15710 else
15711 {
15712 tree probe;
15715 {
15716 /* Strip the dereference temporarily. */
15719 }
15721 /* If we're in a template, we represent a qualified-id referring
15722 to a static data member as a SCOPE_REF even if the scope isn't
15723 dependent so that we can check access control later. */
15728 {
15729 /* A variable without external linkage might still be a
15730 valid constant-expression, so no error is issued here
15731 if the external-linkage check fails. */
15734 }
15736 /* All overloaded functions are allowed; if the external
15737 linkage test does not pass, an error will be issued
15738 later. */
15739 ;
15743 /* A pointer-to-member. */
15744 ;
15746 ;
15747 else
15751 {
15754 tf_warning_or_error);
15755 else
15758 }
15759 }
15760 }
15761 /* If the argument started with "&", there are no other valid
15762 alternatives at this point. */
15764 {
15767 }
15769 general_expr:
15770 /* If the argument wasn't successfully parsed as a type-id followed
15771 by '>>', the argument can only be a constant expression now.
15772 Otherwise, we try parsing the constant-expression tentatively,
15773 because the argument could really be a type-id. */
15779 else
15780 {
15781 /* With C++17 generalized non-type template arguments we need to handle
15782 lvalue constant expressions, too. */
15785 }
15793 /* We did our best to parse the argument as a non type-id, but that
15794 was the only alternative that matched (albeit with a '>' after
15795 it). We can assume it's just a typo from the user, and a
15796 diagnostic will then be issued. */
15798 }
15800 /* Parse an explicit-instantiation.
15802 explicit-instantiation:
15803 template declaration
15805 Although the standard says `declaration', what it really means is:
15807 explicit-instantiation:
15808 template decl-specifier-seq [opt] declarator [opt] ;
15810 Things like `template int S<int>::i = 5, int S<double>::j;' are not
15811 supposed to be allowed. A defect report has been filed about this
15812 issue.
15814 GNU Extension:
15816 explicit-instantiation:
15817 storage-class-specifier template
15818 decl-specifier-seq [opt] declarator [opt] ;
15819 function-specifier template
15820 decl-specifier-seq [opt] declarator [opt] ; */
15822 static void
15824 {
15826 cp_decl_specifier_seq decl_specifiers;
15831 /* Look for an (optional) storage-class-specifier or
15832 function-specifier. */
15834 {
15835 extension_specifier
15838 extension_specifier
15841 }
15843 /* Look for the `template' keyword. */
15845 /* Let the front end know that we are processing an explicit
15846 instantiation. */
15848 /* [temp.explicit] says that we are supposed to ignore access
15849 control while processing explicit instantiation directives. */
15851 /* Parse a decl-specifier-seq. */
15853 CP_PARSER_FLAGS_OPTIONAL,
15856 /* If there was exactly one decl-specifier, and it declared a class,
15857 and there's no declarator, then we have an explicit type
15858 instantiation. */
15860 {
15861 tree type;
15865 /* Turn access control back on for names used during
15866 template instantiation. */
15871 }
15872 else
15873 {
15875 tree decl;
15877 /* Parse the declarator. */
15878 declarator
15889 {
15892 "explicit instantiation shall not use"
15896 "explicit instantiation shall not use"
15901 /* Turn access control back on for names used during
15902 template instantiation. */
15904 /* Do the explicit instantiation. */
15906 }
15907 else
15908 {
15910 /* Skip the body of the explicit instantiation. */
15912 }
15913 }
15914 /* We're done with the instantiation. */
15920 }
15922 /* Parse an explicit-specialization.
15924 explicit-specialization:
15925 template < > declaration
15927 Although the standard says `declaration', what it really means is:
15929 explicit-specialization:
15930 template <> decl-specifier [opt] init-declarator [opt] ;
15931 template <> function-definition
15932 template <> explicit-specialization
15933 template <> template-declaration */
15935 static void
15937 {
15941 /* Look for the `template' keyword. */
15943 /* Look for the `<'. */
15945 /* Look for the `>'. */
15947 /* We have processed another parameter list. */
15949 /* [temp]
15951 A template ... explicit specialization ... shall not have C
15952 linkage. */
15954 {
15956 /* Give it C++ linkage to avoid confusing other parts of the
15957 front end. */
15960 }
15961 else
15963 /* Let the front end know that we are beginning a specialization. */
15965 {
15968 }
15970 /* If the next keyword is `template', we need to figure out whether
15971 or not we're looking a template-declaration. */
15973 {
15978 else
15980 }
15981 else
15982 /* Parse the dependent declaration. */
15988 /* We're done with the specialization. */
15990 /* For the erroneous case of a template with C linkage, we pushed an
15991 implicit C++ linkage scope; exit that scope now. */
15994 /* We're done with this parameter list. */
15996 }
15998 /* Parse a type-specifier.
16000 type-specifier:
16001 simple-type-specifier
16002 class-specifier
16003 enum-specifier
16004 elaborated-type-specifier
16005 cv-qualifier
16007 GNU Extension:
16009 type-specifier:
16010 __complex__
16012 Returns a representation of the type-specifier. For a
16013 class-specifier, enum-specifier, or elaborated-type-specifier, a
16014 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16016 The parser flags FLAGS is used to control type-specifier parsing.
16018 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16019 in a decl-specifier-seq.
16021 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16022 class-specifier, enum-specifier, or elaborated-type-specifier, then
16023 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16024 if a type is declared; 2 if it is defined. Otherwise, it is set to
16025 zero.
16027 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16028 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16029 is set to FALSE. */
16031 static tree
16033 cp_parser_flags flags,
16038 {
16044 /* Assume this type-specifier does not declare a new type. */
16047 /* And that it does not specify a cv-qualifier. */
16050 /* Peek at the next token. */
16053 /* If we're looking at a keyword, we can use that to guide the
16054 production we choose. */
16057 {
16062 /* Look for the enum-specifier. */
16064 /* If that worked, we're done. */
16066 {
16071 type_spec,
16072 token,
16075 }
16076 else
16079 /* Any of these indicate either a class-specifier, or an
16080 elaborated-type-specifier. */
16087 /* Parse tentatively so that we can back up if we don't find a
16088 class-specifier. */
16090 /* Look for the class-specifier. */
16093 /* If that worked, we're done. */
16095 {
16100 type_spec,
16101 token,
16104 }
16106 /* Fall through. */
16107 elaborated_type_specifier:
16108 /* We're declaring (not defining) a class or enum. */
16112 /* Fall through. */
16114 /* Look for an elaborated-type-specifier. */
16115 type_spec
16116 = (cp_parser_elaborated_type_specifier
16119 is_declaration));
16122 type_spec,
16123 token,
16146 /* The `__complex__' keyword is a GNU extension. */
16152 }
16154 /* Handle simple keywords. */
16156 {
16158 {
16161 }
16163 }
16165 /* If we do not already have a type-specifier, assume we are looking
16166 at a simple-type-specifier. */
16168 decl_specs,
16169 flags);
16171 /* If we didn't find a type-specifier, and a type-specifier was not
16172 optional in this context, issue an error message. */
16174 {
16177 }
16180 }
16182 /* Parse a simple-type-specifier.
16184 simple-type-specifier:
16185 :: [opt] nested-name-specifier [opt] type-name
16186 :: [opt] nested-name-specifier template template-id
16187 char
16188 wchar_t
16189 bool
16190 short
16191 int
16192 long
16193 signed
16194 unsigned
16195 float
16196 double
16197 void
16199 C++11 Extension:
16201 simple-type-specifier:
16202 auto
16203 decltype ( expression )
16204 char16_t
16205 char32_t
16206 __underlying_type ( type-id )
16208 C++17 extension:
16210 nested-name-specifier(opt) template-name
16212 GNU Extension:
16214 simple-type-specifier:
16215 __int128
16216 __typeof__ unary-expression
16217 __typeof__ ( type-id )
16218 __typeof__ ( type-id ) { initializer-list , [opt] }
16220 Concepts Extension:
16222 simple-type-specifier:
16223 constrained-type-specifier
16225 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16226 appropriately updated. */
16228 static tree
16231 cp_parser_flags flags)
16232 {
16237 /* Peek at the next token. */
16240 /* If we're looking at a keyword, things are easy. */
16242 {
16277 {
16280 }
16309 {
16310 /* The 'auto' might be the placeholder return type for a function decl
16311 with trailing return type. */
16320 {
16322 {
16329 }
16332 {
16335 }
16338 }
16342 {
16345 }
16348 {
16351 }
16352 else
16356 {
16359 "use of %<auto%> in lambda parameter declaration "
16360 "only available with "
16362 }
16365 "use of %<auto%> in parameter declaration "
16366 "only available with "
16370 "ISO C++ forbids use of %<auto%> in parameter "
16372 }
16373 else
16378 /* Since DR 743, decltype can either be a simple-type-specifier by
16379 itself or begin a nested-name-specifier. Parsing it will replace
16380 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16381 handling below decide what to do. */
16387 /* Consume the `typeof' token. */
16389 /* Parse the operand to `typeof'. */
16391 /* If it is not already a TYPE, take its type. */
16397 token,
16406 token,
16416 token,
16421 }
16423 /* If token is an already-parsed decltype not followed by ::,
16424 it's a simple-type-specifier. */
16427 {
16430 {
16432 token,
16434 /* Remember that we are handling a decltype in order to
16435 implement the resolution of DR 1510 when the argument
16436 isn't instantiation dependent. */
16438 }
16441 }
16443 /* If the type-specifier was for a built-in type, we're done. */
16445 {
16446 /* Record the type. */
16453 type,
16454 token,
16459 /* Consume the token. */
16465 /* There is no valid C++ program where a non-template type is
16466 followed by a "<". That usually indicates that the user thought
16467 that the type was a template. */
16472 }
16474 /* The type-specifier must be a user-defined type. */
16476 {
16480 /* Don't gobble tokens or issue error messages if this is an
16481 optional type-specifier. */
16487 /* Look for the optional `::' operator. */
16488 global_p
16492 /* Look for the nested-name specifier. */
16493 qualified_p
16500 /* If we have seen a nested-name-specifier, and the next token
16501 is `template', then we are using the template-id production. */
16504 {
16505 /* Look for the template-id. */
16509 none_type,
16511 /* If the template-id did not name a type, we are out of
16512 luck. */
16514 {
16517 }
16518 }
16519 /* Otherwise, look for a type-name. */
16520 else
16522 /* Keep track of all name-lookups performed in class scopes. */
16524 && !global_p
16525 && !qualified_p
16529 /* If it didn't work out, we don't have a TYPE. */
16534 {
16548 {
16550 none_type,
16559 else
16560 {
16565 }
16566 }
16567 else
16573 }
16576 token,
16578 }
16580 /* If we didn't get a type-name, issue an error message. */
16582 {
16585 }
16588 {
16589 /* See if TYPE is an Objective-C type, and if so, parse and
16590 accept any protocol references following it. Do this before
16591 the cp_parser_check_for_invalid_template_id() call, because
16592 Objective-C types can be followed by '<...>' which would
16593 enclose protocol names rather than template arguments, and so
16594 everything is fine. */
16597 {
16601 /* Clobber the "unqualified" type previously entered into
16602 DECL_SPECS with the new, improved protocol-qualified version. */
16607 }
16609 /* There is no valid C++ program where a non-template type is
16610 followed by a "<". That usually indicates that the user
16611 thought that the type was a template. */
16613 none_type,
16615 }
16618 }
16620 /* Parse a type-name.
16622 type-name:
16623 class-name
16624 enum-name
16625 typedef-name
16626 simple-template-id [in c++0x]
16628 enum-name:
16629 identifier
16631 typedef-name:
16632 identifier
16634 Concepts:
16636 type-name:
16637 concept-name
16638 partial-concept-id
16640 concept-name:
16641 identifier
16643 Returns a TYPE_DECL for the type. */
16645 static tree
16647 {
16649 }
16651 /* See above. */
16652 static tree
16654 {
16655 tree type_decl;
16657 /* We can't know yet whether it is a class-name or not. */
16659 /* Try a class-name. */
16661 typename_keyword_p,
16663 none_type,
16667 /* If it's not a class-name, keep looking. */
16669 {
16671 /* It must be a typedef-name or an enum-name. */
16675 /* It is either a simple-template-id representing an
16676 instantiation of an alias template... */
16680 none_type,
16682 /* Note that this must be an instantiation of an alias template
16683 because [temp.names]/6 says:
16685 A template-id that names an alias template specialization
16686 is a type-name.
16688 Whereas [temp.names]/7 says:
16690 A simple-template-id that names a class template
16691 specialization is a class-name.
16693 With concepts, this could also be a partial-concept-id that
16694 declares a non-type template parameter. */
16701 else
16705 /* ... Or a typedef-name or an enum-name. */
16707 }
16710 }
16712 /* Check if DECL and ARGS can form a constrained-type-specifier.
16713 If ARGS is non-null, we try to form a concept check of the
16714 form DECL<?, ARGS> where ? is a wildcard that matches any
16715 kind of template argument. If ARGS is NULL, then we try to
16716 form a concept check of the form DECL<?>. */
16718 static tree
16721 {
16724 /* If we a constrained-type-specifier cannot be deduced. */
16728 /* A constrained type specifier can only be found in an
16729 overload set or as a reference to a template declaration.
16731 FIXME: This might be masking a bug. It's possible that
16732 that the deduction below is causing template specializations
16733 to be formed with the wildcard as an argument. */
16737 /* Try to build a call expression that evaluates the
16738 concept. This can fail if the overload set refers
16739 only to non-templates. */
16745 /* Deduce the checked constraint and the prototype parameter.
16747 FIXME: In certain cases, failure to deduce should be a
16748 diagnosable error. */
16749 tree conc;
16750 tree proto;
16754 /* In template parameter scope, this results in a constrained
16755 parameter. Return a descriptor of that parm. */
16759 /* In a parameter-declaration-clause, constrained-type
16760 specifiers result in invented template parameters. */
16762 {
16765 }
16766 else
16767 {
16768 /* Otherwise, we're in a context where the constrained
16769 type name is deduced and the constraint applies
16770 after deduction. */
16772 }
16775 }
16777 /* If DECL refers to a concept, return a TYPE_DECL representing
16778 the result of using the constrained type specifier in the
16779 current context. DECL refers to a concept if
16781 - it is an overload set containing a function concept taking a single
16782 type argument, or
16784 - it is a variable concept taking a single type argument. */
16786 static tree
16788 {
16794 else
16796 }
16798 /* Check if DECL and ARGS form a partial-concept-id. If so,
16799 assign ID to the resulting constrained placeholder.
16801 Returns true if the partial-concept-id designates a placeholder
16802 and false otherwise. Note that *id is set to NULL_TREE in
16803 this case. */
16805 static tree
16807 {
16809 }
16811 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
16812 or a concept-name.
16814 enum-name:
16815 identifier
16817 typedef-name:
16818 identifier
16820 concept-name:
16821 identifier
16823 Returns a TYPE_DECL for the type. */
16825 static tree
16827 {
16828 tree type_decl;
16829 tree identifier;
16836 /* Look up the type-name. */
16841 /* If we found an overload set, then it may refer to a concept-name. */
16847 {
16848 /* See if this is an Objective-C type. */
16853 }
16855 /* Issue an error if we did not find a type-name. */
16857 /* In Objective-C, we have the complication that class names are
16858 normally type names and start declarations (eg, the
16859 "NSObject" in "NSObject *object;"), but can be used in an
16860 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
16861 is an expression. So, a classname followed by a dot is not a
16862 valid type-name. */
16865 {
16870 }
16871 /* Remember that the name was used in the definition of the
16872 current class so that we can check later to see if the
16873 meaning would have been different after the class was
16874 entirely defined. */
16880 }
16882 /* Parse an elaborated-type-specifier. Note that the grammar given
16883 here incorporates the resolution to DR68.
16885 elaborated-type-specifier:
16886 class-key :: [opt] nested-name-specifier [opt] identifier
16887 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
16888 enum-key :: [opt] nested-name-specifier [opt] identifier
16889 typename :: [opt] nested-name-specifier identifier
16890 typename :: [opt] nested-name-specifier template [opt]
16891 template-id
16893 GNU extension:
16895 elaborated-type-specifier:
16896 class-key attributes :: [opt] nested-name-specifier [opt] identifier
16897 class-key attributes :: [opt] nested-name-specifier [opt]
16898 template [opt] template-id
16899 enum attributes :: [opt] nested-name-specifier [opt] identifier
16901 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
16902 declared `friend'. If IS_DECLARATION is TRUE, then this
16903 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
16904 something is being declared.
16906 Returns the TYPE specified. */
16908 static tree
16912 {
16914 tree identifier;
16917 tree globalscope;
16920 /* See if we're looking at the `enum' keyword. */
16922 {
16923 /* Consume the `enum' token. */
16925 /* Remember that it's an enumeration type. */
16927 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
16928 enums) is used here. */
16931 {
16935 /* Consume the `struct' or `class' and parse it anyway. */
16937 }
16938 /* Parse the attributes. */
16940 }
16941 /* Or, it might be `typename'. */
16943 RID_TYPENAME))
16944 {
16945 /* Consume the `typename' token. */
16947 /* Remember that it's a `typename' type. */
16949 }
16950 /* Otherwise it must be a class-key. */
16951 else
16952 {
16956 /* Parse the attributes. */
16958 }
16960 /* Look for the `::' operator. */
16963 /* Look for the nested-name-specifier. */
16965 {
16970 is_declaration))
16972 }
16973 else
16974 /* Even though `typename' is not present, the proposed resolution
16975 to Core Issue 180 says that in `class A<T>::B', `B' should be
16976 considered a type-name, even if `A<T>' is dependent. */
16981 is_declaration);
16982 /* For everything but enumeration types, consider a template-id.
16983 For an enumeration type, consider only a plain identifier. */
16985 {
16987 tree decl;
16989 /* Allow the `template' keyword. */
16991 /* If we didn't see `template', we don't know if there's a
16992 template-id or not. */
16995 /* Parse the template-id. */
16999 tag_type,
17000 is_declaration);
17001 /* If we didn't find a template-id, look for an ordinary
17002 identifier. */
17004 ;
17005 /* We can get here when cp_parser_template_id, called by
17006 cp_parser_class_name with tag_type == none_type, succeeds
17007 and caches a BASELINK. Then, when called again here,
17008 instead of failing and returning an error_mark_node
17009 returns it (see template/typename17.C in C++11).
17010 ??? Could we diagnose this earlier? */
17012 {
17015 }
17016 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17017 in effect, then we must assume that, upon instantiation, the
17018 template will correspond to a class. */
17022 typename_type,
17024 /* If the `typename' keyword is in effect and DECL is not a type
17025 decl, then type is non existent. */
17027 ;
17033 }
17036 {
17041 {
17044 }
17046 /* For a `typename', we needn't call xref_tag. */
17052 /* Template parameter lists apply only if we are not within a
17053 function parameter list. */
17054 bool template_parm_lists_apply
17063 /* Look up a qualified name in the usual way. */
17065 {
17066 tree decl;
17067 tree ambiguous_decls;
17070 tag_type,
17077 /* If the lookup was ambiguous, an error will already have been
17078 issued. */
17082 /* If we are parsing friend declaration, DECL may be a
17083 TEMPLATE_DECL tree node here. However, we need to check
17084 whether this TEMPLATE_DECL results in valid code. Consider
17085 the following example:
17087 namespace N {
17088 template <class T> class C {};
17089 }
17090 class X {
17091 template <class T> friend class N::C; // #1, valid code
17092 };
17093 template <class T> class Y {
17094 friend class N::C; // #2, invalid code
17095 };
17097 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17098 name lookup of `N::C'. We see that friend declaration must
17099 be template for the code to be valid. Note that
17100 processing_template_decl does not work here since it is
17101 always 1 for the above two cases. */
17103 decl = (cp_parser_maybe_treat_template_as_class
17108 {
17110 identifier,
17113 }
17116 {
17120 allow_template);
17124 }
17126 /* Forward declarations of nested types, such as
17128 class C1::C2;
17129 class C1::C2::C3;
17131 are invalid unless all components preceding the final '::'
17132 are complete. If all enclosing types are complete, these
17133 declarations become merely pointless.
17135 Invalid forward declarations of nested types are errors
17136 caught elsewhere in parsing. Those that are pointless arrive
17137 here. */
17144 }
17145 else
17146 {
17147 /* An elaborated-type-specifier sometimes introduces a new type and
17148 sometimes names an existing type. Normally, the rule is that it
17149 introduces a new type only if there is not an existing type of
17150 the same name already in scope. For example, given:
17152 struct S {};
17153 void f() { struct S s; }
17155 the `struct S' in the body of `f' is the same `struct S' as in
17156 the global scope; the existing definition is used. However, if
17157 there were no global declaration, this would introduce a new
17158 local class named `S'.
17160 An exception to this rule applies to the following code:
17162 namespace N { struct S; }
17164 Here, the elaborated-type-specifier names a new type
17165 unconditionally; even if there is already an `S' in the
17166 containing scope this declaration names a new type.
17167 This exception only applies if the elaborated-type-specifier
17168 forms the complete declaration:
17170 [class.name]
17172 A declaration consisting solely of `class-key identifier ;' is
17173 either a redeclaration of the name in the current scope or a
17174 forward declaration of the identifier as a class name. It
17175 introduces the name into the current scope.
17177 We are in this situation precisely when the next token is a `;'.
17179 An exception to the exception is that a `friend' declaration does
17180 *not* name a new type; i.e., given:
17182 struct S { friend struct T; };
17184 `T' is not a new type in the scope of `S'.
17186 Also, `new struct S' or `sizeof (struct S)' never results in the
17187 definition of a new type; a new type can only be declared in a
17188 declaration context. */
17190 tag_scope ts;
17194 /* Friends have special name lookup rules. */
17198 CPP_SEMICOLON))
17199 /* This is a `class-key identifier ;' */
17201 else
17204 template_p =
17205 (template_parm_lists_apply
17208 /* An unqualified name was used to reference this type, so
17209 there were no qualifying templates. */
17217 }
17218 }
17223 /* Allow attributes on forward declarations of classes. */
17225 {
17235 else
17238 }
17241 {
17242 /* Indicate whether this class was declared as a `class' or as a
17243 `struct'. */
17247 }
17249 /* A "<" cannot follow an elaborated type specifier. If that
17250 happens, the user was probably trying to form a template-id. */
17255 }
17257 /* Parse an enum-specifier.
17259 enum-specifier:
17260 enum-head { enumerator-list [opt] }
17261 enum-head { enumerator-list , } [C++0x]
17263 enum-head:
17264 enum-key identifier [opt] enum-base [opt]
17265 enum-key nested-name-specifier identifier enum-base [opt]
17267 enum-key:
17268 enum
17269 enum class [C++0x]
17270 enum struct [C++0x]
17272 enum-base: [C++0x]
17273 : type-specifier-seq
17275 opaque-enum-specifier:
17276 enum-key identifier enum-base [opt] ;
17278 GNU Extensions:
17279 enum-key attributes[opt] identifier [opt] enum-base [opt]
17280 { enumerator-list [opt] }attributes[opt]
17281 enum-key attributes[opt] identifier [opt] enum-base [opt]
17282 { enumerator-list, }attributes[opt] [C++0x]
17284 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17285 if the token stream isn't an enum-specifier after all. */
17287 static tree
17289 {
17290 tree identifier;
17292 tree prev_scope;
17294 tree attributes;
17307 /* Parse tentatively so that we can back up if we don't find a
17308 enum-specifier. */
17311 /* Caller guarantees that the current token is 'enum', an identifier
17312 possibly follows, and the token after that is an opening brace.
17313 If we don't have an identifier, fabricate an anonymous name for
17314 the enumeration being defined. */
17317 /* Parse the "class" or "struct", which indicates a scoped
17318 enumeration type in C++0x. */
17321 {
17325 /* Consume the `struct' or `class' token. */
17329 }
17333 /* Clear the qualification. */
17338 /* Figure out in what scope the declaration is being placed. */
17344 nested_name_specifier
17352 {
17353 tree name;
17357 enum_type,
17362 input_location);
17364 {
17367 {
17368 /* Are template enums allowed in ISO? */
17372 /* ignore a typename reference, for it will be solved by name
17373 in start_enum. */
17375 }
17376 }
17379 else
17380 {
17385 }
17386 }
17387 else
17388 {
17391 else
17392 {
17398 }
17399 }
17402 /* Check for the `:' that denotes a specified underlying type in C++0x.
17403 Note that a ':' could also indicate a bitfield width, however. */
17405 {
17406 cp_decl_specifier_seq type_specifiers;
17408 /* Consume the `:'. */
17411 /* Parse the type-specifier-seq. */
17416 /* At this point this is surely not elaborated type specifier. */
17425 /* If that didn't work, stop. */
17427 {
17433 }
17434 }
17436 /* Look for the `{' but don't consume it yet. */
17438 {
17440 {
17443 {
17446 }
17447 }
17448 /* An opaque-enum-specifier must have a ';' here. */
17451 {
17454 {
17457 }
17458 }
17459 }
17465 {
17467 {
17471 }
17473 {
17475 }
17476 }
17478 /* Issue an error message if type-definitions are forbidden here. */
17481 else
17482 /* Create the new type. We do this before consuming the opening
17483 brace so the enum will be recorded as being on the line of its
17484 tag (or the 'enum' keyword, if there is no tag). */
17488 /* If the next token is not '{' it is an opaque-enum-specifier or an
17489 elaborated-type-specifier. */
17491 {
17495 {
17496 /* The following catches invalid code such as:
17497 enum class S<int>::E { A, B, C }; */
17505 {
17509 nested_name_specifier);
17511 }
17514 {
17516 "%qT for enum declaration does not name a class "
17519 }
17520 /* If that scope does not contain the scope in which the
17521 class was originally declared, the program is invalid. */
17523 nested_name_specifier))
17524 {
17527 "declaration of %qD in namespace %qD which does not "
17530 else
17532 "declaration of %qD in %qD which does not "
17536 }
17537 /* If that scope is the scope where the declaration is being placed
17538 the program is invalid. */
17542 {
17546 }
17547 }
17552 /* Consume the opening brace. */
17559 {
17563 }
17564 else
17565 {
17571 }
17575 /* If the next token is not '}', then there are some enumerators. */
17577 {
17581 }
17582 else
17585 /* Consume the final '}'. */
17591 }
17592 else
17593 {
17594 /* If a ';' follows, then it is an opaque-enum-specifier
17595 and additional restrictions apply. */
17597 {
17604 }
17605 }
17607 /* Look for trailing attributes to apply to this enumeration, and
17608 apply them if appropriate. */
17610 {
17613 trailing_attr,
17615 }
17617 /* Finish up the enumeration. */
17619 {
17624 }
17627 {
17629 {
17632 }
17634 {
17636 }
17637 }
17638 out:
17641 }
17643 /* Parse an enumerator-list. The enumerators all have the indicated
17644 TYPE.
17646 enumerator-list:
17647 enumerator-definition
17648 enumerator-list , enumerator-definition */
17650 static void
17652 {
17654 {
17655 /* Parse an enumerator-definition. */
17658 /* If the next token is not a ',', we've reached the end of
17659 the list. */
17662 /* Otherwise, consume the `,' and keep going. */
17664 /* If the next token is a `}', there is a trailing comma. */
17666 {
17671 }
17672 }
17673 }
17675 /* Parse an enumerator-definition. The enumerator has the indicated
17676 TYPE.
17678 enumerator-definition:
17679 enumerator
17680 enumerator = constant-expression
17682 enumerator:
17683 identifier
17685 GNU Extensions:
17687 enumerator-definition:
17688 enumerator attributes [opt]
17689 enumerator attributes [opt] = constant-expression */
17691 static void
17693 {
17694 tree identifier;
17695 tree value;
17696 location_t loc;
17698 /* Save the input location because we are interested in the location
17699 of the identifier and not the location of the explicit value. */
17702 /* Look for the identifier. */
17707 /* Parse any specified attributes. */
17710 /* If the next token is an '=', then there is an explicit value. */
17712 {
17713 /* Consume the `=' token. */
17715 /* Parse the value. */
17717 }
17718 else
17721 /* If we are processing a template, make sure the initializer of the
17722 enumerator doesn't contain any bare template parameter pack. */
17726 /* Create the enumerator. */
17728 }
17730 /* Parse a namespace-name.
17732 namespace-name:
17733 original-namespace-name
17734 namespace-alias
17736 Returns the NAMESPACE_DECL for the namespace. */
17738 static tree
17740 {
17741 tree identifier;
17742 tree namespace_decl;
17746 /* Get the name of the namespace. */
17751 /* Look up the identifier in the currently active scope. Look only
17752 for namespaces, due to:
17754 [basic.lookup.udir]
17756 When looking up a namespace-name in a using-directive or alias
17757 definition, only namespace names are considered.
17759 And:
17761 [basic.lookup.qual]
17763 During the lookup of a name preceding the :: scope resolution
17764 operator, object, function, and enumerator names are ignored.
17766 (Note that cp_parser_qualifying_entity only calls this
17767 function if the token after the name is the scope resolution
17768 operator.) */
17770 none_type,
17776 /* If it's not a namespace, issue an error. */
17779 {
17784 }
17787 }
17789 /* Parse a namespace-definition.
17791 namespace-definition:
17792 named-namespace-definition
17793 unnamed-namespace-definition
17795 named-namespace-definition:
17796 original-namespace-definition
17797 extension-namespace-definition
17799 original-namespace-definition:
17800 namespace identifier { namespace-body }
17802 extension-namespace-definition:
17803 namespace original-namespace-name { namespace-body }
17805 unnamed-namespace-definition:
17806 namespace { namespace-body } */
17808 static void
17810 {
17820 {
17824 }
17825 else
17828 /* Look for the `namespace' keyword. */
17831 /* Parse any specified attributes before the identifier. */
17834 /* Get the name of the namespace. We do not attempt to distinguish
17835 between an original-namespace-definition and an
17836 extension-namespace-definition at this point. The semantic
17837 analysis routines are responsible for that. */
17840 else
17843 /* Parse any specified attributes after the identifier. */
17846 {
17849 else
17851 }
17853 /* Start the namespace. */
17856 /* Parse any nested namespace definition. */
17858 {
17863 "nested namespace definitions only available with "
17868 {
17872 else
17873 {
17876 }
17879 }
17880 }
17882 /* Look for the `{' to validate starting the namespace. */
17885 /* "inline namespace" is equivalent to a stub namespace definition
17886 followed by a strong using directive. */
17888 {
17890 /* Set up namespace association. */
17894 /* Import the contents of the inline namespace. */
17898 }
17904 /* Parse the body of the namespace. */
17910 /* Finish the nested namespace definitions. */
17914 /* Finish the namespace. */
17917 /* Look for the final `}'. */
17919 }
17921 /* Parse a namespace-body.
17923 namespace-body:
17924 declaration-seq [opt] */
17926 static void
17928 {
17930 }
17932 /* Parse a namespace-alias-definition.
17934 namespace-alias-definition:
17935 namespace identifier = qualified-namespace-specifier ; */
17937 static void
17939 {
17940 tree identifier;
17941 tree namespace_specifier;
17945 /* Look for the `namespace' keyword. */
17947 /* Look for the identifier. */
17951 /* Look for the `=' token. */
17954 {
17956 /* Skip the definition. */
17961 }
17963 /* Look for the qualified-namespace-specifier. */
17964 namespace_specifier
17966 /* Look for the `;' token. */
17969 /* Register the alias in the symbol table. */
17971 }
17973 /* Parse a qualified-namespace-specifier.
17975 qualified-namespace-specifier:
17976 :: [opt] nested-name-specifier [opt] namespace-name
17978 Returns a NAMESPACE_DECL corresponding to the specified
17979 namespace. */
17981 static tree
17983 {
17984 /* Look for the optional `::'. */
17988 /* Look for the optional nested-name-specifier. */
17996 }
17998 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
17999 access declaration.
18001 using-declaration:
18002 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18003 using :: unqualified-id ;
18005 access-declaration:
18006 qualified-id ;
18008 */
18010 static bool
18013 {
18017 tree decl;
18018 tree identifier;
18019 tree qscope;
18024 {
18027 }
18028 else
18029 {
18030 /* Look for the `using' keyword. */
18033 /* Peek at the next token. */
18035 /* See if it's `typename'. */
18037 {
18038 /* Remember that we've seen it. */
18040 /* Consume the `typename' token. */
18042 }
18043 }
18045 /* Look for the optional global scope qualification. */
18046 global_scope_p
18051 /* If we saw `typename', or didn't see `::', then there must be a
18052 nested-name-specifier present. */
18054 {
18060 {
18063 }
18064 }
18065 /* Otherwise, we could be in either of the two productions. In that
18066 case, treat the nested-name-specifier as optional. */
18067 else
18079 /* Something has already gone wrong; there's no need to parse
18080 further. Since an error has occurred, the return value of
18081 cp_parser_parse_definitely will be false, as required. */
18085 /* Parse the unqualified-id. */
18093 {
18098 }
18100 /* The function we call to handle a using-declaration is different
18101 depending on what scope we are in. */
18103 ;
18106 /* [namespace.udecl]
18108 A using declaration shall not name a template-id. */
18111 else
18112 {
18114 {
18115 /* Create the USING_DECL. */
18122 {
18125 }
18126 else
18127 /* Add it to the list of members in this class. */
18129 }
18130 else
18131 {
18133 identifier,
18140 {
18143 }
18146 else
18148 }
18149 }
18151 /* Look for the final `;'. */
18156 "access declarations are deprecated "
18157 "in favour of using-declarations; "
18161 }
18163 /* Parse an alias-declaration.
18165 alias-declaration:
18166 using identifier attribute-specifier-seq [opt] = type-id */
18168 static tree
18170 {
18172 location_t id_location;
18174 cp_decl_specifier_seq decl_specs;
18178 /* Look for the `using' keyword. */
18179 cp_token *using_token
18201 /* Now we are going to parse the type-id of the declaration. */
18203 /*
18204 [dcl.type]/3 says:
18206 "A type-specifier-seq shall not define a class or enumeration
18207 unless it appears in the type-id of an alias-declaration (7.1.3) that
18208 is not the declaration of a template-declaration."
18210 In other words, if we currently are in an alias template, the
18211 type-id should not define a type.
18213 So let's set parser->type_definition_forbidden_message in that
18214 case; cp_parser_check_type_definition (called by
18215 cp_parser_class_specifier) will then emit an error if a type is
18216 defined in the type-id. */
18218 {
18222 }
18226 /* Restore the error message if need be. */
18232 {
18235 }
18237 /* A typedef-name can also be introduced by an alias-declaration. The
18238 identifier following the using keyword becomes a typedef-name. It has
18239 the same semantics as if it were introduced by the typedef
18240 specifier. In particular, it does not define a new type and it shall
18241 not appear in the type-id. */
18246 {
18249 ds_attribute,
18250 attrs_token);
18251 }
18253 ds_typedef,
18254 using_token);
18256 ds_alias,
18257 using_token);
18266 else
18272 // Attach constraints to the alias declaration.
18274 {
18278 }
18285 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18286 added into the symbol table; otherwise, return the TYPE_DECL. */
18290 {
18294 }
18297 }
18299 /* Parse a using-directive.
18301 using-directive:
18302 using namespace :: [opt] nested-name-specifier [opt]
18303 namespace-name ; */
18305 static void
18307 {
18308 tree namespace_decl;
18309 tree attribs;
18311 /* Look for the `using' keyword. */
18313 /* And the `namespace' keyword. */
18315 /* Look for the optional `::' operator. */
18317 /* And the optional nested-name-specifier. */
18323 /* Get the namespace being used. */
18325 /* And any specified attributes. */
18327 /* Update the symbol table. */
18329 /* Look for the final `;'. */
18331 }
18333 /* Parse an asm-definition.
18335 asm-definition:
18336 asm ( string-literal ) ;
18338 GNU Extension:
18340 asm-definition:
18341 asm volatile [opt] ( string-literal ) ;
18342 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18343 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18344 : asm-operand-list [opt] ) ;
18345 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18346 : asm-operand-list [opt]
18347 : asm-clobber-list [opt] ) ;
18348 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18349 : asm-clobber-list [opt]
18350 : asm-goto-list ) ; */
18352 static void
18354 {
18355 tree string;
18360 tree asm_stmt;
18368 /* Look for the `asm' keyword. */
18373 {
18376 }
18378 /* See if the next token is `volatile'. */
18381 {
18382 /* Remember that we saw the `volatile' keyword. */
18384 /* Consume the token. */
18386 }
18390 {
18391 /* Remember that we saw the `goto' keyword. */
18393 /* Consume the token. */
18395 }
18396 /* Look for the opening `('. */
18399 /* Look for the string. */
18402 {
18406 }
18408 /* If we're allowing GNU extensions, check for the extended assembly
18409 syntax. Unfortunately, the `:' tokens need not be separated by
18410 a space in C, and so, for compatibility, we tolerate that here
18411 too. Doing that means that we have to treat the `::' operator as
18412 two `:' tokens. */
18417 {
18422 /* The extended syntax was used. */
18425 /* Look for outputs. */
18427 {
18428 /* Consume the `:'. */
18430 /* Parse the output-operands. */
18432 CPP_COLON)
18434 CPP_SCOPE)
18436 CPP_CLOSE_PAREN)
18438 {
18442 }
18443 }
18444 /* If the next token is `::', there are no outputs, and the
18445 next token is the beginning of the inputs. */
18447 /* The inputs are coming next. */
18450 /* Look for inputs. */
18453 {
18454 /* Consume the `:' or `::'. */
18456 /* Parse the output-operands. */
18458 CPP_COLON)
18460 CPP_SCOPE)
18462 CPP_CLOSE_PAREN))
18463 {
18467 }
18468 }
18470 /* The clobbers are coming next. */
18473 /* Look for clobbers. */
18476 {
18478 /* Consume the `:' or `::'. */
18480 /* Parse the clobbers. */
18482 CPP_COLON)
18484 CPP_CLOSE_PAREN))
18486 }
18489 /* The labels are coming next. */
18492 /* Look for labels. */
18495 {
18497 /* Consume the `:' or `::'. */
18499 /* Parse the labels. */
18501 }
18505 }
18509 /* Look for the closing `)'. */
18517 {
18518 /* Create the ASM_EXPR. */
18520 {
18523 /* If the extended syntax was not used, mark the ASM_EXPR. */
18525 {
18531 }
18532 }
18533 else
18535 }
18536 }
18538 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
18539 type that comes from the decl-specifier-seq. */
18541 static tree
18543 {
18546 {
18558 }
18561 }
18563 /* Declarators [gram.dcl.decl] */
18565 /* Parse an init-declarator.
18567 init-declarator:
18568 declarator initializer [opt]
18570 GNU Extension:
18572 init-declarator:
18573 declarator asm-specification [opt] attributes [opt] initializer [opt]
18575 function-definition:
18576 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18577 function-body
18578 decl-specifier-seq [opt] declarator function-try-block
18580 GNU Extension:
18582 function-definition:
18583 __extension__ function-definition
18585 TM Extension:
18587 function-definition:
18588 decl-specifier-seq [opt] declarator function-transaction-block
18590 The DECL_SPECIFIERS apply to this declarator. Returns a
18591 representation of the entity declared. If MEMBER_P is TRUE, then
18592 this declarator appears in a class scope. The new DECL created by
18593 this declarator is returned.
18595 The CHECKS are access checks that should be performed once we know
18596 what entity is being declared (and, therefore, what classes have
18597 befriended it).
18599 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18600 for a function-definition here as well. If the declarator is a
18601 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18602 be TRUE upon return. By that point, the function-definition will
18603 have been completely parsed.
18605 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18606 is FALSE.
18608 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18609 parsed declaration if it is an uninitialized single declarator not followed
18610 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18611 if present, will not be consumed. If returned, this declarator will be
18612 created with SD_INITIALIZED but will not call cp_finish_decl.
18614 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
18615 and there is an initializer, the pointed location_t is set to the
18616 location of the '=' or `(', or '{' in C++11 token introducing the
18617 initializer. */
18619 static tree
18630 {
18634 tree prefix_attributes;
18636 tree asm_specification;
18637 tree initializer;
18639 tree scope;
18641 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
18642 initialized with "= ..", CPP_OPEN_PAREN if initialized with
18643 "(...)". */
18654 /* Gather the attributes that were provided with the
18655 decl-specifiers. */
18658 /* Assume that this is not the declarator for a function
18659 definition. */
18663 /* Default arguments are only permitted for function parameters. */
18667 /* Defer access checks while parsing the declarator; we cannot know
18668 what names are accessible until we know what is being
18669 declared. */
18679 {
18680 // C++17 deduction guide.
18689 }
18691 /* Parse the declarator. */
18692 declarator
18697 /* Gather up the deferred checks. */
18702 /* If the DECLARATOR was erroneous, there's no need to go
18703 further. */
18708 {
18713 sfk_none);
18716 }
18718 /* Check that the number of template-parameter-lists is OK. */
18728 /* Figure out what scope the entity declared by the DECLARATOR is
18729 located in. `grokdeclarator' sometimes changes the scope, so
18730 we compute it now. */
18733 /* Perform any lookups in the declared type which were thought to be
18734 dependent, but are not in the scope of the declarator. */
18735 decl_specifiers->type
18738 /* If we're allowing GNU extensions, look for an
18739 asm-specification. */
18741 {
18742 /* Look for an asm-specification. */
18745 }
18746 else
18749 /* Look for attributes. */
18753 /* Peek at the next token. */
18759 {
18760 /* Check to see if the token indicates the start of a
18761 function-definition. */
18763 {
18765 {
18766 /* If a function-definition should not appear here, issue an
18767 error message. */
18771 }
18773 location_t func_brace_location
18776 /* Neither attributes nor an asm-specification are allowed
18777 on a function-definition. */
18780 "an asm-specification is not allowed "
18784 "attributes are not allowed "
18786 /* This is a function-definition. */
18789 /* Parse the function definition. */
18792 decl_specifiers,
18793 declarator,
18794 prefix_attributes);
18795 else
18796 decl =
18797 (cp_parser_function_definition_from_specifiers_and_declarator
18801 {
18802 /* This is where the prologue starts... */
18805 }
18808 }
18809 }
18811 {
18812 /* A non-template declaration involving a function parameter list
18813 containing an implicit template parameter will be made into a
18814 template. If the resulting declaration is not going to be an
18815 actual function then finish the template scope here to prevent it.
18816 An error message will be issued once we have a decl to talk about.
18818 FIXME probably we should do type deduction rather than create an
18819 implicit template, but the standard currently doesn't allow it. */
18822 }
18824 /* [dcl.dcl]
18826 Only in function declarations for constructors, destructors, and
18827 type conversions can the decl-specifier-seq be omitted.
18829 We explicitly postpone this check past the point where we handle
18830 function-definitions because we tolerate function-definitions
18831 that are missing their return types in some modes. */
18833 {
18837 }
18839 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
18843 {
18854 {
18860 }
18861 }
18862 else
18863 {
18864 /* If the init-declarator isn't initialized and isn't followed by a
18865 `,' or `;', it's not a valid init-declarator. */
18868 {
18871 else
18872 {
18876 }
18877 }
18880 }
18882 /* Because start_decl has side-effects, we should only call it if we
18883 know we're going ahead. By this point, we know that we cannot
18884 possibly be looking at any other construct. */
18887 /* Enter the newly declared entry in the symbol table. If we're
18888 processing a declaration in a class-specifier, we wait until
18889 after processing the initializer. */
18891 {
18899 /* Adjust location of decl if declarator->id_loc is more appropriate:
18900 set, and decl wasn't merged with another decl, in which case its
18901 location would be different from input_location, and more accurate. */
18906 }
18908 /* Enter the SCOPE. That way unqualified names appearing in the
18909 initializer will be looked up in SCOPE. */
18912 /* Perform deferred access control checks, now that we know in which
18913 SCOPE the declared entity resides. */
18915 {
18918 /* If the entity being declared is a function, pretend that we
18919 are in its scope. If it is a `friend', it may have access to
18920 things that would not otherwise be accessible. */
18922 {
18925 }
18927 /* Perform access checks for template parameters. */
18930 /* Perform the access control checks for the declarator and the
18931 decl-specifiers. */
18934 /* Restore the saved value. */
18937 }
18939 /* Parse the initializer. */
18944 {
18946 {
18949 else
18950 {
18951 /* If the declaration was erroneous, we don't really
18952 know what the user intended, so just silently
18953 consume the initializer. */
18960 }
18961 }
18962 else
18963 {
18964 /* We want to record the extra mangling scope for in-class
18965 initializers of class members and initializers of static data
18966 member templates. The former involves deferring
18967 parsing of the initializer until end of class as with default
18968 arguments. So right here we only handle the latter. */
18978 }
18979 }
18981 /* The old parser allows attributes to appear after a parenthesized
18982 initializer. Mark Mitchell proposed removing this functionality
18983 on the GCC mailing lists on 2002-08-13. This parser accepts the
18984 attributes -- but ignores them. */
18991 /* And now complain about a non-function implicit template. */
18996 /* For an in-class declaration, use `grokfield' to create the
18997 declaration. */
18999 {
19001 {
19004 }
19013 }
19015 /* Finish processing the declaration. But, skip member
19016 declarations. */
19018 {
19021 asm_specification,
19022 /* If the initializer is in parentheses, then this is
19023 a direct-initialization, which means that an
19024 `explicit' constructor is OK. Otherwise, an
19025 `explicit' constructor cannot be used. */
19028 }
19031 /* Core issue #226 (C++0x only): A default template-argument
19032 shall not be specified in a friend class template
19033 declaration. */
19042 {
19045 else
19047 }
19054 }
19056 /* Parse a declarator.
19058 declarator:
19059 direct-declarator
19060 ptr-operator declarator
19062 abstract-declarator:
19063 ptr-operator abstract-declarator [opt]
19064 direct-abstract-declarator
19066 GNU Extensions:
19068 declarator:
19069 attributes [opt] direct-declarator
19070 attributes [opt] ptr-operator declarator
19072 abstract-declarator:
19073 attributes [opt] ptr-operator abstract-declarator [opt]
19074 attributes [opt] direct-abstract-declarator
19076 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19077 detect constructor, destructor or conversion operators. It is set
19078 to -1 if the declarator is a name, and +1 if it is a
19079 function. Otherwise it is set to zero. Usually you just want to
19080 test for >0, but internally the negative value is used.
19082 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19083 a decl-specifier-seq unless it declares a constructor, destructor,
19084 or conversion. It might seem that we could check this condition in
19085 semantic analysis, rather than parsing, but that makes it difficult
19086 to handle something like `f()'. We want to notice that there are
19087 no decl-specifiers, and therefore realize that this is an
19088 expression, not a declaration.)
19090 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19091 the declarator is a direct-declarator of the form "(...)".
19093 MEMBER_P is true iff this declarator is a member-declarator.
19095 FRIEND_P is true iff this declarator is a friend. */
19099 cp_parser_declarator_kind dcl_kind,
19103 {
19106 cp_cv_quals cv_quals;
19107 tree class_type;
19110 /* Assume this is not a constructor, destructor, or type-conversion
19111 operator. */
19118 /* Check for the ptr-operator production. */
19120 /* Parse the ptr-operator. */
19126 /* If that worked, then we have a ptr-operator. */
19128 {
19129 /* If a ptr-operator was found, then this declarator was not
19130 parenthesized. */
19133 /* The dependent declarator is optional if we are parsing an
19134 abstract-declarator. */
19138 /* Parse the dependent declarator. */
19143 friend_p);
19145 /* If we are parsing an abstract-declarator, we must handle the
19146 case where the dependent declarator is absent. */
19151 declarator = cp_parser_make_indirect_declarator
19153 }
19154 /* Everything else is a direct-declarator. */
19155 else
19156 {
19159 CPP_OPEN_PAREN);
19161 ctor_dtor_or_conv_p,
19163 }
19168 }
19170 /* Parse a direct-declarator or direct-abstract-declarator.
19172 direct-declarator:
19173 declarator-id
19174 direct-declarator ( parameter-declaration-clause )
19175 cv-qualifier-seq [opt]
19176 ref-qualifier [opt]
19177 exception-specification [opt]
19178 direct-declarator [ constant-expression [opt] ]
19179 ( declarator )
19181 direct-abstract-declarator:
19182 direct-abstract-declarator [opt]
19183 ( parameter-declaration-clause )
19184 cv-qualifier-seq [opt]
19185 ref-qualifier [opt]
19186 exception-specification [opt]
19187 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19188 ( abstract-declarator )
19190 Returns a representation of the declarator. DCL_KIND is
19191 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19192 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19193 we are parsing a direct-declarator. It is
19194 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19195 of ambiguity we prefer an abstract declarator, as per
19196 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19197 as for cp_parser_declarator. */
19201 cp_parser_declarator_kind dcl_kind,
19204 {
19214 {
19215 /* Peek at the next token. */
19218 {
19219 /* This is either a parameter-declaration-clause, or a
19220 parenthesized declarator. When we know we are parsing a
19221 named declarator, it must be a parenthesized declarator
19222 if FIRST is true. For instance, `(int)' is a
19223 parameter-declaration-clause, with an omitted
19224 direct-abstract-declarator. But `((*))', is a
19225 parenthesized abstract declarator. Finally, when T is a
19226 template parameter `(T)' is a
19227 parameter-declaration-clause, and not a parenthesized
19228 named declarator.
19230 We first try and parse a parameter-declaration-clause,
19231 and then try a nested declarator (if FIRST is true).
19233 It is not an error for it not to be a
19234 parameter-declaration-clause, even when FIRST is
19235 false. Consider,
19237 int i (int);
19238 int i (3);
19240 The first is the declaration of a function while the
19241 second is the definition of a variable, including its
19242 initializer.
19244 Having seen only the parenthesis, we cannot know which of
19245 these two alternatives should be selected. Even more
19246 complex are examples like:
19248 int i (int (a));
19249 int i (int (3));
19251 The former is a function-declaration; the latter is a
19252 variable initialization.
19254 Thus again, we try a parameter-declaration-clause, and if
19255 that fails, we back out and return. */
19258 {
19259 tree params;
19262 /* In a member-declarator, the only valid interpretation
19263 of a parenthesis is the start of a
19264 parameter-declaration-clause. (It is invalid to
19265 initialize a static data member with a parenthesized
19266 initializer; only the "=" form of initialization is
19267 permitted.) */
19271 /* Consume the `('. */
19274 {
19275 /* If this is going to be an abstract declarator, we're
19276 in a declarator and we can't have default args. */
19279 }
19283 /* Parse the parameter-declaration-clause. */
19286 /* Consume the `)'. */
19289 /* If all went well, parse the cv-qualifier-seq,
19290 ref-qualifier and the exception-specification. */
19292 {
19293 cp_cv_quals cv_quals;
19294 cp_virt_specifiers virt_specifiers;
19295 cp_ref_qualifier ref_qual;
19296 tree exception_specification;
19297 tree late_return;
19298 tree attrs;
19308 /* Parse the cv-qualifier-seq. */
19310 /* Parse the ref-qualifier. */
19312 /* Parse the tx-qualifier. */
19314 /* And the exception-specification. */
19315 exception_specification
19320 /* In here, we handle cases where attribute is used after
19321 the function declaration. For example:
19322 void func (int x) __attribute__((vector(..))); */
19326 {
19330 CPP_SEMICOLON)
19332 CPP_OPEN_BRACE))
19335 ;
19336 else
19338 }
19340 late_return = (cp_parser_late_return_type_opt
19344 /* Parse the virt-specifier-seq. */
19347 /* Create the function-declarator. */
19349 params,
19350 cv_quals,
19351 virt_specifiers,
19352 ref_qual,
19353 tx_qual,
19354 exception_specification,
19355 late_return,
19356 requires_clause);
19359 /* Any subsequent parameter lists are to do with
19360 return type, so are not those of the declared
19361 function. */
19363 }
19365 /* Remove the function parms from scope. */
19369 /* Repeat the main loop. */
19371 }
19373 /* If this is the first, we can try a parenthesized
19374 declarator. */
19376 {
19382 /* Consume the `('. */
19384 /* Parse the nested declarator. */
19387 declarator
19393 /* Expect a `)'. */
19400 }
19401 /* Otherwise, we must be done. */
19402 else
19404 }
19408 {
19409 /* Parse an array-declarator. */
19418 /* Consume the `['. */
19420 /* Peek at the next token. */
19422 /* If the next token is `]', then there is no
19423 constant-expression. */
19425 {
19427 bounds
19437 {
19438 /* Normally, the array bound must be an integral constant
19439 expression. However, as an extension, we allow VLAs
19440 in function scopes as long as they aren't part of a
19441 parameter declaration. */
19445 }
19448 {
19449 /* Remember this wasn't a constant-expression. */
19452 }
19453 }
19454 else
19456 /* Look for the closing `]'. */
19458 {
19461 }
19466 }
19468 {
19469 {
19470 tree qualifying_scope;
19471 tree unqualified_name;
19472 tree attrs;
19473 special_function_kind sfk;
19478 /* Parse a declarator-id */
19481 {
19484 /* If we see an ellipsis, we should be looking at a
19485 parameter pack. */
19487 {
19488 /* Consume the `...' */
19492 }
19493 }
19496 unqualified_name
19500 {
19504 {
19505 /* Check whether an error occurred. */
19508 /* We already consumed the ellipsis to mark a
19509 parameter pack, but we have no way to report it,
19510 so abort the tentative parse. We will be exiting
19511 immediately anyway. */
19513 }
19514 else
19520 && (qualifying_scope
19522 {
19525 }
19526 }
19531 {
19536 }
19542 {
19543 /* In the declaration of a member of a template class
19544 outside of the class itself, the SCOPE will sometimes
19545 be a TYPENAME_TYPE. For example, given:
19547 template <typename T>
19548 int S<T>::R::i = 3;
19550 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19551 this context, we must resolve S<T>::R to an ordinary
19552 type, rather than a typename type.
19554 The reason we normally avoid resolving TYPENAME_TYPEs
19555 is that a specialization of `S' might render
19556 `S<T>::R' not a type. However, if `S' is
19557 specialized, then this `i' will not be used, so there
19558 is no harm in resolving the types here. */
19559 tree type;
19561 /* Resolve the TYPENAME_TYPE. */
19564 /* If that failed, the declarator is invalid. */
19566 {
19569 "cannot define member of dependent typedef "
19571 else
19576 }
19578 }
19583 {
19584 tree class_type;
19589 else
19593 {
19596 {
19599 {
19603 "use %<%T::%D%> instead of %<%T::%D%> to "
19605 class_type,
19610 }
19611 else
19613 }
19614 else
19615 {
19616 /* We do not attempt to print the declarator
19617 here because we do not have enough
19618 information about its original syntactic
19619 form. */
19623 }
19624 }
19627 {
19633 for an unnamed type, even if the type
19634 got a name for linkage purposes. */
19636 /* Handle correctly (c++/19200):
19638 struct S {
19639 struct T{};
19640 friend void S(T);
19641 };
19643 and also:
19645 namespace N {
19646 void S();
19647 }
19649 struct S {
19650 friend void N::S();
19651 }; */
19652 && !(friend_p
19655 class_type))
19656 {
19659 }
19667 }
19668 }
19670 unqualified_name,
19671 sfk);
19678 }
19680 handle_declarator:;
19683 {
19684 /* Any names that appear after the declarator-id for a
19685 member are looked up in the containing scope. */
19687 {
19688 /* But declarations with qualified-ids can't appear in a
19689 function. */
19693 }
19695 }
19699 /* Default args are only allowed on function
19700 declarations. */
19702 else
19706 }
19707 /* We're done. */
19708 else
19710 }
19712 /* For an abstract declarator, we might wind up with nothing at this
19713 point. That's an error; the declarator is not optional. */
19717 /* If we entered a scope, we must exit it now. */
19725 }
19727 /* Parse a ptr-operator.
19729 ptr-operator:
19730 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19731 * cv-qualifier-seq [opt]
19732 &
19733 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
19734 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19736 GNU Extension:
19738 ptr-operator:
19739 & cv-qualifier-seq [opt]
19741 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
19742 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
19743 an rvalue reference. In the case of a pointer-to-member, *TYPE is
19744 filled in with the TYPE containing the member. *CV_QUALS is
19745 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
19746 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
19747 Note that the tree codes returned by this function have nothing
19748 to do with the types of trees that will be eventually be created
19749 to represent the pointer or reference type being parsed. They are
19750 just constants with suggestive names. */
19751 static enum tree_code
19756 {
19761 /* Assume that it's not a pointer-to-member. */
19763 /* And that there are no cv-qualifiers. */
19766 /* Peek at the next token. */
19769 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
19779 {
19780 /* Consume the `*', `&' or `&&'. */
19783 /* A `*' can be followed by a cv-qualifier-seq, and so can a
19784 `&', if we are allowing GNU extensions. (The only qualifier
19785 that can legally appear after `&' is `restrict', but that is
19786 enforced during semantic analysis. */
19794 }
19795 else
19796 {
19797 /* Try the pointer-to-member case. */
19799 /* Look for the optional `::' operator. */
19802 /* Look for the nested-name specifier. */
19809 /* If we found it, and the next token is a `*', then we are
19810 indeed looking at a pointer-to-member operator. */
19813 {
19814 /* Indicate that the `*' operator was used. */
19822 else
19823 {
19824 /* The type of which the member is a member is given by the
19825 current SCOPE. */
19827 /* The next name will not be qualified. */
19831 /* Look for optional c++11 attributes. */
19835 /* Look for the optional cv-qualifier-seq. */
19837 }
19838 }
19839 /* If that didn't work we don't have a ptr-operator. */
19842 }
19845 }
19847 /* Parse an (optional) cv-qualifier-seq.
19849 cv-qualifier-seq:
19850 cv-qualifier cv-qualifier-seq [opt]
19852 cv-qualifier:
19853 const
19854 volatile
19856 GNU Extension:
19858 cv-qualifier:
19859 __restrict__
19861 Returns a bitmask representing the cv-qualifiers. */
19863 static cp_cv_quals
19865 {
19869 {
19871 cp_cv_quals cv_qualifier;
19873 /* Peek at the next token. */
19875 /* See if it's a cv-qualifier. */
19877 {
19893 }
19899 {
19902 }
19903 else
19904 {
19907 }
19908 }
19911 }
19913 /* Parse an (optional) ref-qualifier
19915 ref-qualifier:
19916 &
19917 &&
19919 Returns cp_ref_qualifier representing ref-qualifier. */
19921 static cp_ref_qualifier
19923 {
19926 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
19931 {
19936 {
19948 }
19953 {
19956 }
19957 else
19958 {
19961 }
19962 }
19965 }
19967 /* Parse an optional tx-qualifier.
19969 tx-qualifier:
19970 transaction_safe
19971 transaction_safe_dynamic */
19973 static tree
19975 {
19978 {
19983 {
19987 {
19990 {
19993 }
19994 else
19996 }
19997 }
19998 }
20000 }
20002 /* Parse an (optional) virt-specifier-seq.
20004 virt-specifier-seq:
20005 virt-specifier virt-specifier-seq [opt]
20007 virt-specifier:
20008 override
20009 final
20011 Returns a bitmask representing the virt-specifiers. */
20013 static cp_virt_specifiers
20015 {
20019 {
20021 cp_virt_specifiers virt_specifier;
20023 /* Peek at the next token. */
20025 /* See if it's a virt-specifier-qualifier. */
20029 {
20032 }
20034 {
20037 }
20039 {
20041 }
20042 else
20046 {
20049 }
20050 else
20051 {
20054 }
20055 }
20057 }
20059 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20060 is in scope even though it isn't real. */
20062 void
20064 {
20065 tree this_parm;
20068 {
20069 /* We don't clear this between NSDMIs. Is it already what we want? */
20074 }
20077 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20079 current_class_ref
20082 }
20084 /* Return true iff our current scope is a non-static data member
20085 initializer. */
20087 bool
20089 {
20090 /* We recognize NSDMI context by the context-less 'this' pointer set up
20091 by the function above. */
20097 }
20099 /* Parse a late-specified return type, if any. This is not a separate
20100 non-terminal, but part of a function declarator, which looks like
20102 -> trailing-type-specifier-seq abstract-declarator(opt)
20104 Returns the type indicated by the type-id.
20106 In addition to this, parse any queued up #pragma omp declare simd
20107 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20108 #pragma acc routine clauses.
20110 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20111 function. */
20113 static tree
20116 {
20120 && declarator
20127 && declarator
20130 /* Peek at the next token. */
20132 /* A late-specified return type is indicated by an initial '->'. */
20143 {
20144 /* DR 1207: 'this' is in scope in the trailing return type. */
20146 }
20149 {
20150 /* Consume the ->. */
20154 }
20156 /* Function declarations may be followed by a trailing
20157 requires-clause. */
20161 declarator->attributes
20165 declarator->attributes
20169 declarator->attributes
20174 {
20177 }
20180 }
20182 /* Parse a declarator-id.
20184 declarator-id:
20185 id-expression
20186 :: [opt] nested-name-specifier [opt] type-name
20188 In the `id-expression' case, the value returned is as for
20189 cp_parser_id_expression if the id-expression was an unqualified-id.
20190 If the id-expression was a qualified-id, then a SCOPE_REF is
20191 returned. The first operand is the scope (either a NAMESPACE_DECL
20192 or TREE_TYPE), but the second is still just a representation of an
20193 unqualified-id. */
20195 static tree
20197 {
20198 tree id;
20199 /* The expression must be an id-expression. Assume that qualified
20200 names are the names of types so that:
20202 template <class T>
20203 int S<T>::R::i = 3;
20205 will work; we must treat `S<T>::R' as the name of a type.
20206 Similarly, assume that qualified names are templates, where
20207 required, so that:
20209 template <class T>
20210 int S<T>::R<T>::i = 3;
20212 will work, too. */
20218 optional_p);
20222 }
20224 /* Parse a type-id.
20226 type-id:
20227 type-specifier-seq abstract-declarator [opt]
20229 Returns the TYPE specified. */
20231 static tree
20234 {
20235 cp_decl_specifier_seq type_specifier_seq;
20238 /* Parse the type-specifier-seq. */
20240 is_trailing_return,
20245 /* A bare template name as a template argument is a template template
20246 argument, not a placeholder, so fail parsing it as a type argument. */
20247 {
20251 }
20255 /* There might or might not be an abstract declarator. */
20257 /* Look for the declarator. */
20258 abstract_declarator
20263 /* Check to see if there really was a declarator. */
20268 /* The concepts TS allows 'auto' as a type-id. */
20270 /* None of the valid uses of 'auto' in C++14 involve the type-id
20271 nonterminal, but it is valid in a trailing-return-type. */
20274 {
20275 /* A type-id with type 'auto' is only ok if the abstract declarator
20276 is a function declarator with a late-specified return type.
20278 A type-id with 'auto' is also valid in a trailing-return-type
20279 in a compound-requirement. */
20286 else
20287 {
20290 }
20291 }
20294 is_template_arg);
20295 }
20297 static tree
20299 {
20301 }
20303 static tree
20305 {
20306 tree r;
20308 parser->type_definition_forbidden_message
20313 {
20316 }
20318 }
20320 static tree
20322 {
20324 }
20326 /* Parse a type-specifier-seq.
20328 type-specifier-seq:
20329 type-specifier type-specifier-seq [opt]
20331 GNU extension:
20333 type-specifier-seq:
20334 attributes type-specifier-seq [opt]
20336 If IS_DECLARATION is true, we are at the start of a "condition" or
20337 exception-declaration, so we might be followed by a declarator-id.
20339 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20340 i.e. we've just seen "->".
20342 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20344 static void
20349 {
20354 /* Clear the TYPE_SPECIFIER_SEQ. */
20357 /* In the context of a trailing return type, enum E { } is an
20358 elaborated-type-specifier followed by a function-body, not an
20359 enum-specifier. */
20363 /* Parse the type-specifiers and attributes. */
20365 {
20366 tree type_specifier;
20369 /* Check for attributes first. */
20371 {
20376 }
20378 /* record the token of the beginning of the type specifier seq,
20379 for error reporting purposes*/
20383 /* Look for the type-specifier. */
20385 flags,
20386 type_specifier_seq,
20388 NULL,
20391 {
20392 /* If the first type-specifier could not be found, this is not a
20393 type-specifier-seq at all. */
20395 {
20396 /* Set in_declarator_p to avoid skipping to the semicolon. */
20408 }
20409 /* If subsequent type-specifiers could not be found, the
20410 type-specifier-seq is complete. */
20412 }
20415 /* The standard says that a condition can be:
20417 type-specifier-seq declarator = assignment-expression
20419 However, given:
20421 struct S {};
20422 if (int S = ...)
20424 we should treat the "S" as a declarator, not as a
20425 type-specifier. The standard doesn't say that explicitly for
20426 type-specifier-seq, but it does say that for
20427 decl-specifier-seq in an ordinary declaration. Perhaps it
20428 would be clearer just to allow a decl-specifier-seq here, and
20429 then add a semantic restriction that if any decl-specifiers
20430 that are not type-specifiers appear, the program is invalid. */
20433 }
20434 }
20436 /* Return whether the function currently being declared has an associated
20437 template parameter list. */
20439 static bool
20441 {
20454 }
20456 /* Parse a parameter-declaration-clause.
20458 parameter-declaration-clause:
20459 parameter-declaration-list [opt] ... [opt]
20460 parameter-declaration-list , ...
20462 Returns a representation for the parameter declarations. A return
20463 value of NULL indicates a parameter-declaration-clause consisting
20464 only of an ellipsis. */
20466 static tree
20468 {
20469 tree parameters;
20478 parser->auto_is_implicit_function_template_parm_p
20480 }
20486 && !processing_template_parmlist
20492 /* Peek at the next token. */
20494 /* Check for trivial parameter-declaration-clauses. */
20496 {
20497 /* Consume the `...' token. */
20500 }
20502 /* There are no parameters. */
20503 {
20504 #ifndef NO_IMPLICIT_EXTERN_C
20509 else
20510 #endif
20512 }
20513 /* Check for `(void)', too, which is a special case. */
20517 {
20518 /* Consume the `void' token. */
20520 /* There are no parameters. */
20522 }
20524 /* Parse the parameter-declaration-list. */
20526 /* If a parse error occurred while parsing the
20527 parameter-declaration-list, then the entire
20528 parameter-declaration-clause is erroneous. */
20532 /* Peek at the next token. */
20534 /* If it's a `,', the clause should terminate with an ellipsis. */
20536 {
20537 /* Consume the `,'. */
20539 /* Expect an ellipsis. */
20540 ellipsis_p
20542 }
20543 /* It might also be `...' if the optional trailing `,' was
20544 omitted. */
20546 {
20547 /* Consume the `...' token. */
20549 /* And remember that we saw it. */
20551 }
20552 else
20555 /* Finish the parameter list. */
20560 }
20562 /* Parse a parameter-declaration-list.
20564 parameter-declaration-list:
20565 parameter-declaration
20566 parameter-declaration-list , parameter-declaration
20568 Returns a representation of the parameter-declaration-list, as for
20569 cp_parser_parameter_declaration_clause. However, the
20570 `void_list_node' is never appended to the list. Upon return,
20571 *IS_ERROR will be true iff an error occurred. */
20573 static tree
20575 {
20581 /* Assume all will go well. */
20583 /* The special considerations that apply to a function within an
20584 unbraced linkage specifications do not apply to the parameters
20585 to the function. */
20586 saved_in_unbraced_linkage_specification_p
20590 /* Look for more parameters. */
20592 {
20600 /* Parse the parameter. */
20601 parameter
20606 /* We don't know yet if the enclosing context is deprecated, so wait
20607 and warn in grokparms if appropriate. */
20611 {
20612 /* If a function parameter pack was specified and an implicit template
20613 parameter was introduced during cp_parser_parameter_declaration,
20614 change any implicit parameters introduced into packs. */
20618 {
20626 }
20630 PARM,
20633 }
20637 /* If a parse error occurred parsing the parameter declaration,
20638 then the entire parameter-declaration-list is erroneous. */
20640 {
20644 }
20654 {
20658 }
20660 /* Add the new parameter to the list. */
20664 /* Peek at the next token. */
20667 /* These are for Objective-C++ */
20670 /* The parameter-declaration-list is complete. */
20673 {
20676 /* Peek at the next token. */
20678 /* If it's an ellipsis, then the list is complete. */
20681 /* Otherwise, there must be more parameters. Consume the
20682 `,'. */
20684 /* When parsing something like:
20686 int i(float f, double d)
20688 we can tell after seeing the declaration for "f" that we
20689 are not looking at an initialization of a variable "i",
20690 but rather at the declaration of a function "i".
20692 Due to the fact that the parsing of template arguments
20693 (as specified to a template-id) requires backtracking we
20694 cannot use this technique when inside a template argument
20695 list. */
20699 /* However, a parameter-declaration of the form
20700 "float(f)" (which is a valid declaration of a
20701 parameter "f") can also be interpreted as an
20702 expression (the conversion of "f" to "float"). */
20705 }
20706 else
20707 {
20715 }
20716 }
20718 parser->in_unbraced_linkage_specification_p
20721 /* Reset implicit_template_scope if we are about to leave the function
20722 parameter list that introduced it. Note that for out-of-line member
20723 definitions, there will be one or more class scopes before we get to
20724 the template parameter scope. */
20728 {
20732 {
20735 }
20736 }
20739 }
20741 /* Parse a parameter declaration.
20743 parameter-declaration:
20744 decl-specifier-seq ... [opt] declarator
20745 decl-specifier-seq declarator = assignment-expression
20746 decl-specifier-seq ... [opt] abstract-declarator [opt]
20747 decl-specifier-seq abstract-declarator [opt] = assignment-expression
20749 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
20750 declares a template parameter. (In that case, a non-nested `>'
20751 token encountered during the parsing of the assignment-expression
20752 is not interpreted as a greater-than operator.)
20754 Returns a representation of the parameter, or NULL if an error
20755 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
20756 true iff the declarator is of the form "(p)". */
20762 {
20764 cp_decl_specifier_seq decl_specifiers;
20766 tree default_argument;
20771 /* In a template parameter, `>' is not an operator.
20773 [temp.param]
20775 When parsing a default template-argument for a non-type
20776 template-parameter, the first non-nested `>' is taken as the end
20777 of the template parameter-list rather than a greater-than
20778 operator. */
20780 /* Type definitions may not appear in parameter types. */
20782 parser->type_definition_forbidden_message
20785 /* Parse the declaration-specifiers. */
20787 CP_PARSER_FLAGS_NONE,
20791 /* Complain about missing 'typename' or other invalid type names. */
20796 /* If an error occurred, there's no reason to attempt to parse the
20797 rest of the declaration. */
20799 {
20802 }
20804 /* Peek at the next token. */
20807 /* If the next token is a `)', `,', `=', `>', or `...', then there
20808 is no declarator. However, when variadic templates are enabled,
20809 there may be a declarator following `...'. */
20814 {
20818 }
20819 /* Otherwise, there should be a declarator. */
20820 else
20821 {
20825 /* After seeing a decl-specifier-seq, if the next token is not a
20826 "(", there is no possibility that the code is a valid
20827 expression. Therefore, if parsing tentatively, we commit at
20828 this point. */
20830 /* In an expression context, having seen:
20832 (int((char ...
20834 we cannot be sure whether we are looking at a
20835 function-type (taking a "char" as a parameter) or a cast
20836 of some object of type "char" to "int". */
20842 /* Parse the declarator. */
20845 CP_PARSER_DECLARATOR_EITHER,
20847 parenthesized_p,
20851 /* After the declarator, allow more attributes. */
20852 decl_specifiers.attributes
20856 /* If the declarator is a template parameter pack, remember that and
20857 clear the flag in the declarator itself so we don't get errors
20858 from grokdeclarator. */
20860 {
20863 }
20864 }
20866 /* If the next token is an ellipsis, and we have not seen a declarator
20867 name, and if either the type of the declarator contains parameter
20868 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
20869 for, eg, abbreviated integral type names), then we actually have a
20870 parameter pack expansion expression. Otherwise, leave the ellipsis
20871 for a C-style variadic function. */
20874 {
20885 {
20886 /* Consume the `...'. */
20890 /* Build a pack expansion type */
20895 else
20897 }
20898 }
20900 /* The restriction on defining new types applies only to the type
20901 of the parameter, not to the default argument. */
20904 /* If the next token is `=', then process a default argument. */
20906 {
20909 /* If we are defining a class, then the tokens that make up the
20910 default argument must be saved and processed later. */
20916 // A constrained-type-specifier may declare a type template-parameter.
20918 default_argument
20921 // A constrained-type-specifier may declare a template-template-parameter.
20923 default_argument
20926 /* Outside of a class definition, we can just parse the
20927 assignment-expression. */
20928 else
20929 default_argument
20933 {
20935 "default arguments are only "
20937 }
20939 || template_parameter_pack_p
20942 {
20943 /* Find the name of the parameter pack. */
20950 template_parm_p
20956 else
20958 template_parm_p
20965 }
20966 }
20967 else
20971 declarator,
20972 default_argument,
20973 template_parameter_pack_p);
20974 }
20976 /* Parse a default argument and return it.
20978 TEMPLATE_PARM_P is true if this is a default argument for a
20979 non-type template parameter. */
20980 static tree
20982 {
20988 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
20989 set correctly. */
20992 /* Local variable names (and the `this' keyword) may not
20993 appear in a default argument. */
20996 /* Parse the assignment-expression. */
21001 /* The "this" pointer is not valid in a default argument. */
21003 {
21008 }
21009 default_argument
21011 /* Restore the "this" pointer. */
21013 {
21016 }
21025 }
21027 /* Parse a function-body.
21029 function-body:
21030 compound_statement */
21032 static void
21034 {
21038 }
21040 /* Parse a ctor-initializer-opt followed by a function-body. Return
21041 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21042 is true we are parsing a function-try-block. */
21044 static bool
21047 {
21055 /* Begin the function body. */
21057 /* Parse the optional ctor-initializer. */
21060 /* If we're parsing a constexpr constructor definition, we need
21061 to check that the constructor body is indeed empty. However,
21062 before we get to cp_parser_function_body lot of junk has been
21063 generated, so we can't just check that we have an empty block.
21064 Rather we take a snapshot of the outermost block, and check whether
21065 cp_parser_function_body changed its state. */
21067 {
21071 }
21072 /* Parse the function-body. */
21076 /* Finish the function body. */
21080 }
21082 /* Parse an initializer.
21084 initializer:
21085 = initializer-clause
21086 ( expression-list )
21088 Returns an expression representing the initializer. If no
21089 initializer is present, NULL_TREE is returned.
21091 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21092 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21093 set to TRUE if there is no initializer present. If there is an
21094 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21095 is set to true; otherwise it is set to false. */
21097 static tree
21100 {
21102 tree init;
21104 /* Peek at the next token. */
21107 /* Let our caller know whether or not this initializer was
21108 parenthesized. */
21110 /* Assume that the initializer is constant. */
21114 {
21115 /* Consume the `='. */
21117 /* Parse the initializer-clause. */
21119 }
21121 {
21126 non_constant_p);
21131 }
21133 {
21138 }
21139 else
21140 {
21141 /* Anything else is an error. */
21144 }
21150 }
21152 /* Parse an initializer-clause.
21154 initializer-clause:
21155 assignment-expression
21156 braced-init-list
21158 Returns an expression representing the initializer.
21160 If the `assignment-expression' production is used the value
21161 returned is simply a representation for the expression.
21163 Otherwise, calls cp_parser_braced_list. */
21165 static cp_expr
21167 {
21168 cp_expr initializer;
21170 /* Assume the expression is constant. */
21173 /* If it is not a `{', then we are looking at an
21174 assignment-expression. */
21176 {
21177 initializer
21180 non_constant_p);
21181 }
21182 else
21186 }
21188 /* Parse a brace-enclosed initializer list.
21190 braced-init-list:
21191 { initializer-list , [opt] }
21192 { }
21194 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21195 the elements of the initializer-list (or NULL, if the last
21196 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21197 NULL_TREE. There is no way to detect whether or not the optional
21198 trailing `,' was provided. NON_CONSTANT_P is as for
21199 cp_parser_initializer. */
21201 static cp_expr
21203 {
21204 tree initializer;
21207 /* Consume the `{' token. */
21209 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21211 /* If it's not a `}', then there is a non-trivial initializer. */
21213 {
21214 /* Parse the initializer list. */
21217 /* A trailing `,' token is allowed. */
21220 }
21221 else
21223 /* Now, there should be a trailing `}'. */
21229 /* Build a location of the form:
21230 { ... }
21231 ^~~~~~~
21232 with caret==start at the open brace, finish at the close brace. */
21236 }
21238 /* Consume tokens up to, and including, the next non-nested closing `]'.
21239 Returns true iff we found a closing `]'. */
21241 static bool
21243 {
21247 {
21251 {
21254 /* If we've run out of tokens, then there is no closing `]'. */
21263 {
21266 }
21271 }
21273 /* Consume the token. */
21275 }
21276 }
21278 /* Return true if we are looking at an array-designator, false otherwise. */
21280 static bool
21282 {
21283 /* Consume the `['. */
21288 /* Skip tokens until the next token is a closing square bracket.
21289 If we find the closing `]', and the next token is a `=', then
21290 we are looking at an array designator. */
21291 bool array_designator_p
21295 /* Roll back the tokens we skipped. */
21299 }
21301 /* Parse an initializer-list.
21303 initializer-list:
21304 initializer-clause ... [opt]
21305 initializer-list , initializer-clause ... [opt]
21307 GNU Extension:
21309 initializer-list:
21310 designation initializer-clause ...[opt]
21311 initializer-list , designation initializer-clause ...[opt]
21313 designation:
21314 . identifier =
21315 identifier :
21316 [ constant-expression ] =
21318 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21319 for the initializer. If the INDEX of the elt is non-NULL, it is the
21320 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21321 as for cp_parser_initializer. */
21325 {
21328 /* Assume all of the expressions are constant. */
21331 /* Parse the rest of the list. */
21333 {
21335 tree designator;
21336 tree initializer;
21339 /* If the next token is an identifier and the following one is a
21340 colon, we are looking at the GNU designated-initializer
21341 syntax. */
21345 {
21346 /* Warn the user that they are using an extension. */
21349 /* Consume the identifier. */
21351 /* Consume the `:'. */
21353 }
21354 /* Also handle the C99 syntax, '. id ='. */
21359 {
21360 /* Warn the user that they are using an extension. */
21363 /* Consume the `.'. */
21365 /* Consume the identifier. */
21367 /* Consume the `='. */
21369 }
21370 /* Also handle C99 array designators, '[ const ] ='. */
21374 {
21375 /* In C++11, [ could start a lambda-introducer. */
21381 {
21384 }
21385 else
21386 {
21391 }
21397 }
21398 else
21401 /* Parse the initializer. */
21404 /* If any clause is non-constant, so is the entire initializer. */
21408 /* If we have an ellipsis, this is an initializer pack
21409 expansion. */
21411 {
21412 /* Consume the `...'. */
21415 /* Turn the initializer into an initializer expansion. */
21417 }
21419 /* Add it to the vector. */
21422 /* If the next token is not a comma, we have reached the end of
21423 the list. */
21427 /* Peek at the next token. */
21429 /* If the next token is a `}', then we're still done. An
21430 initializer-clause can have a trailing `,' after the
21431 initializer-list and before the closing `}'. */
21435 /* Consume the `,' token. */
21437 }
21440 }
21442 /* Classes [gram.class] */
21444 /* Parse a class-name.
21446 class-name:
21447 identifier
21448 template-id
21450 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21451 to indicate that names looked up in dependent types should be
21452 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21453 keyword has been used to indicate that the name that appears next
21454 is a template. TAG_TYPE indicates the explicit tag given before
21455 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21456 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21457 is the class being defined in a class-head. If ENUM_OK is TRUE,
21458 enum-names are also accepted.
21460 Returns the TYPE_DECL representing the class. */
21462 static tree
21471 {
21472 tree decl;
21473 tree scope;
21478 /* All class-names start with an identifier. */
21481 {
21484 }
21486 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21487 to a template-id, so we save it here. */
21492 /* Any name names a type if we're following the `typename' keyword
21493 in a qualified name where the enclosing scope is type-dependent. */
21496 /* Handle the common case (an identifier, but not a template-id)
21497 efficiently. */
21500 {
21504 /* Look for the identifier. */
21508 /* If the next token isn't an identifier, we are certainly not
21509 looking at a class-name. */
21512 /* If we know this is a type-name, there's no need to look it
21513 up. */
21516 else
21517 {
21518 tree ambiguous_decls;
21519 /* If we already know that this lookup is ambiguous, then
21520 we've already issued an error message; there's no reason
21521 to check again. */
21523 {
21526 }
21527 /* If the next token is a `::', then the name must be a type
21528 name.
21530 [basic.lookup.qual]
21532 During the lookup for a name preceding the :: scope
21533 resolution operator, object, function, and enumerator
21534 names are ignored. */
21537 /* Look up the name. */
21539 tag_type,
21542 check_dependency_p,
21546 {
21550 }
21551 }
21552 }
21553 else
21554 {
21555 /* Try a template-id. */
21557 check_dependency_p,
21558 tag_type,
21559 is_declaration);
21562 }
21566 /* If this is a typename, create a TYPENAME_TYPE. */
21568 {
21573 }
21577 /* Check to see that it is really the name of a class. */
21581 /* Situations like this:
21583 template <typename T> struct A {
21584 typename T::template X<int>::I i;
21585 };
21587 are problematic. Is `T::template X<int>' a class-name? The
21588 standard does not seem to be definitive, but there is no other
21589 valid interpretation of the following `::'. Therefore, those
21590 names are considered class-names. */
21591 {
21595 }
21600 /* In Objective-C 2.0, a classname followed by '.' starts a
21601 dot-syntax expression, and it's not a type-name. */
21613 }
21615 /* Parse a class-specifier.
21617 class-specifier:
21618 class-head { member-specification [opt] }
21620 Returns the TREE_TYPE representing the class. */
21622 static tree
21624 {
21625 tree type;
21639 /* Parse the class-head. */
21642 /* If the class-head was a semantic disaster, skip the entire body
21643 of the class. */
21645 {
21649 }
21651 /* Look for the `{'. */
21653 {
21656 }
21661 /* Issue an error message if type-definitions are forbidden here. */
21663 /* Remember that we are defining one more class. */
21665 /* Inside the class, surrounding template-parameter-lists do not
21666 apply. */
21667 saved_num_template_parameter_lists
21670 /* We are not in a function body. */
21673 /* Or in a loop. */
21676 /* Or in a switch. */
21679 /* We are not immediately inside an extern "lang" block. */
21680 saved_in_unbraced_linkage_specification_p
21684 // Associate constraints with the type.
21688 /* Start the class. */
21690 {
21693 }
21697 /* If the type is erroneous, skip the entire body of the class. */
21699 else
21700 /* Parse the member-specification. */
21703 /* Look for the trailing `}'. */
21705 /* Look for trailing attributes to apply to this class. */
21713 /* We've finished a type definition. Check for the common syntax
21714 error of forgetting a semicolon after the definition. We need to
21715 be careful, as we can't just check for not-a-semicolon and be done
21716 with it; the user might have typed:
21718 class X { } c = ...;
21719 class X { } *p = ...;
21721 and so forth. Instead, enumerate all the possible tokens that
21722 might follow this production; if we don't see one of them, then
21723 complain and silently insert the semicolon. */
21724 {
21729 /* Don't try to parse c++11 attributes here. As per the
21730 grammar, that should be a task for
21731 cp_parser_decl_specifier_seq. */
21735 {
21746 /* While it's legal for type qualifiers and storage class
21747 specifiers to follow type definitions in the grammar, only
21748 compiler testsuites contain code like that. Assume that if
21749 we see such code, then what we're really seeing is a case
21750 like:
21752 class X { }
21753 const <type> var = ...;
21755 or
21757 class Y { }
21758 static <type> func (...) ...
21760 i.e. the qualifier or specifier applies to the next
21761 declaration. To do so, however, we need to look ahead one
21762 more token to see if *that* token is a type specifier.
21764 This code could be improved to handle:
21766 class Z { }
21767 static const <type> var = ...; */
21770 {
21773 /* Handling user-defined types here would be nice, but very
21774 tricky. */
21775 want_semicolon
21778 }
21782 }
21784 /* If we don't have a type, then something is very wrong and we
21785 shouldn't try to do anything clever. Likewise for not seeing the
21786 closing brace. */
21788 {
21789 /* Locate the closing brace. */
21790 cp_token_position prev
21795 /* We want to suggest insertion of a ';' immediately *after* the
21796 closing brace, so, if we can, offset the location by 1 column. */
21813 else
21816 /* Unget one token and smash it to look as though we encountered
21817 a semicolon in the input stream. */
21822 }
21823 }
21825 /* If this class is not itself within the scope of another class,
21826 then we need to parse the bodies of all of the queued function
21827 definitions. Note that the queued functions defined in a class
21828 are not always processed immediately following the
21829 class-specifier for that class. Consider:
21831 struct A {
21832 struct B { void f() { sizeof (A); } };
21833 };
21835 If `f' were processed before the processing of `A' were
21836 completed, there would be no way to compute the size of `A'.
21837 Note that the nesting we are interested in here is lexical --
21838 not the semantic nesting given by TYPE_CONTEXT. In particular,
21839 for:
21841 struct A { struct B; };
21842 struct A::B { void f() { } };
21844 there is no need to delay the parsing of `A::B::f'. */
21846 {
21847 tree decl;
21854 /* In a first pass, parse default arguments to the functions.
21855 Then, in a second pass, parse the bodies of the functions.
21856 This two-phased approach handles cases like:
21858 struct S {
21859 void f() { g(); }
21860 void g(int i = 3);
21861 };
21863 */
21865 {
21867 /* If there are default arguments that have not yet been processed,
21868 take care of them now. */
21870 {
21875 }
21876 /* Make sure that any template parameters are in scope. */
21878 /* Parse the default argument expressions. */
21880 /* Remove any template parameters from the symbol table. */
21882 }
21884 /* Now parse any NSDMIs. */
21888 {
21890 {
21895 }
21898 }
21905 /* Now do some post-NSDMI bookkeeping. */
21911 /* Now parse the body of the functions. */
21913 {
21914 /* OpenMP UDRs need to be parsed before all other functions. */
21921 }
21922 else
21926 }
21927 else
21930 /* Put back any saved access checks. */
21933 /* Restore saved state. */
21937 parser->num_template_parameter_lists
21939 parser->in_unbraced_linkage_specification_p
21943 }
21945 static tree
21947 {
21948 tree ret;
21953 }
21955 /* Parse a class-head.
21957 class-head:
21958 class-key identifier [opt] base-clause [opt]
21959 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
21960 class-key nested-name-specifier [opt] template-id
21961 base-clause [opt]
21963 class-virt-specifier:
21964 final
21966 GNU Extensions:
21967 class-key attributes identifier [opt] base-clause [opt]
21968 class-key attributes nested-name-specifier identifier base-clause [opt]
21969 class-key attributes nested-name-specifier [opt] template-id
21970 base-clause [opt]
21972 Upon return BASES is initialized to the list of base classes (or
21973 NULL, if there are none) in the same form returned by
21974 cp_parser_base_clause.
21976 Returns the TYPE of the indicated class. Sets
21977 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
21978 involving a nested-name-specifier was used, and FALSE otherwise.
21980 Returns error_mark_node if this is not a class-head.
21982 Returns NULL_TREE if the class-head is syntactically valid, but
21983 semantically invalid in a way that means we should skip the entire
21984 body of the class. */
21986 static tree
21989 {
21990 tree nested_name_specifier;
21994 tree attributes;
21995 tree bases;
22005 /* Assume no nested-name-specifier will be present. */
22007 /* Assume no template parameter lists will be used in defining the
22008 type. */
22012 /* Look for the class-key. */
22019 /* Parse the attributes. */
22022 /* If the next token is `::', that is invalid -- but sometimes
22023 people do try to write:
22025 struct ::S {};
22027 Handle this gracefully by accepting the extra qualifier, and then
22028 issuing an error about it later if this really is a
22029 class-head. If it turns out just to be an elaborated type
22030 specifier, remain silent. */
22036 /* Determine the name of the class. Begin by looking for an
22037 optional nested-name-specifier. */
22039 nested_name_specifier
22045 /* If there was a nested-name-specifier, then there *must* be an
22046 identifier. */
22048 {
22050 /* Although the grammar says `identifier', it really means
22051 `class-name' or `template-name'. You are only allowed to
22052 define a class that has already been declared with this
22053 syntax.
22055 The proposed resolution for Core Issue 180 says that wherever
22056 you see `class T::X' you should treat `X' as a type-name.
22058 It is OK to define an inaccessible class; for example:
22060 class A { class B; };
22061 class A::B {};
22063 We do not know if we will see a class-name, or a
22064 template-name. We look for a class-name first, in case the
22065 class-name is a template-id; if we looked for the
22066 template-name first we would stop after the template-name. */
22071 class_type,
22075 /* If that didn't work, ignore the nested-name-specifier. */
22077 {
22083 }
22084 /* If we could not find a corresponding TYPE, treat this
22085 declaration like an unqualified declaration. */
22088 /* Otherwise, count the number of templates used in TYPE and its
22089 containing scopes. */
22090 else
22091 {
22092 tree scope;
22104 }
22105 }
22106 /* Otherwise, the identifier is optional. */
22107 else
22108 {
22109 /* We don't know whether what comes next is a template-id,
22110 an identifier, or nothing at all. */
22112 /* Check for a template-id. */
22117 class_key,
22119 /* If that didn't work, it could still be an identifier. */
22121 {
22123 {
22126 }
22127 else
22129 }
22130 else
22131 {
22134 }
22135 }
22140 {
22142 class_key,
22144 }
22147 /* If it's not a `:' or a `{' then we can't really be looking at a
22148 class-head, since a class-head only appears as part of a
22149 class-specifier. We have to detect this situation before calling
22150 xref_tag, since that has irreversible side-effects. */
22152 {
22156 }
22158 /* At this point, we're going ahead with the class-specifier, even
22159 if some other problem occurs. */
22162 {
22167 }
22168 /* Issue the error about the overly-qualified name now. */
22170 {
22175 }
22177 {
22182 }
22184 {
22185 tree scope;
22187 /* Reject typedef-names in class heads. */
22189 {
22192 type);
22195 }
22197 /* Figure out in what scope the declaration is being placed. */
22199 /* If that scope does not contain the scope in which the
22200 class was originally declared, the program is invalid. */
22202 {
22205 "declaration of %qD in namespace %qD which does not "
22208 else
22214 }
22215 /* [dcl.meaning]
22217 A declarator-id shall not be qualified except for the
22218 definition of a ... nested class outside of its class
22219 ... [or] the definition or explicit instantiation of a
22220 class member of a namespace outside of its namespace. */
22222 {
22227 }
22228 }
22229 /* An explicit-specialization must be preceded by "template <>". If
22230 it is not, try to recover gracefully. */
22233 && !processing_template_parmlist
22235 {
22236 /* Build a location of this form:
22237 struct typename <ARGS>
22238 ^~~~~~~~~~~~~~~~~~~~~~
22239 with caret==start at the start token, and
22240 finishing at the end of the type. */
22241 location_t reported_loc
22243 class_head_start_location,
22248 error_at_rich_loc
22252 /* Take the same action that would have been taken by
22253 cp_parser_explicit_specialization. */
22256 }
22257 /* There must be no "return" statements between this point and the
22258 end of this function; set "type "to the correct return value and
22259 use "goto done;" to return. */
22260 /* Make sure that the right number of template parameters were
22261 present. */
22265 {
22266 /* If something went wrong, there is no point in even trying to
22267 process the class-definition. */
22270 }
22272 /* Look up the type. */
22274 {
22278 {
22282 }
22283 else
22284 {
22287 }
22290 }
22292 {
22293 tree class_type;
22295 /* Given:
22297 template <typename T> struct S { struct T };
22298 template <typename T> struct S<T>::T { };
22300 we will get a TYPENAME_TYPE when processing the definition of
22301 `S::T'. We need to resolve it to the actual type before we
22302 try to define it. */
22304 {
22309 else
22310 {
22313 }
22314 }
22318 {
22321 }
22324 /* Enter the scope indicated by the nested-name-specifier. */
22326 /* Get the canonical version of this type. */
22328 /* Call push_template_decl if it seems like we should be defining a
22329 template either from the template headers or the type we're
22330 defining, so that we diagnose both extra and missing headers. */
22334 {
22337 {
22340 }
22341 }
22345 }
22347 {
22348 /* If the class was unnamed, create a dummy name. */
22353 }
22355 /* Indicate whether this class was declared as a `class' or as a
22356 `struct'. */
22361 /* If this type was already complete, and we see another definition,
22362 that's an error. */
22364 {
22366 type);
22368 type);
22371 }
22376 {
22377 /* Apply attributes now, before any use of the class as a template
22378 argument in its base list. */
22381 }
22383 /* We will have entered the scope containing the class; the names of
22384 base classes should be looked up in that context. For example:
22386 struct A { struct B {}; struct C; };
22387 struct A::C : B {};
22389 is valid. */
22391 /* Get the list of base-classes, if there is one. */
22393 {
22394 /* PR59482: enter the class scope so that base-specifiers are looked
22395 up correctly. */
22399 /* PR59482: get out of the previously pushed class scope so that the
22400 subsequent pops pop the right thing. */
22403 }
22404 else
22407 /* If we're really defining a class, process the base classes.
22408 If they're invalid, fail. */
22412 done:
22413 /* Leave the scope given by the nested-name-specifier. We will
22414 enter the class scope itself while processing the members. */
22419 {
22422 }
22428 out:
22431 }
22433 /* Parse a class-key.
22435 class-key:
22436 class
22437 struct
22438 union
22440 Returns the kind of class-key specified, or none_type to indicate
22441 error. */
22443 static enum tag_types
22445 {
22449 /* Look for the class-key. */
22454 /* Check to see if the TOKEN is a class-key. */
22459 }
22461 /* Parse a type-parameter-key.
22463 type-parameter-key:
22464 class
22465 typename
22466 */
22468 static void
22470 {
22471 /* Look for the type-parameter-key. */
22475 {
22478 /* typename is not allowed in a template template parameter
22479 by the standard until C++1Z. */
22481 "ISO C++ forbids typename key in template template parameter;"
22483 }
22484 else
22488 }
22490 /* Parse an (optional) member-specification.
22492 member-specification:
22493 member-declaration member-specification [opt]
22494 access-specifier : member-specification [opt] */
22496 static void
22498 {
22500 {
22504 /* Peek at the next token. */
22506 /* If it's a `}', or EOF then we've seen all the members. */
22512 /* See if this token is a keyword. */
22515 {
22519 /* Consume the access-specifier. */
22521 /* Remember which access-specifier is active. */
22523 /* Look for the `:'. */
22528 /* Accept #pragmas at class scope. */
22530 {
22533 }
22535 /* Otherwise, the next construction must be a
22536 member-declaration. */
22538 }
22539 }
22540 }
22542 /* Parse a member-declaration.
22544 member-declaration:
22545 decl-specifier-seq [opt] member-declarator-list [opt] ;
22546 function-definition ; [opt]
22547 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22548 using-declaration
22549 template-declaration
22550 alias-declaration
22552 member-declarator-list:
22553 member-declarator
22554 member-declarator-list , member-declarator
22556 member-declarator:
22557 declarator pure-specifier [opt]
22558 declarator constant-initializer [opt]
22559 identifier [opt] : constant-expression
22561 GNU Extensions:
22563 member-declaration:
22564 __extension__ member-declaration
22566 member-declarator:
22567 declarator attributes [opt] pure-specifier [opt]
22568 declarator attributes [opt] constant-initializer [opt]
22569 identifier [opt] attributes [opt] : constant-expression
22571 C++0x Extensions:
22573 member-declaration:
22574 static_assert-declaration */
22576 static void
22578 {
22579 cp_decl_specifier_seq decl_specifiers;
22580 tree prefix_attributes;
22581 tree decl;
22590 /* Check for the `__extension__' keyword. */
22592 {
22593 /* Recurse. */
22595 /* Restore the old value of the PEDANTIC flag. */
22599 }
22601 /* Check for a template-declaration. */
22603 {
22604 /* An explicit specialization here is an error condition, and we
22605 expect the specialization handler to detect and report this. */
22609 else
22613 }
22614 /* Check for a template introduction. */
22618 /* Check for a using-declaration. */
22620 {
22622 {
22623 /* Parse the using-declaration. */
22627 }
22628 else
22629 {
22630 tree decl;
22634 /* Note that if we actually see the '=' token after the
22635 identifier, cp_parser_alias_declaration commits the
22636 tentative parse. In that case, we really expect an
22637 alias-declaration. Otherwise, we expect a using
22638 declaration. */
22639 alias_decl_expected =
22645 else
22649 }
22650 }
22652 /* Check for @defs. */
22654 {
22659 {
22664 }
22666 }
22668 /* If the next token is `static_assert' we have a static assertion. */
22670 {
22673 }
22680 /* Parse the decl-specifier-seq. */
22683 CP_PARSER_FLAGS_OPTIONAL,
22686 /* Check for an invalid type-name. */
22690 /* If there is no declarator, then the decl-specifier-seq should
22691 specify a type. */
22693 {
22694 /* If there was no decl-specifier-seq, and the next token is a
22695 `;', then we have something like:
22697 struct S { ; };
22699 [class.mem]
22701 Each member-declaration shall declare at least one member
22702 name of the class. */
22704 {
22708 }
22709 else
22710 {
22711 tree type;
22713 /* See if this declaration is a friend. */
22715 /* If there were decl-specifiers, check to see if there was
22716 a class-declaration. */
22719 /* Nested classes have already been added to the class, but
22720 a `friend' needs to be explicitly registered. */
22722 {
22723 /* If the `friend' keyword was present, the friend must
22724 be introduced with a class-key. */
22727 "in C++03 a class-key must be used "
22729 /* In this case:
22731 template <typename T> struct A {
22732 friend struct A<T>::B;
22733 };
22735 A<T>::B will be represented by a TYPENAME_TYPE, and
22736 therefore not recognized by check_tag_decl. */
22738 {
22742 }
22745 "friend declaration does not name a class or "
22747 else
22750 }
22751 /* If there is no TYPE, an error message will already have
22752 been issued. */
22754 ;
22755 /* An anonymous aggregate has to be handled specially; such
22756 a declaration really declares a data member (with a
22757 particular type), as opposed to a nested class. */
22759 {
22760 /* C++11 9.5/6. */
22763 "a storage class on an anonymous aggregate "
22766 /* Remove constructors and such from TYPE, now that we
22767 know it is an anonymous aggregate. */
22769 /* And make the corresponding data member. */
22772 /* Add it to the class. */
22774 }
22775 else
22776 cp_parser_check_access_in_redeclaration
22779 }
22780 }
22781 else
22782 {
22785 /* Clear attributes from the decl_specifiers but keep them
22786 around as prefix attributes that apply them to the entity
22787 being declared. */
22791 /* See if these declarations will be friends. */
22794 /* Keep going until we hit the `;' at the end of the
22795 declaration. */
22797 {
22799 tree first_attribute;
22801 /* Peek at the next token. */
22804 /* Check for a bitfield declaration. */
22809 {
22810 tree identifier;
22811 tree width;
22813 /* Get the name of the bitfield. Note that we cannot just
22814 check TOKEN here because it may have been invalidated by
22815 the call to cp_lexer_peek_nth_token above. */
22818 else
22821 /* Consume the `:' token. */
22823 /* Get the width of the bitfield. */
22824 width
22827 /* Look for attributes that apply to the bitfield. */
22829 /* Remember which attributes are prefix attributes and
22830 which are not. */
22832 /* Combine the attributes. */
22835 /* Create the bitfield declaration. */
22838 identifier,
22839 sfk_none)
22842 width,
22843 attributes);
22844 }
22845 else
22846 {
22848 tree initializer;
22849 tree asm_specification;
22852 /* Parse the declarator. */
22853 declarator
22858 friend_p);
22860 /* If something went wrong parsing the declarator, make sure
22861 that we at least consume some tokens. */
22863 {
22864 /* Skip to the end of the statement. */
22866 /* If the next token is not a semicolon, that is
22867 probably because we just skipped over the body of
22868 a function. So, we consume a semicolon if
22869 present, but do not issue an error message if it
22870 is not present. */
22872 CPP_SEMICOLON))
22875 }
22878 cp_parser_check_for_definition_in_return_type
22882 /* Look for an asm-specification. */
22884 /* Look for attributes that apply to the declaration. */
22886 /* Remember which attributes are prefix attributes and
22887 which are not. */
22889 /* Combine the attributes. */
22892 /* If it's an `=', then we have a constant-initializer or a
22893 pure-specifier. It is not correct to parse the
22894 initializer before registering the member declaration
22895 since the member declaration should be in scope while
22896 its initializer is processed. However, the rest of the
22897 front end does not yet provide an interface that allows
22898 us to handle this correctly. */
22900 {
22901 /* In [class.mem]:
22903 A pure-specifier shall be used only in the declaration of
22904 a virtual function.
22906 A member-declarator can contain a constant-initializer
22907 only if it declares a static member of integral or
22908 enumeration type.
22910 Therefore, if the DECLARATOR is for a function, we look
22911 for a pure-specifier; otherwise, we look for a
22912 constant-initializer. When we call `grokfield', it will
22913 perform more stringent semantics checks. */
22925 {
22927 /* Don't require a constant rvalue in C++11, since we
22928 might want a reference constant. We'll enforce
22929 constancy later. */
22931 /* Parse the initializer. */
22934 }
22935 else
22936 /* Parse the initializer. */
22938 }
22941 {
22945 else
22947 }
22948 /* Otherwise, there is no initializer. */
22949 else
22952 /* See if we are probably looking at a function
22953 definition. We are certainly not looking at a
22954 member-declarator. Calling `grokfield' has
22955 side-effects, so we must not do it unless we are sure
22956 that we are looking at a member-declarator. */
22959 {
22960 /* The grammar does not allow a pure-specifier to be
22961 used when a member function is defined. (It is
22962 possible that this fact is an oversight in the
22963 standard, since a pure function may be defined
22964 outside of the class-specifier. */
22970 declarator,
22971 attributes);
22974 /* If the member was not a friend, declare it here. */
22977 /* Peek at the next token. */
22979 /* If the next token is a semicolon, consume it. */
22983 }
22984 else
22987 /* Create the declaration. */
22992 {
22995 else
22997 }
22998 }
23003 /* Reset PREFIX_ATTRIBUTES. */
23009 /* If there is any qualification still in effect, clear it
23010 now; we will be starting fresh with the next declarator. */
23014 /* If it's a `,', then there are more declarators. */
23016 {
23019 {
23023 }
23024 }
23025 /* If the next token isn't a `;', then we have a parse error. */
23027 CPP_SEMICOLON))
23028 {
23029 /* The next token might be a ways away from where the
23030 actual semicolon is missing. Find the previous token
23031 and use that for our error position. */
23036 /* Assume that the user meant to provide a semicolon. If
23037 we were to cp_parser_skip_to_end_of_statement, we might
23038 skip to a semicolon inside a member function definition
23039 and issue nonsensical error messages. */
23041 }
23044 {
23045 /* Add DECL to the list of members. */
23047 /* Explicitly include, eg, NSDMIs, for better error
23048 recovery (c++/58650). */
23057 /* Add DECL to the queue of NSDMI to be parsed later. */
23059 }
23063 }
23064 }
23067 out:
23069 }
23071 /* Parse a pure-specifier.
23073 pure-specifier:
23074 = 0
23076 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23077 Otherwise, ERROR_MARK_NODE is returned. */
23079 static tree
23081 {
23084 /* Look for the `=' token. */
23087 /* Look for the `0' token. */
23096 /* Accept = default or = delete in c++0x mode. */
23099 {
23102 }
23104 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23106 {
23111 }
23113 {
23116 }
23119 }
23121 /* Parse a constant-initializer.
23123 constant-initializer:
23124 = constant-expression
23126 Returns a representation of the constant-expression. */
23128 static tree
23130 {
23131 /* Look for the `=' token. */
23135 /* It is invalid to write:
23137 struct S { static const int i = { 7 }; };
23139 */
23141 {
23144 /* Consume the opening brace. */
23146 /* Skip the initializer. */
23148 /* Look for the trailing `}'. */
23152 }
23155 }
23157 /* Derived classes [gram.class.derived] */
23159 /* Parse a base-clause.
23161 base-clause:
23162 : base-specifier-list
23164 base-specifier-list:
23165 base-specifier ... [opt]
23166 base-specifier-list , base-specifier ... [opt]
23168 Returns a TREE_LIST representing the base-classes, in the order in
23169 which they were declared. The representation of each node is as
23170 described by cp_parser_base_specifier.
23172 In the case that no bases are specified, this function will return
23173 NULL_TREE, not ERROR_MARK_NODE. */
23175 static tree
23177 {
23180 /* Look for the `:' that begins the list. */
23183 /* Scan the base-specifier-list. */
23185 {
23187 tree base;
23190 /* Look for the base-specifier. */
23192 /* Look for the (optional) ellipsis. */
23194 {
23195 /* Consume the `...'. */
23199 }
23201 /* Add BASE to the front of the list. */
23203 {
23205 /* Make this a pack expansion type. */
23209 {
23212 }
23213 }
23214 /* Peek at the next token. */
23216 /* If it's not a comma, then the list is complete. */
23219 /* Consume the `,'. */
23221 }
23223 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23224 base class had a qualified name. However, the next name that
23225 appears is certainly not qualified. */
23231 }
23233 /* Parse a base-specifier.
23235 base-specifier:
23236 :: [opt] nested-name-specifier [opt] class-name
23237 virtual access-specifier [opt] :: [opt] nested-name-specifier
23238 [opt] class-name
23239 access-specifier virtual [opt] :: [opt] nested-name-specifier
23240 [opt] class-name
23242 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23243 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23244 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23245 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23247 static tree
23249 {
23257 tree type;
23259 /* Process the optional `virtual' and `access-specifier'. */
23261 {
23262 /* Peek at the next token. */
23264 /* Process `virtual'. */
23266 {
23268 /* If `virtual' appears more than once, issue an error. */
23270 {
23274 }
23278 /* Consume the `virtual' token. */
23286 /* If more than one access specifier appears, issue an
23287 error. */
23290 {
23294 }
23298 /* Consume the access-specifier. */
23306 }
23307 }
23308 /* It is not uncommon to see programs mechanically, erroneously, use
23309 the 'typename' keyword to denote (dependent) qualified types
23310 as base classes. */
23312 {
23317 else
23319 "keyword %<typename%> not allowed in this context "
23322 }
23324 /* Look for the optional `::' operator. */
23326 /* Look for the nested-name-specifier. The simplest way to
23327 implement:
23329 [temp.res]
23331 The keyword `typename' is not permitted in a base-specifier or
23332 mem-initializer; in these contexts a qualified name that
23333 depends on a template-parameter is implicitly assumed to be a
23334 type name.
23336 is to pretend that we have seen the `typename' keyword at this
23337 point. */
23341 typename_type,
23343 /* If the base class is given by a qualified name, assume that names
23344 we see are type names or templates, as appropriate. */
23350 /* DR 950 allows decltype as a base-specifier. */
23352 else
23353 {
23354 /* Otherwise, look for the class-name. */
23356 class_scope_p,
23357 template_p,
23358 typename_type,
23363 }
23369 }
23371 /* Exception handling [gram.exception] */
23373 /* Parse an (optional) noexcept-specification.
23375 noexcept-specification:
23376 noexcept ( constant-expression ) [opt]
23378 If no noexcept-specification is present, returns NULL_TREE.
23379 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23380 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23381 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23382 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23383 in which case a boolean condition is returned instead. */
23385 static tree
23390 {
23394 /* Peek at the next token. */
23397 /* Is it a noexcept-specification? */
23399 {
23400 tree expr;
23404 {
23408 {
23409 /* Types may not be defined in an exception-specification. */
23411 parser->type_definition_forbidden_message
23416 /* Restore the saved message. */
23418 }
23419 else
23420 {
23423 }
23426 }
23427 else
23428 {
23432 }
23434 /* We cannot build a noexcept-spec right away because this will check
23435 that expr is a constexpr. */
23438 else
23440 }
23441 else
23443 }
23445 /* Parse an (optional) exception-specification.
23447 exception-specification:
23448 throw ( type-id-list [opt] )
23450 Returns a TREE_LIST representing the exception-specification. The
23451 TREE_VALUE of each node is a type. */
23453 static tree
23455 {
23457 tree type_id_list;
23460 /* Peek at the next token. */
23463 /* Is it a noexcept-specification? */
23469 /* If it's not `throw', then there's no exception-specification. */
23473 #if 0
23474 /* Enable this once a lot of code has transitioned to noexcept? */
23478 #endif
23480 /* Consume the `throw'. */
23483 /* Look for the `('. */
23486 /* Peek at the next token. */
23488 /* If it's not a `)', then there is a type-id-list. */
23490 {
23491 /* Types may not be defined in an exception-specification. */
23493 parser->type_definition_forbidden_message
23495 /* Parse the type-id-list. */
23497 /* Restore the saved message. */
23499 }
23500 else
23503 /* Look for the `)'. */
23507 }
23509 /* Parse an (optional) type-id-list.
23511 type-id-list:
23512 type-id ... [opt]
23513 type-id-list , type-id ... [opt]
23515 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23516 in the order that the types were presented. */
23518 static tree
23520 {
23524 {
23526 tree type;
23530 /* Get the next type-id. */
23532 /* Check for invalid 'auto'. */
23534 {
23538 }
23539 /* Parse the optional ellipsis. */
23541 {
23542 /* Consume the `...'. */
23545 /* Turn the type into a pack expansion expression. */
23547 }
23548 /* Add it to the list. */
23550 /* Peek at the next token. */
23552 /* If it is not a `,', we are done. */
23555 /* Consume the `,'. */
23557 }
23560 }
23562 /* Parse a try-block.
23564 try-block:
23565 try compound-statement handler-seq */
23567 static tree
23569 {
23570 tree try_block;
23584 }
23586 /* Parse a function-try-block.
23588 function-try-block:
23589 try ctor-initializer [opt] function-body handler-seq */
23591 static bool
23593 {
23594 tree compound_stmt;
23595 tree try_block;
23598 /* Look for the `try' keyword. */
23601 /* Let the rest of the front end know where we are. */
23603 /* Parse the function-body. */
23604 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23606 /* We're done with the `try' part. */
23608 /* Parse the handlers. */
23610 /* We're done with the handlers. */
23614 }
23616 /* Parse a handler-seq.
23618 handler-seq:
23619 handler handler-seq [opt] */
23621 static void
23623 {
23625 {
23628 /* Parse the handler. */
23630 /* Peek at the next token. */
23632 /* If it's not `catch' then there are no more handlers. */
23635 }
23636 }
23638 /* Parse a handler.
23640 handler:
23641 catch ( exception-declaration ) compound-statement */
23643 static void
23645 {
23646 tree handler;
23647 tree declaration;
23657 }
23659 /* Parse an exception-declaration.
23661 exception-declaration:
23662 type-specifier-seq declarator
23663 type-specifier-seq abstract-declarator
23664 type-specifier-seq
23665 ...
23667 Returns a VAR_DECL for the declaration, or NULL_TREE if the
23668 ellipsis variant is used. */
23670 static tree
23672 {
23673 cp_decl_specifier_seq type_specifiers;
23677 /* If it's an ellipsis, it's easy to handle. */
23679 {
23680 /* Consume the `...' token. */
23683 }
23685 /* Types may not be defined in exception-declarations. */
23687 parser->type_definition_forbidden_message
23690 /* Parse the type-specifier-seq. */
23694 /* If it's a `)', then there is no declarator. */
23697 else
23704 /* Restore the saved message. */
23711 }
23713 /* Parse a throw-expression.
23715 throw-expression:
23716 throw assignment-expression [opt]
23718 Returns a THROW_EXPR representing the throw-expression. */
23720 static tree
23722 {
23723 tree expression;
23728 /* Figure out whether or not there is an assignment-expression
23729 following the "throw" keyword. */
23737 else
23741 }
23743 /* GNU Extensions */
23745 /* Parse an (optional) asm-specification.
23747 asm-specification:
23748 asm ( string-literal )
23750 If the asm-specification is present, returns a STRING_CST
23751 corresponding to the string-literal. Otherwise, returns
23752 NULL_TREE. */
23754 static tree
23756 {
23758 tree asm_specification;
23760 /* Peek at the next token. */
23762 /* If the next token isn't the `asm' keyword, then there's no
23763 asm-specification. */
23767 /* Consume the `asm' token. */
23769 /* Look for the `('. */
23772 /* Look for the string-literal. */
23775 /* Look for the `)'. */
23779 }
23781 /* Parse an asm-operand-list.
23783 asm-operand-list:
23784 asm-operand
23785 asm-operand-list , asm-operand
23787 asm-operand:
23788 string-literal ( expression )
23789 [ string-literal ] string-literal ( expression )
23791 Returns a TREE_LIST representing the operands. The TREE_VALUE of
23792 each node is the expression. The TREE_PURPOSE is itself a
23793 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
23794 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
23795 is a STRING_CST for the string literal before the parenthesis. Returns
23796 ERROR_MARK_NODE if any of the operands are invalid. */
23798 static tree
23800 {
23805 {
23806 tree string_literal;
23807 tree expression;
23808 tree name;
23811 {
23812 /* Consume the `[' token. */
23814 /* Read the operand name. */
23819 /* Look for the closing `]'. */
23821 }
23822 else
23824 /* Look for the string-literal. */
23827 /* Look for the `('. */
23829 /* Parse the expression. */
23831 /* Look for the `)'. */
23839 /* Add this operand to the list. */
23841 expression,
23842 asm_operands);
23843 /* If the next token is not a `,', there are no more
23844 operands. */
23847 /* Consume the `,'. */
23849 }
23852 }
23854 /* Parse an asm-clobber-list.
23856 asm-clobber-list:
23857 string-literal
23858 asm-clobber-list , string-literal
23860 Returns a TREE_LIST, indicating the clobbers in the order that they
23861 appeared. The TREE_VALUE of each node is a STRING_CST. */
23863 static tree
23865 {
23869 {
23870 tree string_literal;
23872 /* Look for the string literal. */
23874 /* Add it to the list. */
23876 /* If the next token is not a `,', then the list is
23877 complete. */
23880 /* Consume the `,' token. */
23882 }
23885 }
23887 /* Parse an asm-label-list.
23889 asm-label-list:
23890 identifier
23891 asm-label-list , identifier
23893 Returns a TREE_LIST, indicating the labels in the order that they
23894 appeared. The TREE_VALUE of each node is a label. */
23896 static tree
23898 {
23902 {
23905 /* Look for the identifier. */
23908 {
23911 {
23917 }
23918 }
23919 /* If the next token is not a `,', then the list is
23920 complete. */
23923 /* Consume the `,' token. */
23925 }
23928 }
23930 /* Return TRUE iff the next tokens in the stream are possibly the
23931 beginning of a GNU extension attribute. */
23933 static bool
23935 {
23937 }
23939 /* Return TRUE iff the next tokens in the stream are possibly the
23940 beginning of a standard C++-11 attribute specifier. */
23942 static bool
23944 {
23946 }
23948 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23949 beginning of a standard C++-11 attribute specifier. */
23951 static bool
23953 {
23961 }
23963 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23964 beginning of a GNU extension attribute. */
23966 static bool
23968 {
23972 }
23974 /* Return true iff the next tokens can be the beginning of either a
23975 GNU attribute list, or a standard C++11 attribute sequence. */
23977 static bool
23979 {
23982 }
23984 /* Return true iff the next Nth tokens can be the beginning of either
23985 a GNU attribute list, or a standard C++11 attribute sequence. */
23987 static bool
23989 {
23992 }
23994 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
23995 of GNU attributes, or return NULL. */
23997 static tree
23999 {
24003 }
24005 #define CILK_SIMD_FN_CLAUSE_MASK \
24006 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24007 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24008 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24009 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24010 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24012 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24013 vector [(<clauses>)] */
24015 static void
24017 {
24021 {
24027 }
24030 {
24033 paren_scope++;
24034 }
24036 {
24039 paren_scope++;
24041 paren_scope--;
24042 /* Do not push the last ')' */
24045 }
24054 }
24056 /* Parse an (optional) series of attributes.
24058 attributes:
24059 attributes attribute
24061 attribute:
24062 __attribute__ (( attribute-list [opt] ))
24064 The return value is as for cp_parser_gnu_attribute_list. */
24066 static tree
24068 {
24072 {
24074 tree attribute_list;
24077 /* Peek at the next token. */
24079 /* If it's not `__attribute__', then we're done. */
24083 /* Consume the `__attribute__' keyword. */
24085 /* Look for the two `(' tokens. */
24089 /* Peek at the next token. */
24092 /* Parse the attribute-list. */
24094 else
24095 /* If the next token is a `)', then there is no attribute
24096 list. */
24099 /* Look for the two `)' tokens. */
24107 /* Add these new attributes to the list. */
24109 }
24112 }
24114 /* Parse a GNU attribute-list.
24116 attribute-list:
24117 attribute
24118 attribute-list , attribute
24120 attribute:
24121 identifier
24122 identifier ( identifier )
24123 identifier ( identifier , expression-list )
24124 identifier ( expression-list )
24126 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24127 to an attribute. The TREE_PURPOSE of each node is the identifier
24128 indicating which attribute is in use. The TREE_VALUE represents
24129 the arguments, if any. */
24131 static tree
24133 {
24139 {
24141 tree identifier;
24142 tree attribute;
24144 /* Look for the identifier. We also allow keywords here; for
24145 example `__attribute__ ((const))' is legal. */
24149 {
24152 /* Consume the token, but save it since we need it for the
24153 SIMD enabled function parsing. */
24156 /* Save away the identifier that indicates which attribute
24157 this is. */
24159 /* For keywords, use the canonical spelling, not the
24160 parsed identifier. */
24166 /* Peek at the next token. */
24168 /* If it's an `(', then parse the attribute arguments. */
24170 {
24175 {
24178 }
24179 else
24180 vec = cp_parser_parenthesized_expression_list
24186 else
24187 {
24190 }
24191 /* Save the arguments away. */
24193 }
24195 {
24198 }
24201 {
24202 /* Add this attribute to the list. */
24205 }
24208 }
24209 /* Now, look for more attributes. If the next token isn't a
24210 `,', we're done. */
24214 /* Consume the comma and keep going. */
24216 }
24219 /* We built up the list in reverse order. */
24221 }
24223 /* Parse a standard C++11 attribute.
24225 The returned representation is a TREE_LIST which TREE_PURPOSE is
24226 the scoped name of the attribute, and the TREE_VALUE is its
24227 arguments list.
24229 Note that the scoped name of the attribute is itself a TREE_LIST
24230 which TREE_PURPOSE is the namespace of the attribute, and
24231 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24232 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24233 and which TREE_PURPOSE is directly the attribute name.
24235 Clients of the attribute code should use get_attribute_namespace
24236 and get_attribute_name to get the actual namespace and name of
24237 attributes, regardless of their being GNU or C++11 attributes.
24239 attribute:
24240 attribute-token attribute-argument-clause [opt]
24242 attribute-token:
24243 identifier
24244 attribute-scoped-token
24246 attribute-scoped-token:
24247 attribute-namespace :: identifier
24249 attribute-namespace:
24250 identifier
24252 attribute-argument-clause:
24253 ( balanced-token-seq )
24255 balanced-token-seq:
24256 balanced-token [opt]
24257 balanced-token-seq balanced-token
24259 balanced-token:
24260 ( balanced-token-seq )
24261 [ balanced-token-seq ]
24262 { balanced-token-seq }. */
24264 static tree
24266 {
24270 /* First, parse name of the attribute, a.k.a attribute-token. */
24287 {
24288 /* We are seeing a scoped attribute token. */
24303 else
24304 {
24308 }
24310 NULL_TREE);
24312 }
24315 NULL_TREE);
24316 else
24317 {
24319 NULL_TREE);
24320 /* C++11 noreturn attribute is equivalent to GNU's. */
24323 /* C++14 deprecated attribute is equivalent to GNU's. */
24325 {
24328 "%<deprecated%> is a C++14 feature;"
24331 }
24332 /* C++17 fallthrough attribute is equivalent to GNU's. */
24334 {
24337 "%<fallthrough%> is a C++17 feature;"
24340 }
24341 /* Transactional Memory TS optimize_for_synchronized attribute is
24342 equivalent to GNU transaction_callable. */
24346 /* Transactional Memory attributes are GNU attributes. */
24349 }
24351 /* Now parse the optional argument clause of the attribute. */
24356 {
24362 /* A GNU attribute that takes an identifier in parameter. */
24365 vec = cp_parser_parenthesized_expression_list
24371 else
24372 {
24375 }
24379 else
24381 }
24384 }
24386 /* Check that the attribute ATTRIBUTE appears at most once in the
24387 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24388 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24389 isn't implemented yet in GCC. */
24391 static void
24393 {
24395 {
24405 }
24406 }
24408 /* Parse a list of standard C++-11 attributes.
24410 attribute-list:
24411 attribute [opt]
24412 attribute-list , attribute[opt]
24413 attribute ...
24414 attribute-list , attribute ...
24415 */
24417 static tree
24419 {
24424 {
24429 {
24433 }
24436 {
24441 else
24445 }
24449 }
24452 }
24454 /* Parse a standard C++-11 attribute specifier.
24456 attribute-specifier:
24457 [ [ attribute-using-prefix [opt] attribute-list ] ]
24458 alignment-specifier
24460 attribute-using-prefix:
24461 using attribute-namespace :
24463 alignment-specifier:
24464 alignas ( type-id ... [opt] )
24465 alignas ( alignment-expression ... [opt] ). */
24467 static tree
24469 {
24475 {
24482 {
24493 {
24497 "attribute using prefix only available "
24503 }
24504 else
24506 }
24513 else
24514 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24515 when we are sure that we have actually parsed them. */
24517 }
24518 else
24519 {
24520 tree alignas_expr;
24522 /* Look for an alignment-specifier. */
24534 {
24537 }
24543 {
24547 alignas_expr =
24554 }
24560 {
24563 }
24566 {
24569 }
24571 /* Build the C++-11 representation of an 'aligned'
24572 attribute. */
24573 attributes =
24576 alignas_expr);
24577 }
24580 }
24582 /* Parse a standard C++-11 attribute-specifier-seq.
24584 attribute-specifier-seq:
24585 attribute-specifier-seq [opt] attribute-specifier
24586 */
24588 static tree
24590 {
24595 {
24604 else
24607 }
24610 }
24612 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
24613 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
24614 current value of the PEDANTIC flag, regardless of whether or not
24615 the `__extension__' keyword is present. The caller is responsible
24616 for restoring the value of the PEDANTIC flag. */
24618 static bool
24620 {
24621 /* Save the old value of the PEDANTIC flag. */
24625 {
24626 /* Consume the `__extension__' token. */
24628 /* We're not being pedantic while the `__extension__' keyword is
24629 in effect. */
24633 }
24636 }
24638 /* Parse a label declaration.
24640 label-declaration:
24641 __label__ label-declarator-seq ;
24643 label-declarator-seq:
24644 identifier , label-declarator-seq
24645 identifier */
24647 static void
24649 {
24650 /* Look for the `__label__' keyword. */
24654 {
24655 tree identifier;
24657 /* Look for an identifier. */
24659 /* If we failed, stop. */
24662 /* Declare it as a label. */
24664 /* If the next token is a `;', stop. */
24667 /* Look for the `,' separating the label declarations. */
24669 }
24671 /* Look for the final `;'. */
24673 }
24675 // -------------------------------------------------------------------------- //
24676 // Requires Clause
24678 // Parse a requires clause.
24679 //
24680 // requires-clause:
24681 // 'requires' logical-or-expression
24682 //
24683 // The required logical-or-expression must be a constant expression. Note
24684 // that we don't check that the expression is constepxr here. We defer until
24685 // we analyze constraints and then, we only check atomic constraints.
24686 static tree
24688 {
24689 // Parse the requires clause so that it is not automatically folded.
24697 }
24699 // Optionally parse a requires clause:
24700 static tree
24702 {
24705 {
24708 {
24711 /* Parse and discard the requires-clause. */
24714 }
24716 }
24719 }
24722 /*---------------------------------------------------------------------------
24723 Requires expressions
24724 ---------------------------------------------------------------------------*/
24726 /* Parse a requires expression
24728 requirement-expression:
24729 'requires' requirement-parameter-list [opt] requirement-body */
24730 static tree
24732 {
24736 /* A requires-expression shall appear only within a concept
24737 definition or a requires-clause.
24739 TODO: Implement this diagnostic correctly. */
24741 {
24745 }
24748 {
24749 /* Local parameters are delared as variables within the scope
24750 of the expression. They are not visible past the end of
24751 the expression. Expressions within the requires-expression
24752 are unevaluated. */
24753 struct scope_sentinel
24754 {
24756 {
24759 }
24762 {
24765 }
24768 /* Parse the optional parameter list. */
24770 {
24774 }
24775 else
24778 /* Parse the requirement body. */
24782 }
24784 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
24785 the parm chain. */
24788 }
24790 /* Parse a parameterized requirement.
24792 requirement-parameter-list:
24793 '(' parameter-declaration-clause ')' */
24794 static tree
24796 {
24806 }
24808 /* Parse the body of a requirement.
24810 requirement-body:
24811 '{' requirement-list '}' */
24812 static tree
24814 {
24824 }
24826 /* Parse a list of requirements.
24828 requirement-list:
24829 requirement
24830 requirement-list ';' requirement[opt] */
24831 static tree
24833 {
24836 {
24843 /* If we see a semi-colon, consume it. */
24847 /* Stop processing at the end of the list. */
24850 }
24852 /* Reverse the order of requirements so they are analyzed in
24853 declaration order. */
24855 }
24857 /* Parse a syntactic requirement or type requirement.
24859 requirement:
24860 simple-requirement
24861 compound-requirement
24862 type-requirement
24863 nested-requirement */
24864 static tree
24866 {
24873 else
24875 }
24877 /* Parse a simple requirement.
24879 simple-requirement:
24880 expression ';' */
24881 static tree
24883 {
24892 }
24894 /* Parse a type requirement
24896 type-requirement
24897 nested-name-specifier [opt] required-type-name ';'
24899 required-type-name:
24900 type-name
24901 'template' [opt] simple-template-id */
24902 static tree
24904 {
24907 // Save the scope before parsing name specifiers.
24918 tree type;
24920 {
24929 }
24930 else
24949 }
24951 /* Parse a compound requirement
24953 compound-requirement:
24954 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
24955 static tree
24957 {
24958 /* Parse an expression enclosed in '{ }'s. */
24969 /* Parse the optional noexcept. */
24972 {
24975 }
24977 /* Parse the optional trailing return type. */
24980 {
24988 }
24991 }
24993 /* Parse a nested requirement. This is the same as a requires clause.
24995 nested-requirement:
24996 requires-clause */
24997 static tree
24999 {
25005 }
25007 /* Support Functions */
25009 /* Return the appropriate prefer_type argument for lookup_name_real based on
25010 tag_type and template_mem_access. */
25014 {
25015 /* DR 141: When looking in the current enclosing context for a template-name
25016 after -> or ., only consider class templates. */
25020 {
25024 }
25025 }
25027 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25028 NAME should have one of the representations used for an
25029 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25030 is returned. If PARSER->SCOPE is a dependent type, then a
25031 SCOPE_REF is returned.
25033 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25034 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25035 was formed. Abstractly, such entities should not be passed to this
25036 function, because they do not need to be looked up, but it is
25037 simpler to check for this special case here, rather than at the
25038 call-sites.
25040 In cases not explicitly covered above, this function returns a
25041 DECL, OVERLOAD, or baselink representing the result of the lookup.
25042 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25043 is returned.
25045 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25046 (e.g., "struct") that was used. In that case bindings that do not
25047 refer to types are ignored.
25049 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25050 ignored.
25052 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25053 are ignored.
25055 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25056 types.
25058 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25059 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25060 NULL_TREE otherwise. */
25062 static cp_expr
25069 location_t name_location)
25070 {
25071 tree decl;
25074 /* Assume that the lookup will be unambiguous. */
25078 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25079 no longer valid. Note that if we are parsing tentatively, and
25080 the parse fails, OBJECT_TYPE will be automatically restored. */
25086 /* A template-id has already been resolved; there is no lookup to
25087 do. */
25091 {
25095 }
25097 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25098 it should already have been checked to make sure that the name
25099 used matches the type being destroyed. */
25101 {
25102 tree type;
25104 /* Figure out to which type this destructor applies. */
25109 else
25111 /* If that's not a class type, there is no destructor. */
25118 /* If it was a class type, return the destructor. */
25120 }
25122 /* By this point, the NAME should be an ordinary identifier. If
25123 the id-expression was a qualified name, the qualifying scope is
25124 stored in PARSER->SCOPE at this point. */
25127 /* Perform the lookup. */
25129 {
25135 /* If the SCOPE is dependent, the lookup must be deferred until
25136 the template is instantiated -- unless we are explicitly
25137 looking up names in uninstantiated templates. Even then, we
25138 cannot look up the name if the scope is not a class type; it
25139 might, for example, be a template type parameter. */
25144 /* Defer lookup. */
25146 else
25147 {
25150 /* If PARSER->SCOPE is a dependent type, then it must be a
25151 class type, and we must not be checking dependencies;
25152 otherwise, we would have processed this lookup above. So
25153 that PARSER->SCOPE is not considered a dependent base by
25154 lookup_member, we must enter the scope here. */
25158 /* If the PARSER->SCOPE is a template specialization, it
25159 may be instantiated during name lookup. In that case,
25160 errors may be issued. Even if we rollback the current
25161 tentative parse, those errors are valid. */
25166 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25167 lookup result and the nested-name-specifier nominates a class C:
25168 * if the name specified after the nested-name-specifier, when
25169 looked up in C, is the injected-class-name of C (Clause 9), or
25170 * if the name specified after the nested-name-specifier is the
25171 same as the identifier or the simple-template-id's template-
25172 name in the last component of the nested-name-specifier,
25173 the name is instead considered to name the constructor of
25174 class C. [ Note: for example, the constructor is not an
25175 acceptable lookup result in an elaborated-type-specifier so
25176 the constructor would not be used in place of the
25177 injected-class-name. --end note ] Such a constructor name
25178 shall be used only in the declarator-id of a declaration that
25179 names a constructor or in a using-declaration. */
25187 /* If we have a single function from a using decl, pull it out. */
25194 }
25196 /* If the scope is a dependent type and either we deferred lookup or
25197 we did lookup but didn't find the name, rememeber the name. */
25200 {
25202 {
25203 tree type;
25205 /* The resolution to Core Issue 180 says that `struct
25206 A::B' should be considered a type-name, even if `A'
25207 is dependent. */
25212 }
25216 CPP_CLOSE_PAREN)))
25220 else
25223 is_template);
25224 }
25227 }
25229 {
25230 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25231 OBJECT_TYPE is not a class. */
25233 /* If the OBJECT_TYPE is a template specialization, it may
25234 be instantiated during name lookup. In that case, errors
25235 may be issued. Even if we rollback the current tentative
25236 parse, those errors are valid. */
25238 name,
25241 tf_warning_or_error);
25242 else
25246 /* Look it up in the enclosing context. DR 141: When looking for a
25247 template-name after -> or ., only consider class templates. */
25252 /* The object is type-dependent, so we can't look anything up; we used
25253 this to get the DR 141 behavior. */
25257 }
25258 else
25259 {
25265 }
25267 /* If the lookup failed, let our caller know. */
25271 /* Pull out the template from an injected-class-name (or multiple). */
25275 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
25277 {
25280 /* The error message we have to print is too complicated for
25281 cp_parser_error, so we incorporate its actions directly. */
25283 {
25285 name);
25287 }
25289 }
25297 /* If we have resolved the name of a member declaration, check to
25298 see if the declaration is accessible. When the name resolves to
25299 set of overloaded functions, accessibility is checked when
25300 overload resolution is done.
25302 During an explicit instantiation, access is not checked at all,
25303 as per [temp.explicit]. */
25310 }
25312 /* Like cp_parser_lookup_name, but for use in the typical case where
25313 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
25314 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
25316 static tree
25318 {
25320 none_type,
25325 location);
25326 }
25328 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
25329 the current context, return the TYPE_DECL. If TAG_NAME_P is
25330 true, the DECL indicates the class being defined in a class-head,
25331 or declared in an elaborated-type-specifier.
25333 Otherwise, return DECL. */
25335 static tree
25337 {
25338 /* If the TEMPLATE_DECL is being declared as part of a class-head,
25339 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
25341 struct A {
25342 template <typename T> struct B;
25343 };
25345 template <typename T> struct A::B {};
25347 Similarly, in an elaborated-type-specifier:
25349 namespace N { struct X{}; }
25351 struct A {
25352 template <typename T> friend struct N::X;
25353 };
25355 However, if the DECL refers to a class type, and we are in
25356 the scope of the class, then the name lookup automatically
25357 finds the TYPE_DECL created by build_self_reference rather
25358 than a TEMPLATE_DECL. For example, in:
25360 template <class T> struct S {
25361 S s;
25362 };
25364 there is no need to handle such case. */
25370 }
25372 /* If too many, or too few, template-parameter lists apply to the
25373 declarator, issue an error message. Returns TRUE if all went well,
25374 and FALSE otherwise. */
25376 static bool
25379 location_t declarator_location)
25380 {
25382 {
25384 {
25392 /* If the DECLARATOR has the form `X<y>' then it uses one
25393 additional level of template parameters. */
25396 return cp_parser_check_template_parameters
25398 }
25413 }
25415 }
25417 /* NUM_TEMPLATES were used in the current declaration. If that is
25418 invalid, return FALSE and issue an error messages. Otherwise,
25419 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25420 declarator and we can print more accurate diagnostics. */
25422 static bool
25425 location_t location,
25427 {
25428 /* If there are the same number of template classes and parameter
25429 lists, that's OK. */
25432 /* If there are more, but only one more, then we are referring to a
25433 member template. That's OK too. */
25436 /* If there are more template classes than parameter lists, we have
25437 something like:
25439 template <class T> void S<T>::R<T>::f (); */
25441 {
25451 else
25454 }
25455 /* Otherwise, there are too many template parameter lists. We have
25456 something like:
25458 template <class T> template <class U> void S::f(); */
25461 }
25463 /* Parse an optional `::' token indicating that the following name is
25464 from the global namespace. If so, PARSER->SCOPE is set to the
25465 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
25466 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
25467 Returns the new value of PARSER->SCOPE, if the `::' token is
25468 present, and NULL_TREE otherwise. */
25470 static tree
25472 {
25475 /* Peek at the next token. */
25477 /* If we're looking at a `::' token then we're starting from the
25478 global namespace, not our current location. */
25480 {
25481 /* Consume the `::' token. */
25483 /* Set the SCOPE so that we know where to start the lookup. */
25489 }
25491 {
25495 }
25498 }
25500 /* Returns TRUE if the upcoming token sequence is the start of a
25501 constructor declarator. If FRIEND_P is true, the declarator is
25502 preceded by the `friend' specifier. */
25504 static bool
25506 {
25509 tree nested_name_specifier;
25512 /* The common case is that this is not a constructor declarator, so
25513 try to avoid doing lots of work if at all possible. It's not
25514 valid declare a constructor at function scope. */
25517 /* And only certain tokens can begin a constructor declarator. */
25525 /* Parse tentatively; we are going to roll back all of the tokens
25526 consumed here. */
25528 /* Assume that we are looking at a constructor declarator. */
25531 /* Look for the optional `::' operator. */
25534 /* Look for the nested-name-specifier. */
25535 nested_name_specifier
25546 /* Outside of a class-specifier, there must be a
25547 nested-name-specifier. */
25553 /* If we have a class scope, this is easy; DR 147 says that S::S always
25554 names the constructor, and no other qualified name could. */
25557 {
25567 }
25568 /* If we still think that this might be a constructor-declarator,
25569 look for a class-name. */
25571 {
25572 /* If we have:
25574 template <typename T> struct S {
25575 S();
25576 };
25578 we must recognize that the nested `S' names a class. */
25579 tree type_decl;
25583 none_type,
25587 /* If there was no class-name, then this is not a constructor.
25588 Otherwise, if we are in a class-specifier and we aren't
25589 handling a friend declaration, check that its type matches
25590 current_class_type (c++/38313). Note: error_mark_node
25591 is left alone for error recovery purposes. */
25593 && (outside_class_specifier_p
25598 /* If we're still considering a constructor, we have to see a `(',
25599 to begin the parameter-declaration-clause, followed by either a
25600 `)', an `...', or a decl-specifier. We need to check for a
25601 type-specifier to avoid being fooled into thinking that:
25603 S (f) (int);
25605 is a constructor. (It is actually a function named `f' that
25606 takes one parameter (of type `int') and returns a value of type
25607 `S'. */
25615 /* A parameter declaration begins with a decl-specifier,
25616 which is either the "attribute" keyword, a storage class
25617 specifier, or (usually) a type-specifier. */
25619 {
25620 tree type;
25624 /* Names appearing in the type-specifier should be looked up
25625 in the scope of the class. */
25628 else
25629 {
25632 {
25636 {
25639 }
25640 }
25642 }
25644 /* Inside the constructor parameter list, surrounding
25645 template-parameter-lists do not apply. */
25646 saved_num_template_parameter_lists
25650 /* Look for the type-specifier. */
25652 CP_PARSER_FLAGS_NONE,
25658 parser->num_template_parameter_lists
25661 /* Leave the scope of the class. */
25666 }
25667 }
25669 /* We did not really want to consume any tokens. */
25673 }
25675 /* Parse the definition of the function given by the DECL_SPECIFIERS,
25676 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
25677 they must be performed once we are in the scope of the function.
25679 Returns the function defined. */
25681 static tree
25682 cp_parser_function_definition_from_specifiers_and_declarator
25685 tree attributes,
25687 {
25688 tree fn;
25691 /* Begin the function-definition. */
25694 /* The things we're about to see are not directly qualified by any
25695 template headers we've seen thus far. */
25698 /* If there were names looked up in the decl-specifier-seq that we
25699 did not check, check them now. We must wait until we are in the
25700 scope of the function to perform the checks, since the function
25701 might be a friend. */
25705 {
25710 }
25713 {
25714 /* Skip the entire function. */
25717 }
25719 {
25720 /* Seen already, skip it. An error message has already been output. */
25724 /* If this is a function from a class, pop the nested class. */
25727 }
25728 else
25729 {
25730 timevar_id_t tv;
25733 else
25739 }
25742 }
25744 /* Parse the part of a function-definition that follows the
25745 declarator. INLINE_P is TRUE iff this function is an inline
25746 function defined within a class-specifier.
25748 Returns the function defined. */
25750 static tree
25753 {
25754 tree fn;
25760 bool fully_implicit_function_template_p
25763 tree implicit_template_parms
25766 cp_binding_level* implicit_template_scope
25772 /* If the next token is `return', then the code may be trying to
25773 make use of the "named return value" extension that G++ used to
25774 support. */
25777 {
25778 /* Consume the `return' keyword. */
25780 /* Look for the identifier that indicates what value is to be
25781 returned. */
25783 /* Issue an error message. */
25786 /* Skip tokens until we reach the start of the function body. */
25788 {
25795 }
25796 }
25797 /* The `extern' in `extern "C" void f () { ... }' does not apply to
25798 anything declared inside `f'. */
25799 saved_in_unbraced_linkage_specification_p
25802 /* Inside the function, surrounding template-parameter-lists do not
25803 apply. */
25804 saved_num_template_parameter_lists
25810 /* If the next token is `try', `__transaction_atomic', or
25811 `__transaction_relaxed`, then we are looking at either function-try-block
25812 or function-transaction-block. Note that all of these include the
25813 function-body. */
25816 RID_TRANSACTION_ATOMIC);
25818 RID_TRANSACTION_RELAXED))
25820 RID_TRANSACTION_RELAXED);
25823 else
25824 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
25829 /* Finish the function. */
25832 /* Generate code for it, if necessary. */
25834 /* Restore the saved values. */
25835 parser->in_unbraced_linkage_specification_p
25837 parser->num_template_parameter_lists
25841 parser->fully_implicit_function_template_p
25843 parser->implicit_template_parms
25845 parser->implicit_template_scope
25852 }
25854 /* Parse a template-declaration body (following argument list). */
25856 static void
25858 tree parameter_list,
25860 {
25864 /* We just processed one more parameter list. */
25867 /* Get the deferred access checks from the parameter list. These
25868 will be checked once we know what is being declared, as for a
25869 member template the checks must be performed in the scope of the
25870 class containing the member. */
25873 /* Tentatively parse for a new template parameter list, which can either be
25874 the template keyword or a template introduction. */
25880 else
25881 {
25882 /* There are no access checks when parsing a template, as we do not
25883 know if a specialization will be a friend. */
25887 checks,
25888 member_p,
25893 /* If this is a member template declaration, let the front
25894 end know. */
25896 {
25901 }
25906 }
25907 /* We are done with the current parameter list. */
25912 /* Finish up. */
25915 /* Check the template arguments for a literal operator template. */
25919 {
25923 else
25924 {
25927 {
25933 }
25935 {
25944 }
25945 else
25947 }
25949 {
25952 " Expected non-type template argument pack <char...>"
25954 decl);
25955 else
25958 decl);
25959 }
25960 }
25962 /* Register member declarations. */
25965 /* If DECL is a function template, we must return to parse it later.
25966 (Even though there is no definition, there might be default
25967 arguments that need handling.) */
25971 }
25973 /* Parse a template introduction header for a template-declaration. Returns
25974 false if tentative parse fails. */
25976 static bool
25978 {
25985 /* Look for the optional `::' operator. */
25988 /* Look for the nested-name-specifier. */
25998 /* Look up the concept for which we will be matching
25999 template parameters. */
26009 /* Look for opening brace for introduction. */
26017 /* Build vector of placeholder parameters and grab
26018 matching identifiers. */
26021 /* The introduction-list shall not be empty. */
26024 {
26027 }
26029 /* Look for closing brace for introduction. */
26034 {
26038 }
26040 /* Build and associate the constraint. */
26043 {
26045 member_p);
26047 }
26051 }
26053 /* Parse a normal template-declaration following the template keyword. */
26055 static void
26057 {
26058 tree parameter_list;
26062 /* Look for the `<' token. */
26066 {
26067 /* 14.5.2.2 [temp.mem]
26069 A local class shall not have member templates. */
26074 }
26075 /* [temp]
26077 A template ... shall not have C linkage. */
26079 {
26081 /* Give it C++ linkage to avoid confusing other parts of the
26082 front end. */
26085 }
26086 else
26089 /* We cannot perform access checks on the template parameter
26090 declarations until we know what is being declared, just as we
26091 cannot check the decl-specifier list. */
26094 /* If the next token is `>', then we have an invalid
26095 specialization. Rather than complain about an invalid template
26096 parameter, issue an error message here. */
26098 {
26102 }
26103 else
26104 {
26105 /* Parse the template parameters. */
26107 }
26109 /* Look for the `>'. */
26112 /* Manage template requirements */
26114 {
26119 }
26122 member_p);
26124 /* For the erroneous case of a template with C linkage, we pushed an
26125 implicit C++ linkage scope; exit that scope now. */
26128 }
26130 /* Parse a template-declaration, assuming that the `export' (and
26131 `extern') keywords, if present, has already been scanned. MEMBER_P
26132 is as for cp_parser_template_declaration. */
26134 static bool
26136 {
26138 {
26142 }
26147 }
26149 /* Perform the deferred access checks from a template-parameter-list.
26150 CHECKS is a TREE_LIST of access checks, as returned by
26151 get_deferred_access_checks. */
26153 static void
26154 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26155 {
26159 }
26161 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26162 `function-definition' sequence that follows a template header.
26163 If MEMBER_P is true, this declaration appears in a class scope.
26165 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26166 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26168 static tree
26174 {
26177 cp_decl_specifier_seq decl_specifiers;
26181 /* This function is only used when processing a template
26182 declaration. */
26186 /* Defer access checks until we know what is being declared. */
26189 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26190 alternative. */
26193 CP_PARSER_FLAGS_OPTIONAL,
26199 /* There are no template typedefs. */
26201 {
26205 }
26207 /* Gather up the access checks that occurred the
26208 decl-specifier-seq. */
26211 /* Check for the declaration of a template class. */
26213 {
26216 {
26217 // If this is a declaration, but not a definition, associate
26218 // any constraints with the type declaration. Constraints
26219 // are associated with definitions in cp_parser_class_specifier.
26225 /* In this case:
26227 struct C {
26228 friend template <typename T> struct A<T>::B;
26229 };
26231 A<T>::B will be represented by a TYPENAME_TYPE, and
26232 therefore not recognized by shadow_tag. */
26234 && !decl
26241 else
26244 /* Perform access checks for template parameters. */
26247 /* Give a helpful diagnostic for
26248 template <class T> struct A { } a;
26249 if we aren't already recovering from an error. */
26252 {
26254 "a class template declaration must not declare "
26258 }
26259 }
26260 }
26262 /* Complain about missing 'typename' or other invalid type names. */
26265 {
26266 /* cp_parser_parse_and_diagnose_invalid_type_name calls
26267 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
26268 the rest of this declaration. */
26271 }
26273 /* If it's not a template class, try for a template function. If
26274 the next token is a `;', then this declaration does not declare
26275 anything. But, if there were errors in the decl-specifiers, then
26276 the error might well have come from an attempted class-specifier.
26277 In that case, there's no need to warn about a missing declarator. */
26281 {
26284 checks,
26286 member_p,
26287 declares_class_or_enum,
26291 /* 7.1.1-1 [dcl.stc]
26293 A storage-class-specifier shall not be specified in an explicit
26294 specialization... */
26296 && explicit_specialization_p
26298 {
26302 }
26306 }
26308 /* Look for a trailing `;' after the declaration. */
26314 out:
26317 /* Clear any current qualification; whatever comes next is the start
26318 of something new. */
26324 }
26326 /* Parse a cast-expression that is not the operand of a unary "&". */
26328 static cp_expr
26330 {
26333 }
26335 /* Parse a functional cast to TYPE. Returns an expression
26336 representing the cast. */
26338 static cp_expr
26340 {
26342 tree expression_list;
26343 cp_expr cast;
26352 {
26361 tf_warning_or_error);
26362 /* Create a location of the form:
26363 type_name{i, f}
26364 ^~~~~~~~~~~~~~~
26365 with caret == start at the start of the type name,
26366 finishing at the closing brace. */
26367 location_t finish_loc
26370 finish_loc);
26373 }
26382 else
26383 {
26386 }
26389 tf_warning_or_error);
26390 /* [expr.const]/1: In an integral constant expression "only type
26391 conversions to integral or enumeration type can be used". */
26397 NIC_CONSTRUCTOR))
26400 /* Create a location of the form:
26401 float(i)
26402 ^~~~~~~~
26403 with caret == start at the start of the type name,
26404 finishing at the closing paren. */
26405 location_t finish_loc
26410 }
26412 /* Save the tokens that make up the body of a member function defined
26413 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
26414 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
26415 specifiers applied to the declaration. Returns the FUNCTION_DECL
26416 for the member function. */
26418 static tree
26422 tree attributes)
26423 {
26426 tree fn;
26429 /* Create the FUNCTION_DECL. */
26433 /* If something went badly wrong, bail out now. */
26435 {
26436 /* If there's a function-body, skip it. */
26441 }
26443 /* Remember it, if there default args to post process. */
26446 /* Save away the tokens that make up the body of the
26447 function. */
26453 RID_TRANSACTION_ATOMIC))
26454 {
26456 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
26463 {
26469 }
26470 else
26473 {
26477 }
26478 }
26480 /* Handle function try blocks. */
26482 {
26485 }
26486 /* We can have braced-init-list mem-initializers before the fn body. */
26488 {
26491 {
26492 /* cache_group will stop after an un-nested { } pair, too. */
26496 /* variadic mem-inits have ... after the ')'. */
26499 }
26500 }
26502 /* Handle function try blocks. */
26508 /* Save away the inline definition; we will process it when the
26509 class is complete. */
26513 /* We need to know that this was defined in the class, so that
26514 friend templates are handled correctly. */
26517 /* Add FN to the queue of functions to be parsed later. */
26521 }
26523 /* Save the tokens that make up the in-class initializer for a non-static
26524 data member. Returns a DEFAULT_ARG. */
26526 static tree
26528 {
26530 }
26532 /* Parse a template-argument-list, as well as the trailing ">" (but
26533 not the opening "<"). See cp_parser_template_argument_list for the
26534 return value. */
26536 static tree
26538 {
26539 tree arguments;
26540 tree saved_scope;
26541 tree saved_qualifying_scope;
26542 tree saved_object_scope;
26547 /* [temp.names]
26549 When parsing a template-id, the first non-nested `>' is taken as
26550 the end of the template-argument-list rather than a greater-than
26551 operator. */
26552 saved_greater_than_is_operator_p
26555 /* Parsing the argument list may modify SCOPE, so we save it
26556 here. */
26560 /* We need to evaluate the template arguments, even though this
26561 template-id may be nested within a "sizeof". */
26566 /* Parse the template-argument-list itself. */
26570 else
26572 /* Look for the `>' that ends the template-argument-list. If we find
26573 a '>>' instead, it's probably just a typo. */
26575 {
26577 {
26578 /* In C++0x, a `>>' in a template argument list or cast
26579 expression is considered to be two separate `>'
26580 tokens. So, change the current token to a `>', but don't
26581 consume it: it will be consumed later when the outer
26582 template argument list (or cast expression) is parsed.
26583 Note that this replacement of `>' for `>>' is necessary
26584 even if we are parsing tentatively: in the tentative
26585 case, after calling
26586 cp_parser_enclosed_template_argument_list we will always
26587 throw away all of the template arguments and the first
26588 closing `>', either because the template argument list
26589 was erroneous or because we are replacing those tokens
26590 with a CPP_TEMPLATE_ID token. The second `>' (which will
26591 not have been thrown away) is needed either to close an
26592 outer template argument list or to complete a new-style
26593 cast. */
26596 }
26598 {
26599 /* If we're in a nested template argument list, the '>>' has
26600 to be a typo for '> >'. We emit the error message, but we
26601 continue parsing and we push a '>' as next token, so that
26602 the argument list will be parsed correctly. Note that the
26603 global source location is still on the token before the
26604 '>>', so we need to say explicitly where we want it. */
26612 }
26613 else
26614 {
26615 /* If this is not a nested template argument list, the '>>'
26616 is a typo for '>'. Emit an error message and continue.
26617 Same deal about the token location, but here we can get it
26618 right by consuming the '>>' before issuing the diagnostic. */
26621 "spurious %<>>%>, use %<>%> to terminate "
26623 }
26624 }
26625 else
26627 /* The `>' token might be a greater-than operator again now. */
26628 parser->greater_than_is_operator_p
26630 /* Restore the SAVED_SCOPE. */
26638 }
26640 /* MEMBER_FUNCTION is a member function, or a friend. If default
26641 arguments, or the body of the function have not yet been parsed,
26642 parse them now. */
26644 static void
26646 {
26648 /* If this member is a template, get the underlying
26649 FUNCTION_DECL. */
26653 /* There should not be any class definitions in progress at this
26654 point; the bodies of members are only parsed outside of all class
26655 definitions. */
26657 /* While we're parsing the member functions we might encounter more
26658 classes. We want to handle them right away, but we don't want
26659 them getting mixed up with functions that are currently in the
26660 queue. */
26663 /* Make sure that any template parameters are in scope. */
26666 /* If the body of the function has not yet been parsed, parse it
26667 now. */
26669 {
26670 tree function_scope;
26673 /* The function is no longer pending; we are processing it. */
26678 /* If this is a local class, enter the scope of the containing
26679 function. */
26684 /* Push the body of the function onto the lexer stack. */
26687 /* Let the front end know that we going to be defining this
26688 function. */
26692 /* Don't do access checking if it is a templated function. */
26696 /* #pragma omp declare reduction needs special parsing. */
26698 {
26703 }
26704 else
26705 /* Now, parse the body of the function. */
26712 /* Leave the scope of the containing function. */
26716 }
26718 /* Remove any template parameters from the symbol table. */
26721 /* Restore the queue. */
26724 }
26726 /* If DECL contains any default args, remember it on the unparsed
26727 functions queue. */
26729 static void
26731 {
26732 tree probe;
26735 probe;
26738 {
26742 }
26743 }
26745 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
26746 which is either a FIELD_DECL or PARM_DECL. Parse it and return
26747 the result. For a PARM_DECL, PARMTYPE is the corresponding type
26748 from the parameter-type-list. */
26750 static tree
26753 {
26755 tree parsed_arg;
26761 /* Push the saved tokens for the default argument onto the parser's
26762 lexer stack. */
26768 /* Parse the default argument. */
26779 {
26780 /* In a non-template class, check conversions now. In a template,
26781 we'll wait and instantiate these as needed. */
26784 tf_warning_or_error);
26785 else
26787 }
26789 /* If the token stream has not been completely used up, then
26790 there was extra junk after the end of the default
26791 argument. */
26793 {
26796 else
26798 }
26800 /* Revert to the main lexer. */
26804 }
26806 /* FIELD is a non-static data member with an initializer which we saved for
26807 later; parse it now. */
26809 static void
26811 {
26812 tree def;
26819 NULL_TREE);
26825 }
26827 /* FN is a FUNCTION_DECL which may contains a parameter with an
26828 unparsed DEFAULT_ARG. Parse the default args now. This function
26829 assumes that the current scope is the scope in which the default
26830 argument should be processed. */
26832 static void
26834 {
26838 /* While we're parsing the default args, we might (due to the
26839 statement expression extension) encounter more classes. We want
26840 to handle them right away, but we don't want them getting mixed
26841 up with default args that are currently in the queue. */
26844 /* Local variable names (and the `this' keyword) may not appear
26845 in a default argument. */
26856 {
26858 tree parsed_arg;
26860 tree copy;
26867 /* This can happen for a friend declaration for a function
26868 already declared with default arguments. */
26871 parsed_arg
26873 default_arg,
26876 {
26878 }
26882 /* Update any instantiations we've already created. */
26886 }
26890 /* Make sure no default arg is missing. */
26893 /* Restore the state of local_variables_forbidden_p. */
26896 /* Restore the queue. */
26898 }
26900 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
26902 sizeof ... ( identifier )
26904 where the 'sizeof' token has already been consumed. */
26906 static tree
26908 {
26909 /* Consume the `...'. */
26916 else
26924 /* The name is not qualified. */
26943 }
26945 /* Parse the operand of `sizeof' (or a similar operator). Returns
26946 either a TYPE or an expression, depending on the form of the
26947 input. The KEYWORD indicates which kind of expression we have
26948 encountered. */
26950 static tree
26952 {
26959 /* If it's a `...', then we are computing the length of a parameter
26960 pack. */
26965 /* Types cannot be defined in a `sizeof' expression. Save away the
26966 old message. */
26968 /* And create the new one. */
26974 /* The restrictions on constant-expressions do not apply inside
26975 sizeof expressions. */
26976 saved_integral_constant_expression_p
26978 saved_non_integral_constant_expression_p
26982 /* Do not actually evaluate the expression. */
26985 /* If it's a `(', then we might be looking at the type-id
26986 construction. */
26988 {
26991 /* We can't be sure yet whether we're looking at a type-id or an
26992 expression. */
26994 /* Note: as a GNU Extension, compound literals are considered
26995 postfix-expressions as they are in C99, so they are valid
26996 arguments to sizeof. See comment in cp_parser_cast_expression
26997 for details. */
27000 else
27001 {
27004 /* Look for the type-id. */
27006 /* Look for the closing `)'. */
27009 }
27011 /* If all went well, then we're done. */
27013 {
27014 cp_decl_specifier_seq decl_specs;
27016 /* Build a trivial decl-specifier-seq. */
27020 /* Call grokdeclarator to figure out what type this is. */
27023 TYPENAME,
27026 }
27027 }
27029 /* If the type-id production did not work out, then we must be
27030 looking at the unary-expression production. */
27034 /* Go back to evaluating expressions. */
27038 /* Free the message we created. */
27040 /* And restore the old one. */
27042 parser->integral_constant_expression_p
27044 parser->non_integral_constant_expression_p
27048 }
27050 /* If the current declaration has no declarator, return true. */
27052 static bool
27054 {
27055 /* If the next token is a `;' or a `,' then there is no
27056 declarator. */
27059 }
27061 /* Update the DECL_SPECS to reflect the storage class indicated by
27062 KEYWORD. */
27064 static void
27069 {
27070 cp_storage_class storage_class;
27073 {
27077 }
27079 {
27082 }
27087 {
27090 }
27093 {
27111 }
27115 /* A storage class specifier cannot be applied alongside a typedef
27116 specifier. If there is a typedef specifier present then set
27117 conflicting_specifiers_p which will trigger an error later
27118 on in grokdeclarator. */
27121 }
27123 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27124 is true, the type is a class or enum definition. */
27126 static void
27128 tree type_spec,
27131 {
27134 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27135 (with, for example, in "typedef int wchar_t;") we remember that
27136 this is what happened. In system headers, we ignore these
27137 declarations so that G++ can work with system headers that are not
27138 C++-safe. */
27140 && !type_definition_p
27150 {
27153 ds_redefined_builtin_type_spec,
27154 token);
27156 {
27160 }
27161 }
27164 else
27165 {
27170 }
27171 }
27173 /* True iff TOKEN is the GNU keyword __thread. */
27175 static bool
27177 {
27180 }
27182 /* Set the location for a declarator specifier and check if it is
27183 duplicated.
27185 DECL_SPECS is the sequence of declarator specifiers onto which to
27186 set the location.
27188 DS is the single declarator specifier to set which location is to
27189 be set onto the existing sequence of declarators.
27191 LOCATION is the location for the declarator specifier to
27192 consider. */
27194 static void
27197 {
27206 {
27210 }
27211 else
27212 {
27214 {
27218 else
27219 {
27222 OPT_Wlong_long,
27224 }
27225 }
27227 {
27232 else
27234 }
27235 else
27236 {
27252 "__complex"
27253 };
27256 }
27257 }
27258 }
27260 /* Return true iff the declarator specifier DS is present in the
27261 sequence of declarator specifiers DECL_SPECS. */
27263 bool
27265 cp_decl_spec ds)
27266 {
27273 }
27275 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
27276 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
27278 static bool
27280 {
27282 }
27284 /* Issue an error message indicating that TOKEN_DESC was expected.
27285 If KEYWORD is true, it indicated this function is called by
27286 cp_parser_require_keword and the required token can only be
27287 a indicated keyword. */
27289 static void
27291 required_token token_desc,
27293 {
27295 {
27364 }
27366 {
27368 {
27447 }
27448 }
27449 else
27451 }
27455 /* If the next token is of the indicated TYPE, consume it. Otherwise,
27456 issue an error message indicating that TOKEN_DESC was expected.
27458 Returns the token consumed, if the token had the appropriate type.
27459 Otherwise, returns NULL. */
27464 required_token token_desc)
27465 {
27468 else
27469 {
27470 /* Output the MESSAGE -- unless we're parsing tentatively. */
27474 }
27475 }
27477 /* An error message is produced if the next token is not '>'.
27478 All further tokens are skipped until the desired token is
27479 found or '{', '}', ';' or an unbalanced ')' or ']'. */
27481 static void
27483 {
27484 /* Current level of '< ... >'. */
27486 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
27489 /* Are we ready, yet? If not, issue error message. */
27493 /* Skip tokens until the desired token is found. */
27495 {
27496 /* Peek at the next token. */
27498 {
27506 /* C++0x views the `>>' operator as two `>' tokens, but
27507 C++98 does not. */
27510 {
27511 /* We've hit a `>>' where the first `>' closes the
27512 template argument list, and the second `>' is
27513 spurious. Just consume the `>>' and stop; we've
27514 already produced at least one error. */
27517 }
27518 /* Fall through for C++0x, so we handle the second `>' in
27519 the `>>'. */
27524 {
27525 /* We've reached the token we want, consume it and stop. */
27528 }
27547 /* The '>' was probably forgotten, don't look further. */
27552 }
27554 /* Consume this token. */
27556 }
27557 }
27559 /* If the next token is the indicated keyword, consume it. Otherwise,
27560 issue an error message indicating that TOKEN_DESC was expected.
27562 Returns the token consumed, if the token had the appropriate type.
27563 Otherwise, returns NULL. */
27568 required_token token_desc)
27569 {
27573 {
27576 }
27579 }
27581 /* Returns TRUE iff TOKEN is a token that can begin the body of a
27582 function-definition. */
27584 static bool
27586 {
27589 /* A ctor-initializer begins with a `:'. */
27591 /* A function-try-block begins with `try'. */
27593 /* A function-transaction-block begins with `__transaction_atomic'
27594 or `__transaction_relaxed'. */
27597 /* The named return value extension begins with `return'. */
27599 }
27601 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
27602 definition. */
27604 static bool
27606 {
27613 }
27615 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
27616 C++0x) ending a template-argument. */
27618 static bool
27620 {
27628 }
27630 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
27631 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
27633 static bool
27636 {
27642 /* Check for the sequence `<::' in the original code. It would be lexed as
27643 `[:', where `[' is a digraph, and there is no whitespace before
27644 `:'. */
27646 {
27651 }
27653 }
27655 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
27656 or none_type otherwise. */
27658 static enum tag_types
27660 {
27662 {
27672 }
27673 }
27675 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
27676 or none_type otherwise or if the token is null. */
27678 static enum tag_types
27680 {
27685 {
27693 }
27694 }
27696 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
27698 static void
27700 {
27704 {
27708 type))
27711 }
27712 }
27714 /* Issue an error message if DECL is redeclared with different
27715 access than its original declaration [class.access.spec/3].
27716 This applies to nested classes, nested class templates and
27717 enumerations [class.mem/1]. */
27719 static void
27721 {
27732 }
27734 /* Look for the `template' keyword, as a syntactic disambiguator.
27735 Return TRUE iff it is present, in which case it will be
27736 consumed. */
27738 static bool
27740 {
27742 {
27743 /* In C++98 the `template' keyword can only be used within templates;
27744 outside templates the parser can always figure out what is a
27745 template and what is not. In C++11, per the resolution of DR 468,
27746 `template' is allowed in cases where it is not strictly necessary. */
27749 {
27752 "in C++98 %<template%> (as a disambiguator) is only "
27754 /* If this part of the token stream is rescanned, the same
27755 error message would be generated. So, we purge the token
27756 from the stream. */
27759 }
27760 else
27761 {
27762 /* Consume the `template' keyword. */
27765 }
27766 }
27768 }
27770 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
27771 set PARSER->SCOPE, and perform other related actions. */
27773 static void
27775 {
27778 /* Get the stored value. */
27780 /* Set the scope from the stored value. */
27784 }
27786 /* Consume tokens up through a non-nested END token. Returns TRUE if we
27787 encounter the end of a block before what we were looking for. */
27789 static bool
27793 {
27795 {
27798 /* Abort a parenthesized expression if we encounter a semicolon. */
27802 /* If we've reached the end of the file, stop. */
27808 /* We've hit the end of an enclosing block, so there's been some
27809 kind of syntax error. */
27812 /* Consume the token. */
27814 /* See if it starts a new group. */
27816 {
27818 /* In theory this should probably check end == '}', but
27819 cp_parser_save_member_function_body needs it to exit
27820 after either '}' or ')' when called with ')'. */
27823 }
27825 {
27829 }
27834 }
27835 }
27837 /* Like above, for caching a default argument or NSDMI. Both of these are
27838 terminated by a non-nested comma, but it can be unclear whether or not a
27839 comma is nested in a template argument list unless we do more parsing.
27840 In order to handle this ambiguity, when we encounter a ',' after a '<'
27841 we try to parse what follows as a parameter-declaration-list (in the
27842 case of a default argument) or a member-declarator (in the case of an
27843 NSDMI). If that succeeds, then we stop caching. */
27845 static tree
27847 {
27852 tree default_argument;
27854 /* Add tokens until we have processed the entire default
27855 argument. We add the range [first_token, token). */
27858 {
27859 /* For list-initialization, this is straightforward. */
27862 }
27864 {
27867 /* Peek at the next token. */
27869 /* What we do depends on what token we have. */
27871 {
27872 /* In valid code, a default argument must be
27873 immediately followed by a `,' `)', or `...'. */
27876 {
27877 /* If we've seen a '<', we might be in a
27878 template-argument-list. Until Core issue 325 is
27879 resolved, we don't know how this situation ought
27880 to be handled, so try to DTRT. We check whether
27881 what comes after the comma is a valid parameter
27882 declaration list. If it is, then the comma ends
27883 the default argument; otherwise the default
27884 argument continues. */
27888 /* Set ITALP so cp_parser_parameter_declaration_list
27889 doesn't decide to commit to this parse. */
27896 {
27897 /* Parse declarators until we reach a non-comma or
27898 somthing that cannot be an initializer.
27899 Just checking whether we're looking at a single
27900 declarator is insufficient. Consider:
27901 int var = tuple<T,U>::x;
27902 The template parameter 'U' looks exactly like a
27903 declarator. */
27904 do
27905 {
27916 }
27918 /* If we met an '=' or ';' then the original comma
27919 was the end of the NSDMI. Otherwise assume
27920 we're still in the NSDMI. */
27923 }
27924 else
27925 {
27930 }
27937 }
27938 /* FALLTHRU */
27941 /* If we run into a non-nested `;', `}', or `]',
27942 then the code is invalid -- but the default
27943 argument is certainly over. */
27948 /* Handle correctly int n = sizeof ... ( p ); */
27951 /* Update DEPTH, if necessary. */
27966 /* This might be the comparison operator, or it might
27967 start a template argument list. */
27974 /* Fall through for C++0x, which treats the `>>'
27975 operator like two `>' tokens in certain
27976 cases. */
27981 {
27982 /* This might be an operator, or it might close a
27983 template argument list. But if a previous '<'
27984 started a template argument list, this will have
27985 closed it, so we can't be in one anymore. */
27989 }
27992 /* If we run out of tokens, issue an error message. */
28000 /* In these cases, we should look for template-ids.
28001 For example, if the default argument is
28002 `X<int, double>()', we need to do name lookup to
28003 figure out whether or not `X' is a template; if
28004 so, the `,' does not end the default argument.
28006 That is not yet done. */
28011 }
28013 /* If we've reached the end, stop. */
28017 /* Add the token to the token block. */
28019 }
28021 /* Create a DEFAULT_ARG to represent the unparsed default
28022 argument. */
28029 }
28031 /* Begin parsing tentatively. We always save tokens while parsing
28032 tentatively so that if the tentative parsing fails we can restore the
28033 tokens. */
28035 static void
28037 {
28038 /* Enter a new parsing context. */
28040 /* Begin saving tokens. */
28042 /* In order to avoid repetitive access control error messages,
28043 access checks are queued up until we are no longer parsing
28044 tentatively. */
28046 }
28048 /* Commit to the currently active tentative parse. */
28050 static void
28052 {
28056 /* Mark all of the levels as committed. */
28059 {
28066 }
28067 }
28069 /* Commit to the topmost currently active tentative parse.
28071 Note that this function shouldn't be called when there are
28072 irreversible side-effects while in a tentative state. For
28073 example, we shouldn't create a permanent entry in the symbol
28074 table, or issue an error message that might not apply if the
28075 tentative parse is aborted. */
28077 static void
28079 {
28084 {
28092 }
28093 }
28095 /* Abort the currently active tentative parse. All consumed tokens
28096 will be rolled back, and no diagnostics will be issued. */
28098 static void
28100 {
28104 /* Now, pretend that we want to see if the construct was
28105 successfully parsed. */
28107 }
28109 /* Stop parsing tentatively. If a parse error has occurred, restore the
28110 token stream. Otherwise, commit to the tokens we have consumed.
28111 Returns true if no error occurred; false otherwise. */
28113 static bool
28115 {
28119 /* Remember whether or not an error occurred, since we are about to
28120 destroy that information. */
28122 /* Remove the topmost context from the stack. */
28125 /* If no parse errors occurred, commit to the tentative parse. */
28127 {
28128 /* Commit to the tokens read tentatively, unless that was
28129 already done. */
28134 }
28135 /* Otherwise, if errors occurred, roll back our state so that things
28136 are just as they were before we began the tentative parse. */
28137 else
28138 {
28141 }
28142 /* Add the context to the front of the free list. */
28147 }
28149 /* Returns true if we are parsing tentatively and are not committed to
28150 this tentative parse. */
28152 static bool
28154 {
28157 }
28159 /* Returns nonzero iff an error has occurred during the most recent
28160 tentative parse. */
28162 static bool
28164 {
28167 }
28169 /* Returns nonzero if GNU extensions are allowed. */
28171 static bool
28173 {
28175 }
28176 \f
28177 /* Objective-C++ Productions */
28180 /* Parse an Objective-C expression, which feeds into a primary-expression
28181 above.
28183 objc-expression:
28184 objc-message-expression
28185 objc-string-literal
28186 objc-encode-expression
28187 objc-protocol-expression
28188 objc-selector-expression
28190 Returns a tree representation of the expression. */
28192 static cp_expr
28194 {
28195 /* Try to figure out what kind of declaration is present. */
28199 {
28209 {
28221 }
28227 }
28230 }
28232 /* Parse an Objective-C message expression.
28234 objc-message-expression:
28235 [ objc-message-receiver objc-message-args ]
28237 Returns a representation of an Objective-C message. */
28239 static tree
28241 {
28253 /* Construct a location e.g.
28254 [self func1:5]
28255 ^~~~~~~~~~~~~~
28256 ranging from the '[' to the ']', with the caret at the start. */
28261 }
28263 /* Parse an objc-message-receiver.
28265 objc-message-receiver:
28266 expression
28267 simple-type-specifier
28269 Returns a representation of the type or expression. */
28271 static tree
28273 {
28274 tree rcv;
28276 /* An Objective-C message receiver may be either (1) a type
28277 or (2) an expression. */
28281 /* If that worked out, fine. */
28288 CP_PARSER_FLAGS_NONE);
28295 }
28297 /* Parse the arguments and selectors comprising an Objective-C message.
28299 objc-message-args:
28300 objc-selector
28301 objc-selector-args
28302 objc-selector-args , objc-comma-args
28304 objc-selector-args:
28305 objc-selector [opt] : assignment-expression
28306 objc-selector-args objc-selector [opt] : assignment-expression
28308 objc-comma-args:
28309 assignment-expression
28310 objc-comma-args , assignment-expression
28312 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
28313 selector arguments and TREE_VALUE containing a list of comma
28314 arguments. */
28316 static tree
28318 {
28324 {
28330 /* Detect if we have a unary selector. */
28339 sel_args
28344 }
28346 /* Handle non-selector arguments, if any. */
28348 {
28349 tree arg;
28354 addl_args
28359 }
28362 {
28365 }
28368 }
28370 /* Parse an Objective-C encode expression.
28372 objc-encode-expression:
28373 @encode objc-typename
28375 Returns an encoded representation of the type argument. */
28377 static cp_expr
28379 {
28380 tree type;
28391 {
28395 }
28397 /* This happens if we find @encode(T) (where T is a template
28398 typename or something dependent on a template typename) when
28399 parsing a template. In that case, we can't compile it
28400 immediately, but we rather create an AT_ENCODE_EXPR which will
28401 need to be instantiated when the template is used.
28402 */
28404 {
28408 }
28411 /* Build a location of the form:
28412 @encode(int)
28413 ^~~~~~~~~~~~
28414 with caret==start at the @ token, finishing at the close paren. */
28415 location_t combined_loc
28420 }
28422 /* Parse an Objective-C @defs expression. */
28424 static tree
28426 {
28427 tree name;
28435 }
28437 /* Parse an Objective-C protocol expression.
28439 objc-protocol-expression:
28440 @protocol ( identifier )
28442 Returns a representation of the protocol expression. */
28444 static tree
28446 {
28447 tree proto;
28455 /* Build a location of the form:
28456 @protocol(prot)
28457 ^~~~~~~~~~~~~~~
28458 with caret==start at the @ token, finishing at the close paren. */
28459 location_t combined_loc
28465 }
28467 /* Parse an Objective-C selector expression.
28469 objc-selector-expression:
28470 @selector ( objc-method-signature )
28472 objc-method-signature:
28473 objc-selector
28474 objc-selector-seq
28476 objc-selector-seq:
28477 objc-selector :
28478 objc-selector-seq objc-selector :
28480 Returns a representation of the method selector. */
28482 static tree
28484 {
28496 {
28505 {
28506 /* Detect if we have a unary selector. */
28508 {
28511 }
28512 else
28513 {
28515 }
28516 }
28521 {
28522 sel_seq
28525 sel_seq
28528 }
28529 else
28530 sel_seq
28535 }
28537 finish_selector:
28541 /* Build a location of the form:
28542 @selector(func)
28543 ^~~~~~~~~~~~~~~
28544 with caret==start at the @ token, finishing at the close paren. */
28545 location_t combined_loc
28549 /* TODO: objc_build_selector_expr doesn't always honor the location. */
28552 }
28554 /* Parse a list of identifiers.
28556 objc-identifier-list:
28557 identifier
28558 objc-identifier-list , identifier
28560 Returns a TREE_LIST of identifier nodes. */
28562 static tree
28564 {
28565 tree identifier;
28566 tree list;
28577 {
28584 identifier));
28586 }
28589 }
28591 /* Parse an Objective-C alias declaration.
28593 objc-alias-declaration:
28594 @compatibility_alias identifier identifier ;
28596 This function registers the alias mapping with the Objective-C front end.
28597 It returns nothing. */
28599 static void
28601 {
28609 }
28611 /* Parse an Objective-C class forward-declaration.
28613 objc-class-declaration:
28614 @class objc-identifier-list ;
28616 The function registers the forward declarations with the Objective-C
28617 front end. It returns nothing. */
28619 static void
28621 {
28624 {
28625 tree id;
28635 else
28637 }
28639 }
28641 /* Parse a list of Objective-C protocol references.
28643 objc-protocol-refs-opt:
28644 objc-protocol-refs [opt]
28646 objc-protocol-refs:
28647 < objc-identifier-list >
28649 Returns a TREE_LIST of identifiers, if any. */
28651 static tree
28653 {
28657 {
28661 }
28664 }
28666 /* Parse a Objective-C visibility specification. */
28668 static void
28670 {
28674 {
28689 }
28691 /* Eat '@private'/'@protected'/'@public'. */
28693 }
28695 /* Parse an Objective-C method type. Return 'true' if it is a class
28696 (+) method, and 'false' if it is an instance (-) method. */
28700 {
28703 else
28705 }
28707 /* Parse an Objective-C protocol qualifier. */
28709 static tree
28711 {
28724 {
28729 }
28732 }
28734 /* Parse an Objective-C typename. */
28736 static tree
28738 {
28742 {
28748 /* An ObjC type name may consist of just protocol qualifiers, in which
28749 case the type shall default to 'id'. */
28751 {
28754 /* If the type could not be parsed, an error has already
28755 been produced. For error recovery, behave as if it had
28756 not been specified, which will use the default type
28757 'id'. */
28759 {
28761 /* We need to skip to the closing parenthesis as
28762 cp_parser_type_id() does not seem to do it for
28763 us. */
28768 }
28769 }
28773 }
28776 }
28778 /* Check to see if TYPE refers to an Objective-C selector name. */
28780 static bool
28782 {
28788 }
28790 /* Parse an Objective-C selector. */
28792 static tree
28794 {
28798 {
28801 }
28803 /* C++ operator names are allowed to appear in ObjC selectors. */
28805 {
28818 }
28819 }
28821 /* Parse an Objective-C params list. */
28823 static tree
28825 {
28831 {
28841 /* Detect if we have a unary selector. */
28844 {
28847 }
28851 {
28852 /* Something went quite wrong. There should be a colon
28853 here, but there is not. Stop parsing parameters. */
28855 }
28857 /* New ObjC allows attributes on parameters too. */
28862 params
28865 type_name,
28866 identifier,
28867 parm_attr));
28870 }
28873 {
28876 }
28878 /* We allow tail attributes for the method. */
28880 {
28888 }
28891 {
28894 }
28896 }
28898 /* Parse the non-keyword Objective-C params. */
28900 static tree
28903 {
28909 {
28911 tree parm;
28917 {
28922 }
28924 /* TODO: parse attributes for tail parameters. */
28933 }
28935 /* We allow tail attributes for the method. */
28937 {
28939 {
28944 }
28945 else
28946 /* We have an error, but parse the attributes, so that we can
28947 carry on. */
28953 }
28956 }
28958 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
28960 static void
28962 {
28965 /* If the next token is `extern' and the following token is a string
28966 literal, then we have a linkage specification. */
28968 && cp_parser_is_pure_string_literal
28971 /* Handle #pragma, if any. */
28974 /* Allow stray semicolons. */
28977 /* Mark methods as optional or required, when building protocols. */
28979 {
28982 }
28984 {
28987 }
28990 /* Other stray characters must generate errors. */
28992 {
28996 }
28997 /* Finally, try to parse a block-declaration, or a function-definition. */
28998 else
29000 }
29002 /* Parse a method signature. */
29004 static tree
29006 {
29022 }
29024 static bool
29026 {
29027 tree tattr;
29032 /* If the attributes are followed by a method introducer, this is not allowed.
29033 Dump the attributes and flag the situation. */
29038 /* Otherwise, the attributes introduce some interstitial code, possibly so
29039 rewind to allow that check. */
29042 }
29044 /* Parse an Objective-C method prototype list. */
29046 static void
29048 {
29052 {
29054 {
29059 else
29063 {
29067 }
29070 }
29076 OPT_Wattributes,
29078 else
29079 /* Allow for interspersed non-ObjC++ code. */
29083 }
29087 else
29091 }
29093 /* Parse an Objective-C method definition list. */
29095 static void
29097 {
29101 {
29102 tree meth;
29105 {
29111 else
29116 {
29120 }
29122 NULL_TREE);
29124 /* For historical reasons, we accept an optional semicolon. */
29131 {
29138 }
29139 }
29140 /* The following case will be removed once @synthesize is
29141 completely implemented. */
29152 else
29153 /* Allow for interspersed non-ObjC++ code. */
29157 }
29161 else
29165 }
29167 /* Parse Objective-C ivars. */
29169 static void
29171 {
29182 {
29183 cp_decl_specifier_seq declspecs;
29185 tree prefix_attributes;
29193 CP_PARSER_FLAGS_OPTIONAL,
29197 /* auto, register, static, extern, mutable. */
29199 {
29202 }
29204 /* thread_local. */
29206 {
29209 }
29211 /* typedef. */
29213 {
29216 }
29221 /* Keep going until we hit the `;' at the end of the
29222 declaration. */
29224 {
29229 /* Check for a (possibly unnamed) bitfield declaration. */
29237 {
29238 /* Get the name of the bitfield. */
29241 sfk_none);
29243 eat_colon:
29245 /* Get the width of the bitfield. */
29246 width
29248 }
29249 else
29250 {
29251 /* Parse the declarator. */
29252 declarator
29258 }
29260 /* Look for attributes that apply to the ivar. */
29262 /* Remember which attributes are prefix attributes and
29263 which are not. */
29265 /* Combine the attributes. */
29269 /* Create the bitfield declaration. */
29271 width,
29272 attributes);
29273 else
29278 /* Add the instance variable. */
29282 /* Reset PREFIX_ATTRIBUTES. */
29291 {
29294 }
29296 }
29300 }
29305 /* Do not consume the RID_AT_END, so it will be read again as terminating
29306 the @interface of @implementation. */
29310 /* For historical reasons, we accept an optional semicolon. */
29313 }
29315 /* Parse an Objective-C protocol declaration. */
29317 static void
29319 {
29325 {
29330 }
29332 /* See if we have a forward declaration or a definition. */
29335 /* Try a forward declaration first. */
29337 {
29339 {
29340 tree id;
29350 else
29352 }
29354 }
29356 /* Ok, we got a full-fledged definition (or at least should). */
29357 else
29358 {
29363 }
29364 }
29366 /* Parse an Objective-C superclass or category. */
29368 static void
29373 {
29379 {
29382 }
29384 {
29387 /* If there is no category name, and this is an @interface, we
29388 have a class extension. */
29390 {
29393 }
29394 else
29398 }
29399 }
29401 /* Parse an Objective-C class interface. */
29403 static void
29405 {
29412 {
29413 /* It's hard to recover because even if valid @interface stuff
29414 is to follow, we can't compile it (or validate it) if we
29415 don't even know which class it refers to. Let's assume this
29416 was a stray '@interface' token in the stream and skip it.
29417 */
29419 }
29424 /* We have either a class or a category on our hands. */
29427 else
29428 {
29430 /* Handle instance variable declarations, if any. */
29433 }
29436 }
29438 /* Parse an Objective-C class implementation. */
29440 static void
29442 {
29449 {
29450 /* It's hard to recover because even if valid @implementation
29451 stuff is to follow, we can't compile it (or validate it) if
29452 we don't even know which class it refers to. Let's assume
29453 this was a stray '@implementation' token in the stream and
29454 skip it.
29455 */
29457 }
29461 /* We have either a class or a category on our hands. */
29464 else
29465 {
29467 /* Handle instance variable declarations, if any. */
29470 }
29473 }
29475 /* Consume the @end token and finish off the implementation. */
29477 static void
29479 {
29482 }
29484 /* Parse an Objective-C declaration. */
29486 static void
29488 {
29489 /* Try to figure out what kind of declaration is present. */
29494 {
29510 }
29513 {
29536 }
29537 }
29539 /* Parse an Objective-C try-catch-finally statement.
29541 objc-try-catch-finally-stmt:
29542 @try compound-statement objc-catch-clause-seq [opt]
29543 objc-finally-clause [opt]
29545 objc-catch-clause-seq:
29546 objc-catch-clause objc-catch-clause-seq [opt]
29548 objc-catch-clause:
29549 @catch ( objc-exception-declaration ) compound-statement
29551 objc-finally-clause:
29552 @finally compound-statement
29554 objc-exception-declaration:
29555 parameter-declaration
29556 '...'
29558 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
29560 Returns NULL_TREE.
29562 PS: This function is identical to c_parser_objc_try_catch_finally_statement
29563 for C. Keep them in sync. */
29565 static tree
29567 {
29568 location_t location;
29569 tree stmt;
29574 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
29575 node, lest it get absorbed into the surrounding block. */
29581 {
29590 {
29591 /* We have "@catch (...)" (where the '...' are literally
29592 what is in the code). Skip the '...'.
29593 parameter_declaration is set to NULL_TREE, and
29594 objc_being_catch_clauses() knows that that means
29595 '...'. */
29598 }
29599 else
29600 {
29601 /* We have "@catch (NSException *exception)" or something
29602 like that. Parse the parameter declaration. */
29606 else
29611 }
29614 else
29615 {
29616 /* If there was no open parenthesis, we are recovering from
29617 an error, and we are trying to figure out what mistake
29618 the user has made. */
29620 /* If there is an immediate closing parenthesis, the user
29621 probably forgot the opening one (ie, they typed "@catch
29622 NSException *e)". Parse the closing parenthesis and keep
29623 going. */
29627 /* If these is no immediate closing parenthesis, the user
29628 probably doesn't know that parenthesis are required at
29629 all (ie, they typed "@catch NSException *e"). So, just
29630 forget about the closing parenthesis and keep going. */
29631 }
29635 }
29637 {
29640 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
29641 node, lest it get absorbed into the surrounding block. */
29645 }
29648 }
29650 /* Parse an Objective-C synchronized statement.
29652 objc-synchronized-stmt:
29653 @synchronized ( expression ) compound-statement
29655 Returns NULL_TREE. */
29657 static tree
29659 {
29660 location_t location;
29671 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
29672 node, lest it get absorbed into the surrounding block. */
29677 }
29679 /* Parse an Objective-C throw statement.
29681 objc-throw-stmt:
29682 @throw assignment-expression [opt] ;
29684 Returns a constructed '@throw' statement. */
29686 static tree
29688 {
29700 }
29702 /* Parse an Objective-C statement. */
29704 static tree
29706 {
29707 /* Try to figure out what kind of declaration is present. */
29711 {
29722 }
29725 }
29727 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
29728 look ahead to see if an objc keyword follows the attributes. This
29729 is to detect the use of prefix attributes on ObjC @interface and
29730 @protocol. */
29732 static bool
29734 {
29739 {
29742 }
29745 }
29747 /* This routine is a minimal replacement for
29748 c_parser_struct_declaration () used when parsing the list of
29749 types/names or ObjC++ properties. For example, when parsing the
29750 code
29752 @property (readonly) int a, b, c;
29754 this function is responsible for parsing "int a, int b, int c" and
29755 returning the declarations as CHAIN of DECLs.
29757 TODO: Share this code with cp_parser_objc_class_ivars. It's very
29758 similar parsing. */
29759 static tree
29761 {
29763 cp_decl_specifier_seq declspecs;
29765 tree prefix_attributes;
29768 CP_PARSER_FLAGS_NONE,
29775 /* auto, register, static, extern, mutable. */
29777 {
29780 }
29782 /* thread_local. */
29784 {
29787 }
29789 /* typedef. */
29791 {
29794 }
29799 /* Keep going until we hit the `;' at the end of the declaration. */
29801 {
29806 /* Parse the declarator. */
29810 /* Look for attributes that apply to the ivar. */
29812 /* Remember which attributes are prefix attributes and
29813 which are not. */
29815 /* Combine the attributes. */
29825 /* Reset PREFIX_ATTRIBUTES. */
29836 {
29839 }
29840 else
29842 }
29844 }
29846 /* Parse an Objective-C @property declaration. The syntax is:
29848 objc-property-declaration:
29849 '@property' objc-property-attributes[opt] struct-declaration ;
29851 objc-property-attributes:
29852 '(' objc-property-attribute-list ')'
29854 objc-property-attribute-list:
29855 objc-property-attribute
29856 objc-property-attribute-list, objc-property-attribute
29858 objc-property-attribute
29859 'getter' = identifier
29860 'setter' = identifier
29861 'readonly'
29862 'readwrite'
29863 'assign'
29864 'retain'
29865 'copy'
29866 'nonatomic'
29868 For example:
29869 @property NSString *name;
29870 @property (readonly) id object;
29871 @property (retain, nonatomic, getter=getTheName) id name;
29872 @property int a, b, c;
29874 PS: This function is identical to
29875 c_parser_objc_at_property_declaration for C. Keep them in sync. */
29876 static void
29878 {
29879 /* The following variables hold the attributes of the properties as
29880 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
29881 seen. When we see an attribute, we set them to 'true' (if they
29882 are boolean properties) or to the identifier (if they have an
29883 argument, ie, for getter and setter). Note that here we only
29884 parse the list of attributes, check the syntax and accumulate the
29885 attributes that we find. objc_add_property_declaration() will
29886 then process the information. */
29896 /* 'properties' is the list of properties that we read. Usually a
29897 single one, but maybe more (eg, in "@property int a, b, c;" there
29898 are three). */
29899 tree properties;
29900 location_t loc;
29906 /* Parse the optional attribute list... */
29908 {
29909 /* Eat the '('. */
29913 {
29919 {
29922 }
29926 {
29937 {
29941 else
29946 }
29949 {
29953 }
29955 {
29957 {
29960 }
29961 else
29965 else
29967 }
29968 else
29969 {
29971 {
29974 }
29975 else
29977 }
29983 }
29990 else
29992 }
29994 /* FIXME: "@property (setter, assign);" will generate a spurious
29995 "error: expected ‘)’ before ‘,’ token". This is because
29996 cp_parser_require, unlike the C counterpart, will produce an
29997 error even if we are in error recovery. */
29999 {
30004 }
30005 }
30007 /* ... and the property declaration(s). */
30011 {
30013 /* If the next token is now a `;', consume it. */
30017 }
30021 else
30022 {
30023 /* Comma-separated properties are chained together in
30024 reverse order; add them one by one. */
30033 }
30036 }
30038 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30040 objc-synthesize-declaration:
30041 @synthesize objc-synthesize-identifier-list ;
30043 objc-synthesize-identifier-list:
30044 objc-synthesize-identifier
30045 objc-synthesize-identifier-list, objc-synthesize-identifier
30047 objc-synthesize-identifier
30048 identifier
30049 identifier = identifier
30051 For example:
30052 @synthesize MyProperty;
30053 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30055 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30056 for C. Keep them in sync.
30057 */
30058 static void
30060 {
30062 location_t loc;
30067 {
30071 {
30074 }
30076 {
30080 {
30083 }
30084 }
30085 else
30090 else
30092 }
30095 }
30097 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30099 objc-dynamic-declaration:
30100 @dynamic identifier-list ;
30102 For example:
30103 @dynamic MyProperty;
30104 @dynamic MyProperty, AnotherProperty;
30106 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30107 for C. Keep them in sync.
30108 */
30109 static void
30111 {
30113 location_t loc;
30118 {
30119 tree property;
30122 {
30125 }
30129 else
30131 }
30134 }
30136 \f
30137 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30139 /* Returns name of the next clause.
30140 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30141 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30142 returned and the token is consumed. */
30144 static pragma_omp_clause
30146 {
30162 {
30167 {
30350 }
30351 }
30357 }
30359 /* Validate that a clause of the given type does not already exist. */
30361 static void
30364 {
30365 tree c;
30369 {
30372 }
30373 }
30375 /* OpenMP 2.5:
30376 variable-list:
30377 identifier
30378 variable-list , identifier
30380 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
30381 colon). An opening parenthesis will have been consumed by the caller.
30383 If KIND is nonzero, create the appropriate node and install the decl
30384 in OMP_CLAUSE_DECL and add the node to the head of the list.
30386 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
30387 return the list created.
30389 COLON can be NULL if only closing parenthesis should end the list,
30390 or pointer to bool which will receive false if the list is terminated
30391 by closing parenthesis or true if the list is terminated by colon. */
30393 static tree
30396 {
30400 {
30403 }
30405 {
30410 && current_class_ptr
30412 {
30418 }
30419 else
30420 {
30433 }
30435 ;
30437 {
30439 {
30441 /* The OpenACC cache directive explicitly only allows "array
30442 elements or subarrays". */
30444 {
30448 }
30449 /* FALLTHROUGH. */
30454 {
30455 location_t loc
30460 decl
30464 }
30465 /* FALLTHROUGH. */
30469 {
30477 parser->colon_corrects_to_scope_p
30481 else
30482 {
30483 /* Look for `:'. */
30487 CPP_CLOSE_SQUARE))
30489 }
30490 /* Look for the closing `]'. */
30492 RT_CLOSE_SQUARE))
30496 }
30500 }
30506 }
30507 else
30510 get_comma:
30514 }
30520 {
30524 }
30527 {
30530 /* Try to resync to an unnested comma. Copied from
30531 cp_parser_parenthesized_expression_list. */
30532 skip_comma:
30541 }
30544 }
30546 /* Similarly, but expect leading and trailing parenthesis. This is a very
30547 common case for omp clauses. */
30549 static tree
30551 {
30555 }
30557 /* OpenACC 2.0:
30558 copy ( variable-list )
30559 copyin ( variable-list )
30560 copyout ( variable-list )
30561 create ( variable-list )
30562 delete ( variable-list )
30563 present ( variable-list )
30564 present_or_copy ( variable-list )
30565 pcopy ( variable-list )
30566 present_or_copyin ( variable-list )
30567 pcopyin ( variable-list )
30568 present_or_copyout ( variable-list )
30569 pcopyout ( variable-list )
30570 present_or_create ( variable-list )
30571 pcreate ( variable-list ) */
30573 static tree
30575 tree list)
30576 {
30579 {
30625 }
30633 }
30635 /* OpenACC 2.0:
30636 deviceptr ( variable-list ) */
30638 static tree
30640 {
30644 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
30645 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
30646 variable-list must only allow for pointer variables. */
30649 {
30656 }
30659 }
30661 /* OpenACC 2.0:
30662 auto
30663 independent
30664 nohost
30665 seq */
30667 static tree
30671 {
30676 }
30678 /* OpenACC:
30679 num_gangs ( expression )
30680 num_workers ( expression )
30681 vector_length ( expression ) */
30683 static tree
30686 {
30696 {
30701 }
30709 }
30711 /* OpenACC:
30713 gang [( gang-arg-list )]
30714 worker [( [num:] int-expr )]
30715 vector [( [length:] int-expr )]
30717 where gang-arg is one of:
30719 [num:] int-expr
30720 static: size-expr
30722 and size-expr may be:
30724 *
30725 int-expr
30726 */
30728 static tree
30731 {
30741 {
30744 do
30745 {
30749 /* Gang static argument. */
30752 {
30760 {
30763 }
30765 /* Check for the '*' argument. */
30769 CPP_CLOSE_PAREN)))
30770 {
30775 {
30778 }
30780 }
30781 }
30782 /* Worker num: argument and vector length: arguments. */
30786 {
30789 }
30791 /* Now collect the actual argument. */
30793 {
30796 }
30808 {
30811 }
30813 }
30818 }
30832 cleanup_error:
30835 }
30837 /* OpenACC 2.0:
30838 tile ( size-expr-list ) */
30840 static tree
30842 {
30851 do
30852 {
30856 {
30859 }
30860 else
30870 }
30873 /* Consume the trailing ')'. */
30881 }
30883 /* OpenACC 2.0
30884 Parse wait clause or directive parameters. */
30886 static tree
30888 {
30898 {
30903 }
30910 {
30914 {
30917 else
30918 {
30925 }
30926 }
30927 }
30930 }
30932 /* OpenACC:
30933 wait ( int-expr-list ) */
30935 static tree
30937 {
30946 }
30948 /* OpenMP 3.0:
30949 collapse ( constant-expression ) */
30951 static tree
30953 {
30955 location_t loc;
30956 HOST_WIDE_INT n;
30976 {
30979 }
30987 }
30989 /* OpenMP 2.5:
30990 default ( shared | none )
30992 OpenACC 2.0
30993 default (none) */
30995 static tree
30998 {
31000 tree c;
31005 {
31010 {
31025 }
31028 }
31029 else
31030 {
31031 invalid_kind:
31034 else
31036 }
31052 }
31054 /* OpenMP 3.1:
31055 final ( expression ) */
31057 static tree
31059 {
31080 }
31082 /* OpenMP 2.5:
31083 if ( expression )
31085 OpenMP 4.5:
31086 if ( directive-name-modifier : expression )
31088 directive-name-modifier:
31089 parallel | task | taskloop | target data | target | target update
31090 | target enter data | target exit data */
31092 static tree
31095 {
31103 {
31115 {
31118 {
31131 else
31132 {
31133 location_t loc
31138 }
31141 {
31143 {
31148 }
31150 {
31151 location_t loc
31155 }
31156 }
31157 }
31158 }
31160 {
31162 {
31165 }
31166 else
31167 {
31169 {
31170 location_t loc
31173 }
31175 }
31176 }
31177 }
31189 {
31192 {
31195 {
31205 }
31207 p);
31209 }
31211 {
31214 else
31217 }
31220 {
31224 }
31225 }
31233 }
31235 /* OpenMP 3.1:
31236 mergeable */
31238 static tree
31241 {
31242 tree c;
31245 location);
31250 }
31252 /* OpenMP 2.5:
31253 nowait */
31255 static tree
31258 {
31259 tree c;
31266 }
31268 /* OpenMP 2.5:
31269 num_threads ( expression ) */
31271 static tree
31273 location_t location)
31274 {
31296 }
31298 /* OpenMP 4.5:
31299 num_tasks ( expression ) */
31301 static tree
31303 location_t location)
31304 {
31326 }
31328 /* OpenMP 4.5:
31329 grainsize ( expression ) */
31331 static tree
31333 location_t location)
31334 {
31356 }
31358 /* OpenMP 4.5:
31359 priority ( expression ) */
31361 static tree
31363 location_t location)
31364 {
31386 }
31388 /* OpenMP 4.5:
31389 hint ( expression ) */
31391 static tree
31393 location_t location)
31394 {
31415 }
31417 /* OpenMP 4.5:
31418 defaultmap ( tofrom : scalar ) */
31420 static tree
31422 location_t location)
31423 {
31431 {
31434 }
31438 {
31441 }
31447 {
31450 }
31454 {
31457 }
31463 location);
31469 out_err:
31474 }
31476 /* OpenMP 2.5:
31477 ordered
31479 OpenMP 4.5:
31480 ordered ( constant-expression ) */
31482 static tree
31485 {
31487 HOST_WIDE_INT n;
31493 {
31510 {
31512 "ordered argument needs positive constant integer "
31515 }
31516 }
31522 }
31524 /* OpenMP 2.5:
31525 reduction ( reduction-operator : variable-list )
31527 reduction-operator:
31528 One of: + * - & ^ | && ||
31530 OpenMP 3.1:
31532 reduction-operator:
31533 One of: + * - & ^ | && || min max
31535 OpenMP 4.0:
31537 reduction-operator:
31538 One of: + * - & ^ | && ||
31539 id-expression */
31541 static tree
31543 {
31551 {
31561 }
31565 else
31566 {
31577 {
31607 }
31608 else
31609 {
31611 resync_fail:
31616 }
31617 }
31623 NULL);
31625 {
31628 }
31631 }
31633 /* OpenMP 2.5:
31634 schedule ( schedule-kind )
31635 schedule ( schedule-kind , expression )
31637 schedule-kind:
31638 static | dynamic | guided | runtime | auto
31640 OpenMP 4.5:
31641 schedule ( schedule-modifier : schedule-kind )
31642 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
31644 schedule-modifier:
31645 simd
31646 monotonic
31647 nonmonotonic */
31649 static tree
31651 {
31661 {
31670 else
31676 else
31677 {
31680 }
31681 }
31684 {
31689 {
31710 }
31711 }
31716 else
31722 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
31724 {
31728 }
31731 {
31746 else
31751 }
31763 invalid_kind:
31765 resync_fail:
31770 }
31772 /* OpenMP 3.0:
31773 untied */
31775 static tree
31778 {
31779 tree c;
31786 }
31788 /* OpenMP 4.0:
31789 inbranch
31790 notinbranch */
31792 static tree
31795 {
31800 }
31802 /* OpenMP 4.0:
31803 parallel
31804 for
31805 sections
31806 taskgroup */
31808 static tree
31812 {
31816 }
31818 /* OpenMP 4.5:
31819 nogroup */
31821 static tree
31824 {
31829 }
31831 /* OpenMP 4.5:
31832 simd
31833 threads */
31835 static tree
31839 {
31844 }
31846 /* OpenMP 4.0:
31847 num_teams ( expression ) */
31849 static tree
31851 location_t location)
31852 {
31874 }
31876 /* OpenMP 4.0:
31877 thread_limit ( expression ) */
31879 static tree
31881 location_t location)
31882 {
31904 }
31906 /* OpenMP 4.0:
31907 aligned ( variable-list )
31908 aligned ( variable-list : constant-expression ) */
31910 static tree
31912 {
31923 {
31933 }
31939 }
31941 /* OpenMP 4.0:
31942 linear ( variable-list )
31943 linear ( variable-list : expression )
31945 OpenMP 4.5:
31946 linear ( modifier ( variable-list ) )
31947 linear ( modifier ( variable-list ) : expression ) */
31949 static tree
31952 {
31962 {
31974 else
31976 }
31981 else
31982 {
31991 }
31994 {
31999 {
32010 {
32013 }
32016 }
32021 {
32024 }
32032 }
32035 {
32038 }
32041 }
32043 /* OpenMP 4.0:
32044 safelen ( constant-expression ) */
32046 static tree
32048 location_t location)
32049 {
32070 }
32072 /* OpenMP 4.0:
32073 simdlen ( constant-expression ) */
32075 static tree
32077 location_t location)
32078 {
32099 }
32101 /* OpenMP 4.5:
32102 vec:
32103 identifier [+/- integer]
32104 vec , identifier [+/- integer]
32105 */
32107 static tree
32109 tree list)
32110 {
32114 {
32117 }
32120 {
32127 else
32128 {
32129 t = cp_parser_lookup_name_simple
32134 id_loc);
32135 }
32141 {
32144 }
32148 {
32151 }
32155 {
32158 }
32161 add_to_vector:
32163 {
32167 }
32173 }
32176 {
32182 }
32184 }
32186 /* OpenMP 4.0:
32187 depend ( depend-kind : variable-list )
32189 depend-kind:
32190 in | out | inout
32192 OpenMP 4.5:
32193 depend ( source )
32195 depend ( sink : vec ) */
32197 static tree
32199 {
32207 {
32221 else
32223 }
32224 else
32230 {
32240 }
32247 else
32248 {
32254 }
32257 invalid_kind:
32259 resync_fail:
32264 }
32266 /* OpenMP 4.0:
32267 map ( map-kind : variable-list )
32268 map ( variable-list )
32270 map-kind:
32271 alloc | to | from | tofrom
32273 OpenMP 4.5:
32274 map-kind:
32275 alloc | to | from | tofrom | release | delete
32277 map ( always [,] map-kind: variable-list ) */
32279 static tree
32281 {
32290 {
32295 {
32298 nth++;
32304 {
32309 }
32310 }
32311 }
32315 {
32329 else
32330 {
32336 }
32339 }
32342 {
32346 }
32349 NULL);
32355 }
32357 /* OpenMP 4.0:
32358 device ( expression ) */
32360 static tree
32362 location_t location)
32363 {
32385 }
32387 /* OpenMP 4.0:
32388 dist_schedule ( static )
32389 dist_schedule ( static , expression ) */
32391 static tree
32393 location_t location)
32394 {
32407 {
32418 }
32423 location);
32427 invalid_kind:
32429 resync_fail:
32434 }
32436 /* OpenMP 4.0:
32437 proc_bind ( proc-bind-kind )
32439 proc-bind-kind:
32440 master | close | spread */
32442 static tree
32444 location_t location)
32445 {
32446 tree c;
32453 {
32463 else
32465 }
32466 else
32475 location);
32480 invalid_kind:
32482 resync_fail:
32487 }
32489 /* OpenACC:
32490 async [( int-expr )] */
32492 static tree
32494 {
32501 {
32510 }
32520 }
32522 /* Parse all OpenACC clauses. The set clauses allowed by the directive
32523 is a bitmask in MASK. Return the list of clauses found. */
32525 static tree
32529 {
32534 {
32535 location_t here;
32536 pragma_omp_clause c_kind;
32537 omp_clause_code code;
32548 {
32600 clauses);
32618 OMP_CLAUSE_INDEPENDENT,
32630 clauses);
32636 clauses);
32660 clauses);
32682 clauses);
32694 clauses);
32708 }
32713 {
32714 /* Remove the invalid clause(s) from the list to avoid
32715 confusing the rest of the compiler. */
32718 }
32719 }
32721 saw_error:
32728 }
32730 /* Parse all OpenMP clauses. The set clauses allowed by the directive
32731 is a bitmask in MASK. Return the list of clauses found; the result
32732 of clause default goes in *pdefault. */
32734 static tree
32738 {
32744 {
32745 pragma_omp_clause c_kind;
32756 {
32768 clauses);
32782 clauses);
32802 clauses);
32807 clauses);
32817 clauses);
32851 clauses);
32865 clauses);
32882 OMP_CLAUSE_NOTINBRANCH,
32891 {
32892 clause_not_first:
32896 }
32926 clauses);
32927 else
32937 clauses);
32955 {
32963 }
33006 clauses
33012 clauses
33024 }
33029 {
33030 /* Remove the invalid clause(s) from the list to avoid
33031 confusing the rest of the compiler. */
33034 }
33035 }
33036 saw_error:
33037 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
33038 no reason to skip to the end. */
33042 {
33045 else
33047 }
33049 }
33051 /* OpenMP 2.5:
33052 structured-block:
33053 statement
33055 In practice, we're also interested in adding the statement to an
33056 outer node. So it is convenient if we work around the fact that
33057 cp_parser_statement calls add_stmt. */
33059 static unsigned
33061 {
33064 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33065 This preserves the "not within loop or switch" style error messages
33066 for nonsense cases like
33067 void foo() {
33068 #pragma omp single
33069 break;
33070 }
33071 */
33076 }
33078 static void
33080 {
33082 }
33084 static tree
33086 {
33094 }
33096 /* OpenMP 2.5:
33097 # pragma omp atomic new-line
33098 expression-stmt
33100 expression-stmt:
33101 x binop= expr | x++ | ++x | x-- | --x
33102 binop:
33103 +, *, -, /, &, ^, |, <<, >>
33105 where x is an lvalue expression with scalar type.
33107 OpenMP 3.1:
33108 # pragma omp atomic new-line
33109 update-stmt
33111 # pragma omp atomic read new-line
33112 read-stmt
33114 # pragma omp atomic write new-line
33115 write-stmt
33117 # pragma omp atomic update new-line
33118 update-stmt
33120 # pragma omp atomic capture new-line
33121 capture-stmt
33123 # pragma omp atomic capture new-line
33124 capture-block
33126 read-stmt:
33127 v = x
33128 write-stmt:
33129 x = expr
33130 update-stmt:
33131 expression-stmt | x = x binop expr
33132 capture-stmt:
33133 v = expression-stmt
33134 capture-block:
33135 { v = x; update-stmt; } | { update-stmt; v = x; }
33137 OpenMP 4.0:
33138 update-stmt:
33139 expression-stmt | x = x binop expr | x = expr binop x
33140 capture-stmt:
33141 v = update-stmt
33142 capture-block:
33143 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33145 where x and v are lvalue expressions with scalar type. */
33147 static void
33149 {
33157 {
33162 {
33168 }
33169 }
33171 {
33183 else
33187 }
33189 {
33195 {
33200 {
33203 }
33204 }
33205 }
33209 {
33219 else
33224 {
33225 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
33226 opcode. */
33231 }
33235 {
33238 }
33239 else
33240 {
33246 }
33249 }
33251 restart:
33255 {
33262 /* FALLTHROUGH */
33272 /* FALLTHROUGH */
33287 /* Undo effects of boolean_increment for post {in,de}crement. */
33289 /* FALLTHRU */
33293 {
33294 /* Undo effects of boolean_increment. */
33296 {
33297 /* This is pre or post increment. */
33302 && !structured_block
33306 }
33307 }
33308 /* FALLTHRU */
33311 {
33346 {
33350 }
33353 {
33359 {
33364 }
33366 {
33378 {
33380 {
33385 }
33386 else
33388 }
33392 }
33395 {
33402 }
33406 }
33410 {
33413 {
33421 }
33423 {
33428 }
33463 }
33474 /* FALLTHROUGH */
33479 }
33486 }
33487 stmt_done:
33489 {
33500 }
33502 {
33505 }
33506 done:
33512 saw_error:
33515 {
33519 {
33523 }
33524 }
33525 }
33528 /* OpenMP 2.5:
33529 # pragma omp barrier new-line */
33531 static void
33533 {
33536 }
33538 /* OpenMP 2.5:
33539 # pragma omp critical [(name)] new-line
33540 structured-block
33542 OpenMP 4.5:
33543 # pragma omp critical [(name) [hint(expression)]] new-line
33544 structured-block */
33546 #define OMP_CRITICAL_CLAUSE_MASK \
33547 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
33549 static tree
33551 {
33555 {
33569 OMP_CRITICAL_CLAUSE_MASK,
33571 }
33572 else
33577 }
33579 /* OpenMP 2.5:
33580 # pragma omp flush flush-vars[opt] new-line
33582 flush-vars:
33583 ( variable-list ) */
33585 static void
33587 {
33593 }
33595 /* Helper function, to parse omp for increment expression. */
33597 static tree
33599 {
33604 {
33607 }
33610 {
33619 /* Fall through: OpenMP disallows NE_EXPR. */
33623 }
33625 /* If decl is an iterator, preserve LHS and RHS of the relational
33626 expr until finish_omp_for. */
33637 }
33639 /* Helper function, to parse omp for increment expression. */
33641 static tree
33643 {
33647 cp_id_kind idk;
33651 {
33660 }
33669 {
33674 }
33681 {
33685 }
33698 do
33699 {
33706 {
33708 {
33711 else
33713 tf_warning_or_error);
33714 }
33715 else
33718 }
33719 }
33723 {
33729 }
33730 else
33734 }
33736 /* Parse the initialization statement of either an OpenMP for loop or
33737 a Cilk Plus for loop.
33739 Return true if the resulting construct should have an
33740 OMP_CLAUSE_PRIVATE added to it. */
33742 static tree
33751 {
33757 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
33759 init-expr:
33760 var = lb
33761 integer-type var = lb
33762 random-access-iterator-type var = lb
33763 pointer-type var = lb
33764 */
33765 cp_decl_specifier_seq type_specifiers;
33767 /* First, try to parse as an initialized declaration. See
33768 cp_parser_condition, from whence the bulk of this is copied. */
33775 {
33776 /* If parsing a type specifier seq succeeded, then this
33777 MUST be a initialized declaration. */
33782 CP_PARSER_DECLARATOR_NAMED,
33793 else
33794 {
33804 {
33806 CPP_OPEN_PAREN))
33807 {
33811 else
33814 }
33815 else
33816 /* Trigger an error. */
33821 }
33825 {
33833 {
33836 auto_node);
33841 }
33844 asm_specification,
33845 LOOKUP_ONLYCONVERTING);
33848 {
33851 }
33852 else
33853 {
33856 {
33858 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
33860 {
33864 {
33868 }
33870 }
33872 {
33877 }
33878 }
33879 }
33881 }
33882 else
33883 {
33884 /* Consume '='. */
33888 non_class:
33891 else
33894 asm_specification,
33895 LOOKUP_ONLYCONVERTING);
33896 }
33900 }
33901 }
33902 else
33903 {
33904 cp_id_kind idk;
33905 /* If parsing a type specifier sequence failed, then
33906 this MUST be a simple expression. */
33915 && decl
33918 {
33929 {
33934 }
33939 }
33941 && decl
33944 {
33945 tree rhs;
33953 rhs,
33954 tf_warning_or_error));
33957 }
33958 else
33959 {
33964 {
33968 }
33969 }
33970 }
33972 }
33974 /* Parse the restricted form of the for statement allowed by OpenMP. */
33976 static tree
33979 {
33983 location_t loc_first;
33994 {
33997 }
34000 {
34006 }
34008 {
34011 {
34013 "%<linear%> clause may not be specified together "
34016 }
34017 else
34019 }
34032 {
34035 location_t loc;
34039 {
34042 }
34045 {
34048 }
34057 add_private_clause
34064 {
34067 {
34073 }
34074 else
34076 }
34083 {
34088 {
34092 }
34095 {
34096 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34100 {
34103 }
34104 else
34105 {
34108 }
34110 }
34111 else
34112 {
34117 }
34118 }
34121 {
34122 tree c;
34124 {
34133 decl);
34137 decl);
34138 }
34140 {
34145 else
34150 {
34153 /* For linear, signal that we need to fill up
34154 the so far unknown linear step. */
34157 }
34158 }
34159 }
34168 {
34169 /* If decl is an iterator, preserve the operator on decl
34170 until finish_omp_for. */
34172 && ((processing_template_decl
34177 else
34181 }
34193 {
34196 }
34201 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
34202 in between the collapsed for loops to be still considered perfectly
34203 nested. Hopefully the final version clarifies this.
34204 For now handle (multiple) {'s and empty statements. */
34206 do
34207 {
34211 {
34213 bracecount++;
34214 }
34218 else
34219 {
34226 }
34227 }
34231 {
34234 }
34235 }
34240 /* Note that we saved the original contents of this flag when we entered
34241 the structured block, and so we don't need to re-save it here. */
34244 else
34247 /* Note that the grammar doesn't call for a structured block here,
34248 though the loop as a whole is a structured block. */
34255 else
34260 {
34262 {
34264 nbraces--;
34265 }
34268 else
34269 {
34271 {
34274 }
34279 }
34280 }
34283 {
34287 else
34289 }
34293 }
34295 /* Helper function for OpenMP parsing, split clauses and call
34296 finish_omp_clauses on each of the set of clauses afterwards. */
34298 static void
34301 {
34307 }
34309 /* OpenMP 4.0:
34310 #pragma omp simd simd-clause[optseq] new-line
34311 for-loop */
34313 #define OMP_SIMD_CLAUSE_MASK \
34314 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
34315 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
34316 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34317 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
34318 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34319 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34320 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34321 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34323 static tree
34327 {
34338 {
34342 OMP_CLAUSE_ORDERED);
34344 {
34346 "%<ordered%> clause with parameter may not be specified "
34349 }
34350 }
34361 }
34363 /* OpenMP 2.5:
34364 #pragma omp for for-clause[optseq] new-line
34365 for-loop
34367 OpenMP 4.0:
34368 #pragma omp for simd for-simd-clause[optseq] new-line
34369 for-loop */
34371 #define OMP_FOR_CLAUSE_MASK \
34372 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34373 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34374 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34375 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34377 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
34378 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
34379 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34380 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34382 static tree
34386 {
34393 /* parallel for{, simd} disallows nowait clause, but for
34394 target {teams distribute ,}parallel for{, simd} it should be accepted. */
34397 /* Composite distribute parallel for{, simd} disallows ordered clause. */
34402 {
34407 {
34431 }
34432 }
34434 {
34437 }
34439 /* Composite distribute parallel for disallows linear clause. */
34446 {
34449 }
34460 }
34462 /* OpenMP 2.5:
34463 # pragma omp master new-line
34464 structured-block */
34466 static tree
34468 {
34472 }
34474 /* OpenMP 2.5:
34475 # pragma omp ordered new-line
34476 structured-block
34478 OpenMP 4.5:
34479 # pragma omp ordered ordered-clauses new-line
34480 structured-block */
34482 #define OMP_ORDERED_CLAUSE_MASK \
34483 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
34484 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
34486 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
34487 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
34489 static bool
34492 {
34496 {
34500 }
34503 {
34508 {
34510 {
34512 "%<depend%> clause may only be used in compound "
34516 }
34517 tree clauses
34519 OMP_ORDERED_DEPEND_CLAUSE_MASK,
34523 }
34524 }
34526 tree clauses
34532 }
34534 /* OpenMP 2.5:
34536 section-scope:
34537 { section-sequence }
34539 section-sequence:
34540 section-directive[opt] structured-block
34541 section-sequence section-directive structured-block */
34543 static tree
34545 {
34557 {
34561 }
34564 {
34572 {
34576 }
34578 {
34581 }
34586 }
34597 }
34599 /* OpenMP 2.5:
34600 # pragma omp sections sections-clause[optseq] newline
34601 sections-scope */
34603 #define OMP_SECTIONS_CLAUSE_MASK \
34604 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34605 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34606 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34607 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34608 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34610 static tree
34613 {
34625 {
34628 }
34635 }
34637 /* OpenMP 2.5:
34638 # pragma omp parallel parallel-clause[optseq] new-line
34639 structured-block
34640 # pragma omp parallel for parallel-for-clause[optseq] new-line
34641 structured-block
34642 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
34643 structured-block
34645 OpenMP 4.0:
34646 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
34647 structured-block */
34649 #define OMP_PARALLEL_CLAUSE_MASK \
34650 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34653 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34654 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34655 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
34656 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
34658 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
34660 static tree
34664 {
34671 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
34677 {
34685 if_p);
34689 if_p);
34692 block);
34697 }
34698 /* When combined with distribute, parallel has to be followed by for.
34699 #pragma omp target parallel is allowed though. */
34703 {
34707 }
34709 {
34712 }
34714 {
34718 {
34728 block);
34731 }
34732 }
34737 {
34740 }
34748 }
34750 /* OpenMP 2.5:
34751 # pragma omp single single-clause[optseq] new-line
34752 structured-block */
34754 #define OMP_SINGLE_CLAUSE_MASK \
34755 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
34758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34760 static tree
34762 {
34772 }
34774 /* OpenMP 3.0:
34775 # pragma omp task task-clause[optseq] new-line
34776 structured-block */
34778 #define OMP_TASK_CLAUSE_MASK \
34779 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34780 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
34781 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34782 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
34786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
34787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34788 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
34790 static tree
34792 {
34803 }
34805 /* OpenMP 3.0:
34806 # pragma omp taskwait new-line */
34808 static void
34810 {
34813 }
34815 /* OpenMP 3.1:
34816 # pragma omp taskyield new-line */
34818 static void
34820 {
34823 }
34825 /* OpenMP 4.0:
34826 # pragma omp taskgroup new-line
34827 structured-block */
34829 static tree
34831 {
34835 if_p));
34836 }
34839 /* OpenMP 2.5:
34840 # pragma omp threadprivate (variable-list) */
34842 static void
34844 {
34845 tree vars;
34851 }
34853 /* OpenMP 4.0:
34854 # pragma omp cancel cancel-clause[optseq] new-line */
34856 #define OMP_CANCEL_CLAUSE_MASK \
34857 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
34861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
34863 static void
34865 {
34869 }
34871 /* OpenMP 4.0:
34872 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
34874 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
34875 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34876 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34877 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
34880 static void
34883 {
34884 tree clauses;
34888 {
34893 {
34896 }
34897 }
34899 {
34903 }
34906 {
34909 "%<#pragma omp cancellation point%> may only be used in"
34911 else
34915 }
34918 OMP_CANCELLATION_POINT_CLAUSE_MASK,
34920 pragma_tok);
34922 }
34924 /* OpenMP 4.0:
34925 #pragma omp distribute distribute-clause[optseq] new-line
34926 for-loop */
34928 #define OMP_DISTRIBUTE_CLAUSE_MASK \
34929 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34930 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34931 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34932 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
34933 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34935 static tree
34939 {
34948 {
34956 else
34959 {
34965 {
34969 else
34972 }
34978 else
34992 }
34993 }
34995 {
34998 }
35003 {
35006 }
35017 }
35019 /* OpenMP 4.0:
35020 # pragma omp teams teams-clause[optseq] new-line
35021 structured-block */
35023 #define OMP_TEAMS_CLAUSE_MASK \
35024 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35025 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35026 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35032 static tree
35036 {
35045 {
35049 {
35073 }
35074 }
35076 {
35079 }
35084 {
35087 }
35095 }
35097 /* OpenMP 4.0:
35098 # pragma omp target data target-data-clause[optseq] new-line
35099 structured-block */
35101 #define OMP_TARGET_DATA_CLAUSE_MASK \
35102 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35103 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35104 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35105 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35107 static tree
35109 {
35110 tree clauses
35115 {
35118 {
35135 "%<#pragma omp target data%> with map-type other "
35136 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35140 }
35142 }
35145 {
35148 "%<#pragma omp target data%> must contain at least "
35151 }
35162 }
35164 /* OpenMP 4.5:
35165 # pragma omp target enter data target-enter-data-clause[optseq] new-line
35166 structured-block */
35168 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
35169 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35170 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35171 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35175 static tree
35178 {
35181 {
35186 {
35189 }
35190 }
35192 {
35196 }
35199 {
35201 "%<#pragma omp target enter data%> may only be "
35205 }
35207 tree clauses
35212 {
35215 {
35228 "%<#pragma omp target enter data%> with map-type other "
35232 }
35234 }
35237 {
35240 "%<#pragma omp target enter data%> must contain at least "
35243 }
35250 }
35252 /* OpenMP 4.5:
35253 # pragma omp target exit data target-enter-data-clause[optseq] new-line
35254 structured-block */
35256 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
35257 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35258 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35259 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35260 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35261 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35263 static tree
35266 {
35269 {
35274 {
35277 }
35278 }
35280 {
35284 }
35287 {
35289 "%<#pragma omp target exit data%> may only be "
35293 }
35295 tree clauses
35300 {
35303 {
35317 "%<#pragma omp target exit data%> with map-type other "
35318 "than %<from%>, %<release%> or %<delete%> on %<map%>"
35322 }
35324 }
35327 {
35330 "%<#pragma omp target exit data%> must contain at least "
35333 }
35340 }
35342 /* OpenMP 4.0:
35343 # pragma omp target update target-update-clause[optseq] new-line */
35345 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
35346 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
35347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35348 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35349 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35350 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35351 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35353 static bool
35356 {
35358 {
35360 "%<#pragma omp target update%> may only be "
35364 }
35366 tree clauses
35371 {
35373 "%<#pragma omp target update%> must contain at least one "
35376 }
35384 }
35386 /* OpenMP 4.0:
35387 # pragma omp target target-clause[optseq] new-line
35388 structured-block */
35390 #define OMP_TARGET_CLAUSE_MASK \
35391 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35396 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35397 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
35399 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
35401 static bool
35404 {
35408 {
35412 }
35415 {
35427 {
35435 {
35436 tree stmt;
35438 {
35441 OMP_TARGET_CLAUSE_MASK,
35446 OMP_TARGET_CLAUSE_MASK,
35451 OMP_TARGET_CLAUSE_MASK,
35456 }
35458 }
35463 {
35467 if_p);
35472 if_p);
35477 if_p);
35481 }
35487 {
35488 /* For combined target teams, ensure the num_teams and
35489 thread_limit clause expressions are evaluated on the host,
35490 before entering the target construct. */
35491 tree c;
35497 {
35506 OMP_CLAUSE_FIRSTPRIVATE);
35511 }
35512 }
35521 }
35523 {
35526 }
35528 {
35532 }
35534 {
35538 }
35540 {
35544 }
35546 {
35549 }
35550 }
35565 check_clauses:
35567 {
35570 {
35584 "%<#pragma omp target%> with map-type other "
35585 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35589 }
35591 }
35593 }
35595 /* OpenACC 2.0:
35596 # pragma acc cache (variable-list) new-line
35597 */
35599 static tree
35601 {
35616 }
35618 /* OpenACC 2.0:
35619 # pragma acc data oacc-data-clause[optseq] new-line
35620 structured-block */
35622 #define OACC_DATA_CLAUSE_MASK \
35623 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35624 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35625 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35627 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35628 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35629 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35630 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35631 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35632 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35633 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35635 static tree
35637 {
35650 }
35652 /* OpenACC 2.0:
35653 # pragma acc host_data <clauses> new-line
35654 structured-block */
35656 #define OACC_HOST_DATA_CLAUSE_MASK \
35657 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
35659 static tree
35661 {
35674 }
35676 /* OpenACC 2.0:
35677 # pragma acc declare oacc-data-clause[optseq] new-line
35678 */
35680 #define OACC_DECLARE_CLAUSE_MASK \
35681 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35682 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35686 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
35687 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
35688 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35689 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35690 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35691 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35694 static tree
35696 {
35705 {
35709 }
35712 {
35716 {
35720 }
35723 {
35735 {
35737 "%qD must be a global variable in"
35739 decl);
35742 }
35747 {
35751 }
35753 {
35755 "invalid use of %<extern%> variable %qD "
35759 }
35761 {
35763 "invalid use of %<global%> variable %qD "
35767 }
35769 }
35774 {
35779 }
35782 {
35783 tree id;
35787 else
35793 {
35796 {
35799 {
35803 }
35804 }
35805 }
35806 }
35807 }
35820 }
35822 /* OpenACC 2.0:
35823 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
35825 or
35827 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
35829 LOC is the location of the #pragma token.
35830 */
35832 #define OACC_ENTER_DATA_CLAUSE_MASK \
35833 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35841 #define OACC_EXIT_DATA_CLAUSE_MASK \
35842 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
35846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35848 static tree
35851 {
35856 {
35862 }
35867 {
35871 }
35878 else
35883 {
35887 }
35895 }
35897 /* OpenACC 2.0:
35898 # pragma acc loop oacc-loop-clause[optseq] new-line
35899 structured-block */
35901 #define OACC_LOOP_CLAUSE_MASK \
35902 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
35903 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35904 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35905 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
35906 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
35907 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
35908 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
35909 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
35910 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
35911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
35913 static tree
35916 {
35925 {
35931 }
35940 }
35942 /* OpenACC 2.0:
35943 # pragma acc kernels oacc-kernels-clause[optseq] new-line
35944 structured-block
35946 or
35948 # pragma acc parallel oacc-parallel-clause[optseq] new-line
35949 structured-block
35950 */
35952 #define OACC_KERNELS_CLAUSE_MASK \
35953 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35954 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35955 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35956 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35957 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35958 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35968 #define OACC_PARALLEL_CLAUSE_MASK \
35969 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35976 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
35977 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35978 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
35979 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
35980 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35981 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35982 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35983 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35984 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35985 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35986 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35987 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
35988 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35990 static tree
35993 {
35994 omp_clause_mask mask;
35997 {
36010 }
36013 {
36017 {
36020 tree clauses;
36022 if_p);
36024 }
36025 }
36034 }
36036 /* OpenACC 2.0:
36037 # pragma acc update oacc-update-clause[optseq] new-line
36038 */
36040 #define OACC_UPDATE_CLAUSE_MASK \
36041 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36042 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36043 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36044 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36048 static tree
36050 {
36057 {
36059 "%<#pragma acc update%> must contain at least one "
36062 }
36070 }
36072 /* OpenACC 2.0:
36073 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36075 LOC is the location of the #pragma token.
36076 */
36078 #define OACC_WAIT_CLAUSE_MASK \
36079 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36081 static tree
36083 {
36097 }
36099 /* OpenMP 4.0:
36100 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36102 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36103 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36104 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36105 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36106 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36107 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36108 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36110 static void
36113 {
36115 cp_omp_declare_simd_data data;
36117 {
36122 /* It is safe to take the address of a local variable; it will only be
36123 used while this scope is live. */
36125 }
36127 /* Store away all pragma tokens. */
36139 {
36143 {
36156 }
36161 "%<#pragma omp declare simd%> not immediately followed by "
36165 }
36166 }
36168 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
36169 This function is modelled similar to the late parsing of omp declare
36170 simd. */
36172 static tree
36174 {
36181 {
36183 "used in the same function marked as a Cilk Plus SIMD-enabled "
36189 }
36191 {
36195 }
36200 {
36207 NULL);
36221 }
36227 }
36229 /* Finalize #pragma omp declare simd clauses after direct declarator has
36230 been parsed, and put that into "omp declare simd" attribute. */
36232 static tree
36234 {
36240 {
36244 }
36249 {
36267 }
36271 }
36274 /* OpenMP 4.0:
36275 # pragma omp declare target new-line
36276 declarations and definitions
36277 # pragma omp end declare target new-line
36279 OpenMP 4.5:
36280 # pragma omp declare target ( extended-list ) new-line
36282 # pragma omp declare target declare-target-clauses[seq] new-line */
36284 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
36285 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
36288 static void
36290 {
36293 clauses
36297 {
36299 clauses);
36302 }
36303 else
36304 {
36308 }
36311 "%<#pragma omp declare target%> with clauses in between "
36312 "%<#pragma omp declare target%> without clauses and "
36315 {
36321 {
36324 }
36325 else
36328 {
36330 "%qD specified both in declare target %<link%> and %<to%>"
36333 }
36335 {
36339 {
36342 {
36346 }
36347 }
36348 }
36349 }
36350 }
36352 static void
36354 {
36357 {
36360 }
36362 {
36366 {
36369 }
36372 else
36373 {
36377 }
36378 }
36379 else
36380 {
36384 }
36388 "%<#pragma omp end declare target%> without corresponding "
36390 else
36392 }
36394 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
36395 expression and optional initializer clause of
36396 #pragma omp declare reduction. We store the expression(s) as
36397 either 3, 6 or 7 special statements inside of the artificial function's
36398 body. The first two statements are DECL_EXPRs for the artificial
36399 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
36400 expression that uses those variables.
36401 If there was any INITIALIZER clause, this is followed by further statements,
36402 the fourth and fifth statements are DECL_EXPRs for the artificial
36403 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
36404 constructor variant (first token after open paren is not omp_priv),
36405 then the sixth statement is a statement with the function call expression
36406 that uses the OMP_PRIV and optionally OMP_ORIG variable.
36407 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
36408 to initialize the OMP_PRIV artificial variable and there is seventh
36409 statement, a DECL_EXPR of the OMP_PRIV statement again. */
36411 static bool
36413 {
36425 tree combiner;
36440 {
36443 }
36446 {
36453 {
36456 }
36472 {
36476 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
36480 == CPP_CLOSE_PAREN
36483 {
36487 }
36492 }
36493 else
36494 {
36510 {
36515 }
36517 tree arg;
36530 }
36541 }
36547 }
36549 /* OpenMP 4.0
36550 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36551 initializer-clause[opt] new-line
36553 initializer-clause:
36554 initializer (omp_priv initializer)
36555 initializer (function-name (argument-list)) */
36557 static void
36560 {
36570 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
36577 {
36609 }
36621 /* Types may not be defined in declare reduction type list. */
36624 parser->type_definition_forbidden_message
36630 saved_colon_doesnt_start_class_def_p
36635 {
36639 ;
36660 else
36665 else
36667 }
36669 /* Restore the saved message. */
36672 parser->colon_doesnt_start_class_def_p
36677 {
36678 fail:
36681 }
36687 {
36688 tree fntype
36691 NULL_TREE);
36711 {
36716 }
36718 {
36720 {
36729 }
36736 }
36737 else
36738 {
36741 }
36744 else
36747 {
36750 }
36752 {
36755 else
36760 }
36765 else
36766 {
36775 }
36782 }
36786 done:
36787 /* Free any declarators allocated. */
36789 }
36791 /* OpenMP 4.0
36792 #pragma omp declare simd declare-simd-clauses[optseq] new-line
36793 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36794 initializer-clause[opt] new-line
36795 #pragma omp declare target new-line */
36797 static void
36800 {
36802 {
36807 {
36810 context);
36812 }
36815 {
36818 context);
36820 }
36822 {
36825 }
36827 {
36831 }
36832 }
36836 }
36838 /* OpenMP 4.5:
36839 #pragma omp taskloop taskloop-clause[optseq] new-line
36840 for-loop
36842 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
36843 for-loop */
36845 #define OMP_TASKLOOP_CLAUSE_MASK \
36846 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36848 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36850 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
36851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
36852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
36853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
36854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
36855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
36857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
36858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
36859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
36861 static tree
36865 {
36874 {
36879 {
36903 }
36904 }
36906 {
36909 }
36914 {
36917 }
36923 if_p);
36929 }
36932 /* OpenACC 2.0:
36933 # pragma acc routine oacc-routine-clause[optseq] new-line
36934 function-definition
36936 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
36937 */
36939 #define OACC_ROUTINE_CLAUSE_MASK \
36940 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36941 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36942 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36943 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
36946 /* Parse the OpenACC routine pragma. This has an optional '( name )'
36947 component, which must resolve to a declared namespace-scope
36948 function. The clauses are either processed directly (for a named
36949 function), or defered until the immediatley following declaration
36950 is parsed. */
36952 static void
36955 {
36957 /* The checking for "another pragma following this one" in the "no optional
36958 '( name )'" case makes sure that we dont re-enter. */
36961 cp_oacc_routine_data data;
36967 /* It is safe to take the address of a local variable; it will only be
36968 used while this scope is live. */
36971 /* Look for optional '( name )'. */
36973 {
36976 /* We parse the name as an id-expression. If it resolves to
36977 anything other than a non-overloaded function at namespace
36978 scope, it's an error. */
36992 {
36996 }
36998 data.clauses
37006 {
37011 }
37013 /* Perhaps we should use the same rule as declarations in different
37014 namespaces? */
37016 {
37021 }
37024 {
37028 }
37032 }
37034 {
37035 /* Store away all pragma tokens. */
37046 /* Emit a helpful diagnostic if there's another pragma following this
37047 one. */
37049 {
37052 /* ..., and then just keep going. */
37054 }
37056 /* We only have to consider the pragma_external case here. */
37061 else
37064 }
37065 }
37067 /* Finalize #pragma acc routine clauses after direct declarator has
37068 been parsed. */
37070 static tree
37072 {
37077 {
37079 "%<#pragma acc routine%> not immediately followed by "
37082 }
37099 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37100 fndecl_seen. */
37103 }
37105 /* Apply any saved OpenACC routine clauses to a just-parsed
37106 declaration. */
37108 static void
37110 {
37112 {
37113 /* Keep going if we're in error reporting mode. */
37119 {
37121 "%<#pragma acc routine%> not immediately followed by"
37125 }
37127 {
37130 }
37133 {
37138 }
37141 {
37147 }
37149 /* Process the routine's dimension clauses. */
37153 /* Add an "omp declare target" attribute. */
37158 /* Don't unset parser->oacc_routine here: we may still need it to
37159 diagnose wrong usage. But, remember that we've used this "#pragma acc
37160 routine". */
37162 }
37163 }
37165 /* Main entry point to OpenMP statement pragmas. */
37167 static void
37169 {
37170 tree stmt;
37175 {
37198 if_p);
37203 if_p);
37220 if_p);
37225 if_p);
37233 if_p);
37242 if_p);
37256 if_p);
37261 if_p);
37265 }
37268 }
37269 \f
37270 /* Transactional Memory parsing routines. */
37272 /* Parse a transaction attribute.
37274 txn-attribute:
37275 attribute
37276 [ [ identifier ] ]
37278 We use this instead of cp_parser_attributes_opt for transactions to avoid
37279 the pedwarn in C++98 mode. */
37281 static tree
37283 {
37298 {
37302 /* For keywords, use the canonical spelling,
37303 not the parsed identifier. */
37307 }
37308 else
37312 error1:
37315 }
37317 /* Parse a __transaction_atomic or __transaction_relaxed statement.
37319 transaction-statement:
37320 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
37321 compound-statement
37322 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
37323 */
37325 static tree
37327 {
37338 else
37339 {
37343 }
37345 /* Parse a noexcept specification. */
37349 {
37350 /* cancel-and-throw is unimplemented. */
37353 }
37354 else
37357 /* Keep track if we're in the lexical scope of an outer transaction. */
37369 }
37371 /* Parse a __transaction_atomic or __transaction_relaxed expression.
37373 transaction-expression:
37374 __transaction_atomic txn-noexcept-spec[opt] ( expression )
37375 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
37376 */
37378 static tree
37380 {
37393 keyword == RID_TRANSACTION_RELAXED
37407 /* Set this early. This might mean that we allow transaction_cancel in
37408 an expression that we find out later actually has to be a constexpr.
37409 However, we expect that cxx_constant_value will be able to deal with
37410 this; also, if the noexcept has no constexpr, then what we parse next
37411 really is a transaction's body. */
37414 /* Parse a noexcept specification. */
37420 {
37427 }
37428 else
37429 {
37430 /* The only expression that is available got parsed for the noexcept
37431 already. noexcept is true then. */
37434 }
37443 }
37445 /* Parse a function-transaction-block.
37447 function-transaction-block:
37448 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
37449 function-body
37450 __transaction_atomic txn-attribute[opt] function-try-block
37451 __transaction_relaxed ctor-initializer[opt] function-body
37452 __transaction_relaxed function-try-block
37453 */
37455 static bool
37457 {
37473 else
37474 {
37478 }
37486 else
37487 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
37495 }
37497 /* Parse a __transaction_cancel statement.
37499 cancel-statement:
37500 __transaction_cancel txn-attribute[opt] ;
37501 __transaction_cancel txn-attribute[opt] throw-expression ;
37503 ??? Cancel and throw is not yet implemented. */
37505 static tree
37507 {
37513 RT_TRANSACTION_CANCEL);
37520 /* ??? Parse cancel-and-throw here. */
37525 {
37529 }
37531 {
37535 }
37537 {
37540 {
37546 }
37547 }
37549 {
37553 }
37559 }
37560 \f
37561 /* The parser. */
37565 \f
37566 /* Special handling for the first token or line in the file. The first
37567 thing in the file might be #pragma GCC pch_preprocess, which loads a
37568 PCH file, which is a GC collection point. So we need to handle this
37569 first pragma without benefit of an existing lexer structure.
37571 Always returns one token to the caller in *FIRST_TOKEN. This is
37572 either the true first token of the file, or the first token after
37573 the initial pragma. */
37575 static void
37577 {
37586 {
37593 }
37594 else
37597 /* Skip to the end of the pragma. */
37601 /* Now actually load the PCH file. */
37605 /* Read one more token to return to our caller. We have to do this
37606 after reading the PCH file in, since its pointers have to be
37607 live. */
37609 }
37611 /* Parses the grainsize pragma for the _Cilk_for statement.
37612 Syntax:
37613 #pragma cilk grainsize = <VALUE>. */
37615 static void
37617 {
37619 {
37624 {
37627 }
37629 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
37632 else
37634 "%<#pragma cilk grainsize%> is not followed by "
37637 }
37639 }
37641 /* Normal parsing of a pragma token. Here we can (and must) use the
37642 regular lexer. */
37644 static bool
37646 {
37649 tree stmt;
37660 {
37668 {
37678 }
37683 {
37693 }
37698 {
37704 "%<#pragma omp taskwait%> may only be "
37709 }
37714 {
37720 "%<#pragma omp taskyield%> may only be "
37725 }
37730 {
37736 "%<#pragma omp cancel%> may only be "
37741 }
37762 {
37766 }
37819 "%<#pragma omp section%> may only be used in "
37824 {
37826 {
37830 }
37837 {
37840 }
37843 }
37847 {
37851 }
37859 {
37863 }
37865 /* Ignore the pragma if Cilk Plus is not enabled. */
37867 {
37870 }
37871 else
37872 {
37876 }
37883 bad_stmt:
37886 }
37890 }
37892 /* The interface the pragma parsers have to the lexer. */
37894 enum cpp_ttype
37896 {
37908 else
37909 {
37913 }
37916 }
37918 \f
37919 /* External interface. */
37921 /* Parse one entire translation unit. */
37923 void
37925 {
37938 }
37940 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
37941 vectorlength clause:
37942 Syntax:
37943 vectorlength ( constant-expression ) */
37945 static tree
37948 {
37950 tree expr;
37951 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
37952 safelen clause. Thus, vectorlength is represented as OMP 4.0
37953 safelen. For SIMD-enabled function it is represented by OMP 4.0
37954 simdlen. */
37957 loc);
37958 else
37960 loc);
37968 /* If expr == error_mark_node, then don't emit any errors nor
37969 create a clause. if any of the above functions returns
37970 error mark node then they would have emitted an error message. */
37972 ;
37980 else
37981 {
37982 tree c;
37984 {
37989 }
37990 else
37991 {
37996 }
37997 }
38002 }
38004 /* Handles the Cilk Plus #pragma simd linear clause.
38005 Syntax:
38006 linear ( simd-linear-variable-list )
38008 simd-linear-variable-list:
38009 simd-linear-variable
38010 simd-linear-variable-list , simd-linear-variable
38012 simd-linear-variable:
38013 id-expression
38014 id-expression : simd-linear-step
38016 simd-linear-step:
38017 conditional-expression */
38019 static tree
38021 {
38027 {
38031 }
38036 {
38039 {
38043 }
38050 {
38054 }
38055 else
38056 {
38060 /* If present, parse the linear step. Otherwise, assume the default
38061 value of 1. */
38063 {
38070 {
38071 /* If an error has occurred, then the whole pragma is
38072 considered ill-formed. Thus, no reason to keep
38073 parsing. */
38076 }
38084 else
38086 "step size must be an integer constant "
38088 }
38090 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
38096 }
38101 else
38102 {
38107 }
38108 }
38112 }
38114 /* Returns the name of the next clause. If the clause is not
38115 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
38116 token is not consumed. Otherwise, the appropriate enum from the
38117 pragma_simd_clause is returned and the token is consumed. */
38119 static pragma_omp_clause
38121 {
38122 pragma_omp_clause clause_type;
38139 else
38144 }
38146 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
38148 static tree
38150 {
38155 {
38156 pragma_omp_clause c_kind;
38163 /* Use the OpenMP 4.0 equivalent function. */
38166 /* Use the OpenMP 4.0 equivalent function. */
38168 clauses);
38170 /* Use the OMP 4.0 equivalent function. */
38172 clauses);
38174 /* Use the OMP 4.0 equivalent function. */
38176 else
38177 {
38181 }
38182 }
38188 else
38190 }
38192 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
38194 static void
38196 {
38203 {
38207 }
38216 }
38218 /* Main entry-point for parsing Cilk Plus _Cilk_for
38219 loops. The return value is error_mark_node
38220 when errors happen and CILK_FOR tree on success. */
38222 static tree
38224 {
38239 else
38245 }
38247 /* Create an identifier for a generic parameter type (a synthesized
38248 template parameter implied by `auto' or a concept identifier). */
38251 static tree
38253 {
38257 }
38259 /* Predicate that behaves as is_auto_or_concept but matches the parent
38260 node of the generic type rather than the generic type itself. This
38261 allows for type transformation in add_implicit_template_parms. */
38265 {
38267 }
38269 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38270 (creating a new template parameter list if necessary). Returns the newly
38271 created template type parm. */
38273 static tree
38275 {
38278 /* Before committing to modifying any scope, if we're in an
38279 implicit template scope, and we're trying to synthesize a
38280 constrained parameter, try to find a previous parameter with
38281 the same name. This is the same-type rule for abbreviated
38282 function templates.
38284 NOTE: We can generate implicit parameters when tentatively
38285 parsing a nested name specifier, only to reject that parse
38286 later. However, matching the same template-id as part of a
38287 direct-declarator should generate an identical template
38288 parameter, so this rule will merge them. */
38290 {
38293 {
38295 {
38298 /* Return the TEMPLATE_PARM_INDEX. */
38301 }
38303 }
38304 }
38306 /* We are either continuing a function template that already contains implicit
38307 template parameters, creating a new fully-implicit function template, or
38308 extending an existing explicit function template with implicit template
38309 parameters. */
38317 {
38321 }
38322 else
38323 {
38324 /* Roll back to the existing template parameter scope (in the case of
38325 extending an explicit function template) or introduce a new template
38326 parameter scope ahead of the function parameter scope (or class scope
38327 in the case of out-of-line member definitions). The function scope is
38328 added back after template parameter synthesis below. */
38333 {
38336 }
38338 {
38339 /* If not defining a class, then any class scope is a scope level in
38340 an out-of-line member definition. In this case simply wind back
38341 beyond the first such scope to inject the template parameter list.
38342 Otherwise wind back to the class being defined. The latter can
38343 occur in class member friend declarations such as:
38345 class A {
38346 void foo (auto);
38347 };
38348 class B {
38349 friend void A::foo (auto);
38350 };
38352 The template parameter list synthesized for the friend declaration
38353 must be injected in the scope of 'B'. This can also occur in
38354 erroneous cases such as:
38356 struct A {
38357 struct B {
38358 void foo (auto);
38359 };
38360 void B::foo (auto) {}
38361 };
38363 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38364 but, nevertheless, the template parameter list synthesized for the
38365 declarator should be injected into the scope of 'A' as if the
38366 ill-formed template was specified explicitly. */
38369 {
38372 }
38373 }
38379 {
38380 /* Introduce a new template parameter list for implicit template
38381 parameters. */
38385 parser->implicit_template_scope
38392 }
38393 else
38394 {
38395 /* Synthesize implicit template parameters at the end of the explicit
38396 template parameter list. */
38403 parser->implicit_template_parms
38405 }
38406 }
38408 /* Synthesize a new template parameter and track the current template
38409 parameter chain with implicit_template_parms. */
38413 tree synth_tmpl_parm;
38417 synth_tmpl_parm
38420 synth_tmpl_parm
38422 else
38423 {
38427 }
38429 // Attach the constraint to the parm before processing.
38432 tree new_parm
38434 input_location,
38435 node,
38439 // Chain the new parameter to the list of implicit parameters.
38441 parser->implicit_template_parms
38443 else
38448 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38451 /* If creating a fully implicit function template, start the new implicit
38452 template parameter list with this synthesized type, otherwise grow the
38453 current template parameter list. */
38456 {
38463 }
38464 else
38465 {
38470 }
38472 // If the new parameter was constrained, we need to add that to the
38473 // constraints in the template parameter list.
38475 {
38479 }
38484 }
38486 /* Finish the declaration of a fully implicit function template. Such a
38487 template has no explicit template parameter list so has not been through the
38488 normal template head and tail processing. synthesize_implicit_template_parm
38489 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
38490 provided if the declaration is a class member such that its template
38491 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
38492 form is returned. Otherwise NULL_TREE is returned. */
38494 static tree
38496 {
38501 {
38505 }
38515 }