| blob | 574ffba3ecec5e6246f458533547d10c834c7f9c |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2015 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/>. */
52 \f
53 /* The lexer. */
55 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
56 and c-lex.c) and the C++ parser. */
59 {
61 };
63 /* The various kinds of non integral constant we encounter. */
65 NIC_NONE,
66 /* floating-point literal */
67 NIC_FLOAT,
68 /* %<this%> */
69 NIC_THIS,
70 /* %<__FUNCTION__%> */
71 NIC_FUNC_NAME,
72 /* %<__PRETTY_FUNCTION__%> */
73 NIC_PRETTY_FUNC,
74 /* %<__func__%> */
75 NIC_C99_FUNC,
76 /* "%<va_arg%> */
77 NIC_VA_ARG,
78 /* a cast */
79 NIC_CAST,
80 /* %<typeid%> operator */
81 NIC_TYPEID,
82 /* non-constant compound literals */
83 NIC_NCC,
84 /* a function call */
85 NIC_FUNC_CALL,
86 /* an increment */
87 NIC_INC,
88 /* an decrement */
89 NIC_DEC,
90 /* an array reference */
91 NIC_ARRAY_REF,
92 /* %<->%> */
93 NIC_ARROW,
94 /* %<.%> */
95 NIC_POINT,
96 /* the address of a label */
97 NIC_ADDR_LABEL,
98 /* %<*%> */
99 NIC_STAR,
100 /* %<&%> */
101 NIC_ADDR,
102 /* %<++%> */
103 NIC_PREINCREMENT,
104 /* %<--%> */
105 NIC_PREDECREMENT,
106 /* %<new%> */
107 NIC_NEW,
108 /* %<delete%> */
109 NIC_DEL,
110 /* calls to overloaded operators */
111 NIC_OVERLOADED,
112 /* an assignment */
113 NIC_ASSIGNMENT,
114 /* a comma operator */
115 NIC_COMMA,
116 /* a call to a constructor */
117 NIC_CONSTRUCTOR,
118 /* a transaction expression */
119 NIC_TRANSACTION
122 /* The various kinds of errors about name-lookup failing. */
124 /* NULL */
125 NLE_NULL,
126 /* is not a type */
127 NLE_TYPE,
128 /* is not a class or namespace */
129 NLE_CXX98,
130 /* is not a class, namespace, or enumeration */
131 NLE_NOT_CXX98
134 /* The various kinds of required token */
136 RT_NONE,
158 /* The type is CPP_KEYWORD */
187 RT_TRANSACTION_CANCEL /* __transaction_cancel */
190 /* Prototypes. */
196 static void cp_lexer_destroy
198 static int cp_lexer_saving_tokens
202 static void cp_lexer_get_preprocessor_token
210 static bool cp_lexer_next_token_is_not
212 static bool cp_lexer_next_token_is_keyword
216 static void cp_lexer_purge_token
218 static void cp_lexer_purge_tokens_after
220 static void cp_lexer_save_tokens
222 static void cp_lexer_commit_tokens
224 static void cp_lexer_rollback_tokens
226 static void cp_lexer_print_token
230 static void cp_lexer_start_debugging
232 static void cp_lexer_stop_debugging
238 static void cp_parser_initial_pragma
241 static tree cp_literal_operator_id
244 static void cp_parser_cilk_simd
246 static tree cp_parser_cilk_for
248 static bool cp_parser_omp_declare_reduction_exprs
250 static tree cp_parser_cilk_simd_vectorlength
253 /* Manifest constants. */
254 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
255 #define CP_SAVED_TOKEN_STACK 5
257 /* Variables. */
259 /* The stream to which debugging output should be written. */
262 /* Nonzero if we are parsing an unevaluated operand: an operand to
263 sizeof, typeof, or alignof. */
266 /* Dump up to NUM tokens in BUFFER to FILE starting with token
267 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
268 first token in BUFFER. If NUM is 0, dump all the tokens. If
269 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
270 highlighted by surrounding it in [[ ]]. */
272 static void
276 {
293 {
296 }
301 {
308 nprinted++;
318 {
328 }
329 }
332 {
335 }
338 }
341 /* Dump all tokens in BUFFER to stderr. */
343 void
345 {
347 }
349 DEBUG_FUNCTION void
351 {
353 }
355 DEBUG_FUNCTION void
357 {
360 else
362 }
365 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
366 description for T. */
368 static void
370 {
372 {
375 }
376 }
379 /* Dump parser context C to FILE. */
381 static void
383 {
388 }
391 /* Print the stack of parsing contexts to FILE starting with FIRST. */
393 static void
395 {
401 {
404 }
405 }
408 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
410 static void
412 {
415 }
418 /* Print an unparsed function entry UF to FILE. */
420 static void
422 {
425 tree fn;
430 i++)
431 {
437 }
442 {
445 }
451 {
454 }
456 }
459 /* Print the stack of unparsed member functions S to FILE. */
461 static void
464 {
470 {
473 }
474 }
477 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
478 the given PARSER. If FILE is NULL, the output is printed on stderr. */
480 static void
482 {
494 next_token);
495 }
498 /* Dump debugging information for the given PARSER. If FILE is NULL,
499 the output is printed on stderr. */
501 void
503 {
506 expanded_location eloc;
584 }
586 DEBUG_FUNCTION void
588 {
590 }
592 DEBUG_FUNCTION void
594 {
597 else
599 }
601 /* Allocate memory for a new lexer object and return it. */
605 {
610 /* Allocate the memory. */
613 /* Initially we are not debugging. */
618 /* Create the buffer. */
622 }
625 /* Create a new main C++ lexer, the lexer that gets tokens from the
626 preprocessor. */
630 {
632 cp_token token;
634 /* It's possible that parsing the first pragma will load a PCH file,
635 which is a GC collection point. So we have to do that before
636 allocating any memory. */
641 /* Put the first token in the buffer. */
644 /* Get the remaining tokens from the preprocessor. */
646 {
649 }
658 /* Subsequent preprocessor diagnostics should use compiler
659 diagnostic functions to get the compiler source location. */
664 }
666 /* Create a new lexer whose token stream is primed with the tokens in
667 CACHE. When these tokens are exhausted, no new tokens will be read. */
671 {
676 /* We do not own the buffer. */
683 /* Initially we are not debugging. */
688 }
690 /* Frees all resources associated with LEXER. */
692 static void
694 {
698 }
700 /* Returns nonzero if debugging information should be output. */
704 {
706 }
711 {
715 }
719 {
721 }
725 {
727 }
731 {
734 else
736 }
740 {
744 }
746 /* nonzero if we are presently saving tokens. */
750 {
752 }
754 /* Store the next token from the preprocessor in *TOKEN. Return true
755 if we reach EOF. If LEXER is NULL, assume we are handling an
756 initial #pragma pch_preprocess, and thus want the lexer to return
757 processed strings. */
759 static void
761 {
764 /* Get a new token from the preprocessor. */
765 token->type
773 /* On some systems, some header files are surrounded by an
774 implicit extern "C" block. Set a flag in the token if it
775 comes from such a header. */
780 /* Check to see if this token is a keyword. */
782 {
784 {
785 /* Mark this token as a keyword. */
787 /* Record which keyword. */
789 }
790 else
791 {
795 {
796 /* Warn about the C++0x keyword (but still treat it as
797 an identifier). */
802 /* Clear out the C_RID_CODE so we don't warn about this
803 particular identifier-turned-keyword again. */
805 }
808 }
809 }
811 {
812 /* This only happens in Objective-C++; it must be a keyword. */
815 {
816 /* Replace 'class' with '@class', 'private' with '@private',
817 etc. This prevents confusion with the C++ keyword
818 'class', and makes the tokens consistent with other
819 Objective-C 'AT' keywords. For example '@class' is
820 reported as RID_AT_CLASS which is consistent with
821 '@synchronized', which is reported as
822 RID_AT_SYNCHRONIZED.
823 */
832 }
833 }
835 {
836 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
840 }
841 }
843 /* Update the globals input_location and the input file stack from TOKEN. */
846 {
848 {
850 }
851 }
853 /* Update the globals input_location and the input file stack from LEXER. */
856 {
859 }
861 /* Return a pointer to the next token in the token stream, but do not
862 consume it. */
866 {
868 {
872 }
874 }
876 /* Return true if the next token has the indicated TYPE. */
880 {
882 }
884 /* Return true if the next token does not have the indicated TYPE. */
888 {
890 }
892 /* Return true if the next token is the indicated KEYWORD. */
896 {
898 }
902 {
904 }
908 {
910 }
912 /* Return true if the next token is not the indicated KEYWORD. */
916 {
918 }
920 /* Return true if the next token is a keyword for a decl-specifier. */
922 static bool
924 {
929 {
930 /* auto specifier: storage-class-specifier in C++,
931 simple-type-specifier in C++0x. */
933 /* Storage classes. */
939 /* Elaborated type specifiers. */
945 /* Simple type specifiers. */
959 /* GNU extensions. */
962 /* C++0x extensions. */
973 }
974 }
976 /* Returns TRUE iff the token T begins a decltype type. */
978 static bool
980 {
983 }
985 /* Returns TRUE iff the next token begins a decltype type. */
987 static bool
989 {
992 }
994 /* Return a pointer to the Nth token in the token stream. If N is 1,
995 then this is precisely equivalent to cp_lexer_peek_token (except
996 that it is not inline). One would like to disallow that case, but
997 there is one case (cp_parser_nth_token_starts_template_id) where
998 the caller passes a variable for N and it might be 1. */
1002 {
1005 /* N is 1-based, not zero-based. */
1016 {
1019 {
1022 }
1026 }
1029 {
1032 }
1035 }
1037 /* Return the next token, and advance the lexer's next_token pointer
1038 to point to the next non-purged token. */
1042 {
1048 do
1049 {
1052 {
1055 }
1057 }
1062 /* Provide debugging output. */
1064 {
1068 }
1071 }
1073 /* Permanently remove the next token from the token stream, and
1074 advance the next_token pointer to refer to the next non-purged
1075 token. */
1077 static void
1079 {
1088 do
1089 {
1090 tok++;
1092 {
1095 }
1096 }
1099 }
1101 /* Permanently remove all tokens after TOK, up to, but not
1102 including, the token that will be returned next by
1103 cp_lexer_peek_token. */
1105 static void
1107 {
1116 {
1121 }
1122 }
1124 /* Begin saving tokens. All tokens consumed after this point will be
1125 preserved. */
1127 static void
1129 {
1130 /* Provide debugging output. */
1135 }
1137 /* Commit to the portion of the token stream most recently saved. */
1139 static void
1141 {
1142 /* Provide debugging output. */
1147 }
1149 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1150 to the token stream. Stop saving tokens. */
1152 static void
1154 {
1155 /* Provide debugging output. */
1160 }
1162 /* RAII wrapper around the above functions, with sanity checking. Creating
1163 a variable saves tokens, which are committed when the variable is
1164 destroyed unless they are explicitly rolled back by calling the rollback
1165 member function. */
1167 struct saved_token_sentinel
1168 {
1173 {
1176 }
1178 {
1181 }
1183 {
1187 }
1188 };
1190 /* Print a representation of the TOKEN on the STREAM. */
1192 static void
1194 {
1195 /* We don't use cpp_type2name here because the parser defines
1196 a few tokens of its own. */
1198 /* cpplib-defined token types */
1199 #define OP(e, s) #e,
1200 #define TK(e, s) #e,
1201 TTYPE_TABLE
1202 #undef OP
1203 #undef TK
1204 /* C++ parser token types - see "Manifest constants", above. */
1208 };
1210 /* For some tokens, print the associated data. */
1212 {
1214 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1215 For example, `struct' is mapped to an INTEGER_CST. */
1218 /* else fall through */
1236 /* If we have a name for the token, print it out. Otherwise, we
1237 simply give the numeric code. */
1240 else
1243 }
1244 }
1246 DEBUG_FUNCTION void
1248 {
1251 }
1253 DEBUG_FUNCTION void
1255 {
1258 else
1260 }
1263 /* Start emitting debugging information. */
1265 static void
1267 {
1270 }
1272 /* Stop emitting debugging information. */
1274 static void
1276 {
1279 }
1281 /* Create a new cp_token_cache, representing a range of tokens. */
1285 {
1290 }
1292 /* Diagnose if #pragma omp declare simd isn't followed immediately
1293 by function declaration or definition. */
1297 {
1299 {
1303 }
1304 }
1306 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1307 and put that into "omp declare simd" attribute. */
1311 {
1313 {
1315 {
1318 }
1320 {
1323 }
1324 }
1325 }
1326 \f
1327 /* Decl-specifiers. */
1329 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1331 static void
1333 {
1335 }
1337 /* Declarators. */
1339 /* Nothing other than the parser should be creating declarators;
1340 declarators are a semi-syntactic representation of C++ entities.
1341 Other parts of the front end that need to create entities (like
1342 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1355 /* An erroneous declarator. */
1358 /* The obstack on which declarators and related data structures are
1359 allocated. */
1362 /* Alloc BYTES from the declarator memory pool. */
1366 {
1368 }
1370 /* Allocate a declarator of the indicated KIND. Clear fields that are
1371 common to all declarators. */
1375 {
1387 }
1389 /* Make a declarator for a generalized identifier. If
1390 QUALIFYING_SCOPE is non-NULL, the identifier is
1391 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1392 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1393 is, if any. */
1397 special_function_kind sfk)
1398 {
1401 /* It is valid to write:
1403 class C { void f(); };
1404 typedef C D;
1405 void D::f();
1407 The standard is not clear about whether `typedef const C D' is
1408 legal; as of 2002-09-15 the committee is considering that
1409 question. EDG 3.0 allows that syntax. Therefore, we do as
1410 well. */
1424 }
1426 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1427 of modifiers such as const or volatile to apply to the pointer
1428 type, represented as identifiers. ATTRIBUTES represent the attributes that
1429 appertain to the pointer or reference. */
1431 cp_declarator *
1433 tree attributes)
1434 {
1442 {
1446 }
1447 else
1453 }
1455 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1456 represent the attributes that appertain to the pointer or
1457 reference. */
1459 cp_declarator *
1462 {
1470 {
1474 }
1475 else
1481 }
1483 /* Like make_pointer_declarator -- but for a pointer to a non-static
1484 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1485 appertain to the pointer or reference. */
1487 cp_declarator *
1490 tree attributes)
1491 {
1500 {
1503 }
1504 else
1510 }
1512 /* Make a declarator for the function given by TARGET, with the
1513 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1514 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1515 indicates what exceptions can be thrown. */
1517 cp_declarator *
1519 tree parms,
1520 cp_cv_quals cv_qualifiers,
1521 cp_virt_specifiers virt_specifiers,
1522 cp_ref_qualifier ref_qualifier,
1523 tree exception_specification,
1524 tree late_return_type)
1525 {
1537 {
1541 }
1542 else
1546 }
1548 /* Make a declarator for an array of BOUNDS elements, each of which is
1549 defined by ELEMENT. */
1551 cp_declarator *
1553 {
1560 {
1564 }
1565 else
1569 }
1571 /* Determine whether the declarator we've seen so far can be a
1572 parameter pack, when followed by an ellipsis. */
1573 static bool
1575 {
1577 /* We already saw an ellipsis. */
1580 /* Search for a declarator name, or any other declarator that goes
1581 after the point where the ellipsis could appear in a parameter
1582 pack. If we find any of these, then this declarator can not be
1583 made into a parameter pack. */
1586 {
1588 {
1600 }
1601 }
1604 }
1608 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1609 DECLARATOR and DEFAULT_ARGUMENT. */
1611 cp_parameter_declarator *
1614 tree default_argument,
1616 {
1624 else
1631 }
1633 /* Returns true iff DECLARATOR is a declaration for a function. */
1635 static bool
1637 {
1639 {
1647 }
1649 }
1651 /* The parser. */
1653 /* Overview
1654 --------
1656 A cp_parser parses the token stream as specified by the C++
1657 grammar. Its job is purely parsing, not semantic analysis. For
1658 example, the parser breaks the token stream into declarators,
1659 expressions, statements, and other similar syntactic constructs.
1660 It does not check that the types of the expressions on either side
1661 of an assignment-statement are compatible, or that a function is
1662 not declared with a parameter of type `void'.
1664 The parser invokes routines elsewhere in the compiler to perform
1665 semantic analysis and to build up the abstract syntax tree for the
1666 code processed.
1668 The parser (and the template instantiation code, which is, in a
1669 way, a close relative of parsing) are the only parts of the
1670 compiler that should be calling push_scope and pop_scope, or
1671 related functions. The parser (and template instantiation code)
1672 keeps track of what scope is presently active; everything else
1673 should simply honor that. (The code that generates static
1674 initializers may also need to set the scope, in order to check
1675 access control correctly when emitting the initializers.)
1677 Methodology
1678 -----------
1680 The parser is of the standard recursive-descent variety. Upcoming
1681 tokens in the token stream are examined in order to determine which
1682 production to use when parsing a non-terminal. Some C++ constructs
1683 require arbitrary look ahead to disambiguate. For example, it is
1684 impossible, in the general case, to tell whether a statement is an
1685 expression or declaration without scanning the entire statement.
1686 Therefore, the parser is capable of "parsing tentatively." When the
1687 parser is not sure what construct comes next, it enters this mode.
1688 Then, while we attempt to parse the construct, the parser queues up
1689 error messages, rather than issuing them immediately, and saves the
1690 tokens it consumes. If the construct is parsed successfully, the
1691 parser "commits", i.e., it issues any queued error messages and
1692 the tokens that were being preserved are permanently discarded.
1693 If, however, the construct is not parsed successfully, the parser
1694 rolls back its state completely so that it can resume parsing using
1695 a different alternative.
1697 Future Improvements
1698 -------------------
1700 The performance of the parser could probably be improved substantially.
1701 We could often eliminate the need to parse tentatively by looking ahead
1702 a little bit. In some places, this approach might not entirely eliminate
1703 the need to parse tentatively, but it might still speed up the average
1704 case. */
1706 /* Flags that are passed to some parsing functions. These values can
1707 be bitwise-ored together. */
1709 enum
1710 {
1711 /* No flags. */
1713 /* The construct is optional. If it is not present, then no error
1714 should be issued. */
1716 /* When parsing a type-specifier, treat user-defined type-names
1717 as non-type identifiers. */
1719 /* When parsing a type-specifier, do not try to parse a class-specifier
1720 or enum-specifier. */
1722 /* When parsing a decl-specifier-seq, only allow type-specifier or
1723 constexpr. */
1725 };
1727 /* This type is used for parameters and variables which hold
1728 combinations of the above flags. */
1731 /* The different kinds of declarators we want to parse. */
1734 {
1735 /* We want an abstract declarator. */
1736 CP_PARSER_DECLARATOR_ABSTRACT,
1737 /* We want a named declarator. */
1738 CP_PARSER_DECLARATOR_NAMED,
1739 /* We don't mind, but the name must be an unqualified-id. */
1740 CP_PARSER_DECLARATOR_EITHER
1743 /* The precedence values used to parse binary expressions. The minimum value
1744 of PREC must be 1, because zero is reserved to quickly discriminate
1745 binary operators from other tokens. */
1747 enum cp_parser_prec
1748 {
1749 PREC_NOT_OPERATOR,
1750 PREC_LOGICAL_OR_EXPRESSION,
1751 PREC_LOGICAL_AND_EXPRESSION,
1752 PREC_INCLUSIVE_OR_EXPRESSION,
1753 PREC_EXCLUSIVE_OR_EXPRESSION,
1754 PREC_AND_EXPRESSION,
1755 PREC_EQUALITY_EXPRESSION,
1756 PREC_RELATIONAL_EXPRESSION,
1757 PREC_SHIFT_EXPRESSION,
1758 PREC_ADDITIVE_EXPRESSION,
1759 PREC_MULTIPLICATIVE_EXPRESSION,
1760 PREC_PM_EXPRESSION,
1761 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1762 };
1764 /* A mapping from a token type to a corresponding tree node type, with a
1765 precedence value. */
1768 {
1769 /* The token type. */
1771 /* The corresponding tree code. */
1773 /* The precedence of this operator. */
1778 {
1779 /* Left hand side of the binary operation we are currently
1780 parsing. */
1781 tree lhs;
1782 /* Original tree code for left hand side, if it was a binary
1783 expression itself (used for -Wparentheses). */
1785 /* Tree code for the binary operation we are parsing. */
1787 /* Precedence of the binary operation we are parsing. */
1789 /* Location of the binary operation we are parsing. */
1790 location_t loc;
1793 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1794 entries because precedence levels on the stack are monotonically
1795 increasing. */
1799 /* Prototypes. */
1801 /* Constructors and destructors. */
1806 /* Class variables. */
1810 /* The operator-precedence table used by cp_parser_binary_expression.
1811 Transformed into an associative array (binops_by_token) by
1812 cp_parser_new. */
1845 };
1847 /* The same as binops, but initialized by cp_parser_new so that
1848 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1849 for speed. */
1852 /* Constructors and destructors. */
1854 /* Construct a new context. The context below this one on the stack
1855 is given by NEXT. */
1859 {
1862 /* Allocate the storage. */
1864 {
1865 /* Pull the first entry from the free list. */
1869 }
1870 else
1873 /* No errors have occurred yet in this context. */
1875 /* If this is not the bottommost context, copy information that we
1876 need from the previous context. */
1878 {
1879 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1880 expression, then we are parsing one in this context, too. */
1882 /* Thread the stack. */
1884 }
1887 }
1889 /* Managing the unparsed function queues. */
1891 #define unparsed_funs_with_default_args \
1892 parser->unparsed_queues->last ().funs_with_default_args
1893 #define unparsed_funs_with_definitions \
1894 parser->unparsed_queues->last ().funs_with_definitions
1895 #define unparsed_nsdmis \
1896 parser->unparsed_queues->last ().nsdmis
1897 #define unparsed_classes \
1898 parser->unparsed_queues->last ().classes
1900 static void
1902 {
1905 }
1907 static void
1909 {
1912 }
1914 /* Prototypes. */
1916 /* Constructors and destructors. */
1921 /* Routines to parse various constructs.
1923 Those that return `tree' will return the error_mark_node (rather
1924 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1925 Sometimes, they will return an ordinary node if error-recovery was
1926 attempted, even though a parse error occurred. So, to check
1927 whether or not a parse error occurred, you should always use
1928 cp_parser_error_occurred. If the construct is optional (indicated
1929 either by an `_opt' in the name of the function that does the
1930 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1931 the construct is not present. */
1933 /* Lexical conventions [gram.lex] */
1935 static tree cp_parser_identifier
1937 static tree cp_parser_string_literal
1939 static tree cp_parser_userdef_char_literal
1941 static tree cp_parser_userdef_string_literal
1943 static tree cp_parser_userdef_numeric_literal
1946 /* Basic concepts [gram.basic] */
1948 static bool cp_parser_translation_unit
1951 /* Expressions [gram.expr] */
1953 static tree cp_parser_primary_expression
1955 static tree cp_parser_id_expression
1957 static tree cp_parser_unqualified_id
1959 static tree cp_parser_nested_name_specifier_opt
1961 static tree cp_parser_nested_name_specifier
1963 static tree cp_parser_qualifying_entity
1965 static tree cp_parser_postfix_expression
1967 static tree cp_parser_postfix_open_square_expression
1969 static tree cp_parser_postfix_dot_deref_expression
1973 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1975 static void cp_parser_pseudo_destructor_name
1977 static tree cp_parser_unary_expression
1979 static enum tree_code cp_parser_unary_operator
1981 static tree cp_parser_new_expression
1985 static tree cp_parser_new_type_id
1993 static tree cp_parser_delete_expression
1995 static tree cp_parser_cast_expression
1997 static tree cp_parser_binary_expression
1999 static tree cp_parser_question_colon_clause
2001 static tree cp_parser_assignment_expression
2003 static enum tree_code cp_parser_assignment_operator_opt
2005 static tree cp_parser_expression
2007 static tree cp_parser_constant_expression
2009 static tree cp_parser_builtin_offsetof
2011 static tree cp_parser_lambda_expression
2013 static void cp_parser_lambda_introducer
2015 static bool cp_parser_lambda_declarator_opt
2017 static void cp_parser_lambda_body
2020 /* Statements [gram.stmt.stmt] */
2022 static void cp_parser_statement
2024 static void cp_parser_label_for_labeled_statement
2026 static tree cp_parser_expression_statement
2028 static tree cp_parser_compound_statement
2030 static void cp_parser_statement_seq_opt
2032 static tree cp_parser_selection_statement
2034 static tree cp_parser_condition
2036 static tree cp_parser_iteration_statement
2038 static bool cp_parser_for_init_statement
2040 static tree cp_parser_for
2042 static tree cp_parser_c_for
2044 static tree cp_parser_range_for
2046 static void do_range_for_auto_deduction
2048 static tree cp_parser_perform_range_for_lookup
2050 static tree cp_parser_range_for_member_function
2052 static tree cp_parser_jump_statement
2054 static void cp_parser_declaration_statement
2057 static tree cp_parser_implicitly_scoped_statement
2059 static void cp_parser_already_scoped_statement
2062 /* Declarations [gram.dcl.dcl] */
2064 static void cp_parser_declaration_seq_opt
2066 static void cp_parser_declaration
2068 static void cp_parser_block_declaration
2070 static void cp_parser_simple_declaration
2072 static void cp_parser_decl_specifier_seq
2074 static tree cp_parser_storage_class_specifier_opt
2076 static tree cp_parser_function_specifier_opt
2078 static tree cp_parser_type_specifier
2081 static tree cp_parser_simple_type_specifier
2083 static tree cp_parser_type_name
2085 static tree cp_parser_nonclass_name
2087 static tree cp_parser_elaborated_type_specifier
2089 static tree cp_parser_enum_specifier
2091 static void cp_parser_enumerator_list
2093 static void cp_parser_enumerator_definition
2095 static tree cp_parser_namespace_name
2097 static void cp_parser_namespace_definition
2099 static void cp_parser_namespace_body
2101 static tree cp_parser_qualified_namespace_specifier
2103 static void cp_parser_namespace_alias_definition
2105 static bool cp_parser_using_declaration
2107 static void cp_parser_using_directive
2109 static tree cp_parser_alias_declaration
2111 static void cp_parser_asm_definition
2113 static void cp_parser_linkage_specification
2115 static void cp_parser_static_assert
2117 static tree cp_parser_decltype
2120 /* Declarators [gram.dcl.decl] */
2122 static tree cp_parser_init_declarator
2129 static enum tree_code cp_parser_ptr_operator
2131 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2133 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2135 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2137 static tree cp_parser_late_return_type_opt
2139 static tree cp_parser_declarator_id
2141 static tree cp_parser_type_id
2143 static tree cp_parser_template_type_arg
2146 static tree cp_parser_type_id_1
2148 static void cp_parser_type_specifier_seq
2150 static tree cp_parser_parameter_declaration_clause
2152 static tree cp_parser_parameter_declaration_list
2156 static tree cp_parser_default_argument
2158 static void cp_parser_function_body
2160 static tree cp_parser_initializer
2162 static tree cp_parser_initializer_clause
2164 static tree cp_parser_braced_list
2169 static bool cp_parser_ctor_initializer_opt_and_function_body
2172 static tree cp_parser_late_parsing_omp_declare_simd
2175 static tree cp_parser_late_parsing_cilk_simd_fn_info
2178 static tree synthesize_implicit_template_parm
2180 static tree finish_fully_implicit_template
2183 /* Classes [gram.class] */
2185 static tree cp_parser_class_name
2187 static tree cp_parser_class_specifier
2189 static tree cp_parser_class_head
2191 static enum tag_types cp_parser_class_key
2193 static void cp_parser_type_parameter_key
2195 static void cp_parser_member_specification_opt
2197 static void cp_parser_member_declaration
2199 static tree cp_parser_pure_specifier
2201 static tree cp_parser_constant_initializer
2204 /* Derived classes [gram.class.derived] */
2206 static tree cp_parser_base_clause
2208 static tree cp_parser_base_specifier
2211 /* Special member functions [gram.special] */
2213 static tree cp_parser_conversion_function_id
2215 static tree cp_parser_conversion_type_id
2219 static bool cp_parser_ctor_initializer_opt
2221 static void cp_parser_mem_initializer_list
2223 static tree cp_parser_mem_initializer
2225 static tree cp_parser_mem_initializer_id
2228 /* Overloading [gram.over] */
2230 static tree cp_parser_operator_function_id
2232 static tree cp_parser_operator
2235 /* Templates [gram.temp] */
2237 static void cp_parser_template_declaration
2239 static tree cp_parser_template_parameter_list
2241 static tree cp_parser_template_parameter
2243 static tree cp_parser_type_parameter
2245 static tree cp_parser_template_id
2247 static tree cp_parser_template_name
2249 static tree cp_parser_template_argument_list
2251 static tree cp_parser_template_argument
2253 static void cp_parser_explicit_instantiation
2255 static void cp_parser_explicit_specialization
2258 /* Exception handling [gram.exception] */
2260 static tree cp_parser_try_block
2262 static bool cp_parser_function_try_block
2264 static void cp_parser_handler_seq
2266 static void cp_parser_handler
2268 static tree cp_parser_exception_declaration
2270 static tree cp_parser_throw_expression
2272 static tree cp_parser_exception_specification_opt
2274 static tree cp_parser_type_id_list
2277 /* GNU Extensions */
2279 static tree cp_parser_asm_specification_opt
2281 static tree cp_parser_asm_operand_list
2283 static tree cp_parser_asm_clobber_list
2285 static tree cp_parser_asm_label_list
2287 static bool cp_next_tokens_can_be_attribute_p
2289 static bool cp_next_tokens_can_be_gnu_attribute_p
2291 static bool cp_next_tokens_can_be_std_attribute_p
2293 static bool cp_nth_tokens_can_be_std_attribute_p
2295 static bool cp_nth_tokens_can_be_gnu_attribute_p
2297 static bool cp_nth_tokens_can_be_attribute_p
2299 static tree cp_parser_attributes_opt
2301 static tree cp_parser_gnu_attributes_opt
2303 static tree cp_parser_gnu_attribute_list
2305 static tree cp_parser_std_attribute
2307 static tree cp_parser_std_attribute_spec
2309 static tree cp_parser_std_attribute_spec_seq
2311 static bool cp_parser_extension_opt
2313 static void cp_parser_label_declaration
2316 /* Transactional Memory Extensions */
2318 static tree cp_parser_transaction
2320 static tree cp_parser_transaction_expression
2322 static bool cp_parser_function_transaction
2324 static tree cp_parser_transaction_cancel
2328 pragma_external,
2329 pragma_member,
2330 pragma_objc_icode,
2331 pragma_stmt,
2332 pragma_compound
2333 };
2334 static bool cp_parser_pragma
2337 /* Objective-C++ Productions */
2339 static tree cp_parser_objc_message_receiver
2341 static tree cp_parser_objc_message_args
2343 static tree cp_parser_objc_message_expression
2345 static tree cp_parser_objc_encode_expression
2347 static tree cp_parser_objc_defs_expression
2349 static tree cp_parser_objc_protocol_expression
2351 static tree cp_parser_objc_selector_expression
2353 static tree cp_parser_objc_expression
2355 static bool cp_parser_objc_selector_p
2357 static tree cp_parser_objc_selector
2359 static tree cp_parser_objc_protocol_refs_opt
2361 static void cp_parser_objc_declaration
2363 static tree cp_parser_objc_statement
2365 static bool cp_parser_objc_valid_prefix_attributes
2367 static void cp_parser_objc_at_property_declaration
2369 static void cp_parser_objc_at_synthesize_declaration
2371 static void cp_parser_objc_at_dynamic_declaration
2373 static tree cp_parser_objc_struct_declaration
2376 /* Utility Routines */
2378 static tree cp_parser_lookup_name
2380 static tree cp_parser_lookup_name_simple
2382 static tree cp_parser_maybe_treat_template_as_class
2384 static bool cp_parser_check_declarator_template_parameters
2386 static bool cp_parser_check_template_parameters
2388 static tree cp_parser_simple_cast_expression
2390 static tree cp_parser_global_scope_opt
2392 static bool cp_parser_constructor_declarator_p
2394 static tree cp_parser_function_definition_from_specifiers_and_declarator
2396 static tree cp_parser_function_definition_after_declarator
2398 static void cp_parser_template_declaration_after_export
2400 static void cp_parser_perform_template_parameter_access_checks
2402 static tree cp_parser_single_declaration
2404 static tree cp_parser_functional_cast
2406 static tree cp_parser_save_member_function_body
2408 static tree cp_parser_save_nsdmi
2410 static tree cp_parser_enclosed_template_argument_list
2412 static void cp_parser_save_default_args
2414 static void cp_parser_late_parsing_for_member
2416 static tree cp_parser_late_parse_one_default_arg
2418 static void cp_parser_late_parsing_nsdmi
2420 static void cp_parser_late_parsing_default_args
2422 static tree cp_parser_sizeof_operand
2424 static tree cp_parser_trait_expr
2426 static bool cp_parser_declares_only_class_p
2428 static void cp_parser_set_storage_class
2430 static void cp_parser_set_decl_spec_type
2432 static void set_and_check_decl_spec_loc
2435 static bool cp_parser_friend_p
2437 static void cp_parser_required_error
2443 static bool cp_parser_token_starts_function_definition_p
2445 static bool cp_parser_next_token_starts_class_definition_p
2447 static bool cp_parser_next_token_ends_template_argument_p
2449 static bool cp_parser_nth_token_starts_template_argument_list_p
2451 static enum tag_types cp_parser_token_is_class_key
2453 static enum tag_types cp_parser_token_is_type_parameter_key
2455 static void cp_parser_check_class_key
2457 static void cp_parser_check_access_in_redeclaration
2459 static bool cp_parser_optional_template_keyword
2461 static void cp_parser_pre_parsed_nested_name_specifier
2463 static bool cp_parser_cache_group
2465 static tree cp_parser_cache_defarg
2467 static void cp_parser_parse_tentatively
2469 static void cp_parser_commit_to_tentative_parse
2471 static void cp_parser_commit_to_topmost_tentative_parse
2473 static void cp_parser_abort_tentative_parse
2475 static bool cp_parser_parse_definitely
2479 static bool cp_parser_uncommitted_to_tentative_parse_p
2481 static void cp_parser_error
2483 static void cp_parser_name_lookup_error
2485 static bool cp_parser_simulate_error
2487 static bool cp_parser_check_type_definition
2489 static void cp_parser_check_for_definition_in_return_type
2491 static void cp_parser_check_for_invalid_template_id
2493 static bool cp_parser_non_integral_constant_expression
2495 static void cp_parser_diagnose_invalid_type_name
2497 static bool cp_parser_parse_and_diagnose_invalid_type_name
2499 static int cp_parser_skip_to_closing_parenthesis
2501 static void cp_parser_skip_to_end_of_statement
2503 static void cp_parser_consume_semicolon_at_end_of_statement
2505 static void cp_parser_skip_to_end_of_block_or_statement
2507 static bool cp_parser_skip_to_closing_brace
2509 static void cp_parser_skip_to_end_of_template_parameter_list
2511 static void cp_parser_skip_to_pragma_eol
2513 static bool cp_parser_error_occurred
2515 static bool cp_parser_allow_gnu_extensions_p
2517 static bool cp_parser_is_pure_string_literal
2519 static bool cp_parser_is_string_literal
2521 static bool cp_parser_is_keyword
2523 static tree cp_parser_make_typename_type
2527 static bool cp_parser_compound_literal_p
2529 static bool cp_parser_array_designator_p
2531 static bool cp_parser_skip_to_closing_square_bracket
2534 /* Returns nonzero if we are parsing tentatively. */
2538 {
2540 }
2542 /* Returns nonzero if TOKEN is a string literal. */
2544 static bool
2546 {
2552 }
2554 /* Returns nonzero if TOKEN is a string literal
2555 of a user-defined string literal. */
2557 static bool
2559 {
2566 }
2568 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2570 static bool
2572 {
2574 }
2576 /* If not parsing tentatively, issue a diagnostic of the form
2577 FILE:LINE: MESSAGE before TOKEN
2578 where TOKEN is the next token in the input stream. MESSAGE
2579 (specified by the caller) is usually of the form "expected
2580 OTHER-TOKEN". */
2582 static void
2584 {
2586 {
2588 /* This diagnostic makes more sense if it is tagged to the line
2589 of the token we just peeked at. */
2593 {
2598 }
2601 /* Because c_parser_error does not understand
2602 CPP_KEYWORD, keywords are treated like
2603 identifiers. */
2606 }
2607 }
2609 /* Issue an error about name-lookup failing. NAME is the
2610 IDENTIFIER_NODE DECL is the result of
2611 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2612 the thing that we hoped to find. */
2614 static void
2616 tree name,
2617 tree decl,
2618 name_lookup_error desired,
2619 location_t location)
2620 {
2621 /* If name lookup completely failed, tell the user that NAME was not
2622 declared. */
2624 {
2637 else
2639 }
2641 {
2643 {
2660 }
2661 }
2663 {
2665 {
2675 name);
2679 }
2680 }
2681 else
2682 {
2684 {
2697 }
2698 }
2699 }
2701 /* If we are parsing tentatively, remember that an error has occurred
2702 during this tentative parse. Returns true if the error was
2703 simulated; false if a message should be issued by the caller. */
2705 static bool
2707 {
2709 {
2712 }
2714 }
2716 /* This function is called when a type is defined. If type
2717 definitions are forbidden at this point, an error message is
2718 issued. */
2720 static bool
2722 {
2723 /* If types are forbidden here, issue a message. */
2725 {
2726 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2727 in the message need to be interpreted. */
2730 }
2732 }
2734 /* This function is called when the DECLARATOR is processed. The TYPE
2735 was a type defined in the decl-specifiers. If it is invalid to
2736 define a type in the decl-specifiers for DECLARATOR, an error is
2737 issued. TYPE_LOCATION is the location of TYPE and is used
2738 for error reporting. */
2740 static void
2743 {
2744 /* [dcl.fct] forbids type definitions in return types.
2745 Unfortunately, it's not easy to know whether or not we are
2746 processing a return type until after the fact. */
2754 {
2759 type);
2760 }
2761 }
2763 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2764 "<" in any valid C++ program. If the next token is indeed "<",
2765 issue a message warning the user about what appears to be an
2766 invalid attempt to form a template-id. LOCATION is the location
2767 of the type-specifier (TYPE) */
2769 static void
2771 tree type,
2773 location_t location)
2774 {
2778 {
2782 {
2785 else
2787 }
2788 else
2790 /* Remember the location of the invalid "<". */
2793 /* Consume the "<". */
2795 /* Parse the template arguments. */
2797 /* Permanently remove the invalid template arguments so that
2798 this error message is not issued again. */
2801 }
2802 }
2804 /* If parsing an integral constant-expression, issue an error message
2805 about the fact that THING appeared and return true. Otherwise,
2806 return false. In either case, set
2807 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2809 static bool
2811 non_integral_constant thing)
2812 {
2815 {
2817 {
2820 {
2827 "enumeration type cannot appear in a "
2918 }
2922 }
2923 }
2925 }
2927 /* Emit a diagnostic for an invalid type name. This function commits
2928 to the current active tentative parse, if any. (Otherwise, the
2929 problematic construct might be encountered again later, resulting
2930 in duplicate error messages.) LOCATION is the location of ID. */
2932 static void
2934 location_t location)
2935 {
2938 /* Try to lookup the identifier. */
2945 /* If the lookup was ambiguous, an error will already have
2946 been issued. */
2948 /* If the lookup found a template-name, it means that the user forgot
2949 to specify an argument list. Emit a useful error message. */
2951 {
2954 decl);
2956 }
2960 /* Something like 'unsigned A a;' */
2963 {
2964 /* Issue an error message. */
2966 /* If we're in a template class, it's possible that the user was
2967 referring to a type from a base class. For example:
2969 template <typename T> struct A { typedef T X; };
2970 template <typename T> struct B : public A<T> { X x; };
2972 The user should have said "typename A<T>::X". */
2986 {
2987 tree b;
2990 b;
2992 {
2996 {
2997 tree field;
2998 /* Go from a particular instantiation of the
2999 template (which will have an empty TYPE_FIELDs),
3000 to the main version. */
3003 field;
3007 {
3012 }
3015 }
3016 }
3017 }
3018 }
3019 /* Here we diagnose qualified-ids where the scope is actually correct,
3020 but the identifier does not resolve to a valid type name. */
3022 {
3024 {
3029 else
3035 }
3038 {
3039 /* A<T>::A<T>() */
3045 }
3052 {
3057 else
3063 }
3064 else
3066 }
3067 }
3069 /* Check for a common situation where a type-name should be present,
3070 but is not, and issue a sensible error message. Returns true if an
3071 invalid type-name was detected.
3073 The situation handled by this function are variable declarations of the
3074 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3075 Usually, `ID' should name a type, but if we got here it means that it
3076 does not. We try to emit the best possible error message depending on
3077 how exactly the id-expression looks like. */
3079 static bool
3081 {
3082 tree id;
3085 /* Avoid duplicate error about ambiguous lookup. */
3087 {
3091 }
3100 /* If the next token is a (, this is a function with no explicit return
3101 type, i.e. constructor, destructor or conversion op. */
3104 {
3107 }
3111 /* Emit a diagnostic for the invalid type. */
3113 out:
3114 /* If we aren't in the middle of a declarator (i.e. in a
3115 parameter-declaration-clause), skip to the end of the declaration;
3116 there's no point in trying to process it. */
3120 }
3122 /* Consume tokens up to, and including, the next non-nested closing `)'.
3123 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3124 are doing error recovery. Returns -1 if OR_COMMA is true and we
3125 found an unnested comma. */
3127 static int
3132 {
3142 {
3146 {
3149 /* If we've run out of tokens, then there is no closing `)'. */
3152 /* This is good for lambda expression capture-lists. */
3162 /* This matches the processing in skip_to_end_of_statement. */
3188 {
3192 }
3197 }
3199 /* Consume the token. */
3201 }
3202 }
3204 /* Consume tokens until we reach the end of the current statement.
3205 Normally, that will be just before consuming a `;'. However, if a
3206 non-nested `}' comes first, then we stop before consuming that. */
3208 static void
3210 {
3213 /* Unwind generic function template scope if necessary. */
3218 {
3222 {
3225 /* If we've run out of tokens, stop. */
3229 /* If the next token is a `;', we have reached the end of the
3230 statement. */
3236 /* If this is a non-nested '}', stop before consuming it.
3237 That way, when confronted with something like:
3239 { 3 + }
3241 we stop before consuming the closing '}', even though we
3242 have not yet reached a `;'. */
3246 /* If it is the closing '}' for a block that we have
3247 scanned, stop -- but only after consuming the token.
3248 That way given:
3250 void f g () { ... }
3251 typedef int I;
3253 we will stop after the body of the erroneously declared
3254 function, but before consuming the following `typedef'
3255 declaration. */
3257 {
3260 }
3268 }
3270 /* Consume the token. */
3272 }
3273 }
3275 /* This function is called at the end of a statement or declaration.
3276 If the next token is a semicolon, it is consumed; otherwise, error
3277 recovery is attempted. */
3279 static void
3281 {
3282 /* Look for the trailing `;'. */
3284 {
3285 /* If there is additional (erroneous) input, skip to the end of
3286 the statement. */
3288 /* If the next token is now a `;', consume it. */
3291 }
3292 }
3294 /* Skip tokens until we have consumed an entire block, or until we
3295 have consumed a non-nested `;'. */
3297 static void
3299 {
3302 /* Unwind generic function template scope if necessary. */
3307 {
3311 {
3314 /* If we've run out of tokens, stop. */
3318 /* Stop if this is an unnested ';'. */
3324 /* Stop if this is an unnested '}', or closes the outermost
3325 nesting level. */
3326 nesting_depth--;
3334 /* Nest. */
3335 nesting_depth++;
3340 }
3342 /* Consume the token. */
3344 }
3345 }
3347 /* Skip tokens until a non-nested closing curly brace is the next
3348 token, or there are no more tokens. Return true in the first case,
3349 false otherwise. */
3351 static bool
3353 {
3357 {
3361 {
3364 /* If we've run out of tokens, stop. */
3368 /* If the next token is a non-nested `}', then we have reached
3369 the end of the current block. */
3375 /* If it the next token is a `{', then we are entering a new
3376 block. Consume the entire block. */
3382 }
3384 /* Consume the token. */
3386 }
3387 }
3389 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3390 parameter is the PRAGMA token, allowing us to purge the entire pragma
3391 sequence. */
3393 static void
3395 {
3400 do
3404 /* Ensure that the pragma is not parsed again. */
3406 }
3408 /* Require pragma end of line, resyncing with it as necessary. The
3409 arguments are as for cp_parser_skip_to_pragma_eol. */
3411 static void
3413 {
3417 }
3419 /* This is a simple wrapper around make_typename_type. When the id is
3420 an unresolved identifier node, we can provide a superior diagnostic
3421 using cp_parser_diagnose_invalid_type_name. */
3423 static tree
3425 location_t id_location)
3426 {
3427 tree result;
3429 {
3435 }
3437 }
3439 /* This is a wrapper around the
3440 make_{pointer,ptrmem,reference}_declarator functions that decides
3441 which one to call based on the CODE and CLASS_TYPE arguments. The
3442 CODE argument should be one of the values returned by
3443 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3444 appertain to the pointer or reference. */
3448 cp_cv_quals cv_qualifiers,
3450 tree attributes)
3451 {
3458 else
3468 }
3470 /* Create a new C++ parser. */
3474 {
3479 /* cp_lexer_new_main is called before doing GC allocation because
3480 cp_lexer_new_main might load a PCH file. */
3483 /* Initialize the binops_by_token so that we can get the tree
3484 directly from the token. */
3492 /* For now, we always accept GNU extensions. */
3495 /* The `>' token is a greater-than operator, not the end of a
3496 template-id. */
3501 /* We are not parsing a constant-expression. */
3506 /* Local variable names are not forbidden. */
3509 /* We are not processing an `extern "C"' declaration. */
3512 /* We are not processing a declarator. */
3515 /* We are not processing a template-argument-list. */
3518 /* We are not in an iteration statement. */
3521 /* We are not in a switch statement. */
3524 /* We are not parsing a type-id inside an expression. */
3527 /* Declarations aren't implicitly extern "C". */
3530 /* String literals should be translated to the execution character set. */
3533 /* We are not parsing a function body. */
3536 /* We can correct until told otherwise. */
3539 /* The unparsed function queue is empty. */
3542 /* There are no classes being defined. */
3545 /* No template parameters apply. */
3548 /* Not declaring an implicit function template. */
3555 }
3557 /* Create a cp_lexer structure which will emit the tokens in CACHE
3558 and push it onto the parser's lexer stack. This is used for delayed
3559 parsing of in-class method bodies and default arguments, and should
3560 not be confused with tentative parsing. */
3561 static void
3563 {
3568 /* Move the current source position to that of the first token in the
3569 new lexer. */
3571 }
3573 /* Pop the top lexer off the parser stack. This is never used for the
3574 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3575 static void
3577 {
3582 /* Put the current source position back where it was before this
3583 lexer was pushed. */
3585 }
3587 /* Lexical conventions [gram.lex] */
3589 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3590 identifier. */
3592 static tree
3594 {
3597 /* Look for the identifier. */
3599 /* Return the value. */
3601 }
3603 /* Parse a sequence of adjacent string constants. Returns a
3604 TREE_STRING representing the combined, nul-terminated string
3605 constant. If TRANSLATE is true, translate the string to the
3606 execution character set. If WIDE_OK is true, a wide string is
3607 invalid here.
3609 C++98 [lex.string] says that if a narrow string literal token is
3610 adjacent to a wide string literal token, the behavior is undefined.
3611 However, C99 6.4.5p4 says that this results in a wide string literal.
3612 We follow C99 here, for consistency with the C front end.
3614 This code is largely lifted from lex_string() in c-lex.c.
3616 FUTURE: ObjC++ will need to handle @-strings here. */
3617 static tree
3620 {
3621 tree value;
3628 tree string_tree;
3634 {
3637 }
3640 {
3644 }
3645 else
3646 {
3649 }
3652 /* Try to avoid the overhead of creating and destroying an obstack
3653 for the common case of just one string. */
3656 {
3664 {
3668 }
3669 else
3673 }
3674 else
3675 {
3679 do
3680 {
3682 count++;
3687 {
3690 {
3693 }
3696 {
3701 }
3703 }
3704 else
3708 {
3713 "unsupported non-standard concatenation "
3715 }
3721 {
3725 }
3726 else
3727 {
3731 }
3732 }
3736 }
3739 {
3742 }
3746 {
3751 {
3766 }
3771 {
3776 else
3778 }
3779 }
3780 else
3781 /* cpp_interpret_string has issued an error. */
3788 }
3790 /* Look up a literal operator with the name and the exact arguments. */
3792 static tree
3794 {
3801 {
3807 {
3810 {
3820 }
3823 /* May be this should be sufficient_parms_p instead,
3824 depending on how exactly should user-defined literals
3825 work in presence of default arguments on the literal
3826 operator parameters. */
3829 }
3830 }
3833 }
3835 /* Parse a user-defined char constant. Returns a call to a user-defined
3836 literal operator taking the character as an argument. */
3838 static tree
3840 {
3848 /* Build up a call to the user-defined operator */
3849 /* Lookup the name we got back from the id-expression. */
3854 {
3859 }
3863 }
3865 /* A subroutine of cp_parser_userdef_numeric_literal to
3866 create a char... template parameter pack from a string node. */
3868 static tree
3870 {
3871 tree charvec;
3877 /* Fill in CHARVEC with all of the parameters. */
3882 /* Build the argument packs. */
3889 }
3891 /* A subroutine of cp_parser_userdef_numeric_literal to
3892 create a char... template parameter pack from a string node. */
3894 static tree
3896 {
3897 tree charvec;
3908 /* First template parm is character type. */
3911 /* Fill in CHARVEC with all of the parameters. */
3918 /* Build the argument packs. */
3925 }
3927 /* Parse a user-defined numeric constant. returns a call to a user-defined
3928 literal operator. */
3930 static tree
3932 {
3943 /* Look for a literal operator taking the exact type of numeric argument
3944 as the literal value. */
3949 {
3951 tf_warning_or_error);
3954 {
3957 long_long_unsigned_type_node);
3958 }
3959 else
3960 {
3964 long_double_type_node);
3968 }
3972 }
3975 /* If the numeric argument didn't work, look for a raw literal
3976 operator taking a const char* argument consisting of the number
3977 in string format. */
3982 {
3984 tf_warning_or_error);
3987 }
3990 /* If the raw literal didn't work, look for a non-type template
3991 function with parameter pack char.... Call the function with
3992 template parameter characters representing the number. */
3996 {
4000 tf_warning_or_error);
4003 }
4012 }
4014 /* Parse a user-defined string constant. Returns a call to a user-defined
4015 literal operator taking a character pointer and the length of the string
4016 as arguments. */
4018 static tree
4020 {
4029 /* Build up a call to the user-defined operator. */
4030 /* Lookup the name we got back from the id-expression. */
4037 {
4039 tf_warning_or_error);
4042 }
4045 /* Look for a template function with typename parameter CharT
4046 and parameter pack CharT... Call the function with
4047 template parameter characters representing the string. */
4051 {
4055 tf_warning_or_error);
4058 }
4064 }
4067 /* Basic concepts [gram.basic] */
4069 /* Parse a translation-unit.
4071 translation-unit:
4072 declaration-seq [opt]
4074 Returns TRUE if all went well. */
4076 static bool
4078 {
4079 /* The address of the first non-permanent object on the declarator
4080 obstack. */
4085 /* Create the declarator obstack, if necessary. */
4087 {
4089 /* Create the error declarator. */
4091 /* Create the empty parameter list. */
4093 /* Remember where the base of the declarator obstack lies. */
4095 }
4099 /* If there are no tokens left then all went well. */
4101 {
4102 /* Get rid of the token array; we don't need it any more. */
4106 /* This file might have been a context that's implicitly extern
4107 "C". If so, pop the lang context. (Only relevant for PCH.) */
4109 {
4112 }
4114 /* Finish up. */
4118 }
4119 else
4120 {
4123 }
4125 /* Make sure the declarator obstack was fully cleaned up. */
4129 /* All went well. */
4131 }
4133 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4134 decltype context. */
4138 {
4143 }
4145 /* We're about to parse a collection of statements. If we're currently
4146 parsing tentatively, set up a firewall so that any nested
4147 cp_parser_commit_to_tentative_parse won't affect the current context. */
4149 static cp_token_position
4151 {
4158 }
4160 /* We've finished parsing the collection of statements. Wrap up the
4161 firewall and replace the relevant tokens with the parsed form. */
4163 static void
4165 tree expr)
4166 {
4170 /* Finish the firewall level. */
4172 /* And remember the result of the parse for when we try again. */
4178 }
4180 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4181 enclosing parentheses. */
4183 static tree
4185 {
4188 /* Consume the '('. */
4190 /* Start the statement-expression. */
4192 /* Parse the compound-statement. */
4194 /* Finish up. */
4196 /* Consume the ')'. */
4202 }
4204 /* Expressions [gram.expr] */
4206 /* Parse a primary-expression.
4208 primary-expression:
4209 literal
4210 this
4211 ( expression )
4212 id-expression
4213 lambda-expression (C++11)
4215 GNU Extensions:
4217 primary-expression:
4218 ( compound-statement )
4219 __builtin_va_arg ( assignment-expression , type-id )
4220 __builtin_offsetof ( type-id , offsetof-expression )
4222 C++ Extensions:
4223 __has_nothrow_assign ( type-id )
4224 __has_nothrow_constructor ( type-id )
4225 __has_nothrow_copy ( type-id )
4226 __has_trivial_assign ( type-id )
4227 __has_trivial_constructor ( type-id )
4228 __has_trivial_copy ( type-id )
4229 __has_trivial_destructor ( type-id )
4230 __has_virtual_destructor ( type-id )
4231 __is_abstract ( type-id )
4232 __is_base_of ( type-id , type-id )
4233 __is_class ( type-id )
4234 __is_empty ( type-id )
4235 __is_enum ( type-id )
4236 __is_final ( type-id )
4237 __is_literal_type ( type-id )
4238 __is_pod ( type-id )
4239 __is_polymorphic ( type-id )
4240 __is_std_layout ( type-id )
4241 __is_trivial ( type-id )
4242 __is_union ( type-id )
4244 Objective-C++ Extension:
4246 primary-expression:
4247 objc-expression
4249 literal:
4250 __null
4252 ADDRESS_P is true iff this expression was immediately preceded by
4253 "&" and therefore might denote a pointer-to-member. CAST_P is true
4254 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4255 true iff this expression is a template argument.
4257 Returns a representation of the expression. Upon return, *IDK
4258 indicates what kind of id-expression (if any) was present. */
4260 static tree
4267 {
4270 /* Assume the primary expression is not an id-expression. */
4273 /* Peek at the next token. */
4276 {
4277 /* literal:
4278 integer-literal
4279 character-literal
4280 floating-literal
4281 string-literal
4282 boolean-literal
4283 pointer-literal
4284 user-defined-literal */
4296 {
4300 }
4301 /* Floating-point literals are only allowed in an integral
4302 constant expression if they are cast to an integral or
4303 enumeration type. */
4307 {
4308 /* CAST_P will be set even in invalid code like "int(2.7 +
4309 ...)". Therefore, we have to check that the next token
4310 is sure to end the cast. */
4312 {
4317 enumerator-definition. */
4319 /* The curly brace at the end of an enum-specifier. */
4321 /* The end of a statement. */
4323 /* The end of the cast-expression. */
4325 /* The end of an array bound. */
4327 /* The closing ">" in a template-argument-list. */
4330 /* C++0x only: A ">>" treated like two ">" tokens,
4331 in a template-argument-list. */
4336 }
4338 /* If we are within a cast, then the constraint that the
4339 cast is to an integral or enumeration type will be
4340 checked at that point. If we are not within a cast, then
4341 this code is invalid. */
4344 }
4364 /* ??? Should wide strings be allowed when parser->translate_strings_p
4365 is false (i.e. in attributes)? If not, we can kill the third
4366 argument to cp_parser_string_literal. */
4372 /* If we see `( { ' then we are looking at the beginning of
4373 a GNU statement-expression. */
4376 {
4377 /* Statement-expressions are not allowed by the standard. */
4381 /* And they're not allowed outside of a function-body; you
4382 cannot, for example, write:
4384 int i = ({ int j = 3; j + 1; });
4386 at class or namespace scope. */
4389 {
4391 "statement-expressions are not allowed outside "
4397 }
4398 else
4400 }
4401 /* Otherwise it's a normal parenthesized expression. */
4402 {
4403 tree expr;
4406 /* Consume the `('. */
4408 /* Within a parenthesized expression, a `>' token is always
4409 the greater-than operator. */
4410 saved_greater_than_is_operator_p
4414 /* Parse the parenthesized expression. */
4416 /* Let the front end know that this expression was
4417 enclosed in parentheses. This matters in case, for
4418 example, the expression is of the form `A::B', since
4419 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4420 not. */
4422 /* DR 705: Wrapping an unqualified name in parentheses
4423 suppresses arg-dependent lookup. We want to pass back
4424 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4425 (c++/37862), but none of the others. */
4429 /* The `>' token might be the end of a template-id or
4430 template-parameter-list now. */
4431 parser->greater_than_is_operator_p
4433 /* Consume the `)'. */
4438 }
4441 {
4443 {
4444 /* We might have an Objective-C++ message. */
4447 /* If that works out, we're done ... */
4450 /* ... else, fall though to see if it's a lambda. */
4451 }
4453 /* Don't warn about a failed tentative parse. */
4458 }
4462 /* We have an Objective-C++ string literal. */
4469 {
4470 /* These two are the boolean literals. */
4478 /* The `__null' literal. */
4483 /* The `nullptr' literal. */
4488 /* Recognize the `this' keyword. */
4492 {
4496 }
4497 /* Pointers cannot appear in constant-expressions. */
4502 /* The `operator' keyword can be the beginning of an
4503 id-expression. */
4510 {
4511 non_integral_constant name;
4513 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4514 __func__ are the names of variables -- but they are
4515 treated specially. Therefore, they are handled here,
4516 rather than relying on the generic id-expression logic
4517 below. Grammatically, these names are id-expressions.
4519 Consume the token. */
4523 {
4535 }
4540 /* Look up the name. */
4542 }
4545 {
4546 tree expression;
4547 tree type;
4548 source_location type_location;
4550 /* The `__builtin_va_arg' construct is used to handle
4551 `va_arg'. Consume the `__builtin_va_arg' token. */
4553 /* Look for the opening `('. */
4555 /* Now, parse the assignment-expression. */
4557 /* Look for the `,'. */
4560 /* Parse the type-id. */
4562 /* Look for the closing `)'. */
4564 /* Using `va_arg' in a constant-expression is not
4565 allowed. */
4567 NIC_VA_ARG))
4570 }
4600 /* Objective-C++ expressions. */
4610 {
4615 }
4619 }
4621 /* An id-expression can start with either an identifier, a
4622 `::' as the beginning of a qualified-id, or the "operator"
4623 keyword. */
4628 {
4629 tree id_expression;
4630 tree decl;
4636 id_expression:
4637 /* Parse the id-expression. */
4638 id_expression
4655 /* If we have a template-id, then no further lookup is
4656 required. If the template-id was for a template-class, we
4657 will sometimes have a TYPE_DECL at this point. */
4661 /* Look up the name. */
4662 else
4663 {
4664 tree ambiguous_decls;
4666 /* If we already know that this lookup is ambiguous, then
4667 we've already issued an error message; there's no reason
4668 to check again. */
4671 {
4674 }
4677 none_type,
4678 template_p,
4683 /* If the lookup was ambiguous, an error will already have
4684 been issued. */
4688 /* In Objective-C++, we may have an Objective-C 2.0
4689 dot-syntax for classes here. */
4694 {
4695 tree component;
4702 }
4704 /* In Objective-C++, an instance variable (ivar) may be preferred
4705 to whatever cp_parser_lookup_name() found. */
4708 /* If name lookup gives us a SCOPE_REF, then the
4709 qualifying scope was dependent. */
4711 {
4712 /* At this point, we do not know if DECL is a valid
4713 integral constant expression. We assume that it is
4714 in fact such an expression, so that code like:
4716 template <int N> struct A {
4717 int a[B<N>::i];
4718 };
4720 is accepted. At template-instantiation time, we
4721 will check that B<N>::i is actually a constant. */
4723 }
4724 /* Check to see if DECL is a local variable in a context
4725 where that is forbidden. */
4728 {
4729 /* It might be that we only found DECL because we are
4730 trying to be generous with pre-ISO scoping rules.
4731 For example, consider:
4733 int i;
4734 void g() {
4735 for (int i = 0; i < 10; ++i) {}
4736 extern void f(int j = i);
4737 }
4739 Here, name look up will originally find the out
4740 of scope `i'. We need to issue a warning message,
4741 but then use the global `i'. */
4744 {
4747 decl);
4749 }
4750 }
4751 }
4753 decl = (finish_id_expression
4755 idk,
4760 template_arg_p,
4766 }
4768 /* Anything else is an error. */
4772 }
4773 }
4781 {
4784 }
4786 /* Parse an id-expression.
4788 id-expression:
4789 unqualified-id
4790 qualified-id
4792 qualified-id:
4793 :: [opt] nested-name-specifier template [opt] unqualified-id
4794 :: identifier
4795 :: operator-function-id
4796 :: template-id
4798 Return a representation of the unqualified portion of the
4799 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4800 a `::' or nested-name-specifier.
4802 Often, if the id-expression was a qualified-id, the caller will
4803 want to make a SCOPE_REF to represent the qualified-id. This
4804 function does not do this in order to avoid wastefully creating
4805 SCOPE_REFs when they are not required.
4807 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4808 `template' keyword.
4810 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4811 uninstantiated templates.
4813 If *TEMPLATE_P is non-NULL, it is set to true iff the
4814 `template' keyword is used to explicitly indicate that the entity
4815 named is a template.
4817 If DECLARATOR_P is true, the id-expression is appearing as part of
4818 a declarator, rather than as part of an expression. */
4820 static tree
4827 {
4831 /* Assume the `template' keyword was not used. */
4835 /* Look for the optional `::' operator. */
4836 global_scope_p
4839 /* Look for the optional nested-name-specifier. */
4840 nested_name_specifier_p
4843 check_dependency_p,
4845 declarator_p)
4847 /* If there is a nested-name-specifier, then we are looking at
4848 the first qualified-id production. */
4850 {
4851 tree saved_scope;
4852 tree saved_object_scope;
4853 tree saved_qualifying_scope;
4854 tree unqualified_id;
4857 /* See if the next token is the `template' keyword. */
4861 /* Name lookup we do during the processing of the
4862 unqualified-id might obliterate SCOPE. */
4866 /* Process the final unqualified-id. */
4868 check_dependency_p,
4869 declarator_p,
4871 /* Restore the SAVED_SCOPE for our caller. */
4877 }
4878 /* Otherwise, if we are in global scope, then we are looking at one
4879 of the other qualified-id productions. */
4881 {
4883 tree id;
4885 /* Peek at the next token. */
4888 /* If it's an identifier, and the next token is not a "<", then
4889 we can avoid the template-id case. This is an optimization
4890 for this common case. */
4892 && !cp_parser_nth_token_starts_template_argument_list_p
4897 /* Try a template-id. */
4901 none_type,
4902 declarator_p);
4903 /* If that worked, we're done. */
4907 /* Peek at the next token. (Changes in the token buffer may
4908 have invalidated the pointer obtained above.) */
4912 {
4919 /* Fall through. */
4924 }
4925 }
4926 else
4929 declarator_p,
4930 optional_p);
4931 }
4933 /* Parse an unqualified-id.
4935 unqualified-id:
4936 identifier
4937 operator-function-id
4938 conversion-function-id
4939 ~ class-name
4940 template-id
4942 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4943 keyword, in a construct like `A::template ...'.
4945 Returns a representation of unqualified-id. For the `identifier'
4946 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4947 production a BIT_NOT_EXPR is returned; the operand of the
4948 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4949 other productions, see the documentation accompanying the
4950 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4951 names are looked up in uninstantiated templates. If DECLARATOR_P
4952 is true, the unqualified-id is appearing as part of a declarator,
4953 rather than as part of an expression. */
4955 static tree
4961 {
4964 /* Peek at the next token. */
4968 {
4970 {
4971 tree id;
4973 /* We don't know yet whether or not this will be a
4974 template-id. */
4976 /* Try a template-id. */
4978 check_dependency_p,
4979 none_type,
4980 declarator_p);
4981 /* If it worked, we're done. */
4984 /* Otherwise, it's an ordinary identifier. */
4986 }
4990 check_dependency_p,
4991 none_type,
4992 declarator_p);
4995 {
4996 tree type_decl;
4997 tree qualifying_scope;
4998 tree object_scope;
4999 tree scope;
5002 /* Consume the `~' token. */
5004 /* Parse the class-name. The standard, as written, seems to
5005 say that:
5007 template <typename T> struct S { ~S (); };
5008 template <typename T> S<T>::~S() {}
5010 is invalid, since `~' must be followed by a class-name, but
5011 `S<T>' is dependent, and so not known to be a class.
5012 That's not right; we need to look in uninstantiated
5013 templates. A further complication arises from:
5015 template <typename T> void f(T t) {
5016 t.T::~T();
5017 }
5019 Here, it is not possible to look up `T' in the scope of `T'
5020 itself. We must look in both the current scope, and the
5021 scope of the containing complete expression.
5023 Yet another issue is:
5025 struct S {
5026 int S;
5027 ~S();
5028 };
5030 S::~S() {}
5032 The standard does not seem to say that the `S' in `~S'
5033 should refer to the type `S' and not the data member
5034 `S::S'. */
5036 /* DR 244 says that we look up the name after the "~" in the
5037 same scope as we looked up the qualifying name. That idea
5038 isn't fully worked out; it's more complicated than that. */
5043 /* Check for invalid scopes. */
5045 {
5049 }
5051 {
5055 scope);
5060 }
5063 /* If the name is of the form "X::~X" it's OK even if X is a
5064 typedef. */
5073 {
5076 }
5078 /* ~auto means the destructor of whatever the object is. */
5080 {
5083 "%<~auto%> only available with "
5087 }
5089 /* If there was an explicit qualification (S::~T), first look
5090 in the scope given by the qualification (i.e., S).
5092 Note: in the calls to cp_parser_class_name below we pass
5093 typename_type so that lookup finds the injected-class-name
5094 rather than the constructor. */
5098 {
5103 typename_type,
5106 declarator_p);
5109 }
5110 /* In "N::S::~S", look in "N" as well. */
5112 {
5117 type_decl
5121 typename_type,
5124 declarator_p);
5127 }
5128 /* In "p->S::~T", look in the scope given by "*p" as well. */
5130 {
5135 type_decl
5139 typename_type,
5142 declarator_p);
5145 }
5146 /* Look in the surrounding context. */
5148 {
5154 type_decl
5158 typename_type,
5161 declarator_p);
5164 {
5165 /* We couldn't find a type with this name, so just accept
5166 it and check for a match at instantiation time. */
5171 }
5172 }
5173 /* If an error occurred, assume that the name of the
5174 destructor is the same as the name of the qualifying
5175 class. That allows us to keep parsing after running
5176 into ill-formed destructor names. */
5182 /* Check that destructor name and scope match. */
5184 {
5191 }
5193 /* [class.dtor]
5195 A typedef-name that names a class shall not be used as the
5196 identifier in the declarator for a destructor declaration. */
5203 type_decl);
5206 }
5210 {
5211 tree id;
5213 /* This could be a template-id, so we try that first. */
5215 /* Try a template-id. */
5218 none_type,
5219 declarator_p);
5220 /* If that worked, we're done. */
5223 /* We still don't know whether we're looking at an
5224 operator-function-id or a conversion-function-id. */
5226 /* Try an operator-function-id. */
5228 /* If that didn't work, try a conversion-function-id. */
5232 {
5233 /* 17.6.3.3.5 */
5239 }
5242 }
5243 /* Fall through. */
5250 }
5251 }
5253 /* Parse an (optional) nested-name-specifier.
5255 nested-name-specifier: [C++98]
5256 class-or-namespace-name :: nested-name-specifier [opt]
5257 class-or-namespace-name :: template nested-name-specifier [opt]
5259 nested-name-specifier: [C++0x]
5260 type-name ::
5261 namespace-name ::
5262 nested-name-specifier identifier ::
5263 nested-name-specifier template [opt] simple-template-id ::
5265 PARSER->SCOPE should be set appropriately before this function is
5266 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5267 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5268 in name lookups.
5270 Sets PARSER->SCOPE to the class (TYPE) or namespace
5271 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5272 it unchanged if there is no nested-name-specifier. Returns the new
5273 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5275 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5276 part of a declaration and/or decl-specifier. */
5278 static tree
5284 {
5289 /* Remember where the nested-name-specifier starts. */
5291 {
5294 }
5297 {
5298 tree new_scope;
5299 tree old_scope;
5300 tree saved_qualifying_scope;
5303 /* Spot cases that cannot be the beginning of a
5304 nested-name-specifier. */
5307 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5308 the already parsed nested-name-specifier. */
5310 {
5311 /* Grab the nested-name-specifier and continue the loop. */
5313 /* If we originally encountered this nested-name-specifier
5314 with IS_DECLARATION set to false, we will not have
5315 resolved TYPENAME_TYPEs, so we must do so here. */
5318 {
5323 }
5326 }
5328 /* Spot cases that cannot be the beginning of a
5329 nested-name-specifier. On the second and subsequent times
5330 through the loop, we look for the `template' keyword. */
5332 ;
5333 /* A template-id can start a nested-name-specifier. */
5335 ;
5336 /* DR 743: decltype can be used in a nested-name-specifier. */
5338 ;
5339 else
5340 {
5341 /* If the next token is not an identifier, then it is
5342 definitely not a type-name or namespace-name. */
5345 /* If the following token is neither a `<' (to begin a
5346 template-id), nor a `::', then we are not looking at a
5347 nested-name-specifier. */
5353 {
5357 }
5360 && !cp_parser_nth_token_starts_template_argument_list_p
5363 }
5365 /* The nested-name-specifier is optional, so we parse
5366 tentatively. */
5369 /* Look for the optional `template' keyword, if this isn't the
5370 first time through the loop. */
5373 else
5376 /* Save the old scope since the name lookup we are about to do
5377 might destroy it. */
5380 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5381 look up names in "X<T>::I" in order to determine that "Y" is
5382 a template. So, if we have a typename at this point, we make
5383 an effort to look through it. */
5385 && !typename_keyword_p
5390 /* Parse the qualifying entity. */
5391 new_scope
5393 typename_keyword_p,
5394 template_keyword_p,
5395 check_dependency_p,
5396 type_p,
5397 is_declaration);
5398 /* Look for the `::' token. */
5401 /* If we found what we wanted, we keep going; otherwise, we're
5402 done. */
5404 {
5407 /* Restore the OLD_SCOPE since it was valid before the
5408 failed attempt at finding the last
5409 class-or-namespace-name. */
5413 /* If the next token is a decltype, and the one after that is a
5414 `::', then the decltype has failed to resolve to a class or
5415 enumeration type. Give this error even when parsing
5416 tentatively since it can't possibly be valid--and we're going
5417 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5418 won't get another chance.*/
5422 {
5429 /* As below. */
5432 }
5436 {
5437 /* If we have a non-type template-id followed by ::, it can't
5438 possibly be valid. */
5443 {
5446 {
5452 }
5453 else
5454 {
5455 /* Variable template. */
5460 }
5467 /* As below. */
5471 }
5472 }
5476 /* If the next token is an identifier, and the one after
5477 that is a `::', then any valid interpretation would have
5478 found a class-or-namespace-name. */
5484 {
5487 {
5489 {
5490 tree decl;
5491 tree ambiguous_decls;
5494 none_type,
5503 decl);
5505 {
5506 // cp_parser_lookup_name has the same diagnostic,
5507 // thus make sure to emit it at most once.
5510 {
5515 }
5517 }
5518 else
5519 {
5521 cp_parser_name_lookup_error
5524 else
5525 cp_parser_name_lookup_error
5528 }
5529 }
5532 /* Treat this as a successful nested-name-specifier
5533 due to:
5535 [basic.lookup.qual]
5537 If the name found is not a class-name (clause
5538 _class_) or namespace-name (_namespace.def_), the
5539 program is ill-formed. */
5541 }
5543 }
5545 }
5546 /* We've found one valid nested-name-specifier. */
5548 /* Name lookup always gives us a DECL. */
5551 /* Uses of "template" must be followed by actual templates. */
5563 new_scope);
5564 /* If it is a class scope, try to complete it; we are about to
5565 be looking up names inside the class. */
5567 /* Since checking types for dependency can be expensive,
5568 avoid doing it if the type is already complete. */
5570 /* Do not try to complete dependent types. */
5572 {
5574 /* If it is a typedef to current class, use the current
5575 class instead, as the typedef won't have any names inside
5576 it yet. */
5580 }
5581 /* Make sure we look in the right scope the next time through
5582 the loop. */
5584 }
5586 /* If parsing tentatively, replace the sequence of tokens that makes
5587 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5588 token. That way, should we re-parse the token stream, we will
5589 not have to repeat the effort required to do the parse, nor will
5590 we issue duplicate error messages. */
5592 {
5596 /* Reset the contents of the START token. */
5598 /* Retrieve any deferred checks. Do not pop this access checks yet
5599 so the memory will not be reclaimed during token replacing below. */
5607 /* Purge all subsequent tokens. */
5609 }
5615 }
5617 /* Parse a nested-name-specifier. See
5618 cp_parser_nested_name_specifier_opt for details. This function
5619 behaves identically, except that it will an issue an error if no
5620 nested-name-specifier is present. */
5622 static tree
5628 {
5629 tree scope;
5631 /* Look for the nested-name-specifier. */
5633 typename_keyword_p,
5634 check_dependency_p,
5635 type_p,
5636 is_declaration);
5637 /* If it was not present, issue an error message. */
5639 {
5642 }
5645 }
5647 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5648 this is either a class-name or a namespace-name (which corresponds
5649 to the class-or-namespace-name production in the grammar). For
5650 C++0x, it can also be a type-name that refers to an enumeration
5651 type or a simple-template-id.
5653 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5654 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5655 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5656 TYPE_P is TRUE iff the next name should be taken as a class-name,
5657 even the same name is declared to be another entity in the same
5658 scope.
5660 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5661 specified by the class-or-namespace-name. If neither is found the
5662 ERROR_MARK_NODE is returned. */
5664 static tree
5671 {
5672 tree saved_scope;
5673 tree saved_qualifying_scope;
5674 tree saved_object_scope;
5675 tree scope;
5679 /* DR 743: decltype can appear in a nested-name-specifier. */
5681 {
5685 {
5688 }
5692 }
5694 /* Before we try to parse the class-name, we must save away the
5695 current PARSER->SCOPE since cp_parser_class_name will destroy
5696 it. */
5700 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5701 there is no need to look for a namespace-name. */
5702 only_class_p = template_keyword_p
5707 typename_keyword_p,
5708 template_keyword_p,
5710 check_dependency_p,
5712 is_declaration,
5715 /* If that didn't work, try for a namespace-name. */
5717 {
5718 /* Restore the saved scope. */
5722 /* If we are not looking at an identifier followed by the scope
5723 resolution operator, then this is not part of a
5724 nested-name-specifier. (Note that this function is only used
5725 to parse the components of a nested-name-specifier.) */
5730 }
5733 }
5735 /* Return true if we are looking at a compound-literal, false otherwise. */
5737 static bool
5739 {
5740 /* Consume the `('. */
5745 /* Skip tokens until the next token is a closing parenthesis.
5746 If we find the closing `)', and the next token is a `{', then
5747 we are looking at a compound-literal. */
5748 bool compound_literal_p
5753 /* Roll back the tokens we skipped. */
5757 }
5759 /* Parse a postfix-expression.
5761 postfix-expression:
5762 primary-expression
5763 postfix-expression [ expression ]
5764 postfix-expression ( expression-list [opt] )
5765 simple-type-specifier ( expression-list [opt] )
5766 typename :: [opt] nested-name-specifier identifier
5767 ( expression-list [opt] )
5768 typename :: [opt] nested-name-specifier template [opt] template-id
5769 ( expression-list [opt] )
5770 postfix-expression . template [opt] id-expression
5771 postfix-expression -> template [opt] id-expression
5772 postfix-expression . pseudo-destructor-name
5773 postfix-expression -> pseudo-destructor-name
5774 postfix-expression ++
5775 postfix-expression --
5776 dynamic_cast < type-id > ( expression )
5777 static_cast < type-id > ( expression )
5778 reinterpret_cast < type-id > ( expression )
5779 const_cast < type-id > ( expression )
5780 typeid ( expression )
5781 typeid ( type-id )
5783 GNU Extension:
5785 postfix-expression:
5786 ( type-id ) { initializer-list , [opt] }
5788 This extension is a GNU version of the C99 compound-literal
5789 construct. (The C99 grammar uses `type-name' instead of `type-id',
5790 but they are essentially the same concept.)
5792 If ADDRESS_P is true, the postfix expression is the operand of the
5793 `&' operator. CAST_P is true if this expression is the target of a
5794 cast.
5796 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5797 class member access expressions [expr.ref].
5799 Returns a representation of the expression. */
5801 static tree
5805 {
5807 location_t loc;
5814 /* Peek at the next token. */
5817 /* Some of the productions are determined by keywords. */
5820 {
5825 {
5826 tree type;
5827 tree expression;
5831 /* All of these can be handled in the same way from the point
5832 of view of parsing. Begin by consuming the token
5833 identifying the cast. */
5836 /* New types cannot be defined in the cast. */
5838 parser->type_definition_forbidden_message
5841 /* Look for the opening `<'. */
5843 /* Parse the type to which we are casting. */
5848 /* Look for the closing `>'. */
5850 /* Restore the old message. */
5853 bool saved_greater_than_is_operator_p
5857 /* And the expression which is being cast. */
5862 parser->greater_than_is_operator_p
5865 /* Only type conversions to integral or enumeration types
5866 can be used in constant-expressions. */
5872 {
5874 postfix_expression
5878 postfix_expression
5882 postfix_expression
5884 tf_warning_or_error);
5887 postfix_expression
5892 }
5893 }
5897 {
5898 tree type;
5902 /* Consume the `typeid' token. */
5904 /* Look for the `(' token. */
5906 /* Types cannot be defined in a `typeid' expression. */
5908 parser->type_definition_forbidden_message
5910 /* We can't be sure yet whether we're looking at a type-id or an
5911 expression. */
5913 /* Try a type-id first. */
5918 /* Look for the `)' token. Otherwise, we can't be sure that
5919 we're not looking at an expression: consider `typeid (int
5920 (3))', for example. */
5922 /* If all went well, simply lookup the type-id. */
5925 /* Otherwise, fall back to the expression variant. */
5926 else
5927 {
5928 tree expression;
5930 /* Look for an expression. */
5932 /* Compute its typeid. */
5934 /* Look for the `)' token. */
5936 }
5937 /* Restore the saved message. */
5939 /* `typeid' may not appear in an integral constant expression. */
5942 }
5946 {
5947 tree type;
5948 /* The syntax permitted here is the same permitted for an
5949 elaborated-type-specifier. */
5954 }
5958 {
5962 {
5967 }
5969 {
5974 }
5975 else
5976 {
5977 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5980 }
5982 postfix_expression =
5986 {
5990 }
5992 {
5997 }
5998 else
5999 {
6001 postfix_expression);
6005 }
6007 }
6010 {
6013 tree p;
6027 tf_warning_or_error);
6030 tf_warning_or_error);
6031 else
6032 {
6036 }
6038 }
6041 {
6042 tree type;
6044 /* If the next thing is a simple-type-specifier, we may be
6045 looking at a functional cast. We could also be looking at
6046 an id-expression. So, we try the functional cast, and if
6047 that doesn't work we fall back to the primary-expression. */
6049 /* Look for the simple-type-specifier. */
6052 CP_PARSER_FLAGS_NONE);
6053 /* Parse the cast itself. */
6055 postfix_expression
6057 /* If that worked, we're done. */
6061 /* If the functional-cast didn't work out, try a
6062 compound-literal. */
6065 {
6070 /* Avoid calling cp_parser_type_id pointlessly, see comment
6071 in cp_parser_cast_expression about c++/29234. */
6074 else
6075 {
6076 /* Parse the type. */
6081 /* Look for the `)'. */
6083 }
6085 /* If things aren't going well, there's no need to
6086 keep going. */
6088 {
6090 /* Parse the brace-enclosed initializer list. */
6093 }
6094 /* If that worked, we're definitely looking at a
6095 compound-literal expression. */
6097 {
6098 /* Warn the user that a compound literal is not
6099 allowed in standard C++. */
6102 /* For simplicity, we disallow compound literals in
6103 constant-expressions. We could
6104 allow compound literals of integer type, whose
6105 initializer was a constant, in constant
6106 expressions. Permitting that usage, as a further
6107 extension, would not change the meaning of any
6108 currently accepted programs. (Of course, as
6109 compound literals are not part of ISO C++, the
6110 standard has nothing to say.) */
6112 NIC_NCC))
6113 {
6116 }
6117 /* Form the representation of the compound-literal. */
6118 postfix_expression
6120 tf_warning_or_error);
6122 }
6123 }
6125 /* It must be a primary-expression. */
6126 postfix_expression
6129 decltype_p,
6131 }
6133 }
6135 /* Note that we don't need to worry about calling build_cplus_new on a
6136 class-valued CALL_EXPR in decltype when it isn't the end of the
6137 postfix-expression; unary_complex_lvalue will take care of that for
6138 all these cases. */
6140 /* Keep looping until the postfix-expression is complete. */
6142 {
6146 /* It is not a Koenig lookup function call. */
6147 postfix_expression
6150 /* Peek at the next token. */
6154 {
6157 {
6159 "two consecutive %<[%> shall "
6162 }
6163 postfix_expression
6165 postfix_expression,
6167 decltype_p);
6173 /* postfix-expression ( expression-list [opt] ) */
6174 {
6184 is_builtin_constant_p
6187 {
6188 /* The whole point of __builtin_constant_p is to allow
6189 non-constant expressions to appear as arguments. */
6190 saved_integral_constant_expression_p
6192 saved_non_integral_constant_expression_p
6195 }
6196 args = (cp_parser_parenthesized_expression_list
6202 {
6203 parser->integral_constant_expression_p
6205 parser->non_integral_constant_expression_p
6207 }
6210 {
6213 }
6215 /* Function calls are not permitted in
6216 constant-expressions. */
6219 NIC_FUNC_CALL))
6220 {
6224 }
6229 {
6231 {
6233 {
6236 postfix_expression
6238 complain);
6239 }
6240 else
6241 postfix_expression
6243 }
6244 /* We do not perform argument-dependent lookup if
6245 normal lookup finds a non-function, in accordance
6246 with the expected resolution of DR 218. */
6249 {
6253 /* Do not do argument dependent lookup if regular
6254 lookup finds a member function or a block-scope
6255 function declaration. [basic.lookup.argdep]/3 */
6258 {
6261 postfix_expression
6263 complain);
6264 }
6265 }
6266 }
6269 {
6279 "%<memset%> used with constant zero length "
6280 "parameter; this could be due to transposed "
6283 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6284 to avoid leaking those into folder and middle-end. */
6286 tree arg;
6290 }
6293 {
6303 {
6304 postfix_expression
6308 }
6311 {
6312 postfix_expression
6313 = (build_new_method_call
6319 complain));
6320 }
6321 else
6322 postfix_expression
6326 complain);
6327 }
6331 postfix_expression = (build_offset_ref_call_from_tree
6333 complain));
6335 /* A call to a static class member, or a namespace-scope
6336 function. */
6337 postfix_expression
6340 koenig_p,
6341 complain);
6342 else
6343 /* All other function calls. */
6344 postfix_expression
6347 koenig_p,
6348 complain);
6352 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6356 }
6361 /* postfix-expression . template [opt] id-expression
6362 postfix-expression . pseudo-destructor-name
6363 postfix-expression -> template [opt] id-expression
6364 postfix-expression -> pseudo-destructor-name */
6366 /* Consume the `.' or `->' operator. */
6369 postfix_expression
6371 postfix_expression,
6378 /* postfix-expression ++ */
6379 /* Consume the `++' token. */
6381 /* Generate a representation for the complete expression. */
6382 postfix_expression
6384 POSTINCREMENT_EXPR);
6385 /* Increments may not appear in constant-expressions. */
6393 /* postfix-expression -- */
6394 /* Consume the `--' token. */
6396 /* Generate a representation for the complete expression. */
6397 postfix_expression
6399 POSTDECREMENT_EXPR);
6400 /* Decrements may not appear in constant-expressions. */
6412 else
6414 }
6415 }
6417 /* We should never get here. */
6420 }
6422 /* This function parses Cilk Plus array notations. If a normal array expr. is
6423 parsed then the array index is passed back to the caller through *INIT_INDEX
6424 and the function returns a NULL_TREE. If array notation expr. is parsed,
6425 then *INIT_INDEX is ignored by the caller and the function returns
6426 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6427 error_mark_node. */
6429 static tree
6431 tree array_value)
6432 {
6436 {
6439 }
6448 {
6451 }
6453 {
6454 /* Consume the ':'. */
6457 /* If we are here, then we have a case like this A[:]. */
6459 {
6463 }
6467 }
6468 else
6469 {
6470 /* If we are here, then there are three valid possibilities:
6471 1. ARRAY [ EXP ]
6472 2. ARRAY [ EXP : EXP ]
6473 3. ARRAY [ EXP : EXP : EXP ] */
6477 {
6478 /* This indicates that we have a normal array expression. */
6481 }
6483 /* Consume the ':'. */
6487 {
6490 }
6491 }
6496 {
6500 }
6506 }
6508 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6509 by cp_parser_builtin_offsetof. We're looking for
6511 postfix-expression [ expression ]
6512 postfix-expression [ braced-init-list ] (C++11)
6514 FOR_OFFSETOF is set if we're being called in that context, which
6515 changes how we deal with integer constant expressions. */
6517 static tree
6519 tree postfix_expression,
6522 {
6527 /* Consume the `[' token. */
6533 /* Parse the index expression. */
6534 /* ??? For offsetof, there is a question of what to allow here. If
6535 offsetof is not being used in an integral constant expression context,
6536 then we *could* get the right answer by computing the value at runtime.
6537 If we are in an integral constant expression context, then we might
6538 could accept any constant expression; hard to say without analysis.
6539 Rather than open the barn door too wide right away, allow only integer
6540 constant expressions here. */
6543 else
6544 {
6546 {
6553 {
6555 "braced list index is not allowed with array "
6559 }
6560 }
6562 {
6563 /* Here are have these two options:
6564 ARRAY[EXP : EXP] - Array notation expr with default
6565 stride of 1.
6566 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6567 stride. */
6569 postfix_expression);
6572 }
6573 else
6575 }
6579 /* Look for the closing `]'. */
6582 /* Build the ARRAY_REF. */
6586 /* When not doing offsetof, array references are not permitted in
6587 constant-expressions. */
6593 }
6595 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6596 by cp_parser_builtin_offsetof. We're looking for
6598 postfix-expression . template [opt] id-expression
6599 postfix-expression . pseudo-destructor-name
6600 postfix-expression -> template [opt] id-expression
6601 postfix-expression -> pseudo-destructor-name
6603 FOR_OFFSETOF is set if we're being called in that context. That sorta
6604 limits what of the above we'll actually accept, but nevermind.
6605 TOKEN_TYPE is the "." or "->" token, which will already have been
6606 removed from the stream. */
6608 static tree
6611 tree postfix_expression,
6613 location_t location)
6614 {
6615 tree name;
6620 /* If this is a `->' operator, dereference the pointer. */
6623 tf_warning_or_error);
6624 /* Check to see whether or not the expression is type-dependent. */
6626 /* The identifier following the `->' or `.' is not qualified. */
6632 /* Enter the scope corresponding to the type of the object
6633 given by the POSTFIX_EXPRESSION. */
6635 {
6637 /* According to the standard, no expression should ever have
6638 reference type. Unfortunately, we do not currently match
6639 the standard in this respect in that our internal representation
6640 of an expression may have reference type even when the standard
6641 says it does not. Therefore, we have to manually obtain the
6642 underlying type here. */
6644 /* The type of the POSTFIX_EXPRESSION must be complete. */
6646 {
6648 postfix_expression);
6650 }
6651 /* Unlike the object expression in other contexts, *this is not
6652 required to be of complete type for purposes of class member
6653 access (5.2.5) outside the member function body. */
6657 /* Let the name lookup machinery know that we are processing a
6658 class member access expression. */
6660 /* If something went wrong, we want to be able to discern that case,
6661 as opposed to the case where there was no SCOPE due to the type
6662 of expression being dependent. */
6665 /* If the SCOPE was erroneous, make the various semantic analysis
6666 functions exit quickly -- and without issuing additional error
6667 messages. */
6670 }
6672 /* Assume this expression is not a pseudo-destructor access. */
6675 /* If the SCOPE is a scalar type, then, if this is a valid program,
6676 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6677 is type dependent, it can be pseudo-destructor-name or something else.
6678 Try to parse it as pseudo-destructor-name first. */
6680 {
6681 tree s;
6682 tree type;
6685 /* Parse the pseudo-destructor-name. */
6694 {
6696 postfix_expression
6699 }
6700 }
6703 {
6704 /* If the SCOPE is not a scalar type, we are looking at an
6705 ordinary class member access expression, rather than a
6706 pseudo-destructor-name. */
6709 /* Parse the id-expression. */
6710 name = (cp_parser_id_expression
6717 /* In general, build a SCOPE_REF if the member name is qualified.
6718 However, if the name was not dependent and has already been
6719 resolved; there is no need to build the SCOPE_REF. For example;
6721 struct X { void f(); };
6722 template <typename T> void f(T* t) { t->X::f(); }
6724 Even though "t" is dependent, "X::f" is not and has been resolved
6725 to a BASELINK; there is no need to include scope information. */
6727 /* But we do need to remember that there was an explicit scope for
6728 virtual function calls. */
6732 /* If the name is a template-id that names a type, we will get a
6733 TYPE_DECL here. That is invalid code. */
6735 {
6738 }
6739 else
6740 {
6742 {
6744 {
6748 }
6749 else
6752 name,
6753 template_p);
6757 }
6759 adjust_result_of_qualified_name_lookup
6761 postfix_expression
6763 template_p,
6764 tf_warning_or_error);
6765 }
6766 }
6768 /* We no longer need to look up names in the scope of the object on
6769 the left-hand side of the `.' or `->' operator. */
6772 /* Outside of offsetof, these operators may not appear in
6773 constant-expressions. */
6775 && (cp_parser_non_integral_constant_expression
6780 }
6782 /* Cache of LITERAL_ZERO_P constants. */
6786 /* Parse a parenthesized expression-list.
6788 expression-list:
6789 assignment-expression
6790 expression-list, assignment-expression
6792 attribute-list:
6793 expression-list
6794 identifier
6795 identifier, expression-list
6797 CAST_P is true if this expression is the target of a cast.
6799 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6800 argument pack.
6802 Returns a vector of trees. Each element is a representation of an
6803 assignment-expression. NULL is returned if the ( and or ) are
6804 missing. An empty, but allocated, vector is returned on no
6805 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6806 if we are parsing an attribute list for an attribute that wants a
6807 plain identifier argument, normal_attr for an attribute that wants
6808 an expression, or non_attr if we aren't parsing an attribute list. If
6809 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6810 not all of the expressions in the list were constant.
6811 WANT_LITERAL_ZERO_P is true if the caller is interested in
6812 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6813 immediately, this can be removed. */
6822 {
6828 /* Assume all the expressions will be constant. */
6837 /* Within a parenthesized expression, a `>' token is always
6838 the greater-than operator. */
6839 saved_greater_than_is_operator_p
6843 /* Consume expressions until there are no more. */
6846 {
6847 tree expr;
6849 /* At the beginning of attribute lists, check to see if the
6850 next token is an identifier. */
6853 {
6856 /* Consume the identifier. */
6858 /* Save the identifier. */
6860 }
6861 else
6862 {
6865 /* Parse the next assignment-expression. */
6867 {
6868 /* A braced-init-list. */
6874 }
6876 {
6877 expr = (cp_parser_constant_expression
6882 }
6883 else
6884 {
6888 {
6895 /* If a parameter is literal zero alone, remember it
6896 for -Wmemset-transposed-args warning. */
6899 && want_literal_zero_p
6901 == CPP_COMMA
6904 {
6911 else
6912 {
6917 }
6918 /* Consume the 0 token (or '\0', 0LL etc.). */
6920 }
6924 }
6927 cast_p);
6928 }
6933 /* If we have an ellipsis, then this is an expression
6934 expansion. */
6937 {
6938 /* Consume the `...'. */
6941 /* Build the argument pack. */
6943 }
6945 /* Add it to the list. We add error_mark_node
6946 expressions to the list, so that we can still tell if
6947 the correct form for a parenthesized expression-list
6948 is found. That gives better errors. */
6953 }
6955 /* After the first item, attribute lists look the same as
6956 expression lists. */
6959 get_comma:;
6960 /* If the next token isn't a `,', then we are done. */
6964 /* Otherwise, consume the `,' and keep going. */
6966 }
6969 {
6972 skip_comma:;
6973 /* We try and resync to an unnested comma, as that will give the
6974 user better diagnostics. */
6982 {
6983 parser->greater_than_is_operator_p
6986 }
6987 }
6989 parser->greater_than_is_operator_p
6996 }
6998 /* Parse a pseudo-destructor-name.
7000 pseudo-destructor-name:
7001 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7002 :: [opt] nested-name-specifier template template-id :: ~ type-name
7003 :: [opt] nested-name-specifier [opt] ~ type-name
7005 If either of the first two productions is used, sets *SCOPE to the
7006 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7007 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7008 or ERROR_MARK_NODE if the parse fails. */
7010 static void
7012 tree object,
7015 {
7018 /* Handle ~auto. */
7022 {
7025 "%<~auto%> only available with "
7032 }
7034 /* Assume that things will not work out. */
7037 /* Look for the optional `::' operator. */
7039 /* Look for the optional nested-name-specifier. */
7040 nested_name_specifier_p
7047 /* Now, if we saw a nested-name-specifier, we might be doing the
7048 second production. */
7051 {
7052 /* Consume the `template' keyword. */
7054 /* Parse the template-id. */
7058 class_type,
7060 /* Look for the `::' token. */
7062 }
7063 /* If the next token is not a `~', then there might be some
7064 additional qualification. */
7066 {
7067 /* At this point, we're looking for "type-name :: ~". The type-name
7068 must not be a class-name, since this is a pseudo-destructor. So,
7069 it must be either an enum-name, or a typedef-name -- both of which
7070 are just identifiers. So, we peek ahead to check that the "::"
7071 and "~" tokens are present; if they are not, then we can avoid
7072 calling type_name. */
7076 {
7079 }
7081 /* Look for the type-name. */
7086 /* Look for the `::' token. */
7088 }
7089 else
7092 /* Look for the `~'. */
7095 /* Once we see the ~, this has to be a pseudo-destructor. */
7099 /* Look for the type-name again. We are not responsible for
7100 checking that it matches the first type-name. */
7102 }
7104 /* Parse a unary-expression.
7106 unary-expression:
7107 postfix-expression
7108 ++ cast-expression
7109 -- cast-expression
7110 unary-operator cast-expression
7111 sizeof unary-expression
7112 sizeof ( type-id )
7113 alignof ( type-id ) [C++0x]
7114 new-expression
7115 delete-expression
7117 GNU Extensions:
7119 unary-expression:
7120 __extension__ cast-expression
7121 __alignof__ unary-expression
7122 __alignof__ ( type-id )
7123 alignof unary-expression [C++0x]
7124 __real__ cast-expression
7125 __imag__ cast-expression
7126 && identifier
7127 sizeof ( type-id ) { initializer-list , [opt] }
7128 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7129 __alignof__ ( type-id ) { initializer-list , [opt] }
7131 ADDRESS_P is true iff the unary-expression is appearing as the
7132 operand of the `&' operator. CAST_P is true if this expression is
7133 the target of a cast.
7135 Returns a representation of the expression. */
7137 static tree
7140 {
7144 /* Peek at the next token. */
7146 /* Some keywords give away the kind of expression. */
7148 {
7152 {
7155 {
7158 location_t first_loc;
7161 /* Consume the token. */
7164 /* Parse the operand. */
7169 else
7170 {
7171 /* ISO C++ defines alignof only with types, not with
7172 expressions. So pedwarn if alignof is used with a non-
7173 type expression. However, __alignof__ is ok. */
7176 "ISO C++ does not allow %<alignof%> "
7180 }
7181 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7182 SIZEOF_EXPR with the original operand. */
7184 {
7186 {
7188 {
7191 error_mark_node));
7193 }
7194 else
7198 }
7200 }
7202 }
7211 {
7212 /* The saved value of the PEDANTIC flag. */
7214 tree expr;
7216 /* Save away the PEDANTIC flag. */
7218 /* Parse the cast-expression. */
7220 /* Restore the PEDANTIC flag. */
7224 }
7228 {
7229 tree expression;
7231 /* Consume the `__real__' or `__imag__' token. */
7233 /* Parse the cast-expression. */
7235 /* Create the complete representation. */
7239 expression,
7240 tf_warning_or_error);
7241 }
7249 {
7250 tree expr;
7260 parser->type_definition_forbidden_message
7263 saved_integral_constant_expression_p
7265 saved_non_integral_constant_expression_p
7269 saved_greater_than_is_operator_p
7281 parser->greater_than_is_operator_p
7284 parser->integral_constant_expression_p
7286 parser->non_integral_constant_expression_p
7293 }
7297 }
7298 }
7300 /* Look for the `:: new' and `:: delete', which also signal the
7301 beginning of a new-expression, or delete-expression,
7302 respectively. If the next token is `::', then it might be one of
7303 these. */
7305 {
7308 /* See if the token after the `::' is one of the keywords in
7309 which we're interested. */
7311 /* If it's `new', we have a new-expression. */
7314 /* Similarly, for `delete'. */
7317 }
7319 /* Look for a unary operator. */
7321 /* The `++' and `--' operators can be handled similarly, even though
7322 they are not technically unary-operators in the grammar. */
7324 {
7329 /* Handle the GNU address-of-label extension. */
7332 {
7333 tree identifier;
7334 tree expression;
7337 /* Consume the '&&' token. */
7339 /* Look for the identifier. */
7341 /* Create an expression representing the address. */
7344 NIC_ADDR_LABEL))
7347 }
7348 }
7350 {
7351 tree cast_expression;
7357 /* Consume the operator token. */
7359 /* Parse the cast-expression. */
7360 cast_expression
7365 pidk);
7366 /* Now, build an appropriate representation. */
7368 {
7372 RO_UNARY_STAR,
7373 complain);
7378 /* Fall through. */
7381 cast_expression,
7382 complain);
7389 /* Fall through. */
7399 }
7403 non_constant_p))
7407 }
7411 decltype_p,
7412 pidk);
7413 }
7415 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7416 unary-operator, the corresponding tree code is returned. */
7418 static enum tree_code
7420 {
7422 {
7443 }
7444 }
7446 /* Parse a new-expression.
7448 new-expression:
7449 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7450 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7452 Returns a representation of the expression. */
7454 static tree
7456 {
7459 tree type;
7462 tree ret;
7464 /* Look for the optional `::' operator. */
7465 global_scope_p
7469 /* Look for the `new' operator. */
7471 /* There's no easy way to tell a new-placement from the
7472 `( type-id )' construct. */
7474 /* Look for a new-placement. */
7476 /* If that didn't work out, there's no new-placement. */
7478 {
7482 }
7484 /* If the next token is a `(', then we have a parenthesized
7485 type-id. */
7487 {
7491 /* Consume the `('. */
7494 /* Parse the type-id. */
7495 parser->type_definition_forbidden_message
7500 /* Look for the closing `)'. */
7503 /* There should not be a direct-new-declarator in this production,
7504 but GCC used to allowed this, so we check and emit a sensible error
7505 message for this case. */
7507 {
7513 }
7514 }
7515 /* Otherwise, there must be a new-type-id. */
7516 else
7519 /* If the next token is a `(' or '{', then we have a new-initializer. */
7523 else
7526 /* A new-expression may not appear in an integral constant
7527 expression. */
7530 else
7531 {
7532 /* Create a representation of the new-expression. */
7534 tf_warning_or_error);
7535 }
7543 }
7545 /* Parse a new-placement.
7547 new-placement:
7548 ( expression-list )
7550 Returns the same representation as for an expression-list. */
7554 {
7557 /* Parse the expression-list. */
7558 expression_list = (cp_parser_parenthesized_expression_list
7567 }
7569 /* Parse a new-type-id.
7571 new-type-id:
7572 type-specifier-seq new-declarator [opt]
7574 Returns the TYPE allocated. If the new-type-id indicates an array
7575 type, *NELTS is set to the number of elements in the last array
7576 bound; the TYPE will not include the last array bound. */
7578 static tree
7580 {
7581 cp_decl_specifier_seq type_specifier_seq;
7587 /* The type-specifier sequence must not contain type definitions.
7588 (It cannot contain declarations of new types either, but if they
7589 are not definitions we will catch that because they are not
7590 complete.) */
7592 parser->type_definition_forbidden_message
7594 /* Parse the type-specifier-seq. */
7598 /* Restore the old message. */
7604 /* Parse the new-declarator. */
7607 /* Determine the number of elements in the last array dimension, if
7608 any. */
7610 /* Skip down to the last array dimension. */
7615 {
7618 }
7623 {
7626 }
7629 {
7636 else
7638 }
7641 }
7643 /* Parse an (optional) new-declarator.
7645 new-declarator:
7646 ptr-operator new-declarator [opt]
7647 direct-new-declarator
7649 Returns the declarator. */
7653 {
7656 cp_cv_quals cv_quals;
7658 /* We don't know if there's a ptr-operator next, or not. */
7660 /* Look for a ptr-operator. */
7662 /* If that worked, look for more new-declarators. */
7664 {
7667 /* Parse another optional declarator. */
7670 declarator = cp_parser_make_indirect_declarator
7674 }
7676 /* If the next token is a `[', there is a direct-new-declarator. */
7681 }
7683 /* Parse a direct-new-declarator.
7685 direct-new-declarator:
7686 [ expression ]
7687 direct-new-declarator [constant-expression]
7689 */
7693 {
7697 {
7698 tree expression;
7701 /* Look for the opening `['. */
7706 /* The standard requires that the expression have integral
7707 type. DR 74 adds enumeration types. We believe that the
7708 real intent is that these expressions be handled like the
7709 expression in a `switch' condition, which also allows
7710 classes with a single conversion to integral or
7711 enumeration type. */
7713 {
7714 expression
7716 expression,
7719 {
7721 "expression in new-declarator must have integral "
7724 }
7725 }
7727 /* Look for the closing `]'. */
7730 /* Add this bound to the declarator. */
7733 /* If the next token is not a `[', then there are no more
7734 bounds. */
7737 }
7740 }
7742 /* Parse a new-initializer.
7744 new-initializer:
7745 ( expression-list [opt] )
7746 braced-init-list
7748 Returns a representation of the expression-list. */
7752 {
7756 {
7757 tree t;
7764 }
7765 else
7766 expression_list = (cp_parser_parenthesized_expression_list
7772 }
7774 /* Parse a delete-expression.
7776 delete-expression:
7777 :: [opt] delete cast-expression
7778 :: [opt] delete [ ] cast-expression
7780 Returns a representation of the expression. */
7782 static tree
7784 {
7787 tree expression;
7789 /* Look for the optional `::' operator. */
7790 global_scope_p
7794 /* Look for the `delete' keyword. */
7796 /* See if the array syntax is in use. */
7798 {
7799 /* Consume the `[' token. */
7801 /* Look for the `]' token. */
7803 /* Remember that this is the `[]' construct. */
7805 }
7806 else
7809 /* Parse the cast-expression. */
7812 /* A delete-expression may not appear in an integral constant
7813 expression. */
7818 tf_warning_or_error);
7819 }
7821 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7822 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7823 0 otherwise. */
7825 static int
7827 {
7830 {
7872 /* In ((type ()) () the last () isn't a valid cast-expression,
7873 so the whole must be parsed as postfix-expression. */
7878 /* '[' may start a primary-expression in obj-c++ and in C++11,
7879 as a lambda-expression, eg, '(void)[]{}'. */
7886 /* '++' and '--' may or may not start a cast-expression:
7888 struct T { void operator++(int); };
7889 void f() { (T())++; }
7891 vs
7893 int a;
7894 (int)++a; */
7899 }
7900 }
7902 /* Parse a cast-expression.
7904 cast-expression:
7905 unary-expression
7906 ( type-id ) cast-expression
7908 ADDRESS_P is true iff the unary-expression is appearing as the
7909 operand of the `&' operator. CAST_P is true if this expression is
7910 the target of a cast.
7912 Returns a representation of the expression. */
7914 static tree
7917 {
7918 /* If it's a `(', then we might be looking at a cast. */
7920 {
7926 /* There's no way to know yet whether or not this is a cast.
7927 For example, `(int (3))' is a unary-expression, while `(int)
7928 3' is a cast. So, we resort to parsing tentatively. */
7930 /* Types may not be defined in a cast. */
7932 parser->type_definition_forbidden_message
7934 /* Consume the `('. */
7936 /* A very tricky bit is that `(struct S) { 3 }' is a
7937 compound-literal (which we permit in C++ as an extension).
7938 But, that construct is not a cast-expression -- it is a
7939 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7940 is legal; if the compound-literal were a cast-expression,
7941 you'd need an extra set of parentheses.) But, if we parse
7942 the type-id, and it happens to be a class-specifier, then we
7943 will commit to the parse at that point, because we cannot
7944 undo the action that is done when creating a new class. So,
7945 then we cannot back up and do a postfix-expression.
7947 Another tricky case is the following (c++/29234):
7949 struct S { void operator () (); };
7951 void foo ()
7952 {
7953 ( S()() );
7954 }
7956 As a type-id we parse the parenthesized S()() as a function
7957 returning a function, groktypename complains and we cannot
7958 back up in this case either.
7960 Therefore, we scan ahead to the closing `)', and check to see
7961 if the tokens after the `)' can start a cast-expression. Otherwise
7962 we are dealing with an unary-expression, a postfix-expression
7963 or something else.
7965 Yet another tricky case, in C++11, is the following (c++/54891):
7967 (void)[]{};
7969 The issue is that usually, besides the case of lambda-expressions,
7970 the parenthesized type-id cannot be followed by '[', and, eg, we
7971 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7972 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7973 we don't commit, we try a cast-expression, then an unary-expression.
7975 Save tokens so that we can put them back. */
7978 /* We may be looking at a cast-expression. */
7981 cast_expression
7984 /* Roll back the tokens we skipped. */
7986 /* If we aren't looking at a cast-expression, simulate an error so
7987 that the call to cp_parser_error_occurred below returns true. */
7990 else
7991 {
7994 /* Look for the type-id. */
7996 /* Look for the closing `)'. */
7999 }
8001 /* Restore the saved message. */
8004 /* At this point this can only be either a cast or a
8005 parenthesized ctor such as `(T ())' that looks like a cast to
8006 function returning T. */
8008 {
8009 /* Only commit if the cast-expression doesn't start with
8010 '++', '--', or '[' in C++11. */
8018 pidk);
8021 {
8022 /* Warn about old-style casts, if so requested. */
8029 /* Only type conversions to integral or enumeration types
8030 can be used in constant-expressions. */
8033 NIC_CAST))
8036 /* Perform the cast. */
8039 }
8040 }
8041 else
8043 }
8045 /* If we get here, then it's not a cast, so it must be a
8046 unary-expression. */
8049 }
8051 /* Parse a binary expression of the general form:
8053 pm-expression:
8054 cast-expression
8055 pm-expression .* cast-expression
8056 pm-expression ->* cast-expression
8058 multiplicative-expression:
8059 pm-expression
8060 multiplicative-expression * pm-expression
8061 multiplicative-expression / pm-expression
8062 multiplicative-expression % pm-expression
8064 additive-expression:
8065 multiplicative-expression
8066 additive-expression + multiplicative-expression
8067 additive-expression - multiplicative-expression
8069 shift-expression:
8070 additive-expression
8071 shift-expression << additive-expression
8072 shift-expression >> additive-expression
8074 relational-expression:
8075 shift-expression
8076 relational-expression < shift-expression
8077 relational-expression > shift-expression
8078 relational-expression <= shift-expression
8079 relational-expression >= shift-expression
8081 GNU Extension:
8083 relational-expression:
8084 relational-expression <? shift-expression
8085 relational-expression >? shift-expression
8087 equality-expression:
8088 relational-expression
8089 equality-expression == relational-expression
8090 equality-expression != relational-expression
8092 and-expression:
8093 equality-expression
8094 and-expression & equality-expression
8096 exclusive-or-expression:
8097 and-expression
8098 exclusive-or-expression ^ and-expression
8100 inclusive-or-expression:
8101 exclusive-or-expression
8102 inclusive-or-expression | exclusive-or-expression
8104 logical-and-expression:
8105 inclusive-or-expression
8106 logical-and-expression && inclusive-or-expression
8108 logical-or-expression:
8109 logical-and-expression
8110 logical-or-expression || logical-and-expression
8112 All these are implemented with a single function like:
8114 binary-expression:
8115 simple-cast-expression
8116 binary-expression <token> binary-expression
8118 CAST_P is true if this expression is the target of a cast.
8120 The binops_by_token map is used to get the tree codes for each <token> type.
8121 binary-expressions are associated according to a precedence table. */
8123 #define TOKEN_PRECEDENCE(token) \
8124 (((token->type == CPP_GREATER \
8125 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8126 && !parser->greater_than_is_operator_p) \
8127 ? PREC_NOT_OPERATOR \
8128 : binops_by_token[token->type].prec)
8130 static tree
8136 {
8137 cp_parser_expression_stack stack;
8139 cp_parser_expression_stack_entry current;
8140 tree rhs;
8144 tree overload;
8146 /* Parse the first expression. */
8157 {
8158 /* Get an operator token. */
8164 {
8166 "%<>>%> operator is treated"
8170 }
8174 /* Popping an entry off the stack means we completed a subexpression:
8175 - either we found a token which is not an operator (`>' where it is not
8176 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8177 will happen repeatedly;
8178 - or, we found an operator which has lower priority. This is the case
8179 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8180 parsing `3 * 4'. */
8182 {
8185 else
8187 }
8189 get_rhs:
8193 /* We used the operator token. */
8196 /* For "false && x" or "true || x", x will never be executed;
8197 disable warnings while evaluating it. */
8203 /* Extract another operand. It may be the RHS of this expression
8204 or the LHS of a new, higher priority expression. */
8209 /* Get another operator token. Look up its precedence to avoid
8210 building a useless (immediately popped) stack entry for common
8211 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8215 {
8216 /* ... and prepare to parse the RHS of the new, higher priority
8217 expression. Since precedence levels on the stack are
8218 monotonically increasing, we do not have to care about
8219 stack overflows. */
8228 pop:
8230 /* If the stack is not empty, we have parsed into LHS the right side
8231 (`4' in the example above) of an expression we had suspended.
8232 We can use the information on the stack to recover the LHS (`3')
8233 from the stack together with the tree code (`MULT_EXPR'), and
8234 the precedence of the higher level subexpression
8235 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8236 which will be used to actually build the additive expression. */
8241 }
8243 /* Undo the disabling of warnings done above. */
8252 /* Avoid warning for !!x == y. */
8257 /* Avoid warning for !b == y where b is boolean. */
8261 /* Avoid warning for !!b == y where b is boolean. */
8269 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8270 ERROR_MARK for everything that is not a binary expression.
8271 This makes warn_about_parentheses miss some warnings that
8272 involve unary operators. For unary expressions we should
8273 pass the correct tree_code unless the unary expression was
8274 surrounded by parentheses.
8275 */
8281 == tcc_comparison
8284 else
8293 /* If the binary operator required the use of an overloaded operator,
8294 then this expression cannot be an integral constant-expression.
8295 An overloaded operator can be used even if both operands are
8296 otherwise permissible in an integral constant-expression if at
8297 least one of the operands is of enumeration type. */
8301 NIC_OVERLOADED))
8303 }
8306 }
8308 static tree
8313 {
8316 }
8318 /* Parse the `? expression : assignment-expression' part of a
8319 conditional-expression. The LOGICAL_OR_EXPR is the
8320 logical-or-expression that started the conditional-expression.
8321 Returns a representation of the entire conditional-expression.
8323 This routine is used by cp_parser_assignment_expression.
8325 ? expression : assignment-expression
8327 GNU Extensions:
8329 ? : assignment-expression */
8331 static tree
8333 {
8334 tree expr;
8335 tree assignment_expr;
8339 /* Consume the `?' token. */
8344 {
8347 /* Implicit true clause. */
8351 }
8352 else
8353 {
8356 /* Parse the expression. */
8359 c_inhibit_evaluation_warnings +=
8363 }
8365 /* The next token should be a `:'. */
8367 /* Parse the assignment-expression. */
8371 /* Build the conditional-expression. */
8373 expr,
8374 assignment_expr,
8375 tf_warning_or_error);
8376 }
8378 /* Parse an assignment-expression.
8380 assignment-expression:
8381 conditional-expression
8382 logical-or-expression assignment-operator assignment_expression
8383 throw-expression
8385 CAST_P is true if this expression is the target of a cast.
8386 DECLTYPE_P is true if this expression is the operand of decltype.
8388 Returns a representation for the expression. */
8390 static tree
8393 {
8394 tree expr;
8396 /* If the next token is the `throw' keyword, then we're looking at
8397 a throw-expression. */
8400 /* Otherwise, it must be that we are looking at a
8401 logical-or-expression. */
8402 else
8403 {
8404 /* Parse the binary expressions (logical-or-expression). */
8406 decltype_p,
8408 /* If the next token is a `?' then we're actually looking at a
8409 conditional-expression. */
8412 else
8413 {
8416 /* If it's an assignment-operator, we're using the second
8417 production. */
8418 enum tree_code assignment_operator
8421 {
8423 location_t saved_input_location;
8425 /* Parse the right-hand side of the assignment. */
8431 /* An assignment may not appear in a
8432 constant-expression. */
8434 NIC_ASSIGNMENT))
8436 /* Build the assignment expression. Its default
8437 location is the location of the '=' token. */
8441 assignment_operator,
8442 rhs,
8445 }
8446 }
8447 }
8450 }
8452 /* Parse an (optional) assignment-operator.
8454 assignment-operator: one of
8455 = *= /= %= += -= >>= <<= &= ^= |=
8457 GNU Extension:
8459 assignment-operator: one of
8460 <?= >?=
8462 If the next token is an assignment operator, the corresponding tree
8463 code is returned, and the token is consumed. For example, for
8464 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8465 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8466 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8467 operator, ERROR_MARK is returned. */
8469 static enum tree_code
8471 {
8475 /* Peek at the next token. */
8479 {
8525 /* Nothing else is an assignment operator. */
8527 }
8529 /* If it was an assignment operator, consume it. */
8534 }
8536 /* Parse an expression.
8538 expression:
8539 assignment-expression
8540 expression , assignment-expression
8542 CAST_P is true if this expression is the target of a cast.
8543 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8544 except possibly parenthesized or on the RHS of a comma (N3276).
8546 Returns a representation of the expression. */
8548 static tree
8551 {
8556 {
8557 tree assignment_expression;
8559 /* Parse the next assignment-expression. */
8560 assignment_expression
8563 /* We don't create a temporary for a call that is the immediate operand
8564 of decltype or on the RHS of a comma. But when we see a comma, we
8565 need to create a temporary for a call on the LHS. */
8570 assignment_expression
8574 /* If this is the first assignment-expression, we can just
8575 save it away. */
8578 else
8580 assignment_expression,
8582 /* If the next token is not a comma, then we are done with the
8583 expression. */
8586 /* Consume the `,'. */
8589 /* A comma operator cannot appear in a constant-expression. */
8592 }
8595 }
8597 /* Parse a constant-expression.
8599 constant-expression:
8600 conditional-expression
8602 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8603 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8604 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8605 is false, NON_CONSTANT_P should be NULL. */
8607 static tree
8611 {
8615 tree expression;
8617 /* It might seem that we could simply parse the
8618 conditional-expression, and then check to see if it were
8619 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8620 one that the compiler can figure out is constant, possibly after
8621 doing some simplifications or optimizations. The standard has a
8622 precise definition of constant-expression, and we must honor
8623 that, even though it is somewhat more restrictive.
8625 For example:
8627 int i[(2, 3)];
8629 is not a legal declaration, because `(2, 3)' is not a
8630 constant-expression. The `,' operator is forbidden in a
8631 constant-expression. However, GCC's constant-folding machinery
8632 will fold this operation to an INTEGER_CST for `3'. */
8634 /* Save the old settings. */
8636 saved_allow_non_integral_constant_expression_p
8639 /* We are now parsing a constant-expression. */
8641 parser->allow_non_integral_constant_expression_p
8644 /* Although the grammar says "conditional-expression", we parse an
8645 "assignment-expression", which also permits "throw-expression"
8646 and the use of assignment operators. In the case that
8647 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8648 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8649 actually essential that we look for an assignment-expression.
8650 For example, cp_parser_initializer_clauses uses this function to
8651 determine whether a particular assignment-expression is in fact
8652 constant. */
8654 /* Restore the old settings. */
8655 parser->integral_constant_expression_p
8657 parser->allow_non_integral_constant_expression_p
8660 {
8661 /* Require an rvalue constant expression here; that's what our
8662 callers expect. Reference constant expressions are handled
8663 separately in e.g. cp_parser_template_argument. */
8668 }
8671 parser->non_integral_constant_expression_p
8675 }
8677 /* Parse __builtin_offsetof.
8679 offsetof-expression:
8680 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8682 offsetof-member-designator:
8683 id-expression
8684 | offsetof-member-designator "." id-expression
8685 | offsetof-member-designator "[" expression "]"
8686 | offsetof-member-designator "->" id-expression */
8688 static tree
8690 {
8693 cp_id_kind dummy;
8696 /* We're about to accept non-integral-constant things, but will
8697 definitely yield an integral constant expression. Save and
8698 restore these values around our local parsing. */
8702 /* Consume the "__builtin_offsetof" token. */
8704 /* Consume the opening `('. */
8706 /* Parse the type-id. */
8709 /* Look for the `,'. */
8713 /* Build the (type *)null that begins the traditional offsetof macro. */
8715 tf_warning_or_error);
8717 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8721 {
8724 {
8726 /* offsetof-member-designator "[" expression "]" */
8732 /* offsetof-member-designator "->" identifier */
8735 /* FALLTHRU */
8738 /* offsetof-member-designator "." identifier */
8746 /* Consume the ")" token. */
8751 /* Error. We know the following require will fail, but
8752 that gives the proper error message. */
8757 }
8758 }
8760 success:
8763 failure:
8768 }
8770 /* Parse a trait expression.
8772 Returns a representation of the expression, the underlying type
8773 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8775 static tree
8777 {
8778 cp_trait_kind kind;
8784 {
8868 }
8870 /* Consume the token. */
8881 {
8888 }
8890 {
8892 {
8896 {
8899 }
8903 }
8904 }
8908 /* Complete the trait expression, which may mean either processing
8909 the trait expr now or saving it for template instantiation. */
8911 {
8920 }
8921 }
8923 /* Lambdas that appear in variable initializer or default argument scope
8924 get that in their mangling, so we need to record it. We might as well
8925 use the count for function and namespace scopes as well. */
8929 {
8930 tree t;
8935 static void
8937 {
8938 tree_int ti;
8940 /* Once we're inside a function, we ignore other scopes and just push
8941 the function again so that popping works properly. */
8948 {
8949 /* Don't reset the count if we're still in the same function. */
8952 }
8953 }
8955 static void
8957 {
8960 }
8962 static void
8964 {
8967 {
8970 }
8972 }
8974 /* Parse a lambda expression.
8976 lambda-expression:
8977 lambda-introducer lambda-declarator [opt] compound-statement
8979 Returns a representation of the expression. */
8981 static tree
8983 {
8985 tree type;
8993 {
8995 {
8999 }
9001 }
9003 {
9005 {
9008 }
9010 }
9012 /* We may be in the middle of deferred access check. Disable
9013 it now. */
9024 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9027 /* Now that we've started the type, add the capture fields for any
9028 explicit captures. */
9031 {
9032 /* Inside the class, surrounding template-parameter-lists do not apply. */
9033 unsigned int saved_num_template_parameter_lists
9037 bool fully_implicit_function_template_p
9041 bool auto_is_implicit_function_template_parm_p
9052 /* By virtue of defining a local class, a lambda expression has access to
9053 the private variables of enclosing classes. */
9058 {
9064 }
9066 {
9069 }
9071 /* The capture list was built up in reverse order; fix that now. */
9083 parser->fully_implicit_function_template_p
9087 parser->auto_is_implicit_function_template_parm_p
9089 }
9093 /* This field is only used during parsing of the lambda. */
9096 /* This lambda shouldn't have any proxies left at this point. */
9098 /* And now that we're done, push proxies for an enclosing lambda. */
9103 else
9109 }
9111 /* Parse the beginning of a lambda expression.
9113 lambda-introducer:
9114 [ lambda-capture [opt] ]
9116 LAMBDA_EXPR is the current representation of the lambda expression. */
9118 static void
9120 {
9121 /* Need commas after the first capture. */
9124 /* Eat the leading `['. */
9127 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9135 {
9138 }
9141 {
9143 tree capture_id;
9144 tree capture_init_expr;
9148 enum capture_kind_type
9149 {
9150 BY_COPY,
9151 BY_REFERENCE
9152 };
9156 {
9159 }
9163 else
9166 /* Possibly capture `this'. */
9168 {
9178 explicit_init_p);
9180 }
9182 /* Remember whether we want to capture as a reference or not. */
9184 {
9187 }
9189 /* Get the identifier. */
9194 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9195 delimiters, but I modified this to stop on unnested ']' as well. It
9196 was already changed to stop on unnested '}', so the
9197 "closing_parenthesis" name is no more misleading with my change. */
9198 {
9204 }
9206 /* Find the initializer for this capture. */
9210 {
9212 /* An explicit initializer exists. */
9215 "lambda capture initializers "
9221 {
9224 }
9225 }
9226 else
9227 {
9230 /* Turn the identifier into an id-expression. */
9231 capture_init_expr
9236 {
9239 }
9243 {
9246 capture_init_expr);
9249 }
9252 {
9255 capture_init_expr))
9258 }
9260 capture_init_expr
9261 = finish_id_expression
9263 capture_init_expr,
9277 {
9280 }
9281 else
9283 }
9287 {
9292 capture_id);
9296 "capture of %qD redundant with by-reference capture "
9298 }
9301 capture_id,
9302 capture_init_expr,
9304 explicit_init_p);
9305 }
9308 }
9310 /* Parse the (optional) middle of a lambda expression.
9312 lambda-declarator:
9313 < template-parameter-list [opt] >
9314 ( parameter-declaration-clause [opt] )
9315 attribute-specifier [opt]
9316 mutable [opt]
9317 exception-specification [opt]
9318 lambda-return-type-clause [opt]
9320 LAMBDA_EXPR is the current representation of the lambda expression. */
9322 static bool
9324 {
9325 /* 5.1.1.4 of the standard says:
9326 If a lambda-expression does not include a lambda-declarator, it is as if
9327 the lambda-declarator were ().
9328 This means an empty parameter list, no attributes, and no exception
9329 specification. */
9335 /* The template-parameter-list is optional, but must begin with
9336 an opening angle if present. */
9338 {
9341 "lambda templates are only available with "
9350 /* We just processed one more parameter list. */
9352 }
9354 /* The parameter-declaration-clause is optional (unless
9355 template-parameter-list was given), but must begin with an
9356 opening parenthesis if present. */
9358 {
9363 /* Parse parameters. */
9366 /* Default arguments shall not be specified in the
9367 parameter-declaration-clause of a lambda-declarator. */
9377 /* Parse optional `mutable' keyword. */
9379 {
9382 }
9384 /* Parse optional exception specification. */
9387 /* Parse optional trailing return type. */
9389 {
9393 }
9395 /* The function parameters must be in scope all the way until after the
9396 trailing-return-type in case of decltype. */
9398 }
9402 /* Create the function call operator.
9404 Messing with declarators like this is no uglier than building up the
9405 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9406 other code. */
9407 {
9408 cp_decl_specifier_seq return_type_specs;
9410 tree fco;
9417 else
9418 /* Maybe we will deduce the return type later. */
9424 sfk_none);
9429 VIRT_SPEC_UNSPECIFIED,
9430 REF_QUAL_NONE,
9431 exception_spec,
9436 declarator,
9437 attributes);
9439 {
9442 /* Give the object parameter a different name. */
9446 }
9448 {
9452 }
9461 }
9462 }
9464 /* Parse the body of a lambda expression, which is simply
9466 compound-statement
9468 but which requires special handling.
9469 LAMBDA_EXPR is the current representation of the lambda expression. */
9471 static void
9473 {
9478 else
9479 /* Still increment function_depth so that we don't GC in the
9480 middle of an expression. */
9482 /* Clear this in case we're in the middle of a default argument. */
9485 /* Finish the function call operator
9486 - class_specifier
9487 + late_parsing_for_member
9488 + function_definition_after_declarator
9489 + ctor_initializer_opt_and_function_body */
9490 {
9492 tree body;
9494 tree compound_stmt;
9495 tree cap;
9497 /* Let the front end know that we are going to be defining this
9498 function. */
9500 NULL_TREE,
9509 /* Push the proxies for any explicit captures. */
9516 /* 5.1.1.4 of the standard says:
9517 If a lambda-expression does not include a trailing-return-type, it
9518 is as if the trailing-return-type denotes the following type:
9519 * if the compound-statement is of the form
9520 { return attribute-specifier [opt] expression ; }
9521 the type of the returned expression after lvalue-to-rvalue
9522 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9523 (_conv.array_ 4.2), and function-to-pointer conversion
9524 (_conv.func_ 4.3);
9525 * otherwise, void. */
9527 /* In a lambda that has neither a lambda-return-type-clause
9528 nor a deducible form, errors should be reported for return statements
9529 in the body. Since we used void as the placeholder return type, parsing
9530 the body as usual will give such desired behavior. */
9534 {
9538 /* Parse tentatively in case there's more after the initial return
9539 statement. */
9550 {
9554 /* Will get error here if type not deduced yet. */
9558 }
9559 }
9562 {
9567 }
9571 out:
9575 /* Finish the function and generate code for it if necessary. */
9578 /* Only expand if the call op is not a template. */
9581 }
9586 else
9588 }
9590 /* Statements [gram.stmt.stmt] */
9592 /* Parse a statement.
9594 statement:
9595 labeled-statement
9596 expression-statement
9597 compound-statement
9598 selection-statement
9599 iteration-statement
9600 jump-statement
9601 declaration-statement
9602 try-block
9604 C++11:
9606 statement:
9607 labeled-statement
9608 attribute-specifier-seq (opt) expression-statement
9609 attribute-specifier-seq (opt) compound-statement
9610 attribute-specifier-seq (opt) selection-statement
9611 attribute-specifier-seq (opt) iteration-statement
9612 attribute-specifier-seq (opt) jump-statement
9613 declaration-statement
9614 attribute-specifier-seq (opt) try-block
9616 TM Extension:
9618 statement:
9619 atomic-statement
9621 IN_COMPOUND is true when the statement is nested inside a
9622 cp_parser_compound_statement; this matters for certain pragmas.
9624 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9625 is a (possibly labeled) if statement which is not enclosed in braces
9626 and has an else clause. This is used to implement -Wparentheses. */
9628 static void
9631 {
9636 restart:
9639 /* There is no statement yet. */
9645 /* In obj-c++, seeing '[[' might be the either the beginning of
9646 c++11 attributes, or a nested objc-message-expression. So
9647 let's parse the c++11 attributes tentatively. */
9651 {
9654 }
9656 /* Peek at the next token. */
9658 /* Remember the location of the first token in the statement. */
9660 /* If this is a keyword, then that will often determine what kind of
9661 statement we have. */
9663 {
9667 {
9670 /* Looks like a labeled-statement with a case label.
9671 Parse the label, and then use tail recursion to parse
9672 the statement. */
9689 {
9694 }
9695 else
9709 {
9714 }
9715 else
9716 {
9720 }
9724 /* Objective-C++ exception-handling constructs. */
9738 /* This must be a namespace alias definition. */
9751 /* It might be a keyword like `int' that can start a
9752 declaration-statement. */
9754 }
9755 }
9757 {
9758 /* If the next token is a `:', then we are looking at a
9759 labeled-statement. */
9762 {
9763 /* Looks like a labeled-statement with an ordinary label.
9764 Parse the label, and then use tail recursion to parse
9765 the statement. */
9769 }
9770 }
9771 /* Anything that starts with a `{' must be a compound-statement. */
9774 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9775 a statement all its own. */
9777 {
9778 /* Only certain OpenMP pragmas are attached to statements, and thus
9779 are considered statements themselves. All others are not. In
9780 the context of a compound, accept the pragma as a "statement" and
9781 return so that we can check for a close brace. Otherwise we
9782 require a real statement and must go back and read one. */
9788 }
9790 {
9793 }
9795 /* Everything else must be a declaration-statement or an
9796 expression-statement. Try for the declaration-statement
9797 first, unless we are looking at a `;', in which case we know that
9798 we have an expression-statement. */
9800 {
9802 {
9804 {
9805 /* Attributes should be parsed as part of the the
9806 declaration, so let's un-parse them. */
9809 }
9812 /* Try to parse the declaration-statement. */
9814 /* If that worked, we're done. */
9817 }
9818 /* Look for an expression-statement instead. */
9820 }
9822 /* Set the line number for the statement. */
9826 /* Note that for now, we don't do anything with c++11 statements
9827 parsed at this level. */
9830 OPT_Wattributes,
9832 }
9834 /* Parse the label for a labeled-statement, i.e.
9836 identifier :
9837 case constant-expression :
9838 default :
9840 GNU Extension:
9841 case constant-expression ... constant-expression : statement
9843 When a label is parsed without errors, the label is added to the
9844 parse tree by the finish_* functions, so this function doesn't
9845 have to return the label. */
9847 static void
9849 {
9854 /* The next token should be an identifier. */
9858 {
9861 }
9865 {
9867 {
9871 /* Consume the `case' token. */
9873 /* Parse the constant-expression. */
9880 {
9881 /* Consume the `...' token. */
9887 /* We don't need to emit warnings here, as the common code
9888 will do this for us. */
9889 }
9890 else
9895 else
9898 expr);
9899 }
9903 /* Consume the `default' token. */
9908 else
9913 /* Anything else must be an ordinary label. */
9916 }
9918 /* Require the `:' token. */
9921 /* An ordinary label may optionally be followed by attributes.
9922 However, this is only permitted if the attributes are then
9923 followed by a semicolon. This is because, for backward
9924 compatibility, when parsing
9925 lab: __attribute__ ((unused)) int i;
9926 we want the attribute to attach to "i", not "lab". */
9929 {
9930 tree attrs;
9937 ;
9938 else
9940 }
9946 }
9948 /* Parse an expression-statement.
9950 expression-statement:
9951 expression [opt] ;
9953 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9954 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9955 indicates whether this expression-statement is part of an
9956 expression statement. */
9958 static tree
9960 {
9964 /* If the next token is a ';', then there is no expression
9965 statement. */
9967 {
9971 {
9974 }
9975 }
9977 /* Give a helpful message for "A<T>::type t;" and the like. */
9980 {
9987 {
9988 /* A::A a; */
9993 }
9994 }
9996 /* Consume the final `;'. */
10001 /* This is the final expression statement of a statement
10002 expression. */
10008 }
10010 /* Parse a compound-statement.
10012 compound-statement:
10013 { statement-seq [opt] }
10015 GNU extension:
10017 compound-statement:
10018 { label-declaration-seq [opt] statement-seq [opt] }
10020 label-declaration-seq:
10021 label-declaration
10022 label-declaration-seq label-declaration
10024 Returns a tree representing the statement. */
10026 static tree
10029 {
10030 tree compound_stmt;
10032 /* Consume the `{'. */
10039 /* Begin the compound-statement. */
10041 /* If the next keyword is `__label__' we have a label declaration. */
10044 /* Parse an (optional) statement-seq. */
10046 /* Finish the compound-statement. */
10048 /* Consume the `}'. */
10052 }
10054 /* Parse an (optional) statement-seq.
10056 statement-seq:
10057 statement
10058 statement-seq [opt] statement */
10060 static void
10062 {
10063 /* Scan statements until there aren't any more. */
10065 {
10068 /* If we are looking at a `}', then we have run out of
10069 statements; the same is true if we have reached the end
10070 of file, or have stumbled upon a stray '@end'. */
10077 /* If we are in a compound statement and find 'else' then
10078 something went wrong. */
10080 {
10083 else
10084 {
10087 }
10088 }
10090 /* Parse the statement. */
10092 }
10093 }
10095 /* Parse a selection-statement.
10097 selection-statement:
10098 if ( condition ) statement
10099 if ( condition ) statement else statement
10100 switch ( condition ) statement
10102 Returns the new IF_STMT or SWITCH_STMT.
10104 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10105 is a (possibly labeled) if statement which is not enclosed in
10106 braces and has an else clause. This is used to implement
10107 -Wparentheses. */
10109 static tree
10111 {
10118 /* Peek at the next token. */
10121 /* See what kind of keyword it is. */
10124 {
10127 {
10128 tree statement;
10129 tree condition;
10131 /* Look for the `('. */
10133 {
10136 }
10138 /* Begin the selection-statement. */
10141 else
10144 /* Parse the condition. */
10146 /* Look for the `)'. */
10152 {
10156 /* Add the condition. */
10159 /* Parse the then-clause. */
10163 {
10171 }
10172 else
10179 /* If the next token is `else', parse the else-clause. */
10181 RID_ELSE))
10182 {
10183 /* Consume the `else' keyword. */
10184 location_t else_tok_loc
10187 /* Parse the else-clause. */
10189 {
10190 location_t loc;
10197 }
10198 else
10204 /* If we are currently parsing a then-clause, then
10205 IF_P will not be NULL. We set it to true to
10206 indicate that this if statement has an else clause.
10207 This may trigger the Wparentheses warning below
10208 when we get back up to the parent if statement. */
10211 }
10212 else
10213 {
10214 /* This if statement does not have an else clause. If
10215 NESTED_IF is true, then the then-clause is an if
10216 statement which does have an else clause. We warn
10217 about the potential ambiguity. */
10220 "suggest explicit braces to avoid ambiguous"
10222 }
10224 /* Now we're all done with the if-statement. */
10226 }
10227 else
10228 {
10232 /* Add the condition. */
10235 /* Parse the body of the switch-statement. */
10245 /* Now we're all done with the switch-statement. */
10247 }
10250 }
10256 }
10257 }
10259 /* Parse a condition.
10261 condition:
10262 expression
10263 type-specifier-seq declarator = initializer-clause
10264 type-specifier-seq declarator braced-init-list
10266 GNU Extension:
10268 condition:
10269 type-specifier-seq declarator asm-specification [opt]
10270 attributes [opt] = assignment-expression
10272 Returns the expression that should be tested. */
10274 static tree
10276 {
10277 cp_decl_specifier_seq type_specifiers;
10281 /* Try the declaration first. */
10283 /* New types are not allowed in the type-specifier-seq for a
10284 condition. */
10286 parser->type_definition_forbidden_message
10288 /* Parse the type-specifier-seq. */
10290 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10293 /* Restore the saved message. */
10295 /* If all is well, we might be looking at a declaration. */
10297 {
10298 tree decl;
10299 tree asm_specification;
10300 tree attributes;
10304 /* Parse the declarator. */
10310 /* Parse the attributes. */
10312 /* Parse the asm-specification. */
10314 /* If the next token is not an `=' or '{', then we might still be
10315 looking at an expression. For example:
10317 if (A(a).x)
10319 looks like a decl-specifier-seq and a declarator -- but then
10320 there is no `=', so this is an expression. */
10325 /* If we did see an `=' or '{', then we are looking at a declaration
10326 for sure. */
10328 {
10329 tree pushed_scope;
10333 /* Create the declaration. */
10339 /* Parse the initializer. */
10341 {
10345 }
10346 else
10347 {
10348 /* Consume the `='. */
10351 }
10355 /* Process the initializer. */
10358 asm_specification,
10359 flags);
10365 }
10366 }
10367 /* If we didn't even get past the declarator successfully, we are
10368 definitely not looking at a declaration. */
10369 else
10372 /* Otherwise, we are looking at an expression. */
10374 }
10376 /* Parses a for-statement or range-for-statement until the closing ')',
10377 not included. */
10379 static tree
10381 {
10385 /* Begin the for-statement. */
10388 /* Parse the initialization. */
10393 else
10395 }
10397 static tree
10399 {
10400 /* Normal for loop */
10403 tree stmt;
10406 /* The for-init-statement has already been parsed in
10407 cp_parser_for_init_statement, so no work is needed here. */
10410 /* If there's a condition, process it. */
10414 {
10418 }
10420 /* Look for the `;'. */
10423 /* If there's an expression, process it. */
10429 }
10431 /* Tries to parse a range-based for-statement:
10433 range-based-for:
10434 decl-specifier-seq declarator : expression
10436 The decl-specifier-seq declarator and the `:' are already parsed by
10437 cp_parser_for_init_statement. If processing_template_decl it returns a
10438 newly created RANGE_FOR_STMT; if not, it is converted to a
10439 regular FOR_STMT. */
10441 static tree
10444 {
10448 {
10451 }
10452 else
10455 /* If in template, STMT is converted to a normal for-statement
10456 at instantiation. If not, it is done just ahead. */
10458 {
10466 /* do_auto_deduction doesn't mess with template init-lists. */
10469 }
10470 else
10471 {
10474 }
10476 }
10478 /* Subroutine of cp_convert_range_for: given the initializer expression,
10479 builds up the range temporary. */
10481 static tree
10483 {
10486 /* Find out the type deduced by the declaration
10487 `auto &&__range = range_expr'. */
10492 /* Create the __range variable. */
10499 }
10501 /* Used by cp_parser_range_for in template context: we aren't going to
10502 do a full conversion yet, but we still need to resolve auto in the
10503 type of the for-range-declaration if present. This is basically
10504 a shortcut version of cp_convert_range_for. */
10506 static void
10508 {
10511 {
10514 iter_type = (cp_parser_perform_range_for_lookup
10517 {
10519 iter_type);
10521 tf_warning_or_error);
10524 }
10525 }
10526 }
10528 /* Converts a range-based for-statement into a normal
10529 for-statement, as per the definition.
10531 for (RANGE_DECL : RANGE_EXPR)
10532 BLOCK
10534 should be equivalent to:
10536 {
10537 auto &&__range = RANGE_EXPR;
10538 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10539 __begin != __end;
10540 ++__begin)
10541 {
10542 RANGE_DECL = *__begin;
10543 BLOCK
10544 }
10545 }
10547 If RANGE_EXPR is an array:
10548 BEGIN_EXPR = __range
10549 END_EXPR = __range + ARRAY_SIZE(__range)
10550 Else if RANGE_EXPR has a member 'begin' or 'end':
10551 BEGIN_EXPR = __range.begin()
10552 END_EXPR = __range.end()
10553 Else:
10554 BEGIN_EXPR = begin(__range)
10555 END_EXPR = end(__range);
10557 If __range has a member 'begin' but not 'end', or vice versa, we must
10558 still use the second alternative (it will surely fail, however).
10559 When calling begin()/end() in the third alternative we must use
10560 argument dependent lookup, but always considering 'std' as an associated
10561 namespace. */
10563 tree
10566 {
10572 /* If an error happened previously do nothing or else a lot of
10573 unhelpful errors would be issued. */
10575 else
10576 {
10577 tree range_temp;
10581 /* Can't bind a reference to an array of runtime bound. */
10583 else
10584 {
10589 LOOKUP_ONLYCONVERTING);
10591 }
10594 }
10596 /* The new for initialization statement. */
10604 LOOKUP_ONLYCONVERTING);
10613 LOOKUP_ONLYCONVERTING);
10617 /* The new for condition. */
10624 /* The new increment expression. */
10627 tf_warning_or_error);
10630 /* The declaration is initialized with *__begin inside the loop body. */
10633 tf_warning_or_error),
10635 LOOKUP_ONLYCONVERTING);
10638 }
10640 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10641 We need to solve both at the same time because the method used
10642 depends on the existence of members begin or end.
10643 Returns the type deduced for the iterator expression. */
10645 static tree
10647 {
10649 {
10652 }
10655 {
10660 }
10662 {
10663 /* If RANGE is an array, we will use pointer arithmetic. */
10666 range,
10670 }
10671 else
10672 {
10673 /* If it is not an array, we must do a bit of magic. */
10683 tf_warning_or_error);
10686 tf_warning_or_error);
10689 {
10690 /* Use the member functions. */
10693 else
10699 else
10702 }
10703 else
10704 {
10705 /* Use global functions with ADL. */
10712 tf_warning_or_error);
10714 tf_warning_or_error);
10716 tf_warning_or_error);
10718 tf_warning_or_error);
10721 }
10723 /* Last common checks. */
10725 {
10726 /* If one of the expressions is an error do no more checks. */
10729 }
10732 /* Can happen, when, eg, in a template context, Koenig lookup
10733 can't resolve begin/end (c++/58503). */
10735 else
10736 {
10738 /* The unqualified type of the __begin and __end temporaries should
10739 be the same, as required by the multiple auto declaration. */
10745 }
10746 }
10747 }
10749 /* Helper function for cp_parser_perform_range_for_lookup.
10750 Builds a tree for RANGE.IDENTIFIER(). */
10752 static tree
10754 {
10767 tf_warning_or_error);
10770 }
10772 /* Parse an iteration-statement.
10774 iteration-statement:
10775 while ( condition ) statement
10776 do statement while ( expression ) ;
10777 for ( for-init-statement condition [opt] ; expression [opt] )
10778 statement
10780 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10782 static tree
10784 {
10786 location_t tok_loc;
10788 tree statement;
10791 /* Peek at the next token. */
10798 /* Remember whether or not we are already within an iteration
10799 statement. */
10802 /* See what kind of keyword it is. */
10805 {
10807 {
10808 tree condition;
10810 /* Begin the while-statement. */
10812 /* Look for the `('. */
10814 /* Parse the condition. */
10817 /* Look for the `)'. */
10819 /* Parse the dependent statement. */
10823 /* We're done with the while-statement. */
10825 }
10829 {
10830 tree expression;
10832 /* Begin the do-statement. */
10834 /* Parse the body of the do-statement. */
10839 /* Look for the `while' keyword. */
10841 /* Look for the `('. */
10843 /* Parse the expression. */
10845 /* We're done with the do-statement. */
10847 /* Look for the `)'. */
10849 /* Look for the `;'. */
10851 }
10855 {
10856 /* Look for the `('. */
10861 /* Look for the `)'. */
10864 /* Parse the body of the for-statement. */
10869 /* We're done with the for-statement. */
10871 }
10878 }
10881 }
10883 /* Parse a for-init-statement or the declarator of a range-based-for.
10884 Returns true if a range-based-for declaration is seen.
10886 for-init-statement:
10887 expression-statement
10888 simple-declaration */
10890 static bool
10892 {
10893 /* If the next token is a `;', then we have an empty
10894 expression-statement. Grammatically, this is also a
10895 simple-declaration, but an invalid one, because it does not
10896 declare anything. Therefore, if we did not handle this case
10897 specially, we would issue an error message about an invalid
10898 declaration. */
10900 {
10906 {
10907 /* N3994 -- for (id : init) ... */
10910 "type-specifier only available with "
10918 }
10920 /* A colon is used in range-based for. */
10923 /* We're going to speculatively look for a declaration, falling back
10924 to an expression, if necessary. */
10926 /* Parse the declaration. */
10929 decl);
10932 {
10933 /* It is a range-for, consume the ':' */
10937 {
10939 "range-based %<for%> loops only available with "
10942 }
10943 }
10944 else
10945 /* The ';' is not consumed yet because we told
10946 cp_parser_simple_declaration not to. */
10951 /* If the tentative parse failed, then we shall need to look for an
10952 expression-statement. */
10953 }
10954 /* If we are here, it is an expression-statement. */
10957 }
10959 /* Parse a jump-statement.
10961 jump-statement:
10962 break ;
10963 continue ;
10964 return expression [opt] ;
10965 return braced-init-list ;
10966 goto identifier ;
10968 GNU extension:
10970 jump-statement:
10971 goto * expression ;
10973 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10975 static tree
10977 {
10983 /* Peek at the next token. */
10988 /* See what kind of keyword it is. */
10991 {
10995 {
11015 }
11021 {
11028 /* Fall through. */
11038 }
11043 {
11044 tree expr;
11048 {
11052 }
11055 else
11056 /* If the next token is a `;', then there is no
11057 expression. */
11059 /* Build the return-statement. */
11061 /* Look for the final `;'. */
11063 }
11069 {
11072 }
11074 /* Create the goto-statement. */
11076 {
11077 /* Issue a warning about this use of a GNU extension. */
11079 /* Consume the '*' token. */
11081 /* Parse the dependent expression. */
11083 }
11084 else
11086 /* Look for the final `;'. */
11093 }
11096 }
11098 /* Parse a declaration-statement.
11100 declaration-statement:
11101 block-declaration */
11103 static void
11105 {
11108 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11111 /* Parse the block-declaration. */
11114 /* Free any declarators allocated. */
11116 }
11118 /* Some dependent statements (like `if (cond) statement'), are
11119 implicitly in their own scope. In other words, if the statement is
11120 a single statement (as opposed to a compound-statement), it is
11121 none-the-less treated as if it were enclosed in braces. Any
11122 declarations appearing in the dependent statement are out of scope
11123 after control passes that point. This function parses a statement,
11124 but ensures that is in its own scope, even if it is not a
11125 compound-statement.
11127 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11128 is a (possibly labeled) if statement which is not enclosed in
11129 braces and has an else clause. This is used to implement
11130 -Wparentheses.
11132 Returns the new statement. */
11134 static tree
11136 location_t guard_loc,
11138 {
11139 tree statement;
11144 /* Mark if () ; with a special NOP_EXPR. */
11146 {
11150 }
11151 /* if a compound is opened, we simply parse the statement directly. */
11154 /* If the token is not a `{', then we must take special action. */
11155 else
11156 {
11157 /* Create a compound-statement. */
11159 /* Parse the dependent-statement. */
11162 /* Finish the dummy compound-statement. */
11166 {
11170 guard_kind);
11171 }
11172 }
11174 /* Return the statement. */
11176 }
11178 /* For some dependent statements (like `while (cond) statement'), we
11179 have already created a scope. Therefore, even if the dependent
11180 statement is a compound-statement, we do not want to create another
11181 scope. */
11183 static void
11186 {
11187 /* If the token is a `{', then we must take special action. */
11189 {
11196 guard_kind);
11197 }
11198 else
11199 {
11200 /* Avoid calling cp_parser_compound_statement, so that we
11201 don't create a new scope. Do everything else by hand. */
11203 /* If the next keyword is `__label__' we have a label declaration. */
11206 /* Parse an (optional) statement-seq. */
11209 }
11210 }
11212 /* Declarations [gram.dcl.dcl] */
11214 /* Parse an optional declaration-sequence.
11216 declaration-seq:
11217 declaration
11218 declaration-seq declaration */
11220 static void
11222 {
11224 {
11235 {
11236 /* A declaration consisting of a single semicolon is
11237 invalid. Allow it unless we're being pedantic. */
11242 }
11244 /* If we're entering or exiting a region that's implicitly
11245 extern "C", modify the lang context appropriately. */
11247 {
11250 }
11252 {
11255 }
11258 {
11259 /* A top-level declaration can consist solely of a #pragma.
11260 A nested declaration cannot, so this is done here and not
11261 in cp_parser_declaration. (A #pragma at block scope is
11262 handled in cp_parser_statement.) */
11265 }
11267 /* Parse the declaration itself. */
11269 }
11270 }
11272 /* Parse a declaration.
11274 declaration:
11275 block-declaration
11276 function-definition
11277 template-declaration
11278 explicit-instantiation
11279 explicit-specialization
11280 linkage-specification
11281 namespace-definition
11283 GNU extension:
11285 declaration:
11286 __extension__ declaration */
11288 static void
11290 {
11291 cp_token token1;
11292 cp_token token2;
11297 /* Check for the `__extension__' keyword. */
11299 {
11300 /* Parse the qualified declaration. */
11302 /* Restore the PEDANTIC flag. */
11306 }
11308 /* Try to figure out what kind of declaration is present. */
11313 else
11314 {
11317 }
11319 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11322 /* If the next token is `extern' and the following token is a string
11323 literal, then we have a linkage specification. */
11327 /* If the next token is `template', then we have either a template
11328 declaration, an explicit instantiation, or an explicit
11329 specialization. */
11331 {
11332 /* `template <>' indicates a template specialization. */
11336 /* `template <' indicates a template declaration. */
11339 /* Anything else must be an explicit instantiation. */
11340 else
11342 }
11343 /* If the next token is `export', then we have a template
11344 declaration. */
11347 /* If the next token is `extern', 'static' or 'inline' and the one
11348 after that is `template', we have a GNU extended explicit
11349 instantiation directive. */
11356 /* If the next token is `namespace', check for a named or unnamed
11357 namespace definition. */
11363 /* An unnamed namespace definition. */
11367 /* An inline (associated) namespace definition. */
11371 /* Objective-C++ declaration/definition. */
11378 /* We must have either a block declaration or a function
11379 definition. */
11380 else
11381 /* Try to parse a block-declaration, or a function-definition. */
11384 /* Free any declarators allocated. */
11386 }
11388 /* Parse a block-declaration.
11390 block-declaration:
11391 simple-declaration
11392 asm-definition
11393 namespace-alias-definition
11394 using-declaration
11395 using-directive
11397 GNU Extension:
11399 block-declaration:
11400 __extension__ block-declaration
11402 C++0x Extension:
11404 block-declaration:
11405 static_assert-declaration
11407 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11408 part of a declaration-statement. */
11410 static void
11413 {
11417 /* Check for the `__extension__' keyword. */
11419 {
11420 /* Parse the qualified declaration. */
11422 /* Restore the PEDANTIC flag. */
11426 }
11428 /* Peek at the next token to figure out which kind of declaration is
11429 present. */
11432 /* If the next keyword is `asm', we have an asm-definition. */
11434 {
11438 }
11439 /* If the next keyword is `namespace', we have a
11440 namespace-alias-definition. */
11443 /* If the next keyword is `using', we have a
11444 using-declaration, a using-directive, or an alias-declaration. */
11446 {
11451 /* If the token after `using' is `namespace', then we have a
11452 using-directive. */
11456 /* If the second token after 'using' is '=', then we have an
11457 alias-declaration. */
11463 /* Otherwise, it's a using-declaration. */
11464 else
11467 }
11468 /* If the next keyword is `__label__' we have a misplaced label
11469 declaration. */
11471 {
11475 /* If the next token is now a `;', consume it. */
11478 }
11479 /* If the next token is `static_assert' we have a static assertion. */
11482 /* Anything else must be a simple-declaration. */
11483 else
11486 }
11488 /* Parse a simple-declaration.
11490 simple-declaration:
11491 decl-specifier-seq [opt] init-declarator-list [opt] ;
11493 init-declarator-list:
11494 init-declarator
11495 init-declarator-list , init-declarator
11497 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11498 function-definition as a simple-declaration.
11500 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11501 parsed declaration if it is an uninitialized single declarator not followed
11502 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11503 if present, will not be consumed. */
11505 static void
11509 {
11510 cp_decl_specifier_seq decl_specifiers;
11519 /* Defer access checks until we know what is being declared; the
11520 checks for names appearing in the decl-specifier-seq should be
11521 done as if we were in the scope of the thing being declared. */
11524 /* Parse the decl-specifier-seq. We have to keep track of whether
11525 or not the decl-specifier-seq declares a named class or
11526 enumeration type, since that is the only case in which the
11527 init-declarator-list is allowed to be empty.
11529 [dcl.dcl]
11531 In a simple-declaration, the optional init-declarator-list can be
11532 omitted only when declaring a class or enumeration, that is when
11533 the decl-specifier-seq contains either a class-specifier, an
11534 elaborated-type-specifier, or an enum-specifier. */
11536 CP_PARSER_FLAGS_OPTIONAL,
11539 /* We no longer need to defer access checks. */
11542 /* In a block scope, a valid declaration must always have a
11543 decl-specifier-seq. By not trying to parse declarators, we can
11544 resolve the declaration/expression ambiguity more quickly. */
11547 {
11550 }
11552 /* If the next two tokens are both identifiers, the code is
11553 erroneous. The usual cause of this situation is code like:
11555 T t;
11557 where "T" should name a type -- but does not. */
11560 {
11561 /* If parsing tentatively, we should commit; we really are
11562 looking at a declaration. */
11564 /* Give up. */
11566 }
11568 /* If we have seen at least one decl-specifier, and the next token
11569 is not a parenthesis, then we must be looking at a declaration.
11570 (After "int (" we might be looking at a functional cast.) */
11577 /* Keep going until we hit the `;' at the end of the simple
11578 declaration. */
11581 CPP_SEMICOLON))
11582 {
11585 tree decl;
11588 {
11589 /* If we are processing next declarator, comma is expected */
11594 {
11598 }
11599 }
11600 else
11603 /* Parse the init-declarator. */
11606 function_definition_allowed_p,
11608 declares_class_or_enum,
11610 maybe_range_for_decl,
11612 /* If an error occurred while parsing tentatively, exit quickly.
11613 (That usually happens when in the body of a function; each
11614 statement is treated as a declaration-statement until proven
11615 otherwise.) */
11618 /* Handle function definitions specially. */
11620 {
11621 /* If the next token is a `,', then we are probably
11622 processing something like:
11624 void f() {}, *p;
11626 which is erroneous. */
11628 {
11631 "mixing"
11633 }
11634 /* Otherwise, we're done with the list of declarators. */
11635 else
11636 {
11639 }
11640 }
11643 /* The next token should be either a `,' or a `;'. */
11645 /* If it's a `,', there are more declarators to come. */
11648 /* If it's a `;', we are done. */
11651 /* Anything else is an error. */
11652 else
11653 {
11654 /* If we have already issued an error message we don't need
11655 to issue another one. */
11659 /* Skip tokens until we reach the end of the statement. */
11661 /* If the next token is now a `;', consume it. */
11665 }
11666 /* After the first time around, a function-definition is not
11667 allowed -- even if it was OK at first. For example:
11669 int i, f() {}
11671 is not valid. */
11673 }
11675 /* Issue an error message if no declarators are present, and the
11676 decl-specifier-seq does not itself declare a class or
11677 enumeration: [dcl.dcl]/3. */
11679 {
11681 {
11685 /* Ensure an error is issued anyway when finish_decltype_type,
11686 called via cp_parser_decl_specifier_seq, returns a class or
11687 an enumeration (c++/51786). */
11690 }
11691 /* Perform any deferred access checks. */
11693 }
11695 /* Consume the `;'. */
11699 {
11705 }
11707 done:
11709 }
11711 /* Parse a decl-specifier-seq.
11713 decl-specifier-seq:
11714 decl-specifier-seq [opt] decl-specifier
11715 decl-specifier attribute-specifier-seq [opt] (C++11)
11717 decl-specifier:
11718 storage-class-specifier
11719 type-specifier
11720 function-specifier
11721 friend
11722 typedef
11724 GNU Extension:
11726 decl-specifier:
11727 attributes
11729 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11731 The parser flags FLAGS is used to control type-specifier parsing.
11733 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11734 flags:
11736 1: one of the decl-specifiers is an elaborated-type-specifier
11737 (i.e., a type declaration)
11738 2: one of the decl-specifiers is an enum-specifier or a
11739 class-specifier (i.e., a type definition)
11741 */
11743 static void
11745 cp_parser_flags flags,
11748 {
11752 cp_decl_spec ds;
11754 /* Clear DECL_SPECS. */
11757 /* Assume no class or enumeration type is declared. */
11760 /* Keep reading specifiers until there are no more to read. */
11762 {
11767 /* Peek at the next token. */
11770 /* Save the first token of the decl spec list for error
11771 reporting. */
11774 /* Handle attributes. */
11776 {
11777 /* Parse the attributes. */
11780 /* In a sequence of declaration specifiers, c++11 attributes
11781 appertain to the type that precede them. In that case
11782 [dcl.spec]/1 says:
11784 The attribute-specifier-seq affects the type only for
11785 the declaration it appears in, not other declarations
11786 involving the same type.
11788 But for now let's force the user to position the
11789 attribute either at the beginning of the declaration or
11790 after the declarator-id, which would clearly mean that it
11791 applies to the declarator. */
11793 {
11795 /* The c++11 attribute is at the beginning of the
11796 declaration. It appertains to the entity being
11798 else
11799 {
11801 {
11802 /* This is an attribute following a
11803 class-specifier. */
11808 }
11809 else
11810 {
11811 decl_specs->std_attributes
11813 attrs);
11816 }
11818 }
11819 }
11821 decl_specs->attributes
11823 attrs);
11827 }
11828 /* Assume we will find a decl-specifier keyword. */
11830 /* If the next token is an appropriate keyword, we can simply
11831 add it to the list. */
11833 {
11834 /* decl-specifier:
11835 friend
11836 constexpr */
11839 {
11842 }
11843 else
11844 {
11846 /* Consume the token. */
11848 }
11856 /* function-specifier:
11857 inline
11858 virtual
11859 explicit */
11866 /* decl-specifier:
11867 typedef */
11870 /* Consume the token. */
11872 /* A constructor declarator cannot appear in a typedef. */
11874 /* The "typedef" keyword can only occur in a declaration; we
11875 may as well commit at this point. */
11882 /* storage-class-specifier:
11883 auto
11884 register
11885 static
11886 extern
11887 mutable
11889 GNU Extension:
11890 thread */
11893 {
11894 /* Consume the token. */
11897 /* Complain about `auto' as a storage specifier, if
11898 we're complaining about C++0x compatibility. */
11902 /* Set the storage class anyway. */
11904 token);
11905 }
11906 else
11907 /* C++0x auto type-specifier. */
11915 /* Consume the token. */
11918 token);
11921 /* Consume the token. */
11927 /* We did not yet find a decl-specifier yet. */
11930 }
11940 /* Constructors are a special case. The `S' in `S()' is not a
11941 decl-specifier; it is the beginning of the declarator. */
11942 constructor_p
11943 = (!found_decl_spec
11944 && constructor_possible_p
11945 && (cp_parser_constructor_declarator_p
11948 /* If we don't have a DECL_SPEC yet, then we must be looking at
11949 a type-specifier. */
11951 {
11954 tree type_spec;
11956 type_spec
11958 decl_specs,
11964 /* If this type-specifier referenced a user-defined type
11965 (a typedef, class-name, etc.), then we can't allow any
11966 more such type-specifiers henceforth.
11968 [dcl.spec]
11970 The longest sequence of decl-specifiers that could
11971 possibly be a type name is taken as the
11972 decl-specifier-seq of a declaration. The sequence shall
11973 be self-consistent as described below.
11975 [dcl.type]
11977 As a general rule, at most one type-specifier is allowed
11978 in the complete decl-specifier-seq of a declaration. The
11979 only exceptions are the following:
11981 -- const or volatile can be combined with any other
11982 type-specifier.
11984 -- signed or unsigned can be combined with char, long,
11985 short, or int.
11987 -- ..
11989 Example:
11991 typedef char* Pc;
11992 void g (const int Pc);
11994 Here, Pc is *not* part of the decl-specifier seq; it's
11995 the declarator. Therefore, once we see a type-specifier
11996 (other than a cv-qualifier), we forbid any additional
11997 user-defined types. We *do* still allow things like `int
11998 int' to be considered a decl-specifier-seq, and issue the
11999 error message later. */
12002 /* A constructor declarator cannot follow a type-specifier. */
12004 {
12009 }
12010 }
12012 /* If we still do not have a DECL_SPEC, then there are no more
12013 decl-specifiers. */
12018 /* After we see one decl-specifier, further decl-specifiers are
12019 always optional. */
12021 }
12023 /* Don't allow a friend specifier with a class definition. */
12028 }
12030 /* Parse an (optional) storage-class-specifier.
12032 storage-class-specifier:
12033 auto
12034 register
12035 static
12036 extern
12037 mutable
12039 GNU Extension:
12041 storage-class-specifier:
12042 thread
12044 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12046 static tree
12048 {
12050 {
12054 /* Fall through for C++98. */
12061 /* Consume the token. */
12066 }
12067 }
12069 /* Parse an (optional) function-specifier.
12071 function-specifier:
12072 inline
12073 virtual
12074 explicit
12076 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12077 Updates DECL_SPECS, if it is non-NULL. */
12079 static tree
12082 {
12085 {
12091 /* 14.5.2.3 [temp.mem]
12093 A member function template shall not be virtual. */
12096 else
12106 }
12108 /* Consume the token. */
12110 }
12112 /* Parse a linkage-specification.
12114 linkage-specification:
12115 extern string-literal { declaration-seq [opt] }
12116 extern string-literal declaration */
12118 static void
12120 {
12121 tree linkage;
12123 /* Look for the `extern' keyword. */
12126 /* Look for the string-literal. */
12129 /* Transform the literal into an identifier. If the literal is a
12130 wide-character string, or contains embedded NULs, then we can't
12131 handle it as the user wants. */
12134 {
12136 /* Assume C++ linkage. */
12138 }
12139 else
12142 /* We're now using the new linkage. */
12145 /* If the next token is a `{', then we're using the first
12146 production. */
12148 {
12151 /* Consume the `{' token. */
12153 /* Parse the declarations. */
12155 /* Look for the closing `}'. */
12157 }
12158 /* Otherwise, there's just one declaration. */
12159 else
12160 {
12163 saved_in_unbraced_linkage_specification_p
12167 parser->in_unbraced_linkage_specification_p
12169 }
12171 /* We're done with the linkage-specification. */
12173 }
12175 /* Parse a static_assert-declaration.
12177 static_assert-declaration:
12178 static_assert ( constant-expression , string-literal ) ;
12179 static_assert ( constant-expression ) ; (C++1Z)
12181 If MEMBER_P, this static_assert is a class member. */
12183 static void
12185 {
12186 tree condition;
12187 tree message;
12189 location_t saved_loc;
12192 /* Peek at the `static_assert' token so we can keep track of exactly
12193 where the static assertion started. */
12197 /* Look for the `static_assert' keyword. */
12199 RT_STATIC_ASSERT))
12202 /* We know we are in a static assertion; commit to any tentative
12203 parse. */
12207 /* Parse the `(' starting the static assertion condition. */
12210 /* Parse the constant-expression. Allow a non-constant expression
12211 here in order to give better diagnostics in finish_static_assert. */
12212 condition =
12218 {
12221 "static_assert without a message "
12223 /* Eat the ')' */
12228 }
12229 else
12230 {
12231 /* Parse the separating `,'. */
12234 /* Parse the string-literal message. */
12239 /* A `)' completes the static assertion. */
12245 }
12247 /* A semicolon terminates the declaration. */
12250 /* Complete the static assertion, which may mean either processing
12251 the static assert now or saving it for template instantiation. */
12253 }
12255 /* Parse the expression in decltype ( expression ). */
12257 static tree
12260 {
12262 tree expr;
12264 /* First, try parsing an id-expression. */
12275 {
12278 cp_id_kind idk;
12282 /* Lookup the name we got back from the id-expression. */
12292 {
12293 /* Complete lookup of the id-expression. */
12294 expr = (finish_id_expression
12307 /* We found an id-expression, but it was something that we
12308 should not have found. This is an error, not something
12309 we can recover from, so note that we found an
12310 id-expression and we'll recover as gracefully as
12311 possible. */
12313 }
12318 /* We have an id-expression. */
12320 }
12323 {
12324 /* Abort the id-expression parse. */
12327 /* Parsing tentatively, again. */
12330 /* Parse a class member access. */
12338 /* We have an id-expression. */
12340 }
12343 /* We have parsed the complete id-expression or member access. */
12345 else
12346 {
12347 /* Abort our attempt to parse an id-expression or member access
12348 expression. */
12351 /* Parse a full expression. */
12354 }
12357 }
12359 /* Parse a `decltype' type. Returns the type.
12361 simple-type-specifier:
12362 decltype ( expression )
12363 C++14 proposal:
12364 decltype ( auto ) */
12366 static tree
12368 {
12369 tree expr;
12378 {
12379 /* Already parsed. */
12382 }
12384 /* Look for the `decltype' token. */
12388 /* Parse the opening `('. */
12392 /* decltype (auto) */
12395 {
12402 }
12404 /* Types cannot be defined in a `decltype' expression. Save away the
12405 old message. */
12408 /* And create the new one. */
12409 parser->type_definition_forbidden_message
12412 /* The restrictions on constant-expressions do not apply inside
12413 decltype expressions. */
12414 saved_integral_constant_expression_p
12416 saved_non_integral_constant_expression_p
12420 /* Within a parenthesized expression, a `>' token is always
12421 the greater-than operator. */
12422 saved_greater_than_is_operator_p
12426 /* Do not actually evaluate the expression. */
12429 /* Do not warn about problems with the expression. */
12434 /* Go back to evaluating expressions. */
12438 /* The `>' token might be the end of a template-id or
12439 template-parameter-list now. */
12440 parser->greater_than_is_operator_p
12443 /* Restore the old message and the integral constant expression
12444 flags. */
12446 parser->integral_constant_expression_p
12448 parser->non_integral_constant_expression_p
12451 /* Parse to the closing `)'. */
12453 {
12457 }
12460 tf_warning_or_error);
12462 rewrite:
12463 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12464 it again. */
12471 }
12473 /* Special member functions [gram.special] */
12475 /* Parse a conversion-function-id.
12477 conversion-function-id:
12478 operator conversion-type-id
12480 Returns an IDENTIFIER_NODE representing the operator. */
12482 static tree
12484 {
12485 tree type;
12486 tree saved_scope;
12487 tree saved_qualifying_scope;
12488 tree saved_object_scope;
12491 /* Look for the `operator' token. */
12494 /* When we parse the conversion-type-id, the current scope will be
12495 reset. However, we need that information in able to look up the
12496 conversion function later, so we save it here. */
12500 /* We must enter the scope of the class so that the names of
12501 entities declared within the class are available in the
12502 conversion-type-id. For example, consider:
12504 struct S {
12505 typedef int I;
12506 operator I();
12507 };
12509 S::operator I() { ... }
12511 In order to see that `I' is a type-name in the definition, we
12512 must be in the scope of `S'. */
12515 /* Parse the conversion-type-id. */
12517 /* Leave the scope of the class, if any. */
12520 /* Restore the saved scope. */
12524 /* If the TYPE is invalid, indicate failure. */
12528 }
12530 /* Parse a conversion-type-id:
12532 conversion-type-id:
12533 type-specifier-seq conversion-declarator [opt]
12535 Returns the TYPE specified. */
12537 static tree
12539 {
12540 tree attributes;
12541 cp_decl_specifier_seq type_specifiers;
12543 tree type_specified;
12546 /* Parse the attributes. */
12550 parser->type_definition_forbidden_message
12553 /* Parse the type-specifiers. */
12560 /* If that didn't work, stop. */
12563 /* Parse the conversion-declarator. */
12571 /* Don't give this error when parsing tentatively. This happens to
12572 work because we always parse this definitively once. */
12575 {
12577 {
12580 }
12584 }
12587 }
12589 /* Parse an (optional) conversion-declarator.
12591 conversion-declarator:
12592 ptr-operator conversion-declarator [opt]
12594 */
12598 {
12601 cp_cv_quals cv_quals;
12603 /* We don't know if there's a ptr-operator next, or not. */
12605 /* Try the ptr-operator. */
12608 /* If it worked, look for more conversion-declarators. */
12610 {
12613 /* Parse another optional declarator. */
12616 declarator = cp_parser_make_indirect_declarator
12620 }
12623 }
12625 /* Parse an (optional) ctor-initializer.
12627 ctor-initializer:
12628 : mem-initializer-list
12630 Returns TRUE iff the ctor-initializer was actually present. */
12632 static bool
12634 {
12635 /* If the next token is not a `:', then there is no
12636 ctor-initializer. */
12638 {
12639 /* Do default initialization of any bases and members. */
12644 }
12646 /* Consume the `:' token. */
12648 /* And the mem-initializer-list. */
12652 }
12654 /* Parse a mem-initializer-list.
12656 mem-initializer-list:
12657 mem-initializer ... [opt]
12658 mem-initializer ... [opt] , mem-initializer-list */
12660 static void
12662 {
12667 /* Let the semantic analysis code know that we are starting the
12668 mem-initializer-list. */
12673 /* Loop through the list. */
12675 {
12676 tree mem_initializer;
12679 /* Parse the mem-initializer. */
12681 /* If the next token is a `...', we're expanding member initializers. */
12683 {
12684 /* Consume the `...'. */
12687 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12688 can be expanded but members cannot. */
12691 {
12696 }
12698 /* Construct the pack expansion type. */
12701 }
12704 {
12708 }
12709 /* Look for a target constructor. */
12713 {
12716 {
12720 }
12722 }
12723 /* Add it to the list, unless it was erroneous. */
12725 {
12728 }
12729 /* If the next token is not a `,', we're done. */
12732 /* Consume the `,' token. */
12734 }
12736 /* Perform semantic analysis. */
12739 }
12741 /* Parse a mem-initializer.
12743 mem-initializer:
12744 mem-initializer-id ( expression-list [opt] )
12745 mem-initializer-id braced-init-list
12747 GNU extension:
12749 mem-initializer:
12750 ( expression-list [opt] )
12752 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12753 class) or FIELD_DECL (for a non-static data member) to initialize;
12754 the TREE_VALUE is the expression-list. An empty initialization
12755 list is represented by void_list_node. */
12757 static tree
12759 {
12760 tree mem_initializer_id;
12761 tree expression_list;
12762 tree member;
12765 /* Find out what is being initialized. */
12767 {
12771 }
12772 else
12773 {
12777 }
12783 {
12790 }
12791 else
12792 {
12802 }
12812 }
12814 /* Parse a mem-initializer-id.
12816 mem-initializer-id:
12817 :: [opt] nested-name-specifier [opt] class-name
12818 decltype-specifier (C++11)
12819 identifier
12821 Returns a TYPE indicating the class to be initialized for the first
12822 production (and the second in C++11). Returns an IDENTIFIER_NODE
12823 indicating the data member to be initialized for the last production. */
12825 static tree
12827 {
12831 tree id;
12835 /* `typename' is not allowed in this context ([temp.res]). */
12837 {
12839 "keyword %<typename%> not allowed in this context (a qualified "
12842 }
12843 /* Look for the optional `::' operator. */
12844 global_scope_p
12848 /* Look for the optional nested-name-specifier. The simplest way to
12849 implement:
12851 [temp.res]
12853 The keyword `typename' is not permitted in a base-specifier or
12854 mem-initializer; in these contexts a qualified name that
12855 depends on a template-parameter is implicitly assumed to be a
12856 type name.
12858 is to assume that we have seen the `typename' keyword at this
12859 point. */
12860 nested_name_specifier_p
12869 /* If there is a `::' operator or a nested-name-specifier, then we
12870 are definitely looking for a class-name. */
12875 typename_type,
12879 /* Otherwise, we could also be looking for an ordinary identifier. */
12882 /* Try a decltype-specifier. */
12884 else
12885 /* Otherwise, try a class-name. */
12889 none_type,
12893 /* If we found one, we're done. */
12896 /* Otherwise, look for an ordinary identifier. */
12898 }
12900 /* Overloading [gram.over] */
12902 /* Parse an operator-function-id.
12904 operator-function-id:
12905 operator operator
12907 Returns an IDENTIFIER_NODE for the operator which is a
12908 human-readable spelling of the identifier, e.g., `operator +'. */
12910 static tree
12912 {
12913 /* Look for the `operator' keyword. */
12916 /* And then the name of the operator itself. */
12918 }
12920 /* Return an identifier node for a user-defined literal operator.
12921 The suffix identifier is chained to the operator name identifier. */
12923 static tree
12925 {
12926 tree identifier;
12933 }
12935 /* Parse an operator.
12937 operator:
12938 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12939 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12940 || ++ -- , ->* -> () []
12942 GNU Extensions:
12944 operator:
12945 <? >? <?= >?=
12947 Returns an IDENTIFIER_NODE for the operator which is a
12948 human-readable spelling of the identifier, e.g., `operator +'. */
12950 static tree
12952 {
12957 /* Peek at the next token. */
12959 /* Figure out which operator we have. */
12961 {
12963 {
12966 /* The keyword should be either `new' or `delete'. */
12971 else
12974 /* Consume the `new' or `delete' token. */
12977 /* Peek at the next token. */
12979 /* If it's a `[' token then this is the array variant of the
12980 operator. */
12982 {
12983 /* Consume the `[' token. */
12985 /* Look for the `]' token. */
12989 }
12990 /* Otherwise, we have the non-array variant. */
12991 else
12995 }
13142 /* Consume the `('. */
13144 /* Look for the matching `)'. */
13149 /* Consume the `['. */
13151 /* Look for the matching `]'. */
13166 {
13173 /* Consume the string. */
13179 {
13182 }
13183 else
13184 {
13186 /* Look for the suffix identifier. */
13191 {
13195 }
13196 else
13197 {
13200 }
13201 }
13206 {
13209 }
13212 {
13215 }
13217 {
13220 }
13222 }
13225 /* Anything else is an error. */
13227 }
13229 /* If we have selected an identifier, we need to consume the
13230 operator token. */
13233 /* Otherwise, no valid operator name was present. */
13234 else
13235 {
13238 }
13241 }
13243 /* Parse a template-declaration.
13245 template-declaration:
13246 export [opt] template < template-parameter-list > declaration
13248 If MEMBER_P is TRUE, this template-declaration occurs within a
13249 class-specifier.
13251 The grammar rule given by the standard isn't correct. What
13252 is really meant is:
13254 template-declaration:
13255 export [opt] template-parameter-list-seq
13256 decl-specifier-seq [opt] init-declarator [opt] ;
13257 export [opt] template-parameter-list-seq
13258 function-definition
13260 template-parameter-list-seq:
13261 template-parameter-list-seq [opt]
13262 template < template-parameter-list > */
13264 static void
13266 {
13267 /* Check for `export'. */
13269 {
13270 /* Consume the `export' token. */
13272 /* Warn that we do not support `export'. */
13274 }
13277 }
13279 /* Parse a template-parameter-list.
13281 template-parameter-list:
13282 template-parameter
13283 template-parameter-list , template-parameter
13285 Returns a TREE_LIST. Each node represents a template parameter.
13286 The nodes are connected via their TREE_CHAINs. */
13288 static tree
13290 {
13295 /* The loop below parses the template parms. We first need to know
13296 the total number of template parms to be able to compute proper
13297 canonical types of each dependent type. So after the loop, when
13298 we know the total number of template parms,
13299 end_template_parm_list computes the proper canonical types and
13300 fixes up the dependent types accordingly. */
13302 {
13303 tree parameter;
13306 location_t parm_loc;
13308 /* Parse the template-parameter. */
13313 /* Add it to the list. */
13316 parm_loc,
13317 parameter,
13318 is_non_type,
13319 is_parameter_pack);
13320 else
13321 {
13324 }
13326 /* If the next token is not a `,', we're done. */
13329 /* Otherwise, consume the `,' token. */
13331 }
13334 }
13336 /* Parse a default argument for a type template-parameter.
13337 Note that diagnostics are handled in cp_parser_template_parameter. */
13339 static tree
13341 {
13344 /* Consume the `=' token. */
13347 /* Parse the default-argument. */
13353 }
13355 /* Parse a default argument for a template template-parameter. */
13357 static tree
13359 {
13364 /* Consume the `='. */
13366 /* Parse the id-expression. */
13368 /* save token before parsing the id-expression, for error
13369 reporting */
13371 tree default_argument
13379 /* If the id-expression was a template-id that refers to
13380 a template-class, we already have the declaration here,
13381 so no further lookup is needed. */
13382 ;
13383 else
13384 /* Look up the name. */
13385 default_argument
13387 none_type,
13393 /* See if the default argument is valid. */
13397 }
13399 /* Parse a template-parameter.
13401 template-parameter:
13402 type-parameter
13403 parameter-declaration
13405 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13406 the parameter. The TREE_PURPOSE is the default value, if any.
13407 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13408 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13409 set to true iff this parameter is a parameter pack. */
13411 static tree
13414 {
13417 tree parm;
13419 /* Assume it is a type parameter or a template parameter. */
13421 /* Assume it not a parameter pack. */
13423 /* Peek at the next token. */
13425 /* If it is `class' or `template', we have a type-parameter. */
13428 /* If it is `class' or `typename' we do not know yet whether it is a
13429 type parameter or a non-type parameter. Consider:
13431 template <typename T, typename T::X X> ...
13433 or:
13435 template <class C, class D*> ...
13437 Here, the first parameter is a type parameter, and the second is
13438 a non-type parameter. We can tell by looking at the token after
13439 the identifier -- if it is a `,', `=', or `>' then we have a type
13440 parameter. */
13442 {
13443 /* Peek at the token after `class' or `typename'. */
13445 /* If it's an ellipsis, we have a template type parameter
13446 pack. */
13449 /* If it's an identifier, skip it. */
13452 /* Now, see if the token looks like the end of a template
13453 parameter. */
13458 }
13460 /* Otherwise, it is a non-type parameter.
13462 [temp.param]
13464 When parsing a default template-argument for a non-type
13465 template-parameter, the first non-nested `>' is taken as the end
13466 of the template parameter-list rather than a greater-than
13467 operator. */
13469 parameter_declarator
13476 /* If the parameter declaration is marked as a parameter pack, set
13477 *IS_PARAMETER_PACK to notify the caller. */
13482 {
13483 /* Can happen in some cases of erroneous input (c++/34892). */
13485 /* Consume the `...' for better error recovery. */
13487 }
13497 }
13499 /* Parse a type-parameter.
13501 type-parameter:
13502 class identifier [opt]
13503 class identifier [opt] = type-id
13504 typename identifier [opt]
13505 typename identifier [opt] = type-id
13506 template < template-parameter-list > class identifier [opt]
13507 template < template-parameter-list > class identifier [opt]
13508 = id-expression
13510 GNU Extension (variadic templates):
13512 type-parameter:
13513 class ... identifier [opt]
13514 typename ... identifier [opt]
13516 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13517 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13518 the declaration of the parameter.
13520 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13522 static tree
13524 {
13526 tree parameter;
13528 /* Look for a keyword to tell us what kind of parameter this is. */
13534 {
13537 {
13538 tree identifier;
13539 tree default_argument;
13541 /* If the next token is an ellipsis, we have a template
13542 argument pack. */
13544 {
13545 /* Consume the `...' token. */
13550 }
13552 /* If the next token is an identifier, then it names the
13553 parameter. */
13556 else
13559 /* Create the parameter. */
13562 /* If the next token is an `=', we have a default argument. */
13564 {
13565 default_argument
13568 /* Template parameter packs cannot have default
13569 arguments. */
13571 {
13574 "template parameter pack %qD cannot have a "
13576 else
13578 "template parameter packs cannot have "
13581 }
13584 }
13585 else
13588 /* Create the combined representation of the parameter and the
13589 default argument. */
13591 }
13595 {
13596 tree identifier;
13597 tree default_argument;
13599 /* Look for the `<'. */
13601 /* Parse the template-parameter-list. */
13603 /* Look for the `>'. */
13605 /* Look for the `class' or 'typename' keywords. */
13607 /* If the next token is an ellipsis, we have a template
13608 argument pack. */
13610 {
13611 /* Consume the `...' token. */
13616 }
13617 /* If the next token is an `=', then there is a
13618 default-argument. If the next token is a `>', we are at
13619 the end of the parameter-list. If the next token is a `,',
13620 then we are at the end of this parameter. */
13624 {
13626 /* Treat invalid names as if the parameter were nameless. */
13629 }
13630 else
13633 /* Create the template parameter. */
13635 identifier);
13637 /* If the next token is an `=', then there is a
13638 default-argument. */
13640 {
13641 default_argument
13644 /* Template parameter packs cannot have default
13645 arguments. */
13647 {
13650 "template parameter pack %qD cannot "
13652 identifier);
13653 else
13657 }
13658 }
13659 else
13662 /* Create the combined representation of the parameter and the
13663 default argument. */
13665 }
13671 }
13674 }
13676 /* Parse a template-id.
13678 template-id:
13679 template-name < template-argument-list [opt] >
13681 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13682 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13683 returned. Otherwise, if the template-name names a function, or set
13684 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13685 names a class, returns a TYPE_DECL for the specialization.
13687 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13688 uninstantiated templates. */
13690 static tree
13696 {
13698 tree templ;
13699 tree arguments;
13700 tree template_id;
13707 /* If the next token corresponds to a template-id, there is no need
13708 to reparse it. */
13711 {
13714 /* Get the stored value. */
13716 /* Perform any access checks that were deferred. */
13719 {
13724 tf_warning_or_error);
13725 }
13726 /* Return the stored value. */
13728 }
13730 /* Avoid performing name lookup if there is no possibility of
13731 finding a template-id. */
13734 && !cp_parser_nth_token_starts_template_argument_list_p
13736 {
13739 }
13741 /* Remember where the template-id starts. */
13747 /* Parse the template-name. */
13750 check_dependency_p,
13751 is_declaration,
13752 tag_type,
13755 {
13758 }
13760 /* If we find the sequence `[:' after a template-name, it's probably
13761 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13762 parse correctly the argument list. */
13769 {
13771 /* Change `:' into `::'. */
13773 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13774 CPP_LESS. */
13777 /* Parse the arguments. */
13780 {
13781 /* If we couldn't parse an argument list, then we revert our changes
13782 and return simply an error. Maybe this is not a template-id
13783 after all. */
13788 }
13789 /* Otherwise, emit an error about the invalid digraph, but continue
13790 parsing because we got our argument list. */
13793 {
13796 "%<<:%> is an alternate spelling for %<[%>."
13799 {
13801 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13804 }
13805 }
13806 }
13807 else
13808 {
13809 /* Look for the `<' that starts the template-argument-list. */
13811 {
13814 }
13815 /* Parse the arguments. */
13817 }
13819 /* Build a representation of the specialization. */
13822 TEMPLATE_ID_EXPR,
13826 {
13828 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13829 template (rather than some instantiation thereof) only if
13830 is not nested within some other construct. For example, in
13831 "template <typename T> void f(T) { A<T>::", A<T> is just an
13832 instantiation of A. */
13835 CPP_SCOPE));
13836 template_id
13838 }
13840 {
13844 }
13845 else
13846 {
13847 /* If it's not a class-template or a template-template, it should be
13848 a function-template. */
13856 }
13858 /* If parsing tentatively, replace the sequence of tokens that makes
13859 up the template-id with a CPP_TEMPLATE_ID token. That way,
13860 should we re-parse the token stream, we will not have to repeat
13861 the effort required to do the parse, nor will we issue duplicate
13862 error messages about problems during instantiation of the
13863 template. */
13865 /* Don't do this if we had a parse error in a declarator; re-parsing
13866 might succeed if a name changes meaning (60361). */
13870 {
13873 /* Reset the contents of the START_OF_ID token. */
13875 /* Retrieve any deferred checks. Do not pop this access checks yet
13876 so the memory will not be reclaimed during token replacing below. */
13882 /* Purge all subsequent tokens. */
13885 /* ??? Can we actually assume that, if template_id ==
13886 error_mark_node, we will have issued a diagnostic to the
13887 user, as opposed to simply marking the tentative parse as
13888 failed? */
13891 }
13895 }
13897 /* Parse a template-name.
13899 template-name:
13900 identifier
13902 The standard should actually say:
13904 template-name:
13905 identifier
13906 operator-function-id
13908 A defect report has been filed about this issue.
13910 A conversion-function-id cannot be a template name because they cannot
13911 be part of a template-id. In fact, looking at this code:
13913 a.operator K<int>()
13915 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13916 It is impossible to call a templated conversion-function-id with an
13917 explicit argument list, since the only allowed template parameter is
13918 the type to which it is converting.
13920 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13921 `template' keyword, in a construction like:
13923 T::template f<3>()
13925 In that case `f' is taken to be a template-name, even though there
13926 is no way of knowing for sure.
13928 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13929 name refers to a set of overloaded functions, at least one of which
13930 is a template, or an IDENTIFIER_NODE with the name of the template,
13931 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13932 names are looked up inside uninstantiated templates. */
13934 static tree
13941 {
13942 tree identifier;
13943 tree decl;
13944 tree fns;
13947 /* If the next token is `operator', then we have either an
13948 operator-function-id or a conversion-function-id. */
13950 {
13951 /* We don't know whether we're looking at an
13952 operator-function-id or a conversion-function-id. */
13954 /* Try an operator-function-id. */
13956 /* If that didn't work, try a conversion-function-id. */
13958 {
13961 }
13962 }
13963 /* Look for the identifier. */
13964 else
13967 /* If we didn't find an identifier, we don't have a template-id. */
13971 /* If the name immediately followed the `template' keyword, then it
13972 is a template-name. However, if the next token is not `<', then
13973 we do not treat it as a template-name, since it is not being used
13974 as part of a template-id. This enables us to handle constructs
13975 like:
13977 template <typename T> struct S { S(); };
13978 template <typename T> S<T>::S();
13980 correctly. We would treat `S' as a template -- if it were `S<T>'
13981 -- but we do not if there is no `<'. */
13985 {
13986 /* In a declaration, in a dependent context, we pretend that the
13987 "template" keyword was present in order to improve error
13988 recovery. For example, given:
13990 template <typename T> void f(T::X<int>);
13992 we want to treat "X<int>" as a template-id. */
13994 && !template_keyword_p
13996 && check_dependency_p
13998 /* Do not do this for dtors (or ctors), since they never
13999 need the template keyword before their name. */
14001 {
14004 /* Explain what went wrong. */
14006 identifier);
14009 /* If parsing tentatively, find the location of the "<" token. */
14012 /* Parse the template arguments so that we can issue error
14013 messages about them. */
14016 /* Skip tokens until we find a good place from which to
14017 continue parsing. */
14022 /* If parsing tentatively, permanently remove the
14023 template argument list. That will prevent duplicate
14024 error messages from being issued about the missing
14025 "template" keyword. */
14031 }
14033 /* If the "template" keyword is present, then there is generally
14034 no point in doing name-lookup, so we just return IDENTIFIER.
14035 But, if the qualifying scope is non-dependent then we can
14036 (and must) do name-lookup normally. */
14042 }
14044 /* Look up the name. */
14046 tag_type,
14049 check_dependency_p,
14055 /* If DECL is a template, then the name was a template-name. */
14057 {
14061 }
14062 else
14063 {
14066 /* The standard does not explicitly indicate whether a name that
14067 names a set of overloaded declarations, some of which are
14068 templates, is a template-name. However, such a name should
14069 be a template-name; otherwise, there is no way to form a
14070 template-id for the overloaded templates. */
14078 {
14079 /* The name does not name a template. */
14082 }
14083 }
14085 /* If DECL is dependent, and refers to a function, then just return
14086 its name; we will look it up again during template instantiation. */
14088 {
14092 }
14095 }
14097 /* Parse a template-argument-list.
14099 template-argument-list:
14100 template-argument ... [opt]
14101 template-argument-list , template-argument ... [opt]
14103 Returns a TREE_VEC containing the arguments. */
14105 static tree
14107 {
14112 tree vec;
14119 /* Even if the template-id appears in an integral
14120 constant-expression, the contents of the argument list do
14121 not. */
14127 /* Parse the arguments. */
14128 do
14129 {
14130 tree argument;
14133 /* Consume the comma. */
14136 /* Parse the template-argument. */
14139 /* If the next token is an ellipsis, we're expanding a template
14140 argument pack. */
14142 {
14144 {
14148 }
14149 /* Consume the `...' token. */
14152 /* Make the argument into a TYPE_PACK_EXPANSION or
14153 EXPR_PACK_EXPANSION. */
14155 }
14158 {
14162 {
14165 }
14166 else
14168 }
14170 }
14183 #ifdef ENABLE_CHECKING
14185 #endif
14187 }
14189 /* Parse a template-argument.
14191 template-argument:
14192 assignment-expression
14193 type-id
14194 id-expression
14196 The representation is that of an assignment-expression, type-id, or
14197 id-expression -- except that the qualified id-expression is
14198 evaluated, so that the value returned is either a DECL or an
14199 OVERLOAD.
14201 Although the standard says "assignment-expression", it forbids
14202 throw-expressions or assignments in the template argument.
14203 Therefore, we use "conditional-expression" instead. */
14205 static tree
14207 {
14208 tree argument;
14214 cp_id_kind idk;
14216 /* There's really no way to know what we're looking at, so we just
14217 try each alternative in order.
14219 [temp.arg]
14221 In a template-argument, an ambiguity between a type-id and an
14222 expression is resolved to a type-id, regardless of the form of
14223 the corresponding template-parameter.
14225 Therefore, we try a type-id first. */
14228 /* If there was no error parsing the type-id but the next token is a
14229 '>>', our behavior depends on which dialect of C++ we're
14230 parsing. In C++98, we probably found a typo for '> >'. But there
14231 are type-id which are also valid expressions. For instance:
14233 struct X { int operator >> (int); };
14234 template <int V> struct Foo {};
14235 Foo<X () >> 5> r;
14237 Here 'X()' is a valid type-id of a function type, but the user just
14238 wanted to write the expression "X() >> 5". Thus, we remember that we
14239 found a valid type-id, but we still try to parse the argument as an
14240 expression to see what happens.
14242 In C++0x, the '>>' will be considered two separate '>'
14243 tokens. */
14247 {
14250 }
14251 else
14252 {
14253 /* If the next token isn't a `,' or a `>', then this argument wasn't
14254 really finished. This means that the argument is not a valid
14255 type-id. */
14258 /* If that worked, we're done. */
14261 }
14262 /* We're still not sure what the argument will be. */
14264 /* Try a template. */
14272 /* If the next token isn't a `,' or a `>', then this argument wasn't
14273 really finished. */
14277 {
14278 /* Figure out what is being referred to. If the id-expression
14279 was for a class template specialization, then we will have a
14280 TYPE_DECL at this point. There is no need to do name lookup
14281 at this point in that case. */
14284 none_type,
14293 }
14295 {
14299 }
14300 /* It must be a non-type argument. There permitted cases are given
14301 in [temp.arg.nontype]:
14303 -- an integral constant-expression of integral or enumeration
14304 type; or
14306 -- the name of a non-type template-parameter; or
14308 -- the name of an object or function with external linkage...
14310 -- the address of an object or function with external linkage...
14312 -- a pointer to member... */
14313 /* Look for a non-type template parameter. */
14315 {
14327 }
14329 /* If the next token is "&", the argument must be the address of an
14330 object or function with external linkage. */
14333 {
14336 }
14337 /* See if we might have an id-expression. */
14344 {
14347 address_p,
14354 else
14355 {
14356 tree probe;
14359 {
14360 /* Strip the dereference temporarily. */
14363 }
14365 /* If we're in a template, we represent a qualified-id referring
14366 to a static data member as a SCOPE_REF even if the scope isn't
14367 dependent so that we can check access control later. */
14372 {
14373 /* A variable without external linkage might still be a
14374 valid constant-expression, so no error is issued here
14375 if the external-linkage check fails. */
14378 }
14380 /* All overloaded functions are allowed; if the external
14381 linkage test does not pass, an error will be issued
14382 later. */
14383 ;
14387 /* A pointer-to-member. */
14388 ;
14390 ;
14391 else
14395 {
14398 tf_warning_or_error);
14399 else
14402 }
14403 }
14404 }
14405 /* If the argument started with "&", there are no other valid
14406 alternatives at this point. */
14408 {
14411 }
14413 /* If the argument wasn't successfully parsed as a type-id followed
14414 by '>>', the argument can only be a constant expression now.
14415 Otherwise, we try parsing the constant-expression tentatively,
14416 because the argument could really be a type-id. */
14427 /* We did our best to parse the argument as a non type-id, but that
14428 was the only alternative that matched (albeit with a '>' after
14429 it). We can assume it's just a typo from the user, and a
14430 diagnostic will then be issued. */
14432 }
14434 /* Parse an explicit-instantiation.
14436 explicit-instantiation:
14437 template declaration
14439 Although the standard says `declaration', what it really means is:
14441 explicit-instantiation:
14442 template decl-specifier-seq [opt] declarator [opt] ;
14444 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14445 supposed to be allowed. A defect report has been filed about this
14446 issue.
14448 GNU Extension:
14450 explicit-instantiation:
14451 storage-class-specifier template
14452 decl-specifier-seq [opt] declarator [opt] ;
14453 function-specifier template
14454 decl-specifier-seq [opt] declarator [opt] ; */
14456 static void
14458 {
14460 cp_decl_specifier_seq decl_specifiers;
14465 /* Look for an (optional) storage-class-specifier or
14466 function-specifier. */
14468 {
14469 extension_specifier
14472 extension_specifier
14475 }
14477 /* Look for the `template' keyword. */
14479 /* Let the front end know that we are processing an explicit
14480 instantiation. */
14482 /* [temp.explicit] says that we are supposed to ignore access
14483 control while processing explicit instantiation directives. */
14485 /* Parse a decl-specifier-seq. */
14487 CP_PARSER_FLAGS_OPTIONAL,
14490 /* If there was exactly one decl-specifier, and it declared a class,
14491 and there's no declarator, then we have an explicit type
14492 instantiation. */
14494 {
14495 tree type;
14499 /* Turn access control back on for names used during
14500 template instantiation. */
14505 }
14506 else
14507 {
14509 tree decl;
14511 /* Parse the declarator. */
14512 declarator
14523 {
14526 "explicit instantiation shall not use"
14530 "explicit instantiation shall not use"
14535 /* Turn access control back on for names used during
14536 template instantiation. */
14538 /* Do the explicit instantiation. */
14540 }
14541 else
14542 {
14544 /* Skip the body of the explicit instantiation. */
14546 }
14547 }
14548 /* We're done with the instantiation. */
14554 }
14556 /* Parse an explicit-specialization.
14558 explicit-specialization:
14559 template < > declaration
14561 Although the standard says `declaration', what it really means is:
14563 explicit-specialization:
14564 template <> decl-specifier [opt] init-declarator [opt] ;
14565 template <> function-definition
14566 template <> explicit-specialization
14567 template <> template-declaration */
14569 static void
14571 {
14575 /* Look for the `template' keyword. */
14577 /* Look for the `<'. */
14579 /* Look for the `>'. */
14581 /* We have processed another parameter list. */
14583 /* [temp]
14585 A template ... explicit specialization ... shall not have C
14586 linkage. */
14588 {
14590 /* Give it C++ linkage to avoid confusing other parts of the
14591 front end. */
14594 }
14595 else
14597 /* Let the front end know that we are beginning a specialization. */
14599 {
14602 }
14604 /* If the next keyword is `template', we need to figure out whether
14605 or not we're looking a template-declaration. */
14607 {
14612 else
14614 }
14615 else
14616 /* Parse the dependent declaration. */
14622 /* We're done with the specialization. */
14624 /* For the erroneous case of a template with C linkage, we pushed an
14625 implicit C++ linkage scope; exit that scope now. */
14628 /* We're done with this parameter list. */
14630 }
14632 /* Parse a type-specifier.
14634 type-specifier:
14635 simple-type-specifier
14636 class-specifier
14637 enum-specifier
14638 elaborated-type-specifier
14639 cv-qualifier
14641 GNU Extension:
14643 type-specifier:
14644 __complex__
14646 Returns a representation of the type-specifier. For a
14647 class-specifier, enum-specifier, or elaborated-type-specifier, a
14648 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14650 The parser flags FLAGS is used to control type-specifier parsing.
14652 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14653 in a decl-specifier-seq.
14655 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14656 class-specifier, enum-specifier, or elaborated-type-specifier, then
14657 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14658 if a type is declared; 2 if it is defined. Otherwise, it is set to
14659 zero.
14661 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14662 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14663 is set to FALSE. */
14665 static tree
14667 cp_parser_flags flags,
14672 {
14678 /* Assume this type-specifier does not declare a new type. */
14681 /* And that it does not specify a cv-qualifier. */
14684 /* Peek at the next token. */
14687 /* If we're looking at a keyword, we can use that to guide the
14688 production we choose. */
14691 {
14696 /* Look for the enum-specifier. */
14698 /* If that worked, we're done. */
14700 {
14705 type_spec,
14706 token,
14709 }
14710 else
14713 /* Any of these indicate either a class-specifier, or an
14714 elaborated-type-specifier. */
14721 /* Parse tentatively so that we can back up if we don't find a
14722 class-specifier. */
14724 /* Look for the class-specifier. */
14727 /* If that worked, we're done. */
14729 {
14734 type_spec,
14735 token,
14738 }
14740 /* Fall through. */
14741 elaborated_type_specifier:
14742 /* We're declaring (not defining) a class or enum. */
14746 /* Fall through. */
14748 /* Look for an elaborated-type-specifier. */
14749 type_spec
14750 = (cp_parser_elaborated_type_specifier
14753 is_declaration));
14756 type_spec,
14757 token,
14780 /* The `__complex__' keyword is a GNU extension. */
14786 }
14788 /* Handle simple keywords. */
14790 {
14792 {
14795 }
14797 }
14799 /* If we do not already have a type-specifier, assume we are looking
14800 at a simple-type-specifier. */
14802 decl_specs,
14803 flags);
14805 /* If we didn't find a type-specifier, and a type-specifier was not
14806 optional in this context, issue an error message. */
14808 {
14811 }
14814 }
14816 /* Parse a simple-type-specifier.
14818 simple-type-specifier:
14819 :: [opt] nested-name-specifier [opt] type-name
14820 :: [opt] nested-name-specifier template template-id
14821 char
14822 wchar_t
14823 bool
14824 short
14825 int
14826 long
14827 signed
14828 unsigned
14829 float
14830 double
14831 void
14833 C++0x Extension:
14835 simple-type-specifier:
14836 auto
14837 decltype ( expression )
14838 char16_t
14839 char32_t
14840 __underlying_type ( type-id )
14842 GNU Extension:
14844 simple-type-specifier:
14845 __int128
14846 __typeof__ unary-expression
14847 __typeof__ ( type-id )
14848 __typeof__ ( type-id ) { initializer-list , [opt] }
14850 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14851 appropriately updated. */
14853 static tree
14856 cp_parser_flags flags)
14857 {
14862 /* Peek at the next token. */
14865 /* If we're looking at a keyword, things are easy. */
14867 {
14902 {
14905 }
14934 {
14935 /* The 'auto' might be the placeholder return type for a function decl
14936 with trailing return type. */
14940 {
14948 have_trailing_return_fn_decl
14951 }
14954 {
14957 }
14961 else
14965 {
14968 "use of %<auto%> in lambda parameter declaration "
14969 "only available with "
14971 }
14974 "use of %<auto%> in parameter declaration "
14975 "only available with "
14977 else
14979 "ISO C++ forbids use of %<auto%> in parameter "
14981 }
14982 else
14987 /* Since DR 743, decltype can either be a simple-type-specifier by
14988 itself or begin a nested-name-specifier. Parsing it will replace
14989 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14990 handling below decide what to do. */
14996 /* Consume the `typeof' token. */
14998 /* Parse the operand to `typeof'. */
15000 /* If it is not already a TYPE, take its type. */
15006 token,
15015 token,
15025 token,
15030 }
15032 /* If token is an already-parsed decltype not followed by ::,
15033 it's a simple-type-specifier. */
15036 {
15039 {
15041 token,
15043 /* Remember that we are handling a decltype in order to
15044 implement the resolution of DR 1510 when the argument
15045 isn't instantiation dependent. */
15047 }
15050 }
15052 /* If the type-specifier was for a built-in type, we're done. */
15054 {
15055 /* Record the type. */
15062 type,
15063 token,
15068 /* Consume the token. */
15074 /* There is no valid C++ program where a non-template type is
15075 followed by a "<". That usually indicates that the user thought
15076 that the type was a template. */
15081 }
15083 /* The type-specifier must be a user-defined type. */
15085 {
15089 /* Don't gobble tokens or issue error messages if this is an
15090 optional type-specifier. */
15094 /* Look for the optional `::' operator. */
15095 global_p
15099 /* Look for the nested-name specifier. */
15100 qualified_p
15108 /* If we have seen a nested-name-specifier, and the next token
15109 is `template', then we are using the template-id production. */
15112 {
15113 /* Look for the template-id. */
15117 none_type,
15119 /* If the template-id did not name a type, we are out of
15120 luck. */
15122 {
15125 }
15126 }
15127 /* Otherwise, look for a type-name. */
15128 else
15130 /* Keep track of all name-lookups performed in class scopes. */
15132 && !global_p
15133 && !qualified_p
15137 /* If it didn't work out, we don't have a TYPE. */
15143 token,
15145 }
15147 /* If we didn't get a type-name, issue an error message. */
15149 {
15152 }
15155 {
15156 /* See if TYPE is an Objective-C type, and if so, parse and
15157 accept any protocol references following it. Do this before
15158 the cp_parser_check_for_invalid_template_id() call, because
15159 Objective-C types can be followed by '<...>' which would
15160 enclose protocol names rather than template arguments, and so
15161 everything is fine. */
15164 {
15168 /* Clobber the "unqualified" type previously entered into
15169 DECL_SPECS with the new, improved protocol-qualified version. */
15174 }
15176 /* There is no valid C++ program where a non-template type is
15177 followed by a "<". That usually indicates that the user
15178 thought that the type was a template. */
15180 none_type,
15182 }
15185 }
15187 /* Parse a type-name.
15189 type-name:
15190 class-name
15191 enum-name
15192 typedef-name
15193 simple-template-id [in c++0x]
15195 enum-name:
15196 identifier
15198 typedef-name:
15199 identifier
15201 Returns a TYPE_DECL for the type. */
15203 static tree
15205 {
15206 tree type_decl;
15208 /* We can't know yet whether it is a class-name or not. */
15210 /* Try a class-name. */
15214 none_type,
15218 /* If it's not a class-name, keep looking. */
15220 {
15222 /* It must be a typedef-name or an enum-name. */
15226 /* It is either a simple-template-id representing an
15227 instantiation of an alias template... */
15231 none_type,
15233 /* Note that this must be an instantiation of an alias template
15234 because [temp.names]/6 says:
15236 A template-id that names an alias template specialization
15237 is a type-name.
15239 Whereas [temp.names]/7 says:
15241 A simple-template-id that names a class template
15242 specialization is a class-name. */
15247 else
15251 /* ... Or a typedef-name or an enum-name. */
15253 }
15256 }
15258 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15260 enum-name:
15261 identifier
15263 typedef-name:
15264 identifier
15266 Returns a TYPE_DECL for the type. */
15268 static tree
15270 {
15271 tree type_decl;
15272 tree identifier;
15279 /* Look up the type-name. */
15286 {
15287 /* See if this is an Objective-C type. */
15292 }
15294 /* Issue an error if we did not find a type-name. */
15296 /* In Objective-C, we have the complication that class names are
15297 normally type names and start declarations (eg, the
15298 "NSObject" in "NSObject *object;"), but can be used in an
15299 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15300 is an expression. So, a classname followed by a dot is not a
15301 valid type-name. */
15304 {
15309 }
15310 /* Remember that the name was used in the definition of the
15311 current class so that we can check later to see if the
15312 meaning would have been different after the class was
15313 entirely defined. */
15319 }
15321 /* Parse an elaborated-type-specifier. Note that the grammar given
15322 here incorporates the resolution to DR68.
15324 elaborated-type-specifier:
15325 class-key :: [opt] nested-name-specifier [opt] identifier
15326 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15327 enum-key :: [opt] nested-name-specifier [opt] identifier
15328 typename :: [opt] nested-name-specifier identifier
15329 typename :: [opt] nested-name-specifier template [opt]
15330 template-id
15332 GNU extension:
15334 elaborated-type-specifier:
15335 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15336 class-key attributes :: [opt] nested-name-specifier [opt]
15337 template [opt] template-id
15338 enum attributes :: [opt] nested-name-specifier [opt] identifier
15340 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15341 declared `friend'. If IS_DECLARATION is TRUE, then this
15342 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15343 something is being declared.
15345 Returns the TYPE specified. */
15347 static tree
15351 {
15353 tree identifier;
15356 tree globalscope;
15359 /* See if we're looking at the `enum' keyword. */
15361 {
15362 /* Consume the `enum' token. */
15364 /* Remember that it's an enumeration type. */
15366 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15367 enums) is used here. */
15370 {
15374 /* Consume the `struct' or `class' and parse it anyway. */
15376 }
15377 /* Parse the attributes. */
15379 }
15380 /* Or, it might be `typename'. */
15382 RID_TYPENAME))
15383 {
15384 /* Consume the `typename' token. */
15386 /* Remember that it's a `typename' type. */
15388 }
15389 /* Otherwise it must be a class-key. */
15390 else
15391 {
15395 /* Parse the attributes. */
15397 }
15399 /* Look for the `::' operator. */
15402 /* Look for the nested-name-specifier. */
15404 {
15409 is_declaration))
15411 }
15412 else
15413 /* Even though `typename' is not present, the proposed resolution
15414 to Core Issue 180 says that in `class A<T>::B', `B' should be
15415 considered a type-name, even if `A<T>' is dependent. */
15420 is_declaration);
15421 /* For everything but enumeration types, consider a template-id.
15422 For an enumeration type, consider only a plain identifier. */
15424 {
15426 tree decl;
15428 /* Allow the `template' keyword. */
15430 /* If we didn't see `template', we don't know if there's a
15431 template-id or not. */
15434 /* Parse the template-id. */
15438 tag_type,
15439 is_declaration);
15440 /* If we didn't find a template-id, look for an ordinary
15441 identifier. */
15443 ;
15444 /* We can get here when cp_parser_template_id, called by
15445 cp_parser_class_name with tag_type == none_type, succeeds
15446 and caches a BASELINK. Then, when called again here,
15447 instead of failing and returning an error_mark_node
15448 returns it (see template/typename17.C in C++11).
15449 ??? Could we diagnose this earlier? */
15451 {
15454 }
15455 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15456 in effect, then we must assume that, upon instantiation, the
15457 template will correspond to a class. */
15461 typename_type,
15463 /* If the `typename' keyword is in effect and DECL is not a type
15464 decl, then type is non existent. */
15466 ;
15472 }
15475 {
15480 {
15483 }
15485 /* For a `typename', we needn't call xref_tag. */
15491 /* Template parameter lists apply only if we are not within a
15492 function parameter list. */
15493 bool template_parm_lists_apply
15502 /* Look up a qualified name in the usual way. */
15504 {
15505 tree decl;
15506 tree ambiguous_decls;
15509 tag_type,
15516 /* If the lookup was ambiguous, an error will already have been
15517 issued. */
15521 /* If we are parsing friend declaration, DECL may be a
15522 TEMPLATE_DECL tree node here. However, we need to check
15523 whether this TEMPLATE_DECL results in valid code. Consider
15524 the following example:
15526 namespace N {
15527 template <class T> class C {};
15528 }
15529 class X {
15530 template <class T> friend class N::C; // #1, valid code
15531 };
15532 template <class T> class Y {
15533 friend class N::C; // #2, invalid code
15534 };
15536 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15537 name lookup of `N::C'. We see that friend declaration must
15538 be template for the code to be valid. Note that
15539 processing_template_decl does not work here since it is
15540 always 1 for the above two cases. */
15542 decl = (cp_parser_maybe_treat_template_as_class
15547 {
15549 identifier,
15552 }
15555 {
15559 allow_template);
15563 }
15565 /* Forward declarations of nested types, such as
15567 class C1::C2;
15568 class C1::C2::C3;
15570 are invalid unless all components preceding the final '::'
15571 are complete. If all enclosing types are complete, these
15572 declarations become merely pointless.
15574 Invalid forward declarations of nested types are errors
15575 caught elsewhere in parsing. Those that are pointless arrive
15576 here. */
15583 }
15584 else
15585 {
15586 /* An elaborated-type-specifier sometimes introduces a new type and
15587 sometimes names an existing type. Normally, the rule is that it
15588 introduces a new type only if there is not an existing type of
15589 the same name already in scope. For example, given:
15591 struct S {};
15592 void f() { struct S s; }
15594 the `struct S' in the body of `f' is the same `struct S' as in
15595 the global scope; the existing definition is used. However, if
15596 there were no global declaration, this would introduce a new
15597 local class named `S'.
15599 An exception to this rule applies to the following code:
15601 namespace N { struct S; }
15603 Here, the elaborated-type-specifier names a new type
15604 unconditionally; even if there is already an `S' in the
15605 containing scope this declaration names a new type.
15606 This exception only applies if the elaborated-type-specifier
15607 forms the complete declaration:
15609 [class.name]
15611 A declaration consisting solely of `class-key identifier ;' is
15612 either a redeclaration of the name in the current scope or a
15613 forward declaration of the identifier as a class name. It
15614 introduces the name into the current scope.
15616 We are in this situation precisely when the next token is a `;'.
15618 An exception to the exception is that a `friend' declaration does
15619 *not* name a new type; i.e., given:
15621 struct S { friend struct T; };
15623 `T' is not a new type in the scope of `S'.
15625 Also, `new struct S' or `sizeof (struct S)' never results in the
15626 definition of a new type; a new type can only be declared in a
15627 declaration context. */
15629 tag_scope ts;
15633 /* Friends have special name lookup rules. */
15637 CPP_SEMICOLON))
15638 /* This is a `class-key identifier ;' */
15640 else
15643 template_p =
15644 (template_parm_lists_apply
15647 /* An unqualified name was used to reference this type, so
15648 there were no qualifying templates. */
15656 }
15657 }
15662 /* Allow attributes on forward declarations of classes. */
15664 {
15674 else
15677 }
15680 {
15681 /* Indicate whether this class was declared as a `class' or as a
15682 `struct'. */
15686 }
15688 /* A "<" cannot follow an elaborated type specifier. If that
15689 happens, the user was probably trying to form a template-id. */
15694 }
15696 /* Parse an enum-specifier.
15698 enum-specifier:
15699 enum-head { enumerator-list [opt] }
15700 enum-head { enumerator-list , } [C++0x]
15702 enum-head:
15703 enum-key identifier [opt] enum-base [opt]
15704 enum-key nested-name-specifier identifier enum-base [opt]
15706 enum-key:
15707 enum
15708 enum class [C++0x]
15709 enum struct [C++0x]
15711 enum-base: [C++0x]
15712 : type-specifier-seq
15714 opaque-enum-specifier:
15715 enum-key identifier enum-base [opt] ;
15717 GNU Extensions:
15718 enum-key attributes[opt] identifier [opt] enum-base [opt]
15719 { enumerator-list [opt] }attributes[opt]
15720 enum-key attributes[opt] identifier [opt] enum-base [opt]
15721 { enumerator-list, }attributes[opt] [C++0x]
15723 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15724 if the token stream isn't an enum-specifier after all. */
15726 static tree
15728 {
15729 tree identifier;
15731 tree prev_scope;
15733 tree attributes;
15746 /* Parse tentatively so that we can back up if we don't find a
15747 enum-specifier. */
15750 /* Caller guarantees that the current token is 'enum', an identifier
15751 possibly follows, and the token after that is an opening brace.
15752 If we don't have an identifier, fabricate an anonymous name for
15753 the enumeration being defined. */
15756 /* Parse the "class" or "struct", which indicates a scoped
15757 enumeration type in C++0x. */
15760 {
15764 /* Consume the `struct' or `class' token. */
15768 }
15772 /* Clear the qualification. */
15777 /* Figure out in what scope the declaration is being placed. */
15783 nested_name_specifier
15791 {
15792 tree name;
15796 enum_type,
15801 input_location);
15803 {
15806 {
15807 /* Are template enums allowed in ISO? */
15811 /* ignore a typename reference, for it will be solved by name
15812 in start_enum. */
15814 }
15815 }
15818 else
15821 }
15822 else
15823 {
15826 else
15827 {
15833 }
15834 }
15837 /* Check for the `:' that denotes a specified underlying type in C++0x.
15838 Note that a ':' could also indicate a bitfield width, however. */
15840 {
15841 cp_decl_specifier_seq type_specifiers;
15843 /* Consume the `:'. */
15846 /* Parse the type-specifier-seq. */
15851 /* At this point this is surely not elaborated type specifier. */
15860 /* If that didn't work, stop. */
15862 {
15868 }
15869 }
15871 /* Look for the `{' but don't consume it yet. */
15873 {
15875 {
15878 {
15881 }
15882 }
15883 /* An opaque-enum-specifier must have a ';' here. */
15886 {
15889 {
15892 }
15893 }
15894 }
15900 {
15902 {
15906 }
15908 {
15910 }
15911 }
15913 /* Issue an error message if type-definitions are forbidden here. */
15916 else
15917 /* Create the new type. We do this before consuming the opening
15918 brace so the enum will be recorded as being on the line of its
15919 tag (or the 'enum' keyword, if there is no tag). */
15923 /* If the next token is not '{' it is an opaque-enum-specifier or an
15924 elaborated-type-specifier. */
15926 {
15930 {
15931 /* The following catches invalid code such as:
15932 enum class S<int>::E { A, B, C }; */
15940 {
15944 nested_name_specifier);
15946 }
15947 /* If that scope does not contain the scope in which the
15948 class was originally declared, the program is invalid. */
15950 nested_name_specifier))
15951 {
15954 "declaration of %qD in namespace %qD which does not "
15957 else
15959 "declaration of %qD in %qD which does not "
15963 }
15964 }
15969 /* Consume the opening brace. */
15976 {
15980 }
15981 else
15982 {
15988 }
15992 /* If the next token is not '}', then there are some enumerators. */
15994 {
15998 }
15999 else
16002 /* Consume the final '}'. */
16008 }
16009 else
16010 {
16011 /* If a ';' follows, then it is an opaque-enum-specifier
16012 and additional restrictions apply. */
16014 {
16021 }
16022 }
16024 /* Look for trailing attributes to apply to this enumeration, and
16025 apply them if appropriate. */
16027 {
16031 trailing_attr,
16033 }
16035 /* Finish up the enumeration. */
16037 {
16042 }
16045 {
16047 {
16050 }
16052 {
16054 }
16055 }
16056 out:
16059 }
16061 /* Parse an enumerator-list. The enumerators all have the indicated
16062 TYPE.
16064 enumerator-list:
16065 enumerator-definition
16066 enumerator-list , enumerator-definition */
16068 static void
16070 {
16072 {
16073 /* Parse an enumerator-definition. */
16076 /* If the next token is not a ',', we've reached the end of
16077 the list. */
16080 /* Otherwise, consume the `,' and keep going. */
16082 /* If the next token is a `}', there is a trailing comma. */
16084 {
16089 }
16090 }
16091 }
16093 /* Parse an enumerator-definition. The enumerator has the indicated
16094 TYPE.
16096 enumerator-definition:
16097 enumerator
16098 enumerator = constant-expression
16100 enumerator:
16101 identifier
16103 GNU Extensions:
16105 enumerator-definition:
16106 enumerator attributes [opt]
16107 enumerator attributes [opt] = constant-expression */
16109 static void
16111 {
16112 tree identifier;
16113 tree value;
16114 location_t loc;
16116 /* Save the input location because we are interested in the location
16117 of the identifier and not the location of the explicit value. */
16120 /* Look for the identifier. */
16125 /* Parse any specified attributes. */
16128 /* If the next token is an '=', then there is an explicit value. */
16130 {
16131 /* Consume the `=' token. */
16133 /* Parse the value. */
16135 }
16136 else
16139 /* If we are processing a template, make sure the initializer of the
16140 enumerator doesn't contain any bare template parameter pack. */
16144 /* Create the enumerator. */
16146 }
16148 /* Parse a namespace-name.
16150 namespace-name:
16151 original-namespace-name
16152 namespace-alias
16154 Returns the NAMESPACE_DECL for the namespace. */
16156 static tree
16158 {
16159 tree identifier;
16160 tree namespace_decl;
16164 /* Get the name of the namespace. */
16169 /* Look up the identifier in the currently active scope. Look only
16170 for namespaces, due to:
16172 [basic.lookup.udir]
16174 When looking up a namespace-name in a using-directive or alias
16175 definition, only namespace names are considered.
16177 And:
16179 [basic.lookup.qual]
16181 During the lookup of a name preceding the :: scope resolution
16182 operator, object, function, and enumerator names are ignored.
16184 (Note that cp_parser_qualifying_entity only calls this
16185 function if the token after the name is the scope resolution
16186 operator.) */
16188 none_type,
16194 /* If it's not a namespace, issue an error. */
16197 {
16202 }
16205 }
16207 /* Parse a namespace-definition.
16209 namespace-definition:
16210 named-namespace-definition
16211 unnamed-namespace-definition
16213 named-namespace-definition:
16214 original-namespace-definition
16215 extension-namespace-definition
16217 original-namespace-definition:
16218 namespace identifier { namespace-body }
16220 extension-namespace-definition:
16221 namespace original-namespace-name { namespace-body }
16223 unnamed-namespace-definition:
16224 namespace { namespace-body } */
16226 static void
16228 {
16235 {
16239 }
16240 else
16243 /* Look for the `namespace' keyword. */
16246 /* Get the name of the namespace. We do not attempt to distinguish
16247 between an original-namespace-definition and an
16248 extension-namespace-definition at this point. The semantic
16249 analysis routines are responsible for that. */
16252 else
16255 /* Parse any specified attributes. */
16258 /* Look for the `{' to start the namespace. */
16260 /* Start the namespace. */
16263 /* "inline namespace" is equivalent to a stub namespace definition
16264 followed by a strong using directive. */
16266 {
16268 /* Set up namespace association. */
16272 /* Import the contents of the inline namespace. */
16276 }
16280 /* Parse the body of the namespace. */
16286 /* Finish the namespace. */
16288 /* Look for the final `}'. */
16290 }
16292 /* Parse a namespace-body.
16294 namespace-body:
16295 declaration-seq [opt] */
16297 static void
16299 {
16301 }
16303 /* Parse a namespace-alias-definition.
16305 namespace-alias-definition:
16306 namespace identifier = qualified-namespace-specifier ; */
16308 static void
16310 {
16311 tree identifier;
16312 tree namespace_specifier;
16316 /* Look for the `namespace' keyword. */
16318 /* Look for the identifier. */
16322 /* Look for the `=' token. */
16325 {
16327 /* Skip the definition. */
16332 }
16334 /* Look for the qualified-namespace-specifier. */
16335 namespace_specifier
16337 /* Look for the `;' token. */
16340 /* Register the alias in the symbol table. */
16342 }
16344 /* Parse a qualified-namespace-specifier.
16346 qualified-namespace-specifier:
16347 :: [opt] nested-name-specifier [opt] namespace-name
16349 Returns a NAMESPACE_DECL corresponding to the specified
16350 namespace. */
16352 static tree
16354 {
16355 /* Look for the optional `::'. */
16359 /* Look for the optional nested-name-specifier. */
16367 }
16369 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16370 access declaration.
16372 using-declaration:
16373 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16374 using :: unqualified-id ;
16376 access-declaration:
16377 qualified-id ;
16379 */
16381 static bool
16384 {
16388 tree decl;
16389 tree identifier;
16390 tree qscope;
16395 {
16398 }
16399 else
16400 {
16401 /* Look for the `using' keyword. */
16404 /* Peek at the next token. */
16406 /* See if it's `typename'. */
16408 {
16409 /* Remember that we've seen it. */
16411 /* Consume the `typename' token. */
16413 }
16414 }
16416 /* Look for the optional global scope qualification. */
16417 global_scope_p
16422 /* If we saw `typename', or didn't see `::', then there must be a
16423 nested-name-specifier present. */
16425 {
16431 {
16434 }
16435 }
16436 /* Otherwise, we could be in either of the two productions. In that
16437 case, treat the nested-name-specifier as optional. */
16438 else
16450 /* Something has already gone wrong; there's no need to parse
16451 further. Since an error has occurred, the return value of
16452 cp_parser_parse_definitely will be false, as required. */
16456 /* Parse the unqualified-id. */
16464 {
16469 }
16471 /* The function we call to handle a using-declaration is different
16472 depending on what scope we are in. */
16474 ;
16477 /* [namespace.udecl]
16479 A using declaration shall not name a template-id. */
16482 else
16483 {
16485 {
16486 /* Create the USING_DECL. */
16493 {
16496 }
16497 else
16498 /* Add it to the list of members in this class. */
16500 }
16501 else
16502 {
16504 identifier,
16511 {
16514 }
16517 else
16519 }
16520 }
16522 /* Look for the final `;'. */
16527 "access declarations are deprecated "
16528 "in favour of using-declarations; "
16532 }
16534 /* Parse an alias-declaration.
16536 alias-declaration:
16537 using identifier attribute-specifier-seq [opt] = type-id */
16539 static tree
16541 {
16543 location_t id_location;
16545 cp_decl_specifier_seq decl_specs;
16549 /* Look for the `using' keyword. */
16550 cp_token *using_token
16572 /* Now we are going to parse the type-id of the declaration. */
16574 /*
16575 [dcl.type]/3 says:
16577 "A type-specifier-seq shall not define a class or enumeration
16578 unless it appears in the type-id of an alias-declaration (7.1.3) that
16579 is not the declaration of a template-declaration."
16581 In other words, if we currently are in an alias template, the
16582 type-id should not define a type.
16584 So let's set parser->type_definition_forbidden_message in that
16585 case; cp_parser_check_type_definition (called by
16586 cp_parser_class_specifier) will then emit an error if a type is
16587 defined in the type-id. */
16589 {
16593 }
16597 /* Restore the error message if need be. */
16603 {
16606 }
16608 /* A typedef-name can also be introduced by an alias-declaration. The
16609 identifier following the using keyword becomes a typedef-name. It has
16610 the same semantics as if it were introduced by the typedef
16611 specifier. In particular, it does not define a new type and it shall
16612 not appear in the type-id. */
16617 {
16620 ds_attribute,
16621 attrs_token);
16622 }
16624 ds_typedef,
16625 using_token);
16627 ds_alias,
16628 using_token);
16637 else
16648 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16649 added into the symbol table; otherwise, return the TYPE_DECL. */
16653 {
16657 }
16660 }
16662 /* Parse a using-directive.
16664 using-directive:
16665 using namespace :: [opt] nested-name-specifier [opt]
16666 namespace-name ; */
16668 static void
16670 {
16671 tree namespace_decl;
16672 tree attribs;
16674 /* Look for the `using' keyword. */
16676 /* And the `namespace' keyword. */
16678 /* Look for the optional `::' operator. */
16680 /* And the optional nested-name-specifier. */
16686 /* Get the namespace being used. */
16688 /* And any specified attributes. */
16690 /* Update the symbol table. */
16692 /* Look for the final `;'. */
16694 }
16696 /* Parse an asm-definition.
16698 asm-definition:
16699 asm ( string-literal ) ;
16701 GNU Extension:
16703 asm-definition:
16704 asm volatile [opt] ( string-literal ) ;
16705 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16706 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16707 : asm-operand-list [opt] ) ;
16708 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16709 : asm-operand-list [opt]
16710 : asm-clobber-list [opt] ) ;
16711 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16712 : asm-clobber-list [opt]
16713 : asm-goto-list ) ; */
16715 static void
16717 {
16718 tree string;
16723 tree asm_stmt;
16731 /* Look for the `asm' keyword. */
16736 {
16739 }
16741 /* See if the next token is `volatile'. */
16744 {
16745 /* Remember that we saw the `volatile' keyword. */
16747 /* Consume the token. */
16749 }
16753 {
16754 /* Remember that we saw the `goto' keyword. */
16756 /* Consume the token. */
16758 }
16759 /* Look for the opening `('. */
16762 /* Look for the string. */
16765 {
16769 }
16771 /* If we're allowing GNU extensions, check for the extended assembly
16772 syntax. Unfortunately, the `:' tokens need not be separated by
16773 a space in C, and so, for compatibility, we tolerate that here
16774 too. Doing that means that we have to treat the `::' operator as
16775 two `:' tokens. */
16780 {
16785 /* The extended syntax was used. */
16788 /* Look for outputs. */
16790 {
16791 /* Consume the `:'. */
16793 /* Parse the output-operands. */
16795 CPP_COLON)
16797 CPP_SCOPE)
16799 CPP_CLOSE_PAREN)
16801 {
16805 }
16806 }
16807 /* If the next token is `::', there are no outputs, and the
16808 next token is the beginning of the inputs. */
16810 /* The inputs are coming next. */
16813 /* Look for inputs. */
16816 {
16817 /* Consume the `:' or `::'. */
16819 /* Parse the output-operands. */
16821 CPP_COLON)
16823 CPP_SCOPE)
16825 CPP_CLOSE_PAREN))
16826 {
16830 }
16831 }
16833 /* The clobbers are coming next. */
16836 /* Look for clobbers. */
16839 {
16841 /* Consume the `:' or `::'. */
16843 /* Parse the clobbers. */
16845 CPP_COLON)
16847 CPP_CLOSE_PAREN))
16849 }
16852 /* The labels are coming next. */
16855 /* Look for labels. */
16858 {
16860 /* Consume the `:' or `::'. */
16862 /* Parse the labels. */
16864 }
16868 }
16872 /* Look for the closing `)'. */
16880 {
16881 /* Create the ASM_EXPR. */
16883 {
16886 /* If the extended syntax was not used, mark the ASM_EXPR. */
16888 {
16894 }
16895 }
16896 else
16898 }
16899 }
16901 /* Declarators [gram.dcl.decl] */
16903 /* Parse an init-declarator.
16905 init-declarator:
16906 declarator initializer [opt]
16908 GNU Extension:
16910 init-declarator:
16911 declarator asm-specification [opt] attributes [opt] initializer [opt]
16913 function-definition:
16914 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16915 function-body
16916 decl-specifier-seq [opt] declarator function-try-block
16918 GNU Extension:
16920 function-definition:
16921 __extension__ function-definition
16923 TM Extension:
16925 function-definition:
16926 decl-specifier-seq [opt] declarator function-transaction-block
16928 The DECL_SPECIFIERS apply to this declarator. Returns a
16929 representation of the entity declared. If MEMBER_P is TRUE, then
16930 this declarator appears in a class scope. The new DECL created by
16931 this declarator is returned.
16933 The CHECKS are access checks that should be performed once we know
16934 what entity is being declared (and, therefore, what classes have
16935 befriended it).
16937 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16938 for a function-definition here as well. If the declarator is a
16939 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16940 be TRUE upon return. By that point, the function-definition will
16941 have been completely parsed.
16943 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16944 is FALSE.
16946 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16947 parsed declaration if it is an uninitialized single declarator not followed
16948 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16949 if present, will not be consumed. If returned, this declarator will be
16950 created with SD_INITIALIZED but will not call cp_finish_decl.
16952 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
16953 and there is an initializer, the pointed location_t is set to the
16954 location of the '=' or `(', or '{' in C++11 token introducing the
16955 initializer. */
16957 static tree
16967 {
16971 tree prefix_attributes;
16973 tree asm_specification;
16974 tree initializer;
16976 tree scope;
16978 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16979 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16980 "(...)". */
16991 /* Gather the attributes that were provided with the
16992 decl-specifiers. */
16995 /* Assume that this is not the declarator for a function
16996 definition. */
17000 /* Default arguments are only permitted for function parameters. */
17004 /* Defer access checks while parsing the declarator; we cannot know
17005 what names are accessible until we know what is being
17006 declared. */
17009 /* Parse the declarator. */
17011 declarator
17016 /* Gather up the deferred checks. */
17021 /* If the DECLARATOR was erroneous, there's no need to go
17022 further. */
17026 /* Check that the number of template-parameter-lists is OK. */
17036 /* Figure out what scope the entity declared by the DECLARATOR is
17037 located in. `grokdeclarator' sometimes changes the scope, so
17038 we compute it now. */
17041 /* Perform any lookups in the declared type which were thought to be
17042 dependent, but are not in the scope of the declarator. */
17043 decl_specifiers->type
17046 /* If we're allowing GNU extensions, look for an
17047 asm-specification. */
17049 {
17050 /* Look for an asm-specification. */
17053 }
17054 else
17057 /* Look for attributes. */
17061 /* Peek at the next token. */
17067 {
17068 /* Check to see if the token indicates the start of a
17069 function-definition. */
17071 {
17073 {
17074 /* If a function-definition should not appear here, issue an
17075 error message. */
17079 }
17081 location_t func_brace_location
17084 /* Neither attributes nor an asm-specification are allowed
17085 on a function-definition. */
17088 "an asm-specification is not allowed "
17092 "attributes are not allowed "
17094 /* This is a function-definition. */
17097 /* Parse the function definition. */
17100 decl_specifiers,
17101 declarator,
17102 prefix_attributes);
17103 else
17104 decl =
17105 (cp_parser_function_definition_from_specifiers_and_declarator
17109 {
17110 /* This is where the prologue starts... */
17113 }
17116 }
17117 }
17119 {
17120 /* A non-template declaration involving a function parameter list
17121 containing an implicit template parameter will be made into a
17122 template. If the resulting declaration is not going to be an
17123 actual function then finish the template scope here to prevent it.
17124 An error message will be issued once we have a decl to talk about.
17126 FIXME probably we should do type deduction rather than create an
17127 implicit template, but the standard currently doesn't allow it. */
17130 }
17132 /* [dcl.dcl]
17134 Only in function declarations for constructors, destructors, and
17135 type conversions can the decl-specifier-seq be omitted.
17137 We explicitly postpone this check past the point where we handle
17138 function-definitions because we tolerate function-definitions
17139 that are missing their return types in some modes. */
17141 {
17145 }
17147 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17151 {
17162 {
17168 }
17169 }
17170 else
17171 {
17172 /* If the init-declarator isn't initialized and isn't followed by a
17173 `,' or `;', it's not a valid init-declarator. */
17176 {
17179 else
17180 {
17184 }
17185 }
17188 }
17190 /* Because start_decl has side-effects, we should only call it if we
17191 know we're going ahead. By this point, we know that we cannot
17192 possibly be looking at any other construct. */
17195 /* Enter the newly declared entry in the symbol table. If we're
17196 processing a declaration in a class-specifier, we wait until
17197 after processing the initializer. */
17199 {
17206 /* Adjust location of decl if declarator->id_loc is more appropriate:
17207 set, and decl wasn't merged with another decl, in which case its
17208 location would be different from input_location, and more accurate. */
17213 }
17215 /* Enter the SCOPE. That way unqualified names appearing in the
17216 initializer will be looked up in SCOPE. */
17219 /* Perform deferred access control checks, now that we know in which
17220 SCOPE the declared entity resides. */
17222 {
17225 /* If the entity being declared is a function, pretend that we
17226 are in its scope. If it is a `friend', it may have access to
17227 things that would not otherwise be accessible. */
17229 {
17232 }
17234 /* Perform access checks for template parameters. */
17237 /* Perform the access control checks for the declarator and the
17238 decl-specifiers. */
17241 /* Restore the saved value. */
17244 }
17246 /* Parse the initializer. */
17251 {
17253 {
17256 else
17257 {
17258 /* If the declaration was erroneous, we don't really
17259 know what the user intended, so just silently
17260 consume the initializer. */
17267 }
17268 }
17269 else
17270 {
17271 /* We want to record the extra mangling scope for in-class
17272 initializers of class members and initializers of static data
17273 member templates. The former involves deferring
17274 parsing of the initializer until end of class as with default
17275 arguments. So right here we only handle the latter. */
17285 }
17286 }
17288 /* The old parser allows attributes to appear after a parenthesized
17289 initializer. Mark Mitchell proposed removing this functionality
17290 on the GCC mailing lists on 2002-08-13. This parser accepts the
17291 attributes -- but ignores them. */
17298 /* And now complain about a non-function implicit template. */
17303 /* For an in-class declaration, use `grokfield' to create the
17304 declaration. */
17306 {
17308 {
17311 }
17319 }
17321 /* Finish processing the declaration. But, skip member
17322 declarations. */
17324 {
17327 asm_specification,
17328 /* If the initializer is in parentheses, then this is
17329 a direct-initialization, which means that an
17330 `explicit' constructor is OK. Otherwise, an
17331 `explicit' constructor cannot be used. */
17334 }
17337 /* Core issue #226 (C++0x only): A default template-argument
17338 shall not be specified in a friend class template
17339 declaration. */
17348 {
17351 else
17353 }
17356 }
17358 /* Parse a declarator.
17360 declarator:
17361 direct-declarator
17362 ptr-operator declarator
17364 abstract-declarator:
17365 ptr-operator abstract-declarator [opt]
17366 direct-abstract-declarator
17368 GNU Extensions:
17370 declarator:
17371 attributes [opt] direct-declarator
17372 attributes [opt] ptr-operator declarator
17374 abstract-declarator:
17375 attributes [opt] ptr-operator abstract-declarator [opt]
17376 attributes [opt] direct-abstract-declarator
17378 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17379 detect constructor, destructor or conversion operators. It is set
17380 to -1 if the declarator is a name, and +1 if it is a
17381 function. Otherwise it is set to zero. Usually you just want to
17382 test for >0, but internally the negative value is used.
17384 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17385 a decl-specifier-seq unless it declares a constructor, destructor,
17386 or conversion. It might seem that we could check this condition in
17387 semantic analysis, rather than parsing, but that makes it difficult
17388 to handle something like `f()'. We want to notice that there are
17389 no decl-specifiers, and therefore realize that this is an
17390 expression, not a declaration.)
17392 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17393 the declarator is a direct-declarator of the form "(...)".
17395 MEMBER_P is true iff this declarator is a member-declarator.
17397 FRIEND_P is true iff this declarator is a friend. */
17401 cp_parser_declarator_kind dcl_kind,
17405 {
17408 cp_cv_quals cv_quals;
17409 tree class_type;
17412 /* Assume this is not a constructor, destructor, or type-conversion
17413 operator. */
17420 /* Check for the ptr-operator production. */
17422 /* Parse the ptr-operator. */
17428 /* If that worked, then we have a ptr-operator. */
17430 {
17431 /* If a ptr-operator was found, then this declarator was not
17432 parenthesized. */
17435 /* The dependent declarator is optional if we are parsing an
17436 abstract-declarator. */
17440 /* Parse the dependent declarator. */
17445 friend_p);
17447 /* If we are parsing an abstract-declarator, we must handle the
17448 case where the dependent declarator is absent. */
17453 declarator = cp_parser_make_indirect_declarator
17455 }
17456 /* Everything else is a direct-declarator. */
17457 else
17458 {
17461 CPP_OPEN_PAREN);
17463 ctor_dtor_or_conv_p,
17465 }
17470 }
17472 /* Parse a direct-declarator or direct-abstract-declarator.
17474 direct-declarator:
17475 declarator-id
17476 direct-declarator ( parameter-declaration-clause )
17477 cv-qualifier-seq [opt]
17478 ref-qualifier [opt]
17479 exception-specification [opt]
17480 direct-declarator [ constant-expression [opt] ]
17481 ( declarator )
17483 direct-abstract-declarator:
17484 direct-abstract-declarator [opt]
17485 ( parameter-declaration-clause )
17486 cv-qualifier-seq [opt]
17487 ref-qualifier [opt]
17488 exception-specification [opt]
17489 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17490 ( abstract-declarator )
17492 Returns a representation of the declarator. DCL_KIND is
17493 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17494 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17495 we are parsing a direct-declarator. It is
17496 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17497 of ambiguity we prefer an abstract declarator, as per
17498 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17499 as for cp_parser_declarator. */
17503 cp_parser_declarator_kind dcl_kind,
17506 {
17516 {
17517 /* Peek at the next token. */
17520 {
17521 /* This is either a parameter-declaration-clause, or a
17522 parenthesized declarator. When we know we are parsing a
17523 named declarator, it must be a parenthesized declarator
17524 if FIRST is true. For instance, `(int)' is a
17525 parameter-declaration-clause, with an omitted
17526 direct-abstract-declarator. But `((*))', is a
17527 parenthesized abstract declarator. Finally, when T is a
17528 template parameter `(T)' is a
17529 parameter-declaration-clause, and not a parenthesized
17530 named declarator.
17532 We first try and parse a parameter-declaration-clause,
17533 and then try a nested declarator (if FIRST is true).
17535 It is not an error for it not to be a
17536 parameter-declaration-clause, even when FIRST is
17537 false. Consider,
17539 int i (int);
17540 int i (3);
17542 The first is the declaration of a function while the
17543 second is the definition of a variable, including its
17544 initializer.
17546 Having seen only the parenthesis, we cannot know which of
17547 these two alternatives should be selected. Even more
17548 complex are examples like:
17550 int i (int (a));
17551 int i (int (3));
17553 The former is a function-declaration; the latter is a
17554 variable initialization.
17556 Thus again, we try a parameter-declaration-clause, and if
17557 that fails, we back out and return. */
17560 {
17561 tree params;
17564 /* In a member-declarator, the only valid interpretation
17565 of a parenthesis is the start of a
17566 parameter-declaration-clause. (It is invalid to
17567 initialize a static data member with a parenthesized
17568 initializer; only the "=" form of initialization is
17569 permitted.) */
17573 /* Consume the `('. */
17576 {
17577 /* If this is going to be an abstract declarator, we're
17578 in a declarator and we can't have default args. */
17581 }
17585 /* Parse the parameter-declaration-clause. */
17588 /* Consume the `)'. */
17591 /* If all went well, parse the cv-qualifier-seq,
17592 ref-qualifier and the exception-specification. */
17594 {
17595 cp_cv_quals cv_quals;
17596 cp_virt_specifiers virt_specifiers;
17597 cp_ref_qualifier ref_qual;
17598 tree exception_specification;
17599 tree late_return;
17600 tree attrs;
17610 /* Parse the cv-qualifier-seq. */
17612 /* Parse the ref-qualifier. */
17614 /* And the exception-specification. */
17615 exception_specification
17620 /* In here, we handle cases where attribute is used after
17621 the function declaration. For example:
17622 void func (int x) __attribute__((vector(..))); */
17625 {
17629 CPP_SEMICOLON)
17631 CPP_OPEN_BRACE))
17634 ;
17635 else
17637 }
17638 late_return = (cp_parser_late_return_type_opt
17643 /* Parse the virt-specifier-seq. */
17646 /* Create the function-declarator. */
17648 params,
17649 cv_quals,
17650 virt_specifiers,
17651 ref_qual,
17652 exception_specification,
17653 late_return);
17655 /* Any subsequent parameter lists are to do with
17656 return type, so are not those of the declared
17657 function. */
17659 }
17661 /* Remove the function parms from scope. */
17665 /* Repeat the main loop. */
17667 }
17669 /* If this is the first, we can try a parenthesized
17670 declarator. */
17672 {
17678 /* Consume the `('. */
17680 /* Parse the nested declarator. */
17683 declarator
17689 /* Expect a `)'. */
17696 }
17697 /* Otherwise, we must be done. */
17698 else
17700 }
17704 {
17705 /* Parse an array-declarator. */
17714 /* Consume the `['. */
17716 /* Peek at the next token. */
17718 /* If the next token is `]', then there is no
17719 constant-expression. */
17721 {
17723 bounds
17733 {
17734 /* Normally, the array bound must be an integral constant
17735 expression. However, as an extension, we allow VLAs
17736 in function scopes as long as they aren't part of a
17737 parameter declaration. */
17741 }
17744 {
17745 /* Remember this wasn't a constant-expression. */
17748 }
17749 }
17750 else
17752 /* Look for the closing `]'. */
17754 {
17757 }
17762 }
17764 {
17765 {
17766 tree qualifying_scope;
17767 tree unqualified_name;
17768 tree attrs;
17769 special_function_kind sfk;
17774 /* Parse a declarator-id */
17777 {
17780 /* If we see an ellipsis, we should be looking at a
17781 parameter pack. */
17783 {
17784 /* Consume the `...' */
17788 }
17789 }
17792 unqualified_name
17796 {
17800 {
17801 /* Check whether an error occurred. */
17804 /* We already consumed the ellipsis to mark a
17805 parameter pack, but we have no way to report it,
17806 so abort the tentative parse. We will be exiting
17807 immediately anyway. */
17809 }
17810 else
17816 && (qualifying_scope
17818 {
17821 }
17822 }
17827 {
17832 }
17838 {
17839 /* In the declaration of a member of a template class
17840 outside of the class itself, the SCOPE will sometimes
17841 be a TYPENAME_TYPE. For example, given:
17843 template <typename T>
17844 int S<T>::R::i = 3;
17846 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17847 this context, we must resolve S<T>::R to an ordinary
17848 type, rather than a typename type.
17850 The reason we normally avoid resolving TYPENAME_TYPEs
17851 is that a specialization of `S' might render
17852 `S<T>::R' not a type. However, if `S' is
17853 specialized, then this `i' will not be used, so there
17854 is no harm in resolving the types here. */
17855 tree type;
17857 /* Resolve the TYPENAME_TYPE. */
17860 /* If that failed, the declarator is invalid. */
17862 {
17865 "cannot define member of dependent typedef "
17867 else
17872 }
17874 }
17879 {
17880 tree class_type;
17885 else
17889 {
17892 {
17895 {
17899 "use %<%T::%D%> instead of %<%T::%D%> to "
17901 class_type,
17906 }
17907 else
17909 }
17910 else
17911 {
17912 /* We do not attempt to print the declarator
17913 here because we do not have enough
17914 information about its original syntactic
17915 form. */
17919 }
17920 }
17923 {
17929 for an anonymous type, even if the type
17930 got a name for linkage purposes. */
17932 /* Handle correctly (c++/19200):
17934 struct S {
17935 struct T{};
17936 friend void S(T);
17937 };
17939 and also:
17941 namespace N {
17942 void S();
17943 }
17945 struct S {
17946 friend void N::S();
17947 }; */
17948 && !(friend_p
17951 class_type))
17952 {
17955 }
17963 }
17964 }
17966 unqualified_name,
17967 sfk);
17974 }
17976 handle_declarator:;
17979 {
17980 /* Any names that appear after the declarator-id for a
17981 member are looked up in the containing scope. */
17983 {
17984 /* But declarations with qualified-ids can't appear in a
17985 function. */
17989 }
17991 }
17995 /* Default args are only allowed on function
17996 declarations. */
17998 else
18002 }
18003 /* We're done. */
18004 else
18006 }
18008 /* For an abstract declarator, we might wind up with nothing at this
18009 point. That's an error; the declarator is not optional. */
18013 /* If we entered a scope, we must exit it now. */
18021 }
18023 /* Parse a ptr-operator.
18025 ptr-operator:
18026 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18027 * cv-qualifier-seq [opt]
18028 &
18029 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
18030 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18032 GNU Extension:
18034 ptr-operator:
18035 & cv-qualifier-seq [opt]
18037 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
18038 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
18039 an rvalue reference. In the case of a pointer-to-member, *TYPE is
18040 filled in with the TYPE containing the member. *CV_QUALS is
18041 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
18042 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
18043 Note that the tree codes returned by this function have nothing
18044 to do with the types of trees that will be eventually be created
18045 to represent the pointer or reference type being parsed. They are
18046 just constants with suggestive names. */
18047 static enum tree_code
18052 {
18057 /* Assume that it's not a pointer-to-member. */
18059 /* And that there are no cv-qualifiers. */
18062 /* Peek at the next token. */
18065 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18075 {
18076 /* Consume the `*', `&' or `&&'. */
18079 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18080 `&', if we are allowing GNU extensions. (The only qualifier
18081 that can legally appear after `&' is `restrict', but that is
18082 enforced during semantic analysis. */
18090 }
18091 else
18092 {
18093 /* Try the pointer-to-member case. */
18095 /* Look for the optional `::' operator. */
18098 /* Look for the nested-name specifier. */
18105 /* If we found it, and the next token is a `*', then we are
18106 indeed looking at a pointer-to-member operator. */
18109 {
18110 /* Indicate that the `*' operator was used. */
18118 else
18119 {
18120 /* The type of which the member is a member is given by the
18121 current SCOPE. */
18123 /* The next name will not be qualified. */
18127 /* Look for optional c++11 attributes. */
18131 /* Look for the optional cv-qualifier-seq. */
18133 }
18134 }
18135 /* If that didn't work we don't have a ptr-operator. */
18138 }
18141 }
18143 /* Parse an (optional) cv-qualifier-seq.
18145 cv-qualifier-seq:
18146 cv-qualifier cv-qualifier-seq [opt]
18148 cv-qualifier:
18149 const
18150 volatile
18152 GNU Extension:
18154 cv-qualifier:
18155 __restrict__
18157 Returns a bitmask representing the cv-qualifiers. */
18159 static cp_cv_quals
18161 {
18165 {
18167 cp_cv_quals cv_qualifier;
18169 /* Peek at the next token. */
18171 /* See if it's a cv-qualifier. */
18173 {
18189 }
18195 {
18198 }
18199 else
18200 {
18203 }
18204 }
18207 }
18209 /* Parse an (optional) ref-qualifier
18211 ref-qualifier:
18212 &
18213 &&
18215 Returns cp_ref_qualifier representing ref-qualifier. */
18217 static cp_ref_qualifier
18219 {
18222 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18227 {
18232 {
18244 }
18249 {
18252 }
18253 else
18254 {
18257 }
18258 }
18261 }
18263 /* Parse an (optional) virt-specifier-seq.
18265 virt-specifier-seq:
18266 virt-specifier virt-specifier-seq [opt]
18268 virt-specifier:
18269 override
18270 final
18272 Returns a bitmask representing the virt-specifiers. */
18274 static cp_virt_specifiers
18276 {
18280 {
18282 cp_virt_specifiers virt_specifier;
18284 /* Peek at the next token. */
18286 /* See if it's a virt-specifier-qualifier. */
18290 {
18293 }
18295 {
18298 }
18300 {
18302 }
18303 else
18307 {
18310 }
18311 else
18312 {
18315 }
18316 }
18318 }
18320 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18321 is in scope even though it isn't real. */
18323 void
18325 {
18326 tree this_parm;
18329 {
18330 /* We don't clear this between NSDMIs. Is it already what we want? */
18335 }
18338 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18340 current_class_ref
18343 }
18345 /* Return true iff our current scope is a non-static data member
18346 initializer. */
18348 bool
18350 {
18351 /* We recognize NSDMI context by the context-less 'this' pointer set up
18352 by the function above. */
18358 }
18360 /* Parse a late-specified return type, if any. This is not a separate
18361 non-terminal, but part of a function declarator, which looks like
18363 -> trailing-type-specifier-seq abstract-declarator(opt)
18365 Returns the type indicated by the type-id.
18367 In addition to this, parse any queued up omp declare simd
18368 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18370 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18371 function. */
18373 static tree
18375 cp_cv_quals quals)
18376 {
18380 && declarator
18386 /* Peek at the next token. */
18388 /* A late-specified return type is indicated by an initial '->'. */
18395 {
18396 /* DR 1207: 'this' is in scope in the trailing return type. */
18398 }
18401 {
18402 /* Consume the ->. */
18406 }
18409 declarator->std_attributes
18413 declarator->std_attributes
18418 {
18421 }
18424 }
18426 /* Parse a declarator-id.
18428 declarator-id:
18429 id-expression
18430 :: [opt] nested-name-specifier [opt] type-name
18432 In the `id-expression' case, the value returned is as for
18433 cp_parser_id_expression if the id-expression was an unqualified-id.
18434 If the id-expression was a qualified-id, then a SCOPE_REF is
18435 returned. The first operand is the scope (either a NAMESPACE_DECL
18436 or TREE_TYPE), but the second is still just a representation of an
18437 unqualified-id. */
18439 static tree
18441 {
18442 tree id;
18443 /* The expression must be an id-expression. Assume that qualified
18444 names are the names of types so that:
18446 template <class T>
18447 int S<T>::R::i = 3;
18449 will work; we must treat `S<T>::R' as the name of a type.
18450 Similarly, assume that qualified names are templates, where
18451 required, so that:
18453 template <class T>
18454 int S<T>::R<T>::i = 3;
18456 will work, too. */
18462 optional_p);
18466 }
18468 /* Parse a type-id.
18470 type-id:
18471 type-specifier-seq abstract-declarator [opt]
18473 Returns the TYPE specified. */
18475 static tree
18478 {
18479 cp_decl_specifier_seq type_specifier_seq;
18482 /* Parse the type-specifier-seq. */
18484 is_trailing_return,
18489 /* There might or might not be an abstract declarator. */
18491 /* Look for the declarator. */
18492 abstract_declarator
18497 /* Check to see if there really was a declarator. */
18502 /* None of the valid uses of 'auto' in C++14 involve the type-id
18503 nonterminal, but it is valid in a trailing-return-type. */
18506 {
18507 /* A type-id with type 'auto' is only ok if the abstract declarator
18508 is a function declarator with a late-specified return type. */
18513 else
18514 {
18517 }
18518 }
18521 is_template_arg);
18522 }
18525 {
18527 }
18530 {
18531 tree r;
18533 parser->type_definition_forbidden_message
18538 {
18541 }
18543 }
18546 {
18548 }
18550 /* Parse a type-specifier-seq.
18552 type-specifier-seq:
18553 type-specifier type-specifier-seq [opt]
18555 GNU extension:
18557 type-specifier-seq:
18558 attributes type-specifier-seq [opt]
18560 If IS_DECLARATION is true, we are at the start of a "condition" or
18561 exception-declaration, so we might be followed by a declarator-id.
18563 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18564 i.e. we've just seen "->".
18566 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18568 static void
18573 {
18578 /* Clear the TYPE_SPECIFIER_SEQ. */
18581 /* In the context of a trailing return type, enum E { } is an
18582 elaborated-type-specifier followed by a function-body, not an
18583 enum-specifier. */
18587 /* Parse the type-specifiers and attributes. */
18589 {
18590 tree type_specifier;
18593 /* Check for attributes first. */
18595 {
18600 }
18602 /* record the token of the beginning of the type specifier seq,
18603 for error reporting purposes*/
18607 /* Look for the type-specifier. */
18609 flags,
18610 type_specifier_seq,
18612 NULL,
18615 {
18616 /* If the first type-specifier could not be found, this is not a
18617 type-specifier-seq at all. */
18619 {
18620 /* Set in_declarator_p to avoid skipping to the semicolon. */
18632 }
18633 /* If subsequent type-specifiers could not be found, the
18634 type-specifier-seq is complete. */
18636 }
18639 /* The standard says that a condition can be:
18641 type-specifier-seq declarator = assignment-expression
18643 However, given:
18645 struct S {};
18646 if (int S = ...)
18648 we should treat the "S" as a declarator, not as a
18649 type-specifier. The standard doesn't say that explicitly for
18650 type-specifier-seq, but it does say that for
18651 decl-specifier-seq in an ordinary declaration. Perhaps it
18652 would be clearer just to allow a decl-specifier-seq here, and
18653 then add a semantic restriction that if any decl-specifiers
18654 that are not type-specifiers appear, the program is invalid. */
18657 }
18658 }
18660 /* Return whether the function currently being declared has an associated
18661 template parameter list. */
18663 static bool
18665 {
18678 }
18680 /* Parse a parameter-declaration-clause.
18682 parameter-declaration-clause:
18683 parameter-declaration-list [opt] ... [opt]
18684 parameter-declaration-list , ...
18686 Returns a representation for the parameter declarations. A return
18687 value of NULL indicates a parameter-declaration-clause consisting
18688 only of an ellipsis. */
18690 static tree
18692 {
18693 tree parameters;
18702 parser->auto_is_implicit_function_template_parm_p
18704 }
18710 && !processing_template_parmlist
18716 /* Peek at the next token. */
18718 /* Check for trivial parameter-declaration-clauses. */
18720 {
18721 /* Consume the `...' token. */
18724 }
18726 /* There are no parameters. */
18727 {
18728 #ifndef NO_IMPLICIT_EXTERN_C
18733 else
18734 #endif
18736 }
18737 /* Check for `(void)', too, which is a special case. */
18741 {
18742 /* Consume the `void' token. */
18744 /* There are no parameters. */
18746 }
18748 /* Parse the parameter-declaration-list. */
18750 /* If a parse error occurred while parsing the
18751 parameter-declaration-list, then the entire
18752 parameter-declaration-clause is erroneous. */
18756 /* Peek at the next token. */
18758 /* If it's a `,', the clause should terminate with an ellipsis. */
18760 {
18761 /* Consume the `,'. */
18763 /* Expect an ellipsis. */
18764 ellipsis_p
18766 }
18767 /* It might also be `...' if the optional trailing `,' was
18768 omitted. */
18770 {
18771 /* Consume the `...' token. */
18773 /* And remember that we saw it. */
18775 }
18776 else
18779 /* Finish the parameter list. */
18784 }
18786 /* Parse a parameter-declaration-list.
18788 parameter-declaration-list:
18789 parameter-declaration
18790 parameter-declaration-list , parameter-declaration
18792 Returns a representation of the parameter-declaration-list, as for
18793 cp_parser_parameter_declaration_clause. However, the
18794 `void_list_node' is never appended to the list. Upon return,
18795 *IS_ERROR will be true iff an error occurred. */
18797 static tree
18799 {
18805 /* Assume all will go well. */
18807 /* The special considerations that apply to a function within an
18808 unbraced linkage specifications do not apply to the parameters
18809 to the function. */
18810 saved_in_unbraced_linkage_specification_p
18814 /* Look for more parameters. */
18816 {
18824 /* Parse the parameter. */
18825 parameter
18830 /* We don't know yet if the enclosing context is deprecated, so wait
18831 and warn in grokparms if appropriate. */
18835 {
18836 /* If a function parameter pack was specified and an implicit template
18837 parameter was introduced during cp_parser_parameter_declaration,
18838 change any implicit parameters introduced into packs. */
18842 {
18850 }
18854 PARM,
18857 }
18861 /* If a parse error occurred parsing the parameter declaration,
18862 then the entire parameter-declaration-list is erroneous. */
18864 {
18868 }
18878 {
18882 }
18884 /* Add the new parameter to the list. */
18888 /* Peek at the next token. */
18891 /* These are for Objective-C++ */
18894 /* The parameter-declaration-list is complete. */
18897 {
18900 /* Peek at the next token. */
18902 /* If it's an ellipsis, then the list is complete. */
18905 /* Otherwise, there must be more parameters. Consume the
18906 `,'. */
18908 /* When parsing something like:
18910 int i(float f, double d)
18912 we can tell after seeing the declaration for "f" that we
18913 are not looking at an initialization of a variable "i",
18914 but rather at the declaration of a function "i".
18916 Due to the fact that the parsing of template arguments
18917 (as specified to a template-id) requires backtracking we
18918 cannot use this technique when inside a template argument
18919 list. */
18923 /* However, a parameter-declaration of the form
18924 "float(f)" (which is a valid declaration of a
18925 parameter "f") can also be interpreted as an
18926 expression (the conversion of "f" to "float"). */
18929 }
18930 else
18931 {
18939 }
18940 }
18942 parser->in_unbraced_linkage_specification_p
18945 /* Reset implicit_template_scope if we are about to leave the function
18946 parameter list that introduced it. Note that for out-of-line member
18947 definitions, there will be one or more class scopes before we get to
18948 the template parameter scope. */
18952 {
18956 {
18959 }
18960 }
18963 }
18965 /* Parse a parameter declaration.
18967 parameter-declaration:
18968 decl-specifier-seq ... [opt] declarator
18969 decl-specifier-seq declarator = assignment-expression
18970 decl-specifier-seq ... [opt] abstract-declarator [opt]
18971 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18973 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18974 declares a template parameter. (In that case, a non-nested `>'
18975 token encountered during the parsing of the assignment-expression
18976 is not interpreted as a greater-than operator.)
18978 Returns a representation of the parameter, or NULL if an error
18979 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18980 true iff the declarator is of the form "(p)". */
18986 {
18988 cp_decl_specifier_seq decl_specifiers;
18990 tree default_argument;
18995 /* In a template parameter, `>' is not an operator.
18997 [temp.param]
18999 When parsing a default template-argument for a non-type
19000 template-parameter, the first non-nested `>' is taken as the end
19001 of the template parameter-list rather than a greater-than
19002 operator. */
19004 /* Type definitions may not appear in parameter types. */
19006 parser->type_definition_forbidden_message
19009 /* Parse the declaration-specifiers. */
19011 CP_PARSER_FLAGS_NONE,
19015 /* Complain about missing 'typename' or other invalid type names. */
19020 /* If an error occurred, there's no reason to attempt to parse the
19021 rest of the declaration. */
19023 {
19026 }
19028 /* Peek at the next token. */
19031 /* If the next token is a `)', `,', `=', `>', or `...', then there
19032 is no declarator. However, when variadic templates are enabled,
19033 there may be a declarator following `...'. */
19038 {
19042 }
19043 /* Otherwise, there should be a declarator. */
19044 else
19045 {
19049 /* After seeing a decl-specifier-seq, if the next token is not a
19050 "(", there is no possibility that the code is a valid
19051 expression. Therefore, if parsing tentatively, we commit at
19052 this point. */
19054 /* In an expression context, having seen:
19056 (int((char ...
19058 we cannot be sure whether we are looking at a
19059 function-type (taking a "char" as a parameter) or a cast
19060 of some object of type "char" to "int". */
19066 /* Parse the declarator. */
19069 CP_PARSER_DECLARATOR_EITHER,
19071 parenthesized_p,
19075 /* After the declarator, allow more attributes. */
19076 decl_specifiers.attributes
19080 /* If the declarator is a template parameter pack, remember that and
19081 clear the flag in the declarator itself so we don't get errors
19082 from grokdeclarator. */
19084 {
19087 }
19088 }
19090 /* If the next token is an ellipsis, and we have not seen a
19091 declarator name, and the type of the declarator contains parameter
19092 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
19093 a parameter pack expansion expression. Otherwise, leave the
19094 ellipsis for a C-style variadic function. */
19097 {
19107 {
19108 /* Consume the `...'. */
19112 /* Build a pack expansion type */
19117 else
19119 }
19120 }
19122 /* The restriction on defining new types applies only to the type
19123 of the parameter, not to the default argument. */
19126 /* If the next token is `=', then process a default argument. */
19128 {
19130 /* If we are defining a class, then the tokens that make up the
19131 default argument must be saved and processed later. */
19136 /* Outside of a class definition, we can just parse the
19137 assignment-expression. */
19138 else
19139 default_argument
19143 {
19145 "default arguments are only "
19147 }
19149 || template_parameter_pack_p
19152 {
19153 /* Find the name of the parameter pack. */
19160 template_parm_p
19166 else
19168 template_parm_p
19175 }
19176 }
19177 else
19181 declarator,
19182 default_argument,
19183 template_parameter_pack_p);
19184 }
19186 /* Parse a default argument and return it.
19188 TEMPLATE_PARM_P is true if this is a default argument for a
19189 non-type template parameter. */
19190 static tree
19192 {
19198 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19199 set correctly. */
19202 /* Local variable names (and the `this' keyword) may not
19203 appear in a default argument. */
19206 /* Parse the assignment-expression. */
19211 /* The "this" pointer is not valid in a default argument. */
19213 {
19218 }
19219 default_argument
19221 /* Restore the "this" pointer. */
19223 {
19226 }
19235 }
19237 /* Parse a function-body.
19239 function-body:
19240 compound_statement */
19242 static void
19244 {
19246 }
19248 /* Parse a ctor-initializer-opt followed by a function-body. Return
19249 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19250 is true we are parsing a function-try-block. */
19252 static bool
19255 {
19263 /* Begin the function body. */
19265 /* Parse the optional ctor-initializer. */
19268 /* If we're parsing a constexpr constructor definition, we need
19269 to check that the constructor body is indeed empty. However,
19270 before we get to cp_parser_function_body lot of junk has been
19271 generated, so we can't just check that we have an empty block.
19272 Rather we take a snapshot of the outermost block, and check whether
19273 cp_parser_function_body changed its state. */
19275 {
19279 }
19280 /* Parse the function-body. */
19284 /* Finish the function body. */
19288 }
19290 /* Parse an initializer.
19292 initializer:
19293 = initializer-clause
19294 ( expression-list )
19296 Returns an expression representing the initializer. If no
19297 initializer is present, NULL_TREE is returned.
19299 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19300 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19301 set to TRUE if there is no initializer present. If there is an
19302 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19303 is set to true; otherwise it is set to false. */
19305 static tree
19308 {
19310 tree init;
19312 /* Peek at the next token. */
19315 /* Let our caller know whether or not this initializer was
19316 parenthesized. */
19318 /* Assume that the initializer is constant. */
19322 {
19323 /* Consume the `='. */
19325 /* Parse the initializer-clause. */
19327 }
19329 {
19334 non_constant_p);
19339 }
19341 {
19346 }
19347 else
19348 {
19349 /* Anything else is an error. */
19352 }
19355 }
19357 /* Parse an initializer-clause.
19359 initializer-clause:
19360 assignment-expression
19361 braced-init-list
19363 Returns an expression representing the initializer.
19365 If the `assignment-expression' production is used the value
19366 returned is simply a representation for the expression.
19368 Otherwise, calls cp_parser_braced_list. */
19370 static tree
19372 {
19373 tree initializer;
19375 /* Assume the expression is constant. */
19378 /* If it is not a `{', then we are looking at an
19379 assignment-expression. */
19381 {
19382 initializer
19385 non_constant_p);
19386 }
19387 else
19391 }
19393 /* Parse a brace-enclosed initializer list.
19395 braced-init-list:
19396 { initializer-list , [opt] }
19397 { }
19399 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19400 the elements of the initializer-list (or NULL, if the last
19401 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19402 NULL_TREE. There is no way to detect whether or not the optional
19403 trailing `,' was provided. NON_CONSTANT_P is as for
19404 cp_parser_initializer. */
19406 static tree
19408 {
19409 tree initializer;
19411 /* Consume the `{' token. */
19413 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19415 /* If it's not a `}', then there is a non-trivial initializer. */
19417 {
19418 /* Parse the initializer list. */
19421 /* A trailing `,' token is allowed. */
19424 }
19425 else
19427 /* Now, there should be a trailing `}'. */
19431 }
19433 /* Consume tokens up to, and including, the next non-nested closing `]'.
19434 Returns true iff we found a closing `]'. */
19436 static bool
19438 {
19442 {
19446 {
19449 /* If we've run out of tokens, then there is no closing `]'. */
19458 {
19461 }
19466 }
19468 /* Consume the token. */
19470 }
19471 }
19473 /* Return true if we are looking at an array-designator, false otherwise. */
19475 static bool
19477 {
19478 /* Consume the `['. */
19483 /* Skip tokens until the next token is a closing square bracket.
19484 If we find the closing `]', and the next token is a `=', then
19485 we are looking at an array designator. */
19486 bool array_designator_p
19490 /* Roll back the tokens we skipped. */
19494 }
19496 /* Parse an initializer-list.
19498 initializer-list:
19499 initializer-clause ... [opt]
19500 initializer-list , initializer-clause ... [opt]
19502 GNU Extension:
19504 initializer-list:
19505 designation initializer-clause ...[opt]
19506 initializer-list , designation initializer-clause ...[opt]
19508 designation:
19509 . identifier =
19510 identifier :
19511 [ constant-expression ] =
19513 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19514 for the initializer. If the INDEX of the elt is non-NULL, it is the
19515 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19516 as for cp_parser_initializer. */
19520 {
19523 /* Assume all of the expressions are constant. */
19526 /* Parse the rest of the list. */
19528 {
19530 tree designator;
19531 tree initializer;
19534 /* If the next token is an identifier and the following one is a
19535 colon, we are looking at the GNU designated-initializer
19536 syntax. */
19540 {
19541 /* Warn the user that they are using an extension. */
19544 /* Consume the identifier. */
19546 /* Consume the `:'. */
19548 }
19549 /* Also handle the C99 syntax, '. id ='. */
19554 {
19555 /* Warn the user that they are using an extension. */
19558 /* Consume the `.'. */
19560 /* Consume the identifier. */
19562 /* Consume the `='. */
19564 }
19565 /* Also handle C99 array designators, '[ const ] ='. */
19569 {
19570 /* In C++11, [ could start a lambda-introducer. */
19576 {
19579 }
19580 else
19581 {
19586 }
19592 }
19593 else
19596 /* Parse the initializer. */
19599 /* If any clause is non-constant, so is the entire initializer. */
19603 /* If we have an ellipsis, this is an initializer pack
19604 expansion. */
19606 {
19607 /* Consume the `...'. */
19610 /* Turn the initializer into an initializer expansion. */
19612 }
19614 /* Add it to the vector. */
19617 /* If the next token is not a comma, we have reached the end of
19618 the list. */
19622 /* Peek at the next token. */
19624 /* If the next token is a `}', then we're still done. An
19625 initializer-clause can have a trailing `,' after the
19626 initializer-list and before the closing `}'. */
19630 /* Consume the `,' token. */
19632 }
19635 }
19637 /* Classes [gram.class] */
19639 /* Parse a class-name.
19641 class-name:
19642 identifier
19643 template-id
19645 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19646 to indicate that names looked up in dependent types should be
19647 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19648 keyword has been used to indicate that the name that appears next
19649 is a template. TAG_TYPE indicates the explicit tag given before
19650 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19651 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19652 is the class being defined in a class-head. If ENUM_OK is TRUE,
19653 enum-names are also accepted.
19655 Returns the TYPE_DECL representing the class. */
19657 static tree
19666 {
19667 tree decl;
19668 tree scope;
19673 /* All class-names start with an identifier. */
19676 {
19679 }
19681 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19682 to a template-id, so we save it here. */
19687 /* Any name names a type if we're following the `typename' keyword
19688 in a qualified name where the enclosing scope is type-dependent. */
19691 /* Handle the common case (an identifier, but not a template-id)
19692 efficiently. */
19695 {
19699 /* Look for the identifier. */
19703 /* If the next token isn't an identifier, we are certainly not
19704 looking at a class-name. */
19707 /* If we know this is a type-name, there's no need to look it
19708 up. */
19711 else
19712 {
19713 tree ambiguous_decls;
19714 /* If we already know that this lookup is ambiguous, then
19715 we've already issued an error message; there's no reason
19716 to check again. */
19718 {
19721 }
19722 /* If the next token is a `::', then the name must be a type
19723 name.
19725 [basic.lookup.qual]
19727 During the lookup for a name preceding the :: scope
19728 resolution operator, object, function, and enumerator
19729 names are ignored. */
19732 /* Look up the name. */
19734 tag_type,
19737 check_dependency_p,
19741 {
19745 }
19746 }
19747 }
19748 else
19749 {
19750 /* Try a template-id. */
19752 check_dependency_p,
19753 tag_type,
19754 is_declaration);
19757 }
19761 /* If this is a typename, create a TYPENAME_TYPE. */
19763 {
19768 }
19772 /* Check to see that it is really the name of a class. */
19776 /* Situations like this:
19778 template <typename T> struct A {
19779 typename T::template X<int>::I i;
19780 };
19782 are problematic. Is `T::template X<int>' a class-name? The
19783 standard does not seem to be definitive, but there is no other
19784 valid interpretation of the following `::'. Therefore, those
19785 names are considered class-names. */
19786 {
19790 }
19795 /* In Objective-C 2.0, a classname followed by '.' starts a
19796 dot-syntax expression, and it's not a type-name. */
19808 }
19810 /* Parse a class-specifier.
19812 class-specifier:
19813 class-head { member-specification [opt] }
19815 Returns the TREE_TYPE representing the class. */
19817 static tree
19819 {
19820 tree type;
19834 /* Parse the class-head. */
19837 /* If the class-head was a semantic disaster, skip the entire body
19838 of the class. */
19840 {
19844 }
19846 /* Look for the `{'. */
19848 {
19851 }
19855 /* Issue an error message if type-definitions are forbidden here. */
19857 /* Remember that we are defining one more class. */
19859 /* Inside the class, surrounding template-parameter-lists do not
19860 apply. */
19861 saved_num_template_parameter_lists
19864 /* We are not in a function body. */
19867 /* Or in a loop. */
19870 /* Or in a switch. */
19873 /* We are not immediately inside an extern "lang" block. */
19874 saved_in_unbraced_linkage_specification_p
19878 /* Start the class. */
19880 {
19883 }
19887 /* If the type is erroneous, skip the entire body of the class. */
19889 else
19890 /* Parse the member-specification. */
19893 /* Look for the trailing `}'. */
19895 /* Look for trailing attributes to apply to this class. */
19903 /* We've finished a type definition. Check for the common syntax
19904 error of forgetting a semicolon after the definition. We need to
19905 be careful, as we can't just check for not-a-semicolon and be done
19906 with it; the user might have typed:
19908 class X { } c = ...;
19909 class X { } *p = ...;
19911 and so forth. Instead, enumerate all the possible tokens that
19912 might follow this production; if we don't see one of them, then
19913 complain and silently insert the semicolon. */
19914 {
19919 /* Don't try to parse c++11 attributes here. As per the
19920 grammar, that should be a task for
19921 cp_parser_decl_specifier_seq. */
19925 {
19936 /* While it's legal for type qualifiers and storage class
19937 specifiers to follow type definitions in the grammar, only
19938 compiler testsuites contain code like that. Assume that if
19939 we see such code, then what we're really seeing is a case
19940 like:
19942 class X { }
19943 const <type> var = ...;
19945 or
19947 class Y { }
19948 static <type> func (...) ...
19950 i.e. the qualifier or specifier applies to the next
19951 declaration. To do so, however, we need to look ahead one
19952 more token to see if *that* token is a type specifier.
19954 This code could be improved to handle:
19956 class Z { }
19957 static const <type> var = ...; */
19960 {
19963 /* Handling user-defined types here would be nice, but very
19964 tricky. */
19965 want_semicolon
19968 }
19972 }
19974 /* If we don't have a type, then something is very wrong and we
19975 shouldn't try to do anything clever. Likewise for not seeing the
19976 closing brace. */
19978 {
19979 cp_token_position prev
19990 else
19993 /* Unget one token and smash it to look as though we encountered
19994 a semicolon in the input stream. */
19999 }
20000 }
20002 /* If this class is not itself within the scope of another class,
20003 then we need to parse the bodies of all of the queued function
20004 definitions. Note that the queued functions defined in a class
20005 are not always processed immediately following the
20006 class-specifier for that class. Consider:
20008 struct A {
20009 struct B { void f() { sizeof (A); } };
20010 };
20012 If `f' were processed before the processing of `A' were
20013 completed, there would be no way to compute the size of `A'.
20014 Note that the nesting we are interested in here is lexical --
20015 not the semantic nesting given by TYPE_CONTEXT. In particular,
20016 for:
20018 struct A { struct B; };
20019 struct A::B { void f() { } };
20021 there is no need to delay the parsing of `A::B::f'. */
20023 {
20024 tree decl;
20031 /* In a first pass, parse default arguments to the functions.
20032 Then, in a second pass, parse the bodies of the functions.
20033 This two-phased approach handles cases like:
20035 struct S {
20036 void f() { g(); }
20037 void g(int i = 3);
20038 };
20040 */
20042 {
20044 /* If there are default arguments that have not yet been processed,
20045 take care of them now. */
20047 {
20052 }
20053 /* Make sure that any template parameters are in scope. */
20055 /* Parse the default argument expressions. */
20057 /* Remove any template parameters from the symbol table. */
20059 }
20061 /* Now parse any NSDMIs. */
20065 {
20067 {
20072 }
20075 }
20082 /* Now do some post-NSDMI bookkeeping. */
20088 /* Now parse the body of the functions. */
20090 {
20091 /* OpenMP UDRs need to be parsed before all other functions. */
20098 }
20099 else
20103 }
20104 else
20107 /* Put back any saved access checks. */
20110 /* Restore saved state. */
20114 parser->num_template_parameter_lists
20116 parser->in_unbraced_linkage_specification_p
20120 }
20122 static tree
20124 {
20125 tree ret;
20130 }
20132 /* Parse a class-head.
20134 class-head:
20135 class-key identifier [opt] base-clause [opt]
20136 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20137 class-key nested-name-specifier [opt] template-id
20138 base-clause [opt]
20140 class-virt-specifier:
20141 final
20143 GNU Extensions:
20144 class-key attributes identifier [opt] base-clause [opt]
20145 class-key attributes nested-name-specifier identifier base-clause [opt]
20146 class-key attributes nested-name-specifier [opt] template-id
20147 base-clause [opt]
20149 Upon return BASES is initialized to the list of base classes (or
20150 NULL, if there are none) in the same form returned by
20151 cp_parser_base_clause.
20153 Returns the TYPE of the indicated class. Sets
20154 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20155 involving a nested-name-specifier was used, and FALSE otherwise.
20157 Returns error_mark_node if this is not a class-head.
20159 Returns NULL_TREE if the class-head is syntactically valid, but
20160 semantically invalid in a way that means we should skip the entire
20161 body of the class. */
20163 static tree
20166 {
20167 tree nested_name_specifier;
20171 tree attributes;
20172 tree bases;
20182 /* Assume no nested-name-specifier will be present. */
20184 /* Assume no template parameter lists will be used in defining the
20185 type. */
20189 /* Look for the class-key. */
20194 /* Parse the attributes. */
20197 /* If the next token is `::', that is invalid -- but sometimes
20198 people do try to write:
20200 struct ::S {};
20202 Handle this gracefully by accepting the extra qualifier, and then
20203 issuing an error about it later if this really is a
20204 class-head. If it turns out just to be an elaborated type
20205 specifier, remain silent. */
20211 /* Determine the name of the class. Begin by looking for an
20212 optional nested-name-specifier. */
20214 nested_name_specifier
20220 /* If there was a nested-name-specifier, then there *must* be an
20221 identifier. */
20223 {
20225 /* Although the grammar says `identifier', it really means
20226 `class-name' or `template-name'. You are only allowed to
20227 define a class that has already been declared with this
20228 syntax.
20230 The proposed resolution for Core Issue 180 says that wherever
20231 you see `class T::X' you should treat `X' as a type-name.
20233 It is OK to define an inaccessible class; for example:
20235 class A { class B; };
20236 class A::B {};
20238 We do not know if we will see a class-name, or a
20239 template-name. We look for a class-name first, in case the
20240 class-name is a template-id; if we looked for the
20241 template-name first we would stop after the template-name. */
20246 class_type,
20250 /* If that didn't work, ignore the nested-name-specifier. */
20252 {
20258 }
20259 /* If we could not find a corresponding TYPE, treat this
20260 declaration like an unqualified declaration. */
20263 /* Otherwise, count the number of templates used in TYPE and its
20264 containing scopes. */
20265 else
20266 {
20267 tree scope;
20279 }
20280 }
20281 /* Otherwise, the identifier is optional. */
20282 else
20283 {
20284 /* We don't know whether what comes next is a template-id,
20285 an identifier, or nothing at all. */
20287 /* Check for a template-id. */
20292 class_key,
20294 /* If that didn't work, it could still be an identifier. */
20296 {
20298 {
20301 }
20302 else
20304 }
20305 else
20306 {
20309 }
20310 }
20315 {
20317 class_key,
20319 }
20322 /* If it's not a `:' or a `{' then we can't really be looking at a
20323 class-head, since a class-head only appears as part of a
20324 class-specifier. We have to detect this situation before calling
20325 xref_tag, since that has irreversible side-effects. */
20327 {
20331 }
20333 /* At this point, we're going ahead with the class-specifier, even
20334 if some other problem occurs. */
20337 {
20342 }
20343 /* Issue the error about the overly-qualified name now. */
20345 {
20350 }
20352 {
20357 }
20359 {
20360 tree scope;
20362 /* Reject typedef-names in class heads. */
20364 {
20367 type);
20370 }
20372 /* Figure out in what scope the declaration is being placed. */
20374 /* If that scope does not contain the scope in which the
20375 class was originally declared, the program is invalid. */
20377 {
20380 "declaration of %qD in namespace %qD which does not "
20383 else
20389 }
20390 /* [dcl.meaning]
20392 A declarator-id shall not be qualified except for the
20393 definition of a ... nested class outside of its class
20394 ... [or] the definition or explicit instantiation of a
20395 class member of a namespace outside of its namespace. */
20397 {
20402 }
20403 }
20404 /* An explicit-specialization must be preceded by "template <>". If
20405 it is not, try to recover gracefully. */
20409 {
20413 /* Take the same action that would have been taken by
20414 cp_parser_explicit_specialization. */
20417 }
20418 /* There must be no "return" statements between this point and the
20419 end of this function; set "type "to the correct return value and
20420 use "goto done;" to return. */
20421 /* Make sure that the right number of template parameters were
20422 present. */
20426 {
20427 /* If something went wrong, there is no point in even trying to
20428 process the class-definition. */
20431 }
20433 /* Look up the type. */
20435 {
20439 {
20443 }
20444 else
20445 {
20448 }
20451 }
20453 {
20454 tree class_type;
20456 /* Given:
20458 template <typename T> struct S { struct T };
20459 template <typename T> struct S<T>::T { };
20461 we will get a TYPENAME_TYPE when processing the definition of
20462 `S::T'. We need to resolve it to the actual type before we
20463 try to define it. */
20465 {
20470 else
20471 {
20474 }
20475 }
20479 {
20482 }
20485 /* Enter the scope indicated by the nested-name-specifier. */
20487 /* Get the canonical version of this type. */
20489 /* Call push_template_decl if it seems like we should be defining a
20490 template either from the template headers or the type we're
20491 defining, so that we diagnose both extra and missing headers. */
20495 {
20498 {
20501 }
20502 }
20506 }
20508 {
20509 /* If the class was unnamed, create a dummy name. */
20514 }
20516 /* Indicate whether this class was declared as a `class' or as a
20517 `struct'. */
20522 /* If this type was already complete, and we see another definition,
20523 that's an error. */
20525 {
20527 type);
20529 type);
20532 }
20537 {
20538 /* Apply attributes now, before any use of the class as a template
20539 argument in its base list. */
20542 }
20544 /* We will have entered the scope containing the class; the names of
20545 base classes should be looked up in that context. For example:
20547 struct A { struct B {}; struct C; };
20548 struct A::C : B {};
20550 is valid. */
20552 /* Get the list of base-classes, if there is one. */
20554 {
20555 /* PR59482: enter the class scope so that base-specifiers are looked
20556 up correctly. */
20560 /* PR59482: get out of the previously pushed class scope so that the
20561 subsequent pops pop the right thing. */
20564 }
20565 else
20568 /* If we're really defining a class, process the base classes.
20569 If they're invalid, fail. */
20574 done:
20575 /* Leave the scope given by the nested-name-specifier. We will
20576 enter the class scope itself while processing the members. */
20581 {
20584 }
20590 out:
20593 }
20595 /* Parse a class-key.
20597 class-key:
20598 class
20599 struct
20600 union
20602 Returns the kind of class-key specified, or none_type to indicate
20603 error. */
20605 static enum tag_types
20607 {
20611 /* Look for the class-key. */
20616 /* Check to see if the TOKEN is a class-key. */
20621 }
20623 /* Parse a type-parameter-key.
20625 type-parameter-key:
20626 class
20627 typename
20628 */
20630 static void
20632 {
20633 /* Look for the type-parameter-key. */
20637 {
20640 /* typename is not allowed in a template template parameter
20641 by the standard until C++1Z. */
20643 "ISO C++ forbids typename key in template template parameter;"
20645 }
20646 else
20650 }
20652 /* Parse an (optional) member-specification.
20654 member-specification:
20655 member-declaration member-specification [opt]
20656 access-specifier : member-specification [opt] */
20658 static void
20660 {
20662 {
20666 /* Peek at the next token. */
20668 /* If it's a `}', or EOF then we've seen all the members. */
20674 /* See if this token is a keyword. */
20677 {
20681 /* Consume the access-specifier. */
20683 /* Remember which access-specifier is active. */
20685 /* Look for the `:'. */
20690 /* Accept #pragmas at class scope. */
20692 {
20695 }
20697 /* Otherwise, the next construction must be a
20698 member-declaration. */
20700 }
20701 }
20702 }
20704 /* Parse a member-declaration.
20706 member-declaration:
20707 decl-specifier-seq [opt] member-declarator-list [opt] ;
20708 function-definition ; [opt]
20709 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20710 using-declaration
20711 template-declaration
20712 alias-declaration
20714 member-declarator-list:
20715 member-declarator
20716 member-declarator-list , member-declarator
20718 member-declarator:
20719 declarator pure-specifier [opt]
20720 declarator constant-initializer [opt]
20721 identifier [opt] : constant-expression
20723 GNU Extensions:
20725 member-declaration:
20726 __extension__ member-declaration
20728 member-declarator:
20729 declarator attributes [opt] pure-specifier [opt]
20730 declarator attributes [opt] constant-initializer [opt]
20731 identifier [opt] attributes [opt] : constant-expression
20733 C++0x Extensions:
20735 member-declaration:
20736 static_assert-declaration */
20738 static void
20740 {
20741 cp_decl_specifier_seq decl_specifiers;
20742 tree prefix_attributes;
20743 tree decl;
20752 /* Check for the `__extension__' keyword. */
20754 {
20755 /* Recurse. */
20757 /* Restore the old value of the PEDANTIC flag. */
20761 }
20763 /* Check for a template-declaration. */
20765 {
20766 /* An explicit specialization here is an error condition, and we
20767 expect the specialization handler to detect and report this. */
20771 else
20775 }
20777 /* Check for a using-declaration. */
20779 {
20781 {
20782 /* Parse the using-declaration. */
20786 }
20787 else
20788 {
20789 tree decl;
20793 /* Note that if we actually see the '=' token after the
20794 identifier, cp_parser_alias_declaration commits the
20795 tentative parse. In that case, we really expect an
20796 alias-declaration. Otherwise, we expect a using
20797 declaration. */
20798 alias_decl_expected =
20804 else
20808 }
20809 }
20811 /* Check for @defs. */
20813 {
20818 {
20823 }
20825 }
20827 /* If the next token is `static_assert' we have a static assertion. */
20829 {
20832 }
20839 /* Parse the decl-specifier-seq. */
20842 CP_PARSER_FLAGS_OPTIONAL,
20845 /* Check for an invalid type-name. */
20849 /* If there is no declarator, then the decl-specifier-seq should
20850 specify a type. */
20852 {
20853 /* If there was no decl-specifier-seq, and the next token is a
20854 `;', then we have something like:
20856 struct S { ; };
20858 [class.mem]
20860 Each member-declaration shall declare at least one member
20861 name of the class. */
20863 {
20867 }
20868 else
20869 {
20870 tree type;
20872 /* See if this declaration is a friend. */
20874 /* If there were decl-specifiers, check to see if there was
20875 a class-declaration. */
20878 /* Nested classes have already been added to the class, but
20879 a `friend' needs to be explicitly registered. */
20881 {
20882 /* If the `friend' keyword was present, the friend must
20883 be introduced with a class-key. */
20886 "in C++03 a class-key must be used "
20888 /* In this case:
20890 template <typename T> struct A {
20891 friend struct A<T>::B;
20892 };
20894 A<T>::B will be represented by a TYPENAME_TYPE, and
20895 therefore not recognized by check_tag_decl. */
20897 {
20901 }
20904 "friend declaration does not name a class or "
20906 else
20909 }
20910 /* If there is no TYPE, an error message will already have
20911 been issued. */
20913 ;
20914 /* An anonymous aggregate has to be handled specially; such
20915 a declaration really declares a data member (with a
20916 particular type), as opposed to a nested class. */
20918 {
20919 /* C++11 9.5/6. */
20922 "a storage class on an anonymous aggregate "
20925 /* Remove constructors and such from TYPE, now that we
20926 know it is an anonymous aggregate. */
20928 /* And make the corresponding data member. */
20931 /* Add it to the class. */
20933 }
20934 else
20935 cp_parser_check_access_in_redeclaration
20938 }
20939 }
20940 else
20941 {
20944 /* Clear attributes from the decl_specifiers but keep them
20945 around as prefix attributes that apply them to the entity
20946 being declared. */
20950 /* See if these declarations will be friends. */
20953 /* Keep going until we hit the `;' at the end of the
20954 declaration. */
20956 {
20958 tree first_attribute;
20960 /* Peek at the next token. */
20963 /* Check for a bitfield declaration. */
20968 {
20969 tree identifier;
20970 tree width;
20972 /* Get the name of the bitfield. Note that we cannot just
20973 check TOKEN here because it may have been invalidated by
20974 the call to cp_lexer_peek_nth_token above. */
20977 else
20980 /* Consume the `:' token. */
20982 /* Get the width of the bitfield. */
20983 width
20986 /* Look for attributes that apply to the bitfield. */
20988 /* Remember which attributes are prefix attributes and
20989 which are not. */
20991 /* Combine the attributes. */
20994 /* Create the bitfield declaration. */
20997 identifier,
20998 sfk_none)
21001 width,
21002 attributes);
21003 }
21004 else
21005 {
21007 tree initializer;
21008 tree asm_specification;
21011 /* Parse the declarator. */
21012 declarator
21017 friend_p);
21019 /* If something went wrong parsing the declarator, make sure
21020 that we at least consume some tokens. */
21022 {
21023 /* Skip to the end of the statement. */
21025 /* If the next token is not a semicolon, that is
21026 probably because we just skipped over the body of
21027 a function. So, we consume a semicolon if
21028 present, but do not issue an error message if it
21029 is not present. */
21031 CPP_SEMICOLON))
21034 }
21037 cp_parser_check_for_definition_in_return_type
21041 /* Look for an asm-specification. */
21043 /* Look for attributes that apply to the declaration. */
21045 /* Remember which attributes are prefix attributes and
21046 which are not. */
21048 /* Combine the attributes. */
21051 /* If it's an `=', then we have a constant-initializer or a
21052 pure-specifier. It is not correct to parse the
21053 initializer before registering the member declaration
21054 since the member declaration should be in scope while
21055 its initializer is processed. However, the rest of the
21056 front end does not yet provide an interface that allows
21057 us to handle this correctly. */
21059 {
21060 /* In [class.mem]:
21062 A pure-specifier shall be used only in the declaration of
21063 a virtual function.
21065 A member-declarator can contain a constant-initializer
21066 only if it declares a static member of integral or
21067 enumeration type.
21069 Therefore, if the DECLARATOR is for a function, we look
21070 for a pure-specifier; otherwise, we look for a
21071 constant-initializer. When we call `grokfield', it will
21072 perform more stringent semantics checks. */
21084 {
21086 /* Don't require a constant rvalue in C++11, since we
21087 might want a reference constant. We'll enforce
21088 constancy later. */
21090 /* Parse the initializer. */
21093 }
21094 else
21095 /* Parse the initializer. */
21097 }
21100 {
21104 else
21106 }
21107 /* Otherwise, there is no initializer. */
21108 else
21111 /* See if we are probably looking at a function
21112 definition. We are certainly not looking at a
21113 member-declarator. Calling `grokfield' has
21114 side-effects, so we must not do it unless we are sure
21115 that we are looking at a member-declarator. */
21118 {
21119 /* The grammar does not allow a pure-specifier to be
21120 used when a member function is defined. (It is
21121 possible that this fact is an oversight in the
21122 standard, since a pure function may be defined
21123 outside of the class-specifier. */
21129 declarator,
21130 attributes);
21133 /* If the member was not a friend, declare it here. */
21136 /* Peek at the next token. */
21138 /* If the next token is a semicolon, consume it. */
21142 }
21143 else
21146 /* Create the declaration. */
21151 {
21154 else
21156 }
21157 }
21161 /* Reset PREFIX_ATTRIBUTES. */
21167 /* If there is any qualification still in effect, clear it
21168 now; we will be starting fresh with the next declarator. */
21172 /* If it's a `,', then there are more declarators. */
21174 {
21177 {
21181 }
21182 }
21183 /* If the next token isn't a `;', then we have a parse error. */
21185 CPP_SEMICOLON))
21186 {
21187 /* The next token might be a ways away from where the
21188 actual semicolon is missing. Find the previous token
21189 and use that for our error position. */
21194 /* Assume that the user meant to provide a semicolon. If
21195 we were to cp_parser_skip_to_end_of_statement, we might
21196 skip to a semicolon inside a member function definition
21197 and issue nonsensical error messages. */
21199 }
21202 {
21203 /* Add DECL to the list of members. */
21205 /* Explicitly include, eg, NSDMIs, for better error
21206 recovery (c++/58650). */
21215 /* Add DECL to the queue of NSDMI to be parsed later. */
21217 }
21221 }
21222 }
21225 out:
21227 }
21229 /* Parse a pure-specifier.
21231 pure-specifier:
21232 = 0
21234 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21235 Otherwise, ERROR_MARK_NODE is returned. */
21237 static tree
21239 {
21242 /* Look for the `=' token. */
21245 /* Look for the `0' token. */
21254 /* Accept = default or = delete in c++0x mode. */
21257 {
21260 }
21262 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21264 {
21269 }
21271 {
21274 }
21277 }
21279 /* Parse a constant-initializer.
21281 constant-initializer:
21282 = constant-expression
21284 Returns a representation of the constant-expression. */
21286 static tree
21288 {
21289 /* Look for the `=' token. */
21293 /* It is invalid to write:
21295 struct S { static const int i = { 7 }; };
21297 */
21299 {
21302 /* Consume the opening brace. */
21304 /* Skip the initializer. */
21306 /* Look for the trailing `}'. */
21310 }
21313 }
21315 /* Derived classes [gram.class.derived] */
21317 /* Parse a base-clause.
21319 base-clause:
21320 : base-specifier-list
21322 base-specifier-list:
21323 base-specifier ... [opt]
21324 base-specifier-list , base-specifier ... [opt]
21326 Returns a TREE_LIST representing the base-classes, in the order in
21327 which they were declared. The representation of each node is as
21328 described by cp_parser_base_specifier.
21330 In the case that no bases are specified, this function will return
21331 NULL_TREE, not ERROR_MARK_NODE. */
21333 static tree
21335 {
21338 /* Look for the `:' that begins the list. */
21341 /* Scan the base-specifier-list. */
21343 {
21345 tree base;
21348 /* Look for the base-specifier. */
21350 /* Look for the (optional) ellipsis. */
21352 {
21353 /* Consume the `...'. */
21357 }
21359 /* Add BASE to the front of the list. */
21361 {
21363 /* Make this a pack expansion type. */
21367 {
21370 }
21371 }
21372 /* Peek at the next token. */
21374 /* If it's not a comma, then the list is complete. */
21377 /* Consume the `,'. */
21379 }
21381 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21382 base class had a qualified name. However, the next name that
21383 appears is certainly not qualified. */
21389 }
21391 /* Parse a base-specifier.
21393 base-specifier:
21394 :: [opt] nested-name-specifier [opt] class-name
21395 virtual access-specifier [opt] :: [opt] nested-name-specifier
21396 [opt] class-name
21397 access-specifier virtual [opt] :: [opt] nested-name-specifier
21398 [opt] class-name
21400 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21401 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21402 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21403 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21405 static tree
21407 {
21415 tree type;
21417 /* Process the optional `virtual' and `access-specifier'. */
21419 {
21420 /* Peek at the next token. */
21422 /* Process `virtual'. */
21424 {
21426 /* If `virtual' appears more than once, issue an error. */
21428 {
21432 }
21436 /* Consume the `virtual' token. */
21444 /* If more than one access specifier appears, issue an
21445 error. */
21448 {
21452 }
21456 /* Consume the access-specifier. */
21464 }
21465 }
21466 /* It is not uncommon to see programs mechanically, erroneously, use
21467 the 'typename' keyword to denote (dependent) qualified types
21468 as base classes. */
21470 {
21475 else
21477 "keyword %<typename%> not allowed in this context "
21480 }
21482 /* Look for the optional `::' operator. */
21484 /* Look for the nested-name-specifier. The simplest way to
21485 implement:
21487 [temp.res]
21489 The keyword `typename' is not permitted in a base-specifier or
21490 mem-initializer; in these contexts a qualified name that
21491 depends on a template-parameter is implicitly assumed to be a
21492 type name.
21494 is to pretend that we have seen the `typename' keyword at this
21495 point. */
21499 typename_type,
21501 /* If the base class is given by a qualified name, assume that names
21502 we see are type names or templates, as appropriate. */
21508 /* DR 950 allows decltype as a base-specifier. */
21510 else
21511 {
21512 /* Otherwise, look for the class-name. */
21514 class_scope_p,
21515 template_p,
21516 typename_type,
21521 }
21527 }
21529 /* Exception handling [gram.exception] */
21531 /* Parse an (optional) noexcept-specification.
21533 noexcept-specification:
21534 noexcept ( constant-expression ) [opt]
21536 If no noexcept-specification is present, returns NULL_TREE.
21537 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21538 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21539 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21540 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21541 in which case a boolean condition is returned instead. */
21543 static tree
21548 {
21552 /* Peek at the next token. */
21555 /* Is it a noexcept-specification? */
21557 {
21558 tree expr;
21562 {
21566 {
21567 /* Types may not be defined in an exception-specification. */
21569 parser->type_definition_forbidden_message
21574 /* Restore the saved message. */
21576 }
21577 else
21578 {
21581 }
21584 }
21585 else
21586 {
21590 }
21592 /* We cannot build a noexcept-spec right away because this will check
21593 that expr is a constexpr. */
21596 else
21598 }
21599 else
21601 }
21603 /* Parse an (optional) exception-specification.
21605 exception-specification:
21606 throw ( type-id-list [opt] )
21608 Returns a TREE_LIST representing the exception-specification. The
21609 TREE_VALUE of each node is a type. */
21611 static tree
21613 {
21615 tree type_id_list;
21618 /* Peek at the next token. */
21621 /* Is it a noexcept-specification? */
21627 /* If it's not `throw', then there's no exception-specification. */
21631 #if 0
21632 /* Enable this once a lot of code has transitioned to noexcept? */
21636 #endif
21638 /* Consume the `throw'. */
21641 /* Look for the `('. */
21644 /* Peek at the next token. */
21646 /* If it's not a `)', then there is a type-id-list. */
21648 {
21649 /* Types may not be defined in an exception-specification. */
21651 parser->type_definition_forbidden_message
21653 /* Parse the type-id-list. */
21655 /* Restore the saved message. */
21657 }
21658 else
21661 /* Look for the `)'. */
21665 }
21667 /* Parse an (optional) type-id-list.
21669 type-id-list:
21670 type-id ... [opt]
21671 type-id-list , type-id ... [opt]
21673 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21674 in the order that the types were presented. */
21676 static tree
21678 {
21682 {
21684 tree type;
21686 /* Get the next type-id. */
21688 /* Parse the optional ellipsis. */
21690 {
21691 /* Consume the `...'. */
21694 /* Turn the type into a pack expansion expression. */
21696 }
21697 /* Add it to the list. */
21699 /* Peek at the next token. */
21701 /* If it is not a `,', we are done. */
21704 /* Consume the `,'. */
21706 }
21709 }
21711 /* Parse a try-block.
21713 try-block:
21714 try compound-statement handler-seq */
21716 static tree
21718 {
21719 tree try_block;
21733 }
21735 /* Parse a function-try-block.
21737 function-try-block:
21738 try ctor-initializer [opt] function-body handler-seq */
21740 static bool
21742 {
21743 tree compound_stmt;
21744 tree try_block;
21747 /* Look for the `try' keyword. */
21750 /* Let the rest of the front end know where we are. */
21752 /* Parse the function-body. */
21753 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21755 /* We're done with the `try' part. */
21757 /* Parse the handlers. */
21759 /* We're done with the handlers. */
21763 }
21765 /* Parse a handler-seq.
21767 handler-seq:
21768 handler handler-seq [opt] */
21770 static void
21772 {
21774 {
21777 /* Parse the handler. */
21779 /* Peek at the next token. */
21781 /* If it's not `catch' then there are no more handlers. */
21784 }
21785 }
21787 /* Parse a handler.
21789 handler:
21790 catch ( exception-declaration ) compound-statement */
21792 static void
21794 {
21795 tree handler;
21796 tree declaration;
21806 }
21808 /* Parse an exception-declaration.
21810 exception-declaration:
21811 type-specifier-seq declarator
21812 type-specifier-seq abstract-declarator
21813 type-specifier-seq
21814 ...
21816 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21817 ellipsis variant is used. */
21819 static tree
21821 {
21822 cp_decl_specifier_seq type_specifiers;
21826 /* If it's an ellipsis, it's easy to handle. */
21828 {
21829 /* Consume the `...' token. */
21832 }
21834 /* Types may not be defined in exception-declarations. */
21836 parser->type_definition_forbidden_message
21839 /* Parse the type-specifier-seq. */
21843 /* If it's a `)', then there is no declarator. */
21846 else
21853 /* Restore the saved message. */
21860 }
21862 /* Parse a throw-expression.
21864 throw-expression:
21865 throw assignment-expression [opt]
21867 Returns a THROW_EXPR representing the throw-expression. */
21869 static tree
21871 {
21872 tree expression;
21877 /* Figure out whether or not there is an assignment-expression
21878 following the "throw" keyword. */
21886 else
21890 }
21892 /* GNU Extensions */
21894 /* Parse an (optional) asm-specification.
21896 asm-specification:
21897 asm ( string-literal )
21899 If the asm-specification is present, returns a STRING_CST
21900 corresponding to the string-literal. Otherwise, returns
21901 NULL_TREE. */
21903 static tree
21905 {
21907 tree asm_specification;
21909 /* Peek at the next token. */
21911 /* If the next token isn't the `asm' keyword, then there's no
21912 asm-specification. */
21916 /* Consume the `asm' token. */
21918 /* Look for the `('. */
21921 /* Look for the string-literal. */
21924 /* Look for the `)'. */
21928 }
21930 /* Parse an asm-operand-list.
21932 asm-operand-list:
21933 asm-operand
21934 asm-operand-list , asm-operand
21936 asm-operand:
21937 string-literal ( expression )
21938 [ string-literal ] string-literal ( expression )
21940 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21941 each node is the expression. The TREE_PURPOSE is itself a
21942 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21943 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21944 is a STRING_CST for the string literal before the parenthesis. Returns
21945 ERROR_MARK_NODE if any of the operands are invalid. */
21947 static tree
21949 {
21954 {
21955 tree string_literal;
21956 tree expression;
21957 tree name;
21960 {
21961 /* Consume the `[' token. */
21963 /* Read the operand name. */
21968 /* Look for the closing `]'. */
21970 }
21971 else
21973 /* Look for the string-literal. */
21976 /* Look for the `('. */
21978 /* Parse the expression. */
21980 /* Look for the `)'. */
21988 /* Add this operand to the list. */
21990 expression,
21991 asm_operands);
21992 /* If the next token is not a `,', there are no more
21993 operands. */
21996 /* Consume the `,'. */
21998 }
22001 }
22003 /* Parse an asm-clobber-list.
22005 asm-clobber-list:
22006 string-literal
22007 asm-clobber-list , string-literal
22009 Returns a TREE_LIST, indicating the clobbers in the order that they
22010 appeared. The TREE_VALUE of each node is a STRING_CST. */
22012 static tree
22014 {
22018 {
22019 tree string_literal;
22021 /* Look for the string literal. */
22023 /* Add it to the list. */
22025 /* If the next token is not a `,', then the list is
22026 complete. */
22029 /* Consume the `,' token. */
22031 }
22034 }
22036 /* Parse an asm-label-list.
22038 asm-label-list:
22039 identifier
22040 asm-label-list , identifier
22042 Returns a TREE_LIST, indicating the labels in the order that they
22043 appeared. The TREE_VALUE of each node is a label. */
22045 static tree
22047 {
22051 {
22054 /* Look for the identifier. */
22057 {
22060 {
22066 }
22067 }
22068 /* If the next token is not a `,', then the list is
22069 complete. */
22072 /* Consume the `,' token. */
22074 }
22077 }
22079 /* Return TRUE iff the next tokens in the stream are possibly the
22080 beginning of a GNU extension attribute. */
22082 static bool
22084 {
22086 }
22088 /* Return TRUE iff the next tokens in the stream are possibly the
22089 beginning of a standard C++-11 attribute specifier. */
22091 static bool
22093 {
22095 }
22097 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22098 beginning of a standard C++-11 attribute specifier. */
22100 static bool
22102 {
22110 }
22112 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22113 beginning of a GNU extension attribute. */
22115 static bool
22117 {
22121 }
22123 /* Return true iff the next tokens can be the beginning of either a
22124 GNU attribute list, or a standard C++11 attribute sequence. */
22126 static bool
22128 {
22131 }
22133 /* Return true iff the next Nth tokens can be the beginning of either
22134 a GNU attribute list, or a standard C++11 attribute sequence. */
22136 static bool
22138 {
22141 }
22143 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22144 of GNU attributes, or return NULL. */
22146 static tree
22148 {
22152 }
22154 #define CILK_SIMD_FN_CLAUSE_MASK \
22155 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22156 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22157 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22158 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22159 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22161 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22162 vector [(<clauses>)] */
22164 static void
22166 {
22170 {
22175 }
22178 {
22181 paren_scope++;
22182 }
22184 {
22187 paren_scope++;
22189 paren_scope--;
22190 /* Do not push the last ')' */
22193 }
22202 }
22204 /* Parse an (optional) series of attributes.
22206 attributes:
22207 attributes attribute
22209 attribute:
22210 __attribute__ (( attribute-list [opt] ))
22212 The return value is as for cp_parser_gnu_attribute_list. */
22214 static tree
22216 {
22220 {
22222 tree attribute_list;
22225 /* Peek at the next token. */
22227 /* If it's not `__attribute__', then we're done. */
22231 /* Consume the `__attribute__' keyword. */
22233 /* Look for the two `(' tokens. */
22237 /* Peek at the next token. */
22240 /* Parse the attribute-list. */
22242 else
22243 /* If the next token is a `)', then there is no attribute
22244 list. */
22247 /* Look for the two `)' tokens. */
22255 /* Add these new attributes to the list. */
22257 }
22260 }
22262 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22263 "__vector" or "__vector__." */
22267 {
22271 }
22273 /* Parse a GNU attribute-list.
22275 attribute-list:
22276 attribute
22277 attribute-list , attribute
22279 attribute:
22280 identifier
22281 identifier ( identifier )
22282 identifier ( identifier , expression-list )
22283 identifier ( expression-list )
22285 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22286 to an attribute. The TREE_PURPOSE of each node is the identifier
22287 indicating which attribute is in use. The TREE_VALUE represents
22288 the arguments, if any. */
22290 static tree
22292 {
22298 {
22300 tree identifier;
22301 tree attribute;
22303 /* Look for the identifier. We also allow keywords here; for
22304 example `__attribute__ ((const))' is legal. */
22308 {
22311 /* Consume the token, but save it since we need it for the
22312 SIMD enabled function parsing. */
22315 /* Save away the identifier that indicates which attribute
22316 this is. */
22318 /* For keywords, use the canonical spelling, not the
22319 parsed identifier. */
22325 /* Peek at the next token. */
22327 /* If it's an `(', then parse the attribute arguments. */
22329 {
22334 {
22337 }
22338 else
22339 vec = cp_parser_parenthesized_expression_list
22345 else
22346 {
22349 }
22350 /* Save the arguments away. */
22352 }
22354 {
22357 }
22360 {
22361 /* Add this attribute to the list. */
22364 }
22367 }
22368 /* Now, look for more attributes. If the next token isn't a
22369 `,', we're done. */
22373 /* Consume the comma and keep going. */
22375 }
22378 /* We built up the list in reverse order. */
22380 }
22382 /* Parse a standard C++11 attribute.
22384 The returned representation is a TREE_LIST which TREE_PURPOSE is
22385 the scoped name of the attribute, and the TREE_VALUE is its
22386 arguments list.
22388 Note that the scoped name of the attribute is itself a TREE_LIST
22389 which TREE_PURPOSE is the namespace of the attribute, and
22390 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22391 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22392 and which TREE_PURPOSE is directly the attribute name.
22394 Clients of the attribute code should use get_attribute_namespace
22395 and get_attribute_name to get the actual namespace and name of
22396 attributes, regardless of their being GNU or C++11 attributes.
22398 attribute:
22399 attribute-token attribute-argument-clause [opt]
22401 attribute-token:
22402 identifier
22403 attribute-scoped-token
22405 attribute-scoped-token:
22406 attribute-namespace :: identifier
22408 attribute-namespace:
22409 identifier
22411 attribute-argument-clause:
22412 ( balanced-token-seq )
22414 balanced-token-seq:
22415 balanced-token [opt]
22416 balanced-token-seq balanced-token
22418 balanced-token:
22419 ( balanced-token-seq )
22420 [ balanced-token-seq ]
22421 { balanced-token-seq }. */
22423 static tree
22425 {
22429 /* First, parse name of the attribute, a.k.a attribute-token. */
22446 {
22447 /* We are seeing a scoped attribute token. */
22457 else
22458 {
22462 }
22464 NULL_TREE);
22466 }
22467 else
22468 {
22470 NULL_TREE);
22471 /* C++11 noreturn attribute is equivalent to GNU's. */
22474 /* C++14 deprecated attribute is equivalent to GNU's. */
22476 {
22479 "%<deprecated%> is a C++14 feature;"
22482 }
22483 }
22485 /* Now parse the optional argument clause of the attribute. */
22490 {
22496 /* A GNU attribute that takes an identifier in parameter. */
22499 vec = cp_parser_parenthesized_expression_list
22505 else
22506 {
22509 }
22513 else
22515 }
22518 }
22520 /* Check that the attribute ATTRIBUTE appears at most once in the
22521 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
22522 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
22523 isn't implemented yet in GCC. */
22525 static void
22527 {
22529 {
22539 }
22540 }
22542 /* Parse a list of standard C++-11 attributes.
22544 attribute-list:
22545 attribute [opt]
22546 attribute-list , attribute[opt]
22547 attribute ...
22548 attribute-list , attribute ...
22549 */
22551 static tree
22553 {
22558 {
22563 {
22567 }
22570 {
22575 }
22579 }
22582 }
22584 /* Parse a standard C++-11 attribute specifier.
22586 attribute-specifier:
22587 [ [ attribute-list ] ]
22588 alignment-specifier
22590 alignment-specifier:
22591 alignas ( type-id ... [opt] )
22592 alignas ( alignment-expression ... [opt] ). */
22594 static tree
22596 {
22602 {
22611 else
22612 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22613 when we are sure that we have actually parsed them. */
22615 }
22616 else
22617 {
22618 tree alignas_expr;
22620 /* Look for an alignment-specifier. */
22632 {
22635 }
22641 {
22645 alignas_expr =
22652 }
22658 {
22661 }
22664 {
22667 }
22669 /* Build the C++-11 representation of an 'aligned'
22670 attribute. */
22671 attributes =
22674 alignas_expr);
22675 }
22678 }
22680 /* Parse a standard C++-11 attribute-specifier-seq.
22682 attribute-specifier-seq:
22683 attribute-specifier-seq [opt] attribute-specifier
22684 */
22686 static tree
22688 {
22692 {
22701 }
22705 }
22707 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22708 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22709 current value of the PEDANTIC flag, regardless of whether or not
22710 the `__extension__' keyword is present. The caller is responsible
22711 for restoring the value of the PEDANTIC flag. */
22713 static bool
22715 {
22716 /* Save the old value of the PEDANTIC flag. */
22720 {
22721 /* Consume the `__extension__' token. */
22723 /* We're not being pedantic while the `__extension__' keyword is
22724 in effect. */
22728 }
22731 }
22733 /* Parse a label declaration.
22735 label-declaration:
22736 __label__ label-declarator-seq ;
22738 label-declarator-seq:
22739 identifier , label-declarator-seq
22740 identifier */
22742 static void
22744 {
22745 /* Look for the `__label__' keyword. */
22749 {
22750 tree identifier;
22752 /* Look for an identifier. */
22754 /* If we failed, stop. */
22757 /* Declare it as a label. */
22759 /* If the next token is a `;', stop. */
22762 /* Look for the `,' separating the label declarations. */
22764 }
22766 /* Look for the final `;'. */
22768 }
22770 /* Support Functions */
22772 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22773 NAME should have one of the representations used for an
22774 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22775 is returned. If PARSER->SCOPE is a dependent type, then a
22776 SCOPE_REF is returned.
22778 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22779 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22780 was formed. Abstractly, such entities should not be passed to this
22781 function, because they do not need to be looked up, but it is
22782 simpler to check for this special case here, rather than at the
22783 call-sites.
22785 In cases not explicitly covered above, this function returns a
22786 DECL, OVERLOAD, or baselink representing the result of the lookup.
22787 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22788 is returned.
22790 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22791 (e.g., "struct") that was used. In that case bindings that do not
22792 refer to types are ignored.
22794 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22795 ignored.
22797 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22798 are ignored.
22800 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22801 types.
22803 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22804 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22805 NULL_TREE otherwise. */
22807 static tree
22814 location_t name_location)
22815 {
22816 tree decl;
22819 /* Assume that the lookup will be unambiguous. */
22823 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22824 no longer valid. Note that if we are parsing tentatively, and
22825 the parse fails, OBJECT_TYPE will be automatically restored. */
22831 /* A template-id has already been resolved; there is no lookup to
22832 do. */
22836 {
22840 }
22842 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22843 it should already have been checked to make sure that the name
22844 used matches the type being destroyed. */
22846 {
22847 tree type;
22849 /* Figure out to which type this destructor applies. */
22854 else
22856 /* If that's not a class type, there is no destructor. */
22863 /* If it was a class type, return the destructor. */
22865 }
22867 /* By this point, the NAME should be an ordinary identifier. If
22868 the id-expression was a qualified name, the qualifying scope is
22869 stored in PARSER->SCOPE at this point. */
22872 /* Perform the lookup. */
22874 {
22880 /* If the SCOPE is dependent, the lookup must be deferred until
22881 the template is instantiated -- unless we are explicitly
22882 looking up names in uninstantiated templates. Even then, we
22883 cannot look up the name if the scope is not a class type; it
22884 might, for example, be a template type parameter. */
22889 /* Defer lookup. */
22891 else
22892 {
22895 /* If PARSER->SCOPE is a dependent type, then it must be a
22896 class type, and we must not be checking dependencies;
22897 otherwise, we would have processed this lookup above. So
22898 that PARSER->SCOPE is not considered a dependent base by
22899 lookup_member, we must enter the scope here. */
22903 /* If the PARSER->SCOPE is a template specialization, it
22904 may be instantiated during name lookup. In that case,
22905 errors may be issued. Even if we rollback the current
22906 tentative parse, those errors are valid. */
22911 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22912 lookup result and the nested-name-specifier nominates a class C:
22913 * if the name specified after the nested-name-specifier, when
22914 looked up in C, is the injected-class-name of C (Clause 9), or
22915 * if the name specified after the nested-name-specifier is the
22916 same as the identifier or the simple-template-id's template-
22917 name in the last component of the nested-name-specifier,
22918 the name is instead considered to name the constructor of
22919 class C. [ Note: for example, the constructor is not an
22920 acceptable lookup result in an elaborated-type-specifier so
22921 the constructor would not be used in place of the
22922 injected-class-name. --end note ] Such a constructor name
22923 shall be used only in the declarator-id of a declaration that
22924 names a constructor or in a using-declaration. */
22932 /* If we have a single function from a using decl, pull it out. */
22939 }
22941 /* If the scope is a dependent type and either we deferred lookup or
22942 we did lookup but didn't find the name, rememeber the name. */
22945 {
22947 {
22948 tree type;
22950 /* The resolution to Core Issue 180 says that `struct
22951 A::B' should be considered a type-name, even if `A'
22952 is dependent. */
22957 }
22961 CPP_CLOSE_PAREN)))
22965 else
22968 is_template);
22969 }
22972 }
22974 {
22975 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22976 OBJECT_TYPE is not a class. */
22978 /* If the OBJECT_TYPE is a template specialization, it may
22979 be instantiated during name lookup. In that case, errors
22980 may be issued. Even if we rollback the current tentative
22981 parse, those errors are valid. */
22983 name,
22986 tf_warning_or_error);
22987 else
22991 /* Look it up in the enclosing context. */
22997 }
22998 else
22999 {
23005 }
23007 /* If the lookup failed, let our caller know. */
23011 /* Pull out the template from an injected-class-name (or multiple). */
23015 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
23017 {
23020 /* The error message we have to print is too complicated for
23021 cp_parser_error, so we incorporate its actions directly. */
23023 {
23025 name);
23027 }
23029 }
23037 /* If we have resolved the name of a member declaration, check to
23038 see if the declaration is accessible. When the name resolves to
23039 set of overloaded functions, accessibility is checked when
23040 overload resolution is done.
23042 During an explicit instantiation, access is not checked at all,
23043 as per [temp.explicit]. */
23050 }
23052 /* Like cp_parser_lookup_name, but for use in the typical case where
23053 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
23054 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
23056 static tree
23058 {
23060 none_type,
23065 location);
23066 }
23068 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
23069 the current context, return the TYPE_DECL. If TAG_NAME_P is
23070 true, the DECL indicates the class being defined in a class-head,
23071 or declared in an elaborated-type-specifier.
23073 Otherwise, return DECL. */
23075 static tree
23077 {
23078 /* If the TEMPLATE_DECL is being declared as part of a class-head,
23079 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
23081 struct A {
23082 template <typename T> struct B;
23083 };
23085 template <typename T> struct A::B {};
23087 Similarly, in an elaborated-type-specifier:
23089 namespace N { struct X{}; }
23091 struct A {
23092 template <typename T> friend struct N::X;
23093 };
23095 However, if the DECL refers to a class type, and we are in
23096 the scope of the class, then the name lookup automatically
23097 finds the TYPE_DECL created by build_self_reference rather
23098 than a TEMPLATE_DECL. For example, in:
23100 template <class T> struct S {
23101 S s;
23102 };
23104 there is no need to handle such case. */
23110 }
23112 /* If too many, or too few, template-parameter lists apply to the
23113 declarator, issue an error message. Returns TRUE if all went well,
23114 and FALSE otherwise. */
23116 static bool
23119 location_t declarator_location)
23120 {
23122 {
23124 {
23132 /* If the DECLARATOR has the form `X<y>' then it uses one
23133 additional level of template parameters. */
23136 return cp_parser_check_template_parameters
23138 }
23153 }
23155 }
23157 /* NUM_TEMPLATES were used in the current declaration. If that is
23158 invalid, return FALSE and issue an error messages. Otherwise,
23159 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23160 declarator and we can print more accurate diagnostics. */
23162 static bool
23165 location_t location,
23167 {
23168 /* If there are the same number of template classes and parameter
23169 lists, that's OK. */
23172 /* If there are more, but only one more, then we are referring to a
23173 member template. That's OK too. */
23176 /* If there are more template classes than parameter lists, we have
23177 something like:
23179 template <class T> void S<T>::R<T>::f (); */
23181 {
23191 else
23194 }
23195 /* Otherwise, there are too many template parameter lists. We have
23196 something like:
23198 template <class T> template <class U> void S::f(); */
23201 }
23203 /* Parse an optional `::' token indicating that the following name is
23204 from the global namespace. If so, PARSER->SCOPE is set to the
23205 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23206 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23207 Returns the new value of PARSER->SCOPE, if the `::' token is
23208 present, and NULL_TREE otherwise. */
23210 static tree
23212 {
23215 /* Peek at the next token. */
23217 /* If we're looking at a `::' token then we're starting from the
23218 global namespace, not our current location. */
23220 {
23221 /* Consume the `::' token. */
23223 /* Set the SCOPE so that we know where to start the lookup. */
23229 }
23231 {
23235 }
23238 }
23240 /* Returns TRUE if the upcoming token sequence is the start of a
23241 constructor declarator. If FRIEND_P is true, the declarator is
23242 preceded by the `friend' specifier. */
23244 static bool
23246 {
23249 tree nested_name_specifier;
23252 /* The common case is that this is not a constructor declarator, so
23253 try to avoid doing lots of work if at all possible. It's not
23254 valid declare a constructor at function scope. */
23257 /* And only certain tokens can begin a constructor declarator. */
23265 /* Parse tentatively; we are going to roll back all of the tokens
23266 consumed here. */
23268 /* Assume that we are looking at a constructor declarator. */
23271 /* Look for the optional `::' operator. */
23274 /* Look for the nested-name-specifier. */
23275 nested_name_specifier
23286 /* Outside of a class-specifier, there must be a
23287 nested-name-specifier. */
23293 /* If we have a class scope, this is easy; DR 147 says that S::S always
23294 names the constructor, and no other qualified name could. */
23297 {
23307 }
23308 /* If we still think that this might be a constructor-declarator,
23309 look for a class-name. */
23311 {
23312 /* If we have:
23314 template <typename T> struct S {
23315 S();
23316 };
23318 we must recognize that the nested `S' names a class. */
23319 tree type_decl;
23323 none_type,
23327 /* If there was no class-name, then this is not a constructor.
23328 Otherwise, if we are in a class-specifier and we aren't
23329 handling a friend declaration, check that its type matches
23330 current_class_type (c++/38313). Note: error_mark_node
23331 is left alone for error recovery purposes. */
23333 && (outside_class_specifier_p
23338 /* If we're still considering a constructor, we have to see a `(',
23339 to begin the parameter-declaration-clause, followed by either a
23340 `)', an `...', or a decl-specifier. We need to check for a
23341 type-specifier to avoid being fooled into thinking that:
23343 S (f) (int);
23345 is a constructor. (It is actually a function named `f' that
23346 takes one parameter (of type `int') and returns a value of type
23347 `S'. */
23355 /* A parameter declaration begins with a decl-specifier,
23356 which is either the "attribute" keyword, a storage class
23357 specifier, or (usually) a type-specifier. */
23359 {
23360 tree type;
23364 /* Names appearing in the type-specifier should be looked up
23365 in the scope of the class. */
23368 else
23369 {
23372 {
23376 {
23379 }
23380 }
23382 }
23384 /* Inside the constructor parameter list, surrounding
23385 template-parameter-lists do not apply. */
23386 saved_num_template_parameter_lists
23390 /* Look for the type-specifier. */
23392 CP_PARSER_FLAGS_NONE,
23398 parser->num_template_parameter_lists
23401 /* Leave the scope of the class. */
23406 }
23407 }
23409 /* We did not really want to consume any tokens. */
23413 }
23415 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23416 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23417 they must be performed once we are in the scope of the function.
23419 Returns the function defined. */
23421 static tree
23422 cp_parser_function_definition_from_specifiers_and_declarator
23425 tree attributes,
23427 {
23428 tree fn;
23431 /* Begin the function-definition. */
23434 /* The things we're about to see are not directly qualified by any
23435 template headers we've seen thus far. */
23438 /* If there were names looked up in the decl-specifier-seq that we
23439 did not check, check them now. We must wait until we are in the
23440 scope of the function to perform the checks, since the function
23441 might be a friend. */
23445 {
23448 }
23451 {
23452 /* Skip the entire function. */
23455 }
23457 {
23458 /* Seen already, skip it. An error message has already been output. */
23462 /* If this is a function from a class, pop the nested class. */
23465 }
23466 else
23467 {
23468 timevar_id_t tv;
23471 else
23477 }
23480 }
23482 /* Parse the part of a function-definition that follows the
23483 declarator. INLINE_P is TRUE iff this function is an inline
23484 function defined within a class-specifier.
23486 Returns the function defined. */
23488 static tree
23491 {
23492 tree fn;
23498 bool fully_implicit_function_template_p
23501 tree implicit_template_parms
23504 cp_binding_level* implicit_template_scope
23510 /* If the next token is `return', then the code may be trying to
23511 make use of the "named return value" extension that G++ used to
23512 support. */
23515 {
23516 /* Consume the `return' keyword. */
23518 /* Look for the identifier that indicates what value is to be
23519 returned. */
23521 /* Issue an error message. */
23524 /* Skip tokens until we reach the start of the function body. */
23526 {
23533 }
23534 }
23535 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23536 anything declared inside `f'. */
23537 saved_in_unbraced_linkage_specification_p
23540 /* Inside the function, surrounding template-parameter-lists do not
23541 apply. */
23542 saved_num_template_parameter_lists
23548 /* If the next token is `try', `__transaction_atomic', or
23549 `__transaction_relaxed`, then we are looking at either function-try-block
23550 or function-transaction-block. Note that all of these include the
23551 function-body. */
23554 RID_TRANSACTION_ATOMIC);
23556 RID_TRANSACTION_RELAXED))
23558 RID_TRANSACTION_RELAXED);
23561 else
23562 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23567 /* Finish the function. */
23570 /* Generate code for it, if necessary. */
23572 /* Restore the saved values. */
23573 parser->in_unbraced_linkage_specification_p
23575 parser->num_template_parameter_lists
23579 parser->fully_implicit_function_template_p
23581 parser->implicit_template_parms
23583 parser->implicit_template_scope
23590 }
23592 /* Parse a template-declaration, assuming that the `export' (and
23593 `extern') keywords, if present, has already been scanned. MEMBER_P
23594 is as for cp_parser_template_declaration. */
23596 static void
23598 {
23601 tree parameter_list;
23606 /* Look for the `template' keyword. */
23611 /* And the `<'. */
23615 {
23616 /* 14.5.2.2 [temp.mem]
23618 A local class shall not have member templates. */
23623 }
23624 /* [temp]
23626 A template ... shall not have C linkage. */
23628 {
23630 /* Give it C++ linkage to avoid confusing other parts of the
23631 front end. */
23634 }
23635 else
23638 /* We cannot perform access checks on the template parameter
23639 declarations until we know what is being declared, just as we
23640 cannot check the decl-specifier list. */
23643 /* If the next token is `>', then we have an invalid
23644 specialization. Rather than complain about an invalid template
23645 parameter, issue an error message here. */
23647 {
23651 }
23652 else
23653 {
23654 /* Parse the template parameters. */
23656 }
23658 /* Get the deferred access checks from the parameter list. These
23659 will be checked once we know what is being declared, as for a
23660 member template the checks must be performed in the scope of the
23661 class containing the member. */
23664 /* Look for the `>'. */
23666 /* We just processed one more parameter list. */
23668 /* If the next token is `template', there are more template
23669 parameters. */
23671 RID_TEMPLATE))
23676 else
23677 {
23678 /* There are no access checks when parsing a template, as we do not
23679 know if a specialization will be a friend. */
23683 checks,
23684 member_p,
23689 /* If this is a member template declaration, let the front
23690 end know. */
23692 {
23697 }
23702 }
23703 /* We are done with the current parameter list. */
23708 /* Finish up. */
23711 /* Check the template arguments for a literal operator template. */
23715 {
23719 else
23720 {
23723 {
23729 }
23731 {
23739 }
23740 else
23742 }
23744 {
23747 " Expected non-type template argument pack <char...>"
23749 decl);
23750 else
23753 decl);
23754 }
23755 }
23756 /* Register member declarations. */
23759 /* For the erroneous case of a template with C linkage, we pushed an
23760 implicit C++ linkage scope; exit that scope now. */
23763 /* If DECL is a function template, we must return to parse it later.
23764 (Even though there is no definition, there might be default
23765 arguments that need handling.) */
23769 }
23771 /* Perform the deferred access checks from a template-parameter-list.
23772 CHECKS is a TREE_LIST of access checks, as returned by
23773 get_deferred_access_checks. */
23775 static void
23776 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23777 {
23781 }
23783 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23784 `function-definition' sequence that follows a template header.
23785 If MEMBER_P is true, this declaration appears in a class scope.
23787 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23788 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23790 static tree
23796 {
23799 cp_decl_specifier_seq decl_specifiers;
23803 /* This function is only used when processing a template
23804 declaration. */
23808 /* Defer access checks until we know what is being declared. */
23811 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23812 alternative. */
23815 CP_PARSER_FLAGS_OPTIONAL,
23821 /* There are no template typedefs. */
23823 {
23827 }
23829 /* Gather up the access checks that occurred the
23830 decl-specifier-seq. */
23833 /* Check for the declaration of a template class. */
23835 {
23837 {
23840 /* In this case:
23842 struct C {
23843 friend template <typename T> struct A<T>::B;
23844 };
23846 A<T>::B will be represented by a TYPENAME_TYPE, and
23847 therefore not recognized by shadow_tag. */
23849 && !decl
23856 else
23859 /* Perform access checks for template parameters. */
23861 }
23862 }
23864 /* Complain about missing 'typename' or other invalid type names. */
23867 {
23868 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23869 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23870 the rest of this declaration. */
23873 }
23875 /* If it's not a template class, try for a template function. If
23876 the next token is a `;', then this declaration does not declare
23877 anything. But, if there were errors in the decl-specifiers, then
23878 the error might well have come from an attempted class-specifier.
23879 In that case, there's no need to warn about a missing declarator. */
23883 {
23886 checks,
23888 member_p,
23889 declares_class_or_enum,
23893 /* 7.1.1-1 [dcl.stc]
23895 A storage-class-specifier shall not be specified in an explicit
23896 specialization... */
23898 && explicit_specialization_p
23900 {
23904 }
23908 }
23910 /* Look for a trailing `;' after the declaration. */
23916 out:
23919 /* Clear any current qualification; whatever comes next is the start
23920 of something new. */
23926 }
23928 /* Parse a cast-expression that is not the operand of a unary "&". */
23930 static tree
23932 {
23935 }
23937 /* Parse a functional cast to TYPE. Returns an expression
23938 representing the cast. */
23940 static tree
23942 {
23944 tree expression_list;
23945 tree cast;
23952 {
23960 tf_warning_or_error);
23961 }
23970 else
23971 {
23974 }
23977 tf_warning_or_error);
23978 /* [expr.const]/1: In an integral constant expression "only type
23979 conversions to integral or enumeration type can be used". */
23985 NIC_CONSTRUCTOR))
23988 }
23990 /* Save the tokens that make up the body of a member function defined
23991 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23992 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23993 specifiers applied to the declaration. Returns the FUNCTION_DECL
23994 for the member function. */
23996 static tree
24000 tree attributes)
24001 {
24004 tree fn;
24006 /* Create the FUNCTION_DECL. */
24009 /* If something went badly wrong, bail out now. */
24011 {
24012 /* If there's a function-body, skip it. */
24017 }
24019 /* Remember it, if there default args to post process. */
24022 /* Save away the tokens that make up the body of the
24023 function. */
24025 /* Handle function try blocks. */
24028 /* We can have braced-init-list mem-initializers before the fn body. */
24030 {
24033 {
24034 /* cache_group will stop after an un-nested { } pair, too. */
24038 /* variadic mem-inits have ... after the ')'. */
24041 }
24042 }
24044 /* Handle function try blocks. */
24049 /* Save away the inline definition; we will process it when the
24050 class is complete. */
24054 /* We need to know that this was defined in the class, so that
24055 friend templates are handled correctly. */
24058 /* Add FN to the queue of functions to be parsed later. */
24062 }
24064 /* Save the tokens that make up the in-class initializer for a non-static
24065 data member. Returns a DEFAULT_ARG. */
24067 static tree
24069 {
24071 }
24073 /* Parse a template-argument-list, as well as the trailing ">" (but
24074 not the opening "<"). See cp_parser_template_argument_list for the
24075 return value. */
24077 static tree
24079 {
24080 tree arguments;
24081 tree saved_scope;
24082 tree saved_qualifying_scope;
24083 tree saved_object_scope;
24088 /* [temp.names]
24090 When parsing a template-id, the first non-nested `>' is taken as
24091 the end of the template-argument-list rather than a greater-than
24092 operator. */
24093 saved_greater_than_is_operator_p
24096 /* Parsing the argument list may modify SCOPE, so we save it
24097 here. */
24101 /* We need to evaluate the template arguments, even though this
24102 template-id may be nested within a "sizeof". */
24107 /* Parse the template-argument-list itself. */
24111 else
24113 /* Look for the `>' that ends the template-argument-list. If we find
24114 a '>>' instead, it's probably just a typo. */
24116 {
24118 {
24119 /* In C++0x, a `>>' in a template argument list or cast
24120 expression is considered to be two separate `>'
24121 tokens. So, change the current token to a `>', but don't
24122 consume it: it will be consumed later when the outer
24123 template argument list (or cast expression) is parsed.
24124 Note that this replacement of `>' for `>>' is necessary
24125 even if we are parsing tentatively: in the tentative
24126 case, after calling
24127 cp_parser_enclosed_template_argument_list we will always
24128 throw away all of the template arguments and the first
24129 closing `>', either because the template argument list
24130 was erroneous or because we are replacing those tokens
24131 with a CPP_TEMPLATE_ID token. The second `>' (which will
24132 not have been thrown away) is needed either to close an
24133 outer template argument list or to complete a new-style
24134 cast. */
24137 }
24139 {
24140 /* If we're in a nested template argument list, the '>>' has
24141 to be a typo for '> >'. We emit the error message, but we
24142 continue parsing and we push a '>' as next token, so that
24143 the argument list will be parsed correctly. Note that the
24144 global source location is still on the token before the
24145 '>>', so we need to say explicitly where we want it. */
24151 }
24152 else
24153 {
24154 /* If this is not a nested template argument list, the '>>'
24155 is a typo for '>'. Emit an error message and continue.
24156 Same deal about the token location, but here we can get it
24157 right by consuming the '>>' before issuing the diagnostic. */
24160 "spurious %<>>%>, use %<>%> to terminate "
24162 }
24163 }
24164 else
24166 /* The `>' token might be a greater-than operator again now. */
24167 parser->greater_than_is_operator_p
24169 /* Restore the SAVED_SCOPE. */
24177 }
24179 /* MEMBER_FUNCTION is a member function, or a friend. If default
24180 arguments, or the body of the function have not yet been parsed,
24181 parse them now. */
24183 static void
24185 {
24187 /* If this member is a template, get the underlying
24188 FUNCTION_DECL. */
24192 /* There should not be any class definitions in progress at this
24193 point; the bodies of members are only parsed outside of all class
24194 definitions. */
24196 /* While we're parsing the member functions we might encounter more
24197 classes. We want to handle them right away, but we don't want
24198 them getting mixed up with functions that are currently in the
24199 queue. */
24202 /* Make sure that any template parameters are in scope. */
24205 /* If the body of the function has not yet been parsed, parse it
24206 now. */
24208 {
24209 tree function_scope;
24212 /* The function is no longer pending; we are processing it. */
24217 /* If this is a local class, enter the scope of the containing
24218 function. */
24223 /* Push the body of the function onto the lexer stack. */
24226 /* Let the front end know that we going to be defining this
24227 function. */
24231 /* Don't do access checking if it is a templated function. */
24235 /* #pragma omp declare reduction needs special parsing. */
24237 {
24242 }
24243 else
24244 /* Now, parse the body of the function. */
24251 /* Leave the scope of the containing function. */
24255 }
24257 /* Remove any template parameters from the symbol table. */
24260 /* Restore the queue. */
24263 }
24265 /* If DECL contains any default args, remember it on the unparsed
24266 functions queue. */
24268 static void
24270 {
24271 tree probe;
24274 probe;
24277 {
24281 }
24282 }
24284 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24285 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24286 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24287 from the parameter-type-list. */
24289 static tree
24292 {
24294 tree parsed_arg;
24300 /* Push the saved tokens for the default argument onto the parser's
24301 lexer stack. */
24307 /* Parse the default argument. */
24318 {
24319 /* In a non-template class, check conversions now. In a template,
24320 we'll wait and instantiate these as needed. */
24323 tf_warning_or_error);
24324 else
24326 }
24328 /* If the token stream has not been completely used up, then
24329 there was extra junk after the end of the default
24330 argument. */
24332 {
24335 else
24337 }
24339 /* Revert to the main lexer. */
24343 }
24345 /* FIELD is a non-static data member with an initializer which we saved for
24346 later; parse it now. */
24348 static void
24350 {
24351 tree def;
24358 NULL_TREE);
24364 }
24366 /* FN is a FUNCTION_DECL which may contains a parameter with an
24367 unparsed DEFAULT_ARG. Parse the default args now. This function
24368 assumes that the current scope is the scope in which the default
24369 argument should be processed. */
24371 static void
24373 {
24377 /* While we're parsing the default args, we might (due to the
24378 statement expression extension) encounter more classes. We want
24379 to handle them right away, but we don't want them getting mixed
24380 up with default args that are currently in the queue. */
24383 /* Local variable names (and the `this' keyword) may not appear
24384 in a default argument. */
24395 {
24397 tree parsed_arg;
24399 tree copy;
24406 /* This can happen for a friend declaration for a function
24407 already declared with default arguments. */
24410 parsed_arg
24412 default_arg,
24415 {
24417 }
24421 /* Update any instantiations we've already created. */
24425 }
24429 /* Make sure no default arg is missing. */
24432 /* Restore the state of local_variables_forbidden_p. */
24435 /* Restore the queue. */
24437 }
24439 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24441 sizeof ... ( identifier )
24443 where the 'sizeof' token has already been consumed. */
24445 static tree
24447 {
24448 /* Consume the `...'. */
24455 else
24463 /* The name is not qualified. */
24481 }
24483 /* Parse the operand of `sizeof' (or a similar operator). Returns
24484 either a TYPE or an expression, depending on the form of the
24485 input. The KEYWORD indicates which kind of expression we have
24486 encountered. */
24488 static tree
24490 {
24497 /* If it's a `...', then we are computing the length of a parameter
24498 pack. */
24503 /* Types cannot be defined in a `sizeof' expression. Save away the
24504 old message. */
24506 /* And create the new one. */
24512 /* The restrictions on constant-expressions do not apply inside
24513 sizeof expressions. */
24514 saved_integral_constant_expression_p
24516 saved_non_integral_constant_expression_p
24520 /* Do not actually evaluate the expression. */
24523 /* If it's a `(', then we might be looking at the type-id
24524 construction. */
24526 {
24529 /* We can't be sure yet whether we're looking at a type-id or an
24530 expression. */
24532 /* Note: as a GNU Extension, compound literals are considered
24533 postfix-expressions as they are in C99, so they are valid
24534 arguments to sizeof. See comment in cp_parser_cast_expression
24535 for details. */
24538 else
24539 {
24542 /* Look for the type-id. */
24544 /* Look for the closing `)'. */
24547 }
24549 /* If all went well, then we're done. */
24551 {
24552 cp_decl_specifier_seq decl_specs;
24554 /* Build a trivial decl-specifier-seq. */
24558 /* Call grokdeclarator to figure out what type this is. */
24561 TYPENAME,
24564 }
24565 }
24567 /* If the type-id production did not work out, then we must be
24568 looking at the unary-expression production. */
24572 /* Go back to evaluating expressions. */
24576 /* Free the message we created. */
24578 /* And restore the old one. */
24580 parser->integral_constant_expression_p
24582 parser->non_integral_constant_expression_p
24586 }
24588 /* If the current declaration has no declarator, return true. */
24590 static bool
24592 {
24593 /* If the next token is a `;' or a `,' then there is no
24594 declarator. */
24597 }
24599 /* Update the DECL_SPECS to reflect the storage class indicated by
24600 KEYWORD. */
24602 static void
24607 {
24608 cp_storage_class storage_class;
24611 {
24615 }
24617 {
24620 }
24625 {
24628 }
24631 {
24649 }
24653 /* A storage class specifier cannot be applied alongside a typedef
24654 specifier. If there is a typedef specifier present then set
24655 conflicting_specifiers_p which will trigger an error later
24656 on in grokdeclarator. */
24659 }
24661 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24662 is true, the type is a class or enum definition. */
24664 static void
24666 tree type_spec,
24669 {
24672 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24673 (with, for example, in "typedef int wchar_t;") we remember that
24674 this is what happened. In system headers, we ignore these
24675 declarations so that G++ can work with system headers that are not
24676 C++-safe. */
24678 && !type_definition_p
24688 {
24691 ds_redefined_builtin_type_spec,
24692 token);
24694 {
24698 }
24699 }
24702 else
24703 {
24708 }
24709 }
24711 /* True iff TOKEN is the GNU keyword __thread. */
24713 static bool
24715 {
24718 }
24720 /* Set the location for a declarator specifier and check if it is
24721 duplicated.
24723 DECL_SPECS is the sequence of declarator specifiers onto which to
24724 set the location.
24726 DS is the single declarator specifier to set which location is to
24727 be set onto the existing sequence of declarators.
24729 LOCATION is the location for the declarator specifier to
24730 consider. */
24732 static void
24735 {
24744 {
24748 }
24749 else
24750 {
24752 {
24756 else
24757 {
24760 OPT_Wlong_long,
24762 }
24763 }
24765 {
24770 else
24772 }
24773 else
24774 {
24790 "__complex"
24791 };
24794 }
24795 }
24796 }
24798 /* Return true iff the declarator specifier DS is present in the
24799 sequence of declarator specifiers DECL_SPECS. */
24801 bool
24803 cp_decl_spec ds)
24804 {
24811 }
24813 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24814 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24816 static bool
24818 {
24820 }
24822 /* Issue an error message indicating that TOKEN_DESC was expected.
24823 If KEYWORD is true, it indicated this function is called by
24824 cp_parser_require_keword and the required token can only be
24825 a indicated keyword. */
24827 static void
24829 required_token token_desc,
24831 {
24833 {
24902 }
24904 {
24906 {
24985 }
24986 }
24987 else
24989 }
24993 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24994 issue an error message indicating that TOKEN_DESC was expected.
24996 Returns the token consumed, if the token had the appropriate type.
24997 Otherwise, returns NULL. */
25002 required_token token_desc)
25003 {
25006 else
25007 {
25008 /* Output the MESSAGE -- unless we're parsing tentatively. */
25012 }
25013 }
25015 /* An error message is produced if the next token is not '>'.
25016 All further tokens are skipped until the desired token is
25017 found or '{', '}', ';' or an unbalanced ')' or ']'. */
25019 static void
25021 {
25022 /* Current level of '< ... >'. */
25024 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
25027 /* Are we ready, yet? If not, issue error message. */
25031 /* Skip tokens until the desired token is found. */
25033 {
25034 /* Peek at the next token. */
25036 {
25044 /* C++0x views the `>>' operator as two `>' tokens, but
25045 C++98 does not. */
25048 {
25049 /* We've hit a `>>' where the first `>' closes the
25050 template argument list, and the second `>' is
25051 spurious. Just consume the `>>' and stop; we've
25052 already produced at least one error. */
25055 }
25056 /* Fall through for C++0x, so we handle the second `>' in
25057 the `>>'. */
25061 {
25062 /* We've reached the token we want, consume it and stop. */
25065 }
25084 /* The '>' was probably forgotten, don't look further. */
25089 }
25091 /* Consume this token. */
25093 }
25094 }
25096 /* If the next token is the indicated keyword, consume it. Otherwise,
25097 issue an error message indicating that TOKEN_DESC was expected.
25099 Returns the token consumed, if the token had the appropriate type.
25100 Otherwise, returns NULL. */
25105 required_token token_desc)
25106 {
25110 {
25113 }
25116 }
25118 /* Returns TRUE iff TOKEN is a token that can begin the body of a
25119 function-definition. */
25121 static bool
25123 {
25126 /* A ctor-initializer begins with a `:'. */
25128 /* A function-try-block begins with `try'. */
25130 /* A function-transaction-block begins with `__transaction_atomic'
25131 or `__transaction_relaxed'. */
25134 /* The named return value extension begins with `return'. */
25136 }
25138 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25139 definition. */
25141 static bool
25143 {
25150 }
25152 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25153 C++0x) ending a template-argument. */
25155 static bool
25157 {
25165 }
25167 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25168 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25170 static bool
25173 {
25179 /* Check for the sequence `<::' in the original code. It would be lexed as
25180 `[:', where `[' is a digraph, and there is no whitespace before
25181 `:'. */
25183 {
25188 }
25190 }
25192 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25193 or none_type otherwise. */
25195 static enum tag_types
25197 {
25199 {
25209 }
25210 }
25212 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25213 or none_type otherwise or if the token is null. */
25215 static enum tag_types
25217 {
25222 {
25230 }
25231 }
25233 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25235 static void
25237 {
25241 {
25245 type))
25248 }
25249 }
25251 /* Issue an error message if DECL is redeclared with different
25252 access than its original declaration [class.access.spec/3].
25253 This applies to nested classes and nested class templates.
25254 [class.mem/1]. */
25256 static void
25258 {
25267 }
25269 /* Look for the `template' keyword, as a syntactic disambiguator.
25270 Return TRUE iff it is present, in which case it will be
25271 consumed. */
25273 static bool
25275 {
25277 {
25278 /* In C++98 the `template' keyword can only be used within templates;
25279 outside templates the parser can always figure out what is a
25280 template and what is not. In C++11, per the resolution of DR 468,
25281 `template' is allowed in cases where it is not strictly necessary. */
25284 {
25287 "in C++98 %<template%> (as a disambiguator) is only "
25289 /* If this part of the token stream is rescanned, the same
25290 error message would be generated. So, we purge the token
25291 from the stream. */
25294 }
25295 else
25296 {
25297 /* Consume the `template' keyword. */
25300 }
25301 }
25303 }
25305 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25306 set PARSER->SCOPE, and perform other related actions. */
25308 static void
25310 {
25316 /* Get the stored value. */
25318 /* Perform any access checks that were deferred. */
25321 {
25326 }
25327 /* Set the scope from the stored value. */
25331 }
25333 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25334 encounter the end of a block before what we were looking for. */
25336 static bool
25340 {
25342 {
25345 /* Abort a parenthesized expression if we encounter a semicolon. */
25349 /* If we've reached the end of the file, stop. */
25355 /* We've hit the end of an enclosing block, so there's been some
25356 kind of syntax error. */
25359 /* Consume the token. */
25361 /* See if it starts a new group. */
25363 {
25365 /* In theory this should probably check end == '}', but
25366 cp_parser_save_member_function_body needs it to exit
25367 after either '}' or ')' when called with ')'. */
25370 }
25372 {
25376 }
25381 }
25382 }
25384 /* Like above, for caching a default argument or NSDMI. Both of these are
25385 terminated by a non-nested comma, but it can be unclear whether or not a
25386 comma is nested in a template argument list unless we do more parsing.
25387 In order to handle this ambiguity, when we encounter a ',' after a '<'
25388 we try to parse what follows as a parameter-declaration-list (in the
25389 case of a default argument) or a member-declarator (in the case of an
25390 NSDMI). If that succeeds, then we stop caching. */
25392 static tree
25394 {
25399 tree default_argument;
25401 /* Add tokens until we have processed the entire default
25402 argument. We add the range [first_token, token). */
25405 {
25406 /* For list-initialization, this is straightforward. */
25409 }
25411 {
25414 /* Peek at the next token. */
25416 /* What we do depends on what token we have. */
25418 {
25419 /* In valid code, a default argument must be
25420 immediately followed by a `,' `)', or `...'. */
25423 {
25424 /* If we've seen a '<', we might be in a
25425 template-argument-list. Until Core issue 325 is
25426 resolved, we don't know how this situation ought
25427 to be handled, so try to DTRT. We check whether
25428 what comes after the comma is a valid parameter
25429 declaration list. If it is, then the comma ends
25430 the default argument; otherwise the default
25431 argument continues. */
25435 /* Set ITALP so cp_parser_parameter_declaration_list
25436 doesn't decide to commit to this parse. */
25443 {
25444 /* Parse declarators until we reach a non-comma or
25445 somthing that cannot be an initializer.
25446 Just checking whether we're looking at a single
25447 declarator is insufficient. Consider:
25448 int var = tuple<T,U>::x;
25449 The template parameter 'U' looks exactly like a
25450 declarator. */
25451 do
25452 {
25463 }
25465 /* If we met an '=' or ';' then the original comma
25466 was the end of the NSDMI. Otherwise assume
25467 we're still in the NSDMI. */
25470 }
25471 else
25472 {
25477 }
25484 }
25487 /* If we run into a non-nested `;', `}', or `]',
25488 then the code is invalid -- but the default
25489 argument is certainly over. */
25494 /* Handle correctly int n = sizeof ... ( p ); */
25497 /* Update DEPTH, if necessary. */
25512 /* This might be the comparison operator, or it might
25513 start a template argument list. */
25520 /* Fall through for C++0x, which treats the `>>'
25521 operator like two `>' tokens in certain
25522 cases. */
25526 {
25527 /* This might be an operator, or it might close a
25528 template argument list. But if a previous '<'
25529 started a template argument list, this will have
25530 closed it, so we can't be in one anymore. */
25534 }
25537 /* If we run out of tokens, issue an error message. */
25546 /* In these cases, we should look for template-ids.
25547 For example, if the default argument is
25548 `X<int, double>()', we need to do name lookup to
25549 figure out whether or not `X' is a template; if
25550 so, the `,' does not end the default argument.
25552 That is not yet done. */
25557 }
25559 /* If we've reached the end, stop. */
25563 /* Add the token to the token block. */
25565 }
25567 /* Create a DEFAULT_ARG to represent the unparsed default
25568 argument. */
25575 }
25577 /* Begin parsing tentatively. We always save tokens while parsing
25578 tentatively so that if the tentative parsing fails we can restore the
25579 tokens. */
25581 static void
25583 {
25584 /* Enter a new parsing context. */
25586 /* Begin saving tokens. */
25588 /* In order to avoid repetitive access control error messages,
25589 access checks are queued up until we are no longer parsing
25590 tentatively. */
25592 }
25594 /* Commit to the currently active tentative parse. */
25596 static void
25598 {
25602 /* Mark all of the levels as committed. */
25605 {
25612 }
25613 }
25615 /* Commit to the topmost currently active tentative parse.
25617 Note that this function shouldn't be called when there are
25618 irreversible side-effects while in a tentative state. For
25619 example, we shouldn't create a permanent entry in the symbol
25620 table, or issue an error message that might not apply if the
25621 tentative parse is aborted. */
25623 static void
25625 {
25630 {
25638 }
25639 }
25641 /* Abort the currently active tentative parse. All consumed tokens
25642 will be rolled back, and no diagnostics will be issued. */
25644 static void
25646 {
25650 /* Now, pretend that we want to see if the construct was
25651 successfully parsed. */
25653 }
25655 /* Stop parsing tentatively. If a parse error has occurred, restore the
25656 token stream. Otherwise, commit to the tokens we have consumed.
25657 Returns true if no error occurred; false otherwise. */
25659 static bool
25661 {
25665 /* Remember whether or not an error occurred, since we are about to
25666 destroy that information. */
25668 /* Remove the topmost context from the stack. */
25671 /* If no parse errors occurred, commit to the tentative parse. */
25673 {
25674 /* Commit to the tokens read tentatively, unless that was
25675 already done. */
25680 }
25681 /* Otherwise, if errors occurred, roll back our state so that things
25682 are just as they were before we began the tentative parse. */
25683 else
25684 {
25687 }
25688 /* Add the context to the front of the free list. */
25693 }
25695 /* Returns true if we are parsing tentatively and are not committed to
25696 this tentative parse. */
25698 static bool
25700 {
25703 }
25705 /* Returns nonzero iff an error has occurred during the most recent
25706 tentative parse. */
25708 static bool
25710 {
25713 }
25715 /* Returns nonzero if GNU extensions are allowed. */
25717 static bool
25719 {
25721 }
25722 \f
25723 /* Objective-C++ Productions */
25726 /* Parse an Objective-C expression, which feeds into a primary-expression
25727 above.
25729 objc-expression:
25730 objc-message-expression
25731 objc-string-literal
25732 objc-encode-expression
25733 objc-protocol-expression
25734 objc-selector-expression
25736 Returns a tree representation of the expression. */
25738 static tree
25740 {
25741 /* Try to figure out what kind of declaration is present. */
25745 {
25755 {
25767 }
25773 }
25776 }
25778 /* Parse an Objective-C message expression.
25780 objc-message-expression:
25781 [ objc-message-receiver objc-message-args ]
25783 Returns a representation of an Objective-C message. */
25785 static tree
25787 {
25796 }
25798 /* Parse an objc-message-receiver.
25800 objc-message-receiver:
25801 expression
25802 simple-type-specifier
25804 Returns a representation of the type or expression. */
25806 static tree
25808 {
25809 tree rcv;
25811 /* An Objective-C message receiver may be either (1) a type
25812 or (2) an expression. */
25816 /* If that worked out, fine. */
25823 CP_PARSER_FLAGS_NONE);
25830 }
25832 /* Parse the arguments and selectors comprising an Objective-C message.
25834 objc-message-args:
25835 objc-selector
25836 objc-selector-args
25837 objc-selector-args , objc-comma-args
25839 objc-selector-args:
25840 objc-selector [opt] : assignment-expression
25841 objc-selector-args objc-selector [opt] : assignment-expression
25843 objc-comma-args:
25844 assignment-expression
25845 objc-comma-args , assignment-expression
25847 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25848 selector arguments and TREE_VALUE containing a list of comma
25849 arguments. */
25851 static tree
25853 {
25859 {
25865 /* Detect if we have a unary selector. */
25874 sel_args
25879 }
25881 /* Handle non-selector arguments, if any. */
25883 {
25884 tree arg;
25889 addl_args
25894 }
25897 {
25900 }
25903 }
25905 /* Parse an Objective-C encode expression.
25907 objc-encode-expression:
25908 @encode objc-typename
25910 Returns an encoded representation of the type argument. */
25912 static tree
25914 {
25915 tree type;
25925 {
25929 }
25931 /* This happens if we find @encode(T) (where T is a template
25932 typename or something dependent on a template typename) when
25933 parsing a template. In that case, we can't compile it
25934 immediately, but we rather create an AT_ENCODE_EXPR which will
25935 need to be instantiated when the template is used.
25936 */
25938 {
25942 }
25945 }
25947 /* Parse an Objective-C @defs expression. */
25949 static tree
25951 {
25952 tree name;
25960 }
25962 /* Parse an Objective-C protocol expression.
25964 objc-protocol-expression:
25965 @protocol ( identifier )
25967 Returns a representation of the protocol expression. */
25969 static tree
25971 {
25972 tree proto;
25980 }
25982 /* Parse an Objective-C selector expression.
25984 objc-selector-expression:
25985 @selector ( objc-method-signature )
25987 objc-method-signature:
25988 objc-selector
25989 objc-selector-seq
25991 objc-selector-seq:
25992 objc-selector :
25993 objc-selector-seq objc-selector :
25995 Returns a representation of the method selector. */
25997 static tree
25999 {
26011 {
26020 {
26021 /* Detect if we have a unary selector. */
26023 {
26026 }
26027 else
26028 {
26030 }
26031 }
26036 {
26037 sel_seq
26040 sel_seq
26043 }
26044 else
26045 sel_seq
26050 }
26052 finish_selector:
26056 }
26058 /* Parse a list of identifiers.
26060 objc-identifier-list:
26061 identifier
26062 objc-identifier-list , identifier
26064 Returns a TREE_LIST of identifier nodes. */
26066 static tree
26068 {
26069 tree identifier;
26070 tree list;
26081 {
26088 identifier));
26090 }
26093 }
26095 /* Parse an Objective-C alias declaration.
26097 objc-alias-declaration:
26098 @compatibility_alias identifier identifier ;
26100 This function registers the alias mapping with the Objective-C front end.
26101 It returns nothing. */
26103 static void
26105 {
26113 }
26115 /* Parse an Objective-C class forward-declaration.
26117 objc-class-declaration:
26118 @class objc-identifier-list ;
26120 The function registers the forward declarations with the Objective-C
26121 front end. It returns nothing. */
26123 static void
26125 {
26128 {
26129 tree id;
26139 else
26141 }
26143 }
26145 /* Parse a list of Objective-C protocol references.
26147 objc-protocol-refs-opt:
26148 objc-protocol-refs [opt]
26150 objc-protocol-refs:
26151 < objc-identifier-list >
26153 Returns a TREE_LIST of identifiers, if any. */
26155 static tree
26157 {
26161 {
26165 }
26168 }
26170 /* Parse a Objective-C visibility specification. */
26172 static void
26174 {
26178 {
26193 }
26195 /* Eat '@private'/'@protected'/'@public'. */
26197 }
26199 /* Parse an Objective-C method type. Return 'true' if it is a class
26200 (+) method, and 'false' if it is an instance (-) method. */
26204 {
26207 else
26209 }
26211 /* Parse an Objective-C protocol qualifier. */
26213 static tree
26215 {
26228 {
26233 }
26236 }
26238 /* Parse an Objective-C typename. */
26240 static tree
26242 {
26246 {
26252 /* An ObjC type name may consist of just protocol qualifiers, in which
26253 case the type shall default to 'id'. */
26255 {
26258 /* If the type could not be parsed, an error has already
26259 been produced. For error recovery, behave as if it had
26260 not been specified, which will use the default type
26261 'id'. */
26263 {
26265 /* We need to skip to the closing parenthesis as
26266 cp_parser_type_id() does not seem to do it for
26267 us. */
26272 }
26273 }
26277 }
26280 }
26282 /* Check to see if TYPE refers to an Objective-C selector name. */
26284 static bool
26286 {
26292 }
26294 /* Parse an Objective-C selector. */
26296 static tree
26298 {
26302 {
26305 }
26307 /* C++ operator names are allowed to appear in ObjC selectors. */
26309 {
26322 }
26323 }
26325 /* Parse an Objective-C params list. */
26327 static tree
26329 {
26335 {
26345 /* Detect if we have a unary selector. */
26348 {
26351 }
26355 {
26356 /* Something went quite wrong. There should be a colon
26357 here, but there is not. Stop parsing parameters. */
26359 }
26361 /* New ObjC allows attributes on parameters too. */
26366 params
26369 type_name,
26370 identifier,
26371 parm_attr));
26374 }
26377 {
26380 }
26382 /* We allow tail attributes for the method. */
26384 {
26392 }
26395 {
26398 }
26400 }
26402 /* Parse the non-keyword Objective-C params. */
26404 static tree
26407 {
26413 {
26415 tree parm;
26421 {
26426 }
26428 /* TODO: parse attributes for tail parameters. */
26437 }
26439 /* We allow tail attributes for the method. */
26441 {
26443 {
26448 }
26449 else
26450 /* We have an error, but parse the attributes, so that we can
26451 carry on. */
26457 }
26460 }
26462 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26464 static void
26466 {
26469 /* If the next token is `extern' and the following token is a string
26470 literal, then we have a linkage specification. */
26472 && cp_parser_is_pure_string_literal
26475 /* Handle #pragma, if any. */
26478 /* Allow stray semicolons. */
26481 /* Mark methods as optional or required, when building protocols. */
26483 {
26486 }
26488 {
26491 }
26494 /* Other stray characters must generate errors. */
26496 {
26500 }
26501 /* Finally, try to parse a block-declaration, or a function-definition. */
26502 else
26504 }
26506 /* Parse a method signature. */
26508 static tree
26510 {
26526 }
26528 static bool
26530 {
26531 tree tattr;
26536 /* If the attributes are followed by a method introducer, this is not allowed.
26537 Dump the attributes and flag the situation. */
26542 /* Otherwise, the attributes introduce some interstitial code, possibly so
26543 rewind to allow that check. */
26546 }
26548 /* Parse an Objective-C method prototype list. */
26550 static void
26552 {
26556 {
26558 {
26563 else
26567 {
26571 }
26574 }
26580 OPT_Wattributes,
26582 else
26583 /* Allow for interspersed non-ObjC++ code. */
26587 }
26591 else
26595 }
26597 /* Parse an Objective-C method definition list. */
26599 static void
26601 {
26605 {
26606 tree meth;
26609 {
26615 else
26620 {
26624 }
26626 NULL_TREE);
26628 /* For historical reasons, we accept an optional semicolon. */
26635 {
26642 }
26643 }
26644 /* The following case will be removed once @synthesize is
26645 completely implemented. */
26656 else
26657 /* Allow for interspersed non-ObjC++ code. */
26661 }
26665 else
26669 }
26671 /* Parse Objective-C ivars. */
26673 static void
26675 {
26686 {
26687 cp_decl_specifier_seq declspecs;
26689 tree prefix_attributes;
26697 CP_PARSER_FLAGS_OPTIONAL,
26701 /* auto, register, static, extern, mutable. */
26703 {
26706 }
26708 /* thread_local. */
26710 {
26713 }
26715 /* typedef. */
26717 {
26720 }
26725 /* Keep going until we hit the `;' at the end of the
26726 declaration. */
26728 {
26733 /* Check for a (possibly unnamed) bitfield declaration. */
26741 {
26742 /* Get the name of the bitfield. */
26745 sfk_none);
26747 eat_colon:
26749 /* Get the width of the bitfield. */
26750 width
26752 }
26753 else
26754 {
26755 /* Parse the declarator. */
26756 declarator
26762 }
26764 /* Look for attributes that apply to the ivar. */
26766 /* Remember which attributes are prefix attributes and
26767 which are not. */
26769 /* Combine the attributes. */
26773 /* Create the bitfield declaration. */
26775 width,
26776 attributes);
26777 else
26782 /* Add the instance variable. */
26786 /* Reset PREFIX_ATTRIBUTES. */
26795 {
26798 }
26800 }
26804 }
26809 /* Do not consume the RID_AT_END, so it will be read again as terminating
26810 the @interface of @implementation. */
26814 /* For historical reasons, we accept an optional semicolon. */
26817 }
26819 /* Parse an Objective-C protocol declaration. */
26821 static void
26823 {
26829 {
26834 }
26836 /* See if we have a forward declaration or a definition. */
26839 /* Try a forward declaration first. */
26841 {
26843 {
26844 tree id;
26854 else
26856 }
26858 }
26860 /* Ok, we got a full-fledged definition (or at least should). */
26861 else
26862 {
26867 }
26868 }
26870 /* Parse an Objective-C superclass or category. */
26872 static void
26877 {
26883 {
26886 }
26888 {
26891 /* If there is no category name, and this is an @interface, we
26892 have a class extension. */
26894 {
26897 }
26898 else
26902 }
26903 }
26905 /* Parse an Objective-C class interface. */
26907 static void
26909 {
26916 {
26917 /* It's hard to recover because even if valid @interface stuff
26918 is to follow, we can't compile it (or validate it) if we
26919 don't even know which class it refers to. Let's assume this
26920 was a stray '@interface' token in the stream and skip it.
26921 */
26923 }
26928 /* We have either a class or a category on our hands. */
26931 else
26932 {
26934 /* Handle instance variable declarations, if any. */
26937 }
26940 }
26942 /* Parse an Objective-C class implementation. */
26944 static void
26946 {
26953 {
26954 /* It's hard to recover because even if valid @implementation
26955 stuff is to follow, we can't compile it (or validate it) if
26956 we don't even know which class it refers to. Let's assume
26957 this was a stray '@implementation' token in the stream and
26958 skip it.
26959 */
26961 }
26965 /* We have either a class or a category on our hands. */
26968 else
26969 {
26971 /* Handle instance variable declarations, if any. */
26974 }
26977 }
26979 /* Consume the @end token and finish off the implementation. */
26981 static void
26983 {
26986 }
26988 /* Parse an Objective-C declaration. */
26990 static void
26992 {
26993 /* Try to figure out what kind of declaration is present. */
26998 {
27014 }
27017 {
27040 }
27041 }
27043 /* Parse an Objective-C try-catch-finally statement.
27045 objc-try-catch-finally-stmt:
27046 @try compound-statement objc-catch-clause-seq [opt]
27047 objc-finally-clause [opt]
27049 objc-catch-clause-seq:
27050 objc-catch-clause objc-catch-clause-seq [opt]
27052 objc-catch-clause:
27053 @catch ( objc-exception-declaration ) compound-statement
27055 objc-finally-clause:
27056 @finally compound-statement
27058 objc-exception-declaration:
27059 parameter-declaration
27060 '...'
27062 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
27064 Returns NULL_TREE.
27066 PS: This function is identical to c_parser_objc_try_catch_finally_statement
27067 for C. Keep them in sync. */
27069 static tree
27071 {
27072 location_t location;
27073 tree stmt;
27078 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
27079 node, lest it get absorbed into the surrounding block. */
27085 {
27094 {
27095 /* We have "@catch (...)" (where the '...' are literally
27096 what is in the code). Skip the '...'.
27097 parameter_declaration is set to NULL_TREE, and
27098 objc_being_catch_clauses() knows that that means
27099 '...'. */
27102 }
27103 else
27104 {
27105 /* We have "@catch (NSException *exception)" or something
27106 like that. Parse the parameter declaration. */
27110 else
27115 }
27118 else
27119 {
27120 /* If there was no open parenthesis, we are recovering from
27121 an error, and we are trying to figure out what mistake
27122 the user has made. */
27124 /* If there is an immediate closing parenthesis, the user
27125 probably forgot the opening one (ie, they typed "@catch
27126 NSException *e)". Parse the closing parenthesis and keep
27127 going. */
27131 /* If these is no immediate closing parenthesis, the user
27132 probably doesn't know that parenthesis are required at
27133 all (ie, they typed "@catch NSException *e"). So, just
27134 forget about the closing parenthesis and keep going. */
27135 }
27139 }
27141 {
27144 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
27145 node, lest it get absorbed into the surrounding block. */
27149 }
27152 }
27154 /* Parse an Objective-C synchronized statement.
27156 objc-synchronized-stmt:
27157 @synchronized ( expression ) compound-statement
27159 Returns NULL_TREE. */
27161 static tree
27163 {
27164 location_t location;
27175 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27176 node, lest it get absorbed into the surrounding block. */
27181 }
27183 /* Parse an Objective-C throw statement.
27185 objc-throw-stmt:
27186 @throw assignment-expression [opt] ;
27188 Returns a constructed '@throw' statement. */
27190 static tree
27192 {
27204 }
27206 /* Parse an Objective-C statement. */
27208 static tree
27210 {
27211 /* Try to figure out what kind of declaration is present. */
27215 {
27226 }
27229 }
27231 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27232 look ahead to see if an objc keyword follows the attributes. This
27233 is to detect the use of prefix attributes on ObjC @interface and
27234 @protocol. */
27236 static bool
27238 {
27243 {
27246 }
27249 }
27251 /* This routine is a minimal replacement for
27252 c_parser_struct_declaration () used when parsing the list of
27253 types/names or ObjC++ properties. For example, when parsing the
27254 code
27256 @property (readonly) int a, b, c;
27258 this function is responsible for parsing "int a, int b, int c" and
27259 returning the declarations as CHAIN of DECLs.
27261 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27262 similar parsing. */
27263 static tree
27265 {
27267 cp_decl_specifier_seq declspecs;
27269 tree prefix_attributes;
27272 CP_PARSER_FLAGS_NONE,
27279 /* auto, register, static, extern, mutable. */
27281 {
27284 }
27286 /* thread_local. */
27288 {
27291 }
27293 /* typedef. */
27295 {
27298 }
27303 /* Keep going until we hit the `;' at the end of the declaration. */
27305 {
27310 /* Parse the declarator. */
27314 /* Look for attributes that apply to the ivar. */
27316 /* Remember which attributes are prefix attributes and
27317 which are not. */
27319 /* Combine the attributes. */
27329 /* Reset PREFIX_ATTRIBUTES. */
27340 {
27343 }
27344 else
27346 }
27348 }
27350 /* Parse an Objective-C @property declaration. The syntax is:
27352 objc-property-declaration:
27353 '@property' objc-property-attributes[opt] struct-declaration ;
27355 objc-property-attributes:
27356 '(' objc-property-attribute-list ')'
27358 objc-property-attribute-list:
27359 objc-property-attribute
27360 objc-property-attribute-list, objc-property-attribute
27362 objc-property-attribute
27363 'getter' = identifier
27364 'setter' = identifier
27365 'readonly'
27366 'readwrite'
27367 'assign'
27368 'retain'
27369 'copy'
27370 'nonatomic'
27372 For example:
27373 @property NSString *name;
27374 @property (readonly) id object;
27375 @property (retain, nonatomic, getter=getTheName) id name;
27376 @property int a, b, c;
27378 PS: This function is identical to
27379 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27380 static void
27382 {
27383 /* The following variables hold the attributes of the properties as
27384 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27385 seen. When we see an attribute, we set them to 'true' (if they
27386 are boolean properties) or to the identifier (if they have an
27387 argument, ie, for getter and setter). Note that here we only
27388 parse the list of attributes, check the syntax and accumulate the
27389 attributes that we find. objc_add_property_declaration() will
27390 then process the information. */
27400 /* 'properties' is the list of properties that we read. Usually a
27401 single one, but maybe more (eg, in "@property int a, b, c;" there
27402 are three). */
27403 tree properties;
27404 location_t loc;
27410 /* Parse the optional attribute list... */
27412 {
27413 /* Eat the '('. */
27417 {
27423 {
27426 }
27430 {
27441 {
27445 else
27450 }
27453 {
27457 }
27459 {
27461 {
27464 }
27465 else
27469 else
27471 }
27472 else
27473 {
27475 {
27478 }
27479 else
27481 }
27487 }
27494 else
27496 }
27498 /* FIXME: "@property (setter, assign);" will generate a spurious
27499 "error: expected ‘)’ before ‘,’ token". This is because
27500 cp_parser_require, unlike the C counterpart, will produce an
27501 error even if we are in error recovery. */
27503 {
27508 }
27509 }
27511 /* ... and the property declaration(s). */
27515 {
27517 /* If the next token is now a `;', consume it. */
27521 }
27525 else
27526 {
27527 /* Comma-separated properties are chained together in
27528 reverse order; add them one by one. */
27537 }
27540 }
27542 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27544 objc-synthesize-declaration:
27545 @synthesize objc-synthesize-identifier-list ;
27547 objc-synthesize-identifier-list:
27548 objc-synthesize-identifier
27549 objc-synthesize-identifier-list, objc-synthesize-identifier
27551 objc-synthesize-identifier
27552 identifier
27553 identifier = identifier
27555 For example:
27556 @synthesize MyProperty;
27557 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27559 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27560 for C. Keep them in sync.
27561 */
27562 static void
27564 {
27566 location_t loc;
27571 {
27575 {
27578 }
27580 {
27584 {
27587 }
27588 }
27589 else
27594 else
27596 }
27599 }
27601 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27603 objc-dynamic-declaration:
27604 @dynamic identifier-list ;
27606 For example:
27607 @dynamic MyProperty;
27608 @dynamic MyProperty, AnotherProperty;
27610 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27611 for C. Keep them in sync.
27612 */
27613 static void
27615 {
27617 location_t loc;
27622 {
27623 tree property;
27626 {
27629 }
27633 else
27635 }
27638 }
27640 \f
27641 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27643 /* Returns name of the next clause.
27644 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27645 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27646 returned and the token is consumed. */
27648 static pragma_omp_clause
27650 {
27664 {
27669 {
27812 }
27813 }
27819 }
27821 /* Validate that a clause of the given type does not already exist. */
27823 static void
27826 {
27827 tree c;
27831 {
27834 }
27835 }
27837 /* OpenMP 2.5:
27838 variable-list:
27839 identifier
27840 variable-list , identifier
27842 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27843 colon). An opening parenthesis will have been consumed by the caller.
27845 If KIND is nonzero, create the appropriate node and install the decl
27846 in OMP_CLAUSE_DECL and add the node to the head of the list.
27848 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27849 return the list created.
27851 COLON can be NULL if only closing parenthesis should end the list,
27852 or pointer to bool which will receive false if the list is terminated
27853 by closing parenthesis or true if the list is terminated by colon. */
27855 static tree
27858 {
27862 {
27865 }
27867 {
27884 {
27886 {
27889 {
27893 }
27894 /* FALL THROUGH. */
27900 {
27908 parser->colon_corrects_to_scope_p
27912 else
27913 {
27914 /* Look for `:'. */
27918 CPP_CLOSE_SQUARE))
27920 }
27921 /* Look for the closing `]'. */
27923 RT_CLOSE_SQUARE))
27927 {
27930 {
27934 }
27938 {
27942 }
27943 }
27946 }
27950 }
27956 }
27957 else
27960 get_comma:
27964 }
27970 {
27974 }
27977 {
27980 /* Try to resync to an unnested comma. Copied from
27981 cp_parser_parenthesized_expression_list. */
27982 skip_comma:
27991 }
27994 }
27996 /* Similarly, but expect leading and trailing parenthesis. This is a very
27997 common case for omp clauses. */
27999 static tree
28001 {
28005 }
28007 /* OpenACC 2.0:
28008 copy ( variable-list )
28009 copyin ( variable-list )
28010 copyout ( variable-list )
28011 create ( variable-list )
28012 delete ( variable-list )
28013 present ( variable-list )
28014 present_or_copy ( variable-list )
28015 pcopy ( variable-list )
28016 present_or_copyin ( variable-list )
28017 pcopyin ( variable-list )
28018 present_or_copyout ( variable-list )
28019 pcopyout ( variable-list )
28020 present_or_create ( variable-list )
28021 pcreate ( variable-list ) */
28023 static tree
28025 tree list)
28026 {
28029 {
28069 }
28077 }
28079 /* OpenACC 2.0:
28080 deviceptr ( variable-list ) */
28082 static tree
28084 {
28088 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
28089 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
28090 variable-list must only allow for pointer variables. */
28093 {
28096 /* FIXME diagnostics: Ideally we should keep individual
28097 locations for all the variables in the var list to make the
28098 following errors more precise. Perhaps
28099 c_parser_omp_var_list_parens should construct a list of
28100 locations to go along with the var list. */
28105 ;
28114 }
28117 }
28119 /* OpenACC:
28120 vector_length ( expression ) */
28122 static tree
28124 {
28134 {
28137 }
28140 {
28145 }
28148 location);
28156 }
28158 /* OpenACC 2.0
28159 Parse wait clause or directive parameters. */
28161 static tree
28163 {
28173 {
28178 }
28185 {
28189 {
28192 else
28193 {
28200 }
28201 }
28202 }
28205 }
28207 /* OpenACC:
28208 wait ( int-expr-list ) */
28210 static tree
28212 {
28221 }
28223 /* OpenMP 3.0:
28224 collapse ( constant-expression ) */
28226 static tree
28228 {
28230 location_t loc;
28231 HOST_WIDE_INT n;
28251 {
28254 }
28262 }
28264 /* OpenMP 2.5:
28265 default ( shared | none ) */
28267 static tree
28269 {
28271 tree c;
28276 {
28281 {
28296 }
28299 }
28300 else
28301 {
28302 invalid_kind:
28304 }
28320 }
28322 /* OpenMP 3.1:
28323 final ( expression ) */
28325 static tree
28327 {
28348 }
28350 /* OpenMP 2.5:
28351 if ( expression ) */
28353 static tree
28355 {
28376 }
28378 /* OpenMP 3.1:
28379 mergeable */
28381 static tree
28384 {
28385 tree c;
28388 location);
28393 }
28395 /* OpenMP 2.5:
28396 nowait */
28398 static tree
28401 {
28402 tree c;
28409 }
28411 /* OpenACC:
28412 num_gangs ( expression ) */
28414 static tree
28416 {
28432 {
28435 }
28445 }
28447 /* OpenMP 2.5:
28448 num_threads ( expression ) */
28450 static tree
28452 location_t location)
28453 {
28475 }
28477 /* OpenACC:
28478 num_workers ( expression ) */
28480 static tree
28482 {
28498 {
28501 }
28504 location);
28512 }
28514 /* OpenMP 2.5:
28515 ordered */
28517 static tree
28520 {
28521 tree c;
28529 }
28531 /* OpenMP 2.5:
28532 reduction ( reduction-operator : variable-list )
28534 reduction-operator:
28535 One of: + * - & ^ | && ||
28537 OpenMP 3.1:
28539 reduction-operator:
28540 One of: + * - & ^ | && || min max
28542 OpenMP 4.0:
28544 reduction-operator:
28545 One of: + * - & ^ | && ||
28546 id-expression */
28548 static tree
28550 {
28558 {
28568 }
28572 else
28573 {
28584 {
28614 }
28615 else
28616 {
28618 resync_fail:
28623 }
28624 }
28630 NULL);
28632 {
28635 }
28638 }
28640 /* OpenMP 2.5:
28641 schedule ( schedule-kind )
28642 schedule ( schedule-kind , expression )
28644 schedule-kind:
28645 static | dynamic | guided | runtime | auto */
28647 static tree
28649 {
28658 {
28663 {
28684 }
28685 }
28690 else
28695 {
28710 else
28715 }
28723 invalid_kind:
28725 resync_fail:
28730 }
28732 /* OpenMP 3.0:
28733 untied */
28735 static tree
28738 {
28739 tree c;
28746 }
28748 /* OpenMP 4.0:
28749 inbranch
28750 notinbranch */
28752 static tree
28755 {
28760 }
28762 /* OpenMP 4.0:
28763 parallel
28764 for
28765 sections
28766 taskgroup */
28768 static tree
28772 {
28776 }
28778 /* OpenMP 4.0:
28779 num_teams ( expression ) */
28781 static tree
28783 location_t location)
28784 {
28806 }
28808 /* OpenMP 4.0:
28809 thread_limit ( expression ) */
28811 static tree
28813 location_t location)
28814 {
28836 }
28838 /* OpenMP 4.0:
28839 aligned ( variable-list )
28840 aligned ( variable-list : constant-expression ) */
28842 static tree
28844 {
28855 {
28865 }
28871 }
28873 /* OpenMP 4.0:
28874 linear ( variable-list )
28875 linear ( variable-list : expression ) */
28877 static tree
28880 {
28891 {
28895 {
28898 }
28906 }
28912 }
28914 /* OpenMP 4.0:
28915 safelen ( constant-expression ) */
28917 static tree
28919 location_t location)
28920 {
28941 }
28943 /* OpenMP 4.0:
28944 simdlen ( constant-expression ) */
28946 static tree
28948 location_t location)
28949 {
28970 }
28972 /* OpenMP 4.0:
28973 depend ( depend-kind : variable-list )
28975 depend-kind:
28976 in | out | inout */
28978 static tree
28980 {
28988 {
28998 else
29000 }
29001 else
29009 NULL);
29016 invalid_kind:
29018 resync_fail:
29023 }
29025 /* OpenMP 4.0:
29026 map ( map-kind : variable-list )
29027 map ( variable-list )
29029 map-kind:
29030 alloc | to | from | tofrom */
29032 static tree
29034 {
29043 {
29055 else
29056 {
29062 }
29065 }
29068 NULL);
29074 }
29076 /* OpenMP 4.0:
29077 device ( expression ) */
29079 static tree
29081 location_t location)
29082 {
29104 }
29106 /* OpenMP 4.0:
29107 dist_schedule ( static )
29108 dist_schedule ( static , expression ) */
29110 static tree
29112 location_t location)
29113 {
29126 {
29137 }
29142 location);
29146 invalid_kind:
29148 resync_fail:
29153 }
29155 /* OpenMP 4.0:
29156 proc_bind ( proc-bind-kind )
29158 proc-bind-kind:
29159 master | close | spread */
29161 static tree
29163 location_t location)
29164 {
29165 tree c;
29172 {
29182 else
29184 }
29185 else
29194 location);
29199 invalid_kind:
29201 resync_fail:
29206 }
29208 /* OpenACC:
29209 async [( int-expr )] */
29211 static tree
29213 {
29220 {
29229 }
29239 }
29241 /* Parse all OpenACC clauses. The set clauses allowed by the directive
29242 is a bitmask in MASK. Return the list of clauses found. */
29244 static tree
29248 {
29253 {
29254 location_t here;
29255 pragma_omp_clause c_kind;
29266 {
29358 }
29363 {
29364 /* Remove the invalid clause(s) from the list to avoid
29365 confusing the rest of the compiler. */
29368 }
29369 }
29371 saw_error:
29378 }
29380 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29381 is a bitmask in MASK. Return the list of clauses found; the result
29382 of clause default goes in *pdefault. */
29384 static tree
29388 {
29395 {
29396 pragma_omp_clause c_kind;
29407 {
29419 clauses);
29433 clauses);
29442 clauses);
29466 clauses);
29480 clauses);
29497 OMP_CLAUSE_NOTINBRANCH,
29506 {
29507 clause_not_first:
29511 }
29536 clauses);
29541 clauses);
29546 clauses);
29609 }
29614 {
29615 /* Remove the invalid clause(s) from the list to avoid
29616 confusing the rest of the compiler. */
29619 }
29620 }
29621 saw_error:
29622 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29623 no reason to skip to the end. */
29629 }
29631 /* OpenMP 2.5:
29632 structured-block:
29633 statement
29635 In practice, we're also interested in adding the statement to an
29636 outer node. So it is convenient if we work around the fact that
29637 cp_parser_statement calls add_stmt. */
29639 static unsigned
29641 {
29644 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29645 This preserves the "not within loop or switch" style error messages
29646 for nonsense cases like
29647 void foo() {
29648 #pragma omp single
29649 break;
29650 }
29651 */
29656 }
29658 static void
29660 {
29662 }
29664 static tree
29666 {
29674 }
29676 /* OpenMP 2.5:
29677 # pragma omp atomic new-line
29678 expression-stmt
29680 expression-stmt:
29681 x binop= expr | x++ | ++x | x-- | --x
29682 binop:
29683 +, *, -, /, &, ^, |, <<, >>
29685 where x is an lvalue expression with scalar type.
29687 OpenMP 3.1:
29688 # pragma omp atomic new-line
29689 update-stmt
29691 # pragma omp atomic read new-line
29692 read-stmt
29694 # pragma omp atomic write new-line
29695 write-stmt
29697 # pragma omp atomic update new-line
29698 update-stmt
29700 # pragma omp atomic capture new-line
29701 capture-stmt
29703 # pragma omp atomic capture new-line
29704 capture-block
29706 read-stmt:
29707 v = x
29708 write-stmt:
29709 x = expr
29710 update-stmt:
29711 expression-stmt | x = x binop expr
29712 capture-stmt:
29713 v = expression-stmt
29714 capture-block:
29715 { v = x; update-stmt; } | { update-stmt; v = x; }
29717 OpenMP 4.0:
29718 update-stmt:
29719 expression-stmt | x = x binop expr | x = expr binop x
29720 capture-stmt:
29721 v = update-stmt
29722 capture-block:
29723 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29725 where x and v are lvalue expressions with scalar type. */
29727 static void
29729 {
29737 {
29742 {
29748 }
29749 }
29751 {
29763 else
29767 }
29769 {
29775 {
29780 {
29783 }
29784 }
29785 }
29789 {
29799 else
29804 {
29805 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29806 opcode. */
29811 }
29815 {
29818 }
29819 else
29820 {
29826 }
29829 }
29831 restart:
29835 {
29842 /* FALLTHROUGH */
29852 /* FALLTHROUGH */
29867 /* Undo effects of boolean_increment for post {in,de}crement. */
29869 /* FALLTHRU */
29873 {
29874 /* Undo effects of boolean_increment. */
29876 {
29877 /* This is pre or post increment. */
29882 && !structured_block
29886 }
29887 }
29888 /* FALLTHRU */
29891 {
29926 {
29930 }
29933 {
29939 {
29944 }
29946 {
29958 {
29960 {
29965 }
29966 else
29968 }
29972 }
29975 {
29982 }
29986 }
29990 {
29993 {
30001 }
30003 {
30008 }
30043 }
30054 /* FALLTHROUGH */
30059 }
30066 }
30067 stmt_done:
30069 {
30080 }
30082 {
30085 }
30086 done:
30092 saw_error:
30095 {
30099 {
30103 }
30104 }
30105 }
30108 /* OpenMP 2.5:
30109 # pragma omp barrier new-line */
30111 static void
30113 {
30116 }
30118 /* OpenMP 2.5:
30119 # pragma omp critical [(name)] new-line
30120 structured-block */
30122 static tree
30124 {
30128 {
30140 }
30145 }
30147 /* OpenMP 2.5:
30148 # pragma omp flush flush-vars[opt] new-line
30150 flush-vars:
30151 ( variable-list ) */
30153 static void
30155 {
30161 }
30163 /* Helper function, to parse omp for increment expression. */
30165 static tree
30167 {
30172 {
30175 }
30178 {
30187 /* Fall through: OpenMP disallows NE_EXPR. */
30190 }
30192 /* If decl is an iterator, preserve LHS and RHS of the relational
30193 expr until finish_omp_for. */
30203 }
30205 /* Helper function, to parse omp for increment expression. */
30207 static tree
30209 {
30213 cp_id_kind idk;
30217 {
30225 }
30233 {
30238 }
30245 {
30249 }
30261 do
30262 {
30269 {
30271 {
30274 else
30276 tf_warning_or_error);
30277 }
30278 else
30281 }
30282 }
30286 {
30290 }
30291 else
30295 }
30297 /* Parse the initialization statement of either an OpenMP for loop or
30298 a Cilk Plus for loop.
30300 Return true if the resulting construct should have an
30301 OMP_CLAUSE_PRIVATE added to it. */
30303 static bool
30311 {
30317 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
30319 init-expr:
30320 var = lb
30321 integer-type var = lb
30322 random-access-iterator-type var = lb
30323 pointer-type var = lb
30324 */
30325 cp_decl_specifier_seq type_specifiers;
30327 /* First, try to parse as an initialized declaration. See
30328 cp_parser_condition, from whence the bulk of this is copied. */
30335 {
30336 /* If parsing a type specifier seq succeeded, then this
30337 MUST be a initialized declaration. */
30342 CP_PARSER_DECLARATOR_NAMED,
30353 else
30354 {
30364 {
30366 CPP_OPEN_PAREN))
30367 {
30371 else
30374 }
30375 else
30376 /* Trigger an error. */
30381 }
30385 {
30393 {
30396 auto_node);
30401 }
30404 asm_specification,
30405 LOOKUP_ONLYCONVERTING);
30407 {
30410 }
30411 else
30414 }
30415 else
30416 {
30417 /* Consume '='. */
30421 non_class:
30424 else
30427 asm_specification,
30428 LOOKUP_ONLYCONVERTING);
30429 }
30433 }
30434 }
30435 else
30436 {
30437 cp_id_kind idk;
30438 /* If parsing a type specifier sequence failed, then
30439 this MUST be a simple expression. */
30447 && decl
30450 {
30451 tree rhs;
30458 rhs,
30459 tf_warning_or_error));
30461 }
30462 else
30463 {
30468 {
30472 }
30473 }
30474 }
30476 }
30478 /* Parse the restricted form of the for statement allowed by OpenMP. */
30480 static tree
30483 {
30487 location_t loc_first;
30506 {
30509 location_t loc;
30513 {
30516 }
30519 {
30522 }
30531 add_private_clause
30538 {
30541 {
30547 }
30548 else
30550 }
30557 {
30562 {
30566 }
30569 {
30570 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
30574 {
30577 }
30578 else
30579 {
30582 }
30584 }
30585 else
30586 {
30591 }
30592 }
30595 {
30596 tree c;
30598 {
30607 decl);
30611 decl);
30612 }
30614 {
30619 {
30622 }
30623 }
30624 }
30633 {
30634 /* If decl is an iterator, preserve the operator on decl
30635 until finish_omp_for. */
30637 && ((processing_template_decl
30641 else
30645 }
30660 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30661 in between the collapsed for loops to be still considered perfectly
30662 nested. Hopefully the final version clarifies this.
30663 For now handle (multiple) {'s and empty statements. */
30665 do
30666 {
30670 {
30672 bracecount++;
30673 }
30677 else
30678 {
30685 }
30686 }
30690 {
30693 }
30694 }
30696 /* Note that we saved the original contents of this flag when we entered
30697 the structured block, and so we don't need to re-save it here. */
30700 else
30703 /* Note that the grammar doesn't call for a structured block here,
30704 though the loop as a whole is a structured block. */
30711 else
30716 {
30718 {
30720 nbraces--;
30721 }
30724 else
30725 {
30727 {
30730 }
30735 }
30736 }
30743 }
30745 /* Helper function for OpenMP parsing, split clauses and call
30746 finish_omp_clauses on each of the set of clauses afterwards. */
30748 static void
30751 {
30757 }
30759 /* OpenMP 4.0:
30760 #pragma omp simd simd-clause[optseq] new-line
30761 for-loop */
30763 #define OMP_SIMD_CLAUSE_MASK \
30764 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30765 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30766 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30767 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30768 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30769 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30772 static tree
30775 {
30787 {
30790 }
30801 }
30803 /* OpenMP 2.5:
30804 #pragma omp for for-clause[optseq] new-line
30805 for-loop
30807 OpenMP 4.0:
30808 #pragma omp for simd for-simd-clause[optseq] new-line
30809 for-loop */
30811 #define OMP_FOR_CLAUSE_MASK \
30812 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30821 static tree
30824 {
30835 {
30840 {
30848 cclauses);
30852 cclauses);
30864 }
30865 }
30867 {
30870 }
30875 {
30878 }
30889 }
30891 /* OpenMP 2.5:
30892 # pragma omp master new-line
30893 structured-block */
30895 static tree
30897 {
30901 }
30903 /* OpenMP 2.5:
30904 # pragma omp ordered new-line
30905 structured-block */
30907 static tree
30909 {
30913 }
30915 /* OpenMP 2.5:
30917 section-scope:
30918 { section-sequence }
30920 section-sequence:
30921 section-directive[opt] structured-block
30922 section-sequence section-directive structured-block */
30924 static tree
30926 {
30937 {
30941 }
30944 {
30952 {
30956 }
30958 {
30961 }
30966 }
30977 }
30979 /* OpenMP 2.5:
30980 # pragma omp sections sections-clause[optseq] newline
30981 sections-scope */
30983 #define OMP_SECTIONS_CLAUSE_MASK \
30984 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30985 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30986 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30987 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30988 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30990 static tree
30993 {
31005 {
31008 }
31015 }
31017 /* OpenMP 2.5:
31018 # pragma omp parallel parallel-clause[optseq] new-line
31019 structured-block
31020 # pragma omp parallel for parallel-for-clause[optseq] new-line
31021 structured-block
31022 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
31023 structured-block
31025 OpenMP 4.0:
31026 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
31027 structured-block */
31029 #define OMP_PARALLEL_CLAUSE_MASK \
31030 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31031 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31032 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31033 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31034 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31035 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31036 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
31038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
31040 static tree
31043 {
31052 {
31065 block);
31070 }
31072 {
31076 }
31078 {
31081 }
31083 {
31087 {
31097 block);
31100 }
31101 }
31111 }
31113 /* OpenMP 2.5:
31114 # pragma omp single single-clause[optseq] new-line
31115 structured-block */
31117 #define OMP_SINGLE_CLAUSE_MASK \
31118 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
31121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
31123 static tree
31125 {
31135 }
31137 /* OpenMP 3.0:
31138 # pragma omp task task-clause[optseq] new-line
31139 structured-block */
31141 #define OMP_TASK_CLAUSE_MASK \
31142 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31143 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
31144 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31145 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31146 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31147 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31148 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
31149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
31150 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
31152 static tree
31154 {
31165 }
31167 /* OpenMP 3.0:
31168 # pragma omp taskwait new-line */
31170 static void
31172 {
31175 }
31177 /* OpenMP 3.1:
31178 # pragma omp taskyield new-line */
31180 static void
31182 {
31185 }
31187 /* OpenMP 4.0:
31188 # pragma omp taskgroup new-line
31189 structured-block */
31191 static tree
31193 {
31197 }
31200 /* OpenMP 2.5:
31201 # pragma omp threadprivate (variable-list) */
31203 static void
31205 {
31206 tree vars;
31212 }
31214 /* OpenMP 4.0:
31215 # pragma omp cancel cancel-clause[optseq] new-line */
31217 #define OMP_CANCEL_CLAUSE_MASK \
31218 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31219 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31220 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31221 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
31222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31224 static void
31226 {
31230 }
31232 /* OpenMP 4.0:
31233 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
31235 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
31236 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31237 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31238 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31239 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
31241 static void
31243 {
31244 tree clauses;
31248 {
31253 {
31256 }
31257 }
31259 {
31263 }
31266 OMP_CANCELLATION_POINT_CLAUSE_MASK,
31268 pragma_tok);
31270 }
31272 /* OpenMP 4.0:
31273 #pragma omp distribute distribute-clause[optseq] new-line
31274 for-loop */
31276 #define OMP_DISTRIBUTE_CLAUSE_MASK \
31277 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31278 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31279 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
31280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31282 static tree
31285 {
31294 {
31302 else
31305 {
31311 {
31314 cclauses);
31315 else
31317 cclauses);
31318 }
31323 cclauses);
31324 else
31326 cclauses);
31338 }
31339 }
31341 {
31344 }
31349 {
31352 }
31363 }
31365 /* OpenMP 4.0:
31366 # pragma omp teams teams-clause[optseq] new-line
31367 structured-block */
31369 #define OMP_TEAMS_CLAUSE_MASK \
31370 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31371 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31372 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31373 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31374 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31375 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31378 static tree
31381 {
31390 {
31394 {
31402 cclauses);
31406 cclauses);
31418 }
31419 }
31421 {
31424 }
31429 {
31432 }
31440 }
31442 /* OpenMP 4.0:
31443 # pragma omp target data target-data-clause[optseq] new-line
31444 structured-block */
31446 #define OMP_TARGET_DATA_CLAUSE_MASK \
31447 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31448 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31449 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31451 static tree
31453 {
31465 }
31467 /* OpenMP 4.0:
31468 # pragma omp target update target-update-clause[optseq] new-line */
31470 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31471 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31473 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31474 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31476 static bool
31479 {
31481 {
31483 "%<#pragma omp target update%> may only be "
31487 }
31489 tree clauses
31494 {
31496 "%<#pragma omp target update%> must contain at least one "
31499 }
31507 }
31509 /* OpenMP 4.0:
31510 # pragma omp target target-clause[optseq] new-line
31511 structured-block */
31513 #define OMP_TARGET_CLAUSE_MASK \
31514 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31515 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31518 static bool
31521 {
31523 {
31527 }
31530 {
31535 {
31543 {
31545 OMP_TARGET_CLAUSE_MASK,
31546 cclauses);
31548 }
31564 }
31566 {
31569 }
31571 {
31575 }
31577 {
31580 }
31581 }
31595 }
31597 /* OpenACC 2.0:
31598 # pragma acc cache (variable-list) new-line
31599 */
31601 static tree
31603 {
31618 }
31620 /* OpenACC 2.0:
31621 # pragma acc data oacc-data-clause[optseq] new-line
31622 structured-block */
31624 #define OACC_DATA_CLAUSE_MASK \
31625 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31627 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31628 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31629 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31630 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31631 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31632 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31633 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31634 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31635 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
31637 static tree
31639 {
31652 }
31654 /* OpenACC 2.0:
31655 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
31657 or
31659 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
31661 LOC is the location of the #pragma token.
31662 */
31664 #define OACC_ENTER_DATA_CLAUSE_MASK \
31665 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31666 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31667 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31668 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31669 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31670 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31671 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31673 #define OACC_EXIT_DATA_CLAUSE_MASK \
31674 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31675 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31676 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31677 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
31678 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31680 static tree
31683 {
31688 {
31694 }
31699 {
31703 }
31710 else
31715 {
31719 }
31727 }
31729 /* OpenACC 2.0:
31730 # pragma acc kernels oacc-kernels-clause[optseq] new-line
31731 structured-block */
31733 #define OACC_KERNELS_CLAUSE_MASK \
31734 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31735 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31736 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31737 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31738 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31739 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31740 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31741 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31742 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31743 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31748 static tree
31750 {
31763 }
31765 /* OpenACC 2.0:
31766 # pragma acc loop oacc-loop-clause[optseq] new-line
31767 structured-block */
31769 #define OACC_LOOP_CLAUSE_MASK \
31770 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
31771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION))
31773 static tree
31775 {
31788 }
31790 /* OpenACC 2.0:
31791 # pragma acc parallel oacc-parallel-clause[optseq] new-line
31792 structured-block */
31794 #define OACC_PARALLEL_CLAUSE_MASK \
31795 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31800 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31801 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31802 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
31803 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
31804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31805 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31806 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
31810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
31811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31813 static tree
31815 {
31828 }
31830 /* OpenACC 2.0:
31831 # pragma acc update oacc-update-clause[optseq] new-line
31832 */
31834 #define OACC_UPDATE_CLAUSE_MASK \
31835 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
31837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
31838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
31840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31842 static tree
31844 {
31851 {
31853 "%<#pragma acc update%> must contain at least one "
31856 }
31864 }
31866 /* OpenACC 2.0:
31867 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
31869 LOC is the location of the #pragma token.
31870 */
31872 #define OACC_WAIT_CLAUSE_MASK \
31873 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
31875 static tree
31877 {
31890 }
31892 /* OpenMP 4.0:
31893 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
31895 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
31896 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31897 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31898 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31899 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
31900 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
31901 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
31903 static void
31906 {
31908 cp_omp_declare_simd_data data;
31910 {
31915 }
31926 {
31930 {
31943 }
31948 "%<#pragma omp declare simd%> not immediately followed by "
31952 }
31953 }
31955 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
31956 This function is modelled similar to the late parsing of omp declare
31957 simd. */
31959 static tree
31961 {
31967 {
31973 }
31975 {
31979 }
31984 {
31991 NULL);
32005 }
32010 }
32012 /* Finalize #pragma omp declare simd clauses after direct declarator has
32013 been parsed, and put that into "omp declare simd" attribute. */
32015 static tree
32017 {
32023 {
32028 }
32033 {
32051 }
32055 }
32058 /* OpenMP 4.0:
32059 # pragma omp declare target new-line
32060 declarations and definitions
32061 # pragma omp end declare target new-line */
32063 static void
32065 {
32068 }
32070 static void
32072 {
32075 {
32078 }
32080 {
32084 {
32087 }
32090 else
32091 {
32095 }
32096 }
32097 else
32098 {
32102 }
32106 "%<#pragma omp end declare target%> without corresponding "
32108 else
32110 }
32112 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
32113 expression and optional initializer clause of
32114 #pragma omp declare reduction. We store the expression(s) as
32115 either 3, 6 or 7 special statements inside of the artificial function's
32116 body. The first two statements are DECL_EXPRs for the artificial
32117 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
32118 expression that uses those variables.
32119 If there was any INITIALIZER clause, this is followed by further statements,
32120 the fourth and fifth statements are DECL_EXPRs for the artificial
32121 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
32122 constructor variant (first token after open paren is not omp_priv),
32123 then the sixth statement is a statement with the function call expression
32124 that uses the OMP_PRIV and optionally OMP_ORIG variable.
32125 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
32126 to initialize the OMP_PRIV artificial variable and there is seventh
32127 statement, a DECL_EXPR of the OMP_PRIV statement again. */
32129 static bool
32131 {
32143 tree combiner;
32158 {
32161 }
32164 {
32171 {
32174 }
32190 {
32194 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
32198 == CPP_CLOSE_PAREN
32201 {
32205 }
32210 }
32211 else
32212 {
32228 {
32233 }
32235 tree arg;
32248 }
32259 }
32265 }
32267 /* OpenMP 4.0
32268 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32269 initializer-clause[opt] new-line
32271 initializer-clause:
32272 initializer (omp_priv initializer)
32273 initializer (function-name (argument-list)) */
32275 static void
32278 {
32288 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
32295 {
32327 }
32339 /* Types may not be defined in declare reduction type list. */
32342 parser->type_definition_forbidden_message
32348 saved_colon_doesnt_start_class_def_p
32353 {
32357 ;
32378 else
32383 else
32385 }
32387 /* Restore the saved message. */
32390 parser->colon_doesnt_start_class_def_p
32395 {
32396 fail:
32399 }
32405 {
32406 tree fntype
32409 NULL_TREE);
32428 {
32433 }
32435 {
32437 {
32446 }
32453 }
32454 else
32455 {
32458 }
32461 else
32464 {
32467 }
32469 {
32472 else
32477 }
32482 else
32483 {
32492 }
32499 }
32503 done:
32504 /* Free any declarators allocated. */
32506 }
32508 /* OpenMP 4.0
32509 #pragma omp declare simd declare-simd-clauses[optseq] new-line
32510 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32511 initializer-clause[opt] new-line
32512 #pragma omp declare target new-line */
32514 static void
32517 {
32519 {
32524 {
32527 context);
32529 }
32532 {
32535 context);
32537 }
32539 {
32542 }
32544 {
32548 }
32549 }
32553 }
32555 /* Main entry point to OpenMP statement pragmas. */
32557 static void
32559 {
32560 tree stmt;
32565 {
32640 }
32644 }
32645 \f
32646 /* Transactional Memory parsing routines. */
32648 /* Parse a transaction attribute.
32650 txn-attribute:
32651 attribute
32652 [ [ identifier ] ]
32654 ??? Simplify this when C++0x bracket attributes are
32655 implemented properly. */
32657 static tree
32659 {
32674 {
32678 /* For keywords, use the canonical spelling,
32679 not the parsed identifier. */
32683 }
32684 else
32688 error1:
32691 }
32693 /* Parse a __transaction_atomic or __transaction_relaxed statement.
32695 transaction-statement:
32696 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
32697 compound-statement
32698 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
32699 */
32701 static tree
32703 {
32718 else
32719 {
32723 }
32725 /* Parse a noexcept specification. */
32728 /* Keep track if we're in the lexical scope of an outer transaction. */
32740 }
32742 /* Parse a __transaction_atomic or __transaction_relaxed expression.
32744 transaction-expression:
32745 __transaction_atomic txn-noexcept-spec[opt] ( expression )
32746 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
32747 */
32749 static tree
32751 {
32776 /* Set this early. This might mean that we allow transaction_cancel in
32777 an expression that we find out later actually has to be a constexpr.
32778 However, we expect that cxx_constant_value will be able to deal with
32779 this; also, if the noexcept has no constexpr, then what we parse next
32780 really is a transaction's body. */
32783 /* Parse a noexcept specification. */
32789 {
32796 }
32797 else
32798 {
32799 /* The only expression that is available got parsed for the noexcept
32800 already. noexcept is true then. */
32803 }
32812 }
32814 /* Parse a function-transaction-block.
32816 function-transaction-block:
32817 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
32818 function-body
32819 __transaction_atomic txn-attribute[opt] function-try-block
32820 __transaction_relaxed ctor-initializer[opt] function-body
32821 __transaction_relaxed function-try-block
32822 */
32824 static bool
32826 {
32842 else
32843 {
32847 }
32855 else
32856 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
32864 }
32866 /* Parse a __transaction_cancel statement.
32868 cancel-statement:
32869 __transaction_cancel txn-attribute[opt] ;
32870 __transaction_cancel txn-attribute[opt] throw-expression ;
32872 ??? Cancel and throw is not yet implemented. */
32874 static tree
32876 {
32882 RT_TRANSACTION_CANCEL);
32889 /* ??? Parse cancel-and-throw here. */
32894 {
32898 }
32900 {
32904 }
32906 {
32909 {
32915 }
32916 }
32918 {
32922 }
32928 }
32929 \f
32930 /* The parser. */
32934 \f
32935 /* Special handling for the first token or line in the file. The first
32936 thing in the file might be #pragma GCC pch_preprocess, which loads a
32937 PCH file, which is a GC collection point. So we need to handle this
32938 first pragma without benefit of an existing lexer structure.
32940 Always returns one token to the caller in *FIRST_TOKEN. This is
32941 either the true first token of the file, or the first token after
32942 the initial pragma. */
32944 static void
32946 {
32955 {
32962 }
32963 else
32966 /* Skip to the end of the pragma. */
32970 /* Now actually load the PCH file. */
32974 /* Read one more token to return to our caller. We have to do this
32975 after reading the PCH file in, since its pointers have to be
32976 live. */
32978 }
32980 /* Parses the grainsize pragma for the _Cilk_for statement.
32981 Syntax:
32982 #pragma cilk grainsize = <VALUE>. */
32984 static void
32986 {
32988 {
32993 {
32996 }
32998 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
33001 else
33003 "%<#pragma cilk grainsize%> is not followed by "
33006 }
33008 }
33010 /* Normal parsing of a pragma token. Here we can (and must) use the
33011 regular lexer. */
33013 static bool
33015 {
33027 {
33035 {
33045 }
33050 {
33060 }
33065 {
33071 "%<#pragma omp taskwait%> may only be "
33076 }
33081 {
33087 "%<#pragma omp taskyield%> may only be "
33092 }
33097 {
33103 "%<#pragma omp cancel%> may only be "
33108 }
33113 {
33119 "%<#pragma omp cancellation point%> may only be "
33124 }
33171 "%<#pragma omp section%> may only be used in "
33176 {
33178 {
33182 }
33189 {
33192 }
33195 }
33199 {
33203 }
33209 {
33213 }
33215 /* Ignore the pragma if Cilk Plus is not enabled. */
33217 {
33220 }
33221 else
33222 {
33226 }
33233 bad_stmt:
33236 }
33240 }
33242 /* The interface the pragma parsers have to the lexer. */
33244 enum cpp_ttype
33246 {
33259 else
33260 {
33264 }
33267 }
33269 \f
33270 /* External interface. */
33272 /* Parse one entire translation unit. */
33274 void
33276 {
33289 }
33291 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
33292 vectorlength clause:
33293 Syntax:
33294 vectorlength ( constant-expression ) */
33296 static tree
33299 {
33301 tree expr;
33302 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
33303 safelen clause. Thus, vectorlength is represented as OMP 4.0
33304 safelen. For SIMD-enabled function it is represented by OMP 4.0
33305 simdlen. */
33308 loc);
33309 else
33311 loc);
33319 /* If expr == error_mark_node, then don't emit any errors nor
33320 create a clause. if any of the above functions returns
33321 error mark node then they would have emitted an error message. */
33323 ;
33331 else
33332 {
33333 tree c;
33335 {
33340 }
33341 else
33342 {
33347 }
33348 }
33353 }
33355 /* Handles the Cilk Plus #pragma simd linear clause.
33356 Syntax:
33357 linear ( simd-linear-variable-list )
33359 simd-linear-variable-list:
33360 simd-linear-variable
33361 simd-linear-variable-list , simd-linear-variable
33363 simd-linear-variable:
33364 id-expression
33365 id-expression : simd-linear-step
33367 simd-linear-step:
33368 conditional-expression */
33370 static tree
33372 {
33378 {
33382 }
33387 {
33390 {
33394 }
33401 {
33405 }
33406 else
33407 {
33411 /* If present, parse the linear step. Otherwise, assume the default
33412 value of 1. */
33414 {
33421 {
33422 /* If an error has occurred, then the whole pragma is
33423 considered ill-formed. Thus, no reason to keep
33424 parsing. */
33427 }
33435 else
33437 "step size must be an integer constant "
33439 }
33441 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
33447 }
33452 else
33453 {
33458 }
33459 }
33463 }
33465 /* Returns the name of the next clause. If the clause is not
33466 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
33467 token is not consumed. Otherwise, the appropriate enum from the
33468 pragma_simd_clause is returned and the token is consumed. */
33470 static pragma_omp_clause
33472 {
33473 pragma_omp_clause clause_type;
33490 else
33495 }
33497 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
33499 static tree
33501 {
33506 {
33507 pragma_omp_clause c_kind;
33514 /* Use the OpenMP 4.0 equivalent function. */
33517 /* Use the OpenMP 4.0 equivalent function. */
33519 clauses);
33521 /* Use the OMP 4.0 equivalent function. */
33523 clauses);
33525 /* Use the OMP 4.0 equivalent function. */
33527 else
33528 {
33532 }
33533 }
33539 else
33541 }
33543 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
33545 static void
33547 {
33554 {
33558 }
33567 }
33569 /* Main entry-point for parsing Cilk Plus _Cilk_for
33570 loops. The return value is error_mark_node
33571 when errors happen and CILK_FOR tree on success. */
33573 static tree
33575 {
33590 else
33596 }
33598 /* Create an identifier for a generic parameter type (a synthesized
33599 template parameter implied by `auto' or a concept identifier). */
33602 static tree
33604 {
33608 }
33610 /* Predicate that behaves as is_auto_or_concept but matches the parent
33611 node of the generic type rather than the generic type itself. This
33612 allows for type transformation in add_implicit_template_parms. */
33616 {
33618 }
33620 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
33621 (creating a new template parameter list if necessary). Returns the newly
33622 created template type parm. */
33624 tree
33626 {
33629 /* We are either continuing a function template that already contains implicit
33630 template parameters, creating a new fully-implicit function template, or
33631 extending an existing explicit function template with implicit template
33632 parameters. */
33640 {
33644 }
33645 else
33646 {
33647 /* Roll back to the existing template parameter scope (in the case of
33648 extending an explicit function template) or introduce a new template
33649 parameter scope ahead of the function parameter scope (or class scope
33650 in the case of out-of-line member definitions). The function scope is
33651 added back after template parameter synthesis below. */
33656 {
33659 }
33661 {
33662 /* If not defining a class, then any class scope is a scope level in
33663 an out-of-line member definition. In this case simply wind back
33664 beyond the first such scope to inject the template parameter list.
33665 Otherwise wind back to the class being defined. The latter can
33666 occur in class member friend declarations such as:
33668 class A {
33669 void foo (auto);
33670 };
33671 class B {
33672 friend void A::foo (auto);
33673 };
33675 The template parameter list synthesized for the friend declaration
33676 must be injected in the scope of 'B'. This can also occur in
33677 erroneous cases such as:
33679 struct A {
33680 struct B {
33681 void foo (auto);
33682 };
33683 void B::foo (auto) {}
33684 };
33686 Here the attempted definition of 'B::foo' within 'A' is ill-formed
33687 but, nevertheless, the template parameter list synthesized for the
33688 declarator should be injected into the scope of 'A' as if the
33689 ill-formed template was specified explicitly. */
33692 {
33695 }
33696 }
33702 {
33703 /* Introduce a new template parameter list for implicit template
33704 parameters. */
33708 parser->implicit_template_scope
33715 }
33716 else
33717 {
33718 /* Synthesize implicit template parameters at the end of the explicit
33719 template parameter list. */
33726 parser->implicit_template_parms
33728 }
33729 }
33731 /* Synthesize a new template parameter and track the current template
33732 parameter chain with implicit_template_parms. */
33736 synth_id);
33737 tree new_parm
33739 input_location,
33746 parser->implicit_template_parms
33748 else
33753 /* If creating a fully implicit function template, start the new implicit
33754 template parameter list with this synthesized type, otherwise grow the
33755 current template parameter list. */
33758 {
33765 }
33766 else
33767 {
33772 }
33777 }
33779 /* Finish the declaration of a fully implicit function template. Such a
33780 template has no explicit template parameter list so has not been through the
33781 normal template head and tail processing. synthesize_implicit_template_parm
33782 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33783 provided if the declaration is a class member such that its template
33784 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33785 form is returned. Otherwise NULL_TREE is returned. */
33787 tree
33789 {
33794 {
33798 }
33808 }