| blob | 920cb61ee06d698f08bb68d228ef57bc63b975ef |
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. If we're parsing
5166 tentatively, fail and try something else. */
5168 {
5171 }
5172 /* Otherwise, accept it and check for a match at instantiation
5173 time. */
5178 }
5179 }
5180 /* If an error occurred, assume that the name of the
5181 destructor is the same as the name of the qualifying
5182 class. That allows us to keep parsing after running
5183 into ill-formed destructor names. */
5189 /* Check that destructor name and scope match. */
5191 {
5198 }
5200 /* [class.dtor]
5202 A typedef-name that names a class shall not be used as the
5203 identifier in the declarator for a destructor declaration. */
5210 type_decl);
5213 }
5217 {
5218 tree id;
5220 /* This could be a template-id, so we try that first. */
5222 /* Try a template-id. */
5225 none_type,
5226 declarator_p);
5227 /* If that worked, we're done. */
5230 /* We still don't know whether we're looking at an
5231 operator-function-id or a conversion-function-id. */
5233 /* Try an operator-function-id. */
5235 /* If that didn't work, try a conversion-function-id. */
5239 {
5240 /* 17.6.3.3.5 */
5246 }
5249 }
5250 /* Fall through. */
5257 }
5258 }
5260 /* Parse an (optional) nested-name-specifier.
5262 nested-name-specifier: [C++98]
5263 class-or-namespace-name :: nested-name-specifier [opt]
5264 class-or-namespace-name :: template nested-name-specifier [opt]
5266 nested-name-specifier: [C++0x]
5267 type-name ::
5268 namespace-name ::
5269 nested-name-specifier identifier ::
5270 nested-name-specifier template [opt] simple-template-id ::
5272 PARSER->SCOPE should be set appropriately before this function is
5273 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5274 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5275 in name lookups.
5277 Sets PARSER->SCOPE to the class (TYPE) or namespace
5278 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5279 it unchanged if there is no nested-name-specifier. Returns the new
5280 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5282 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5283 part of a declaration and/or decl-specifier. */
5285 static tree
5291 {
5296 /* Remember where the nested-name-specifier starts. */
5298 {
5301 }
5304 {
5305 tree new_scope;
5306 tree old_scope;
5307 tree saved_qualifying_scope;
5310 /* Spot cases that cannot be the beginning of a
5311 nested-name-specifier. */
5314 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5315 the already parsed nested-name-specifier. */
5317 {
5318 /* Grab the nested-name-specifier and continue the loop. */
5320 /* If we originally encountered this nested-name-specifier
5321 with IS_DECLARATION set to false, we will not have
5322 resolved TYPENAME_TYPEs, so we must do so here. */
5325 {
5330 }
5333 }
5335 /* Spot cases that cannot be the beginning of a
5336 nested-name-specifier. On the second and subsequent times
5337 through the loop, we look for the `template' keyword. */
5339 ;
5340 /* A template-id can start a nested-name-specifier. */
5342 ;
5343 /* DR 743: decltype can be used in a nested-name-specifier. */
5345 ;
5346 else
5347 {
5348 /* If the next token is not an identifier, then it is
5349 definitely not a type-name or namespace-name. */
5352 /* If the following token is neither a `<' (to begin a
5353 template-id), nor a `::', then we are not looking at a
5354 nested-name-specifier. */
5360 {
5364 }
5367 && !cp_parser_nth_token_starts_template_argument_list_p
5370 }
5372 /* The nested-name-specifier is optional, so we parse
5373 tentatively. */
5376 /* Look for the optional `template' keyword, if this isn't the
5377 first time through the loop. */
5380 else
5383 /* Save the old scope since the name lookup we are about to do
5384 might destroy it. */
5387 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5388 look up names in "X<T>::I" in order to determine that "Y" is
5389 a template. So, if we have a typename at this point, we make
5390 an effort to look through it. */
5392 && !typename_keyword_p
5397 /* Parse the qualifying entity. */
5398 new_scope
5400 typename_keyword_p,
5401 template_keyword_p,
5402 check_dependency_p,
5403 type_p,
5404 is_declaration);
5405 /* Look for the `::' token. */
5408 /* If we found what we wanted, we keep going; otherwise, we're
5409 done. */
5411 {
5414 /* Restore the OLD_SCOPE since it was valid before the
5415 failed attempt at finding the last
5416 class-or-namespace-name. */
5420 /* If the next token is a decltype, and the one after that is a
5421 `::', then the decltype has failed to resolve to a class or
5422 enumeration type. Give this error even when parsing
5423 tentatively since it can't possibly be valid--and we're going
5424 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5425 won't get another chance.*/
5429 {
5436 /* As below. */
5439 }
5443 {
5444 /* If we have a non-type template-id followed by ::, it can't
5445 possibly be valid. */
5450 {
5453 {
5459 }
5460 else
5461 {
5462 /* Variable template. */
5467 }
5474 /* As below. */
5478 }
5479 }
5483 /* If the next token is an identifier, and the one after
5484 that is a `::', then any valid interpretation would have
5485 found a class-or-namespace-name. */
5491 {
5494 {
5496 {
5497 tree decl;
5498 tree ambiguous_decls;
5501 none_type,
5510 decl);
5512 {
5513 // cp_parser_lookup_name has the same diagnostic,
5514 // thus make sure to emit it at most once.
5517 {
5522 }
5524 }
5525 else
5526 {
5528 cp_parser_name_lookup_error
5531 else
5532 cp_parser_name_lookup_error
5535 }
5536 }
5539 /* Treat this as a successful nested-name-specifier
5540 due to:
5542 [basic.lookup.qual]
5544 If the name found is not a class-name (clause
5545 _class_) or namespace-name (_namespace.def_), the
5546 program is ill-formed. */
5548 }
5550 }
5552 }
5553 /* We've found one valid nested-name-specifier. */
5555 /* Name lookup always gives us a DECL. */
5558 /* Uses of "template" must be followed by actual templates. */
5570 new_scope);
5571 /* If it is a class scope, try to complete it; we are about to
5572 be looking up names inside the class. */
5574 /* Since checking types for dependency can be expensive,
5575 avoid doing it if the type is already complete. */
5577 /* Do not try to complete dependent types. */
5579 {
5581 /* If it is a typedef to current class, use the current
5582 class instead, as the typedef won't have any names inside
5583 it yet. */
5587 }
5588 /* Make sure we look in the right scope the next time through
5589 the loop. */
5591 }
5593 /* If parsing tentatively, replace the sequence of tokens that makes
5594 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5595 token. That way, should we re-parse the token stream, we will
5596 not have to repeat the effort required to do the parse, nor will
5597 we issue duplicate error messages. */
5599 {
5603 /* Reset the contents of the START token. */
5605 /* Retrieve any deferred checks. Do not pop this access checks yet
5606 so the memory will not be reclaimed during token replacing below. */
5614 /* Purge all subsequent tokens. */
5616 }
5622 }
5624 /* Parse a nested-name-specifier. See
5625 cp_parser_nested_name_specifier_opt for details. This function
5626 behaves identically, except that it will an issue an error if no
5627 nested-name-specifier is present. */
5629 static tree
5635 {
5636 tree scope;
5638 /* Look for the nested-name-specifier. */
5640 typename_keyword_p,
5641 check_dependency_p,
5642 type_p,
5643 is_declaration);
5644 /* If it was not present, issue an error message. */
5646 {
5649 }
5652 }
5654 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5655 this is either a class-name or a namespace-name (which corresponds
5656 to the class-or-namespace-name production in the grammar). For
5657 C++0x, it can also be a type-name that refers to an enumeration
5658 type or a simple-template-id.
5660 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5661 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5662 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5663 TYPE_P is TRUE iff the next name should be taken as a class-name,
5664 even the same name is declared to be another entity in the same
5665 scope.
5667 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5668 specified by the class-or-namespace-name. If neither is found the
5669 ERROR_MARK_NODE is returned. */
5671 static tree
5678 {
5679 tree saved_scope;
5680 tree saved_qualifying_scope;
5681 tree saved_object_scope;
5682 tree scope;
5686 /* DR 743: decltype can appear in a nested-name-specifier. */
5688 {
5692 {
5695 }
5699 }
5701 /* Before we try to parse the class-name, we must save away the
5702 current PARSER->SCOPE since cp_parser_class_name will destroy
5703 it. */
5707 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5708 there is no need to look for a namespace-name. */
5709 only_class_p = template_keyword_p
5714 typename_keyword_p,
5715 template_keyword_p,
5717 check_dependency_p,
5719 is_declaration,
5722 /* If that didn't work, try for a namespace-name. */
5724 {
5725 /* Restore the saved scope. */
5729 /* If we are not looking at an identifier followed by the scope
5730 resolution operator, then this is not part of a
5731 nested-name-specifier. (Note that this function is only used
5732 to parse the components of a nested-name-specifier.) */
5737 }
5740 }
5742 /* Return true if we are looking at a compound-literal, false otherwise. */
5744 static bool
5746 {
5747 /* Consume the `('. */
5752 /* Skip tokens until the next token is a closing parenthesis.
5753 If we find the closing `)', and the next token is a `{', then
5754 we are looking at a compound-literal. */
5755 bool compound_literal_p
5760 /* Roll back the tokens we skipped. */
5764 }
5766 /* Parse a postfix-expression.
5768 postfix-expression:
5769 primary-expression
5770 postfix-expression [ expression ]
5771 postfix-expression ( expression-list [opt] )
5772 simple-type-specifier ( expression-list [opt] )
5773 typename :: [opt] nested-name-specifier identifier
5774 ( expression-list [opt] )
5775 typename :: [opt] nested-name-specifier template [opt] template-id
5776 ( expression-list [opt] )
5777 postfix-expression . template [opt] id-expression
5778 postfix-expression -> template [opt] id-expression
5779 postfix-expression . pseudo-destructor-name
5780 postfix-expression -> pseudo-destructor-name
5781 postfix-expression ++
5782 postfix-expression --
5783 dynamic_cast < type-id > ( expression )
5784 static_cast < type-id > ( expression )
5785 reinterpret_cast < type-id > ( expression )
5786 const_cast < type-id > ( expression )
5787 typeid ( expression )
5788 typeid ( type-id )
5790 GNU Extension:
5792 postfix-expression:
5793 ( type-id ) { initializer-list , [opt] }
5795 This extension is a GNU version of the C99 compound-literal
5796 construct. (The C99 grammar uses `type-name' instead of `type-id',
5797 but they are essentially the same concept.)
5799 If ADDRESS_P is true, the postfix expression is the operand of the
5800 `&' operator. CAST_P is true if this expression is the target of a
5801 cast.
5803 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5804 class member access expressions [expr.ref].
5806 Returns a representation of the expression. */
5808 static tree
5812 {
5814 location_t loc;
5821 /* Peek at the next token. */
5824 /* Some of the productions are determined by keywords. */
5827 {
5832 {
5833 tree type;
5834 tree expression;
5838 /* All of these can be handled in the same way from the point
5839 of view of parsing. Begin by consuming the token
5840 identifying the cast. */
5843 /* New types cannot be defined in the cast. */
5845 parser->type_definition_forbidden_message
5848 /* Look for the opening `<'. */
5850 /* Parse the type to which we are casting. */
5855 /* Look for the closing `>'. */
5857 /* Restore the old message. */
5860 bool saved_greater_than_is_operator_p
5864 /* And the expression which is being cast. */
5869 parser->greater_than_is_operator_p
5872 /* Only type conversions to integral or enumeration types
5873 can be used in constant-expressions. */
5879 {
5881 postfix_expression
5885 postfix_expression
5889 postfix_expression
5891 tf_warning_or_error);
5894 postfix_expression
5899 }
5900 }
5904 {
5905 tree type;
5909 /* Consume the `typeid' token. */
5911 /* Look for the `(' token. */
5913 /* Types cannot be defined in a `typeid' expression. */
5915 parser->type_definition_forbidden_message
5917 /* We can't be sure yet whether we're looking at a type-id or an
5918 expression. */
5920 /* Try a type-id first. */
5925 /* Look for the `)' token. Otherwise, we can't be sure that
5926 we're not looking at an expression: consider `typeid (int
5927 (3))', for example. */
5929 /* If all went well, simply lookup the type-id. */
5932 /* Otherwise, fall back to the expression variant. */
5933 else
5934 {
5935 tree expression;
5937 /* Look for an expression. */
5939 /* Compute its typeid. */
5941 /* Look for the `)' token. */
5943 }
5944 /* Restore the saved message. */
5946 /* `typeid' may not appear in an integral constant expression. */
5949 }
5953 {
5954 tree type;
5955 /* The syntax permitted here is the same permitted for an
5956 elaborated-type-specifier. */
5961 }
5965 {
5969 {
5974 }
5976 {
5981 }
5982 else
5983 {
5984 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5987 }
5989 postfix_expression =
5993 {
5997 }
5999 {
6004 }
6005 else
6006 {
6008 postfix_expression);
6012 }
6014 }
6017 {
6020 tree p;
6034 tf_warning_or_error);
6037 tf_warning_or_error);
6038 else
6039 {
6043 }
6045 }
6048 {
6049 tree type;
6051 /* If the next thing is a simple-type-specifier, we may be
6052 looking at a functional cast. We could also be looking at
6053 an id-expression. So, we try the functional cast, and if
6054 that doesn't work we fall back to the primary-expression. */
6056 /* Look for the simple-type-specifier. */
6059 CP_PARSER_FLAGS_NONE);
6060 /* Parse the cast itself. */
6062 postfix_expression
6064 /* If that worked, we're done. */
6068 /* If the functional-cast didn't work out, try a
6069 compound-literal. */
6072 {
6077 /* Avoid calling cp_parser_type_id pointlessly, see comment
6078 in cp_parser_cast_expression about c++/29234. */
6081 else
6082 {
6083 /* Parse the type. */
6088 /* Look for the `)'. */
6090 }
6092 /* If things aren't going well, there's no need to
6093 keep going. */
6095 {
6097 /* Parse the brace-enclosed initializer list. */
6100 }
6101 /* If that worked, we're definitely looking at a
6102 compound-literal expression. */
6104 {
6105 /* Warn the user that a compound literal is not
6106 allowed in standard C++. */
6109 /* For simplicity, we disallow compound literals in
6110 constant-expressions. We could
6111 allow compound literals of integer type, whose
6112 initializer was a constant, in constant
6113 expressions. Permitting that usage, as a further
6114 extension, would not change the meaning of any
6115 currently accepted programs. (Of course, as
6116 compound literals are not part of ISO C++, the
6117 standard has nothing to say.) */
6119 NIC_NCC))
6120 {
6123 }
6124 /* Form the representation of the compound-literal. */
6125 postfix_expression
6127 tf_warning_or_error);
6129 }
6130 }
6132 /* It must be a primary-expression. */
6133 postfix_expression
6136 decltype_p,
6138 }
6140 }
6142 /* Note that we don't need to worry about calling build_cplus_new on a
6143 class-valued CALL_EXPR in decltype when it isn't the end of the
6144 postfix-expression; unary_complex_lvalue will take care of that for
6145 all these cases. */
6147 /* Keep looping until the postfix-expression is complete. */
6149 {
6153 /* It is not a Koenig lookup function call. */
6154 postfix_expression
6157 /* Peek at the next token. */
6161 {
6164 {
6166 "two consecutive %<[%> shall "
6169 }
6170 postfix_expression
6172 postfix_expression,
6174 decltype_p);
6180 /* postfix-expression ( expression-list [opt] ) */
6181 {
6191 is_builtin_constant_p
6194 {
6195 /* The whole point of __builtin_constant_p is to allow
6196 non-constant expressions to appear as arguments. */
6197 saved_integral_constant_expression_p
6199 saved_non_integral_constant_expression_p
6202 }
6203 args = (cp_parser_parenthesized_expression_list
6209 {
6210 parser->integral_constant_expression_p
6212 parser->non_integral_constant_expression_p
6214 }
6217 {
6220 }
6222 /* Function calls are not permitted in
6223 constant-expressions. */
6226 NIC_FUNC_CALL))
6227 {
6231 }
6236 {
6238 {
6240 {
6243 postfix_expression
6245 complain);
6246 }
6247 else
6248 postfix_expression
6250 }
6251 /* We do not perform argument-dependent lookup if
6252 normal lookup finds a non-function, in accordance
6253 with the expected resolution of DR 218. */
6256 {
6260 /* Do not do argument dependent lookup if regular
6261 lookup finds a member function or a block-scope
6262 function declaration. [basic.lookup.argdep]/3 */
6265 {
6268 postfix_expression
6270 complain);
6271 }
6272 }
6273 }
6276 {
6286 "%<memset%> used with constant zero length "
6287 "parameter; this could be due to transposed "
6290 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6291 to avoid leaking those into folder and middle-end. */
6293 tree arg;
6297 }
6300 {
6310 {
6311 postfix_expression
6315 }
6318 {
6319 postfix_expression
6320 = (build_new_method_call
6326 complain));
6327 }
6328 else
6329 postfix_expression
6333 complain);
6334 }
6338 postfix_expression = (build_offset_ref_call_from_tree
6340 complain));
6342 /* A call to a static class member, or a namespace-scope
6343 function. */
6344 postfix_expression
6347 koenig_p,
6348 complain);
6349 else
6350 /* All other function calls. */
6351 postfix_expression
6354 koenig_p,
6355 complain);
6359 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6363 }
6368 /* postfix-expression . template [opt] id-expression
6369 postfix-expression . pseudo-destructor-name
6370 postfix-expression -> template [opt] id-expression
6371 postfix-expression -> pseudo-destructor-name */
6373 /* Consume the `.' or `->' operator. */
6376 postfix_expression
6378 postfix_expression,
6385 /* postfix-expression ++ */
6386 /* Consume the `++' token. */
6388 /* Generate a representation for the complete expression. */
6389 postfix_expression
6391 POSTINCREMENT_EXPR);
6392 /* Increments may not appear in constant-expressions. */
6400 /* postfix-expression -- */
6401 /* Consume the `--' token. */
6403 /* Generate a representation for the complete expression. */
6404 postfix_expression
6406 POSTDECREMENT_EXPR);
6407 /* Decrements may not appear in constant-expressions. */
6419 else
6421 }
6422 }
6424 /* We should never get here. */
6427 }
6429 /* This function parses Cilk Plus array notations. If a normal array expr. is
6430 parsed then the array index is passed back to the caller through *INIT_INDEX
6431 and the function returns a NULL_TREE. If array notation expr. is parsed,
6432 then *INIT_INDEX is ignored by the caller and the function returns
6433 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6434 error_mark_node. */
6436 static tree
6438 tree array_value)
6439 {
6443 {
6446 }
6455 {
6458 }
6460 {
6461 /* Consume the ':'. */
6464 /* If we are here, then we have a case like this A[:]. */
6466 {
6470 }
6474 }
6475 else
6476 {
6477 /* If we are here, then there are three valid possibilities:
6478 1. ARRAY [ EXP ]
6479 2. ARRAY [ EXP : EXP ]
6480 3. ARRAY [ EXP : EXP : EXP ] */
6484 {
6485 /* This indicates that we have a normal array expression. */
6488 }
6490 /* Consume the ':'. */
6494 {
6497 }
6498 }
6503 {
6507 }
6513 }
6515 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6516 by cp_parser_builtin_offsetof. We're looking for
6518 postfix-expression [ expression ]
6519 postfix-expression [ braced-init-list ] (C++11)
6521 FOR_OFFSETOF is set if we're being called in that context, which
6522 changes how we deal with integer constant expressions. */
6524 static tree
6526 tree postfix_expression,
6529 {
6534 /* Consume the `[' token. */
6540 /* Parse the index expression. */
6541 /* ??? For offsetof, there is a question of what to allow here. If
6542 offsetof is not being used in an integral constant expression context,
6543 then we *could* get the right answer by computing the value at runtime.
6544 If we are in an integral constant expression context, then we might
6545 could accept any constant expression; hard to say without analysis.
6546 Rather than open the barn door too wide right away, allow only integer
6547 constant expressions here. */
6550 else
6551 {
6553 {
6560 {
6562 "braced list index is not allowed with array "
6566 }
6567 }
6569 {
6570 /* Here are have these two options:
6571 ARRAY[EXP : EXP] - Array notation expr with default
6572 stride of 1.
6573 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6574 stride. */
6576 postfix_expression);
6579 }
6580 else
6582 }
6586 /* Look for the closing `]'. */
6589 /* Build the ARRAY_REF. */
6593 /* When not doing offsetof, array references are not permitted in
6594 constant-expressions. */
6600 }
6602 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6603 by cp_parser_builtin_offsetof. We're looking for
6605 postfix-expression . template [opt] id-expression
6606 postfix-expression . pseudo-destructor-name
6607 postfix-expression -> template [opt] id-expression
6608 postfix-expression -> pseudo-destructor-name
6610 FOR_OFFSETOF is set if we're being called in that context. That sorta
6611 limits what of the above we'll actually accept, but nevermind.
6612 TOKEN_TYPE is the "." or "->" token, which will already have been
6613 removed from the stream. */
6615 static tree
6618 tree postfix_expression,
6620 location_t location)
6621 {
6622 tree name;
6627 /* If this is a `->' operator, dereference the pointer. */
6630 tf_warning_or_error);
6631 /* Check to see whether or not the expression is type-dependent. */
6633 /* The identifier following the `->' or `.' is not qualified. */
6639 /* Enter the scope corresponding to the type of the object
6640 given by the POSTFIX_EXPRESSION. */
6642 {
6644 /* According to the standard, no expression should ever have
6645 reference type. Unfortunately, we do not currently match
6646 the standard in this respect in that our internal representation
6647 of an expression may have reference type even when the standard
6648 says it does not. Therefore, we have to manually obtain the
6649 underlying type here. */
6651 /* The type of the POSTFIX_EXPRESSION must be complete. */
6653 {
6655 postfix_expression);
6657 }
6658 /* Unlike the object expression in other contexts, *this is not
6659 required to be of complete type for purposes of class member
6660 access (5.2.5) outside the member function body. */
6664 /* Let the name lookup machinery know that we are processing a
6665 class member access expression. */
6667 /* If something went wrong, we want to be able to discern that case,
6668 as opposed to the case where there was no SCOPE due to the type
6669 of expression being dependent. */
6672 /* If the SCOPE was erroneous, make the various semantic analysis
6673 functions exit quickly -- and without issuing additional error
6674 messages. */
6677 }
6679 /* Assume this expression is not a pseudo-destructor access. */
6682 /* If the SCOPE is a scalar type, then, if this is a valid program,
6683 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6684 is type dependent, it can be pseudo-destructor-name or something else.
6685 Try to parse it as pseudo-destructor-name first. */
6687 {
6688 tree s;
6689 tree type;
6692 /* Parse the pseudo-destructor-name. */
6701 {
6703 postfix_expression
6706 }
6707 }
6710 {
6711 /* If the SCOPE is not a scalar type, we are looking at an
6712 ordinary class member access expression, rather than a
6713 pseudo-destructor-name. */
6716 /* Parse the id-expression. */
6717 name = (cp_parser_id_expression
6724 /* In general, build a SCOPE_REF if the member name is qualified.
6725 However, if the name was not dependent and has already been
6726 resolved; there is no need to build the SCOPE_REF. For example;
6728 struct X { void f(); };
6729 template <typename T> void f(T* t) { t->X::f(); }
6731 Even though "t" is dependent, "X::f" is not and has been resolved
6732 to a BASELINK; there is no need to include scope information. */
6734 /* But we do need to remember that there was an explicit scope for
6735 virtual function calls. */
6739 /* If the name is a template-id that names a type, we will get a
6740 TYPE_DECL here. That is invalid code. */
6742 {
6745 }
6746 else
6747 {
6749 {
6751 {
6755 }
6756 else
6759 name,
6760 template_p);
6764 }
6766 adjust_result_of_qualified_name_lookup
6768 postfix_expression
6770 template_p,
6771 tf_warning_or_error);
6772 }
6773 }
6775 /* We no longer need to look up names in the scope of the object on
6776 the left-hand side of the `.' or `->' operator. */
6779 /* Outside of offsetof, these operators may not appear in
6780 constant-expressions. */
6782 && (cp_parser_non_integral_constant_expression
6787 }
6789 /* Cache of LITERAL_ZERO_P constants. */
6793 /* Parse a parenthesized expression-list.
6795 expression-list:
6796 assignment-expression
6797 expression-list, assignment-expression
6799 attribute-list:
6800 expression-list
6801 identifier
6802 identifier, expression-list
6804 CAST_P is true if this expression is the target of a cast.
6806 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6807 argument pack.
6809 Returns a vector of trees. Each element is a representation of an
6810 assignment-expression. NULL is returned if the ( and or ) are
6811 missing. An empty, but allocated, vector is returned on no
6812 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6813 if we are parsing an attribute list for an attribute that wants a
6814 plain identifier argument, normal_attr for an attribute that wants
6815 an expression, or non_attr if we aren't parsing an attribute list. If
6816 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6817 not all of the expressions in the list were constant.
6818 WANT_LITERAL_ZERO_P is true if the caller is interested in
6819 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6820 immediately, this can be removed. */
6829 {
6835 /* Assume all the expressions will be constant. */
6844 /* Within a parenthesized expression, a `>' token is always
6845 the greater-than operator. */
6846 saved_greater_than_is_operator_p
6850 /* Consume expressions until there are no more. */
6853 {
6854 tree expr;
6856 /* At the beginning of attribute lists, check to see if the
6857 next token is an identifier. */
6860 {
6863 /* Consume the identifier. */
6865 /* Save the identifier. */
6867 }
6868 else
6869 {
6872 /* Parse the next assignment-expression. */
6874 {
6875 /* A braced-init-list. */
6881 }
6883 {
6884 expr = (cp_parser_constant_expression
6889 }
6890 else
6891 {
6895 {
6902 /* If a parameter is literal zero alone, remember it
6903 for -Wmemset-transposed-args warning. */
6906 && want_literal_zero_p
6908 == CPP_COMMA
6911 {
6918 else
6919 {
6924 }
6925 /* Consume the 0 token (or '\0', 0LL etc.). */
6927 }
6931 }
6934 cast_p);
6935 }
6940 /* If we have an ellipsis, then this is an expression
6941 expansion. */
6944 {
6945 /* Consume the `...'. */
6948 /* Build the argument pack. */
6950 }
6952 /* Add it to the list. We add error_mark_node
6953 expressions to the list, so that we can still tell if
6954 the correct form for a parenthesized expression-list
6955 is found. That gives better errors. */
6960 }
6962 /* After the first item, attribute lists look the same as
6963 expression lists. */
6966 get_comma:;
6967 /* If the next token isn't a `,', then we are done. */
6971 /* Otherwise, consume the `,' and keep going. */
6973 }
6976 {
6979 skip_comma:;
6980 /* We try and resync to an unnested comma, as that will give the
6981 user better diagnostics. */
6989 {
6990 parser->greater_than_is_operator_p
6993 }
6994 }
6996 parser->greater_than_is_operator_p
7003 }
7005 /* Parse a pseudo-destructor-name.
7007 pseudo-destructor-name:
7008 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7009 :: [opt] nested-name-specifier template template-id :: ~ type-name
7010 :: [opt] nested-name-specifier [opt] ~ type-name
7012 If either of the first two productions is used, sets *SCOPE to the
7013 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7014 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7015 or ERROR_MARK_NODE if the parse fails. */
7017 static void
7019 tree object,
7022 {
7025 /* Handle ~auto. */
7029 {
7032 "%<~auto%> only available with "
7039 }
7041 /* Assume that things will not work out. */
7044 /* Look for the optional `::' operator. */
7046 /* Look for the optional nested-name-specifier. */
7047 nested_name_specifier_p
7054 /* Now, if we saw a nested-name-specifier, we might be doing the
7055 second production. */
7058 {
7059 /* Consume the `template' keyword. */
7061 /* Parse the template-id. */
7065 class_type,
7067 /* Look for the `::' token. */
7069 }
7070 /* If the next token is not a `~', then there might be some
7071 additional qualification. */
7073 {
7074 /* At this point, we're looking for "type-name :: ~". The type-name
7075 must not be a class-name, since this is a pseudo-destructor. So,
7076 it must be either an enum-name, or a typedef-name -- both of which
7077 are just identifiers. So, we peek ahead to check that the "::"
7078 and "~" tokens are present; if they are not, then we can avoid
7079 calling type_name. */
7083 {
7086 }
7088 /* Look for the type-name. */
7093 /* Look for the `::' token. */
7095 }
7096 else
7099 /* Look for the `~'. */
7102 /* Once we see the ~, this has to be a pseudo-destructor. */
7106 /* Look for the type-name again. We are not responsible for
7107 checking that it matches the first type-name. */
7109 }
7111 /* Parse a unary-expression.
7113 unary-expression:
7114 postfix-expression
7115 ++ cast-expression
7116 -- cast-expression
7117 unary-operator cast-expression
7118 sizeof unary-expression
7119 sizeof ( type-id )
7120 alignof ( type-id ) [C++0x]
7121 new-expression
7122 delete-expression
7124 GNU Extensions:
7126 unary-expression:
7127 __extension__ cast-expression
7128 __alignof__ unary-expression
7129 __alignof__ ( type-id )
7130 alignof unary-expression [C++0x]
7131 __real__ cast-expression
7132 __imag__ cast-expression
7133 && identifier
7134 sizeof ( type-id ) { initializer-list , [opt] }
7135 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7136 __alignof__ ( type-id ) { initializer-list , [opt] }
7138 ADDRESS_P is true iff the unary-expression is appearing as the
7139 operand of the `&' operator. CAST_P is true if this expression is
7140 the target of a cast.
7142 Returns a representation of the expression. */
7144 static tree
7147 {
7151 /* Peek at the next token. */
7153 /* Some keywords give away the kind of expression. */
7155 {
7159 {
7162 {
7165 location_t first_loc;
7168 /* Consume the token. */
7171 /* Parse the operand. */
7176 else
7177 {
7178 /* ISO C++ defines alignof only with types, not with
7179 expressions. So pedwarn if alignof is used with a non-
7180 type expression. However, __alignof__ is ok. */
7183 "ISO C++ does not allow %<alignof%> "
7187 }
7188 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7189 SIZEOF_EXPR with the original operand. */
7191 {
7193 {
7195 {
7198 error_mark_node));
7200 }
7201 else
7205 }
7207 }
7209 }
7218 {
7219 /* The saved value of the PEDANTIC flag. */
7221 tree expr;
7223 /* Save away the PEDANTIC flag. */
7225 /* Parse the cast-expression. */
7227 /* Restore the PEDANTIC flag. */
7231 }
7235 {
7236 tree expression;
7238 /* Consume the `__real__' or `__imag__' token. */
7240 /* Parse the cast-expression. */
7242 /* Create the complete representation. */
7246 expression,
7247 tf_warning_or_error);
7248 }
7256 {
7257 tree expr;
7267 parser->type_definition_forbidden_message
7270 saved_integral_constant_expression_p
7272 saved_non_integral_constant_expression_p
7276 saved_greater_than_is_operator_p
7288 parser->greater_than_is_operator_p
7291 parser->integral_constant_expression_p
7293 parser->non_integral_constant_expression_p
7300 }
7304 }
7305 }
7307 /* Look for the `:: new' and `:: delete', which also signal the
7308 beginning of a new-expression, or delete-expression,
7309 respectively. If the next token is `::', then it might be one of
7310 these. */
7312 {
7315 /* See if the token after the `::' is one of the keywords in
7316 which we're interested. */
7318 /* If it's `new', we have a new-expression. */
7321 /* Similarly, for `delete'. */
7324 }
7326 /* Look for a unary operator. */
7328 /* The `++' and `--' operators can be handled similarly, even though
7329 they are not technically unary-operators in the grammar. */
7331 {
7336 /* Handle the GNU address-of-label extension. */
7339 {
7340 tree identifier;
7341 tree expression;
7344 /* Consume the '&&' token. */
7346 /* Look for the identifier. */
7348 /* Create an expression representing the address. */
7351 NIC_ADDR_LABEL))
7354 }
7355 }
7357 {
7358 tree cast_expression;
7364 /* Consume the operator token. */
7366 /* Parse the cast-expression. */
7367 cast_expression
7372 pidk);
7373 /* Now, build an appropriate representation. */
7375 {
7379 RO_UNARY_STAR,
7380 complain);
7385 /* Fall through. */
7388 cast_expression,
7389 complain);
7396 /* Fall through. */
7406 }
7410 non_constant_p))
7414 }
7418 decltype_p,
7419 pidk);
7420 }
7422 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7423 unary-operator, the corresponding tree code is returned. */
7425 static enum tree_code
7427 {
7429 {
7450 }
7451 }
7453 /* Parse a new-expression.
7455 new-expression:
7456 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7457 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7459 Returns a representation of the expression. */
7461 static tree
7463 {
7466 tree type;
7469 tree ret;
7471 /* Look for the optional `::' operator. */
7472 global_scope_p
7476 /* Look for the `new' operator. */
7478 /* There's no easy way to tell a new-placement from the
7479 `( type-id )' construct. */
7481 /* Look for a new-placement. */
7483 /* If that didn't work out, there's no new-placement. */
7485 {
7489 }
7491 /* If the next token is a `(', then we have a parenthesized
7492 type-id. */
7494 {
7498 /* Consume the `('. */
7501 /* Parse the type-id. */
7502 parser->type_definition_forbidden_message
7507 /* Look for the closing `)'. */
7510 /* There should not be a direct-new-declarator in this production,
7511 but GCC used to allowed this, so we check and emit a sensible error
7512 message for this case. */
7514 {
7520 }
7521 }
7522 /* Otherwise, there must be a new-type-id. */
7523 else
7526 /* If the next token is a `(' or '{', then we have a new-initializer. */
7530 else
7533 /* A new-expression may not appear in an integral constant
7534 expression. */
7537 else
7538 {
7539 /* Create a representation of the new-expression. */
7541 tf_warning_or_error);
7542 }
7550 }
7552 /* Parse a new-placement.
7554 new-placement:
7555 ( expression-list )
7557 Returns the same representation as for an expression-list. */
7561 {
7564 /* Parse the expression-list. */
7565 expression_list = (cp_parser_parenthesized_expression_list
7574 }
7576 /* Parse a new-type-id.
7578 new-type-id:
7579 type-specifier-seq new-declarator [opt]
7581 Returns the TYPE allocated. If the new-type-id indicates an array
7582 type, *NELTS is set to the number of elements in the last array
7583 bound; the TYPE will not include the last array bound. */
7585 static tree
7587 {
7588 cp_decl_specifier_seq type_specifier_seq;
7594 /* The type-specifier sequence must not contain type definitions.
7595 (It cannot contain declarations of new types either, but if they
7596 are not definitions we will catch that because they are not
7597 complete.) */
7599 parser->type_definition_forbidden_message
7601 /* Parse the type-specifier-seq. */
7605 /* Restore the old message. */
7611 /* Parse the new-declarator. */
7614 /* Determine the number of elements in the last array dimension, if
7615 any. */
7617 /* Skip down to the last array dimension. */
7622 {
7625 }
7630 {
7633 }
7636 {
7643 else
7645 }
7648 }
7650 /* Parse an (optional) new-declarator.
7652 new-declarator:
7653 ptr-operator new-declarator [opt]
7654 direct-new-declarator
7656 Returns the declarator. */
7660 {
7663 cp_cv_quals cv_quals;
7665 /* We don't know if there's a ptr-operator next, or not. */
7667 /* Look for a ptr-operator. */
7669 /* If that worked, look for more new-declarators. */
7671 {
7674 /* Parse another optional declarator. */
7677 declarator = cp_parser_make_indirect_declarator
7681 }
7683 /* If the next token is a `[', there is a direct-new-declarator. */
7688 }
7690 /* Parse a direct-new-declarator.
7692 direct-new-declarator:
7693 [ expression ]
7694 direct-new-declarator [constant-expression]
7696 */
7700 {
7704 {
7705 tree expression;
7708 /* Look for the opening `['. */
7713 /* The standard requires that the expression have integral
7714 type. DR 74 adds enumeration types. We believe that the
7715 real intent is that these expressions be handled like the
7716 expression in a `switch' condition, which also allows
7717 classes with a single conversion to integral or
7718 enumeration type. */
7720 {
7721 expression
7723 expression,
7726 {
7728 "expression in new-declarator must have integral "
7731 }
7732 }
7734 /* Look for the closing `]'. */
7737 /* Add this bound to the declarator. */
7740 /* If the next token is not a `[', then there are no more
7741 bounds. */
7744 }
7747 }
7749 /* Parse a new-initializer.
7751 new-initializer:
7752 ( expression-list [opt] )
7753 braced-init-list
7755 Returns a representation of the expression-list. */
7759 {
7763 {
7764 tree t;
7771 }
7772 else
7773 expression_list = (cp_parser_parenthesized_expression_list
7779 }
7781 /* Parse a delete-expression.
7783 delete-expression:
7784 :: [opt] delete cast-expression
7785 :: [opt] delete [ ] cast-expression
7787 Returns a representation of the expression. */
7789 static tree
7791 {
7794 tree expression;
7796 /* Look for the optional `::' operator. */
7797 global_scope_p
7801 /* Look for the `delete' keyword. */
7803 /* See if the array syntax is in use. */
7805 {
7806 /* Consume the `[' token. */
7808 /* Look for the `]' token. */
7810 /* Remember that this is the `[]' construct. */
7812 }
7813 else
7816 /* Parse the cast-expression. */
7819 /* A delete-expression may not appear in an integral constant
7820 expression. */
7825 tf_warning_or_error);
7826 }
7828 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7829 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7830 0 otherwise. */
7832 static int
7834 {
7837 {
7879 /* In ((type ()) () the last () isn't a valid cast-expression,
7880 so the whole must be parsed as postfix-expression. */
7885 /* '[' may start a primary-expression in obj-c++ and in C++11,
7886 as a lambda-expression, eg, '(void)[]{}'. */
7893 /* '++' and '--' may or may not start a cast-expression:
7895 struct T { void operator++(int); };
7896 void f() { (T())++; }
7898 vs
7900 int a;
7901 (int)++a; */
7906 }
7907 }
7909 /* Parse a cast-expression.
7911 cast-expression:
7912 unary-expression
7913 ( type-id ) cast-expression
7915 ADDRESS_P is true iff the unary-expression is appearing as the
7916 operand of the `&' operator. CAST_P is true if this expression is
7917 the target of a cast.
7919 Returns a representation of the expression. */
7921 static tree
7924 {
7925 /* If it's a `(', then we might be looking at a cast. */
7927 {
7933 /* There's no way to know yet whether or not this is a cast.
7934 For example, `(int (3))' is a unary-expression, while `(int)
7935 3' is a cast. So, we resort to parsing tentatively. */
7937 /* Types may not be defined in a cast. */
7939 parser->type_definition_forbidden_message
7941 /* Consume the `('. */
7943 /* A very tricky bit is that `(struct S) { 3 }' is a
7944 compound-literal (which we permit in C++ as an extension).
7945 But, that construct is not a cast-expression -- it is a
7946 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7947 is legal; if the compound-literal were a cast-expression,
7948 you'd need an extra set of parentheses.) But, if we parse
7949 the type-id, and it happens to be a class-specifier, then we
7950 will commit to the parse at that point, because we cannot
7951 undo the action that is done when creating a new class. So,
7952 then we cannot back up and do a postfix-expression.
7954 Another tricky case is the following (c++/29234):
7956 struct S { void operator () (); };
7958 void foo ()
7959 {
7960 ( S()() );
7961 }
7963 As a type-id we parse the parenthesized S()() as a function
7964 returning a function, groktypename complains and we cannot
7965 back up in this case either.
7967 Therefore, we scan ahead to the closing `)', and check to see
7968 if the tokens after the `)' can start a cast-expression. Otherwise
7969 we are dealing with an unary-expression, a postfix-expression
7970 or something else.
7972 Yet another tricky case, in C++11, is the following (c++/54891):
7974 (void)[]{};
7976 The issue is that usually, besides the case of lambda-expressions,
7977 the parenthesized type-id cannot be followed by '[', and, eg, we
7978 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7979 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7980 we don't commit, we try a cast-expression, then an unary-expression.
7982 Save tokens so that we can put them back. */
7985 /* We may be looking at a cast-expression. */
7988 cast_expression
7991 /* Roll back the tokens we skipped. */
7993 /* If we aren't looking at a cast-expression, simulate an error so
7994 that the call to cp_parser_error_occurred below returns true. */
7997 else
7998 {
8001 /* Look for the type-id. */
8003 /* Look for the closing `)'. */
8006 }
8008 /* Restore the saved message. */
8011 /* At this point this can only be either a cast or a
8012 parenthesized ctor such as `(T ())' that looks like a cast to
8013 function returning T. */
8015 {
8016 /* Only commit if the cast-expression doesn't start with
8017 '++', '--', or '[' in C++11. */
8025 pidk);
8028 {
8029 /* Warn about old-style casts, if so requested. */
8036 /* Only type conversions to integral or enumeration types
8037 can be used in constant-expressions. */
8040 NIC_CAST))
8043 /* Perform the cast. */
8046 }
8047 }
8048 else
8050 }
8052 /* If we get here, then it's not a cast, so it must be a
8053 unary-expression. */
8056 }
8058 /* Parse a binary expression of the general form:
8060 pm-expression:
8061 cast-expression
8062 pm-expression .* cast-expression
8063 pm-expression ->* cast-expression
8065 multiplicative-expression:
8066 pm-expression
8067 multiplicative-expression * pm-expression
8068 multiplicative-expression / pm-expression
8069 multiplicative-expression % pm-expression
8071 additive-expression:
8072 multiplicative-expression
8073 additive-expression + multiplicative-expression
8074 additive-expression - multiplicative-expression
8076 shift-expression:
8077 additive-expression
8078 shift-expression << additive-expression
8079 shift-expression >> additive-expression
8081 relational-expression:
8082 shift-expression
8083 relational-expression < shift-expression
8084 relational-expression > shift-expression
8085 relational-expression <= shift-expression
8086 relational-expression >= shift-expression
8088 GNU Extension:
8090 relational-expression:
8091 relational-expression <? shift-expression
8092 relational-expression >? shift-expression
8094 equality-expression:
8095 relational-expression
8096 equality-expression == relational-expression
8097 equality-expression != relational-expression
8099 and-expression:
8100 equality-expression
8101 and-expression & equality-expression
8103 exclusive-or-expression:
8104 and-expression
8105 exclusive-or-expression ^ and-expression
8107 inclusive-or-expression:
8108 exclusive-or-expression
8109 inclusive-or-expression | exclusive-or-expression
8111 logical-and-expression:
8112 inclusive-or-expression
8113 logical-and-expression && inclusive-or-expression
8115 logical-or-expression:
8116 logical-and-expression
8117 logical-or-expression || logical-and-expression
8119 All these are implemented with a single function like:
8121 binary-expression:
8122 simple-cast-expression
8123 binary-expression <token> binary-expression
8125 CAST_P is true if this expression is the target of a cast.
8127 The binops_by_token map is used to get the tree codes for each <token> type.
8128 binary-expressions are associated according to a precedence table. */
8130 #define TOKEN_PRECEDENCE(token) \
8131 (((token->type == CPP_GREATER \
8132 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8133 && !parser->greater_than_is_operator_p) \
8134 ? PREC_NOT_OPERATOR \
8135 : binops_by_token[token->type].prec)
8137 static tree
8143 {
8144 cp_parser_expression_stack stack;
8146 cp_parser_expression_stack_entry current;
8147 tree rhs;
8151 tree overload;
8153 /* Parse the first expression. */
8164 {
8165 /* Get an operator token. */
8171 {
8173 "%<>>%> operator is treated"
8177 }
8181 /* Popping an entry off the stack means we completed a subexpression:
8182 - either we found a token which is not an operator (`>' where it is not
8183 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8184 will happen repeatedly;
8185 - or, we found an operator which has lower priority. This is the case
8186 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8187 parsing `3 * 4'. */
8189 {
8192 else
8194 }
8196 get_rhs:
8200 /* We used the operator token. */
8203 /* For "false && x" or "true || x", x will never be executed;
8204 disable warnings while evaluating it. */
8210 /* Extract another operand. It may be the RHS of this expression
8211 or the LHS of a new, higher priority expression. */
8216 /* Get another operator token. Look up its precedence to avoid
8217 building a useless (immediately popped) stack entry for common
8218 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8222 {
8223 /* ... and prepare to parse the RHS of the new, higher priority
8224 expression. Since precedence levels on the stack are
8225 monotonically increasing, we do not have to care about
8226 stack overflows. */
8235 pop:
8237 /* If the stack is not empty, we have parsed into LHS the right side
8238 (`4' in the example above) of an expression we had suspended.
8239 We can use the information on the stack to recover the LHS (`3')
8240 from the stack together with the tree code (`MULT_EXPR'), and
8241 the precedence of the higher level subexpression
8242 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8243 which will be used to actually build the additive expression. */
8248 }
8250 /* Undo the disabling of warnings done above. */
8259 /* Avoid warning for !!x == y. */
8264 /* Avoid warning for !b == y where b is boolean. */
8268 /* Avoid warning for !!b == y where b is boolean. */
8276 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8277 ERROR_MARK for everything that is not a binary expression.
8278 This makes warn_about_parentheses miss some warnings that
8279 involve unary operators. For unary expressions we should
8280 pass the correct tree_code unless the unary expression was
8281 surrounded by parentheses.
8282 */
8288 == tcc_comparison
8291 else
8300 /* If the binary operator required the use of an overloaded operator,
8301 then this expression cannot be an integral constant-expression.
8302 An overloaded operator can be used even if both operands are
8303 otherwise permissible in an integral constant-expression if at
8304 least one of the operands is of enumeration type. */
8308 NIC_OVERLOADED))
8310 }
8313 }
8315 static tree
8320 {
8323 }
8325 /* Parse the `? expression : assignment-expression' part of a
8326 conditional-expression. The LOGICAL_OR_EXPR is the
8327 logical-or-expression that started the conditional-expression.
8328 Returns a representation of the entire conditional-expression.
8330 This routine is used by cp_parser_assignment_expression.
8332 ? expression : assignment-expression
8334 GNU Extensions:
8336 ? : assignment-expression */
8338 static tree
8340 {
8341 tree expr;
8342 tree assignment_expr;
8346 /* Consume the `?' token. */
8351 {
8354 /* Implicit true clause. */
8358 }
8359 else
8360 {
8363 /* Parse the expression. */
8366 c_inhibit_evaluation_warnings +=
8370 }
8372 /* The next token should be a `:'. */
8374 /* Parse the assignment-expression. */
8378 /* Build the conditional-expression. */
8380 expr,
8381 assignment_expr,
8382 tf_warning_or_error);
8383 }
8385 /* Parse an assignment-expression.
8387 assignment-expression:
8388 conditional-expression
8389 logical-or-expression assignment-operator assignment_expression
8390 throw-expression
8392 CAST_P is true if this expression is the target of a cast.
8393 DECLTYPE_P is true if this expression is the operand of decltype.
8395 Returns a representation for the expression. */
8397 static tree
8400 {
8401 tree expr;
8403 /* If the next token is the `throw' keyword, then we're looking at
8404 a throw-expression. */
8407 /* Otherwise, it must be that we are looking at a
8408 logical-or-expression. */
8409 else
8410 {
8411 /* Parse the binary expressions (logical-or-expression). */
8413 decltype_p,
8415 /* If the next token is a `?' then we're actually looking at a
8416 conditional-expression. */
8419 else
8420 {
8423 /* If it's an assignment-operator, we're using the second
8424 production. */
8425 enum tree_code assignment_operator
8428 {
8430 location_t saved_input_location;
8432 /* Parse the right-hand side of the assignment. */
8438 /* An assignment may not appear in a
8439 constant-expression. */
8441 NIC_ASSIGNMENT))
8443 /* Build the assignment expression. Its default
8444 location is the location of the '=' token. */
8448 assignment_operator,
8449 rhs,
8452 }
8453 }
8454 }
8457 }
8459 /* Parse an (optional) assignment-operator.
8461 assignment-operator: one of
8462 = *= /= %= += -= >>= <<= &= ^= |=
8464 GNU Extension:
8466 assignment-operator: one of
8467 <?= >?=
8469 If the next token is an assignment operator, the corresponding tree
8470 code is returned, and the token is consumed. For example, for
8471 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8472 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8473 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8474 operator, ERROR_MARK is returned. */
8476 static enum tree_code
8478 {
8482 /* Peek at the next token. */
8486 {
8532 /* Nothing else is an assignment operator. */
8534 }
8536 /* If it was an assignment operator, consume it. */
8541 }
8543 /* Parse an expression.
8545 expression:
8546 assignment-expression
8547 expression , assignment-expression
8549 CAST_P is true if this expression is the target of a cast.
8550 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8551 except possibly parenthesized or on the RHS of a comma (N3276).
8553 Returns a representation of the expression. */
8555 static tree
8558 {
8563 {
8564 tree assignment_expression;
8566 /* Parse the next assignment-expression. */
8567 assignment_expression
8570 /* We don't create a temporary for a call that is the immediate operand
8571 of decltype or on the RHS of a comma. But when we see a comma, we
8572 need to create a temporary for a call on the LHS. */
8577 assignment_expression
8581 /* If this is the first assignment-expression, we can just
8582 save it away. */
8585 else
8587 assignment_expression,
8589 /* If the next token is not a comma, then we are done with the
8590 expression. */
8593 /* Consume the `,'. */
8596 /* A comma operator cannot appear in a constant-expression. */
8599 }
8602 }
8604 /* Parse a constant-expression.
8606 constant-expression:
8607 conditional-expression
8609 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8610 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8611 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8612 is false, NON_CONSTANT_P should be NULL. */
8614 static tree
8618 {
8622 tree expression;
8624 /* It might seem that we could simply parse the
8625 conditional-expression, and then check to see if it were
8626 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8627 one that the compiler can figure out is constant, possibly after
8628 doing some simplifications or optimizations. The standard has a
8629 precise definition of constant-expression, and we must honor
8630 that, even though it is somewhat more restrictive.
8632 For example:
8634 int i[(2, 3)];
8636 is not a legal declaration, because `(2, 3)' is not a
8637 constant-expression. The `,' operator is forbidden in a
8638 constant-expression. However, GCC's constant-folding machinery
8639 will fold this operation to an INTEGER_CST for `3'. */
8641 /* Save the old settings. */
8643 saved_allow_non_integral_constant_expression_p
8646 /* We are now parsing a constant-expression. */
8648 parser->allow_non_integral_constant_expression_p
8651 /* Although the grammar says "conditional-expression", we parse an
8652 "assignment-expression", which also permits "throw-expression"
8653 and the use of assignment operators. In the case that
8654 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8655 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8656 actually essential that we look for an assignment-expression.
8657 For example, cp_parser_initializer_clauses uses this function to
8658 determine whether a particular assignment-expression is in fact
8659 constant. */
8661 /* Restore the old settings. */
8662 parser->integral_constant_expression_p
8664 parser->allow_non_integral_constant_expression_p
8667 {
8668 /* Require an rvalue constant expression here; that's what our
8669 callers expect. Reference constant expressions are handled
8670 separately in e.g. cp_parser_template_argument. */
8675 }
8678 parser->non_integral_constant_expression_p
8682 }
8684 /* Parse __builtin_offsetof.
8686 offsetof-expression:
8687 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8689 offsetof-member-designator:
8690 id-expression
8691 | offsetof-member-designator "." id-expression
8692 | offsetof-member-designator "[" expression "]"
8693 | offsetof-member-designator "->" id-expression */
8695 static tree
8697 {
8700 cp_id_kind dummy;
8703 /* We're about to accept non-integral-constant things, but will
8704 definitely yield an integral constant expression. Save and
8705 restore these values around our local parsing. */
8709 /* Consume the "__builtin_offsetof" token. */
8711 /* Consume the opening `('. */
8713 /* Parse the type-id. */
8716 /* Look for the `,'. */
8720 /* Build the (type *)null that begins the traditional offsetof macro. */
8722 tf_warning_or_error);
8724 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8728 {
8731 {
8733 /* offsetof-member-designator "[" expression "]" */
8739 /* offsetof-member-designator "->" identifier */
8742 /* FALLTHRU */
8745 /* offsetof-member-designator "." identifier */
8753 /* Consume the ")" token. */
8758 /* Error. We know the following require will fail, but
8759 that gives the proper error message. */
8764 }
8765 }
8767 success:
8770 failure:
8775 }
8777 /* Parse a trait expression.
8779 Returns a representation of the expression, the underlying type
8780 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8782 static tree
8784 {
8785 cp_trait_kind kind;
8791 {
8875 }
8877 /* Consume the token. */
8888 {
8895 }
8897 {
8899 {
8903 {
8906 }
8910 }
8911 }
8915 /* Complete the trait expression, which may mean either processing
8916 the trait expr now or saving it for template instantiation. */
8918 {
8927 }
8928 }
8930 /* Lambdas that appear in variable initializer or default argument scope
8931 get that in their mangling, so we need to record it. We might as well
8932 use the count for function and namespace scopes as well. */
8936 {
8937 tree t;
8942 static void
8944 {
8945 tree_int ti;
8947 /* Once we're inside a function, we ignore other scopes and just push
8948 the function again so that popping works properly. */
8955 {
8956 /* Don't reset the count if we're still in the same function. */
8959 }
8960 }
8962 static void
8964 {
8967 }
8969 static void
8971 {
8974 {
8977 }
8979 }
8981 /* Parse a lambda expression.
8983 lambda-expression:
8984 lambda-introducer lambda-declarator [opt] compound-statement
8986 Returns a representation of the expression. */
8988 static tree
8990 {
8992 tree type;
9000 {
9002 {
9006 }
9008 }
9010 {
9012 {
9015 }
9017 }
9019 /* We may be in the middle of deferred access check. Disable
9020 it now. */
9031 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9034 /* Now that we've started the type, add the capture fields for any
9035 explicit captures. */
9038 {
9039 /* Inside the class, surrounding template-parameter-lists do not apply. */
9040 unsigned int saved_num_template_parameter_lists
9044 bool fully_implicit_function_template_p
9048 bool auto_is_implicit_function_template_parm_p
9059 /* By virtue of defining a local class, a lambda expression has access to
9060 the private variables of enclosing classes. */
9065 {
9071 }
9073 {
9076 }
9078 /* The capture list was built up in reverse order; fix that now. */
9090 parser->fully_implicit_function_template_p
9094 parser->auto_is_implicit_function_template_parm_p
9096 }
9100 /* This field is only used during parsing of the lambda. */
9103 /* This lambda shouldn't have any proxies left at this point. */
9105 /* And now that we're done, push proxies for an enclosing lambda. */
9110 else
9116 }
9118 /* Parse the beginning of a lambda expression.
9120 lambda-introducer:
9121 [ lambda-capture [opt] ]
9123 LAMBDA_EXPR is the current representation of the lambda expression. */
9125 static void
9127 {
9128 /* Need commas after the first capture. */
9131 /* Eat the leading `['. */
9134 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9142 {
9145 }
9148 {
9150 tree capture_id;
9151 tree capture_init_expr;
9155 enum capture_kind_type
9156 {
9157 BY_COPY,
9158 BY_REFERENCE
9159 };
9163 {
9166 }
9170 else
9173 /* Possibly capture `this'. */
9175 {
9185 explicit_init_p);
9187 }
9189 /* Remember whether we want to capture as a reference or not. */
9191 {
9194 }
9196 /* Get the identifier. */
9201 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9202 delimiters, but I modified this to stop on unnested ']' as well. It
9203 was already changed to stop on unnested '}', so the
9204 "closing_parenthesis" name is no more misleading with my change. */
9205 {
9211 }
9213 /* Find the initializer for this capture. */
9217 {
9219 /* An explicit initializer exists. */
9222 "lambda capture initializers "
9228 {
9231 }
9232 }
9233 else
9234 {
9237 /* Turn the identifier into an id-expression. */
9238 capture_init_expr
9243 {
9246 }
9250 {
9253 capture_init_expr);
9256 }
9259 {
9262 capture_init_expr))
9265 }
9267 capture_init_expr
9268 = finish_id_expression
9270 capture_init_expr,
9284 {
9287 }
9288 else
9290 }
9294 {
9299 capture_id);
9303 "capture of %qD redundant with by-reference capture "
9305 }
9308 capture_id,
9309 capture_init_expr,
9311 explicit_init_p);
9312 }
9315 }
9317 /* Parse the (optional) middle of a lambda expression.
9319 lambda-declarator:
9320 < template-parameter-list [opt] >
9321 ( parameter-declaration-clause [opt] )
9322 attribute-specifier [opt]
9323 mutable [opt]
9324 exception-specification [opt]
9325 lambda-return-type-clause [opt]
9327 LAMBDA_EXPR is the current representation of the lambda expression. */
9329 static bool
9331 {
9332 /* 5.1.1.4 of the standard says:
9333 If a lambda-expression does not include a lambda-declarator, it is as if
9334 the lambda-declarator were ().
9335 This means an empty parameter list, no attributes, and no exception
9336 specification. */
9342 /* The template-parameter-list is optional, but must begin with
9343 an opening angle if present. */
9345 {
9348 "lambda templates are only available with "
9357 /* We just processed one more parameter list. */
9359 }
9361 /* The parameter-declaration-clause is optional (unless
9362 template-parameter-list was given), but must begin with an
9363 opening parenthesis if present. */
9365 {
9370 /* Parse parameters. */
9373 /* Default arguments shall not be specified in the
9374 parameter-declaration-clause of a lambda-declarator. */
9384 /* Parse optional `mutable' keyword. */
9386 {
9389 }
9391 /* Parse optional exception specification. */
9394 /* Parse optional trailing return type. */
9396 {
9400 }
9402 /* The function parameters must be in scope all the way until after the
9403 trailing-return-type in case of decltype. */
9405 }
9409 /* Create the function call operator.
9411 Messing with declarators like this is no uglier than building up the
9412 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9413 other code. */
9414 {
9415 cp_decl_specifier_seq return_type_specs;
9417 tree fco;
9424 else
9425 /* Maybe we will deduce the return type later. */
9431 sfk_none);
9436 VIRT_SPEC_UNSPECIFIED,
9437 REF_QUAL_NONE,
9438 exception_spec,
9443 declarator,
9444 attributes);
9446 {
9449 /* Give the object parameter a different name. */
9453 }
9455 {
9459 }
9468 }
9469 }
9471 /* Parse the body of a lambda expression, which is simply
9473 compound-statement
9475 but which requires special handling.
9476 LAMBDA_EXPR is the current representation of the lambda expression. */
9478 static void
9480 {
9485 else
9486 /* Still increment function_depth so that we don't GC in the
9487 middle of an expression. */
9489 /* Clear this in case we're in the middle of a default argument. */
9492 /* Finish the function call operator
9493 - class_specifier
9494 + late_parsing_for_member
9495 + function_definition_after_declarator
9496 + ctor_initializer_opt_and_function_body */
9497 {
9499 tree body;
9501 tree compound_stmt;
9502 tree cap;
9504 /* Let the front end know that we are going to be defining this
9505 function. */
9507 NULL_TREE,
9516 /* Push the proxies for any explicit captures. */
9523 /* 5.1.1.4 of the standard says:
9524 If a lambda-expression does not include a trailing-return-type, it
9525 is as if the trailing-return-type denotes the following type:
9526 * if the compound-statement is of the form
9527 { return attribute-specifier [opt] expression ; }
9528 the type of the returned expression after lvalue-to-rvalue
9529 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9530 (_conv.array_ 4.2), and function-to-pointer conversion
9531 (_conv.func_ 4.3);
9532 * otherwise, void. */
9534 /* In a lambda that has neither a lambda-return-type-clause
9535 nor a deducible form, errors should be reported for return statements
9536 in the body. Since we used void as the placeholder return type, parsing
9537 the body as usual will give such desired behavior. */
9541 {
9545 /* Parse tentatively in case there's more after the initial return
9546 statement. */
9557 {
9561 /* Will get error here if type not deduced yet. */
9565 }
9566 }
9569 {
9574 }
9578 out:
9582 /* Finish the function and generate code for it if necessary. */
9585 /* Only expand if the call op is not a template. */
9588 }
9593 else
9595 }
9597 /* Statements [gram.stmt.stmt] */
9599 /* Parse a statement.
9601 statement:
9602 labeled-statement
9603 expression-statement
9604 compound-statement
9605 selection-statement
9606 iteration-statement
9607 jump-statement
9608 declaration-statement
9609 try-block
9611 C++11:
9613 statement:
9614 labeled-statement
9615 attribute-specifier-seq (opt) expression-statement
9616 attribute-specifier-seq (opt) compound-statement
9617 attribute-specifier-seq (opt) selection-statement
9618 attribute-specifier-seq (opt) iteration-statement
9619 attribute-specifier-seq (opt) jump-statement
9620 declaration-statement
9621 attribute-specifier-seq (opt) try-block
9623 TM Extension:
9625 statement:
9626 atomic-statement
9628 IN_COMPOUND is true when the statement is nested inside a
9629 cp_parser_compound_statement; this matters for certain pragmas.
9631 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9632 is a (possibly labeled) if statement which is not enclosed in braces
9633 and has an else clause. This is used to implement -Wparentheses. */
9635 static void
9638 {
9643 restart:
9646 /* There is no statement yet. */
9652 /* In obj-c++, seeing '[[' might be the either the beginning of
9653 c++11 attributes, or a nested objc-message-expression. So
9654 let's parse the c++11 attributes tentatively. */
9658 {
9661 }
9663 /* Peek at the next token. */
9665 /* Remember the location of the first token in the statement. */
9667 /* If this is a keyword, then that will often determine what kind of
9668 statement we have. */
9670 {
9674 {
9677 /* Looks like a labeled-statement with a case label.
9678 Parse the label, and then use tail recursion to parse
9679 the statement. */
9696 {
9701 }
9702 else
9716 {
9721 }
9722 else
9723 {
9727 }
9731 /* Objective-C++ exception-handling constructs. */
9745 /* This must be a namespace alias definition. */
9758 /* It might be a keyword like `int' that can start a
9759 declaration-statement. */
9761 }
9762 }
9764 {
9765 /* If the next token is a `:', then we are looking at a
9766 labeled-statement. */
9769 {
9770 /* Looks like a labeled-statement with an ordinary label.
9771 Parse the label, and then use tail recursion to parse
9772 the statement. */
9776 }
9777 }
9778 /* Anything that starts with a `{' must be a compound-statement. */
9781 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9782 a statement all its own. */
9784 {
9785 /* Only certain OpenMP pragmas are attached to statements, and thus
9786 are considered statements themselves. All others are not. In
9787 the context of a compound, accept the pragma as a "statement" and
9788 return so that we can check for a close brace. Otherwise we
9789 require a real statement and must go back and read one. */
9795 }
9797 {
9800 }
9802 /* Everything else must be a declaration-statement or an
9803 expression-statement. Try for the declaration-statement
9804 first, unless we are looking at a `;', in which case we know that
9805 we have an expression-statement. */
9807 {
9809 {
9811 {
9812 /* Attributes should be parsed as part of the the
9813 declaration, so let's un-parse them. */
9816 }
9819 /* Try to parse the declaration-statement. */
9821 /* If that worked, we're done. */
9824 }
9825 /* Look for an expression-statement instead. */
9827 }
9829 /* Set the line number for the statement. */
9833 /* Note that for now, we don't do anything with c++11 statements
9834 parsed at this level. */
9837 OPT_Wattributes,
9839 }
9841 /* Parse the label for a labeled-statement, i.e.
9843 identifier :
9844 case constant-expression :
9845 default :
9847 GNU Extension:
9848 case constant-expression ... constant-expression : statement
9850 When a label is parsed without errors, the label is added to the
9851 parse tree by the finish_* functions, so this function doesn't
9852 have to return the label. */
9854 static void
9856 {
9861 /* The next token should be an identifier. */
9865 {
9868 }
9872 {
9874 {
9878 /* Consume the `case' token. */
9880 /* Parse the constant-expression. */
9887 {
9888 /* Consume the `...' token. */
9894 /* We don't need to emit warnings here, as the common code
9895 will do this for us. */
9896 }
9897 else
9902 else
9905 expr);
9906 }
9910 /* Consume the `default' token. */
9915 else
9920 /* Anything else must be an ordinary label. */
9923 }
9925 /* Require the `:' token. */
9928 /* An ordinary label may optionally be followed by attributes.
9929 However, this is only permitted if the attributes are then
9930 followed by a semicolon. This is because, for backward
9931 compatibility, when parsing
9932 lab: __attribute__ ((unused)) int i;
9933 we want the attribute to attach to "i", not "lab". */
9936 {
9937 tree attrs;
9944 ;
9945 else
9947 }
9953 }
9955 /* Parse an expression-statement.
9957 expression-statement:
9958 expression [opt] ;
9960 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9961 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9962 indicates whether this expression-statement is part of an
9963 expression statement. */
9965 static tree
9967 {
9971 /* If the next token is a ';', then there is no expression
9972 statement. */
9974 {
9978 {
9981 }
9982 }
9984 /* Give a helpful message for "A<T>::type t;" and the like. */
9987 {
9994 {
9995 /* A::A a; */
10000 }
10001 }
10003 /* Consume the final `;'. */
10008 /* This is the final expression statement of a statement
10009 expression. */
10015 }
10017 /* Parse a compound-statement.
10019 compound-statement:
10020 { statement-seq [opt] }
10022 GNU extension:
10024 compound-statement:
10025 { label-declaration-seq [opt] statement-seq [opt] }
10027 label-declaration-seq:
10028 label-declaration
10029 label-declaration-seq label-declaration
10031 Returns a tree representing the statement. */
10033 static tree
10036 {
10037 tree compound_stmt;
10039 /* Consume the `{'. */
10046 /* Begin the compound-statement. */
10048 /* If the next keyword is `__label__' we have a label declaration. */
10051 /* Parse an (optional) statement-seq. */
10053 /* Finish the compound-statement. */
10055 /* Consume the `}'. */
10059 }
10061 /* Parse an (optional) statement-seq.
10063 statement-seq:
10064 statement
10065 statement-seq [opt] statement */
10067 static void
10069 {
10070 /* Scan statements until there aren't any more. */
10072 {
10075 /* If we are looking at a `}', then we have run out of
10076 statements; the same is true if we have reached the end
10077 of file, or have stumbled upon a stray '@end'. */
10084 /* If we are in a compound statement and find 'else' then
10085 something went wrong. */
10087 {
10090 else
10091 {
10094 }
10095 }
10097 /* Parse the statement. */
10099 }
10100 }
10102 /* Parse a selection-statement.
10104 selection-statement:
10105 if ( condition ) statement
10106 if ( condition ) statement else statement
10107 switch ( condition ) statement
10109 Returns the new IF_STMT or SWITCH_STMT.
10111 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10112 is a (possibly labeled) if statement which is not enclosed in
10113 braces and has an else clause. This is used to implement
10114 -Wparentheses. */
10116 static tree
10118 {
10125 /* Peek at the next token. */
10128 /* See what kind of keyword it is. */
10131 {
10134 {
10135 tree statement;
10136 tree condition;
10138 /* Look for the `('. */
10140 {
10143 }
10145 /* Begin the selection-statement. */
10148 else
10151 /* Parse the condition. */
10153 /* Look for the `)'. */
10159 {
10163 /* Add the condition. */
10166 /* Parse the then-clause. */
10170 {
10178 }
10179 else
10186 /* If the next token is `else', parse the else-clause. */
10188 RID_ELSE))
10189 {
10190 /* Consume the `else' keyword. */
10191 location_t else_tok_loc
10194 /* Parse the else-clause. */
10196 {
10197 location_t loc;
10204 }
10205 else
10211 /* If we are currently parsing a then-clause, then
10212 IF_P will not be NULL. We set it to true to
10213 indicate that this if statement has an else clause.
10214 This may trigger the Wparentheses warning below
10215 when we get back up to the parent if statement. */
10218 }
10219 else
10220 {
10221 /* This if statement does not have an else clause. If
10222 NESTED_IF is true, then the then-clause is an if
10223 statement which does have an else clause. We warn
10224 about the potential ambiguity. */
10227 "suggest explicit braces to avoid ambiguous"
10229 }
10231 /* Now we're all done with the if-statement. */
10233 }
10234 else
10235 {
10239 /* Add the condition. */
10242 /* Parse the body of the switch-statement. */
10252 /* Now we're all done with the switch-statement. */
10254 }
10257 }
10263 }
10264 }
10266 /* Parse a condition.
10268 condition:
10269 expression
10270 type-specifier-seq declarator = initializer-clause
10271 type-specifier-seq declarator braced-init-list
10273 GNU Extension:
10275 condition:
10276 type-specifier-seq declarator asm-specification [opt]
10277 attributes [opt] = assignment-expression
10279 Returns the expression that should be tested. */
10281 static tree
10283 {
10284 cp_decl_specifier_seq type_specifiers;
10288 /* Try the declaration first. */
10290 /* New types are not allowed in the type-specifier-seq for a
10291 condition. */
10293 parser->type_definition_forbidden_message
10295 /* Parse the type-specifier-seq. */
10297 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10300 /* Restore the saved message. */
10302 /* If all is well, we might be looking at a declaration. */
10304 {
10305 tree decl;
10306 tree asm_specification;
10307 tree attributes;
10311 /* Parse the declarator. */
10317 /* Parse the attributes. */
10319 /* Parse the asm-specification. */
10321 /* If the next token is not an `=' or '{', then we might still be
10322 looking at an expression. For example:
10324 if (A(a).x)
10326 looks like a decl-specifier-seq and a declarator -- but then
10327 there is no `=', so this is an expression. */
10332 /* If we did see an `=' or '{', then we are looking at a declaration
10333 for sure. */
10335 {
10336 tree pushed_scope;
10340 /* Create the declaration. */
10346 /* Parse the initializer. */
10348 {
10352 }
10353 else
10354 {
10355 /* Consume the `='. */
10358 }
10362 /* Process the initializer. */
10365 asm_specification,
10366 flags);
10372 }
10373 }
10374 /* If we didn't even get past the declarator successfully, we are
10375 definitely not looking at a declaration. */
10376 else
10379 /* Otherwise, we are looking at an expression. */
10381 }
10383 /* Parses a for-statement or range-for-statement until the closing ')',
10384 not included. */
10386 static tree
10388 {
10392 /* Begin the for-statement. */
10395 /* Parse the initialization. */
10400 else
10402 }
10404 static tree
10406 {
10407 /* Normal for loop */
10410 tree stmt;
10413 /* The for-init-statement has already been parsed in
10414 cp_parser_for_init_statement, so no work is needed here. */
10417 /* If there's a condition, process it. */
10421 {
10425 }
10427 /* Look for the `;'. */
10430 /* If there's an expression, process it. */
10436 }
10438 /* Tries to parse a range-based for-statement:
10440 range-based-for:
10441 decl-specifier-seq declarator : expression
10443 The decl-specifier-seq declarator and the `:' are already parsed by
10444 cp_parser_for_init_statement. If processing_template_decl it returns a
10445 newly created RANGE_FOR_STMT; if not, it is converted to a
10446 regular FOR_STMT. */
10448 static tree
10451 {
10455 {
10458 }
10459 else
10462 /* If in template, STMT is converted to a normal for-statement
10463 at instantiation. If not, it is done just ahead. */
10465 {
10473 /* do_auto_deduction doesn't mess with template init-lists. */
10476 }
10477 else
10478 {
10481 }
10483 }
10485 /* Subroutine of cp_convert_range_for: given the initializer expression,
10486 builds up the range temporary. */
10488 static tree
10490 {
10493 /* Find out the type deduced by the declaration
10494 `auto &&__range = range_expr'. */
10499 /* Create the __range variable. */
10506 }
10508 /* Used by cp_parser_range_for in template context: we aren't going to
10509 do a full conversion yet, but we still need to resolve auto in the
10510 type of the for-range-declaration if present. This is basically
10511 a shortcut version of cp_convert_range_for. */
10513 static void
10515 {
10518 {
10521 iter_type = (cp_parser_perform_range_for_lookup
10524 {
10526 iter_type);
10528 tf_warning_or_error);
10531 }
10532 }
10533 }
10535 /* Converts a range-based for-statement into a normal
10536 for-statement, as per the definition.
10538 for (RANGE_DECL : RANGE_EXPR)
10539 BLOCK
10541 should be equivalent to:
10543 {
10544 auto &&__range = RANGE_EXPR;
10545 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10546 __begin != __end;
10547 ++__begin)
10548 {
10549 RANGE_DECL = *__begin;
10550 BLOCK
10551 }
10552 }
10554 If RANGE_EXPR is an array:
10555 BEGIN_EXPR = __range
10556 END_EXPR = __range + ARRAY_SIZE(__range)
10557 Else if RANGE_EXPR has a member 'begin' or 'end':
10558 BEGIN_EXPR = __range.begin()
10559 END_EXPR = __range.end()
10560 Else:
10561 BEGIN_EXPR = begin(__range)
10562 END_EXPR = end(__range);
10564 If __range has a member 'begin' but not 'end', or vice versa, we must
10565 still use the second alternative (it will surely fail, however).
10566 When calling begin()/end() in the third alternative we must use
10567 argument dependent lookup, but always considering 'std' as an associated
10568 namespace. */
10570 tree
10573 {
10579 /* If an error happened previously do nothing or else a lot of
10580 unhelpful errors would be issued. */
10582 else
10583 {
10584 tree range_temp;
10588 /* Can't bind a reference to an array of runtime bound. */
10590 else
10591 {
10596 LOOKUP_ONLYCONVERTING);
10598 }
10601 }
10603 /* The new for initialization statement. */
10611 LOOKUP_ONLYCONVERTING);
10620 LOOKUP_ONLYCONVERTING);
10624 /* The new for condition. */
10631 /* The new increment expression. */
10634 tf_warning_or_error);
10637 /* The declaration is initialized with *__begin inside the loop body. */
10640 tf_warning_or_error),
10642 LOOKUP_ONLYCONVERTING);
10645 }
10647 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10648 We need to solve both at the same time because the method used
10649 depends on the existence of members begin or end.
10650 Returns the type deduced for the iterator expression. */
10652 static tree
10654 {
10656 {
10659 }
10662 {
10667 }
10669 {
10670 /* If RANGE is an array, we will use pointer arithmetic. */
10673 range,
10677 }
10678 else
10679 {
10680 /* If it is not an array, we must do a bit of magic. */
10690 tf_warning_or_error);
10693 tf_warning_or_error);
10696 {
10697 /* Use the member functions. */
10700 else
10706 else
10709 }
10710 else
10711 {
10712 /* Use global functions with ADL. */
10719 tf_warning_or_error);
10721 tf_warning_or_error);
10723 tf_warning_or_error);
10725 tf_warning_or_error);
10728 }
10730 /* Last common checks. */
10732 {
10733 /* If one of the expressions is an error do no more checks. */
10736 }
10739 /* Can happen, when, eg, in a template context, Koenig lookup
10740 can't resolve begin/end (c++/58503). */
10742 else
10743 {
10745 /* The unqualified type of the __begin and __end temporaries should
10746 be the same, as required by the multiple auto declaration. */
10752 }
10753 }
10754 }
10756 /* Helper function for cp_parser_perform_range_for_lookup.
10757 Builds a tree for RANGE.IDENTIFIER(). */
10759 static tree
10761 {
10774 tf_warning_or_error);
10777 }
10779 /* Parse an iteration-statement.
10781 iteration-statement:
10782 while ( condition ) statement
10783 do statement while ( expression ) ;
10784 for ( for-init-statement condition [opt] ; expression [opt] )
10785 statement
10787 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10789 static tree
10791 {
10793 location_t tok_loc;
10795 tree statement;
10798 /* Peek at the next token. */
10805 /* Remember whether or not we are already within an iteration
10806 statement. */
10809 /* See what kind of keyword it is. */
10812 {
10814 {
10815 tree condition;
10817 /* Begin the while-statement. */
10819 /* Look for the `('. */
10821 /* Parse the condition. */
10824 /* Look for the `)'. */
10826 /* Parse the dependent statement. */
10830 /* We're done with the while-statement. */
10832 }
10836 {
10837 tree expression;
10839 /* Begin the do-statement. */
10841 /* Parse the body of the do-statement. */
10846 /* Look for the `while' keyword. */
10848 /* Look for the `('. */
10850 /* Parse the expression. */
10852 /* We're done with the do-statement. */
10854 /* Look for the `)'. */
10856 /* Look for the `;'. */
10858 }
10862 {
10863 /* Look for the `('. */
10868 /* Look for the `)'. */
10871 /* Parse the body of the for-statement. */
10876 /* We're done with the for-statement. */
10878 }
10885 }
10888 }
10890 /* Parse a for-init-statement or the declarator of a range-based-for.
10891 Returns true if a range-based-for declaration is seen.
10893 for-init-statement:
10894 expression-statement
10895 simple-declaration */
10897 static bool
10899 {
10900 /* If the next token is a `;', then we have an empty
10901 expression-statement. Grammatically, this is also a
10902 simple-declaration, but an invalid one, because it does not
10903 declare anything. Therefore, if we did not handle this case
10904 specially, we would issue an error message about an invalid
10905 declaration. */
10907 {
10913 {
10914 /* N3994 -- for (id : init) ... */
10917 "type-specifier only available with "
10925 }
10927 /* A colon is used in range-based for. */
10930 /* We're going to speculatively look for a declaration, falling back
10931 to an expression, if necessary. */
10933 /* Parse the declaration. */
10936 decl);
10939 {
10940 /* It is a range-for, consume the ':' */
10944 {
10946 "range-based %<for%> loops only available with "
10949 }
10950 }
10951 else
10952 /* The ';' is not consumed yet because we told
10953 cp_parser_simple_declaration not to. */
10958 /* If the tentative parse failed, then we shall need to look for an
10959 expression-statement. */
10960 }
10961 /* If we are here, it is an expression-statement. */
10964 }
10966 /* Parse a jump-statement.
10968 jump-statement:
10969 break ;
10970 continue ;
10971 return expression [opt] ;
10972 return braced-init-list ;
10973 goto identifier ;
10975 GNU extension:
10977 jump-statement:
10978 goto * expression ;
10980 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10982 static tree
10984 {
10990 /* Peek at the next token. */
10995 /* See what kind of keyword it is. */
10998 {
11002 {
11022 }
11028 {
11035 /* Fall through. */
11045 }
11050 {
11051 tree expr;
11055 {
11059 }
11062 else
11063 /* If the next token is a `;', then there is no
11064 expression. */
11066 /* Build the return-statement. */
11068 /* Look for the final `;'. */
11070 }
11076 {
11079 }
11081 /* Create the goto-statement. */
11083 {
11084 /* Issue a warning about this use of a GNU extension. */
11086 /* Consume the '*' token. */
11088 /* Parse the dependent expression. */
11090 }
11091 else
11093 /* Look for the final `;'. */
11100 }
11103 }
11105 /* Parse a declaration-statement.
11107 declaration-statement:
11108 block-declaration */
11110 static void
11112 {
11115 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11118 /* Parse the block-declaration. */
11121 /* Free any declarators allocated. */
11123 }
11125 /* Some dependent statements (like `if (cond) statement'), are
11126 implicitly in their own scope. In other words, if the statement is
11127 a single statement (as opposed to a compound-statement), it is
11128 none-the-less treated as if it were enclosed in braces. Any
11129 declarations appearing in the dependent statement are out of scope
11130 after control passes that point. This function parses a statement,
11131 but ensures that is in its own scope, even if it is not a
11132 compound-statement.
11134 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11135 is a (possibly labeled) if statement which is not enclosed in
11136 braces and has an else clause. This is used to implement
11137 -Wparentheses.
11139 Returns the new statement. */
11141 static tree
11143 location_t guard_loc,
11145 {
11146 tree statement;
11151 /* Mark if () ; with a special NOP_EXPR. */
11153 {
11157 }
11158 /* if a compound is opened, we simply parse the statement directly. */
11161 /* If the token is not a `{', then we must take special action. */
11162 else
11163 {
11164 /* Create a compound-statement. */
11166 /* Parse the dependent-statement. */
11169 /* Finish the dummy compound-statement. */
11173 {
11177 guard_kind);
11178 }
11179 }
11181 /* Return the statement. */
11183 }
11185 /* For some dependent statements (like `while (cond) statement'), we
11186 have already created a scope. Therefore, even if the dependent
11187 statement is a compound-statement, we do not want to create another
11188 scope. */
11190 static void
11193 {
11194 /* If the token is a `{', then we must take special action. */
11196 {
11203 guard_kind);
11204 }
11205 else
11206 {
11207 /* Avoid calling cp_parser_compound_statement, so that we
11208 don't create a new scope. Do everything else by hand. */
11210 /* If the next keyword is `__label__' we have a label declaration. */
11213 /* Parse an (optional) statement-seq. */
11216 }
11217 }
11219 /* Declarations [gram.dcl.dcl] */
11221 /* Parse an optional declaration-sequence.
11223 declaration-seq:
11224 declaration
11225 declaration-seq declaration */
11227 static void
11229 {
11231 {
11242 {
11243 /* A declaration consisting of a single semicolon is
11244 invalid. Allow it unless we're being pedantic. */
11249 }
11251 /* If we're entering or exiting a region that's implicitly
11252 extern "C", modify the lang context appropriately. */
11254 {
11257 }
11259 {
11262 }
11265 {
11266 /* A top-level declaration can consist solely of a #pragma.
11267 A nested declaration cannot, so this is done here and not
11268 in cp_parser_declaration. (A #pragma at block scope is
11269 handled in cp_parser_statement.) */
11272 }
11274 /* Parse the declaration itself. */
11276 }
11277 }
11279 /* Parse a declaration.
11281 declaration:
11282 block-declaration
11283 function-definition
11284 template-declaration
11285 explicit-instantiation
11286 explicit-specialization
11287 linkage-specification
11288 namespace-definition
11290 GNU extension:
11292 declaration:
11293 __extension__ declaration */
11295 static void
11297 {
11298 cp_token token1;
11299 cp_token token2;
11304 /* Check for the `__extension__' keyword. */
11306 {
11307 /* Parse the qualified declaration. */
11309 /* Restore the PEDANTIC flag. */
11313 }
11315 /* Try to figure out what kind of declaration is present. */
11320 else
11321 {
11324 }
11326 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11329 /* If the next token is `extern' and the following token is a string
11330 literal, then we have a linkage specification. */
11334 /* If the next token is `template', then we have either a template
11335 declaration, an explicit instantiation, or an explicit
11336 specialization. */
11338 {
11339 /* `template <>' indicates a template specialization. */
11343 /* `template <' indicates a template declaration. */
11346 /* Anything else must be an explicit instantiation. */
11347 else
11349 }
11350 /* If the next token is `export', then we have a template
11351 declaration. */
11354 /* If the next token is `extern', 'static' or 'inline' and the one
11355 after that is `template', we have a GNU extended explicit
11356 instantiation directive. */
11363 /* If the next token is `namespace', check for a named or unnamed
11364 namespace definition. */
11370 /* An unnamed namespace definition. */
11374 /* An inline (associated) namespace definition. */
11378 /* Objective-C++ declaration/definition. */
11385 /* We must have either a block declaration or a function
11386 definition. */
11387 else
11388 /* Try to parse a block-declaration, or a function-definition. */
11391 /* Free any declarators allocated. */
11393 }
11395 /* Parse a block-declaration.
11397 block-declaration:
11398 simple-declaration
11399 asm-definition
11400 namespace-alias-definition
11401 using-declaration
11402 using-directive
11404 GNU Extension:
11406 block-declaration:
11407 __extension__ block-declaration
11409 C++0x Extension:
11411 block-declaration:
11412 static_assert-declaration
11414 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11415 part of a declaration-statement. */
11417 static void
11420 {
11424 /* Check for the `__extension__' keyword. */
11426 {
11427 /* Parse the qualified declaration. */
11429 /* Restore the PEDANTIC flag. */
11433 }
11435 /* Peek at the next token to figure out which kind of declaration is
11436 present. */
11439 /* If the next keyword is `asm', we have an asm-definition. */
11441 {
11445 }
11446 /* If the next keyword is `namespace', we have a
11447 namespace-alias-definition. */
11450 /* If the next keyword is `using', we have a
11451 using-declaration, a using-directive, or an alias-declaration. */
11453 {
11458 /* If the token after `using' is `namespace', then we have a
11459 using-directive. */
11463 /* If the second token after 'using' is '=', then we have an
11464 alias-declaration. */
11470 /* Otherwise, it's a using-declaration. */
11471 else
11474 }
11475 /* If the next keyword is `__label__' we have a misplaced label
11476 declaration. */
11478 {
11482 /* If the next token is now a `;', consume it. */
11485 }
11486 /* If the next token is `static_assert' we have a static assertion. */
11489 /* Anything else must be a simple-declaration. */
11490 else
11493 }
11495 /* Parse a simple-declaration.
11497 simple-declaration:
11498 decl-specifier-seq [opt] init-declarator-list [opt] ;
11500 init-declarator-list:
11501 init-declarator
11502 init-declarator-list , init-declarator
11504 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11505 function-definition as a simple-declaration.
11507 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11508 parsed declaration if it is an uninitialized single declarator not followed
11509 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11510 if present, will not be consumed. */
11512 static void
11516 {
11517 cp_decl_specifier_seq decl_specifiers;
11526 /* Defer access checks until we know what is being declared; the
11527 checks for names appearing in the decl-specifier-seq should be
11528 done as if we were in the scope of the thing being declared. */
11531 /* Parse the decl-specifier-seq. We have to keep track of whether
11532 or not the decl-specifier-seq declares a named class or
11533 enumeration type, since that is the only case in which the
11534 init-declarator-list is allowed to be empty.
11536 [dcl.dcl]
11538 In a simple-declaration, the optional init-declarator-list can be
11539 omitted only when declaring a class or enumeration, that is when
11540 the decl-specifier-seq contains either a class-specifier, an
11541 elaborated-type-specifier, or an enum-specifier. */
11543 CP_PARSER_FLAGS_OPTIONAL,
11546 /* We no longer need to defer access checks. */
11549 /* In a block scope, a valid declaration must always have a
11550 decl-specifier-seq. By not trying to parse declarators, we can
11551 resolve the declaration/expression ambiguity more quickly. */
11554 {
11557 }
11559 /* If the next two tokens are both identifiers, the code is
11560 erroneous. The usual cause of this situation is code like:
11562 T t;
11564 where "T" should name a type -- but does not. */
11567 {
11568 /* If parsing tentatively, we should commit; we really are
11569 looking at a declaration. */
11571 /* Give up. */
11573 }
11575 /* If we have seen at least one decl-specifier, and the next token
11576 is not a parenthesis, then we must be looking at a declaration.
11577 (After "int (" we might be looking at a functional cast.) */
11584 /* Keep going until we hit the `;' at the end of the simple
11585 declaration. */
11588 CPP_SEMICOLON))
11589 {
11592 tree decl;
11595 {
11596 /* If we are processing next declarator, comma is expected */
11601 {
11605 }
11606 }
11607 else
11610 /* Parse the init-declarator. */
11613 function_definition_allowed_p,
11615 declares_class_or_enum,
11617 maybe_range_for_decl,
11619 /* If an error occurred while parsing tentatively, exit quickly.
11620 (That usually happens when in the body of a function; each
11621 statement is treated as a declaration-statement until proven
11622 otherwise.) */
11625 /* Handle function definitions specially. */
11627 {
11628 /* If the next token is a `,', then we are probably
11629 processing something like:
11631 void f() {}, *p;
11633 which is erroneous. */
11635 {
11638 "mixing"
11640 }
11641 /* Otherwise, we're done with the list of declarators. */
11642 else
11643 {
11646 }
11647 }
11650 /* The next token should be either a `,' or a `;'. */
11652 /* If it's a `,', there are more declarators to come. */
11655 /* If it's a `;', we are done. */
11658 /* Anything else is an error. */
11659 else
11660 {
11661 /* If we have already issued an error message we don't need
11662 to issue another one. */
11667 /* Skip tokens until we reach the end of the statement. */
11669 /* If the next token is now a `;', consume it. */
11673 }
11674 /* After the first time around, a function-definition is not
11675 allowed -- even if it was OK at first. For example:
11677 int i, f() {}
11679 is not valid. */
11681 }
11683 /* Issue an error message if no declarators are present, and the
11684 decl-specifier-seq does not itself declare a class or
11685 enumeration: [dcl.dcl]/3. */
11687 {
11689 {
11693 /* Ensure an error is issued anyway when finish_decltype_type,
11694 called via cp_parser_decl_specifier_seq, returns a class or
11695 an enumeration (c++/51786). */
11698 }
11699 /* Perform any deferred access checks. */
11701 }
11703 /* Consume the `;'. */
11707 {
11713 }
11715 done:
11717 }
11719 /* Parse a decl-specifier-seq.
11721 decl-specifier-seq:
11722 decl-specifier-seq [opt] decl-specifier
11723 decl-specifier attribute-specifier-seq [opt] (C++11)
11725 decl-specifier:
11726 storage-class-specifier
11727 type-specifier
11728 function-specifier
11729 friend
11730 typedef
11732 GNU Extension:
11734 decl-specifier:
11735 attributes
11737 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11739 The parser flags FLAGS is used to control type-specifier parsing.
11741 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11742 flags:
11744 1: one of the decl-specifiers is an elaborated-type-specifier
11745 (i.e., a type declaration)
11746 2: one of the decl-specifiers is an enum-specifier or a
11747 class-specifier (i.e., a type definition)
11749 */
11751 static void
11753 cp_parser_flags flags,
11756 {
11760 cp_decl_spec ds;
11762 /* Clear DECL_SPECS. */
11765 /* Assume no class or enumeration type is declared. */
11768 /* Keep reading specifiers until there are no more to read. */
11770 {
11775 /* Peek at the next token. */
11778 /* Save the first token of the decl spec list for error
11779 reporting. */
11782 /* Handle attributes. */
11784 {
11785 /* Parse the attributes. */
11788 /* In a sequence of declaration specifiers, c++11 attributes
11789 appertain to the type that precede them. In that case
11790 [dcl.spec]/1 says:
11792 The attribute-specifier-seq affects the type only for
11793 the declaration it appears in, not other declarations
11794 involving the same type.
11796 But for now let's force the user to position the
11797 attribute either at the beginning of the declaration or
11798 after the declarator-id, which would clearly mean that it
11799 applies to the declarator. */
11801 {
11803 /* The c++11 attribute is at the beginning of the
11804 declaration. It appertains to the entity being
11806 else
11807 {
11809 {
11810 /* This is an attribute following a
11811 class-specifier. */
11816 }
11817 else
11818 {
11819 decl_specs->std_attributes
11821 attrs);
11824 }
11826 }
11827 }
11829 decl_specs->attributes
11831 attrs);
11835 }
11836 /* Assume we will find a decl-specifier keyword. */
11838 /* If the next token is an appropriate keyword, we can simply
11839 add it to the list. */
11841 {
11842 /* decl-specifier:
11843 friend
11844 constexpr */
11847 {
11850 }
11851 else
11852 {
11854 /* Consume the token. */
11856 }
11864 /* function-specifier:
11865 inline
11866 virtual
11867 explicit */
11874 /* decl-specifier:
11875 typedef */
11878 /* Consume the token. */
11880 /* A constructor declarator cannot appear in a typedef. */
11882 /* The "typedef" keyword can only occur in a declaration; we
11883 may as well commit at this point. */
11890 /* storage-class-specifier:
11891 auto
11892 register
11893 static
11894 extern
11895 mutable
11897 GNU Extension:
11898 thread */
11901 {
11902 /* Consume the token. */
11905 /* Complain about `auto' as a storage specifier, if
11906 we're complaining about C++0x compatibility. */
11910 /* Set the storage class anyway. */
11912 token);
11913 }
11914 else
11915 /* C++0x auto type-specifier. */
11923 /* Consume the token. */
11926 token);
11929 /* Consume the token. */
11935 /* We did not yet find a decl-specifier yet. */
11938 }
11948 /* Constructors are a special case. The `S' in `S()' is not a
11949 decl-specifier; it is the beginning of the declarator. */
11950 constructor_p
11951 = (!found_decl_spec
11952 && constructor_possible_p
11953 && (cp_parser_constructor_declarator_p
11956 /* If we don't have a DECL_SPEC yet, then we must be looking at
11957 a type-specifier. */
11959 {
11962 tree type_spec;
11964 type_spec
11966 decl_specs,
11972 /* If this type-specifier referenced a user-defined type
11973 (a typedef, class-name, etc.), then we can't allow any
11974 more such type-specifiers henceforth.
11976 [dcl.spec]
11978 The longest sequence of decl-specifiers that could
11979 possibly be a type name is taken as the
11980 decl-specifier-seq of a declaration. The sequence shall
11981 be self-consistent as described below.
11983 [dcl.type]
11985 As a general rule, at most one type-specifier is allowed
11986 in the complete decl-specifier-seq of a declaration. The
11987 only exceptions are the following:
11989 -- const or volatile can be combined with any other
11990 type-specifier.
11992 -- signed or unsigned can be combined with char, long,
11993 short, or int.
11995 -- ..
11997 Example:
11999 typedef char* Pc;
12000 void g (const int Pc);
12002 Here, Pc is *not* part of the decl-specifier seq; it's
12003 the declarator. Therefore, once we see a type-specifier
12004 (other than a cv-qualifier), we forbid any additional
12005 user-defined types. We *do* still allow things like `int
12006 int' to be considered a decl-specifier-seq, and issue the
12007 error message later. */
12010 /* A constructor declarator cannot follow a type-specifier. */
12012 {
12017 }
12018 }
12020 /* If we still do not have a DECL_SPEC, then there are no more
12021 decl-specifiers. */
12026 /* After we see one decl-specifier, further decl-specifiers are
12027 always optional. */
12029 }
12031 /* Don't allow a friend specifier with a class definition. */
12036 }
12038 /* Parse an (optional) storage-class-specifier.
12040 storage-class-specifier:
12041 auto
12042 register
12043 static
12044 extern
12045 mutable
12047 GNU Extension:
12049 storage-class-specifier:
12050 thread
12052 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12054 static tree
12056 {
12058 {
12062 /* Fall through for C++98. */
12069 /* Consume the token. */
12074 }
12075 }
12077 /* Parse an (optional) function-specifier.
12079 function-specifier:
12080 inline
12081 virtual
12082 explicit
12084 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12085 Updates DECL_SPECS, if it is non-NULL. */
12087 static tree
12090 {
12093 {
12099 /* 14.5.2.3 [temp.mem]
12101 A member function template shall not be virtual. */
12104 else
12114 }
12116 /* Consume the token. */
12118 }
12120 /* Parse a linkage-specification.
12122 linkage-specification:
12123 extern string-literal { declaration-seq [opt] }
12124 extern string-literal declaration */
12126 static void
12128 {
12129 tree linkage;
12131 /* Look for the `extern' keyword. */
12134 /* Look for the string-literal. */
12137 /* Transform the literal into an identifier. If the literal is a
12138 wide-character string, or contains embedded NULs, then we can't
12139 handle it as the user wants. */
12142 {
12144 /* Assume C++ linkage. */
12146 }
12147 else
12150 /* We're now using the new linkage. */
12153 /* If the next token is a `{', then we're using the first
12154 production. */
12156 {
12159 /* Consume the `{' token. */
12161 /* Parse the declarations. */
12163 /* Look for the closing `}'. */
12165 }
12166 /* Otherwise, there's just one declaration. */
12167 else
12168 {
12171 saved_in_unbraced_linkage_specification_p
12175 parser->in_unbraced_linkage_specification_p
12177 }
12179 /* We're done with the linkage-specification. */
12181 }
12183 /* Parse a static_assert-declaration.
12185 static_assert-declaration:
12186 static_assert ( constant-expression , string-literal ) ;
12187 static_assert ( constant-expression ) ; (C++1Z)
12189 If MEMBER_P, this static_assert is a class member. */
12191 static void
12193 {
12194 tree condition;
12195 tree message;
12197 location_t saved_loc;
12200 /* Peek at the `static_assert' token so we can keep track of exactly
12201 where the static assertion started. */
12205 /* Look for the `static_assert' keyword. */
12207 RT_STATIC_ASSERT))
12210 /* We know we are in a static assertion; commit to any tentative
12211 parse. */
12215 /* Parse the `(' starting the static assertion condition. */
12218 /* Parse the constant-expression. Allow a non-constant expression
12219 here in order to give better diagnostics in finish_static_assert. */
12220 condition =
12226 {
12229 "static_assert without a message "
12231 /* Eat the ')' */
12236 }
12237 else
12238 {
12239 /* Parse the separating `,'. */
12242 /* Parse the string-literal message. */
12247 /* A `)' completes the static assertion. */
12253 }
12255 /* A semicolon terminates the declaration. */
12258 /* Complete the static assertion, which may mean either processing
12259 the static assert now or saving it for template instantiation. */
12261 }
12263 /* Parse the expression in decltype ( expression ). */
12265 static tree
12268 {
12270 tree expr;
12272 /* First, try parsing an id-expression. */
12283 {
12286 cp_id_kind idk;
12290 /* Lookup the name we got back from the id-expression. */
12300 {
12301 /* Complete lookup of the id-expression. */
12302 expr = (finish_id_expression
12315 /* We found an id-expression, but it was something that we
12316 should not have found. This is an error, not something
12317 we can recover from, so note that we found an
12318 id-expression and we'll recover as gracefully as
12319 possible. */
12321 }
12326 /* We have an id-expression. */
12328 }
12331 {
12332 /* Abort the id-expression parse. */
12335 /* Parsing tentatively, again. */
12338 /* Parse a class member access. */
12346 /* We have an id-expression. */
12348 }
12351 /* We have parsed the complete id-expression or member access. */
12353 else
12354 {
12355 /* Abort our attempt to parse an id-expression or member access
12356 expression. */
12359 /* Parse a full expression. */
12362 }
12365 }
12367 /* Parse a `decltype' type. Returns the type.
12369 simple-type-specifier:
12370 decltype ( expression )
12371 C++14 proposal:
12372 decltype ( auto ) */
12374 static tree
12376 {
12377 tree expr;
12386 {
12387 /* Already parsed. */
12390 }
12392 /* Look for the `decltype' token. */
12396 /* Parse the opening `('. */
12400 /* decltype (auto) */
12403 {
12410 }
12412 /* Types cannot be defined in a `decltype' expression. Save away the
12413 old message. */
12416 /* And create the new one. */
12417 parser->type_definition_forbidden_message
12420 /* The restrictions on constant-expressions do not apply inside
12421 decltype expressions. */
12422 saved_integral_constant_expression_p
12424 saved_non_integral_constant_expression_p
12428 /* Within a parenthesized expression, a `>' token is always
12429 the greater-than operator. */
12430 saved_greater_than_is_operator_p
12434 /* Do not actually evaluate the expression. */
12437 /* Do not warn about problems with the expression. */
12442 /* Go back to evaluating expressions. */
12446 /* The `>' token might be the end of a template-id or
12447 template-parameter-list now. */
12448 parser->greater_than_is_operator_p
12451 /* Restore the old message and the integral constant expression
12452 flags. */
12454 parser->integral_constant_expression_p
12456 parser->non_integral_constant_expression_p
12459 /* Parse to the closing `)'. */
12461 {
12465 }
12468 tf_warning_or_error);
12470 rewrite:
12471 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12472 it again. */
12479 }
12481 /* Special member functions [gram.special] */
12483 /* Parse a conversion-function-id.
12485 conversion-function-id:
12486 operator conversion-type-id
12488 Returns an IDENTIFIER_NODE representing the operator. */
12490 static tree
12492 {
12493 tree type;
12494 tree saved_scope;
12495 tree saved_qualifying_scope;
12496 tree saved_object_scope;
12499 /* Look for the `operator' token. */
12502 /* When we parse the conversion-type-id, the current scope will be
12503 reset. However, we need that information in able to look up the
12504 conversion function later, so we save it here. */
12508 /* We must enter the scope of the class so that the names of
12509 entities declared within the class are available in the
12510 conversion-type-id. For example, consider:
12512 struct S {
12513 typedef int I;
12514 operator I();
12515 };
12517 S::operator I() { ... }
12519 In order to see that `I' is a type-name in the definition, we
12520 must be in the scope of `S'. */
12523 /* Parse the conversion-type-id. */
12525 /* Leave the scope of the class, if any. */
12528 /* Restore the saved scope. */
12532 /* If the TYPE is invalid, indicate failure. */
12536 }
12538 /* Parse a conversion-type-id:
12540 conversion-type-id:
12541 type-specifier-seq conversion-declarator [opt]
12543 Returns the TYPE specified. */
12545 static tree
12547 {
12548 tree attributes;
12549 cp_decl_specifier_seq type_specifiers;
12551 tree type_specified;
12554 /* Parse the attributes. */
12558 parser->type_definition_forbidden_message
12561 /* Parse the type-specifiers. */
12568 /* If that didn't work, stop. */
12571 /* Parse the conversion-declarator. */
12579 /* Don't give this error when parsing tentatively. This happens to
12580 work because we always parse this definitively once. */
12583 {
12585 {
12588 }
12592 }
12595 }
12597 /* Parse an (optional) conversion-declarator.
12599 conversion-declarator:
12600 ptr-operator conversion-declarator [opt]
12602 */
12606 {
12609 cp_cv_quals cv_quals;
12611 /* We don't know if there's a ptr-operator next, or not. */
12613 /* Try the ptr-operator. */
12616 /* If it worked, look for more conversion-declarators. */
12618 {
12621 /* Parse another optional declarator. */
12624 declarator = cp_parser_make_indirect_declarator
12628 }
12631 }
12633 /* Parse an (optional) ctor-initializer.
12635 ctor-initializer:
12636 : mem-initializer-list
12638 Returns TRUE iff the ctor-initializer was actually present. */
12640 static bool
12642 {
12643 /* If the next token is not a `:', then there is no
12644 ctor-initializer. */
12646 {
12647 /* Do default initialization of any bases and members. */
12652 }
12654 /* Consume the `:' token. */
12656 /* And the mem-initializer-list. */
12660 }
12662 /* Parse a mem-initializer-list.
12664 mem-initializer-list:
12665 mem-initializer ... [opt]
12666 mem-initializer ... [opt] , mem-initializer-list */
12668 static void
12670 {
12675 /* Let the semantic analysis code know that we are starting the
12676 mem-initializer-list. */
12681 /* Loop through the list. */
12683 {
12684 tree mem_initializer;
12687 /* Parse the mem-initializer. */
12689 /* If the next token is a `...', we're expanding member initializers. */
12691 {
12692 /* Consume the `...'. */
12695 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12696 can be expanded but members cannot. */
12699 {
12704 }
12706 /* Construct the pack expansion type. */
12709 }
12712 {
12716 }
12717 /* Look for a target constructor. */
12721 {
12724 {
12728 }
12730 }
12731 /* Add it to the list, unless it was erroneous. */
12733 {
12736 }
12737 /* If the next token is not a `,', we're done. */
12740 /* Consume the `,' token. */
12742 }
12744 /* Perform semantic analysis. */
12747 }
12749 /* Parse a mem-initializer.
12751 mem-initializer:
12752 mem-initializer-id ( expression-list [opt] )
12753 mem-initializer-id braced-init-list
12755 GNU extension:
12757 mem-initializer:
12758 ( expression-list [opt] )
12760 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12761 class) or FIELD_DECL (for a non-static data member) to initialize;
12762 the TREE_VALUE is the expression-list. An empty initialization
12763 list is represented by void_list_node. */
12765 static tree
12767 {
12768 tree mem_initializer_id;
12769 tree expression_list;
12770 tree member;
12773 /* Find out what is being initialized. */
12775 {
12779 }
12780 else
12781 {
12785 }
12791 {
12798 }
12799 else
12800 {
12810 }
12820 }
12822 /* Parse a mem-initializer-id.
12824 mem-initializer-id:
12825 :: [opt] nested-name-specifier [opt] class-name
12826 decltype-specifier (C++11)
12827 identifier
12829 Returns a TYPE indicating the class to be initialized for the first
12830 production (and the second in C++11). Returns an IDENTIFIER_NODE
12831 indicating the data member to be initialized for the last production. */
12833 static tree
12835 {
12839 tree id;
12843 /* `typename' is not allowed in this context ([temp.res]). */
12845 {
12847 "keyword %<typename%> not allowed in this context (a qualified "
12850 }
12851 /* Look for the optional `::' operator. */
12852 global_scope_p
12856 /* Look for the optional nested-name-specifier. The simplest way to
12857 implement:
12859 [temp.res]
12861 The keyword `typename' is not permitted in a base-specifier or
12862 mem-initializer; in these contexts a qualified name that
12863 depends on a template-parameter is implicitly assumed to be a
12864 type name.
12866 is to assume that we have seen the `typename' keyword at this
12867 point. */
12868 nested_name_specifier_p
12877 /* If there is a `::' operator or a nested-name-specifier, then we
12878 are definitely looking for a class-name. */
12883 typename_type,
12887 /* Otherwise, we could also be looking for an ordinary identifier. */
12890 /* Try a decltype-specifier. */
12892 else
12893 /* Otherwise, try a class-name. */
12897 none_type,
12901 /* If we found one, we're done. */
12904 /* Otherwise, look for an ordinary identifier. */
12906 }
12908 /* Overloading [gram.over] */
12910 /* Parse an operator-function-id.
12912 operator-function-id:
12913 operator operator
12915 Returns an IDENTIFIER_NODE for the operator which is a
12916 human-readable spelling of the identifier, e.g., `operator +'. */
12918 static tree
12920 {
12921 /* Look for the `operator' keyword. */
12924 /* And then the name of the operator itself. */
12926 }
12928 /* Return an identifier node for a user-defined literal operator.
12929 The suffix identifier is chained to the operator name identifier. */
12931 static tree
12933 {
12934 tree identifier;
12941 }
12943 /* Parse an operator.
12945 operator:
12946 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12947 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12948 || ++ -- , ->* -> () []
12950 GNU Extensions:
12952 operator:
12953 <? >? <?= >?=
12955 Returns an IDENTIFIER_NODE for the operator which is a
12956 human-readable spelling of the identifier, e.g., `operator +'. */
12958 static tree
12960 {
12965 /* Peek at the next token. */
12967 /* Figure out which operator we have. */
12969 {
12971 {
12974 /* The keyword should be either `new' or `delete'. */
12979 else
12982 /* Consume the `new' or `delete' token. */
12985 /* Peek at the next token. */
12987 /* If it's a `[' token then this is the array variant of the
12988 operator. */
12990 {
12991 /* Consume the `[' token. */
12993 /* Look for the `]' token. */
12997 }
12998 /* Otherwise, we have the non-array variant. */
12999 else
13003 }
13150 /* Consume the `('. */
13152 /* Look for the matching `)'. */
13157 /* Consume the `['. */
13159 /* Look for the matching `]'. */
13174 {
13181 /* Consume the string. */
13187 {
13190 }
13191 else
13192 {
13194 /* Look for the suffix identifier. */
13199 {
13203 }
13204 else
13205 {
13208 }
13209 }
13214 {
13217 }
13220 {
13223 }
13225 {
13228 }
13230 }
13233 /* Anything else is an error. */
13235 }
13237 /* If we have selected an identifier, we need to consume the
13238 operator token. */
13241 /* Otherwise, no valid operator name was present. */
13242 else
13243 {
13246 }
13249 }
13251 /* Parse a template-declaration.
13253 template-declaration:
13254 export [opt] template < template-parameter-list > declaration
13256 If MEMBER_P is TRUE, this template-declaration occurs within a
13257 class-specifier.
13259 The grammar rule given by the standard isn't correct. What
13260 is really meant is:
13262 template-declaration:
13263 export [opt] template-parameter-list-seq
13264 decl-specifier-seq [opt] init-declarator [opt] ;
13265 export [opt] template-parameter-list-seq
13266 function-definition
13268 template-parameter-list-seq:
13269 template-parameter-list-seq [opt]
13270 template < template-parameter-list > */
13272 static void
13274 {
13275 /* Check for `export'. */
13277 {
13278 /* Consume the `export' token. */
13280 /* Warn that we do not support `export'. */
13282 }
13285 }
13287 /* Parse a template-parameter-list.
13289 template-parameter-list:
13290 template-parameter
13291 template-parameter-list , template-parameter
13293 Returns a TREE_LIST. Each node represents a template parameter.
13294 The nodes are connected via their TREE_CHAINs. */
13296 static tree
13298 {
13303 /* The loop below parses the template parms. We first need to know
13304 the total number of template parms to be able to compute proper
13305 canonical types of each dependent type. So after the loop, when
13306 we know the total number of template parms,
13307 end_template_parm_list computes the proper canonical types and
13308 fixes up the dependent types accordingly. */
13310 {
13311 tree parameter;
13314 location_t parm_loc;
13316 /* Parse the template-parameter. */
13321 /* Add it to the list. */
13324 parm_loc,
13325 parameter,
13326 is_non_type,
13327 is_parameter_pack);
13328 else
13329 {
13332 }
13334 /* If the next token is not a `,', we're done. */
13337 /* Otherwise, consume the `,' token. */
13339 }
13342 }
13344 /* Parse a default argument for a type template-parameter.
13345 Note that diagnostics are handled in cp_parser_template_parameter. */
13347 static tree
13349 {
13352 /* Consume the `=' token. */
13355 /* Parse the default-argument. */
13361 }
13363 /* Parse a default argument for a template template-parameter. */
13365 static tree
13367 {
13372 /* Consume the `='. */
13374 /* Parse the id-expression. */
13376 /* save token before parsing the id-expression, for error
13377 reporting */
13379 tree default_argument
13387 /* If the id-expression was a template-id that refers to
13388 a template-class, we already have the declaration here,
13389 so no further lookup is needed. */
13390 ;
13391 else
13392 /* Look up the name. */
13393 default_argument
13395 none_type,
13401 /* See if the default argument is valid. */
13405 }
13407 /* Parse a template-parameter.
13409 template-parameter:
13410 type-parameter
13411 parameter-declaration
13413 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13414 the parameter. The TREE_PURPOSE is the default value, if any.
13415 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13416 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13417 set to true iff this parameter is a parameter pack. */
13419 static tree
13422 {
13425 tree parm;
13427 /* Assume it is a type parameter or a template parameter. */
13429 /* Assume it not a parameter pack. */
13431 /* Peek at the next token. */
13433 /* If it is `class' or `template', we have a type-parameter. */
13436 /* If it is `class' or `typename' we do not know yet whether it is a
13437 type parameter or a non-type parameter. Consider:
13439 template <typename T, typename T::X X> ...
13441 or:
13443 template <class C, class D*> ...
13445 Here, the first parameter is a type parameter, and the second is
13446 a non-type parameter. We can tell by looking at the token after
13447 the identifier -- if it is a `,', `=', or `>' then we have a type
13448 parameter. */
13450 {
13451 /* Peek at the token after `class' or `typename'. */
13453 /* If it's an ellipsis, we have a template type parameter
13454 pack. */
13457 /* If it's an identifier, skip it. */
13460 /* Now, see if the token looks like the end of a template
13461 parameter. */
13466 }
13468 /* Otherwise, it is a non-type parameter.
13470 [temp.param]
13472 When parsing a default template-argument for a non-type
13473 template-parameter, the first non-nested `>' is taken as the end
13474 of the template parameter-list rather than a greater-than
13475 operator. */
13477 parameter_declarator
13484 /* If the parameter declaration is marked as a parameter pack, set
13485 *IS_PARAMETER_PACK to notify the caller. */
13490 {
13491 /* Can happen in some cases of erroneous input (c++/34892). */
13493 /* Consume the `...' for better error recovery. */
13495 }
13505 }
13507 /* Parse a type-parameter.
13509 type-parameter:
13510 class identifier [opt]
13511 class identifier [opt] = type-id
13512 typename identifier [opt]
13513 typename identifier [opt] = type-id
13514 template < template-parameter-list > class identifier [opt]
13515 template < template-parameter-list > class identifier [opt]
13516 = id-expression
13518 GNU Extension (variadic templates):
13520 type-parameter:
13521 class ... identifier [opt]
13522 typename ... identifier [opt]
13524 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13525 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13526 the declaration of the parameter.
13528 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13530 static tree
13532 {
13534 tree parameter;
13536 /* Look for a keyword to tell us what kind of parameter this is. */
13542 {
13545 {
13546 tree identifier;
13547 tree default_argument;
13549 /* If the next token is an ellipsis, we have a template
13550 argument pack. */
13552 {
13553 /* Consume the `...' token. */
13558 }
13560 /* If the next token is an identifier, then it names the
13561 parameter. */
13564 else
13567 /* Create the parameter. */
13570 /* If the next token is an `=', we have a default argument. */
13572 {
13573 default_argument
13576 /* Template parameter packs cannot have default
13577 arguments. */
13579 {
13582 "template parameter pack %qD cannot have a "
13584 else
13586 "template parameter packs cannot have "
13589 }
13592 }
13593 else
13596 /* Create the combined representation of the parameter and the
13597 default argument. */
13599 }
13603 {
13604 tree identifier;
13605 tree default_argument;
13607 /* Look for the `<'. */
13609 /* Parse the template-parameter-list. */
13611 /* Look for the `>'. */
13613 /* Look for the `class' or 'typename' keywords. */
13615 /* If the next token is an ellipsis, we have a template
13616 argument pack. */
13618 {
13619 /* Consume the `...' token. */
13624 }
13625 /* If the next token is an `=', then there is a
13626 default-argument. If the next token is a `>', we are at
13627 the end of the parameter-list. If the next token is a `,',
13628 then we are at the end of this parameter. */
13632 {
13634 /* Treat invalid names as if the parameter were nameless. */
13637 }
13638 else
13641 /* Create the template parameter. */
13643 identifier);
13645 /* If the next token is an `=', then there is a
13646 default-argument. */
13648 {
13649 default_argument
13652 /* Template parameter packs cannot have default
13653 arguments. */
13655 {
13658 "template parameter pack %qD cannot "
13660 identifier);
13661 else
13665 }
13666 }
13667 else
13670 /* Create the combined representation of the parameter and the
13671 default argument. */
13673 }
13679 }
13682 }
13684 /* Parse a template-id.
13686 template-id:
13687 template-name < template-argument-list [opt] >
13689 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13690 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13691 returned. Otherwise, if the template-name names a function, or set
13692 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13693 names a class, returns a TYPE_DECL for the specialization.
13695 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13696 uninstantiated templates. */
13698 static tree
13704 {
13706 tree templ;
13707 tree arguments;
13708 tree template_id;
13715 /* If the next token corresponds to a template-id, there is no need
13716 to reparse it. */
13719 {
13722 /* Get the stored value. */
13724 /* Perform any access checks that were deferred. */
13727 {
13732 tf_warning_or_error);
13733 }
13734 /* Return the stored value. */
13736 }
13738 /* Avoid performing name lookup if there is no possibility of
13739 finding a template-id. */
13742 && !cp_parser_nth_token_starts_template_argument_list_p
13744 {
13747 }
13749 /* Remember where the template-id starts. */
13755 /* Parse the template-name. */
13758 check_dependency_p,
13759 is_declaration,
13760 tag_type,
13763 {
13766 }
13768 /* If we find the sequence `[:' after a template-name, it's probably
13769 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13770 parse correctly the argument list. */
13777 {
13779 /* Change `:' into `::'. */
13781 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13782 CPP_LESS. */
13785 /* Parse the arguments. */
13788 {
13789 /* If we couldn't parse an argument list, then we revert our changes
13790 and return simply an error. Maybe this is not a template-id
13791 after all. */
13796 }
13797 /* Otherwise, emit an error about the invalid digraph, but continue
13798 parsing because we got our argument list. */
13801 {
13804 "%<<:%> is an alternate spelling for %<[%>."
13807 {
13809 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13812 }
13813 }
13814 }
13815 else
13816 {
13817 /* Look for the `<' that starts the template-argument-list. */
13819 {
13822 }
13823 /* Parse the arguments. */
13825 }
13827 /* Build a representation of the specialization. */
13830 TEMPLATE_ID_EXPR,
13834 {
13836 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13837 template (rather than some instantiation thereof) only if
13838 is not nested within some other construct. For example, in
13839 "template <typename T> void f(T) { A<T>::", A<T> is just an
13840 instantiation of A. */
13843 CPP_SCOPE));
13844 template_id
13846 }
13848 {
13852 }
13853 else
13854 {
13855 /* If it's not a class-template or a template-template, it should be
13856 a function-template. */
13864 }
13866 /* If parsing tentatively, replace the sequence of tokens that makes
13867 up the template-id with a CPP_TEMPLATE_ID token. That way,
13868 should we re-parse the token stream, we will not have to repeat
13869 the effort required to do the parse, nor will we issue duplicate
13870 error messages about problems during instantiation of the
13871 template. */
13873 /* Don't do this if we had a parse error in a declarator; re-parsing
13874 might succeed if a name changes meaning (60361). */
13878 {
13881 /* Reset the contents of the START_OF_ID token. */
13883 /* Retrieve any deferred checks. Do not pop this access checks yet
13884 so the memory will not be reclaimed during token replacing below. */
13890 /* Purge all subsequent tokens. */
13893 /* ??? Can we actually assume that, if template_id ==
13894 error_mark_node, we will have issued a diagnostic to the
13895 user, as opposed to simply marking the tentative parse as
13896 failed? */
13899 }
13903 }
13905 /* Parse a template-name.
13907 template-name:
13908 identifier
13910 The standard should actually say:
13912 template-name:
13913 identifier
13914 operator-function-id
13916 A defect report has been filed about this issue.
13918 A conversion-function-id cannot be a template name because they cannot
13919 be part of a template-id. In fact, looking at this code:
13921 a.operator K<int>()
13923 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13924 It is impossible to call a templated conversion-function-id with an
13925 explicit argument list, since the only allowed template parameter is
13926 the type to which it is converting.
13928 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13929 `template' keyword, in a construction like:
13931 T::template f<3>()
13933 In that case `f' is taken to be a template-name, even though there
13934 is no way of knowing for sure.
13936 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13937 name refers to a set of overloaded functions, at least one of which
13938 is a template, or an IDENTIFIER_NODE with the name of the template,
13939 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13940 names are looked up inside uninstantiated templates. */
13942 static tree
13949 {
13950 tree identifier;
13951 tree decl;
13952 tree fns;
13955 /* If the next token is `operator', then we have either an
13956 operator-function-id or a conversion-function-id. */
13958 {
13959 /* We don't know whether we're looking at an
13960 operator-function-id or a conversion-function-id. */
13962 /* Try an operator-function-id. */
13964 /* If that didn't work, try a conversion-function-id. */
13966 {
13969 }
13970 }
13971 /* Look for the identifier. */
13972 else
13975 /* If we didn't find an identifier, we don't have a template-id. */
13979 /* If the name immediately followed the `template' keyword, then it
13980 is a template-name. However, if the next token is not `<', then
13981 we do not treat it as a template-name, since it is not being used
13982 as part of a template-id. This enables us to handle constructs
13983 like:
13985 template <typename T> struct S { S(); };
13986 template <typename T> S<T>::S();
13988 correctly. We would treat `S' as a template -- if it were `S<T>'
13989 -- but we do not if there is no `<'. */
13993 {
13994 /* In a declaration, in a dependent context, we pretend that the
13995 "template" keyword was present in order to improve error
13996 recovery. For example, given:
13998 template <typename T> void f(T::X<int>);
14000 we want to treat "X<int>" as a template-id. */
14002 && !template_keyword_p
14004 && check_dependency_p
14006 /* Do not do this for dtors (or ctors), since they never
14007 need the template keyword before their name. */
14009 {
14012 /* Explain what went wrong. */
14014 identifier);
14017 /* If parsing tentatively, find the location of the "<" token. */
14020 /* Parse the template arguments so that we can issue error
14021 messages about them. */
14024 /* Skip tokens until we find a good place from which to
14025 continue parsing. */
14030 /* If parsing tentatively, permanently remove the
14031 template argument list. That will prevent duplicate
14032 error messages from being issued about the missing
14033 "template" keyword. */
14039 }
14041 /* If the "template" keyword is present, then there is generally
14042 no point in doing name-lookup, so we just return IDENTIFIER.
14043 But, if the qualifying scope is non-dependent then we can
14044 (and must) do name-lookup normally. */
14050 }
14052 /* Look up the name. */
14054 tag_type,
14057 check_dependency_p,
14063 /* If DECL is a template, then the name was a template-name. */
14065 {
14069 }
14070 else
14071 {
14074 /* The standard does not explicitly indicate whether a name that
14075 names a set of overloaded declarations, some of which are
14076 templates, is a template-name. However, such a name should
14077 be a template-name; otherwise, there is no way to form a
14078 template-id for the overloaded templates. */
14086 {
14087 /* The name does not name a template. */
14090 }
14091 }
14093 /* If DECL is dependent, and refers to a function, then just return
14094 its name; we will look it up again during template instantiation. */
14096 {
14100 }
14103 }
14105 /* Parse a template-argument-list.
14107 template-argument-list:
14108 template-argument ... [opt]
14109 template-argument-list , template-argument ... [opt]
14111 Returns a TREE_VEC containing the arguments. */
14113 static tree
14115 {
14120 tree vec;
14127 /* Even if the template-id appears in an integral
14128 constant-expression, the contents of the argument list do
14129 not. */
14135 /* Parse the arguments. */
14136 do
14137 {
14138 tree argument;
14141 /* Consume the comma. */
14144 /* Parse the template-argument. */
14147 /* If the next token is an ellipsis, we're expanding a template
14148 argument pack. */
14150 {
14152 {
14156 }
14157 /* Consume the `...' token. */
14160 /* Make the argument into a TYPE_PACK_EXPANSION or
14161 EXPR_PACK_EXPANSION. */
14163 }
14166 {
14170 {
14173 }
14174 else
14176 }
14178 }
14191 #ifdef ENABLE_CHECKING
14193 #endif
14195 }
14197 /* Parse a template-argument.
14199 template-argument:
14200 assignment-expression
14201 type-id
14202 id-expression
14204 The representation is that of an assignment-expression, type-id, or
14205 id-expression -- except that the qualified id-expression is
14206 evaluated, so that the value returned is either a DECL or an
14207 OVERLOAD.
14209 Although the standard says "assignment-expression", it forbids
14210 throw-expressions or assignments in the template argument.
14211 Therefore, we use "conditional-expression" instead. */
14213 static tree
14215 {
14216 tree argument;
14222 cp_id_kind idk;
14224 /* There's really no way to know what we're looking at, so we just
14225 try each alternative in order.
14227 [temp.arg]
14229 In a template-argument, an ambiguity between a type-id and an
14230 expression is resolved to a type-id, regardless of the form of
14231 the corresponding template-parameter.
14233 Therefore, we try a type-id first. */
14236 /* If there was no error parsing the type-id but the next token is a
14237 '>>', our behavior depends on which dialect of C++ we're
14238 parsing. In C++98, we probably found a typo for '> >'. But there
14239 are type-id which are also valid expressions. For instance:
14241 struct X { int operator >> (int); };
14242 template <int V> struct Foo {};
14243 Foo<X () >> 5> r;
14245 Here 'X()' is a valid type-id of a function type, but the user just
14246 wanted to write the expression "X() >> 5". Thus, we remember that we
14247 found a valid type-id, but we still try to parse the argument as an
14248 expression to see what happens.
14250 In C++0x, the '>>' will be considered two separate '>'
14251 tokens. */
14255 {
14258 }
14259 else
14260 {
14261 /* If the next token isn't a `,' or a `>', then this argument wasn't
14262 really finished. This means that the argument is not a valid
14263 type-id. */
14266 /* If that worked, we're done. */
14269 }
14270 /* We're still not sure what the argument will be. */
14272 /* Try a template. */
14280 /* If the next token isn't a `,' or a `>', then this argument wasn't
14281 really finished. */
14285 {
14286 /* Figure out what is being referred to. If the id-expression
14287 was for a class template specialization, then we will have a
14288 TYPE_DECL at this point. There is no need to do name lookup
14289 at this point in that case. */
14292 none_type,
14301 }
14303 {
14307 }
14308 /* It must be a non-type argument. There permitted cases are given
14309 in [temp.arg.nontype]:
14311 -- an integral constant-expression of integral or enumeration
14312 type; or
14314 -- the name of a non-type template-parameter; or
14316 -- the name of an object or function with external linkage...
14318 -- the address of an object or function with external linkage...
14320 -- a pointer to member... */
14321 /* Look for a non-type template parameter. */
14323 {
14335 }
14337 /* If the next token is "&", the argument must be the address of an
14338 object or function with external linkage. */
14341 {
14344 }
14345 /* See if we might have an id-expression. */
14352 {
14355 address_p,
14362 else
14363 {
14364 tree probe;
14367 {
14368 /* Strip the dereference temporarily. */
14371 }
14373 /* If we're in a template, we represent a qualified-id referring
14374 to a static data member as a SCOPE_REF even if the scope isn't
14375 dependent so that we can check access control later. */
14380 {
14381 /* A variable without external linkage might still be a
14382 valid constant-expression, so no error is issued here
14383 if the external-linkage check fails. */
14386 }
14388 /* All overloaded functions are allowed; if the external
14389 linkage test does not pass, an error will be issued
14390 later. */
14391 ;
14395 /* A pointer-to-member. */
14396 ;
14398 ;
14399 else
14403 {
14406 tf_warning_or_error);
14407 else
14410 }
14411 }
14412 }
14413 /* If the argument started with "&", there are no other valid
14414 alternatives at this point. */
14416 {
14419 }
14421 /* If the argument wasn't successfully parsed as a type-id followed
14422 by '>>', the argument can only be a constant expression now.
14423 Otherwise, we try parsing the constant-expression tentatively,
14424 because the argument could really be a type-id. */
14435 /* We did our best to parse the argument as a non type-id, but that
14436 was the only alternative that matched (albeit with a '>' after
14437 it). We can assume it's just a typo from the user, and a
14438 diagnostic will then be issued. */
14440 }
14442 /* Parse an explicit-instantiation.
14444 explicit-instantiation:
14445 template declaration
14447 Although the standard says `declaration', what it really means is:
14449 explicit-instantiation:
14450 template decl-specifier-seq [opt] declarator [opt] ;
14452 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14453 supposed to be allowed. A defect report has been filed about this
14454 issue.
14456 GNU Extension:
14458 explicit-instantiation:
14459 storage-class-specifier template
14460 decl-specifier-seq [opt] declarator [opt] ;
14461 function-specifier template
14462 decl-specifier-seq [opt] declarator [opt] ; */
14464 static void
14466 {
14468 cp_decl_specifier_seq decl_specifiers;
14473 /* Look for an (optional) storage-class-specifier or
14474 function-specifier. */
14476 {
14477 extension_specifier
14480 extension_specifier
14483 }
14485 /* Look for the `template' keyword. */
14487 /* Let the front end know that we are processing an explicit
14488 instantiation. */
14490 /* [temp.explicit] says that we are supposed to ignore access
14491 control while processing explicit instantiation directives. */
14493 /* Parse a decl-specifier-seq. */
14495 CP_PARSER_FLAGS_OPTIONAL,
14498 /* If there was exactly one decl-specifier, and it declared a class,
14499 and there's no declarator, then we have an explicit type
14500 instantiation. */
14502 {
14503 tree type;
14507 /* Turn access control back on for names used during
14508 template instantiation. */
14513 }
14514 else
14515 {
14517 tree decl;
14519 /* Parse the declarator. */
14520 declarator
14531 {
14534 "explicit instantiation shall not use"
14538 "explicit instantiation shall not use"
14543 /* Turn access control back on for names used during
14544 template instantiation. */
14546 /* Do the explicit instantiation. */
14548 }
14549 else
14550 {
14552 /* Skip the body of the explicit instantiation. */
14554 }
14555 }
14556 /* We're done with the instantiation. */
14562 }
14564 /* Parse an explicit-specialization.
14566 explicit-specialization:
14567 template < > declaration
14569 Although the standard says `declaration', what it really means is:
14571 explicit-specialization:
14572 template <> decl-specifier [opt] init-declarator [opt] ;
14573 template <> function-definition
14574 template <> explicit-specialization
14575 template <> template-declaration */
14577 static void
14579 {
14583 /* Look for the `template' keyword. */
14585 /* Look for the `<'. */
14587 /* Look for the `>'. */
14589 /* We have processed another parameter list. */
14591 /* [temp]
14593 A template ... explicit specialization ... shall not have C
14594 linkage. */
14596 {
14598 /* Give it C++ linkage to avoid confusing other parts of the
14599 front end. */
14602 }
14603 else
14605 /* Let the front end know that we are beginning a specialization. */
14607 {
14610 }
14612 /* If the next keyword is `template', we need to figure out whether
14613 or not we're looking a template-declaration. */
14615 {
14620 else
14622 }
14623 else
14624 /* Parse the dependent declaration. */
14630 /* We're done with the specialization. */
14632 /* For the erroneous case of a template with C linkage, we pushed an
14633 implicit C++ linkage scope; exit that scope now. */
14636 /* We're done with this parameter list. */
14638 }
14640 /* Parse a type-specifier.
14642 type-specifier:
14643 simple-type-specifier
14644 class-specifier
14645 enum-specifier
14646 elaborated-type-specifier
14647 cv-qualifier
14649 GNU Extension:
14651 type-specifier:
14652 __complex__
14654 Returns a representation of the type-specifier. For a
14655 class-specifier, enum-specifier, or elaborated-type-specifier, a
14656 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14658 The parser flags FLAGS is used to control type-specifier parsing.
14660 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14661 in a decl-specifier-seq.
14663 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14664 class-specifier, enum-specifier, or elaborated-type-specifier, then
14665 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14666 if a type is declared; 2 if it is defined. Otherwise, it is set to
14667 zero.
14669 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14670 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14671 is set to FALSE. */
14673 static tree
14675 cp_parser_flags flags,
14680 {
14686 /* Assume this type-specifier does not declare a new type. */
14689 /* And that it does not specify a cv-qualifier. */
14692 /* Peek at the next token. */
14695 /* If we're looking at a keyword, we can use that to guide the
14696 production we choose. */
14699 {
14704 /* Look for the enum-specifier. */
14706 /* If that worked, we're done. */
14708 {
14713 type_spec,
14714 token,
14717 }
14718 else
14721 /* Any of these indicate either a class-specifier, or an
14722 elaborated-type-specifier. */
14729 /* Parse tentatively so that we can back up if we don't find a
14730 class-specifier. */
14732 /* Look for the class-specifier. */
14735 /* If that worked, we're done. */
14737 {
14742 type_spec,
14743 token,
14746 }
14748 /* Fall through. */
14749 elaborated_type_specifier:
14750 /* We're declaring (not defining) a class or enum. */
14754 /* Fall through. */
14756 /* Look for an elaborated-type-specifier. */
14757 type_spec
14758 = (cp_parser_elaborated_type_specifier
14761 is_declaration));
14764 type_spec,
14765 token,
14788 /* The `__complex__' keyword is a GNU extension. */
14794 }
14796 /* Handle simple keywords. */
14798 {
14800 {
14803 }
14805 }
14807 /* If we do not already have a type-specifier, assume we are looking
14808 at a simple-type-specifier. */
14810 decl_specs,
14811 flags);
14813 /* If we didn't find a type-specifier, and a type-specifier was not
14814 optional in this context, issue an error message. */
14816 {
14819 }
14822 }
14824 /* Parse a simple-type-specifier.
14826 simple-type-specifier:
14827 :: [opt] nested-name-specifier [opt] type-name
14828 :: [opt] nested-name-specifier template template-id
14829 char
14830 wchar_t
14831 bool
14832 short
14833 int
14834 long
14835 signed
14836 unsigned
14837 float
14838 double
14839 void
14841 C++0x Extension:
14843 simple-type-specifier:
14844 auto
14845 decltype ( expression )
14846 char16_t
14847 char32_t
14848 __underlying_type ( type-id )
14850 GNU Extension:
14852 simple-type-specifier:
14853 __int128
14854 __typeof__ unary-expression
14855 __typeof__ ( type-id )
14856 __typeof__ ( type-id ) { initializer-list , [opt] }
14858 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14859 appropriately updated. */
14861 static tree
14864 cp_parser_flags flags)
14865 {
14870 /* Peek at the next token. */
14873 /* If we're looking at a keyword, things are easy. */
14875 {
14910 {
14913 }
14942 {
14943 /* The 'auto' might be the placeholder return type for a function decl
14944 with trailing return type. */
14948 {
14956 have_trailing_return_fn_decl
14959 }
14962 {
14965 }
14969 else
14973 {
14976 "use of %<auto%> in lambda parameter declaration "
14977 "only available with "
14979 }
14982 "use of %<auto%> in parameter declaration "
14983 "only available with "
14985 else
14987 "ISO C++ forbids use of %<auto%> in parameter "
14989 }
14990 else
14995 /* Since DR 743, decltype can either be a simple-type-specifier by
14996 itself or begin a nested-name-specifier. Parsing it will replace
14997 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14998 handling below decide what to do. */
15004 /* Consume the `typeof' token. */
15006 /* Parse the operand to `typeof'. */
15008 /* If it is not already a TYPE, take its type. */
15014 token,
15023 token,
15033 token,
15038 }
15040 /* If token is an already-parsed decltype not followed by ::,
15041 it's a simple-type-specifier. */
15044 {
15047 {
15049 token,
15051 /* Remember that we are handling a decltype in order to
15052 implement the resolution of DR 1510 when the argument
15053 isn't instantiation dependent. */
15055 }
15058 }
15060 /* If the type-specifier was for a built-in type, we're done. */
15062 {
15063 /* Record the type. */
15070 type,
15071 token,
15076 /* Consume the token. */
15082 /* There is no valid C++ program where a non-template type is
15083 followed by a "<". That usually indicates that the user thought
15084 that the type was a template. */
15089 }
15091 /* The type-specifier must be a user-defined type. */
15093 {
15097 /* Don't gobble tokens or issue error messages if this is an
15098 optional type-specifier. */
15102 /* Look for the optional `::' operator. */
15103 global_p
15107 /* Look for the nested-name specifier. */
15108 qualified_p
15116 /* If we have seen a nested-name-specifier, and the next token
15117 is `template', then we are using the template-id production. */
15120 {
15121 /* Look for the template-id. */
15125 none_type,
15127 /* If the template-id did not name a type, we are out of
15128 luck. */
15130 {
15133 }
15134 }
15135 /* Otherwise, look for a type-name. */
15136 else
15138 /* Keep track of all name-lookups performed in class scopes. */
15140 && !global_p
15141 && !qualified_p
15145 /* If it didn't work out, we don't have a TYPE. */
15151 token,
15153 }
15155 /* If we didn't get a type-name, issue an error message. */
15157 {
15160 }
15163 {
15164 /* See if TYPE is an Objective-C type, and if so, parse and
15165 accept any protocol references following it. Do this before
15166 the cp_parser_check_for_invalid_template_id() call, because
15167 Objective-C types can be followed by '<...>' which would
15168 enclose protocol names rather than template arguments, and so
15169 everything is fine. */
15172 {
15176 /* Clobber the "unqualified" type previously entered into
15177 DECL_SPECS with the new, improved protocol-qualified version. */
15182 }
15184 /* There is no valid C++ program where a non-template type is
15185 followed by a "<". That usually indicates that the user
15186 thought that the type was a template. */
15188 none_type,
15190 }
15193 }
15195 /* Parse a type-name.
15197 type-name:
15198 class-name
15199 enum-name
15200 typedef-name
15201 simple-template-id [in c++0x]
15203 enum-name:
15204 identifier
15206 typedef-name:
15207 identifier
15209 Returns a TYPE_DECL for the type. */
15211 static tree
15213 {
15214 tree type_decl;
15216 /* We can't know yet whether it is a class-name or not. */
15218 /* Try a class-name. */
15222 none_type,
15226 /* If it's not a class-name, keep looking. */
15228 {
15230 /* It must be a typedef-name or an enum-name. */
15234 /* It is either a simple-template-id representing an
15235 instantiation of an alias template... */
15239 none_type,
15241 /* Note that this must be an instantiation of an alias template
15242 because [temp.names]/6 says:
15244 A template-id that names an alias template specialization
15245 is a type-name.
15247 Whereas [temp.names]/7 says:
15249 A simple-template-id that names a class template
15250 specialization is a class-name. */
15255 else
15259 /* ... Or a typedef-name or an enum-name. */
15261 }
15264 }
15266 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15268 enum-name:
15269 identifier
15271 typedef-name:
15272 identifier
15274 Returns a TYPE_DECL for the type. */
15276 static tree
15278 {
15279 tree type_decl;
15280 tree identifier;
15287 /* Look up the type-name. */
15294 {
15295 /* See if this is an Objective-C type. */
15300 }
15302 /* Issue an error if we did not find a type-name. */
15304 /* In Objective-C, we have the complication that class names are
15305 normally type names and start declarations (eg, the
15306 "NSObject" in "NSObject *object;"), but can be used in an
15307 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15308 is an expression. So, a classname followed by a dot is not a
15309 valid type-name. */
15312 {
15317 }
15318 /* Remember that the name was used in the definition of the
15319 current class so that we can check later to see if the
15320 meaning would have been different after the class was
15321 entirely defined. */
15327 }
15329 /* Parse an elaborated-type-specifier. Note that the grammar given
15330 here incorporates the resolution to DR68.
15332 elaborated-type-specifier:
15333 class-key :: [opt] nested-name-specifier [opt] identifier
15334 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15335 enum-key :: [opt] nested-name-specifier [opt] identifier
15336 typename :: [opt] nested-name-specifier identifier
15337 typename :: [opt] nested-name-specifier template [opt]
15338 template-id
15340 GNU extension:
15342 elaborated-type-specifier:
15343 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15344 class-key attributes :: [opt] nested-name-specifier [opt]
15345 template [opt] template-id
15346 enum attributes :: [opt] nested-name-specifier [opt] identifier
15348 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15349 declared `friend'. If IS_DECLARATION is TRUE, then this
15350 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15351 something is being declared.
15353 Returns the TYPE specified. */
15355 static tree
15359 {
15361 tree identifier;
15364 tree globalscope;
15367 /* See if we're looking at the `enum' keyword. */
15369 {
15370 /* Consume the `enum' token. */
15372 /* Remember that it's an enumeration type. */
15374 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15375 enums) is used here. */
15378 {
15382 /* Consume the `struct' or `class' and parse it anyway. */
15384 }
15385 /* Parse the attributes. */
15387 }
15388 /* Or, it might be `typename'. */
15390 RID_TYPENAME))
15391 {
15392 /* Consume the `typename' token. */
15394 /* Remember that it's a `typename' type. */
15396 }
15397 /* Otherwise it must be a class-key. */
15398 else
15399 {
15403 /* Parse the attributes. */
15405 }
15407 /* Look for the `::' operator. */
15410 /* Look for the nested-name-specifier. */
15412 {
15417 is_declaration))
15419 }
15420 else
15421 /* Even though `typename' is not present, the proposed resolution
15422 to Core Issue 180 says that in `class A<T>::B', `B' should be
15423 considered a type-name, even if `A<T>' is dependent. */
15428 is_declaration);
15429 /* For everything but enumeration types, consider a template-id.
15430 For an enumeration type, consider only a plain identifier. */
15432 {
15434 tree decl;
15436 /* Allow the `template' keyword. */
15438 /* If we didn't see `template', we don't know if there's a
15439 template-id or not. */
15442 /* Parse the template-id. */
15446 tag_type,
15447 is_declaration);
15448 /* If we didn't find a template-id, look for an ordinary
15449 identifier. */
15451 ;
15452 /* We can get here when cp_parser_template_id, called by
15453 cp_parser_class_name with tag_type == none_type, succeeds
15454 and caches a BASELINK. Then, when called again here,
15455 instead of failing and returning an error_mark_node
15456 returns it (see template/typename17.C in C++11).
15457 ??? Could we diagnose this earlier? */
15459 {
15462 }
15463 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15464 in effect, then we must assume that, upon instantiation, the
15465 template will correspond to a class. */
15469 typename_type,
15471 /* If the `typename' keyword is in effect and DECL is not a type
15472 decl, then type is non existent. */
15474 ;
15480 }
15483 {
15488 {
15491 }
15493 /* For a `typename', we needn't call xref_tag. */
15499 /* Template parameter lists apply only if we are not within a
15500 function parameter list. */
15501 bool template_parm_lists_apply
15510 /* Look up a qualified name in the usual way. */
15512 {
15513 tree decl;
15514 tree ambiguous_decls;
15517 tag_type,
15524 /* If the lookup was ambiguous, an error will already have been
15525 issued. */
15529 /* If we are parsing friend declaration, DECL may be a
15530 TEMPLATE_DECL tree node here. However, we need to check
15531 whether this TEMPLATE_DECL results in valid code. Consider
15532 the following example:
15534 namespace N {
15535 template <class T> class C {};
15536 }
15537 class X {
15538 template <class T> friend class N::C; // #1, valid code
15539 };
15540 template <class T> class Y {
15541 friend class N::C; // #2, invalid code
15542 };
15544 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15545 name lookup of `N::C'. We see that friend declaration must
15546 be template for the code to be valid. Note that
15547 processing_template_decl does not work here since it is
15548 always 1 for the above two cases. */
15550 decl = (cp_parser_maybe_treat_template_as_class
15555 {
15557 identifier,
15560 }
15563 {
15567 allow_template);
15571 }
15573 /* Forward declarations of nested types, such as
15575 class C1::C2;
15576 class C1::C2::C3;
15578 are invalid unless all components preceding the final '::'
15579 are complete. If all enclosing types are complete, these
15580 declarations become merely pointless.
15582 Invalid forward declarations of nested types are errors
15583 caught elsewhere in parsing. Those that are pointless arrive
15584 here. */
15591 }
15592 else
15593 {
15594 /* An elaborated-type-specifier sometimes introduces a new type and
15595 sometimes names an existing type. Normally, the rule is that it
15596 introduces a new type only if there is not an existing type of
15597 the same name already in scope. For example, given:
15599 struct S {};
15600 void f() { struct S s; }
15602 the `struct S' in the body of `f' is the same `struct S' as in
15603 the global scope; the existing definition is used. However, if
15604 there were no global declaration, this would introduce a new
15605 local class named `S'.
15607 An exception to this rule applies to the following code:
15609 namespace N { struct S; }
15611 Here, the elaborated-type-specifier names a new type
15612 unconditionally; even if there is already an `S' in the
15613 containing scope this declaration names a new type.
15614 This exception only applies if the elaborated-type-specifier
15615 forms the complete declaration:
15617 [class.name]
15619 A declaration consisting solely of `class-key identifier ;' is
15620 either a redeclaration of the name in the current scope or a
15621 forward declaration of the identifier as a class name. It
15622 introduces the name into the current scope.
15624 We are in this situation precisely when the next token is a `;'.
15626 An exception to the exception is that a `friend' declaration does
15627 *not* name a new type; i.e., given:
15629 struct S { friend struct T; };
15631 `T' is not a new type in the scope of `S'.
15633 Also, `new struct S' or `sizeof (struct S)' never results in the
15634 definition of a new type; a new type can only be declared in a
15635 declaration context. */
15637 tag_scope ts;
15641 /* Friends have special name lookup rules. */
15645 CPP_SEMICOLON))
15646 /* This is a `class-key identifier ;' */
15648 else
15651 template_p =
15652 (template_parm_lists_apply
15655 /* An unqualified name was used to reference this type, so
15656 there were no qualifying templates. */
15664 }
15665 }
15670 /* Allow attributes on forward declarations of classes. */
15672 {
15682 else
15685 }
15688 {
15689 /* Indicate whether this class was declared as a `class' or as a
15690 `struct'. */
15694 }
15696 /* A "<" cannot follow an elaborated type specifier. If that
15697 happens, the user was probably trying to form a template-id. */
15702 }
15704 /* Parse an enum-specifier.
15706 enum-specifier:
15707 enum-head { enumerator-list [opt] }
15708 enum-head { enumerator-list , } [C++0x]
15710 enum-head:
15711 enum-key identifier [opt] enum-base [opt]
15712 enum-key nested-name-specifier identifier enum-base [opt]
15714 enum-key:
15715 enum
15716 enum class [C++0x]
15717 enum struct [C++0x]
15719 enum-base: [C++0x]
15720 : type-specifier-seq
15722 opaque-enum-specifier:
15723 enum-key identifier enum-base [opt] ;
15725 GNU Extensions:
15726 enum-key attributes[opt] identifier [opt] enum-base [opt]
15727 { enumerator-list [opt] }attributes[opt]
15728 enum-key attributes[opt] identifier [opt] enum-base [opt]
15729 { enumerator-list, }attributes[opt] [C++0x]
15731 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15732 if the token stream isn't an enum-specifier after all. */
15734 static tree
15736 {
15737 tree identifier;
15739 tree prev_scope;
15741 tree attributes;
15754 /* Parse tentatively so that we can back up if we don't find a
15755 enum-specifier. */
15758 /* Caller guarantees that the current token is 'enum', an identifier
15759 possibly follows, and the token after that is an opening brace.
15760 If we don't have an identifier, fabricate an anonymous name for
15761 the enumeration being defined. */
15764 /* Parse the "class" or "struct", which indicates a scoped
15765 enumeration type in C++0x. */
15768 {
15772 /* Consume the `struct' or `class' token. */
15776 }
15780 /* Clear the qualification. */
15785 /* Figure out in what scope the declaration is being placed. */
15791 nested_name_specifier
15799 {
15800 tree name;
15804 enum_type,
15809 input_location);
15811 {
15814 {
15815 /* Are template enums allowed in ISO? */
15819 /* ignore a typename reference, for it will be solved by name
15820 in start_enum. */
15822 }
15823 }
15826 else
15829 }
15830 else
15831 {
15834 else
15835 {
15841 }
15842 }
15845 /* Check for the `:' that denotes a specified underlying type in C++0x.
15846 Note that a ':' could also indicate a bitfield width, however. */
15848 {
15849 cp_decl_specifier_seq type_specifiers;
15851 /* Consume the `:'. */
15854 /* Parse the type-specifier-seq. */
15859 /* At this point this is surely not elaborated type specifier. */
15868 /* If that didn't work, stop. */
15870 {
15876 }
15877 }
15879 /* Look for the `{' but don't consume it yet. */
15881 {
15883 {
15886 {
15889 }
15890 }
15891 /* An opaque-enum-specifier must have a ';' here. */
15894 {
15897 {
15900 }
15901 }
15902 }
15908 {
15910 {
15914 }
15916 {
15918 }
15919 }
15921 /* Issue an error message if type-definitions are forbidden here. */
15924 else
15925 /* Create the new type. We do this before consuming the opening
15926 brace so the enum will be recorded as being on the line of its
15927 tag (or the 'enum' keyword, if there is no tag). */
15931 /* If the next token is not '{' it is an opaque-enum-specifier or an
15932 elaborated-type-specifier. */
15934 {
15938 {
15939 /* The following catches invalid code such as:
15940 enum class S<int>::E { A, B, C }; */
15948 {
15952 nested_name_specifier);
15954 }
15955 /* If that scope does not contain the scope in which the
15956 class was originally declared, the program is invalid. */
15958 nested_name_specifier))
15959 {
15962 "declaration of %qD in namespace %qD which does not "
15965 else
15967 "declaration of %qD in %qD which does not "
15971 }
15972 }
15977 /* Consume the opening brace. */
15984 {
15988 }
15989 else
15990 {
15996 }
16000 /* If the next token is not '}', then there are some enumerators. */
16002 {
16006 }
16007 else
16010 /* Consume the final '}'. */
16016 }
16017 else
16018 {
16019 /* If a ';' follows, then it is an opaque-enum-specifier
16020 and additional restrictions apply. */
16022 {
16029 }
16030 }
16032 /* Look for trailing attributes to apply to this enumeration, and
16033 apply them if appropriate. */
16035 {
16039 trailing_attr,
16041 }
16043 /* Finish up the enumeration. */
16045 {
16050 }
16053 {
16055 {
16058 }
16060 {
16062 }
16063 }
16064 out:
16067 }
16069 /* Parse an enumerator-list. The enumerators all have the indicated
16070 TYPE.
16072 enumerator-list:
16073 enumerator-definition
16074 enumerator-list , enumerator-definition */
16076 static void
16078 {
16080 {
16081 /* Parse an enumerator-definition. */
16084 /* If the next token is not a ',', we've reached the end of
16085 the list. */
16088 /* Otherwise, consume the `,' and keep going. */
16090 /* If the next token is a `}', there is a trailing comma. */
16092 {
16097 }
16098 }
16099 }
16101 /* Parse an enumerator-definition. The enumerator has the indicated
16102 TYPE.
16104 enumerator-definition:
16105 enumerator
16106 enumerator = constant-expression
16108 enumerator:
16109 identifier
16111 GNU Extensions:
16113 enumerator-definition:
16114 enumerator attributes [opt]
16115 enumerator attributes [opt] = constant-expression */
16117 static void
16119 {
16120 tree identifier;
16121 tree value;
16122 location_t loc;
16124 /* Save the input location because we are interested in the location
16125 of the identifier and not the location of the explicit value. */
16128 /* Look for the identifier. */
16133 /* Parse any specified attributes. */
16136 /* If the next token is an '=', then there is an explicit value. */
16138 {
16139 /* Consume the `=' token. */
16141 /* Parse the value. */
16143 }
16144 else
16147 /* If we are processing a template, make sure the initializer of the
16148 enumerator doesn't contain any bare template parameter pack. */
16152 /* Create the enumerator. */
16154 }
16156 /* Parse a namespace-name.
16158 namespace-name:
16159 original-namespace-name
16160 namespace-alias
16162 Returns the NAMESPACE_DECL for the namespace. */
16164 static tree
16166 {
16167 tree identifier;
16168 tree namespace_decl;
16172 /* Get the name of the namespace. */
16177 /* Look up the identifier in the currently active scope. Look only
16178 for namespaces, due to:
16180 [basic.lookup.udir]
16182 When looking up a namespace-name in a using-directive or alias
16183 definition, only namespace names are considered.
16185 And:
16187 [basic.lookup.qual]
16189 During the lookup of a name preceding the :: scope resolution
16190 operator, object, function, and enumerator names are ignored.
16192 (Note that cp_parser_qualifying_entity only calls this
16193 function if the token after the name is the scope resolution
16194 operator.) */
16196 none_type,
16202 /* If it's not a namespace, issue an error. */
16205 {
16210 }
16213 }
16215 /* Parse a namespace-definition.
16217 namespace-definition:
16218 named-namespace-definition
16219 unnamed-namespace-definition
16221 named-namespace-definition:
16222 original-namespace-definition
16223 extension-namespace-definition
16225 original-namespace-definition:
16226 namespace identifier { namespace-body }
16228 extension-namespace-definition:
16229 namespace original-namespace-name { namespace-body }
16231 unnamed-namespace-definition:
16232 namespace { namespace-body } */
16234 static void
16236 {
16243 {
16247 }
16248 else
16251 /* Look for the `namespace' keyword. */
16254 /* Get the name of the namespace. We do not attempt to distinguish
16255 between an original-namespace-definition and an
16256 extension-namespace-definition at this point. The semantic
16257 analysis routines are responsible for that. */
16260 else
16263 /* Parse any specified attributes. */
16266 /* Look for the `{' to start the namespace. */
16268 /* Start the namespace. */
16271 /* "inline namespace" is equivalent to a stub namespace definition
16272 followed by a strong using directive. */
16274 {
16276 /* Set up namespace association. */
16280 /* Import the contents of the inline namespace. */
16284 }
16288 /* Parse the body of the namespace. */
16294 /* Finish the namespace. */
16296 /* Look for the final `}'. */
16298 }
16300 /* Parse a namespace-body.
16302 namespace-body:
16303 declaration-seq [opt] */
16305 static void
16307 {
16309 }
16311 /* Parse a namespace-alias-definition.
16313 namespace-alias-definition:
16314 namespace identifier = qualified-namespace-specifier ; */
16316 static void
16318 {
16319 tree identifier;
16320 tree namespace_specifier;
16324 /* Look for the `namespace' keyword. */
16326 /* Look for the identifier. */
16330 /* Look for the `=' token. */
16333 {
16335 /* Skip the definition. */
16340 }
16342 /* Look for the qualified-namespace-specifier. */
16343 namespace_specifier
16345 /* Look for the `;' token. */
16348 /* Register the alias in the symbol table. */
16350 }
16352 /* Parse a qualified-namespace-specifier.
16354 qualified-namespace-specifier:
16355 :: [opt] nested-name-specifier [opt] namespace-name
16357 Returns a NAMESPACE_DECL corresponding to the specified
16358 namespace. */
16360 static tree
16362 {
16363 /* Look for the optional `::'. */
16367 /* Look for the optional nested-name-specifier. */
16375 }
16377 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16378 access declaration.
16380 using-declaration:
16381 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16382 using :: unqualified-id ;
16384 access-declaration:
16385 qualified-id ;
16387 */
16389 static bool
16392 {
16396 tree decl;
16397 tree identifier;
16398 tree qscope;
16403 {
16406 }
16407 else
16408 {
16409 /* Look for the `using' keyword. */
16412 /* Peek at the next token. */
16414 /* See if it's `typename'. */
16416 {
16417 /* Remember that we've seen it. */
16419 /* Consume the `typename' token. */
16421 }
16422 }
16424 /* Look for the optional global scope qualification. */
16425 global_scope_p
16430 /* If we saw `typename', or didn't see `::', then there must be a
16431 nested-name-specifier present. */
16433 {
16439 {
16442 }
16443 }
16444 /* Otherwise, we could be in either of the two productions. In that
16445 case, treat the nested-name-specifier as optional. */
16446 else
16458 /* Something has already gone wrong; there's no need to parse
16459 further. Since an error has occurred, the return value of
16460 cp_parser_parse_definitely will be false, as required. */
16464 /* Parse the unqualified-id. */
16472 {
16477 }
16479 /* The function we call to handle a using-declaration is different
16480 depending on what scope we are in. */
16482 ;
16485 /* [namespace.udecl]
16487 A using declaration shall not name a template-id. */
16490 else
16491 {
16493 {
16494 /* Create the USING_DECL. */
16501 {
16504 }
16505 else
16506 /* Add it to the list of members in this class. */
16508 }
16509 else
16510 {
16512 identifier,
16519 {
16522 }
16525 else
16527 }
16528 }
16530 /* Look for the final `;'. */
16535 "access declarations are deprecated "
16536 "in favour of using-declarations; "
16540 }
16542 /* Parse an alias-declaration.
16544 alias-declaration:
16545 using identifier attribute-specifier-seq [opt] = type-id */
16547 static tree
16549 {
16551 location_t id_location;
16553 cp_decl_specifier_seq decl_specs;
16557 /* Look for the `using' keyword. */
16558 cp_token *using_token
16580 /* Now we are going to parse the type-id of the declaration. */
16582 /*
16583 [dcl.type]/3 says:
16585 "A type-specifier-seq shall not define a class or enumeration
16586 unless it appears in the type-id of an alias-declaration (7.1.3) that
16587 is not the declaration of a template-declaration."
16589 In other words, if we currently are in an alias template, the
16590 type-id should not define a type.
16592 So let's set parser->type_definition_forbidden_message in that
16593 case; cp_parser_check_type_definition (called by
16594 cp_parser_class_specifier) will then emit an error if a type is
16595 defined in the type-id. */
16597 {
16601 }
16605 /* Restore the error message if need be. */
16611 {
16614 }
16616 /* A typedef-name can also be introduced by an alias-declaration. The
16617 identifier following the using keyword becomes a typedef-name. It has
16618 the same semantics as if it were introduced by the typedef
16619 specifier. In particular, it does not define a new type and it shall
16620 not appear in the type-id. */
16625 {
16628 ds_attribute,
16629 attrs_token);
16630 }
16632 ds_typedef,
16633 using_token);
16635 ds_alias,
16636 using_token);
16645 else
16656 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16657 added into the symbol table; otherwise, return the TYPE_DECL. */
16661 {
16665 }
16668 }
16670 /* Parse a using-directive.
16672 using-directive:
16673 using namespace :: [opt] nested-name-specifier [opt]
16674 namespace-name ; */
16676 static void
16678 {
16679 tree namespace_decl;
16680 tree attribs;
16682 /* Look for the `using' keyword. */
16684 /* And the `namespace' keyword. */
16686 /* Look for the optional `::' operator. */
16688 /* And the optional nested-name-specifier. */
16694 /* Get the namespace being used. */
16696 /* And any specified attributes. */
16698 /* Update the symbol table. */
16700 /* Look for the final `;'. */
16702 }
16704 /* Parse an asm-definition.
16706 asm-definition:
16707 asm ( string-literal ) ;
16709 GNU Extension:
16711 asm-definition:
16712 asm volatile [opt] ( string-literal ) ;
16713 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16714 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16715 : asm-operand-list [opt] ) ;
16716 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16717 : asm-operand-list [opt]
16718 : asm-clobber-list [opt] ) ;
16719 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16720 : asm-clobber-list [opt]
16721 : asm-goto-list ) ; */
16723 static void
16725 {
16726 tree string;
16731 tree asm_stmt;
16739 /* Look for the `asm' keyword. */
16744 {
16747 }
16749 /* See if the next token is `volatile'. */
16752 {
16753 /* Remember that we saw the `volatile' keyword. */
16755 /* Consume the token. */
16757 }
16761 {
16762 /* Remember that we saw the `goto' keyword. */
16764 /* Consume the token. */
16766 }
16767 /* Look for the opening `('. */
16770 /* Look for the string. */
16773 {
16777 }
16779 /* If we're allowing GNU extensions, check for the extended assembly
16780 syntax. Unfortunately, the `:' tokens need not be separated by
16781 a space in C, and so, for compatibility, we tolerate that here
16782 too. Doing that means that we have to treat the `::' operator as
16783 two `:' tokens. */
16788 {
16793 /* The extended syntax was used. */
16796 /* Look for outputs. */
16798 {
16799 /* Consume the `:'. */
16801 /* Parse the output-operands. */
16803 CPP_COLON)
16805 CPP_SCOPE)
16807 CPP_CLOSE_PAREN)
16809 {
16813 }
16814 }
16815 /* If the next token is `::', there are no outputs, and the
16816 next token is the beginning of the inputs. */
16818 /* The inputs are coming next. */
16821 /* Look for inputs. */
16824 {
16825 /* Consume the `:' or `::'. */
16827 /* Parse the output-operands. */
16829 CPP_COLON)
16831 CPP_SCOPE)
16833 CPP_CLOSE_PAREN))
16834 {
16838 }
16839 }
16841 /* The clobbers are coming next. */
16844 /* Look for clobbers. */
16847 {
16849 /* Consume the `:' or `::'. */
16851 /* Parse the clobbers. */
16853 CPP_COLON)
16855 CPP_CLOSE_PAREN))
16857 }
16860 /* The labels are coming next. */
16863 /* Look for labels. */
16866 {
16868 /* Consume the `:' or `::'. */
16870 /* Parse the labels. */
16872 }
16876 }
16880 /* Look for the closing `)'. */
16888 {
16889 /* Create the ASM_EXPR. */
16891 {
16894 /* If the extended syntax was not used, mark the ASM_EXPR. */
16896 {
16902 }
16903 }
16904 else
16906 }
16907 }
16909 /* Declarators [gram.dcl.decl] */
16911 /* Parse an init-declarator.
16913 init-declarator:
16914 declarator initializer [opt]
16916 GNU Extension:
16918 init-declarator:
16919 declarator asm-specification [opt] attributes [opt] initializer [opt]
16921 function-definition:
16922 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16923 function-body
16924 decl-specifier-seq [opt] declarator function-try-block
16926 GNU Extension:
16928 function-definition:
16929 __extension__ function-definition
16931 TM Extension:
16933 function-definition:
16934 decl-specifier-seq [opt] declarator function-transaction-block
16936 The DECL_SPECIFIERS apply to this declarator. Returns a
16937 representation of the entity declared. If MEMBER_P is TRUE, then
16938 this declarator appears in a class scope. The new DECL created by
16939 this declarator is returned.
16941 The CHECKS are access checks that should be performed once we know
16942 what entity is being declared (and, therefore, what classes have
16943 befriended it).
16945 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16946 for a function-definition here as well. If the declarator is a
16947 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16948 be TRUE upon return. By that point, the function-definition will
16949 have been completely parsed.
16951 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16952 is FALSE.
16954 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16955 parsed declaration if it is an uninitialized single declarator not followed
16956 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16957 if present, will not be consumed. If returned, this declarator will be
16958 created with SD_INITIALIZED but will not call cp_finish_decl.
16960 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
16961 and there is an initializer, the pointed location_t is set to the
16962 location of the '=' or `(', or '{' in C++11 token introducing the
16963 initializer. */
16965 static tree
16975 {
16979 tree prefix_attributes;
16981 tree asm_specification;
16982 tree initializer;
16984 tree scope;
16986 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16987 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16988 "(...)". */
16999 /* Gather the attributes that were provided with the
17000 decl-specifiers. */
17003 /* Assume that this is not the declarator for a function
17004 definition. */
17008 /* Default arguments are only permitted for function parameters. */
17012 /* Defer access checks while parsing the declarator; we cannot know
17013 what names are accessible until we know what is being
17014 declared. */
17017 /* Parse the declarator. */
17019 declarator
17024 /* Gather up the deferred checks. */
17029 /* If the DECLARATOR was erroneous, there's no need to go
17030 further. */
17034 /* Check that the number of template-parameter-lists is OK. */
17044 /* Figure out what scope the entity declared by the DECLARATOR is
17045 located in. `grokdeclarator' sometimes changes the scope, so
17046 we compute it now. */
17049 /* Perform any lookups in the declared type which were thought to be
17050 dependent, but are not in the scope of the declarator. */
17051 decl_specifiers->type
17054 /* If we're allowing GNU extensions, look for an
17055 asm-specification. */
17057 {
17058 /* Look for an asm-specification. */
17061 }
17062 else
17065 /* Look for attributes. */
17069 /* Peek at the next token. */
17075 {
17076 /* Check to see if the token indicates the start of a
17077 function-definition. */
17079 {
17081 {
17082 /* If a function-definition should not appear here, issue an
17083 error message. */
17087 }
17089 location_t func_brace_location
17092 /* Neither attributes nor an asm-specification are allowed
17093 on a function-definition. */
17096 "an asm-specification is not allowed "
17100 "attributes are not allowed "
17102 /* This is a function-definition. */
17105 /* Parse the function definition. */
17108 decl_specifiers,
17109 declarator,
17110 prefix_attributes);
17111 else
17112 decl =
17113 (cp_parser_function_definition_from_specifiers_and_declarator
17117 {
17118 /* This is where the prologue starts... */
17121 }
17124 }
17125 }
17127 {
17128 /* A non-template declaration involving a function parameter list
17129 containing an implicit template parameter will be made into a
17130 template. If the resulting declaration is not going to be an
17131 actual function then finish the template scope here to prevent it.
17132 An error message will be issued once we have a decl to talk about.
17134 FIXME probably we should do type deduction rather than create an
17135 implicit template, but the standard currently doesn't allow it. */
17138 }
17140 /* [dcl.dcl]
17142 Only in function declarations for constructors, destructors, and
17143 type conversions can the decl-specifier-seq be omitted.
17145 We explicitly postpone this check past the point where we handle
17146 function-definitions because we tolerate function-definitions
17147 that are missing their return types in some modes. */
17149 {
17153 }
17155 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17159 {
17170 {
17176 }
17177 }
17178 else
17179 {
17180 /* If the init-declarator isn't initialized and isn't followed by a
17181 `,' or `;', it's not a valid init-declarator. */
17184 {
17187 else
17188 {
17192 }
17193 }
17196 }
17198 /* Because start_decl has side-effects, we should only call it if we
17199 know we're going ahead. By this point, we know that we cannot
17200 possibly be looking at any other construct. */
17203 /* Enter the newly declared entry in the symbol table. If we're
17204 processing a declaration in a class-specifier, we wait until
17205 after processing the initializer. */
17207 {
17214 /* Adjust location of decl if declarator->id_loc is more appropriate:
17215 set, and decl wasn't merged with another decl, in which case its
17216 location would be different from input_location, and more accurate. */
17221 }
17223 /* Enter the SCOPE. That way unqualified names appearing in the
17224 initializer will be looked up in SCOPE. */
17227 /* Perform deferred access control checks, now that we know in which
17228 SCOPE the declared entity resides. */
17230 {
17233 /* If the entity being declared is a function, pretend that we
17234 are in its scope. If it is a `friend', it may have access to
17235 things that would not otherwise be accessible. */
17237 {
17240 }
17242 /* Perform access checks for template parameters. */
17245 /* Perform the access control checks for the declarator and the
17246 decl-specifiers. */
17249 /* Restore the saved value. */
17252 }
17254 /* Parse the initializer. */
17259 {
17261 {
17264 else
17265 {
17266 /* If the declaration was erroneous, we don't really
17267 know what the user intended, so just silently
17268 consume the initializer. */
17275 }
17276 }
17277 else
17278 {
17279 /* We want to record the extra mangling scope for in-class
17280 initializers of class members and initializers of static data
17281 member templates. The former involves deferring
17282 parsing of the initializer until end of class as with default
17283 arguments. So right here we only handle the latter. */
17293 }
17294 }
17296 /* The old parser allows attributes to appear after a parenthesized
17297 initializer. Mark Mitchell proposed removing this functionality
17298 on the GCC mailing lists on 2002-08-13. This parser accepts the
17299 attributes -- but ignores them. */
17306 /* And now complain about a non-function implicit template. */
17311 /* For an in-class declaration, use `grokfield' to create the
17312 declaration. */
17314 {
17316 {
17319 }
17327 }
17329 /* Finish processing the declaration. But, skip member
17330 declarations. */
17332 {
17335 asm_specification,
17336 /* If the initializer is in parentheses, then this is
17337 a direct-initialization, which means that an
17338 `explicit' constructor is OK. Otherwise, an
17339 `explicit' constructor cannot be used. */
17342 }
17345 /* Core issue #226 (C++0x only): A default template-argument
17346 shall not be specified in a friend class template
17347 declaration. */
17356 {
17359 else
17361 }
17364 }
17366 /* Parse a declarator.
17368 declarator:
17369 direct-declarator
17370 ptr-operator declarator
17372 abstract-declarator:
17373 ptr-operator abstract-declarator [opt]
17374 direct-abstract-declarator
17376 GNU Extensions:
17378 declarator:
17379 attributes [opt] direct-declarator
17380 attributes [opt] ptr-operator declarator
17382 abstract-declarator:
17383 attributes [opt] ptr-operator abstract-declarator [opt]
17384 attributes [opt] direct-abstract-declarator
17386 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17387 detect constructor, destructor or conversion operators. It is set
17388 to -1 if the declarator is a name, and +1 if it is a
17389 function. Otherwise it is set to zero. Usually you just want to
17390 test for >0, but internally the negative value is used.
17392 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17393 a decl-specifier-seq unless it declares a constructor, destructor,
17394 or conversion. It might seem that we could check this condition in
17395 semantic analysis, rather than parsing, but that makes it difficult
17396 to handle something like `f()'. We want to notice that there are
17397 no decl-specifiers, and therefore realize that this is an
17398 expression, not a declaration.)
17400 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17401 the declarator is a direct-declarator of the form "(...)".
17403 MEMBER_P is true iff this declarator is a member-declarator.
17405 FRIEND_P is true iff this declarator is a friend. */
17409 cp_parser_declarator_kind dcl_kind,
17413 {
17416 cp_cv_quals cv_quals;
17417 tree class_type;
17420 /* Assume this is not a constructor, destructor, or type-conversion
17421 operator. */
17428 /* Check for the ptr-operator production. */
17430 /* Parse the ptr-operator. */
17436 /* If that worked, then we have a ptr-operator. */
17438 {
17439 /* If a ptr-operator was found, then this declarator was not
17440 parenthesized. */
17443 /* The dependent declarator is optional if we are parsing an
17444 abstract-declarator. */
17448 /* Parse the dependent declarator. */
17453 friend_p);
17455 /* If we are parsing an abstract-declarator, we must handle the
17456 case where the dependent declarator is absent. */
17461 declarator = cp_parser_make_indirect_declarator
17463 }
17464 /* Everything else is a direct-declarator. */
17465 else
17466 {
17469 CPP_OPEN_PAREN);
17471 ctor_dtor_or_conv_p,
17473 }
17478 }
17480 /* Parse a direct-declarator or direct-abstract-declarator.
17482 direct-declarator:
17483 declarator-id
17484 direct-declarator ( parameter-declaration-clause )
17485 cv-qualifier-seq [opt]
17486 ref-qualifier [opt]
17487 exception-specification [opt]
17488 direct-declarator [ constant-expression [opt] ]
17489 ( declarator )
17491 direct-abstract-declarator:
17492 direct-abstract-declarator [opt]
17493 ( parameter-declaration-clause )
17494 cv-qualifier-seq [opt]
17495 ref-qualifier [opt]
17496 exception-specification [opt]
17497 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17498 ( abstract-declarator )
17500 Returns a representation of the declarator. DCL_KIND is
17501 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17502 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17503 we are parsing a direct-declarator. It is
17504 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17505 of ambiguity we prefer an abstract declarator, as per
17506 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17507 as for cp_parser_declarator. */
17511 cp_parser_declarator_kind dcl_kind,
17514 {
17524 {
17525 /* Peek at the next token. */
17528 {
17529 /* This is either a parameter-declaration-clause, or a
17530 parenthesized declarator. When we know we are parsing a
17531 named declarator, it must be a parenthesized declarator
17532 if FIRST is true. For instance, `(int)' is a
17533 parameter-declaration-clause, with an omitted
17534 direct-abstract-declarator. But `((*))', is a
17535 parenthesized abstract declarator. Finally, when T is a
17536 template parameter `(T)' is a
17537 parameter-declaration-clause, and not a parenthesized
17538 named declarator.
17540 We first try and parse a parameter-declaration-clause,
17541 and then try a nested declarator (if FIRST is true).
17543 It is not an error for it not to be a
17544 parameter-declaration-clause, even when FIRST is
17545 false. Consider,
17547 int i (int);
17548 int i (3);
17550 The first is the declaration of a function while the
17551 second is the definition of a variable, including its
17552 initializer.
17554 Having seen only the parenthesis, we cannot know which of
17555 these two alternatives should be selected. Even more
17556 complex are examples like:
17558 int i (int (a));
17559 int i (int (3));
17561 The former is a function-declaration; the latter is a
17562 variable initialization.
17564 Thus again, we try a parameter-declaration-clause, and if
17565 that fails, we back out and return. */
17568 {
17569 tree params;
17572 /* In a member-declarator, the only valid interpretation
17573 of a parenthesis is the start of a
17574 parameter-declaration-clause. (It is invalid to
17575 initialize a static data member with a parenthesized
17576 initializer; only the "=" form of initialization is
17577 permitted.) */
17581 /* Consume the `('. */
17584 {
17585 /* If this is going to be an abstract declarator, we're
17586 in a declarator and we can't have default args. */
17589 }
17593 /* Parse the parameter-declaration-clause. */
17596 /* Consume the `)'. */
17599 /* If all went well, parse the cv-qualifier-seq,
17600 ref-qualifier and the exception-specification. */
17602 {
17603 cp_cv_quals cv_quals;
17604 cp_virt_specifiers virt_specifiers;
17605 cp_ref_qualifier ref_qual;
17606 tree exception_specification;
17607 tree late_return;
17608 tree attrs;
17618 /* Parse the cv-qualifier-seq. */
17620 /* Parse the ref-qualifier. */
17622 /* And the exception-specification. */
17623 exception_specification
17628 /* In here, we handle cases where attribute is used after
17629 the function declaration. For example:
17630 void func (int x) __attribute__((vector(..))); */
17633 {
17637 CPP_SEMICOLON)
17639 CPP_OPEN_BRACE))
17642 ;
17643 else
17645 }
17646 late_return = (cp_parser_late_return_type_opt
17651 /* Parse the virt-specifier-seq. */
17654 /* Create the function-declarator. */
17656 params,
17657 cv_quals,
17658 virt_specifiers,
17659 ref_qual,
17660 exception_specification,
17661 late_return);
17663 /* Any subsequent parameter lists are to do with
17664 return type, so are not those of the declared
17665 function. */
17667 }
17669 /* Remove the function parms from scope. */
17673 /* Repeat the main loop. */
17675 }
17677 /* If this is the first, we can try a parenthesized
17678 declarator. */
17680 {
17686 /* Consume the `('. */
17688 /* Parse the nested declarator. */
17691 declarator
17697 /* Expect a `)'. */
17704 }
17705 /* Otherwise, we must be done. */
17706 else
17708 }
17712 {
17713 /* Parse an array-declarator. */
17722 /* Consume the `['. */
17724 /* Peek at the next token. */
17726 /* If the next token is `]', then there is no
17727 constant-expression. */
17729 {
17731 bounds
17741 {
17742 /* Normally, the array bound must be an integral constant
17743 expression. However, as an extension, we allow VLAs
17744 in function scopes as long as they aren't part of a
17745 parameter declaration. */
17749 }
17752 {
17753 /* Remember this wasn't a constant-expression. */
17756 }
17757 }
17758 else
17760 /* Look for the closing `]'. */
17762 {
17765 }
17770 }
17772 {
17773 {
17774 tree qualifying_scope;
17775 tree unqualified_name;
17776 tree attrs;
17777 special_function_kind sfk;
17782 /* Parse a declarator-id */
17785 {
17788 /* If we see an ellipsis, we should be looking at a
17789 parameter pack. */
17791 {
17792 /* Consume the `...' */
17796 }
17797 }
17800 unqualified_name
17804 {
17808 {
17809 /* Check whether an error occurred. */
17812 /* We already consumed the ellipsis to mark a
17813 parameter pack, but we have no way to report it,
17814 so abort the tentative parse. We will be exiting
17815 immediately anyway. */
17817 }
17818 else
17824 && (qualifying_scope
17826 {
17829 }
17830 }
17835 {
17840 }
17846 {
17847 /* In the declaration of a member of a template class
17848 outside of the class itself, the SCOPE will sometimes
17849 be a TYPENAME_TYPE. For example, given:
17851 template <typename T>
17852 int S<T>::R::i = 3;
17854 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17855 this context, we must resolve S<T>::R to an ordinary
17856 type, rather than a typename type.
17858 The reason we normally avoid resolving TYPENAME_TYPEs
17859 is that a specialization of `S' might render
17860 `S<T>::R' not a type. However, if `S' is
17861 specialized, then this `i' will not be used, so there
17862 is no harm in resolving the types here. */
17863 tree type;
17865 /* Resolve the TYPENAME_TYPE. */
17868 /* If that failed, the declarator is invalid. */
17870 {
17873 "cannot define member of dependent typedef "
17875 else
17880 }
17882 }
17887 {
17888 tree class_type;
17893 else
17897 {
17900 {
17903 {
17907 "use %<%T::%D%> instead of %<%T::%D%> to "
17909 class_type,
17914 }
17915 else
17917 }
17918 else
17919 {
17920 /* We do not attempt to print the declarator
17921 here because we do not have enough
17922 information about its original syntactic
17923 form. */
17927 }
17928 }
17931 {
17937 for an anonymous type, even if the type
17938 got a name for linkage purposes. */
17940 /* Handle correctly (c++/19200):
17942 struct S {
17943 struct T{};
17944 friend void S(T);
17945 };
17947 and also:
17949 namespace N {
17950 void S();
17951 }
17953 struct S {
17954 friend void N::S();
17955 }; */
17956 && !(friend_p
17959 class_type))
17960 {
17963 }
17971 }
17972 }
17974 unqualified_name,
17975 sfk);
17982 }
17984 handle_declarator:;
17987 {
17988 /* Any names that appear after the declarator-id for a
17989 member are looked up in the containing scope. */
17991 {
17992 /* But declarations with qualified-ids can't appear in a
17993 function. */
17997 }
17999 }
18003 /* Default args are only allowed on function
18004 declarations. */
18006 else
18010 }
18011 /* We're done. */
18012 else
18014 }
18016 /* For an abstract declarator, we might wind up with nothing at this
18017 point. That's an error; the declarator is not optional. */
18021 /* If we entered a scope, we must exit it now. */
18029 }
18031 /* Parse a ptr-operator.
18033 ptr-operator:
18034 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18035 * cv-qualifier-seq [opt]
18036 &
18037 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
18038 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18040 GNU Extension:
18042 ptr-operator:
18043 & cv-qualifier-seq [opt]
18045 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
18046 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
18047 an rvalue reference. In the case of a pointer-to-member, *TYPE is
18048 filled in with the TYPE containing the member. *CV_QUALS is
18049 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
18050 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
18051 Note that the tree codes returned by this function have nothing
18052 to do with the types of trees that will be eventually be created
18053 to represent the pointer or reference type being parsed. They are
18054 just constants with suggestive names. */
18055 static enum tree_code
18060 {
18065 /* Assume that it's not a pointer-to-member. */
18067 /* And that there are no cv-qualifiers. */
18070 /* Peek at the next token. */
18073 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18083 {
18084 /* Consume the `*', `&' or `&&'. */
18087 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18088 `&', if we are allowing GNU extensions. (The only qualifier
18089 that can legally appear after `&' is `restrict', but that is
18090 enforced during semantic analysis. */
18098 }
18099 else
18100 {
18101 /* Try the pointer-to-member case. */
18103 /* Look for the optional `::' operator. */
18106 /* Look for the nested-name specifier. */
18113 /* If we found it, and the next token is a `*', then we are
18114 indeed looking at a pointer-to-member operator. */
18117 {
18118 /* Indicate that the `*' operator was used. */
18126 else
18127 {
18128 /* The type of which the member is a member is given by the
18129 current SCOPE. */
18131 /* The next name will not be qualified. */
18135 /* Look for optional c++11 attributes. */
18139 /* Look for the optional cv-qualifier-seq. */
18141 }
18142 }
18143 /* If that didn't work we don't have a ptr-operator. */
18146 }
18149 }
18151 /* Parse an (optional) cv-qualifier-seq.
18153 cv-qualifier-seq:
18154 cv-qualifier cv-qualifier-seq [opt]
18156 cv-qualifier:
18157 const
18158 volatile
18160 GNU Extension:
18162 cv-qualifier:
18163 __restrict__
18165 Returns a bitmask representing the cv-qualifiers. */
18167 static cp_cv_quals
18169 {
18173 {
18175 cp_cv_quals cv_qualifier;
18177 /* Peek at the next token. */
18179 /* See if it's a cv-qualifier. */
18181 {
18197 }
18203 {
18206 }
18207 else
18208 {
18211 }
18212 }
18215 }
18217 /* Parse an (optional) ref-qualifier
18219 ref-qualifier:
18220 &
18221 &&
18223 Returns cp_ref_qualifier representing ref-qualifier. */
18225 static cp_ref_qualifier
18227 {
18230 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18235 {
18240 {
18252 }
18257 {
18260 }
18261 else
18262 {
18265 }
18266 }
18269 }
18271 /* Parse an (optional) virt-specifier-seq.
18273 virt-specifier-seq:
18274 virt-specifier virt-specifier-seq [opt]
18276 virt-specifier:
18277 override
18278 final
18280 Returns a bitmask representing the virt-specifiers. */
18282 static cp_virt_specifiers
18284 {
18288 {
18290 cp_virt_specifiers virt_specifier;
18292 /* Peek at the next token. */
18294 /* See if it's a virt-specifier-qualifier. */
18298 {
18301 }
18303 {
18306 }
18308 {
18310 }
18311 else
18315 {
18318 }
18319 else
18320 {
18323 }
18324 }
18326 }
18328 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18329 is in scope even though it isn't real. */
18331 void
18333 {
18334 tree this_parm;
18337 {
18338 /* We don't clear this between NSDMIs. Is it already what we want? */
18343 }
18346 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18348 current_class_ref
18351 }
18353 /* Return true iff our current scope is a non-static data member
18354 initializer. */
18356 bool
18358 {
18359 /* We recognize NSDMI context by the context-less 'this' pointer set up
18360 by the function above. */
18366 }
18368 /* Parse a late-specified return type, if any. This is not a separate
18369 non-terminal, but part of a function declarator, which looks like
18371 -> trailing-type-specifier-seq abstract-declarator(opt)
18373 Returns the type indicated by the type-id.
18375 In addition to this, parse any queued up omp declare simd
18376 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18378 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18379 function. */
18381 static tree
18383 cp_cv_quals quals)
18384 {
18388 && declarator
18394 /* Peek at the next token. */
18396 /* A late-specified return type is indicated by an initial '->'. */
18403 {
18404 /* DR 1207: 'this' is in scope in the trailing return type. */
18406 }
18409 {
18410 /* Consume the ->. */
18414 }
18417 declarator->std_attributes
18421 declarator->std_attributes
18426 {
18429 }
18432 }
18434 /* Parse a declarator-id.
18436 declarator-id:
18437 id-expression
18438 :: [opt] nested-name-specifier [opt] type-name
18440 In the `id-expression' case, the value returned is as for
18441 cp_parser_id_expression if the id-expression was an unqualified-id.
18442 If the id-expression was a qualified-id, then a SCOPE_REF is
18443 returned. The first operand is the scope (either a NAMESPACE_DECL
18444 or TREE_TYPE), but the second is still just a representation of an
18445 unqualified-id. */
18447 static tree
18449 {
18450 tree id;
18451 /* The expression must be an id-expression. Assume that qualified
18452 names are the names of types so that:
18454 template <class T>
18455 int S<T>::R::i = 3;
18457 will work; we must treat `S<T>::R' as the name of a type.
18458 Similarly, assume that qualified names are templates, where
18459 required, so that:
18461 template <class T>
18462 int S<T>::R<T>::i = 3;
18464 will work, too. */
18470 optional_p);
18474 }
18476 /* Parse a type-id.
18478 type-id:
18479 type-specifier-seq abstract-declarator [opt]
18481 Returns the TYPE specified. */
18483 static tree
18486 {
18487 cp_decl_specifier_seq type_specifier_seq;
18490 /* Parse the type-specifier-seq. */
18492 is_trailing_return,
18497 /* There might or might not be an abstract declarator. */
18499 /* Look for the declarator. */
18500 abstract_declarator
18505 /* Check to see if there really was a declarator. */
18510 /* None of the valid uses of 'auto' in C++14 involve the type-id
18511 nonterminal, but it is valid in a trailing-return-type. */
18514 {
18515 /* A type-id with type 'auto' is only ok if the abstract declarator
18516 is a function declarator with a late-specified return type. */
18521 else
18522 {
18525 }
18526 }
18529 is_template_arg);
18530 }
18533 {
18535 }
18538 {
18539 tree r;
18541 parser->type_definition_forbidden_message
18546 {
18549 }
18551 }
18554 {
18556 }
18558 /* Parse a type-specifier-seq.
18560 type-specifier-seq:
18561 type-specifier type-specifier-seq [opt]
18563 GNU extension:
18565 type-specifier-seq:
18566 attributes type-specifier-seq [opt]
18568 If IS_DECLARATION is true, we are at the start of a "condition" or
18569 exception-declaration, so we might be followed by a declarator-id.
18571 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18572 i.e. we've just seen "->".
18574 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18576 static void
18581 {
18586 /* Clear the TYPE_SPECIFIER_SEQ. */
18589 /* In the context of a trailing return type, enum E { } is an
18590 elaborated-type-specifier followed by a function-body, not an
18591 enum-specifier. */
18595 /* Parse the type-specifiers and attributes. */
18597 {
18598 tree type_specifier;
18601 /* Check for attributes first. */
18603 {
18608 }
18610 /* record the token of the beginning of the type specifier seq,
18611 for error reporting purposes*/
18615 /* Look for the type-specifier. */
18617 flags,
18618 type_specifier_seq,
18620 NULL,
18623 {
18624 /* If the first type-specifier could not be found, this is not a
18625 type-specifier-seq at all. */
18627 {
18628 /* Set in_declarator_p to avoid skipping to the semicolon. */
18640 }
18641 /* If subsequent type-specifiers could not be found, the
18642 type-specifier-seq is complete. */
18644 }
18647 /* The standard says that a condition can be:
18649 type-specifier-seq declarator = assignment-expression
18651 However, given:
18653 struct S {};
18654 if (int S = ...)
18656 we should treat the "S" as a declarator, not as a
18657 type-specifier. The standard doesn't say that explicitly for
18658 type-specifier-seq, but it does say that for
18659 decl-specifier-seq in an ordinary declaration. Perhaps it
18660 would be clearer just to allow a decl-specifier-seq here, and
18661 then add a semantic restriction that if any decl-specifiers
18662 that are not type-specifiers appear, the program is invalid. */
18665 }
18666 }
18668 /* Return whether the function currently being declared has an associated
18669 template parameter list. */
18671 static bool
18673 {
18686 }
18688 /* Parse a parameter-declaration-clause.
18690 parameter-declaration-clause:
18691 parameter-declaration-list [opt] ... [opt]
18692 parameter-declaration-list , ...
18694 Returns a representation for the parameter declarations. A return
18695 value of NULL indicates a parameter-declaration-clause consisting
18696 only of an ellipsis. */
18698 static tree
18700 {
18701 tree parameters;
18710 parser->auto_is_implicit_function_template_parm_p
18712 }
18718 && !processing_template_parmlist
18724 /* Peek at the next token. */
18726 /* Check for trivial parameter-declaration-clauses. */
18728 {
18729 /* Consume the `...' token. */
18732 }
18734 /* There are no parameters. */
18735 {
18736 #ifndef NO_IMPLICIT_EXTERN_C
18741 else
18742 #endif
18744 }
18745 /* Check for `(void)', too, which is a special case. */
18749 {
18750 /* Consume the `void' token. */
18752 /* There are no parameters. */
18754 }
18756 /* Parse the parameter-declaration-list. */
18758 /* If a parse error occurred while parsing the
18759 parameter-declaration-list, then the entire
18760 parameter-declaration-clause is erroneous. */
18764 /* Peek at the next token. */
18766 /* If it's a `,', the clause should terminate with an ellipsis. */
18768 {
18769 /* Consume the `,'. */
18771 /* Expect an ellipsis. */
18772 ellipsis_p
18774 }
18775 /* It might also be `...' if the optional trailing `,' was
18776 omitted. */
18778 {
18779 /* Consume the `...' token. */
18781 /* And remember that we saw it. */
18783 }
18784 else
18787 /* Finish the parameter list. */
18792 }
18794 /* Parse a parameter-declaration-list.
18796 parameter-declaration-list:
18797 parameter-declaration
18798 parameter-declaration-list , parameter-declaration
18800 Returns a representation of the parameter-declaration-list, as for
18801 cp_parser_parameter_declaration_clause. However, the
18802 `void_list_node' is never appended to the list. Upon return,
18803 *IS_ERROR will be true iff an error occurred. */
18805 static tree
18807 {
18813 /* Assume all will go well. */
18815 /* The special considerations that apply to a function within an
18816 unbraced linkage specifications do not apply to the parameters
18817 to the function. */
18818 saved_in_unbraced_linkage_specification_p
18822 /* Look for more parameters. */
18824 {
18832 /* Parse the parameter. */
18833 parameter
18838 /* We don't know yet if the enclosing context is deprecated, so wait
18839 and warn in grokparms if appropriate. */
18843 {
18844 /* If a function parameter pack was specified and an implicit template
18845 parameter was introduced during cp_parser_parameter_declaration,
18846 change any implicit parameters introduced into packs. */
18850 {
18858 }
18862 PARM,
18865 }
18869 /* If a parse error occurred parsing the parameter declaration,
18870 then the entire parameter-declaration-list is erroneous. */
18872 {
18876 }
18886 {
18890 }
18892 /* Add the new parameter to the list. */
18896 /* Peek at the next token. */
18899 /* These are for Objective-C++ */
18902 /* The parameter-declaration-list is complete. */
18905 {
18908 /* Peek at the next token. */
18910 /* If it's an ellipsis, then the list is complete. */
18913 /* Otherwise, there must be more parameters. Consume the
18914 `,'. */
18916 /* When parsing something like:
18918 int i(float f, double d)
18920 we can tell after seeing the declaration for "f" that we
18921 are not looking at an initialization of a variable "i",
18922 but rather at the declaration of a function "i".
18924 Due to the fact that the parsing of template arguments
18925 (as specified to a template-id) requires backtracking we
18926 cannot use this technique when inside a template argument
18927 list. */
18931 /* However, a parameter-declaration of the form
18932 "float(f)" (which is a valid declaration of a
18933 parameter "f") can also be interpreted as an
18934 expression (the conversion of "f" to "float"). */
18937 }
18938 else
18939 {
18947 }
18948 }
18950 parser->in_unbraced_linkage_specification_p
18953 /* Reset implicit_template_scope if we are about to leave the function
18954 parameter list that introduced it. Note that for out-of-line member
18955 definitions, there will be one or more class scopes before we get to
18956 the template parameter scope. */
18960 {
18964 {
18967 }
18968 }
18971 }
18973 /* Parse a parameter declaration.
18975 parameter-declaration:
18976 decl-specifier-seq ... [opt] declarator
18977 decl-specifier-seq declarator = assignment-expression
18978 decl-specifier-seq ... [opt] abstract-declarator [opt]
18979 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18981 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18982 declares a template parameter. (In that case, a non-nested `>'
18983 token encountered during the parsing of the assignment-expression
18984 is not interpreted as a greater-than operator.)
18986 Returns a representation of the parameter, or NULL if an error
18987 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18988 true iff the declarator is of the form "(p)". */
18994 {
18996 cp_decl_specifier_seq decl_specifiers;
18998 tree default_argument;
19003 /* In a template parameter, `>' is not an operator.
19005 [temp.param]
19007 When parsing a default template-argument for a non-type
19008 template-parameter, the first non-nested `>' is taken as the end
19009 of the template parameter-list rather than a greater-than
19010 operator. */
19012 /* Type definitions may not appear in parameter types. */
19014 parser->type_definition_forbidden_message
19017 /* Parse the declaration-specifiers. */
19019 CP_PARSER_FLAGS_NONE,
19023 /* Complain about missing 'typename' or other invalid type names. */
19028 /* If an error occurred, there's no reason to attempt to parse the
19029 rest of the declaration. */
19031 {
19034 }
19036 /* Peek at the next token. */
19039 /* If the next token is a `)', `,', `=', `>', or `...', then there
19040 is no declarator. However, when variadic templates are enabled,
19041 there may be a declarator following `...'. */
19046 {
19050 }
19051 /* Otherwise, there should be a declarator. */
19052 else
19053 {
19057 /* After seeing a decl-specifier-seq, if the next token is not a
19058 "(", there is no possibility that the code is a valid
19059 expression. Therefore, if parsing tentatively, we commit at
19060 this point. */
19062 /* In an expression context, having seen:
19064 (int((char ...
19066 we cannot be sure whether we are looking at a
19067 function-type (taking a "char" as a parameter) or a cast
19068 of some object of type "char" to "int". */
19074 /* Parse the declarator. */
19077 CP_PARSER_DECLARATOR_EITHER,
19079 parenthesized_p,
19083 /* After the declarator, allow more attributes. */
19084 decl_specifiers.attributes
19088 /* If the declarator is a template parameter pack, remember that and
19089 clear the flag in the declarator itself so we don't get errors
19090 from grokdeclarator. */
19092 {
19095 }
19096 }
19098 /* If the next token is an ellipsis, and we have not seen a
19099 declarator name, and the type of the declarator contains parameter
19100 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
19101 a parameter pack expansion expression. Otherwise, leave the
19102 ellipsis for a C-style variadic function. */
19105 {
19115 {
19116 /* Consume the `...'. */
19120 /* Build a pack expansion type */
19125 else
19127 }
19128 }
19130 /* The restriction on defining new types applies only to the type
19131 of the parameter, not to the default argument. */
19134 /* If the next token is `=', then process a default argument. */
19136 {
19138 /* If we are defining a class, then the tokens that make up the
19139 default argument must be saved and processed later. */
19144 /* Outside of a class definition, we can just parse the
19145 assignment-expression. */
19146 else
19147 default_argument
19151 {
19153 "default arguments are only "
19155 }
19157 || template_parameter_pack_p
19160 {
19161 /* Find the name of the parameter pack. */
19168 template_parm_p
19174 else
19176 template_parm_p
19183 }
19184 }
19185 else
19189 declarator,
19190 default_argument,
19191 template_parameter_pack_p);
19192 }
19194 /* Parse a default argument and return it.
19196 TEMPLATE_PARM_P is true if this is a default argument for a
19197 non-type template parameter. */
19198 static tree
19200 {
19206 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19207 set correctly. */
19210 /* Local variable names (and the `this' keyword) may not
19211 appear in a default argument. */
19214 /* Parse the assignment-expression. */
19219 /* The "this" pointer is not valid in a default argument. */
19221 {
19226 }
19227 default_argument
19229 /* Restore the "this" pointer. */
19231 {
19234 }
19243 }
19245 /* Parse a function-body.
19247 function-body:
19248 compound_statement */
19250 static void
19252 {
19254 }
19256 /* Parse a ctor-initializer-opt followed by a function-body. Return
19257 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19258 is true we are parsing a function-try-block. */
19260 static bool
19263 {
19271 /* Begin the function body. */
19273 /* Parse the optional ctor-initializer. */
19276 /* If we're parsing a constexpr constructor definition, we need
19277 to check that the constructor body is indeed empty. However,
19278 before we get to cp_parser_function_body lot of junk has been
19279 generated, so we can't just check that we have an empty block.
19280 Rather we take a snapshot of the outermost block, and check whether
19281 cp_parser_function_body changed its state. */
19283 {
19287 }
19288 /* Parse the function-body. */
19292 /* Finish the function body. */
19296 }
19298 /* Parse an initializer.
19300 initializer:
19301 = initializer-clause
19302 ( expression-list )
19304 Returns an expression representing the initializer. If no
19305 initializer is present, NULL_TREE is returned.
19307 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19308 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19309 set to TRUE if there is no initializer present. If there is an
19310 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19311 is set to true; otherwise it is set to false. */
19313 static tree
19316 {
19318 tree init;
19320 /* Peek at the next token. */
19323 /* Let our caller know whether or not this initializer was
19324 parenthesized. */
19326 /* Assume that the initializer is constant. */
19330 {
19331 /* Consume the `='. */
19333 /* Parse the initializer-clause. */
19335 }
19337 {
19342 non_constant_p);
19347 }
19349 {
19354 }
19355 else
19356 {
19357 /* Anything else is an error. */
19360 }
19363 }
19365 /* Parse an initializer-clause.
19367 initializer-clause:
19368 assignment-expression
19369 braced-init-list
19371 Returns an expression representing the initializer.
19373 If the `assignment-expression' production is used the value
19374 returned is simply a representation for the expression.
19376 Otherwise, calls cp_parser_braced_list. */
19378 static tree
19380 {
19381 tree initializer;
19383 /* Assume the expression is constant. */
19386 /* If it is not a `{', then we are looking at an
19387 assignment-expression. */
19389 {
19390 initializer
19393 non_constant_p);
19394 }
19395 else
19399 }
19401 /* Parse a brace-enclosed initializer list.
19403 braced-init-list:
19404 { initializer-list , [opt] }
19405 { }
19407 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19408 the elements of the initializer-list (or NULL, if the last
19409 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19410 NULL_TREE. There is no way to detect whether or not the optional
19411 trailing `,' was provided. NON_CONSTANT_P is as for
19412 cp_parser_initializer. */
19414 static tree
19416 {
19417 tree initializer;
19419 /* Consume the `{' token. */
19421 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19423 /* If it's not a `}', then there is a non-trivial initializer. */
19425 {
19426 /* Parse the initializer list. */
19429 /* A trailing `,' token is allowed. */
19432 }
19433 else
19435 /* Now, there should be a trailing `}'. */
19439 }
19441 /* Consume tokens up to, and including, the next non-nested closing `]'.
19442 Returns true iff we found a closing `]'. */
19444 static bool
19446 {
19450 {
19454 {
19457 /* If we've run out of tokens, then there is no closing `]'. */
19466 {
19469 }
19474 }
19476 /* Consume the token. */
19478 }
19479 }
19481 /* Return true if we are looking at an array-designator, false otherwise. */
19483 static bool
19485 {
19486 /* Consume the `['. */
19491 /* Skip tokens until the next token is a closing square bracket.
19492 If we find the closing `]', and the next token is a `=', then
19493 we are looking at an array designator. */
19494 bool array_designator_p
19498 /* Roll back the tokens we skipped. */
19502 }
19504 /* Parse an initializer-list.
19506 initializer-list:
19507 initializer-clause ... [opt]
19508 initializer-list , initializer-clause ... [opt]
19510 GNU Extension:
19512 initializer-list:
19513 designation initializer-clause ...[opt]
19514 initializer-list , designation initializer-clause ...[opt]
19516 designation:
19517 . identifier =
19518 identifier :
19519 [ constant-expression ] =
19521 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19522 for the initializer. If the INDEX of the elt is non-NULL, it is the
19523 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19524 as for cp_parser_initializer. */
19528 {
19531 /* Assume all of the expressions are constant. */
19534 /* Parse the rest of the list. */
19536 {
19538 tree designator;
19539 tree initializer;
19542 /* If the next token is an identifier and the following one is a
19543 colon, we are looking at the GNU designated-initializer
19544 syntax. */
19548 {
19549 /* Warn the user that they are using an extension. */
19552 /* Consume the identifier. */
19554 /* Consume the `:'. */
19556 }
19557 /* Also handle the C99 syntax, '. id ='. */
19562 {
19563 /* Warn the user that they are using an extension. */
19566 /* Consume the `.'. */
19568 /* Consume the identifier. */
19570 /* Consume the `='. */
19572 }
19573 /* Also handle C99 array designators, '[ const ] ='. */
19577 {
19578 /* In C++11, [ could start a lambda-introducer. */
19584 {
19587 }
19588 else
19589 {
19594 }
19600 }
19601 else
19604 /* Parse the initializer. */
19607 /* If any clause is non-constant, so is the entire initializer. */
19611 /* If we have an ellipsis, this is an initializer pack
19612 expansion. */
19614 {
19615 /* Consume the `...'. */
19618 /* Turn the initializer into an initializer expansion. */
19620 }
19622 /* Add it to the vector. */
19625 /* If the next token is not a comma, we have reached the end of
19626 the list. */
19630 /* Peek at the next token. */
19632 /* If the next token is a `}', then we're still done. An
19633 initializer-clause can have a trailing `,' after the
19634 initializer-list and before the closing `}'. */
19638 /* Consume the `,' token. */
19640 }
19643 }
19645 /* Classes [gram.class] */
19647 /* Parse a class-name.
19649 class-name:
19650 identifier
19651 template-id
19653 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19654 to indicate that names looked up in dependent types should be
19655 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19656 keyword has been used to indicate that the name that appears next
19657 is a template. TAG_TYPE indicates the explicit tag given before
19658 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19659 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19660 is the class being defined in a class-head. If ENUM_OK is TRUE,
19661 enum-names are also accepted.
19663 Returns the TYPE_DECL representing the class. */
19665 static tree
19674 {
19675 tree decl;
19676 tree scope;
19681 /* All class-names start with an identifier. */
19684 {
19687 }
19689 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19690 to a template-id, so we save it here. */
19695 /* Any name names a type if we're following the `typename' keyword
19696 in a qualified name where the enclosing scope is type-dependent. */
19699 /* Handle the common case (an identifier, but not a template-id)
19700 efficiently. */
19703 {
19707 /* Look for the identifier. */
19711 /* If the next token isn't an identifier, we are certainly not
19712 looking at a class-name. */
19715 /* If we know this is a type-name, there's no need to look it
19716 up. */
19719 else
19720 {
19721 tree ambiguous_decls;
19722 /* If we already know that this lookup is ambiguous, then
19723 we've already issued an error message; there's no reason
19724 to check again. */
19726 {
19729 }
19730 /* If the next token is a `::', then the name must be a type
19731 name.
19733 [basic.lookup.qual]
19735 During the lookup for a name preceding the :: scope
19736 resolution operator, object, function, and enumerator
19737 names are ignored. */
19740 /* Look up the name. */
19742 tag_type,
19745 check_dependency_p,
19749 {
19753 }
19754 }
19755 }
19756 else
19757 {
19758 /* Try a template-id. */
19760 check_dependency_p,
19761 tag_type,
19762 is_declaration);
19765 }
19769 /* If this is a typename, create a TYPENAME_TYPE. */
19771 {
19776 }
19780 /* Check to see that it is really the name of a class. */
19784 /* Situations like this:
19786 template <typename T> struct A {
19787 typename T::template X<int>::I i;
19788 };
19790 are problematic. Is `T::template X<int>' a class-name? The
19791 standard does not seem to be definitive, but there is no other
19792 valid interpretation of the following `::'. Therefore, those
19793 names are considered class-names. */
19794 {
19798 }
19803 /* In Objective-C 2.0, a classname followed by '.' starts a
19804 dot-syntax expression, and it's not a type-name. */
19816 }
19818 /* Parse a class-specifier.
19820 class-specifier:
19821 class-head { member-specification [opt] }
19823 Returns the TREE_TYPE representing the class. */
19825 static tree
19827 {
19828 tree type;
19842 /* Parse the class-head. */
19845 /* If the class-head was a semantic disaster, skip the entire body
19846 of the class. */
19848 {
19852 }
19854 /* Look for the `{'. */
19856 {
19859 }
19863 /* Issue an error message if type-definitions are forbidden here. */
19865 /* Remember that we are defining one more class. */
19867 /* Inside the class, surrounding template-parameter-lists do not
19868 apply. */
19869 saved_num_template_parameter_lists
19872 /* We are not in a function body. */
19875 /* Or in a loop. */
19878 /* Or in a switch. */
19881 /* We are not immediately inside an extern "lang" block. */
19882 saved_in_unbraced_linkage_specification_p
19886 /* Start the class. */
19888 {
19891 }
19895 /* If the type is erroneous, skip the entire body of the class. */
19897 else
19898 /* Parse the member-specification. */
19901 /* Look for the trailing `}'. */
19903 /* Look for trailing attributes to apply to this class. */
19911 /* We've finished a type definition. Check for the common syntax
19912 error of forgetting a semicolon after the definition. We need to
19913 be careful, as we can't just check for not-a-semicolon and be done
19914 with it; the user might have typed:
19916 class X { } c = ...;
19917 class X { } *p = ...;
19919 and so forth. Instead, enumerate all the possible tokens that
19920 might follow this production; if we don't see one of them, then
19921 complain and silently insert the semicolon. */
19922 {
19927 /* Don't try to parse c++11 attributes here. As per the
19928 grammar, that should be a task for
19929 cp_parser_decl_specifier_seq. */
19933 {
19944 /* While it's legal for type qualifiers and storage class
19945 specifiers to follow type definitions in the grammar, only
19946 compiler testsuites contain code like that. Assume that if
19947 we see such code, then what we're really seeing is a case
19948 like:
19950 class X { }
19951 const <type> var = ...;
19953 or
19955 class Y { }
19956 static <type> func (...) ...
19958 i.e. the qualifier or specifier applies to the next
19959 declaration. To do so, however, we need to look ahead one
19960 more token to see if *that* token is a type specifier.
19962 This code could be improved to handle:
19964 class Z { }
19965 static const <type> var = ...; */
19968 {
19971 /* Handling user-defined types here would be nice, but very
19972 tricky. */
19973 want_semicolon
19976 }
19980 }
19982 /* If we don't have a type, then something is very wrong and we
19983 shouldn't try to do anything clever. Likewise for not seeing the
19984 closing brace. */
19986 {
19987 cp_token_position prev
19998 else
20001 /* Unget one token and smash it to look as though we encountered
20002 a semicolon in the input stream. */
20007 }
20008 }
20010 /* If this class is not itself within the scope of another class,
20011 then we need to parse the bodies of all of the queued function
20012 definitions. Note that the queued functions defined in a class
20013 are not always processed immediately following the
20014 class-specifier for that class. Consider:
20016 struct A {
20017 struct B { void f() { sizeof (A); } };
20018 };
20020 If `f' were processed before the processing of `A' were
20021 completed, there would be no way to compute the size of `A'.
20022 Note that the nesting we are interested in here is lexical --
20023 not the semantic nesting given by TYPE_CONTEXT. In particular,
20024 for:
20026 struct A { struct B; };
20027 struct A::B { void f() { } };
20029 there is no need to delay the parsing of `A::B::f'. */
20031 {
20032 tree decl;
20039 /* In a first pass, parse default arguments to the functions.
20040 Then, in a second pass, parse the bodies of the functions.
20041 This two-phased approach handles cases like:
20043 struct S {
20044 void f() { g(); }
20045 void g(int i = 3);
20046 };
20048 */
20050 {
20052 /* If there are default arguments that have not yet been processed,
20053 take care of them now. */
20055 {
20060 }
20061 /* Make sure that any template parameters are in scope. */
20063 /* Parse the default argument expressions. */
20065 /* Remove any template parameters from the symbol table. */
20067 }
20069 /* Now parse any NSDMIs. */
20073 {
20075 {
20080 }
20083 }
20090 /* Now do some post-NSDMI bookkeeping. */
20096 /* Now parse the body of the functions. */
20098 {
20099 /* OpenMP UDRs need to be parsed before all other functions. */
20106 }
20107 else
20111 }
20112 else
20115 /* Put back any saved access checks. */
20118 /* Restore saved state. */
20122 parser->num_template_parameter_lists
20124 parser->in_unbraced_linkage_specification_p
20128 }
20130 static tree
20132 {
20133 tree ret;
20138 }
20140 /* Parse a class-head.
20142 class-head:
20143 class-key identifier [opt] base-clause [opt]
20144 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20145 class-key nested-name-specifier [opt] template-id
20146 base-clause [opt]
20148 class-virt-specifier:
20149 final
20151 GNU Extensions:
20152 class-key attributes identifier [opt] base-clause [opt]
20153 class-key attributes nested-name-specifier identifier base-clause [opt]
20154 class-key attributes nested-name-specifier [opt] template-id
20155 base-clause [opt]
20157 Upon return BASES is initialized to the list of base classes (or
20158 NULL, if there are none) in the same form returned by
20159 cp_parser_base_clause.
20161 Returns the TYPE of the indicated class. Sets
20162 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20163 involving a nested-name-specifier was used, and FALSE otherwise.
20165 Returns error_mark_node if this is not a class-head.
20167 Returns NULL_TREE if the class-head is syntactically valid, but
20168 semantically invalid in a way that means we should skip the entire
20169 body of the class. */
20171 static tree
20174 {
20175 tree nested_name_specifier;
20179 tree attributes;
20180 tree bases;
20190 /* Assume no nested-name-specifier will be present. */
20192 /* Assume no template parameter lists will be used in defining the
20193 type. */
20197 /* Look for the class-key. */
20202 /* Parse the attributes. */
20205 /* If the next token is `::', that is invalid -- but sometimes
20206 people do try to write:
20208 struct ::S {};
20210 Handle this gracefully by accepting the extra qualifier, and then
20211 issuing an error about it later if this really is a
20212 class-head. If it turns out just to be an elaborated type
20213 specifier, remain silent. */
20219 /* Determine the name of the class. Begin by looking for an
20220 optional nested-name-specifier. */
20222 nested_name_specifier
20228 /* If there was a nested-name-specifier, then there *must* be an
20229 identifier. */
20231 {
20233 /* Although the grammar says `identifier', it really means
20234 `class-name' or `template-name'. You are only allowed to
20235 define a class that has already been declared with this
20236 syntax.
20238 The proposed resolution for Core Issue 180 says that wherever
20239 you see `class T::X' you should treat `X' as a type-name.
20241 It is OK to define an inaccessible class; for example:
20243 class A { class B; };
20244 class A::B {};
20246 We do not know if we will see a class-name, or a
20247 template-name. We look for a class-name first, in case the
20248 class-name is a template-id; if we looked for the
20249 template-name first we would stop after the template-name. */
20254 class_type,
20258 /* If that didn't work, ignore the nested-name-specifier. */
20260 {
20266 }
20267 /* If we could not find a corresponding TYPE, treat this
20268 declaration like an unqualified declaration. */
20271 /* Otherwise, count the number of templates used in TYPE and its
20272 containing scopes. */
20273 else
20274 {
20275 tree scope;
20287 }
20288 }
20289 /* Otherwise, the identifier is optional. */
20290 else
20291 {
20292 /* We don't know whether what comes next is a template-id,
20293 an identifier, or nothing at all. */
20295 /* Check for a template-id. */
20300 class_key,
20302 /* If that didn't work, it could still be an identifier. */
20304 {
20306 {
20309 }
20310 else
20312 }
20313 else
20314 {
20317 }
20318 }
20323 {
20325 class_key,
20327 }
20330 /* If it's not a `:' or a `{' then we can't really be looking at a
20331 class-head, since a class-head only appears as part of a
20332 class-specifier. We have to detect this situation before calling
20333 xref_tag, since that has irreversible side-effects. */
20335 {
20339 }
20341 /* At this point, we're going ahead with the class-specifier, even
20342 if some other problem occurs. */
20345 {
20350 }
20351 /* Issue the error about the overly-qualified name now. */
20353 {
20358 }
20360 {
20365 }
20367 {
20368 tree scope;
20370 /* Reject typedef-names in class heads. */
20372 {
20375 type);
20378 }
20380 /* Figure out in what scope the declaration is being placed. */
20382 /* If that scope does not contain the scope in which the
20383 class was originally declared, the program is invalid. */
20385 {
20388 "declaration of %qD in namespace %qD which does not "
20391 else
20397 }
20398 /* [dcl.meaning]
20400 A declarator-id shall not be qualified except for the
20401 definition of a ... nested class outside of its class
20402 ... [or] the definition or explicit instantiation of a
20403 class member of a namespace outside of its namespace. */
20405 {
20410 }
20411 }
20412 /* An explicit-specialization must be preceded by "template <>". If
20413 it is not, try to recover gracefully. */
20417 {
20421 /* Take the same action that would have been taken by
20422 cp_parser_explicit_specialization. */
20425 }
20426 /* There must be no "return" statements between this point and the
20427 end of this function; set "type "to the correct return value and
20428 use "goto done;" to return. */
20429 /* Make sure that the right number of template parameters were
20430 present. */
20434 {
20435 /* If something went wrong, there is no point in even trying to
20436 process the class-definition. */
20439 }
20441 /* Look up the type. */
20443 {
20447 {
20451 }
20452 else
20453 {
20456 }
20459 }
20461 {
20462 tree class_type;
20464 /* Given:
20466 template <typename T> struct S { struct T };
20467 template <typename T> struct S<T>::T { };
20469 we will get a TYPENAME_TYPE when processing the definition of
20470 `S::T'. We need to resolve it to the actual type before we
20471 try to define it. */
20473 {
20478 else
20479 {
20482 }
20483 }
20487 {
20490 }
20493 /* Enter the scope indicated by the nested-name-specifier. */
20495 /* Get the canonical version of this type. */
20497 /* Call push_template_decl if it seems like we should be defining a
20498 template either from the template headers or the type we're
20499 defining, so that we diagnose both extra and missing headers. */
20503 {
20506 {
20509 }
20510 }
20514 }
20516 {
20517 /* If the class was unnamed, create a dummy name. */
20522 }
20524 /* Indicate whether this class was declared as a `class' or as a
20525 `struct'. */
20530 /* If this type was already complete, and we see another definition,
20531 that's an error. */
20533 {
20535 type);
20537 type);
20540 }
20545 {
20546 /* Apply attributes now, before any use of the class as a template
20547 argument in its base list. */
20550 }
20552 /* We will have entered the scope containing the class; the names of
20553 base classes should be looked up in that context. For example:
20555 struct A { struct B {}; struct C; };
20556 struct A::C : B {};
20558 is valid. */
20560 /* Get the list of base-classes, if there is one. */
20562 {
20563 /* PR59482: enter the class scope so that base-specifiers are looked
20564 up correctly. */
20568 /* PR59482: get out of the previously pushed class scope so that the
20569 subsequent pops pop the right thing. */
20572 }
20573 else
20576 /* If we're really defining a class, process the base classes.
20577 If they're invalid, fail. */
20582 done:
20583 /* Leave the scope given by the nested-name-specifier. We will
20584 enter the class scope itself while processing the members. */
20589 {
20592 }
20598 out:
20601 }
20603 /* Parse a class-key.
20605 class-key:
20606 class
20607 struct
20608 union
20610 Returns the kind of class-key specified, or none_type to indicate
20611 error. */
20613 static enum tag_types
20615 {
20619 /* Look for the class-key. */
20624 /* Check to see if the TOKEN is a class-key. */
20629 }
20631 /* Parse a type-parameter-key.
20633 type-parameter-key:
20634 class
20635 typename
20636 */
20638 static void
20640 {
20641 /* Look for the type-parameter-key. */
20645 {
20648 /* typename is not allowed in a template template parameter
20649 by the standard until C++1Z. */
20651 "ISO C++ forbids typename key in template template parameter;"
20653 }
20654 else
20658 }
20660 /* Parse an (optional) member-specification.
20662 member-specification:
20663 member-declaration member-specification [opt]
20664 access-specifier : member-specification [opt] */
20666 static void
20668 {
20670 {
20674 /* Peek at the next token. */
20676 /* If it's a `}', or EOF then we've seen all the members. */
20682 /* See if this token is a keyword. */
20685 {
20689 /* Consume the access-specifier. */
20691 /* Remember which access-specifier is active. */
20693 /* Look for the `:'. */
20698 /* Accept #pragmas at class scope. */
20700 {
20703 }
20705 /* Otherwise, the next construction must be a
20706 member-declaration. */
20708 }
20709 }
20710 }
20712 /* Parse a member-declaration.
20714 member-declaration:
20715 decl-specifier-seq [opt] member-declarator-list [opt] ;
20716 function-definition ; [opt]
20717 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20718 using-declaration
20719 template-declaration
20720 alias-declaration
20722 member-declarator-list:
20723 member-declarator
20724 member-declarator-list , member-declarator
20726 member-declarator:
20727 declarator pure-specifier [opt]
20728 declarator constant-initializer [opt]
20729 identifier [opt] : constant-expression
20731 GNU Extensions:
20733 member-declaration:
20734 __extension__ member-declaration
20736 member-declarator:
20737 declarator attributes [opt] pure-specifier [opt]
20738 declarator attributes [opt] constant-initializer [opt]
20739 identifier [opt] attributes [opt] : constant-expression
20741 C++0x Extensions:
20743 member-declaration:
20744 static_assert-declaration */
20746 static void
20748 {
20749 cp_decl_specifier_seq decl_specifiers;
20750 tree prefix_attributes;
20751 tree decl;
20760 /* Check for the `__extension__' keyword. */
20762 {
20763 /* Recurse. */
20765 /* Restore the old value of the PEDANTIC flag. */
20769 }
20771 /* Check for a template-declaration. */
20773 {
20774 /* An explicit specialization here is an error condition, and we
20775 expect the specialization handler to detect and report this. */
20779 else
20783 }
20785 /* Check for a using-declaration. */
20787 {
20789 {
20790 /* Parse the using-declaration. */
20794 }
20795 else
20796 {
20797 tree decl;
20801 /* Note that if we actually see the '=' token after the
20802 identifier, cp_parser_alias_declaration commits the
20803 tentative parse. In that case, we really expect an
20804 alias-declaration. Otherwise, we expect a using
20805 declaration. */
20806 alias_decl_expected =
20812 else
20816 }
20817 }
20819 /* Check for @defs. */
20821 {
20826 {
20831 }
20833 }
20835 /* If the next token is `static_assert' we have a static assertion. */
20837 {
20840 }
20847 /* Parse the decl-specifier-seq. */
20850 CP_PARSER_FLAGS_OPTIONAL,
20853 /* Check for an invalid type-name. */
20857 /* If there is no declarator, then the decl-specifier-seq should
20858 specify a type. */
20860 {
20861 /* If there was no decl-specifier-seq, and the next token is a
20862 `;', then we have something like:
20864 struct S { ; };
20866 [class.mem]
20868 Each member-declaration shall declare at least one member
20869 name of the class. */
20871 {
20875 }
20876 else
20877 {
20878 tree type;
20880 /* See if this declaration is a friend. */
20882 /* If there were decl-specifiers, check to see if there was
20883 a class-declaration. */
20886 /* Nested classes have already been added to the class, but
20887 a `friend' needs to be explicitly registered. */
20889 {
20890 /* If the `friend' keyword was present, the friend must
20891 be introduced with a class-key. */
20894 "in C++03 a class-key must be used "
20896 /* In this case:
20898 template <typename T> struct A {
20899 friend struct A<T>::B;
20900 };
20902 A<T>::B will be represented by a TYPENAME_TYPE, and
20903 therefore not recognized by check_tag_decl. */
20905 {
20909 }
20912 "friend declaration does not name a class or "
20914 else
20917 }
20918 /* If there is no TYPE, an error message will already have
20919 been issued. */
20921 ;
20922 /* An anonymous aggregate has to be handled specially; such
20923 a declaration really declares a data member (with a
20924 particular type), as opposed to a nested class. */
20926 {
20927 /* C++11 9.5/6. */
20930 "a storage class on an anonymous aggregate "
20933 /* Remove constructors and such from TYPE, now that we
20934 know it is an anonymous aggregate. */
20936 /* And make the corresponding data member. */
20939 /* Add it to the class. */
20941 }
20942 else
20943 cp_parser_check_access_in_redeclaration
20946 }
20947 }
20948 else
20949 {
20952 /* Clear attributes from the decl_specifiers but keep them
20953 around as prefix attributes that apply them to the entity
20954 being declared. */
20958 /* See if these declarations will be friends. */
20961 /* Keep going until we hit the `;' at the end of the
20962 declaration. */
20964 {
20966 tree first_attribute;
20968 /* Peek at the next token. */
20971 /* Check for a bitfield declaration. */
20976 {
20977 tree identifier;
20978 tree width;
20980 /* Get the name of the bitfield. Note that we cannot just
20981 check TOKEN here because it may have been invalidated by
20982 the call to cp_lexer_peek_nth_token above. */
20985 else
20988 /* Consume the `:' token. */
20990 /* Get the width of the bitfield. */
20991 width
20994 /* Look for attributes that apply to the bitfield. */
20996 /* Remember which attributes are prefix attributes and
20997 which are not. */
20999 /* Combine the attributes. */
21002 /* Create the bitfield declaration. */
21005 identifier,
21006 sfk_none)
21009 width,
21010 attributes);
21011 }
21012 else
21013 {
21015 tree initializer;
21016 tree asm_specification;
21019 /* Parse the declarator. */
21020 declarator
21025 friend_p);
21027 /* If something went wrong parsing the declarator, make sure
21028 that we at least consume some tokens. */
21030 {
21031 /* Skip to the end of the statement. */
21033 /* If the next token is not a semicolon, that is
21034 probably because we just skipped over the body of
21035 a function. So, we consume a semicolon if
21036 present, but do not issue an error message if it
21037 is not present. */
21039 CPP_SEMICOLON))
21042 }
21045 cp_parser_check_for_definition_in_return_type
21049 /* Look for an asm-specification. */
21051 /* Look for attributes that apply to the declaration. */
21053 /* Remember which attributes are prefix attributes and
21054 which are not. */
21056 /* Combine the attributes. */
21059 /* If it's an `=', then we have a constant-initializer or a
21060 pure-specifier. It is not correct to parse the
21061 initializer before registering the member declaration
21062 since the member declaration should be in scope while
21063 its initializer is processed. However, the rest of the
21064 front end does not yet provide an interface that allows
21065 us to handle this correctly. */
21067 {
21068 /* In [class.mem]:
21070 A pure-specifier shall be used only in the declaration of
21071 a virtual function.
21073 A member-declarator can contain a constant-initializer
21074 only if it declares a static member of integral or
21075 enumeration type.
21077 Therefore, if the DECLARATOR is for a function, we look
21078 for a pure-specifier; otherwise, we look for a
21079 constant-initializer. When we call `grokfield', it will
21080 perform more stringent semantics checks. */
21092 {
21094 /* Don't require a constant rvalue in C++11, since we
21095 might want a reference constant. We'll enforce
21096 constancy later. */
21098 /* Parse the initializer. */
21101 }
21102 else
21103 /* Parse the initializer. */
21105 }
21108 {
21112 else
21114 }
21115 /* Otherwise, there is no initializer. */
21116 else
21119 /* See if we are probably looking at a function
21120 definition. We are certainly not looking at a
21121 member-declarator. Calling `grokfield' has
21122 side-effects, so we must not do it unless we are sure
21123 that we are looking at a member-declarator. */
21126 {
21127 /* The grammar does not allow a pure-specifier to be
21128 used when a member function is defined. (It is
21129 possible that this fact is an oversight in the
21130 standard, since a pure function may be defined
21131 outside of the class-specifier. */
21137 declarator,
21138 attributes);
21141 /* If the member was not a friend, declare it here. */
21144 /* Peek at the next token. */
21146 /* If the next token is a semicolon, consume it. */
21150 }
21151 else
21154 /* Create the declaration. */
21159 {
21162 else
21164 }
21165 }
21169 /* Reset PREFIX_ATTRIBUTES. */
21175 /* If there is any qualification still in effect, clear it
21176 now; we will be starting fresh with the next declarator. */
21180 /* If it's a `,', then there are more declarators. */
21182 {
21185 {
21189 }
21190 }
21191 /* If the next token isn't a `;', then we have a parse error. */
21193 CPP_SEMICOLON))
21194 {
21195 /* The next token might be a ways away from where the
21196 actual semicolon is missing. Find the previous token
21197 and use that for our error position. */
21202 /* Assume that the user meant to provide a semicolon. If
21203 we were to cp_parser_skip_to_end_of_statement, we might
21204 skip to a semicolon inside a member function definition
21205 and issue nonsensical error messages. */
21207 }
21210 {
21211 /* Add DECL to the list of members. */
21213 /* Explicitly include, eg, NSDMIs, for better error
21214 recovery (c++/58650). */
21223 /* Add DECL to the queue of NSDMI to be parsed later. */
21225 }
21229 }
21230 }
21233 out:
21235 }
21237 /* Parse a pure-specifier.
21239 pure-specifier:
21240 = 0
21242 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21243 Otherwise, ERROR_MARK_NODE is returned. */
21245 static tree
21247 {
21250 /* Look for the `=' token. */
21253 /* Look for the `0' token. */
21262 /* Accept = default or = delete in c++0x mode. */
21265 {
21268 }
21270 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21272 {
21277 }
21279 {
21282 }
21285 }
21287 /* Parse a constant-initializer.
21289 constant-initializer:
21290 = constant-expression
21292 Returns a representation of the constant-expression. */
21294 static tree
21296 {
21297 /* Look for the `=' token. */
21301 /* It is invalid to write:
21303 struct S { static const int i = { 7 }; };
21305 */
21307 {
21310 /* Consume the opening brace. */
21312 /* Skip the initializer. */
21314 /* Look for the trailing `}'. */
21318 }
21321 }
21323 /* Derived classes [gram.class.derived] */
21325 /* Parse a base-clause.
21327 base-clause:
21328 : base-specifier-list
21330 base-specifier-list:
21331 base-specifier ... [opt]
21332 base-specifier-list , base-specifier ... [opt]
21334 Returns a TREE_LIST representing the base-classes, in the order in
21335 which they were declared. The representation of each node is as
21336 described by cp_parser_base_specifier.
21338 In the case that no bases are specified, this function will return
21339 NULL_TREE, not ERROR_MARK_NODE. */
21341 static tree
21343 {
21346 /* Look for the `:' that begins the list. */
21349 /* Scan the base-specifier-list. */
21351 {
21353 tree base;
21356 /* Look for the base-specifier. */
21358 /* Look for the (optional) ellipsis. */
21360 {
21361 /* Consume the `...'. */
21365 }
21367 /* Add BASE to the front of the list. */
21369 {
21371 /* Make this a pack expansion type. */
21375 {
21378 }
21379 }
21380 /* Peek at the next token. */
21382 /* If it's not a comma, then the list is complete. */
21385 /* Consume the `,'. */
21387 }
21389 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21390 base class had a qualified name. However, the next name that
21391 appears is certainly not qualified. */
21397 }
21399 /* Parse a base-specifier.
21401 base-specifier:
21402 :: [opt] nested-name-specifier [opt] class-name
21403 virtual access-specifier [opt] :: [opt] nested-name-specifier
21404 [opt] class-name
21405 access-specifier virtual [opt] :: [opt] nested-name-specifier
21406 [opt] class-name
21408 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21409 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21410 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21411 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21413 static tree
21415 {
21423 tree type;
21425 /* Process the optional `virtual' and `access-specifier'. */
21427 {
21428 /* Peek at the next token. */
21430 /* Process `virtual'. */
21432 {
21434 /* If `virtual' appears more than once, issue an error. */
21436 {
21440 }
21444 /* Consume the `virtual' token. */
21452 /* If more than one access specifier appears, issue an
21453 error. */
21456 {
21460 }
21464 /* Consume the access-specifier. */
21472 }
21473 }
21474 /* It is not uncommon to see programs mechanically, erroneously, use
21475 the 'typename' keyword to denote (dependent) qualified types
21476 as base classes. */
21478 {
21483 else
21485 "keyword %<typename%> not allowed in this context "
21488 }
21490 /* Look for the optional `::' operator. */
21492 /* Look for the nested-name-specifier. The simplest way to
21493 implement:
21495 [temp.res]
21497 The keyword `typename' is not permitted in a base-specifier or
21498 mem-initializer; in these contexts a qualified name that
21499 depends on a template-parameter is implicitly assumed to be a
21500 type name.
21502 is to pretend that we have seen the `typename' keyword at this
21503 point. */
21507 typename_type,
21509 /* If the base class is given by a qualified name, assume that names
21510 we see are type names or templates, as appropriate. */
21516 /* DR 950 allows decltype as a base-specifier. */
21518 else
21519 {
21520 /* Otherwise, look for the class-name. */
21522 class_scope_p,
21523 template_p,
21524 typename_type,
21529 }
21535 }
21537 /* Exception handling [gram.exception] */
21539 /* Parse an (optional) noexcept-specification.
21541 noexcept-specification:
21542 noexcept ( constant-expression ) [opt]
21544 If no noexcept-specification is present, returns NULL_TREE.
21545 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21546 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21547 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21548 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21549 in which case a boolean condition is returned instead. */
21551 static tree
21556 {
21560 /* Peek at the next token. */
21563 /* Is it a noexcept-specification? */
21565 {
21566 tree expr;
21570 {
21574 {
21575 /* Types may not be defined in an exception-specification. */
21577 parser->type_definition_forbidden_message
21582 /* Restore the saved message. */
21584 }
21585 else
21586 {
21589 }
21592 }
21593 else
21594 {
21598 }
21600 /* We cannot build a noexcept-spec right away because this will check
21601 that expr is a constexpr. */
21604 else
21606 }
21607 else
21609 }
21611 /* Parse an (optional) exception-specification.
21613 exception-specification:
21614 throw ( type-id-list [opt] )
21616 Returns a TREE_LIST representing the exception-specification. The
21617 TREE_VALUE of each node is a type. */
21619 static tree
21621 {
21623 tree type_id_list;
21626 /* Peek at the next token. */
21629 /* Is it a noexcept-specification? */
21635 /* If it's not `throw', then there's no exception-specification. */
21639 #if 0
21640 /* Enable this once a lot of code has transitioned to noexcept? */
21644 #endif
21646 /* Consume the `throw'. */
21649 /* Look for the `('. */
21652 /* Peek at the next token. */
21654 /* If it's not a `)', then there is a type-id-list. */
21656 {
21657 /* Types may not be defined in an exception-specification. */
21659 parser->type_definition_forbidden_message
21661 /* Parse the type-id-list. */
21663 /* Restore the saved message. */
21665 }
21666 else
21669 /* Look for the `)'. */
21673 }
21675 /* Parse an (optional) type-id-list.
21677 type-id-list:
21678 type-id ... [opt]
21679 type-id-list , type-id ... [opt]
21681 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21682 in the order that the types were presented. */
21684 static tree
21686 {
21690 {
21692 tree type;
21694 /* Get the next type-id. */
21696 /* Parse the optional ellipsis. */
21698 {
21699 /* Consume the `...'. */
21702 /* Turn the type into a pack expansion expression. */
21704 }
21705 /* Add it to the list. */
21707 /* Peek at the next token. */
21709 /* If it is not a `,', we are done. */
21712 /* Consume the `,'. */
21714 }
21717 }
21719 /* Parse a try-block.
21721 try-block:
21722 try compound-statement handler-seq */
21724 static tree
21726 {
21727 tree try_block;
21741 }
21743 /* Parse a function-try-block.
21745 function-try-block:
21746 try ctor-initializer [opt] function-body handler-seq */
21748 static bool
21750 {
21751 tree compound_stmt;
21752 tree try_block;
21755 /* Look for the `try' keyword. */
21758 /* Let the rest of the front end know where we are. */
21760 /* Parse the function-body. */
21761 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21763 /* We're done with the `try' part. */
21765 /* Parse the handlers. */
21767 /* We're done with the handlers. */
21771 }
21773 /* Parse a handler-seq.
21775 handler-seq:
21776 handler handler-seq [opt] */
21778 static void
21780 {
21782 {
21785 /* Parse the handler. */
21787 /* Peek at the next token. */
21789 /* If it's not `catch' then there are no more handlers. */
21792 }
21793 }
21795 /* Parse a handler.
21797 handler:
21798 catch ( exception-declaration ) compound-statement */
21800 static void
21802 {
21803 tree handler;
21804 tree declaration;
21814 }
21816 /* Parse an exception-declaration.
21818 exception-declaration:
21819 type-specifier-seq declarator
21820 type-specifier-seq abstract-declarator
21821 type-specifier-seq
21822 ...
21824 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21825 ellipsis variant is used. */
21827 static tree
21829 {
21830 cp_decl_specifier_seq type_specifiers;
21834 /* If it's an ellipsis, it's easy to handle. */
21836 {
21837 /* Consume the `...' token. */
21840 }
21842 /* Types may not be defined in exception-declarations. */
21844 parser->type_definition_forbidden_message
21847 /* Parse the type-specifier-seq. */
21851 /* If it's a `)', then there is no declarator. */
21854 else
21861 /* Restore the saved message. */
21868 }
21870 /* Parse a throw-expression.
21872 throw-expression:
21873 throw assignment-expression [opt]
21875 Returns a THROW_EXPR representing the throw-expression. */
21877 static tree
21879 {
21880 tree expression;
21885 /* Figure out whether or not there is an assignment-expression
21886 following the "throw" keyword. */
21894 else
21898 }
21900 /* GNU Extensions */
21902 /* Parse an (optional) asm-specification.
21904 asm-specification:
21905 asm ( string-literal )
21907 If the asm-specification is present, returns a STRING_CST
21908 corresponding to the string-literal. Otherwise, returns
21909 NULL_TREE. */
21911 static tree
21913 {
21915 tree asm_specification;
21917 /* Peek at the next token. */
21919 /* If the next token isn't the `asm' keyword, then there's no
21920 asm-specification. */
21924 /* Consume the `asm' token. */
21926 /* Look for the `('. */
21929 /* Look for the string-literal. */
21932 /* Look for the `)'. */
21936 }
21938 /* Parse an asm-operand-list.
21940 asm-operand-list:
21941 asm-operand
21942 asm-operand-list , asm-operand
21944 asm-operand:
21945 string-literal ( expression )
21946 [ string-literal ] string-literal ( expression )
21948 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21949 each node is the expression. The TREE_PURPOSE is itself a
21950 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21951 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21952 is a STRING_CST for the string literal before the parenthesis. Returns
21953 ERROR_MARK_NODE if any of the operands are invalid. */
21955 static tree
21957 {
21962 {
21963 tree string_literal;
21964 tree expression;
21965 tree name;
21968 {
21969 /* Consume the `[' token. */
21971 /* Read the operand name. */
21976 /* Look for the closing `]'. */
21978 }
21979 else
21981 /* Look for the string-literal. */
21984 /* Look for the `('. */
21986 /* Parse the expression. */
21988 /* Look for the `)'. */
21996 /* Add this operand to the list. */
21998 expression,
21999 asm_operands);
22000 /* If the next token is not a `,', there are no more
22001 operands. */
22004 /* Consume the `,'. */
22006 }
22009 }
22011 /* Parse an asm-clobber-list.
22013 asm-clobber-list:
22014 string-literal
22015 asm-clobber-list , string-literal
22017 Returns a TREE_LIST, indicating the clobbers in the order that they
22018 appeared. The TREE_VALUE of each node is a STRING_CST. */
22020 static tree
22022 {
22026 {
22027 tree string_literal;
22029 /* Look for the string literal. */
22031 /* Add it to the list. */
22033 /* If the next token is not a `,', then the list is
22034 complete. */
22037 /* Consume the `,' token. */
22039 }
22042 }
22044 /* Parse an asm-label-list.
22046 asm-label-list:
22047 identifier
22048 asm-label-list , identifier
22050 Returns a TREE_LIST, indicating the labels in the order that they
22051 appeared. The TREE_VALUE of each node is a label. */
22053 static tree
22055 {
22059 {
22062 /* Look for the identifier. */
22065 {
22068 {
22074 }
22075 }
22076 /* If the next token is not a `,', then the list is
22077 complete. */
22080 /* Consume the `,' token. */
22082 }
22085 }
22087 /* Return TRUE iff the next tokens in the stream are possibly the
22088 beginning of a GNU extension attribute. */
22090 static bool
22092 {
22094 }
22096 /* Return TRUE iff the next tokens in the stream are possibly the
22097 beginning of a standard C++-11 attribute specifier. */
22099 static bool
22101 {
22103 }
22105 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22106 beginning of a standard C++-11 attribute specifier. */
22108 static bool
22110 {
22118 }
22120 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22121 beginning of a GNU extension attribute. */
22123 static bool
22125 {
22129 }
22131 /* Return true iff the next tokens can be the beginning of either a
22132 GNU attribute list, or a standard C++11 attribute sequence. */
22134 static bool
22136 {
22139 }
22141 /* Return true iff the next Nth tokens can be the beginning of either
22142 a GNU attribute list, or a standard C++11 attribute sequence. */
22144 static bool
22146 {
22149 }
22151 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22152 of GNU attributes, or return NULL. */
22154 static tree
22156 {
22160 }
22162 #define CILK_SIMD_FN_CLAUSE_MASK \
22163 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22164 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22165 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22166 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22167 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22169 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22170 vector [(<clauses>)] */
22172 static void
22174 {
22178 {
22183 }
22186 {
22189 paren_scope++;
22190 }
22192 {
22195 paren_scope++;
22197 paren_scope--;
22198 /* Do not push the last ')' */
22201 }
22210 }
22212 /* Parse an (optional) series of attributes.
22214 attributes:
22215 attributes attribute
22217 attribute:
22218 __attribute__ (( attribute-list [opt] ))
22220 The return value is as for cp_parser_gnu_attribute_list. */
22222 static tree
22224 {
22228 {
22230 tree attribute_list;
22233 /* Peek at the next token. */
22235 /* If it's not `__attribute__', then we're done. */
22239 /* Consume the `__attribute__' keyword. */
22241 /* Look for the two `(' tokens. */
22245 /* Peek at the next token. */
22248 /* Parse the attribute-list. */
22250 else
22251 /* If the next token is a `)', then there is no attribute
22252 list. */
22255 /* Look for the two `)' tokens. */
22263 /* Add these new attributes to the list. */
22265 }
22268 }
22270 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22271 "__vector" or "__vector__." */
22275 {
22279 }
22281 /* Parse a GNU attribute-list.
22283 attribute-list:
22284 attribute
22285 attribute-list , attribute
22287 attribute:
22288 identifier
22289 identifier ( identifier )
22290 identifier ( identifier , expression-list )
22291 identifier ( expression-list )
22293 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22294 to an attribute. The TREE_PURPOSE of each node is the identifier
22295 indicating which attribute is in use. The TREE_VALUE represents
22296 the arguments, if any. */
22298 static tree
22300 {
22306 {
22308 tree identifier;
22309 tree attribute;
22311 /* Look for the identifier. We also allow keywords here; for
22312 example `__attribute__ ((const))' is legal. */
22316 {
22319 /* Consume the token, but save it since we need it for the
22320 SIMD enabled function parsing. */
22323 /* Save away the identifier that indicates which attribute
22324 this is. */
22326 /* For keywords, use the canonical spelling, not the
22327 parsed identifier. */
22333 /* Peek at the next token. */
22335 /* If it's an `(', then parse the attribute arguments. */
22337 {
22342 {
22345 }
22346 else
22347 vec = cp_parser_parenthesized_expression_list
22353 else
22354 {
22357 }
22358 /* Save the arguments away. */
22360 }
22362 {
22365 }
22368 {
22369 /* Add this attribute to the list. */
22372 }
22375 }
22376 /* Now, look for more attributes. If the next token isn't a
22377 `,', we're done. */
22381 /* Consume the comma and keep going. */
22383 }
22386 /* We built up the list in reverse order. */
22388 }
22390 /* Parse a standard C++11 attribute.
22392 The returned representation is a TREE_LIST which TREE_PURPOSE is
22393 the scoped name of the attribute, and the TREE_VALUE is its
22394 arguments list.
22396 Note that the scoped name of the attribute is itself a TREE_LIST
22397 which TREE_PURPOSE is the namespace of the attribute, and
22398 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22399 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22400 and which TREE_PURPOSE is directly the attribute name.
22402 Clients of the attribute code should use get_attribute_namespace
22403 and get_attribute_name to get the actual namespace and name of
22404 attributes, regardless of their being GNU or C++11 attributes.
22406 attribute:
22407 attribute-token attribute-argument-clause [opt]
22409 attribute-token:
22410 identifier
22411 attribute-scoped-token
22413 attribute-scoped-token:
22414 attribute-namespace :: identifier
22416 attribute-namespace:
22417 identifier
22419 attribute-argument-clause:
22420 ( balanced-token-seq )
22422 balanced-token-seq:
22423 balanced-token [opt]
22424 balanced-token-seq balanced-token
22426 balanced-token:
22427 ( balanced-token-seq )
22428 [ balanced-token-seq ]
22429 { balanced-token-seq }. */
22431 static tree
22433 {
22437 /* First, parse name of the attribute, a.k.a attribute-token. */
22454 {
22455 /* We are seeing a scoped attribute token. */
22465 else
22466 {
22470 }
22472 NULL_TREE);
22474 }
22475 else
22476 {
22478 NULL_TREE);
22479 /* C++11 noreturn attribute is equivalent to GNU's. */
22482 /* C++14 deprecated attribute is equivalent to GNU's. */
22484 {
22487 "%<deprecated%> is a C++14 feature;"
22490 }
22491 }
22493 /* Now parse the optional argument clause of the attribute. */
22498 {
22504 /* A GNU attribute that takes an identifier in parameter. */
22507 vec = cp_parser_parenthesized_expression_list
22513 else
22514 {
22517 }
22521 else
22523 }
22526 }
22528 /* Check that the attribute ATTRIBUTE appears at most once in the
22529 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
22530 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
22531 isn't implemented yet in GCC. */
22533 static void
22535 {
22537 {
22547 }
22548 }
22550 /* Parse a list of standard C++-11 attributes.
22552 attribute-list:
22553 attribute [opt]
22554 attribute-list , attribute[opt]
22555 attribute ...
22556 attribute-list , attribute ...
22557 */
22559 static tree
22561 {
22566 {
22571 {
22575 }
22578 {
22583 }
22587 }
22590 }
22592 /* Parse a standard C++-11 attribute specifier.
22594 attribute-specifier:
22595 [ [ attribute-list ] ]
22596 alignment-specifier
22598 alignment-specifier:
22599 alignas ( type-id ... [opt] )
22600 alignas ( alignment-expression ... [opt] ). */
22602 static tree
22604 {
22610 {
22619 else
22620 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22621 when we are sure that we have actually parsed them. */
22623 }
22624 else
22625 {
22626 tree alignas_expr;
22628 /* Look for an alignment-specifier. */
22640 {
22643 }
22649 {
22653 alignas_expr =
22660 }
22666 {
22669 }
22672 {
22675 }
22677 /* Build the C++-11 representation of an 'aligned'
22678 attribute. */
22679 attributes =
22682 alignas_expr);
22683 }
22686 }
22688 /* Parse a standard C++-11 attribute-specifier-seq.
22690 attribute-specifier-seq:
22691 attribute-specifier-seq [opt] attribute-specifier
22692 */
22694 static tree
22696 {
22700 {
22709 }
22713 }
22715 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22716 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22717 current value of the PEDANTIC flag, regardless of whether or not
22718 the `__extension__' keyword is present. The caller is responsible
22719 for restoring the value of the PEDANTIC flag. */
22721 static bool
22723 {
22724 /* Save the old value of the PEDANTIC flag. */
22728 {
22729 /* Consume the `__extension__' token. */
22731 /* We're not being pedantic while the `__extension__' keyword is
22732 in effect. */
22736 }
22739 }
22741 /* Parse a label declaration.
22743 label-declaration:
22744 __label__ label-declarator-seq ;
22746 label-declarator-seq:
22747 identifier , label-declarator-seq
22748 identifier */
22750 static void
22752 {
22753 /* Look for the `__label__' keyword. */
22757 {
22758 tree identifier;
22760 /* Look for an identifier. */
22762 /* If we failed, stop. */
22765 /* Declare it as a label. */
22767 /* If the next token is a `;', stop. */
22770 /* Look for the `,' separating the label declarations. */
22772 }
22774 /* Look for the final `;'. */
22776 }
22778 /* Support Functions */
22780 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22781 NAME should have one of the representations used for an
22782 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22783 is returned. If PARSER->SCOPE is a dependent type, then a
22784 SCOPE_REF is returned.
22786 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22787 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22788 was formed. Abstractly, such entities should not be passed to this
22789 function, because they do not need to be looked up, but it is
22790 simpler to check for this special case here, rather than at the
22791 call-sites.
22793 In cases not explicitly covered above, this function returns a
22794 DECL, OVERLOAD, or baselink representing the result of the lookup.
22795 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22796 is returned.
22798 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22799 (e.g., "struct") that was used. In that case bindings that do not
22800 refer to types are ignored.
22802 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22803 ignored.
22805 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22806 are ignored.
22808 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22809 types.
22811 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22812 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22813 NULL_TREE otherwise. */
22815 static tree
22822 location_t name_location)
22823 {
22824 tree decl;
22827 /* Assume that the lookup will be unambiguous. */
22831 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22832 no longer valid. Note that if we are parsing tentatively, and
22833 the parse fails, OBJECT_TYPE will be automatically restored. */
22839 /* A template-id has already been resolved; there is no lookup to
22840 do. */
22844 {
22848 }
22850 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22851 it should already have been checked to make sure that the name
22852 used matches the type being destroyed. */
22854 {
22855 tree type;
22857 /* Figure out to which type this destructor applies. */
22862 else
22864 /* If that's not a class type, there is no destructor. */
22871 /* If it was a class type, return the destructor. */
22873 }
22875 /* By this point, the NAME should be an ordinary identifier. If
22876 the id-expression was a qualified name, the qualifying scope is
22877 stored in PARSER->SCOPE at this point. */
22880 /* Perform the lookup. */
22882 {
22888 /* If the SCOPE is dependent, the lookup must be deferred until
22889 the template is instantiated -- unless we are explicitly
22890 looking up names in uninstantiated templates. Even then, we
22891 cannot look up the name if the scope is not a class type; it
22892 might, for example, be a template type parameter. */
22897 /* Defer lookup. */
22899 else
22900 {
22903 /* If PARSER->SCOPE is a dependent type, then it must be a
22904 class type, and we must not be checking dependencies;
22905 otherwise, we would have processed this lookup above. So
22906 that PARSER->SCOPE is not considered a dependent base by
22907 lookup_member, we must enter the scope here. */
22911 /* If the PARSER->SCOPE is a template specialization, it
22912 may be instantiated during name lookup. In that case,
22913 errors may be issued. Even if we rollback the current
22914 tentative parse, those errors are valid. */
22919 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22920 lookup result and the nested-name-specifier nominates a class C:
22921 * if the name specified after the nested-name-specifier, when
22922 looked up in C, is the injected-class-name of C (Clause 9), or
22923 * if the name specified after the nested-name-specifier is the
22924 same as the identifier or the simple-template-id's template-
22925 name in the last component of the nested-name-specifier,
22926 the name is instead considered to name the constructor of
22927 class C. [ Note: for example, the constructor is not an
22928 acceptable lookup result in an elaborated-type-specifier so
22929 the constructor would not be used in place of the
22930 injected-class-name. --end note ] Such a constructor name
22931 shall be used only in the declarator-id of a declaration that
22932 names a constructor or in a using-declaration. */
22940 /* If we have a single function from a using decl, pull it out. */
22947 }
22949 /* If the scope is a dependent type and either we deferred lookup or
22950 we did lookup but didn't find the name, rememeber the name. */
22953 {
22955 {
22956 tree type;
22958 /* The resolution to Core Issue 180 says that `struct
22959 A::B' should be considered a type-name, even if `A'
22960 is dependent. */
22965 }
22969 CPP_CLOSE_PAREN)))
22973 else
22976 is_template);
22977 }
22980 }
22982 {
22983 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22984 OBJECT_TYPE is not a class. */
22986 /* If the OBJECT_TYPE is a template specialization, it may
22987 be instantiated during name lookup. In that case, errors
22988 may be issued. Even if we rollback the current tentative
22989 parse, those errors are valid. */
22991 name,
22994 tf_warning_or_error);
22995 else
22999 /* Look it up in the enclosing context. */
23005 }
23006 else
23007 {
23013 }
23015 /* If the lookup failed, let our caller know. */
23019 /* Pull out the template from an injected-class-name (or multiple). */
23023 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
23025 {
23028 /* The error message we have to print is too complicated for
23029 cp_parser_error, so we incorporate its actions directly. */
23031 {
23033 name);
23035 }
23037 }
23045 /* If we have resolved the name of a member declaration, check to
23046 see if the declaration is accessible. When the name resolves to
23047 set of overloaded functions, accessibility is checked when
23048 overload resolution is done.
23050 During an explicit instantiation, access is not checked at all,
23051 as per [temp.explicit]. */
23058 }
23060 /* Like cp_parser_lookup_name, but for use in the typical case where
23061 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
23062 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
23064 static tree
23066 {
23068 none_type,
23073 location);
23074 }
23076 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
23077 the current context, return the TYPE_DECL. If TAG_NAME_P is
23078 true, the DECL indicates the class being defined in a class-head,
23079 or declared in an elaborated-type-specifier.
23081 Otherwise, return DECL. */
23083 static tree
23085 {
23086 /* If the TEMPLATE_DECL is being declared as part of a class-head,
23087 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
23089 struct A {
23090 template <typename T> struct B;
23091 };
23093 template <typename T> struct A::B {};
23095 Similarly, in an elaborated-type-specifier:
23097 namespace N { struct X{}; }
23099 struct A {
23100 template <typename T> friend struct N::X;
23101 };
23103 However, if the DECL refers to a class type, and we are in
23104 the scope of the class, then the name lookup automatically
23105 finds the TYPE_DECL created by build_self_reference rather
23106 than a TEMPLATE_DECL. For example, in:
23108 template <class T> struct S {
23109 S s;
23110 };
23112 there is no need to handle such case. */
23118 }
23120 /* If too many, or too few, template-parameter lists apply to the
23121 declarator, issue an error message. Returns TRUE if all went well,
23122 and FALSE otherwise. */
23124 static bool
23127 location_t declarator_location)
23128 {
23130 {
23132 {
23140 /* If the DECLARATOR has the form `X<y>' then it uses one
23141 additional level of template parameters. */
23144 return cp_parser_check_template_parameters
23146 }
23161 }
23163 }
23165 /* NUM_TEMPLATES were used in the current declaration. If that is
23166 invalid, return FALSE and issue an error messages. Otherwise,
23167 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23168 declarator and we can print more accurate diagnostics. */
23170 static bool
23173 location_t location,
23175 {
23176 /* If there are the same number of template classes and parameter
23177 lists, that's OK. */
23180 /* If there are more, but only one more, then we are referring to a
23181 member template. That's OK too. */
23184 /* If there are more template classes than parameter lists, we have
23185 something like:
23187 template <class T> void S<T>::R<T>::f (); */
23189 {
23199 else
23202 }
23203 /* Otherwise, there are too many template parameter lists. We have
23204 something like:
23206 template <class T> template <class U> void S::f(); */
23209 }
23211 /* Parse an optional `::' token indicating that the following name is
23212 from the global namespace. If so, PARSER->SCOPE is set to the
23213 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23214 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23215 Returns the new value of PARSER->SCOPE, if the `::' token is
23216 present, and NULL_TREE otherwise. */
23218 static tree
23220 {
23223 /* Peek at the next token. */
23225 /* If we're looking at a `::' token then we're starting from the
23226 global namespace, not our current location. */
23228 {
23229 /* Consume the `::' token. */
23231 /* Set the SCOPE so that we know where to start the lookup. */
23237 }
23239 {
23243 }
23246 }
23248 /* Returns TRUE if the upcoming token sequence is the start of a
23249 constructor declarator. If FRIEND_P is true, the declarator is
23250 preceded by the `friend' specifier. */
23252 static bool
23254 {
23257 tree nested_name_specifier;
23260 /* The common case is that this is not a constructor declarator, so
23261 try to avoid doing lots of work if at all possible. It's not
23262 valid declare a constructor at function scope. */
23265 /* And only certain tokens can begin a constructor declarator. */
23273 /* Parse tentatively; we are going to roll back all of the tokens
23274 consumed here. */
23276 /* Assume that we are looking at a constructor declarator. */
23279 /* Look for the optional `::' operator. */
23282 /* Look for the nested-name-specifier. */
23283 nested_name_specifier
23294 /* Outside of a class-specifier, there must be a
23295 nested-name-specifier. */
23301 /* If we have a class scope, this is easy; DR 147 says that S::S always
23302 names the constructor, and no other qualified name could. */
23305 {
23315 }
23316 /* If we still think that this might be a constructor-declarator,
23317 look for a class-name. */
23319 {
23320 /* If we have:
23322 template <typename T> struct S {
23323 S();
23324 };
23326 we must recognize that the nested `S' names a class. */
23327 tree type_decl;
23331 none_type,
23335 /* If there was no class-name, then this is not a constructor.
23336 Otherwise, if we are in a class-specifier and we aren't
23337 handling a friend declaration, check that its type matches
23338 current_class_type (c++/38313). Note: error_mark_node
23339 is left alone for error recovery purposes. */
23341 && (outside_class_specifier_p
23346 /* If we're still considering a constructor, we have to see a `(',
23347 to begin the parameter-declaration-clause, followed by either a
23348 `)', an `...', or a decl-specifier. We need to check for a
23349 type-specifier to avoid being fooled into thinking that:
23351 S (f) (int);
23353 is a constructor. (It is actually a function named `f' that
23354 takes one parameter (of type `int') and returns a value of type
23355 `S'. */
23363 /* A parameter declaration begins with a decl-specifier,
23364 which is either the "attribute" keyword, a storage class
23365 specifier, or (usually) a type-specifier. */
23367 {
23368 tree type;
23372 /* Names appearing in the type-specifier should be looked up
23373 in the scope of the class. */
23376 else
23377 {
23380 {
23384 {
23387 }
23388 }
23390 }
23392 /* Inside the constructor parameter list, surrounding
23393 template-parameter-lists do not apply. */
23394 saved_num_template_parameter_lists
23398 /* Look for the type-specifier. */
23400 CP_PARSER_FLAGS_NONE,
23406 parser->num_template_parameter_lists
23409 /* Leave the scope of the class. */
23414 }
23415 }
23417 /* We did not really want to consume any tokens. */
23421 }
23423 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23424 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23425 they must be performed once we are in the scope of the function.
23427 Returns the function defined. */
23429 static tree
23430 cp_parser_function_definition_from_specifiers_and_declarator
23433 tree attributes,
23435 {
23436 tree fn;
23439 /* Begin the function-definition. */
23442 /* The things we're about to see are not directly qualified by any
23443 template headers we've seen thus far. */
23446 /* If there were names looked up in the decl-specifier-seq that we
23447 did not check, check them now. We must wait until we are in the
23448 scope of the function to perform the checks, since the function
23449 might be a friend. */
23453 {
23456 }
23459 {
23460 /* Skip the entire function. */
23463 }
23465 {
23466 /* Seen already, skip it. An error message has already been output. */
23470 /* If this is a function from a class, pop the nested class. */
23473 }
23474 else
23475 {
23476 timevar_id_t tv;
23479 else
23485 }
23488 }
23490 /* Parse the part of a function-definition that follows the
23491 declarator. INLINE_P is TRUE iff this function is an inline
23492 function defined within a class-specifier.
23494 Returns the function defined. */
23496 static tree
23499 {
23500 tree fn;
23506 bool fully_implicit_function_template_p
23509 tree implicit_template_parms
23512 cp_binding_level* implicit_template_scope
23518 /* If the next token is `return', then the code may be trying to
23519 make use of the "named return value" extension that G++ used to
23520 support. */
23523 {
23524 /* Consume the `return' keyword. */
23526 /* Look for the identifier that indicates what value is to be
23527 returned. */
23529 /* Issue an error message. */
23532 /* Skip tokens until we reach the start of the function body. */
23534 {
23541 }
23542 }
23543 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23544 anything declared inside `f'. */
23545 saved_in_unbraced_linkage_specification_p
23548 /* Inside the function, surrounding template-parameter-lists do not
23549 apply. */
23550 saved_num_template_parameter_lists
23556 /* If the next token is `try', `__transaction_atomic', or
23557 `__transaction_relaxed`, then we are looking at either function-try-block
23558 or function-transaction-block. Note that all of these include the
23559 function-body. */
23562 RID_TRANSACTION_ATOMIC);
23564 RID_TRANSACTION_RELAXED))
23566 RID_TRANSACTION_RELAXED);
23569 else
23570 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23575 /* Finish the function. */
23578 /* Generate code for it, if necessary. */
23580 /* Restore the saved values. */
23581 parser->in_unbraced_linkage_specification_p
23583 parser->num_template_parameter_lists
23587 parser->fully_implicit_function_template_p
23589 parser->implicit_template_parms
23591 parser->implicit_template_scope
23598 }
23600 /* Parse a template-declaration, assuming that the `export' (and
23601 `extern') keywords, if present, has already been scanned. MEMBER_P
23602 is as for cp_parser_template_declaration. */
23604 static void
23606 {
23609 tree parameter_list;
23614 /* Look for the `template' keyword. */
23619 /* And the `<'. */
23623 {
23624 /* 14.5.2.2 [temp.mem]
23626 A local class shall not have member templates. */
23631 }
23632 /* [temp]
23634 A template ... shall not have C linkage. */
23636 {
23638 /* Give it C++ linkage to avoid confusing other parts of the
23639 front end. */
23642 }
23643 else
23646 /* We cannot perform access checks on the template parameter
23647 declarations until we know what is being declared, just as we
23648 cannot check the decl-specifier list. */
23651 /* If the next token is `>', then we have an invalid
23652 specialization. Rather than complain about an invalid template
23653 parameter, issue an error message here. */
23655 {
23659 }
23660 else
23661 {
23662 /* Parse the template parameters. */
23664 }
23666 /* Get the deferred access checks from the parameter list. These
23667 will be checked once we know what is being declared, as for a
23668 member template the checks must be performed in the scope of the
23669 class containing the member. */
23672 /* Look for the `>'. */
23674 /* We just processed one more parameter list. */
23676 /* If the next token is `template', there are more template
23677 parameters. */
23679 RID_TEMPLATE))
23684 else
23685 {
23686 /* There are no access checks when parsing a template, as we do not
23687 know if a specialization will be a friend. */
23691 checks,
23692 member_p,
23697 /* If this is a member template declaration, let the front
23698 end know. */
23700 {
23705 }
23710 }
23711 /* We are done with the current parameter list. */
23716 /* Finish up. */
23719 /* Check the template arguments for a literal operator template. */
23723 {
23727 else
23728 {
23731 {
23737 }
23739 {
23747 }
23748 else
23750 }
23752 {
23755 " Expected non-type template argument pack <char...>"
23757 decl);
23758 else
23761 decl);
23762 }
23763 }
23764 /* Register member declarations. */
23767 /* For the erroneous case of a template with C linkage, we pushed an
23768 implicit C++ linkage scope; exit that scope now. */
23771 /* If DECL is a function template, we must return to parse it later.
23772 (Even though there is no definition, there might be default
23773 arguments that need handling.) */
23777 }
23779 /* Perform the deferred access checks from a template-parameter-list.
23780 CHECKS is a TREE_LIST of access checks, as returned by
23781 get_deferred_access_checks. */
23783 static void
23784 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23785 {
23789 }
23791 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23792 `function-definition' sequence that follows a template header.
23793 If MEMBER_P is true, this declaration appears in a class scope.
23795 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23796 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23798 static tree
23804 {
23807 cp_decl_specifier_seq decl_specifiers;
23811 /* This function is only used when processing a template
23812 declaration. */
23816 /* Defer access checks until we know what is being declared. */
23819 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23820 alternative. */
23823 CP_PARSER_FLAGS_OPTIONAL,
23829 /* There are no template typedefs. */
23831 {
23835 }
23837 /* Gather up the access checks that occurred the
23838 decl-specifier-seq. */
23841 /* Check for the declaration of a template class. */
23843 {
23845 {
23848 /* In this case:
23850 struct C {
23851 friend template <typename T> struct A<T>::B;
23852 };
23854 A<T>::B will be represented by a TYPENAME_TYPE, and
23855 therefore not recognized by shadow_tag. */
23857 && !decl
23864 else
23867 /* Perform access checks for template parameters. */
23869 }
23870 }
23872 /* Complain about missing 'typename' or other invalid type names. */
23875 {
23876 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23877 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23878 the rest of this declaration. */
23881 }
23883 /* If it's not a template class, try for a template function. If
23884 the next token is a `;', then this declaration does not declare
23885 anything. But, if there were errors in the decl-specifiers, then
23886 the error might well have come from an attempted class-specifier.
23887 In that case, there's no need to warn about a missing declarator. */
23891 {
23894 checks,
23896 member_p,
23897 declares_class_or_enum,
23901 /* 7.1.1-1 [dcl.stc]
23903 A storage-class-specifier shall not be specified in an explicit
23904 specialization... */
23906 && explicit_specialization_p
23908 {
23912 }
23916 }
23918 /* Look for a trailing `;' after the declaration. */
23924 out:
23927 /* Clear any current qualification; whatever comes next is the start
23928 of something new. */
23934 }
23936 /* Parse a cast-expression that is not the operand of a unary "&". */
23938 static tree
23940 {
23943 }
23945 /* Parse a functional cast to TYPE. Returns an expression
23946 representing the cast. */
23948 static tree
23950 {
23952 tree expression_list;
23953 tree cast;
23960 {
23968 tf_warning_or_error);
23969 }
23978 else
23979 {
23982 }
23985 tf_warning_or_error);
23986 /* [expr.const]/1: In an integral constant expression "only type
23987 conversions to integral or enumeration type can be used". */
23993 NIC_CONSTRUCTOR))
23996 }
23998 /* Save the tokens that make up the body of a member function defined
23999 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
24000 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
24001 specifiers applied to the declaration. Returns the FUNCTION_DECL
24002 for the member function. */
24004 static tree
24008 tree attributes)
24009 {
24012 tree fn;
24014 /* Create the FUNCTION_DECL. */
24017 /* If something went badly wrong, bail out now. */
24019 {
24020 /* If there's a function-body, skip it. */
24025 }
24027 /* Remember it, if there default args to post process. */
24030 /* Save away the tokens that make up the body of the
24031 function. */
24033 /* Handle function try blocks. */
24036 /* We can have braced-init-list mem-initializers before the fn body. */
24038 {
24041 {
24042 /* cache_group will stop after an un-nested { } pair, too. */
24046 /* variadic mem-inits have ... after the ')'. */
24049 }
24050 }
24052 /* Handle function try blocks. */
24057 /* Save away the inline definition; we will process it when the
24058 class is complete. */
24062 /* We need to know that this was defined in the class, so that
24063 friend templates are handled correctly. */
24066 /* Add FN to the queue of functions to be parsed later. */
24070 }
24072 /* Save the tokens that make up the in-class initializer for a non-static
24073 data member. Returns a DEFAULT_ARG. */
24075 static tree
24077 {
24079 }
24081 /* Parse a template-argument-list, as well as the trailing ">" (but
24082 not the opening "<"). See cp_parser_template_argument_list for the
24083 return value. */
24085 static tree
24087 {
24088 tree arguments;
24089 tree saved_scope;
24090 tree saved_qualifying_scope;
24091 tree saved_object_scope;
24096 /* [temp.names]
24098 When parsing a template-id, the first non-nested `>' is taken as
24099 the end of the template-argument-list rather than a greater-than
24100 operator. */
24101 saved_greater_than_is_operator_p
24104 /* Parsing the argument list may modify SCOPE, so we save it
24105 here. */
24109 /* We need to evaluate the template arguments, even though this
24110 template-id may be nested within a "sizeof". */
24115 /* Parse the template-argument-list itself. */
24119 else
24121 /* Look for the `>' that ends the template-argument-list. If we find
24122 a '>>' instead, it's probably just a typo. */
24124 {
24126 {
24127 /* In C++0x, a `>>' in a template argument list or cast
24128 expression is considered to be two separate `>'
24129 tokens. So, change the current token to a `>', but don't
24130 consume it: it will be consumed later when the outer
24131 template argument list (or cast expression) is parsed.
24132 Note that this replacement of `>' for `>>' is necessary
24133 even if we are parsing tentatively: in the tentative
24134 case, after calling
24135 cp_parser_enclosed_template_argument_list we will always
24136 throw away all of the template arguments and the first
24137 closing `>', either because the template argument list
24138 was erroneous or because we are replacing those tokens
24139 with a CPP_TEMPLATE_ID token. The second `>' (which will
24140 not have been thrown away) is needed either to close an
24141 outer template argument list or to complete a new-style
24142 cast. */
24145 }
24147 {
24148 /* If we're in a nested template argument list, the '>>' has
24149 to be a typo for '> >'. We emit the error message, but we
24150 continue parsing and we push a '>' as next token, so that
24151 the argument list will be parsed correctly. Note that the
24152 global source location is still on the token before the
24153 '>>', so we need to say explicitly where we want it. */
24159 }
24160 else
24161 {
24162 /* If this is not a nested template argument list, the '>>'
24163 is a typo for '>'. Emit an error message and continue.
24164 Same deal about the token location, but here we can get it
24165 right by consuming the '>>' before issuing the diagnostic. */
24168 "spurious %<>>%>, use %<>%> to terminate "
24170 }
24171 }
24172 else
24174 /* The `>' token might be a greater-than operator again now. */
24175 parser->greater_than_is_operator_p
24177 /* Restore the SAVED_SCOPE. */
24185 }
24187 /* MEMBER_FUNCTION is a member function, or a friend. If default
24188 arguments, or the body of the function have not yet been parsed,
24189 parse them now. */
24191 static void
24193 {
24195 /* If this member is a template, get the underlying
24196 FUNCTION_DECL. */
24200 /* There should not be any class definitions in progress at this
24201 point; the bodies of members are only parsed outside of all class
24202 definitions. */
24204 /* While we're parsing the member functions we might encounter more
24205 classes. We want to handle them right away, but we don't want
24206 them getting mixed up with functions that are currently in the
24207 queue. */
24210 /* Make sure that any template parameters are in scope. */
24213 /* If the body of the function has not yet been parsed, parse it
24214 now. */
24216 {
24217 tree function_scope;
24220 /* The function is no longer pending; we are processing it. */
24225 /* If this is a local class, enter the scope of the containing
24226 function. */
24231 /* Push the body of the function onto the lexer stack. */
24234 /* Let the front end know that we going to be defining this
24235 function. */
24239 /* Don't do access checking if it is a templated function. */
24243 /* #pragma omp declare reduction needs special parsing. */
24245 {
24250 }
24251 else
24252 /* Now, parse the body of the function. */
24259 /* Leave the scope of the containing function. */
24263 }
24265 /* Remove any template parameters from the symbol table. */
24268 /* Restore the queue. */
24271 }
24273 /* If DECL contains any default args, remember it on the unparsed
24274 functions queue. */
24276 static void
24278 {
24279 tree probe;
24282 probe;
24285 {
24289 }
24290 }
24292 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24293 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24294 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24295 from the parameter-type-list. */
24297 static tree
24300 {
24302 tree parsed_arg;
24308 /* Push the saved tokens for the default argument onto the parser's
24309 lexer stack. */
24315 /* Parse the default argument. */
24326 {
24327 /* In a non-template class, check conversions now. In a template,
24328 we'll wait and instantiate these as needed. */
24331 tf_warning_or_error);
24332 else
24334 }
24336 /* If the token stream has not been completely used up, then
24337 there was extra junk after the end of the default
24338 argument. */
24340 {
24343 else
24345 }
24347 /* Revert to the main lexer. */
24351 }
24353 /* FIELD is a non-static data member with an initializer which we saved for
24354 later; parse it now. */
24356 static void
24358 {
24359 tree def;
24366 NULL_TREE);
24372 }
24374 /* FN is a FUNCTION_DECL which may contains a parameter with an
24375 unparsed DEFAULT_ARG. Parse the default args now. This function
24376 assumes that the current scope is the scope in which the default
24377 argument should be processed. */
24379 static void
24381 {
24385 /* While we're parsing the default args, we might (due to the
24386 statement expression extension) encounter more classes. We want
24387 to handle them right away, but we don't want them getting mixed
24388 up with default args that are currently in the queue. */
24391 /* Local variable names (and the `this' keyword) may not appear
24392 in a default argument. */
24403 {
24405 tree parsed_arg;
24407 tree copy;
24414 /* This can happen for a friend declaration for a function
24415 already declared with default arguments. */
24418 parsed_arg
24420 default_arg,
24423 {
24425 }
24429 /* Update any instantiations we've already created. */
24433 }
24437 /* Make sure no default arg is missing. */
24440 /* Restore the state of local_variables_forbidden_p. */
24443 /* Restore the queue. */
24445 }
24447 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24449 sizeof ... ( identifier )
24451 where the 'sizeof' token has already been consumed. */
24453 static tree
24455 {
24456 /* Consume the `...'. */
24463 else
24471 /* The name is not qualified. */
24489 }
24491 /* Parse the operand of `sizeof' (or a similar operator). Returns
24492 either a TYPE or an expression, depending on the form of the
24493 input. The KEYWORD indicates which kind of expression we have
24494 encountered. */
24496 static tree
24498 {
24505 /* If it's a `...', then we are computing the length of a parameter
24506 pack. */
24511 /* Types cannot be defined in a `sizeof' expression. Save away the
24512 old message. */
24514 /* And create the new one. */
24520 /* The restrictions on constant-expressions do not apply inside
24521 sizeof expressions. */
24522 saved_integral_constant_expression_p
24524 saved_non_integral_constant_expression_p
24528 /* Do not actually evaluate the expression. */
24531 /* If it's a `(', then we might be looking at the type-id
24532 construction. */
24534 {
24537 /* We can't be sure yet whether we're looking at a type-id or an
24538 expression. */
24540 /* Note: as a GNU Extension, compound literals are considered
24541 postfix-expressions as they are in C99, so they are valid
24542 arguments to sizeof. See comment in cp_parser_cast_expression
24543 for details. */
24546 else
24547 {
24550 /* Look for the type-id. */
24552 /* Look for the closing `)'. */
24555 }
24557 /* If all went well, then we're done. */
24559 {
24560 cp_decl_specifier_seq decl_specs;
24562 /* Build a trivial decl-specifier-seq. */
24566 /* Call grokdeclarator to figure out what type this is. */
24569 TYPENAME,
24572 }
24573 }
24575 /* If the type-id production did not work out, then we must be
24576 looking at the unary-expression production. */
24580 /* Go back to evaluating expressions. */
24584 /* Free the message we created. */
24586 /* And restore the old one. */
24588 parser->integral_constant_expression_p
24590 parser->non_integral_constant_expression_p
24594 }
24596 /* If the current declaration has no declarator, return true. */
24598 static bool
24600 {
24601 /* If the next token is a `;' or a `,' then there is no
24602 declarator. */
24605 }
24607 /* Update the DECL_SPECS to reflect the storage class indicated by
24608 KEYWORD. */
24610 static void
24615 {
24616 cp_storage_class storage_class;
24619 {
24623 }
24625 {
24628 }
24633 {
24636 }
24639 {
24657 }
24661 /* A storage class specifier cannot be applied alongside a typedef
24662 specifier. If there is a typedef specifier present then set
24663 conflicting_specifiers_p which will trigger an error later
24664 on in grokdeclarator. */
24667 }
24669 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24670 is true, the type is a class or enum definition. */
24672 static void
24674 tree type_spec,
24677 {
24680 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24681 (with, for example, in "typedef int wchar_t;") we remember that
24682 this is what happened. In system headers, we ignore these
24683 declarations so that G++ can work with system headers that are not
24684 C++-safe. */
24686 && !type_definition_p
24696 {
24699 ds_redefined_builtin_type_spec,
24700 token);
24702 {
24706 }
24707 }
24710 else
24711 {
24716 }
24717 }
24719 /* True iff TOKEN is the GNU keyword __thread. */
24721 static bool
24723 {
24726 }
24728 /* Set the location for a declarator specifier and check if it is
24729 duplicated.
24731 DECL_SPECS is the sequence of declarator specifiers onto which to
24732 set the location.
24734 DS is the single declarator specifier to set which location is to
24735 be set onto the existing sequence of declarators.
24737 LOCATION is the location for the declarator specifier to
24738 consider. */
24740 static void
24743 {
24752 {
24756 }
24757 else
24758 {
24760 {
24764 else
24765 {
24768 OPT_Wlong_long,
24770 }
24771 }
24773 {
24778 else
24780 }
24781 else
24782 {
24798 "__complex"
24799 };
24802 }
24803 }
24804 }
24806 /* Return true iff the declarator specifier DS is present in the
24807 sequence of declarator specifiers DECL_SPECS. */
24809 bool
24811 cp_decl_spec ds)
24812 {
24819 }
24821 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24822 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24824 static bool
24826 {
24828 }
24830 /* Issue an error message indicating that TOKEN_DESC was expected.
24831 If KEYWORD is true, it indicated this function is called by
24832 cp_parser_require_keword and the required token can only be
24833 a indicated keyword. */
24835 static void
24837 required_token token_desc,
24839 {
24841 {
24910 }
24912 {
24914 {
24993 }
24994 }
24995 else
24997 }
25001 /* If the next token is of the indicated TYPE, consume it. Otherwise,
25002 issue an error message indicating that TOKEN_DESC was expected.
25004 Returns the token consumed, if the token had the appropriate type.
25005 Otherwise, returns NULL. */
25010 required_token token_desc)
25011 {
25014 else
25015 {
25016 /* Output the MESSAGE -- unless we're parsing tentatively. */
25020 }
25021 }
25023 /* An error message is produced if the next token is not '>'.
25024 All further tokens are skipped until the desired token is
25025 found or '{', '}', ';' or an unbalanced ')' or ']'. */
25027 static void
25029 {
25030 /* Current level of '< ... >'. */
25032 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
25035 /* Are we ready, yet? If not, issue error message. */
25039 /* Skip tokens until the desired token is found. */
25041 {
25042 /* Peek at the next token. */
25044 {
25052 /* C++0x views the `>>' operator as two `>' tokens, but
25053 C++98 does not. */
25056 {
25057 /* We've hit a `>>' where the first `>' closes the
25058 template argument list, and the second `>' is
25059 spurious. Just consume the `>>' and stop; we've
25060 already produced at least one error. */
25063 }
25064 /* Fall through for C++0x, so we handle the second `>' in
25065 the `>>'. */
25069 {
25070 /* We've reached the token we want, consume it and stop. */
25073 }
25092 /* The '>' was probably forgotten, don't look further. */
25097 }
25099 /* Consume this token. */
25101 }
25102 }
25104 /* If the next token is the indicated keyword, consume it. Otherwise,
25105 issue an error message indicating that TOKEN_DESC was expected.
25107 Returns the token consumed, if the token had the appropriate type.
25108 Otherwise, returns NULL. */
25113 required_token token_desc)
25114 {
25118 {
25121 }
25124 }
25126 /* Returns TRUE iff TOKEN is a token that can begin the body of a
25127 function-definition. */
25129 static bool
25131 {
25134 /* A ctor-initializer begins with a `:'. */
25136 /* A function-try-block begins with `try'. */
25138 /* A function-transaction-block begins with `__transaction_atomic'
25139 or `__transaction_relaxed'. */
25142 /* The named return value extension begins with `return'. */
25144 }
25146 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25147 definition. */
25149 static bool
25151 {
25158 }
25160 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25161 C++0x) ending a template-argument. */
25163 static bool
25165 {
25173 }
25175 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25176 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25178 static bool
25181 {
25187 /* Check for the sequence `<::' in the original code. It would be lexed as
25188 `[:', where `[' is a digraph, and there is no whitespace before
25189 `:'. */
25191 {
25196 }
25198 }
25200 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25201 or none_type otherwise. */
25203 static enum tag_types
25205 {
25207 {
25217 }
25218 }
25220 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25221 or none_type otherwise or if the token is null. */
25223 static enum tag_types
25225 {
25230 {
25238 }
25239 }
25241 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25243 static void
25245 {
25249 {
25253 type))
25256 }
25257 }
25259 /* Issue an error message if DECL is redeclared with different
25260 access than its original declaration [class.access.spec/3].
25261 This applies to nested classes and nested class templates.
25262 [class.mem/1]. */
25264 static void
25266 {
25275 }
25277 /* Look for the `template' keyword, as a syntactic disambiguator.
25278 Return TRUE iff it is present, in which case it will be
25279 consumed. */
25281 static bool
25283 {
25285 {
25286 /* In C++98 the `template' keyword can only be used within templates;
25287 outside templates the parser can always figure out what is a
25288 template and what is not. In C++11, per the resolution of DR 468,
25289 `template' is allowed in cases where it is not strictly necessary. */
25292 {
25295 "in C++98 %<template%> (as a disambiguator) is only "
25297 /* If this part of the token stream is rescanned, the same
25298 error message would be generated. So, we purge the token
25299 from the stream. */
25302 }
25303 else
25304 {
25305 /* Consume the `template' keyword. */
25308 }
25309 }
25311 }
25313 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25314 set PARSER->SCOPE, and perform other related actions. */
25316 static void
25318 {
25324 /* Get the stored value. */
25326 /* Perform any access checks that were deferred. */
25329 {
25334 }
25335 /* Set the scope from the stored value. */
25339 }
25341 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25342 encounter the end of a block before what we were looking for. */
25344 static bool
25348 {
25350 {
25353 /* Abort a parenthesized expression if we encounter a semicolon. */
25357 /* If we've reached the end of the file, stop. */
25363 /* We've hit the end of an enclosing block, so there's been some
25364 kind of syntax error. */
25367 /* Consume the token. */
25369 /* See if it starts a new group. */
25371 {
25373 /* In theory this should probably check end == '}', but
25374 cp_parser_save_member_function_body needs it to exit
25375 after either '}' or ')' when called with ')'. */
25378 }
25380 {
25384 }
25389 }
25390 }
25392 /* Like above, for caching a default argument or NSDMI. Both of these are
25393 terminated by a non-nested comma, but it can be unclear whether or not a
25394 comma is nested in a template argument list unless we do more parsing.
25395 In order to handle this ambiguity, when we encounter a ',' after a '<'
25396 we try to parse what follows as a parameter-declaration-list (in the
25397 case of a default argument) or a member-declarator (in the case of an
25398 NSDMI). If that succeeds, then we stop caching. */
25400 static tree
25402 {
25407 tree default_argument;
25409 /* Add tokens until we have processed the entire default
25410 argument. We add the range [first_token, token). */
25413 {
25414 /* For list-initialization, this is straightforward. */
25417 }
25419 {
25422 /* Peek at the next token. */
25424 /* What we do depends on what token we have. */
25426 {
25427 /* In valid code, a default argument must be
25428 immediately followed by a `,' `)', or `...'. */
25431 {
25432 /* If we've seen a '<', we might be in a
25433 template-argument-list. Until Core issue 325 is
25434 resolved, we don't know how this situation ought
25435 to be handled, so try to DTRT. We check whether
25436 what comes after the comma is a valid parameter
25437 declaration list. If it is, then the comma ends
25438 the default argument; otherwise the default
25439 argument continues. */
25443 /* Set ITALP so cp_parser_parameter_declaration_list
25444 doesn't decide to commit to this parse. */
25451 {
25452 /* Parse declarators until we reach a non-comma or
25453 somthing that cannot be an initializer.
25454 Just checking whether we're looking at a single
25455 declarator is insufficient. Consider:
25456 int var = tuple<T,U>::x;
25457 The template parameter 'U' looks exactly like a
25458 declarator. */
25459 do
25460 {
25471 }
25473 /* If we met an '=' or ';' then the original comma
25474 was the end of the NSDMI. Otherwise assume
25475 we're still in the NSDMI. */
25478 }
25479 else
25480 {
25485 }
25492 }
25495 /* If we run into a non-nested `;', `}', or `]',
25496 then the code is invalid -- but the default
25497 argument is certainly over. */
25502 /* Handle correctly int n = sizeof ... ( p ); */
25505 /* Update DEPTH, if necessary. */
25520 /* This might be the comparison operator, or it might
25521 start a template argument list. */
25528 /* Fall through for C++0x, which treats the `>>'
25529 operator like two `>' tokens in certain
25530 cases. */
25534 {
25535 /* This might be an operator, or it might close a
25536 template argument list. But if a previous '<'
25537 started a template argument list, this will have
25538 closed it, so we can't be in one anymore. */
25542 }
25545 /* If we run out of tokens, issue an error message. */
25554 /* In these cases, we should look for template-ids.
25555 For example, if the default argument is
25556 `X<int, double>()', we need to do name lookup to
25557 figure out whether or not `X' is a template; if
25558 so, the `,' does not end the default argument.
25560 That is not yet done. */
25565 }
25567 /* If we've reached the end, stop. */
25571 /* Add the token to the token block. */
25573 }
25575 /* Create a DEFAULT_ARG to represent the unparsed default
25576 argument. */
25583 }
25585 /* Begin parsing tentatively. We always save tokens while parsing
25586 tentatively so that if the tentative parsing fails we can restore the
25587 tokens. */
25589 static void
25591 {
25592 /* Enter a new parsing context. */
25594 /* Begin saving tokens. */
25596 /* In order to avoid repetitive access control error messages,
25597 access checks are queued up until we are no longer parsing
25598 tentatively. */
25600 }
25602 /* Commit to the currently active tentative parse. */
25604 static void
25606 {
25610 /* Mark all of the levels as committed. */
25613 {
25620 }
25621 }
25623 /* Commit to the topmost currently active tentative parse.
25625 Note that this function shouldn't be called when there are
25626 irreversible side-effects while in a tentative state. For
25627 example, we shouldn't create a permanent entry in the symbol
25628 table, or issue an error message that might not apply if the
25629 tentative parse is aborted. */
25631 static void
25633 {
25638 {
25646 }
25647 }
25649 /* Abort the currently active tentative parse. All consumed tokens
25650 will be rolled back, and no diagnostics will be issued. */
25652 static void
25654 {
25658 /* Now, pretend that we want to see if the construct was
25659 successfully parsed. */
25661 }
25663 /* Stop parsing tentatively. If a parse error has occurred, restore the
25664 token stream. Otherwise, commit to the tokens we have consumed.
25665 Returns true if no error occurred; false otherwise. */
25667 static bool
25669 {
25673 /* Remember whether or not an error occurred, since we are about to
25674 destroy that information. */
25676 /* Remove the topmost context from the stack. */
25679 /* If no parse errors occurred, commit to the tentative parse. */
25681 {
25682 /* Commit to the tokens read tentatively, unless that was
25683 already done. */
25688 }
25689 /* Otherwise, if errors occurred, roll back our state so that things
25690 are just as they were before we began the tentative parse. */
25691 else
25692 {
25695 }
25696 /* Add the context to the front of the free list. */
25701 }
25703 /* Returns true if we are parsing tentatively and are not committed to
25704 this tentative parse. */
25706 static bool
25708 {
25711 }
25713 /* Returns nonzero iff an error has occurred during the most recent
25714 tentative parse. */
25716 static bool
25718 {
25721 }
25723 /* Returns nonzero if GNU extensions are allowed. */
25725 static bool
25727 {
25729 }
25730 \f
25731 /* Objective-C++ Productions */
25734 /* Parse an Objective-C expression, which feeds into a primary-expression
25735 above.
25737 objc-expression:
25738 objc-message-expression
25739 objc-string-literal
25740 objc-encode-expression
25741 objc-protocol-expression
25742 objc-selector-expression
25744 Returns a tree representation of the expression. */
25746 static tree
25748 {
25749 /* Try to figure out what kind of declaration is present. */
25753 {
25763 {
25775 }
25781 }
25784 }
25786 /* Parse an Objective-C message expression.
25788 objc-message-expression:
25789 [ objc-message-receiver objc-message-args ]
25791 Returns a representation of an Objective-C message. */
25793 static tree
25795 {
25804 }
25806 /* Parse an objc-message-receiver.
25808 objc-message-receiver:
25809 expression
25810 simple-type-specifier
25812 Returns a representation of the type or expression. */
25814 static tree
25816 {
25817 tree rcv;
25819 /* An Objective-C message receiver may be either (1) a type
25820 or (2) an expression. */
25824 /* If that worked out, fine. */
25831 CP_PARSER_FLAGS_NONE);
25838 }
25840 /* Parse the arguments and selectors comprising an Objective-C message.
25842 objc-message-args:
25843 objc-selector
25844 objc-selector-args
25845 objc-selector-args , objc-comma-args
25847 objc-selector-args:
25848 objc-selector [opt] : assignment-expression
25849 objc-selector-args objc-selector [opt] : assignment-expression
25851 objc-comma-args:
25852 assignment-expression
25853 objc-comma-args , assignment-expression
25855 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25856 selector arguments and TREE_VALUE containing a list of comma
25857 arguments. */
25859 static tree
25861 {
25867 {
25873 /* Detect if we have a unary selector. */
25882 sel_args
25887 }
25889 /* Handle non-selector arguments, if any. */
25891 {
25892 tree arg;
25897 addl_args
25902 }
25905 {
25908 }
25911 }
25913 /* Parse an Objective-C encode expression.
25915 objc-encode-expression:
25916 @encode objc-typename
25918 Returns an encoded representation of the type argument. */
25920 static tree
25922 {
25923 tree type;
25933 {
25937 }
25939 /* This happens if we find @encode(T) (where T is a template
25940 typename or something dependent on a template typename) when
25941 parsing a template. In that case, we can't compile it
25942 immediately, but we rather create an AT_ENCODE_EXPR which will
25943 need to be instantiated when the template is used.
25944 */
25946 {
25950 }
25953 }
25955 /* Parse an Objective-C @defs expression. */
25957 static tree
25959 {
25960 tree name;
25968 }
25970 /* Parse an Objective-C protocol expression.
25972 objc-protocol-expression:
25973 @protocol ( identifier )
25975 Returns a representation of the protocol expression. */
25977 static tree
25979 {
25980 tree proto;
25988 }
25990 /* Parse an Objective-C selector expression.
25992 objc-selector-expression:
25993 @selector ( objc-method-signature )
25995 objc-method-signature:
25996 objc-selector
25997 objc-selector-seq
25999 objc-selector-seq:
26000 objc-selector :
26001 objc-selector-seq objc-selector :
26003 Returns a representation of the method selector. */
26005 static tree
26007 {
26019 {
26028 {
26029 /* Detect if we have a unary selector. */
26031 {
26034 }
26035 else
26036 {
26038 }
26039 }
26044 {
26045 sel_seq
26048 sel_seq
26051 }
26052 else
26053 sel_seq
26058 }
26060 finish_selector:
26064 }
26066 /* Parse a list of identifiers.
26068 objc-identifier-list:
26069 identifier
26070 objc-identifier-list , identifier
26072 Returns a TREE_LIST of identifier nodes. */
26074 static tree
26076 {
26077 tree identifier;
26078 tree list;
26089 {
26096 identifier));
26098 }
26101 }
26103 /* Parse an Objective-C alias declaration.
26105 objc-alias-declaration:
26106 @compatibility_alias identifier identifier ;
26108 This function registers the alias mapping with the Objective-C front end.
26109 It returns nothing. */
26111 static void
26113 {
26121 }
26123 /* Parse an Objective-C class forward-declaration.
26125 objc-class-declaration:
26126 @class objc-identifier-list ;
26128 The function registers the forward declarations with the Objective-C
26129 front end. It returns nothing. */
26131 static void
26133 {
26136 {
26137 tree id;
26147 else
26149 }
26151 }
26153 /* Parse a list of Objective-C protocol references.
26155 objc-protocol-refs-opt:
26156 objc-protocol-refs [opt]
26158 objc-protocol-refs:
26159 < objc-identifier-list >
26161 Returns a TREE_LIST of identifiers, if any. */
26163 static tree
26165 {
26169 {
26173 }
26176 }
26178 /* Parse a Objective-C visibility specification. */
26180 static void
26182 {
26186 {
26201 }
26203 /* Eat '@private'/'@protected'/'@public'. */
26205 }
26207 /* Parse an Objective-C method type. Return 'true' if it is a class
26208 (+) method, and 'false' if it is an instance (-) method. */
26212 {
26215 else
26217 }
26219 /* Parse an Objective-C protocol qualifier. */
26221 static tree
26223 {
26236 {
26241 }
26244 }
26246 /* Parse an Objective-C typename. */
26248 static tree
26250 {
26254 {
26260 /* An ObjC type name may consist of just protocol qualifiers, in which
26261 case the type shall default to 'id'. */
26263 {
26266 /* If the type could not be parsed, an error has already
26267 been produced. For error recovery, behave as if it had
26268 not been specified, which will use the default type
26269 'id'. */
26271 {
26273 /* We need to skip to the closing parenthesis as
26274 cp_parser_type_id() does not seem to do it for
26275 us. */
26280 }
26281 }
26285 }
26288 }
26290 /* Check to see if TYPE refers to an Objective-C selector name. */
26292 static bool
26294 {
26300 }
26302 /* Parse an Objective-C selector. */
26304 static tree
26306 {
26310 {
26313 }
26315 /* C++ operator names are allowed to appear in ObjC selectors. */
26317 {
26330 }
26331 }
26333 /* Parse an Objective-C params list. */
26335 static tree
26337 {
26343 {
26353 /* Detect if we have a unary selector. */
26356 {
26359 }
26363 {
26364 /* Something went quite wrong. There should be a colon
26365 here, but there is not. Stop parsing parameters. */
26367 }
26369 /* New ObjC allows attributes on parameters too. */
26374 params
26377 type_name,
26378 identifier,
26379 parm_attr));
26382 }
26385 {
26388 }
26390 /* We allow tail attributes for the method. */
26392 {
26400 }
26403 {
26406 }
26408 }
26410 /* Parse the non-keyword Objective-C params. */
26412 static tree
26415 {
26421 {
26423 tree parm;
26429 {
26434 }
26436 /* TODO: parse attributes for tail parameters. */
26445 }
26447 /* We allow tail attributes for the method. */
26449 {
26451 {
26456 }
26457 else
26458 /* We have an error, but parse the attributes, so that we can
26459 carry on. */
26465 }
26468 }
26470 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26472 static void
26474 {
26477 /* If the next token is `extern' and the following token is a string
26478 literal, then we have a linkage specification. */
26480 && cp_parser_is_pure_string_literal
26483 /* Handle #pragma, if any. */
26486 /* Allow stray semicolons. */
26489 /* Mark methods as optional or required, when building protocols. */
26491 {
26494 }
26496 {
26499 }
26502 /* Other stray characters must generate errors. */
26504 {
26508 }
26509 /* Finally, try to parse a block-declaration, or a function-definition. */
26510 else
26512 }
26514 /* Parse a method signature. */
26516 static tree
26518 {
26534 }
26536 static bool
26538 {
26539 tree tattr;
26544 /* If the attributes are followed by a method introducer, this is not allowed.
26545 Dump the attributes and flag the situation. */
26550 /* Otherwise, the attributes introduce some interstitial code, possibly so
26551 rewind to allow that check. */
26554 }
26556 /* Parse an Objective-C method prototype list. */
26558 static void
26560 {
26564 {
26566 {
26571 else
26575 {
26579 }
26582 }
26588 OPT_Wattributes,
26590 else
26591 /* Allow for interspersed non-ObjC++ code. */
26595 }
26599 else
26603 }
26605 /* Parse an Objective-C method definition list. */
26607 static void
26609 {
26613 {
26614 tree meth;
26617 {
26623 else
26628 {
26632 }
26634 NULL_TREE);
26636 /* For historical reasons, we accept an optional semicolon. */
26643 {
26650 }
26651 }
26652 /* The following case will be removed once @synthesize is
26653 completely implemented. */
26664 else
26665 /* Allow for interspersed non-ObjC++ code. */
26669 }
26673 else
26677 }
26679 /* Parse Objective-C ivars. */
26681 static void
26683 {
26694 {
26695 cp_decl_specifier_seq declspecs;
26697 tree prefix_attributes;
26705 CP_PARSER_FLAGS_OPTIONAL,
26709 /* auto, register, static, extern, mutable. */
26711 {
26714 }
26716 /* thread_local. */
26718 {
26721 }
26723 /* typedef. */
26725 {
26728 }
26733 /* Keep going until we hit the `;' at the end of the
26734 declaration. */
26736 {
26741 /* Check for a (possibly unnamed) bitfield declaration. */
26749 {
26750 /* Get the name of the bitfield. */
26753 sfk_none);
26755 eat_colon:
26757 /* Get the width of the bitfield. */
26758 width
26760 }
26761 else
26762 {
26763 /* Parse the declarator. */
26764 declarator
26770 }
26772 /* Look for attributes that apply to the ivar. */
26774 /* Remember which attributes are prefix attributes and
26775 which are not. */
26777 /* Combine the attributes. */
26781 /* Create the bitfield declaration. */
26783 width,
26784 attributes);
26785 else
26790 /* Add the instance variable. */
26794 /* Reset PREFIX_ATTRIBUTES. */
26803 {
26806 }
26808 }
26812 }
26817 /* Do not consume the RID_AT_END, so it will be read again as terminating
26818 the @interface of @implementation. */
26822 /* For historical reasons, we accept an optional semicolon. */
26825 }
26827 /* Parse an Objective-C protocol declaration. */
26829 static void
26831 {
26837 {
26842 }
26844 /* See if we have a forward declaration or a definition. */
26847 /* Try a forward declaration first. */
26849 {
26851 {
26852 tree id;
26862 else
26864 }
26866 }
26868 /* Ok, we got a full-fledged definition (or at least should). */
26869 else
26870 {
26875 }
26876 }
26878 /* Parse an Objective-C superclass or category. */
26880 static void
26885 {
26891 {
26894 }
26896 {
26899 /* If there is no category name, and this is an @interface, we
26900 have a class extension. */
26902 {
26905 }
26906 else
26910 }
26911 }
26913 /* Parse an Objective-C class interface. */
26915 static void
26917 {
26924 {
26925 /* It's hard to recover because even if valid @interface stuff
26926 is to follow, we can't compile it (or validate it) if we
26927 don't even know which class it refers to. Let's assume this
26928 was a stray '@interface' token in the stream and skip it.
26929 */
26931 }
26936 /* We have either a class or a category on our hands. */
26939 else
26940 {
26942 /* Handle instance variable declarations, if any. */
26945 }
26948 }
26950 /* Parse an Objective-C class implementation. */
26952 static void
26954 {
26961 {
26962 /* It's hard to recover because even if valid @implementation
26963 stuff is to follow, we can't compile it (or validate it) if
26964 we don't even know which class it refers to. Let's assume
26965 this was a stray '@implementation' token in the stream and
26966 skip it.
26967 */
26969 }
26973 /* We have either a class or a category on our hands. */
26976 else
26977 {
26979 /* Handle instance variable declarations, if any. */
26982 }
26985 }
26987 /* Consume the @end token and finish off the implementation. */
26989 static void
26991 {
26994 }
26996 /* Parse an Objective-C declaration. */
26998 static void
27000 {
27001 /* Try to figure out what kind of declaration is present. */
27006 {
27022 }
27025 {
27048 }
27049 }
27051 /* Parse an Objective-C try-catch-finally statement.
27053 objc-try-catch-finally-stmt:
27054 @try compound-statement objc-catch-clause-seq [opt]
27055 objc-finally-clause [opt]
27057 objc-catch-clause-seq:
27058 objc-catch-clause objc-catch-clause-seq [opt]
27060 objc-catch-clause:
27061 @catch ( objc-exception-declaration ) compound-statement
27063 objc-finally-clause:
27064 @finally compound-statement
27066 objc-exception-declaration:
27067 parameter-declaration
27068 '...'
27070 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
27072 Returns NULL_TREE.
27074 PS: This function is identical to c_parser_objc_try_catch_finally_statement
27075 for C. Keep them in sync. */
27077 static tree
27079 {
27080 location_t location;
27081 tree stmt;
27086 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
27087 node, lest it get absorbed into the surrounding block. */
27093 {
27102 {
27103 /* We have "@catch (...)" (where the '...' are literally
27104 what is in the code). Skip the '...'.
27105 parameter_declaration is set to NULL_TREE, and
27106 objc_being_catch_clauses() knows that that means
27107 '...'. */
27110 }
27111 else
27112 {
27113 /* We have "@catch (NSException *exception)" or something
27114 like that. Parse the parameter declaration. */
27118 else
27123 }
27126 else
27127 {
27128 /* If there was no open parenthesis, we are recovering from
27129 an error, and we are trying to figure out what mistake
27130 the user has made. */
27132 /* If there is an immediate closing parenthesis, the user
27133 probably forgot the opening one (ie, they typed "@catch
27134 NSException *e)". Parse the closing parenthesis and keep
27135 going. */
27139 /* If these is no immediate closing parenthesis, the user
27140 probably doesn't know that parenthesis are required at
27141 all (ie, they typed "@catch NSException *e"). So, just
27142 forget about the closing parenthesis and keep going. */
27143 }
27147 }
27149 {
27152 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
27153 node, lest it get absorbed into the surrounding block. */
27157 }
27160 }
27162 /* Parse an Objective-C synchronized statement.
27164 objc-synchronized-stmt:
27165 @synchronized ( expression ) compound-statement
27167 Returns NULL_TREE. */
27169 static tree
27171 {
27172 location_t location;
27183 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27184 node, lest it get absorbed into the surrounding block. */
27189 }
27191 /* Parse an Objective-C throw statement.
27193 objc-throw-stmt:
27194 @throw assignment-expression [opt] ;
27196 Returns a constructed '@throw' statement. */
27198 static tree
27200 {
27212 }
27214 /* Parse an Objective-C statement. */
27216 static tree
27218 {
27219 /* Try to figure out what kind of declaration is present. */
27223 {
27234 }
27237 }
27239 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27240 look ahead to see if an objc keyword follows the attributes. This
27241 is to detect the use of prefix attributes on ObjC @interface and
27242 @protocol. */
27244 static bool
27246 {
27251 {
27254 }
27257 }
27259 /* This routine is a minimal replacement for
27260 c_parser_struct_declaration () used when parsing the list of
27261 types/names or ObjC++ properties. For example, when parsing the
27262 code
27264 @property (readonly) int a, b, c;
27266 this function is responsible for parsing "int a, int b, int c" and
27267 returning the declarations as CHAIN of DECLs.
27269 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27270 similar parsing. */
27271 static tree
27273 {
27275 cp_decl_specifier_seq declspecs;
27277 tree prefix_attributes;
27280 CP_PARSER_FLAGS_NONE,
27287 /* auto, register, static, extern, mutable. */
27289 {
27292 }
27294 /* thread_local. */
27296 {
27299 }
27301 /* typedef. */
27303 {
27306 }
27311 /* Keep going until we hit the `;' at the end of the declaration. */
27313 {
27318 /* Parse the declarator. */
27322 /* Look for attributes that apply to the ivar. */
27324 /* Remember which attributes are prefix attributes and
27325 which are not. */
27327 /* Combine the attributes. */
27337 /* Reset PREFIX_ATTRIBUTES. */
27348 {
27351 }
27352 else
27354 }
27356 }
27358 /* Parse an Objective-C @property declaration. The syntax is:
27360 objc-property-declaration:
27361 '@property' objc-property-attributes[opt] struct-declaration ;
27363 objc-property-attributes:
27364 '(' objc-property-attribute-list ')'
27366 objc-property-attribute-list:
27367 objc-property-attribute
27368 objc-property-attribute-list, objc-property-attribute
27370 objc-property-attribute
27371 'getter' = identifier
27372 'setter' = identifier
27373 'readonly'
27374 'readwrite'
27375 'assign'
27376 'retain'
27377 'copy'
27378 'nonatomic'
27380 For example:
27381 @property NSString *name;
27382 @property (readonly) id object;
27383 @property (retain, nonatomic, getter=getTheName) id name;
27384 @property int a, b, c;
27386 PS: This function is identical to
27387 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27388 static void
27390 {
27391 /* The following variables hold the attributes of the properties as
27392 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27393 seen. When we see an attribute, we set them to 'true' (if they
27394 are boolean properties) or to the identifier (if they have an
27395 argument, ie, for getter and setter). Note that here we only
27396 parse the list of attributes, check the syntax and accumulate the
27397 attributes that we find. objc_add_property_declaration() will
27398 then process the information. */
27408 /* 'properties' is the list of properties that we read. Usually a
27409 single one, but maybe more (eg, in "@property int a, b, c;" there
27410 are three). */
27411 tree properties;
27412 location_t loc;
27418 /* Parse the optional attribute list... */
27420 {
27421 /* Eat the '('. */
27425 {
27431 {
27434 }
27438 {
27449 {
27453 else
27458 }
27461 {
27465 }
27467 {
27469 {
27472 }
27473 else
27477 else
27479 }
27480 else
27481 {
27483 {
27486 }
27487 else
27489 }
27495 }
27502 else
27504 }
27506 /* FIXME: "@property (setter, assign);" will generate a spurious
27507 "error: expected ‘)’ before ‘,’ token". This is because
27508 cp_parser_require, unlike the C counterpart, will produce an
27509 error even if we are in error recovery. */
27511 {
27516 }
27517 }
27519 /* ... and the property declaration(s). */
27523 {
27525 /* If the next token is now a `;', consume it. */
27529 }
27533 else
27534 {
27535 /* Comma-separated properties are chained together in
27536 reverse order; add them one by one. */
27545 }
27548 }
27550 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27552 objc-synthesize-declaration:
27553 @synthesize objc-synthesize-identifier-list ;
27555 objc-synthesize-identifier-list:
27556 objc-synthesize-identifier
27557 objc-synthesize-identifier-list, objc-synthesize-identifier
27559 objc-synthesize-identifier
27560 identifier
27561 identifier = identifier
27563 For example:
27564 @synthesize MyProperty;
27565 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27567 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27568 for C. Keep them in sync.
27569 */
27570 static void
27572 {
27574 location_t loc;
27579 {
27583 {
27586 }
27588 {
27592 {
27595 }
27596 }
27597 else
27602 else
27604 }
27607 }
27609 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27611 objc-dynamic-declaration:
27612 @dynamic identifier-list ;
27614 For example:
27615 @dynamic MyProperty;
27616 @dynamic MyProperty, AnotherProperty;
27618 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27619 for C. Keep them in sync.
27620 */
27621 static void
27623 {
27625 location_t loc;
27630 {
27631 tree property;
27634 {
27637 }
27641 else
27643 }
27646 }
27648 \f
27649 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27651 /* Returns name of the next clause.
27652 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27653 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27654 returned and the token is consumed. */
27656 static pragma_omp_clause
27658 {
27672 {
27677 {
27820 }
27821 }
27827 }
27829 /* Validate that a clause of the given type does not already exist. */
27831 static void
27834 {
27835 tree c;
27839 {
27842 }
27843 }
27845 /* OpenMP 2.5:
27846 variable-list:
27847 identifier
27848 variable-list , identifier
27850 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27851 colon). An opening parenthesis will have been consumed by the caller.
27853 If KIND is nonzero, create the appropriate node and install the decl
27854 in OMP_CLAUSE_DECL and add the node to the head of the list.
27856 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27857 return the list created.
27859 COLON can be NULL if only closing parenthesis should end the list,
27860 or pointer to bool which will receive false if the list is terminated
27861 by closing parenthesis or true if the list is terminated by colon. */
27863 static tree
27866 {
27870 {
27873 }
27875 {
27892 {
27894 {
27897 {
27901 }
27902 /* FALL THROUGH. */
27908 {
27916 parser->colon_corrects_to_scope_p
27920 else
27921 {
27922 /* Look for `:'. */
27926 CPP_CLOSE_SQUARE))
27928 }
27929 /* Look for the closing `]'. */
27931 RT_CLOSE_SQUARE))
27935 {
27938 {
27942 }
27946 {
27950 }
27951 }
27954 }
27958 }
27964 }
27965 else
27968 get_comma:
27972 }
27978 {
27982 }
27985 {
27988 /* Try to resync to an unnested comma. Copied from
27989 cp_parser_parenthesized_expression_list. */
27990 skip_comma:
27999 }
28002 }
28004 /* Similarly, but expect leading and trailing parenthesis. This is a very
28005 common case for omp clauses. */
28007 static tree
28009 {
28013 }
28015 /* OpenACC 2.0:
28016 copy ( variable-list )
28017 copyin ( variable-list )
28018 copyout ( variable-list )
28019 create ( variable-list )
28020 delete ( variable-list )
28021 present ( variable-list )
28022 present_or_copy ( variable-list )
28023 pcopy ( variable-list )
28024 present_or_copyin ( variable-list )
28025 pcopyin ( variable-list )
28026 present_or_copyout ( variable-list )
28027 pcopyout ( variable-list )
28028 present_or_create ( variable-list )
28029 pcreate ( variable-list ) */
28031 static tree
28033 tree list)
28034 {
28037 {
28077 }
28085 }
28087 /* OpenACC 2.0:
28088 deviceptr ( variable-list ) */
28090 static tree
28092 {
28096 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
28097 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
28098 variable-list must only allow for pointer variables. */
28101 {
28104 /* FIXME diagnostics: Ideally we should keep individual
28105 locations for all the variables in the var list to make the
28106 following errors more precise. Perhaps
28107 c_parser_omp_var_list_parens should construct a list of
28108 locations to go along with the var list. */
28113 ;
28122 }
28125 }
28127 /* OpenACC:
28128 vector_length ( expression ) */
28130 static tree
28132 {
28142 {
28145 }
28148 {
28153 }
28156 location);
28164 }
28166 /* OpenACC 2.0
28167 Parse wait clause or directive parameters. */
28169 static tree
28171 {
28181 {
28186 }
28193 {
28197 {
28200 else
28201 {
28208 }
28209 }
28210 }
28213 }
28215 /* OpenACC:
28216 wait ( int-expr-list ) */
28218 static tree
28220 {
28229 }
28231 /* OpenMP 3.0:
28232 collapse ( constant-expression ) */
28234 static tree
28236 {
28238 location_t loc;
28239 HOST_WIDE_INT n;
28259 {
28262 }
28270 }
28272 /* OpenMP 2.5:
28273 default ( shared | none ) */
28275 static tree
28277 {
28279 tree c;
28284 {
28289 {
28304 }
28307 }
28308 else
28309 {
28310 invalid_kind:
28312 }
28328 }
28330 /* OpenMP 3.1:
28331 final ( expression ) */
28333 static tree
28335 {
28356 }
28358 /* OpenMP 2.5:
28359 if ( expression ) */
28361 static tree
28363 {
28384 }
28386 /* OpenMP 3.1:
28387 mergeable */
28389 static tree
28392 {
28393 tree c;
28396 location);
28401 }
28403 /* OpenMP 2.5:
28404 nowait */
28406 static tree
28409 {
28410 tree c;
28417 }
28419 /* OpenACC:
28420 num_gangs ( expression ) */
28422 static tree
28424 {
28440 {
28443 }
28453 }
28455 /* OpenMP 2.5:
28456 num_threads ( expression ) */
28458 static tree
28460 location_t location)
28461 {
28483 }
28485 /* OpenACC:
28486 num_workers ( expression ) */
28488 static tree
28490 {
28506 {
28509 }
28512 location);
28520 }
28522 /* OpenMP 2.5:
28523 ordered */
28525 static tree
28528 {
28529 tree c;
28537 }
28539 /* OpenMP 2.5:
28540 reduction ( reduction-operator : variable-list )
28542 reduction-operator:
28543 One of: + * - & ^ | && ||
28545 OpenMP 3.1:
28547 reduction-operator:
28548 One of: + * - & ^ | && || min max
28550 OpenMP 4.0:
28552 reduction-operator:
28553 One of: + * - & ^ | && ||
28554 id-expression */
28556 static tree
28558 {
28566 {
28576 }
28580 else
28581 {
28592 {
28622 }
28623 else
28624 {
28626 resync_fail:
28631 }
28632 }
28638 NULL);
28640 {
28643 }
28646 }
28648 /* OpenMP 2.5:
28649 schedule ( schedule-kind )
28650 schedule ( schedule-kind , expression )
28652 schedule-kind:
28653 static | dynamic | guided | runtime | auto */
28655 static tree
28657 {
28666 {
28671 {
28692 }
28693 }
28698 else
28703 {
28718 else
28723 }
28731 invalid_kind:
28733 resync_fail:
28738 }
28740 /* OpenMP 3.0:
28741 untied */
28743 static tree
28746 {
28747 tree c;
28754 }
28756 /* OpenMP 4.0:
28757 inbranch
28758 notinbranch */
28760 static tree
28763 {
28768 }
28770 /* OpenMP 4.0:
28771 parallel
28772 for
28773 sections
28774 taskgroup */
28776 static tree
28780 {
28784 }
28786 /* OpenMP 4.0:
28787 num_teams ( expression ) */
28789 static tree
28791 location_t location)
28792 {
28814 }
28816 /* OpenMP 4.0:
28817 thread_limit ( expression ) */
28819 static tree
28821 location_t location)
28822 {
28844 }
28846 /* OpenMP 4.0:
28847 aligned ( variable-list )
28848 aligned ( variable-list : constant-expression ) */
28850 static tree
28852 {
28863 {
28873 }
28879 }
28881 /* OpenMP 4.0:
28882 linear ( variable-list )
28883 linear ( variable-list : expression ) */
28885 static tree
28888 {
28899 {
28903 {
28906 }
28914 }
28920 }
28922 /* OpenMP 4.0:
28923 safelen ( constant-expression ) */
28925 static tree
28927 location_t location)
28928 {
28949 }
28951 /* OpenMP 4.0:
28952 simdlen ( constant-expression ) */
28954 static tree
28956 location_t location)
28957 {
28978 }
28980 /* OpenMP 4.0:
28981 depend ( depend-kind : variable-list )
28983 depend-kind:
28984 in | out | inout */
28986 static tree
28988 {
28996 {
29006 else
29008 }
29009 else
29017 NULL);
29024 invalid_kind:
29026 resync_fail:
29031 }
29033 /* OpenMP 4.0:
29034 map ( map-kind : variable-list )
29035 map ( variable-list )
29037 map-kind:
29038 alloc | to | from | tofrom */
29040 static tree
29042 {
29051 {
29063 else
29064 {
29070 }
29073 }
29076 NULL);
29082 }
29084 /* OpenMP 4.0:
29085 device ( expression ) */
29087 static tree
29089 location_t location)
29090 {
29112 }
29114 /* OpenMP 4.0:
29115 dist_schedule ( static )
29116 dist_schedule ( static , expression ) */
29118 static tree
29120 location_t location)
29121 {
29134 {
29145 }
29150 location);
29154 invalid_kind:
29156 resync_fail:
29161 }
29163 /* OpenMP 4.0:
29164 proc_bind ( proc-bind-kind )
29166 proc-bind-kind:
29167 master | close | spread */
29169 static tree
29171 location_t location)
29172 {
29173 tree c;
29180 {
29190 else
29192 }
29193 else
29202 location);
29207 invalid_kind:
29209 resync_fail:
29214 }
29216 /* OpenACC:
29217 async [( int-expr )] */
29219 static tree
29221 {
29228 {
29237 }
29247 }
29249 /* Parse all OpenACC clauses. The set clauses allowed by the directive
29250 is a bitmask in MASK. Return the list of clauses found. */
29252 static tree
29256 {
29261 {
29262 location_t here;
29263 pragma_omp_clause c_kind;
29274 {
29366 }
29371 {
29372 /* Remove the invalid clause(s) from the list to avoid
29373 confusing the rest of the compiler. */
29376 }
29377 }
29379 saw_error:
29386 }
29388 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29389 is a bitmask in MASK. Return the list of clauses found; the result
29390 of clause default goes in *pdefault. */
29392 static tree
29396 {
29403 {
29404 pragma_omp_clause c_kind;
29415 {
29427 clauses);
29441 clauses);
29450 clauses);
29474 clauses);
29488 clauses);
29505 OMP_CLAUSE_NOTINBRANCH,
29514 {
29515 clause_not_first:
29519 }
29544 clauses);
29549 clauses);
29554 clauses);
29617 }
29622 {
29623 /* Remove the invalid clause(s) from the list to avoid
29624 confusing the rest of the compiler. */
29627 }
29628 }
29629 saw_error:
29630 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29631 no reason to skip to the end. */
29637 }
29639 /* OpenMP 2.5:
29640 structured-block:
29641 statement
29643 In practice, we're also interested in adding the statement to an
29644 outer node. So it is convenient if we work around the fact that
29645 cp_parser_statement calls add_stmt. */
29647 static unsigned
29649 {
29652 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29653 This preserves the "not within loop or switch" style error messages
29654 for nonsense cases like
29655 void foo() {
29656 #pragma omp single
29657 break;
29658 }
29659 */
29664 }
29666 static void
29668 {
29670 }
29672 static tree
29674 {
29682 }
29684 /* OpenMP 2.5:
29685 # pragma omp atomic new-line
29686 expression-stmt
29688 expression-stmt:
29689 x binop= expr | x++ | ++x | x-- | --x
29690 binop:
29691 +, *, -, /, &, ^, |, <<, >>
29693 where x is an lvalue expression with scalar type.
29695 OpenMP 3.1:
29696 # pragma omp atomic new-line
29697 update-stmt
29699 # pragma omp atomic read new-line
29700 read-stmt
29702 # pragma omp atomic write new-line
29703 write-stmt
29705 # pragma omp atomic update new-line
29706 update-stmt
29708 # pragma omp atomic capture new-line
29709 capture-stmt
29711 # pragma omp atomic capture new-line
29712 capture-block
29714 read-stmt:
29715 v = x
29716 write-stmt:
29717 x = expr
29718 update-stmt:
29719 expression-stmt | x = x binop expr
29720 capture-stmt:
29721 v = expression-stmt
29722 capture-block:
29723 { v = x; update-stmt; } | { update-stmt; v = x; }
29725 OpenMP 4.0:
29726 update-stmt:
29727 expression-stmt | x = x binop expr | x = expr binop x
29728 capture-stmt:
29729 v = update-stmt
29730 capture-block:
29731 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29733 where x and v are lvalue expressions with scalar type. */
29735 static void
29737 {
29745 {
29750 {
29756 }
29757 }
29759 {
29771 else
29775 }
29777 {
29783 {
29788 {
29791 }
29792 }
29793 }
29797 {
29807 else
29812 {
29813 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29814 opcode. */
29819 }
29823 {
29826 }
29827 else
29828 {
29834 }
29837 }
29839 restart:
29843 {
29850 /* FALLTHROUGH */
29860 /* FALLTHROUGH */
29875 /* Undo effects of boolean_increment for post {in,de}crement. */
29877 /* FALLTHRU */
29881 {
29882 /* Undo effects of boolean_increment. */
29884 {
29885 /* This is pre or post increment. */
29890 && !structured_block
29894 }
29895 }
29896 /* FALLTHRU */
29899 {
29934 {
29938 }
29941 {
29947 {
29952 }
29954 {
29966 {
29968 {
29973 }
29974 else
29976 }
29980 }
29983 {
29990 }
29994 }
29998 {
30001 {
30009 }
30011 {
30016 }
30051 }
30062 /* FALLTHROUGH */
30067 }
30074 }
30075 stmt_done:
30077 {
30088 }
30090 {
30093 }
30094 done:
30100 saw_error:
30103 {
30107 {
30111 }
30112 }
30113 }
30116 /* OpenMP 2.5:
30117 # pragma omp barrier new-line */
30119 static void
30121 {
30124 }
30126 /* OpenMP 2.5:
30127 # pragma omp critical [(name)] new-line
30128 structured-block */
30130 static tree
30132 {
30136 {
30148 }
30153 }
30155 /* OpenMP 2.5:
30156 # pragma omp flush flush-vars[opt] new-line
30158 flush-vars:
30159 ( variable-list ) */
30161 static void
30163 {
30169 }
30171 /* Helper function, to parse omp for increment expression. */
30173 static tree
30175 {
30180 {
30183 }
30186 {
30195 /* Fall through: OpenMP disallows NE_EXPR. */
30198 }
30200 /* If decl is an iterator, preserve LHS and RHS of the relational
30201 expr until finish_omp_for. */
30211 }
30213 /* Helper function, to parse omp for increment expression. */
30215 static tree
30217 {
30221 cp_id_kind idk;
30225 {
30233 }
30241 {
30246 }
30253 {
30257 }
30269 do
30270 {
30277 {
30279 {
30282 else
30284 tf_warning_or_error);
30285 }
30286 else
30289 }
30290 }
30294 {
30298 }
30299 else
30303 }
30305 /* Parse the initialization statement of either an OpenMP for loop or
30306 a Cilk Plus for loop.
30308 Return true if the resulting construct should have an
30309 OMP_CLAUSE_PRIVATE added to it. */
30311 static bool
30319 {
30325 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
30327 init-expr:
30328 var = lb
30329 integer-type var = lb
30330 random-access-iterator-type var = lb
30331 pointer-type var = lb
30332 */
30333 cp_decl_specifier_seq type_specifiers;
30335 /* First, try to parse as an initialized declaration. See
30336 cp_parser_condition, from whence the bulk of this is copied. */
30343 {
30344 /* If parsing a type specifier seq succeeded, then this
30345 MUST be a initialized declaration. */
30350 CP_PARSER_DECLARATOR_NAMED,
30361 else
30362 {
30372 {
30374 CPP_OPEN_PAREN))
30375 {
30379 else
30382 }
30383 else
30384 /* Trigger an error. */
30389 }
30393 {
30401 {
30404 auto_node);
30409 }
30412 asm_specification,
30413 LOOKUP_ONLYCONVERTING);
30415 {
30418 }
30419 else
30422 }
30423 else
30424 {
30425 /* Consume '='. */
30429 non_class:
30432 else
30435 asm_specification,
30436 LOOKUP_ONLYCONVERTING);
30437 }
30441 }
30442 }
30443 else
30444 {
30445 cp_id_kind idk;
30446 /* If parsing a type specifier sequence failed, then
30447 this MUST be a simple expression. */
30455 && decl
30458 {
30459 tree rhs;
30466 rhs,
30467 tf_warning_or_error));
30469 }
30470 else
30471 {
30476 {
30480 }
30481 }
30482 }
30484 }
30486 /* Parse the restricted form of the for statement allowed by OpenMP. */
30488 static tree
30491 {
30495 location_t loc_first;
30514 {
30517 location_t loc;
30521 {
30524 }
30527 {
30530 }
30539 add_private_clause
30546 {
30549 {
30555 }
30556 else
30558 }
30565 {
30570 {
30574 }
30577 {
30578 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
30582 {
30585 }
30586 else
30587 {
30590 }
30592 }
30593 else
30594 {
30599 }
30600 }
30603 {
30604 tree c;
30606 {
30615 decl);
30619 decl);
30620 }
30622 {
30627 {
30630 }
30631 }
30632 }
30641 {
30642 /* If decl is an iterator, preserve the operator on decl
30643 until finish_omp_for. */
30645 && ((processing_template_decl
30649 else
30653 }
30668 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30669 in between the collapsed for loops to be still considered perfectly
30670 nested. Hopefully the final version clarifies this.
30671 For now handle (multiple) {'s and empty statements. */
30673 do
30674 {
30678 {
30680 bracecount++;
30681 }
30685 else
30686 {
30693 }
30694 }
30698 {
30701 }
30702 }
30704 /* Note that we saved the original contents of this flag when we entered
30705 the structured block, and so we don't need to re-save it here. */
30708 else
30711 /* Note that the grammar doesn't call for a structured block here,
30712 though the loop as a whole is a structured block. */
30719 else
30724 {
30726 {
30728 nbraces--;
30729 }
30732 else
30733 {
30735 {
30738 }
30743 }
30744 }
30751 }
30753 /* Helper function for OpenMP parsing, split clauses and call
30754 finish_omp_clauses on each of the set of clauses afterwards. */
30756 static void
30759 {
30765 }
30767 /* OpenMP 4.0:
30768 #pragma omp simd simd-clause[optseq] new-line
30769 for-loop */
30771 #define OMP_SIMD_CLAUSE_MASK \
30772 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30780 static tree
30783 {
30795 {
30798 }
30809 }
30811 /* OpenMP 2.5:
30812 #pragma omp for for-clause[optseq] new-line
30813 for-loop
30815 OpenMP 4.0:
30816 #pragma omp for simd for-simd-clause[optseq] new-line
30817 for-loop */
30819 #define OMP_FOR_CLAUSE_MASK \
30820 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30829 static tree
30832 {
30843 {
30848 {
30856 cclauses);
30860 cclauses);
30872 }
30873 }
30875 {
30878 }
30883 {
30886 }
30897 }
30899 /* OpenMP 2.5:
30900 # pragma omp master new-line
30901 structured-block */
30903 static tree
30905 {
30909 }
30911 /* OpenMP 2.5:
30912 # pragma omp ordered new-line
30913 structured-block */
30915 static tree
30917 {
30921 }
30923 /* OpenMP 2.5:
30925 section-scope:
30926 { section-sequence }
30928 section-sequence:
30929 section-directive[opt] structured-block
30930 section-sequence section-directive structured-block */
30932 static tree
30934 {
30945 {
30949 }
30952 {
30960 {
30964 }
30966 {
30969 }
30974 }
30985 }
30987 /* OpenMP 2.5:
30988 # pragma omp sections sections-clause[optseq] newline
30989 sections-scope */
30991 #define OMP_SECTIONS_CLAUSE_MASK \
30992 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30993 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30994 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30995 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30996 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30998 static tree
31001 {
31013 {
31016 }
31023 }
31025 /* OpenMP 2.5:
31026 # pragma omp parallel parallel-clause[optseq] new-line
31027 structured-block
31028 # pragma omp parallel for parallel-for-clause[optseq] new-line
31029 structured-block
31030 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
31031 structured-block
31033 OpenMP 4.0:
31034 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
31035 structured-block */
31037 #define OMP_PARALLEL_CLAUSE_MASK \
31038 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31039 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31040 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31041 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31042 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31043 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31044 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
31046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
31048 static tree
31051 {
31060 {
31073 block);
31078 }
31080 {
31084 }
31086 {
31089 }
31091 {
31095 {
31105 block);
31108 }
31109 }
31119 }
31121 /* OpenMP 2.5:
31122 # pragma omp single single-clause[optseq] new-line
31123 structured-block */
31125 #define OMP_SINGLE_CLAUSE_MASK \
31126 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
31129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
31131 static tree
31133 {
31143 }
31145 /* OpenMP 3.0:
31146 # pragma omp task task-clause[optseq] new-line
31147 structured-block */
31149 #define OMP_TASK_CLAUSE_MASK \
31150 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31151 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
31152 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31153 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31154 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31155 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31156 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
31157 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
31158 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
31160 static tree
31162 {
31173 }
31175 /* OpenMP 3.0:
31176 # pragma omp taskwait new-line */
31178 static void
31180 {
31183 }
31185 /* OpenMP 3.1:
31186 # pragma omp taskyield new-line */
31188 static void
31190 {
31193 }
31195 /* OpenMP 4.0:
31196 # pragma omp taskgroup new-line
31197 structured-block */
31199 static tree
31201 {
31205 }
31208 /* OpenMP 2.5:
31209 # pragma omp threadprivate (variable-list) */
31211 static void
31213 {
31214 tree vars;
31220 }
31222 /* OpenMP 4.0:
31223 # pragma omp cancel cancel-clause[optseq] new-line */
31225 #define OMP_CANCEL_CLAUSE_MASK \
31226 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31227 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31228 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31229 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
31230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31232 static void
31234 {
31238 }
31240 /* OpenMP 4.0:
31241 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
31243 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
31244 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31245 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31246 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31247 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
31249 static void
31251 {
31252 tree clauses;
31256 {
31261 {
31264 }
31265 }
31267 {
31271 }
31274 OMP_CANCELLATION_POINT_CLAUSE_MASK,
31276 pragma_tok);
31278 }
31280 /* OpenMP 4.0:
31281 #pragma omp distribute distribute-clause[optseq] new-line
31282 for-loop */
31284 #define OMP_DISTRIBUTE_CLAUSE_MASK \
31285 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
31288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31290 static tree
31293 {
31302 {
31310 else
31313 {
31319 {
31322 cclauses);
31323 else
31325 cclauses);
31326 }
31331 cclauses);
31332 else
31334 cclauses);
31346 }
31347 }
31349 {
31352 }
31357 {
31360 }
31371 }
31373 /* OpenMP 4.0:
31374 # pragma omp teams teams-clause[optseq] new-line
31375 structured-block */
31377 #define OMP_TEAMS_CLAUSE_MASK \
31378 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31379 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31380 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31381 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31382 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31386 static tree
31389 {
31398 {
31402 {
31410 cclauses);
31414 cclauses);
31426 }
31427 }
31429 {
31432 }
31437 {
31440 }
31448 }
31450 /* OpenMP 4.0:
31451 # pragma omp target data target-data-clause[optseq] new-line
31452 structured-block */
31454 #define OMP_TARGET_DATA_CLAUSE_MASK \
31455 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31456 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31459 static tree
31461 {
31473 }
31475 /* OpenMP 4.0:
31476 # pragma omp target update target-update-clause[optseq] new-line */
31478 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31479 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31480 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31484 static bool
31487 {
31489 {
31491 "%<#pragma omp target update%> may only be "
31495 }
31497 tree clauses
31502 {
31504 "%<#pragma omp target update%> must contain at least one "
31507 }
31515 }
31517 /* OpenMP 4.0:
31518 # pragma omp target target-clause[optseq] new-line
31519 structured-block */
31521 #define OMP_TARGET_CLAUSE_MASK \
31522 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31526 static bool
31529 {
31531 {
31535 }
31538 {
31543 {
31551 {
31553 OMP_TARGET_CLAUSE_MASK,
31554 cclauses);
31556 }
31572 }
31574 {
31577 }
31579 {
31583 }
31585 {
31588 }
31589 }
31603 }
31605 /* OpenACC 2.0:
31606 # pragma acc cache (variable-list) new-line
31607 */
31609 static tree
31611 {
31626 }
31628 /* OpenACC 2.0:
31629 # pragma acc data oacc-data-clause[optseq] new-line
31630 structured-block */
31632 #define OACC_DATA_CLAUSE_MASK \
31633 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31634 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31635 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31636 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31638 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31639 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31640 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31643 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
31645 static tree
31647 {
31660 }
31662 /* OpenACC 2.0:
31663 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
31665 or
31667 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
31669 LOC is the location of the #pragma token.
31670 */
31672 #define OACC_ENTER_DATA_CLAUSE_MASK \
31673 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31674 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31675 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31676 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31677 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31678 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31679 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31681 #define OACC_EXIT_DATA_CLAUSE_MASK \
31682 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
31686 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31688 static tree
31691 {
31696 {
31702 }
31707 {
31711 }
31718 else
31723 {
31727 }
31735 }
31737 /* OpenACC 2.0:
31738 # pragma acc kernels oacc-kernels-clause[optseq] new-line
31739 structured-block */
31741 #define OACC_KERNELS_CLAUSE_MASK \
31742 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31743 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31756 static tree
31758 {
31771 }
31773 /* OpenACC 2.0:
31774 # pragma acc loop oacc-loop-clause[optseq] new-line
31775 structured-block */
31777 #define OACC_LOOP_CLAUSE_MASK \
31778 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
31779 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION))
31781 static tree
31783 {
31796 }
31798 /* OpenACC 2.0:
31799 # pragma acc parallel oacc-parallel-clause[optseq] new-line
31800 structured-block */
31802 #define OACC_PARALLEL_CLAUSE_MASK \
31803 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31805 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31806 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
31811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
31812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
31818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
31819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31821 static tree
31823 {
31836 }
31838 /* OpenACC 2.0:
31839 # pragma acc update oacc-update-clause[optseq] new-line
31840 */
31842 #define OACC_UPDATE_CLAUSE_MASK \
31843 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
31845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
31846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
31848 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31850 static tree
31852 {
31859 {
31861 "%<#pragma acc update%> must contain at least one "
31864 }
31872 }
31874 /* OpenACC 2.0:
31875 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
31877 LOC is the location of the #pragma token.
31878 */
31880 #define OACC_WAIT_CLAUSE_MASK \
31881 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
31883 static tree
31885 {
31898 }
31900 /* OpenMP 4.0:
31901 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
31903 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
31904 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31905 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31906 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31907 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
31908 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
31909 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
31911 static void
31914 {
31916 cp_omp_declare_simd_data data;
31918 {
31923 }
31934 {
31938 {
31951 }
31956 "%<#pragma omp declare simd%> not immediately followed by "
31960 }
31961 }
31963 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
31964 This function is modelled similar to the late parsing of omp declare
31965 simd. */
31967 static tree
31969 {
31975 {
31981 }
31983 {
31987 }
31992 {
31999 NULL);
32013 }
32018 }
32020 /* Finalize #pragma omp declare simd clauses after direct declarator has
32021 been parsed, and put that into "omp declare simd" attribute. */
32023 static tree
32025 {
32031 {
32036 }
32041 {
32059 }
32063 }
32066 /* OpenMP 4.0:
32067 # pragma omp declare target new-line
32068 declarations and definitions
32069 # pragma omp end declare target new-line */
32071 static void
32073 {
32076 }
32078 static void
32080 {
32083 {
32086 }
32088 {
32092 {
32095 }
32098 else
32099 {
32103 }
32104 }
32105 else
32106 {
32110 }
32114 "%<#pragma omp end declare target%> without corresponding "
32116 else
32118 }
32120 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
32121 expression and optional initializer clause of
32122 #pragma omp declare reduction. We store the expression(s) as
32123 either 3, 6 or 7 special statements inside of the artificial function's
32124 body. The first two statements are DECL_EXPRs for the artificial
32125 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
32126 expression that uses those variables.
32127 If there was any INITIALIZER clause, this is followed by further statements,
32128 the fourth and fifth statements are DECL_EXPRs for the artificial
32129 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
32130 constructor variant (first token after open paren is not omp_priv),
32131 then the sixth statement is a statement with the function call expression
32132 that uses the OMP_PRIV and optionally OMP_ORIG variable.
32133 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
32134 to initialize the OMP_PRIV artificial variable and there is seventh
32135 statement, a DECL_EXPR of the OMP_PRIV statement again. */
32137 static bool
32139 {
32151 tree combiner;
32166 {
32169 }
32172 {
32179 {
32182 }
32198 {
32202 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
32206 == CPP_CLOSE_PAREN
32209 {
32213 }
32218 }
32219 else
32220 {
32236 {
32241 }
32243 tree arg;
32256 }
32267 }
32273 }
32275 /* OpenMP 4.0
32276 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32277 initializer-clause[opt] new-line
32279 initializer-clause:
32280 initializer (omp_priv initializer)
32281 initializer (function-name (argument-list)) */
32283 static void
32286 {
32296 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
32303 {
32335 }
32347 /* Types may not be defined in declare reduction type list. */
32350 parser->type_definition_forbidden_message
32356 saved_colon_doesnt_start_class_def_p
32361 {
32365 ;
32386 else
32391 else
32393 }
32395 /* Restore the saved message. */
32398 parser->colon_doesnt_start_class_def_p
32403 {
32404 fail:
32407 }
32413 {
32414 tree fntype
32417 NULL_TREE);
32436 {
32441 }
32443 {
32445 {
32454 }
32461 }
32462 else
32463 {
32466 }
32469 else
32472 {
32475 }
32477 {
32480 else
32485 }
32490 else
32491 {
32500 }
32507 }
32511 done:
32512 /* Free any declarators allocated. */
32514 }
32516 /* OpenMP 4.0
32517 #pragma omp declare simd declare-simd-clauses[optseq] new-line
32518 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32519 initializer-clause[opt] new-line
32520 #pragma omp declare target new-line */
32522 static void
32525 {
32527 {
32532 {
32535 context);
32537 }
32540 {
32543 context);
32545 }
32547 {
32550 }
32552 {
32556 }
32557 }
32561 }
32563 /* Main entry point to OpenMP statement pragmas. */
32565 static void
32567 {
32568 tree stmt;
32573 {
32648 }
32652 }
32653 \f
32654 /* Transactional Memory parsing routines. */
32656 /* Parse a transaction attribute.
32658 txn-attribute:
32659 attribute
32660 [ [ identifier ] ]
32662 ??? Simplify this when C++0x bracket attributes are
32663 implemented properly. */
32665 static tree
32667 {
32682 {
32686 /* For keywords, use the canonical spelling,
32687 not the parsed identifier. */
32691 }
32692 else
32696 error1:
32699 }
32701 /* Parse a __transaction_atomic or __transaction_relaxed statement.
32703 transaction-statement:
32704 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
32705 compound-statement
32706 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
32707 */
32709 static tree
32711 {
32726 else
32727 {
32731 }
32733 /* Parse a noexcept specification. */
32736 /* Keep track if we're in the lexical scope of an outer transaction. */
32748 }
32750 /* Parse a __transaction_atomic or __transaction_relaxed expression.
32752 transaction-expression:
32753 __transaction_atomic txn-noexcept-spec[opt] ( expression )
32754 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
32755 */
32757 static tree
32759 {
32784 /* Set this early. This might mean that we allow transaction_cancel in
32785 an expression that we find out later actually has to be a constexpr.
32786 However, we expect that cxx_constant_value will be able to deal with
32787 this; also, if the noexcept has no constexpr, then what we parse next
32788 really is a transaction's body. */
32791 /* Parse a noexcept specification. */
32797 {
32804 }
32805 else
32806 {
32807 /* The only expression that is available got parsed for the noexcept
32808 already. noexcept is true then. */
32811 }
32820 }
32822 /* Parse a function-transaction-block.
32824 function-transaction-block:
32825 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
32826 function-body
32827 __transaction_atomic txn-attribute[opt] function-try-block
32828 __transaction_relaxed ctor-initializer[opt] function-body
32829 __transaction_relaxed function-try-block
32830 */
32832 static bool
32834 {
32850 else
32851 {
32855 }
32863 else
32864 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
32872 }
32874 /* Parse a __transaction_cancel statement.
32876 cancel-statement:
32877 __transaction_cancel txn-attribute[opt] ;
32878 __transaction_cancel txn-attribute[opt] throw-expression ;
32880 ??? Cancel and throw is not yet implemented. */
32882 static tree
32884 {
32890 RT_TRANSACTION_CANCEL);
32897 /* ??? Parse cancel-and-throw here. */
32902 {
32906 }
32908 {
32912 }
32914 {
32917 {
32923 }
32924 }
32926 {
32930 }
32936 }
32937 \f
32938 /* The parser. */
32942 \f
32943 /* Special handling for the first token or line in the file. The first
32944 thing in the file might be #pragma GCC pch_preprocess, which loads a
32945 PCH file, which is a GC collection point. So we need to handle this
32946 first pragma without benefit of an existing lexer structure.
32948 Always returns one token to the caller in *FIRST_TOKEN. This is
32949 either the true first token of the file, or the first token after
32950 the initial pragma. */
32952 static void
32954 {
32963 {
32970 }
32971 else
32974 /* Skip to the end of the pragma. */
32978 /* Now actually load the PCH file. */
32982 /* Read one more token to return to our caller. We have to do this
32983 after reading the PCH file in, since its pointers have to be
32984 live. */
32986 }
32988 /* Parses the grainsize pragma for the _Cilk_for statement.
32989 Syntax:
32990 #pragma cilk grainsize = <VALUE>. */
32992 static void
32994 {
32996 {
33001 {
33004 }
33006 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
33009 else
33011 "%<#pragma cilk grainsize%> is not followed by "
33014 }
33016 }
33018 /* Normal parsing of a pragma token. Here we can (and must) use the
33019 regular lexer. */
33021 static bool
33023 {
33035 {
33043 {
33053 }
33058 {
33068 }
33073 {
33079 "%<#pragma omp taskwait%> may only be "
33084 }
33089 {
33095 "%<#pragma omp taskyield%> may only be "
33100 }
33105 {
33111 "%<#pragma omp cancel%> may only be "
33116 }
33121 {
33127 "%<#pragma omp cancellation point%> may only be "
33132 }
33179 "%<#pragma omp section%> may only be used in "
33184 {
33186 {
33190 }
33197 {
33200 }
33203 }
33207 {
33211 }
33217 {
33221 }
33223 /* Ignore the pragma if Cilk Plus is not enabled. */
33225 {
33228 }
33229 else
33230 {
33234 }
33241 bad_stmt:
33244 }
33248 }
33250 /* The interface the pragma parsers have to the lexer. */
33252 enum cpp_ttype
33254 {
33267 else
33268 {
33272 }
33275 }
33277 \f
33278 /* External interface. */
33280 /* Parse one entire translation unit. */
33282 void
33284 {
33297 }
33299 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
33300 vectorlength clause:
33301 Syntax:
33302 vectorlength ( constant-expression ) */
33304 static tree
33307 {
33309 tree expr;
33310 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
33311 safelen clause. Thus, vectorlength is represented as OMP 4.0
33312 safelen. For SIMD-enabled function it is represented by OMP 4.0
33313 simdlen. */
33316 loc);
33317 else
33319 loc);
33327 /* If expr == error_mark_node, then don't emit any errors nor
33328 create a clause. if any of the above functions returns
33329 error mark node then they would have emitted an error message. */
33331 ;
33339 else
33340 {
33341 tree c;
33343 {
33348 }
33349 else
33350 {
33355 }
33356 }
33361 }
33363 /* Handles the Cilk Plus #pragma simd linear clause.
33364 Syntax:
33365 linear ( simd-linear-variable-list )
33367 simd-linear-variable-list:
33368 simd-linear-variable
33369 simd-linear-variable-list , simd-linear-variable
33371 simd-linear-variable:
33372 id-expression
33373 id-expression : simd-linear-step
33375 simd-linear-step:
33376 conditional-expression */
33378 static tree
33380 {
33386 {
33390 }
33395 {
33398 {
33402 }
33409 {
33413 }
33414 else
33415 {
33419 /* If present, parse the linear step. Otherwise, assume the default
33420 value of 1. */
33422 {
33429 {
33430 /* If an error has occurred, then the whole pragma is
33431 considered ill-formed. Thus, no reason to keep
33432 parsing. */
33435 }
33443 else
33445 "step size must be an integer constant "
33447 }
33449 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
33455 }
33460 else
33461 {
33466 }
33467 }
33471 }
33473 /* Returns the name of the next clause. If the clause is not
33474 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
33475 token is not consumed. Otherwise, the appropriate enum from the
33476 pragma_simd_clause is returned and the token is consumed. */
33478 static pragma_omp_clause
33480 {
33481 pragma_omp_clause clause_type;
33498 else
33503 }
33505 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
33507 static tree
33509 {
33514 {
33515 pragma_omp_clause c_kind;
33522 /* Use the OpenMP 4.0 equivalent function. */
33525 /* Use the OpenMP 4.0 equivalent function. */
33527 clauses);
33529 /* Use the OMP 4.0 equivalent function. */
33531 clauses);
33533 /* Use the OMP 4.0 equivalent function. */
33535 else
33536 {
33540 }
33541 }
33547 else
33549 }
33551 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
33553 static void
33555 {
33562 {
33566 }
33575 }
33577 /* Main entry-point for parsing Cilk Plus _Cilk_for
33578 loops. The return value is error_mark_node
33579 when errors happen and CILK_FOR tree on success. */
33581 static tree
33583 {
33598 else
33604 }
33606 /* Create an identifier for a generic parameter type (a synthesized
33607 template parameter implied by `auto' or a concept identifier). */
33610 static tree
33612 {
33616 }
33618 /* Predicate that behaves as is_auto_or_concept but matches the parent
33619 node of the generic type rather than the generic type itself. This
33620 allows for type transformation in add_implicit_template_parms. */
33624 {
33626 }
33628 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
33629 (creating a new template parameter list if necessary). Returns the newly
33630 created template type parm. */
33632 tree
33634 {
33637 /* We are either continuing a function template that already contains implicit
33638 template parameters, creating a new fully-implicit function template, or
33639 extending an existing explicit function template with implicit template
33640 parameters. */
33648 {
33652 }
33653 else
33654 {
33655 /* Roll back to the existing template parameter scope (in the case of
33656 extending an explicit function template) or introduce a new template
33657 parameter scope ahead of the function parameter scope (or class scope
33658 in the case of out-of-line member definitions). The function scope is
33659 added back after template parameter synthesis below. */
33664 {
33667 }
33669 {
33670 /* If not defining a class, then any class scope is a scope level in
33671 an out-of-line member definition. In this case simply wind back
33672 beyond the first such scope to inject the template parameter list.
33673 Otherwise wind back to the class being defined. The latter can
33674 occur in class member friend declarations such as:
33676 class A {
33677 void foo (auto);
33678 };
33679 class B {
33680 friend void A::foo (auto);
33681 };
33683 The template parameter list synthesized for the friend declaration
33684 must be injected in the scope of 'B'. This can also occur in
33685 erroneous cases such as:
33687 struct A {
33688 struct B {
33689 void foo (auto);
33690 };
33691 void B::foo (auto) {}
33692 };
33694 Here the attempted definition of 'B::foo' within 'A' is ill-formed
33695 but, nevertheless, the template parameter list synthesized for the
33696 declarator should be injected into the scope of 'A' as if the
33697 ill-formed template was specified explicitly. */
33700 {
33703 }
33704 }
33710 {
33711 /* Introduce a new template parameter list for implicit template
33712 parameters. */
33716 parser->implicit_template_scope
33723 }
33724 else
33725 {
33726 /* Synthesize implicit template parameters at the end of the explicit
33727 template parameter list. */
33734 parser->implicit_template_parms
33736 }
33737 }
33739 /* Synthesize a new template parameter and track the current template
33740 parameter chain with implicit_template_parms. */
33744 synth_id);
33745 tree new_parm
33747 input_location,
33754 parser->implicit_template_parms
33756 else
33761 /* If creating a fully implicit function template, start the new implicit
33762 template parameter list with this synthesized type, otherwise grow the
33763 current template parameter list. */
33766 {
33773 }
33774 else
33775 {
33780 }
33785 }
33787 /* Finish the declaration of a fully implicit function template. Such a
33788 template has no explicit template parameter list so has not been through the
33789 normal template head and tail processing. synthesize_implicit_template_parm
33790 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33791 provided if the declaration is a class member such that its template
33792 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33793 form is returned. Otherwise NULL_TREE is returned. */
33795 tree
33797 {
33802 {
33806 }
33816 }