| blob | ca9f8b9761a5aaf829f81f21e8166078466bd270 |
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_for_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_skip_to_closing_square_bracket
2648 /* Concept-related syntactic transformations */
2653 // -------------------------------------------------------------------------- //
2654 // Unevaluated Operand Guard
2655 //
2656 // Implementation of an RAII helper for unevaluated operand parsing.
2658 {
2661 }
2664 {
2667 }
2669 // -------------------------------------------------------------------------- //
2670 // Tentative Parsing
2672 /* Returns nonzero if we are parsing tentatively. */
2676 {
2678 }
2680 /* Returns nonzero if TOKEN is a string literal. */
2682 static bool
2684 {
2690 }
2692 /* Returns nonzero if TOKEN is a string literal
2693 of a user-defined string literal. */
2695 static bool
2697 {
2704 }
2706 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2708 static bool
2710 {
2712 }
2714 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2715 PRAGMA_NONE. */
2717 static enum pragma_kind
2719 {
2722 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2724 }
2726 /* Helper function for cp_parser_error.
2727 Having peeked a token of kind TOK1_KIND that might signify
2728 a conflict marker, peek successor tokens to determine
2729 if we actually do have a conflict marker.
2730 Specifically, we consider a run of 7 '<', '=' or '>' characters
2731 at the start of a line as a conflict marker.
2732 These come through the lexer as three pairs and a single,
2733 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2734 If it returns true, *OUT_LOC is written to with the location/range
2735 of the marker. */
2737 static bool
2740 {
2751 /* It must be at the start of the line. */
2756 /* We have a conflict marker. Construct a location of the form:
2757 <<<<<<<
2758 ^~~~~~~
2759 with start == caret, finishing at the end of the marker. */
2764 }
2766 /* If not parsing tentatively, issue a diagnostic of the form
2767 FILE:LINE: MESSAGE before TOKEN
2768 where TOKEN is the next token in the input stream. MESSAGE
2769 (specified by the caller) is usually of the form "expected
2770 OTHER-TOKEN". */
2772 static void
2774 {
2776 {
2778 /* This diagnostic makes more sense if it is tagged to the line
2779 of the token we just peeked at. */
2783 {
2788 }
2790 /* If this is actually a conflict marker, report it as such. */
2794 {
2795 location_t loc;
2797 {
2800 }
2801 }
2804 /* Because c_parser_error does not understand
2805 CPP_KEYWORD, keywords are treated like
2806 identifiers. */
2809 }
2810 }
2812 /* Issue an error about name-lookup failing. NAME is the
2813 IDENTIFIER_NODE DECL is the result of
2814 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2815 the thing that we hoped to find. */
2817 static void
2819 tree name,
2820 tree decl,
2821 name_lookup_error desired,
2822 location_t location)
2823 {
2824 /* If name lookup completely failed, tell the user that NAME was not
2825 declared. */
2827 {
2840 else
2842 }
2844 {
2846 {
2863 }
2864 }
2866 {
2868 {
2878 name);
2882 }
2883 }
2884 else
2885 {
2887 {
2900 }
2901 }
2902 }
2904 /* If we are parsing tentatively, remember that an error has occurred
2905 during this tentative parse. Returns true if the error was
2906 simulated; false if a message should be issued by the caller. */
2908 static bool
2910 {
2912 {
2915 }
2917 }
2919 /* This function is called when a type is defined. If type
2920 definitions are forbidden at this point, an error message is
2921 issued. */
2923 static bool
2925 {
2926 /* If types are forbidden here, issue a message. */
2928 {
2929 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2930 in the message need to be interpreted. */
2933 }
2935 }
2937 /* This function is called when the DECLARATOR is processed. The TYPE
2938 was a type defined in the decl-specifiers. If it is invalid to
2939 define a type in the decl-specifiers for DECLARATOR, an error is
2940 issued. TYPE_LOCATION is the location of TYPE and is used
2941 for error reporting. */
2943 static void
2946 {
2947 /* [dcl.fct] forbids type definitions in return types.
2948 Unfortunately, it's not easy to know whether or not we are
2949 processing a return type until after the fact. */
2957 {
2962 type);
2963 }
2964 }
2966 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2967 "<" in any valid C++ program. If the next token is indeed "<",
2968 issue a message warning the user about what appears to be an
2969 invalid attempt to form a template-id. LOCATION is the location
2970 of the type-specifier (TYPE) */
2972 static void
2974 tree type,
2976 location_t location)
2977 {
2981 {
2985 {
2988 else
2990 }
2991 else
2993 /* Remember the location of the invalid "<". */
2996 /* Consume the "<". */
2998 /* Parse the template arguments. */
3000 /* Permanently remove the invalid template arguments so that
3001 this error message is not issued again. */
3004 }
3005 }
3007 /* If parsing an integral constant-expression, issue an error message
3008 about the fact that THING appeared and return true. Otherwise,
3009 return false. In either case, set
3010 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3012 static bool
3014 non_integral_constant thing)
3015 {
3018 {
3020 {
3023 {
3030 "enumeration type cannot appear in a "
3121 }
3125 }
3126 }
3128 }
3130 /* Emit a diagnostic for an invalid type name. This function commits
3131 to the current active tentative parse, if any. (Otherwise, the
3132 problematic construct might be encountered again later, resulting
3133 in duplicate error messages.) LOCATION is the location of ID. */
3135 static void
3137 location_t location)
3138 {
3141 /* Try to lookup the identifier. */
3148 /* If the lookup was ambiguous, an error will already have
3149 been issued. */
3151 /* If the lookup found a template-name, it means that the user forgot
3152 to specify an argument list. Emit a useful error message. */
3154 {
3157 decl);
3159 }
3163 /* Something like 'unsigned A a;' */
3166 {
3167 /* Issue an error message. */
3172 {
3178 }
3179 else
3181 /* If we're in a template class, it's possible that the user was
3182 referring to a type from a base class. For example:
3184 template <typename T> struct A { typedef T X; };
3185 template <typename T> struct B : public A<T> { X x; };
3187 The user should have said "typename A<T>::X". */
3203 {
3204 tree b;
3207 b;
3209 {
3213 {
3214 tree field;
3215 /* Go from a particular instantiation of the
3216 template (which will have an empty TYPE_FIELDs),
3217 to the main version. */
3220 field;
3224 {
3229 }
3232 }
3233 }
3234 }
3235 }
3236 /* Here we diagnose qualified-ids where the scope is actually correct,
3237 but the identifier does not resolve to a valid type name. */
3239 {
3241 {
3246 else
3252 }
3255 {
3256 /* A<T>::A<T>() */
3262 }
3269 {
3274 else
3280 }
3281 else
3283 }
3284 }
3286 /* Check for a common situation where a type-name should be present,
3287 but is not, and issue a sensible error message. Returns true if an
3288 invalid type-name was detected.
3290 The situation handled by this function are variable declarations of the
3291 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3292 Usually, `ID' should name a type, but if we got here it means that it
3293 does not. We try to emit the best possible error message depending on
3294 how exactly the id-expression looks like. */
3296 static bool
3298 {
3299 tree id;
3302 /* Avoid duplicate error about ambiguous lookup. */
3304 {
3308 }
3317 /* If the next token is a (, this is a function with no explicit return
3318 type, i.e. constructor, destructor or conversion op. */
3321 {
3324 }
3328 /* Emit a diagnostic for the invalid type. */
3330 out:
3331 /* If we aren't in the middle of a declarator (i.e. in a
3332 parameter-declaration-clause), skip to the end of the declaration;
3333 there's no point in trying to process it. */
3337 }
3339 /* Consume tokens up to, and including, the next non-nested closing `)'.
3340 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3341 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3342 found an unnested token of that type. */
3344 static int
3347 cpp_ttype or_ttype,
3349 {
3359 {
3362 /* Have we found what we're looking for before the closing paren? */
3368 {
3371 /* If we've run out of tokens, then there is no closing `)'. */
3374 /* This is good for lambda expression capture-lists. */
3384 /* This matches the processing in skip_to_end_of_statement. */
3404 {
3408 }
3413 }
3415 /* Consume the token. */
3417 }
3418 }
3420 /* Consume tokens up to, and including, the next non-nested closing `)'.
3421 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3422 are doing error recovery. Returns -1 if OR_COMMA is true and we
3423 found an unnested token of that type. */
3425 static int
3430 {
3434 }
3436 /* Consume tokens until we reach the end of the current statement.
3437 Normally, that will be just before consuming a `;'. However, if a
3438 non-nested `}' comes first, then we stop before consuming that. */
3440 static void
3442 {
3445 /* Unwind generic function template scope if necessary. */
3450 {
3454 {
3457 /* If we've run out of tokens, stop. */
3461 /* If the next token is a `;', we have reached the end of the
3462 statement. */
3468 /* If this is a non-nested '}', stop before consuming it.
3469 That way, when confronted with something like:
3471 { 3 + }
3473 we stop before consuming the closing '}', even though we
3474 have not yet reached a `;'. */
3478 /* If it is the closing '}' for a block that we have
3479 scanned, stop -- but only after consuming the token.
3480 That way given:
3482 void f g () { ... }
3483 typedef int I;
3485 we will stop after the body of the erroneously declared
3486 function, but before consuming the following `typedef'
3487 declaration. */
3489 {
3492 }
3493 /* XXX Really fallthru? */
3494 /* FALLTHRU */
3502 }
3504 /* Consume the token. */
3506 }
3507 }
3509 /* This function is called at the end of a statement or declaration.
3510 If the next token is a semicolon, it is consumed; otherwise, error
3511 recovery is attempted. */
3513 static void
3515 {
3516 /* Look for the trailing `;'. */
3518 {
3519 /* If there is additional (erroneous) input, skip to the end of
3520 the statement. */
3522 /* If the next token is now a `;', consume it. */
3525 }
3526 }
3528 /* Skip tokens until we have consumed an entire block, or until we
3529 have consumed a non-nested `;'. */
3531 static void
3533 {
3536 /* Unwind generic function template scope if necessary. */
3541 {
3545 {
3548 /* If we've run out of tokens, stop. */
3552 /* Stop if this is an unnested ';'. */
3558 /* Stop if this is an unnested '}', or closes the outermost
3559 nesting level. */
3560 nesting_depth--;
3568 /* Nest. */
3569 nesting_depth++;
3574 }
3576 /* Consume the token. */
3578 }
3579 }
3581 /* Skip tokens until a non-nested closing curly brace is the next
3582 token, or there are no more tokens. Return true in the first case,
3583 false otherwise. */
3585 static bool
3587 {
3591 {
3595 {
3598 /* If we've run out of tokens, stop. */
3602 /* If the next token is a non-nested `}', then we have reached
3603 the end of the current block. */
3609 /* If it the next token is a `{', then we are entering a new
3610 block. Consume the entire block. */
3616 }
3618 /* Consume the token. */
3620 }
3621 }
3623 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3624 parameter is the PRAGMA token, allowing us to purge the entire pragma
3625 sequence. */
3627 static void
3629 {
3634 do
3638 /* Ensure that the pragma is not parsed again. */
3640 }
3642 /* Require pragma end of line, resyncing with it as necessary. The
3643 arguments are as for cp_parser_skip_to_pragma_eol. */
3645 static void
3647 {
3651 }
3653 /* This is a simple wrapper around make_typename_type. When the id is
3654 an unresolved identifier node, we can provide a superior diagnostic
3655 using cp_parser_diagnose_invalid_type_name. */
3657 static tree
3659 location_t id_location)
3660 {
3661 tree result;
3663 {
3669 }
3671 }
3673 /* This is a wrapper around the
3674 make_{pointer,ptrmem,reference}_declarator functions that decides
3675 which one to call based on the CODE and CLASS_TYPE arguments. The
3676 CODE argument should be one of the values returned by
3677 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3678 appertain to the pointer or reference. */
3682 cp_cv_quals cv_qualifiers,
3684 tree attributes)
3685 {
3692 else
3702 }
3704 /* Create a new C++ parser. */
3708 {
3713 /* cp_lexer_new_main is called before doing GC allocation because
3714 cp_lexer_new_main might load a PCH file. */
3717 /* Initialize the binops_by_token so that we can get the tree
3718 directly from the token. */
3726 /* For now, we always accept GNU extensions. */
3729 /* The `>' token is a greater-than operator, not the end of a
3730 template-id. */
3735 /* We are not parsing a constant-expression. */
3740 /* Local variable names are not forbidden. */
3743 /* We are not processing an `extern "C"' declaration. */
3746 /* We are not processing a declarator. */
3749 /* We are not processing a template-argument-list. */
3752 /* We are not in an iteration statement. */
3755 /* We are not in a switch statement. */
3758 /* We are not parsing a type-id inside an expression. */
3761 /* Declarations aren't implicitly extern "C". */
3764 /* String literals should be translated to the execution character set. */
3767 /* We are not parsing a function body. */
3770 /* We can correct until told otherwise. */
3773 /* The unparsed function queue is empty. */
3776 /* There are no classes being defined. */
3779 /* No template parameters apply. */
3782 /* Special parsing data structures. */
3787 /* Not declaring an implicit function template. */
3793 /* Allow constrained-type-specifiers. */
3797 }
3799 /* Create a cp_lexer structure which will emit the tokens in CACHE
3800 and push it onto the parser's lexer stack. This is used for delayed
3801 parsing of in-class method bodies and default arguments, and should
3802 not be confused with tentative parsing. */
3803 static void
3805 {
3810 /* Move the current source position to that of the first token in the
3811 new lexer. */
3813 }
3815 /* Pop the top lexer off the parser stack. This is never used for the
3816 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3817 static void
3819 {
3824 /* Put the current source position back where it was before this
3825 lexer was pushed. */
3827 }
3829 /* Lexical conventions [gram.lex] */
3831 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3832 identifier. */
3834 static cp_expr
3836 {
3839 /* Look for the identifier. */
3841 /* Return the value. */
3844 else
3846 }
3848 /* Parse a sequence of adjacent string constants. Returns a
3849 TREE_STRING representing the combined, nul-terminated string
3850 constant. If TRANSLATE is true, translate the string to the
3851 execution character set. If WIDE_OK is true, a wide string is
3852 invalid here.
3854 C++98 [lex.string] says that if a narrow string literal token is
3855 adjacent to a wide string literal token, the behavior is undefined.
3856 However, C99 6.4.5p4 says that this results in a wide string literal.
3857 We follow C99 here, for consistency with the C front end.
3859 This code is largely lifted from lex_string() in c-lex.c.
3861 FUTURE: ObjC++ will need to handle @-strings here. */
3862 static cp_expr
3865 {
3866 tree value;
3873 tree string_tree;
3879 {
3882 }
3887 {
3891 }
3892 else
3893 {
3896 }
3899 /* Try to avoid the overhead of creating and destroying an obstack
3900 for the common case of just one string. */
3903 {
3911 {
3915 }
3916 else
3920 }
3921 else
3922 {
3927 do
3928 {
3930 count++;
3935 {
3938 {
3941 }
3944 {
3949 }
3951 }
3952 else
3956 {
3960 {
3964 "unsupported non-standard concatenation "
3966 }
3967 }
3975 {
3979 }
3980 else
3981 {
3985 }
3986 }
3989 /* A string literal built by concatenation has its caret=start at
3990 the start of the initial string, and its finish at the finish of
3991 the final string literal. */
3995 }
3998 {
4001 }
4005 {
4010 {
4025 }
4030 {
4035 else
4037 }
4038 }
4039 else
4040 /* cpp_interpret_string has issued an error. */
4047 }
4049 /* Look up a literal operator with the name and the exact arguments. */
4051 static tree
4053 {
4060 {
4066 {
4069 {
4079 }
4082 /* May be this should be sufficient_parms_p instead,
4083 depending on how exactly should user-defined literals
4084 work in presence of default arguments on the literal
4085 operator parameters. */
4088 }
4089 }
4092 }
4094 /* Parse a user-defined char constant. Returns a call to a user-defined
4095 literal operator taking the character as an argument. */
4097 static cp_expr
4099 {
4107 /* Build up a call to the user-defined operator */
4108 /* Lookup the name we got back from the id-expression. */
4113 {
4118 }
4122 }
4124 /* A subroutine of cp_parser_userdef_numeric_literal to
4125 create a char... template parameter pack from a string node. */
4127 static tree
4129 {
4130 tree charvec;
4136 /* Fill in CHARVEC with all of the parameters. */
4141 /* Build the argument packs. */
4148 }
4150 /* A subroutine of cp_parser_userdef_numeric_literal to
4151 create a char... template parameter pack from a string node. */
4153 static tree
4155 {
4156 tree charvec;
4167 /* First template parm is character type. */
4170 /* Fill in CHARVEC with all of the parameters. */
4177 /* Build the argument packs. */
4184 }
4186 /* Parse a user-defined numeric constant. returns a call to a user-defined
4187 literal operator. */
4189 static cp_expr
4191 {
4202 /* Look for a literal operator taking the exact type of numeric argument
4203 as the literal value. */
4208 {
4210 tf_warning_or_error);
4213 {
4216 long_long_unsigned_type_node);
4217 }
4218 else
4219 {
4223 long_double_type_node);
4227 }
4231 }
4234 /* If the numeric argument didn't work, look for a raw literal
4235 operator taking a const char* argument consisting of the number
4236 in string format. */
4241 {
4243 tf_warning_or_error);
4246 }
4249 /* If the raw literal didn't work, look for a non-type template
4250 function with parameter pack char.... Call the function with
4251 template parameter characters representing the number. */
4255 {
4259 tf_warning_or_error);
4262 }
4271 }
4273 /* Parse a user-defined string constant. Returns a call to a user-defined
4274 literal operator taking a character pointer and the length of the string
4275 as arguments. */
4277 static tree
4279 {
4288 /* Build up a call to the user-defined operator. */
4289 /* Lookup the name we got back from the id-expression. */
4296 {
4298 tf_warning_or_error);
4301 }
4304 /* Look for a template function with typename parameter CharT
4305 and parameter pack CharT... Call the function with
4306 template parameter characters representing the string. */
4310 {
4314 tf_warning_or_error);
4317 }
4323 }
4326 /* Basic concepts [gram.basic] */
4328 /* Parse a translation-unit.
4330 translation-unit:
4331 declaration-seq [opt]
4333 Returns TRUE if all went well. */
4335 static bool
4337 {
4338 /* The address of the first non-permanent object on the declarator
4339 obstack. */
4344 /* Create the declarator obstack, if necessary. */
4346 {
4348 /* Create the error declarator. */
4350 /* Create the empty parameter list. */
4352 /* Remember where the base of the declarator obstack lies. */
4354 }
4358 /* If there are no tokens left then all went well. */
4360 {
4361 /* Get rid of the token array; we don't need it any more. */
4365 /* This file might have been a context that's implicitly extern
4366 "C". If so, pop the lang context. (Only relevant for PCH.) */
4368 {
4371 }
4373 /* Finish up. */
4377 }
4378 else
4379 {
4382 }
4384 /* Make sure the declarator obstack was fully cleaned up. */
4388 /* All went well. */
4390 }
4392 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4393 decltype context. */
4397 {
4402 }
4404 /* We're about to parse a collection of statements. If we're currently
4405 parsing tentatively, set up a firewall so that any nested
4406 cp_parser_commit_to_tentative_parse won't affect the current context. */
4408 static cp_token_position
4410 {
4417 }
4419 /* We've finished parsing the collection of statements. Wrap up the
4420 firewall and replace the relevant tokens with the parsed form. */
4422 static void
4424 tree expr)
4425 {
4429 /* Finish the firewall level. */
4431 /* And remember the result of the parse for when we try again. */
4437 }
4439 /* Like the above functions, but let the user modify the tokens. Used by
4440 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4441 later parses, so it makes sense to localize the effects of
4442 cp_parser_commit_to_tentative_parse. */
4444 struct tentative_firewall
4445 {
4450 {
4451 /* If we're currently parsing tentatively, start a committed level as a
4452 firewall and then an inner tentative parse. */
4454 {
4458 }
4459 }
4462 {
4464 {
4465 /* Finish the inner tentative parse and the firewall, propagating any
4466 uncommitted error state to the outer tentative parse. */
4472 }
4473 }
4474 };
4476 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4477 enclosing parentheses. */
4479 static cp_expr
4481 {
4484 /* Consume the '('. */
4487 /* Start the statement-expression. */
4489 /* Parse the compound-statement. */
4491 /* Finish up. */
4493 /* Consume the ')'. */
4501 }
4503 /* Expressions [gram.expr] */
4505 /* Parse a fold-operator.
4507 fold-operator:
4508 - * / % ^ & | = < > << >>
4509 = -= *= /= %= ^= &= |= <<= >>=
4510 == != <= >= && || , .* ->*
4512 This returns the tree code corresponding to the matched operator
4513 as an int. When the current token matches a compound assignment
4514 opertor, the resulting tree code is the negative value of the
4515 non-assignment operator. */
4517 static int
4519 {
4521 {
4561 }
4562 }
4564 /* Returns true if CODE indicates a binary expression, which is not allowed in
4565 the LHS of a fold-expression. More codes will need to be added to use this
4566 function in other contexts. */
4568 static bool
4570 {
4572 {
4605 }
4606 }
4608 /* If the next token is a suitable fold operator, consume it and return as
4609 the function above. */
4611 static int
4613 {
4619 }
4621 /* Parse a fold-expression.
4623 fold-expression:
4624 ( ... folding-operator cast-expression)
4625 ( cast-expression folding-operator ... )
4626 ( cast-expression folding operator ... folding-operator cast-expression)
4628 Note that the '(' and ')' are matched in primary expression. */
4630 static cp_expr
4632 {
4633 cp_id_kind pidk;
4635 // Left fold.
4637 {
4641 {
4644 }
4651 }
4656 {
4659 }
4662 {
4665 }
4668 /* The operands of a fold-expression are cast-expressions, so binary or
4669 conditional expressions are not allowed. We check this here to avoid
4670 tentative parsing. */
4678 // Right fold.
4683 {
4686 }
4689 // Binary left or right fold.
4694 }
4696 /* Parse a primary-expression.
4698 primary-expression:
4699 literal
4700 this
4701 ( expression )
4702 id-expression
4703 lambda-expression (C++11)
4705 GNU Extensions:
4707 primary-expression:
4708 ( compound-statement )
4709 __builtin_va_arg ( assignment-expression , type-id )
4710 __builtin_offsetof ( type-id , offsetof-expression )
4712 C++ Extensions:
4713 __has_nothrow_assign ( type-id )
4714 __has_nothrow_constructor ( type-id )
4715 __has_nothrow_copy ( type-id )
4716 __has_trivial_assign ( type-id )
4717 __has_trivial_constructor ( type-id )
4718 __has_trivial_copy ( type-id )
4719 __has_trivial_destructor ( type-id )
4720 __has_virtual_destructor ( type-id )
4721 __is_abstract ( type-id )
4722 __is_base_of ( type-id , type-id )
4723 __is_class ( type-id )
4724 __is_empty ( type-id )
4725 __is_enum ( type-id )
4726 __is_final ( type-id )
4727 __is_literal_type ( type-id )
4728 __is_pod ( type-id )
4729 __is_polymorphic ( type-id )
4730 __is_std_layout ( type-id )
4731 __is_trivial ( type-id )
4732 __is_union ( type-id )
4734 Objective-C++ Extension:
4736 primary-expression:
4737 objc-expression
4739 literal:
4740 __null
4742 ADDRESS_P is true iff this expression was immediately preceded by
4743 "&" and therefore might denote a pointer-to-member. CAST_P is true
4744 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4745 true iff this expression is a template argument.
4747 Returns a representation of the expression. Upon return, *IDK
4748 indicates what kind of id-expression (if any) was present. */
4750 static cp_expr
4757 {
4760 /* Assume the primary expression is not an id-expression. */
4763 /* Peek at the next token. */
4766 {
4767 /* literal:
4768 integer-literal
4769 character-literal
4770 floating-literal
4771 string-literal
4772 boolean-literal
4773 pointer-literal
4774 user-defined-literal */
4786 {
4790 }
4791 /* Floating-point literals are only allowed in an integral
4792 constant expression if they are cast to an integral or
4793 enumeration type. */
4797 {
4798 /* CAST_P will be set even in invalid code like "int(2.7 +
4799 ...)". Therefore, we have to check that the next token
4800 is sure to end the cast. */
4802 {
4807 enumerator-definition. */
4809 /* The curly brace at the end of an enum-specifier. */
4811 /* The end of a statement. */
4813 /* The end of the cast-expression. */
4815 /* The end of an array bound. */
4817 /* The closing ">" in a template-argument-list. */
4820 /* C++0x only: A ">>" treated like two ">" tokens,
4821 in a template-argument-list. */
4826 }
4828 /* If we are within a cast, then the constraint that the
4829 cast is to an integral or enumeration type will be
4830 checked at that point. If we are not within a cast, then
4831 this code is invalid. */
4834 }
4854 /* ??? Should wide strings be allowed when parser->translate_strings_p
4855 is false (i.e. in attributes)? If not, we can kill the third
4856 argument to cp_parser_string_literal. */
4862 /* If we see `( { ' then we are looking at the beginning of
4863 a GNU statement-expression. */
4866 {
4867 /* Statement-expressions are not allowed by the standard. */
4871 /* And they're not allowed outside of a function-body; you
4872 cannot, for example, write:
4874 int i = ({ int j = 3; j + 1; });
4876 at class or namespace scope. */
4879 {
4881 "statement-expressions are not allowed outside "
4887 }
4888 else
4890 }
4891 /* Otherwise it's a normal parenthesized expression. */
4892 {
4893 cp_expr expr;
4898 /* Consume the `('. */
4900 /* Within a parenthesized expression, a `>' token is always
4901 the greater-than operator. */
4902 saved_greater_than_is_operator_p
4907 /* Left fold expression. */
4909 else
4910 /* Parse the parenthesized expression. */
4915 {
4922 }
4923 else
4924 /* Let the front end know that this expression was
4925 enclosed in parentheses. This matters in case, for
4926 example, the expression is of the form `A::B', since
4927 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4928 not. */
4931 /* DR 705: Wrapping an unqualified name in parentheses
4932 suppresses arg-dependent lookup. We want to pass back
4933 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4934 (c++/37862), but none of the others. */
4938 /* The `>' token might be the end of a template-id or
4939 template-parameter-list now. */
4940 parser->greater_than_is_operator_p
4943 /* Consume the `)'. */
4952 }
4955 {
4957 {
4958 /* We might have an Objective-C++ message. */
4961 /* If that works out, we're done ... */
4964 /* ... else, fall though to see if it's a lambda. */
4965 }
4967 /* Don't warn about a failed tentative parse. */
4972 }
4976 /* We have an Objective-C++ string literal. */
4983 {
4984 /* These two are the boolean literals. */
4992 /* The `__null' literal. */
4997 /* The `nullptr' literal. */
5002 /* Recognize the `this' keyword. */
5006 {
5010 }
5011 /* Pointers cannot appear in constant-expressions. */
5016 /* The `operator' keyword can be the beginning of an
5017 id-expression. */
5024 {
5025 non_integral_constant name;
5027 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5028 __func__ are the names of variables -- but they are
5029 treated specially. Therefore, they are handled here,
5030 rather than relying on the generic id-expression logic
5031 below. Grammatically, these names are id-expressions.
5033 Consume the token. */
5037 {
5049 }
5054 /* Look up the name. */
5056 }
5059 {
5060 tree expression;
5061 tree type;
5062 source_location type_location;
5063 location_t start_loc
5065 /* The `__builtin_va_arg' construct is used to handle
5066 `va_arg'. Consume the `__builtin_va_arg' token. */
5068 /* Look for the opening `('. */
5070 /* Now, parse the assignment-expression. */
5072 /* Look for the `,'. */
5075 /* Parse the type-id. */
5076 {
5079 }
5080 /* Look for the closing `)'. */
5081 location_t finish_loc
5084 /* Using `va_arg' in a constant-expression is not
5085 allowed. */
5087 NIC_VA_ARG))
5089 /* Construct a location of the form:
5090 __builtin_va_arg (v, int)
5091 ~~~~~~~~~~~~~~~~~~~~~^~~~
5092 with the caret at the type, ranging from the start of the
5093 "__builtin_va_arg" token to the close paren. */
5094 location_t combined_loc
5097 }
5128 // C++ concepts
5132 /* Objective-C++ expressions. */
5142 {
5147 }
5148 /* FALLTHRU */
5152 }
5154 /* An id-expression can start with either an identifier, a
5155 `::' as the beginning of a qualified-id, or the "operator"
5156 keyword. */
5161 {
5162 id_expression:
5163 cp_expr id_expression;
5164 cp_expr decl;
5170 /* Parse the id-expression. */
5171 id_expression
5188 /* If we have a template-id, then no further lookup is
5189 required. If the template-id was for a template-class, we
5190 will sometimes have a TYPE_DECL at this point. */
5194 /* Look up the name. */
5195 else
5196 {
5197 tree ambiguous_decls;
5199 /* If we already know that this lookup is ambiguous, then
5200 we've already issued an error message; there's no reason
5201 to check again. */
5204 {
5207 }
5210 none_type,
5211 template_p,
5216 /* If the lookup was ambiguous, an error will already have
5217 been issued. */
5221 /* In Objective-C++, we may have an Objective-C 2.0
5222 dot-syntax for classes here. */
5227 {
5228 tree component;
5235 component);
5236 /* Build a location of the form:
5237 expr.component
5238 ~~~~~^~~~~~~~~
5239 with caret at the start of the component name (at
5240 input_location), ranging from the start of the id_expression
5241 to the end of the component name. */
5242 location_t combined_loc
5247 }
5249 /* In Objective-C++, an instance variable (ivar) may be preferred
5250 to whatever cp_parser_lookup_name() found.
5251 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5252 rest of c-family, we have to do a little extra work to preserve
5253 any location information in cp_expr "decl". Given that
5254 objc_lookup_ivar is implemented in "c-family" and "objc", we
5255 have a trip through the pure "tree" type, rather than cp_expr.
5256 Naively copying it back to "decl" would implicitly give the
5257 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5258 store an EXPR_LOCATION. Hence we only update "decl" (and
5259 hence its location_t) if we get back a different tree node. */
5261 id_expression);
5265 /* If name lookup gives us a SCOPE_REF, then the
5266 qualifying scope was dependent. */
5268 {
5269 /* At this point, we do not know if DECL is a valid
5270 integral constant expression. We assume that it is
5271 in fact such an expression, so that code like:
5273 template <int N> struct A {
5274 int a[B<N>::i];
5275 };
5277 is accepted. At template-instantiation time, we
5278 will check that B<N>::i is actually a constant. */
5280 }
5281 /* Check to see if DECL is a local variable in a context
5282 where that is forbidden. */
5285 {
5286 /* It might be that we only found DECL because we are
5287 trying to be generous with pre-ISO scoping rules.
5288 For example, consider:
5290 int i;
5291 void g() {
5292 for (int i = 0; i < 10; ++i) {}
5293 extern void f(int j = i);
5294 }
5296 Here, name look up will originally find the out
5297 of scope `i'. We need to issue a warning message,
5298 but then use the global `i'. */
5301 {
5306 }
5307 }
5308 }
5310 decl = (finish_id_expression
5312 idk,
5317 template_arg_p,
5324 }
5326 /* Anything else is an error. */
5330 }
5331 }
5339 {
5342 }
5344 /* Parse an id-expression.
5346 id-expression:
5347 unqualified-id
5348 qualified-id
5350 qualified-id:
5351 :: [opt] nested-name-specifier template [opt] unqualified-id
5352 :: identifier
5353 :: operator-function-id
5354 :: template-id
5356 Return a representation of the unqualified portion of the
5357 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5358 a `::' or nested-name-specifier.
5360 Often, if the id-expression was a qualified-id, the caller will
5361 want to make a SCOPE_REF to represent the qualified-id. This
5362 function does not do this in order to avoid wastefully creating
5363 SCOPE_REFs when they are not required.
5365 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5366 `template' keyword.
5368 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5369 uninstantiated templates.
5371 If *TEMPLATE_P is non-NULL, it is set to true iff the
5372 `template' keyword is used to explicitly indicate that the entity
5373 named is a template.
5375 If DECLARATOR_P is true, the id-expression is appearing as part of
5376 a declarator, rather than as part of an expression. */
5378 static cp_expr
5385 {
5389 /* Assume the `template' keyword was not used. */
5393 /* Look for the optional `::' operator. */
5394 global_scope_p
5397 /* Look for the optional nested-name-specifier. */
5398 nested_name_specifier_p
5401 check_dependency_p,
5403 declarator_p)
5405 /* If there is a nested-name-specifier, then we are looking at
5406 the first qualified-id production. */
5408 {
5409 tree saved_scope;
5410 tree saved_object_scope;
5411 tree saved_qualifying_scope;
5412 tree unqualified_id;
5415 /* See if the next token is the `template' keyword. */
5419 /* Name lookup we do during the processing of the
5420 unqualified-id might obliterate SCOPE. */
5424 /* Process the final unqualified-id. */
5426 check_dependency_p,
5427 declarator_p,
5429 /* Restore the SAVED_SCOPE for our caller. */
5435 }
5436 /* Otherwise, if we are in global scope, then we are looking at one
5437 of the other qualified-id productions. */
5439 {
5441 tree id;
5443 /* Peek at the next token. */
5446 /* If it's an identifier, and the next token is not a "<", then
5447 we can avoid the template-id case. This is an optimization
5448 for this common case. */
5450 && !cp_parser_nth_token_starts_template_argument_list_p
5455 /* Try a template-id. */
5459 none_type,
5460 declarator_p);
5461 /* If that worked, we're done. */
5465 /* Peek at the next token. (Changes in the token buffer may
5466 have invalidated the pointer obtained above.) */
5470 {
5477 /* Fall through. */
5482 }
5483 }
5484 else
5487 declarator_p,
5488 optional_p);
5489 }
5491 /* Parse an unqualified-id.
5493 unqualified-id:
5494 identifier
5495 operator-function-id
5496 conversion-function-id
5497 ~ class-name
5498 template-id
5500 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5501 keyword, in a construct like `A::template ...'.
5503 Returns a representation of unqualified-id. For the `identifier'
5504 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5505 production a BIT_NOT_EXPR is returned; the operand of the
5506 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5507 other productions, see the documentation accompanying the
5508 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5509 names are looked up in uninstantiated templates. If DECLARATOR_P
5510 is true, the unqualified-id is appearing as part of a declarator,
5511 rather than as part of an expression. */
5513 static cp_expr
5519 {
5522 /* Peek at the next token. */
5526 {
5528 {
5529 tree id;
5531 /* We don't know yet whether or not this will be a
5532 template-id. */
5534 /* Try a template-id. */
5536 check_dependency_p,
5537 none_type,
5538 declarator_p);
5539 /* If it worked, we're done. */
5542 /* Otherwise, it's an ordinary identifier. */
5544 }
5548 check_dependency_p,
5549 none_type,
5550 declarator_p);
5553 {
5554 tree type_decl;
5555 tree qualifying_scope;
5556 tree object_scope;
5557 tree scope;
5560 /* Consume the `~' token. */
5562 /* Parse the class-name. The standard, as written, seems to
5563 say that:
5565 template <typename T> struct S { ~S (); };
5566 template <typename T> S<T>::~S() {}
5568 is invalid, since `~' must be followed by a class-name, but
5569 `S<T>' is dependent, and so not known to be a class.
5570 That's not right; we need to look in uninstantiated
5571 templates. A further complication arises from:
5573 template <typename T> void f(T t) {
5574 t.T::~T();
5575 }
5577 Here, it is not possible to look up `T' in the scope of `T'
5578 itself. We must look in both the current scope, and the
5579 scope of the containing complete expression.
5581 Yet another issue is:
5583 struct S {
5584 int S;
5585 ~S();
5586 };
5588 S::~S() {}
5590 The standard does not seem to say that the `S' in `~S'
5591 should refer to the type `S' and not the data member
5592 `S::S'. */
5594 /* DR 244 says that we look up the name after the "~" in the
5595 same scope as we looked up the qualifying name. That idea
5596 isn't fully worked out; it's more complicated than that. */
5601 /* Check for invalid scopes. */
5603 {
5607 }
5609 {
5613 scope);
5618 }
5621 /* If the name is of the form "X::~X" it's OK even if X is a
5622 typedef. */
5631 {
5634 }
5636 /* ~auto means the destructor of whatever the object is. */
5638 {
5641 "%<~auto%> only available with "
5645 }
5647 /* If there was an explicit qualification (S::~T), first look
5648 in the scope given by the qualification (i.e., S).
5650 Note: in the calls to cp_parser_class_name below we pass
5651 typename_type so that lookup finds the injected-class-name
5652 rather than the constructor. */
5656 {
5661 typename_type,
5664 declarator_p);
5667 }
5668 /* In "N::S::~S", look in "N" as well. */
5670 {
5675 type_decl
5679 typename_type,
5682 declarator_p);
5685 }
5686 /* In "p->S::~T", look in the scope given by "*p" as well. */
5688 {
5693 type_decl
5697 typename_type,
5700 declarator_p);
5703 }
5704 /* Look in the surrounding context. */
5706 {
5712 type_decl
5716 typename_type,
5719 declarator_p);
5722 {
5723 /* We couldn't find a type with this name. If we're parsing
5724 tentatively, fail and try something else. */
5726 {
5729 }
5730 /* Otherwise, accept it and check for a match at instantiation
5731 time. */
5736 }
5737 }
5738 /* If an error occurred, assume that the name of the
5739 destructor is the same as the name of the qualifying
5740 class. That allows us to keep parsing after running
5741 into ill-formed destructor names. */
5747 /* Check that destructor name and scope match. */
5749 {
5756 }
5758 /* [class.dtor]
5760 A typedef-name that names a class shall not be used as the
5761 identifier in the declarator for a destructor declaration. */
5768 type_decl);
5771 }
5775 {
5776 cp_expr id;
5778 /* This could be a template-id, so we try that first. */
5780 /* Try a template-id. */
5783 none_type,
5784 declarator_p);
5785 /* If that worked, we're done. */
5788 /* We still don't know whether we're looking at an
5789 operator-function-id or a conversion-function-id. */
5791 /* Try an operator-function-id. */
5793 /* If that didn't work, try a conversion-function-id. */
5797 {
5798 /* 17.6.3.3.5 */
5804 }
5807 }
5808 /* Fall through. */
5815 }
5816 }
5818 /* Parse an (optional) nested-name-specifier.
5820 nested-name-specifier: [C++98]
5821 class-or-namespace-name :: nested-name-specifier [opt]
5822 class-or-namespace-name :: template nested-name-specifier [opt]
5824 nested-name-specifier: [C++0x]
5825 type-name ::
5826 namespace-name ::
5827 nested-name-specifier identifier ::
5828 nested-name-specifier template [opt] simple-template-id ::
5830 PARSER->SCOPE should be set appropriately before this function is
5831 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5832 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5833 in name lookups.
5835 Sets PARSER->SCOPE to the class (TYPE) or namespace
5836 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5837 it unchanged if there is no nested-name-specifier. Returns the new
5838 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5840 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5841 part of a declaration and/or decl-specifier. */
5843 static tree
5849 {
5854 /* Remember where the nested-name-specifier starts. */
5856 {
5859 }
5862 {
5863 tree new_scope;
5864 tree old_scope;
5865 tree saved_qualifying_scope;
5868 /* Spot cases that cannot be the beginning of a
5869 nested-name-specifier. */
5872 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5873 the already parsed nested-name-specifier. */
5875 {
5876 /* Grab the nested-name-specifier and continue the loop. */
5878 /* If we originally encountered this nested-name-specifier
5879 with IS_DECLARATION set to false, we will not have
5880 resolved TYPENAME_TYPEs, so we must do so here. */
5883 {
5888 }
5891 }
5893 /* Spot cases that cannot be the beginning of a
5894 nested-name-specifier. On the second and subsequent times
5895 through the loop, we look for the `template' keyword. */
5897 ;
5898 /* A template-id can start a nested-name-specifier. */
5900 ;
5901 /* DR 743: decltype can be used in a nested-name-specifier. */
5903 ;
5904 else
5905 {
5906 /* If the next token is not an identifier, then it is
5907 definitely not a type-name or namespace-name. */
5910 /* If the following token is neither a `<' (to begin a
5911 template-id), nor a `::', then we are not looking at a
5912 nested-name-specifier. */
5918 {
5922 }
5925 && !cp_parser_nth_token_starts_template_argument_list_p
5928 }
5930 /* The nested-name-specifier is optional, so we parse
5931 tentatively. */
5934 /* Look for the optional `template' keyword, if this isn't the
5935 first time through the loop. */
5938 else
5941 /* Save the old scope since the name lookup we are about to do
5942 might destroy it. */
5945 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5946 look up names in "X<T>::I" in order to determine that "Y" is
5947 a template. So, if we have a typename at this point, we make
5948 an effort to look through it. */
5950 && !typename_keyword_p
5955 /* Parse the qualifying entity. */
5956 new_scope
5958 typename_keyword_p,
5959 template_keyword_p,
5960 check_dependency_p,
5961 type_p,
5962 is_declaration);
5963 /* Look for the `::' token. */
5966 /* If we found what we wanted, we keep going; otherwise, we're
5967 done. */
5969 {
5972 /* Restore the OLD_SCOPE since it was valid before the
5973 failed attempt at finding the last
5974 class-or-namespace-name. */
5978 /* If the next token is a decltype, and the one after that is a
5979 `::', then the decltype has failed to resolve to a class or
5980 enumeration type. Give this error even when parsing
5981 tentatively since it can't possibly be valid--and we're going
5982 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5983 won't get another chance.*/
5987 {
5994 /* As below. */
5997 }
6001 {
6002 /* If we have a non-type template-id followed by ::, it can't
6003 possibly be valid. */
6008 {
6011 {
6017 }
6018 else
6019 {
6020 /* Variable template. */
6025 }
6032 /* As below. */
6036 }
6037 }
6041 /* If the next token is an identifier, and the one after
6042 that is a `::', then any valid interpretation would have
6043 found a class-or-namespace-name. */
6049 {
6052 {
6054 {
6055 tree decl;
6056 tree ambiguous_decls;
6059 none_type,
6068 decl);
6070 {
6071 // cp_parser_lookup_name has the same diagnostic,
6072 // thus make sure to emit it at most once.
6075 {
6080 }
6082 }
6083 else
6084 {
6086 cp_parser_name_lookup_error
6089 else
6090 cp_parser_name_lookup_error
6093 }
6094 }
6097 /* Treat this as a successful nested-name-specifier
6098 due to:
6100 [basic.lookup.qual]
6102 If the name found is not a class-name (clause
6103 _class_) or namespace-name (_namespace.def_), the
6104 program is ill-formed. */
6106 }
6108 }
6110 }
6111 /* We've found one valid nested-name-specifier. */
6113 /* Name lookup always gives us a DECL. */
6116 /* Uses of "template" must be followed by actual templates. */
6128 new_scope);
6129 /* If it is a class scope, try to complete it; we are about to
6130 be looking up names inside the class. */
6132 /* Since checking types for dependency can be expensive,
6133 avoid doing it if the type is already complete. */
6135 /* Do not try to complete dependent types. */
6137 {
6139 /* If it is a typedef to current class, use the current
6140 class instead, as the typedef won't have any names inside
6141 it yet. */
6145 }
6146 /* Make sure we look in the right scope the next time through
6147 the loop. */
6149 }
6151 /* If parsing tentatively, replace the sequence of tokens that makes
6152 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6153 token. That way, should we re-parse the token stream, we will
6154 not have to repeat the effort required to do the parse, nor will
6155 we issue duplicate error messages. */
6157 {
6161 /* Reset the contents of the START token. */
6163 /* Retrieve any deferred checks. Do not pop this access checks yet
6164 so the memory will not be reclaimed during token replacing below. */
6172 /* Purge all subsequent tokens. */
6174 }
6180 }
6182 /* Parse a nested-name-specifier. See
6183 cp_parser_nested_name_specifier_opt for details. This function
6184 behaves identically, except that it will an issue an error if no
6185 nested-name-specifier is present. */
6187 static tree
6193 {
6194 tree scope;
6196 /* Look for the nested-name-specifier. */
6198 typename_keyword_p,
6199 check_dependency_p,
6200 type_p,
6201 is_declaration);
6202 /* If it was not present, issue an error message. */
6204 {
6207 }
6210 }
6212 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6213 this is either a class-name or a namespace-name (which corresponds
6214 to the class-or-namespace-name production in the grammar). For
6215 C++0x, it can also be a type-name that refers to an enumeration
6216 type or a simple-template-id.
6218 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6219 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6220 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6221 TYPE_P is TRUE iff the next name should be taken as a class-name,
6222 even the same name is declared to be another entity in the same
6223 scope.
6225 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6226 specified by the class-or-namespace-name. If neither is found the
6227 ERROR_MARK_NODE is returned. */
6229 static tree
6236 {
6237 tree saved_scope;
6238 tree saved_qualifying_scope;
6239 tree saved_object_scope;
6240 tree scope;
6244 /* DR 743: decltype can appear in a nested-name-specifier. */
6246 {
6250 {
6253 }
6257 }
6259 /* Before we try to parse the class-name, we must save away the
6260 current PARSER->SCOPE since cp_parser_class_name will destroy
6261 it. */
6265 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6266 there is no need to look for a namespace-name. */
6267 only_class_p = template_keyword_p
6272 typename_keyword_p,
6273 template_keyword_p,
6275 check_dependency_p,
6277 is_declaration,
6280 /* If that didn't work, try for a namespace-name. */
6282 {
6283 /* Restore the saved scope. */
6287 /* If we are not looking at an identifier followed by the scope
6288 resolution operator, then this is not part of a
6289 nested-name-specifier. (Note that this function is only used
6290 to parse the components of a nested-name-specifier.) */
6295 }
6298 }
6300 /* Return true if we are looking at a compound-literal, false otherwise. */
6302 static bool
6304 {
6305 /* Consume the `('. */
6310 /* Skip tokens until the next token is a closing parenthesis.
6311 If we find the closing `)', and the next token is a `{', then
6312 we are looking at a compound-literal. */
6313 bool compound_literal_p
6318 /* Roll back the tokens we skipped. */
6322 }
6324 /* Parse a postfix-expression.
6326 postfix-expression:
6327 primary-expression
6328 postfix-expression [ expression ]
6329 postfix-expression ( expression-list [opt] )
6330 simple-type-specifier ( expression-list [opt] )
6331 typename :: [opt] nested-name-specifier identifier
6332 ( expression-list [opt] )
6333 typename :: [opt] nested-name-specifier template [opt] template-id
6334 ( expression-list [opt] )
6335 postfix-expression . template [opt] id-expression
6336 postfix-expression -> template [opt] id-expression
6337 postfix-expression . pseudo-destructor-name
6338 postfix-expression -> pseudo-destructor-name
6339 postfix-expression ++
6340 postfix-expression --
6341 dynamic_cast < type-id > ( expression )
6342 static_cast < type-id > ( expression )
6343 reinterpret_cast < type-id > ( expression )
6344 const_cast < type-id > ( expression )
6345 typeid ( expression )
6346 typeid ( type-id )
6348 GNU Extension:
6350 postfix-expression:
6351 ( type-id ) { initializer-list , [opt] }
6353 This extension is a GNU version of the C99 compound-literal
6354 construct. (The C99 grammar uses `type-name' instead of `type-id',
6355 but they are essentially the same concept.)
6357 If ADDRESS_P is true, the postfix expression is the operand of the
6358 `&' operator. CAST_P is true if this expression is the target of a
6359 cast.
6361 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6362 class member access expressions [expr.ref].
6364 Returns a representation of the expression. */
6366 static cp_expr
6370 {
6372 location_t loc;
6379 /* Peek at the next token. */
6384 /* Some of the productions are determined by keywords. */
6387 {
6392 {
6393 tree type;
6394 cp_expr expression;
6398 /* All of these can be handled in the same way from the point
6399 of view of parsing. Begin by consuming the token
6400 identifying the cast. */
6403 /* New types cannot be defined in the cast. */
6405 parser->type_definition_forbidden_message
6408 /* Look for the opening `<'. */
6410 /* Parse the type to which we are casting. */
6415 /* Look for the closing `>'. */
6417 /* Restore the old message. */
6420 bool saved_greater_than_is_operator_p
6424 /* And the expression which is being cast. */
6428 RT_CLOSE_PAREN);
6432 parser->greater_than_is_operator_p
6435 /* Only type conversions to integral or enumeration types
6436 can be used in constant-expressions. */
6442 {
6444 postfix_expression
6448 postfix_expression
6452 postfix_expression
6454 tf_warning_or_error);
6457 postfix_expression
6462 }
6464 /* Construct a location e.g. :
6465 reinterpret_cast <int *> (expr)
6466 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6467 ranging from the start of the "*_cast" token to the final closing
6468 paren, with the caret at the start. */
6471 }
6475 {
6476 tree type;
6480 /* Consume the `typeid' token. */
6482 /* Look for the `(' token. */
6484 /* Types cannot be defined in a `typeid' expression. */
6486 parser->type_definition_forbidden_message
6488 /* We can't be sure yet whether we're looking at a type-id or an
6489 expression. */
6491 /* Try a type-id first. */
6496 /* Look for the `)' token. Otherwise, we can't be sure that
6497 we're not looking at an expression: consider `typeid (int
6498 (3))', for example. */
6500 /* If all went well, simply lookup the type-id. */
6503 /* Otherwise, fall back to the expression variant. */
6504 else
6505 {
6506 tree expression;
6508 /* Look for an expression. */
6510 /* Compute its typeid. */
6512 /* Look for the `)' token. */
6514 }
6515 /* Restore the saved message. */
6517 /* `typeid' may not appear in an integral constant expression. */
6520 }
6524 {
6525 tree type;
6526 /* The syntax permitted here is the same permitted for an
6527 elaborated-type-specifier. */
6534 }
6538 {
6539 location_t cilk_spawn_loc
6544 {
6549 }
6551 {
6556 }
6557 else
6558 {
6559 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6562 }
6564 postfix_expression =
6568 {
6572 }
6574 {
6579 }
6580 else
6581 {
6584 postfix_expression);
6585 /* Build a location of the form:
6586 _Cilk_spawn expr
6587 ~~~~~~~~~~~~^~~~
6588 with caret at the expr, ranging from the start of the
6589 _Cilk_spawn token to the end of the expression. */
6590 location_t combined_loc =
6596 }
6598 }
6601 {
6604 tree p;
6618 tf_warning_or_error);
6621 tf_warning_or_error);
6622 else
6623 {
6627 }
6629 }
6632 {
6633 tree type;
6635 /* If the next thing is a simple-type-specifier, we may be
6636 looking at a functional cast. We could also be looking at
6637 an id-expression. So, we try the functional cast, and if
6638 that doesn't work we fall back to the primary-expression. */
6640 /* Look for the simple-type-specifier. */
6644 CP_PARSER_FLAGS_NONE);
6646 /* Parse the cast itself. */
6648 postfix_expression
6650 /* If that worked, we're done. */
6654 /* If the functional-cast didn't work out, try a
6655 compound-literal. */
6658 {
6663 /* Avoid calling cp_parser_type_id pointlessly, see comment
6664 in cp_parser_cast_expression about c++/29234. */
6667 else
6668 {
6669 /* Parse the type. */
6674 /* Look for the `)'. */
6676 }
6678 /* If things aren't going well, there's no need to
6679 keep going. */
6681 {
6683 /* Parse the brace-enclosed initializer list. */
6686 }
6687 /* If that worked, we're definitely looking at a
6688 compound-literal expression. */
6690 {
6691 /* Warn the user that a compound literal is not
6692 allowed in standard C++. */
6695 /* For simplicity, we disallow compound literals in
6696 constant-expressions. We could
6697 allow compound literals of integer type, whose
6698 initializer was a constant, in constant
6699 expressions. Permitting that usage, as a further
6700 extension, would not change the meaning of any
6701 currently accepted programs. (Of course, as
6702 compound literals are not part of ISO C++, the
6703 standard has nothing to say.) */
6705 NIC_NCC))
6706 {
6709 }
6710 /* Form the representation of the compound-literal. */
6711 postfix_expression
6713 tf_warning_or_error);
6716 }
6717 }
6719 /* It must be a primary-expression. */
6720 postfix_expression
6723 decltype_p,
6725 }
6727 }
6729 /* Note that we don't need to worry about calling build_cplus_new on a
6730 class-valued CALL_EXPR in decltype when it isn't the end of the
6731 postfix-expression; unary_complex_lvalue will take care of that for
6732 all these cases. */
6734 /* Keep looping until the postfix-expression is complete. */
6736 {
6740 /* It is not a Koenig lookup function call. */
6741 postfix_expression
6744 /* Peek at the next token. */
6748 {
6751 {
6753 "two consecutive %<[%> shall "
6756 }
6757 postfix_expression
6759 postfix_expression,
6761 decltype_p);
6770 /* postfix-expression ( expression-list [opt] ) */
6771 {
6782 is_builtin_constant_p
6785 {
6786 /* The whole point of __builtin_constant_p is to allow
6787 non-constant expressions to appear as arguments. */
6788 saved_integral_constant_expression_p
6790 saved_non_integral_constant_expression_p
6793 }
6794 args = (cp_parser_parenthesized_expression_list
6800 {
6801 parser->integral_constant_expression_p
6803 parser->non_integral_constant_expression_p
6805 }
6808 {
6811 }
6813 /* Function calls are not permitted in
6814 constant-expressions. */
6817 NIC_FUNC_CALL))
6818 {
6822 }
6827 {
6829 {
6831 {
6834 postfix_expression
6836 complain);
6837 }
6838 else
6839 postfix_expression
6841 }
6842 /* We do not perform argument-dependent lookup if
6843 normal lookup finds a non-function, in accordance
6844 with the expected resolution of DR 218. */
6847 {
6851 /* Do not do argument dependent lookup if regular
6852 lookup finds a member function or a block-scope
6853 function declaration. [basic.lookup.argdep]/3 */
6856 {
6859 postfix_expression
6861 complain);
6862 }
6863 }
6864 }
6870 {
6879 }
6882 {
6892 {
6893 postfix_expression
6897 }
6900 {
6901 postfix_expression
6902 = (build_new_method_call
6908 complain));
6909 }
6910 else
6911 postfix_expression
6915 complain);
6916 }
6920 postfix_expression = (build_offset_ref_call_from_tree
6922 complain));
6924 /* A call to a static class member, or a namespace-scope
6925 function. */
6926 postfix_expression
6929 koenig_p,
6930 complain);
6931 else
6932 /* All other function calls. */
6933 postfix_expression
6936 koenig_p,
6937 complain);
6940 {
6942 start_loc,
6943 close_paren_loc);
6945 }
6947 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6951 }
6956 /* postfix-expression . template [opt] id-expression
6957 postfix-expression . pseudo-destructor-name
6958 postfix-expression -> template [opt] id-expression
6959 postfix-expression -> pseudo-destructor-name */
6961 /* Consume the `.' or `->' operator. */
6964 postfix_expression
6966 postfix_expression,
6973 /* postfix-expression ++ */
6974 /* Consume the `++' token. */
6976 /* Generate a representation for the complete expression. */
6977 postfix_expression
6979 POSTINCREMENT_EXPR);
6980 /* Increments may not appear in constant-expressions. */
6988 /* postfix-expression -- */
6989 /* Consume the `--' token. */
6991 /* Generate a representation for the complete expression. */
6992 postfix_expression
6994 POSTDECREMENT_EXPR);
6995 /* Decrements may not appear in constant-expressions. */
7006 return is_member_access
7007 ? postfix_expression
7009 else
7011 }
7012 }
7014 /* We should never get here. */
7017 }
7019 /* This function parses Cilk Plus array notations. If a normal array expr. is
7020 parsed then the array index is passed back to the caller through *INIT_INDEX
7021 and the function returns a NULL_TREE. If array notation expr. is parsed,
7022 then *INIT_INDEX is ignored by the caller and the function returns
7023 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7024 error_mark_node. */
7026 static tree
7028 tree array_value)
7029 {
7033 {
7036 }
7045 {
7048 }
7050 {
7051 /* Consume the ':'. */
7054 /* If we are here, then we have a case like this A[:]. */
7056 {
7060 }
7064 }
7065 else
7066 {
7067 /* If we are here, then there are three valid possibilities:
7068 1. ARRAY [ EXP ]
7069 2. ARRAY [ EXP : EXP ]
7070 3. ARRAY [ EXP : EXP : EXP ] */
7074 {
7075 /* This indicates that we have a normal array expression. */
7078 }
7080 /* Consume the ':'. */
7084 {
7087 }
7088 }
7093 {
7097 }
7103 }
7105 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7106 by cp_parser_builtin_offsetof. We're looking for
7108 postfix-expression [ expression ]
7109 postfix-expression [ braced-init-list ] (C++11)
7111 FOR_OFFSETOF is set if we're being called in that context, which
7112 changes how we deal with integer constant expressions. */
7114 static tree
7116 tree postfix_expression,
7119 {
7124 /* Consume the `[' token. */
7130 /* Parse the index expression. */
7131 /* ??? For offsetof, there is a question of what to allow here. If
7132 offsetof is not being used in an integral constant expression context,
7133 then we *could* get the right answer by computing the value at runtime.
7134 If we are in an integral constant expression context, then we might
7135 could accept any constant expression; hard to say without analysis.
7136 Rather than open the barn door too wide right away, allow only integer
7137 constant expressions here. */
7140 else
7141 {
7143 {
7150 {
7152 "braced list index is not allowed with array "
7156 }
7157 }
7159 {
7160 /* Here are have these two options:
7161 ARRAY[EXP : EXP] - Array notation expr with default
7162 stride of 1.
7163 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7164 stride. */
7166 postfix_expression);
7169 }
7170 else
7172 }
7176 /* Look for the closing `]'. */
7179 /* Build the ARRAY_REF. */
7183 /* When not doing offsetof, array references are not permitted in
7184 constant-expressions. */
7190 }
7192 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7193 by cp_parser_builtin_offsetof. We're looking for
7195 postfix-expression . template [opt] id-expression
7196 postfix-expression . pseudo-destructor-name
7197 postfix-expression -> template [opt] id-expression
7198 postfix-expression -> pseudo-destructor-name
7200 FOR_OFFSETOF is set if we're being called in that context. That sorta
7201 limits what of the above we'll actually accept, but nevermind.
7202 TOKEN_TYPE is the "." or "->" token, which will already have been
7203 removed from the stream. */
7205 static tree
7208 cp_expr postfix_expression,
7210 location_t location)
7211 {
7212 tree name;
7218 /* If this is a `->' operator, dereference the pointer. */
7221 tf_warning_or_error);
7222 /* Check to see whether or not the expression is type-dependent and
7223 not the current instantiation. */
7225 /* The identifier following the `->' or `.' is not qualified. */
7231 /* Enter the scope corresponding to the type of the object
7232 given by the POSTFIX_EXPRESSION. */
7234 {
7236 /* According to the standard, no expression should ever have
7237 reference type. Unfortunately, we do not currently match
7238 the standard in this respect in that our internal representation
7239 of an expression may have reference type even when the standard
7240 says it does not. Therefore, we have to manually obtain the
7241 underlying type here. */
7243 /* The type of the POSTFIX_EXPRESSION must be complete. */
7244 /* Unlike the object expression in other contexts, *this is not
7245 required to be of complete type for purposes of class member
7246 access (5.2.5) outside the member function body. */
7248 && !(processing_template_decl
7249 && current_class_type
7250 && (same_type_ignoring_top_level_qualifiers_p
7253 /* Let the name lookup machinery know that we are processing a
7254 class member access expression. */
7256 /* If something went wrong, we want to be able to discern that case,
7257 as opposed to the case where there was no SCOPE due to the type
7258 of expression being dependent. */
7261 /* If the SCOPE was erroneous, make the various semantic analysis
7262 functions exit quickly -- and without issuing additional error
7263 messages. */
7266 }
7267 else
7268 /* Tell cp_parser_lookup_name that there was an object, even though it's
7269 type-dependent. */
7272 /* Assume this expression is not a pseudo-destructor access. */
7275 /* If the SCOPE is a scalar type, then, if this is a valid program,
7276 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7277 is type dependent, it can be pseudo-destructor-name or something else.
7278 Try to parse it as pseudo-destructor-name first. */
7280 {
7281 tree s;
7282 tree type;
7285 /* Parse the pseudo-destructor-name. */
7294 {
7296 postfix_expression
7299 }
7300 }
7303 {
7304 /* If the SCOPE is not a scalar type, we are looking at an
7305 ordinary class member access expression, rather than a
7306 pseudo-destructor-name. */
7309 /* Parse the id-expression. */
7310 name = (cp_parser_id_expression
7317 /* In general, build a SCOPE_REF if the member name is qualified.
7318 However, if the name was not dependent and has already been
7319 resolved; there is no need to build the SCOPE_REF. For example;
7321 struct X { void f(); };
7322 template <typename T> void f(T* t) { t->X::f(); }
7324 Even though "t" is dependent, "X::f" is not and has been resolved
7325 to a BASELINK; there is no need to include scope information. */
7327 /* But we do need to remember that there was an explicit scope for
7328 virtual function calls. */
7332 /* If the name is a template-id that names a type, we will get a
7333 TYPE_DECL here. That is invalid code. */
7335 {
7338 }
7339 else
7340 {
7342 {
7344 {
7348 }
7349 else
7352 name,
7353 template_p);
7357 }
7359 adjust_result_of_qualified_name_lookup
7361 postfix_expression
7363 template_p,
7364 tf_warning_or_error);
7365 /* Build a location e.g.:
7366 ptr->access_expr
7367 ~~~^~~~~~~~~~~~~
7368 where the caret is at the deref token, ranging from
7369 the start of postfix_expression to the end of the access expr. */
7370 location_t end_loc
7372 location_t combined_loc
7375 }
7376 }
7378 /* We no longer need to look up names in the scope of the object on
7379 the left-hand side of the `.' or `->' operator. */
7382 /* Outside of offsetof, these operators may not appear in
7383 constant-expressions. */
7385 && (cp_parser_non_integral_constant_expression
7390 }
7392 /* Parse a parenthesized expression-list.
7394 expression-list:
7395 assignment-expression
7396 expression-list, assignment-expression
7398 attribute-list:
7399 expression-list
7400 identifier
7401 identifier, expression-list
7403 CAST_P is true if this expression is the target of a cast.
7405 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7406 argument pack.
7408 Returns a vector of trees. Each element is a representation of an
7409 assignment-expression. NULL is returned if the ( and or ) are
7410 missing. An empty, but allocated, vector is returned on no
7411 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7412 if we are parsing an attribute list for an attribute that wants a
7413 plain identifier argument, normal_attr for an attribute that wants
7414 an expression, or non_attr if we aren't parsing an attribute list. If
7415 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7416 not all of the expressions in the list were constant.
7417 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7418 will be written to with the location of the closing parenthesis. If
7419 an error occurs, it may or may not be written to. */
7428 {
7434 /* Assume all the expressions will be constant. */
7443 /* Within a parenthesized expression, a `>' token is always
7444 the greater-than operator. */
7445 saved_greater_than_is_operator_p
7449 /* Consume expressions until there are no more. */
7452 {
7453 tree expr;
7455 /* At the beginning of attribute lists, check to see if the
7456 next token is an identifier. */
7459 {
7462 /* Consume the identifier. */
7464 /* Save the identifier. */
7466 }
7467 else
7468 {
7471 /* Parse the next assignment-expression. */
7473 {
7474 /* A braced-init-list. */
7480 }
7482 {
7483 expr = (cp_parser_constant_expression
7488 }
7489 else
7491 cast_p);
7496 /* If we have an ellipsis, then this is an expression
7497 expansion. */
7500 {
7501 /* Consume the `...'. */
7504 /* Build the argument pack. */
7506 }
7508 /* Add it to the list. We add error_mark_node
7509 expressions to the list, so that we can still tell if
7510 the correct form for a parenthesized expression-list
7511 is found. That gives better errors. */
7516 }
7518 /* After the first item, attribute lists look the same as
7519 expression lists. */
7522 get_comma:;
7523 /* If the next token isn't a `,', then we are done. */
7527 /* Otherwise, consume the `,' and keep going. */
7529 }
7535 {
7538 skip_comma:;
7539 /* We try and resync to an unnested comma, as that will give the
7540 user better diagnostics. */
7548 {
7549 parser->greater_than_is_operator_p
7552 }
7553 }
7555 parser->greater_than_is_operator_p
7562 }
7564 /* Parse a pseudo-destructor-name.
7566 pseudo-destructor-name:
7567 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7568 :: [opt] nested-name-specifier template template-id :: ~ type-name
7569 :: [opt] nested-name-specifier [opt] ~ type-name
7571 If either of the first two productions is used, sets *SCOPE to the
7572 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7573 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7574 or ERROR_MARK_NODE if the parse fails. */
7576 static void
7578 tree object,
7581 {
7584 /* Handle ~auto. */
7588 {
7591 "%<~auto%> only available with "
7598 }
7600 /* Assume that things will not work out. */
7603 /* Look for the optional `::' operator. */
7605 /* Look for the optional nested-name-specifier. */
7606 nested_name_specifier_p
7613 /* Now, if we saw a nested-name-specifier, we might be doing the
7614 second production. */
7617 {
7618 /* Consume the `template' keyword. */
7620 /* Parse the template-id. */
7624 class_type,
7626 /* Look for the `::' token. */
7628 }
7629 /* If the next token is not a `~', then there might be some
7630 additional qualification. */
7632 {
7633 /* At this point, we're looking for "type-name :: ~". The type-name
7634 must not be a class-name, since this is a pseudo-destructor. So,
7635 it must be either an enum-name, or a typedef-name -- both of which
7636 are just identifiers. So, we peek ahead to check that the "::"
7637 and "~" tokens are present; if they are not, then we can avoid
7638 calling type_name. */
7642 {
7645 }
7647 /* Look for the type-name. */
7652 /* Look for the `::' token. */
7654 }
7655 else
7658 /* Look for the `~'. */
7661 /* Once we see the ~, this has to be a pseudo-destructor. */
7665 /* Look for the type-name again. We are not responsible for
7666 checking that it matches the first type-name. */
7668 }
7670 /* Parse a unary-expression.
7672 unary-expression:
7673 postfix-expression
7674 ++ cast-expression
7675 -- cast-expression
7676 unary-operator cast-expression
7677 sizeof unary-expression
7678 sizeof ( type-id )
7679 alignof ( type-id ) [C++0x]
7680 new-expression
7681 delete-expression
7683 GNU Extensions:
7685 unary-expression:
7686 __extension__ cast-expression
7687 __alignof__ unary-expression
7688 __alignof__ ( type-id )
7689 alignof unary-expression [C++0x]
7690 __real__ cast-expression
7691 __imag__ cast-expression
7692 && identifier
7693 sizeof ( type-id ) { initializer-list , [opt] }
7694 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7695 __alignof__ ( type-id ) { initializer-list , [opt] }
7697 ADDRESS_P is true iff the unary-expression is appearing as the
7698 operand of the `&' operator. CAST_P is true if this expression is
7699 the target of a cast.
7701 Returns a representation of the expression. */
7703 static cp_expr
7706 {
7710 /* Peek at the next token. */
7712 /* Some keywords give away the kind of expression. */
7714 {
7718 {
7721 {
7724 location_t first_loc;
7727 /* Consume the token. */
7730 /* Parse the operand. */
7735 else
7736 {
7737 /* ISO C++ defines alignof only with types, not with
7738 expressions. So pedwarn if alignof is used with a non-
7739 type expression. However, __alignof__ is ok. */
7742 "ISO C++ does not allow %<alignof%> "
7746 }
7747 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7748 SIZEOF_EXPR with the original operand. */
7750 {
7752 {
7754 {
7757 error_mark_node));
7759 }
7760 else
7764 }
7766 }
7768 }
7777 {
7778 /* The saved value of the PEDANTIC flag. */
7780 tree expr;
7782 /* Save away the PEDANTIC flag. */
7784 /* Parse the cast-expression. */
7786 /* Restore the PEDANTIC flag. */
7790 }
7794 {
7795 tree expression;
7797 /* Consume the `__real__' or `__imag__' token. */
7799 /* Parse the cast-expression. */
7801 /* Create the complete representation. */
7805 expression,
7806 tf_warning_or_error);
7807 }
7815 {
7816 tree expr;
7826 parser->type_definition_forbidden_message
7829 saved_integral_constant_expression_p
7831 saved_non_integral_constant_expression_p
7835 saved_greater_than_is_operator_p
7847 parser->greater_than_is_operator_p
7850 parser->integral_constant_expression_p
7852 parser->non_integral_constant_expression_p
7859 }
7863 }
7864 }
7866 /* Look for the `:: new' and `:: delete', which also signal the
7867 beginning of a new-expression, or delete-expression,
7868 respectively. If the next token is `::', then it might be one of
7869 these. */
7871 {
7874 /* See if the token after the `::' is one of the keywords in
7875 which we're interested. */
7877 /* If it's `new', we have a new-expression. */
7880 /* Similarly, for `delete'. */
7883 }
7885 /* Look for a unary operator. */
7887 /* The `++' and `--' operators can be handled similarly, even though
7888 they are not technically unary-operators in the grammar. */
7890 {
7895 /* Handle the GNU address-of-label extension. */
7898 {
7899 tree identifier;
7900 tree expression;
7903 /* Consume the '&&' token. */
7905 /* Look for the identifier. */
7906 location_t finish_loc
7909 /* Construct a location of the form:
7910 &&label
7911 ^~~~~~~
7912 with caret==start at the "&&", finish at the end of the label. */
7913 location_t combined_loc
7915 /* Create an expression representing the address. */
7918 NIC_ADDR_LABEL))
7921 }
7922 }
7924 {
7925 cp_expr cast_expression;
7931 /* Consume the operator token. */
7935 /* Parse the cast-expression. */
7936 cast_expression
7941 pidk);
7943 /* Make a location:
7944 OP_TOKEN CAST_EXPRESSION
7945 ^~~~~~~~~~~~~~~~~~~~~~~~~
7946 with start==caret at the operator token, and
7947 extending to the end of the cast_expression. */
7950 /* Now, build an appropriate representation. */
7952 {
7956 RO_UNARY_STAR,
7957 complain);
7958 /* TODO: build_x_indirect_ref does not always honor the
7959 location, so ensure it is set. */
7965 /* Fall through. */
7968 cast_expression,
7969 complain);
7970 /* TODO: build_x_unary_op does not always honor the location,
7971 so ensure it is set. */
7979 /* Fall through. */
7981 /* Immediately fold negation of a constant, unless the constant is 0
7982 (since -0 == 0) or it would overflow. */
7987 {
7990 cast_expression);
7992 {
7995 }
7996 }
7997 /* Fall through. */
8006 }
8010 non_constant_p))
8014 }
8018 decltype_p,
8019 pidk);
8020 }
8022 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8023 unary-operator, the corresponding tree code is returned. */
8025 static enum tree_code
8027 {
8029 {
8050 }
8051 }
8053 /* Parse a new-expression.
8055 new-expression:
8056 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8057 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8059 Returns a representation of the expression. */
8061 static tree
8063 {
8066 tree type;
8069 tree ret;
8073 /* Look for the optional `::' operator. */
8074 global_scope_p
8078 /* Look for the `new' operator. */
8080 /* There's no easy way to tell a new-placement from the
8081 `( type-id )' construct. */
8083 /* Look for a new-placement. */
8085 /* If that didn't work out, there's no new-placement. */
8087 {
8091 }
8093 /* If the next token is a `(', then we have a parenthesized
8094 type-id. */
8096 {
8100 /* Consume the `('. */
8103 /* Parse the type-id. */
8104 parser->type_definition_forbidden_message
8106 {
8109 }
8112 /* Look for the closing `)'. */
8115 /* There should not be a direct-new-declarator in this production,
8116 but GCC used to allowed this, so we check and emit a sensible error
8117 message for this case. */
8119 {
8125 }
8126 }
8127 /* Otherwise, there must be a new-type-id. */
8128 else
8131 /* If the next token is a `(' or '{', then we have a new-initializer. */
8136 else
8139 /* A new-expression may not appear in an integral constant
8140 expression. */
8143 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8144 of a new-type-id or type-id of a new-expression, the new-expression shall
8145 contain a new-initializer of the form ( assignment-expression )".
8146 Additionally, consistently with the spirit of DR 1467, we want to accept
8147 'new auto { 2 }' too. */
8152 {
8154 "initialization of new-expression for type %<auto%> "
8157 }
8158 else
8159 {
8160 /* Construct a location e.g.:
8161 ptr = new int[100]
8162 ^~~~~~~~~~~~
8163 with caret == start at the start of the "new" token, and the end
8164 at the end of the final token we consumed. */
8169 /* Create a representation of the new-expression. */
8171 tf_warning_or_error);
8173 }
8181 }
8183 /* Parse a new-placement.
8185 new-placement:
8186 ( expression-list )
8188 Returns the same representation as for an expression-list. */
8192 {
8195 /* Parse the expression-list. */
8196 expression_list = (cp_parser_parenthesized_expression_list
8205 }
8207 /* Parse a new-type-id.
8209 new-type-id:
8210 type-specifier-seq new-declarator [opt]
8212 Returns the TYPE allocated. If the new-type-id indicates an array
8213 type, *NELTS is set to the number of elements in the last array
8214 bound; the TYPE will not include the last array bound. */
8216 static tree
8218 {
8219 cp_decl_specifier_seq type_specifier_seq;
8225 /* The type-specifier sequence must not contain type definitions.
8226 (It cannot contain declarations of new types either, but if they
8227 are not definitions we will catch that because they are not
8228 complete.) */
8230 parser->type_definition_forbidden_message
8232 /* Parse the type-specifier-seq. */
8236 /* Restore the old message. */
8242 /* Parse the new-declarator. */
8245 /* Determine the number of elements in the last array dimension, if
8246 any. */
8248 /* Skip down to the last array dimension. */
8253 {
8256 }
8261 {
8264 }
8267 {
8274 else
8276 }
8279 }
8281 /* Parse an (optional) new-declarator.
8283 new-declarator:
8284 ptr-operator new-declarator [opt]
8285 direct-new-declarator
8287 Returns the declarator. */
8291 {
8294 cp_cv_quals cv_quals;
8296 /* We don't know if there's a ptr-operator next, or not. */
8298 /* Look for a ptr-operator. */
8300 /* If that worked, look for more new-declarators. */
8302 {
8305 /* Parse another optional declarator. */
8308 declarator = cp_parser_make_indirect_declarator
8312 }
8314 /* If the next token is a `[', there is a direct-new-declarator. */
8319 }
8321 /* Parse a direct-new-declarator.
8323 direct-new-declarator:
8324 [ expression ]
8325 direct-new-declarator [constant-expression]
8327 */
8331 {
8335 {
8336 tree expression;
8339 /* Look for the opening `['. */
8344 /* The standard requires that the expression have integral
8345 type. DR 74 adds enumeration types. We believe that the
8346 real intent is that these expressions be handled like the
8347 expression in a `switch' condition, which also allows
8348 classes with a single conversion to integral or
8349 enumeration type. */
8351 {
8352 expression
8354 expression,
8357 {
8359 "expression in new-declarator must have integral "
8362 }
8363 }
8365 /* Look for the closing `]'. */
8368 /* Add this bound to the declarator. */
8371 /* If the next token is not a `[', then there are no more
8372 bounds. */
8375 }
8378 }
8380 /* Parse a new-initializer.
8382 new-initializer:
8383 ( expression-list [opt] )
8384 braced-init-list
8386 Returns a representation of the expression-list. */
8390 {
8394 {
8395 tree t;
8402 }
8403 else
8404 expression_list = (cp_parser_parenthesized_expression_list
8410 }
8412 /* Parse a delete-expression.
8414 delete-expression:
8415 :: [opt] delete cast-expression
8416 :: [opt] delete [ ] cast-expression
8418 Returns a representation of the expression. */
8420 static tree
8422 {
8425 tree expression;
8427 /* Look for the optional `::' operator. */
8428 global_scope_p
8432 /* Look for the `delete' keyword. */
8434 /* See if the array syntax is in use. */
8436 {
8437 /* Consume the `[' token. */
8439 /* Look for the `]' token. */
8441 /* Remember that this is the `[]' construct. */
8443 }
8444 else
8447 /* Parse the cast-expression. */
8450 /* A delete-expression may not appear in an integral constant
8451 expression. */
8456 tf_warning_or_error);
8457 }
8459 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8460 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8461 0 otherwise. */
8463 static int
8465 {
8468 {
8510 /* In ((type ()) () the last () isn't a valid cast-expression,
8511 so the whole must be parsed as postfix-expression. */
8516 /* '[' may start a primary-expression in obj-c++ and in C++11,
8517 as a lambda-expression, eg, '(void)[]{}'. */
8524 /* '++' and '--' may or may not start a cast-expression:
8526 struct T { void operator++(int); };
8527 void f() { (T())++; }
8529 vs
8531 int a;
8532 (int)++a; */
8537 }
8538 }
8540 /* Parse a cast-expression.
8542 cast-expression:
8543 unary-expression
8544 ( type-id ) cast-expression
8546 ADDRESS_P is true iff the unary-expression is appearing as the
8547 operand of the `&' operator. CAST_P is true if this expression is
8548 the target of a cast.
8550 Returns a representation of the expression. */
8552 static cp_expr
8555 {
8556 /* If it's a `(', then we might be looking at a cast. */
8558 {
8564 /* There's no way to know yet whether or not this is a cast.
8565 For example, `(int (3))' is a unary-expression, while `(int)
8566 3' is a cast. So, we resort to parsing tentatively. */
8568 /* Types may not be defined in a cast. */
8570 parser->type_definition_forbidden_message
8572 /* Consume the `('. */
8576 /* A very tricky bit is that `(struct S) { 3 }' is a
8577 compound-literal (which we permit in C++ as an extension).
8578 But, that construct is not a cast-expression -- it is a
8579 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8580 is legal; if the compound-literal were a cast-expression,
8581 you'd need an extra set of parentheses.) But, if we parse
8582 the type-id, and it happens to be a class-specifier, then we
8583 will commit to the parse at that point, because we cannot
8584 undo the action that is done when creating a new class. So,
8585 then we cannot back up and do a postfix-expression.
8587 Another tricky case is the following (c++/29234):
8589 struct S { void operator () (); };
8591 void foo ()
8592 {
8593 ( S()() );
8594 }
8596 As a type-id we parse the parenthesized S()() as a function
8597 returning a function, groktypename complains and we cannot
8598 back up in this case either.
8600 Therefore, we scan ahead to the closing `)', and check to see
8601 if the tokens after the `)' can start a cast-expression. Otherwise
8602 we are dealing with an unary-expression, a postfix-expression
8603 or something else.
8605 Yet another tricky case, in C++11, is the following (c++/54891):
8607 (void)[]{};
8609 The issue is that usually, besides the case of lambda-expressions,
8610 the parenthesized type-id cannot be followed by '[', and, eg, we
8611 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8612 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8613 we don't commit, we try a cast-expression, then an unary-expression.
8615 Save tokens so that we can put them back. */
8618 /* We may be looking at a cast-expression. */
8621 cast_expression
8624 /* Roll back the tokens we skipped. */
8626 /* If we aren't looking at a cast-expression, simulate an error so
8627 that the call to cp_parser_error_occurred below returns true. */
8630 else
8631 {
8634 /* Look for the type-id. */
8636 /* Look for the closing `)'. */
8639 }
8641 /* Restore the saved message. */
8644 /* At this point this can only be either a cast or a
8645 parenthesized ctor such as `(T ())' that looks like a cast to
8646 function returning T. */
8648 {
8649 /* Only commit if the cast-expression doesn't start with
8650 '++', '--', or '[' in C++11. */
8658 pidk);
8661 {
8662 /* Warn about old-style casts, if so requested. */
8669 /* Only type conversions to integral or enumeration types
8670 can be used in constant-expressions. */
8673 NIC_CAST))
8676 /* Perform the cast. */
8677 /* Make a location:
8678 (TYPE) EXPR
8679 ^~~~~~~~~~~
8680 with start==caret at the open paren, extending to the
8681 end of "expr". */
8683 open_paren_loc,
8687 }
8688 }
8689 else
8691 }
8693 /* If we get here, then it's not a cast, so it must be a
8694 unary-expression. */
8697 }
8699 /* Parse a binary expression of the general form:
8701 pm-expression:
8702 cast-expression
8703 pm-expression .* cast-expression
8704 pm-expression ->* cast-expression
8706 multiplicative-expression:
8707 pm-expression
8708 multiplicative-expression * pm-expression
8709 multiplicative-expression / pm-expression
8710 multiplicative-expression % pm-expression
8712 additive-expression:
8713 multiplicative-expression
8714 additive-expression + multiplicative-expression
8715 additive-expression - multiplicative-expression
8717 shift-expression:
8718 additive-expression
8719 shift-expression << additive-expression
8720 shift-expression >> additive-expression
8722 relational-expression:
8723 shift-expression
8724 relational-expression < shift-expression
8725 relational-expression > shift-expression
8726 relational-expression <= shift-expression
8727 relational-expression >= shift-expression
8729 GNU Extension:
8731 relational-expression:
8732 relational-expression <? shift-expression
8733 relational-expression >? shift-expression
8735 equality-expression:
8736 relational-expression
8737 equality-expression == relational-expression
8738 equality-expression != relational-expression
8740 and-expression:
8741 equality-expression
8742 and-expression & equality-expression
8744 exclusive-or-expression:
8745 and-expression
8746 exclusive-or-expression ^ and-expression
8748 inclusive-or-expression:
8749 exclusive-or-expression
8750 inclusive-or-expression | exclusive-or-expression
8752 logical-and-expression:
8753 inclusive-or-expression
8754 logical-and-expression && inclusive-or-expression
8756 logical-or-expression:
8757 logical-and-expression
8758 logical-or-expression || logical-and-expression
8760 All these are implemented with a single function like:
8762 binary-expression:
8763 simple-cast-expression
8764 binary-expression <token> binary-expression
8766 CAST_P is true if this expression is the target of a cast.
8768 The binops_by_token map is used to get the tree codes for each <token> type.
8769 binary-expressions are associated according to a precedence table. */
8771 #define TOKEN_PRECEDENCE(token) \
8772 (((token->type == CPP_GREATER \
8773 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8774 && !parser->greater_than_is_operator_p) \
8775 ? PREC_NOT_OPERATOR \
8776 : binops_by_token[token->type].prec)
8778 static cp_expr
8784 {
8785 cp_parser_expression_stack stack;
8787 cp_parser_expression_stack_entry current;
8788 cp_expr rhs;
8792 tree overload;
8794 /* Parse the first expression. */
8805 {
8806 /* Get an operator token. */
8812 {
8814 "%<>>%> operator is treated"
8818 }
8823 /* This is a fold-expression; handle it later. */
8826 /* Popping an entry off the stack means we completed a subexpression:
8827 - either we found a token which is not an operator (`>' where it is not
8828 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8829 will happen repeatedly;
8830 - or, we found an operator which has lower priority. This is the case
8831 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8832 parsing `3 * 4'. */
8834 {
8837 else
8839 }
8841 get_rhs:
8845 /* We used the operator token. */
8848 /* For "false && x" or "true || x", x will never be executed;
8849 disable warnings while evaluating it. */
8851 c_inhibit_evaluation_warnings +=
8854 c_inhibit_evaluation_warnings +=
8857 /* Extract another operand. It may be the RHS of this expression
8858 or the LHS of a new, higher priority expression. */
8863 /* Get another operator token. Look up its precedence to avoid
8864 building a useless (immediately popped) stack entry for common
8865 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8872 {
8873 /* ... and prepare to parse the RHS of the new, higher priority
8874 expression. Since precedence levels on the stack are
8875 monotonically increasing, we do not have to care about
8876 stack overflows. */
8885 pop:
8887 /* If the stack is not empty, we have parsed into LHS the right side
8888 (`4' in the example above) of an expression we had suspended.
8889 We can use the information on the stack to recover the LHS (`3')
8890 from the stack together with the tree code (`MULT_EXPR'), and
8891 the precedence of the higher level subexpression
8892 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8893 which will be used to actually build the additive expression. */
8898 }
8900 /* Undo the disabling of warnings done above. */
8902 c_inhibit_evaluation_warnings -=
8905 c_inhibit_evaluation_warnings -=
8911 /* Avoid warning for !!x == y. */
8916 /* Avoid warning for !b == y where b is boolean. */
8920 /* Avoid warning for !!b == y where b is boolean. */
8933 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8934 ERROR_MARK for everything that is not a binary expression.
8935 This makes warn_about_parentheses miss some warnings that
8936 involve unary operators. For unary expressions we should
8937 pass the correct tree_code unless the unary expression was
8938 surrounded by parentheses.
8939 */
8946 == tcc_comparison
8949 else
8950 {
8955 /* TODO: build_x_binary_op doesn't always honor the location. */
8957 }
8960 /* If the binary operator required the use of an overloaded operator,
8961 then this expression cannot be an integral constant-expression.
8962 An overloaded operator can be used even if both operands are
8963 otherwise permissible in an integral constant-expression if at
8964 least one of the operands is of enumeration type. */
8968 NIC_OVERLOADED))
8970 }
8973 }
8975 static cp_expr
8980 {
8983 }
8985 /* Parse the `? expression : assignment-expression' part of a
8986 conditional-expression. The LOGICAL_OR_EXPR is the
8987 logical-or-expression that started the conditional-expression.
8988 Returns a representation of the entire conditional-expression.
8990 This routine is used by cp_parser_assignment_expression.
8992 ? expression : assignment-expression
8994 GNU Extensions:
8996 ? : assignment-expression */
8998 static tree
9000 {
9002 cp_expr assignment_expr;
9006 /* Consume the `?' token. */
9011 {
9014 /* Implicit true clause. */
9016 c_inhibit_evaluation_warnings +=
9019 }
9020 else
9021 {
9024 /* Parse the expression. */
9025 c_inhibit_evaluation_warnings +=
9028 c_inhibit_evaluation_warnings +=
9032 }
9034 /* The next token should be a `:'. */
9036 /* Parse the assignment-expression. */
9038 c_inhibit_evaluation_warnings -=
9041 /* Make a location:
9042 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9043 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9044 with the caret at the "?", ranging from the start of
9045 the logical_or_expr to the end of the assignment_expr. */
9050 /* Build the conditional-expression. */
9052 expr,
9053 assignment_expr,
9054 tf_warning_or_error);
9055 }
9057 /* Parse an assignment-expression.
9059 assignment-expression:
9060 conditional-expression
9061 logical-or-expression assignment-operator assignment_expression
9062 throw-expression
9064 CAST_P is true if this expression is the target of a cast.
9065 DECLTYPE_P is true if this expression is the operand of decltype.
9067 Returns a representation for the expression. */
9069 static cp_expr
9072 {
9073 cp_expr expr;
9075 /* If the next token is the `throw' keyword, then we're looking at
9076 a throw-expression. */
9079 /* Otherwise, it must be that we are looking at a
9080 logical-or-expression. */
9081 else
9082 {
9083 /* Parse the binary expressions (logical-or-expression). */
9085 decltype_p,
9087 /* If the next token is a `?' then we're actually looking at a
9088 conditional-expression. */
9091 else
9092 {
9095 /* If it's an assignment-operator, we're using the second
9096 production. */
9097 enum tree_code assignment_operator
9100 {
9103 /* Parse the right-hand side of the assignment. */
9110 /* An assignment may not appear in a
9111 constant-expression. */
9113 NIC_ASSIGNMENT))
9115 /* Build the assignment expression. Its default
9116 location:
9117 LHS = RHS
9118 ~~~~^~~~~
9119 is the location of the '=' token as the
9120 caret, ranging from the start of the lhs to the
9121 end of the rhs. */
9126 assignment_operator,
9127 rhs,
9129 /* TODO: build_x_modify_expr doesn't honor the location,
9130 so we must set it here. */
9132 }
9133 }
9134 }
9137 }
9139 /* Parse an (optional) assignment-operator.
9141 assignment-operator: one of
9142 = *= /= %= += -= >>= <<= &= ^= |=
9144 GNU Extension:
9146 assignment-operator: one of
9147 <?= >?=
9149 If the next token is an assignment operator, the corresponding tree
9150 code is returned, and the token is consumed. For example, for
9151 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9152 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9153 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9154 operator, ERROR_MARK is returned. */
9156 static enum tree_code
9158 {
9162 /* Peek at the next token. */
9166 {
9212 /* Nothing else is an assignment operator. */
9214 }
9216 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9221 /* If it was an assignment operator, consume it. */
9226 }
9228 /* Parse an expression.
9230 expression:
9231 assignment-expression
9232 expression , assignment-expression
9234 CAST_P is true if this expression is the target of a cast.
9235 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9236 except possibly parenthesized or on the RHS of a comma (N3276).
9238 Returns a representation of the expression. */
9240 static cp_expr
9243 {
9248 {
9249 cp_expr assignment_expression;
9251 /* Parse the next assignment-expression. */
9252 assignment_expression
9255 /* We don't create a temporary for a call that is the immediate operand
9256 of decltype or on the RHS of a comma. But when we see a comma, we
9257 need to create a temporary for a call on the LHS. */
9262 assignment_expression
9266 /* If this is the first assignment-expression, we can just
9267 save it away. */
9270 else
9271 {
9272 /* Create a location with caret at the comma, ranging
9273 from the start of the LHS to the end of the RHS. */
9278 assignment_expression,
9281 }
9282 /* If the next token is not a comma, or we're in a fold-expression, then
9283 we are done with the expression. */
9287 /* Consume the `,'. */
9290 /* A comma operator cannot appear in a constant-expression. */
9293 }
9296 }
9298 /* Parse a constant-expression.
9300 constant-expression:
9301 conditional-expression
9303 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9304 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9305 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9306 is false, NON_CONSTANT_P should be NULL. */
9308 static cp_expr
9312 {
9316 cp_expr expression;
9318 /* It might seem that we could simply parse the
9319 conditional-expression, and then check to see if it were
9320 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9321 one that the compiler can figure out is constant, possibly after
9322 doing some simplifications or optimizations. The standard has a
9323 precise definition of constant-expression, and we must honor
9324 that, even though it is somewhat more restrictive.
9326 For example:
9328 int i[(2, 3)];
9330 is not a legal declaration, because `(2, 3)' is not a
9331 constant-expression. The `,' operator is forbidden in a
9332 constant-expression. However, GCC's constant-folding machinery
9333 will fold this operation to an INTEGER_CST for `3'. */
9335 /* Save the old settings. */
9337 saved_allow_non_integral_constant_expression_p
9340 /* We are now parsing a constant-expression. */
9342 parser->allow_non_integral_constant_expression_p
9345 /* Although the grammar says "conditional-expression", we parse an
9346 "assignment-expression", which also permits "throw-expression"
9347 and the use of assignment operators. In the case that
9348 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9349 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9350 actually essential that we look for an assignment-expression.
9351 For example, cp_parser_initializer_clauses uses this function to
9352 determine whether a particular assignment-expression is in fact
9353 constant. */
9355 /* Restore the old settings. */
9356 parser->integral_constant_expression_p
9358 parser->allow_non_integral_constant_expression_p
9361 {
9362 /* Require an rvalue constant expression here; that's what our
9363 callers expect. Reference constant expressions are handled
9364 separately in e.g. cp_parser_template_argument. */
9369 }
9372 parser->non_integral_constant_expression_p
9376 }
9378 /* Parse __builtin_offsetof.
9380 offsetof-expression:
9381 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9383 offsetof-member-designator:
9384 id-expression
9385 | offsetof-member-designator "." id-expression
9386 | offsetof-member-designator "[" expression "]"
9387 | offsetof-member-designator "->" id-expression */
9389 static cp_expr
9391 {
9393 tree type;
9394 cp_expr expr;
9395 cp_id_kind dummy;
9397 location_t finish_loc;
9399 /* We're about to accept non-integral-constant things, but will
9400 definitely yield an integral constant expression. Save and
9401 restore these values around our local parsing. */
9407 /* Consume the "__builtin_offsetof" token. */
9409 /* Consume the opening `('. */
9411 /* Parse the type-id. */
9414 /* Look for the `,'. */
9418 /* Build the (type *)null that begins the traditional offsetof macro. */
9420 tf_warning_or_error);
9422 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9426 {
9429 {
9431 /* offsetof-member-designator "[" expression "]" */
9437 /* offsetof-member-designator "->" identifier */
9440 /* FALLTHRU */
9443 /* offsetof-member-designator "." identifier */
9451 /* Consume the ")" token. */
9457 /* Error. We know the following require will fail, but
9458 that gives the proper error message. */
9463 }
9464 }
9466 success:
9467 /* Make a location of the form:
9468 __builtin_offsetof (struct s, f)
9469 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9470 with caret at the type-id, ranging from the start of the
9471 "_builtin_offsetof" token to the close paren. */
9473 /* The result will be an INTEGER_CST, so we need to explicitly
9474 preserve the location. */
9477 failure:
9482 }
9484 /* Parse a trait expression.
9486 Returns a representation of the expression, the underlying type
9487 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9489 static tree
9491 {
9492 cp_trait_kind kind;
9498 {
9586 }
9588 /* Consume the token. */
9593 {
9596 }
9602 {
9605 {
9608 }
9612 }
9614 {
9616 {
9620 {
9623 }
9627 }
9628 }
9632 /* Complete the trait expression, which may mean either processing
9633 the trait expr now or saving it for template instantiation. */
9635 {
9644 }
9645 }
9647 /* Lambdas that appear in variable initializer or default argument scope
9648 get that in their mangling, so we need to record it. We might as well
9649 use the count for function and namespace scopes as well. */
9653 {
9654 tree t;
9656 };
9659 static void
9661 {
9662 tree_int ti;
9664 /* Once we're inside a function, we ignore other scopes and just push
9665 the function again so that popping works properly. */
9672 {
9673 /* Don't reset the count if we're still in the same function. */
9676 }
9677 }
9679 static void
9681 {
9684 }
9686 static void
9688 {
9691 {
9694 }
9696 }
9698 /* Parse a lambda expression.
9700 lambda-expression:
9701 lambda-introducer lambda-declarator [opt] compound-statement
9703 Returns a representation of the expression. */
9705 static cp_expr
9707 {
9709 tree type;
9717 {
9719 {
9723 }
9725 }
9727 {
9729 {
9732 }
9734 }
9736 /* We may be in the middle of deferred access check. Disable
9737 it now. */
9748 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9751 /* Now that we've started the type, add the capture fields for any
9752 explicit captures. */
9755 {
9756 /* Inside the class, surrounding template-parameter-lists do not apply. */
9757 unsigned int saved_num_template_parameter_lists
9761 bool fully_implicit_function_template_p
9765 bool auto_is_implicit_function_template_parm_p
9776 /* By virtue of defining a local class, a lambda expression has access to
9777 the private variables of enclosing classes. */
9785 {
9790 }
9792 {
9795 }
9797 /* The capture list was built up in reverse order; fix that now. */
9809 parser->fully_implicit_function_template_p
9813 parser->auto_is_implicit_function_template_parm_p
9815 }
9817 /* This field is only used during parsing of the lambda. */
9820 /* This lambda shouldn't have any proxies left at this point. */
9822 /* And now that we're done, push proxies for an enclosing lambda. */
9827 else
9835 }
9837 /* Parse the beginning of a lambda expression.
9839 lambda-introducer:
9840 [ lambda-capture [opt] ]
9842 LAMBDA_EXPR is the current representation of the lambda expression. */
9844 static void
9846 {
9847 /* Need commas after the first capture. */
9850 /* Eat the leading `['. */
9853 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9861 {
9864 }
9867 {
9869 tree capture_id;
9870 tree capture_init_expr;
9874 enum capture_kind_type
9875 {
9876 BY_COPY,
9877 BY_REFERENCE
9878 };
9882 {
9885 }
9889 else
9892 /* Possibly capture `this'. */
9894 {
9904 explicit_init_p);
9906 }
9908 /* Remember whether we want to capture as a reference or not. */
9910 {
9913 }
9915 /* Get the identifier. */
9920 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9921 delimiters, but I modified this to stop on unnested ']' as well. It
9922 was already changed to stop on unnested '}', so the
9923 "closing_parenthesis" name is no more misleading with my change. */
9924 {
9930 }
9932 /* Find the initializer for this capture. */
9936 {
9938 /* An explicit initializer exists. */
9941 "lambda capture initializers "
9947 {
9950 }
9951 }
9952 else
9953 {
9956 /* Turn the identifier into an id-expression. */
9957 capture_init_expr
9962 {
9965 }
9969 {
9972 capture_init_expr);
9976 }
9979 {
9982 capture_init_expr))
9986 }
9988 capture_init_expr
9989 = finish_id_expression
9991 capture_init_expr,
10005 {
10008 }
10009 else
10011 }
10015 {
10020 capture_id);
10024 "capture of %qD redundant with by-reference capture "
10026 }
10029 capture_id,
10030 capture_init_expr,
10032 explicit_init_p);
10033 }
10036 }
10038 /* Parse the (optional) middle of a lambda expression.
10040 lambda-declarator:
10041 < template-parameter-list [opt] >
10042 ( parameter-declaration-clause [opt] )
10043 attribute-specifier [opt]
10044 decl-specifier-seq [opt]
10045 exception-specification [opt]
10046 lambda-return-type-clause [opt]
10048 LAMBDA_EXPR is the current representation of the lambda expression. */
10050 static bool
10052 {
10053 /* 5.1.1.4 of the standard says:
10054 If a lambda-expression does not include a lambda-declarator, it is as if
10055 the lambda-declarator were ().
10056 This means an empty parameter list, no attributes, and no exception
10057 specification. */
10063 cp_decl_specifier_seq lambda_specs;
10066 /* The template-parameter-list is optional, but must begin with
10067 an opening angle if present. */
10069 {
10072 "lambda templates are only available with "
10081 /* We just processed one more parameter list. */
10083 }
10085 /* The parameter-declaration-clause is optional (unless
10086 template-parameter-list was given), but must begin with an
10087 opening parenthesis if present. */
10089 {
10094 /* Parse parameters. */
10097 /* Default arguments shall not be specified in the
10098 parameter-declaration-clause of a lambda-declarator. */
10108 /* In the decl-specifier-seq of the lambda-declarator, each
10109 decl-specifier shall either be mutable or constexpr. */
10113 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10116 {
10121 }
10125 /* Parse optional exception specification. */
10128 /* Parse optional trailing return type. */
10130 {
10134 }
10136 /* The function parameters must be in scope all the way until after the
10137 trailing-return-type in case of decltype. */
10139 }
10143 /* Create the function call operator.
10145 Messing with declarators like this is no uglier than building up the
10146 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10147 other code. */
10148 {
10149 cp_decl_specifier_seq return_type_specs;
10151 tree fco;
10158 else
10159 /* Maybe we will deduce the return type later. */
10163 {
10167 else
10170 }
10175 sfk_none);
10180 VIRT_SPEC_UNSPECIFIED,
10181 REF_QUAL_NONE,
10182 tx_qual,
10183 exception_spec,
10189 declarator,
10190 attributes);
10192 {
10195 /* Give the object parameter a different name. */
10199 }
10201 {
10205 }
10214 }
10215 }
10217 /* Parse the body of a lambda expression, which is simply
10219 compound-statement
10221 but which requires special handling.
10222 LAMBDA_EXPR is the current representation of the lambda expression. */
10224 static void
10226 {
10231 else
10232 /* Still increment function_depth so that we don't GC in the
10233 middle of an expression. */
10237 /* Clear this in case we're in the middle of a default argument. */
10240 /* Finish the function call operator
10241 - class_specifier
10242 + late_parsing_for_member
10243 + function_definition_after_declarator
10244 + ctor_initializer_opt_and_function_body */
10245 {
10247 tree body;
10249 tree compound_stmt;
10250 tree cap;
10252 /* Let the front end know that we are going to be defining this
10253 function. */
10255 NULL_TREE,
10264 /* Push the proxies for any explicit captures. */
10271 /* 5.1.1.4 of the standard says:
10272 If a lambda-expression does not include a trailing-return-type, it
10273 is as if the trailing-return-type denotes the following type:
10274 * if the compound-statement is of the form
10275 { return attribute-specifier [opt] expression ; }
10276 the type of the returned expression after lvalue-to-rvalue
10277 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10278 (_conv.array_ 4.2), and function-to-pointer conversion
10279 (_conv.func_ 4.3);
10280 * otherwise, void. */
10282 /* In a lambda that has neither a lambda-return-type-clause
10283 nor a deducible form, errors should be reported for return statements
10284 in the body. Since we used void as the placeholder return type, parsing
10285 the body as usual will give such desired behavior. */
10289 {
10293 /* Parse tentatively in case there's more after the initial return
10294 statement. */
10305 {
10307 {
10312 }
10314 /* Will get error here if type not deduced yet. */
10318 }
10319 }
10322 {
10327 }
10331 out:
10335 /* Finish the function and generate code for it if necessary. */
10338 /* Only expand if the call op is not a template. */
10341 }
10347 else
10349 }
10351 /* Statements [gram.stmt.stmt] */
10353 /* Parse a statement.
10355 statement:
10356 labeled-statement
10357 expression-statement
10358 compound-statement
10359 selection-statement
10360 iteration-statement
10361 jump-statement
10362 declaration-statement
10363 try-block
10365 C++11:
10367 statement:
10368 labeled-statement
10369 attribute-specifier-seq (opt) expression-statement
10370 attribute-specifier-seq (opt) compound-statement
10371 attribute-specifier-seq (opt) selection-statement
10372 attribute-specifier-seq (opt) iteration-statement
10373 attribute-specifier-seq (opt) jump-statement
10374 declaration-statement
10375 attribute-specifier-seq (opt) try-block
10377 TM Extension:
10379 statement:
10380 atomic-statement
10382 IN_COMPOUND is true when the statement is nested inside a
10383 cp_parser_compound_statement; this matters for certain pragmas.
10385 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10386 is a (possibly labeled) if statement which is not enclosed in braces
10387 and has an else clause. This is used to implement -Wparentheses.
10389 CHAIN is a vector of if-else-if conditions. */
10391 static void
10394 {
10399 restart:
10402 /* There is no statement yet. */
10408 /* In obj-c++, seeing '[[' might be the either the beginning of
10409 c++11 attributes, or a nested objc-message-expression. So
10410 let's parse the c++11 attributes tentatively. */
10414 {
10417 }
10419 /* Peek at the next token. */
10421 /* Remember the location of the first token in the statement. */
10423 /* If this is a keyword, then that will often determine what kind of
10424 statement we have. */
10426 {
10430 {
10433 /* Looks like a labeled-statement with a case label.
10434 Parse the label, and then use tail recursion to parse
10435 the statement. */
10453 {
10458 }
10459 else
10473 {
10478 }
10479 else
10480 {
10484 }
10488 /* Objective-C++ exception-handling constructs. */
10502 /* This must be a namespace alias definition. */
10518 /* It might be a keyword like `int' that can start a
10519 declaration-statement. */
10521 }
10522 }
10524 {
10525 /* If the next token is a `:', then we are looking at a
10526 labeled-statement. */
10529 {
10530 /* Looks like a labeled-statement with an ordinary label.
10531 Parse the label, and then use tail recursion to parse
10532 the statement. */
10537 }
10538 }
10539 /* Anything that starts with a `{' must be a compound-statement. */
10542 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10543 a statement all its own. */
10545 {
10546 /* Only certain OpenMP pragmas are attached to statements, and thus
10547 are considered statements themselves. All others are not. In
10548 the context of a compound, accept the pragma as a "statement" and
10549 return so that we can check for a close brace. Otherwise we
10550 require a real statement and must go back and read one. */
10556 }
10558 {
10561 }
10563 /* Everything else must be a declaration-statement or an
10564 expression-statement. Try for the declaration-statement
10565 first, unless we are looking at a `;', in which case we know that
10566 we have an expression-statement. */
10568 {
10570 {
10572 {
10573 /* Attributes should be parsed as part of the the
10574 declaration, so let's un-parse them. */
10577 }
10580 /* Try to parse the declaration-statement. */
10582 /* If that worked, we're done. */
10585 }
10586 /* Look for an expression-statement instead. */
10588 }
10590 /* Set the line number for the statement. */
10594 /* Note that for now, we don't do anything with c++11 statements
10595 parsed at this level. */
10598 OPT_Wattributes,
10600 }
10602 /* Parse the label for a labeled-statement, i.e.
10604 identifier :
10605 case constant-expression :
10606 default :
10608 GNU Extension:
10609 case constant-expression ... constant-expression : statement
10611 When a label is parsed without errors, the label is added to the
10612 parse tree by the finish_* functions, so this function doesn't
10613 have to return the label. */
10615 static void
10617 {
10622 /* The next token should be an identifier. */
10626 {
10629 }
10633 {
10635 {
10639 /* Consume the `case' token. */
10641 /* Parse the constant-expression. */
10648 {
10649 /* Consume the `...' token. */
10655 /* We don't need to emit warnings here, as the common code
10656 will do this for us. */
10657 }
10658 else
10663 else
10666 expr);
10667 }
10671 /* Consume the `default' token. */
10676 else
10681 /* Anything else must be an ordinary label. */
10684 }
10686 /* Require the `:' token. */
10689 /* An ordinary label may optionally be followed by attributes.
10690 However, this is only permitted if the attributes are then
10691 followed by a semicolon. This is because, for backward
10692 compatibility, when parsing
10693 lab: __attribute__ ((unused)) int i;
10694 we want the attribute to attach to "i", not "lab". */
10697 {
10698 tree attrs;
10705 ;
10706 else
10708 }
10714 }
10716 /* Parse an expression-statement.
10718 expression-statement:
10719 expression [opt] ;
10721 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10722 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10723 indicates whether this expression-statement is part of an
10724 expression statement. */
10726 static tree
10728 {
10732 /* If the next token is a ';', then there is no expression
10733 statement. */
10735 {
10739 {
10742 }
10743 }
10745 /* Give a helpful message for "A<T>::type t;" and the like. */
10748 {
10755 {
10756 /* A::A a; */
10761 }
10762 }
10764 /* Consume the final `;'. */
10769 /* This is the final expression statement of a statement
10770 expression. */
10776 }
10778 /* Parse a compound-statement.
10780 compound-statement:
10781 { statement-seq [opt] }
10783 GNU extension:
10785 compound-statement:
10786 { label-declaration-seq [opt] statement-seq [opt] }
10788 label-declaration-seq:
10789 label-declaration
10790 label-declaration-seq label-declaration
10792 Returns a tree representing the statement. */
10794 static tree
10797 {
10798 tree compound_stmt;
10800 /* Consume the `{'. */
10807 /* Begin the compound-statement. */
10809 /* If the next keyword is `__label__' we have a label declaration. */
10812 /* Parse an (optional) statement-seq. */
10814 /* Finish the compound-statement. */
10816 /* Consume the `}'. */
10820 }
10822 /* Parse an (optional) statement-seq.
10824 statement-seq:
10825 statement
10826 statement-seq [opt] statement */
10828 static void
10830 {
10831 /* Scan statements until there aren't any more. */
10833 {
10836 /* If we are looking at a `}', then we have run out of
10837 statements; the same is true if we have reached the end
10838 of file, or have stumbled upon a stray '@end'. */
10845 /* If we are in a compound statement and find 'else' then
10846 something went wrong. */
10848 {
10851 else
10852 {
10855 }
10856 }
10858 /* Parse the statement. */
10860 }
10861 }
10863 /* Parse a selection-statement.
10865 selection-statement:
10866 if ( condition ) statement
10867 if ( condition ) statement else statement
10868 switch ( condition ) statement
10870 Returns the new IF_STMT or SWITCH_STMT.
10872 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10873 is a (possibly labeled) if statement which is not enclosed in
10874 braces and has an else clause. This is used to implement
10875 -Wparentheses.
10877 CHAIN is a vector of if-else-if conditions. This is used to implement
10878 -Wduplicated-cond. */
10880 static tree
10883 {
10886 token_indent_info guard_tinfo;
10891 /* Peek at the next token. */
10895 /* See what kind of keyword it is. */
10898 {
10901 {
10902 tree statement;
10903 tree condition;
10908 RID_CONSTEXPR))
10909 {
10915 }
10917 /* Look for the `('. */
10919 {
10922 }
10924 /* Begin the selection-statement. */
10926 {
10929 }
10930 else
10933 /* Parse the condition. */
10935 /* Look for the `)'. */
10941 {
10945 /* Add the condition. */
10952 /* Parse the then-clause. */
10956 /* Outside a template, the non-selected branch of a constexpr
10957 if is a 'discarded statement', i.e. unevaluated. */
10962 {
10965 }
10968 guard_tinfo);
10975 {
10979 }
10981 /* If the next token is `else', parse the else-clause. */
10983 RID_ELSE))
10984 {
10988 {
10991 }
10993 guard_tinfo
10995 /* Consume the `else' keyword. */
10998 {
11000 RID_IF)
11002 {
11003 /* We've got "if (COND) else if (COND2)". Start
11004 the condition chain and add COND as the first
11005 element. */
11009 {
11010 /* Wrap it in a NOP_EXPR so that we can set the
11011 location of the condition. */
11013 condition);
11016 }
11017 }
11019 RID_IF))
11020 {
11021 /* This is if-else without subsequent if. Zap the
11022 condition chain; we would have already warned at
11023 this point. */
11026 }
11027 }
11029 /* Parse the else-clause. */
11035 /* If we are currently parsing a then-clause, then
11036 IF_P will not be NULL. We set it to true to
11037 indicate that this if statement has an else clause.
11038 This may trigger the Wparentheses warning below
11039 when we get back up to the parent if statement. */
11044 {
11048 }
11049 }
11050 else
11051 {
11052 /* This if statement does not have an else clause. If
11053 NESTED_IF is true, then the then-clause has an if
11054 statement which does have an else clause. We warn
11055 about the potential ambiguity. */
11058 "suggest explicit braces to avoid ambiguous"
11061 {
11062 /* We don't need the condition chain anymore. */
11065 }
11066 }
11068 /* Now we're all done with the if-statement. */
11070 }
11071 else
11072 {
11076 /* Add the condition. */
11079 /* Parse the body of the switch-statement. */
11085 guard_tinfo);
11089 /* Now we're all done with the switch-statement. */
11091 }
11094 }
11100 }
11101 }
11103 /* Parse a condition.
11105 condition:
11106 expression
11107 type-specifier-seq declarator = initializer-clause
11108 type-specifier-seq declarator braced-init-list
11110 GNU Extension:
11112 condition:
11113 type-specifier-seq declarator asm-specification [opt]
11114 attributes [opt] = assignment-expression
11116 Returns the expression that should be tested. */
11118 static tree
11120 {
11121 cp_decl_specifier_seq type_specifiers;
11125 /* Try the declaration first. */
11127 /* New types are not allowed in the type-specifier-seq for a
11128 condition. */
11130 parser->type_definition_forbidden_message
11132 /* Parse the type-specifier-seq. */
11134 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11137 /* Restore the saved message. */
11139 /* If all is well, we might be looking at a declaration. */
11141 {
11142 tree decl;
11143 tree asm_specification;
11144 tree attributes;
11148 /* Parse the declarator. */
11154 /* Parse the attributes. */
11156 /* Parse the asm-specification. */
11158 /* If the next token is not an `=' or '{', then we might still be
11159 looking at an expression. For example:
11161 if (A(a).x)
11163 looks like a decl-specifier-seq and a declarator -- but then
11164 there is no `=', so this is an expression. */
11169 /* If we did see an `=' or '{', then we are looking at a declaration
11170 for sure. */
11172 {
11173 tree pushed_scope;
11177 /* Create the declaration. */
11183 /* Parse the initializer. */
11185 {
11189 }
11190 else
11191 {
11192 /* Consume the `='. */
11195 }
11199 /* Process the initializer. */
11202 asm_specification,
11203 flags);
11209 }
11210 }
11211 /* If we didn't even get past the declarator successfully, we are
11212 definitely not looking at a declaration. */
11213 else
11216 /* Otherwise, we are looking at an expression. */
11218 }
11220 /* Parses a for-statement or range-for-statement until the closing ')',
11221 not included. */
11223 static tree
11225 {
11229 /* Begin the for-statement. */
11232 /* Parse the initialization. */
11237 else
11239 }
11241 static tree
11243 {
11244 /* Normal for loop */
11247 tree stmt;
11250 /* The for-init-statement has already been parsed in
11251 cp_parser_for_init_statement, so no work is needed here. */
11254 /* If there's a condition, process it. */
11258 {
11262 }
11264 /* Look for the `;'. */
11267 /* If there's an expression, process it. */
11273 }
11275 /* Tries to parse a range-based for-statement:
11277 range-based-for:
11278 decl-specifier-seq declarator : expression
11280 The decl-specifier-seq declarator and the `:' are already parsed by
11281 cp_parser_for_init_statement. If processing_template_decl it returns a
11282 newly created RANGE_FOR_STMT; if not, it is converted to a
11283 regular FOR_STMT. */
11285 static tree
11288 {
11293 /* Get the range declaration momentarily out of the way so that
11294 the range expression doesn't clash with it. */
11296 {
11300 }
11303 {
11306 }
11307 else
11310 /* Put the range declaration back into scope. */
11312 {
11315 }
11317 /* If in template, STMT is converted to a normal for-statement
11318 at instantiation. If not, it is done just ahead. */
11320 {
11328 /* do_auto_deduction doesn't mess with template init-lists. */
11331 }
11332 else
11333 {
11336 }
11338 }
11340 /* Subroutine of cp_convert_range_for: given the initializer expression,
11341 builds up the range temporary. */
11343 static tree
11345 {
11348 /* Find out the type deduced by the declaration
11349 `auto &&__range = range_expr'. */
11354 /* Create the __range variable. */
11361 }
11363 /* Used by cp_parser_range_for in template context: we aren't going to
11364 do a full conversion yet, but we still need to resolve auto in the
11365 type of the for-range-declaration if present. This is basically
11366 a shortcut version of cp_convert_range_for. */
11368 static void
11370 {
11373 {
11376 iter_type = (cp_parser_perform_range_for_lookup
11379 {
11381 iter_type);
11383 tf_warning_or_error);
11386 }
11387 }
11388 }
11390 /* Converts a range-based for-statement into a normal
11391 for-statement, as per the definition.
11393 for (RANGE_DECL : RANGE_EXPR)
11394 BLOCK
11396 should be equivalent to:
11398 {
11399 auto &&__range = RANGE_EXPR;
11400 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11401 __begin != __end;
11402 ++__begin)
11403 {
11404 RANGE_DECL = *__begin;
11405 BLOCK
11406 }
11407 }
11409 If RANGE_EXPR is an array:
11410 BEGIN_EXPR = __range
11411 END_EXPR = __range + ARRAY_SIZE(__range)
11412 Else if RANGE_EXPR has a member 'begin' or 'end':
11413 BEGIN_EXPR = __range.begin()
11414 END_EXPR = __range.end()
11415 Else:
11416 BEGIN_EXPR = begin(__range)
11417 END_EXPR = end(__range);
11419 If __range has a member 'begin' but not 'end', or vice versa, we must
11420 still use the second alternative (it will surely fail, however).
11421 When calling begin()/end() in the third alternative we must use
11422 argument dependent lookup, but always considering 'std' as an associated
11423 namespace. */
11425 tree
11428 {
11434 /* If an error happened previously do nothing or else a lot of
11435 unhelpful errors would be issued. */
11437 else
11438 {
11439 tree range_temp;
11443 /* Can't bind a reference to an array of runtime bound. */
11445 else
11446 {
11451 LOOKUP_ONLYCONVERTING);
11453 }
11456 }
11458 /* The new for initialization statement. */
11466 LOOKUP_ONLYCONVERTING);
11477 LOOKUP_ONLYCONVERTING);
11481 /* The new for condition. */
11488 /* The new increment expression. */
11491 tf_warning_or_error);
11494 /* The declaration is initialized with *__begin inside the loop body. */
11497 tf_warning_or_error),
11499 LOOKUP_ONLYCONVERTING);
11502 }
11504 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11505 We need to solve both at the same time because the method used
11506 depends on the existence of members begin or end.
11507 Returns the type deduced for the iterator expression. */
11509 static tree
11511 {
11513 {
11516 }
11519 {
11524 }
11526 {
11527 /* If RANGE is an array, we will use pointer arithmetic. */
11530 range,
11534 }
11535 else
11536 {
11537 /* If it is not an array, we must do a bit of magic. */
11547 tf_warning_or_error);
11550 tf_warning_or_error);
11553 {
11554 /* Use the member functions. */
11557 else
11563 else
11566 }
11567 else
11568 {
11569 /* Use global functions with ADL. */
11576 tf_warning_or_error);
11578 tf_warning_or_error);
11580 tf_warning_or_error);
11582 tf_warning_or_error);
11585 }
11587 /* Last common checks. */
11589 {
11590 /* If one of the expressions is an error do no more checks. */
11593 }
11596 /* Can happen, when, eg, in a template context, Koenig lookup
11597 can't resolve begin/end (c++/58503). */
11599 else
11600 {
11602 /* The unqualified type of the __begin and __end temporaries should
11603 be the same, as required by the multiple auto declaration. */
11605 {
11612 /* P0184R0 allows __begin and __end to have different types,
11613 but make sure they are comparable so we can give a better
11615 else
11619 }
11621 }
11622 }
11623 }
11625 /* Helper function for cp_parser_perform_range_for_lookup.
11626 Builds a tree for RANGE.IDENTIFIER(). */
11628 static tree
11630 {
11643 tf_warning_or_error);
11646 }
11648 /* Parse an iteration-statement.
11650 iteration-statement:
11651 while ( condition ) statement
11652 do statement while ( expression ) ;
11653 for ( for-init-statement condition [opt] ; expression [opt] )
11654 statement
11656 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11658 static tree
11660 {
11663 tree statement;
11665 token_indent_info guard_tinfo;
11667 /* Peek at the next token. */
11674 /* Remember whether or not we are already within an iteration
11675 statement. */
11678 /* See what kind of keyword it is. */
11681 {
11683 {
11684 tree condition;
11686 /* Begin the while-statement. */
11688 /* Look for the `('. */
11690 /* Parse the condition. */
11693 /* Look for the `)'. */
11695 /* Parse the dependent statement. */
11699 /* We're done with the while-statement. */
11701 }
11705 {
11706 tree expression;
11708 /* Begin the do-statement. */
11710 /* Parse the body of the do-statement. */
11715 /* Look for the `while' keyword. */
11717 /* Look for the `('. */
11719 /* Parse the expression. */
11721 /* We're done with the do-statement. */
11723 /* Look for the `)'. */
11725 /* Look for the `;'. */
11727 }
11731 {
11732 /* Look for the `('. */
11737 /* Look for the `)'. */
11740 /* Parse the body of the for-statement. */
11745 /* We're done with the for-statement. */
11747 }
11754 }
11757 }
11759 /* Parse a for-init-statement or the declarator of a range-based-for.
11760 Returns true if a range-based-for declaration is seen.
11762 for-init-statement:
11763 expression-statement
11764 simple-declaration */
11766 static bool
11768 {
11769 /* If the next token is a `;', then we have an empty
11770 expression-statement. Grammatically, this is also a
11771 simple-declaration, but an invalid one, because it does not
11772 declare anything. Therefore, if we did not handle this case
11773 specially, we would issue an error message about an invalid
11774 declaration. */
11776 {
11780 /* A colon is used in range-based for. */
11783 /* We're going to speculatively look for a declaration, falling back
11784 to an expression, if necessary. */
11786 /* Parse the declaration. */
11789 decl);
11792 {
11793 /* It is a range-for, consume the ':' */
11797 {
11799 "range-based %<for%> loops only available with "
11802 }
11803 }
11804 else
11805 /* The ';' is not consumed yet because we told
11806 cp_parser_simple_declaration not to. */
11811 /* If the tentative parse failed, then we shall need to look for an
11812 expression-statement. */
11813 }
11814 /* If we are here, it is an expression-statement. */
11817 }
11819 /* Parse a jump-statement.
11821 jump-statement:
11822 break ;
11823 continue ;
11824 return expression [opt] ;
11825 return braced-init-list ;
11826 goto identifier ;
11828 GNU extension:
11830 jump-statement:
11831 goto * expression ;
11833 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
11835 static tree
11837 {
11843 /* Peek at the next token. */
11848 /* See what kind of keyword it is. */
11851 {
11855 {
11875 }
11881 {
11888 /* Fall through. */
11898 }
11903 {
11904 tree expr;
11908 {
11912 }
11915 else
11916 /* If the next token is a `;', then there is no
11917 expression. */
11919 /* Build the return-statement. */
11922 else
11924 /* Look for the final `;'. */
11926 }
11932 {
11935 }
11937 /* Create the goto-statement. */
11939 {
11940 /* Issue a warning about this use of a GNU extension. */
11942 /* Consume the '*' token. */
11944 /* Parse the dependent expression. */
11946 }
11947 else
11949 /* Look for the final `;'. */
11956 }
11959 }
11961 /* Parse a declaration-statement.
11963 declaration-statement:
11964 block-declaration */
11966 static void
11968 {
11971 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11974 /* Parse the block-declaration. */
11977 /* Free any declarators allocated. */
11979 }
11981 /* Some dependent statements (like `if (cond) statement'), are
11982 implicitly in their own scope. In other words, if the statement is
11983 a single statement (as opposed to a compound-statement), it is
11984 none-the-less treated as if it were enclosed in braces. Any
11985 declarations appearing in the dependent statement are out of scope
11986 after control passes that point. This function parses a statement,
11987 but ensures that is in its own scope, even if it is not a
11988 compound-statement.
11990 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11991 is a (possibly labeled) if statement which is not enclosed in
11992 braces and has an else clause. This is used to implement
11993 -Wparentheses.
11995 CHAIN is a vector of if-else-if conditions. This is used to implement
11996 -Wduplicated-cond.
11998 Returns the new statement. */
12000 static tree
12004 {
12005 tree statement;
12007 token_indent_info body_tinfo
12013 /* Mark if () ; with a special NOP_EXPR. */
12015 {
12026 }
12027 /* if a compound is opened, we simply parse the statement directly. */
12030 /* If the token is not a `{', then we must take special action. */
12031 else
12032 {
12033 /* Create a compound-statement. */
12035 /* Parse the dependent-statement. */
12037 /* Finish the dummy compound-statement. */
12039 }
12041 token_indent_info next_tinfo
12045 /* Return the statement. */
12047 }
12049 /* For some dependent statements (like `while (cond) statement'), we
12050 have already created a scope. Therefore, even if the dependent
12051 statement is a compound-statement, we do not want to create another
12052 scope. */
12054 static void
12057 {
12058 /* If the token is a `{', then we must take special action. */
12060 {
12061 token_indent_info body_tinfo
12065 token_indent_info next_tinfo
12068 }
12069 else
12070 {
12071 /* Avoid calling cp_parser_compound_statement, so that we
12072 don't create a new scope. Do everything else by hand. */
12074 /* If the next keyword is `__label__' we have a label declaration. */
12077 /* Parse an (optional) statement-seq. */
12080 }
12081 }
12083 /* Declarations [gram.dcl.dcl] */
12085 /* Parse an optional declaration-sequence.
12087 declaration-seq:
12088 declaration
12089 declaration-seq declaration */
12091 static void
12093 {
12095 {
12106 {
12107 /* A declaration consisting of a single semicolon is
12108 invalid. Allow it unless we're being pedantic. */
12113 }
12115 /* If we're entering or exiting a region that's implicitly
12116 extern "C", modify the lang context appropriately. */
12118 {
12121 }
12123 {
12126 }
12129 {
12130 /* A top-level declaration can consist solely of a #pragma.
12131 A nested declaration cannot, so this is done here and not
12132 in cp_parser_declaration. (A #pragma at block scope is
12133 handled in cp_parser_statement.) */
12136 }
12138 /* Parse the declaration itself. */
12140 }
12141 }
12143 /* Parse a declaration.
12145 declaration:
12146 block-declaration
12147 function-definition
12148 template-declaration
12149 explicit-instantiation
12150 explicit-specialization
12151 linkage-specification
12152 namespace-definition
12154 GNU extension:
12156 declaration:
12157 __extension__ declaration */
12159 static void
12161 {
12162 cp_token token1;
12163 cp_token token2;
12168 /* Check for the `__extension__' keyword. */
12170 {
12171 /* Parse the qualified declaration. */
12173 /* Restore the PEDANTIC flag. */
12177 }
12179 /* Try to figure out what kind of declaration is present. */
12184 else
12185 {
12188 }
12190 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12193 /* If the next token is `extern' and the following token is a string
12194 literal, then we have a linkage specification. */
12198 /* If the next token is `template', then we have either a template
12199 declaration, an explicit instantiation, or an explicit
12200 specialization. */
12202 {
12203 /* `template <>' indicates a template specialization. */
12207 /* `template <' indicates a template declaration. */
12210 /* Anything else must be an explicit instantiation. */
12211 else
12213 }
12214 /* If the next token is `export', then we have a template
12215 declaration. */
12218 /* If the next token is `extern', 'static' or 'inline' and the one
12219 after that is `template', we have a GNU extended explicit
12220 instantiation directive. */
12227 /* If the next token is `namespace', check for a named or unnamed
12228 namespace definition. */
12237 /* An unnamed namespace definition. */
12241 /* An inline (associated) namespace definition. */
12245 /* Objective-C++ declaration/definition. */
12252 /* At this point we may have a template declared by a concept
12253 introduction. */
12258 else
12259 /* Try to parse a block-declaration, or a function-definition. */
12262 /* Free any declarators allocated. */
12264 }
12266 /* Parse a block-declaration.
12268 block-declaration:
12269 simple-declaration
12270 asm-definition
12271 namespace-alias-definition
12272 using-declaration
12273 using-directive
12275 GNU Extension:
12277 block-declaration:
12278 __extension__ block-declaration
12280 C++0x Extension:
12282 block-declaration:
12283 static_assert-declaration
12285 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12286 part of a declaration-statement. */
12288 static void
12291 {
12295 /* Check for the `__extension__' keyword. */
12297 {
12298 /* Parse the qualified declaration. */
12300 /* Restore the PEDANTIC flag. */
12304 }
12306 /* Peek at the next token to figure out which kind of declaration is
12307 present. */
12310 /* If the next keyword is `asm', we have an asm-definition. */
12312 {
12316 }
12317 /* If the next keyword is `namespace', we have a
12318 namespace-alias-definition. */
12321 /* If the next keyword is `using', we have a
12322 using-declaration, a using-directive, or an alias-declaration. */
12324 {
12329 /* If the token after `using' is `namespace', then we have a
12330 using-directive. */
12334 /* If the second token after 'using' is '=', then we have an
12335 alias-declaration. */
12341 /* Otherwise, it's a using-declaration. */
12342 else
12345 }
12346 /* If the next keyword is `__label__' we have a misplaced label
12347 declaration. */
12349 {
12353 /* If the next token is now a `;', consume it. */
12356 }
12357 /* If the next token is `static_assert' we have a static assertion. */
12360 /* Anything else must be a simple-declaration. */
12361 else
12364 }
12366 /* Parse a simple-declaration.
12368 simple-declaration:
12369 decl-specifier-seq [opt] init-declarator-list [opt] ;
12371 init-declarator-list:
12372 init-declarator
12373 init-declarator-list , init-declarator
12375 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12376 function-definition as a simple-declaration.
12378 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12379 parsed declaration if it is an uninitialized single declarator not followed
12380 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12381 if present, will not be consumed. */
12383 static void
12387 {
12388 cp_decl_specifier_seq decl_specifiers;
12397 /* Defer access checks until we know what is being declared; the
12398 checks for names appearing in the decl-specifier-seq should be
12399 done as if we were in the scope of the thing being declared. */
12402 /* Parse the decl-specifier-seq. We have to keep track of whether
12403 or not the decl-specifier-seq declares a named class or
12404 enumeration type, since that is the only case in which the
12405 init-declarator-list is allowed to be empty.
12407 [dcl.dcl]
12409 In a simple-declaration, the optional init-declarator-list can be
12410 omitted only when declaring a class or enumeration, that is when
12411 the decl-specifier-seq contains either a class-specifier, an
12412 elaborated-type-specifier, or an enum-specifier. */
12414 CP_PARSER_FLAGS_OPTIONAL,
12417 /* We no longer need to defer access checks. */
12420 /* In a block scope, a valid declaration must always have a
12421 decl-specifier-seq. By not trying to parse declarators, we can
12422 resolve the declaration/expression ambiguity more quickly. */
12425 {
12428 }
12430 /* If the next two tokens are both identifiers, the code is
12431 erroneous. The usual cause of this situation is code like:
12433 T t;
12435 where "T" should name a type -- but does not. */
12438 {
12439 /* If parsing tentatively, we should commit; we really are
12440 looking at a declaration. */
12442 /* Give up. */
12444 }
12446 /* If we have seen at least one decl-specifier, and the next token
12447 is not a parenthesis, then we must be looking at a declaration.
12448 (After "int (" we might be looking at a functional cast.) */
12455 tree last_type;
12459 /* Keep going until we hit the `;' at the end of the simple
12460 declaration. */
12463 CPP_SEMICOLON))
12464 {
12467 tree decl;
12471 {
12472 /* If we are processing next declarator, comma is expected */
12477 {
12481 }
12482 }
12483 else
12486 /* Parse the init-declarator. */
12489 function_definition_allowed_p,
12491 declares_class_or_enum,
12493 maybe_range_for_decl,
12496 /* If an error occurred while parsing tentatively, exit quickly.
12497 (That usually happens when in the body of a function; each
12498 statement is treated as a declaration-statement until proven
12499 otherwise.) */
12504 {
12507 {
12508 /* If the list of declarators contains more than one declarator,
12509 the type of each declared variable is determined as described
12510 above. If the type deduced for the template parameter U is not
12511 the same in each deduction, the program is ill-formed. */
12516 }
12517 else
12519 }
12521 /* Handle function definitions specially. */
12523 {
12524 /* If the next token is a `,', then we are probably
12525 processing something like:
12527 void f() {}, *p;
12529 which is erroneous. */
12531 {
12534 "mixing"
12536 }
12537 /* Otherwise, we're done with the list of declarators. */
12538 else
12539 {
12542 }
12543 }
12546 /* The next token should be either a `,' or a `;'. */
12548 /* If it's a `,', there are more declarators to come. */
12551 /* If it's a `;', we are done. */
12555 {
12560 }
12561 /* Anything else is an error. */
12562 else
12563 {
12564 /* If we have already issued an error message we don't need
12565 to issue another one. */
12570 /* Skip tokens until we reach the end of the statement. */
12572 /* If the next token is now a `;', consume it. */
12576 }
12577 /* After the first time around, a function-definition is not
12578 allowed -- even if it was OK at first. For example:
12580 int i, f() {}
12582 is not valid. */
12584 }
12586 /* Issue an error message if no declarators are present, and the
12587 decl-specifier-seq does not itself declare a class or
12588 enumeration: [dcl.dcl]/3. */
12590 {
12592 {
12596 /* Ensure an error is issued anyway when finish_decltype_type,
12597 called via cp_parser_decl_specifier_seq, returns a class or
12598 an enumeration (c++/51786). */
12601 }
12602 /* Perform any deferred access checks. */
12604 }
12606 /* Consume the `;'. */
12610 {
12616 }
12618 done:
12620 }
12622 /* Parse a decl-specifier-seq.
12624 decl-specifier-seq:
12625 decl-specifier-seq [opt] decl-specifier
12626 decl-specifier attribute-specifier-seq [opt] (C++11)
12628 decl-specifier:
12629 storage-class-specifier
12630 type-specifier
12631 function-specifier
12632 friend
12633 typedef
12635 GNU Extension:
12637 decl-specifier:
12638 attributes
12640 Concepts Extension:
12642 decl-specifier:
12643 concept
12645 Set *DECL_SPECS to a representation of the decl-specifier-seq.
12647 The parser flags FLAGS is used to control type-specifier parsing.
12649 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
12650 flags:
12652 1: one of the decl-specifiers is an elaborated-type-specifier
12653 (i.e., a type declaration)
12654 2: one of the decl-specifiers is an enum-specifier or a
12655 class-specifier (i.e., a type definition)
12657 */
12659 static void
12661 cp_parser_flags flags,
12664 {
12668 cp_decl_spec ds;
12670 /* Clear DECL_SPECS. */
12673 /* Assume no class or enumeration type is declared. */
12676 /* Keep reading specifiers until there are no more to read. */
12678 {
12683 /* Peek at the next token. */
12686 /* Save the first token of the decl spec list for error
12687 reporting. */
12690 /* Handle attributes. */
12692 {
12693 /* Parse the attributes. */
12696 /* In a sequence of declaration specifiers, c++11 attributes
12697 appertain to the type that precede them. In that case
12698 [dcl.spec]/1 says:
12700 The attribute-specifier-seq affects the type only for
12701 the declaration it appears in, not other declarations
12702 involving the same type.
12704 But for now let's force the user to position the
12705 attribute either at the beginning of the declaration or
12706 after the declarator-id, which would clearly mean that it
12707 applies to the declarator. */
12709 {
12711 /* The c++11 attribute is at the beginning of the
12712 declaration. It appertains to the entity being
12714 else
12715 {
12717 {
12718 /* This is an attribute following a
12719 class-specifier. */
12724 }
12725 else
12726 {
12727 decl_specs->std_attributes
12729 attrs);
12732 }
12734 }
12735 }
12737 decl_specs->attributes
12739 attrs);
12743 }
12744 /* Assume we will find a decl-specifier keyword. */
12746 /* If the next token is an appropriate keyword, we can simply
12747 add it to the list. */
12749 {
12750 /* decl-specifier:
12751 friend
12752 constexpr */
12755 {
12758 }
12759 else
12760 {
12762 /* Consume the token. */
12764 }
12777 /* function-specifier:
12778 inline
12779 virtual
12780 explicit */
12787 /* decl-specifier:
12788 typedef */
12791 /* Consume the token. */
12793 /* A constructor declarator cannot appear in a typedef. */
12795 /* The "typedef" keyword can only occur in a declaration; we
12796 may as well commit at this point. */
12803 /* storage-class-specifier:
12804 auto
12805 register
12806 static
12807 extern
12808 mutable
12810 GNU Extension:
12811 thread */
12814 {
12815 /* Consume the token. */
12818 /* Complain about `auto' as a storage specifier, if
12819 we're complaining about C++0x compatibility. */
12823 /* Set the storage class anyway. */
12825 token);
12826 }
12827 else
12828 /* C++0x auto type-specifier. */
12836 /* Consume the token. */
12839 token);
12842 /* Consume the token. */
12848 /* We did not yet find a decl-specifier yet. */
12851 }
12868 /* Constructors are a special case. The `S' in `S()' is not a
12869 decl-specifier; it is the beginning of the declarator. */
12870 constructor_p
12871 = (!found_decl_spec
12872 && constructor_possible_p
12873 && (cp_parser_constructor_declarator_p
12876 /* If we don't have a DECL_SPEC yet, then we must be looking at
12877 a type-specifier. */
12879 {
12882 tree type_spec;
12884 type_spec
12886 decl_specs,
12892 /* If this type-specifier referenced a user-defined type
12893 (a typedef, class-name, etc.), then we can't allow any
12894 more such type-specifiers henceforth.
12896 [dcl.spec]
12898 The longest sequence of decl-specifiers that could
12899 possibly be a type name is taken as the
12900 decl-specifier-seq of a declaration. The sequence shall
12901 be self-consistent as described below.
12903 [dcl.type]
12905 As a general rule, at most one type-specifier is allowed
12906 in the complete decl-specifier-seq of a declaration. The
12907 only exceptions are the following:
12909 -- const or volatile can be combined with any other
12910 type-specifier.
12912 -- signed or unsigned can be combined with char, long,
12913 short, or int.
12915 -- ..
12917 Example:
12919 typedef char* Pc;
12920 void g (const int Pc);
12922 Here, Pc is *not* part of the decl-specifier seq; it's
12923 the declarator. Therefore, once we see a type-specifier
12924 (other than a cv-qualifier), we forbid any additional
12925 user-defined types. We *do* still allow things like `int
12926 int' to be considered a decl-specifier-seq, and issue the
12927 error message later. */
12930 /* A constructor declarator cannot follow a type-specifier. */
12932 {
12937 }
12938 }
12940 /* If we still do not have a DECL_SPEC, then there are no more
12941 decl-specifiers. */
12946 /* After we see one decl-specifier, further decl-specifiers are
12947 always optional. */
12949 }
12951 /* Don't allow a friend specifier with a class definition. */
12956 }
12958 /* Parse an (optional) storage-class-specifier.
12960 storage-class-specifier:
12961 auto
12962 register
12963 static
12964 extern
12965 mutable
12967 GNU Extension:
12969 storage-class-specifier:
12970 thread
12972 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12974 static tree
12976 {
12978 {
12982 /* Fall through for C++98. */
12989 /* Consume the token. */
12994 }
12995 }
12997 /* Parse an (optional) function-specifier.
12999 function-specifier:
13000 inline
13001 virtual
13002 explicit
13004 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13005 Updates DECL_SPECS, if it is non-NULL. */
13007 static tree
13010 {
13013 {
13019 /* 14.5.2.3 [temp.mem]
13021 A member function template shall not be virtual. */
13025 else
13035 }
13037 /* Consume the token. */
13039 }
13041 /* Parse a linkage-specification.
13043 linkage-specification:
13044 extern string-literal { declaration-seq [opt] }
13045 extern string-literal declaration */
13047 static void
13049 {
13050 tree linkage;
13052 /* Look for the `extern' keyword. */
13055 /* Look for the string-literal. */
13058 /* Transform the literal into an identifier. If the literal is a
13059 wide-character string, or contains embedded NULs, then we can't
13060 handle it as the user wants. */
13063 {
13065 /* Assume C++ linkage. */
13067 }
13068 else
13071 /* We're now using the new linkage. */
13074 /* If the next token is a `{', then we're using the first
13075 production. */
13077 {
13081 /* Consume the `{' token. */
13083 /* Parse the declarations. */
13085 /* Look for the closing `}'. */
13087 }
13088 /* Otherwise, there's just one declaration. */
13089 else
13090 {
13093 saved_in_unbraced_linkage_specification_p
13097 parser->in_unbraced_linkage_specification_p
13099 }
13101 /* We're done with the linkage-specification. */
13103 }
13105 /* Parse a static_assert-declaration.
13107 static_assert-declaration:
13108 static_assert ( constant-expression , string-literal ) ;
13109 static_assert ( constant-expression ) ; (C++1Z)
13111 If MEMBER_P, this static_assert is a class member. */
13113 static void
13115 {
13116 tree condition;
13117 tree message;
13119 location_t saved_loc;
13122 /* Peek at the `static_assert' token so we can keep track of exactly
13123 where the static assertion started. */
13127 /* Look for the `static_assert' keyword. */
13129 RT_STATIC_ASSERT))
13132 /* We know we are in a static assertion; commit to any tentative
13133 parse. */
13137 /* Parse the `(' starting the static assertion condition. */
13140 /* Parse the constant-expression. Allow a non-constant expression
13141 here in order to give better diagnostics in finish_static_assert. */
13142 condition =
13148 {
13151 "static_assert without a message "
13153 /* Eat the ')' */
13158 }
13159 else
13160 {
13161 /* Parse the separating `,'. */
13164 /* Parse the string-literal message. */
13169 /* A `)' completes the static assertion. */
13175 }
13177 /* A semicolon terminates the declaration. */
13180 /* Complete the static assertion, which may mean either processing
13181 the static assert now or saving it for template instantiation. */
13183 }
13185 /* Parse the expression in decltype ( expression ). */
13187 static tree
13190 {
13192 tree expr;
13194 /* Since we're going to preserve any side-effects from this parse, set up a
13195 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13196 in the expression. */
13199 /* First, try parsing an id-expression. */
13210 {
13213 cp_id_kind idk;
13217 /* Lookup the name we got back from the id-expression. */
13227 {
13228 /* Complete lookup of the id-expression. */
13229 expr = (finish_id_expression
13242 /* We found an id-expression, but it was something that we
13243 should not have found. This is an error, not something
13244 we can recover from, so note that we found an
13245 id-expression and we'll recover as gracefully as
13246 possible. */
13248 }
13253 /* We have an id-expression. */
13255 }
13258 {
13259 /* Abort the id-expression parse. */
13262 /* Parsing tentatively, again. */
13265 /* Parse a class member access. */
13273 /* We have an id-expression. */
13275 }
13278 /* We have parsed the complete id-expression or member access. */
13280 else
13281 {
13282 /* Abort our attempt to parse an id-expression or member access
13283 expression. */
13286 /* Parse a full expression. */
13289 }
13292 }
13294 /* Parse a `decltype' type. Returns the type.
13296 simple-type-specifier:
13297 decltype ( expression )
13298 C++14 proposal:
13299 decltype ( auto ) */
13301 static tree
13303 {
13304 tree expr;
13313 {
13314 /* Already parsed. */
13317 }
13319 /* Look for the `decltype' token. */
13323 /* Parse the opening `('. */
13327 /* decltype (auto) */
13330 {
13337 }
13339 /* Types cannot be defined in a `decltype' expression. Save away the
13340 old message. */
13343 /* And create the new one. */
13344 parser->type_definition_forbidden_message
13347 /* The restrictions on constant-expressions do not apply inside
13348 decltype expressions. */
13349 saved_integral_constant_expression_p
13351 saved_non_integral_constant_expression_p
13355 /* Within a parenthesized expression, a `>' token is always
13356 the greater-than operator. */
13357 saved_greater_than_is_operator_p
13361 /* Do not actually evaluate the expression. */
13364 /* Do not warn about problems with the expression. */
13369 /* Go back to evaluating expressions. */
13373 /* The `>' token might be the end of a template-id or
13374 template-parameter-list now. */
13375 parser->greater_than_is_operator_p
13378 /* Restore the old message and the integral constant expression
13379 flags. */
13381 parser->integral_constant_expression_p
13383 parser->non_integral_constant_expression_p
13386 /* Parse to the closing `)'. */
13388 {
13392 }
13395 tf_warning_or_error);
13397 rewrite:
13398 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13399 it again. */
13408 }
13410 /* Special member functions [gram.special] */
13412 /* Parse a conversion-function-id.
13414 conversion-function-id:
13415 operator conversion-type-id
13417 Returns an IDENTIFIER_NODE representing the operator. */
13419 static tree
13421 {
13422 tree type;
13423 tree saved_scope;
13424 tree saved_qualifying_scope;
13425 tree saved_object_scope;
13428 /* Look for the `operator' token. */
13431 /* When we parse the conversion-type-id, the current scope will be
13432 reset. However, we need that information in able to look up the
13433 conversion function later, so we save it here. */
13437 /* We must enter the scope of the class so that the names of
13438 entities declared within the class are available in the
13439 conversion-type-id. For example, consider:
13441 struct S {
13442 typedef int I;
13443 operator I();
13444 };
13446 S::operator I() { ... }
13448 In order to see that `I' is a type-name in the definition, we
13449 must be in the scope of `S'. */
13452 /* Parse the conversion-type-id. */
13454 /* Leave the scope of the class, if any. */
13457 /* Restore the saved scope. */
13461 /* If the TYPE is invalid, indicate failure. */
13465 }
13467 /* Parse a conversion-type-id:
13469 conversion-type-id:
13470 type-specifier-seq conversion-declarator [opt]
13472 Returns the TYPE specified. */
13474 static tree
13476 {
13477 tree attributes;
13478 cp_decl_specifier_seq type_specifiers;
13480 tree type_specified;
13483 /* Parse the attributes. */
13487 parser->type_definition_forbidden_message
13490 /* Parse the type-specifiers. */
13497 /* If that didn't work, stop. */
13500 /* Parse the conversion-declarator. */
13508 /* Don't give this error when parsing tentatively. This happens to
13509 work because we always parse this definitively once. */
13512 {
13514 {
13517 }
13521 }
13524 }
13526 /* Parse an (optional) conversion-declarator.
13528 conversion-declarator:
13529 ptr-operator conversion-declarator [opt]
13531 */
13535 {
13538 cp_cv_quals cv_quals;
13540 /* We don't know if there's a ptr-operator next, or not. */
13542 /* Try the ptr-operator. */
13545 /* If it worked, look for more conversion-declarators. */
13547 {
13550 /* Parse another optional declarator. */
13553 declarator = cp_parser_make_indirect_declarator
13557 }
13560 }
13562 /* Parse an (optional) ctor-initializer.
13564 ctor-initializer:
13565 : mem-initializer-list
13567 Returns TRUE iff the ctor-initializer was actually present. */
13569 static bool
13571 {
13572 /* If the next token is not a `:', then there is no
13573 ctor-initializer. */
13575 {
13576 /* Do default initialization of any bases and members. */
13581 }
13583 /* Consume the `:' token. */
13585 /* And the mem-initializer-list. */
13589 }
13591 /* Parse a mem-initializer-list.
13593 mem-initializer-list:
13594 mem-initializer ... [opt]
13595 mem-initializer ... [opt] , mem-initializer-list */
13597 static void
13599 {
13604 /* Let the semantic analysis code know that we are starting the
13605 mem-initializer-list. */
13610 /* Loop through the list. */
13612 {
13613 tree mem_initializer;
13616 /* Parse the mem-initializer. */
13618 /* If the next token is a `...', we're expanding member initializers. */
13620 {
13621 /* Consume the `...'. */
13624 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
13625 can be expanded but members cannot. */
13628 {
13633 }
13635 /* Construct the pack expansion type. */
13638 }
13641 {
13645 }
13646 /* Look for a target constructor. */
13650 {
13653 {
13657 }
13659 }
13660 /* Add it to the list, unless it was erroneous. */
13662 {
13665 }
13666 /* If the next token is not a `,', we're done. */
13669 /* Consume the `,' token. */
13671 }
13673 /* Perform semantic analysis. */
13676 }
13678 /* Parse a mem-initializer.
13680 mem-initializer:
13681 mem-initializer-id ( expression-list [opt] )
13682 mem-initializer-id braced-init-list
13684 GNU extension:
13686 mem-initializer:
13687 ( expression-list [opt] )
13689 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
13690 class) or FIELD_DECL (for a non-static data member) to initialize;
13691 the TREE_VALUE is the expression-list. An empty initialization
13692 list is represented by void_list_node. */
13694 static tree
13696 {
13697 tree mem_initializer_id;
13698 tree expression_list;
13699 tree member;
13702 /* Find out what is being initialized. */
13704 {
13708 }
13709 else
13710 {
13714 }
13720 {
13727 }
13728 else
13729 {
13739 }
13749 }
13751 /* Parse a mem-initializer-id.
13753 mem-initializer-id:
13754 :: [opt] nested-name-specifier [opt] class-name
13755 decltype-specifier (C++11)
13756 identifier
13758 Returns a TYPE indicating the class to be initialized for the first
13759 production (and the second in C++11). Returns an IDENTIFIER_NODE
13760 indicating the data member to be initialized for the last production. */
13762 static tree
13764 {
13768 tree id;
13772 /* `typename' is not allowed in this context ([temp.res]). */
13774 {
13776 "keyword %<typename%> not allowed in this context (a qualified "
13779 }
13780 /* Look for the optional `::' operator. */
13781 global_scope_p
13785 /* Look for the optional nested-name-specifier. The simplest way to
13786 implement:
13788 [temp.res]
13790 The keyword `typename' is not permitted in a base-specifier or
13791 mem-initializer; in these contexts a qualified name that
13792 depends on a template-parameter is implicitly assumed to be a
13793 type name.
13795 is to assume that we have seen the `typename' keyword at this
13796 point. */
13797 nested_name_specifier_p
13806 /* If there is a `::' operator or a nested-name-specifier, then we
13807 are definitely looking for a class-name. */
13812 typename_type,
13816 /* Otherwise, we could also be looking for an ordinary identifier. */
13819 /* Try a decltype-specifier. */
13821 else
13822 /* Otherwise, try a class-name. */
13826 none_type,
13830 /* If we found one, we're done. */
13833 /* Otherwise, look for an ordinary identifier. */
13835 }
13837 /* Overloading [gram.over] */
13839 /* Parse an operator-function-id.
13841 operator-function-id:
13842 operator operator
13844 Returns an IDENTIFIER_NODE for the operator which is a
13845 human-readable spelling of the identifier, e.g., `operator +'. */
13847 static cp_expr
13849 {
13850 /* Look for the `operator' keyword. */
13853 /* And then the name of the operator itself. */
13855 }
13857 /* Return an identifier node for a user-defined literal operator.
13858 The suffix identifier is chained to the operator name identifier. */
13860 static tree
13862 {
13863 tree identifier;
13870 }
13872 /* Parse an operator.
13874 operator:
13875 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
13876 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
13877 || ++ -- , ->* -> () []
13879 GNU Extensions:
13881 operator:
13882 <? >? <?= >?=
13884 Returns an IDENTIFIER_NODE for the operator which is a
13885 human-readable spelling of the identifier, e.g., `operator +'. */
13887 static cp_expr
13889 {
13894 /* Peek at the next token. */
13899 /* Figure out which operator we have. */
13901 {
13903 {
13906 /* The keyword should be either `new' or `delete'. */
13911 else
13914 /* Consume the `new' or `delete' token. */
13917 /* Peek at the next token. */
13919 /* If it's a `[' token then this is the array variant of the
13920 operator. */
13922 {
13923 /* Consume the `[' token. */
13925 /* Look for the `]' token. */
13931 }
13932 /* Otherwise, we have the non-array variant. */
13933 else
13939 }
14086 /* Consume the `('. */
14088 /* Look for the matching `)'. */
14093 /* Consume the `['. */
14095 /* Look for the matching `]'. */
14102 /* FALLTHRU */
14111 {
14118 /* Consume the string. */
14124 {
14127 }
14128 else
14129 {
14131 /* Look for the suffix identifier. */
14136 {
14140 }
14141 else
14142 {
14145 }
14146 }
14151 {
14154 }
14157 {
14160 }
14162 {
14165 }
14167 }
14170 /* Anything else is an error. */
14172 }
14174 /* If we have selected an identifier, we need to consume the
14175 operator token. */
14178 /* Otherwise, no valid operator name was present. */
14179 else
14180 {
14183 }
14186 }
14188 /* Parse a template-declaration.
14190 template-declaration:
14191 export [opt] template < template-parameter-list > declaration
14193 If MEMBER_P is TRUE, this template-declaration occurs within a
14194 class-specifier.
14196 The grammar rule given by the standard isn't correct. What
14197 is really meant is:
14199 template-declaration:
14200 export [opt] template-parameter-list-seq
14201 decl-specifier-seq [opt] init-declarator [opt] ;
14202 export [opt] template-parameter-list-seq
14203 function-definition
14205 template-parameter-list-seq:
14206 template-parameter-list-seq [opt]
14207 template < template-parameter-list >
14209 Concept Extensions:
14211 template-parameter-list-seq:
14212 template < template-parameter-list > requires-clause [opt]
14214 requires-clause:
14215 requires logical-or-expression */
14217 static void
14219 {
14220 /* Check for `export'. */
14222 {
14223 /* Consume the `export' token. */
14225 /* Warn that we do not support `export'. */
14227 }
14230 }
14232 /* Parse a template-parameter-list.
14234 template-parameter-list:
14235 template-parameter
14236 template-parameter-list , template-parameter
14238 Returns a TREE_LIST. Each node represents a template parameter.
14239 The nodes are connected via their TREE_CHAINs. */
14241 static tree
14243 {
14248 /* The loop below parses the template parms. We first need to know
14249 the total number of template parms to be able to compute proper
14250 canonical types of each dependent type. So after the loop, when
14251 we know the total number of template parms,
14252 end_template_parm_list computes the proper canonical types and
14253 fixes up the dependent types accordingly. */
14255 {
14256 tree parameter;
14259 location_t parm_loc;
14261 /* Parse the template-parameter. */
14266 /* Add it to the list. */
14269 parm_loc,
14270 parameter,
14271 is_non_type,
14272 is_parameter_pack);
14273 else
14274 {
14277 }
14279 /* If the next token is not a `,', we're done. */
14282 /* Otherwise, consume the `,' token. */
14284 }
14287 }
14289 /* Parse a introduction-list.
14291 introduction-list:
14292 introduced-parameter
14293 introduction-list , introduced-parameter
14295 introduced-parameter:
14296 ...[opt] identifier
14298 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14299 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14300 WILDCARD_DECL will also have DECL_NAME set and token location in
14301 DECL_SOURCE_LOCATION. */
14303 static tree
14305 {
14309 {
14314 /* Build placeholder. */
14322 /* If the next token is not a `,', we're done. */
14325 /* Otherwise, consume the `,' token. */
14327 }
14329 /* Convert the vec into a TREE_VEC. */
14332 tree parm;
14338 }
14340 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14341 is an abstract declarator. */
14345 {
14350 }
14352 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14353 is an abstract declarator. */
14357 {
14361 else
14363 }
14365 /* Returns true if DECL represents a constrained-parameter. */
14369 {
14374 }
14376 /* Returns true if PARM declares a constrained-parameter. */
14380 {
14382 }
14384 /* Check that the type parameter is only a declarator-id, and that its
14385 type is not cv-qualified. */
14387 bool
14390 {
14395 {
14398 }
14400 /* Don't allow cv-qualified type parameters. */
14403 {
14406 }
14409 }
14411 /* Finish parsing/processing a template type parameter and checking
14412 various restrictions. */
14416 tree id,
14418 {
14421 else
14423 }
14425 static tree
14427 {
14428 /* FIXME: This should probably be copied, and we may need to adjust
14429 the template parameter depths. */
14439 }
14441 /* Finish parsing/processing a template template parameter by borrowing
14442 the template parameter list from the prototype parameter. */
14444 static tree
14446 tree proto,
14447 tree id,
14449 {
14453 }
14455 /* Create a new non-type template parameter from the given PARM
14456 declarator. */
14458 static tree
14461 {
14467 }
14469 /* Build a constrained template parameter based on the PARMDECL
14470 declarator. The type of PARMDECL is the constrained type, which
14471 refers to the prototype template parameter that ultimately
14472 specifies the type of the declared parameter. */
14474 static tree
14479 {
14485 /* A template parameter constrained by a variadic concept shall also
14486 be declared as a template parameter pack. */
14491 /* Build the parameter. Return an error if the declarator was invalid. */
14492 tree parm;
14497 parmdecl);
14498 else
14503 /* Finish the parameter decl and create a node attaching the
14504 default argument and constraint. */
14509 }
14511 /* Returns true if the parsed type actually represents the declaration
14512 of a type template-parameter. */
14516 {
14519 }
14522 /* Returns true if the parsed type actually represents the declaration of
14523 a template template-parameter. */
14525 static bool
14527 {
14530 }
14532 /* Parse a default argument for a type template-parameter.
14533 Note that diagnostics are handled in cp_parser_template_parameter. */
14535 static tree
14537 {
14540 /* Consume the `=' token. */
14545 /* Parse the default-argument. */
14551 {
14555 }
14558 }
14560 /* Parse a default argument for a template template-parameter. */
14562 static tree
14564 {
14569 /* Consume the `='. */
14571 /* Parse the id-expression. */
14573 /* save token before parsing the id-expression, for error
14574 reporting */
14576 tree default_argument
14584 /* If the id-expression was a template-id that refers to
14585 a template-class, we already have the declaration here,
14586 so no further lookup is needed. */
14587 ;
14588 else
14589 /* Look up the name. */
14590 default_argument
14592 none_type,
14598 /* See if the default argument is valid. */
14602 }
14604 /* Parse a template-parameter.
14606 template-parameter:
14607 type-parameter
14608 parameter-declaration
14610 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
14611 the parameter. The TREE_PURPOSE is the default value, if any.
14612 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
14613 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
14614 set to true iff this parameter is a parameter pack. */
14616 static tree
14619 {
14622 tree parm;
14624 /* Assume it is a type parameter or a template parameter. */
14626 /* Assume it not a parameter pack. */
14628 /* Peek at the next token. */
14630 /* If it is `class' or `template', we have a type-parameter. */
14633 /* If it is `class' or `typename' we do not know yet whether it is a
14634 type parameter or a non-type parameter. Consider:
14636 template <typename T, typename T::X X> ...
14638 or:
14640 template <class C, class D*> ...
14642 Here, the first parameter is a type parameter, and the second is
14643 a non-type parameter. We can tell by looking at the token after
14644 the identifier -- if it is a `,', `=', or `>' then we have a type
14645 parameter. */
14647 {
14648 /* Peek at the token after `class' or `typename'. */
14650 /* If it's an ellipsis, we have a template type parameter
14651 pack. */
14654 /* If it's an identifier, skip it. */
14657 /* Now, see if the token looks like the end of a template
14658 parameter. */
14663 }
14665 /* Otherwise, it is a non-type parameter or a constrained parameter.
14667 [temp.param]
14669 When parsing a default template-argument for a non-type
14670 template-parameter, the first non-nested `>' is taken as the end
14671 of the template parameter-list rather than a greater-than
14672 operator. */
14673 parameter_declarator
14680 /* If the parameter declaration is marked as a parameter pack, set
14681 *IS_PARAMETER_PACK to notify the caller. */
14686 {
14687 /* Can happen in some cases of erroneous input (c++/34892). */
14689 /* Consume the `...' for better error recovery. */
14691 }
14693 // The parameter may have been constrained.
14696 parameter_declarator,
14697 is_non_type,
14698 is_parameter_pack);
14700 // Now we're sure that the parameter is a non-type parameter.
14711 }
14713 /* Parse a type-parameter.
14715 type-parameter:
14716 class identifier [opt]
14717 class identifier [opt] = type-id
14718 typename identifier [opt]
14719 typename identifier [opt] = type-id
14720 template < template-parameter-list > class identifier [opt]
14721 template < template-parameter-list > class identifier [opt]
14722 = id-expression
14724 GNU Extension (variadic templates):
14726 type-parameter:
14727 class ... identifier [opt]
14728 typename ... identifier [opt]
14730 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
14731 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
14732 the declaration of the parameter.
14734 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
14736 static tree
14738 {
14740 tree parameter;
14742 /* Look for a keyword to tell us what kind of parameter this is. */
14748 {
14751 {
14752 tree identifier;
14753 tree default_argument;
14755 /* If the next token is an ellipsis, we have a template
14756 argument pack. */
14758 {
14759 /* Consume the `...' token. */
14764 }
14766 /* If the next token is an identifier, then it names the
14767 parameter. */
14770 else
14773 /* Create the parameter. */
14776 /* If the next token is an `=', we have a default argument. */
14778 {
14779 default_argument
14782 /* Template parameter packs cannot have default
14783 arguments. */
14785 {
14788 "template parameter pack %qD cannot have a "
14790 else
14792 "template parameter packs cannot have "
14795 }
14798 }
14799 else
14802 /* Create the combined representation of the parameter and the
14803 default argument. */
14805 }
14809 {
14810 tree identifier;
14811 tree default_argument;
14813 /* Look for the `<'. */
14815 /* Parse the template-parameter-list. */
14817 /* Look for the `>'. */
14820 // If template requirements are present, parse them.
14822 {
14827 }
14829 /* Look for the `class' or 'typename' keywords. */
14831 /* If the next token is an ellipsis, we have a template
14832 argument pack. */
14834 {
14835 /* Consume the `...' token. */
14840 }
14841 /* If the next token is an `=', then there is a
14842 default-argument. If the next token is a `>', we are at
14843 the end of the parameter-list. If the next token is a `,',
14844 then we are at the end of this parameter. */
14848 {
14850 /* Treat invalid names as if the parameter were nameless. */
14853 }
14854 else
14857 /* Create the template parameter. */
14859 identifier);
14861 /* If the next token is an `=', then there is a
14862 default-argument. */
14864 {
14865 default_argument
14868 /* Template parameter packs cannot have default
14869 arguments. */
14871 {
14874 "template parameter pack %qD cannot "
14876 identifier);
14877 else
14881 }
14882 }
14883 else
14886 /* Create the combined representation of the parameter and the
14887 default argument. */
14889 }
14895 }
14898 }
14900 /* Parse a template-id.
14902 template-id:
14903 template-name < template-argument-list [opt] >
14905 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
14906 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
14907 returned. Otherwise, if the template-name names a function, or set
14908 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
14909 names a class, returns a TYPE_DECL for the specialization.
14911 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
14912 uninstantiated templates. */
14914 static tree
14920 {
14921 tree templ;
14922 tree arguments;
14923 tree template_id;
14928 /* If the next token corresponds to a template-id, there is no need
14929 to reparse it. */
14932 {
14935 }
14937 /* Avoid performing name lookup if there is no possibility of
14938 finding a template-id. */
14941 && !cp_parser_nth_token_starts_template_argument_list_p
14943 {
14946 }
14948 /* Remember where the template-id starts. */
14954 /* Parse the template-name. */
14957 check_dependency_p,
14958 is_declaration,
14959 tag_type,
14962 {
14965 }
14967 /* Since we're going to preserve any side-effects from this parse, set up a
14968 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14969 in the template arguments. */
14972 /* If we find the sequence `[:' after a template-name, it's probably
14973 a digraph-typo for `< ::'. Substitute the tokens and check if we can
14974 parse correctly the argument list. */
14981 {
14983 /* Change `:' into `::'. */
14985 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
14986 CPP_LESS. */
14989 /* Parse the arguments. */
14992 {
14993 /* If we couldn't parse an argument list, then we revert our changes
14994 and return simply an error. Maybe this is not a template-id
14995 after all. */
15000 }
15001 /* Otherwise, emit an error about the invalid digraph, but continue
15002 parsing because we got our argument list. */
15005 {
15008 "%<<:%> is an alternate spelling for %<[%>."
15011 {
15013 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15016 }
15017 }
15018 }
15019 else
15020 {
15021 /* Look for the `<' that starts the template-argument-list. */
15023 {
15026 }
15027 /* Parse the arguments. */
15029 }
15031 /* Build a representation of the specialization. */
15034 TEMPLATE_ID_EXPR,
15038 {
15040 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15041 template (rather than some instantiation thereof) only if
15042 is not nested within some other construct. For example, in
15043 "template <typename T> void f(T) { A<T>::", A<T> is just an
15044 instantiation of A. */
15047 CPP_SCOPE));
15048 template_id
15050 }
15051 /* A template-like identifier may be a partial concept id. */
15057 {
15061 }
15062 else
15063 {
15064 /* If it's not a class-template or a template-template, it should be
15065 a function-template. */
15073 }
15075 /* If parsing tentatively, replace the sequence of tokens that makes
15076 up the template-id with a CPP_TEMPLATE_ID token. That way,
15077 should we re-parse the token stream, we will not have to repeat
15078 the effort required to do the parse, nor will we issue duplicate
15079 error messages about problems during instantiation of the
15080 template. */
15082 /* Don't do this if we had a parse error in a declarator; re-parsing
15083 might succeed if a name changes meaning (60361). */
15087 {
15090 /* Reset the contents of the START_OF_ID token. */
15093 /* Update the location to be of the form:
15094 template-name < template-argument-list [opt] >
15095 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15096 with caret == start at the start of the template-name,
15097 ranging until the closing '>'. */
15098 location_t finish_loc
15100 location_t combined_loc
15104 /* Retrieve any deferred checks. Do not pop this access checks yet
15105 so the memory will not be reclaimed during token replacing below. */
15111 /* Purge all subsequent tokens. */
15114 /* ??? Can we actually assume that, if template_id ==
15115 error_mark_node, we will have issued a diagnostic to the
15116 user, as opposed to simply marking the tentative parse as
15117 failed? */
15120 }
15124 }
15126 /* Parse a template-name.
15128 template-name:
15129 identifier
15131 The standard should actually say:
15133 template-name:
15134 identifier
15135 operator-function-id
15137 A defect report has been filed about this issue.
15139 A conversion-function-id cannot be a template name because they cannot
15140 be part of a template-id. In fact, looking at this code:
15142 a.operator K<int>()
15144 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15145 It is impossible to call a templated conversion-function-id with an
15146 explicit argument list, since the only allowed template parameter is
15147 the type to which it is converting.
15149 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15150 `template' keyword, in a construction like:
15152 T::template f<3>()
15154 In that case `f' is taken to be a template-name, even though there
15155 is no way of knowing for sure.
15157 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15158 name refers to a set of overloaded functions, at least one of which
15159 is a template, or an IDENTIFIER_NODE with the name of the template,
15160 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15161 names are looked up inside uninstantiated templates. */
15163 static tree
15170 {
15171 tree identifier;
15172 tree decl;
15173 tree fns;
15176 /* If the next token is `operator', then we have either an
15177 operator-function-id or a conversion-function-id. */
15179 {
15180 /* We don't know whether we're looking at an
15181 operator-function-id or a conversion-function-id. */
15183 /* Try an operator-function-id. */
15185 /* If that didn't work, try a conversion-function-id. */
15187 {
15190 }
15191 }
15192 /* Look for the identifier. */
15193 else
15196 /* If we didn't find an identifier, we don't have a template-id. */
15200 /* If the name immediately followed the `template' keyword, then it
15201 is a template-name. However, if the next token is not `<', then
15202 we do not treat it as a template-name, since it is not being used
15203 as part of a template-id. This enables us to handle constructs
15204 like:
15206 template <typename T> struct S { S(); };
15207 template <typename T> S<T>::S();
15209 correctly. We would treat `S' as a template -- if it were `S<T>'
15210 -- but we do not if there is no `<'. */
15214 {
15215 /* In a declaration, in a dependent context, we pretend that the
15216 "template" keyword was present in order to improve error
15217 recovery. For example, given:
15219 template <typename T> void f(T::X<int>);
15221 we want to treat "X<int>" as a template-id. */
15223 && !template_keyword_p
15225 && check_dependency_p
15227 /* Do not do this for dtors (or ctors), since they never
15228 need the template keyword before their name. */
15230 {
15233 /* Explain what went wrong. */
15235 identifier);
15238 /* If parsing tentatively, find the location of the "<" token. */
15241 /* Parse the template arguments so that we can issue error
15242 messages about them. */
15245 /* Skip tokens until we find a good place from which to
15246 continue parsing. */
15251 /* If parsing tentatively, permanently remove the
15252 template argument list. That will prevent duplicate
15253 error messages from being issued about the missing
15254 "template" keyword. */
15260 }
15262 /* If the "template" keyword is present, then there is generally
15263 no point in doing name-lookup, so we just return IDENTIFIER.
15264 But, if the qualifying scope is non-dependent then we can
15265 (and must) do name-lookup normally. */
15271 }
15273 /* Look up the name. */
15275 tag_type,
15278 check_dependency_p,
15284 /* If DECL is a template, then the name was a template-name. */
15286 {
15290 }
15291 else
15292 {
15295 /* The standard does not explicitly indicate whether a name that
15296 names a set of overloaded declarations, some of which are
15297 templates, is a template-name. However, such a name should
15298 be a template-name; otherwise, there is no way to form a
15299 template-id for the overloaded templates. */
15307 {
15308 /* The name does not name a template. */
15311 }
15312 }
15314 /* If DECL is dependent, and refers to a function, then just return
15315 its name; we will look it up again during template instantiation. */
15317 {
15321 }
15324 }
15326 /* Parse a template-argument-list.
15328 template-argument-list:
15329 template-argument ... [opt]
15330 template-argument-list , template-argument ... [opt]
15332 Returns a TREE_VEC containing the arguments. */
15334 static tree
15336 {
15341 tree vec;
15348 /* Even if the template-id appears in an integral
15349 constant-expression, the contents of the argument list do
15350 not. */
15356 /* Parse the arguments. */
15357 do
15358 {
15359 tree argument;
15362 /* Consume the comma. */
15365 /* Parse the template-argument. */
15368 /* If the next token is an ellipsis, we're expanding a template
15369 argument pack. */
15371 {
15373 {
15377 }
15378 /* Consume the `...' token. */
15381 /* Make the argument into a TYPE_PACK_EXPANSION or
15382 EXPR_PACK_EXPANSION. */
15384 }
15387 {
15391 {
15394 }
15395 else
15397 }
15399 }
15415 }
15417 /* Parse a template-argument.
15419 template-argument:
15420 assignment-expression
15421 type-id
15422 id-expression
15424 The representation is that of an assignment-expression, type-id, or
15425 id-expression -- except that the qualified id-expression is
15426 evaluated, so that the value returned is either a DECL or an
15427 OVERLOAD.
15429 Although the standard says "assignment-expression", it forbids
15430 throw-expressions or assignments in the template argument.
15431 Therefore, we use "conditional-expression" instead. */
15433 static tree
15435 {
15436 tree argument;
15442 cp_id_kind idk;
15444 /* There's really no way to know what we're looking at, so we just
15445 try each alternative in order.
15447 [temp.arg]
15449 In a template-argument, an ambiguity between a type-id and an
15450 expression is resolved to a type-id, regardless of the form of
15451 the corresponding template-parameter.
15453 Therefore, we try a type-id first. */
15456 /* If there was no error parsing the type-id but the next token is a
15457 '>>', our behavior depends on which dialect of C++ we're
15458 parsing. In C++98, we probably found a typo for '> >'. But there
15459 are type-id which are also valid expressions. For instance:
15461 struct X { int operator >> (int); };
15462 template <int V> struct Foo {};
15463 Foo<X () >> 5> r;
15465 Here 'X()' is a valid type-id of a function type, but the user just
15466 wanted to write the expression "X() >> 5". Thus, we remember that we
15467 found a valid type-id, but we still try to parse the argument as an
15468 expression to see what happens.
15470 In C++0x, the '>>' will be considered two separate '>'
15471 tokens. */
15475 {
15478 }
15479 else
15480 {
15481 /* If the next token isn't a `,' or a `>', then this argument wasn't
15482 really finished. This means that the argument is not a valid
15483 type-id. */
15486 /* If that worked, we're done. */
15489 }
15490 /* We're still not sure what the argument will be. */
15492 /* Try a template. */
15500 /* If the next token isn't a `,' or a `>', then this argument wasn't
15501 really finished. */
15505 {
15506 /* Figure out what is being referred to. If the id-expression
15507 was for a class template specialization, then we will have a
15508 TYPE_DECL at this point. There is no need to do name lookup
15509 at this point in that case. */
15512 none_type,
15518 /* Handle a constrained-type-specifier for a non-type template
15519 parameter. */
15525 }
15527 {
15531 }
15532 /* It must be a non-type argument. In C++17 any constant-expression is
15533 allowed. */
15537 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
15539 -- an integral constant-expression of integral or enumeration
15540 type; or
15542 -- the name of a non-type template-parameter; or
15544 -- the name of an object or function with external linkage...
15546 -- the address of an object or function with external linkage...
15548 -- a pointer to member... */
15549 /* Look for a non-type template parameter. */
15551 {
15563 }
15565 /* If the next token is "&", the argument must be the address of an
15566 object or function with external linkage. */
15569 {
15572 }
15573 /* See if we might have an id-expression. */
15580 {
15583 address_p,
15590 else
15591 {
15592 tree probe;
15595 {
15596 /* Strip the dereference temporarily. */
15599 }
15601 /* If we're in a template, we represent a qualified-id referring
15602 to a static data member as a SCOPE_REF even if the scope isn't
15603 dependent so that we can check access control later. */
15608 {
15609 /* A variable without external linkage might still be a
15610 valid constant-expression, so no error is issued here
15611 if the external-linkage check fails. */
15614 }
15616 /* All overloaded functions are allowed; if the external
15617 linkage test does not pass, an error will be issued
15618 later. */
15619 ;
15623 /* A pointer-to-member. */
15624 ;
15626 ;
15627 else
15631 {
15634 tf_warning_or_error);
15635 else
15638 }
15639 }
15640 }
15641 /* If the argument started with "&", there are no other valid
15642 alternatives at this point. */
15644 {
15647 }
15649 general_expr:
15650 /* If the argument wasn't successfully parsed as a type-id followed
15651 by '>>', the argument can only be a constant expression now.
15652 Otherwise, we try parsing the constant-expression tentatively,
15653 because the argument could really be a type-id. */
15659 else
15660 {
15661 /* With C++17 generalized non-type template arguments we need to handle
15662 lvalue constant expressions, too. */
15665 }
15673 /* We did our best to parse the argument as a non type-id, but that
15674 was the only alternative that matched (albeit with a '>' after
15675 it). We can assume it's just a typo from the user, and a
15676 diagnostic will then be issued. */
15678 }
15680 /* Parse an explicit-instantiation.
15682 explicit-instantiation:
15683 template declaration
15685 Although the standard says `declaration', what it really means is:
15687 explicit-instantiation:
15688 template decl-specifier-seq [opt] declarator [opt] ;
15690 Things like `template int S<int>::i = 5, int S<double>::j;' are not
15691 supposed to be allowed. A defect report has been filed about this
15692 issue.
15694 GNU Extension:
15696 explicit-instantiation:
15697 storage-class-specifier template
15698 decl-specifier-seq [opt] declarator [opt] ;
15699 function-specifier template
15700 decl-specifier-seq [opt] declarator [opt] ; */
15702 static void
15704 {
15706 cp_decl_specifier_seq decl_specifiers;
15711 /* Look for an (optional) storage-class-specifier or
15712 function-specifier. */
15714 {
15715 extension_specifier
15718 extension_specifier
15721 }
15723 /* Look for the `template' keyword. */
15725 /* Let the front end know that we are processing an explicit
15726 instantiation. */
15728 /* [temp.explicit] says that we are supposed to ignore access
15729 control while processing explicit instantiation directives. */
15731 /* Parse a decl-specifier-seq. */
15733 CP_PARSER_FLAGS_OPTIONAL,
15736 /* If there was exactly one decl-specifier, and it declared a class,
15737 and there's no declarator, then we have an explicit type
15738 instantiation. */
15740 {
15741 tree type;
15745 /* Turn access control back on for names used during
15746 template instantiation. */
15751 }
15752 else
15753 {
15755 tree decl;
15757 /* Parse the declarator. */
15758 declarator
15769 {
15772 "explicit instantiation shall not use"
15776 "explicit instantiation shall not use"
15781 /* Turn access control back on for names used during
15782 template instantiation. */
15784 /* Do the explicit instantiation. */
15786 }
15787 else
15788 {
15790 /* Skip the body of the explicit instantiation. */
15792 }
15793 }
15794 /* We're done with the instantiation. */
15800 }
15802 /* Parse an explicit-specialization.
15804 explicit-specialization:
15805 template < > declaration
15807 Although the standard says `declaration', what it really means is:
15809 explicit-specialization:
15810 template <> decl-specifier [opt] init-declarator [opt] ;
15811 template <> function-definition
15812 template <> explicit-specialization
15813 template <> template-declaration */
15815 static void
15817 {
15821 /* Look for the `template' keyword. */
15823 /* Look for the `<'. */
15825 /* Look for the `>'. */
15827 /* We have processed another parameter list. */
15829 /* [temp]
15831 A template ... explicit specialization ... shall not have C
15832 linkage. */
15834 {
15836 /* Give it C++ linkage to avoid confusing other parts of the
15837 front end. */
15840 }
15841 else
15843 /* Let the front end know that we are beginning a specialization. */
15845 {
15848 }
15850 /* If the next keyword is `template', we need to figure out whether
15851 or not we're looking a template-declaration. */
15853 {
15858 else
15860 }
15861 else
15862 /* Parse the dependent declaration. */
15868 /* We're done with the specialization. */
15870 /* For the erroneous case of a template with C linkage, we pushed an
15871 implicit C++ linkage scope; exit that scope now. */
15874 /* We're done with this parameter list. */
15876 }
15878 /* Parse a type-specifier.
15880 type-specifier:
15881 simple-type-specifier
15882 class-specifier
15883 enum-specifier
15884 elaborated-type-specifier
15885 cv-qualifier
15887 GNU Extension:
15889 type-specifier:
15890 __complex__
15892 Returns a representation of the type-specifier. For a
15893 class-specifier, enum-specifier, or elaborated-type-specifier, a
15894 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
15896 The parser flags FLAGS is used to control type-specifier parsing.
15898 If IS_DECLARATION is TRUE, then this type-specifier is appearing
15899 in a decl-specifier-seq.
15901 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
15902 class-specifier, enum-specifier, or elaborated-type-specifier, then
15903 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
15904 if a type is declared; 2 if it is defined. Otherwise, it is set to
15905 zero.
15907 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
15908 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
15909 is set to FALSE. */
15911 static tree
15913 cp_parser_flags flags,
15918 {
15924 /* Assume this type-specifier does not declare a new type. */
15927 /* And that it does not specify a cv-qualifier. */
15930 /* Peek at the next token. */
15933 /* If we're looking at a keyword, we can use that to guide the
15934 production we choose. */
15937 {
15942 /* Look for the enum-specifier. */
15944 /* If that worked, we're done. */
15946 {
15951 type_spec,
15952 token,
15955 }
15956 else
15959 /* Any of these indicate either a class-specifier, or an
15960 elaborated-type-specifier. */
15967 /* Parse tentatively so that we can back up if we don't find a
15968 class-specifier. */
15970 /* Look for the class-specifier. */
15973 /* If that worked, we're done. */
15975 {
15980 type_spec,
15981 token,
15984 }
15986 /* Fall through. */
15987 elaborated_type_specifier:
15988 /* We're declaring (not defining) a class or enum. */
15992 /* Fall through. */
15994 /* Look for an elaborated-type-specifier. */
15995 type_spec
15996 = (cp_parser_elaborated_type_specifier
15999 is_declaration));
16002 type_spec,
16003 token,
16026 /* The `__complex__' keyword is a GNU extension. */
16032 }
16034 /* Handle simple keywords. */
16036 {
16038 {
16041 }
16043 }
16045 /* If we do not already have a type-specifier, assume we are looking
16046 at a simple-type-specifier. */
16048 decl_specs,
16049 flags);
16051 /* If we didn't find a type-specifier, and a type-specifier was not
16052 optional in this context, issue an error message. */
16054 {
16057 }
16060 }
16062 /* Parse a simple-type-specifier.
16064 simple-type-specifier:
16065 :: [opt] nested-name-specifier [opt] type-name
16066 :: [opt] nested-name-specifier template template-id
16067 char
16068 wchar_t
16069 bool
16070 short
16071 int
16072 long
16073 signed
16074 unsigned
16075 float
16076 double
16077 void
16079 C++0x Extension:
16081 simple-type-specifier:
16082 auto
16083 decltype ( expression )
16084 char16_t
16085 char32_t
16086 __underlying_type ( type-id )
16088 GNU Extension:
16090 simple-type-specifier:
16091 __int128
16092 __typeof__ unary-expression
16093 __typeof__ ( type-id )
16094 __typeof__ ( type-id ) { initializer-list , [opt] }
16096 Concepts Extension:
16098 simple-type-specifier:
16099 constrained-type-specifier
16101 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16102 appropriately updated. */
16104 static tree
16107 cp_parser_flags flags)
16108 {
16113 /* Peek at the next token. */
16116 /* If we're looking at a keyword, things are easy. */
16118 {
16153 {
16156 }
16185 {
16186 /* The 'auto' might be the placeholder return type for a function decl
16187 with trailing return type. */
16196 {
16198 {
16205 }
16208 {
16211 }
16214 }
16218 {
16221 }
16224 {
16227 }
16228 else
16232 {
16235 "use of %<auto%> in lambda parameter declaration "
16236 "only available with "
16238 }
16241 "use of %<auto%> in parameter declaration "
16242 "only available with "
16246 "ISO C++ forbids use of %<auto%> in parameter "
16248 }
16249 else
16254 /* Since DR 743, decltype can either be a simple-type-specifier by
16255 itself or begin a nested-name-specifier. Parsing it will replace
16256 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16257 handling below decide what to do. */
16263 /* Consume the `typeof' token. */
16265 /* Parse the operand to `typeof'. */
16267 /* If it is not already a TYPE, take its type. */
16273 token,
16282 token,
16292 token,
16297 }
16299 /* If token is an already-parsed decltype not followed by ::,
16300 it's a simple-type-specifier. */
16303 {
16306 {
16308 token,
16310 /* Remember that we are handling a decltype in order to
16311 implement the resolution of DR 1510 when the argument
16312 isn't instantiation dependent. */
16314 }
16317 }
16319 /* If the type-specifier was for a built-in type, we're done. */
16321 {
16322 /* Record the type. */
16329 type,
16330 token,
16335 /* Consume the token. */
16341 /* There is no valid C++ program where a non-template type is
16342 followed by a "<". That usually indicates that the user thought
16343 that the type was a template. */
16348 }
16350 /* The type-specifier must be a user-defined type. */
16352 {
16356 /* Don't gobble tokens or issue error messages if this is an
16357 optional type-specifier. */
16361 /* Look for the optional `::' operator. */
16362 global_p
16366 /* Look for the nested-name specifier. */
16367 qualified_p
16375 /* If we have seen a nested-name-specifier, and the next token
16376 is `template', then we are using the template-id production. */
16379 {
16380 /* Look for the template-id. */
16384 none_type,
16386 /* If the template-id did not name a type, we are out of
16387 luck. */
16389 {
16392 }
16393 }
16394 /* Otherwise, look for a type-name. */
16395 else
16397 /* Keep track of all name-lookups performed in class scopes. */
16399 && !global_p
16400 && !qualified_p
16404 /* If it didn't work out, we don't have a TYPE. */
16410 token,
16412 }
16414 /* If we didn't get a type-name, issue an error message. */
16416 {
16419 }
16422 {
16423 /* See if TYPE is an Objective-C type, and if so, parse and
16424 accept any protocol references following it. Do this before
16425 the cp_parser_check_for_invalid_template_id() call, because
16426 Objective-C types can be followed by '<...>' which would
16427 enclose protocol names rather than template arguments, and so
16428 everything is fine. */
16431 {
16435 /* Clobber the "unqualified" type previously entered into
16436 DECL_SPECS with the new, improved protocol-qualified version. */
16441 }
16443 /* There is no valid C++ program where a non-template type is
16444 followed by a "<". That usually indicates that the user
16445 thought that the type was a template. */
16447 none_type,
16449 }
16452 }
16454 /* Parse a type-name.
16456 type-name:
16457 class-name
16458 enum-name
16459 typedef-name
16460 simple-template-id [in c++0x]
16462 enum-name:
16463 identifier
16465 typedef-name:
16466 identifier
16468 Concepts:
16470 type-name:
16471 concept-name
16472 partial-concept-id
16474 concept-name:
16475 identifier
16477 Returns a TYPE_DECL for the type. */
16479 static tree
16481 {
16483 }
16485 /* See above. */
16486 static tree
16488 {
16489 tree type_decl;
16491 /* We can't know yet whether it is a class-name or not. */
16493 /* Try a class-name. */
16495 typename_keyword_p,
16497 none_type,
16501 /* If it's not a class-name, keep looking. */
16503 {
16505 /* It must be a typedef-name or an enum-name. */
16509 /* It is either a simple-template-id representing an
16510 instantiation of an alias template... */
16514 none_type,
16516 /* Note that this must be an instantiation of an alias template
16517 because [temp.names]/6 says:
16519 A template-id that names an alias template specialization
16520 is a type-name.
16522 Whereas [temp.names]/7 says:
16524 A simple-template-id that names a class template
16525 specialization is a class-name.
16527 With concepts, this could also be a partial-concept-id that
16528 declares a non-type template parameter. */
16535 else
16539 /* ... Or a typedef-name or an enum-name. */
16541 }
16544 }
16546 /* Check if DECL and ARGS can form a constrained-type-specifier.
16547 If ARGS is non-null, we try to form a concept check of the
16548 form DECL<?, ARGS> where ? is a wildcard that matches any
16549 kind of template argument. If ARGS is NULL, then we try to
16550 form a concept check of the form DECL<?>. */
16552 static tree
16555 {
16558 /* If we a constrained-type-specifier cannot be deduced. */
16562 /* A constrained type specifier can only be found in an
16563 overload set or as a reference to a template declaration.
16565 FIXME: This might be masking a bug. It's possible that
16566 that the deduction below is causing template specializations
16567 to be formed with the wildcard as an argument. */
16571 /* Try to build a call expression that evaluates the
16572 concept. This can fail if the overload set refers
16573 only to non-templates. */
16579 /* Deduce the checked constraint and the prototype parameter.
16581 FIXME: In certain cases, failure to deduce should be a
16582 diagnosable error. */
16583 tree conc;
16584 tree proto;
16588 /* In template parameter scope, this results in a constrained
16589 parameter. Return a descriptor of that parm. */
16593 /* In a parameter-declaration-clause, constrained-type
16594 specifiers result in invented template parameters. */
16596 {
16599 }
16600 else
16601 {
16602 /* Otherwise, we're in a context where the constrained
16603 type name is deduced and the constraint applies
16604 after deduction. */
16606 }
16609 }
16611 /* If DECL refers to a concept, return a TYPE_DECL representing
16612 the result of using the constrained type specifier in the
16613 current context. DECL refers to a concept if
16615 - it is an overload set containing a function concept taking a single
16616 type argument, or
16618 - it is a variable concept taking a single type argument. */
16620 static tree
16622 {
16628 else
16630 }
16632 /* Check if DECL and ARGS form a partial-concept-id. If so,
16633 assign ID to the resulting constrained placeholder.
16635 Returns true if the partial-concept-id designates a placeholder
16636 and false otherwise. Note that *id is set to NULL_TREE in
16637 this case. */
16639 static tree
16641 {
16643 }
16645 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
16646 or a concept-name.
16648 enum-name:
16649 identifier
16651 typedef-name:
16652 identifier
16654 concept-name:
16655 identifier
16657 Returns a TYPE_DECL for the type. */
16659 static tree
16661 {
16662 tree type_decl;
16663 tree identifier;
16670 /* Look up the type-name. */
16675 /* If we found an overload set, then it may refer to a concept-name. */
16681 {
16682 /* See if this is an Objective-C type. */
16687 }
16689 /* Issue an error if we did not find a type-name. */
16691 /* In Objective-C, we have the complication that class names are
16692 normally type names and start declarations (eg, the
16693 "NSObject" in "NSObject *object;"), but can be used in an
16694 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
16695 is an expression. So, a classname followed by a dot is not a
16696 valid type-name. */
16699 {
16704 }
16705 /* Remember that the name was used in the definition of the
16706 current class so that we can check later to see if the
16707 meaning would have been different after the class was
16708 entirely defined. */
16714 }
16716 /* Parse an elaborated-type-specifier. Note that the grammar given
16717 here incorporates the resolution to DR68.
16719 elaborated-type-specifier:
16720 class-key :: [opt] nested-name-specifier [opt] identifier
16721 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
16722 enum-key :: [opt] nested-name-specifier [opt] identifier
16723 typename :: [opt] nested-name-specifier identifier
16724 typename :: [opt] nested-name-specifier template [opt]
16725 template-id
16727 GNU extension:
16729 elaborated-type-specifier:
16730 class-key attributes :: [opt] nested-name-specifier [opt] identifier
16731 class-key attributes :: [opt] nested-name-specifier [opt]
16732 template [opt] template-id
16733 enum attributes :: [opt] nested-name-specifier [opt] identifier
16735 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
16736 declared `friend'. If IS_DECLARATION is TRUE, then this
16737 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
16738 something is being declared.
16740 Returns the TYPE specified. */
16742 static tree
16746 {
16748 tree identifier;
16751 tree globalscope;
16754 /* See if we're looking at the `enum' keyword. */
16756 {
16757 /* Consume the `enum' token. */
16759 /* Remember that it's an enumeration type. */
16761 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
16762 enums) is used here. */
16765 {
16769 /* Consume the `struct' or `class' and parse it anyway. */
16771 }
16772 /* Parse the attributes. */
16774 }
16775 /* Or, it might be `typename'. */
16777 RID_TYPENAME))
16778 {
16779 /* Consume the `typename' token. */
16781 /* Remember that it's a `typename' type. */
16783 }
16784 /* Otherwise it must be a class-key. */
16785 else
16786 {
16790 /* Parse the attributes. */
16792 }
16794 /* Look for the `::' operator. */
16797 /* Look for the nested-name-specifier. */
16799 {
16804 is_declaration))
16806 }
16807 else
16808 /* Even though `typename' is not present, the proposed resolution
16809 to Core Issue 180 says that in `class A<T>::B', `B' should be
16810 considered a type-name, even if `A<T>' is dependent. */
16815 is_declaration);
16816 /* For everything but enumeration types, consider a template-id.
16817 For an enumeration type, consider only a plain identifier. */
16819 {
16821 tree decl;
16823 /* Allow the `template' keyword. */
16825 /* If we didn't see `template', we don't know if there's a
16826 template-id or not. */
16829 /* Parse the template-id. */
16833 tag_type,
16834 is_declaration);
16835 /* If we didn't find a template-id, look for an ordinary
16836 identifier. */
16838 ;
16839 /* We can get here when cp_parser_template_id, called by
16840 cp_parser_class_name with tag_type == none_type, succeeds
16841 and caches a BASELINK. Then, when called again here,
16842 instead of failing and returning an error_mark_node
16843 returns it (see template/typename17.C in C++11).
16844 ??? Could we diagnose this earlier? */
16846 {
16849 }
16850 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
16851 in effect, then we must assume that, upon instantiation, the
16852 template will correspond to a class. */
16856 typename_type,
16858 /* If the `typename' keyword is in effect and DECL is not a type
16859 decl, then type is non existent. */
16861 ;
16867 }
16870 {
16875 {
16878 }
16880 /* For a `typename', we needn't call xref_tag. */
16886 /* Template parameter lists apply only if we are not within a
16887 function parameter list. */
16888 bool template_parm_lists_apply
16897 /* Look up a qualified name in the usual way. */
16899 {
16900 tree decl;
16901 tree ambiguous_decls;
16904 tag_type,
16911 /* If the lookup was ambiguous, an error will already have been
16912 issued. */
16916 /* If we are parsing friend declaration, DECL may be a
16917 TEMPLATE_DECL tree node here. However, we need to check
16918 whether this TEMPLATE_DECL results in valid code. Consider
16919 the following example:
16921 namespace N {
16922 template <class T> class C {};
16923 }
16924 class X {
16925 template <class T> friend class N::C; // #1, valid code
16926 };
16927 template <class T> class Y {
16928 friend class N::C; // #2, invalid code
16929 };
16931 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
16932 name lookup of `N::C'. We see that friend declaration must
16933 be template for the code to be valid. Note that
16934 processing_template_decl does not work here since it is
16935 always 1 for the above two cases. */
16937 decl = (cp_parser_maybe_treat_template_as_class
16942 {
16944 identifier,
16947 }
16950 {
16954 allow_template);
16958 }
16960 /* Forward declarations of nested types, such as
16962 class C1::C2;
16963 class C1::C2::C3;
16965 are invalid unless all components preceding the final '::'
16966 are complete. If all enclosing types are complete, these
16967 declarations become merely pointless.
16969 Invalid forward declarations of nested types are errors
16970 caught elsewhere in parsing. Those that are pointless arrive
16971 here. */
16978 }
16979 else
16980 {
16981 /* An elaborated-type-specifier sometimes introduces a new type and
16982 sometimes names an existing type. Normally, the rule is that it
16983 introduces a new type only if there is not an existing type of
16984 the same name already in scope. For example, given:
16986 struct S {};
16987 void f() { struct S s; }
16989 the `struct S' in the body of `f' is the same `struct S' as in
16990 the global scope; the existing definition is used. However, if
16991 there were no global declaration, this would introduce a new
16992 local class named `S'.
16994 An exception to this rule applies to the following code:
16996 namespace N { struct S; }
16998 Here, the elaborated-type-specifier names a new type
16999 unconditionally; even if there is already an `S' in the
17000 containing scope this declaration names a new type.
17001 This exception only applies if the elaborated-type-specifier
17002 forms the complete declaration:
17004 [class.name]
17006 A declaration consisting solely of `class-key identifier ;' is
17007 either a redeclaration of the name in the current scope or a
17008 forward declaration of the identifier as a class name. It
17009 introduces the name into the current scope.
17011 We are in this situation precisely when the next token is a `;'.
17013 An exception to the exception is that a `friend' declaration does
17014 *not* name a new type; i.e., given:
17016 struct S { friend struct T; };
17018 `T' is not a new type in the scope of `S'.
17020 Also, `new struct S' or `sizeof (struct S)' never results in the
17021 definition of a new type; a new type can only be declared in a
17022 declaration context. */
17024 tag_scope ts;
17028 /* Friends have special name lookup rules. */
17032 CPP_SEMICOLON))
17033 /* This is a `class-key identifier ;' */
17035 else
17038 template_p =
17039 (template_parm_lists_apply
17042 /* An unqualified name was used to reference this type, so
17043 there were no qualifying templates. */
17051 }
17052 }
17057 /* Allow attributes on forward declarations of classes. */
17059 {
17069 else
17072 }
17075 {
17076 /* Indicate whether this class was declared as a `class' or as a
17077 `struct'. */
17081 }
17083 /* A "<" cannot follow an elaborated type specifier. If that
17084 happens, the user was probably trying to form a template-id. */
17089 }
17091 /* Parse an enum-specifier.
17093 enum-specifier:
17094 enum-head { enumerator-list [opt] }
17095 enum-head { enumerator-list , } [C++0x]
17097 enum-head:
17098 enum-key identifier [opt] enum-base [opt]
17099 enum-key nested-name-specifier identifier enum-base [opt]
17101 enum-key:
17102 enum
17103 enum class [C++0x]
17104 enum struct [C++0x]
17106 enum-base: [C++0x]
17107 : type-specifier-seq
17109 opaque-enum-specifier:
17110 enum-key identifier enum-base [opt] ;
17112 GNU Extensions:
17113 enum-key attributes[opt] identifier [opt] enum-base [opt]
17114 { enumerator-list [opt] }attributes[opt]
17115 enum-key attributes[opt] identifier [opt] enum-base [opt]
17116 { enumerator-list, }attributes[opt] [C++0x]
17118 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17119 if the token stream isn't an enum-specifier after all. */
17121 static tree
17123 {
17124 tree identifier;
17126 tree prev_scope;
17128 tree attributes;
17141 /* Parse tentatively so that we can back up if we don't find a
17142 enum-specifier. */
17145 /* Caller guarantees that the current token is 'enum', an identifier
17146 possibly follows, and the token after that is an opening brace.
17147 If we don't have an identifier, fabricate an anonymous name for
17148 the enumeration being defined. */
17151 /* Parse the "class" or "struct", which indicates a scoped
17152 enumeration type in C++0x. */
17155 {
17159 /* Consume the `struct' or `class' token. */
17163 }
17167 /* Clear the qualification. */
17172 /* Figure out in what scope the declaration is being placed. */
17178 nested_name_specifier
17186 {
17187 tree name;
17191 enum_type,
17196 input_location);
17198 {
17201 {
17202 /* Are template enums allowed in ISO? */
17206 /* ignore a typename reference, for it will be solved by name
17207 in start_enum. */
17209 }
17210 }
17213 else
17214 {
17219 }
17220 }
17221 else
17222 {
17225 else
17226 {
17232 }
17233 }
17236 /* Check for the `:' that denotes a specified underlying type in C++0x.
17237 Note that a ':' could also indicate a bitfield width, however. */
17239 {
17240 cp_decl_specifier_seq type_specifiers;
17242 /* Consume the `:'. */
17245 /* Parse the type-specifier-seq. */
17250 /* At this point this is surely not elaborated type specifier. */
17259 /* If that didn't work, stop. */
17261 {
17267 }
17268 }
17270 /* Look for the `{' but don't consume it yet. */
17272 {
17274 {
17277 {
17280 }
17281 }
17282 /* An opaque-enum-specifier must have a ';' here. */
17285 {
17288 {
17291 }
17292 }
17293 }
17299 {
17301 {
17305 }
17307 {
17309 }
17310 }
17312 /* Issue an error message if type-definitions are forbidden here. */
17315 else
17316 /* Create the new type. We do this before consuming the opening
17317 brace so the enum will be recorded as being on the line of its
17318 tag (or the 'enum' keyword, if there is no tag). */
17322 /* If the next token is not '{' it is an opaque-enum-specifier or an
17323 elaborated-type-specifier. */
17325 {
17329 {
17330 /* The following catches invalid code such as:
17331 enum class S<int>::E { A, B, C }; */
17339 {
17343 nested_name_specifier);
17345 }
17348 {
17350 "%qT for enum declaration does not name a class "
17353 }
17354 /* If that scope does not contain the scope in which the
17355 class was originally declared, the program is invalid. */
17357 nested_name_specifier))
17358 {
17361 "declaration of %qD in namespace %qD which does not "
17364 else
17366 "declaration of %qD in %qD which does not "
17370 }
17371 /* If that scope is the scope where the declaration is being placed
17372 the program is invalid. */
17376 {
17380 }
17381 }
17386 /* Consume the opening brace. */
17393 {
17397 }
17398 else
17399 {
17405 }
17409 /* If the next token is not '}', then there are some enumerators. */
17411 {
17415 }
17416 else
17419 /* Consume the final '}'. */
17425 }
17426 else
17427 {
17428 /* If a ';' follows, then it is an opaque-enum-specifier
17429 and additional restrictions apply. */
17431 {
17438 }
17439 }
17441 /* Look for trailing attributes to apply to this enumeration, and
17442 apply them if appropriate. */
17444 {
17447 trailing_attr,
17449 }
17451 /* Finish up the enumeration. */
17453 {
17458 }
17461 {
17463 {
17466 }
17468 {
17470 }
17471 }
17472 out:
17475 }
17477 /* Parse an enumerator-list. The enumerators all have the indicated
17478 TYPE.
17480 enumerator-list:
17481 enumerator-definition
17482 enumerator-list , enumerator-definition */
17484 static void
17486 {
17488 {
17489 /* Parse an enumerator-definition. */
17492 /* If the next token is not a ',', we've reached the end of
17493 the list. */
17496 /* Otherwise, consume the `,' and keep going. */
17498 /* If the next token is a `}', there is a trailing comma. */
17500 {
17505 }
17506 }
17507 }
17509 /* Parse an enumerator-definition. The enumerator has the indicated
17510 TYPE.
17512 enumerator-definition:
17513 enumerator
17514 enumerator = constant-expression
17516 enumerator:
17517 identifier
17519 GNU Extensions:
17521 enumerator-definition:
17522 enumerator attributes [opt]
17523 enumerator attributes [opt] = constant-expression */
17525 static void
17527 {
17528 tree identifier;
17529 tree value;
17530 location_t loc;
17532 /* Save the input location because we are interested in the location
17533 of the identifier and not the location of the explicit value. */
17536 /* Look for the identifier. */
17541 /* Parse any specified attributes. */
17544 /* If the next token is an '=', then there is an explicit value. */
17546 {
17547 /* Consume the `=' token. */
17549 /* Parse the value. */
17551 }
17552 else
17555 /* If we are processing a template, make sure the initializer of the
17556 enumerator doesn't contain any bare template parameter pack. */
17560 /* Create the enumerator. */
17562 }
17564 /* Parse a namespace-name.
17566 namespace-name:
17567 original-namespace-name
17568 namespace-alias
17570 Returns the NAMESPACE_DECL for the namespace. */
17572 static tree
17574 {
17575 tree identifier;
17576 tree namespace_decl;
17580 /* Get the name of the namespace. */
17585 /* Look up the identifier in the currently active scope. Look only
17586 for namespaces, due to:
17588 [basic.lookup.udir]
17590 When looking up a namespace-name in a using-directive or alias
17591 definition, only namespace names are considered.
17593 And:
17595 [basic.lookup.qual]
17597 During the lookup of a name preceding the :: scope resolution
17598 operator, object, function, and enumerator names are ignored.
17600 (Note that cp_parser_qualifying_entity only calls this
17601 function if the token after the name is the scope resolution
17602 operator.) */
17604 none_type,
17610 /* If it's not a namespace, issue an error. */
17613 {
17618 }
17621 }
17623 /* Parse a namespace-definition.
17625 namespace-definition:
17626 named-namespace-definition
17627 unnamed-namespace-definition
17629 named-namespace-definition:
17630 original-namespace-definition
17631 extension-namespace-definition
17633 original-namespace-definition:
17634 namespace identifier { namespace-body }
17636 extension-namespace-definition:
17637 namespace original-namespace-name { namespace-body }
17639 unnamed-namespace-definition:
17640 namespace { namespace-body } */
17642 static void
17644 {
17654 {
17658 }
17659 else
17662 /* Look for the `namespace' keyword. */
17665 /* Parse any specified attributes before the identifier. */
17668 /* Get the name of the namespace. We do not attempt to distinguish
17669 between an original-namespace-definition and an
17670 extension-namespace-definition at this point. The semantic
17671 analysis routines are responsible for that. */
17674 else
17677 /* Parse any specified attributes after the identifier. */
17680 {
17683 else
17685 }
17687 /* Start the namespace. */
17690 /* Parse any nested namespace definition. */
17692 {
17697 "nested namespace definitions only available with "
17702 {
17706 else
17707 {
17710 }
17713 }
17714 }
17716 /* Look for the `{' to validate starting the namespace. */
17719 /* "inline namespace" is equivalent to a stub namespace definition
17720 followed by a strong using directive. */
17722 {
17724 /* Set up namespace association. */
17728 /* Import the contents of the inline namespace. */
17732 }
17738 /* Parse the body of the namespace. */
17744 /* Finish the nested namespace definitions. */
17748 /* Finish the namespace. */
17751 /* Look for the final `}'. */
17753 }
17755 /* Parse a namespace-body.
17757 namespace-body:
17758 declaration-seq [opt] */
17760 static void
17762 {
17764 }
17766 /* Parse a namespace-alias-definition.
17768 namespace-alias-definition:
17769 namespace identifier = qualified-namespace-specifier ; */
17771 static void
17773 {
17774 tree identifier;
17775 tree namespace_specifier;
17779 /* Look for the `namespace' keyword. */
17781 /* Look for the identifier. */
17785 /* Look for the `=' token. */
17788 {
17790 /* Skip the definition. */
17795 }
17797 /* Look for the qualified-namespace-specifier. */
17798 namespace_specifier
17800 /* Look for the `;' token. */
17803 /* Register the alias in the symbol table. */
17805 }
17807 /* Parse a qualified-namespace-specifier.
17809 qualified-namespace-specifier:
17810 :: [opt] nested-name-specifier [opt] namespace-name
17812 Returns a NAMESPACE_DECL corresponding to the specified
17813 namespace. */
17815 static tree
17817 {
17818 /* Look for the optional `::'. */
17822 /* Look for the optional nested-name-specifier. */
17830 }
17832 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
17833 access declaration.
17835 using-declaration:
17836 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
17837 using :: unqualified-id ;
17839 access-declaration:
17840 qualified-id ;
17842 */
17844 static bool
17847 {
17851 tree decl;
17852 tree identifier;
17853 tree qscope;
17858 {
17861 }
17862 else
17863 {
17864 /* Look for the `using' keyword. */
17867 /* Peek at the next token. */
17869 /* See if it's `typename'. */
17871 {
17872 /* Remember that we've seen it. */
17874 /* Consume the `typename' token. */
17876 }
17877 }
17879 /* Look for the optional global scope qualification. */
17880 global_scope_p
17885 /* If we saw `typename', or didn't see `::', then there must be a
17886 nested-name-specifier present. */
17888 {
17894 {
17897 }
17898 }
17899 /* Otherwise, we could be in either of the two productions. In that
17900 case, treat the nested-name-specifier as optional. */
17901 else
17913 /* Something has already gone wrong; there's no need to parse
17914 further. Since an error has occurred, the return value of
17915 cp_parser_parse_definitely will be false, as required. */
17919 /* Parse the unqualified-id. */
17927 {
17932 }
17934 /* The function we call to handle a using-declaration is different
17935 depending on what scope we are in. */
17937 ;
17940 /* [namespace.udecl]
17942 A using declaration shall not name a template-id. */
17945 else
17946 {
17948 {
17949 /* Create the USING_DECL. */
17956 {
17959 }
17960 else
17961 /* Add it to the list of members in this class. */
17963 }
17964 else
17965 {
17967 identifier,
17974 {
17977 }
17980 else
17982 }
17983 }
17985 /* Look for the final `;'. */
17990 "access declarations are deprecated "
17991 "in favour of using-declarations; "
17995 }
17997 /* Parse an alias-declaration.
17999 alias-declaration:
18000 using identifier attribute-specifier-seq [opt] = type-id */
18002 static tree
18004 {
18006 location_t id_location;
18008 cp_decl_specifier_seq decl_specs;
18012 /* Look for the `using' keyword. */
18013 cp_token *using_token
18035 /* Now we are going to parse the type-id of the declaration. */
18037 /*
18038 [dcl.type]/3 says:
18040 "A type-specifier-seq shall not define a class or enumeration
18041 unless it appears in the type-id of an alias-declaration (7.1.3) that
18042 is not the declaration of a template-declaration."
18044 In other words, if we currently are in an alias template, the
18045 type-id should not define a type.
18047 So let's set parser->type_definition_forbidden_message in that
18048 case; cp_parser_check_type_definition (called by
18049 cp_parser_class_specifier) will then emit an error if a type is
18050 defined in the type-id. */
18052 {
18056 }
18060 /* Restore the error message if need be. */
18066 {
18069 }
18071 /* A typedef-name can also be introduced by an alias-declaration. The
18072 identifier following the using keyword becomes a typedef-name. It has
18073 the same semantics as if it were introduced by the typedef
18074 specifier. In particular, it does not define a new type and it shall
18075 not appear in the type-id. */
18080 {
18083 ds_attribute,
18084 attrs_token);
18085 }
18087 ds_typedef,
18088 using_token);
18090 ds_alias,
18091 using_token);
18100 else
18106 // Attach constraints to the alias declaration.
18108 {
18112 }
18119 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18120 added into the symbol table; otherwise, return the TYPE_DECL. */
18124 {
18128 }
18131 }
18133 /* Parse a using-directive.
18135 using-directive:
18136 using namespace :: [opt] nested-name-specifier [opt]
18137 namespace-name ; */
18139 static void
18141 {
18142 tree namespace_decl;
18143 tree attribs;
18145 /* Look for the `using' keyword. */
18147 /* And the `namespace' keyword. */
18149 /* Look for the optional `::' operator. */
18151 /* And the optional nested-name-specifier. */
18157 /* Get the namespace being used. */
18159 /* And any specified attributes. */
18161 /* Update the symbol table. */
18163 /* Look for the final `;'. */
18165 }
18167 /* Parse an asm-definition.
18169 asm-definition:
18170 asm ( string-literal ) ;
18172 GNU Extension:
18174 asm-definition:
18175 asm volatile [opt] ( string-literal ) ;
18176 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18177 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18178 : asm-operand-list [opt] ) ;
18179 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18180 : asm-operand-list [opt]
18181 : asm-clobber-list [opt] ) ;
18182 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18183 : asm-clobber-list [opt]
18184 : asm-goto-list ) ; */
18186 static void
18188 {
18189 tree string;
18194 tree asm_stmt;
18202 /* Look for the `asm' keyword. */
18207 {
18210 }
18212 /* See if the next token is `volatile'. */
18215 {
18216 /* Remember that we saw the `volatile' keyword. */
18218 /* Consume the token. */
18220 }
18224 {
18225 /* Remember that we saw the `goto' keyword. */
18227 /* Consume the token. */
18229 }
18230 /* Look for the opening `('. */
18233 /* Look for the string. */
18236 {
18240 }
18242 /* If we're allowing GNU extensions, check for the extended assembly
18243 syntax. Unfortunately, the `:' tokens need not be separated by
18244 a space in C, and so, for compatibility, we tolerate that here
18245 too. Doing that means that we have to treat the `::' operator as
18246 two `:' tokens. */
18251 {
18256 /* The extended syntax was used. */
18259 /* Look for outputs. */
18261 {
18262 /* Consume the `:'. */
18264 /* Parse the output-operands. */
18266 CPP_COLON)
18268 CPP_SCOPE)
18270 CPP_CLOSE_PAREN)
18272 {
18276 }
18277 }
18278 /* If the next token is `::', there are no outputs, and the
18279 next token is the beginning of the inputs. */
18281 /* The inputs are coming next. */
18284 /* Look for inputs. */
18287 {
18288 /* Consume the `:' or `::'. */
18290 /* Parse the output-operands. */
18292 CPP_COLON)
18294 CPP_SCOPE)
18296 CPP_CLOSE_PAREN))
18297 {
18301 }
18302 }
18304 /* The clobbers are coming next. */
18307 /* Look for clobbers. */
18310 {
18312 /* Consume the `:' or `::'. */
18314 /* Parse the clobbers. */
18316 CPP_COLON)
18318 CPP_CLOSE_PAREN))
18320 }
18323 /* The labels are coming next. */
18326 /* Look for labels. */
18329 {
18331 /* Consume the `:' or `::'. */
18333 /* Parse the labels. */
18335 }
18339 }
18343 /* Look for the closing `)'. */
18351 {
18352 /* Create the ASM_EXPR. */
18354 {
18357 /* If the extended syntax was not used, mark the ASM_EXPR. */
18359 {
18365 }
18366 }
18367 else
18369 }
18370 }
18372 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
18373 type that comes from the decl-specifier-seq. */
18375 static tree
18377 {
18380 {
18392 }
18395 }
18397 /* Declarators [gram.dcl.decl] */
18399 /* Parse an init-declarator.
18401 init-declarator:
18402 declarator initializer [opt]
18404 GNU Extension:
18406 init-declarator:
18407 declarator asm-specification [opt] attributes [opt] initializer [opt]
18409 function-definition:
18410 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18411 function-body
18412 decl-specifier-seq [opt] declarator function-try-block
18414 GNU Extension:
18416 function-definition:
18417 __extension__ function-definition
18419 TM Extension:
18421 function-definition:
18422 decl-specifier-seq [opt] declarator function-transaction-block
18424 The DECL_SPECIFIERS apply to this declarator. Returns a
18425 representation of the entity declared. If MEMBER_P is TRUE, then
18426 this declarator appears in a class scope. The new DECL created by
18427 this declarator is returned.
18429 The CHECKS are access checks that should be performed once we know
18430 what entity is being declared (and, therefore, what classes have
18431 befriended it).
18433 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18434 for a function-definition here as well. If the declarator is a
18435 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18436 be TRUE upon return. By that point, the function-definition will
18437 have been completely parsed.
18439 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18440 is FALSE.
18442 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18443 parsed declaration if it is an uninitialized single declarator not followed
18444 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18445 if present, will not be consumed. If returned, this declarator will be
18446 created with SD_INITIALIZED but will not call cp_finish_decl.
18448 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
18449 and there is an initializer, the pointed location_t is set to the
18450 location of the '=' or `(', or '{' in C++11 token introducing the
18451 initializer. */
18453 static tree
18464 {
18468 tree prefix_attributes;
18470 tree asm_specification;
18471 tree initializer;
18473 tree scope;
18475 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
18476 initialized with "= ..", CPP_OPEN_PAREN if initialized with
18477 "(...)". */
18488 /* Gather the attributes that were provided with the
18489 decl-specifiers. */
18492 /* Assume that this is not the declarator for a function
18493 definition. */
18497 /* Default arguments are only permitted for function parameters. */
18501 /* Defer access checks while parsing the declarator; we cannot know
18502 what names are accessible until we know what is being
18503 declared. */
18506 /* Parse the declarator. */
18508 declarator
18513 /* Gather up the deferred checks. */
18518 /* If the DECLARATOR was erroneous, there's no need to go
18519 further. */
18523 /* Check that the number of template-parameter-lists is OK. */
18533 /* Figure out what scope the entity declared by the DECLARATOR is
18534 located in. `grokdeclarator' sometimes changes the scope, so
18535 we compute it now. */
18538 /* Perform any lookups in the declared type which were thought to be
18539 dependent, but are not in the scope of the declarator. */
18540 decl_specifiers->type
18543 /* If we're allowing GNU extensions, look for an
18544 asm-specification. */
18546 {
18547 /* Look for an asm-specification. */
18550 }
18551 else
18554 /* Look for attributes. */
18558 /* Peek at the next token. */
18564 {
18565 /* Check to see if the token indicates the start of a
18566 function-definition. */
18568 {
18570 {
18571 /* If a function-definition should not appear here, issue an
18572 error message. */
18576 }
18578 location_t func_brace_location
18581 /* Neither attributes nor an asm-specification are allowed
18582 on a function-definition. */
18585 "an asm-specification is not allowed "
18589 "attributes are not allowed "
18591 /* This is a function-definition. */
18594 /* Parse the function definition. */
18597 decl_specifiers,
18598 declarator,
18599 prefix_attributes);
18600 else
18601 decl =
18602 (cp_parser_function_definition_from_specifiers_and_declarator
18606 {
18607 /* This is where the prologue starts... */
18610 }
18613 }
18614 }
18616 {
18617 /* A non-template declaration involving a function parameter list
18618 containing an implicit template parameter will be made into a
18619 template. If the resulting declaration is not going to be an
18620 actual function then finish the template scope here to prevent it.
18621 An error message will be issued once we have a decl to talk about.
18623 FIXME probably we should do type deduction rather than create an
18624 implicit template, but the standard currently doesn't allow it. */
18627 }
18629 /* [dcl.dcl]
18631 Only in function declarations for constructors, destructors, and
18632 type conversions can the decl-specifier-seq be omitted.
18634 We explicitly postpone this check past the point where we handle
18635 function-definitions because we tolerate function-definitions
18636 that are missing their return types in some modes. */
18638 {
18642 }
18644 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
18648 {
18659 {
18665 }
18666 }
18667 else
18668 {
18669 /* If the init-declarator isn't initialized and isn't followed by a
18670 `,' or `;', it's not a valid init-declarator. */
18673 {
18676 else
18677 {
18681 }
18682 }
18685 }
18687 /* Because start_decl has side-effects, we should only call it if we
18688 know we're going ahead. By this point, we know that we cannot
18689 possibly be looking at any other construct. */
18692 /* Enter the newly declared entry in the symbol table. If we're
18693 processing a declaration in a class-specifier, we wait until
18694 after processing the initializer. */
18696 {
18704 /* Adjust location of decl if declarator->id_loc is more appropriate:
18705 set, and decl wasn't merged with another decl, in which case its
18706 location would be different from input_location, and more accurate. */
18711 }
18713 /* Enter the SCOPE. That way unqualified names appearing in the
18714 initializer will be looked up in SCOPE. */
18717 /* Perform deferred access control checks, now that we know in which
18718 SCOPE the declared entity resides. */
18720 {
18723 /* If the entity being declared is a function, pretend that we
18724 are in its scope. If it is a `friend', it may have access to
18725 things that would not otherwise be accessible. */
18727 {
18730 }
18732 /* Perform access checks for template parameters. */
18735 /* Perform the access control checks for the declarator and the
18736 decl-specifiers. */
18739 /* Restore the saved value. */
18742 }
18744 /* Parse the initializer. */
18749 {
18751 {
18754 else
18755 {
18756 /* If the declaration was erroneous, we don't really
18757 know what the user intended, so just silently
18758 consume the initializer. */
18765 }
18766 }
18767 else
18768 {
18769 /* We want to record the extra mangling scope for in-class
18770 initializers of class members and initializers of static data
18771 member templates. The former involves deferring
18772 parsing of the initializer until end of class as with default
18773 arguments. So right here we only handle the latter. */
18783 }
18784 }
18786 /* The old parser allows attributes to appear after a parenthesized
18787 initializer. Mark Mitchell proposed removing this functionality
18788 on the GCC mailing lists on 2002-08-13. This parser accepts the
18789 attributes -- but ignores them. */
18796 /* And now complain about a non-function implicit template. */
18801 /* For an in-class declaration, use `grokfield' to create the
18802 declaration. */
18804 {
18806 {
18809 }
18818 }
18820 /* Finish processing the declaration. But, skip member
18821 declarations. */
18823 {
18826 asm_specification,
18827 /* If the initializer is in parentheses, then this is
18828 a direct-initialization, which means that an
18829 `explicit' constructor is OK. Otherwise, an
18830 `explicit' constructor cannot be used. */
18833 }
18836 /* Core issue #226 (C++0x only): A default template-argument
18837 shall not be specified in a friend class template
18838 declaration. */
18847 {
18850 else
18852 }
18859 }
18861 /* Parse a declarator.
18863 declarator:
18864 direct-declarator
18865 ptr-operator declarator
18867 abstract-declarator:
18868 ptr-operator abstract-declarator [opt]
18869 direct-abstract-declarator
18871 GNU Extensions:
18873 declarator:
18874 attributes [opt] direct-declarator
18875 attributes [opt] ptr-operator declarator
18877 abstract-declarator:
18878 attributes [opt] ptr-operator abstract-declarator [opt]
18879 attributes [opt] direct-abstract-declarator
18881 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
18882 detect constructor, destructor or conversion operators. It is set
18883 to -1 if the declarator is a name, and +1 if it is a
18884 function. Otherwise it is set to zero. Usually you just want to
18885 test for >0, but internally the negative value is used.
18887 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
18888 a decl-specifier-seq unless it declares a constructor, destructor,
18889 or conversion. It might seem that we could check this condition in
18890 semantic analysis, rather than parsing, but that makes it difficult
18891 to handle something like `f()'. We want to notice that there are
18892 no decl-specifiers, and therefore realize that this is an
18893 expression, not a declaration.)
18895 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
18896 the declarator is a direct-declarator of the form "(...)".
18898 MEMBER_P is true iff this declarator is a member-declarator.
18900 FRIEND_P is true iff this declarator is a friend. */
18904 cp_parser_declarator_kind dcl_kind,
18908 {
18911 cp_cv_quals cv_quals;
18912 tree class_type;
18915 /* Assume this is not a constructor, destructor, or type-conversion
18916 operator. */
18923 /* Check for the ptr-operator production. */
18925 /* Parse the ptr-operator. */
18931 /* If that worked, then we have a ptr-operator. */
18933 {
18934 /* If a ptr-operator was found, then this declarator was not
18935 parenthesized. */
18938 /* The dependent declarator is optional if we are parsing an
18939 abstract-declarator. */
18943 /* Parse the dependent declarator. */
18948 friend_p);
18950 /* If we are parsing an abstract-declarator, we must handle the
18951 case where the dependent declarator is absent. */
18956 declarator = cp_parser_make_indirect_declarator
18958 }
18959 /* Everything else is a direct-declarator. */
18960 else
18961 {
18964 CPP_OPEN_PAREN);
18966 ctor_dtor_or_conv_p,
18968 }
18973 }
18975 /* Parse a direct-declarator or direct-abstract-declarator.
18977 direct-declarator:
18978 declarator-id
18979 direct-declarator ( parameter-declaration-clause )
18980 cv-qualifier-seq [opt]
18981 ref-qualifier [opt]
18982 exception-specification [opt]
18983 direct-declarator [ constant-expression [opt] ]
18984 ( declarator )
18986 direct-abstract-declarator:
18987 direct-abstract-declarator [opt]
18988 ( parameter-declaration-clause )
18989 cv-qualifier-seq [opt]
18990 ref-qualifier [opt]
18991 exception-specification [opt]
18992 direct-abstract-declarator [opt] [ constant-expression [opt] ]
18993 ( abstract-declarator )
18995 Returns a representation of the declarator. DCL_KIND is
18996 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
18997 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
18998 we are parsing a direct-declarator. It is
18999 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19000 of ambiguity we prefer an abstract declarator, as per
19001 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19002 as for cp_parser_declarator. */
19006 cp_parser_declarator_kind dcl_kind,
19009 {
19019 {
19020 /* Peek at the next token. */
19023 {
19024 /* This is either a parameter-declaration-clause, or a
19025 parenthesized declarator. When we know we are parsing a
19026 named declarator, it must be a parenthesized declarator
19027 if FIRST is true. For instance, `(int)' is a
19028 parameter-declaration-clause, with an omitted
19029 direct-abstract-declarator. But `((*))', is a
19030 parenthesized abstract declarator. Finally, when T is a
19031 template parameter `(T)' is a
19032 parameter-declaration-clause, and not a parenthesized
19033 named declarator.
19035 We first try and parse a parameter-declaration-clause,
19036 and then try a nested declarator (if FIRST is true).
19038 It is not an error for it not to be a
19039 parameter-declaration-clause, even when FIRST is
19040 false. Consider,
19042 int i (int);
19043 int i (3);
19045 The first is the declaration of a function while the
19046 second is the definition of a variable, including its
19047 initializer.
19049 Having seen only the parenthesis, we cannot know which of
19050 these two alternatives should be selected. Even more
19051 complex are examples like:
19053 int i (int (a));
19054 int i (int (3));
19056 The former is a function-declaration; the latter is a
19057 variable initialization.
19059 Thus again, we try a parameter-declaration-clause, and if
19060 that fails, we back out and return. */
19063 {
19064 tree params;
19067 /* In a member-declarator, the only valid interpretation
19068 of a parenthesis is the start of a
19069 parameter-declaration-clause. (It is invalid to
19070 initialize a static data member with a parenthesized
19071 initializer; only the "=" form of initialization is
19072 permitted.) */
19076 /* Consume the `('. */
19079 {
19080 /* If this is going to be an abstract declarator, we're
19081 in a declarator and we can't have default args. */
19084 }
19088 /* Parse the parameter-declaration-clause. */
19091 /* Consume the `)'. */
19094 /* If all went well, parse the cv-qualifier-seq,
19095 ref-qualifier and the exception-specification. */
19097 {
19098 cp_cv_quals cv_quals;
19099 cp_virt_specifiers virt_specifiers;
19100 cp_ref_qualifier ref_qual;
19101 tree exception_specification;
19102 tree late_return;
19103 tree attrs;
19113 /* Parse the cv-qualifier-seq. */
19115 /* Parse the ref-qualifier. */
19117 /* Parse the tx-qualifier. */
19119 /* And the exception-specification. */
19120 exception_specification
19125 /* In here, we handle cases where attribute is used after
19126 the function declaration. For example:
19127 void func (int x) __attribute__((vector(..))); */
19131 {
19135 CPP_SEMICOLON)
19137 CPP_OPEN_BRACE))
19140 ;
19141 else
19143 }
19145 late_return = (cp_parser_late_return_type_opt
19149 /* Parse the virt-specifier-seq. */
19152 /* Create the function-declarator. */
19154 params,
19155 cv_quals,
19156 virt_specifiers,
19157 ref_qual,
19158 tx_qual,
19159 exception_specification,
19160 late_return,
19161 requires_clause);
19164 /* Any subsequent parameter lists are to do with
19165 return type, so are not those of the declared
19166 function. */
19168 }
19170 /* Remove the function parms from scope. */
19174 /* Repeat the main loop. */
19176 }
19178 /* If this is the first, we can try a parenthesized
19179 declarator. */
19181 {
19187 /* Consume the `('. */
19189 /* Parse the nested declarator. */
19192 declarator
19198 /* Expect a `)'. */
19205 }
19206 /* Otherwise, we must be done. */
19207 else
19209 }
19213 {
19214 /* Parse an array-declarator. */
19223 /* Consume the `['. */
19225 /* Peek at the next token. */
19227 /* If the next token is `]', then there is no
19228 constant-expression. */
19230 {
19232 bounds
19242 {
19243 /* Normally, the array bound must be an integral constant
19244 expression. However, as an extension, we allow VLAs
19245 in function scopes as long as they aren't part of a
19246 parameter declaration. */
19250 }
19253 {
19254 /* Remember this wasn't a constant-expression. */
19257 }
19258 }
19259 else
19261 /* Look for the closing `]'. */
19263 {
19266 }
19271 }
19273 {
19274 {
19275 tree qualifying_scope;
19276 tree unqualified_name;
19277 tree attrs;
19278 special_function_kind sfk;
19283 /* Parse a declarator-id */
19286 {
19289 /* If we see an ellipsis, we should be looking at a
19290 parameter pack. */
19292 {
19293 /* Consume the `...' */
19297 }
19298 }
19301 unqualified_name
19305 {
19309 {
19310 /* Check whether an error occurred. */
19313 /* We already consumed the ellipsis to mark a
19314 parameter pack, but we have no way to report it,
19315 so abort the tentative parse. We will be exiting
19316 immediately anyway. */
19318 }
19319 else
19325 && (qualifying_scope
19327 {
19330 }
19331 }
19336 {
19341 }
19347 {
19348 /* In the declaration of a member of a template class
19349 outside of the class itself, the SCOPE will sometimes
19350 be a TYPENAME_TYPE. For example, given:
19352 template <typename T>
19353 int S<T>::R::i = 3;
19355 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19356 this context, we must resolve S<T>::R to an ordinary
19357 type, rather than a typename type.
19359 The reason we normally avoid resolving TYPENAME_TYPEs
19360 is that a specialization of `S' might render
19361 `S<T>::R' not a type. However, if `S' is
19362 specialized, then this `i' will not be used, so there
19363 is no harm in resolving the types here. */
19364 tree type;
19366 /* Resolve the TYPENAME_TYPE. */
19369 /* If that failed, the declarator is invalid. */
19371 {
19374 "cannot define member of dependent typedef "
19376 else
19381 }
19383 }
19388 {
19389 tree class_type;
19394 else
19398 {
19401 {
19404 {
19408 "use %<%T::%D%> instead of %<%T::%D%> to "
19410 class_type,
19415 }
19416 else
19418 }
19419 else
19420 {
19421 /* We do not attempt to print the declarator
19422 here because we do not have enough
19423 information about its original syntactic
19424 form. */
19428 }
19429 }
19432 {
19438 for an unnamed type, even if the type
19439 got a name for linkage purposes. */
19441 /* Handle correctly (c++/19200):
19443 struct S {
19444 struct T{};
19445 friend void S(T);
19446 };
19448 and also:
19450 namespace N {
19451 void S();
19452 }
19454 struct S {
19455 friend void N::S();
19456 }; */
19457 && !(friend_p
19460 class_type))
19461 {
19464 }
19472 }
19473 }
19475 unqualified_name,
19476 sfk);
19483 }
19485 handle_declarator:;
19488 {
19489 /* Any names that appear after the declarator-id for a
19490 member are looked up in the containing scope. */
19492 {
19493 /* But declarations with qualified-ids can't appear in a
19494 function. */
19498 }
19500 }
19504 /* Default args are only allowed on function
19505 declarations. */
19507 else
19511 }
19512 /* We're done. */
19513 else
19515 }
19517 /* For an abstract declarator, we might wind up with nothing at this
19518 point. That's an error; the declarator is not optional. */
19522 /* If we entered a scope, we must exit it now. */
19530 }
19532 /* Parse a ptr-operator.
19534 ptr-operator:
19535 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19536 * cv-qualifier-seq [opt]
19537 &
19538 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
19539 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19541 GNU Extension:
19543 ptr-operator:
19544 & cv-qualifier-seq [opt]
19546 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
19547 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
19548 an rvalue reference. In the case of a pointer-to-member, *TYPE is
19549 filled in with the TYPE containing the member. *CV_QUALS is
19550 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
19551 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
19552 Note that the tree codes returned by this function have nothing
19553 to do with the types of trees that will be eventually be created
19554 to represent the pointer or reference type being parsed. They are
19555 just constants with suggestive names. */
19556 static enum tree_code
19561 {
19566 /* Assume that it's not a pointer-to-member. */
19568 /* And that there are no cv-qualifiers. */
19571 /* Peek at the next token. */
19574 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
19584 {
19585 /* Consume the `*', `&' or `&&'. */
19588 /* A `*' can be followed by a cv-qualifier-seq, and so can a
19589 `&', if we are allowing GNU extensions. (The only qualifier
19590 that can legally appear after `&' is `restrict', but that is
19591 enforced during semantic analysis. */
19599 }
19600 else
19601 {
19602 /* Try the pointer-to-member case. */
19604 /* Look for the optional `::' operator. */
19607 /* Look for the nested-name specifier. */
19614 /* If we found it, and the next token is a `*', then we are
19615 indeed looking at a pointer-to-member operator. */
19618 {
19619 /* Indicate that the `*' operator was used. */
19627 else
19628 {
19629 /* The type of which the member is a member is given by the
19630 current SCOPE. */
19632 /* The next name will not be qualified. */
19636 /* Look for optional c++11 attributes. */
19640 /* Look for the optional cv-qualifier-seq. */
19642 }
19643 }
19644 /* If that didn't work we don't have a ptr-operator. */
19647 }
19650 }
19652 /* Parse an (optional) cv-qualifier-seq.
19654 cv-qualifier-seq:
19655 cv-qualifier cv-qualifier-seq [opt]
19657 cv-qualifier:
19658 const
19659 volatile
19661 GNU Extension:
19663 cv-qualifier:
19664 __restrict__
19666 Returns a bitmask representing the cv-qualifiers. */
19668 static cp_cv_quals
19670 {
19674 {
19676 cp_cv_quals cv_qualifier;
19678 /* Peek at the next token. */
19680 /* See if it's a cv-qualifier. */
19682 {
19698 }
19704 {
19707 }
19708 else
19709 {
19712 }
19713 }
19716 }
19718 /* Parse an (optional) ref-qualifier
19720 ref-qualifier:
19721 &
19722 &&
19724 Returns cp_ref_qualifier representing ref-qualifier. */
19726 static cp_ref_qualifier
19728 {
19731 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
19736 {
19741 {
19753 }
19758 {
19761 }
19762 else
19763 {
19766 }
19767 }
19770 }
19772 /* Parse an optional tx-qualifier.
19774 tx-qualifier:
19775 transaction_safe
19776 transaction_safe_dynamic */
19778 static tree
19780 {
19783 {
19788 {
19792 {
19795 {
19798 }
19799 else
19801 }
19802 }
19803 }
19805 }
19807 /* Parse an (optional) virt-specifier-seq.
19809 virt-specifier-seq:
19810 virt-specifier virt-specifier-seq [opt]
19812 virt-specifier:
19813 override
19814 final
19816 Returns a bitmask representing the virt-specifiers. */
19818 static cp_virt_specifiers
19820 {
19824 {
19826 cp_virt_specifiers virt_specifier;
19828 /* Peek at the next token. */
19830 /* See if it's a virt-specifier-qualifier. */
19834 {
19837 }
19839 {
19842 }
19844 {
19846 }
19847 else
19851 {
19854 }
19855 else
19856 {
19859 }
19860 }
19862 }
19864 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
19865 is in scope even though it isn't real. */
19867 void
19869 {
19870 tree this_parm;
19873 {
19874 /* We don't clear this between NSDMIs. Is it already what we want? */
19879 }
19882 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
19884 current_class_ref
19887 }
19889 /* Return true iff our current scope is a non-static data member
19890 initializer. */
19892 bool
19894 {
19895 /* We recognize NSDMI context by the context-less 'this' pointer set up
19896 by the function above. */
19902 }
19904 /* Parse a late-specified return type, if any. This is not a separate
19905 non-terminal, but part of a function declarator, which looks like
19907 -> trailing-type-specifier-seq abstract-declarator(opt)
19909 Returns the type indicated by the type-id.
19911 In addition to this, parse any queued up #pragma omp declare simd
19912 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
19913 #pragma acc routine clauses.
19915 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
19916 function. */
19918 static tree
19921 {
19925 && declarator
19932 && declarator
19935 /* Peek at the next token. */
19937 /* A late-specified return type is indicated by an initial '->'. */
19948 {
19949 /* DR 1207: 'this' is in scope in the trailing return type. */
19951 }
19954 {
19955 /* Consume the ->. */
19959 }
19961 /* Function declarations may be followed by a trailing
19962 requires-clause. */
19966 declarator->attributes
19970 declarator->attributes
19974 declarator->attributes
19979 {
19982 }
19985 }
19987 /* Parse a declarator-id.
19989 declarator-id:
19990 id-expression
19991 :: [opt] nested-name-specifier [opt] type-name
19993 In the `id-expression' case, the value returned is as for
19994 cp_parser_id_expression if the id-expression was an unqualified-id.
19995 If the id-expression was a qualified-id, then a SCOPE_REF is
19996 returned. The first operand is the scope (either a NAMESPACE_DECL
19997 or TREE_TYPE), but the second is still just a representation of an
19998 unqualified-id. */
20000 static tree
20002 {
20003 tree id;
20004 /* The expression must be an id-expression. Assume that qualified
20005 names are the names of types so that:
20007 template <class T>
20008 int S<T>::R::i = 3;
20010 will work; we must treat `S<T>::R' as the name of a type.
20011 Similarly, assume that qualified names are templates, where
20012 required, so that:
20014 template <class T>
20015 int S<T>::R<T>::i = 3;
20017 will work, too. */
20023 optional_p);
20027 }
20029 /* Parse a type-id.
20031 type-id:
20032 type-specifier-seq abstract-declarator [opt]
20034 Returns the TYPE specified. */
20036 static tree
20039 {
20040 cp_decl_specifier_seq type_specifier_seq;
20043 /* Parse the type-specifier-seq. */
20045 is_trailing_return,
20050 /* There might or might not be an abstract declarator. */
20052 /* Look for the declarator. */
20053 abstract_declarator
20058 /* Check to see if there really was a declarator. */
20063 /* The concepts TS allows 'auto' as a type-id. */
20065 /* None of the valid uses of 'auto' in C++14 involve the type-id
20066 nonterminal, but it is valid in a trailing-return-type. */
20069 {
20070 /* A type-id with type 'auto' is only ok if the abstract declarator
20071 is a function declarator with a late-specified return type.
20073 A type-id with 'auto' is also valid in a trailing-return-type
20074 in a compound-requirement. */
20081 else
20082 {
20085 }
20086 }
20089 is_template_arg);
20090 }
20092 static tree
20094 {
20096 }
20098 static tree
20100 {
20101 tree r;
20103 parser->type_definition_forbidden_message
20108 {
20111 }
20113 }
20115 static tree
20117 {
20119 }
20121 /* Parse a type-specifier-seq.
20123 type-specifier-seq:
20124 type-specifier type-specifier-seq [opt]
20126 GNU extension:
20128 type-specifier-seq:
20129 attributes type-specifier-seq [opt]
20131 If IS_DECLARATION is true, we are at the start of a "condition" or
20132 exception-declaration, so we might be followed by a declarator-id.
20134 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20135 i.e. we've just seen "->".
20137 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20139 static void
20144 {
20149 /* Clear the TYPE_SPECIFIER_SEQ. */
20152 /* In the context of a trailing return type, enum E { } is an
20153 elaborated-type-specifier followed by a function-body, not an
20154 enum-specifier. */
20158 /* Parse the type-specifiers and attributes. */
20160 {
20161 tree type_specifier;
20164 /* Check for attributes first. */
20166 {
20171 }
20173 /* record the token of the beginning of the type specifier seq,
20174 for error reporting purposes*/
20178 /* Look for the type-specifier. */
20180 flags,
20181 type_specifier_seq,
20183 NULL,
20186 {
20187 /* If the first type-specifier could not be found, this is not a
20188 type-specifier-seq at all. */
20190 {
20191 /* Set in_declarator_p to avoid skipping to the semicolon. */
20203 }
20204 /* If subsequent type-specifiers could not be found, the
20205 type-specifier-seq is complete. */
20207 }
20210 /* The standard says that a condition can be:
20212 type-specifier-seq declarator = assignment-expression
20214 However, given:
20216 struct S {};
20217 if (int S = ...)
20219 we should treat the "S" as a declarator, not as a
20220 type-specifier. The standard doesn't say that explicitly for
20221 type-specifier-seq, but it does say that for
20222 decl-specifier-seq in an ordinary declaration. Perhaps it
20223 would be clearer just to allow a decl-specifier-seq here, and
20224 then add a semantic restriction that if any decl-specifiers
20225 that are not type-specifiers appear, the program is invalid. */
20228 }
20229 }
20231 /* Return whether the function currently being declared has an associated
20232 template parameter list. */
20234 static bool
20236 {
20249 }
20251 /* Parse a parameter-declaration-clause.
20253 parameter-declaration-clause:
20254 parameter-declaration-list [opt] ... [opt]
20255 parameter-declaration-list , ...
20257 Returns a representation for the parameter declarations. A return
20258 value of NULL indicates a parameter-declaration-clause consisting
20259 only of an ellipsis. */
20261 static tree
20263 {
20264 tree parameters;
20273 parser->auto_is_implicit_function_template_parm_p
20275 }
20281 && !processing_template_parmlist
20287 /* Peek at the next token. */
20289 /* Check for trivial parameter-declaration-clauses. */
20291 {
20292 /* Consume the `...' token. */
20295 }
20297 /* There are no parameters. */
20298 {
20299 #ifndef NO_IMPLICIT_EXTERN_C
20304 else
20305 #endif
20307 }
20308 /* Check for `(void)', too, which is a special case. */
20312 {
20313 /* Consume the `void' token. */
20315 /* There are no parameters. */
20317 }
20319 /* Parse the parameter-declaration-list. */
20321 /* If a parse error occurred while parsing the
20322 parameter-declaration-list, then the entire
20323 parameter-declaration-clause is erroneous. */
20327 /* Peek at the next token. */
20329 /* If it's a `,', the clause should terminate with an ellipsis. */
20331 {
20332 /* Consume the `,'. */
20334 /* Expect an ellipsis. */
20335 ellipsis_p
20337 }
20338 /* It might also be `...' if the optional trailing `,' was
20339 omitted. */
20341 {
20342 /* Consume the `...' token. */
20344 /* And remember that we saw it. */
20346 }
20347 else
20350 /* Finish the parameter list. */
20355 }
20357 /* Parse a parameter-declaration-list.
20359 parameter-declaration-list:
20360 parameter-declaration
20361 parameter-declaration-list , parameter-declaration
20363 Returns a representation of the parameter-declaration-list, as for
20364 cp_parser_parameter_declaration_clause. However, the
20365 `void_list_node' is never appended to the list. Upon return,
20366 *IS_ERROR will be true iff an error occurred. */
20368 static tree
20370 {
20376 /* Assume all will go well. */
20378 /* The special considerations that apply to a function within an
20379 unbraced linkage specifications do not apply to the parameters
20380 to the function. */
20381 saved_in_unbraced_linkage_specification_p
20385 /* Look for more parameters. */
20387 {
20395 /* Parse the parameter. */
20396 parameter
20401 /* We don't know yet if the enclosing context is deprecated, so wait
20402 and warn in grokparms if appropriate. */
20406 {
20407 /* If a function parameter pack was specified and an implicit template
20408 parameter was introduced during cp_parser_parameter_declaration,
20409 change any implicit parameters introduced into packs. */
20413 {
20421 }
20425 PARM,
20428 }
20432 /* If a parse error occurred parsing the parameter declaration,
20433 then the entire parameter-declaration-list is erroneous. */
20435 {
20439 }
20449 {
20453 }
20455 /* Add the new parameter to the list. */
20459 /* Peek at the next token. */
20462 /* These are for Objective-C++ */
20465 /* The parameter-declaration-list is complete. */
20468 {
20471 /* Peek at the next token. */
20473 /* If it's an ellipsis, then the list is complete. */
20476 /* Otherwise, there must be more parameters. Consume the
20477 `,'. */
20479 /* When parsing something like:
20481 int i(float f, double d)
20483 we can tell after seeing the declaration for "f" that we
20484 are not looking at an initialization of a variable "i",
20485 but rather at the declaration of a function "i".
20487 Due to the fact that the parsing of template arguments
20488 (as specified to a template-id) requires backtracking we
20489 cannot use this technique when inside a template argument
20490 list. */
20494 /* However, a parameter-declaration of the form
20495 "float(f)" (which is a valid declaration of a
20496 parameter "f") can also be interpreted as an
20497 expression (the conversion of "f" to "float"). */
20500 }
20501 else
20502 {
20510 }
20511 }
20513 parser->in_unbraced_linkage_specification_p
20516 /* Reset implicit_template_scope if we are about to leave the function
20517 parameter list that introduced it. Note that for out-of-line member
20518 definitions, there will be one or more class scopes before we get to
20519 the template parameter scope. */
20523 {
20527 {
20530 }
20531 }
20534 }
20536 /* Parse a parameter declaration.
20538 parameter-declaration:
20539 decl-specifier-seq ... [opt] declarator
20540 decl-specifier-seq declarator = assignment-expression
20541 decl-specifier-seq ... [opt] abstract-declarator [opt]
20542 decl-specifier-seq abstract-declarator [opt] = assignment-expression
20544 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
20545 declares a template parameter. (In that case, a non-nested `>'
20546 token encountered during the parsing of the assignment-expression
20547 is not interpreted as a greater-than operator.)
20549 Returns a representation of the parameter, or NULL if an error
20550 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
20551 true iff the declarator is of the form "(p)". */
20557 {
20559 cp_decl_specifier_seq decl_specifiers;
20561 tree default_argument;
20566 /* In a template parameter, `>' is not an operator.
20568 [temp.param]
20570 When parsing a default template-argument for a non-type
20571 template-parameter, the first non-nested `>' is taken as the end
20572 of the template parameter-list rather than a greater-than
20573 operator. */
20575 /* Type definitions may not appear in parameter types. */
20577 parser->type_definition_forbidden_message
20580 /* Parse the declaration-specifiers. */
20582 CP_PARSER_FLAGS_NONE,
20586 /* Complain about missing 'typename' or other invalid type names. */
20591 /* If an error occurred, there's no reason to attempt to parse the
20592 rest of the declaration. */
20594 {
20597 }
20599 /* Peek at the next token. */
20602 /* If the next token is a `)', `,', `=', `>', or `...', then there
20603 is no declarator. However, when variadic templates are enabled,
20604 there may be a declarator following `...'. */
20609 {
20613 }
20614 /* Otherwise, there should be a declarator. */
20615 else
20616 {
20620 /* After seeing a decl-specifier-seq, if the next token is not a
20621 "(", there is no possibility that the code is a valid
20622 expression. Therefore, if parsing tentatively, we commit at
20623 this point. */
20625 /* In an expression context, having seen:
20627 (int((char ...
20629 we cannot be sure whether we are looking at a
20630 function-type (taking a "char" as a parameter) or a cast
20631 of some object of type "char" to "int". */
20637 /* Parse the declarator. */
20640 CP_PARSER_DECLARATOR_EITHER,
20642 parenthesized_p,
20646 /* After the declarator, allow more attributes. */
20647 decl_specifiers.attributes
20651 /* If the declarator is a template parameter pack, remember that and
20652 clear the flag in the declarator itself so we don't get errors
20653 from grokdeclarator. */
20655 {
20658 }
20659 }
20661 /* If the next token is an ellipsis, and we have not seen a declarator
20662 name, and if either the type of the declarator contains parameter
20663 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
20664 for, eg, abbreviated integral type names), then we actually have a
20665 parameter pack expansion expression. Otherwise, leave the ellipsis
20666 for a C-style variadic function. */
20669 {
20680 {
20681 /* Consume the `...'. */
20685 /* Build a pack expansion type */
20690 else
20692 }
20693 }
20695 /* The restriction on defining new types applies only to the type
20696 of the parameter, not to the default argument. */
20699 /* If the next token is `=', then process a default argument. */
20701 {
20704 /* If we are defining a class, then the tokens that make up the
20705 default argument must be saved and processed later. */
20711 // A constrained-type-specifier may declare a type template-parameter.
20713 default_argument
20716 // A constrained-type-specifier may declare a template-template-parameter.
20718 default_argument
20721 /* Outside of a class definition, we can just parse the
20722 assignment-expression. */
20723 else
20724 default_argument
20728 {
20730 "default arguments are only "
20732 }
20734 || template_parameter_pack_p
20737 {
20738 /* Find the name of the parameter pack. */
20745 template_parm_p
20751 else
20753 template_parm_p
20760 }
20761 }
20762 else
20766 declarator,
20767 default_argument,
20768 template_parameter_pack_p);
20769 }
20771 /* Parse a default argument and return it.
20773 TEMPLATE_PARM_P is true if this is a default argument for a
20774 non-type template parameter. */
20775 static tree
20777 {
20783 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
20784 set correctly. */
20787 /* Local variable names (and the `this' keyword) may not
20788 appear in a default argument. */
20791 /* Parse the assignment-expression. */
20796 /* The "this" pointer is not valid in a default argument. */
20798 {
20803 }
20804 default_argument
20806 /* Restore the "this" pointer. */
20808 {
20811 }
20820 }
20822 /* Parse a function-body.
20824 function-body:
20825 compound_statement */
20827 static void
20829 {
20833 }
20835 /* Parse a ctor-initializer-opt followed by a function-body. Return
20836 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
20837 is true we are parsing a function-try-block. */
20839 static bool
20842 {
20850 /* Begin the function body. */
20852 /* Parse the optional ctor-initializer. */
20855 /* If we're parsing a constexpr constructor definition, we need
20856 to check that the constructor body is indeed empty. However,
20857 before we get to cp_parser_function_body lot of junk has been
20858 generated, so we can't just check that we have an empty block.
20859 Rather we take a snapshot of the outermost block, and check whether
20860 cp_parser_function_body changed its state. */
20862 {
20866 }
20867 /* Parse the function-body. */
20871 /* Finish the function body. */
20875 }
20877 /* Parse an initializer.
20879 initializer:
20880 = initializer-clause
20881 ( expression-list )
20883 Returns an expression representing the initializer. If no
20884 initializer is present, NULL_TREE is returned.
20886 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
20887 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
20888 set to TRUE if there is no initializer present. If there is an
20889 initializer, and it is not a constant-expression, *NON_CONSTANT_P
20890 is set to true; otherwise it is set to false. */
20892 static tree
20895 {
20897 tree init;
20899 /* Peek at the next token. */
20902 /* Let our caller know whether or not this initializer was
20903 parenthesized. */
20905 /* Assume that the initializer is constant. */
20909 {
20910 /* Consume the `='. */
20912 /* Parse the initializer-clause. */
20914 }
20916 {
20921 non_constant_p);
20926 }
20928 {
20933 }
20934 else
20935 {
20936 /* Anything else is an error. */
20939 }
20945 }
20947 /* Parse an initializer-clause.
20949 initializer-clause:
20950 assignment-expression
20951 braced-init-list
20953 Returns an expression representing the initializer.
20955 If the `assignment-expression' production is used the value
20956 returned is simply a representation for the expression.
20958 Otherwise, calls cp_parser_braced_list. */
20960 static cp_expr
20962 {
20963 cp_expr initializer;
20965 /* Assume the expression is constant. */
20968 /* If it is not a `{', then we are looking at an
20969 assignment-expression. */
20971 {
20972 initializer
20975 non_constant_p);
20976 }
20977 else
20981 }
20983 /* Parse a brace-enclosed initializer list.
20985 braced-init-list:
20986 { initializer-list , [opt] }
20987 { }
20989 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
20990 the elements of the initializer-list (or NULL, if the last
20991 production is used). The TREE_TYPE for the CONSTRUCTOR will be
20992 NULL_TREE. There is no way to detect whether or not the optional
20993 trailing `,' was provided. NON_CONSTANT_P is as for
20994 cp_parser_initializer. */
20996 static cp_expr
20998 {
20999 tree initializer;
21002 /* Consume the `{' token. */
21004 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21006 /* If it's not a `}', then there is a non-trivial initializer. */
21008 {
21009 /* Parse the initializer list. */
21012 /* A trailing `,' token is allowed. */
21015 }
21016 else
21018 /* Now, there should be a trailing `}'. */
21024 /* Build a location of the form:
21025 { ... }
21026 ^~~~~~~
21027 with caret==start at the open brace, finish at the close brace. */
21031 }
21033 /* Consume tokens up to, and including, the next non-nested closing `]'.
21034 Returns true iff we found a closing `]'. */
21036 static bool
21038 {
21042 {
21046 {
21049 /* If we've run out of tokens, then there is no closing `]'. */
21058 {
21061 }
21066 }
21068 /* Consume the token. */
21070 }
21071 }
21073 /* Return true if we are looking at an array-designator, false otherwise. */
21075 static bool
21077 {
21078 /* Consume the `['. */
21083 /* Skip tokens until the next token is a closing square bracket.
21084 If we find the closing `]', and the next token is a `=', then
21085 we are looking at an array designator. */
21086 bool array_designator_p
21090 /* Roll back the tokens we skipped. */
21094 }
21096 /* Parse an initializer-list.
21098 initializer-list:
21099 initializer-clause ... [opt]
21100 initializer-list , initializer-clause ... [opt]
21102 GNU Extension:
21104 initializer-list:
21105 designation initializer-clause ...[opt]
21106 initializer-list , designation initializer-clause ...[opt]
21108 designation:
21109 . identifier =
21110 identifier :
21111 [ constant-expression ] =
21113 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21114 for the initializer. If the INDEX of the elt is non-NULL, it is the
21115 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21116 as for cp_parser_initializer. */
21120 {
21123 /* Assume all of the expressions are constant. */
21126 /* Parse the rest of the list. */
21128 {
21130 tree designator;
21131 tree initializer;
21134 /* If the next token is an identifier and the following one is a
21135 colon, we are looking at the GNU designated-initializer
21136 syntax. */
21140 {
21141 /* Warn the user that they are using an extension. */
21144 /* Consume the identifier. */
21146 /* Consume the `:'. */
21148 }
21149 /* Also handle the C99 syntax, '. id ='. */
21154 {
21155 /* Warn the user that they are using an extension. */
21158 /* Consume the `.'. */
21160 /* Consume the identifier. */
21162 /* Consume the `='. */
21164 }
21165 /* Also handle C99 array designators, '[ const ] ='. */
21169 {
21170 /* In C++11, [ could start a lambda-introducer. */
21176 {
21179 }
21180 else
21181 {
21186 }
21192 }
21193 else
21196 /* Parse the initializer. */
21199 /* If any clause is non-constant, so is the entire initializer. */
21203 /* If we have an ellipsis, this is an initializer pack
21204 expansion. */
21206 {
21207 /* Consume the `...'. */
21210 /* Turn the initializer into an initializer expansion. */
21212 }
21214 /* Add it to the vector. */
21217 /* If the next token is not a comma, we have reached the end of
21218 the list. */
21222 /* Peek at the next token. */
21224 /* If the next token is a `}', then we're still done. An
21225 initializer-clause can have a trailing `,' after the
21226 initializer-list and before the closing `}'. */
21230 /* Consume the `,' token. */
21232 }
21235 }
21237 /* Classes [gram.class] */
21239 /* Parse a class-name.
21241 class-name:
21242 identifier
21243 template-id
21245 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21246 to indicate that names looked up in dependent types should be
21247 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21248 keyword has been used to indicate that the name that appears next
21249 is a template. TAG_TYPE indicates the explicit tag given before
21250 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21251 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21252 is the class being defined in a class-head. If ENUM_OK is TRUE,
21253 enum-names are also accepted.
21255 Returns the TYPE_DECL representing the class. */
21257 static tree
21266 {
21267 tree decl;
21268 tree scope;
21273 /* All class-names start with an identifier. */
21276 {
21279 }
21281 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21282 to a template-id, so we save it here. */
21287 /* Any name names a type if we're following the `typename' keyword
21288 in a qualified name where the enclosing scope is type-dependent. */
21291 /* Handle the common case (an identifier, but not a template-id)
21292 efficiently. */
21295 {
21299 /* Look for the identifier. */
21303 /* If the next token isn't an identifier, we are certainly not
21304 looking at a class-name. */
21307 /* If we know this is a type-name, there's no need to look it
21308 up. */
21311 else
21312 {
21313 tree ambiguous_decls;
21314 /* If we already know that this lookup is ambiguous, then
21315 we've already issued an error message; there's no reason
21316 to check again. */
21318 {
21321 }
21322 /* If the next token is a `::', then the name must be a type
21323 name.
21325 [basic.lookup.qual]
21327 During the lookup for a name preceding the :: scope
21328 resolution operator, object, function, and enumerator
21329 names are ignored. */
21332 /* Look up the name. */
21334 tag_type,
21337 check_dependency_p,
21341 {
21345 }
21346 }
21347 }
21348 else
21349 {
21350 /* Try a template-id. */
21352 check_dependency_p,
21353 tag_type,
21354 is_declaration);
21357 }
21361 /* If this is a typename, create a TYPENAME_TYPE. */
21363 {
21368 }
21372 /* Check to see that it is really the name of a class. */
21376 /* Situations like this:
21378 template <typename T> struct A {
21379 typename T::template X<int>::I i;
21380 };
21382 are problematic. Is `T::template X<int>' a class-name? The
21383 standard does not seem to be definitive, but there is no other
21384 valid interpretation of the following `::'. Therefore, those
21385 names are considered class-names. */
21386 {
21390 }
21395 /* In Objective-C 2.0, a classname followed by '.' starts a
21396 dot-syntax expression, and it's not a type-name. */
21408 }
21410 /* Parse a class-specifier.
21412 class-specifier:
21413 class-head { member-specification [opt] }
21415 Returns the TREE_TYPE representing the class. */
21417 static tree
21419 {
21420 tree type;
21434 /* Parse the class-head. */
21437 /* If the class-head was a semantic disaster, skip the entire body
21438 of the class. */
21440 {
21444 }
21446 /* Look for the `{'. */
21448 {
21451 }
21456 /* Issue an error message if type-definitions are forbidden here. */
21458 /* Remember that we are defining one more class. */
21460 /* Inside the class, surrounding template-parameter-lists do not
21461 apply. */
21462 saved_num_template_parameter_lists
21465 /* We are not in a function body. */
21468 /* Or in a loop. */
21471 /* Or in a switch. */
21474 /* We are not immediately inside an extern "lang" block. */
21475 saved_in_unbraced_linkage_specification_p
21479 // Associate constraints with the type.
21483 /* Start the class. */
21485 {
21488 }
21492 /* If the type is erroneous, skip the entire body of the class. */
21494 else
21495 /* Parse the member-specification. */
21498 /* Look for the trailing `}'. */
21500 /* Look for trailing attributes to apply to this class. */
21508 /* We've finished a type definition. Check for the common syntax
21509 error of forgetting a semicolon after the definition. We need to
21510 be careful, as we can't just check for not-a-semicolon and be done
21511 with it; the user might have typed:
21513 class X { } c = ...;
21514 class X { } *p = ...;
21516 and so forth. Instead, enumerate all the possible tokens that
21517 might follow this production; if we don't see one of them, then
21518 complain and silently insert the semicolon. */
21519 {
21524 /* Don't try to parse c++11 attributes here. As per the
21525 grammar, that should be a task for
21526 cp_parser_decl_specifier_seq. */
21530 {
21541 /* While it's legal for type qualifiers and storage class
21542 specifiers to follow type definitions in the grammar, only
21543 compiler testsuites contain code like that. Assume that if
21544 we see such code, then what we're really seeing is a case
21545 like:
21547 class X { }
21548 const <type> var = ...;
21550 or
21552 class Y { }
21553 static <type> func (...) ...
21555 i.e. the qualifier or specifier applies to the next
21556 declaration. To do so, however, we need to look ahead one
21557 more token to see if *that* token is a type specifier.
21559 This code could be improved to handle:
21561 class Z { }
21562 static const <type> var = ...; */
21565 {
21568 /* Handling user-defined types here would be nice, but very
21569 tricky. */
21570 want_semicolon
21573 }
21577 }
21579 /* If we don't have a type, then something is very wrong and we
21580 shouldn't try to do anything clever. Likewise for not seeing the
21581 closing brace. */
21583 {
21584 /* Locate the closing brace. */
21585 cp_token_position prev
21590 /* We want to suggest insertion of a ';' immediately *after* the
21591 closing brace, so, if we can, offset the location by 1 column. */
21608 else
21611 /* Unget one token and smash it to look as though we encountered
21612 a semicolon in the input stream. */
21617 }
21618 }
21620 /* If this class is not itself within the scope of another class,
21621 then we need to parse the bodies of all of the queued function
21622 definitions. Note that the queued functions defined in a class
21623 are not always processed immediately following the
21624 class-specifier for that class. Consider:
21626 struct A {
21627 struct B { void f() { sizeof (A); } };
21628 };
21630 If `f' were processed before the processing of `A' were
21631 completed, there would be no way to compute the size of `A'.
21632 Note that the nesting we are interested in here is lexical --
21633 not the semantic nesting given by TYPE_CONTEXT. In particular,
21634 for:
21636 struct A { struct B; };
21637 struct A::B { void f() { } };
21639 there is no need to delay the parsing of `A::B::f'. */
21641 {
21642 tree decl;
21649 /* In a first pass, parse default arguments to the functions.
21650 Then, in a second pass, parse the bodies of the functions.
21651 This two-phased approach handles cases like:
21653 struct S {
21654 void f() { g(); }
21655 void g(int i = 3);
21656 };
21658 */
21660 {
21662 /* If there are default arguments that have not yet been processed,
21663 take care of them now. */
21665 {
21670 }
21671 /* Make sure that any template parameters are in scope. */
21673 /* Parse the default argument expressions. */
21675 /* Remove any template parameters from the symbol table. */
21677 }
21679 /* Now parse any NSDMIs. */
21683 {
21685 {
21690 }
21693 }
21700 /* Now do some post-NSDMI bookkeeping. */
21706 /* Now parse the body of the functions. */
21708 {
21709 /* OpenMP UDRs need to be parsed before all other functions. */
21716 }
21717 else
21721 }
21722 else
21725 /* Put back any saved access checks. */
21728 /* Restore saved state. */
21732 parser->num_template_parameter_lists
21734 parser->in_unbraced_linkage_specification_p
21738 }
21740 static tree
21742 {
21743 tree ret;
21748 }
21750 /* Parse a class-head.
21752 class-head:
21753 class-key identifier [opt] base-clause [opt]
21754 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
21755 class-key nested-name-specifier [opt] template-id
21756 base-clause [opt]
21758 class-virt-specifier:
21759 final
21761 GNU Extensions:
21762 class-key attributes identifier [opt] base-clause [opt]
21763 class-key attributes nested-name-specifier identifier base-clause [opt]
21764 class-key attributes nested-name-specifier [opt] template-id
21765 base-clause [opt]
21767 Upon return BASES is initialized to the list of base classes (or
21768 NULL, if there are none) in the same form returned by
21769 cp_parser_base_clause.
21771 Returns the TYPE of the indicated class. Sets
21772 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
21773 involving a nested-name-specifier was used, and FALSE otherwise.
21775 Returns error_mark_node if this is not a class-head.
21777 Returns NULL_TREE if the class-head is syntactically valid, but
21778 semantically invalid in a way that means we should skip the entire
21779 body of the class. */
21781 static tree
21784 {
21785 tree nested_name_specifier;
21789 tree attributes;
21790 tree bases;
21800 /* Assume no nested-name-specifier will be present. */
21802 /* Assume no template parameter lists will be used in defining the
21803 type. */
21807 /* Look for the class-key. */
21814 /* Parse the attributes. */
21817 /* If the next token is `::', that is invalid -- but sometimes
21818 people do try to write:
21820 struct ::S {};
21822 Handle this gracefully by accepting the extra qualifier, and then
21823 issuing an error about it later if this really is a
21824 class-head. If it turns out just to be an elaborated type
21825 specifier, remain silent. */
21831 /* Determine the name of the class. Begin by looking for an
21832 optional nested-name-specifier. */
21834 nested_name_specifier
21840 /* If there was a nested-name-specifier, then there *must* be an
21841 identifier. */
21843 {
21845 /* Although the grammar says `identifier', it really means
21846 `class-name' or `template-name'. You are only allowed to
21847 define a class that has already been declared with this
21848 syntax.
21850 The proposed resolution for Core Issue 180 says that wherever
21851 you see `class T::X' you should treat `X' as a type-name.
21853 It is OK to define an inaccessible class; for example:
21855 class A { class B; };
21856 class A::B {};
21858 We do not know if we will see a class-name, or a
21859 template-name. We look for a class-name first, in case the
21860 class-name is a template-id; if we looked for the
21861 template-name first we would stop after the template-name. */
21866 class_type,
21870 /* If that didn't work, ignore the nested-name-specifier. */
21872 {
21878 }
21879 /* If we could not find a corresponding TYPE, treat this
21880 declaration like an unqualified declaration. */
21883 /* Otherwise, count the number of templates used in TYPE and its
21884 containing scopes. */
21885 else
21886 {
21887 tree scope;
21899 }
21900 }
21901 /* Otherwise, the identifier is optional. */
21902 else
21903 {
21904 /* We don't know whether what comes next is a template-id,
21905 an identifier, or nothing at all. */
21907 /* Check for a template-id. */
21912 class_key,
21914 /* If that didn't work, it could still be an identifier. */
21916 {
21918 {
21921 }
21922 else
21924 }
21925 else
21926 {
21929 }
21930 }
21935 {
21937 class_key,
21939 }
21942 /* If it's not a `:' or a `{' then we can't really be looking at a
21943 class-head, since a class-head only appears as part of a
21944 class-specifier. We have to detect this situation before calling
21945 xref_tag, since that has irreversible side-effects. */
21947 {
21951 }
21953 /* At this point, we're going ahead with the class-specifier, even
21954 if some other problem occurs. */
21957 {
21962 }
21963 /* Issue the error about the overly-qualified name now. */
21965 {
21970 }
21972 {
21977 }
21979 {
21980 tree scope;
21982 /* Reject typedef-names in class heads. */
21984 {
21987 type);
21990 }
21992 /* Figure out in what scope the declaration is being placed. */
21994 /* If that scope does not contain the scope in which the
21995 class was originally declared, the program is invalid. */
21997 {
22000 "declaration of %qD in namespace %qD which does not "
22003 else
22009 }
22010 /* [dcl.meaning]
22012 A declarator-id shall not be qualified except for the
22013 definition of a ... nested class outside of its class
22014 ... [or] the definition or explicit instantiation of a
22015 class member of a namespace outside of its namespace. */
22017 {
22022 }
22023 }
22024 /* An explicit-specialization must be preceded by "template <>". If
22025 it is not, try to recover gracefully. */
22029 {
22030 /* Build a location of this form:
22031 struct typename <ARGS>
22032 ^~~~~~~~~~~~~~~~~~~~~~
22033 with caret==start at the start token, and
22034 finishing at the end of the type. */
22035 location_t reported_loc
22037 class_head_start_location,
22041 error_at_rich_loc
22045 /* Take the same action that would have been taken by
22046 cp_parser_explicit_specialization. */
22049 }
22050 /* There must be no "return" statements between this point and the
22051 end of this function; set "type "to the correct return value and
22052 use "goto done;" to return. */
22053 /* Make sure that the right number of template parameters were
22054 present. */
22058 {
22059 /* If something went wrong, there is no point in even trying to
22060 process the class-definition. */
22063 }
22065 /* Look up the type. */
22067 {
22071 {
22075 }
22076 else
22077 {
22080 }
22083 }
22085 {
22086 tree class_type;
22088 /* Given:
22090 template <typename T> struct S { struct T };
22091 template <typename T> struct S<T>::T { };
22093 we will get a TYPENAME_TYPE when processing the definition of
22094 `S::T'. We need to resolve it to the actual type before we
22095 try to define it. */
22097 {
22102 else
22103 {
22106 }
22107 }
22111 {
22114 }
22117 /* Enter the scope indicated by the nested-name-specifier. */
22119 /* Get the canonical version of this type. */
22121 /* Call push_template_decl if it seems like we should be defining a
22122 template either from the template headers or the type we're
22123 defining, so that we diagnose both extra and missing headers. */
22127 {
22130 {
22133 }
22134 }
22138 }
22140 {
22141 /* If the class was unnamed, create a dummy name. */
22146 }
22148 /* Indicate whether this class was declared as a `class' or as a
22149 `struct'. */
22154 /* If this type was already complete, and we see another definition,
22155 that's an error. */
22157 {
22159 type);
22161 type);
22164 }
22169 {
22170 /* Apply attributes now, before any use of the class as a template
22171 argument in its base list. */
22174 }
22176 /* We will have entered the scope containing the class; the names of
22177 base classes should be looked up in that context. For example:
22179 struct A { struct B {}; struct C; };
22180 struct A::C : B {};
22182 is valid. */
22184 /* Get the list of base-classes, if there is one. */
22186 {
22187 /* PR59482: enter the class scope so that base-specifiers are looked
22188 up correctly. */
22192 /* PR59482: get out of the previously pushed class scope so that the
22193 subsequent pops pop the right thing. */
22196 }
22197 else
22200 /* If we're really defining a class, process the base classes.
22201 If they're invalid, fail. */
22205 done:
22206 /* Leave the scope given by the nested-name-specifier. We will
22207 enter the class scope itself while processing the members. */
22212 {
22215 }
22221 out:
22224 }
22226 /* Parse a class-key.
22228 class-key:
22229 class
22230 struct
22231 union
22233 Returns the kind of class-key specified, or none_type to indicate
22234 error. */
22236 static enum tag_types
22238 {
22242 /* Look for the class-key. */
22247 /* Check to see if the TOKEN is a class-key. */
22252 }
22254 /* Parse a type-parameter-key.
22256 type-parameter-key:
22257 class
22258 typename
22259 */
22261 static void
22263 {
22264 /* Look for the type-parameter-key. */
22268 {
22271 /* typename is not allowed in a template template parameter
22272 by the standard until C++1Z. */
22274 "ISO C++ forbids typename key in template template parameter;"
22276 }
22277 else
22281 }
22283 /* Parse an (optional) member-specification.
22285 member-specification:
22286 member-declaration member-specification [opt]
22287 access-specifier : member-specification [opt] */
22289 static void
22291 {
22293 {
22297 /* Peek at the next token. */
22299 /* If it's a `}', or EOF then we've seen all the members. */
22305 /* See if this token is a keyword. */
22308 {
22312 /* Consume the access-specifier. */
22314 /* Remember which access-specifier is active. */
22316 /* Look for the `:'. */
22321 /* Accept #pragmas at class scope. */
22323 {
22326 }
22328 /* Otherwise, the next construction must be a
22329 member-declaration. */
22331 }
22332 }
22333 }
22335 /* Parse a member-declaration.
22337 member-declaration:
22338 decl-specifier-seq [opt] member-declarator-list [opt] ;
22339 function-definition ; [opt]
22340 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22341 using-declaration
22342 template-declaration
22343 alias-declaration
22345 member-declarator-list:
22346 member-declarator
22347 member-declarator-list , member-declarator
22349 member-declarator:
22350 declarator pure-specifier [opt]
22351 declarator constant-initializer [opt]
22352 identifier [opt] : constant-expression
22354 GNU Extensions:
22356 member-declaration:
22357 __extension__ member-declaration
22359 member-declarator:
22360 declarator attributes [opt] pure-specifier [opt]
22361 declarator attributes [opt] constant-initializer [opt]
22362 identifier [opt] attributes [opt] : constant-expression
22364 C++0x Extensions:
22366 member-declaration:
22367 static_assert-declaration */
22369 static void
22371 {
22372 cp_decl_specifier_seq decl_specifiers;
22373 tree prefix_attributes;
22374 tree decl;
22383 /* Check for the `__extension__' keyword. */
22385 {
22386 /* Recurse. */
22388 /* Restore the old value of the PEDANTIC flag. */
22392 }
22394 /* Check for a template-declaration. */
22396 {
22397 /* An explicit specialization here is an error condition, and we
22398 expect the specialization handler to detect and report this. */
22402 else
22406 }
22407 /* Check for a template introduction. */
22411 /* Check for a using-declaration. */
22413 {
22415 {
22416 /* Parse the using-declaration. */
22420 }
22421 else
22422 {
22423 tree decl;
22427 /* Note that if we actually see the '=' token after the
22428 identifier, cp_parser_alias_declaration commits the
22429 tentative parse. In that case, we really expect an
22430 alias-declaration. Otherwise, we expect a using
22431 declaration. */
22432 alias_decl_expected =
22438 else
22442 }
22443 }
22445 /* Check for @defs. */
22447 {
22452 {
22457 }
22459 }
22461 /* If the next token is `static_assert' we have a static assertion. */
22463 {
22466 }
22473 /* Parse the decl-specifier-seq. */
22476 CP_PARSER_FLAGS_OPTIONAL,
22479 /* Check for an invalid type-name. */
22483 /* If there is no declarator, then the decl-specifier-seq should
22484 specify a type. */
22486 {
22487 /* If there was no decl-specifier-seq, and the next token is a
22488 `;', then we have something like:
22490 struct S { ; };
22492 [class.mem]
22494 Each member-declaration shall declare at least one member
22495 name of the class. */
22497 {
22501 }
22502 else
22503 {
22504 tree type;
22506 /* See if this declaration is a friend. */
22508 /* If there were decl-specifiers, check to see if there was
22509 a class-declaration. */
22512 /* Nested classes have already been added to the class, but
22513 a `friend' needs to be explicitly registered. */
22515 {
22516 /* If the `friend' keyword was present, the friend must
22517 be introduced with a class-key. */
22520 "in C++03 a class-key must be used "
22522 /* In this case:
22524 template <typename T> struct A {
22525 friend struct A<T>::B;
22526 };
22528 A<T>::B will be represented by a TYPENAME_TYPE, and
22529 therefore not recognized by check_tag_decl. */
22531 {
22535 }
22538 "friend declaration does not name a class or "
22540 else
22543 }
22544 /* If there is no TYPE, an error message will already have
22545 been issued. */
22547 ;
22548 /* An anonymous aggregate has to be handled specially; such
22549 a declaration really declares a data member (with a
22550 particular type), as opposed to a nested class. */
22552 {
22553 /* C++11 9.5/6. */
22556 "a storage class on an anonymous aggregate "
22559 /* Remove constructors and such from TYPE, now that we
22560 know it is an anonymous aggregate. */
22562 /* And make the corresponding data member. */
22565 /* Add it to the class. */
22567 }
22568 else
22569 cp_parser_check_access_in_redeclaration
22572 }
22573 }
22574 else
22575 {
22578 /* Clear attributes from the decl_specifiers but keep them
22579 around as prefix attributes that apply them to the entity
22580 being declared. */
22584 /* See if these declarations will be friends. */
22587 /* Keep going until we hit the `;' at the end of the
22588 declaration. */
22590 {
22592 tree first_attribute;
22594 /* Peek at the next token. */
22597 /* Check for a bitfield declaration. */
22602 {
22603 tree identifier;
22604 tree width;
22606 /* Get the name of the bitfield. Note that we cannot just
22607 check TOKEN here because it may have been invalidated by
22608 the call to cp_lexer_peek_nth_token above. */
22611 else
22614 /* Consume the `:' token. */
22616 /* Get the width of the bitfield. */
22617 width
22620 /* Look for attributes that apply to the bitfield. */
22622 /* Remember which attributes are prefix attributes and
22623 which are not. */
22625 /* Combine the attributes. */
22628 /* Create the bitfield declaration. */
22631 identifier,
22632 sfk_none)
22635 width,
22636 attributes);
22637 }
22638 else
22639 {
22641 tree initializer;
22642 tree asm_specification;
22645 /* Parse the declarator. */
22646 declarator
22651 friend_p);
22653 /* If something went wrong parsing the declarator, make sure
22654 that we at least consume some tokens. */
22656 {
22657 /* Skip to the end of the statement. */
22659 /* If the next token is not a semicolon, that is
22660 probably because we just skipped over the body of
22661 a function. So, we consume a semicolon if
22662 present, but do not issue an error message if it
22663 is not present. */
22665 CPP_SEMICOLON))
22668 }
22671 cp_parser_check_for_definition_in_return_type
22675 /* Look for an asm-specification. */
22677 /* Look for attributes that apply to the declaration. */
22679 /* Remember which attributes are prefix attributes and
22680 which are not. */
22682 /* Combine the attributes. */
22685 /* If it's an `=', then we have a constant-initializer or a
22686 pure-specifier. It is not correct to parse the
22687 initializer before registering the member declaration
22688 since the member declaration should be in scope while
22689 its initializer is processed. However, the rest of the
22690 front end does not yet provide an interface that allows
22691 us to handle this correctly. */
22693 {
22694 /* In [class.mem]:
22696 A pure-specifier shall be used only in the declaration of
22697 a virtual function.
22699 A member-declarator can contain a constant-initializer
22700 only if it declares a static member of integral or
22701 enumeration type.
22703 Therefore, if the DECLARATOR is for a function, we look
22704 for a pure-specifier; otherwise, we look for a
22705 constant-initializer. When we call `grokfield', it will
22706 perform more stringent semantics checks. */
22718 {
22720 /* Don't require a constant rvalue in C++11, since we
22721 might want a reference constant. We'll enforce
22722 constancy later. */
22724 /* Parse the initializer. */
22727 }
22728 else
22729 /* Parse the initializer. */
22731 }
22734 {
22738 else
22740 }
22741 /* Otherwise, there is no initializer. */
22742 else
22745 /* See if we are probably looking at a function
22746 definition. We are certainly not looking at a
22747 member-declarator. Calling `grokfield' has
22748 side-effects, so we must not do it unless we are sure
22749 that we are looking at a member-declarator. */
22752 {
22753 /* The grammar does not allow a pure-specifier to be
22754 used when a member function is defined. (It is
22755 possible that this fact is an oversight in the
22756 standard, since a pure function may be defined
22757 outside of the class-specifier. */
22763 declarator,
22764 attributes);
22767 /* If the member was not a friend, declare it here. */
22770 /* Peek at the next token. */
22772 /* If the next token is a semicolon, consume it. */
22776 }
22777 else
22780 /* Create the declaration. */
22785 {
22788 else
22790 }
22791 }
22796 /* Reset PREFIX_ATTRIBUTES. */
22802 /* If there is any qualification still in effect, clear it
22803 now; we will be starting fresh with the next declarator. */
22807 /* If it's a `,', then there are more declarators. */
22809 {
22812 {
22816 }
22817 }
22818 /* If the next token isn't a `;', then we have a parse error. */
22820 CPP_SEMICOLON))
22821 {
22822 /* The next token might be a ways away from where the
22823 actual semicolon is missing. Find the previous token
22824 and use that for our error position. */
22829 /* Assume that the user meant to provide a semicolon. If
22830 we were to cp_parser_skip_to_end_of_statement, we might
22831 skip to a semicolon inside a member function definition
22832 and issue nonsensical error messages. */
22834 }
22837 {
22838 /* Add DECL to the list of members. */
22840 /* Explicitly include, eg, NSDMIs, for better error
22841 recovery (c++/58650). */
22850 /* Add DECL to the queue of NSDMI to be parsed later. */
22852 }
22856 }
22857 }
22860 out:
22862 }
22864 /* Parse a pure-specifier.
22866 pure-specifier:
22867 = 0
22869 Returns INTEGER_ZERO_NODE if a pure specifier is found.
22870 Otherwise, ERROR_MARK_NODE is returned. */
22872 static tree
22874 {
22877 /* Look for the `=' token. */
22880 /* Look for the `0' token. */
22889 /* Accept = default or = delete in c++0x mode. */
22892 {
22895 }
22897 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
22899 {
22904 }
22906 {
22909 }
22912 }
22914 /* Parse a constant-initializer.
22916 constant-initializer:
22917 = constant-expression
22919 Returns a representation of the constant-expression. */
22921 static tree
22923 {
22924 /* Look for the `=' token. */
22928 /* It is invalid to write:
22930 struct S { static const int i = { 7 }; };
22932 */
22934 {
22937 /* Consume the opening brace. */
22939 /* Skip the initializer. */
22941 /* Look for the trailing `}'. */
22945 }
22948 }
22950 /* Derived classes [gram.class.derived] */
22952 /* Parse a base-clause.
22954 base-clause:
22955 : base-specifier-list
22957 base-specifier-list:
22958 base-specifier ... [opt]
22959 base-specifier-list , base-specifier ... [opt]
22961 Returns a TREE_LIST representing the base-classes, in the order in
22962 which they were declared. The representation of each node is as
22963 described by cp_parser_base_specifier.
22965 In the case that no bases are specified, this function will return
22966 NULL_TREE, not ERROR_MARK_NODE. */
22968 static tree
22970 {
22973 /* Look for the `:' that begins the list. */
22976 /* Scan the base-specifier-list. */
22978 {
22980 tree base;
22983 /* Look for the base-specifier. */
22985 /* Look for the (optional) ellipsis. */
22987 {
22988 /* Consume the `...'. */
22992 }
22994 /* Add BASE to the front of the list. */
22996 {
22998 /* Make this a pack expansion type. */
23002 {
23005 }
23006 }
23007 /* Peek at the next token. */
23009 /* If it's not a comma, then the list is complete. */
23012 /* Consume the `,'. */
23014 }
23016 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23017 base class had a qualified name. However, the next name that
23018 appears is certainly not qualified. */
23024 }
23026 /* Parse a base-specifier.
23028 base-specifier:
23029 :: [opt] nested-name-specifier [opt] class-name
23030 virtual access-specifier [opt] :: [opt] nested-name-specifier
23031 [opt] class-name
23032 access-specifier virtual [opt] :: [opt] nested-name-specifier
23033 [opt] class-name
23035 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23036 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23037 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23038 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23040 static tree
23042 {
23050 tree type;
23052 /* Process the optional `virtual' and `access-specifier'. */
23054 {
23055 /* Peek at the next token. */
23057 /* Process `virtual'. */
23059 {
23061 /* If `virtual' appears more than once, issue an error. */
23063 {
23067 }
23071 /* Consume the `virtual' token. */
23079 /* If more than one access specifier appears, issue an
23080 error. */
23083 {
23087 }
23091 /* Consume the access-specifier. */
23099 }
23100 }
23101 /* It is not uncommon to see programs mechanically, erroneously, use
23102 the 'typename' keyword to denote (dependent) qualified types
23103 as base classes. */
23105 {
23110 else
23112 "keyword %<typename%> not allowed in this context "
23115 }
23117 /* Look for the optional `::' operator. */
23119 /* Look for the nested-name-specifier. The simplest way to
23120 implement:
23122 [temp.res]
23124 The keyword `typename' is not permitted in a base-specifier or
23125 mem-initializer; in these contexts a qualified name that
23126 depends on a template-parameter is implicitly assumed to be a
23127 type name.
23129 is to pretend that we have seen the `typename' keyword at this
23130 point. */
23134 typename_type,
23136 /* If the base class is given by a qualified name, assume that names
23137 we see are type names or templates, as appropriate. */
23143 /* DR 950 allows decltype as a base-specifier. */
23145 else
23146 {
23147 /* Otherwise, look for the class-name. */
23149 class_scope_p,
23150 template_p,
23151 typename_type,
23156 }
23162 }
23164 /* Exception handling [gram.exception] */
23166 /* Parse an (optional) noexcept-specification.
23168 noexcept-specification:
23169 noexcept ( constant-expression ) [opt]
23171 If no noexcept-specification is present, returns NULL_TREE.
23172 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23173 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23174 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23175 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23176 in which case a boolean condition is returned instead. */
23178 static tree
23183 {
23187 /* Peek at the next token. */
23190 /* Is it a noexcept-specification? */
23192 {
23193 tree expr;
23197 {
23201 {
23202 /* Types may not be defined in an exception-specification. */
23204 parser->type_definition_forbidden_message
23209 /* Restore the saved message. */
23211 }
23212 else
23213 {
23216 }
23219 }
23220 else
23221 {
23225 }
23227 /* We cannot build a noexcept-spec right away because this will check
23228 that expr is a constexpr. */
23231 else
23233 }
23234 else
23236 }
23238 /* Parse an (optional) exception-specification.
23240 exception-specification:
23241 throw ( type-id-list [opt] )
23243 Returns a TREE_LIST representing the exception-specification. The
23244 TREE_VALUE of each node is a type. */
23246 static tree
23248 {
23250 tree type_id_list;
23253 /* Peek at the next token. */
23256 /* Is it a noexcept-specification? */
23262 /* If it's not `throw', then there's no exception-specification. */
23266 #if 0
23267 /* Enable this once a lot of code has transitioned to noexcept? */
23271 #endif
23273 /* Consume the `throw'. */
23276 /* Look for the `('. */
23279 /* Peek at the next token. */
23281 /* If it's not a `)', then there is a type-id-list. */
23283 {
23284 /* Types may not be defined in an exception-specification. */
23286 parser->type_definition_forbidden_message
23288 /* Parse the type-id-list. */
23290 /* Restore the saved message. */
23292 }
23293 else
23296 /* Look for the `)'. */
23300 }
23302 /* Parse an (optional) type-id-list.
23304 type-id-list:
23305 type-id ... [opt]
23306 type-id-list , type-id ... [opt]
23308 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23309 in the order that the types were presented. */
23311 static tree
23313 {
23317 {
23319 tree type;
23323 /* Get the next type-id. */
23325 /* Check for invalid 'auto'. */
23327 {
23331 }
23332 /* Parse the optional ellipsis. */
23334 {
23335 /* Consume the `...'. */
23338 /* Turn the type into a pack expansion expression. */
23340 }
23341 /* Add it to the list. */
23343 /* Peek at the next token. */
23345 /* If it is not a `,', we are done. */
23348 /* Consume the `,'. */
23350 }
23353 }
23355 /* Parse a try-block.
23357 try-block:
23358 try compound-statement handler-seq */
23360 static tree
23362 {
23363 tree try_block;
23377 }
23379 /* Parse a function-try-block.
23381 function-try-block:
23382 try ctor-initializer [opt] function-body handler-seq */
23384 static bool
23386 {
23387 tree compound_stmt;
23388 tree try_block;
23391 /* Look for the `try' keyword. */
23394 /* Let the rest of the front end know where we are. */
23396 /* Parse the function-body. */
23397 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23399 /* We're done with the `try' part. */
23401 /* Parse the handlers. */
23403 /* We're done with the handlers. */
23407 }
23409 /* Parse a handler-seq.
23411 handler-seq:
23412 handler handler-seq [opt] */
23414 static void
23416 {
23418 {
23421 /* Parse the handler. */
23423 /* Peek at the next token. */
23425 /* If it's not `catch' then there are no more handlers. */
23428 }
23429 }
23431 /* Parse a handler.
23433 handler:
23434 catch ( exception-declaration ) compound-statement */
23436 static void
23438 {
23439 tree handler;
23440 tree declaration;
23450 }
23452 /* Parse an exception-declaration.
23454 exception-declaration:
23455 type-specifier-seq declarator
23456 type-specifier-seq abstract-declarator
23457 type-specifier-seq
23458 ...
23460 Returns a VAR_DECL for the declaration, or NULL_TREE if the
23461 ellipsis variant is used. */
23463 static tree
23465 {
23466 cp_decl_specifier_seq type_specifiers;
23470 /* If it's an ellipsis, it's easy to handle. */
23472 {
23473 /* Consume the `...' token. */
23476 }
23478 /* Types may not be defined in exception-declarations. */
23480 parser->type_definition_forbidden_message
23483 /* Parse the type-specifier-seq. */
23487 /* If it's a `)', then there is no declarator. */
23490 else
23497 /* Restore the saved message. */
23504 }
23506 /* Parse a throw-expression.
23508 throw-expression:
23509 throw assignment-expression [opt]
23511 Returns a THROW_EXPR representing the throw-expression. */
23513 static tree
23515 {
23516 tree expression;
23521 /* Figure out whether or not there is an assignment-expression
23522 following the "throw" keyword. */
23530 else
23534 }
23536 /* GNU Extensions */
23538 /* Parse an (optional) asm-specification.
23540 asm-specification:
23541 asm ( string-literal )
23543 If the asm-specification is present, returns a STRING_CST
23544 corresponding to the string-literal. Otherwise, returns
23545 NULL_TREE. */
23547 static tree
23549 {
23551 tree asm_specification;
23553 /* Peek at the next token. */
23555 /* If the next token isn't the `asm' keyword, then there's no
23556 asm-specification. */
23560 /* Consume the `asm' token. */
23562 /* Look for the `('. */
23565 /* Look for the string-literal. */
23568 /* Look for the `)'. */
23572 }
23574 /* Parse an asm-operand-list.
23576 asm-operand-list:
23577 asm-operand
23578 asm-operand-list , asm-operand
23580 asm-operand:
23581 string-literal ( expression )
23582 [ string-literal ] string-literal ( expression )
23584 Returns a TREE_LIST representing the operands. The TREE_VALUE of
23585 each node is the expression. The TREE_PURPOSE is itself a
23586 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
23587 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
23588 is a STRING_CST for the string literal before the parenthesis. Returns
23589 ERROR_MARK_NODE if any of the operands are invalid. */
23591 static tree
23593 {
23598 {
23599 tree string_literal;
23600 tree expression;
23601 tree name;
23604 {
23605 /* Consume the `[' token. */
23607 /* Read the operand name. */
23612 /* Look for the closing `]'. */
23614 }
23615 else
23617 /* Look for the string-literal. */
23620 /* Look for the `('. */
23622 /* Parse the expression. */
23624 /* Look for the `)'. */
23632 /* Add this operand to the list. */
23634 expression,
23635 asm_operands);
23636 /* If the next token is not a `,', there are no more
23637 operands. */
23640 /* Consume the `,'. */
23642 }
23645 }
23647 /* Parse an asm-clobber-list.
23649 asm-clobber-list:
23650 string-literal
23651 asm-clobber-list , string-literal
23653 Returns a TREE_LIST, indicating the clobbers in the order that they
23654 appeared. The TREE_VALUE of each node is a STRING_CST. */
23656 static tree
23658 {
23662 {
23663 tree string_literal;
23665 /* Look for the string literal. */
23667 /* Add it to the list. */
23669 /* If the next token is not a `,', then the list is
23670 complete. */
23673 /* Consume the `,' token. */
23675 }
23678 }
23680 /* Parse an asm-label-list.
23682 asm-label-list:
23683 identifier
23684 asm-label-list , identifier
23686 Returns a TREE_LIST, indicating the labels in the order that they
23687 appeared. The TREE_VALUE of each node is a label. */
23689 static tree
23691 {
23695 {
23698 /* Look for the identifier. */
23701 {
23704 {
23710 }
23711 }
23712 /* If the next token is not a `,', then the list is
23713 complete. */
23716 /* Consume the `,' token. */
23718 }
23721 }
23723 /* Return TRUE iff the next tokens in the stream are possibly the
23724 beginning of a GNU extension attribute. */
23726 static bool
23728 {
23730 }
23732 /* Return TRUE iff the next tokens in the stream are possibly the
23733 beginning of a standard C++-11 attribute specifier. */
23735 static bool
23737 {
23739 }
23741 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23742 beginning of a standard C++-11 attribute specifier. */
23744 static bool
23746 {
23754 }
23756 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23757 beginning of a GNU extension attribute. */
23759 static bool
23761 {
23765 }
23767 /* Return true iff the next tokens can be the beginning of either a
23768 GNU attribute list, or a standard C++11 attribute sequence. */
23770 static bool
23772 {
23775 }
23777 /* Return true iff the next Nth tokens can be the beginning of either
23778 a GNU attribute list, or a standard C++11 attribute sequence. */
23780 static bool
23782 {
23785 }
23787 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
23788 of GNU attributes, or return NULL. */
23790 static tree
23792 {
23796 }
23798 #define CILK_SIMD_FN_CLAUSE_MASK \
23799 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
23800 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
23801 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
23802 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
23803 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
23805 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
23806 vector [(<clauses>)] */
23808 static void
23810 {
23814 {
23820 }
23823 {
23826 paren_scope++;
23827 }
23829 {
23832 paren_scope++;
23834 paren_scope--;
23835 /* Do not push the last ')' */
23838 }
23847 }
23849 /* Parse an (optional) series of attributes.
23851 attributes:
23852 attributes attribute
23854 attribute:
23855 __attribute__ (( attribute-list [opt] ))
23857 The return value is as for cp_parser_gnu_attribute_list. */
23859 static tree
23861 {
23865 {
23867 tree attribute_list;
23870 /* Peek at the next token. */
23872 /* If it's not `__attribute__', then we're done. */
23876 /* Consume the `__attribute__' keyword. */
23878 /* Look for the two `(' tokens. */
23882 /* Peek at the next token. */
23885 /* Parse the attribute-list. */
23887 else
23888 /* If the next token is a `)', then there is no attribute
23889 list. */
23892 /* Look for the two `)' tokens. */
23900 /* Add these new attributes to the list. */
23902 }
23905 }
23907 /* Parse a GNU attribute-list.
23909 attribute-list:
23910 attribute
23911 attribute-list , attribute
23913 attribute:
23914 identifier
23915 identifier ( identifier )
23916 identifier ( identifier , expression-list )
23917 identifier ( expression-list )
23919 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
23920 to an attribute. The TREE_PURPOSE of each node is the identifier
23921 indicating which attribute is in use. The TREE_VALUE represents
23922 the arguments, if any. */
23924 static tree
23926 {
23932 {
23934 tree identifier;
23935 tree attribute;
23937 /* Look for the identifier. We also allow keywords here; for
23938 example `__attribute__ ((const))' is legal. */
23942 {
23945 /* Consume the token, but save it since we need it for the
23946 SIMD enabled function parsing. */
23949 /* Save away the identifier that indicates which attribute
23950 this is. */
23952 /* For keywords, use the canonical spelling, not the
23953 parsed identifier. */
23959 /* Peek at the next token. */
23961 /* If it's an `(', then parse the attribute arguments. */
23963 {
23968 {
23971 }
23972 else
23973 vec = cp_parser_parenthesized_expression_list
23979 else
23980 {
23983 }
23984 /* Save the arguments away. */
23986 }
23988 {
23991 }
23994 {
23995 /* Add this attribute to the list. */
23998 }
24001 }
24002 /* Now, look for more attributes. If the next token isn't a
24003 `,', we're done. */
24007 /* Consume the comma and keep going. */
24009 }
24012 /* We built up the list in reverse order. */
24014 }
24016 /* Parse a standard C++11 attribute.
24018 The returned representation is a TREE_LIST which TREE_PURPOSE is
24019 the scoped name of the attribute, and the TREE_VALUE is its
24020 arguments list.
24022 Note that the scoped name of the attribute is itself a TREE_LIST
24023 which TREE_PURPOSE is the namespace of the attribute, and
24024 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24025 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24026 and which TREE_PURPOSE is directly the attribute name.
24028 Clients of the attribute code should use get_attribute_namespace
24029 and get_attribute_name to get the actual namespace and name of
24030 attributes, regardless of their being GNU or C++11 attributes.
24032 attribute:
24033 attribute-token attribute-argument-clause [opt]
24035 attribute-token:
24036 identifier
24037 attribute-scoped-token
24039 attribute-scoped-token:
24040 attribute-namespace :: identifier
24042 attribute-namespace:
24043 identifier
24045 attribute-argument-clause:
24046 ( balanced-token-seq )
24048 balanced-token-seq:
24049 balanced-token [opt]
24050 balanced-token-seq balanced-token
24052 balanced-token:
24053 ( balanced-token-seq )
24054 [ balanced-token-seq ]
24055 { balanced-token-seq }. */
24057 static tree
24059 {
24063 /* First, parse name of the attribute, a.k.a attribute-token. */
24080 {
24081 /* We are seeing a scoped attribute token. */
24091 else
24092 {
24096 }
24098 NULL_TREE);
24100 }
24101 else
24102 {
24104 NULL_TREE);
24105 /* C++11 noreturn attribute is equivalent to GNU's. */
24108 /* C++14 deprecated attribute is equivalent to GNU's. */
24110 {
24113 "%<deprecated%> is a C++14 feature;"
24116 }
24117 /* Transactional Memory TS optimize_for_synchronized attribute is
24118 equivalent to GNU transaction_callable. */
24122 /* Transactional Memory attributes are GNU attributes. */
24125 }
24127 /* Now parse the optional argument clause of the attribute. */
24132 {
24138 /* A GNU attribute that takes an identifier in parameter. */
24141 vec = cp_parser_parenthesized_expression_list
24147 else
24148 {
24151 }
24155 else
24157 }
24160 }
24162 /* Check that the attribute ATTRIBUTE appears at most once in the
24163 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24164 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24165 isn't implemented yet in GCC. */
24167 static void
24169 {
24171 {
24181 }
24182 }
24184 /* Parse a list of standard C++-11 attributes.
24186 attribute-list:
24187 attribute [opt]
24188 attribute-list , attribute[opt]
24189 attribute ...
24190 attribute-list , attribute ...
24191 */
24193 static tree
24195 {
24200 {
24205 {
24209 }
24212 {
24217 }
24221 }
24224 }
24226 /* Parse a standard C++-11 attribute specifier.
24228 attribute-specifier:
24229 [ [ attribute-list ] ]
24230 alignment-specifier
24232 alignment-specifier:
24233 alignas ( type-id ... [opt] )
24234 alignas ( alignment-expression ... [opt] ). */
24236 static tree
24238 {
24244 {
24253 else
24254 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24255 when we are sure that we have actually parsed them. */
24257 }
24258 else
24259 {
24260 tree alignas_expr;
24262 /* Look for an alignment-specifier. */
24274 {
24277 }
24283 {
24287 alignas_expr =
24294 }
24300 {
24303 }
24306 {
24309 }
24311 /* Build the C++-11 representation of an 'aligned'
24312 attribute. */
24313 attributes =
24316 alignas_expr);
24317 }
24320 }
24322 /* Parse a standard C++-11 attribute-specifier-seq.
24324 attribute-specifier-seq:
24325 attribute-specifier-seq [opt] attribute-specifier
24326 */
24328 static tree
24330 {
24335 {
24344 else
24347 }
24350 }
24352 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
24353 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
24354 current value of the PEDANTIC flag, regardless of whether or not
24355 the `__extension__' keyword is present. The caller is responsible
24356 for restoring the value of the PEDANTIC flag. */
24358 static bool
24360 {
24361 /* Save the old value of the PEDANTIC flag. */
24365 {
24366 /* Consume the `__extension__' token. */
24368 /* We're not being pedantic while the `__extension__' keyword is
24369 in effect. */
24373 }
24376 }
24378 /* Parse a label declaration.
24380 label-declaration:
24381 __label__ label-declarator-seq ;
24383 label-declarator-seq:
24384 identifier , label-declarator-seq
24385 identifier */
24387 static void
24389 {
24390 /* Look for the `__label__' keyword. */
24394 {
24395 tree identifier;
24397 /* Look for an identifier. */
24399 /* If we failed, stop. */
24402 /* Declare it as a label. */
24404 /* If the next token is a `;', stop. */
24407 /* Look for the `,' separating the label declarations. */
24409 }
24411 /* Look for the final `;'. */
24413 }
24415 // -------------------------------------------------------------------------- //
24416 // Requires Clause
24418 // Parse a requires clause.
24419 //
24420 // requires-clause:
24421 // 'requires' logical-or-expression
24422 //
24423 // The required logical-or-expression must be a constant expression. Note
24424 // that we don't check that the expression is constepxr here. We defer until
24425 // we analyze constraints and then, we only check atomic constraints.
24426 static tree
24428 {
24429 // Parse the requires clause so that it is not automatically folded.
24437 }
24439 // Optionally parse a requires clause:
24440 static tree
24442 {
24445 {
24448 {
24451 /* Parse and discard the requires-clause. */
24454 }
24456 }
24459 }
24462 /*---------------------------------------------------------------------------
24463 Requires expressions
24464 ---------------------------------------------------------------------------*/
24466 /* Parse a requires expression
24468 requirement-expression:
24469 'requires' requirement-parameter-list [opt] requirement-body */
24470 static tree
24472 {
24476 /* A requires-expression shall appear only within a concept
24477 definition or a requires-clause.
24479 TODO: Implement this diagnostic correctly. */
24481 {
24485 }
24488 {
24489 /* Local parameters are delared as variables within the scope
24490 of the expression. They are not visible past the end of
24491 the expression. Expressions within the requires-expression
24492 are unevaluated. */
24493 struct scope_sentinel
24494 {
24496 {
24499 }
24502 {
24505 }
24508 /* Parse the optional parameter list. */
24510 {
24514 }
24515 else
24518 /* Parse the requirement body. */
24522 }
24524 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
24525 the parm chain. */
24528 }
24530 /* Parse a parameterized requirement.
24532 requirement-parameter-list:
24533 '(' parameter-declaration-clause ')' */
24534 static tree
24536 {
24546 }
24548 /* Parse the body of a requirement.
24550 requirement-body:
24551 '{' requirement-list '}' */
24552 static tree
24554 {
24564 }
24566 /* Parse a list of requirements.
24568 requirement-list:
24569 requirement
24570 requirement-list ';' requirement[opt] */
24571 static tree
24573 {
24576 {
24583 /* If we see a semi-colon, consume it. */
24587 /* Stop processing at the end of the list. */
24590 }
24592 /* Reverse the order of requirements so they are analyzed in
24593 declaration order. */
24595 }
24597 /* Parse a syntactic requirement or type requirement.
24599 requirement:
24600 simple-requirement
24601 compound-requirement
24602 type-requirement
24603 nested-requirement */
24604 static tree
24606 {
24613 else
24615 }
24617 /* Parse a simple requirement.
24619 simple-requirement:
24620 expression ';' */
24621 static tree
24623 {
24632 }
24634 /* Parse a type requirement
24636 type-requirement
24637 nested-name-specifier [opt] required-type-name ';'
24639 required-type-name:
24640 type-name
24641 'template' [opt] simple-template-id */
24642 static tree
24644 {
24647 // Save the scope before parsing name specifiers.
24658 tree type;
24660 {
24669 }
24670 else
24689 }
24691 /* Parse a compound requirement
24693 compound-requirement:
24694 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
24695 static tree
24697 {
24698 /* Parse an expression enclosed in '{ }'s. */
24709 /* Parse the optional noexcept. */
24712 {
24715 }
24717 /* Parse the optional trailing return type. */
24720 {
24728 }
24731 }
24733 /* Parse a nested requirement. This is the same as a requires clause.
24735 nested-requirement:
24736 requires-clause */
24737 static tree
24739 {
24745 }
24747 /* Support Functions */
24749 /* Return the appropriate prefer_type argument for lookup_name_real based on
24750 tag_type and template_mem_access. */
24754 {
24755 /* DR 141: When looking in the current enclosing context for a template-name
24756 after -> or ., only consider class templates. */
24760 {
24764 }
24765 }
24767 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
24768 NAME should have one of the representations used for an
24769 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
24770 is returned. If PARSER->SCOPE is a dependent type, then a
24771 SCOPE_REF is returned.
24773 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
24774 returned; the name was already resolved when the TEMPLATE_ID_EXPR
24775 was formed. Abstractly, such entities should not be passed to this
24776 function, because they do not need to be looked up, but it is
24777 simpler to check for this special case here, rather than at the
24778 call-sites.
24780 In cases not explicitly covered above, this function returns a
24781 DECL, OVERLOAD, or baselink representing the result of the lookup.
24782 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
24783 is returned.
24785 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
24786 (e.g., "struct") that was used. In that case bindings that do not
24787 refer to types are ignored.
24789 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
24790 ignored.
24792 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
24793 are ignored.
24795 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
24796 types.
24798 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
24799 TREE_LIST of candidates if name-lookup results in an ambiguity, and
24800 NULL_TREE otherwise. */
24802 static cp_expr
24809 location_t name_location)
24810 {
24811 tree decl;
24814 /* Assume that the lookup will be unambiguous. */
24818 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
24819 no longer valid. Note that if we are parsing tentatively, and
24820 the parse fails, OBJECT_TYPE will be automatically restored. */
24826 /* A template-id has already been resolved; there is no lookup to
24827 do. */
24831 {
24835 }
24837 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
24838 it should already have been checked to make sure that the name
24839 used matches the type being destroyed. */
24841 {
24842 tree type;
24844 /* Figure out to which type this destructor applies. */
24849 else
24851 /* If that's not a class type, there is no destructor. */
24858 /* If it was a class type, return the destructor. */
24860 }
24862 /* By this point, the NAME should be an ordinary identifier. If
24863 the id-expression was a qualified name, the qualifying scope is
24864 stored in PARSER->SCOPE at this point. */
24867 /* Perform the lookup. */
24869 {
24875 /* If the SCOPE is dependent, the lookup must be deferred until
24876 the template is instantiated -- unless we are explicitly
24877 looking up names in uninstantiated templates. Even then, we
24878 cannot look up the name if the scope is not a class type; it
24879 might, for example, be a template type parameter. */
24884 /* Defer lookup. */
24886 else
24887 {
24890 /* If PARSER->SCOPE is a dependent type, then it must be a
24891 class type, and we must not be checking dependencies;
24892 otherwise, we would have processed this lookup above. So
24893 that PARSER->SCOPE is not considered a dependent base by
24894 lookup_member, we must enter the scope here. */
24898 /* If the PARSER->SCOPE is a template specialization, it
24899 may be instantiated during name lookup. In that case,
24900 errors may be issued. Even if we rollback the current
24901 tentative parse, those errors are valid. */
24906 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
24907 lookup result and the nested-name-specifier nominates a class C:
24908 * if the name specified after the nested-name-specifier, when
24909 looked up in C, is the injected-class-name of C (Clause 9), or
24910 * if the name specified after the nested-name-specifier is the
24911 same as the identifier or the simple-template-id's template-
24912 name in the last component of the nested-name-specifier,
24913 the name is instead considered to name the constructor of
24914 class C. [ Note: for example, the constructor is not an
24915 acceptable lookup result in an elaborated-type-specifier so
24916 the constructor would not be used in place of the
24917 injected-class-name. --end note ] Such a constructor name
24918 shall be used only in the declarator-id of a declaration that
24919 names a constructor or in a using-declaration. */
24927 /* If we have a single function from a using decl, pull it out. */
24934 }
24936 /* If the scope is a dependent type and either we deferred lookup or
24937 we did lookup but didn't find the name, rememeber the name. */
24940 {
24942 {
24943 tree type;
24945 /* The resolution to Core Issue 180 says that `struct
24946 A::B' should be considered a type-name, even if `A'
24947 is dependent. */
24952 }
24956 CPP_CLOSE_PAREN)))
24960 else
24963 is_template);
24964 }
24967 }
24969 {
24970 /* Look up the name in the scope of the OBJECT_TYPE, unless the
24971 OBJECT_TYPE is not a class. */
24973 /* If the OBJECT_TYPE is a template specialization, it may
24974 be instantiated during name lookup. In that case, errors
24975 may be issued. Even if we rollback the current tentative
24976 parse, those errors are valid. */
24978 name,
24981 tf_warning_or_error);
24982 else
24986 /* Look it up in the enclosing context. DR 141: When looking for a
24987 template-name after -> or ., only consider class templates. */
24992 /* The object is type-dependent, so we can't look anything up; we used
24993 this to get the DR 141 behavior. */
24997 }
24998 else
24999 {
25005 }
25007 /* If the lookup failed, let our caller know. */
25011 /* Pull out the template from an injected-class-name (or multiple). */
25015 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
25017 {
25020 /* The error message we have to print is too complicated for
25021 cp_parser_error, so we incorporate its actions directly. */
25023 {
25025 name);
25027 }
25029 }
25037 /* If we have resolved the name of a member declaration, check to
25038 see if the declaration is accessible. When the name resolves to
25039 set of overloaded functions, accessibility is checked when
25040 overload resolution is done.
25042 During an explicit instantiation, access is not checked at all,
25043 as per [temp.explicit]. */
25050 }
25052 /* Like cp_parser_lookup_name, but for use in the typical case where
25053 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
25054 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
25056 static tree
25058 {
25060 none_type,
25065 location);
25066 }
25068 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
25069 the current context, return the TYPE_DECL. If TAG_NAME_P is
25070 true, the DECL indicates the class being defined in a class-head,
25071 or declared in an elaborated-type-specifier.
25073 Otherwise, return DECL. */
25075 static tree
25077 {
25078 /* If the TEMPLATE_DECL is being declared as part of a class-head,
25079 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
25081 struct A {
25082 template <typename T> struct B;
25083 };
25085 template <typename T> struct A::B {};
25087 Similarly, in an elaborated-type-specifier:
25089 namespace N { struct X{}; }
25091 struct A {
25092 template <typename T> friend struct N::X;
25093 };
25095 However, if the DECL refers to a class type, and we are in
25096 the scope of the class, then the name lookup automatically
25097 finds the TYPE_DECL created by build_self_reference rather
25098 than a TEMPLATE_DECL. For example, in:
25100 template <class T> struct S {
25101 S s;
25102 };
25104 there is no need to handle such case. */
25110 }
25112 /* If too many, or too few, template-parameter lists apply to the
25113 declarator, issue an error message. Returns TRUE if all went well,
25114 and FALSE otherwise. */
25116 static bool
25119 location_t declarator_location)
25120 {
25122 {
25124 {
25132 /* If the DECLARATOR has the form `X<y>' then it uses one
25133 additional level of template parameters. */
25136 return cp_parser_check_template_parameters
25138 }
25153 }
25155 }
25157 /* NUM_TEMPLATES were used in the current declaration. If that is
25158 invalid, return FALSE and issue an error messages. Otherwise,
25159 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25160 declarator and we can print more accurate diagnostics. */
25162 static bool
25165 location_t location,
25167 {
25168 /* If there are the same number of template classes and parameter
25169 lists, that's OK. */
25172 /* If there are more, but only one more, then we are referring to a
25173 member template. That's OK too. */
25176 /* If there are more template classes than parameter lists, we have
25177 something like:
25179 template <class T> void S<T>::R<T>::f (); */
25181 {
25191 else
25194 }
25195 /* Otherwise, there are too many template parameter lists. We have
25196 something like:
25198 template <class T> template <class U> void S::f(); */
25201 }
25203 /* Parse an optional `::' token indicating that the following name is
25204 from the global namespace. If so, PARSER->SCOPE is set to the
25205 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
25206 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
25207 Returns the new value of PARSER->SCOPE, if the `::' token is
25208 present, and NULL_TREE otherwise. */
25210 static tree
25212 {
25215 /* Peek at the next token. */
25217 /* If we're looking at a `::' token then we're starting from the
25218 global namespace, not our current location. */
25220 {
25221 /* Consume the `::' token. */
25223 /* Set the SCOPE so that we know where to start the lookup. */
25229 }
25231 {
25235 }
25238 }
25240 /* Returns TRUE if the upcoming token sequence is the start of a
25241 constructor declarator. If FRIEND_P is true, the declarator is
25242 preceded by the `friend' specifier. */
25244 static bool
25246 {
25249 tree nested_name_specifier;
25252 /* The common case is that this is not a constructor declarator, so
25253 try to avoid doing lots of work if at all possible. It's not
25254 valid declare a constructor at function scope. */
25257 /* And only certain tokens can begin a constructor declarator. */
25265 /* Parse tentatively; we are going to roll back all of the tokens
25266 consumed here. */
25268 /* Assume that we are looking at a constructor declarator. */
25271 /* Look for the optional `::' operator. */
25274 /* Look for the nested-name-specifier. */
25275 nested_name_specifier
25286 /* Outside of a class-specifier, there must be a
25287 nested-name-specifier. */
25293 /* If we have a class scope, this is easy; DR 147 says that S::S always
25294 names the constructor, and no other qualified name could. */
25297 {
25307 }
25308 /* If we still think that this might be a constructor-declarator,
25309 look for a class-name. */
25311 {
25312 /* If we have:
25314 template <typename T> struct S {
25315 S();
25316 };
25318 we must recognize that the nested `S' names a class. */
25319 tree type_decl;
25323 none_type,
25327 /* If there was no class-name, then this is not a constructor.
25328 Otherwise, if we are in a class-specifier and we aren't
25329 handling a friend declaration, check that its type matches
25330 current_class_type (c++/38313). Note: error_mark_node
25331 is left alone for error recovery purposes. */
25333 && (outside_class_specifier_p
25338 /* If we're still considering a constructor, we have to see a `(',
25339 to begin the parameter-declaration-clause, followed by either a
25340 `)', an `...', or a decl-specifier. We need to check for a
25341 type-specifier to avoid being fooled into thinking that:
25343 S (f) (int);
25345 is a constructor. (It is actually a function named `f' that
25346 takes one parameter (of type `int') and returns a value of type
25347 `S'. */
25355 /* A parameter declaration begins with a decl-specifier,
25356 which is either the "attribute" keyword, a storage class
25357 specifier, or (usually) a type-specifier. */
25359 {
25360 tree type;
25364 /* Names appearing in the type-specifier should be looked up
25365 in the scope of the class. */
25368 else
25369 {
25372 {
25376 {
25379 }
25380 }
25382 }
25384 /* Inside the constructor parameter list, surrounding
25385 template-parameter-lists do not apply. */
25386 saved_num_template_parameter_lists
25390 /* Look for the type-specifier. */
25392 CP_PARSER_FLAGS_NONE,
25398 parser->num_template_parameter_lists
25401 /* Leave the scope of the class. */
25406 }
25407 }
25409 /* We did not really want to consume any tokens. */
25413 }
25415 /* Parse the definition of the function given by the DECL_SPECIFIERS,
25416 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
25417 they must be performed once we are in the scope of the function.
25419 Returns the function defined. */
25421 static tree
25422 cp_parser_function_definition_from_specifiers_and_declarator
25425 tree attributes,
25427 {
25428 tree fn;
25431 /* Begin the function-definition. */
25434 /* The things we're about to see are not directly qualified by any
25435 template headers we've seen thus far. */
25438 /* If there were names looked up in the decl-specifier-seq that we
25439 did not check, check them now. We must wait until we are in the
25440 scope of the function to perform the checks, since the function
25441 might be a friend. */
25445 {
25450 }
25453 {
25454 /* Skip the entire function. */
25457 }
25459 {
25460 /* Seen already, skip it. An error message has already been output. */
25464 /* If this is a function from a class, pop the nested class. */
25467 }
25468 else
25469 {
25470 timevar_id_t tv;
25473 else
25479 }
25482 }
25484 /* Parse the part of a function-definition that follows the
25485 declarator. INLINE_P is TRUE iff this function is an inline
25486 function defined within a class-specifier.
25488 Returns the function defined. */
25490 static tree
25493 {
25494 tree fn;
25500 bool fully_implicit_function_template_p
25503 tree implicit_template_parms
25506 cp_binding_level* implicit_template_scope
25512 /* If the next token is `return', then the code may be trying to
25513 make use of the "named return value" extension that G++ used to
25514 support. */
25517 {
25518 /* Consume the `return' keyword. */
25520 /* Look for the identifier that indicates what value is to be
25521 returned. */
25523 /* Issue an error message. */
25526 /* Skip tokens until we reach the start of the function body. */
25528 {
25535 }
25536 }
25537 /* The `extern' in `extern "C" void f () { ... }' does not apply to
25538 anything declared inside `f'. */
25539 saved_in_unbraced_linkage_specification_p
25542 /* Inside the function, surrounding template-parameter-lists do not
25543 apply. */
25544 saved_num_template_parameter_lists
25550 /* If the next token is `try', `__transaction_atomic', or
25551 `__transaction_relaxed`, then we are looking at either function-try-block
25552 or function-transaction-block. Note that all of these include the
25553 function-body. */
25556 RID_TRANSACTION_ATOMIC);
25558 RID_TRANSACTION_RELAXED))
25560 RID_TRANSACTION_RELAXED);
25563 else
25564 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
25569 /* Finish the function. */
25572 /* Generate code for it, if necessary. */
25574 /* Restore the saved values. */
25575 parser->in_unbraced_linkage_specification_p
25577 parser->num_template_parameter_lists
25581 parser->fully_implicit_function_template_p
25583 parser->implicit_template_parms
25585 parser->implicit_template_scope
25592 }
25594 /* Parse a template-declaration body (following argument list). */
25596 static void
25598 tree parameter_list,
25600 {
25604 /* We just processed one more parameter list. */
25607 /* Get the deferred access checks from the parameter list. These
25608 will be checked once we know what is being declared, as for a
25609 member template the checks must be performed in the scope of the
25610 class containing the member. */
25613 /* Tentatively parse for a new template parameter list, which can either be
25614 the template keyword or a template introduction. */
25620 else
25621 {
25622 /* There are no access checks when parsing a template, as we do not
25623 know if a specialization will be a friend. */
25627 checks,
25628 member_p,
25633 /* If this is a member template declaration, let the front
25634 end know. */
25636 {
25641 }
25646 }
25647 /* We are done with the current parameter list. */
25652 /* Finish up. */
25655 /* Check the template arguments for a literal operator template. */
25659 {
25663 else
25664 {
25667 {
25673 }
25675 {
25683 }
25684 else
25686 }
25688 {
25691 " Expected non-type template argument pack <char...>"
25693 decl);
25694 else
25697 decl);
25698 }
25699 }
25701 /* Register member declarations. */
25704 /* If DECL is a function template, we must return to parse it later.
25705 (Even though there is no definition, there might be default
25706 arguments that need handling.) */
25710 }
25712 /* Parse a template introduction header for a template-declaration. Returns
25713 false if tentative parse fails. */
25715 static bool
25717 {
25724 /* Look for the optional `::' operator. */
25727 /* Look for the nested-name-specifier. */
25737 /* Look up the concept for which we will be matching
25738 template parameters. */
25748 /* Look for opening brace for introduction. */
25756 /* Build vector of placeholder parameters and grab
25757 matching identifiers. */
25760 /* The introduction-list shall not be empty. */
25763 {
25766 }
25768 /* Look for closing brace for introduction. */
25773 {
25777 }
25779 /* Build and associate the constraint. */
25782 {
25784 member_p);
25786 }
25790 }
25792 /* Parse a normal template-declaration following the template keyword. */
25794 static void
25796 {
25797 tree parameter_list;
25801 /* Look for the `<' token. */
25805 {
25806 /* 14.5.2.2 [temp.mem]
25808 A local class shall not have member templates. */
25813 }
25814 /* [temp]
25816 A template ... shall not have C linkage. */
25818 {
25820 /* Give it C++ linkage to avoid confusing other parts of the
25821 front end. */
25824 }
25825 else
25828 /* We cannot perform access checks on the template parameter
25829 declarations until we know what is being declared, just as we
25830 cannot check the decl-specifier list. */
25833 /* If the next token is `>', then we have an invalid
25834 specialization. Rather than complain about an invalid template
25835 parameter, issue an error message here. */
25837 {
25841 }
25842 else
25843 {
25844 /* Parse the template parameters. */
25846 }
25848 /* Look for the `>'. */
25851 /* Manage template requirements */
25853 {
25858 }
25861 member_p);
25863 /* For the erroneous case of a template with C linkage, we pushed an
25864 implicit C++ linkage scope; exit that scope now. */
25867 }
25869 /* Parse a template-declaration, assuming that the `export' (and
25870 `extern') keywords, if present, has already been scanned. MEMBER_P
25871 is as for cp_parser_template_declaration. */
25873 static bool
25875 {
25877 {
25881 }
25886 }
25888 /* Perform the deferred access checks from a template-parameter-list.
25889 CHECKS is a TREE_LIST of access checks, as returned by
25890 get_deferred_access_checks. */
25892 static void
25893 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
25894 {
25898 }
25900 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
25901 `function-definition' sequence that follows a template header.
25902 If MEMBER_P is true, this declaration appears in a class scope.
25904 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
25905 *FRIEND_P is set to TRUE iff the declaration is a friend. */
25907 static tree
25913 {
25916 cp_decl_specifier_seq decl_specifiers;
25920 /* This function is only used when processing a template
25921 declaration. */
25925 /* Defer access checks until we know what is being declared. */
25928 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
25929 alternative. */
25932 CP_PARSER_FLAGS_OPTIONAL,
25938 /* There are no template typedefs. */
25940 {
25944 }
25946 /* Gather up the access checks that occurred the
25947 decl-specifier-seq. */
25950 /* Check for the declaration of a template class. */
25952 {
25955 {
25956 // If this is a declaration, but not a definition, associate
25957 // any constraints with the type declaration. Constraints
25958 // are associated with definitions in cp_parser_class_specifier.
25964 /* In this case:
25966 struct C {
25967 friend template <typename T> struct A<T>::B;
25968 };
25970 A<T>::B will be represented by a TYPENAME_TYPE, and
25971 therefore not recognized by shadow_tag. */
25973 && !decl
25980 else
25983 /* Perform access checks for template parameters. */
25986 /* Give a helpful diagnostic for
25987 template <class T> struct A { } a;
25988 if we aren't already recovering from an error. */
25991 {
25993 "a class template declaration must not declare "
25997 }
25998 }
25999 }
26001 /* Complain about missing 'typename' or other invalid type names. */
26004 {
26005 /* cp_parser_parse_and_diagnose_invalid_type_name calls
26006 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
26007 the rest of this declaration. */
26010 }
26012 /* If it's not a template class, try for a template function. If
26013 the next token is a `;', then this declaration does not declare
26014 anything. But, if there were errors in the decl-specifiers, then
26015 the error might well have come from an attempted class-specifier.
26016 In that case, there's no need to warn about a missing declarator. */
26020 {
26023 checks,
26025 member_p,
26026 declares_class_or_enum,
26030 /* 7.1.1-1 [dcl.stc]
26032 A storage-class-specifier shall not be specified in an explicit
26033 specialization... */
26035 && explicit_specialization_p
26037 {
26041 }
26045 }
26047 /* Look for a trailing `;' after the declaration. */
26053 out:
26056 /* Clear any current qualification; whatever comes next is the start
26057 of something new. */
26063 }
26065 /* Parse a cast-expression that is not the operand of a unary "&". */
26067 static cp_expr
26069 {
26072 }
26074 /* Parse a functional cast to TYPE. Returns an expression
26075 representing the cast. */
26077 static cp_expr
26079 {
26081 tree expression_list;
26082 cp_expr cast;
26091 {
26100 tf_warning_or_error);
26101 /* Create a location of the form:
26102 type_name{i, f}
26103 ^~~~~~~~~~~~~~~
26104 with caret == start at the start of the type name,
26105 finishing at the closing brace. */
26106 location_t finish_loc
26109 finish_loc);
26112 }
26121 else
26122 {
26125 }
26128 tf_warning_or_error);
26129 /* [expr.const]/1: In an integral constant expression "only type
26130 conversions to integral or enumeration type can be used". */
26136 NIC_CONSTRUCTOR))
26139 /* Create a location of the form:
26140 float(i)
26141 ^~~~~~~~
26142 with caret == start at the start of the type name,
26143 finishing at the closing paren. */
26144 location_t finish_loc
26149 }
26151 /* Save the tokens that make up the body of a member function defined
26152 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
26153 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
26154 specifiers applied to the declaration. Returns the FUNCTION_DECL
26155 for the member function. */
26157 static tree
26161 tree attributes)
26162 {
26165 tree fn;
26168 /* Create the FUNCTION_DECL. */
26172 /* If something went badly wrong, bail out now. */
26174 {
26175 /* If there's a function-body, skip it. */
26180 }
26182 /* Remember it, if there default args to post process. */
26185 /* Save away the tokens that make up the body of the
26186 function. */
26192 RID_TRANSACTION_ATOMIC))
26193 {
26195 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
26202 {
26208 }
26209 else
26212 {
26216 }
26217 }
26219 /* Handle function try blocks. */
26221 {
26224 }
26225 /* We can have braced-init-list mem-initializers before the fn body. */
26227 {
26230 {
26231 /* cache_group will stop after an un-nested { } pair, too. */
26235 /* variadic mem-inits have ... after the ')'. */
26238 }
26239 }
26241 /* Handle function try blocks. */
26247 /* Save away the inline definition; we will process it when the
26248 class is complete. */
26252 /* We need to know that this was defined in the class, so that
26253 friend templates are handled correctly. */
26256 /* Add FN to the queue of functions to be parsed later. */
26260 }
26262 /* Save the tokens that make up the in-class initializer for a non-static
26263 data member. Returns a DEFAULT_ARG. */
26265 static tree
26267 {
26269 }
26271 /* Parse a template-argument-list, as well as the trailing ">" (but
26272 not the opening "<"). See cp_parser_template_argument_list for the
26273 return value. */
26275 static tree
26277 {
26278 tree arguments;
26279 tree saved_scope;
26280 tree saved_qualifying_scope;
26281 tree saved_object_scope;
26286 /* [temp.names]
26288 When parsing a template-id, the first non-nested `>' is taken as
26289 the end of the template-argument-list rather than a greater-than
26290 operator. */
26291 saved_greater_than_is_operator_p
26294 /* Parsing the argument list may modify SCOPE, so we save it
26295 here. */
26299 /* We need to evaluate the template arguments, even though this
26300 template-id may be nested within a "sizeof". */
26305 /* Parse the template-argument-list itself. */
26309 else
26311 /* Look for the `>' that ends the template-argument-list. If we find
26312 a '>>' instead, it's probably just a typo. */
26314 {
26316 {
26317 /* In C++0x, a `>>' in a template argument list or cast
26318 expression is considered to be two separate `>'
26319 tokens. So, change the current token to a `>', but don't
26320 consume it: it will be consumed later when the outer
26321 template argument list (or cast expression) is parsed.
26322 Note that this replacement of `>' for `>>' is necessary
26323 even if we are parsing tentatively: in the tentative
26324 case, after calling
26325 cp_parser_enclosed_template_argument_list we will always
26326 throw away all of the template arguments and the first
26327 closing `>', either because the template argument list
26328 was erroneous or because we are replacing those tokens
26329 with a CPP_TEMPLATE_ID token. The second `>' (which will
26330 not have been thrown away) is needed either to close an
26331 outer template argument list or to complete a new-style
26332 cast. */
26335 }
26337 {
26338 /* If we're in a nested template argument list, the '>>' has
26339 to be a typo for '> >'. We emit the error message, but we
26340 continue parsing and we push a '>' as next token, so that
26341 the argument list will be parsed correctly. Note that the
26342 global source location is still on the token before the
26343 '>>', so we need to say explicitly where we want it. */
26351 }
26352 else
26353 {
26354 /* If this is not a nested template argument list, the '>>'
26355 is a typo for '>'. Emit an error message and continue.
26356 Same deal about the token location, but here we can get it
26357 right by consuming the '>>' before issuing the diagnostic. */
26360 "spurious %<>>%>, use %<>%> to terminate "
26362 }
26363 }
26364 else
26366 /* The `>' token might be a greater-than operator again now. */
26367 parser->greater_than_is_operator_p
26369 /* Restore the SAVED_SCOPE. */
26377 }
26379 /* MEMBER_FUNCTION is a member function, or a friend. If default
26380 arguments, or the body of the function have not yet been parsed,
26381 parse them now. */
26383 static void
26385 {
26387 /* If this member is a template, get the underlying
26388 FUNCTION_DECL. */
26392 /* There should not be any class definitions in progress at this
26393 point; the bodies of members are only parsed outside of all class
26394 definitions. */
26396 /* While we're parsing the member functions we might encounter more
26397 classes. We want to handle them right away, but we don't want
26398 them getting mixed up with functions that are currently in the
26399 queue. */
26402 /* Make sure that any template parameters are in scope. */
26405 /* If the body of the function has not yet been parsed, parse it
26406 now. */
26408 {
26409 tree function_scope;
26412 /* The function is no longer pending; we are processing it. */
26417 /* If this is a local class, enter the scope of the containing
26418 function. */
26423 /* Push the body of the function onto the lexer stack. */
26426 /* Let the front end know that we going to be defining this
26427 function. */
26431 /* Don't do access checking if it is a templated function. */
26435 /* #pragma omp declare reduction needs special parsing. */
26437 {
26442 }
26443 else
26444 /* Now, parse the body of the function. */
26451 /* Leave the scope of the containing function. */
26455 }
26457 /* Remove any template parameters from the symbol table. */
26460 /* Restore the queue. */
26463 }
26465 /* If DECL contains any default args, remember it on the unparsed
26466 functions queue. */
26468 static void
26470 {
26471 tree probe;
26474 probe;
26477 {
26481 }
26482 }
26484 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
26485 which is either a FIELD_DECL or PARM_DECL. Parse it and return
26486 the result. For a PARM_DECL, PARMTYPE is the corresponding type
26487 from the parameter-type-list. */
26489 static tree
26492 {
26494 tree parsed_arg;
26500 /* Push the saved tokens for the default argument onto the parser's
26501 lexer stack. */
26507 /* Parse the default argument. */
26518 {
26519 /* In a non-template class, check conversions now. In a template,
26520 we'll wait and instantiate these as needed. */
26523 tf_warning_or_error);
26524 else
26526 }
26528 /* If the token stream has not been completely used up, then
26529 there was extra junk after the end of the default
26530 argument. */
26532 {
26535 else
26537 }
26539 /* Revert to the main lexer. */
26543 }
26545 /* FIELD is a non-static data member with an initializer which we saved for
26546 later; parse it now. */
26548 static void
26550 {
26551 tree def;
26558 NULL_TREE);
26564 }
26566 /* FN is a FUNCTION_DECL which may contains a parameter with an
26567 unparsed DEFAULT_ARG. Parse the default args now. This function
26568 assumes that the current scope is the scope in which the default
26569 argument should be processed. */
26571 static void
26573 {
26577 /* While we're parsing the default args, we might (due to the
26578 statement expression extension) encounter more classes. We want
26579 to handle them right away, but we don't want them getting mixed
26580 up with default args that are currently in the queue. */
26583 /* Local variable names (and the `this' keyword) may not appear
26584 in a default argument. */
26595 {
26597 tree parsed_arg;
26599 tree copy;
26606 /* This can happen for a friend declaration for a function
26607 already declared with default arguments. */
26610 parsed_arg
26612 default_arg,
26615 {
26617 }
26621 /* Update any instantiations we've already created. */
26625 }
26629 /* Make sure no default arg is missing. */
26632 /* Restore the state of local_variables_forbidden_p. */
26635 /* Restore the queue. */
26637 }
26639 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
26641 sizeof ... ( identifier )
26643 where the 'sizeof' token has already been consumed. */
26645 static tree
26647 {
26648 /* Consume the `...'. */
26655 else
26663 /* The name is not qualified. */
26682 }
26684 /* Parse the operand of `sizeof' (or a similar operator). Returns
26685 either a TYPE or an expression, depending on the form of the
26686 input. The KEYWORD indicates which kind of expression we have
26687 encountered. */
26689 static tree
26691 {
26698 /* If it's a `...', then we are computing the length of a parameter
26699 pack. */
26704 /* Types cannot be defined in a `sizeof' expression. Save away the
26705 old message. */
26707 /* And create the new one. */
26713 /* The restrictions on constant-expressions do not apply inside
26714 sizeof expressions. */
26715 saved_integral_constant_expression_p
26717 saved_non_integral_constant_expression_p
26721 /* Do not actually evaluate the expression. */
26724 /* If it's a `(', then we might be looking at the type-id
26725 construction. */
26727 {
26730 /* We can't be sure yet whether we're looking at a type-id or an
26731 expression. */
26733 /* Note: as a GNU Extension, compound literals are considered
26734 postfix-expressions as they are in C99, so they are valid
26735 arguments to sizeof. See comment in cp_parser_cast_expression
26736 for details. */
26739 else
26740 {
26743 /* Look for the type-id. */
26745 /* Look for the closing `)'. */
26748 }
26750 /* If all went well, then we're done. */
26752 {
26753 cp_decl_specifier_seq decl_specs;
26755 /* Build a trivial decl-specifier-seq. */
26759 /* Call grokdeclarator to figure out what type this is. */
26762 TYPENAME,
26765 }
26766 }
26768 /* If the type-id production did not work out, then we must be
26769 looking at the unary-expression production. */
26773 /* Go back to evaluating expressions. */
26777 /* Free the message we created. */
26779 /* And restore the old one. */
26781 parser->integral_constant_expression_p
26783 parser->non_integral_constant_expression_p
26787 }
26789 /* If the current declaration has no declarator, return true. */
26791 static bool
26793 {
26794 /* If the next token is a `;' or a `,' then there is no
26795 declarator. */
26798 }
26800 /* Update the DECL_SPECS to reflect the storage class indicated by
26801 KEYWORD. */
26803 static void
26808 {
26809 cp_storage_class storage_class;
26812 {
26816 }
26818 {
26821 }
26826 {
26829 }
26832 {
26850 }
26854 /* A storage class specifier cannot be applied alongside a typedef
26855 specifier. If there is a typedef specifier present then set
26856 conflicting_specifiers_p which will trigger an error later
26857 on in grokdeclarator. */
26860 }
26862 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
26863 is true, the type is a class or enum definition. */
26865 static void
26867 tree type_spec,
26870 {
26873 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
26874 (with, for example, in "typedef int wchar_t;") we remember that
26875 this is what happened. In system headers, we ignore these
26876 declarations so that G++ can work with system headers that are not
26877 C++-safe. */
26879 && !type_definition_p
26889 {
26892 ds_redefined_builtin_type_spec,
26893 token);
26895 {
26899 }
26900 }
26903 else
26904 {
26909 }
26910 }
26912 /* True iff TOKEN is the GNU keyword __thread. */
26914 static bool
26916 {
26919 }
26921 /* Set the location for a declarator specifier and check if it is
26922 duplicated.
26924 DECL_SPECS is the sequence of declarator specifiers onto which to
26925 set the location.
26927 DS is the single declarator specifier to set which location is to
26928 be set onto the existing sequence of declarators.
26930 LOCATION is the location for the declarator specifier to
26931 consider. */
26933 static void
26936 {
26945 {
26949 }
26950 else
26951 {
26953 {
26957 else
26958 {
26961 OPT_Wlong_long,
26963 }
26964 }
26966 {
26971 else
26973 }
26974 else
26975 {
26991 "__complex"
26992 };
26995 }
26996 }
26997 }
26999 /* Return true iff the declarator specifier DS is present in the
27000 sequence of declarator specifiers DECL_SPECS. */
27002 bool
27004 cp_decl_spec ds)
27005 {
27012 }
27014 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
27015 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
27017 static bool
27019 {
27021 }
27023 /* Issue an error message indicating that TOKEN_DESC was expected.
27024 If KEYWORD is true, it indicated this function is called by
27025 cp_parser_require_keword and the required token can only be
27026 a indicated keyword. */
27028 static void
27030 required_token token_desc,
27032 {
27034 {
27103 }
27105 {
27107 {
27186 }
27187 }
27188 else
27190 }
27194 /* If the next token is of the indicated TYPE, consume it. Otherwise,
27195 issue an error message indicating that TOKEN_DESC was expected.
27197 Returns the token consumed, if the token had the appropriate type.
27198 Otherwise, returns NULL. */
27203 required_token token_desc)
27204 {
27207 else
27208 {
27209 /* Output the MESSAGE -- unless we're parsing tentatively. */
27213 }
27214 }
27216 /* An error message is produced if the next token is not '>'.
27217 All further tokens are skipped until the desired token is
27218 found or '{', '}', ';' or an unbalanced ')' or ']'. */
27220 static void
27222 {
27223 /* Current level of '< ... >'. */
27225 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
27228 /* Are we ready, yet? If not, issue error message. */
27232 /* Skip tokens until the desired token is found. */
27234 {
27235 /* Peek at the next token. */
27237 {
27245 /* C++0x views the `>>' operator as two `>' tokens, but
27246 C++98 does not. */
27249 {
27250 /* We've hit a `>>' where the first `>' closes the
27251 template argument list, and the second `>' is
27252 spurious. Just consume the `>>' and stop; we've
27253 already produced at least one error. */
27256 }
27257 /* Fall through for C++0x, so we handle the second `>' in
27258 the `>>'. */
27262 {
27263 /* We've reached the token we want, consume it and stop. */
27266 }
27285 /* The '>' was probably forgotten, don't look further. */
27290 }
27292 /* Consume this token. */
27294 }
27295 }
27297 /* If the next token is the indicated keyword, consume it. Otherwise,
27298 issue an error message indicating that TOKEN_DESC was expected.
27300 Returns the token consumed, if the token had the appropriate type.
27301 Otherwise, returns NULL. */
27306 required_token token_desc)
27307 {
27311 {
27314 }
27317 }
27319 /* Returns TRUE iff TOKEN is a token that can begin the body of a
27320 function-definition. */
27322 static bool
27324 {
27327 /* A ctor-initializer begins with a `:'. */
27329 /* A function-try-block begins with `try'. */
27331 /* A function-transaction-block begins with `__transaction_atomic'
27332 or `__transaction_relaxed'. */
27335 /* The named return value extension begins with `return'. */
27337 }
27339 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
27340 definition. */
27342 static bool
27344 {
27351 }
27353 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
27354 C++0x) ending a template-argument. */
27356 static bool
27358 {
27366 }
27368 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
27369 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
27371 static bool
27374 {
27380 /* Check for the sequence `<::' in the original code. It would be lexed as
27381 `[:', where `[' is a digraph, and there is no whitespace before
27382 `:'. */
27384 {
27389 }
27391 }
27393 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
27394 or none_type otherwise. */
27396 static enum tag_types
27398 {
27400 {
27410 }
27411 }
27413 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
27414 or none_type otherwise or if the token is null. */
27416 static enum tag_types
27418 {
27423 {
27431 }
27432 }
27434 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
27436 static void
27438 {
27442 {
27446 type))
27449 }
27450 }
27452 /* Issue an error message if DECL is redeclared with different
27453 access than its original declaration [class.access.spec/3].
27454 This applies to nested classes, nested class templates and
27455 enumerations [class.mem/1]. */
27457 static void
27459 {
27470 }
27472 /* Look for the `template' keyword, as a syntactic disambiguator.
27473 Return TRUE iff it is present, in which case it will be
27474 consumed. */
27476 static bool
27478 {
27480 {
27481 /* In C++98 the `template' keyword can only be used within templates;
27482 outside templates the parser can always figure out what is a
27483 template and what is not. In C++11, per the resolution of DR 468,
27484 `template' is allowed in cases where it is not strictly necessary. */
27487 {
27490 "in C++98 %<template%> (as a disambiguator) is only "
27492 /* If this part of the token stream is rescanned, the same
27493 error message would be generated. So, we purge the token
27494 from the stream. */
27497 }
27498 else
27499 {
27500 /* Consume the `template' keyword. */
27503 }
27504 }
27506 }
27508 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
27509 set PARSER->SCOPE, and perform other related actions. */
27511 static void
27513 {
27516 /* Get the stored value. */
27518 /* Set the scope from the stored value. */
27522 }
27524 /* Consume tokens up through a non-nested END token. Returns TRUE if we
27525 encounter the end of a block before what we were looking for. */
27527 static bool
27531 {
27533 {
27536 /* Abort a parenthesized expression if we encounter a semicolon. */
27540 /* If we've reached the end of the file, stop. */
27546 /* We've hit the end of an enclosing block, so there's been some
27547 kind of syntax error. */
27550 /* Consume the token. */
27552 /* See if it starts a new group. */
27554 {
27556 /* In theory this should probably check end == '}', but
27557 cp_parser_save_member_function_body needs it to exit
27558 after either '}' or ')' when called with ')'. */
27561 }
27563 {
27567 }
27572 }
27573 }
27575 /* Like above, for caching a default argument or NSDMI. Both of these are
27576 terminated by a non-nested comma, but it can be unclear whether or not a
27577 comma is nested in a template argument list unless we do more parsing.
27578 In order to handle this ambiguity, when we encounter a ',' after a '<'
27579 we try to parse what follows as a parameter-declaration-list (in the
27580 case of a default argument) or a member-declarator (in the case of an
27581 NSDMI). If that succeeds, then we stop caching. */
27583 static tree
27585 {
27590 tree default_argument;
27592 /* Add tokens until we have processed the entire default
27593 argument. We add the range [first_token, token). */
27596 {
27597 /* For list-initialization, this is straightforward. */
27600 }
27602 {
27605 /* Peek at the next token. */
27607 /* What we do depends on what token we have. */
27609 {
27610 /* In valid code, a default argument must be
27611 immediately followed by a `,' `)', or `...'. */
27614 {
27615 /* If we've seen a '<', we might be in a
27616 template-argument-list. Until Core issue 325 is
27617 resolved, we don't know how this situation ought
27618 to be handled, so try to DTRT. We check whether
27619 what comes after the comma is a valid parameter
27620 declaration list. If it is, then the comma ends
27621 the default argument; otherwise the default
27622 argument continues. */
27626 /* Set ITALP so cp_parser_parameter_declaration_list
27627 doesn't decide to commit to this parse. */
27634 {
27635 /* Parse declarators until we reach a non-comma or
27636 somthing that cannot be an initializer.
27637 Just checking whether we're looking at a single
27638 declarator is insufficient. Consider:
27639 int var = tuple<T,U>::x;
27640 The template parameter 'U' looks exactly like a
27641 declarator. */
27642 do
27643 {
27654 }
27656 /* If we met an '=' or ';' then the original comma
27657 was the end of the NSDMI. Otherwise assume
27658 we're still in the NSDMI. */
27661 }
27662 else
27663 {
27668 }
27675 }
27676 /* XXX Really fallthru? */
27677 /* FALLTHRU */
27680 /* If we run into a non-nested `;', `}', or `]',
27681 then the code is invalid -- but the default
27682 argument is certainly over. */
27687 /* Handle correctly int n = sizeof ... ( p ); */
27690 /* Update DEPTH, if necessary. */
27705 /* This might be the comparison operator, or it might
27706 start a template argument list. */
27713 /* Fall through for C++0x, which treats the `>>'
27714 operator like two `>' tokens in certain
27715 cases. */
27719 {
27720 /* This might be an operator, or it might close a
27721 template argument list. But if a previous '<'
27722 started a template argument list, this will have
27723 closed it, so we can't be in one anymore. */
27727 }
27730 /* If we run out of tokens, issue an error message. */
27738 /* In these cases, we should look for template-ids.
27739 For example, if the default argument is
27740 `X<int, double>()', we need to do name lookup to
27741 figure out whether or not `X' is a template; if
27742 so, the `,' does not end the default argument.
27744 That is not yet done. */
27749 }
27751 /* If we've reached the end, stop. */
27755 /* Add the token to the token block. */
27757 }
27759 /* Create a DEFAULT_ARG to represent the unparsed default
27760 argument. */
27767 }
27769 /* Begin parsing tentatively. We always save tokens while parsing
27770 tentatively so that if the tentative parsing fails we can restore the
27771 tokens. */
27773 static void
27775 {
27776 /* Enter a new parsing context. */
27778 /* Begin saving tokens. */
27780 /* In order to avoid repetitive access control error messages,
27781 access checks are queued up until we are no longer parsing
27782 tentatively. */
27784 }
27786 /* Commit to the currently active tentative parse. */
27788 static void
27790 {
27794 /* Mark all of the levels as committed. */
27797 {
27804 }
27805 }
27807 /* Commit to the topmost currently active tentative parse.
27809 Note that this function shouldn't be called when there are
27810 irreversible side-effects while in a tentative state. For
27811 example, we shouldn't create a permanent entry in the symbol
27812 table, or issue an error message that might not apply if the
27813 tentative parse is aborted. */
27815 static void
27817 {
27822 {
27830 }
27831 }
27833 /* Abort the currently active tentative parse. All consumed tokens
27834 will be rolled back, and no diagnostics will be issued. */
27836 static void
27838 {
27842 /* Now, pretend that we want to see if the construct was
27843 successfully parsed. */
27845 }
27847 /* Stop parsing tentatively. If a parse error has occurred, restore the
27848 token stream. Otherwise, commit to the tokens we have consumed.
27849 Returns true if no error occurred; false otherwise. */
27851 static bool
27853 {
27857 /* Remember whether or not an error occurred, since we are about to
27858 destroy that information. */
27860 /* Remove the topmost context from the stack. */
27863 /* If no parse errors occurred, commit to the tentative parse. */
27865 {
27866 /* Commit to the tokens read tentatively, unless that was
27867 already done. */
27872 }
27873 /* Otherwise, if errors occurred, roll back our state so that things
27874 are just as they were before we began the tentative parse. */
27875 else
27876 {
27879 }
27880 /* Add the context to the front of the free list. */
27885 }
27887 /* Returns true if we are parsing tentatively and are not committed to
27888 this tentative parse. */
27890 static bool
27892 {
27895 }
27897 /* Returns nonzero iff an error has occurred during the most recent
27898 tentative parse. */
27900 static bool
27902 {
27905 }
27907 /* Returns nonzero if GNU extensions are allowed. */
27909 static bool
27911 {
27913 }
27914 \f
27915 /* Objective-C++ Productions */
27918 /* Parse an Objective-C expression, which feeds into a primary-expression
27919 above.
27921 objc-expression:
27922 objc-message-expression
27923 objc-string-literal
27924 objc-encode-expression
27925 objc-protocol-expression
27926 objc-selector-expression
27928 Returns a tree representation of the expression. */
27930 static cp_expr
27932 {
27933 /* Try to figure out what kind of declaration is present. */
27937 {
27947 {
27959 }
27965 }
27968 }
27970 /* Parse an Objective-C message expression.
27972 objc-message-expression:
27973 [ objc-message-receiver objc-message-args ]
27975 Returns a representation of an Objective-C message. */
27977 static tree
27979 {
27991 /* Construct a location e.g.
27992 [self func1:5]
27993 ^~~~~~~~~~~~~~
27994 ranging from the '[' to the ']', with the caret at the start. */
27999 }
28001 /* Parse an objc-message-receiver.
28003 objc-message-receiver:
28004 expression
28005 simple-type-specifier
28007 Returns a representation of the type or expression. */
28009 static tree
28011 {
28012 tree rcv;
28014 /* An Objective-C message receiver may be either (1) a type
28015 or (2) an expression. */
28019 /* If that worked out, fine. */
28026 CP_PARSER_FLAGS_NONE);
28033 }
28035 /* Parse the arguments and selectors comprising an Objective-C message.
28037 objc-message-args:
28038 objc-selector
28039 objc-selector-args
28040 objc-selector-args , objc-comma-args
28042 objc-selector-args:
28043 objc-selector [opt] : assignment-expression
28044 objc-selector-args objc-selector [opt] : assignment-expression
28046 objc-comma-args:
28047 assignment-expression
28048 objc-comma-args , assignment-expression
28050 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
28051 selector arguments and TREE_VALUE containing a list of comma
28052 arguments. */
28054 static tree
28056 {
28062 {
28068 /* Detect if we have a unary selector. */
28077 sel_args
28082 }
28084 /* Handle non-selector arguments, if any. */
28086 {
28087 tree arg;
28092 addl_args
28097 }
28100 {
28103 }
28106 }
28108 /* Parse an Objective-C encode expression.
28110 objc-encode-expression:
28111 @encode objc-typename
28113 Returns an encoded representation of the type argument. */
28115 static cp_expr
28117 {
28118 tree type;
28129 {
28133 }
28135 /* This happens if we find @encode(T) (where T is a template
28136 typename or something dependent on a template typename) when
28137 parsing a template. In that case, we can't compile it
28138 immediately, but we rather create an AT_ENCODE_EXPR which will
28139 need to be instantiated when the template is used.
28140 */
28142 {
28146 }
28149 /* Build a location of the form:
28150 @encode(int)
28151 ^~~~~~~~~~~~
28152 with caret==start at the @ token, finishing at the close paren. */
28153 location_t combined_loc
28158 }
28160 /* Parse an Objective-C @defs expression. */
28162 static tree
28164 {
28165 tree name;
28173 }
28175 /* Parse an Objective-C protocol expression.
28177 objc-protocol-expression:
28178 @protocol ( identifier )
28180 Returns a representation of the protocol expression. */
28182 static tree
28184 {
28185 tree proto;
28193 /* Build a location of the form:
28194 @protocol(prot)
28195 ^~~~~~~~~~~~~~~
28196 with caret==start at the @ token, finishing at the close paren. */
28197 location_t combined_loc
28203 }
28205 /* Parse an Objective-C selector expression.
28207 objc-selector-expression:
28208 @selector ( objc-method-signature )
28210 objc-method-signature:
28211 objc-selector
28212 objc-selector-seq
28214 objc-selector-seq:
28215 objc-selector :
28216 objc-selector-seq objc-selector :
28218 Returns a representation of the method selector. */
28220 static tree
28222 {
28234 {
28243 {
28244 /* Detect if we have a unary selector. */
28246 {
28249 }
28250 else
28251 {
28253 }
28254 }
28259 {
28260 sel_seq
28263 sel_seq
28266 }
28267 else
28268 sel_seq
28273 }
28275 finish_selector:
28279 /* Build a location of the form:
28280 @selector(func)
28281 ^~~~~~~~~~~~~~~
28282 with caret==start at the @ token, finishing at the close paren. */
28283 location_t combined_loc
28287 /* TODO: objc_build_selector_expr doesn't always honor the location. */
28290 }
28292 /* Parse a list of identifiers.
28294 objc-identifier-list:
28295 identifier
28296 objc-identifier-list , identifier
28298 Returns a TREE_LIST of identifier nodes. */
28300 static tree
28302 {
28303 tree identifier;
28304 tree list;
28315 {
28322 identifier));
28324 }
28327 }
28329 /* Parse an Objective-C alias declaration.
28331 objc-alias-declaration:
28332 @compatibility_alias identifier identifier ;
28334 This function registers the alias mapping with the Objective-C front end.
28335 It returns nothing. */
28337 static void
28339 {
28347 }
28349 /* Parse an Objective-C class forward-declaration.
28351 objc-class-declaration:
28352 @class objc-identifier-list ;
28354 The function registers the forward declarations with the Objective-C
28355 front end. It returns nothing. */
28357 static void
28359 {
28362 {
28363 tree id;
28373 else
28375 }
28377 }
28379 /* Parse a list of Objective-C protocol references.
28381 objc-protocol-refs-opt:
28382 objc-protocol-refs [opt]
28384 objc-protocol-refs:
28385 < objc-identifier-list >
28387 Returns a TREE_LIST of identifiers, if any. */
28389 static tree
28391 {
28395 {
28399 }
28402 }
28404 /* Parse a Objective-C visibility specification. */
28406 static void
28408 {
28412 {
28427 }
28429 /* Eat '@private'/'@protected'/'@public'. */
28431 }
28433 /* Parse an Objective-C method type. Return 'true' if it is a class
28434 (+) method, and 'false' if it is an instance (-) method. */
28438 {
28441 else
28443 }
28445 /* Parse an Objective-C protocol qualifier. */
28447 static tree
28449 {
28462 {
28467 }
28470 }
28472 /* Parse an Objective-C typename. */
28474 static tree
28476 {
28480 {
28486 /* An ObjC type name may consist of just protocol qualifiers, in which
28487 case the type shall default to 'id'. */
28489 {
28492 /* If the type could not be parsed, an error has already
28493 been produced. For error recovery, behave as if it had
28494 not been specified, which will use the default type
28495 'id'. */
28497 {
28499 /* We need to skip to the closing parenthesis as
28500 cp_parser_type_id() does not seem to do it for
28501 us. */
28506 }
28507 }
28511 }
28514 }
28516 /* Check to see if TYPE refers to an Objective-C selector name. */
28518 static bool
28520 {
28526 }
28528 /* Parse an Objective-C selector. */
28530 static tree
28532 {
28536 {
28539 }
28541 /* C++ operator names are allowed to appear in ObjC selectors. */
28543 {
28556 }
28557 }
28559 /* Parse an Objective-C params list. */
28561 static tree
28563 {
28569 {
28579 /* Detect if we have a unary selector. */
28582 {
28585 }
28589 {
28590 /* Something went quite wrong. There should be a colon
28591 here, but there is not. Stop parsing parameters. */
28593 }
28595 /* New ObjC allows attributes on parameters too. */
28600 params
28603 type_name,
28604 identifier,
28605 parm_attr));
28608 }
28611 {
28614 }
28616 /* We allow tail attributes for the method. */
28618 {
28626 }
28629 {
28632 }
28634 }
28636 /* Parse the non-keyword Objective-C params. */
28638 static tree
28641 {
28647 {
28649 tree parm;
28655 {
28660 }
28662 /* TODO: parse attributes for tail parameters. */
28671 }
28673 /* We allow tail attributes for the method. */
28675 {
28677 {
28682 }
28683 else
28684 /* We have an error, but parse the attributes, so that we can
28685 carry on. */
28691 }
28694 }
28696 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
28698 static void
28700 {
28703 /* If the next token is `extern' and the following token is a string
28704 literal, then we have a linkage specification. */
28706 && cp_parser_is_pure_string_literal
28709 /* Handle #pragma, if any. */
28712 /* Allow stray semicolons. */
28715 /* Mark methods as optional or required, when building protocols. */
28717 {
28720 }
28722 {
28725 }
28728 /* Other stray characters must generate errors. */
28730 {
28734 }
28735 /* Finally, try to parse a block-declaration, or a function-definition. */
28736 else
28738 }
28740 /* Parse a method signature. */
28742 static tree
28744 {
28760 }
28762 static bool
28764 {
28765 tree tattr;
28770 /* If the attributes are followed by a method introducer, this is not allowed.
28771 Dump the attributes and flag the situation. */
28776 /* Otherwise, the attributes introduce some interstitial code, possibly so
28777 rewind to allow that check. */
28780 }
28782 /* Parse an Objective-C method prototype list. */
28784 static void
28786 {
28790 {
28792 {
28797 else
28801 {
28805 }
28808 }
28814 OPT_Wattributes,
28816 else
28817 /* Allow for interspersed non-ObjC++ code. */
28821 }
28825 else
28829 }
28831 /* Parse an Objective-C method definition list. */
28833 static void
28835 {
28839 {
28840 tree meth;
28843 {
28849 else
28854 {
28858 }
28860 NULL_TREE);
28862 /* For historical reasons, we accept an optional semicolon. */
28869 {
28876 }
28877 }
28878 /* The following case will be removed once @synthesize is
28879 completely implemented. */
28890 else
28891 /* Allow for interspersed non-ObjC++ code. */
28895 }
28899 else
28903 }
28905 /* Parse Objective-C ivars. */
28907 static void
28909 {
28920 {
28921 cp_decl_specifier_seq declspecs;
28923 tree prefix_attributes;
28931 CP_PARSER_FLAGS_OPTIONAL,
28935 /* auto, register, static, extern, mutable. */
28937 {
28940 }
28942 /* thread_local. */
28944 {
28947 }
28949 /* typedef. */
28951 {
28954 }
28959 /* Keep going until we hit the `;' at the end of the
28960 declaration. */
28962 {
28967 /* Check for a (possibly unnamed) bitfield declaration. */
28975 {
28976 /* Get the name of the bitfield. */
28979 sfk_none);
28981 eat_colon:
28983 /* Get the width of the bitfield. */
28984 width
28986 }
28987 else
28988 {
28989 /* Parse the declarator. */
28990 declarator
28996 }
28998 /* Look for attributes that apply to the ivar. */
29000 /* Remember which attributes are prefix attributes and
29001 which are not. */
29003 /* Combine the attributes. */
29007 /* Create the bitfield declaration. */
29009 width,
29010 attributes);
29011 else
29016 /* Add the instance variable. */
29020 /* Reset PREFIX_ATTRIBUTES. */
29029 {
29032 }
29034 }
29038 }
29043 /* Do not consume the RID_AT_END, so it will be read again as terminating
29044 the @interface of @implementation. */
29048 /* For historical reasons, we accept an optional semicolon. */
29051 }
29053 /* Parse an Objective-C protocol declaration. */
29055 static void
29057 {
29063 {
29068 }
29070 /* See if we have a forward declaration or a definition. */
29073 /* Try a forward declaration first. */
29075 {
29077 {
29078 tree id;
29088 else
29090 }
29092 }
29094 /* Ok, we got a full-fledged definition (or at least should). */
29095 else
29096 {
29101 }
29102 }
29104 /* Parse an Objective-C superclass or category. */
29106 static void
29111 {
29117 {
29120 }
29122 {
29125 /* If there is no category name, and this is an @interface, we
29126 have a class extension. */
29128 {
29131 }
29132 else
29136 }
29137 }
29139 /* Parse an Objective-C class interface. */
29141 static void
29143 {
29150 {
29151 /* It's hard to recover because even if valid @interface stuff
29152 is to follow, we can't compile it (or validate it) if we
29153 don't even know which class it refers to. Let's assume this
29154 was a stray '@interface' token in the stream and skip it.
29155 */
29157 }
29162 /* We have either a class or a category on our hands. */
29165 else
29166 {
29168 /* Handle instance variable declarations, if any. */
29171 }
29174 }
29176 /* Parse an Objective-C class implementation. */
29178 static void
29180 {
29187 {
29188 /* It's hard to recover because even if valid @implementation
29189 stuff is to follow, we can't compile it (or validate it) if
29190 we don't even know which class it refers to. Let's assume
29191 this was a stray '@implementation' token in the stream and
29192 skip it.
29193 */
29195 }
29199 /* We have either a class or a category on our hands. */
29202 else
29203 {
29205 /* Handle instance variable declarations, if any. */
29208 }
29211 }
29213 /* Consume the @end token and finish off the implementation. */
29215 static void
29217 {
29220 }
29222 /* Parse an Objective-C declaration. */
29224 static void
29226 {
29227 /* Try to figure out what kind of declaration is present. */
29232 {
29248 }
29251 {
29274 }
29275 }
29277 /* Parse an Objective-C try-catch-finally statement.
29279 objc-try-catch-finally-stmt:
29280 @try compound-statement objc-catch-clause-seq [opt]
29281 objc-finally-clause [opt]
29283 objc-catch-clause-seq:
29284 objc-catch-clause objc-catch-clause-seq [opt]
29286 objc-catch-clause:
29287 @catch ( objc-exception-declaration ) compound-statement
29289 objc-finally-clause:
29290 @finally compound-statement
29292 objc-exception-declaration:
29293 parameter-declaration
29294 '...'
29296 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
29298 Returns NULL_TREE.
29300 PS: This function is identical to c_parser_objc_try_catch_finally_statement
29301 for C. Keep them in sync. */
29303 static tree
29305 {
29306 location_t location;
29307 tree stmt;
29312 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
29313 node, lest it get absorbed into the surrounding block. */
29319 {
29328 {
29329 /* We have "@catch (...)" (where the '...' are literally
29330 what is in the code). Skip the '...'.
29331 parameter_declaration is set to NULL_TREE, and
29332 objc_being_catch_clauses() knows that that means
29333 '...'. */
29336 }
29337 else
29338 {
29339 /* We have "@catch (NSException *exception)" or something
29340 like that. Parse the parameter declaration. */
29344 else
29349 }
29352 else
29353 {
29354 /* If there was no open parenthesis, we are recovering from
29355 an error, and we are trying to figure out what mistake
29356 the user has made. */
29358 /* If there is an immediate closing parenthesis, the user
29359 probably forgot the opening one (ie, they typed "@catch
29360 NSException *e)". Parse the closing parenthesis and keep
29361 going. */
29365 /* If these is no immediate closing parenthesis, the user
29366 probably doesn't know that parenthesis are required at
29367 all (ie, they typed "@catch NSException *e"). So, just
29368 forget about the closing parenthesis and keep going. */
29369 }
29373 }
29375 {
29378 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
29379 node, lest it get absorbed into the surrounding block. */
29383 }
29386 }
29388 /* Parse an Objective-C synchronized statement.
29390 objc-synchronized-stmt:
29391 @synchronized ( expression ) compound-statement
29393 Returns NULL_TREE. */
29395 static tree
29397 {
29398 location_t location;
29409 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
29410 node, lest it get absorbed into the surrounding block. */
29415 }
29417 /* Parse an Objective-C throw statement.
29419 objc-throw-stmt:
29420 @throw assignment-expression [opt] ;
29422 Returns a constructed '@throw' statement. */
29424 static tree
29426 {
29438 }
29440 /* Parse an Objective-C statement. */
29442 static tree
29444 {
29445 /* Try to figure out what kind of declaration is present. */
29449 {
29460 }
29463 }
29465 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
29466 look ahead to see if an objc keyword follows the attributes. This
29467 is to detect the use of prefix attributes on ObjC @interface and
29468 @protocol. */
29470 static bool
29472 {
29477 {
29480 }
29483 }
29485 /* This routine is a minimal replacement for
29486 c_parser_struct_declaration () used when parsing the list of
29487 types/names or ObjC++ properties. For example, when parsing the
29488 code
29490 @property (readonly) int a, b, c;
29492 this function is responsible for parsing "int a, int b, int c" and
29493 returning the declarations as CHAIN of DECLs.
29495 TODO: Share this code with cp_parser_objc_class_ivars. It's very
29496 similar parsing. */
29497 static tree
29499 {
29501 cp_decl_specifier_seq declspecs;
29503 tree prefix_attributes;
29506 CP_PARSER_FLAGS_NONE,
29513 /* auto, register, static, extern, mutable. */
29515 {
29518 }
29520 /* thread_local. */
29522 {
29525 }
29527 /* typedef. */
29529 {
29532 }
29537 /* Keep going until we hit the `;' at the end of the declaration. */
29539 {
29544 /* Parse the declarator. */
29548 /* Look for attributes that apply to the ivar. */
29550 /* Remember which attributes are prefix attributes and
29551 which are not. */
29553 /* Combine the attributes. */
29563 /* Reset PREFIX_ATTRIBUTES. */
29574 {
29577 }
29578 else
29580 }
29582 }
29584 /* Parse an Objective-C @property declaration. The syntax is:
29586 objc-property-declaration:
29587 '@property' objc-property-attributes[opt] struct-declaration ;
29589 objc-property-attributes:
29590 '(' objc-property-attribute-list ')'
29592 objc-property-attribute-list:
29593 objc-property-attribute
29594 objc-property-attribute-list, objc-property-attribute
29596 objc-property-attribute
29597 'getter' = identifier
29598 'setter' = identifier
29599 'readonly'
29600 'readwrite'
29601 'assign'
29602 'retain'
29603 'copy'
29604 'nonatomic'
29606 For example:
29607 @property NSString *name;
29608 @property (readonly) id object;
29609 @property (retain, nonatomic, getter=getTheName) id name;
29610 @property int a, b, c;
29612 PS: This function is identical to
29613 c_parser_objc_at_property_declaration for C. Keep them in sync. */
29614 static void
29616 {
29617 /* The following variables hold the attributes of the properties as
29618 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
29619 seen. When we see an attribute, we set them to 'true' (if they
29620 are boolean properties) or to the identifier (if they have an
29621 argument, ie, for getter and setter). Note that here we only
29622 parse the list of attributes, check the syntax and accumulate the
29623 attributes that we find. objc_add_property_declaration() will
29624 then process the information. */
29634 /* 'properties' is the list of properties that we read. Usually a
29635 single one, but maybe more (eg, in "@property int a, b, c;" there
29636 are three). */
29637 tree properties;
29638 location_t loc;
29644 /* Parse the optional attribute list... */
29646 {
29647 /* Eat the '('. */
29651 {
29657 {
29660 }
29664 {
29675 {
29679 else
29684 }
29687 {
29691 }
29693 {
29695 {
29698 }
29699 else
29703 else
29705 }
29706 else
29707 {
29709 {
29712 }
29713 else
29715 }
29721 }
29728 else
29730 }
29732 /* FIXME: "@property (setter, assign);" will generate a spurious
29733 "error: expected ‘)’ before ‘,’ token". This is because
29734 cp_parser_require, unlike the C counterpart, will produce an
29735 error even if we are in error recovery. */
29737 {
29742 }
29743 }
29745 /* ... and the property declaration(s). */
29749 {
29751 /* If the next token is now a `;', consume it. */
29755 }
29759 else
29760 {
29761 /* Comma-separated properties are chained together in
29762 reverse order; add them one by one. */
29771 }
29774 }
29776 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
29778 objc-synthesize-declaration:
29779 @synthesize objc-synthesize-identifier-list ;
29781 objc-synthesize-identifier-list:
29782 objc-synthesize-identifier
29783 objc-synthesize-identifier-list, objc-synthesize-identifier
29785 objc-synthesize-identifier
29786 identifier
29787 identifier = identifier
29789 For example:
29790 @synthesize MyProperty;
29791 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
29793 PS: This function is identical to c_parser_objc_at_synthesize_declaration
29794 for C. Keep them in sync.
29795 */
29796 static void
29798 {
29800 location_t loc;
29805 {
29809 {
29812 }
29814 {
29818 {
29821 }
29822 }
29823 else
29828 else
29830 }
29833 }
29835 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
29837 objc-dynamic-declaration:
29838 @dynamic identifier-list ;
29840 For example:
29841 @dynamic MyProperty;
29842 @dynamic MyProperty, AnotherProperty;
29844 PS: This function is identical to c_parser_objc_at_dynamic_declaration
29845 for C. Keep them in sync.
29846 */
29847 static void
29849 {
29851 location_t loc;
29856 {
29857 tree property;
29860 {
29863 }
29867 else
29869 }
29872 }
29874 \f
29875 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
29877 /* Returns name of the next clause.
29878 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
29879 the token is not consumed. Otherwise appropriate pragma_omp_clause is
29880 returned and the token is consumed. */
29882 static pragma_omp_clause
29884 {
29900 {
29905 {
30088 }
30089 }
30095 }
30097 /* Validate that a clause of the given type does not already exist. */
30099 static void
30102 {
30103 tree c;
30107 {
30110 }
30111 }
30113 /* OpenMP 2.5:
30114 variable-list:
30115 identifier
30116 variable-list , identifier
30118 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
30119 colon). An opening parenthesis will have been consumed by the caller.
30121 If KIND is nonzero, create the appropriate node and install the decl
30122 in OMP_CLAUSE_DECL and add the node to the head of the list.
30124 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
30125 return the list created.
30127 COLON can be NULL if only closing parenthesis should end the list,
30128 or pointer to bool which will receive false if the list is terminated
30129 by closing parenthesis or true if the list is terminated by colon. */
30131 static tree
30134 {
30138 {
30141 }
30143 {
30148 && current_class_ptr
30150 {
30156 }
30157 else
30158 {
30171 }
30173 ;
30175 {
30177 {
30179 /* The OpenACC cache directive explicitly only allows "array
30180 elements or subarrays". */
30182 {
30186 }
30187 /* FALLTHROUGH. */
30192 {
30193 location_t loc
30198 decl
30202 }
30203 /* FALLTHROUGH. */
30207 {
30215 parser->colon_corrects_to_scope_p
30219 else
30220 {
30221 /* Look for `:'. */
30225 CPP_CLOSE_SQUARE))
30227 }
30228 /* Look for the closing `]'. */
30230 RT_CLOSE_SQUARE))
30234 }
30238 }
30244 }
30245 else
30248 get_comma:
30252 }
30258 {
30262 }
30265 {
30268 /* Try to resync to an unnested comma. Copied from
30269 cp_parser_parenthesized_expression_list. */
30270 skip_comma:
30279 }
30282 }
30284 /* Similarly, but expect leading and trailing parenthesis. This is a very
30285 common case for omp clauses. */
30287 static tree
30289 {
30293 }
30295 /* OpenACC 2.0:
30296 copy ( variable-list )
30297 copyin ( variable-list )
30298 copyout ( variable-list )
30299 create ( variable-list )
30300 delete ( variable-list )
30301 present ( variable-list )
30302 present_or_copy ( variable-list )
30303 pcopy ( variable-list )
30304 present_or_copyin ( variable-list )
30305 pcopyin ( variable-list )
30306 present_or_copyout ( variable-list )
30307 pcopyout ( variable-list )
30308 present_or_create ( variable-list )
30309 pcreate ( variable-list ) */
30311 static tree
30313 tree list)
30314 {
30317 {
30363 }
30371 }
30373 /* OpenACC 2.0:
30374 deviceptr ( variable-list ) */
30376 static tree
30378 {
30382 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
30383 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
30384 variable-list must only allow for pointer variables. */
30387 {
30394 }
30397 }
30399 /* OpenACC 2.0:
30400 auto
30401 independent
30402 nohost
30403 seq */
30405 static tree
30409 {
30414 }
30416 /* OpenACC:
30417 num_gangs ( expression )
30418 num_workers ( expression )
30419 vector_length ( expression ) */
30421 static tree
30424 {
30434 {
30439 }
30447 }
30449 /* OpenACC:
30451 gang [( gang-arg-list )]
30452 worker [( [num:] int-expr )]
30453 vector [( [length:] int-expr )]
30455 where gang-arg is one of:
30457 [num:] int-expr
30458 static: size-expr
30460 and size-expr may be:
30462 *
30463 int-expr
30464 */
30466 static tree
30469 {
30479 {
30482 do
30483 {
30487 /* Gang static argument. */
30490 {
30498 {
30501 }
30503 /* Check for the '*' argument. */
30507 CPP_CLOSE_PAREN)))
30508 {
30513 {
30516 }
30518 }
30519 }
30520 /* Worker num: argument and vector length: arguments. */
30524 {
30527 }
30529 /* Now collect the actual argument. */
30531 {
30534 }
30546 {
30549 }
30551 }
30556 }
30570 cleanup_error:
30573 }
30575 /* OpenACC 2.0:
30576 tile ( size-expr-list ) */
30578 static tree
30580 {
30589 do
30590 {
30594 {
30597 }
30598 else
30608 }
30611 /* Consume the trailing ')'. */
30619 }
30621 /* OpenACC 2.0
30622 Parse wait clause or directive parameters. */
30624 static tree
30626 {
30636 {
30641 }
30648 {
30652 {
30655 else
30656 {
30663 }
30664 }
30665 }
30668 }
30670 /* OpenACC:
30671 wait ( int-expr-list ) */
30673 static tree
30675 {
30684 }
30686 /* OpenMP 3.0:
30687 collapse ( constant-expression ) */
30689 static tree
30691 {
30693 location_t loc;
30694 HOST_WIDE_INT n;
30714 {
30717 }
30725 }
30727 /* OpenMP 2.5:
30728 default ( shared | none )
30730 OpenACC 2.0
30731 default (none) */
30733 static tree
30736 {
30738 tree c;
30743 {
30748 {
30763 }
30766 }
30767 else
30768 {
30769 invalid_kind:
30772 else
30774 }
30790 }
30792 /* OpenMP 3.1:
30793 final ( expression ) */
30795 static tree
30797 {
30818 }
30820 /* OpenMP 2.5:
30821 if ( expression )
30823 OpenMP 4.5:
30824 if ( directive-name-modifier : expression )
30826 directive-name-modifier:
30827 parallel | task | taskloop | target data | target | target update
30828 | target enter data | target exit data */
30830 static tree
30833 {
30841 {
30853 {
30856 {
30869 else
30870 {
30871 location_t loc
30876 }
30879 {
30881 {
30886 }
30888 {
30889 location_t loc
30893 }
30894 }
30895 }
30896 }
30898 {
30900 {
30903 }
30904 else
30905 {
30907 {
30908 location_t loc
30911 }
30913 }
30914 }
30915 }
30927 {
30930 {
30933 {
30943 }
30945 p);
30947 }
30949 {
30952 else
30955 }
30958 {
30962 }
30963 }
30971 }
30973 /* OpenMP 3.1:
30974 mergeable */
30976 static tree
30979 {
30980 tree c;
30983 location);
30988 }
30990 /* OpenMP 2.5:
30991 nowait */
30993 static tree
30996 {
30997 tree c;
31004 }
31006 /* OpenMP 2.5:
31007 num_threads ( expression ) */
31009 static tree
31011 location_t location)
31012 {
31034 }
31036 /* OpenMP 4.5:
31037 num_tasks ( expression ) */
31039 static tree
31041 location_t location)
31042 {
31064 }
31066 /* OpenMP 4.5:
31067 grainsize ( expression ) */
31069 static tree
31071 location_t location)
31072 {
31094 }
31096 /* OpenMP 4.5:
31097 priority ( expression ) */
31099 static tree
31101 location_t location)
31102 {
31124 }
31126 /* OpenMP 4.5:
31127 hint ( expression ) */
31129 static tree
31131 location_t location)
31132 {
31153 }
31155 /* OpenMP 4.5:
31156 defaultmap ( tofrom : scalar ) */
31158 static tree
31160 location_t location)
31161 {
31169 {
31172 }
31176 {
31179 }
31185 {
31188 }
31192 {
31195 }
31201 location);
31207 out_err:
31212 }
31214 /* OpenMP 2.5:
31215 ordered
31217 OpenMP 4.5:
31218 ordered ( constant-expression ) */
31220 static tree
31223 {
31225 HOST_WIDE_INT n;
31231 {
31248 {
31250 "ordered argument needs positive constant integer "
31253 }
31254 }
31260 }
31262 /* OpenMP 2.5:
31263 reduction ( reduction-operator : variable-list )
31265 reduction-operator:
31266 One of: + * - & ^ | && ||
31268 OpenMP 3.1:
31270 reduction-operator:
31271 One of: + * - & ^ | && || min max
31273 OpenMP 4.0:
31275 reduction-operator:
31276 One of: + * - & ^ | && ||
31277 id-expression */
31279 static tree
31281 {
31289 {
31299 }
31303 else
31304 {
31315 {
31345 }
31346 else
31347 {
31349 resync_fail:
31354 }
31355 }
31361 NULL);
31363 {
31366 }
31369 }
31371 /* OpenMP 2.5:
31372 schedule ( schedule-kind )
31373 schedule ( schedule-kind , expression )
31375 schedule-kind:
31376 static | dynamic | guided | runtime | auto
31378 OpenMP 4.5:
31379 schedule ( schedule-modifier : schedule-kind )
31380 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
31382 schedule-modifier:
31383 simd
31384 monotonic
31385 nonmonotonic */
31387 static tree
31389 {
31399 {
31408 else
31414 else
31415 {
31418 }
31419 }
31422 {
31427 {
31448 }
31449 }
31454 else
31460 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
31462 {
31466 }
31469 {
31484 else
31489 }
31501 invalid_kind:
31503 resync_fail:
31508 }
31510 /* OpenMP 3.0:
31511 untied */
31513 static tree
31516 {
31517 tree c;
31524 }
31526 /* OpenMP 4.0:
31527 inbranch
31528 notinbranch */
31530 static tree
31533 {
31538 }
31540 /* OpenMP 4.0:
31541 parallel
31542 for
31543 sections
31544 taskgroup */
31546 static tree
31550 {
31554 }
31556 /* OpenMP 4.5:
31557 nogroup */
31559 static tree
31562 {
31567 }
31569 /* OpenMP 4.5:
31570 simd
31571 threads */
31573 static tree
31577 {
31582 }
31584 /* OpenMP 4.0:
31585 num_teams ( expression ) */
31587 static tree
31589 location_t location)
31590 {
31612 }
31614 /* OpenMP 4.0:
31615 thread_limit ( expression ) */
31617 static tree
31619 location_t location)
31620 {
31642 }
31644 /* OpenMP 4.0:
31645 aligned ( variable-list )
31646 aligned ( variable-list : constant-expression ) */
31648 static tree
31650 {
31661 {
31671 }
31677 }
31679 /* OpenMP 4.0:
31680 linear ( variable-list )
31681 linear ( variable-list : expression )
31683 OpenMP 4.5:
31684 linear ( modifier ( variable-list ) )
31685 linear ( modifier ( variable-list ) : expression ) */
31687 static tree
31690 {
31700 {
31712 else
31714 }
31719 else
31720 {
31729 }
31732 {
31737 {
31748 {
31751 }
31754 }
31759 {
31762 }
31770 }
31773 {
31776 }
31779 }
31781 /* OpenMP 4.0:
31782 safelen ( constant-expression ) */
31784 static tree
31786 location_t location)
31787 {
31808 }
31810 /* OpenMP 4.0:
31811 simdlen ( constant-expression ) */
31813 static tree
31815 location_t location)
31816 {
31837 }
31839 /* OpenMP 4.5:
31840 vec:
31841 identifier [+/- integer]
31842 vec , identifier [+/- integer]
31843 */
31845 static tree
31847 tree list)
31848 {
31852 {
31855 }
31858 {
31865 else
31866 {
31867 t = cp_parser_lookup_name_simple
31872 id_loc);
31873 }
31879 {
31882 }
31886 {
31889 }
31893 {
31896 }
31899 add_to_vector:
31901 {
31905 }
31911 }
31914 {
31920 }
31922 }
31924 /* OpenMP 4.0:
31925 depend ( depend-kind : variable-list )
31927 depend-kind:
31928 in | out | inout
31930 OpenMP 4.5:
31931 depend ( source )
31933 depend ( sink : vec ) */
31935 static tree
31937 {
31945 {
31959 else
31961 }
31962 else
31968 {
31978 }
31985 else
31986 {
31992 }
31995 invalid_kind:
31997 resync_fail:
32002 }
32004 /* OpenMP 4.0:
32005 map ( map-kind : variable-list )
32006 map ( variable-list )
32008 map-kind:
32009 alloc | to | from | tofrom
32011 OpenMP 4.5:
32012 map-kind:
32013 alloc | to | from | tofrom | release | delete
32015 map ( always [,] map-kind: variable-list ) */
32017 static tree
32019 {
32028 {
32033 {
32036 nth++;
32042 {
32047 }
32048 }
32049 }
32053 {
32067 else
32068 {
32074 }
32077 }
32080 {
32084 }
32087 NULL);
32093 }
32095 /* OpenMP 4.0:
32096 device ( expression ) */
32098 static tree
32100 location_t location)
32101 {
32123 }
32125 /* OpenMP 4.0:
32126 dist_schedule ( static )
32127 dist_schedule ( static , expression ) */
32129 static tree
32131 location_t location)
32132 {
32145 {
32156 }
32161 location);
32165 invalid_kind:
32167 resync_fail:
32172 }
32174 /* OpenMP 4.0:
32175 proc_bind ( proc-bind-kind )
32177 proc-bind-kind:
32178 master | close | spread */
32180 static tree
32182 location_t location)
32183 {
32184 tree c;
32191 {
32201 else
32203 }
32204 else
32213 location);
32218 invalid_kind:
32220 resync_fail:
32225 }
32227 /* OpenACC:
32228 async [( int-expr )] */
32230 static tree
32232 {
32239 {
32248 }
32258 }
32260 /* Parse all OpenACC clauses. The set clauses allowed by the directive
32261 is a bitmask in MASK. Return the list of clauses found. */
32263 static tree
32267 {
32272 {
32273 location_t here;
32274 pragma_omp_clause c_kind;
32275 omp_clause_code code;
32286 {
32338 clauses);
32356 OMP_CLAUSE_INDEPENDENT,
32368 clauses);
32374 clauses);
32398 clauses);
32420 clauses);
32432 clauses);
32446 }
32451 {
32452 /* Remove the invalid clause(s) from the list to avoid
32453 confusing the rest of the compiler. */
32456 }
32457 }
32459 saw_error:
32466 }
32468 /* Parse all OpenMP clauses. The set clauses allowed by the directive
32469 is a bitmask in MASK. Return the list of clauses found; the result
32470 of clause default goes in *pdefault. */
32472 static tree
32476 {
32482 {
32483 pragma_omp_clause c_kind;
32494 {
32506 clauses);
32520 clauses);
32540 clauses);
32545 clauses);
32555 clauses);
32589 clauses);
32603 clauses);
32620 OMP_CLAUSE_NOTINBRANCH,
32629 {
32630 clause_not_first:
32634 }
32664 clauses);
32665 else
32675 clauses);
32693 {
32701 }
32744 clauses
32750 clauses
32762 }
32767 {
32768 /* Remove the invalid clause(s) from the list to avoid
32769 confusing the rest of the compiler. */
32772 }
32773 }
32774 saw_error:
32775 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
32776 no reason to skip to the end. */
32780 {
32783 else
32785 }
32787 }
32789 /* OpenMP 2.5:
32790 structured-block:
32791 statement
32793 In practice, we're also interested in adding the statement to an
32794 outer node. So it is convenient if we work around the fact that
32795 cp_parser_statement calls add_stmt. */
32797 static unsigned
32799 {
32802 /* Only move the values to IN_OMP_BLOCK if they weren't false.
32803 This preserves the "not within loop or switch" style error messages
32804 for nonsense cases like
32805 void foo() {
32806 #pragma omp single
32807 break;
32808 }
32809 */
32814 }
32816 static void
32818 {
32820 }
32822 static tree
32824 {
32832 }
32834 /* OpenMP 2.5:
32835 # pragma omp atomic new-line
32836 expression-stmt
32838 expression-stmt:
32839 x binop= expr | x++ | ++x | x-- | --x
32840 binop:
32841 +, *, -, /, &, ^, |, <<, >>
32843 where x is an lvalue expression with scalar type.
32845 OpenMP 3.1:
32846 # pragma omp atomic new-line
32847 update-stmt
32849 # pragma omp atomic read new-line
32850 read-stmt
32852 # pragma omp atomic write new-line
32853 write-stmt
32855 # pragma omp atomic update new-line
32856 update-stmt
32858 # pragma omp atomic capture new-line
32859 capture-stmt
32861 # pragma omp atomic capture new-line
32862 capture-block
32864 read-stmt:
32865 v = x
32866 write-stmt:
32867 x = expr
32868 update-stmt:
32869 expression-stmt | x = x binop expr
32870 capture-stmt:
32871 v = expression-stmt
32872 capture-block:
32873 { v = x; update-stmt; } | { update-stmt; v = x; }
32875 OpenMP 4.0:
32876 update-stmt:
32877 expression-stmt | x = x binop expr | x = expr binop x
32878 capture-stmt:
32879 v = update-stmt
32880 capture-block:
32881 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
32883 where x and v are lvalue expressions with scalar type. */
32885 static void
32887 {
32895 {
32900 {
32906 }
32907 }
32909 {
32921 else
32925 }
32927 {
32933 {
32938 {
32941 }
32942 }
32943 }
32947 {
32957 else
32962 {
32963 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
32964 opcode. */
32969 }
32973 {
32976 }
32977 else
32978 {
32984 }
32987 }
32989 restart:
32993 {
33000 /* FALLTHROUGH */
33010 /* FALLTHROUGH */
33025 /* Undo effects of boolean_increment for post {in,de}crement. */
33027 /* FALLTHRU */
33031 {
33032 /* Undo effects of boolean_increment. */
33034 {
33035 /* This is pre or post increment. */
33040 && !structured_block
33044 }
33045 }
33046 /* FALLTHRU */
33049 {
33084 {
33088 }
33091 {
33097 {
33102 }
33104 {
33116 {
33118 {
33123 }
33124 else
33126 }
33130 }
33133 {
33140 }
33144 }
33148 {
33151 {
33159 }
33161 {
33166 }
33201 }
33212 /* FALLTHROUGH */
33217 }
33224 }
33225 stmt_done:
33227 {
33238 }
33240 {
33243 }
33244 done:
33250 saw_error:
33253 {
33257 {
33261 }
33262 }
33263 }
33266 /* OpenMP 2.5:
33267 # pragma omp barrier new-line */
33269 static void
33271 {
33274 }
33276 /* OpenMP 2.5:
33277 # pragma omp critical [(name)] new-line
33278 structured-block
33280 OpenMP 4.5:
33281 # pragma omp critical [(name) [hint(expression)]] new-line
33282 structured-block */
33284 #define OMP_CRITICAL_CLAUSE_MASK \
33285 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
33287 static tree
33289 {
33293 {
33307 OMP_CRITICAL_CLAUSE_MASK,
33309 }
33310 else
33315 }
33317 /* OpenMP 2.5:
33318 # pragma omp flush flush-vars[opt] new-line
33320 flush-vars:
33321 ( variable-list ) */
33323 static void
33325 {
33331 }
33333 /* Helper function, to parse omp for increment expression. */
33335 static tree
33337 {
33342 {
33345 }
33348 {
33357 /* Fall through: OpenMP disallows NE_EXPR. */
33360 }
33362 /* If decl is an iterator, preserve LHS and RHS of the relational
33363 expr until finish_omp_for. */
33374 }
33376 /* Helper function, to parse omp for increment expression. */
33378 static tree
33380 {
33384 cp_id_kind idk;
33388 {
33397 }
33406 {
33411 }
33418 {
33422 }
33435 do
33436 {
33443 {
33445 {
33448 else
33450 tf_warning_or_error);
33451 }
33452 else
33455 }
33456 }
33460 {
33466 }
33467 else
33471 }
33473 /* Parse the initialization statement of either an OpenMP for loop or
33474 a Cilk Plus for loop.
33476 Return true if the resulting construct should have an
33477 OMP_CLAUSE_PRIVATE added to it. */
33479 static tree
33488 {
33494 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
33496 init-expr:
33497 var = lb
33498 integer-type var = lb
33499 random-access-iterator-type var = lb
33500 pointer-type var = lb
33501 */
33502 cp_decl_specifier_seq type_specifiers;
33504 /* First, try to parse as an initialized declaration. See
33505 cp_parser_condition, from whence the bulk of this is copied. */
33512 {
33513 /* If parsing a type specifier seq succeeded, then this
33514 MUST be a initialized declaration. */
33519 CP_PARSER_DECLARATOR_NAMED,
33530 else
33531 {
33541 {
33543 CPP_OPEN_PAREN))
33544 {
33548 else
33551 }
33552 else
33553 /* Trigger an error. */
33558 }
33562 {
33570 {
33573 auto_node);
33578 }
33581 asm_specification,
33582 LOOKUP_ONLYCONVERTING);
33585 {
33588 }
33589 else
33590 {
33593 {
33595 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
33597 {
33601 {
33605 }
33607 }
33609 {
33614 }
33615 }
33616 }
33618 }
33619 else
33620 {
33621 /* Consume '='. */
33625 non_class:
33628 else
33631 asm_specification,
33632 LOOKUP_ONLYCONVERTING);
33633 }
33637 }
33638 }
33639 else
33640 {
33641 cp_id_kind idk;
33642 /* If parsing a type specifier sequence failed, then
33643 this MUST be a simple expression. */
33652 && decl
33655 {
33666 {
33671 }
33676 }
33678 && decl
33681 {
33682 tree rhs;
33690 rhs,
33691 tf_warning_or_error));
33694 }
33695 else
33696 {
33701 {
33705 }
33706 }
33707 }
33709 }
33711 /* Parse the restricted form of the for statement allowed by OpenMP. */
33713 static tree
33716 {
33720 location_t loc_first;
33731 {
33734 }
33737 {
33743 }
33745 {
33748 {
33750 "%<linear%> clause may not be specified together "
33753 }
33754 else
33756 }
33769 {
33772 location_t loc;
33776 {
33779 }
33782 {
33785 }
33794 add_private_clause
33801 {
33804 {
33810 }
33811 else
33813 }
33820 {
33825 {
33829 }
33832 {
33833 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
33837 {
33840 }
33841 else
33842 {
33845 }
33847 }
33848 else
33849 {
33854 }
33855 }
33858 {
33859 tree c;
33861 {
33870 decl);
33874 decl);
33875 }
33877 {
33882 else
33887 {
33890 /* For linear, signal that we need to fill up
33891 the so far unknown linear step. */
33894 }
33895 }
33896 }
33905 {
33906 /* If decl is an iterator, preserve the operator on decl
33907 until finish_omp_for. */
33909 && ((processing_template_decl
33914 else
33918 }
33930 {
33933 }
33938 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
33939 in between the collapsed for loops to be still considered perfectly
33940 nested. Hopefully the final version clarifies this.
33941 For now handle (multiple) {'s and empty statements. */
33943 do
33944 {
33948 {
33950 bracecount++;
33951 }
33955 else
33956 {
33963 }
33964 }
33968 {
33971 }
33972 }
33977 /* Note that we saved the original contents of this flag when we entered
33978 the structured block, and so we don't need to re-save it here. */
33981 else
33984 /* Note that the grammar doesn't call for a structured block here,
33985 though the loop as a whole is a structured block. */
33992 else
33997 {
33999 {
34001 nbraces--;
34002 }
34005 else
34006 {
34008 {
34011 }
34016 }
34017 }
34020 {
34024 else
34026 }
34030 }
34032 /* Helper function for OpenMP parsing, split clauses and call
34033 finish_omp_clauses on each of the set of clauses afterwards. */
34035 static void
34038 {
34044 }
34046 /* OpenMP 4.0:
34047 #pragma omp simd simd-clause[optseq] new-line
34048 for-loop */
34050 #define OMP_SIMD_CLAUSE_MASK \
34051 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
34052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
34053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34054 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
34055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34056 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34057 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34058 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34060 static tree
34064 {
34075 {
34079 OMP_CLAUSE_ORDERED);
34081 {
34083 "%<ordered%> clause with parameter may not be specified "
34086 }
34087 }
34098 }
34100 /* OpenMP 2.5:
34101 #pragma omp for for-clause[optseq] new-line
34102 for-loop
34104 OpenMP 4.0:
34105 #pragma omp for simd for-simd-clause[optseq] new-line
34106 for-loop */
34108 #define OMP_FOR_CLAUSE_MASK \
34109 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34110 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34111 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34112 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34113 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34114 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
34115 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
34116 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34117 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34119 static tree
34123 {
34130 /* parallel for{, simd} disallows nowait clause, but for
34131 target {teams distribute ,}parallel for{, simd} it should be accepted. */
34134 /* Composite distribute parallel for{, simd} disallows ordered clause. */
34139 {
34144 {
34168 }
34169 }
34171 {
34174 }
34176 /* Composite distribute parallel for disallows linear clause. */
34183 {
34186 }
34197 }
34199 /* OpenMP 2.5:
34200 # pragma omp master new-line
34201 structured-block */
34203 static tree
34205 {
34209 }
34211 /* OpenMP 2.5:
34212 # pragma omp ordered new-line
34213 structured-block
34215 OpenMP 4.5:
34216 # pragma omp ordered ordered-clauses new-line
34217 structured-block */
34219 #define OMP_ORDERED_CLAUSE_MASK \
34220 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
34221 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
34223 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
34224 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
34226 static bool
34229 {
34233 {
34237 }
34240 {
34245 {
34247 {
34249 "%<depend%> clause may only be used in compound "
34253 }
34254 tree clauses
34256 OMP_ORDERED_DEPEND_CLAUSE_MASK,
34260 }
34261 }
34263 tree clauses
34269 }
34271 /* OpenMP 2.5:
34273 section-scope:
34274 { section-sequence }
34276 section-sequence:
34277 section-directive[opt] structured-block
34278 section-sequence section-directive structured-block */
34280 static tree
34282 {
34294 {
34298 }
34301 {
34309 {
34313 }
34315 {
34318 }
34323 }
34334 }
34336 /* OpenMP 2.5:
34337 # pragma omp sections sections-clause[optseq] newline
34338 sections-scope */
34340 #define OMP_SECTIONS_CLAUSE_MASK \
34341 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34345 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34347 static tree
34350 {
34362 {
34365 }
34372 }
34374 /* OpenMP 2.5:
34375 # pragma omp parallel parallel-clause[optseq] new-line
34376 structured-block
34377 # pragma omp parallel for parallel-for-clause[optseq] new-line
34378 structured-block
34379 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
34380 structured-block
34382 OpenMP 4.0:
34383 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
34384 structured-block */
34386 #define OMP_PARALLEL_CLAUSE_MASK \
34387 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34388 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34389 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34390 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34391 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
34393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
34395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
34397 static tree
34401 {
34408 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
34414 {
34422 if_p);
34426 if_p);
34429 block);
34434 }
34435 /* When combined with distribute, parallel has to be followed by for.
34436 #pragma omp target parallel is allowed though. */
34440 {
34444 }
34446 {
34449 }
34451 {
34455 {
34465 block);
34468 }
34469 }
34474 {
34477 }
34485 }
34487 /* OpenMP 2.5:
34488 # pragma omp single single-clause[optseq] new-line
34489 structured-block */
34491 #define OMP_SINGLE_CLAUSE_MASK \
34492 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
34495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34497 static tree
34499 {
34509 }
34511 /* OpenMP 3.0:
34512 # pragma omp task task-clause[optseq] new-line
34513 structured-block */
34515 #define OMP_TASK_CLAUSE_MASK \
34516 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34517 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
34518 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34519 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34520 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
34523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
34524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
34527 static tree
34529 {
34540 }
34542 /* OpenMP 3.0:
34543 # pragma omp taskwait new-line */
34545 static void
34547 {
34550 }
34552 /* OpenMP 3.1:
34553 # pragma omp taskyield new-line */
34555 static void
34557 {
34560 }
34562 /* OpenMP 4.0:
34563 # pragma omp taskgroup new-line
34564 structured-block */
34566 static tree
34568 {
34572 if_p));
34573 }
34576 /* OpenMP 2.5:
34577 # pragma omp threadprivate (variable-list) */
34579 static void
34581 {
34582 tree vars;
34588 }
34590 /* OpenMP 4.0:
34591 # pragma omp cancel cancel-clause[optseq] new-line */
34593 #define OMP_CANCEL_CLAUSE_MASK \
34594 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34595 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34596 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34597 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
34598 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
34600 static void
34602 {
34606 }
34608 /* OpenMP 4.0:
34609 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
34611 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
34612 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34613 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34614 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34615 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
34617 static void
34620 {
34621 tree clauses;
34625 {
34630 {
34633 }
34634 }
34636 {
34640 }
34643 {
34646 "%<#pragma omp cancellation point%> may only be used in"
34648 else
34652 }
34655 OMP_CANCELLATION_POINT_CLAUSE_MASK,
34657 pragma_tok);
34659 }
34661 /* OpenMP 4.0:
34662 #pragma omp distribute distribute-clause[optseq] new-line
34663 for-loop */
34665 #define OMP_DISTRIBUTE_CLAUSE_MASK \
34666 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34667 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34668 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34669 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
34670 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34672 static tree
34676 {
34685 {
34693 else
34696 {
34702 {
34706 else
34709 }
34715 else
34729 }
34730 }
34732 {
34735 }
34740 {
34743 }
34754 }
34756 /* OpenMP 4.0:
34757 # pragma omp teams teams-clause[optseq] new-line
34758 structured-block */
34760 #define OMP_TEAMS_CLAUSE_MASK \
34761 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34764 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34765 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
34766 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
34767 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
34769 static tree
34773 {
34782 {
34786 {
34810 }
34811 }
34813 {
34816 }
34821 {
34824 }
34832 }
34834 /* OpenMP 4.0:
34835 # pragma omp target data target-data-clause[optseq] new-line
34836 structured-block */
34838 #define OMP_TARGET_DATA_CLAUSE_MASK \
34839 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
34844 static tree
34846 {
34847 tree clauses
34852 {
34855 {
34872 "%<#pragma omp target data%> with map-type other "
34873 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
34877 }
34879 }
34882 {
34885 "%<#pragma omp target data%> must contain at least "
34888 }
34899 }
34901 /* OpenMP 4.5:
34902 # pragma omp target enter data target-enter-data-clause[optseq] new-line
34903 structured-block */
34905 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
34906 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34907 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34908 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34909 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34910 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34912 static tree
34915 {
34918 {
34923 {
34926 }
34927 }
34929 {
34933 }
34936 {
34938 "%<#pragma omp target enter data%> may only be "
34942 }
34944 tree clauses
34949 {
34952 {
34965 "%<#pragma omp target enter data%> with map-type other "
34969 }
34971 }
34974 {
34977 "%<#pragma omp target enter data%> must contain at least "
34980 }
34987 }
34989 /* OpenMP 4.5:
34990 # pragma omp target exit data target-enter-data-clause[optseq] new-line
34991 structured-block */
34993 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
34994 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34995 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34996 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34997 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34998 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35000 static tree
35003 {
35006 {
35011 {
35014 }
35015 }
35017 {
35021 }
35024 {
35026 "%<#pragma omp target exit data%> may only be "
35030 }
35032 tree clauses
35037 {
35040 {
35054 "%<#pragma omp target exit data%> with map-type other "
35055 "than %<from%>, %<release%> or %<delete%> on %<map%>"
35059 }
35061 }
35064 {
35067 "%<#pragma omp target exit data%> must contain at least "
35070 }
35077 }
35079 /* OpenMP 4.0:
35080 # pragma omp target update target-update-clause[optseq] new-line */
35082 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
35083 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
35084 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35085 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35087 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35088 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35090 static bool
35093 {
35095 {
35097 "%<#pragma omp target update%> may only be "
35101 }
35103 tree clauses
35108 {
35110 "%<#pragma omp target update%> must contain at least one "
35113 }
35121 }
35123 /* OpenMP 4.0:
35124 # pragma omp target target-clause[optseq] new-line
35125 structured-block */
35127 #define OMP_TARGET_CLAUSE_MASK \
35128 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35134 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35135 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
35136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
35138 static bool
35141 {
35145 {
35149 }
35152 {
35164 {
35172 {
35173 tree stmt;
35175 {
35178 OMP_TARGET_CLAUSE_MASK,
35183 OMP_TARGET_CLAUSE_MASK,
35188 OMP_TARGET_CLAUSE_MASK,
35193 }
35195 }
35200 {
35204 if_p);
35209 if_p);
35214 if_p);
35218 }
35224 {
35225 /* For combined target teams, ensure the num_teams and
35226 thread_limit clause expressions are evaluated on the host,
35227 before entering the target construct. */
35228 tree c;
35234 {
35243 OMP_CLAUSE_FIRSTPRIVATE);
35248 }
35249 }
35258 }
35260 {
35263 }
35265 {
35269 }
35271 {
35275 }
35277 {
35281 }
35283 {
35286 }
35287 }
35302 check_clauses:
35304 {
35307 {
35321 "%<#pragma omp target%> with map-type other "
35322 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35326 }
35328 }
35330 }
35332 /* OpenACC 2.0:
35333 # pragma acc cache (variable-list) new-line
35334 */
35336 static tree
35338 {
35353 }
35355 /* OpenACC 2.0:
35356 # pragma acc data oacc-data-clause[optseq] new-line
35357 structured-block */
35359 #define OACC_DATA_CLAUSE_MASK \
35360 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35362 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35363 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35364 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35368 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35369 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35370 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35372 static tree
35374 {
35387 }
35389 /* OpenACC 2.0:
35390 # pragma acc host_data <clauses> new-line
35391 structured-block */
35393 #define OACC_HOST_DATA_CLAUSE_MASK \
35394 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
35396 static tree
35398 {
35411 }
35413 /* OpenACC 2.0:
35414 # pragma acc declare oacc-data-clause[optseq] new-line
35415 */
35417 #define OACC_DECLARE_CLAUSE_MASK \
35418 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35419 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35420 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35421 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35422 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35423 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
35424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
35425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35427 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35428 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35429 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35431 static tree
35433 {
35442 {
35446 }
35449 {
35453 {
35457 }
35460 {
35472 {
35474 "%qD must be a global variable in"
35476 decl);
35479 }
35484 {
35488 }
35490 {
35492 "invalid use of %<extern%> variable %qD "
35496 }
35498 {
35500 "invalid use of %<global%> variable %qD "
35504 }
35506 }
35511 {
35516 }
35519 {
35520 tree id;
35524 else
35530 {
35533 {
35536 {
35540 }
35541 }
35542 }
35543 }
35544 }
35557 }
35559 /* OpenACC 2.0:
35560 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
35562 or
35564 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
35566 LOC is the location of the #pragma token.
35567 */
35569 #define OACC_ENTER_DATA_CLAUSE_MASK \
35570 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35571 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35572 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35573 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35574 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35575 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35576 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35578 #define OACC_EXIT_DATA_CLAUSE_MASK \
35579 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35580 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35581 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35582 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
35583 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35585 static tree
35588 {
35593 {
35599 }
35604 {
35608 }
35615 else
35620 {
35624 }
35632 }
35634 /* OpenACC 2.0:
35635 # pragma acc loop oacc-loop-clause[optseq] new-line
35636 structured-block */
35638 #define OACC_LOOP_CLAUSE_MASK \
35639 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
35640 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
35643 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
35644 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
35645 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
35646 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
35647 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
35648 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
35650 static tree
35653 {
35662 {
35668 }
35677 }
35679 /* OpenACC 2.0:
35680 # pragma acc kernels oacc-kernels-clause[optseq] new-line
35681 structured-block
35683 or
35685 # pragma acc parallel oacc-parallel-clause[optseq] new-line
35686 structured-block
35687 */
35689 #define OACC_KERNELS_CLAUSE_MASK \
35690 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35691 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35693 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35701 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35702 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35703 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35705 #define OACC_PARALLEL_CLAUSE_MASK \
35706 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35707 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35709 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35710 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35711 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35712 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35713 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
35714 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35715 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
35716 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
35717 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35718 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35719 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35720 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35721 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35722 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35724 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
35725 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35727 static tree
35730 {
35731 omp_clause_mask mask;
35734 {
35747 }
35750 {
35754 {
35757 tree clauses;
35759 if_p);
35761 }
35762 }
35771 }
35773 /* OpenACC 2.0:
35774 # pragma acc update oacc-update-clause[optseq] new-line
35775 */
35777 #define OACC_UPDATE_CLAUSE_MASK \
35778 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35779 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
35780 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
35781 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35782 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
35783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
35785 static tree
35787 {
35794 {
35796 "%<#pragma acc update%> must contain at least one "
35799 }
35807 }
35809 /* OpenACC 2.0:
35810 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
35812 LOC is the location of the #pragma token.
35813 */
35815 #define OACC_WAIT_CLAUSE_MASK \
35816 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
35818 static tree
35820 {
35834 }
35836 /* OpenMP 4.0:
35837 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
35839 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
35840 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
35844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
35845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
35847 static void
35850 {
35852 cp_omp_declare_simd_data data;
35854 {
35859 /* It is safe to take the address of a local variable; it will only be
35860 used while this scope is live. */
35862 }
35864 /* Store away all pragma tokens. */
35876 {
35880 {
35893 }
35898 "%<#pragma omp declare simd%> not immediately followed by "
35902 }
35903 }
35905 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
35906 This function is modelled similar to the late parsing of omp declare
35907 simd. */
35909 static tree
35911 {
35918 {
35920 "used in the same function marked as a Cilk Plus SIMD-enabled "
35926 }
35928 {
35932 }
35937 {
35944 NULL);
35958 }
35964 }
35966 /* Finalize #pragma omp declare simd clauses after direct declarator has
35967 been parsed, and put that into "omp declare simd" attribute. */
35969 static tree
35971 {
35977 {
35981 }
35986 {
36004 }
36008 }
36011 /* OpenMP 4.0:
36012 # pragma omp declare target new-line
36013 declarations and definitions
36014 # pragma omp end declare target new-line
36016 OpenMP 4.5:
36017 # pragma omp declare target ( extended-list ) new-line
36019 # pragma omp declare target declare-target-clauses[seq] new-line */
36021 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
36022 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36023 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
36025 static void
36027 {
36030 clauses
36034 {
36036 clauses);
36039 }
36040 else
36041 {
36045 }
36048 "%<#pragma omp declare target%> with clauses in between "
36049 "%<#pragma omp declare target%> without clauses and "
36052 {
36058 {
36061 }
36062 else
36065 {
36067 "%qD specified both in declare target %<link%> and %<to%>"
36070 }
36072 {
36076 {
36079 {
36083 }
36084 }
36085 }
36086 }
36087 }
36089 static void
36091 {
36094 {
36097 }
36099 {
36103 {
36106 }
36109 else
36110 {
36114 }
36115 }
36116 else
36117 {
36121 }
36125 "%<#pragma omp end declare target%> without corresponding "
36127 else
36129 }
36131 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
36132 expression and optional initializer clause of
36133 #pragma omp declare reduction. We store the expression(s) as
36134 either 3, 6 or 7 special statements inside of the artificial function's
36135 body. The first two statements are DECL_EXPRs for the artificial
36136 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
36137 expression that uses those variables.
36138 If there was any INITIALIZER clause, this is followed by further statements,
36139 the fourth and fifth statements are DECL_EXPRs for the artificial
36140 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
36141 constructor variant (first token after open paren is not omp_priv),
36142 then the sixth statement is a statement with the function call expression
36143 that uses the OMP_PRIV and optionally OMP_ORIG variable.
36144 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
36145 to initialize the OMP_PRIV artificial variable and there is seventh
36146 statement, a DECL_EXPR of the OMP_PRIV statement again. */
36148 static bool
36150 {
36162 tree combiner;
36177 {
36180 }
36183 {
36190 {
36193 }
36209 {
36213 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
36217 == CPP_CLOSE_PAREN
36220 {
36224 }
36229 }
36230 else
36231 {
36247 {
36252 }
36254 tree arg;
36267 }
36278 }
36284 }
36286 /* OpenMP 4.0
36287 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36288 initializer-clause[opt] new-line
36290 initializer-clause:
36291 initializer (omp_priv initializer)
36292 initializer (function-name (argument-list)) */
36294 static void
36297 {
36307 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
36314 {
36346 }
36358 /* Types may not be defined in declare reduction type list. */
36361 parser->type_definition_forbidden_message
36367 saved_colon_doesnt_start_class_def_p
36372 {
36376 ;
36397 else
36402 else
36404 }
36406 /* Restore the saved message. */
36409 parser->colon_doesnt_start_class_def_p
36414 {
36415 fail:
36418 }
36424 {
36425 tree fntype
36428 NULL_TREE);
36448 {
36453 }
36455 {
36457 {
36466 }
36473 }
36474 else
36475 {
36478 }
36481 else
36484 {
36487 }
36489 {
36492 else
36497 }
36502 else
36503 {
36512 }
36519 }
36523 done:
36524 /* Free any declarators allocated. */
36526 }
36528 /* OpenMP 4.0
36529 #pragma omp declare simd declare-simd-clauses[optseq] new-line
36530 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36531 initializer-clause[opt] new-line
36532 #pragma omp declare target new-line */
36534 static void
36537 {
36539 {
36544 {
36547 context);
36549 }
36552 {
36555 context);
36557 }
36559 {
36562 }
36564 {
36568 }
36569 }
36573 }
36575 /* OpenMP 4.5:
36576 #pragma omp taskloop taskloop-clause[optseq] new-line
36577 for-loop
36579 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
36580 for-loop */
36582 #define OMP_TASKLOOP_CLAUSE_MASK \
36583 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36584 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36585 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
36588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
36589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
36590 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
36591 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
36592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
36594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
36595 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
36596 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
36598 static tree
36602 {
36611 {
36616 {
36640 }
36641 }
36643 {
36646 }
36651 {
36654 }
36660 if_p);
36666 }
36669 /* OpenACC 2.0:
36670 # pragma acc routine oacc-routine-clause[optseq] new-line
36671 function-definition
36673 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
36674 */
36676 #define OACC_ROUTINE_CLAUSE_MASK \
36677 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36678 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36679 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36680 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
36683 /* Parse the OpenACC routine pragma. This has an optional '( name )'
36684 component, which must resolve to a declared namespace-scope
36685 function. The clauses are either processed directly (for a named
36686 function), or defered until the immediatley following declaration
36687 is parsed. */
36689 static void
36692 {
36694 /* The checking for "another pragma following this one" in the "no optional
36695 '( name )'" case makes sure that we dont re-enter. */
36698 cp_oacc_routine_data data;
36704 /* It is safe to take the address of a local variable; it will only be
36705 used while this scope is live. */
36708 /* Look for optional '( name )'. */
36710 {
36713 /* We parse the name as an id-expression. If it resolves to
36714 anything other than a non-overloaded function at namespace
36715 scope, it's an error. */
36729 {
36733 }
36735 data.clauses
36743 {
36748 }
36750 /* Perhaps we should use the same rule as declarations in different
36751 namespaces? */
36753 {
36758 }
36761 {
36765 }
36769 }
36771 {
36772 /* Store away all pragma tokens. */
36783 /* Emit a helpful diagnostic if there's another pragma following this
36784 one. */
36786 {
36789 /* ..., and then just keep going. */
36791 }
36793 /* We only have to consider the pragma_external case here. */
36798 else
36801 }
36802 }
36804 /* Finalize #pragma acc routine clauses after direct declarator has
36805 been parsed. */
36807 static tree
36809 {
36814 {
36816 "%<#pragma acc routine%> not immediately followed by "
36819 }
36836 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
36837 fndecl_seen. */
36840 }
36842 /* Apply any saved OpenACC routine clauses to a just-parsed
36843 declaration. */
36845 static void
36847 {
36849 {
36850 /* Keep going if we're in error reporting mode. */
36856 {
36858 "%<#pragma acc routine%> not immediately followed by"
36862 }
36864 {
36867 }
36870 {
36875 }
36878 {
36884 }
36886 /* Process the routine's dimension clauses. */
36890 /* Add an "omp declare target" attribute. */
36895 /* Don't unset parser->oacc_routine here: we may still need it to
36896 diagnose wrong usage. But, remember that we've used this "#pragma acc
36897 routine". */
36899 }
36900 }
36902 /* Main entry point to OpenMP statement pragmas. */
36904 static void
36906 {
36907 tree stmt;
36912 {
36935 if_p);
36940 if_p);
36957 if_p);
36962 if_p);
36970 if_p);
36979 if_p);
36993 if_p);
36998 if_p);
37002 }
37005 }
37006 \f
37007 /* Transactional Memory parsing routines. */
37009 /* Parse a transaction attribute.
37011 txn-attribute:
37012 attribute
37013 [ [ identifier ] ]
37015 We use this instead of cp_parser_attributes_opt for transactions to avoid
37016 the pedwarn in C++98 mode. */
37018 static tree
37020 {
37035 {
37039 /* For keywords, use the canonical spelling,
37040 not the parsed identifier. */
37044 }
37045 else
37049 error1:
37052 }
37054 /* Parse a __transaction_atomic or __transaction_relaxed statement.
37056 transaction-statement:
37057 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
37058 compound-statement
37059 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
37060 */
37062 static tree
37064 {
37075 else
37076 {
37080 }
37082 /* Parse a noexcept specification. */
37086 {
37087 /* cancel-and-throw is unimplemented. */
37090 }
37091 else
37094 /* Keep track if we're in the lexical scope of an outer transaction. */
37106 }
37108 /* Parse a __transaction_atomic or __transaction_relaxed expression.
37110 transaction-expression:
37111 __transaction_atomic txn-noexcept-spec[opt] ( expression )
37112 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
37113 */
37115 static tree
37117 {
37130 keyword == RID_TRANSACTION_RELAXED
37144 /* Set this early. This might mean that we allow transaction_cancel in
37145 an expression that we find out later actually has to be a constexpr.
37146 However, we expect that cxx_constant_value will be able to deal with
37147 this; also, if the noexcept has no constexpr, then what we parse next
37148 really is a transaction's body. */
37151 /* Parse a noexcept specification. */
37157 {
37164 }
37165 else
37166 {
37167 /* The only expression that is available got parsed for the noexcept
37168 already. noexcept is true then. */
37171 }
37180 }
37182 /* Parse a function-transaction-block.
37184 function-transaction-block:
37185 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
37186 function-body
37187 __transaction_atomic txn-attribute[opt] function-try-block
37188 __transaction_relaxed ctor-initializer[opt] function-body
37189 __transaction_relaxed function-try-block
37190 */
37192 static bool
37194 {
37210 else
37211 {
37215 }
37223 else
37224 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
37232 }
37234 /* Parse a __transaction_cancel statement.
37236 cancel-statement:
37237 __transaction_cancel txn-attribute[opt] ;
37238 __transaction_cancel txn-attribute[opt] throw-expression ;
37240 ??? Cancel and throw is not yet implemented. */
37242 static tree
37244 {
37250 RT_TRANSACTION_CANCEL);
37257 /* ??? Parse cancel-and-throw here. */
37262 {
37266 }
37268 {
37272 }
37274 {
37277 {
37283 }
37284 }
37286 {
37290 }
37296 }
37297 \f
37298 /* The parser. */
37302 \f
37303 /* Special handling for the first token or line in the file. The first
37304 thing in the file might be #pragma GCC pch_preprocess, which loads a
37305 PCH file, which is a GC collection point. So we need to handle this
37306 first pragma without benefit of an existing lexer structure.
37308 Always returns one token to the caller in *FIRST_TOKEN. This is
37309 either the true first token of the file, or the first token after
37310 the initial pragma. */
37312 static void
37314 {
37323 {
37330 }
37331 else
37334 /* Skip to the end of the pragma. */
37338 /* Now actually load the PCH file. */
37342 /* Read one more token to return to our caller. We have to do this
37343 after reading the PCH file in, since its pointers have to be
37344 live. */
37346 }
37348 /* Parses the grainsize pragma for the _Cilk_for statement.
37349 Syntax:
37350 #pragma cilk grainsize = <VALUE>. */
37352 static void
37354 {
37356 {
37361 {
37364 }
37366 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
37369 else
37371 "%<#pragma cilk grainsize%> is not followed by "
37374 }
37376 }
37378 /* Normal parsing of a pragma token. Here we can (and must) use the
37379 regular lexer. */
37381 static bool
37383 {
37386 tree stmt;
37397 {
37405 {
37415 }
37420 {
37430 }
37435 {
37441 "%<#pragma omp taskwait%> may only be "
37446 }
37451 {
37457 "%<#pragma omp taskyield%> may only be "
37462 }
37467 {
37473 "%<#pragma omp cancel%> may only be "
37478 }
37499 {
37503 }
37556 "%<#pragma omp section%> may only be used in "
37561 {
37563 {
37567 }
37574 {
37577 }
37580 }
37584 {
37588 }
37596 {
37600 }
37602 /* Ignore the pragma if Cilk Plus is not enabled. */
37604 {
37607 }
37608 else
37609 {
37613 }
37620 bad_stmt:
37623 }
37627 }
37629 /* The interface the pragma parsers have to the lexer. */
37631 enum cpp_ttype
37633 {
37645 else
37646 {
37650 }
37653 }
37655 \f
37656 /* External interface. */
37658 /* Parse one entire translation unit. */
37660 void
37662 {
37675 }
37677 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
37678 vectorlength clause:
37679 Syntax:
37680 vectorlength ( constant-expression ) */
37682 static tree
37685 {
37687 tree expr;
37688 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
37689 safelen clause. Thus, vectorlength is represented as OMP 4.0
37690 safelen. For SIMD-enabled function it is represented by OMP 4.0
37691 simdlen. */
37694 loc);
37695 else
37697 loc);
37705 /* If expr == error_mark_node, then don't emit any errors nor
37706 create a clause. if any of the above functions returns
37707 error mark node then they would have emitted an error message. */
37709 ;
37717 else
37718 {
37719 tree c;
37721 {
37726 }
37727 else
37728 {
37733 }
37734 }
37739 }
37741 /* Handles the Cilk Plus #pragma simd linear clause.
37742 Syntax:
37743 linear ( simd-linear-variable-list )
37745 simd-linear-variable-list:
37746 simd-linear-variable
37747 simd-linear-variable-list , simd-linear-variable
37749 simd-linear-variable:
37750 id-expression
37751 id-expression : simd-linear-step
37753 simd-linear-step:
37754 conditional-expression */
37756 static tree
37758 {
37764 {
37768 }
37773 {
37776 {
37780 }
37787 {
37791 }
37792 else
37793 {
37797 /* If present, parse the linear step. Otherwise, assume the default
37798 value of 1. */
37800 {
37807 {
37808 /* If an error has occurred, then the whole pragma is
37809 considered ill-formed. Thus, no reason to keep
37810 parsing. */
37813 }
37821 else
37823 "step size must be an integer constant "
37825 }
37827 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
37833 }
37838 else
37839 {
37844 }
37845 }
37849 }
37851 /* Returns the name of the next clause. If the clause is not
37852 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
37853 token is not consumed. Otherwise, the appropriate enum from the
37854 pragma_simd_clause is returned and the token is consumed. */
37856 static pragma_omp_clause
37858 {
37859 pragma_omp_clause clause_type;
37876 else
37881 }
37883 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
37885 static tree
37887 {
37892 {
37893 pragma_omp_clause c_kind;
37900 /* Use the OpenMP 4.0 equivalent function. */
37903 /* Use the OpenMP 4.0 equivalent function. */
37905 clauses);
37907 /* Use the OMP 4.0 equivalent function. */
37909 clauses);
37911 /* Use the OMP 4.0 equivalent function. */
37913 else
37914 {
37918 }
37919 }
37925 else
37927 }
37929 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
37931 static void
37933 {
37940 {
37944 }
37953 }
37955 /* Main entry-point for parsing Cilk Plus _Cilk_for
37956 loops. The return value is error_mark_node
37957 when errors happen and CILK_FOR tree on success. */
37959 static tree
37961 {
37976 else
37982 }
37984 /* Create an identifier for a generic parameter type (a synthesized
37985 template parameter implied by `auto' or a concept identifier). */
37988 static tree
37990 {
37994 }
37996 /* Predicate that behaves as is_auto_or_concept but matches the parent
37997 node of the generic type rather than the generic type itself. This
37998 allows for type transformation in add_implicit_template_parms. */
38002 {
38004 }
38006 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38007 (creating a new template parameter list if necessary). Returns the newly
38008 created template type parm. */
38010 static tree
38012 {
38015 /* Before committing to modifying any scope, if we're in an
38016 implicit template scope, and we're trying to synthesize a
38017 constrained parameter, try to find a previous parameter with
38018 the same name. This is the same-type rule for abbreviated
38019 function templates.
38021 NOTE: We can generate implicit parameters when tentatively
38022 parsing a nested name specifier, only to reject that parse
38023 later. However, matching the same template-id as part of a
38024 direct-declarator should generate an identical template
38025 parameter, so this rule will merge them. */
38027 {
38030 {
38032 {
38035 /* Return the TEMPLATE_PARM_INDEX. */
38038 }
38040 }
38041 }
38043 /* We are either continuing a function template that already contains implicit
38044 template parameters, creating a new fully-implicit function template, or
38045 extending an existing explicit function template with implicit template
38046 parameters. */
38054 {
38058 }
38059 else
38060 {
38061 /* Roll back to the existing template parameter scope (in the case of
38062 extending an explicit function template) or introduce a new template
38063 parameter scope ahead of the function parameter scope (or class scope
38064 in the case of out-of-line member definitions). The function scope is
38065 added back after template parameter synthesis below. */
38070 {
38073 }
38075 {
38076 /* If not defining a class, then any class scope is a scope level in
38077 an out-of-line member definition. In this case simply wind back
38078 beyond the first such scope to inject the template parameter list.
38079 Otherwise wind back to the class being defined. The latter can
38080 occur in class member friend declarations such as:
38082 class A {
38083 void foo (auto);
38084 };
38085 class B {
38086 friend void A::foo (auto);
38087 };
38089 The template parameter list synthesized for the friend declaration
38090 must be injected in the scope of 'B'. This can also occur in
38091 erroneous cases such as:
38093 struct A {
38094 struct B {
38095 void foo (auto);
38096 };
38097 void B::foo (auto) {}
38098 };
38100 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38101 but, nevertheless, the template parameter list synthesized for the
38102 declarator should be injected into the scope of 'A' as if the
38103 ill-formed template was specified explicitly. */
38106 {
38109 }
38110 }
38116 {
38117 /* Introduce a new template parameter list for implicit template
38118 parameters. */
38122 parser->implicit_template_scope
38129 }
38130 else
38131 {
38132 /* Synthesize implicit template parameters at the end of the explicit
38133 template parameter list. */
38140 parser->implicit_template_parms
38142 }
38143 }
38145 /* Synthesize a new template parameter and track the current template
38146 parameter chain with implicit_template_parms. */
38150 tree synth_tmpl_parm;
38154 synth_tmpl_parm
38157 synth_tmpl_parm
38159 else
38160 {
38164 }
38166 // Attach the constraint to the parm before processing.
38169 tree new_parm
38171 input_location,
38172 node,
38176 // Chain the new parameter to the list of implicit parameters.
38178 parser->implicit_template_parms
38180 else
38185 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38188 /* If creating a fully implicit function template, start the new implicit
38189 template parameter list with this synthesized type, otherwise grow the
38190 current template parameter list. */
38193 {
38200 }
38201 else
38202 {
38207 }
38209 // If the new parameter was constrained, we need to add that to the
38210 // constraints in the template parameter list.
38212 {
38216 }
38221 }
38223 /* Finish the declaration of a fully implicit function template. Such a
38224 template has no explicit template parameter list so has not been through the
38225 normal template head and tail processing. synthesize_implicit_template_parm
38226 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
38227 provided if the declaration is a class member such that its template
38228 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
38229 form is returned. Otherwise NULL_TREE is returned. */
38231 static tree
38233 {
38238 {
38242 }
38252 }