| blob | 772369493e96a0bb2ee1542f545f761b687f01ca |
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. */
1357 /* An erroneous declarator. */
1360 /* The obstack on which declarators and related data structures are
1361 allocated. */
1364 /* Alloc BYTES from the declarator memory pool. */
1368 {
1370 }
1372 /* Allocate a declarator of the indicated KIND. Clear fields that are
1373 common to all declarators. */
1377 {
1389 }
1391 /* Make a declarator for a generalized identifier. If
1392 QUALIFYING_SCOPE is non-NULL, the identifier is
1393 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1394 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1395 is, if any. */
1399 special_function_kind sfk)
1400 {
1403 /* It is valid to write:
1405 class C { void f(); };
1406 typedef C D;
1407 void D::f();
1409 The standard is not clear about whether `typedef const C D' is
1410 legal; as of 2002-09-15 the committee is considering that
1411 question. EDG 3.0 allows that syntax. Therefore, we do as
1412 well. */
1426 }
1428 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1429 of modifiers such as const or volatile to apply to the pointer
1430 type, represented as identifiers. ATTRIBUTES represent the attributes that
1431 appertain to the pointer or reference. */
1433 cp_declarator *
1435 tree attributes)
1436 {
1444 {
1448 }
1449 else
1455 }
1457 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1458 represent the attributes that appertain to the pointer or
1459 reference. */
1461 cp_declarator *
1464 {
1472 {
1476 }
1477 else
1483 }
1485 /* Like make_pointer_declarator -- but for a pointer to a non-static
1486 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1487 appertain to the pointer or reference. */
1489 cp_declarator *
1492 tree attributes)
1493 {
1502 {
1505 }
1506 else
1512 }
1514 /* Make a declarator for the function given by TARGET, with the
1515 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1516 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1517 indicates what exceptions can be thrown. */
1519 cp_declarator *
1521 tree parms,
1522 cp_cv_quals cv_qualifiers,
1523 cp_virt_specifiers virt_specifiers,
1524 cp_ref_qualifier ref_qualifier,
1525 tree exception_specification,
1526 tree late_return_type)
1527 {
1539 {
1543 }
1544 else
1548 }
1550 /* Make a declarator for an array of BOUNDS elements, each of which is
1551 defined by ELEMENT. */
1553 cp_declarator *
1555 {
1562 {
1566 }
1567 else
1571 }
1573 /* Determine whether the declarator we've seen so far can be a
1574 parameter pack, when followed by an ellipsis. */
1575 static bool
1577 {
1578 /* Search for a declarator name, or any other declarator that goes
1579 after the point where the ellipsis could appear in a parameter
1580 pack. If we find any of these, then this declarator can not be
1581 made into a parameter pack. */
1584 {
1586 {
1598 }
1599 }
1602 }
1606 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1607 DECLARATOR and DEFAULT_ARGUMENT. */
1609 cp_parameter_declarator *
1612 tree default_argument)
1613 {
1621 else
1628 }
1630 /* Returns true iff DECLARATOR is a declaration for a function. */
1632 static bool
1634 {
1636 {
1644 }
1646 }
1648 /* The parser. */
1650 /* Overview
1651 --------
1653 A cp_parser parses the token stream as specified by the C++
1654 grammar. Its job is purely parsing, not semantic analysis. For
1655 example, the parser breaks the token stream into declarators,
1656 expressions, statements, and other similar syntactic constructs.
1657 It does not check that the types of the expressions on either side
1658 of an assignment-statement are compatible, or that a function is
1659 not declared with a parameter of type `void'.
1661 The parser invokes routines elsewhere in the compiler to perform
1662 semantic analysis and to build up the abstract syntax tree for the
1663 code processed.
1665 The parser (and the template instantiation code, which is, in a
1666 way, a close relative of parsing) are the only parts of the
1667 compiler that should be calling push_scope and pop_scope, or
1668 related functions. The parser (and template instantiation code)
1669 keeps track of what scope is presently active; everything else
1670 should simply honor that. (The code that generates static
1671 initializers may also need to set the scope, in order to check
1672 access control correctly when emitting the initializers.)
1674 Methodology
1675 -----------
1677 The parser is of the standard recursive-descent variety. Upcoming
1678 tokens in the token stream are examined in order to determine which
1679 production to use when parsing a non-terminal. Some C++ constructs
1680 require arbitrary look ahead to disambiguate. For example, it is
1681 impossible, in the general case, to tell whether a statement is an
1682 expression or declaration without scanning the entire statement.
1683 Therefore, the parser is capable of "parsing tentatively." When the
1684 parser is not sure what construct comes next, it enters this mode.
1685 Then, while we attempt to parse the construct, the parser queues up
1686 error messages, rather than issuing them immediately, and saves the
1687 tokens it consumes. If the construct is parsed successfully, the
1688 parser "commits", i.e., it issues any queued error messages and
1689 the tokens that were being preserved are permanently discarded.
1690 If, however, the construct is not parsed successfully, the parser
1691 rolls back its state completely so that it can resume parsing using
1692 a different alternative.
1694 Future Improvements
1695 -------------------
1697 The performance of the parser could probably be improved substantially.
1698 We could often eliminate the need to parse tentatively by looking ahead
1699 a little bit. In some places, this approach might not entirely eliminate
1700 the need to parse tentatively, but it might still speed up the average
1701 case. */
1703 /* Flags that are passed to some parsing functions. These values can
1704 be bitwise-ored together. */
1706 enum
1707 {
1708 /* No flags. */
1710 /* The construct is optional. If it is not present, then no error
1711 should be issued. */
1713 /* When parsing a type-specifier, treat user-defined type-names
1714 as non-type identifiers. */
1716 /* When parsing a type-specifier, do not try to parse a class-specifier
1717 or enum-specifier. */
1719 /* When parsing a decl-specifier-seq, only allow type-specifier or
1720 constexpr. */
1722 };
1724 /* This type is used for parameters and variables which hold
1725 combinations of the above flags. */
1728 /* The different kinds of declarators we want to parse. */
1731 {
1732 /* We want an abstract declarator. */
1733 CP_PARSER_DECLARATOR_ABSTRACT,
1734 /* We want a named declarator. */
1735 CP_PARSER_DECLARATOR_NAMED,
1736 /* We don't mind, but the name must be an unqualified-id. */
1737 CP_PARSER_DECLARATOR_EITHER
1740 /* The precedence values used to parse binary expressions. The minimum value
1741 of PREC must be 1, because zero is reserved to quickly discriminate
1742 binary operators from other tokens. */
1744 enum cp_parser_prec
1745 {
1746 PREC_NOT_OPERATOR,
1747 PREC_LOGICAL_OR_EXPRESSION,
1748 PREC_LOGICAL_AND_EXPRESSION,
1749 PREC_INCLUSIVE_OR_EXPRESSION,
1750 PREC_EXCLUSIVE_OR_EXPRESSION,
1751 PREC_AND_EXPRESSION,
1752 PREC_EQUALITY_EXPRESSION,
1753 PREC_RELATIONAL_EXPRESSION,
1754 PREC_SHIFT_EXPRESSION,
1755 PREC_ADDITIVE_EXPRESSION,
1756 PREC_MULTIPLICATIVE_EXPRESSION,
1757 PREC_PM_EXPRESSION,
1758 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1759 };
1761 /* A mapping from a token type to a corresponding tree node type, with a
1762 precedence value. */
1765 {
1766 /* The token type. */
1768 /* The corresponding tree code. */
1770 /* The precedence of this operator. */
1775 {
1776 /* Left hand side of the binary operation we are currently
1777 parsing. */
1778 tree lhs;
1779 /* Original tree code for left hand side, if it was a binary
1780 expression itself (used for -Wparentheses). */
1782 /* Tree code for the binary operation we are parsing. */
1784 /* Precedence of the binary operation we are parsing. */
1786 /* Location of the binary operation we are parsing. */
1787 location_t loc;
1790 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1791 entries because precedence levels on the stack are monotonically
1792 increasing. */
1796 /* Prototypes. */
1798 /* Constructors and destructors. */
1803 /* Class variables. */
1807 /* The operator-precedence table used by cp_parser_binary_expression.
1808 Transformed into an associative array (binops_by_token) by
1809 cp_parser_new. */
1842 };
1844 /* The same as binops, but initialized by cp_parser_new so that
1845 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1846 for speed. */
1849 /* Constructors and destructors. */
1851 /* Construct a new context. The context below this one on the stack
1852 is given by NEXT. */
1856 {
1859 /* Allocate the storage. */
1861 {
1862 /* Pull the first entry from the free list. */
1866 }
1867 else
1870 /* No errors have occurred yet in this context. */
1872 /* If this is not the bottommost context, copy information that we
1873 need from the previous context. */
1875 {
1876 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1877 expression, then we are parsing one in this context, too. */
1879 /* Thread the stack. */
1881 }
1884 }
1886 /* Managing the unparsed function queues. */
1888 #define unparsed_funs_with_default_args \
1889 parser->unparsed_queues->last ().funs_with_default_args
1890 #define unparsed_funs_with_definitions \
1891 parser->unparsed_queues->last ().funs_with_definitions
1892 #define unparsed_nsdmis \
1893 parser->unparsed_queues->last ().nsdmis
1894 #define unparsed_classes \
1895 parser->unparsed_queues->last ().classes
1897 static void
1899 {
1902 }
1904 static void
1906 {
1909 }
1911 /* Prototypes. */
1913 /* Constructors and destructors. */
1918 /* Routines to parse various constructs.
1920 Those that return `tree' will return the error_mark_node (rather
1921 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1922 Sometimes, they will return an ordinary node if error-recovery was
1923 attempted, even though a parse error occurred. So, to check
1924 whether or not a parse error occurred, you should always use
1925 cp_parser_error_occurred. If the construct is optional (indicated
1926 either by an `_opt' in the name of the function that does the
1927 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1928 the construct is not present. */
1930 /* Lexical conventions [gram.lex] */
1932 static tree cp_parser_identifier
1934 static tree cp_parser_string_literal
1936 static tree cp_parser_userdef_char_literal
1938 static tree cp_parser_userdef_string_literal
1940 static tree cp_parser_userdef_numeric_literal
1943 /* Basic concepts [gram.basic] */
1945 static bool cp_parser_translation_unit
1948 /* Expressions [gram.expr] */
1950 static tree cp_parser_primary_expression
1952 static tree cp_parser_id_expression
1954 static tree cp_parser_unqualified_id
1956 static tree cp_parser_nested_name_specifier_opt
1958 static tree cp_parser_nested_name_specifier
1960 static tree cp_parser_qualifying_entity
1962 static tree cp_parser_postfix_expression
1964 static tree cp_parser_postfix_open_square_expression
1966 static tree cp_parser_postfix_dot_deref_expression
1970 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1972 static void cp_parser_pseudo_destructor_name
1974 static tree cp_parser_unary_expression
1976 static enum tree_code cp_parser_unary_operator
1978 static tree cp_parser_new_expression
1982 static tree cp_parser_new_type_id
1990 static tree cp_parser_delete_expression
1992 static tree cp_parser_cast_expression
1994 static tree cp_parser_binary_expression
1996 static tree cp_parser_question_colon_clause
1998 static tree cp_parser_assignment_expression
2000 static enum tree_code cp_parser_assignment_operator_opt
2002 static tree cp_parser_expression
2004 static tree cp_parser_constant_expression
2006 static tree cp_parser_builtin_offsetof
2008 static tree cp_parser_lambda_expression
2010 static void cp_parser_lambda_introducer
2012 static bool cp_parser_lambda_declarator_opt
2014 static void cp_parser_lambda_body
2017 /* Statements [gram.stmt.stmt] */
2019 static void cp_parser_statement
2021 static void cp_parser_label_for_labeled_statement
2023 static tree cp_parser_expression_statement
2025 static tree cp_parser_compound_statement
2027 static void cp_parser_statement_seq_opt
2029 static tree cp_parser_selection_statement
2031 static tree cp_parser_condition
2033 static tree cp_parser_iteration_statement
2035 static bool cp_parser_for_init_statement
2037 static tree cp_parser_for
2039 static tree cp_parser_c_for
2041 static tree cp_parser_range_for
2043 static void do_range_for_auto_deduction
2045 static tree cp_parser_perform_range_for_lookup
2047 static tree cp_parser_range_for_member_function
2049 static tree cp_parser_jump_statement
2051 static void cp_parser_declaration_statement
2054 static tree cp_parser_implicitly_scoped_statement
2056 static void cp_parser_already_scoped_statement
2059 /* Declarations [gram.dcl.dcl] */
2061 static void cp_parser_declaration_seq_opt
2063 static void cp_parser_declaration
2065 static void cp_parser_block_declaration
2067 static void cp_parser_simple_declaration
2069 static void cp_parser_decl_specifier_seq
2071 static tree cp_parser_storage_class_specifier_opt
2073 static tree cp_parser_function_specifier_opt
2075 static tree cp_parser_type_specifier
2078 static tree cp_parser_simple_type_specifier
2080 static tree cp_parser_type_name
2082 static tree cp_parser_nonclass_name
2084 static tree cp_parser_elaborated_type_specifier
2086 static tree cp_parser_enum_specifier
2088 static void cp_parser_enumerator_list
2090 static void cp_parser_enumerator_definition
2092 static tree cp_parser_namespace_name
2094 static void cp_parser_namespace_definition
2096 static void cp_parser_namespace_body
2098 static tree cp_parser_qualified_namespace_specifier
2100 static void cp_parser_namespace_alias_definition
2102 static bool cp_parser_using_declaration
2104 static void cp_parser_using_directive
2106 static tree cp_parser_alias_declaration
2108 static void cp_parser_asm_definition
2110 static void cp_parser_linkage_specification
2112 static void cp_parser_static_assert
2114 static tree cp_parser_decltype
2117 /* Declarators [gram.dcl.decl] */
2119 static tree cp_parser_init_declarator
2126 static enum tree_code cp_parser_ptr_operator
2128 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2130 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2132 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2134 static tree cp_parser_late_return_type_opt
2136 static tree cp_parser_declarator_id
2138 static tree cp_parser_type_id
2140 static tree cp_parser_template_type_arg
2143 static tree cp_parser_type_id_1
2145 static void cp_parser_type_specifier_seq
2147 static tree cp_parser_parameter_declaration_clause
2149 static tree cp_parser_parameter_declaration_list
2153 static tree cp_parser_default_argument
2155 static void cp_parser_function_body
2157 static tree cp_parser_initializer
2159 static tree cp_parser_initializer_clause
2161 static tree cp_parser_braced_list
2166 static bool cp_parser_ctor_initializer_opt_and_function_body
2169 static tree cp_parser_late_parsing_omp_declare_simd
2172 static tree cp_parser_late_parsing_cilk_simd_fn_info
2175 static tree synthesize_implicit_template_parm
2177 static tree finish_fully_implicit_template
2180 /* Classes [gram.class] */
2182 static tree cp_parser_class_name
2184 static tree cp_parser_class_specifier
2186 static tree cp_parser_class_head
2188 static enum tag_types cp_parser_class_key
2190 static void cp_parser_type_parameter_key
2192 static void cp_parser_member_specification_opt
2194 static void cp_parser_member_declaration
2196 static tree cp_parser_pure_specifier
2198 static tree cp_parser_constant_initializer
2201 /* Derived classes [gram.class.derived] */
2203 static tree cp_parser_base_clause
2205 static tree cp_parser_base_specifier
2208 /* Special member functions [gram.special] */
2210 static tree cp_parser_conversion_function_id
2212 static tree cp_parser_conversion_type_id
2216 static bool cp_parser_ctor_initializer_opt
2218 static void cp_parser_mem_initializer_list
2220 static tree cp_parser_mem_initializer
2222 static tree cp_parser_mem_initializer_id
2225 /* Overloading [gram.over] */
2227 static tree cp_parser_operator_function_id
2229 static tree cp_parser_operator
2232 /* Templates [gram.temp] */
2234 static void cp_parser_template_declaration
2236 static tree cp_parser_template_parameter_list
2238 static tree cp_parser_template_parameter
2240 static tree cp_parser_type_parameter
2242 static tree cp_parser_template_id
2244 static tree cp_parser_template_name
2246 static tree cp_parser_template_argument_list
2248 static tree cp_parser_template_argument
2250 static void cp_parser_explicit_instantiation
2252 static void cp_parser_explicit_specialization
2255 /* Exception handling [gram.exception] */
2257 static tree cp_parser_try_block
2259 static bool cp_parser_function_try_block
2261 static void cp_parser_handler_seq
2263 static void cp_parser_handler
2265 static tree cp_parser_exception_declaration
2267 static tree cp_parser_throw_expression
2269 static tree cp_parser_exception_specification_opt
2271 static tree cp_parser_type_id_list
2274 /* GNU Extensions */
2276 static tree cp_parser_asm_specification_opt
2278 static tree cp_parser_asm_operand_list
2280 static tree cp_parser_asm_clobber_list
2282 static tree cp_parser_asm_label_list
2284 static bool cp_next_tokens_can_be_attribute_p
2286 static bool cp_next_tokens_can_be_gnu_attribute_p
2288 static bool cp_next_tokens_can_be_std_attribute_p
2290 static bool cp_nth_tokens_can_be_std_attribute_p
2292 static bool cp_nth_tokens_can_be_gnu_attribute_p
2294 static bool cp_nth_tokens_can_be_attribute_p
2296 static tree cp_parser_attributes_opt
2298 static tree cp_parser_gnu_attributes_opt
2300 static tree cp_parser_gnu_attribute_list
2302 static tree cp_parser_std_attribute
2304 static tree cp_parser_std_attribute_spec
2306 static tree cp_parser_std_attribute_spec_seq
2308 static bool cp_parser_extension_opt
2310 static void cp_parser_label_declaration
2313 /* Transactional Memory Extensions */
2315 static tree cp_parser_transaction
2317 static tree cp_parser_transaction_expression
2319 static bool cp_parser_function_transaction
2321 static tree cp_parser_transaction_cancel
2325 pragma_external,
2326 pragma_member,
2327 pragma_objc_icode,
2328 pragma_stmt,
2329 pragma_compound
2330 };
2331 static bool cp_parser_pragma
2334 /* Objective-C++ Productions */
2336 static tree cp_parser_objc_message_receiver
2338 static tree cp_parser_objc_message_args
2340 static tree cp_parser_objc_message_expression
2342 static tree cp_parser_objc_encode_expression
2344 static tree cp_parser_objc_defs_expression
2346 static tree cp_parser_objc_protocol_expression
2348 static tree cp_parser_objc_selector_expression
2350 static tree cp_parser_objc_expression
2352 static bool cp_parser_objc_selector_p
2354 static tree cp_parser_objc_selector
2356 static tree cp_parser_objc_protocol_refs_opt
2358 static void cp_parser_objc_declaration
2360 static tree cp_parser_objc_statement
2362 static bool cp_parser_objc_valid_prefix_attributes
2364 static void cp_parser_objc_at_property_declaration
2366 static void cp_parser_objc_at_synthesize_declaration
2368 static void cp_parser_objc_at_dynamic_declaration
2370 static tree cp_parser_objc_struct_declaration
2373 /* Utility Routines */
2375 static tree cp_parser_lookup_name
2377 static tree cp_parser_lookup_name_simple
2379 static tree cp_parser_maybe_treat_template_as_class
2381 static bool cp_parser_check_declarator_template_parameters
2383 static bool cp_parser_check_template_parameters
2385 static tree cp_parser_simple_cast_expression
2387 static tree cp_parser_global_scope_opt
2389 static bool cp_parser_constructor_declarator_p
2391 static tree cp_parser_function_definition_from_specifiers_and_declarator
2393 static tree cp_parser_function_definition_after_declarator
2395 static void cp_parser_template_declaration_after_export
2397 static void cp_parser_perform_template_parameter_access_checks
2399 static tree cp_parser_single_declaration
2401 static tree cp_parser_functional_cast
2403 static tree cp_parser_save_member_function_body
2405 static tree cp_parser_save_nsdmi
2407 static tree cp_parser_enclosed_template_argument_list
2409 static void cp_parser_save_default_args
2411 static void cp_parser_late_parsing_for_member
2413 static tree cp_parser_late_parse_one_default_arg
2415 static void cp_parser_late_parsing_nsdmi
2417 static void cp_parser_late_parsing_default_args
2419 static tree cp_parser_sizeof_operand
2421 static tree cp_parser_trait_expr
2423 static bool cp_parser_declares_only_class_p
2425 static void cp_parser_set_storage_class
2427 static void cp_parser_set_decl_spec_type
2429 static void set_and_check_decl_spec_loc
2432 static bool cp_parser_friend_p
2434 static void cp_parser_required_error
2440 static bool cp_parser_token_starts_function_definition_p
2442 static bool cp_parser_next_token_starts_class_definition_p
2444 static bool cp_parser_next_token_ends_template_argument_p
2446 static bool cp_parser_nth_token_starts_template_argument_list_p
2448 static enum tag_types cp_parser_token_is_class_key
2450 static enum tag_types cp_parser_token_is_type_parameter_key
2452 static void cp_parser_check_class_key
2454 static void cp_parser_check_access_in_redeclaration
2456 static bool cp_parser_optional_template_keyword
2458 static void cp_parser_pre_parsed_nested_name_specifier
2460 static bool cp_parser_cache_group
2462 static tree cp_parser_cache_defarg
2464 static void cp_parser_parse_tentatively
2466 static void cp_parser_commit_to_tentative_parse
2468 static void cp_parser_commit_to_topmost_tentative_parse
2470 static void cp_parser_abort_tentative_parse
2472 static bool cp_parser_parse_definitely
2476 static bool cp_parser_uncommitted_to_tentative_parse_p
2478 static void cp_parser_error
2480 static void cp_parser_name_lookup_error
2482 static bool cp_parser_simulate_error
2484 static bool cp_parser_check_type_definition
2486 static void cp_parser_check_for_definition_in_return_type
2488 static void cp_parser_check_for_invalid_template_id
2490 static bool cp_parser_non_integral_constant_expression
2492 static void cp_parser_diagnose_invalid_type_name
2494 static bool cp_parser_parse_and_diagnose_invalid_type_name
2496 static int cp_parser_skip_to_closing_parenthesis
2498 static void cp_parser_skip_to_end_of_statement
2500 static void cp_parser_consume_semicolon_at_end_of_statement
2502 static void cp_parser_skip_to_end_of_block_or_statement
2504 static bool cp_parser_skip_to_closing_brace
2506 static void cp_parser_skip_to_end_of_template_parameter_list
2508 static void cp_parser_skip_to_pragma_eol
2510 static bool cp_parser_error_occurred
2512 static bool cp_parser_allow_gnu_extensions_p
2514 static bool cp_parser_is_pure_string_literal
2516 static bool cp_parser_is_string_literal
2518 static bool cp_parser_is_keyword
2520 static tree cp_parser_make_typename_type
2524 static bool cp_parser_compound_literal_p
2526 static bool cp_parser_array_designator_p
2528 static bool cp_parser_skip_to_closing_square_bracket
2531 /* Returns nonzero if we are parsing tentatively. */
2535 {
2537 }
2539 /* Returns nonzero if TOKEN is a string literal. */
2541 static bool
2543 {
2549 }
2551 /* Returns nonzero if TOKEN is a string literal
2552 of a user-defined string literal. */
2554 static bool
2556 {
2563 }
2565 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2567 static bool
2569 {
2571 }
2573 /* If not parsing tentatively, issue a diagnostic of the form
2574 FILE:LINE: MESSAGE before TOKEN
2575 where TOKEN is the next token in the input stream. MESSAGE
2576 (specified by the caller) is usually of the form "expected
2577 OTHER-TOKEN". */
2579 static void
2581 {
2583 {
2585 /* This diagnostic makes more sense if it is tagged to the line
2586 of the token we just peeked at. */
2590 {
2595 }
2598 /* Because c_parser_error does not understand
2599 CPP_KEYWORD, keywords are treated like
2600 identifiers. */
2603 }
2604 }
2606 /* Issue an error about name-lookup failing. NAME is the
2607 IDENTIFIER_NODE DECL is the result of
2608 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2609 the thing that we hoped to find. */
2611 static void
2613 tree name,
2614 tree decl,
2615 name_lookup_error desired,
2616 location_t location)
2617 {
2618 /* If name lookup completely failed, tell the user that NAME was not
2619 declared. */
2621 {
2634 else
2636 }
2638 {
2640 {
2657 }
2658 }
2660 {
2662 {
2672 name);
2676 }
2677 }
2678 else
2679 {
2681 {
2694 }
2695 }
2696 }
2698 /* If we are parsing tentatively, remember that an error has occurred
2699 during this tentative parse. Returns true if the error was
2700 simulated; false if a message should be issued by the caller. */
2702 static bool
2704 {
2706 {
2709 }
2711 }
2713 /* This function is called when a type is defined. If type
2714 definitions are forbidden at this point, an error message is
2715 issued. */
2717 static bool
2719 {
2720 /* If types are forbidden here, issue a message. */
2722 {
2723 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2724 in the message need to be interpreted. */
2727 }
2729 }
2731 /* This function is called when the DECLARATOR is processed. The TYPE
2732 was a type defined in the decl-specifiers. If it is invalid to
2733 define a type in the decl-specifiers for DECLARATOR, an error is
2734 issued. TYPE_LOCATION is the location of TYPE and is used
2735 for error reporting. */
2737 static void
2740 {
2741 /* [dcl.fct] forbids type definitions in return types.
2742 Unfortunately, it's not easy to know whether or not we are
2743 processing a return type until after the fact. */
2751 {
2756 type);
2757 }
2758 }
2760 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2761 "<" in any valid C++ program. If the next token is indeed "<",
2762 issue a message warning the user about what appears to be an
2763 invalid attempt to form a template-id. LOCATION is the location
2764 of the type-specifier (TYPE) */
2766 static void
2768 tree type,
2770 location_t location)
2771 {
2775 {
2779 {
2782 else
2784 }
2785 else
2787 /* Remember the location of the invalid "<". */
2790 /* Consume the "<". */
2792 /* Parse the template arguments. */
2794 /* Permanently remove the invalid template arguments so that
2795 this error message is not issued again. */
2798 }
2799 }
2801 /* If parsing an integral constant-expression, issue an error message
2802 about the fact that THING appeared and return true. Otherwise,
2803 return false. In either case, set
2804 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2806 static bool
2808 non_integral_constant thing)
2809 {
2812 {
2814 {
2817 {
2824 "enumeration type cannot appear in a "
2915 }
2919 }
2920 }
2922 }
2924 /* Emit a diagnostic for an invalid type name. This function commits
2925 to the current active tentative parse, if any. (Otherwise, the
2926 problematic construct might be encountered again later, resulting
2927 in duplicate error messages.) LOCATION is the location of ID. */
2929 static void
2931 location_t location)
2932 {
2935 /* Try to lookup the identifier. */
2942 /* If the lookup was ambiguous, an error will already have
2943 been issued. */
2945 /* If the lookup found a template-name, it means that the user forgot
2946 to specify an argument list. Emit a useful error message. */
2948 {
2951 decl);
2953 }
2957 /* Something like 'unsigned A a;' */
2960 {
2961 /* Issue an error message. */
2963 /* If we're in a template class, it's possible that the user was
2964 referring to a type from a base class. For example:
2966 template <typename T> struct A { typedef T X; };
2967 template <typename T> struct B : public A<T> { X x; };
2969 The user should have said "typename A<T>::X". */
2983 {
2984 tree b;
2987 b;
2989 {
2993 {
2994 tree field;
2995 /* Go from a particular instantiation of the
2996 template (which will have an empty TYPE_FIELDs),
2997 to the main version. */
3000 field;
3004 {
3009 }
3012 }
3013 }
3014 }
3015 }
3016 /* Here we diagnose qualified-ids where the scope is actually correct,
3017 but the identifier does not resolve to a valid type name. */
3019 {
3021 {
3026 else
3032 }
3035 {
3036 /* A<T>::A<T>() */
3042 }
3049 {
3054 else
3060 }
3061 else
3063 }
3064 }
3066 /* Check for a common situation where a type-name should be present,
3067 but is not, and issue a sensible error message. Returns true if an
3068 invalid type-name was detected.
3070 The situation handled by this function are variable declarations of the
3071 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3072 Usually, `ID' should name a type, but if we got here it means that it
3073 does not. We try to emit the best possible error message depending on
3074 how exactly the id-expression looks like. */
3076 static bool
3078 {
3079 tree id;
3082 /* Avoid duplicate error about ambiguous lookup. */
3084 {
3088 }
3097 /* If the next token is a (, this is a function with no explicit return
3098 type, i.e. constructor, destructor or conversion op. */
3101 {
3104 }
3108 /* Emit a diagnostic for the invalid type. */
3110 out:
3111 /* If we aren't in the middle of a declarator (i.e. in a
3112 parameter-declaration-clause), skip to the end of the declaration;
3113 there's no point in trying to process it. */
3117 }
3119 /* Consume tokens up to, and including, the next non-nested closing `)'.
3120 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3121 are doing error recovery. Returns -1 if OR_COMMA is true and we
3122 found an unnested comma. */
3124 static int
3129 {
3139 {
3143 {
3146 /* If we've run out of tokens, then there is no closing `)'. */
3149 /* This is good for lambda expression capture-lists. */
3159 /* This matches the processing in skip_to_end_of_statement. */
3185 {
3189 }
3194 }
3196 /* Consume the token. */
3198 }
3199 }
3201 /* Consume tokens until we reach the end of the current statement.
3202 Normally, that will be just before consuming a `;'. However, if a
3203 non-nested `}' comes first, then we stop before consuming that. */
3205 static void
3207 {
3210 /* Unwind generic function template scope if necessary. */
3215 {
3219 {
3222 /* If we've run out of tokens, stop. */
3226 /* If the next token is a `;', we have reached the end of the
3227 statement. */
3233 /* If this is a non-nested '}', stop before consuming it.
3234 That way, when confronted with something like:
3236 { 3 + }
3238 we stop before consuming the closing '}', even though we
3239 have not yet reached a `;'. */
3243 /* If it is the closing '}' for a block that we have
3244 scanned, stop -- but only after consuming the token.
3245 That way given:
3247 void f g () { ... }
3248 typedef int I;
3250 we will stop after the body of the erroneously declared
3251 function, but before consuming the following `typedef'
3252 declaration. */
3254 {
3257 }
3265 }
3267 /* Consume the token. */
3269 }
3270 }
3272 /* This function is called at the end of a statement or declaration.
3273 If the next token is a semicolon, it is consumed; otherwise, error
3274 recovery is attempted. */
3276 static void
3278 {
3279 /* Look for the trailing `;'. */
3281 {
3282 /* If there is additional (erroneous) input, skip to the end of
3283 the statement. */
3285 /* If the next token is now a `;', consume it. */
3288 }
3289 }
3291 /* Skip tokens until we have consumed an entire block, or until we
3292 have consumed a non-nested `;'. */
3294 static void
3296 {
3299 /* Unwind generic function template scope if necessary. */
3304 {
3308 {
3311 /* If we've run out of tokens, stop. */
3315 /* Stop if this is an unnested ';'. */
3321 /* Stop if this is an unnested '}', or closes the outermost
3322 nesting level. */
3323 nesting_depth--;
3331 /* Nest. */
3332 nesting_depth++;
3337 }
3339 /* Consume the token. */
3341 }
3342 }
3344 /* Skip tokens until a non-nested closing curly brace is the next
3345 token, or there are no more tokens. Return true in the first case,
3346 false otherwise. */
3348 static bool
3350 {
3354 {
3358 {
3361 /* If we've run out of tokens, stop. */
3365 /* If the next token is a non-nested `}', then we have reached
3366 the end of the current block. */
3372 /* If it the next token is a `{', then we are entering a new
3373 block. Consume the entire block. */
3379 }
3381 /* Consume the token. */
3383 }
3384 }
3386 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3387 parameter is the PRAGMA token, allowing us to purge the entire pragma
3388 sequence. */
3390 static void
3392 {
3397 do
3401 /* Ensure that the pragma is not parsed again. */
3403 }
3405 /* Require pragma end of line, resyncing with it as necessary. The
3406 arguments are as for cp_parser_skip_to_pragma_eol. */
3408 static void
3410 {
3414 }
3416 /* This is a simple wrapper around make_typename_type. When the id is
3417 an unresolved identifier node, we can provide a superior diagnostic
3418 using cp_parser_diagnose_invalid_type_name. */
3420 static tree
3422 location_t id_location)
3423 {
3424 tree result;
3426 {
3432 }
3434 }
3436 /* This is a wrapper around the
3437 make_{pointer,ptrmem,reference}_declarator functions that decides
3438 which one to call based on the CODE and CLASS_TYPE arguments. The
3439 CODE argument should be one of the values returned by
3440 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3441 appertain to the pointer or reference. */
3445 cp_cv_quals cv_qualifiers,
3447 tree attributes)
3448 {
3455 else
3465 }
3467 /* Create a new C++ parser. */
3471 {
3476 /* cp_lexer_new_main is called before doing GC allocation because
3477 cp_lexer_new_main might load a PCH file. */
3480 /* Initialize the binops_by_token so that we can get the tree
3481 directly from the token. */
3489 /* For now, we always accept GNU extensions. */
3492 /* The `>' token is a greater-than operator, not the end of a
3493 template-id. */
3498 /* We are not parsing a constant-expression. */
3503 /* Local variable names are not forbidden. */
3506 /* We are not processing an `extern "C"' declaration. */
3509 /* We are not processing a declarator. */
3512 /* We are not processing a template-argument-list. */
3515 /* We are not in an iteration statement. */
3518 /* We are not in a switch statement. */
3521 /* We are not parsing a type-id inside an expression. */
3524 /* Declarations aren't implicitly extern "C". */
3527 /* String literals should be translated to the execution character set. */
3530 /* We are not parsing a function body. */
3533 /* We can correct until told otherwise. */
3536 /* The unparsed function queue is empty. */
3539 /* There are no classes being defined. */
3542 /* No template parameters apply. */
3545 /* Not declaring an implicit function template. */
3552 }
3554 /* Create a cp_lexer structure which will emit the tokens in CACHE
3555 and push it onto the parser's lexer stack. This is used for delayed
3556 parsing of in-class method bodies and default arguments, and should
3557 not be confused with tentative parsing. */
3558 static void
3560 {
3565 /* Move the current source position to that of the first token in the
3566 new lexer. */
3568 }
3570 /* Pop the top lexer off the parser stack. This is never used for the
3571 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3572 static void
3574 {
3579 /* Put the current source position back where it was before this
3580 lexer was pushed. */
3582 }
3584 /* Lexical conventions [gram.lex] */
3586 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3587 identifier. */
3589 static tree
3591 {
3594 /* Look for the identifier. */
3596 /* Return the value. */
3598 }
3600 /* Parse a sequence of adjacent string constants. Returns a
3601 TREE_STRING representing the combined, nul-terminated string
3602 constant. If TRANSLATE is true, translate the string to the
3603 execution character set. If WIDE_OK is true, a wide string is
3604 invalid here.
3606 C++98 [lex.string] says that if a narrow string literal token is
3607 adjacent to a wide string literal token, the behavior is undefined.
3608 However, C99 6.4.5p4 says that this results in a wide string literal.
3609 We follow C99 here, for consistency with the C front end.
3611 This code is largely lifted from lex_string() in c-lex.c.
3613 FUTURE: ObjC++ will need to handle @-strings here. */
3614 static tree
3617 {
3618 tree value;
3625 tree string_tree;
3631 {
3634 }
3637 {
3641 }
3642 else
3643 {
3646 }
3649 /* Try to avoid the overhead of creating and destroying an obstack
3650 for the common case of just one string. */
3653 {
3661 {
3665 }
3666 else
3670 }
3671 else
3672 {
3676 do
3677 {
3679 count++;
3684 {
3687 {
3690 }
3693 {
3698 }
3700 }
3701 else
3705 {
3710 "unsupported non-standard concatenation "
3712 }
3718 {
3722 }
3723 else
3724 {
3728 }
3729 }
3733 }
3736 {
3739 }
3743 {
3748 {
3763 }
3768 {
3773 else
3775 }
3776 }
3777 else
3778 /* cpp_interpret_string has issued an error. */
3785 }
3787 /* Look up a literal operator with the name and the exact arguments. */
3789 static tree
3791 {
3798 {
3804 {
3807 {
3817 }
3820 /* May be this should be sufficient_parms_p instead,
3821 depending on how exactly should user-defined literals
3822 work in presence of default arguments on the literal
3823 operator parameters. */
3826 }
3827 }
3830 }
3832 /* Parse a user-defined char constant. Returns a call to a user-defined
3833 literal operator taking the character as an argument. */
3835 static tree
3837 {
3845 /* Build up a call to the user-defined operator */
3846 /* Lookup the name we got back from the id-expression. */
3851 {
3856 }
3860 }
3862 /* A subroutine of cp_parser_userdef_numeric_literal to
3863 create a char... template parameter pack from a string node. */
3865 static tree
3867 {
3868 tree charvec;
3874 /* Fill in CHARVEC with all of the parameters. */
3879 /* Build the argument packs. */
3886 }
3888 /* A subroutine of cp_parser_userdef_numeric_literal to
3889 create a char... template parameter pack from a string node. */
3891 static tree
3893 {
3894 tree charvec;
3905 /* First template parm is character type. */
3908 /* Fill in CHARVEC with all of the parameters. */
3915 /* Build the argument packs. */
3922 }
3924 /* Parse a user-defined numeric constant. returns a call to a user-defined
3925 literal operator. */
3927 static tree
3929 {
3940 /* Look for a literal operator taking the exact type of numeric argument
3941 as the literal value. */
3946 {
3948 tf_warning_or_error);
3951 {
3954 long_long_unsigned_type_node);
3955 }
3956 else
3957 {
3961 long_double_type_node);
3965 }
3969 }
3972 /* If the numeric argument didn't work, look for a raw literal
3973 operator taking a const char* argument consisting of the number
3974 in string format. */
3979 {
3981 tf_warning_or_error);
3984 }
3987 /* If the raw literal didn't work, look for a non-type template
3988 function with parameter pack char.... Call the function with
3989 template parameter characters representing the number. */
3993 {
3997 tf_warning_or_error);
4000 }
4009 }
4011 /* Parse a user-defined string constant. Returns a call to a user-defined
4012 literal operator taking a character pointer and the length of the string
4013 as arguments. */
4015 static tree
4017 {
4026 /* Build up a call to the user-defined operator. */
4027 /* Lookup the name we got back from the id-expression. */
4034 {
4036 tf_warning_or_error);
4039 }
4042 /* Look for a template function with typename parameter CharT
4043 and parameter pack CharT... Call the function with
4044 template parameter characters representing the string. */
4048 {
4052 tf_warning_or_error);
4055 }
4061 }
4064 /* Basic concepts [gram.basic] */
4066 /* Parse a translation-unit.
4068 translation-unit:
4069 declaration-seq [opt]
4071 Returns TRUE if all went well. */
4073 static bool
4075 {
4076 /* The address of the first non-permanent object on the declarator
4077 obstack. */
4082 /* Create the declarator obstack, if necessary. */
4084 {
4086 /* Create the error declarator. */
4088 /* Create the empty parameter list. */
4090 /* Remember where the base of the declarator obstack lies. */
4092 }
4096 /* If there are no tokens left then all went well. */
4098 {
4099 /* Get rid of the token array; we don't need it any more. */
4103 /* This file might have been a context that's implicitly extern
4104 "C". If so, pop the lang context. (Only relevant for PCH.) */
4106 {
4109 }
4111 /* Finish up. */
4115 }
4116 else
4117 {
4120 }
4122 /* Make sure the declarator obstack was fully cleaned up. */
4126 /* All went well. */
4128 }
4130 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4131 decltype context. */
4135 {
4140 }
4142 /* We're about to parse a collection of statements. If we're currently
4143 parsing tentatively, set up a firewall so that any nested
4144 cp_parser_commit_to_tentative_parse won't affect the current context. */
4146 static cp_token_position
4148 {
4155 }
4157 /* We've finished parsing the collection of statements. Wrap up the
4158 firewall and replace the relevant tokens with the parsed form. */
4160 static void
4162 tree expr)
4163 {
4167 /* Finish the firewall level. */
4169 /* And remember the result of the parse for when we try again. */
4175 }
4177 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4178 enclosing parentheses. */
4180 static tree
4182 {
4185 /* Consume the '('. */
4187 /* Start the statement-expression. */
4189 /* Parse the compound-statement. */
4191 /* Finish up. */
4193 /* Consume the ')'. */
4199 }
4201 /* Expressions [gram.expr] */
4203 /* Parse a primary-expression.
4205 primary-expression:
4206 literal
4207 this
4208 ( expression )
4209 id-expression
4210 lambda-expression (C++11)
4212 GNU Extensions:
4214 primary-expression:
4215 ( compound-statement )
4216 __builtin_va_arg ( assignment-expression , type-id )
4217 __builtin_offsetof ( type-id , offsetof-expression )
4219 C++ Extensions:
4220 __has_nothrow_assign ( type-id )
4221 __has_nothrow_constructor ( type-id )
4222 __has_nothrow_copy ( type-id )
4223 __has_trivial_assign ( type-id )
4224 __has_trivial_constructor ( type-id )
4225 __has_trivial_copy ( type-id )
4226 __has_trivial_destructor ( type-id )
4227 __has_virtual_destructor ( type-id )
4228 __is_abstract ( type-id )
4229 __is_base_of ( type-id , type-id )
4230 __is_class ( type-id )
4231 __is_empty ( type-id )
4232 __is_enum ( type-id )
4233 __is_final ( type-id )
4234 __is_literal_type ( type-id )
4235 __is_pod ( type-id )
4236 __is_polymorphic ( type-id )
4237 __is_std_layout ( type-id )
4238 __is_trivial ( type-id )
4239 __is_union ( type-id )
4241 Objective-C++ Extension:
4243 primary-expression:
4244 objc-expression
4246 literal:
4247 __null
4249 ADDRESS_P is true iff this expression was immediately preceded by
4250 "&" and therefore might denote a pointer-to-member. CAST_P is true
4251 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4252 true iff this expression is a template argument.
4254 Returns a representation of the expression. Upon return, *IDK
4255 indicates what kind of id-expression (if any) was present. */
4257 static tree
4264 {
4267 /* Assume the primary expression is not an id-expression. */
4270 /* Peek at the next token. */
4273 {
4274 /* literal:
4275 integer-literal
4276 character-literal
4277 floating-literal
4278 string-literal
4279 boolean-literal
4280 pointer-literal
4281 user-defined-literal */
4293 {
4297 }
4298 /* Floating-point literals are only allowed in an integral
4299 constant expression if they are cast to an integral or
4300 enumeration type. */
4304 {
4305 /* CAST_P will be set even in invalid code like "int(2.7 +
4306 ...)". Therefore, we have to check that the next token
4307 is sure to end the cast. */
4309 {
4314 enumerator-definition. */
4316 /* The curly brace at the end of an enum-specifier. */
4318 /* The end of a statement. */
4320 /* The end of the cast-expression. */
4322 /* The end of an array bound. */
4324 /* The closing ">" in a template-argument-list. */
4327 /* C++0x only: A ">>" treated like two ">" tokens,
4328 in a template-argument-list. */
4333 }
4335 /* If we are within a cast, then the constraint that the
4336 cast is to an integral or enumeration type will be
4337 checked at that point. If we are not within a cast, then
4338 this code is invalid. */
4341 }
4361 /* ??? Should wide strings be allowed when parser->translate_strings_p
4362 is false (i.e. in attributes)? If not, we can kill the third
4363 argument to cp_parser_string_literal. */
4369 /* If we see `( { ' then we are looking at the beginning of
4370 a GNU statement-expression. */
4373 {
4374 /* Statement-expressions are not allowed by the standard. */
4378 /* And they're not allowed outside of a function-body; you
4379 cannot, for example, write:
4381 int i = ({ int j = 3; j + 1; });
4383 at class or namespace scope. */
4386 {
4388 "statement-expressions are not allowed outside "
4394 }
4395 else
4397 }
4398 /* Otherwise it's a normal parenthesized expression. */
4399 {
4400 tree expr;
4403 /* Consume the `('. */
4405 /* Within a parenthesized expression, a `>' token is always
4406 the greater-than operator. */
4407 saved_greater_than_is_operator_p
4411 /* Parse the parenthesized expression. */
4413 /* Let the front end know that this expression was
4414 enclosed in parentheses. This matters in case, for
4415 example, the expression is of the form `A::B', since
4416 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4417 not. */
4419 /* DR 705: Wrapping an unqualified name in parentheses
4420 suppresses arg-dependent lookup. We want to pass back
4421 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4422 (c++/37862), but none of the others. */
4426 /* The `>' token might be the end of a template-id or
4427 template-parameter-list now. */
4428 parser->greater_than_is_operator_p
4430 /* Consume the `)'. */
4435 }
4438 {
4440 {
4441 /* We might have an Objective-C++ message. */
4444 /* If that works out, we're done ... */
4447 /* ... else, fall though to see if it's a lambda. */
4448 }
4450 /* Don't warn about a failed tentative parse. */
4455 }
4459 /* We have an Objective-C++ string literal. */
4466 {
4467 /* These two are the boolean literals. */
4475 /* The `__null' literal. */
4480 /* The `nullptr' literal. */
4485 /* Recognize the `this' keyword. */
4489 {
4493 }
4494 /* Pointers cannot appear in constant-expressions. */
4499 /* The `operator' keyword can be the beginning of an
4500 id-expression. */
4507 {
4508 non_integral_constant name;
4510 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4511 __func__ are the names of variables -- but they are
4512 treated specially. Therefore, they are handled here,
4513 rather than relying on the generic id-expression logic
4514 below. Grammatically, these names are id-expressions.
4516 Consume the token. */
4520 {
4532 }
4537 /* Look up the name. */
4539 }
4542 {
4543 tree expression;
4544 tree type;
4545 source_location type_location;
4547 /* The `__builtin_va_arg' construct is used to handle
4548 `va_arg'. Consume the `__builtin_va_arg' token. */
4550 /* Look for the opening `('. */
4552 /* Now, parse the assignment-expression. */
4554 /* Look for the `,'. */
4557 /* Parse the type-id. */
4559 /* Look for the closing `)'. */
4561 /* Using `va_arg' in a constant-expression is not
4562 allowed. */
4564 NIC_VA_ARG))
4567 }
4597 /* Objective-C++ expressions. */
4607 {
4612 }
4616 }
4618 /* An id-expression can start with either an identifier, a
4619 `::' as the beginning of a qualified-id, or the "operator"
4620 keyword. */
4625 {
4626 tree id_expression;
4627 tree decl;
4633 id_expression:
4634 /* Parse the id-expression. */
4635 id_expression
4652 /* If we have a template-id, then no further lookup is
4653 required. If the template-id was for a template-class, we
4654 will sometimes have a TYPE_DECL at this point. */
4658 /* Look up the name. */
4659 else
4660 {
4661 tree ambiguous_decls;
4663 /* If we already know that this lookup is ambiguous, then
4664 we've already issued an error message; there's no reason
4665 to check again. */
4668 {
4671 }
4674 none_type,
4675 template_p,
4680 /* If the lookup was ambiguous, an error will already have
4681 been issued. */
4685 /* In Objective-C++, we may have an Objective-C 2.0
4686 dot-syntax for classes here. */
4691 {
4692 tree component;
4699 }
4701 /* In Objective-C++, an instance variable (ivar) may be preferred
4702 to whatever cp_parser_lookup_name() found. */
4705 /* If name lookup gives us a SCOPE_REF, then the
4706 qualifying scope was dependent. */
4708 {
4709 /* At this point, we do not know if DECL is a valid
4710 integral constant expression. We assume that it is
4711 in fact such an expression, so that code like:
4713 template <int N> struct A {
4714 int a[B<N>::i];
4715 };
4717 is accepted. At template-instantiation time, we
4718 will check that B<N>::i is actually a constant. */
4720 }
4721 /* Check to see if DECL is a local variable in a context
4722 where that is forbidden. */
4725 {
4726 /* It might be that we only found DECL because we are
4727 trying to be generous with pre-ISO scoping rules.
4728 For example, consider:
4730 int i;
4731 void g() {
4732 for (int i = 0; i < 10; ++i) {}
4733 extern void f(int j = i);
4734 }
4736 Here, name look up will originally find the out
4737 of scope `i'. We need to issue a warning message,
4738 but then use the global `i'. */
4741 {
4744 decl);
4746 }
4747 }
4748 }
4750 decl = (finish_id_expression
4752 idk,
4757 template_arg_p,
4763 }
4765 /* Anything else is an error. */
4769 }
4770 }
4778 {
4781 }
4783 /* Parse an id-expression.
4785 id-expression:
4786 unqualified-id
4787 qualified-id
4789 qualified-id:
4790 :: [opt] nested-name-specifier template [opt] unqualified-id
4791 :: identifier
4792 :: operator-function-id
4793 :: template-id
4795 Return a representation of the unqualified portion of the
4796 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4797 a `::' or nested-name-specifier.
4799 Often, if the id-expression was a qualified-id, the caller will
4800 want to make a SCOPE_REF to represent the qualified-id. This
4801 function does not do this in order to avoid wastefully creating
4802 SCOPE_REFs when they are not required.
4804 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4805 `template' keyword.
4807 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4808 uninstantiated templates.
4810 If *TEMPLATE_P is non-NULL, it is set to true iff the
4811 `template' keyword is used to explicitly indicate that the entity
4812 named is a template.
4814 If DECLARATOR_P is true, the id-expression is appearing as part of
4815 a declarator, rather than as part of an expression. */
4817 static tree
4824 {
4828 /* Assume the `template' keyword was not used. */
4832 /* Look for the optional `::' operator. */
4833 global_scope_p
4836 /* Look for the optional nested-name-specifier. */
4837 nested_name_specifier_p
4840 check_dependency_p,
4842 declarator_p)
4844 /* If there is a nested-name-specifier, then we are looking at
4845 the first qualified-id production. */
4847 {
4848 tree saved_scope;
4849 tree saved_object_scope;
4850 tree saved_qualifying_scope;
4851 tree unqualified_id;
4854 /* See if the next token is the `template' keyword. */
4858 /* Name lookup we do during the processing of the
4859 unqualified-id might obliterate SCOPE. */
4863 /* Process the final unqualified-id. */
4865 check_dependency_p,
4866 declarator_p,
4868 /* Restore the SAVED_SCOPE for our caller. */
4874 }
4875 /* Otherwise, if we are in global scope, then we are looking at one
4876 of the other qualified-id productions. */
4878 {
4880 tree id;
4882 /* Peek at the next token. */
4885 /* If it's an identifier, and the next token is not a "<", then
4886 we can avoid the template-id case. This is an optimization
4887 for this common case. */
4889 && !cp_parser_nth_token_starts_template_argument_list_p
4894 /* Try a template-id. */
4898 none_type,
4899 declarator_p);
4900 /* If that worked, we're done. */
4904 /* Peek at the next token. (Changes in the token buffer may
4905 have invalidated the pointer obtained above.) */
4909 {
4916 /* Fall through. */
4921 }
4922 }
4923 else
4926 declarator_p,
4927 optional_p);
4928 }
4930 /* Parse an unqualified-id.
4932 unqualified-id:
4933 identifier
4934 operator-function-id
4935 conversion-function-id
4936 ~ class-name
4937 template-id
4939 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4940 keyword, in a construct like `A::template ...'.
4942 Returns a representation of unqualified-id. For the `identifier'
4943 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4944 production a BIT_NOT_EXPR is returned; the operand of the
4945 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4946 other productions, see the documentation accompanying the
4947 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4948 names are looked up in uninstantiated templates. If DECLARATOR_P
4949 is true, the unqualified-id is appearing as part of a declarator,
4950 rather than as part of an expression. */
4952 static tree
4958 {
4961 /* Peek at the next token. */
4965 {
4967 {
4968 tree id;
4970 /* We don't know yet whether or not this will be a
4971 template-id. */
4973 /* Try a template-id. */
4975 check_dependency_p,
4976 none_type,
4977 declarator_p);
4978 /* If it worked, we're done. */
4981 /* Otherwise, it's an ordinary identifier. */
4983 }
4987 check_dependency_p,
4988 none_type,
4989 declarator_p);
4992 {
4993 tree type_decl;
4994 tree qualifying_scope;
4995 tree object_scope;
4996 tree scope;
4999 /* Consume the `~' token. */
5001 /* Parse the class-name. The standard, as written, seems to
5002 say that:
5004 template <typename T> struct S { ~S (); };
5005 template <typename T> S<T>::~S() {}
5007 is invalid, since `~' must be followed by a class-name, but
5008 `S<T>' is dependent, and so not known to be a class.
5009 That's not right; we need to look in uninstantiated
5010 templates. A further complication arises from:
5012 template <typename T> void f(T t) {
5013 t.T::~T();
5014 }
5016 Here, it is not possible to look up `T' in the scope of `T'
5017 itself. We must look in both the current scope, and the
5018 scope of the containing complete expression.
5020 Yet another issue is:
5022 struct S {
5023 int S;
5024 ~S();
5025 };
5027 S::~S() {}
5029 The standard does not seem to say that the `S' in `~S'
5030 should refer to the type `S' and not the data member
5031 `S::S'. */
5033 /* DR 244 says that we look up the name after the "~" in the
5034 same scope as we looked up the qualifying name. That idea
5035 isn't fully worked out; it's more complicated than that. */
5040 /* Check for invalid scopes. */
5042 {
5046 }
5048 {
5052 scope);
5057 }
5060 /* If the name is of the form "X::~X" it's OK even if X is a
5061 typedef. */
5070 {
5073 }
5075 /* ~auto means the destructor of whatever the object is. */
5077 {
5080 "%<~auto%> only available with "
5084 }
5086 /* If there was an explicit qualification (S::~T), first look
5087 in the scope given by the qualification (i.e., S).
5089 Note: in the calls to cp_parser_class_name below we pass
5090 typename_type so that lookup finds the injected-class-name
5091 rather than the constructor. */
5095 {
5100 typename_type,
5103 declarator_p);
5106 }
5107 /* In "N::S::~S", look in "N" as well. */
5109 {
5114 type_decl
5118 typename_type,
5121 declarator_p);
5124 }
5125 /* In "p->S::~T", look in the scope given by "*p" as well. */
5127 {
5132 type_decl
5136 typename_type,
5139 declarator_p);
5142 }
5143 /* Look in the surrounding context. */
5145 {
5151 type_decl
5155 typename_type,
5158 declarator_p);
5161 {
5162 /* We couldn't find a type with this name, so just accept
5163 it and check for a match at instantiation time. */
5168 }
5169 }
5170 /* If an error occurred, assume that the name of the
5171 destructor is the same as the name of the qualifying
5172 class. That allows us to keep parsing after running
5173 into ill-formed destructor names. */
5179 /* Check that destructor name and scope match. */
5181 {
5188 }
5190 /* [class.dtor]
5192 A typedef-name that names a class shall not be used as the
5193 identifier in the declarator for a destructor declaration. */
5200 type_decl);
5203 }
5207 {
5208 tree id;
5210 /* This could be a template-id, so we try that first. */
5212 /* Try a template-id. */
5215 none_type,
5216 declarator_p);
5217 /* If that worked, we're done. */
5220 /* We still don't know whether we're looking at an
5221 operator-function-id or a conversion-function-id. */
5223 /* Try an operator-function-id. */
5225 /* If that didn't work, try a conversion-function-id. */
5229 {
5230 /* 17.6.3.3.5 */
5236 }
5239 }
5240 /* Fall through. */
5247 }
5248 }
5250 /* Parse an (optional) nested-name-specifier.
5252 nested-name-specifier: [C++98]
5253 class-or-namespace-name :: nested-name-specifier [opt]
5254 class-or-namespace-name :: template nested-name-specifier [opt]
5256 nested-name-specifier: [C++0x]
5257 type-name ::
5258 namespace-name ::
5259 nested-name-specifier identifier ::
5260 nested-name-specifier template [opt] simple-template-id ::
5262 PARSER->SCOPE should be set appropriately before this function is
5263 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5264 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5265 in name lookups.
5267 Sets PARSER->SCOPE to the class (TYPE) or namespace
5268 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5269 it unchanged if there is no nested-name-specifier. Returns the new
5270 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5272 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5273 part of a declaration and/or decl-specifier. */
5275 static tree
5281 {
5286 /* Remember where the nested-name-specifier starts. */
5288 {
5291 }
5294 {
5295 tree new_scope;
5296 tree old_scope;
5297 tree saved_qualifying_scope;
5300 /* Spot cases that cannot be the beginning of a
5301 nested-name-specifier. */
5304 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5305 the already parsed nested-name-specifier. */
5307 {
5308 /* Grab the nested-name-specifier and continue the loop. */
5310 /* If we originally encountered this nested-name-specifier
5311 with IS_DECLARATION set to false, we will not have
5312 resolved TYPENAME_TYPEs, so we must do so here. */
5315 {
5320 }
5323 }
5325 /* Spot cases that cannot be the beginning of a
5326 nested-name-specifier. On the second and subsequent times
5327 through the loop, we look for the `template' keyword. */
5329 ;
5330 /* A template-id can start a nested-name-specifier. */
5332 ;
5333 /* DR 743: decltype can be used in a nested-name-specifier. */
5335 ;
5336 else
5337 {
5338 /* If the next token is not an identifier, then it is
5339 definitely not a type-name or namespace-name. */
5342 /* If the following token is neither a `<' (to begin a
5343 template-id), nor a `::', then we are not looking at a
5344 nested-name-specifier. */
5350 {
5354 }
5357 && !cp_parser_nth_token_starts_template_argument_list_p
5360 }
5362 /* The nested-name-specifier is optional, so we parse
5363 tentatively. */
5366 /* Look for the optional `template' keyword, if this isn't the
5367 first time through the loop. */
5370 else
5373 /* Save the old scope since the name lookup we are about to do
5374 might destroy it. */
5377 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5378 look up names in "X<T>::I" in order to determine that "Y" is
5379 a template. So, if we have a typename at this point, we make
5380 an effort to look through it. */
5382 && !typename_keyword_p
5387 /* Parse the qualifying entity. */
5388 new_scope
5390 typename_keyword_p,
5391 template_keyword_p,
5392 check_dependency_p,
5393 type_p,
5394 is_declaration);
5395 /* Look for the `::' token. */
5398 /* If we found what we wanted, we keep going; otherwise, we're
5399 done. */
5401 {
5404 /* Restore the OLD_SCOPE since it was valid before the
5405 failed attempt at finding the last
5406 class-or-namespace-name. */
5410 /* If the next token is a decltype, and the one after that is a
5411 `::', then the decltype has failed to resolve to a class or
5412 enumeration type. Give this error even when parsing
5413 tentatively since it can't possibly be valid--and we're going
5414 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5415 won't get another chance.*/
5419 {
5426 /* As below. */
5429 }
5433 {
5434 /* If we have a non-type template-id followed by ::, it can't
5435 possibly be valid. */
5440 {
5443 {
5449 }
5450 else
5451 {
5452 /* Variable template. */
5457 }
5464 /* As below. */
5468 }
5469 }
5473 /* If the next token is an identifier, and the one after
5474 that is a `::', then any valid interpretation would have
5475 found a class-or-namespace-name. */
5481 {
5484 {
5486 {
5487 tree decl;
5488 tree ambiguous_decls;
5491 none_type,
5500 decl);
5502 {
5503 // cp_parser_lookup_name has the same diagnostic,
5504 // thus make sure to emit it at most once.
5507 {
5512 }
5514 }
5515 else
5516 {
5518 cp_parser_name_lookup_error
5521 else
5522 cp_parser_name_lookup_error
5525 }
5526 }
5529 /* Treat this as a successful nested-name-specifier
5530 due to:
5532 [basic.lookup.qual]
5534 If the name found is not a class-name (clause
5535 _class_) or namespace-name (_namespace.def_), the
5536 program is ill-formed. */
5538 }
5540 }
5542 }
5543 /* We've found one valid nested-name-specifier. */
5545 /* Name lookup always gives us a DECL. */
5548 /* Uses of "template" must be followed by actual templates. */
5560 new_scope);
5561 /* If it is a class scope, try to complete it; we are about to
5562 be looking up names inside the class. */
5564 /* Since checking types for dependency can be expensive,
5565 avoid doing it if the type is already complete. */
5567 /* Do not try to complete dependent types. */
5569 {
5571 /* If it is a typedef to current class, use the current
5572 class instead, as the typedef won't have any names inside
5573 it yet. */
5577 }
5578 /* Make sure we look in the right scope the next time through
5579 the loop. */
5581 }
5583 /* If parsing tentatively, replace the sequence of tokens that makes
5584 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5585 token. That way, should we re-parse the token stream, we will
5586 not have to repeat the effort required to do the parse, nor will
5587 we issue duplicate error messages. */
5589 {
5593 /* Reset the contents of the START token. */
5595 /* Retrieve any deferred checks. Do not pop this access checks yet
5596 so the memory will not be reclaimed during token replacing below. */
5604 /* Purge all subsequent tokens. */
5606 }
5612 }
5614 /* Parse a nested-name-specifier. See
5615 cp_parser_nested_name_specifier_opt for details. This function
5616 behaves identically, except that it will an issue an error if no
5617 nested-name-specifier is present. */
5619 static tree
5625 {
5626 tree scope;
5628 /* Look for the nested-name-specifier. */
5630 typename_keyword_p,
5631 check_dependency_p,
5632 type_p,
5633 is_declaration);
5634 /* If it was not present, issue an error message. */
5636 {
5639 }
5642 }
5644 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5645 this is either a class-name or a namespace-name (which corresponds
5646 to the class-or-namespace-name production in the grammar). For
5647 C++0x, it can also be a type-name that refers to an enumeration
5648 type or a simple-template-id.
5650 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5651 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5652 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5653 TYPE_P is TRUE iff the next name should be taken as a class-name,
5654 even the same name is declared to be another entity in the same
5655 scope.
5657 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5658 specified by the class-or-namespace-name. If neither is found the
5659 ERROR_MARK_NODE is returned. */
5661 static tree
5668 {
5669 tree saved_scope;
5670 tree saved_qualifying_scope;
5671 tree saved_object_scope;
5672 tree scope;
5676 /* DR 743: decltype can appear in a nested-name-specifier. */
5678 {
5682 {
5685 }
5689 }
5691 /* Before we try to parse the class-name, we must save away the
5692 current PARSER->SCOPE since cp_parser_class_name will destroy
5693 it. */
5697 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5698 there is no need to look for a namespace-name. */
5699 only_class_p = template_keyword_p
5704 typename_keyword_p,
5705 template_keyword_p,
5707 check_dependency_p,
5709 is_declaration,
5712 /* If that didn't work, try for a namespace-name. */
5714 {
5715 /* Restore the saved scope. */
5719 /* If we are not looking at an identifier followed by the scope
5720 resolution operator, then this is not part of a
5721 nested-name-specifier. (Note that this function is only used
5722 to parse the components of a nested-name-specifier.) */
5727 }
5730 }
5732 /* Return true if we are looking at a compound-literal, false otherwise. */
5734 static bool
5736 {
5737 /* Consume the `('. */
5742 /* Skip tokens until the next token is a closing parenthesis.
5743 If we find the closing `)', and the next token is a `{', then
5744 we are looking at a compound-literal. */
5745 bool compound_literal_p
5750 /* Roll back the tokens we skipped. */
5754 }
5756 /* Parse a postfix-expression.
5758 postfix-expression:
5759 primary-expression
5760 postfix-expression [ expression ]
5761 postfix-expression ( expression-list [opt] )
5762 simple-type-specifier ( expression-list [opt] )
5763 typename :: [opt] nested-name-specifier identifier
5764 ( expression-list [opt] )
5765 typename :: [opt] nested-name-specifier template [opt] template-id
5766 ( expression-list [opt] )
5767 postfix-expression . template [opt] id-expression
5768 postfix-expression -> template [opt] id-expression
5769 postfix-expression . pseudo-destructor-name
5770 postfix-expression -> pseudo-destructor-name
5771 postfix-expression ++
5772 postfix-expression --
5773 dynamic_cast < type-id > ( expression )
5774 static_cast < type-id > ( expression )
5775 reinterpret_cast < type-id > ( expression )
5776 const_cast < type-id > ( expression )
5777 typeid ( expression )
5778 typeid ( type-id )
5780 GNU Extension:
5782 postfix-expression:
5783 ( type-id ) { initializer-list , [opt] }
5785 This extension is a GNU version of the C99 compound-literal
5786 construct. (The C99 grammar uses `type-name' instead of `type-id',
5787 but they are essentially the same concept.)
5789 If ADDRESS_P is true, the postfix expression is the operand of the
5790 `&' operator. CAST_P is true if this expression is the target of a
5791 cast.
5793 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5794 class member access expressions [expr.ref].
5796 Returns a representation of the expression. */
5798 static tree
5802 {
5804 location_t loc;
5811 /* Peek at the next token. */
5814 /* Some of the productions are determined by keywords. */
5817 {
5822 {
5823 tree type;
5824 tree expression;
5828 /* All of these can be handled in the same way from the point
5829 of view of parsing. Begin by consuming the token
5830 identifying the cast. */
5833 /* New types cannot be defined in the cast. */
5835 parser->type_definition_forbidden_message
5838 /* Look for the opening `<'. */
5840 /* Parse the type to which we are casting. */
5845 /* Look for the closing `>'. */
5847 /* Restore the old message. */
5850 bool saved_greater_than_is_operator_p
5854 /* And the expression which is being cast. */
5859 parser->greater_than_is_operator_p
5862 /* Only type conversions to integral or enumeration types
5863 can be used in constant-expressions. */
5869 {
5871 postfix_expression
5875 postfix_expression
5879 postfix_expression
5881 tf_warning_or_error);
5884 postfix_expression
5889 }
5890 }
5894 {
5895 tree type;
5899 /* Consume the `typeid' token. */
5901 /* Look for the `(' token. */
5903 /* Types cannot be defined in a `typeid' expression. */
5905 parser->type_definition_forbidden_message
5907 /* We can't be sure yet whether we're looking at a type-id or an
5908 expression. */
5910 /* Try a type-id first. */
5915 /* Look for the `)' token. Otherwise, we can't be sure that
5916 we're not looking at an expression: consider `typeid (int
5917 (3))', for example. */
5919 /* If all went well, simply lookup the type-id. */
5922 /* Otherwise, fall back to the expression variant. */
5923 else
5924 {
5925 tree expression;
5927 /* Look for an expression. */
5929 /* Compute its typeid. */
5931 /* Look for the `)' token. */
5933 }
5934 /* Restore the saved message. */
5936 /* `typeid' may not appear in an integral constant expression. */
5939 }
5943 {
5944 tree type;
5945 /* The syntax permitted here is the same permitted for an
5946 elaborated-type-specifier. */
5951 }
5955 {
5959 {
5964 }
5966 {
5971 }
5972 else
5973 {
5974 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5977 }
5979 postfix_expression =
5983 {
5987 }
5989 {
5994 }
5995 else
5996 {
5998 postfix_expression);
6002 }
6004 }
6007 {
6010 tree p;
6024 tf_warning_or_error);
6027 tf_warning_or_error);
6028 else
6029 {
6033 }
6035 }
6038 {
6039 tree type;
6041 /* If the next thing is a simple-type-specifier, we may be
6042 looking at a functional cast. We could also be looking at
6043 an id-expression. So, we try the functional cast, and if
6044 that doesn't work we fall back to the primary-expression. */
6046 /* Look for the simple-type-specifier. */
6049 CP_PARSER_FLAGS_NONE);
6050 /* Parse the cast itself. */
6052 postfix_expression
6054 /* If that worked, we're done. */
6058 /* If the functional-cast didn't work out, try a
6059 compound-literal. */
6062 {
6067 /* Avoid calling cp_parser_type_id pointlessly, see comment
6068 in cp_parser_cast_expression about c++/29234. */
6071 else
6072 {
6073 /* Parse the type. */
6078 /* Look for the `)'. */
6080 }
6082 /* If things aren't going well, there's no need to
6083 keep going. */
6085 {
6087 /* Parse the brace-enclosed initializer list. */
6090 }
6091 /* If that worked, we're definitely looking at a
6092 compound-literal expression. */
6094 {
6095 /* Warn the user that a compound literal is not
6096 allowed in standard C++. */
6099 /* For simplicity, we disallow compound literals in
6100 constant-expressions. We could
6101 allow compound literals of integer type, whose
6102 initializer was a constant, in constant
6103 expressions. Permitting that usage, as a further
6104 extension, would not change the meaning of any
6105 currently accepted programs. (Of course, as
6106 compound literals are not part of ISO C++, the
6107 standard has nothing to say.) */
6109 NIC_NCC))
6110 {
6113 }
6114 /* Form the representation of the compound-literal. */
6115 postfix_expression
6117 tf_warning_or_error);
6119 }
6120 }
6122 /* It must be a primary-expression. */
6123 postfix_expression
6126 decltype_p,
6128 }
6130 }
6132 /* Note that we don't need to worry about calling build_cplus_new on a
6133 class-valued CALL_EXPR in decltype when it isn't the end of the
6134 postfix-expression; unary_complex_lvalue will take care of that for
6135 all these cases. */
6137 /* Keep looping until the postfix-expression is complete. */
6139 {
6143 /* It is not a Koenig lookup function call. */
6144 postfix_expression
6147 /* Peek at the next token. */
6151 {
6154 {
6156 "two consecutive %<[%> shall "
6159 }
6160 postfix_expression
6162 postfix_expression,
6164 decltype_p);
6170 /* postfix-expression ( expression-list [opt] ) */
6171 {
6181 is_builtin_constant_p
6184 {
6185 /* The whole point of __builtin_constant_p is to allow
6186 non-constant expressions to appear as arguments. */
6187 saved_integral_constant_expression_p
6189 saved_non_integral_constant_expression_p
6192 }
6193 args = (cp_parser_parenthesized_expression_list
6199 {
6200 parser->integral_constant_expression_p
6202 parser->non_integral_constant_expression_p
6204 }
6207 {
6210 }
6212 /* Function calls are not permitted in
6213 constant-expressions. */
6216 NIC_FUNC_CALL))
6217 {
6221 }
6226 {
6228 {
6230 {
6233 postfix_expression
6235 complain);
6236 }
6237 else
6238 postfix_expression
6240 }
6241 /* We do not perform argument-dependent lookup if
6242 normal lookup finds a non-function, in accordance
6243 with the expected resolution of DR 218. */
6246 {
6250 /* Do not do argument dependent lookup if regular
6251 lookup finds a member function or a block-scope
6252 function declaration. [basic.lookup.argdep]/3 */
6255 {
6258 postfix_expression
6260 complain);
6261 }
6262 }
6263 }
6266 {
6276 "%<memset%> used with constant zero length "
6277 "parameter; this could be due to transposed "
6280 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6281 to avoid leaking those into folder and middle-end. */
6283 tree arg;
6287 }
6290 {
6300 {
6301 postfix_expression
6305 }
6308 {
6309 postfix_expression
6310 = (build_new_method_call
6316 complain));
6317 }
6318 else
6319 postfix_expression
6323 complain);
6324 }
6328 postfix_expression = (build_offset_ref_call_from_tree
6330 complain));
6332 /* A call to a static class member, or a namespace-scope
6333 function. */
6334 postfix_expression
6337 koenig_p,
6338 complain);
6339 else
6340 /* All other function calls. */
6341 postfix_expression
6344 koenig_p,
6345 complain);
6349 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6353 }
6358 /* postfix-expression . template [opt] id-expression
6359 postfix-expression . pseudo-destructor-name
6360 postfix-expression -> template [opt] id-expression
6361 postfix-expression -> pseudo-destructor-name */
6363 /* Consume the `.' or `->' operator. */
6366 postfix_expression
6368 postfix_expression,
6375 /* postfix-expression ++ */
6376 /* Consume the `++' token. */
6378 /* Generate a representation for the complete expression. */
6379 postfix_expression
6381 POSTINCREMENT_EXPR);
6382 /* Increments may not appear in constant-expressions. */
6390 /* postfix-expression -- */
6391 /* Consume the `--' token. */
6393 /* Generate a representation for the complete expression. */
6394 postfix_expression
6396 POSTDECREMENT_EXPR);
6397 /* Decrements may not appear in constant-expressions. */
6409 else
6411 }
6412 }
6414 /* We should never get here. */
6417 }
6419 /* This function parses Cilk Plus array notations. If a normal array expr. is
6420 parsed then the array index is passed back to the caller through *INIT_INDEX
6421 and the function returns a NULL_TREE. If array notation expr. is parsed,
6422 then *INIT_INDEX is ignored by the caller and the function returns
6423 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6424 error_mark_node. */
6426 static tree
6428 tree array_value)
6429 {
6433 {
6436 }
6445 {
6448 }
6450 {
6451 /* Consume the ':'. */
6454 /* If we are here, then we have a case like this A[:]. */
6456 {
6460 }
6464 }
6465 else
6466 {
6467 /* If we are here, then there are three valid possibilities:
6468 1. ARRAY [ EXP ]
6469 2. ARRAY [ EXP : EXP ]
6470 3. ARRAY [ EXP : EXP : EXP ] */
6474 {
6475 /* This indicates that we have a normal array expression. */
6478 }
6480 /* Consume the ':'. */
6484 {
6487 }
6488 }
6493 {
6497 }
6503 }
6505 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6506 by cp_parser_builtin_offsetof. We're looking for
6508 postfix-expression [ expression ]
6509 postfix-expression [ braced-init-list ] (C++11)
6511 FOR_OFFSETOF is set if we're being called in that context, which
6512 changes how we deal with integer constant expressions. */
6514 static tree
6516 tree postfix_expression,
6519 {
6524 /* Consume the `[' token. */
6530 /* Parse the index expression. */
6531 /* ??? For offsetof, there is a question of what to allow here. If
6532 offsetof is not being used in an integral constant expression context,
6533 then we *could* get the right answer by computing the value at runtime.
6534 If we are in an integral constant expression context, then we might
6535 could accept any constant expression; hard to say without analysis.
6536 Rather than open the barn door too wide right away, allow only integer
6537 constant expressions here. */
6540 else
6541 {
6543 {
6550 {
6552 "braced list index is not allowed with array "
6556 }
6557 }
6559 {
6560 /* Here are have these two options:
6561 ARRAY[EXP : EXP] - Array notation expr with default
6562 stride of 1.
6563 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6564 stride. */
6566 postfix_expression);
6569 }
6570 else
6572 }
6576 /* Look for the closing `]'. */
6579 /* Build the ARRAY_REF. */
6583 /* When not doing offsetof, array references are not permitted in
6584 constant-expressions. */
6590 }
6592 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6593 by cp_parser_builtin_offsetof. We're looking for
6595 postfix-expression . template [opt] id-expression
6596 postfix-expression . pseudo-destructor-name
6597 postfix-expression -> template [opt] id-expression
6598 postfix-expression -> pseudo-destructor-name
6600 FOR_OFFSETOF is set if we're being called in that context. That sorta
6601 limits what of the above we'll actually accept, but nevermind.
6602 TOKEN_TYPE is the "." or "->" token, which will already have been
6603 removed from the stream. */
6605 static tree
6608 tree postfix_expression,
6610 location_t location)
6611 {
6612 tree name;
6617 /* If this is a `->' operator, dereference the pointer. */
6620 tf_warning_or_error);
6621 /* Check to see whether or not the expression is type-dependent. */
6623 /* The identifier following the `->' or `.' is not qualified. */
6629 /* Enter the scope corresponding to the type of the object
6630 given by the POSTFIX_EXPRESSION. */
6632 {
6634 /* According to the standard, no expression should ever have
6635 reference type. Unfortunately, we do not currently match
6636 the standard in this respect in that our internal representation
6637 of an expression may have reference type even when the standard
6638 says it does not. Therefore, we have to manually obtain the
6639 underlying type here. */
6641 /* The type of the POSTFIX_EXPRESSION must be complete. */
6643 {
6645 postfix_expression);
6647 }
6648 /* Unlike the object expression in other contexts, *this is not
6649 required to be of complete type for purposes of class member
6650 access (5.2.5) outside the member function body. */
6654 /* Let the name lookup machinery know that we are processing a
6655 class member access expression. */
6657 /* If something went wrong, we want to be able to discern that case,
6658 as opposed to the case where there was no SCOPE due to the type
6659 of expression being dependent. */
6662 /* If the SCOPE was erroneous, make the various semantic analysis
6663 functions exit quickly -- and without issuing additional error
6664 messages. */
6667 }
6669 /* Assume this expression is not a pseudo-destructor access. */
6672 /* If the SCOPE is a scalar type, then, if this is a valid program,
6673 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6674 is type dependent, it can be pseudo-destructor-name or something else.
6675 Try to parse it as pseudo-destructor-name first. */
6677 {
6678 tree s;
6679 tree type;
6682 /* Parse the pseudo-destructor-name. */
6691 {
6693 postfix_expression
6696 }
6697 }
6700 {
6701 /* If the SCOPE is not a scalar type, we are looking at an
6702 ordinary class member access expression, rather than a
6703 pseudo-destructor-name. */
6706 /* Parse the id-expression. */
6707 name = (cp_parser_id_expression
6714 /* In general, build a SCOPE_REF if the member name is qualified.
6715 However, if the name was not dependent and has already been
6716 resolved; there is no need to build the SCOPE_REF. For example;
6718 struct X { void f(); };
6719 template <typename T> void f(T* t) { t->X::f(); }
6721 Even though "t" is dependent, "X::f" is not and has been resolved
6722 to a BASELINK; there is no need to include scope information. */
6724 /* But we do need to remember that there was an explicit scope for
6725 virtual function calls. */
6729 /* If the name is a template-id that names a type, we will get a
6730 TYPE_DECL here. That is invalid code. */
6732 {
6735 }
6736 else
6737 {
6739 {
6741 {
6745 }
6746 else
6749 name,
6750 template_p);
6754 }
6756 adjust_result_of_qualified_name_lookup
6758 postfix_expression
6760 template_p,
6761 tf_warning_or_error);
6762 }
6763 }
6765 /* We no longer need to look up names in the scope of the object on
6766 the left-hand side of the `.' or `->' operator. */
6769 /* Outside of offsetof, these operators may not appear in
6770 constant-expressions. */
6772 && (cp_parser_non_integral_constant_expression
6777 }
6779 /* Cache of LITERAL_ZERO_P constants. */
6783 /* Parse a parenthesized expression-list.
6785 expression-list:
6786 assignment-expression
6787 expression-list, assignment-expression
6789 attribute-list:
6790 expression-list
6791 identifier
6792 identifier, expression-list
6794 CAST_P is true if this expression is the target of a cast.
6796 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6797 argument pack.
6799 Returns a vector of trees. Each element is a representation of an
6800 assignment-expression. NULL is returned if the ( and or ) are
6801 missing. An empty, but allocated, vector is returned on no
6802 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6803 if we are parsing an attribute list for an attribute that wants a
6804 plain identifier argument, normal_attr for an attribute that wants
6805 an expression, or non_attr if we aren't parsing an attribute list. If
6806 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6807 not all of the expressions in the list were constant.
6808 WANT_LITERAL_ZERO_P is true if the caller is interested in
6809 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6810 immediately, this can be removed. */
6819 {
6825 /* Assume all the expressions will be constant. */
6834 /* Within a parenthesized expression, a `>' token is always
6835 the greater-than operator. */
6836 saved_greater_than_is_operator_p
6840 /* Consume expressions until there are no more. */
6843 {
6844 tree expr;
6846 /* At the beginning of attribute lists, check to see if the
6847 next token is an identifier. */
6850 {
6853 /* Consume the identifier. */
6855 /* Save the identifier. */
6857 }
6858 else
6859 {
6862 /* Parse the next assignment-expression. */
6864 {
6865 /* A braced-init-list. */
6871 }
6873 {
6874 expr = (cp_parser_constant_expression
6879 }
6880 else
6881 {
6885 {
6892 /* If a parameter is literal zero alone, remember it
6893 for -Wmemset-transposed-args warning. */
6896 && want_literal_zero_p
6898 == CPP_COMMA
6901 {
6908 else
6909 {
6914 }
6915 /* Consume the 0 token (or '\0', 0LL etc.). */
6917 }
6921 }
6924 cast_p);
6925 }
6930 /* If we have an ellipsis, then this is an expression
6931 expansion. */
6934 {
6935 /* Consume the `...'. */
6938 /* Build the argument pack. */
6940 }
6942 /* Add it to the list. We add error_mark_node
6943 expressions to the list, so that we can still tell if
6944 the correct form for a parenthesized expression-list
6945 is found. That gives better errors. */
6950 }
6952 /* After the first item, attribute lists look the same as
6953 expression lists. */
6956 get_comma:;
6957 /* If the next token isn't a `,', then we are done. */
6961 /* Otherwise, consume the `,' and keep going. */
6963 }
6966 {
6969 skip_comma:;
6970 /* We try and resync to an unnested comma, as that will give the
6971 user better diagnostics. */
6979 {
6980 parser->greater_than_is_operator_p
6983 }
6984 }
6986 parser->greater_than_is_operator_p
6993 }
6995 /* Parse a pseudo-destructor-name.
6997 pseudo-destructor-name:
6998 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6999 :: [opt] nested-name-specifier template template-id :: ~ type-name
7000 :: [opt] nested-name-specifier [opt] ~ type-name
7002 If either of the first two productions is used, sets *SCOPE to the
7003 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7004 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7005 or ERROR_MARK_NODE if the parse fails. */
7007 static void
7009 tree object,
7012 {
7015 /* Handle ~auto. */
7019 {
7022 "%<~auto%> only available with "
7029 }
7031 /* Assume that things will not work out. */
7034 /* Look for the optional `::' operator. */
7036 /* Look for the optional nested-name-specifier. */
7037 nested_name_specifier_p
7044 /* Now, if we saw a nested-name-specifier, we might be doing the
7045 second production. */
7048 {
7049 /* Consume the `template' keyword. */
7051 /* Parse the template-id. */
7055 class_type,
7057 /* Look for the `::' token. */
7059 }
7060 /* If the next token is not a `~', then there might be some
7061 additional qualification. */
7063 {
7064 /* At this point, we're looking for "type-name :: ~". The type-name
7065 must not be a class-name, since this is a pseudo-destructor. So,
7066 it must be either an enum-name, or a typedef-name -- both of which
7067 are just identifiers. So, we peek ahead to check that the "::"
7068 and "~" tokens are present; if they are not, then we can avoid
7069 calling type_name. */
7073 {
7076 }
7078 /* Look for the type-name. */
7083 /* Look for the `::' token. */
7085 }
7086 else
7089 /* Look for the `~'. */
7092 /* Once we see the ~, this has to be a pseudo-destructor. */
7096 /* Look for the type-name again. We are not responsible for
7097 checking that it matches the first type-name. */
7099 }
7101 /* Parse a unary-expression.
7103 unary-expression:
7104 postfix-expression
7105 ++ cast-expression
7106 -- cast-expression
7107 unary-operator cast-expression
7108 sizeof unary-expression
7109 sizeof ( type-id )
7110 alignof ( type-id ) [C++0x]
7111 new-expression
7112 delete-expression
7114 GNU Extensions:
7116 unary-expression:
7117 __extension__ cast-expression
7118 __alignof__ unary-expression
7119 __alignof__ ( type-id )
7120 alignof unary-expression [C++0x]
7121 __real__ cast-expression
7122 __imag__ cast-expression
7123 && identifier
7124 sizeof ( type-id ) { initializer-list , [opt] }
7125 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7126 __alignof__ ( type-id ) { initializer-list , [opt] }
7128 ADDRESS_P is true iff the unary-expression is appearing as the
7129 operand of the `&' operator. CAST_P is true if this expression is
7130 the target of a cast.
7132 Returns a representation of the expression. */
7134 static tree
7137 {
7141 /* Peek at the next token. */
7143 /* Some keywords give away the kind of expression. */
7145 {
7149 {
7152 {
7155 location_t first_loc;
7158 /* Consume the token. */
7161 /* Parse the operand. */
7166 else
7167 {
7168 /* ISO C++ defines alignof only with types, not with
7169 expressions. So pedwarn if alignof is used with a non-
7170 type expression. However, __alignof__ is ok. */
7173 "ISO C++ does not allow %<alignof%> "
7177 }
7178 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7179 SIZEOF_EXPR with the original operand. */
7181 {
7183 {
7185 {
7188 error_mark_node));
7190 }
7191 else
7195 }
7197 }
7199 }
7208 {
7209 /* The saved value of the PEDANTIC flag. */
7211 tree expr;
7213 /* Save away the PEDANTIC flag. */
7215 /* Parse the cast-expression. */
7217 /* Restore the PEDANTIC flag. */
7221 }
7225 {
7226 tree expression;
7228 /* Consume the `__real__' or `__imag__' token. */
7230 /* Parse the cast-expression. */
7232 /* Create the complete representation. */
7236 expression,
7237 tf_warning_or_error);
7238 }
7246 {
7247 tree expr;
7257 parser->type_definition_forbidden_message
7260 saved_integral_constant_expression_p
7262 saved_non_integral_constant_expression_p
7266 saved_greater_than_is_operator_p
7278 parser->greater_than_is_operator_p
7281 parser->integral_constant_expression_p
7283 parser->non_integral_constant_expression_p
7290 }
7294 }
7295 }
7297 /* Look for the `:: new' and `:: delete', which also signal the
7298 beginning of a new-expression, or delete-expression,
7299 respectively. If the next token is `::', then it might be one of
7300 these. */
7302 {
7305 /* See if the token after the `::' is one of the keywords in
7306 which we're interested. */
7308 /* If it's `new', we have a new-expression. */
7311 /* Similarly, for `delete'. */
7314 }
7316 /* Look for a unary operator. */
7318 /* The `++' and `--' operators can be handled similarly, even though
7319 they are not technically unary-operators in the grammar. */
7321 {
7326 /* Handle the GNU address-of-label extension. */
7329 {
7330 tree identifier;
7331 tree expression;
7334 /* Consume the '&&' token. */
7336 /* Look for the identifier. */
7338 /* Create an expression representing the address. */
7341 NIC_ADDR_LABEL))
7344 }
7345 }
7347 {
7348 tree cast_expression;
7354 /* Consume the operator token. */
7356 /* Parse the cast-expression. */
7357 cast_expression
7362 pidk);
7363 /* Now, build an appropriate representation. */
7365 {
7369 RO_UNARY_STAR,
7370 complain);
7375 /* Fall through. */
7378 cast_expression,
7379 complain);
7386 /* Fall through. */
7396 }
7400 non_constant_p))
7404 }
7408 decltype_p,
7409 pidk);
7410 }
7412 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7413 unary-operator, the corresponding tree code is returned. */
7415 static enum tree_code
7417 {
7419 {
7440 }
7441 }
7443 /* Parse a new-expression.
7445 new-expression:
7446 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7447 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7449 Returns a representation of the expression. */
7451 static tree
7453 {
7456 tree type;
7459 tree ret;
7461 /* Look for the optional `::' operator. */
7462 global_scope_p
7466 /* Look for the `new' operator. */
7468 /* There's no easy way to tell a new-placement from the
7469 `( type-id )' construct. */
7471 /* Look for a new-placement. */
7473 /* If that didn't work out, there's no new-placement. */
7475 {
7479 }
7481 /* If the next token is a `(', then we have a parenthesized
7482 type-id. */
7484 {
7488 /* Consume the `('. */
7491 /* Parse the type-id. */
7492 parser->type_definition_forbidden_message
7497 /* Look for the closing `)'. */
7500 /* There should not be a direct-new-declarator in this production,
7501 but GCC used to allowed this, so we check and emit a sensible error
7502 message for this case. */
7504 {
7510 }
7511 }
7512 /* Otherwise, there must be a new-type-id. */
7513 else
7516 /* If the next token is a `(' or '{', then we have a new-initializer. */
7520 else
7523 /* A new-expression may not appear in an integral constant
7524 expression. */
7527 else
7528 {
7529 /* Create a representation of the new-expression. */
7531 tf_warning_or_error);
7532 }
7540 }
7542 /* Parse a new-placement.
7544 new-placement:
7545 ( expression-list )
7547 Returns the same representation as for an expression-list. */
7551 {
7554 /* Parse the expression-list. */
7555 expression_list = (cp_parser_parenthesized_expression_list
7564 }
7566 /* Parse a new-type-id.
7568 new-type-id:
7569 type-specifier-seq new-declarator [opt]
7571 Returns the TYPE allocated. If the new-type-id indicates an array
7572 type, *NELTS is set to the number of elements in the last array
7573 bound; the TYPE will not include the last array bound. */
7575 static tree
7577 {
7578 cp_decl_specifier_seq type_specifier_seq;
7584 /* The type-specifier sequence must not contain type definitions.
7585 (It cannot contain declarations of new types either, but if they
7586 are not definitions we will catch that because they are not
7587 complete.) */
7589 parser->type_definition_forbidden_message
7591 /* Parse the type-specifier-seq. */
7595 /* Restore the old message. */
7601 /* Parse the new-declarator. */
7604 /* Determine the number of elements in the last array dimension, if
7605 any. */
7607 /* Skip down to the last array dimension. */
7612 {
7615 }
7620 {
7623 }
7626 {
7633 else
7635 }
7638 }
7640 /* Parse an (optional) new-declarator.
7642 new-declarator:
7643 ptr-operator new-declarator [opt]
7644 direct-new-declarator
7646 Returns the declarator. */
7650 {
7653 cp_cv_quals cv_quals;
7655 /* We don't know if there's a ptr-operator next, or not. */
7657 /* Look for a ptr-operator. */
7659 /* If that worked, look for more new-declarators. */
7661 {
7664 /* Parse another optional declarator. */
7667 declarator = cp_parser_make_indirect_declarator
7671 }
7673 /* If the next token is a `[', there is a direct-new-declarator. */
7678 }
7680 /* Parse a direct-new-declarator.
7682 direct-new-declarator:
7683 [ expression ]
7684 direct-new-declarator [constant-expression]
7686 */
7690 {
7694 {
7695 tree expression;
7698 /* Look for the opening `['. */
7703 /* The standard requires that the expression have integral
7704 type. DR 74 adds enumeration types. We believe that the
7705 real intent is that these expressions be handled like the
7706 expression in a `switch' condition, which also allows
7707 classes with a single conversion to integral or
7708 enumeration type. */
7710 {
7711 expression
7713 expression,
7716 {
7718 "expression in new-declarator must have integral "
7721 }
7722 }
7724 /* Look for the closing `]'. */
7727 /* Add this bound to the declarator. */
7730 /* If the next token is not a `[', then there are no more
7731 bounds. */
7734 }
7737 }
7739 /* Parse a new-initializer.
7741 new-initializer:
7742 ( expression-list [opt] )
7743 braced-init-list
7745 Returns a representation of the expression-list. */
7749 {
7753 {
7754 tree t;
7761 }
7762 else
7763 expression_list = (cp_parser_parenthesized_expression_list
7769 }
7771 /* Parse a delete-expression.
7773 delete-expression:
7774 :: [opt] delete cast-expression
7775 :: [opt] delete [ ] cast-expression
7777 Returns a representation of the expression. */
7779 static tree
7781 {
7784 tree expression;
7786 /* Look for the optional `::' operator. */
7787 global_scope_p
7791 /* Look for the `delete' keyword. */
7793 /* See if the array syntax is in use. */
7795 {
7796 /* Consume the `[' token. */
7798 /* Look for the `]' token. */
7800 /* Remember that this is the `[]' construct. */
7802 }
7803 else
7806 /* Parse the cast-expression. */
7809 /* A delete-expression may not appear in an integral constant
7810 expression. */
7815 tf_warning_or_error);
7816 }
7818 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7819 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7820 0 otherwise. */
7822 static int
7824 {
7827 {
7869 /* In ((type ()) () the last () isn't a valid cast-expression,
7870 so the whole must be parsed as postfix-expression. */
7875 /* '[' may start a primary-expression in obj-c++ and in C++11,
7876 as a lambda-expression, eg, '(void)[]{}'. */
7883 /* '++' and '--' may or may not start a cast-expression:
7885 struct T { void operator++(int); };
7886 void f() { (T())++; }
7888 vs
7890 int a;
7891 (int)++a; */
7896 }
7897 }
7899 /* Parse a cast-expression.
7901 cast-expression:
7902 unary-expression
7903 ( type-id ) cast-expression
7905 ADDRESS_P is true iff the unary-expression is appearing as the
7906 operand of the `&' operator. CAST_P is true if this expression is
7907 the target of a cast.
7909 Returns a representation of the expression. */
7911 static tree
7914 {
7915 /* If it's a `(', then we might be looking at a cast. */
7917 {
7923 /* There's no way to know yet whether or not this is a cast.
7924 For example, `(int (3))' is a unary-expression, while `(int)
7925 3' is a cast. So, we resort to parsing tentatively. */
7927 /* Types may not be defined in a cast. */
7929 parser->type_definition_forbidden_message
7931 /* Consume the `('. */
7933 /* A very tricky bit is that `(struct S) { 3 }' is a
7934 compound-literal (which we permit in C++ as an extension).
7935 But, that construct is not a cast-expression -- it is a
7936 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7937 is legal; if the compound-literal were a cast-expression,
7938 you'd need an extra set of parentheses.) But, if we parse
7939 the type-id, and it happens to be a class-specifier, then we
7940 will commit to the parse at that point, because we cannot
7941 undo the action that is done when creating a new class. So,
7942 then we cannot back up and do a postfix-expression.
7944 Another tricky case is the following (c++/29234):
7946 struct S { void operator () (); };
7948 void foo ()
7949 {
7950 ( S()() );
7951 }
7953 As a type-id we parse the parenthesized S()() as a function
7954 returning a function, groktypename complains and we cannot
7955 back up in this case either.
7957 Therefore, we scan ahead to the closing `)', and check to see
7958 if the tokens after the `)' can start a cast-expression. Otherwise
7959 we are dealing with an unary-expression, a postfix-expression
7960 or something else.
7962 Yet another tricky case, in C++11, is the following (c++/54891):
7964 (void)[]{};
7966 The issue is that usually, besides the case of lambda-expressions,
7967 the parenthesized type-id cannot be followed by '[', and, eg, we
7968 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7969 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7970 we don't commit, we try a cast-expression, then an unary-expression.
7972 Save tokens so that we can put them back. */
7975 /* We may be looking at a cast-expression. */
7978 cast_expression
7981 /* Roll back the tokens we skipped. */
7983 /* If we aren't looking at a cast-expression, simulate an error so
7984 that the call to cp_parser_error_occurred below returns true. */
7987 else
7988 {
7991 /* Look for the type-id. */
7993 /* Look for the closing `)'. */
7996 }
7998 /* Restore the saved message. */
8001 /* At this point this can only be either a cast or a
8002 parenthesized ctor such as `(T ())' that looks like a cast to
8003 function returning T. */
8005 {
8006 /* Only commit if the cast-expression doesn't start with
8007 '++', '--', or '[' in C++11. */
8015 pidk);
8018 {
8019 /* Warn about old-style casts, if so requested. */
8026 /* Only type conversions to integral or enumeration types
8027 can be used in constant-expressions. */
8030 NIC_CAST))
8033 /* Perform the cast. */
8036 }
8037 }
8038 else
8040 }
8042 /* If we get here, then it's not a cast, so it must be a
8043 unary-expression. */
8046 }
8048 /* Parse a binary expression of the general form:
8050 pm-expression:
8051 cast-expression
8052 pm-expression .* cast-expression
8053 pm-expression ->* cast-expression
8055 multiplicative-expression:
8056 pm-expression
8057 multiplicative-expression * pm-expression
8058 multiplicative-expression / pm-expression
8059 multiplicative-expression % pm-expression
8061 additive-expression:
8062 multiplicative-expression
8063 additive-expression + multiplicative-expression
8064 additive-expression - multiplicative-expression
8066 shift-expression:
8067 additive-expression
8068 shift-expression << additive-expression
8069 shift-expression >> additive-expression
8071 relational-expression:
8072 shift-expression
8073 relational-expression < shift-expression
8074 relational-expression > shift-expression
8075 relational-expression <= shift-expression
8076 relational-expression >= shift-expression
8078 GNU Extension:
8080 relational-expression:
8081 relational-expression <? shift-expression
8082 relational-expression >? shift-expression
8084 equality-expression:
8085 relational-expression
8086 equality-expression == relational-expression
8087 equality-expression != relational-expression
8089 and-expression:
8090 equality-expression
8091 and-expression & equality-expression
8093 exclusive-or-expression:
8094 and-expression
8095 exclusive-or-expression ^ and-expression
8097 inclusive-or-expression:
8098 exclusive-or-expression
8099 inclusive-or-expression | exclusive-or-expression
8101 logical-and-expression:
8102 inclusive-or-expression
8103 logical-and-expression && inclusive-or-expression
8105 logical-or-expression:
8106 logical-and-expression
8107 logical-or-expression || logical-and-expression
8109 All these are implemented with a single function like:
8111 binary-expression:
8112 simple-cast-expression
8113 binary-expression <token> binary-expression
8115 CAST_P is true if this expression is the target of a cast.
8117 The binops_by_token map is used to get the tree codes for each <token> type.
8118 binary-expressions are associated according to a precedence table. */
8120 #define TOKEN_PRECEDENCE(token) \
8121 (((token->type == CPP_GREATER \
8122 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8123 && !parser->greater_than_is_operator_p) \
8124 ? PREC_NOT_OPERATOR \
8125 : binops_by_token[token->type].prec)
8127 static tree
8133 {
8134 cp_parser_expression_stack stack;
8136 cp_parser_expression_stack_entry current;
8137 tree rhs;
8141 tree overload;
8143 /* Parse the first expression. */
8154 {
8155 /* Get an operator token. */
8161 {
8163 "%<>>%> operator is treated"
8167 }
8171 /* Popping an entry off the stack means we completed a subexpression:
8172 - either we found a token which is not an operator (`>' where it is not
8173 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8174 will happen repeatedly;
8175 - or, we found an operator which has lower priority. This is the case
8176 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8177 parsing `3 * 4'. */
8179 {
8182 else
8184 }
8186 get_rhs:
8190 /* We used the operator token. */
8193 /* For "false && x" or "true || x", x will never be executed;
8194 disable warnings while evaluating it. */
8200 /* Extract another operand. It may be the RHS of this expression
8201 or the LHS of a new, higher priority expression. */
8206 /* Get another operator token. Look up its precedence to avoid
8207 building a useless (immediately popped) stack entry for common
8208 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8212 {
8213 /* ... and prepare to parse the RHS of the new, higher priority
8214 expression. Since precedence levels on the stack are
8215 monotonically increasing, we do not have to care about
8216 stack overflows. */
8225 pop:
8227 /* If the stack is not empty, we have parsed into LHS the right side
8228 (`4' in the example above) of an expression we had suspended.
8229 We can use the information on the stack to recover the LHS (`3')
8230 from the stack together with the tree code (`MULT_EXPR'), and
8231 the precedence of the higher level subexpression
8232 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8233 which will be used to actually build the additive expression. */
8238 }
8240 /* Undo the disabling of warnings done above. */
8249 /* Avoid warning for !!x == y. */
8254 /* Avoid warning for !b == y where b is boolean. */
8258 /* Avoid warning for !!b == y where b is boolean. */
8266 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8267 ERROR_MARK for everything that is not a binary expression.
8268 This makes warn_about_parentheses miss some warnings that
8269 involve unary operators. For unary expressions we should
8270 pass the correct tree_code unless the unary expression was
8271 surrounded by parentheses.
8272 */
8278 == tcc_comparison
8281 else
8290 /* If the binary operator required the use of an overloaded operator,
8291 then this expression cannot be an integral constant-expression.
8292 An overloaded operator can be used even if both operands are
8293 otherwise permissible in an integral constant-expression if at
8294 least one of the operands is of enumeration type. */
8298 NIC_OVERLOADED))
8300 }
8303 }
8305 static tree
8310 {
8313 }
8315 /* Parse the `? expression : assignment-expression' part of a
8316 conditional-expression. The LOGICAL_OR_EXPR is the
8317 logical-or-expression that started the conditional-expression.
8318 Returns a representation of the entire conditional-expression.
8320 This routine is used by cp_parser_assignment_expression.
8322 ? expression : assignment-expression
8324 GNU Extensions:
8326 ? : assignment-expression */
8328 static tree
8330 {
8331 tree expr;
8332 tree assignment_expr;
8336 /* Consume the `?' token. */
8341 {
8344 /* Implicit true clause. */
8348 }
8349 else
8350 {
8353 /* Parse the expression. */
8356 c_inhibit_evaluation_warnings +=
8360 }
8362 /* The next token should be a `:'. */
8364 /* Parse the assignment-expression. */
8368 /* Build the conditional-expression. */
8370 expr,
8371 assignment_expr,
8372 tf_warning_or_error);
8373 }
8375 /* Parse an assignment-expression.
8377 assignment-expression:
8378 conditional-expression
8379 logical-or-expression assignment-operator assignment_expression
8380 throw-expression
8382 CAST_P is true if this expression is the target of a cast.
8383 DECLTYPE_P is true if this expression is the operand of decltype.
8385 Returns a representation for the expression. */
8387 static tree
8390 {
8391 tree expr;
8393 /* If the next token is the `throw' keyword, then we're looking at
8394 a throw-expression. */
8397 /* Otherwise, it must be that we are looking at a
8398 logical-or-expression. */
8399 else
8400 {
8401 /* Parse the binary expressions (logical-or-expression). */
8403 decltype_p,
8405 /* If the next token is a `?' then we're actually looking at a
8406 conditional-expression. */
8409 else
8410 {
8413 /* If it's an assignment-operator, we're using the second
8414 production. */
8415 enum tree_code assignment_operator
8418 {
8420 location_t saved_input_location;
8422 /* Parse the right-hand side of the assignment. */
8428 /* An assignment may not appear in a
8429 constant-expression. */
8431 NIC_ASSIGNMENT))
8433 /* Build the assignment expression. Its default
8434 location is the location of the '=' token. */
8438 assignment_operator,
8439 rhs,
8442 }
8443 }
8444 }
8447 }
8449 /* Parse an (optional) assignment-operator.
8451 assignment-operator: one of
8452 = *= /= %= += -= >>= <<= &= ^= |=
8454 GNU Extension:
8456 assignment-operator: one of
8457 <?= >?=
8459 If the next token is an assignment operator, the corresponding tree
8460 code is returned, and the token is consumed. For example, for
8461 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8462 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8463 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8464 operator, ERROR_MARK is returned. */
8466 static enum tree_code
8468 {
8472 /* Peek at the next token. */
8476 {
8522 /* Nothing else is an assignment operator. */
8524 }
8526 /* If it was an assignment operator, consume it. */
8531 }
8533 /* Parse an expression.
8535 expression:
8536 assignment-expression
8537 expression , assignment-expression
8539 CAST_P is true if this expression is the target of a cast.
8540 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8541 except possibly parenthesized or on the RHS of a comma (N3276).
8543 Returns a representation of the expression. */
8545 static tree
8548 {
8553 {
8554 tree assignment_expression;
8556 /* Parse the next assignment-expression. */
8557 assignment_expression
8560 /* We don't create a temporary for a call that is the immediate operand
8561 of decltype or on the RHS of a comma. But when we see a comma, we
8562 need to create a temporary for a call on the LHS. */
8567 assignment_expression
8571 /* If this is the first assignment-expression, we can just
8572 save it away. */
8575 else
8577 assignment_expression,
8579 /* If the next token is not a comma, then we are done with the
8580 expression. */
8583 /* Consume the `,'. */
8586 /* A comma operator cannot appear in a constant-expression. */
8589 }
8592 }
8594 /* Parse a constant-expression.
8596 constant-expression:
8597 conditional-expression
8599 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8600 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8601 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8602 is false, NON_CONSTANT_P should be NULL. */
8604 static tree
8608 {
8612 tree expression;
8614 /* It might seem that we could simply parse the
8615 conditional-expression, and then check to see if it were
8616 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8617 one that the compiler can figure out is constant, possibly after
8618 doing some simplifications or optimizations. The standard has a
8619 precise definition of constant-expression, and we must honor
8620 that, even though it is somewhat more restrictive.
8622 For example:
8624 int i[(2, 3)];
8626 is not a legal declaration, because `(2, 3)' is not a
8627 constant-expression. The `,' operator is forbidden in a
8628 constant-expression. However, GCC's constant-folding machinery
8629 will fold this operation to an INTEGER_CST for `3'. */
8631 /* Save the old settings. */
8633 saved_allow_non_integral_constant_expression_p
8636 /* We are now parsing a constant-expression. */
8638 parser->allow_non_integral_constant_expression_p
8641 /* Although the grammar says "conditional-expression", we parse an
8642 "assignment-expression", which also permits "throw-expression"
8643 and the use of assignment operators. In the case that
8644 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8645 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8646 actually essential that we look for an assignment-expression.
8647 For example, cp_parser_initializer_clauses uses this function to
8648 determine whether a particular assignment-expression is in fact
8649 constant. */
8651 /* Restore the old settings. */
8652 parser->integral_constant_expression_p
8654 parser->allow_non_integral_constant_expression_p
8657 {
8658 /* Require an rvalue constant expression here; that's what our
8659 callers expect. Reference constant expressions are handled
8660 separately in e.g. cp_parser_template_argument. */
8665 }
8668 parser->non_integral_constant_expression_p
8672 }
8674 /* Parse __builtin_offsetof.
8676 offsetof-expression:
8677 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8679 offsetof-member-designator:
8680 id-expression
8681 | offsetof-member-designator "." id-expression
8682 | offsetof-member-designator "[" expression "]"
8683 | offsetof-member-designator "->" id-expression */
8685 static tree
8687 {
8690 cp_id_kind dummy;
8693 /* We're about to accept non-integral-constant things, but will
8694 definitely yield an integral constant expression. Save and
8695 restore these values around our local parsing. */
8699 /* Consume the "__builtin_offsetof" token. */
8701 /* Consume the opening `('. */
8703 /* Parse the type-id. */
8706 /* Look for the `,'. */
8710 /* Build the (type *)null that begins the traditional offsetof macro. */
8712 tf_warning_or_error);
8714 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8718 {
8721 {
8723 /* offsetof-member-designator "[" expression "]" */
8729 /* offsetof-member-designator "->" identifier */
8732 /* FALLTHRU */
8735 /* offsetof-member-designator "." identifier */
8743 /* Consume the ")" token. */
8748 /* Error. We know the following require will fail, but
8749 that gives the proper error message. */
8754 }
8755 }
8757 success:
8760 failure:
8765 }
8767 /* Parse a trait expression.
8769 Returns a representation of the expression, the underlying type
8770 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8772 static tree
8774 {
8775 cp_trait_kind kind;
8781 {
8865 }
8867 /* Consume the token. */
8878 {
8885 }
8887 {
8889 {
8893 {
8896 }
8900 }
8901 }
8905 /* Complete the trait expression, which may mean either processing
8906 the trait expr now or saving it for template instantiation. */
8908 {
8917 }
8918 }
8920 /* Lambdas that appear in variable initializer or default argument scope
8921 get that in their mangling, so we need to record it. We might as well
8922 use the count for function and namespace scopes as well. */
8926 {
8927 tree t;
8932 static void
8934 {
8935 tree_int ti;
8937 /* Once we're inside a function, we ignore other scopes and just push
8938 the function again so that popping works properly. */
8945 {
8946 /* Don't reset the count if we're still in the same function. */
8949 }
8950 }
8952 static void
8954 {
8957 }
8959 static void
8961 {
8964 {
8967 }
8969 }
8971 /* Parse a lambda expression.
8973 lambda-expression:
8974 lambda-introducer lambda-declarator [opt] compound-statement
8976 Returns a representation of the expression. */
8978 static tree
8980 {
8982 tree type;
8990 {
8992 {
8996 }
8998 }
9000 {
9002 {
9005 }
9007 }
9009 /* We may be in the middle of deferred access check. Disable
9010 it now. */
9021 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9024 /* Now that we've started the type, add the capture fields for any
9025 explicit captures. */
9028 {
9029 /* Inside the class, surrounding template-parameter-lists do not apply. */
9030 unsigned int saved_num_template_parameter_lists
9034 bool fully_implicit_function_template_p
9038 bool auto_is_implicit_function_template_parm_p
9049 /* By virtue of defining a local class, a lambda expression has access to
9050 the private variables of enclosing classes. */
9055 {
9061 }
9063 {
9066 }
9068 /* The capture list was built up in reverse order; fix that now. */
9080 parser->fully_implicit_function_template_p
9084 parser->auto_is_implicit_function_template_parm_p
9086 }
9090 /* This field is only used during parsing of the lambda. */
9093 /* This lambda shouldn't have any proxies left at this point. */
9095 /* And now that we're done, push proxies for an enclosing lambda. */
9100 else
9106 }
9108 /* Parse the beginning of a lambda expression.
9110 lambda-introducer:
9111 [ lambda-capture [opt] ]
9113 LAMBDA_EXPR is the current representation of the lambda expression. */
9115 static void
9117 {
9118 /* Need commas after the first capture. */
9121 /* Eat the leading `['. */
9124 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9132 {
9135 }
9138 {
9140 tree capture_id;
9141 tree capture_init_expr;
9145 enum capture_kind_type
9146 {
9147 BY_COPY,
9148 BY_REFERENCE
9149 };
9153 {
9156 }
9160 else
9163 /* Possibly capture `this'. */
9165 {
9175 explicit_init_p);
9177 }
9179 /* Remember whether we want to capture as a reference or not. */
9181 {
9184 }
9186 /* Get the identifier. */
9191 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9192 delimiters, but I modified this to stop on unnested ']' as well. It
9193 was already changed to stop on unnested '}', so the
9194 "closing_parenthesis" name is no more misleading with my change. */
9195 {
9201 }
9203 /* Find the initializer for this capture. */
9207 {
9209 /* An explicit initializer exists. */
9212 "lambda capture initializers "
9218 {
9221 }
9222 }
9223 else
9224 {
9227 /* Turn the identifier into an id-expression. */
9228 capture_init_expr
9233 {
9236 }
9240 {
9243 capture_init_expr);
9246 }
9249 {
9252 capture_init_expr))
9255 }
9257 capture_init_expr
9258 = finish_id_expression
9260 capture_init_expr,
9274 {
9277 }
9278 else
9280 }
9284 {
9289 capture_id);
9293 "capture of %qD redundant with by-reference capture "
9295 }
9298 capture_id,
9299 capture_init_expr,
9301 explicit_init_p);
9302 }
9305 }
9307 /* Parse the (optional) middle of a lambda expression.
9309 lambda-declarator:
9310 < template-parameter-list [opt] >
9311 ( parameter-declaration-clause [opt] )
9312 attribute-specifier [opt]
9313 mutable [opt]
9314 exception-specification [opt]
9315 lambda-return-type-clause [opt]
9317 LAMBDA_EXPR is the current representation of the lambda expression. */
9319 static bool
9321 {
9322 /* 5.1.1.4 of the standard says:
9323 If a lambda-expression does not include a lambda-declarator, it is as if
9324 the lambda-declarator were ().
9325 This means an empty parameter list, no attributes, and no exception
9326 specification. */
9332 /* The template-parameter-list is optional, but must begin with
9333 an opening angle if present. */
9335 {
9338 "lambda templates are only available with "
9347 /* We just processed one more parameter list. */
9349 }
9351 /* The parameter-declaration-clause is optional (unless
9352 template-parameter-list was given), but must begin with an
9353 opening parenthesis if present. */
9355 {
9360 /* Parse parameters. */
9363 /* Default arguments shall not be specified in the
9364 parameter-declaration-clause of a lambda-declarator. */
9374 /* Parse optional `mutable' keyword. */
9376 {
9379 }
9381 /* Parse optional exception specification. */
9384 /* Parse optional trailing return type. */
9386 {
9390 }
9392 /* The function parameters must be in scope all the way until after the
9393 trailing-return-type in case of decltype. */
9395 }
9399 /* Create the function call operator.
9401 Messing with declarators like this is no uglier than building up the
9402 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9403 other code. */
9404 {
9405 cp_decl_specifier_seq return_type_specs;
9407 tree fco;
9414 else
9415 /* Maybe we will deduce the return type later. */
9421 sfk_none);
9426 VIRT_SPEC_UNSPECIFIED,
9427 REF_QUAL_NONE,
9428 exception_spec,
9433 declarator,
9434 attributes);
9436 {
9439 /* Give the object parameter a different name. */
9443 }
9445 {
9449 }
9458 }
9459 }
9461 /* Parse the body of a lambda expression, which is simply
9463 compound-statement
9465 but which requires special handling.
9466 LAMBDA_EXPR is the current representation of the lambda expression. */
9468 static void
9470 {
9475 else
9476 /* Still increment function_depth so that we don't GC in the
9477 middle of an expression. */
9481 /* Clear this in case we're in the middle of a default argument. */
9484 /* Finish the function call operator
9485 - class_specifier
9486 + late_parsing_for_member
9487 + function_definition_after_declarator
9488 + ctor_initializer_opt_and_function_body */
9489 {
9491 tree body;
9493 tree compound_stmt;
9494 tree cap;
9496 /* Let the front end know that we are going to be defining this
9497 function. */
9499 NULL_TREE,
9508 /* Push the proxies for any explicit captures. */
9515 /* 5.1.1.4 of the standard says:
9516 If a lambda-expression does not include a trailing-return-type, it
9517 is as if the trailing-return-type denotes the following type:
9518 * if the compound-statement is of the form
9519 { return attribute-specifier [opt] expression ; }
9520 the type of the returned expression after lvalue-to-rvalue
9521 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9522 (_conv.array_ 4.2), and function-to-pointer conversion
9523 (_conv.func_ 4.3);
9524 * otherwise, void. */
9526 /* In a lambda that has neither a lambda-return-type-clause
9527 nor a deducible form, errors should be reported for return statements
9528 in the body. Since we used void as the placeholder return type, parsing
9529 the body as usual will give such desired behavior. */
9533 {
9537 /* Parse tentatively in case there's more after the initial return
9538 statement. */
9549 {
9553 /* Will get error here if type not deduced yet. */
9557 }
9558 }
9561 {
9566 }
9570 out:
9574 /* Finish the function and generate code for it if necessary. */
9577 /* Only expand if the call op is not a template. */
9580 }
9586 else
9588 }
9590 /* Statements [gram.stmt.stmt] */
9592 /* Parse a statement.
9594 statement:
9595 labeled-statement
9596 expression-statement
9597 compound-statement
9598 selection-statement
9599 iteration-statement
9600 jump-statement
9601 declaration-statement
9602 try-block
9604 C++11:
9606 statement:
9607 labeled-statement
9608 attribute-specifier-seq (opt) expression-statement
9609 attribute-specifier-seq (opt) compound-statement
9610 attribute-specifier-seq (opt) selection-statement
9611 attribute-specifier-seq (opt) iteration-statement
9612 attribute-specifier-seq (opt) jump-statement
9613 declaration-statement
9614 attribute-specifier-seq (opt) try-block
9616 TM Extension:
9618 statement:
9619 atomic-statement
9621 IN_COMPOUND is true when the statement is nested inside a
9622 cp_parser_compound_statement; this matters for certain pragmas.
9624 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9625 is a (possibly labeled) if statement which is not enclosed in braces
9626 and has an else clause. This is used to implement -Wparentheses. */
9628 static void
9631 {
9636 restart:
9639 /* There is no statement yet. */
9645 /* In obj-c++, seeing '[[' might be the either the beginning of
9646 c++11 attributes, or a nested objc-message-expression. So
9647 let's parse the c++11 attributes tentatively. */
9651 {
9654 }
9656 /* Peek at the next token. */
9658 /* Remember the location of the first token in the statement. */
9660 /* If this is a keyword, then that will often determine what kind of
9661 statement we have. */
9663 {
9667 {
9670 /* Looks like a labeled-statement with a case label.
9671 Parse the label, and then use tail recursion to parse
9672 the statement. */
9689 {
9694 }
9695 else
9709 {
9714 }
9715 else
9716 {
9720 }
9724 /* Objective-C++ exception-handling constructs. */
9738 /* This must be a namespace alias definition. */
9751 /* It might be a keyword like `int' that can start a
9752 declaration-statement. */
9754 }
9755 }
9757 {
9758 /* If the next token is a `:', then we are looking at a
9759 labeled-statement. */
9762 {
9763 /* Looks like a labeled-statement with an ordinary label.
9764 Parse the label, and then use tail recursion to parse
9765 the statement. */
9769 }
9770 }
9771 /* Anything that starts with a `{' must be a compound-statement. */
9774 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9775 a statement all its own. */
9777 {
9778 /* Only certain OpenMP pragmas are attached to statements, and thus
9779 are considered statements themselves. All others are not. In
9780 the context of a compound, accept the pragma as a "statement" and
9781 return so that we can check for a close brace. Otherwise we
9782 require a real statement and must go back and read one. */
9788 }
9790 {
9793 }
9795 /* Everything else must be a declaration-statement or an
9796 expression-statement. Try for the declaration-statement
9797 first, unless we are looking at a `;', in which case we know that
9798 we have an expression-statement. */
9800 {
9802 {
9804 {
9805 /* Attributes should be parsed as part of the the
9806 declaration, so let's un-parse them. */
9809 }
9812 /* Try to parse the declaration-statement. */
9814 /* If that worked, we're done. */
9817 }
9818 /* Look for an expression-statement instead. */
9820 }
9822 /* Set the line number for the statement. */
9826 /* Note that for now, we don't do anything with c++11 statements
9827 parsed at this level. */
9830 OPT_Wattributes,
9832 }
9834 /* Parse the label for a labeled-statement, i.e.
9836 identifier :
9837 case constant-expression :
9838 default :
9840 GNU Extension:
9841 case constant-expression ... constant-expression : statement
9843 When a label is parsed without errors, the label is added to the
9844 parse tree by the finish_* functions, so this function doesn't
9845 have to return the label. */
9847 static void
9849 {
9854 /* The next token should be an identifier. */
9858 {
9861 }
9865 {
9867 {
9871 /* Consume the `case' token. */
9873 /* Parse the constant-expression. */
9880 {
9881 /* Consume the `...' token. */
9887 /* We don't need to emit warnings here, as the common code
9888 will do this for us. */
9889 }
9890 else
9895 else
9898 expr);
9899 }
9903 /* Consume the `default' token. */
9908 else
9913 /* Anything else must be an ordinary label. */
9916 }
9918 /* Require the `:' token. */
9921 /* An ordinary label may optionally be followed by attributes.
9922 However, this is only permitted if the attributes are then
9923 followed by a semicolon. This is because, for backward
9924 compatibility, when parsing
9925 lab: __attribute__ ((unused)) int i;
9926 we want the attribute to attach to "i", not "lab". */
9929 {
9930 tree attrs;
9937 ;
9938 else
9940 }
9946 }
9948 /* Parse an expression-statement.
9950 expression-statement:
9951 expression [opt] ;
9953 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9954 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9955 indicates whether this expression-statement is part of an
9956 expression statement. */
9958 static tree
9960 {
9964 /* If the next token is a ';', then there is no expression
9965 statement. */
9967 {
9971 {
9974 }
9975 }
9977 /* Give a helpful message for "A<T>::type t;" and the like. */
9980 {
9987 {
9988 /* A::A a; */
9993 }
9994 }
9996 /* Consume the final `;'. */
10001 /* This is the final expression statement of a statement
10002 expression. */
10008 }
10010 /* Parse a compound-statement.
10012 compound-statement:
10013 { statement-seq [opt] }
10015 GNU extension:
10017 compound-statement:
10018 { label-declaration-seq [opt] statement-seq [opt] }
10020 label-declaration-seq:
10021 label-declaration
10022 label-declaration-seq label-declaration
10024 Returns a tree representing the statement. */
10026 static tree
10029 {
10030 tree compound_stmt;
10032 /* Consume the `{'. */
10039 /* Begin the compound-statement. */
10041 /* If the next keyword is `__label__' we have a label declaration. */
10044 /* Parse an (optional) statement-seq. */
10046 /* Finish the compound-statement. */
10048 /* Consume the `}'. */
10052 }
10054 /* Parse an (optional) statement-seq.
10056 statement-seq:
10057 statement
10058 statement-seq [opt] statement */
10060 static void
10062 {
10063 /* Scan statements until there aren't any more. */
10065 {
10068 /* If we are looking at a `}', then we have run out of
10069 statements; the same is true if we have reached the end
10070 of file, or have stumbled upon a stray '@end'. */
10077 /* If we are in a compound statement and find 'else' then
10078 something went wrong. */
10080 {
10083 else
10084 {
10087 }
10088 }
10090 /* Parse the statement. */
10092 }
10093 }
10095 /* Parse a selection-statement.
10097 selection-statement:
10098 if ( condition ) statement
10099 if ( condition ) statement else statement
10100 switch ( condition ) statement
10102 Returns the new IF_STMT or SWITCH_STMT.
10104 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10105 is a (possibly labeled) if statement which is not enclosed in
10106 braces and has an else clause. This is used to implement
10107 -Wparentheses. */
10109 static tree
10111 {
10118 /* Peek at the next token. */
10121 /* See what kind of keyword it is. */
10124 {
10127 {
10128 tree statement;
10129 tree condition;
10131 /* Look for the `('. */
10133 {
10136 }
10138 /* Begin the selection-statement. */
10141 else
10144 /* Parse the condition. */
10146 /* Look for the `)'. */
10152 {
10156 /* Add the condition. */
10159 /* Parse the then-clause. */
10163 {
10171 }
10172 else
10179 /* If the next token is `else', parse the else-clause. */
10181 RID_ELSE))
10182 {
10183 /* Consume the `else' keyword. */
10184 location_t else_tok_loc
10187 /* Parse the else-clause. */
10189 {
10190 location_t loc;
10197 }
10198 else
10204 /* If we are currently parsing a then-clause, then
10205 IF_P will not be NULL. We set it to true to
10206 indicate that this if statement has an else clause.
10207 This may trigger the Wparentheses warning below
10208 when we get back up to the parent if statement. */
10211 }
10212 else
10213 {
10214 /* This if statement does not have an else clause. If
10215 NESTED_IF is true, then the then-clause is an if
10216 statement which does have an else clause. We warn
10217 about the potential ambiguity. */
10220 "suggest explicit braces to avoid ambiguous"
10222 }
10224 /* Now we're all done with the if-statement. */
10226 }
10227 else
10228 {
10232 /* Add the condition. */
10235 /* Parse the body of the switch-statement. */
10245 /* Now we're all done with the switch-statement. */
10247 }
10250 }
10256 }
10257 }
10259 /* Parse a condition.
10261 condition:
10262 expression
10263 type-specifier-seq declarator = initializer-clause
10264 type-specifier-seq declarator braced-init-list
10266 GNU Extension:
10268 condition:
10269 type-specifier-seq declarator asm-specification [opt]
10270 attributes [opt] = assignment-expression
10272 Returns the expression that should be tested. */
10274 static tree
10276 {
10277 cp_decl_specifier_seq type_specifiers;
10281 /* Try the declaration first. */
10283 /* New types are not allowed in the type-specifier-seq for a
10284 condition. */
10286 parser->type_definition_forbidden_message
10288 /* Parse the type-specifier-seq. */
10290 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10293 /* Restore the saved message. */
10295 /* If all is well, we might be looking at a declaration. */
10297 {
10298 tree decl;
10299 tree asm_specification;
10300 tree attributes;
10304 /* Parse the declarator. */
10310 /* Parse the attributes. */
10312 /* Parse the asm-specification. */
10314 /* If the next token is not an `=' or '{', then we might still be
10315 looking at an expression. For example:
10317 if (A(a).x)
10319 looks like a decl-specifier-seq and a declarator -- but then
10320 there is no `=', so this is an expression. */
10325 /* If we did see an `=' or '{', then we are looking at a declaration
10326 for sure. */
10328 {
10329 tree pushed_scope;
10333 /* Create the declaration. */
10339 /* Parse the initializer. */
10341 {
10345 }
10346 else
10347 {
10348 /* Consume the `='. */
10351 }
10355 /* Process the initializer. */
10358 asm_specification,
10359 flags);
10365 }
10366 }
10367 /* If we didn't even get past the declarator successfully, we are
10368 definitely not looking at a declaration. */
10369 else
10372 /* Otherwise, we are looking at an expression. */
10374 }
10376 /* Parses a for-statement or range-for-statement until the closing ')',
10377 not included. */
10379 static tree
10381 {
10385 /* Begin the for-statement. */
10388 /* Parse the initialization. */
10393 else
10395 }
10397 static tree
10399 {
10400 /* Normal for loop */
10403 tree stmt;
10406 /* The for-init-statement has already been parsed in
10407 cp_parser_for_init_statement, so no work is needed here. */
10410 /* If there's a condition, process it. */
10414 {
10418 }
10420 /* Look for the `;'. */
10423 /* If there's an expression, process it. */
10429 }
10431 /* Tries to parse a range-based for-statement:
10433 range-based-for:
10434 decl-specifier-seq declarator : expression
10436 The decl-specifier-seq declarator and the `:' are already parsed by
10437 cp_parser_for_init_statement. If processing_template_decl it returns a
10438 newly created RANGE_FOR_STMT; if not, it is converted to a
10439 regular FOR_STMT. */
10441 static tree
10444 {
10448 {
10451 }
10452 else
10455 /* If in template, STMT is converted to a normal for-statement
10456 at instantiation. If not, it is done just ahead. */
10458 {
10466 /* do_auto_deduction doesn't mess with template init-lists. */
10469 }
10470 else
10471 {
10474 }
10476 }
10478 /* Subroutine of cp_convert_range_for: given the initializer expression,
10479 builds up the range temporary. */
10481 static tree
10483 {
10486 /* Find out the type deduced by the declaration
10487 `auto &&__range = range_expr'. */
10492 /* Create the __range variable. */
10499 }
10501 /* Used by cp_parser_range_for in template context: we aren't going to
10502 do a full conversion yet, but we still need to resolve auto in the
10503 type of the for-range-declaration if present. This is basically
10504 a shortcut version of cp_convert_range_for. */
10506 static void
10508 {
10511 {
10514 iter_type = (cp_parser_perform_range_for_lookup
10517 {
10519 iter_type);
10521 tf_warning_or_error);
10524 }
10525 }
10526 }
10528 /* Converts a range-based for-statement into a normal
10529 for-statement, as per the definition.
10531 for (RANGE_DECL : RANGE_EXPR)
10532 BLOCK
10534 should be equivalent to:
10536 {
10537 auto &&__range = RANGE_EXPR;
10538 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10539 __begin != __end;
10540 ++__begin)
10541 {
10542 RANGE_DECL = *__begin;
10543 BLOCK
10544 }
10545 }
10547 If RANGE_EXPR is an array:
10548 BEGIN_EXPR = __range
10549 END_EXPR = __range + ARRAY_SIZE(__range)
10550 Else if RANGE_EXPR has a member 'begin' or 'end':
10551 BEGIN_EXPR = __range.begin()
10552 END_EXPR = __range.end()
10553 Else:
10554 BEGIN_EXPR = begin(__range)
10555 END_EXPR = end(__range);
10557 If __range has a member 'begin' but not 'end', or vice versa, we must
10558 still use the second alternative (it will surely fail, however).
10559 When calling begin()/end() in the third alternative we must use
10560 argument dependent lookup, but always considering 'std' as an associated
10561 namespace. */
10563 tree
10566 {
10572 /* If an error happened previously do nothing or else a lot of
10573 unhelpful errors would be issued. */
10575 else
10576 {
10577 tree range_temp;
10581 /* Can't bind a reference to an array of runtime bound. */
10583 else
10584 {
10589 LOOKUP_ONLYCONVERTING);
10591 }
10594 }
10596 /* The new for initialization statement. */
10604 LOOKUP_ONLYCONVERTING);
10613 LOOKUP_ONLYCONVERTING);
10617 /* The new for condition. */
10624 /* The new increment expression. */
10627 tf_warning_or_error);
10630 /* The declaration is initialized with *__begin inside the loop body. */
10633 tf_warning_or_error),
10635 LOOKUP_ONLYCONVERTING);
10638 }
10640 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10641 We need to solve both at the same time because the method used
10642 depends on the existence of members begin or end.
10643 Returns the type deduced for the iterator expression. */
10645 static tree
10647 {
10649 {
10652 }
10655 {
10660 }
10662 {
10663 /* If RANGE is an array, we will use pointer arithmetic. */
10666 range,
10670 }
10671 else
10672 {
10673 /* If it is not an array, we must do a bit of magic. */
10683 tf_warning_or_error);
10686 tf_warning_or_error);
10689 {
10690 /* Use the member functions. */
10693 else
10699 else
10702 }
10703 else
10704 {
10705 /* Use global functions with ADL. */
10712 tf_warning_or_error);
10714 tf_warning_or_error);
10716 tf_warning_or_error);
10718 tf_warning_or_error);
10721 }
10723 /* Last common checks. */
10725 {
10726 /* If one of the expressions is an error do no more checks. */
10729 }
10732 /* Can happen, when, eg, in a template context, Koenig lookup
10733 can't resolve begin/end (c++/58503). */
10735 else
10736 {
10738 /* The unqualified type of the __begin and __end temporaries should
10739 be the same, as required by the multiple auto declaration. */
10745 }
10746 }
10747 }
10749 /* Helper function for cp_parser_perform_range_for_lookup.
10750 Builds a tree for RANGE.IDENTIFIER(). */
10752 static tree
10754 {
10767 tf_warning_or_error);
10770 }
10772 /* Parse an iteration-statement.
10774 iteration-statement:
10775 while ( condition ) statement
10776 do statement while ( expression ) ;
10777 for ( for-init-statement condition [opt] ; expression [opt] )
10778 statement
10780 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10782 static tree
10784 {
10786 location_t tok_loc;
10788 tree statement;
10791 /* Peek at the next token. */
10798 /* Remember whether or not we are already within an iteration
10799 statement. */
10802 /* See what kind of keyword it is. */
10805 {
10807 {
10808 tree condition;
10810 /* Begin the while-statement. */
10812 /* Look for the `('. */
10814 /* Parse the condition. */
10817 /* Look for the `)'. */
10819 /* Parse the dependent statement. */
10823 /* We're done with the while-statement. */
10825 }
10829 {
10830 tree expression;
10832 /* Begin the do-statement. */
10834 /* Parse the body of the do-statement. */
10839 /* Look for the `while' keyword. */
10841 /* Look for the `('. */
10843 /* Parse the expression. */
10845 /* We're done with the do-statement. */
10847 /* Look for the `)'. */
10849 /* Look for the `;'. */
10851 }
10855 {
10856 /* Look for the `('. */
10861 /* Look for the `)'. */
10864 /* Parse the body of the for-statement. */
10869 /* We're done with the for-statement. */
10871 }
10878 }
10881 }
10883 /* Parse a for-init-statement or the declarator of a range-based-for.
10884 Returns true if a range-based-for declaration is seen.
10886 for-init-statement:
10887 expression-statement
10888 simple-declaration */
10890 static bool
10892 {
10893 /* If the next token is a `;', then we have an empty
10894 expression-statement. Grammatically, this is also a
10895 simple-declaration, but an invalid one, because it does not
10896 declare anything. Therefore, if we did not handle this case
10897 specially, we would issue an error message about an invalid
10898 declaration. */
10900 {
10906 {
10907 /* N3994 -- for (id : init) ... */
10910 "type-specifier only available with "
10918 }
10920 /* A colon is used in range-based for. */
10923 /* We're going to speculatively look for a declaration, falling back
10924 to an expression, if necessary. */
10926 /* Parse the declaration. */
10929 decl);
10932 {
10933 /* It is a range-for, consume the ':' */
10937 {
10939 "range-based %<for%> loops only available with "
10942 }
10943 }
10944 else
10945 /* The ';' is not consumed yet because we told
10946 cp_parser_simple_declaration not to. */
10951 /* If the tentative parse failed, then we shall need to look for an
10952 expression-statement. */
10953 }
10954 /* If we are here, it is an expression-statement. */
10957 }
10959 /* Parse a jump-statement.
10961 jump-statement:
10962 break ;
10963 continue ;
10964 return expression [opt] ;
10965 return braced-init-list ;
10966 goto identifier ;
10968 GNU extension:
10970 jump-statement:
10971 goto * expression ;
10973 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10975 static tree
10977 {
10983 /* Peek at the next token. */
10988 /* See what kind of keyword it is. */
10991 {
10995 {
11015 }
11021 {
11028 /* Fall through. */
11038 }
11043 {
11044 tree expr;
11048 {
11052 }
11055 else
11056 /* If the next token is a `;', then there is no
11057 expression. */
11059 /* Build the return-statement. */
11061 /* Look for the final `;'. */
11063 }
11069 {
11072 }
11074 /* Create the goto-statement. */
11076 {
11077 /* Issue a warning about this use of a GNU extension. */
11079 /* Consume the '*' token. */
11081 /* Parse the dependent expression. */
11083 }
11084 else
11086 /* Look for the final `;'. */
11093 }
11096 }
11098 /* Parse a declaration-statement.
11100 declaration-statement:
11101 block-declaration */
11103 static void
11105 {
11108 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11111 /* Parse the block-declaration. */
11114 /* Free any declarators allocated. */
11116 }
11118 /* Some dependent statements (like `if (cond) statement'), are
11119 implicitly in their own scope. In other words, if the statement is
11120 a single statement (as opposed to a compound-statement), it is
11121 none-the-less treated as if it were enclosed in braces. Any
11122 declarations appearing in the dependent statement are out of scope
11123 after control passes that point. This function parses a statement,
11124 but ensures that is in its own scope, even if it is not a
11125 compound-statement.
11127 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11128 is a (possibly labeled) if statement which is not enclosed in
11129 braces and has an else clause. This is used to implement
11130 -Wparentheses.
11132 Returns the new statement. */
11134 static tree
11136 location_t guard_loc,
11138 {
11139 tree statement;
11144 /* Mark if () ; with a special NOP_EXPR. */
11146 {
11150 }
11151 /* if a compound is opened, we simply parse the statement directly. */
11154 /* If the token is not a `{', then we must take special action. */
11155 else
11156 {
11157 /* Create a compound-statement. */
11159 /* Parse the dependent-statement. */
11162 /* Finish the dummy compound-statement. */
11166 {
11170 guard_kind);
11171 }
11172 }
11174 /* Return the statement. */
11176 }
11178 /* For some dependent statements (like `while (cond) statement'), we
11179 have already created a scope. Therefore, even if the dependent
11180 statement is a compound-statement, we do not want to create another
11181 scope. */
11183 static void
11186 {
11187 /* If the token is a `{', then we must take special action. */
11189 {
11196 guard_kind);
11197 }
11198 else
11199 {
11200 /* Avoid calling cp_parser_compound_statement, so that we
11201 don't create a new scope. Do everything else by hand. */
11203 /* If the next keyword is `__label__' we have a label declaration. */
11206 /* Parse an (optional) statement-seq. */
11209 }
11210 }
11212 /* Declarations [gram.dcl.dcl] */
11214 /* Parse an optional declaration-sequence.
11216 declaration-seq:
11217 declaration
11218 declaration-seq declaration */
11220 static void
11222 {
11224 {
11235 {
11236 /* A declaration consisting of a single semicolon is
11237 invalid. Allow it unless we're being pedantic. */
11242 }
11244 /* If we're entering or exiting a region that's implicitly
11245 extern "C", modify the lang context appropriately. */
11247 {
11250 }
11252 {
11255 }
11258 {
11259 /* A top-level declaration can consist solely of a #pragma.
11260 A nested declaration cannot, so this is done here and not
11261 in cp_parser_declaration. (A #pragma at block scope is
11262 handled in cp_parser_statement.) */
11265 }
11267 /* Parse the declaration itself. */
11269 }
11270 }
11272 /* Parse a declaration.
11274 declaration:
11275 block-declaration
11276 function-definition
11277 template-declaration
11278 explicit-instantiation
11279 explicit-specialization
11280 linkage-specification
11281 namespace-definition
11283 GNU extension:
11285 declaration:
11286 __extension__ declaration */
11288 static void
11290 {
11291 cp_token token1;
11292 cp_token token2;
11297 /* Check for the `__extension__' keyword. */
11299 {
11300 /* Parse the qualified declaration. */
11302 /* Restore the PEDANTIC flag. */
11306 }
11308 /* Try to figure out what kind of declaration is present. */
11313 else
11314 {
11317 }
11319 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11322 /* If the next token is `extern' and the following token is a string
11323 literal, then we have a linkage specification. */
11327 /* If the next token is `template', then we have either a template
11328 declaration, an explicit instantiation, or an explicit
11329 specialization. */
11331 {
11332 /* `template <>' indicates a template specialization. */
11336 /* `template <' indicates a template declaration. */
11339 /* Anything else must be an explicit instantiation. */
11340 else
11342 }
11343 /* If the next token is `export', then we have a template
11344 declaration. */
11347 /* If the next token is `extern', 'static' or 'inline' and the one
11348 after that is `template', we have a GNU extended explicit
11349 instantiation directive. */
11356 /* If the next token is `namespace', check for a named or unnamed
11357 namespace definition. */
11363 /* An unnamed namespace definition. */
11367 /* An inline (associated) namespace definition. */
11371 /* Objective-C++ declaration/definition. */
11378 /* We must have either a block declaration or a function
11379 definition. */
11380 else
11381 /* Try to parse a block-declaration, or a function-definition. */
11384 /* Free any declarators allocated. */
11386 }
11388 /* Parse a block-declaration.
11390 block-declaration:
11391 simple-declaration
11392 asm-definition
11393 namespace-alias-definition
11394 using-declaration
11395 using-directive
11397 GNU Extension:
11399 block-declaration:
11400 __extension__ block-declaration
11402 C++0x Extension:
11404 block-declaration:
11405 static_assert-declaration
11407 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11408 part of a declaration-statement. */
11410 static void
11413 {
11417 /* Check for the `__extension__' keyword. */
11419 {
11420 /* Parse the qualified declaration. */
11422 /* Restore the PEDANTIC flag. */
11426 }
11428 /* Peek at the next token to figure out which kind of declaration is
11429 present. */
11432 /* If the next keyword is `asm', we have an asm-definition. */
11434 {
11438 }
11439 /* If the next keyword is `namespace', we have a
11440 namespace-alias-definition. */
11443 /* If the next keyword is `using', we have a
11444 using-declaration, a using-directive, or an alias-declaration. */
11446 {
11451 /* If the token after `using' is `namespace', then we have a
11452 using-directive. */
11456 /* If the second token after 'using' is '=', then we have an
11457 alias-declaration. */
11463 /* Otherwise, it's a using-declaration. */
11464 else
11467 }
11468 /* If the next keyword is `__label__' we have a misplaced label
11469 declaration. */
11471 {
11475 /* If the next token is now a `;', consume it. */
11478 }
11479 /* If the next token is `static_assert' we have a static assertion. */
11482 /* Anything else must be a simple-declaration. */
11483 else
11486 }
11488 /* Parse a simple-declaration.
11490 simple-declaration:
11491 decl-specifier-seq [opt] init-declarator-list [opt] ;
11493 init-declarator-list:
11494 init-declarator
11495 init-declarator-list , init-declarator
11497 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11498 function-definition as a simple-declaration.
11500 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11501 parsed declaration if it is an uninitialized single declarator not followed
11502 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11503 if present, will not be consumed. */
11505 static void
11509 {
11510 cp_decl_specifier_seq decl_specifiers;
11519 /* Defer access checks until we know what is being declared; the
11520 checks for names appearing in the decl-specifier-seq should be
11521 done as if we were in the scope of the thing being declared. */
11524 /* Parse the decl-specifier-seq. We have to keep track of whether
11525 or not the decl-specifier-seq declares a named class or
11526 enumeration type, since that is the only case in which the
11527 init-declarator-list is allowed to be empty.
11529 [dcl.dcl]
11531 In a simple-declaration, the optional init-declarator-list can be
11532 omitted only when declaring a class or enumeration, that is when
11533 the decl-specifier-seq contains either a class-specifier, an
11534 elaborated-type-specifier, or an enum-specifier. */
11536 CP_PARSER_FLAGS_OPTIONAL,
11539 /* We no longer need to defer access checks. */
11542 /* In a block scope, a valid declaration must always have a
11543 decl-specifier-seq. By not trying to parse declarators, we can
11544 resolve the declaration/expression ambiguity more quickly. */
11547 {
11550 }
11552 /* If the next two tokens are both identifiers, the code is
11553 erroneous. The usual cause of this situation is code like:
11555 T t;
11557 where "T" should name a type -- but does not. */
11560 {
11561 /* If parsing tentatively, we should commit; we really are
11562 looking at a declaration. */
11564 /* Give up. */
11566 }
11568 /* If we have seen at least one decl-specifier, and the next token
11569 is not a parenthesis, then we must be looking at a declaration.
11570 (After "int (" we might be looking at a functional cast.) */
11577 /* Keep going until we hit the `;' at the end of the simple
11578 declaration. */
11581 CPP_SEMICOLON))
11582 {
11585 tree decl;
11588 {
11589 /* If we are processing next declarator, comma is expected */
11594 {
11598 }
11599 }
11600 else
11603 /* Parse the init-declarator. */
11606 function_definition_allowed_p,
11608 declares_class_or_enum,
11610 maybe_range_for_decl,
11612 /* If an error occurred while parsing tentatively, exit quickly.
11613 (That usually happens when in the body of a function; each
11614 statement is treated as a declaration-statement until proven
11615 otherwise.) */
11618 /* Handle function definitions specially. */
11620 {
11621 /* If the next token is a `,', then we are probably
11622 processing something like:
11624 void f() {}, *p;
11626 which is erroneous. */
11628 {
11631 "mixing"
11633 }
11634 /* Otherwise, we're done with the list of declarators. */
11635 else
11636 {
11639 }
11640 }
11643 /* The next token should be either a `,' or a `;'. */
11645 /* If it's a `,', there are more declarators to come. */
11648 /* If it's a `;', we are done. */
11651 /* Anything else is an error. */
11652 else
11653 {
11654 /* If we have already issued an error message we don't need
11655 to issue another one. */
11659 /* Skip tokens until we reach the end of the statement. */
11661 /* If the next token is now a `;', consume it. */
11665 }
11666 /* After the first time around, a function-definition is not
11667 allowed -- even if it was OK at first. For example:
11669 int i, f() {}
11671 is not valid. */
11673 }
11675 /* Issue an error message if no declarators are present, and the
11676 decl-specifier-seq does not itself declare a class or
11677 enumeration: [dcl.dcl]/3. */
11679 {
11681 {
11685 /* Ensure an error is issued anyway when finish_decltype_type,
11686 called via cp_parser_decl_specifier_seq, returns a class or
11687 an enumeration (c++/51786). */
11690 }
11691 /* Perform any deferred access checks. */
11693 }
11695 /* Consume the `;'. */
11699 {
11705 }
11707 done:
11709 }
11711 /* Parse a decl-specifier-seq.
11713 decl-specifier-seq:
11714 decl-specifier-seq [opt] decl-specifier
11715 decl-specifier attribute-specifier-seq [opt] (C++11)
11717 decl-specifier:
11718 storage-class-specifier
11719 type-specifier
11720 function-specifier
11721 friend
11722 typedef
11724 GNU Extension:
11726 decl-specifier:
11727 attributes
11729 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11731 The parser flags FLAGS is used to control type-specifier parsing.
11733 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11734 flags:
11736 1: one of the decl-specifiers is an elaborated-type-specifier
11737 (i.e., a type declaration)
11738 2: one of the decl-specifiers is an enum-specifier or a
11739 class-specifier (i.e., a type definition)
11741 */
11743 static void
11745 cp_parser_flags flags,
11748 {
11752 cp_decl_spec ds;
11754 /* Clear DECL_SPECS. */
11757 /* Assume no class or enumeration type is declared. */
11760 /* Keep reading specifiers until there are no more to read. */
11762 {
11767 /* Peek at the next token. */
11770 /* Save the first token of the decl spec list for error
11771 reporting. */
11774 /* Handle attributes. */
11776 {
11777 /* Parse the attributes. */
11780 /* In a sequence of declaration specifiers, c++11 attributes
11781 appertain to the type that precede them. In that case
11782 [dcl.spec]/1 says:
11784 The attribute-specifier-seq affects the type only for
11785 the declaration it appears in, not other declarations
11786 involving the same type.
11788 But for now let's force the user to position the
11789 attribute either at the beginning of the declaration or
11790 after the declarator-id, which would clearly mean that it
11791 applies to the declarator. */
11793 {
11795 /* The c++11 attribute is at the beginning of the
11796 declaration. It appertains to the entity being
11798 else
11799 {
11801 {
11802 /* This is an attribute following a
11803 class-specifier. */
11808 }
11809 else
11810 {
11811 decl_specs->std_attributes
11813 attrs);
11816 }
11818 }
11819 }
11821 decl_specs->attributes
11823 attrs);
11827 }
11828 /* Assume we will find a decl-specifier keyword. */
11830 /* If the next token is an appropriate keyword, we can simply
11831 add it to the list. */
11833 {
11834 /* decl-specifier:
11835 friend
11836 constexpr */
11839 {
11842 }
11843 else
11844 {
11846 /* Consume the token. */
11848 }
11856 /* function-specifier:
11857 inline
11858 virtual
11859 explicit */
11866 /* decl-specifier:
11867 typedef */
11870 /* Consume the token. */
11872 /* A constructor declarator cannot appear in a typedef. */
11874 /* The "typedef" keyword can only occur in a declaration; we
11875 may as well commit at this point. */
11882 /* storage-class-specifier:
11883 auto
11884 register
11885 static
11886 extern
11887 mutable
11889 GNU Extension:
11890 thread */
11893 {
11894 /* Consume the token. */
11897 /* Complain about `auto' as a storage specifier, if
11898 we're complaining about C++0x compatibility. */
11902 /* Set the storage class anyway. */
11904 token);
11905 }
11906 else
11907 /* C++0x auto type-specifier. */
11915 /* Consume the token. */
11918 token);
11921 /* Consume the token. */
11927 /* We did not yet find a decl-specifier yet. */
11930 }
11940 /* Constructors are a special case. The `S' in `S()' is not a
11941 decl-specifier; it is the beginning of the declarator. */
11942 constructor_p
11943 = (!found_decl_spec
11944 && constructor_possible_p
11945 && (cp_parser_constructor_declarator_p
11948 /* If we don't have a DECL_SPEC yet, then we must be looking at
11949 a type-specifier. */
11951 {
11954 tree type_spec;
11956 type_spec
11958 decl_specs,
11964 /* If this type-specifier referenced a user-defined type
11965 (a typedef, class-name, etc.), then we can't allow any
11966 more such type-specifiers henceforth.
11968 [dcl.spec]
11970 The longest sequence of decl-specifiers that could
11971 possibly be a type name is taken as the
11972 decl-specifier-seq of a declaration. The sequence shall
11973 be self-consistent as described below.
11975 [dcl.type]
11977 As a general rule, at most one type-specifier is allowed
11978 in the complete decl-specifier-seq of a declaration. The
11979 only exceptions are the following:
11981 -- const or volatile can be combined with any other
11982 type-specifier.
11984 -- signed or unsigned can be combined with char, long,
11985 short, or int.
11987 -- ..
11989 Example:
11991 typedef char* Pc;
11992 void g (const int Pc);
11994 Here, Pc is *not* part of the decl-specifier seq; it's
11995 the declarator. Therefore, once we see a type-specifier
11996 (other than a cv-qualifier), we forbid any additional
11997 user-defined types. We *do* still allow things like `int
11998 int' to be considered a decl-specifier-seq, and issue the
11999 error message later. */
12002 /* A constructor declarator cannot follow a type-specifier. */
12004 {
12009 }
12010 }
12012 /* If we still do not have a DECL_SPEC, then there are no more
12013 decl-specifiers. */
12018 /* After we see one decl-specifier, further decl-specifiers are
12019 always optional. */
12021 }
12023 /* Don't allow a friend specifier with a class definition. */
12028 }
12030 /* Parse an (optional) storage-class-specifier.
12032 storage-class-specifier:
12033 auto
12034 register
12035 static
12036 extern
12037 mutable
12039 GNU Extension:
12041 storage-class-specifier:
12042 thread
12044 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12046 static tree
12048 {
12050 {
12054 /* Fall through for C++98. */
12061 /* Consume the token. */
12066 }
12067 }
12069 /* Parse an (optional) function-specifier.
12071 function-specifier:
12072 inline
12073 virtual
12074 explicit
12076 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12077 Updates DECL_SPECS, if it is non-NULL. */
12079 static tree
12082 {
12085 {
12091 /* 14.5.2.3 [temp.mem]
12093 A member function template shall not be virtual. */
12096 else
12106 }
12108 /* Consume the token. */
12110 }
12112 /* Parse a linkage-specification.
12114 linkage-specification:
12115 extern string-literal { declaration-seq [opt] }
12116 extern string-literal declaration */
12118 static void
12120 {
12121 tree linkage;
12123 /* Look for the `extern' keyword. */
12126 /* Look for the string-literal. */
12129 /* Transform the literal into an identifier. If the literal is a
12130 wide-character string, or contains embedded NULs, then we can't
12131 handle it as the user wants. */
12134 {
12136 /* Assume C++ linkage. */
12138 }
12139 else
12142 /* We're now using the new linkage. */
12145 /* If the next token is a `{', then we're using the first
12146 production. */
12148 {
12151 /* Consume the `{' token. */
12153 /* Parse the declarations. */
12155 /* Look for the closing `}'. */
12157 }
12158 /* Otherwise, there's just one declaration. */
12159 else
12160 {
12163 saved_in_unbraced_linkage_specification_p
12167 parser->in_unbraced_linkage_specification_p
12169 }
12171 /* We're done with the linkage-specification. */
12173 }
12175 /* Parse a static_assert-declaration.
12177 static_assert-declaration:
12178 static_assert ( constant-expression , string-literal ) ;
12179 static_assert ( constant-expression ) ; (C++1Z)
12181 If MEMBER_P, this static_assert is a class member. */
12183 static void
12185 {
12186 tree condition;
12187 tree message;
12189 location_t saved_loc;
12192 /* Peek at the `static_assert' token so we can keep track of exactly
12193 where the static assertion started. */
12197 /* Look for the `static_assert' keyword. */
12199 RT_STATIC_ASSERT))
12202 /* We know we are in a static assertion; commit to any tentative
12203 parse. */
12207 /* Parse the `(' starting the static assertion condition. */
12210 /* Parse the constant-expression. Allow a non-constant expression
12211 here in order to give better diagnostics in finish_static_assert. */
12212 condition =
12218 {
12221 "static_assert without a message "
12223 /* Eat the ')' */
12228 }
12229 else
12230 {
12231 /* Parse the separating `,'. */
12234 /* Parse the string-literal message. */
12239 /* A `)' completes the static assertion. */
12245 }
12247 /* A semicolon terminates the declaration. */
12250 /* Complete the static assertion, which may mean either processing
12251 the static assert now or saving it for template instantiation. */
12253 }
12255 /* Parse the expression in decltype ( expression ). */
12257 static tree
12260 {
12262 tree expr;
12264 /* First, try parsing an id-expression. */
12275 {
12278 cp_id_kind idk;
12282 /* Lookup the name we got back from the id-expression. */
12292 {
12293 /* Complete lookup of the id-expression. */
12294 expr = (finish_id_expression
12307 /* We found an id-expression, but it was something that we
12308 should not have found. This is an error, not something
12309 we can recover from, so note that we found an
12310 id-expression and we'll recover as gracefully as
12311 possible. */
12313 }
12318 /* We have an id-expression. */
12320 }
12323 {
12324 /* Abort the id-expression parse. */
12327 /* Parsing tentatively, again. */
12330 /* Parse a class member access. */
12338 /* We have an id-expression. */
12340 }
12343 /* We have parsed the complete id-expression or member access. */
12345 else
12346 {
12347 /* Abort our attempt to parse an id-expression or member access
12348 expression. */
12351 /* Parse a full expression. */
12354 }
12357 }
12359 /* Parse a `decltype' type. Returns the type.
12361 simple-type-specifier:
12362 decltype ( expression )
12363 C++14 proposal:
12364 decltype ( auto ) */
12366 static tree
12368 {
12369 tree expr;
12378 {
12379 /* Already parsed. */
12382 }
12384 /* Look for the `decltype' token. */
12388 /* Parse the opening `('. */
12392 /* decltype (auto) */
12395 {
12402 }
12404 /* Types cannot be defined in a `decltype' expression. Save away the
12405 old message. */
12408 /* And create the new one. */
12409 parser->type_definition_forbidden_message
12412 /* The restrictions on constant-expressions do not apply inside
12413 decltype expressions. */
12414 saved_integral_constant_expression_p
12416 saved_non_integral_constant_expression_p
12420 /* Within a parenthesized expression, a `>' token is always
12421 the greater-than operator. */
12422 saved_greater_than_is_operator_p
12426 /* Do not actually evaluate the expression. */
12429 /* Do not warn about problems with the expression. */
12434 /* Go back to evaluating expressions. */
12438 /* The `>' token might be the end of a template-id or
12439 template-parameter-list now. */
12440 parser->greater_than_is_operator_p
12443 /* Restore the old message and the integral constant expression
12444 flags. */
12446 parser->integral_constant_expression_p
12448 parser->non_integral_constant_expression_p
12451 /* Parse to the closing `)'. */
12453 {
12457 }
12460 tf_warning_or_error);
12462 rewrite:
12463 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12464 it again. */
12471 }
12473 /* Special member functions [gram.special] */
12475 /* Parse a conversion-function-id.
12477 conversion-function-id:
12478 operator conversion-type-id
12480 Returns an IDENTIFIER_NODE representing the operator. */
12482 static tree
12484 {
12485 tree type;
12486 tree saved_scope;
12487 tree saved_qualifying_scope;
12488 tree saved_object_scope;
12491 /* Look for the `operator' token. */
12494 /* When we parse the conversion-type-id, the current scope will be
12495 reset. However, we need that information in able to look up the
12496 conversion function later, so we save it here. */
12500 /* We must enter the scope of the class so that the names of
12501 entities declared within the class are available in the
12502 conversion-type-id. For example, consider:
12504 struct S {
12505 typedef int I;
12506 operator I();
12507 };
12509 S::operator I() { ... }
12511 In order to see that `I' is a type-name in the definition, we
12512 must be in the scope of `S'. */
12515 /* Parse the conversion-type-id. */
12517 /* Leave the scope of the class, if any. */
12520 /* Restore the saved scope. */
12524 /* If the TYPE is invalid, indicate failure. */
12528 }
12530 /* Parse a conversion-type-id:
12532 conversion-type-id:
12533 type-specifier-seq conversion-declarator [opt]
12535 Returns the TYPE specified. */
12537 static tree
12539 {
12540 tree attributes;
12541 cp_decl_specifier_seq type_specifiers;
12543 tree type_specified;
12546 /* Parse the attributes. */
12550 parser->type_definition_forbidden_message
12553 /* Parse the type-specifiers. */
12560 /* If that didn't work, stop. */
12563 /* Parse the conversion-declarator. */
12571 /* Don't give this error when parsing tentatively. This happens to
12572 work because we always parse this definitively once. */
12575 {
12577 {
12580 }
12584 }
12587 }
12589 /* Parse an (optional) conversion-declarator.
12591 conversion-declarator:
12592 ptr-operator conversion-declarator [opt]
12594 */
12598 {
12601 cp_cv_quals cv_quals;
12603 /* We don't know if there's a ptr-operator next, or not. */
12605 /* Try the ptr-operator. */
12608 /* If it worked, look for more conversion-declarators. */
12610 {
12613 /* Parse another optional declarator. */
12616 declarator = cp_parser_make_indirect_declarator
12620 }
12623 }
12625 /* Parse an (optional) ctor-initializer.
12627 ctor-initializer:
12628 : mem-initializer-list
12630 Returns TRUE iff the ctor-initializer was actually present. */
12632 static bool
12634 {
12635 /* If the next token is not a `:', then there is no
12636 ctor-initializer. */
12638 {
12639 /* Do default initialization of any bases and members. */
12644 }
12646 /* Consume the `:' token. */
12648 /* And the mem-initializer-list. */
12652 }
12654 /* Parse a mem-initializer-list.
12656 mem-initializer-list:
12657 mem-initializer ... [opt]
12658 mem-initializer ... [opt] , mem-initializer-list */
12660 static void
12662 {
12667 /* Let the semantic analysis code know that we are starting the
12668 mem-initializer-list. */
12673 /* Loop through the list. */
12675 {
12676 tree mem_initializer;
12679 /* Parse the mem-initializer. */
12681 /* If the next token is a `...', we're expanding member initializers. */
12683 {
12684 /* Consume the `...'. */
12687 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12688 can be expanded but members cannot. */
12691 {
12696 }
12698 /* Construct the pack expansion type. */
12701 }
12704 {
12708 }
12709 /* Look for a target constructor. */
12713 {
12716 {
12720 }
12722 }
12723 /* Add it to the list, unless it was erroneous. */
12725 {
12728 }
12729 /* If the next token is not a `,', we're done. */
12732 /* Consume the `,' token. */
12734 }
12736 /* Perform semantic analysis. */
12739 }
12741 /* Parse a mem-initializer.
12743 mem-initializer:
12744 mem-initializer-id ( expression-list [opt] )
12745 mem-initializer-id braced-init-list
12747 GNU extension:
12749 mem-initializer:
12750 ( expression-list [opt] )
12752 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12753 class) or FIELD_DECL (for a non-static data member) to initialize;
12754 the TREE_VALUE is the expression-list. An empty initialization
12755 list is represented by void_list_node. */
12757 static tree
12759 {
12760 tree mem_initializer_id;
12761 tree expression_list;
12762 tree member;
12765 /* Find out what is being initialized. */
12767 {
12771 }
12772 else
12773 {
12777 }
12783 {
12790 }
12791 else
12792 {
12802 }
12812 }
12814 /* Parse a mem-initializer-id.
12816 mem-initializer-id:
12817 :: [opt] nested-name-specifier [opt] class-name
12818 decltype-specifier (C++11)
12819 identifier
12821 Returns a TYPE indicating the class to be initialized for the first
12822 production (and the second in C++11). Returns an IDENTIFIER_NODE
12823 indicating the data member to be initialized for the last production. */
12825 static tree
12827 {
12831 tree id;
12835 /* `typename' is not allowed in this context ([temp.res]). */
12837 {
12839 "keyword %<typename%> not allowed in this context (a qualified "
12842 }
12843 /* Look for the optional `::' operator. */
12844 global_scope_p
12848 /* Look for the optional nested-name-specifier. The simplest way to
12849 implement:
12851 [temp.res]
12853 The keyword `typename' is not permitted in a base-specifier or
12854 mem-initializer; in these contexts a qualified name that
12855 depends on a template-parameter is implicitly assumed to be a
12856 type name.
12858 is to assume that we have seen the `typename' keyword at this
12859 point. */
12860 nested_name_specifier_p
12869 /* If there is a `::' operator or a nested-name-specifier, then we
12870 are definitely looking for a class-name. */
12875 typename_type,
12879 /* Otherwise, we could also be looking for an ordinary identifier. */
12882 /* Try a decltype-specifier. */
12884 else
12885 /* Otherwise, try a class-name. */
12889 none_type,
12893 /* If we found one, we're done. */
12896 /* Otherwise, look for an ordinary identifier. */
12898 }
12900 /* Overloading [gram.over] */
12902 /* Parse an operator-function-id.
12904 operator-function-id:
12905 operator operator
12907 Returns an IDENTIFIER_NODE for the operator which is a
12908 human-readable spelling of the identifier, e.g., `operator +'. */
12910 static tree
12912 {
12913 /* Look for the `operator' keyword. */
12916 /* And then the name of the operator itself. */
12918 }
12920 /* Return an identifier node for a user-defined literal operator.
12921 The suffix identifier is chained to the operator name identifier. */
12923 static tree
12925 {
12926 tree identifier;
12933 }
12935 /* Parse an operator.
12937 operator:
12938 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12939 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12940 || ++ -- , ->* -> () []
12942 GNU Extensions:
12944 operator:
12945 <? >? <?= >?=
12947 Returns an IDENTIFIER_NODE for the operator which is a
12948 human-readable spelling of the identifier, e.g., `operator +'. */
12950 static tree
12952 {
12957 /* Peek at the next token. */
12959 /* Figure out which operator we have. */
12961 {
12963 {
12966 /* The keyword should be either `new' or `delete'. */
12971 else
12974 /* Consume the `new' or `delete' token. */
12977 /* Peek at the next token. */
12979 /* If it's a `[' token then this is the array variant of the
12980 operator. */
12982 {
12983 /* Consume the `[' token. */
12985 /* Look for the `]' token. */
12989 }
12990 /* Otherwise, we have the non-array variant. */
12991 else
12995 }
13142 /* Consume the `('. */
13144 /* Look for the matching `)'. */
13149 /* Consume the `['. */
13151 /* Look for the matching `]'. */
13166 {
13173 /* Consume the string. */
13179 {
13182 }
13183 else
13184 {
13186 /* Look for the suffix identifier. */
13191 {
13195 }
13196 else
13197 {
13200 }
13201 }
13206 {
13209 }
13212 {
13215 }
13217 {
13220 }
13222 }
13225 /* Anything else is an error. */
13227 }
13229 /* If we have selected an identifier, we need to consume the
13230 operator token. */
13233 /* Otherwise, no valid operator name was present. */
13234 else
13235 {
13238 }
13241 }
13243 /* Parse a template-declaration.
13245 template-declaration:
13246 export [opt] template < template-parameter-list > declaration
13248 If MEMBER_P is TRUE, this template-declaration occurs within a
13249 class-specifier.
13251 The grammar rule given by the standard isn't correct. What
13252 is really meant is:
13254 template-declaration:
13255 export [opt] template-parameter-list-seq
13256 decl-specifier-seq [opt] init-declarator [opt] ;
13257 export [opt] template-parameter-list-seq
13258 function-definition
13260 template-parameter-list-seq:
13261 template-parameter-list-seq [opt]
13262 template < template-parameter-list > */
13264 static void
13266 {
13267 /* Check for `export'. */
13269 {
13270 /* Consume the `export' token. */
13272 /* Warn that we do not support `export'. */
13274 }
13277 }
13279 /* Parse a template-parameter-list.
13281 template-parameter-list:
13282 template-parameter
13283 template-parameter-list , template-parameter
13285 Returns a TREE_LIST. Each node represents a template parameter.
13286 The nodes are connected via their TREE_CHAINs. */
13288 static tree
13290 {
13295 /* The loop below parses the template parms. We first need to know
13296 the total number of template parms to be able to compute proper
13297 canonical types of each dependent type. So after the loop, when
13298 we know the total number of template parms,
13299 end_template_parm_list computes the proper canonical types and
13300 fixes up the dependent types accordingly. */
13302 {
13303 tree parameter;
13306 location_t parm_loc;
13308 /* Parse the template-parameter. */
13313 /* Add it to the list. */
13316 parm_loc,
13317 parameter,
13318 is_non_type,
13319 is_parameter_pack);
13320 else
13321 {
13324 }
13326 /* If the next token is not a `,', we're done. */
13329 /* Otherwise, consume the `,' token. */
13331 }
13334 }
13336 /* Parse a template-parameter.
13338 template-parameter:
13339 type-parameter
13340 parameter-declaration
13342 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13343 the parameter. The TREE_PURPOSE is the default value, if any.
13344 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13345 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13346 set to true iff this parameter is a parameter pack. */
13348 static tree
13351 {
13355 tree parm;
13357 /* Assume it is a type parameter or a template parameter. */
13359 /* Assume it not a parameter pack. */
13361 /* Peek at the next token. */
13363 /* If it is `class' or `template', we have a type-parameter. */
13366 /* If it is `class' or `typename' we do not know yet whether it is a
13367 type parameter or a non-type parameter. Consider:
13369 template <typename T, typename T::X X> ...
13371 or:
13373 template <class C, class D*> ...
13375 Here, the first parameter is a type parameter, and the second is
13376 a non-type parameter. We can tell by looking at the token after
13377 the identifier -- if it is a `,', `=', or `>' then we have a type
13378 parameter. */
13380 {
13381 /* Peek at the token after `class' or `typename'. */
13383 /* If it's an ellipsis, we have a template type parameter
13384 pack. */
13387 /* If it's an identifier, skip it. */
13390 /* Now, see if the token looks like the end of a template
13391 parameter. */
13396 }
13398 /* Otherwise, it is a non-type parameter.
13400 [temp.param]
13402 When parsing a default template-argument for a non-type
13403 template-parameter, the first non-nested `>' is taken as the end
13404 of the template parameter-list rather than a greater-than
13405 operator. */
13407 parameter_declarator
13414 /* If the parameter declaration is marked as a parameter pack, set
13415 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13416 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13417 grokdeclarator. */
13420 {
13423 }
13426 {
13427 /* Can happen in some cases of erroneous input (c++/34892). */
13429 /* Consume the `...' for better error recovery. */
13431 }
13432 /* If the next token is an ellipsis, and we don't already have it
13433 marked as a parameter pack, then we have a parameter pack (that
13434 has no declarator). */
13437 && (declarator_can_be_parameter_pack
13439 {
13440 /* Consume the `...'. */
13445 }
13446 /* We might end up with a pack expansion as the type of the non-type
13447 template parameter, in which case this is a non-type template
13448 parameter pack. */
13451 {
13455 }
13458 {
13459 /* Parameter packs cannot have default arguments. However, a
13460 user may try to do so, so we'll parse them and give an
13461 appropriate diagnostic here. */
13465 /* Find the name of the parameter pack. */
13474 else
13478 /* Parse the default argument, but throw away the result. */
13480 }
13490 }
13492 /* Parse a type-parameter.
13494 type-parameter:
13495 class identifier [opt]
13496 class identifier [opt] = type-id
13497 typename identifier [opt]
13498 typename identifier [opt] = type-id
13499 template < template-parameter-list > class identifier [opt]
13500 template < template-parameter-list > class identifier [opt]
13501 = id-expression
13503 GNU Extension (variadic templates):
13505 type-parameter:
13506 class ... identifier [opt]
13507 typename ... identifier [opt]
13509 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13510 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13511 the declaration of the parameter.
13513 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13515 static tree
13517 {
13519 tree parameter;
13521 /* Look for a keyword to tell us what kind of parameter this is. */
13527 {
13530 {
13531 tree identifier;
13532 tree default_argument;
13534 /* If the next token is an ellipsis, we have a template
13535 argument pack. */
13537 {
13538 /* Consume the `...' token. */
13543 }
13545 /* If the next token is an identifier, then it names the
13546 parameter. */
13549 else
13552 /* Create the parameter. */
13555 /* If the next token is an `=', we have a default argument. */
13557 {
13558 /* Consume the `=' token. */
13560 /* Parse the default-argument. */
13564 /* Template parameter packs cannot have default
13565 arguments. */
13567 {
13570 "template parameter pack %qD cannot have a "
13572 else
13574 "template parameter packs cannot have "
13577 }
13581 }
13582 else
13585 /* Create the combined representation of the parameter and the
13586 default argument. */
13588 }
13592 {
13593 tree identifier;
13594 tree default_argument;
13596 /* Look for the `<'. */
13598 /* Parse the template-parameter-list. */
13600 /* Look for the `>'. */
13602 /* Look for the `class' or 'typename' keywords. */
13604 /* If the next token is an ellipsis, we have a template
13605 argument pack. */
13607 {
13608 /* Consume the `...' token. */
13613 }
13614 /* If the next token is an `=', then there is a
13615 default-argument. If the next token is a `>', we are at
13616 the end of the parameter-list. If the next token is a `,',
13617 then we are at the end of this parameter. */
13621 {
13623 /* Treat invalid names as if the parameter were nameless. */
13626 }
13627 else
13630 /* Create the template parameter. */
13632 identifier);
13634 /* If the next token is an `=', then there is a
13635 default-argument. */
13637 {
13640 /* Consume the `='. */
13642 /* Parse the id-expression. */
13644 /* save token before parsing the id-expression, for error
13645 reporting */
13647 default_argument
13655 /* If the id-expression was a template-id that refers to
13656 a template-class, we already have the declaration here,
13657 so no further lookup is needed. */
13658 ;
13659 else
13660 /* Look up the name. */
13661 default_argument
13663 none_type,
13669 /* See if the default argument is valid. */
13670 default_argument
13673 /* Template parameter packs cannot have default
13674 arguments. */
13676 {
13679 "template parameter pack %qD cannot "
13681 identifier);
13682 else
13686 }
13688 }
13689 else
13692 /* Create the combined representation of the parameter and the
13693 default argument. */
13695 }
13701 }
13704 }
13706 /* Parse a template-id.
13708 template-id:
13709 template-name < template-argument-list [opt] >
13711 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13712 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13713 returned. Otherwise, if the template-name names a function, or set
13714 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13715 names a class, returns a TYPE_DECL for the specialization.
13717 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13718 uninstantiated templates. */
13720 static tree
13726 {
13728 tree templ;
13729 tree arguments;
13730 tree template_id;
13737 /* If the next token corresponds to a template-id, there is no need
13738 to reparse it. */
13741 {
13744 /* Get the stored value. */
13746 /* Perform any access checks that were deferred. */
13749 {
13754 tf_warning_or_error);
13755 }
13756 /* Return the stored value. */
13758 }
13760 /* Avoid performing name lookup if there is no possibility of
13761 finding a template-id. */
13764 && !cp_parser_nth_token_starts_template_argument_list_p
13766 {
13769 }
13771 /* Remember where the template-id starts. */
13777 /* Parse the template-name. */
13780 check_dependency_p,
13781 is_declaration,
13782 tag_type,
13785 {
13788 }
13790 /* If we find the sequence `[:' after a template-name, it's probably
13791 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13792 parse correctly the argument list. */
13799 {
13801 /* Change `:' into `::'. */
13803 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13804 CPP_LESS. */
13807 /* Parse the arguments. */
13810 {
13811 /* If we couldn't parse an argument list, then we revert our changes
13812 and return simply an error. Maybe this is not a template-id
13813 after all. */
13818 }
13819 /* Otherwise, emit an error about the invalid digraph, but continue
13820 parsing because we got our argument list. */
13823 {
13826 "%<<:%> is an alternate spelling for %<[%>."
13829 {
13831 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13834 }
13835 }
13836 }
13837 else
13838 {
13839 /* Look for the `<' that starts the template-argument-list. */
13841 {
13844 }
13845 /* Parse the arguments. */
13847 }
13849 /* Build a representation of the specialization. */
13852 TEMPLATE_ID_EXPR,
13856 {
13858 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13859 template (rather than some instantiation thereof) only if
13860 is not nested within some other construct. For example, in
13861 "template <typename T> void f(T) { A<T>::", A<T> is just an
13862 instantiation of A. */
13865 CPP_SCOPE));
13866 template_id
13868 }
13870 {
13872 }
13873 else
13874 {
13875 /* If it's not a class-template or a template-template, it should be
13876 a function-template. */
13882 }
13884 /* If parsing tentatively, replace the sequence of tokens that makes
13885 up the template-id with a CPP_TEMPLATE_ID token. That way,
13886 should we re-parse the token stream, we will not have to repeat
13887 the effort required to do the parse, nor will we issue duplicate
13888 error messages about problems during instantiation of the
13889 template. */
13891 /* Don't do this if we had a parse error in a declarator; re-parsing
13892 might succeed if a name changes meaning (60361). */
13896 {
13899 /* Reset the contents of the START_OF_ID token. */
13901 /* Retrieve any deferred checks. Do not pop this access checks yet
13902 so the memory will not be reclaimed during token replacing below. */
13908 /* Purge all subsequent tokens. */
13911 /* ??? Can we actually assume that, if template_id ==
13912 error_mark_node, we will have issued a diagnostic to the
13913 user, as opposed to simply marking the tentative parse as
13914 failed? */
13917 }
13921 }
13923 /* Parse a template-name.
13925 template-name:
13926 identifier
13928 The standard should actually say:
13930 template-name:
13931 identifier
13932 operator-function-id
13934 A defect report has been filed about this issue.
13936 A conversion-function-id cannot be a template name because they cannot
13937 be part of a template-id. In fact, looking at this code:
13939 a.operator K<int>()
13941 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13942 It is impossible to call a templated conversion-function-id with an
13943 explicit argument list, since the only allowed template parameter is
13944 the type to which it is converting.
13946 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13947 `template' keyword, in a construction like:
13949 T::template f<3>()
13951 In that case `f' is taken to be a template-name, even though there
13952 is no way of knowing for sure.
13954 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13955 name refers to a set of overloaded functions, at least one of which
13956 is a template, or an IDENTIFIER_NODE with the name of the template,
13957 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13958 names are looked up inside uninstantiated templates. */
13960 static tree
13967 {
13968 tree identifier;
13969 tree decl;
13970 tree fns;
13973 /* If the next token is `operator', then we have either an
13974 operator-function-id or a conversion-function-id. */
13976 {
13977 /* We don't know whether we're looking at an
13978 operator-function-id or a conversion-function-id. */
13980 /* Try an operator-function-id. */
13982 /* If that didn't work, try a conversion-function-id. */
13984 {
13987 }
13988 }
13989 /* Look for the identifier. */
13990 else
13993 /* If we didn't find an identifier, we don't have a template-id. */
13997 /* If the name immediately followed the `template' keyword, then it
13998 is a template-name. However, if the next token is not `<', then
13999 we do not treat it as a template-name, since it is not being used
14000 as part of a template-id. This enables us to handle constructs
14001 like:
14003 template <typename T> struct S { S(); };
14004 template <typename T> S<T>::S();
14006 correctly. We would treat `S' as a template -- if it were `S<T>'
14007 -- but we do not if there is no `<'. */
14011 {
14012 /* In a declaration, in a dependent context, we pretend that the
14013 "template" keyword was present in order to improve error
14014 recovery. For example, given:
14016 template <typename T> void f(T::X<int>);
14018 we want to treat "X<int>" as a template-id. */
14020 && !template_keyword_p
14022 && check_dependency_p
14024 /* Do not do this for dtors (or ctors), since they never
14025 need the template keyword before their name. */
14027 {
14030 /* Explain what went wrong. */
14032 identifier);
14035 /* If parsing tentatively, find the location of the "<" token. */
14038 /* Parse the template arguments so that we can issue error
14039 messages about them. */
14042 /* Skip tokens until we find a good place from which to
14043 continue parsing. */
14048 /* If parsing tentatively, permanently remove the
14049 template argument list. That will prevent duplicate
14050 error messages from being issued about the missing
14051 "template" keyword. */
14057 }
14059 /* If the "template" keyword is present, then there is generally
14060 no point in doing name-lookup, so we just return IDENTIFIER.
14061 But, if the qualifying scope is non-dependent then we can
14062 (and must) do name-lookup normally. */
14068 }
14070 /* Look up the name. */
14072 tag_type,
14075 check_dependency_p,
14081 /* If DECL is a template, then the name was a template-name. */
14083 {
14087 }
14088 else
14089 {
14092 /* The standard does not explicitly indicate whether a name that
14093 names a set of overloaded declarations, some of which are
14094 templates, is a template-name. However, such a name should
14095 be a template-name; otherwise, there is no way to form a
14096 template-id for the overloaded templates. */
14104 {
14105 /* The name does not name a template. */
14108 }
14109 }
14111 /* If DECL is dependent, and refers to a function, then just return
14112 its name; we will look it up again during template instantiation. */
14114 {
14118 }
14121 }
14123 /* Parse a template-argument-list.
14125 template-argument-list:
14126 template-argument ... [opt]
14127 template-argument-list , template-argument ... [opt]
14129 Returns a TREE_VEC containing the arguments. */
14131 static tree
14133 {
14138 tree vec;
14145 /* Even if the template-id appears in an integral
14146 constant-expression, the contents of the argument list do
14147 not. */
14153 /* Parse the arguments. */
14154 do
14155 {
14156 tree argument;
14159 /* Consume the comma. */
14162 /* Parse the template-argument. */
14165 /* If the next token is an ellipsis, we're expanding a template
14166 argument pack. */
14168 {
14170 {
14174 }
14175 /* Consume the `...' token. */
14178 /* Make the argument into a TYPE_PACK_EXPANSION or
14179 EXPR_PACK_EXPANSION. */
14181 }
14184 {
14188 {
14191 }
14192 else
14194 }
14196 }
14209 #ifdef ENABLE_CHECKING
14211 #endif
14213 }
14215 /* Parse a template-argument.
14217 template-argument:
14218 assignment-expression
14219 type-id
14220 id-expression
14222 The representation is that of an assignment-expression, type-id, or
14223 id-expression -- except that the qualified id-expression is
14224 evaluated, so that the value returned is either a DECL or an
14225 OVERLOAD.
14227 Although the standard says "assignment-expression", it forbids
14228 throw-expressions or assignments in the template argument.
14229 Therefore, we use "conditional-expression" instead. */
14231 static tree
14233 {
14234 tree argument;
14240 cp_id_kind idk;
14242 /* There's really no way to know what we're looking at, so we just
14243 try each alternative in order.
14245 [temp.arg]
14247 In a template-argument, an ambiguity between a type-id and an
14248 expression is resolved to a type-id, regardless of the form of
14249 the corresponding template-parameter.
14251 Therefore, we try a type-id first. */
14254 /* If there was no error parsing the type-id but the next token is a
14255 '>>', our behavior depends on which dialect of C++ we're
14256 parsing. In C++98, we probably found a typo for '> >'. But there
14257 are type-id which are also valid expressions. For instance:
14259 struct X { int operator >> (int); };
14260 template <int V> struct Foo {};
14261 Foo<X () >> 5> r;
14263 Here 'X()' is a valid type-id of a function type, but the user just
14264 wanted to write the expression "X() >> 5". Thus, we remember that we
14265 found a valid type-id, but we still try to parse the argument as an
14266 expression to see what happens.
14268 In C++0x, the '>>' will be considered two separate '>'
14269 tokens. */
14273 {
14276 }
14277 else
14278 {
14279 /* If the next token isn't a `,' or a `>', then this argument wasn't
14280 really finished. This means that the argument is not a valid
14281 type-id. */
14284 /* If that worked, we're done. */
14287 }
14288 /* We're still not sure what the argument will be. */
14290 /* Try a template. */
14298 /* If the next token isn't a `,' or a `>', then this argument wasn't
14299 really finished. */
14303 {
14304 /* Figure out what is being referred to. If the id-expression
14305 was for a class template specialization, then we will have a
14306 TYPE_DECL at this point. There is no need to do name lookup
14307 at this point in that case. */
14310 none_type,
14319 }
14321 {
14325 }
14326 /* It must be a non-type argument. There permitted cases are given
14327 in [temp.arg.nontype]:
14329 -- an integral constant-expression of integral or enumeration
14330 type; or
14332 -- the name of a non-type template-parameter; or
14334 -- the name of an object or function with external linkage...
14336 -- the address of an object or function with external linkage...
14338 -- a pointer to member... */
14339 /* Look for a non-type template parameter. */
14341 {
14353 }
14355 /* If the next token is "&", the argument must be the address of an
14356 object or function with external linkage. */
14359 {
14362 }
14363 /* See if we might have an id-expression. */
14370 {
14373 address_p,
14380 else
14381 {
14382 tree probe;
14385 {
14386 /* Strip the dereference temporarily. */
14389 }
14391 /* If we're in a template, we represent a qualified-id referring
14392 to a static data member as a SCOPE_REF even if the scope isn't
14393 dependent so that we can check access control later. */
14398 {
14399 /* A variable without external linkage might still be a
14400 valid constant-expression, so no error is issued here
14401 if the external-linkage check fails. */
14404 }
14406 /* All overloaded functions are allowed; if the external
14407 linkage test does not pass, an error will be issued
14408 later. */
14409 ;
14413 /* A pointer-to-member. */
14414 ;
14416 ;
14417 else
14421 {
14424 tf_warning_or_error);
14425 else
14428 }
14429 }
14430 }
14431 /* If the argument started with "&", there are no other valid
14432 alternatives at this point. */
14434 {
14437 }
14439 /* If the argument wasn't successfully parsed as a type-id followed
14440 by '>>', the argument can only be a constant expression now.
14441 Otherwise, we try parsing the constant-expression tentatively,
14442 because the argument could really be a type-id. */
14453 /* We did our best to parse the argument as a non type-id, but that
14454 was the only alternative that matched (albeit with a '>' after
14455 it). We can assume it's just a typo from the user, and a
14456 diagnostic will then be issued. */
14458 }
14460 /* Parse an explicit-instantiation.
14462 explicit-instantiation:
14463 template declaration
14465 Although the standard says `declaration', what it really means is:
14467 explicit-instantiation:
14468 template decl-specifier-seq [opt] declarator [opt] ;
14470 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14471 supposed to be allowed. A defect report has been filed about this
14472 issue.
14474 GNU Extension:
14476 explicit-instantiation:
14477 storage-class-specifier template
14478 decl-specifier-seq [opt] declarator [opt] ;
14479 function-specifier template
14480 decl-specifier-seq [opt] declarator [opt] ; */
14482 static void
14484 {
14486 cp_decl_specifier_seq decl_specifiers;
14491 /* Look for an (optional) storage-class-specifier or
14492 function-specifier. */
14494 {
14495 extension_specifier
14498 extension_specifier
14501 }
14503 /* Look for the `template' keyword. */
14505 /* Let the front end know that we are processing an explicit
14506 instantiation. */
14508 /* [temp.explicit] says that we are supposed to ignore access
14509 control while processing explicit instantiation directives. */
14511 /* Parse a decl-specifier-seq. */
14513 CP_PARSER_FLAGS_OPTIONAL,
14516 /* If there was exactly one decl-specifier, and it declared a class,
14517 and there's no declarator, then we have an explicit type
14518 instantiation. */
14520 {
14521 tree type;
14525 /* Turn access control back on for names used during
14526 template instantiation. */
14531 }
14532 else
14533 {
14535 tree decl;
14537 /* Parse the declarator. */
14538 declarator
14549 {
14552 "explicit instantiation shall not use"
14556 "explicit instantiation shall not use"
14561 /* Turn access control back on for names used during
14562 template instantiation. */
14564 /* Do the explicit instantiation. */
14566 }
14567 else
14568 {
14570 /* Skip the body of the explicit instantiation. */
14572 }
14573 }
14574 /* We're done with the instantiation. */
14580 }
14582 /* Parse an explicit-specialization.
14584 explicit-specialization:
14585 template < > declaration
14587 Although the standard says `declaration', what it really means is:
14589 explicit-specialization:
14590 template <> decl-specifier [opt] init-declarator [opt] ;
14591 template <> function-definition
14592 template <> explicit-specialization
14593 template <> template-declaration */
14595 static void
14597 {
14601 /* Look for the `template' keyword. */
14603 /* Look for the `<'. */
14605 /* Look for the `>'. */
14607 /* We have processed another parameter list. */
14609 /* [temp]
14611 A template ... explicit specialization ... shall not have C
14612 linkage. */
14614 {
14616 /* Give it C++ linkage to avoid confusing other parts of the
14617 front end. */
14620 }
14621 else
14623 /* Let the front end know that we are beginning a specialization. */
14625 {
14628 }
14630 /* If the next keyword is `template', we need to figure out whether
14631 or not we're looking a template-declaration. */
14633 {
14638 else
14640 }
14641 else
14642 /* Parse the dependent declaration. */
14648 /* We're done with the specialization. */
14650 /* For the erroneous case of a template with C linkage, we pushed an
14651 implicit C++ linkage scope; exit that scope now. */
14654 /* We're done with this parameter list. */
14656 }
14658 /* Parse a type-specifier.
14660 type-specifier:
14661 simple-type-specifier
14662 class-specifier
14663 enum-specifier
14664 elaborated-type-specifier
14665 cv-qualifier
14667 GNU Extension:
14669 type-specifier:
14670 __complex__
14672 Returns a representation of the type-specifier. For a
14673 class-specifier, enum-specifier, or elaborated-type-specifier, a
14674 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14676 The parser flags FLAGS is used to control type-specifier parsing.
14678 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14679 in a decl-specifier-seq.
14681 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14682 class-specifier, enum-specifier, or elaborated-type-specifier, then
14683 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14684 if a type is declared; 2 if it is defined. Otherwise, it is set to
14685 zero.
14687 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14688 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14689 is set to FALSE. */
14691 static tree
14693 cp_parser_flags flags,
14698 {
14704 /* Assume this type-specifier does not declare a new type. */
14707 /* And that it does not specify a cv-qualifier. */
14710 /* Peek at the next token. */
14713 /* If we're looking at a keyword, we can use that to guide the
14714 production we choose. */
14717 {
14722 /* Look for the enum-specifier. */
14724 /* If that worked, we're done. */
14726 {
14731 type_spec,
14732 token,
14735 }
14736 else
14739 /* Any of these indicate either a class-specifier, or an
14740 elaborated-type-specifier. */
14747 /* Parse tentatively so that we can back up if we don't find a
14748 class-specifier. */
14750 /* Look for the class-specifier. */
14753 /* If that worked, we're done. */
14755 {
14760 type_spec,
14761 token,
14764 }
14766 /* Fall through. */
14767 elaborated_type_specifier:
14768 /* We're declaring (not defining) a class or enum. */
14772 /* Fall through. */
14774 /* Look for an elaborated-type-specifier. */
14775 type_spec
14776 = (cp_parser_elaborated_type_specifier
14779 is_declaration));
14782 type_spec,
14783 token,
14806 /* The `__complex__' keyword is a GNU extension. */
14812 }
14814 /* Handle simple keywords. */
14816 {
14818 {
14821 }
14823 }
14825 /* If we do not already have a type-specifier, assume we are looking
14826 at a simple-type-specifier. */
14828 decl_specs,
14829 flags);
14831 /* If we didn't find a type-specifier, and a type-specifier was not
14832 optional in this context, issue an error message. */
14834 {
14837 }
14840 }
14842 /* Parse a simple-type-specifier.
14844 simple-type-specifier:
14845 :: [opt] nested-name-specifier [opt] type-name
14846 :: [opt] nested-name-specifier template template-id
14847 char
14848 wchar_t
14849 bool
14850 short
14851 int
14852 long
14853 signed
14854 unsigned
14855 float
14856 double
14857 void
14859 C++0x Extension:
14861 simple-type-specifier:
14862 auto
14863 decltype ( expression )
14864 char16_t
14865 char32_t
14866 __underlying_type ( type-id )
14868 GNU Extension:
14870 simple-type-specifier:
14871 __int128
14872 __typeof__ unary-expression
14873 __typeof__ ( type-id )
14874 __typeof__ ( type-id ) { initializer-list , [opt] }
14876 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14877 appropriately updated. */
14879 static tree
14882 cp_parser_flags flags)
14883 {
14888 /* Peek at the next token. */
14891 /* If we're looking at a keyword, things are easy. */
14893 {
14928 {
14931 }
14960 {
14961 /* The 'auto' might be the placeholder return type for a function decl
14962 with trailing return type. */
14966 {
14974 have_trailing_return_fn_decl
14977 }
14980 {
14983 }
14987 else
14991 {
14994 "use of %<auto%> in lambda parameter declaration "
14995 "only available with "
14997 }
15000 "use of %<auto%> in parameter declaration "
15001 "only available with "
15003 else
15005 "ISO C++ forbids use of %<auto%> in parameter "
15007 }
15008 else
15013 /* Since DR 743, decltype can either be a simple-type-specifier by
15014 itself or begin a nested-name-specifier. Parsing it will replace
15015 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
15016 handling below decide what to do. */
15022 /* Consume the `typeof' token. */
15024 /* Parse the operand to `typeof'. */
15026 /* If it is not already a TYPE, take its type. */
15032 token,
15041 token,
15051 token,
15056 }
15058 /* If token is an already-parsed decltype not followed by ::,
15059 it's a simple-type-specifier. */
15062 {
15065 {
15067 token,
15069 /* Remember that we are handling a decltype in order to
15070 implement the resolution of DR 1510 when the argument
15071 isn't instantiation dependent. */
15073 }
15076 }
15078 /* If the type-specifier was for a built-in type, we're done. */
15080 {
15081 /* Record the type. */
15088 type,
15089 token,
15094 /* Consume the token. */
15100 /* There is no valid C++ program where a non-template type is
15101 followed by a "<". That usually indicates that the user thought
15102 that the type was a template. */
15107 }
15109 /* The type-specifier must be a user-defined type. */
15111 {
15115 /* Don't gobble tokens or issue error messages if this is an
15116 optional type-specifier. */
15120 /* Look for the optional `::' operator. */
15121 global_p
15125 /* Look for the nested-name specifier. */
15126 qualified_p
15134 /* If we have seen a nested-name-specifier, and the next token
15135 is `template', then we are using the template-id production. */
15138 {
15139 /* Look for the template-id. */
15143 none_type,
15145 /* If the template-id did not name a type, we are out of
15146 luck. */
15148 {
15151 }
15152 }
15153 /* Otherwise, look for a type-name. */
15154 else
15156 /* Keep track of all name-lookups performed in class scopes. */
15158 && !global_p
15159 && !qualified_p
15163 /* If it didn't work out, we don't have a TYPE. */
15169 token,
15171 }
15173 /* If we didn't get a type-name, issue an error message. */
15175 {
15178 }
15181 {
15182 /* See if TYPE is an Objective-C type, and if so, parse and
15183 accept any protocol references following it. Do this before
15184 the cp_parser_check_for_invalid_template_id() call, because
15185 Objective-C types can be followed by '<...>' which would
15186 enclose protocol names rather than template arguments, and so
15187 everything is fine. */
15190 {
15194 /* Clobber the "unqualified" type previously entered into
15195 DECL_SPECS with the new, improved protocol-qualified version. */
15200 }
15202 /* There is no valid C++ program where a non-template type is
15203 followed by a "<". That usually indicates that the user
15204 thought that the type was a template. */
15206 none_type,
15208 }
15211 }
15213 /* Parse a type-name.
15215 type-name:
15216 class-name
15217 enum-name
15218 typedef-name
15219 simple-template-id [in c++0x]
15221 enum-name:
15222 identifier
15224 typedef-name:
15225 identifier
15227 Returns a TYPE_DECL for the type. */
15229 static tree
15231 {
15232 tree type_decl;
15234 /* We can't know yet whether it is a class-name or not. */
15236 /* Try a class-name. */
15240 none_type,
15244 /* If it's not a class-name, keep looking. */
15246 {
15248 /* It must be a typedef-name or an enum-name. */
15252 /* It is either a simple-template-id representing an
15253 instantiation of an alias template... */
15257 none_type,
15259 /* Note that this must be an instantiation of an alias template
15260 because [temp.names]/6 says:
15262 A template-id that names an alias template specialization
15263 is a type-name.
15265 Whereas [temp.names]/7 says:
15267 A simple-template-id that names a class template
15268 specialization is a class-name. */
15273 else
15277 /* ... Or a typedef-name or an enum-name. */
15279 }
15282 }
15284 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15286 enum-name:
15287 identifier
15289 typedef-name:
15290 identifier
15292 Returns a TYPE_DECL for the type. */
15294 static tree
15296 {
15297 tree type_decl;
15298 tree identifier;
15305 /* Look up the type-name. */
15312 {
15313 /* See if this is an Objective-C type. */
15318 }
15320 /* Issue an error if we did not find a type-name. */
15322 /* In Objective-C, we have the complication that class names are
15323 normally type names and start declarations (eg, the
15324 "NSObject" in "NSObject *object;"), but can be used in an
15325 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15326 is an expression. So, a classname followed by a dot is not a
15327 valid type-name. */
15330 {
15335 }
15336 /* Remember that the name was used in the definition of the
15337 current class so that we can check later to see if the
15338 meaning would have been different after the class was
15339 entirely defined. */
15345 }
15347 /* Parse an elaborated-type-specifier. Note that the grammar given
15348 here incorporates the resolution to DR68.
15350 elaborated-type-specifier:
15351 class-key :: [opt] nested-name-specifier [opt] identifier
15352 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15353 enum-key :: [opt] nested-name-specifier [opt] identifier
15354 typename :: [opt] nested-name-specifier identifier
15355 typename :: [opt] nested-name-specifier template [opt]
15356 template-id
15358 GNU extension:
15360 elaborated-type-specifier:
15361 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15362 class-key attributes :: [opt] nested-name-specifier [opt]
15363 template [opt] template-id
15364 enum attributes :: [opt] nested-name-specifier [opt] identifier
15366 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15367 declared `friend'. If IS_DECLARATION is TRUE, then this
15368 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15369 something is being declared.
15371 Returns the TYPE specified. */
15373 static tree
15377 {
15379 tree identifier;
15382 tree globalscope;
15385 /* See if we're looking at the `enum' keyword. */
15387 {
15388 /* Consume the `enum' token. */
15390 /* Remember that it's an enumeration type. */
15392 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15393 enums) is used here. */
15396 {
15400 /* Consume the `struct' or `class' and parse it anyway. */
15402 }
15403 /* Parse the attributes. */
15405 }
15406 /* Or, it might be `typename'. */
15408 RID_TYPENAME))
15409 {
15410 /* Consume the `typename' token. */
15412 /* Remember that it's a `typename' type. */
15414 }
15415 /* Otherwise it must be a class-key. */
15416 else
15417 {
15421 /* Parse the attributes. */
15423 }
15425 /* Look for the `::' operator. */
15428 /* Look for the nested-name-specifier. */
15430 {
15435 is_declaration))
15437 }
15438 else
15439 /* Even though `typename' is not present, the proposed resolution
15440 to Core Issue 180 says that in `class A<T>::B', `B' should be
15441 considered a type-name, even if `A<T>' is dependent. */
15446 is_declaration);
15447 /* For everything but enumeration types, consider a template-id.
15448 For an enumeration type, consider only a plain identifier. */
15450 {
15452 tree decl;
15454 /* Allow the `template' keyword. */
15456 /* If we didn't see `template', we don't know if there's a
15457 template-id or not. */
15460 /* Parse the template-id. */
15464 tag_type,
15465 is_declaration);
15466 /* If we didn't find a template-id, look for an ordinary
15467 identifier. */
15469 ;
15470 /* We can get here when cp_parser_template_id, called by
15471 cp_parser_class_name with tag_type == none_type, succeeds
15472 and caches a BASELINK. Then, when called again here,
15473 instead of failing and returning an error_mark_node
15474 returns it (see template/typename17.C in C++11).
15475 ??? Could we diagnose this earlier? */
15477 {
15480 }
15481 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15482 in effect, then we must assume that, upon instantiation, the
15483 template will correspond to a class. */
15487 typename_type,
15489 /* If the `typename' keyword is in effect and DECL is not a type
15490 decl, then type is non existent. */
15492 ;
15498 }
15501 {
15506 {
15509 }
15511 /* For a `typename', we needn't call xref_tag. */
15517 /* Template parameter lists apply only if we are not within a
15518 function parameter list. */
15519 bool template_parm_lists_apply
15528 /* Look up a qualified name in the usual way. */
15530 {
15531 tree decl;
15532 tree ambiguous_decls;
15535 tag_type,
15542 /* If the lookup was ambiguous, an error will already have been
15543 issued. */
15547 /* If we are parsing friend declaration, DECL may be a
15548 TEMPLATE_DECL tree node here. However, we need to check
15549 whether this TEMPLATE_DECL results in valid code. Consider
15550 the following example:
15552 namespace N {
15553 template <class T> class C {};
15554 }
15555 class X {
15556 template <class T> friend class N::C; // #1, valid code
15557 };
15558 template <class T> class Y {
15559 friend class N::C; // #2, invalid code
15560 };
15562 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15563 name lookup of `N::C'. We see that friend declaration must
15564 be template for the code to be valid. Note that
15565 processing_template_decl does not work here since it is
15566 always 1 for the above two cases. */
15568 decl = (cp_parser_maybe_treat_template_as_class
15573 {
15575 identifier,
15578 }
15581 {
15585 allow_template);
15589 }
15591 /* Forward declarations of nested types, such as
15593 class C1::C2;
15594 class C1::C2::C3;
15596 are invalid unless all components preceding the final '::'
15597 are complete. If all enclosing types are complete, these
15598 declarations become merely pointless.
15600 Invalid forward declarations of nested types are errors
15601 caught elsewhere in parsing. Those that are pointless arrive
15602 here. */
15609 }
15610 else
15611 {
15612 /* An elaborated-type-specifier sometimes introduces a new type and
15613 sometimes names an existing type. Normally, the rule is that it
15614 introduces a new type only if there is not an existing type of
15615 the same name already in scope. For example, given:
15617 struct S {};
15618 void f() { struct S s; }
15620 the `struct S' in the body of `f' is the same `struct S' as in
15621 the global scope; the existing definition is used. However, if
15622 there were no global declaration, this would introduce a new
15623 local class named `S'.
15625 An exception to this rule applies to the following code:
15627 namespace N { struct S; }
15629 Here, the elaborated-type-specifier names a new type
15630 unconditionally; even if there is already an `S' in the
15631 containing scope this declaration names a new type.
15632 This exception only applies if the elaborated-type-specifier
15633 forms the complete declaration:
15635 [class.name]
15637 A declaration consisting solely of `class-key identifier ;' is
15638 either a redeclaration of the name in the current scope or a
15639 forward declaration of the identifier as a class name. It
15640 introduces the name into the current scope.
15642 We are in this situation precisely when the next token is a `;'.
15644 An exception to the exception is that a `friend' declaration does
15645 *not* name a new type; i.e., given:
15647 struct S { friend struct T; };
15649 `T' is not a new type in the scope of `S'.
15651 Also, `new struct S' or `sizeof (struct S)' never results in the
15652 definition of a new type; a new type can only be declared in a
15653 declaration context. */
15655 tag_scope ts;
15659 /* Friends have special name lookup rules. */
15663 CPP_SEMICOLON))
15664 /* This is a `class-key identifier ;' */
15666 else
15669 template_p =
15670 (template_parm_lists_apply
15673 /* An unqualified name was used to reference this type, so
15674 there were no qualifying templates. */
15682 }
15683 }
15688 /* Allow attributes on forward declarations of classes. */
15690 {
15700 else
15703 }
15706 {
15707 /* Indicate whether this class was declared as a `class' or as a
15708 `struct'. */
15712 }
15714 /* A "<" cannot follow an elaborated type specifier. If that
15715 happens, the user was probably trying to form a template-id. */
15720 }
15722 /* Parse an enum-specifier.
15724 enum-specifier:
15725 enum-head { enumerator-list [opt] }
15726 enum-head { enumerator-list , } [C++0x]
15728 enum-head:
15729 enum-key identifier [opt] enum-base [opt]
15730 enum-key nested-name-specifier identifier enum-base [opt]
15732 enum-key:
15733 enum
15734 enum class [C++0x]
15735 enum struct [C++0x]
15737 enum-base: [C++0x]
15738 : type-specifier-seq
15740 opaque-enum-specifier:
15741 enum-key identifier enum-base [opt] ;
15743 GNU Extensions:
15744 enum-key attributes[opt] identifier [opt] enum-base [opt]
15745 { enumerator-list [opt] }attributes[opt]
15746 enum-key attributes[opt] identifier [opt] enum-base [opt]
15747 { enumerator-list, }attributes[opt] [C++0x]
15749 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15750 if the token stream isn't an enum-specifier after all. */
15752 static tree
15754 {
15755 tree identifier;
15757 tree prev_scope;
15759 tree attributes;
15772 /* Parse tentatively so that we can back up if we don't find a
15773 enum-specifier. */
15776 /* Caller guarantees that the current token is 'enum', an identifier
15777 possibly follows, and the token after that is an opening brace.
15778 If we don't have an identifier, fabricate an anonymous name for
15779 the enumeration being defined. */
15782 /* Parse the "class" or "struct", which indicates a scoped
15783 enumeration type in C++0x. */
15786 {
15790 /* Consume the `struct' or `class' token. */
15794 }
15798 /* Clear the qualification. */
15803 /* Figure out in what scope the declaration is being placed. */
15809 nested_name_specifier
15817 {
15818 tree name;
15822 enum_type,
15827 input_location);
15829 {
15832 {
15833 /* Are template enums allowed in ISO? */
15837 /* ignore a typename reference, for it will be solved by name
15838 in start_enum. */
15840 }
15841 }
15844 else
15847 }
15848 else
15849 {
15852 else
15853 {
15859 }
15860 }
15863 /* Check for the `:' that denotes a specified underlying type in C++0x.
15864 Note that a ':' could also indicate a bitfield width, however. */
15866 {
15867 cp_decl_specifier_seq type_specifiers;
15869 /* Consume the `:'. */
15872 /* Parse the type-specifier-seq. */
15877 /* At this point this is surely not elaborated type specifier. */
15886 /* If that didn't work, stop. */
15888 {
15894 }
15895 }
15897 /* Look for the `{' but don't consume it yet. */
15899 {
15901 {
15904 {
15907 }
15908 }
15909 /* An opaque-enum-specifier must have a ';' here. */
15912 {
15915 {
15918 }
15919 }
15920 }
15926 {
15928 {
15932 }
15934 {
15936 }
15937 }
15939 /* Issue an error message if type-definitions are forbidden here. */
15942 else
15943 /* Create the new type. We do this before consuming the opening
15944 brace so the enum will be recorded as being on the line of its
15945 tag (or the 'enum' keyword, if there is no tag). */
15949 /* If the next token is not '{' it is an opaque-enum-specifier or an
15950 elaborated-type-specifier. */
15952 {
15956 {
15957 /* The following catches invalid code such as:
15958 enum class S<int>::E { A, B, C }; */
15966 {
15970 nested_name_specifier);
15972 }
15973 /* If that scope does not contain the scope in which the
15974 class was originally declared, the program is invalid. */
15976 nested_name_specifier))
15977 {
15980 "declaration of %qD in namespace %qD which does not "
15983 else
15985 "declaration of %qD in %qD which does not "
15989 }
15990 }
15995 /* Consume the opening brace. */
16002 {
16006 }
16007 else
16008 {
16014 }
16018 /* If the next token is not '}', then there are some enumerators. */
16020 {
16024 }
16025 else
16028 /* Consume the final '}'. */
16034 }
16035 else
16036 {
16037 /* If a ';' follows, then it is an opaque-enum-specifier
16038 and additional restrictions apply. */
16040 {
16047 }
16048 }
16050 /* Look for trailing attributes to apply to this enumeration, and
16051 apply them if appropriate. */
16053 {
16057 trailing_attr,
16059 }
16061 /* Finish up the enumeration. */
16063 {
16068 }
16071 {
16073 {
16076 }
16078 {
16080 }
16081 }
16082 out:
16085 }
16087 /* Parse an enumerator-list. The enumerators all have the indicated
16088 TYPE.
16090 enumerator-list:
16091 enumerator-definition
16092 enumerator-list , enumerator-definition */
16094 static void
16096 {
16098 {
16099 /* Parse an enumerator-definition. */
16102 /* If the next token is not a ',', we've reached the end of
16103 the list. */
16106 /* Otherwise, consume the `,' and keep going. */
16108 /* If the next token is a `}', there is a trailing comma. */
16110 {
16115 }
16116 }
16117 }
16119 /* Parse an enumerator-definition. The enumerator has the indicated
16120 TYPE.
16122 enumerator-definition:
16123 enumerator
16124 enumerator = constant-expression
16126 enumerator:
16127 identifier
16129 GNU Extensions:
16131 enumerator-definition:
16132 enumerator attributes [opt]
16133 enumerator attributes [opt] = constant-expression */
16135 static void
16137 {
16138 tree identifier;
16139 tree value;
16140 location_t loc;
16142 /* Save the input location because we are interested in the location
16143 of the identifier and not the location of the explicit value. */
16146 /* Look for the identifier. */
16151 /* Parse any specified attributes. */
16154 /* If the next token is an '=', then there is an explicit value. */
16156 {
16157 /* Consume the `=' token. */
16159 /* Parse the value. */
16161 }
16162 else
16165 /* If we are processing a template, make sure the initializer of the
16166 enumerator doesn't contain any bare template parameter pack. */
16170 /* Create the enumerator. */
16172 }
16174 /* Parse a namespace-name.
16176 namespace-name:
16177 original-namespace-name
16178 namespace-alias
16180 Returns the NAMESPACE_DECL for the namespace. */
16182 static tree
16184 {
16185 tree identifier;
16186 tree namespace_decl;
16190 /* Get the name of the namespace. */
16195 /* Look up the identifier in the currently active scope. Look only
16196 for namespaces, due to:
16198 [basic.lookup.udir]
16200 When looking up a namespace-name in a using-directive or alias
16201 definition, only namespace names are considered.
16203 And:
16205 [basic.lookup.qual]
16207 During the lookup of a name preceding the :: scope resolution
16208 operator, object, function, and enumerator names are ignored.
16210 (Note that cp_parser_qualifying_entity only calls this
16211 function if the token after the name is the scope resolution
16212 operator.) */
16214 none_type,
16220 /* If it's not a namespace, issue an error. */
16223 {
16228 }
16231 }
16233 /* Parse a namespace-definition.
16235 namespace-definition:
16236 named-namespace-definition
16237 unnamed-namespace-definition
16239 named-namespace-definition:
16240 original-namespace-definition
16241 extension-namespace-definition
16243 original-namespace-definition:
16244 namespace identifier { namespace-body }
16246 extension-namespace-definition:
16247 namespace original-namespace-name { namespace-body }
16249 unnamed-namespace-definition:
16250 namespace { namespace-body } */
16252 static void
16254 {
16261 {
16265 }
16266 else
16269 /* Look for the `namespace' keyword. */
16272 /* Get the name of the namespace. We do not attempt to distinguish
16273 between an original-namespace-definition and an
16274 extension-namespace-definition at this point. The semantic
16275 analysis routines are responsible for that. */
16278 else
16281 /* Parse any specified attributes. */
16284 /* Look for the `{' to start the namespace. */
16286 /* Start the namespace. */
16289 /* "inline namespace" is equivalent to a stub namespace definition
16290 followed by a strong using directive. */
16292 {
16294 /* Set up namespace association. */
16298 /* Import the contents of the inline namespace. */
16302 }
16306 /* Parse the body of the namespace. */
16312 /* Finish the namespace. */
16314 /* Look for the final `}'. */
16316 }
16318 /* Parse a namespace-body.
16320 namespace-body:
16321 declaration-seq [opt] */
16323 static void
16325 {
16327 }
16329 /* Parse a namespace-alias-definition.
16331 namespace-alias-definition:
16332 namespace identifier = qualified-namespace-specifier ; */
16334 static void
16336 {
16337 tree identifier;
16338 tree namespace_specifier;
16342 /* Look for the `namespace' keyword. */
16344 /* Look for the identifier. */
16348 /* Look for the `=' token. */
16351 {
16353 /* Skip the definition. */
16358 }
16360 /* Look for the qualified-namespace-specifier. */
16361 namespace_specifier
16363 /* Look for the `;' token. */
16366 /* Register the alias in the symbol table. */
16368 }
16370 /* Parse a qualified-namespace-specifier.
16372 qualified-namespace-specifier:
16373 :: [opt] nested-name-specifier [opt] namespace-name
16375 Returns a NAMESPACE_DECL corresponding to the specified
16376 namespace. */
16378 static tree
16380 {
16381 /* Look for the optional `::'. */
16385 /* Look for the optional nested-name-specifier. */
16393 }
16395 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16396 access declaration.
16398 using-declaration:
16399 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16400 using :: unqualified-id ;
16402 access-declaration:
16403 qualified-id ;
16405 */
16407 static bool
16410 {
16414 tree decl;
16415 tree identifier;
16416 tree qscope;
16421 {
16424 }
16425 else
16426 {
16427 /* Look for the `using' keyword. */
16430 /* Peek at the next token. */
16432 /* See if it's `typename'. */
16434 {
16435 /* Remember that we've seen it. */
16437 /* Consume the `typename' token. */
16439 }
16440 }
16442 /* Look for the optional global scope qualification. */
16443 global_scope_p
16448 /* If we saw `typename', or didn't see `::', then there must be a
16449 nested-name-specifier present. */
16451 {
16457 {
16460 }
16461 }
16462 /* Otherwise, we could be in either of the two productions. In that
16463 case, treat the nested-name-specifier as optional. */
16464 else
16476 /* Something has already gone wrong; there's no need to parse
16477 further. Since an error has occurred, the return value of
16478 cp_parser_parse_definitely will be false, as required. */
16482 /* Parse the unqualified-id. */
16490 {
16495 }
16497 /* The function we call to handle a using-declaration is different
16498 depending on what scope we are in. */
16500 ;
16503 /* [namespace.udecl]
16505 A using declaration shall not name a template-id. */
16508 else
16509 {
16511 {
16512 /* Create the USING_DECL. */
16519 {
16522 }
16523 else
16524 /* Add it to the list of members in this class. */
16526 }
16527 else
16528 {
16530 identifier,
16537 {
16540 }
16543 else
16545 }
16546 }
16548 /* Look for the final `;'. */
16553 "access declarations are deprecated "
16554 "in favour of using-declarations; "
16558 }
16560 /* Parse an alias-declaration.
16562 alias-declaration:
16563 using identifier attribute-specifier-seq [opt] = type-id */
16565 static tree
16567 {
16569 location_t id_location;
16571 cp_decl_specifier_seq decl_specs;
16575 /* Look for the `using' keyword. */
16576 cp_token *using_token
16598 /* Now we are going to parse the type-id of the declaration. */
16600 /*
16601 [dcl.type]/3 says:
16603 "A type-specifier-seq shall not define a class or enumeration
16604 unless it appears in the type-id of an alias-declaration (7.1.3) that
16605 is not the declaration of a template-declaration."
16607 In other words, if we currently are in an alias template, the
16608 type-id should not define a type.
16610 So let's set parser->type_definition_forbidden_message in that
16611 case; cp_parser_check_type_definition (called by
16612 cp_parser_class_specifier) will then emit an error if a type is
16613 defined in the type-id. */
16615 {
16619 }
16623 /* Restore the error message if need be. */
16629 {
16632 }
16634 /* A typedef-name can also be introduced by an alias-declaration. The
16635 identifier following the using keyword becomes a typedef-name. It has
16636 the same semantics as if it were introduced by the typedef
16637 specifier. In particular, it does not define a new type and it shall
16638 not appear in the type-id. */
16643 {
16646 ds_attribute,
16647 attrs_token);
16648 }
16650 ds_typedef,
16651 using_token);
16653 ds_alias,
16654 using_token);
16663 else
16674 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16675 added into the symbol table; otherwise, return the TYPE_DECL. */
16679 {
16683 }
16686 }
16688 /* Parse a using-directive.
16690 using-directive:
16691 using namespace :: [opt] nested-name-specifier [opt]
16692 namespace-name ; */
16694 static void
16696 {
16697 tree namespace_decl;
16698 tree attribs;
16700 /* Look for the `using' keyword. */
16702 /* And the `namespace' keyword. */
16704 /* Look for the optional `::' operator. */
16706 /* And the optional nested-name-specifier. */
16712 /* Get the namespace being used. */
16714 /* And any specified attributes. */
16716 /* Update the symbol table. */
16718 /* Look for the final `;'. */
16720 }
16722 /* Parse an asm-definition.
16724 asm-definition:
16725 asm ( string-literal ) ;
16727 GNU Extension:
16729 asm-definition:
16730 asm volatile [opt] ( string-literal ) ;
16731 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16732 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16733 : asm-operand-list [opt] ) ;
16734 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16735 : asm-operand-list [opt]
16736 : asm-clobber-list [opt] ) ;
16737 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16738 : asm-clobber-list [opt]
16739 : asm-goto-list ) ; */
16741 static void
16743 {
16744 tree string;
16749 tree asm_stmt;
16757 /* Look for the `asm' keyword. */
16762 {
16765 }
16767 /* See if the next token is `volatile'. */
16770 {
16771 /* Remember that we saw the `volatile' keyword. */
16773 /* Consume the token. */
16775 }
16779 {
16780 /* Remember that we saw the `goto' keyword. */
16782 /* Consume the token. */
16784 }
16785 /* Look for the opening `('. */
16788 /* Look for the string. */
16791 {
16795 }
16797 /* If we're allowing GNU extensions, check for the extended assembly
16798 syntax. Unfortunately, the `:' tokens need not be separated by
16799 a space in C, and so, for compatibility, we tolerate that here
16800 too. Doing that means that we have to treat the `::' operator as
16801 two `:' tokens. */
16806 {
16811 /* The extended syntax was used. */
16814 /* Look for outputs. */
16816 {
16817 /* Consume the `:'. */
16819 /* Parse the output-operands. */
16821 CPP_COLON)
16823 CPP_SCOPE)
16825 CPP_CLOSE_PAREN)
16827 {
16831 }
16832 }
16833 /* If the next token is `::', there are no outputs, and the
16834 next token is the beginning of the inputs. */
16836 /* The inputs are coming next. */
16839 /* Look for inputs. */
16842 {
16843 /* Consume the `:' or `::'. */
16845 /* Parse the output-operands. */
16847 CPP_COLON)
16849 CPP_SCOPE)
16851 CPP_CLOSE_PAREN))
16852 {
16856 }
16857 }
16859 /* The clobbers are coming next. */
16862 /* Look for clobbers. */
16865 {
16867 /* Consume the `:' or `::'. */
16869 /* Parse the clobbers. */
16871 CPP_COLON)
16873 CPP_CLOSE_PAREN))
16875 }
16878 /* The labels are coming next. */
16881 /* Look for labels. */
16884 {
16886 /* Consume the `:' or `::'. */
16888 /* Parse the labels. */
16890 }
16894 }
16898 /* Look for the closing `)'. */
16906 {
16907 /* Create the ASM_EXPR. */
16909 {
16912 /* If the extended syntax was not used, mark the ASM_EXPR. */
16914 {
16920 }
16921 }
16922 else
16924 }
16925 }
16927 /* Declarators [gram.dcl.decl] */
16929 /* Parse an init-declarator.
16931 init-declarator:
16932 declarator initializer [opt]
16934 GNU Extension:
16936 init-declarator:
16937 declarator asm-specification [opt] attributes [opt] initializer [opt]
16939 function-definition:
16940 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16941 function-body
16942 decl-specifier-seq [opt] declarator function-try-block
16944 GNU Extension:
16946 function-definition:
16947 __extension__ function-definition
16949 TM Extension:
16951 function-definition:
16952 decl-specifier-seq [opt] declarator function-transaction-block
16954 The DECL_SPECIFIERS apply to this declarator. Returns a
16955 representation of the entity declared. If MEMBER_P is TRUE, then
16956 this declarator appears in a class scope. The new DECL created by
16957 this declarator is returned.
16959 The CHECKS are access checks that should be performed once we know
16960 what entity is being declared (and, therefore, what classes have
16961 befriended it).
16963 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16964 for a function-definition here as well. If the declarator is a
16965 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16966 be TRUE upon return. By that point, the function-definition will
16967 have been completely parsed.
16969 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16970 is FALSE.
16972 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16973 parsed declaration if it is an uninitialized single declarator not followed
16974 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16975 if present, will not be consumed. If returned, this declarator will be
16976 created with SD_INITIALIZED but will not call cp_finish_decl.
16978 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
16979 and there is an initializer, the pointed location_t is set to the
16980 location of the '=' or `(', or '{' in C++11 token introducing the
16981 initializer. */
16983 static tree
16993 {
16997 tree prefix_attributes;
16999 tree asm_specification;
17000 tree initializer;
17002 tree scope;
17004 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
17005 initialized with "= ..", CPP_OPEN_PAREN if initialized with
17006 "(...)". */
17017 /* Gather the attributes that were provided with the
17018 decl-specifiers. */
17021 /* Assume that this is not the declarator for a function
17022 definition. */
17026 /* Default arguments are only permitted for function parameters. */
17030 /* Defer access checks while parsing the declarator; we cannot know
17031 what names are accessible until we know what is being
17032 declared. */
17035 /* Parse the declarator. */
17037 declarator
17042 /* Gather up the deferred checks. */
17047 /* If the DECLARATOR was erroneous, there's no need to go
17048 further. */
17052 /* Check that the number of template-parameter-lists is OK. */
17062 /* Figure out what scope the entity declared by the DECLARATOR is
17063 located in. `grokdeclarator' sometimes changes the scope, so
17064 we compute it now. */
17067 /* Perform any lookups in the declared type which were thought to be
17068 dependent, but are not in the scope of the declarator. */
17069 decl_specifiers->type
17072 /* If we're allowing GNU extensions, look for an
17073 asm-specification. */
17075 {
17076 /* Look for an asm-specification. */
17079 }
17080 else
17083 /* Look for attributes. */
17087 /* Peek at the next token. */
17093 {
17094 /* Check to see if the token indicates the start of a
17095 function-definition. */
17097 {
17099 {
17100 /* If a function-definition should not appear here, issue an
17101 error message. */
17105 }
17107 location_t func_brace_location
17110 /* Neither attributes nor an asm-specification are allowed
17111 on a function-definition. */
17114 "an asm-specification is not allowed "
17118 "attributes are not allowed "
17120 /* This is a function-definition. */
17123 /* Parse the function definition. */
17126 decl_specifiers,
17127 declarator,
17128 prefix_attributes);
17129 else
17130 decl =
17131 (cp_parser_function_definition_from_specifiers_and_declarator
17135 {
17136 /* This is where the prologue starts... */
17139 }
17142 }
17143 }
17145 {
17146 /* A non-template declaration involving a function parameter list
17147 containing an implicit template parameter will be made into a
17148 template. If the resulting declaration is not going to be an
17149 actual function then finish the template scope here to prevent it.
17150 An error message will be issued once we have a decl to talk about.
17152 FIXME probably we should do type deduction rather than create an
17153 implicit template, but the standard currently doesn't allow it. */
17156 }
17158 /* [dcl.dcl]
17160 Only in function declarations for constructors, destructors, and
17161 type conversions can the decl-specifier-seq be omitted.
17163 We explicitly postpone this check past the point where we handle
17164 function-definitions because we tolerate function-definitions
17165 that are missing their return types in some modes. */
17167 {
17171 }
17173 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17177 {
17188 {
17194 }
17195 }
17196 else
17197 {
17198 /* If the init-declarator isn't initialized and isn't followed by a
17199 `,' or `;', it's not a valid init-declarator. */
17202 {
17205 else
17206 {
17210 }
17211 }
17214 }
17216 /* Because start_decl has side-effects, we should only call it if we
17217 know we're going ahead. By this point, we know that we cannot
17218 possibly be looking at any other construct. */
17221 /* Enter the newly declared entry in the symbol table. If we're
17222 processing a declaration in a class-specifier, we wait until
17223 after processing the initializer. */
17225 {
17232 /* Adjust location of decl if declarator->id_loc is more appropriate:
17233 set, and decl wasn't merged with another decl, in which case its
17234 location would be different from input_location, and more accurate. */
17239 }
17241 /* Enter the SCOPE. That way unqualified names appearing in the
17242 initializer will be looked up in SCOPE. */
17245 /* Perform deferred access control checks, now that we know in which
17246 SCOPE the declared entity resides. */
17248 {
17251 /* If the entity being declared is a function, pretend that we
17252 are in its scope. If it is a `friend', it may have access to
17253 things that would not otherwise be accessible. */
17255 {
17258 }
17260 /* Perform access checks for template parameters. */
17263 /* Perform the access control checks for the declarator and the
17264 decl-specifiers. */
17267 /* Restore the saved value. */
17270 }
17272 /* Parse the initializer. */
17277 {
17279 {
17282 else
17283 {
17284 /* If the declaration was erroneous, we don't really
17285 know what the user intended, so just silently
17286 consume the initializer. */
17293 }
17294 }
17295 else
17296 {
17297 /* We want to record the extra mangling scope for in-class
17298 initializers of class members and initializers of static data
17299 member templates. The former involves deferring
17300 parsing of the initializer until end of class as with default
17301 arguments. So right here we only handle the latter. */
17311 }
17312 }
17314 /* The old parser allows attributes to appear after a parenthesized
17315 initializer. Mark Mitchell proposed removing this functionality
17316 on the GCC mailing lists on 2002-08-13. This parser accepts the
17317 attributes -- but ignores them. */
17324 /* And now complain about a non-function implicit template. */
17329 /* For an in-class declaration, use `grokfield' to create the
17330 declaration. */
17332 {
17334 {
17337 }
17345 }
17347 /* Finish processing the declaration. But, skip member
17348 declarations. */
17350 {
17353 asm_specification,
17354 /* If the initializer is in parentheses, then this is
17355 a direct-initialization, which means that an
17356 `explicit' constructor is OK. Otherwise, an
17357 `explicit' constructor cannot be used. */
17360 }
17363 /* Core issue #226 (C++0x only): A default template-argument
17364 shall not be specified in a friend class template
17365 declaration. */
17374 {
17377 else
17379 }
17382 }
17384 /* Parse a declarator.
17386 declarator:
17387 direct-declarator
17388 ptr-operator declarator
17390 abstract-declarator:
17391 ptr-operator abstract-declarator [opt]
17392 direct-abstract-declarator
17394 GNU Extensions:
17396 declarator:
17397 attributes [opt] direct-declarator
17398 attributes [opt] ptr-operator declarator
17400 abstract-declarator:
17401 attributes [opt] ptr-operator abstract-declarator [opt]
17402 attributes [opt] direct-abstract-declarator
17404 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17405 detect constructor, destructor or conversion operators. It is set
17406 to -1 if the declarator is a name, and +1 if it is a
17407 function. Otherwise it is set to zero. Usually you just want to
17408 test for >0, but internally the negative value is used.
17410 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17411 a decl-specifier-seq unless it declares a constructor, destructor,
17412 or conversion. It might seem that we could check this condition in
17413 semantic analysis, rather than parsing, but that makes it difficult
17414 to handle something like `f()'. We want to notice that there are
17415 no decl-specifiers, and therefore realize that this is an
17416 expression, not a declaration.)
17418 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17419 the declarator is a direct-declarator of the form "(...)".
17421 MEMBER_P is true iff this declarator is a member-declarator.
17423 FRIEND_P is true iff this declarator is a friend. */
17427 cp_parser_declarator_kind dcl_kind,
17431 {
17434 cp_cv_quals cv_quals;
17435 tree class_type;
17438 /* Assume this is not a constructor, destructor, or type-conversion
17439 operator. */
17446 /* Check for the ptr-operator production. */
17448 /* Parse the ptr-operator. */
17454 /* If that worked, then we have a ptr-operator. */
17456 {
17457 /* If a ptr-operator was found, then this declarator was not
17458 parenthesized. */
17461 /* The dependent declarator is optional if we are parsing an
17462 abstract-declarator. */
17466 /* Parse the dependent declarator. */
17471 friend_p);
17473 /* If we are parsing an abstract-declarator, we must handle the
17474 case where the dependent declarator is absent. */
17479 declarator = cp_parser_make_indirect_declarator
17481 }
17482 /* Everything else is a direct-declarator. */
17483 else
17484 {
17487 CPP_OPEN_PAREN);
17489 ctor_dtor_or_conv_p,
17491 }
17496 }
17498 /* Parse a direct-declarator or direct-abstract-declarator.
17500 direct-declarator:
17501 declarator-id
17502 direct-declarator ( parameter-declaration-clause )
17503 cv-qualifier-seq [opt]
17504 ref-qualifier [opt]
17505 exception-specification [opt]
17506 direct-declarator [ constant-expression [opt] ]
17507 ( declarator )
17509 direct-abstract-declarator:
17510 direct-abstract-declarator [opt]
17511 ( parameter-declaration-clause )
17512 cv-qualifier-seq [opt]
17513 ref-qualifier [opt]
17514 exception-specification [opt]
17515 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17516 ( abstract-declarator )
17518 Returns a representation of the declarator. DCL_KIND is
17519 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17520 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17521 we are parsing a direct-declarator. It is
17522 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17523 of ambiguity we prefer an abstract declarator, as per
17524 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17525 as for cp_parser_declarator. */
17529 cp_parser_declarator_kind dcl_kind,
17532 {
17542 {
17543 /* Peek at the next token. */
17546 {
17547 /* This is either a parameter-declaration-clause, or a
17548 parenthesized declarator. When we know we are parsing a
17549 named declarator, it must be a parenthesized declarator
17550 if FIRST is true. For instance, `(int)' is a
17551 parameter-declaration-clause, with an omitted
17552 direct-abstract-declarator. But `((*))', is a
17553 parenthesized abstract declarator. Finally, when T is a
17554 template parameter `(T)' is a
17555 parameter-declaration-clause, and not a parenthesized
17556 named declarator.
17558 We first try and parse a parameter-declaration-clause,
17559 and then try a nested declarator (if FIRST is true).
17561 It is not an error for it not to be a
17562 parameter-declaration-clause, even when FIRST is
17563 false. Consider,
17565 int i (int);
17566 int i (3);
17568 The first is the declaration of a function while the
17569 second is the definition of a variable, including its
17570 initializer.
17572 Having seen only the parenthesis, we cannot know which of
17573 these two alternatives should be selected. Even more
17574 complex are examples like:
17576 int i (int (a));
17577 int i (int (3));
17579 The former is a function-declaration; the latter is a
17580 variable initialization.
17582 Thus again, we try a parameter-declaration-clause, and if
17583 that fails, we back out and return. */
17586 {
17587 tree params;
17590 /* In a member-declarator, the only valid interpretation
17591 of a parenthesis is the start of a
17592 parameter-declaration-clause. (It is invalid to
17593 initialize a static data member with a parenthesized
17594 initializer; only the "=" form of initialization is
17595 permitted.) */
17599 /* Consume the `('. */
17602 {
17603 /* If this is going to be an abstract declarator, we're
17604 in a declarator and we can't have default args. */
17607 }
17611 /* Parse the parameter-declaration-clause. */
17614 /* Consume the `)'. */
17617 /* If all went well, parse the cv-qualifier-seq,
17618 ref-qualifier and the exception-specification. */
17620 {
17621 cp_cv_quals cv_quals;
17622 cp_virt_specifiers virt_specifiers;
17623 cp_ref_qualifier ref_qual;
17624 tree exception_specification;
17625 tree late_return;
17626 tree attrs;
17636 /* Parse the cv-qualifier-seq. */
17638 /* Parse the ref-qualifier. */
17640 /* And the exception-specification. */
17641 exception_specification
17646 /* In here, we handle cases where attribute is used after
17647 the function declaration. For example:
17648 void func (int x) __attribute__((vector(..))); */
17651 {
17655 CPP_SEMICOLON)
17657 CPP_OPEN_BRACE))
17660 ;
17661 else
17663 }
17664 late_return = (cp_parser_late_return_type_opt
17669 /* Parse the virt-specifier-seq. */
17672 /* Create the function-declarator. */
17674 params,
17675 cv_quals,
17676 virt_specifiers,
17677 ref_qual,
17678 exception_specification,
17679 late_return);
17681 /* Any subsequent parameter lists are to do with
17682 return type, so are not those of the declared
17683 function. */
17685 }
17687 /* Remove the function parms from scope. */
17691 /* Repeat the main loop. */
17693 }
17695 /* If this is the first, we can try a parenthesized
17696 declarator. */
17698 {
17704 /* Consume the `('. */
17706 /* Parse the nested declarator. */
17709 declarator
17715 /* Expect a `)'. */
17722 }
17723 /* Otherwise, we must be done. */
17724 else
17726 }
17730 {
17731 /* Parse an array-declarator. */
17740 /* Consume the `['. */
17742 /* Peek at the next token. */
17744 /* If the next token is `]', then there is no
17745 constant-expression. */
17747 {
17749 bounds
17759 {
17760 /* Normally, the array bound must be an integral constant
17761 expression. However, as an extension, we allow VLAs
17762 in function scopes as long as they aren't part of a
17763 parameter declaration. */
17767 }
17770 {
17771 /* Remember this wasn't a constant-expression. */
17774 }
17775 }
17776 else
17778 /* Look for the closing `]'. */
17780 {
17783 }
17788 }
17790 {
17791 {
17792 tree qualifying_scope;
17793 tree unqualified_name;
17794 tree attrs;
17795 special_function_kind sfk;
17800 /* Parse a declarator-id */
17803 {
17806 /* If we see an ellipsis, we should be looking at a
17807 parameter pack. */
17809 {
17810 /* Consume the `...' */
17814 }
17815 }
17818 unqualified_name
17822 {
17826 {
17827 /* Check whether an error occurred. */
17830 /* We already consumed the ellipsis to mark a
17831 parameter pack, but we have no way to report it,
17832 so abort the tentative parse. We will be exiting
17833 immediately anyway. */
17835 }
17836 else
17842 && (qualifying_scope
17844 {
17847 }
17848 }
17853 {
17858 }
17864 {
17865 /* In the declaration of a member of a template class
17866 outside of the class itself, the SCOPE will sometimes
17867 be a TYPENAME_TYPE. For example, given:
17869 template <typename T>
17870 int S<T>::R::i = 3;
17872 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17873 this context, we must resolve S<T>::R to an ordinary
17874 type, rather than a typename type.
17876 The reason we normally avoid resolving TYPENAME_TYPEs
17877 is that a specialization of `S' might render
17878 `S<T>::R' not a type. However, if `S' is
17879 specialized, then this `i' will not be used, so there
17880 is no harm in resolving the types here. */
17881 tree type;
17883 /* Resolve the TYPENAME_TYPE. */
17886 /* If that failed, the declarator is invalid. */
17888 {
17891 "cannot define member of dependent typedef "
17893 else
17898 }
17900 }
17905 {
17906 tree class_type;
17911 else
17915 {
17918 {
17921 {
17925 "use %<%T::%D%> instead of %<%T::%D%> to "
17927 class_type,
17932 }
17933 else
17935 }
17936 else
17937 {
17938 /* We do not attempt to print the declarator
17939 here because we do not have enough
17940 information about its original syntactic
17941 form. */
17945 }
17946 }
17949 {
17955 for an anonymous type, even if the type
17956 got a name for linkage purposes. */
17958 /* Handle correctly (c++/19200):
17960 struct S {
17961 struct T{};
17962 friend void S(T);
17963 };
17965 and also:
17967 namespace N {
17968 void S();
17969 }
17971 struct S {
17972 friend void N::S();
17973 }; */
17974 && !(friend_p
17977 class_type))
17978 {
17981 }
17989 }
17990 }
17992 unqualified_name,
17993 sfk);
18000 }
18002 handle_declarator:;
18005 {
18006 /* Any names that appear after the declarator-id for a
18007 member are looked up in the containing scope. */
18009 {
18010 /* But declarations with qualified-ids can't appear in a
18011 function. */
18015 }
18017 }
18021 /* Default args are only allowed on function
18022 declarations. */
18024 else
18028 }
18029 /* We're done. */
18030 else
18032 }
18034 /* For an abstract declarator, we might wind up with nothing at this
18035 point. That's an error; the declarator is not optional. */
18039 /* If we entered a scope, we must exit it now. */
18047 }
18049 /* Parse a ptr-operator.
18051 ptr-operator:
18052 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18053 * cv-qualifier-seq [opt]
18054 &
18055 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
18056 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18058 GNU Extension:
18060 ptr-operator:
18061 & cv-qualifier-seq [opt]
18063 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
18064 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
18065 an rvalue reference. In the case of a pointer-to-member, *TYPE is
18066 filled in with the TYPE containing the member. *CV_QUALS is
18067 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
18068 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
18069 Note that the tree codes returned by this function have nothing
18070 to do with the types of trees that will be eventually be created
18071 to represent the pointer or reference type being parsed. They are
18072 just constants with suggestive names. */
18073 static enum tree_code
18078 {
18083 /* Assume that it's not a pointer-to-member. */
18085 /* And that there are no cv-qualifiers. */
18088 /* Peek at the next token. */
18091 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18101 {
18102 /* Consume the `*', `&' or `&&'. */
18105 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18106 `&', if we are allowing GNU extensions. (The only qualifier
18107 that can legally appear after `&' is `restrict', but that is
18108 enforced during semantic analysis. */
18116 }
18117 else
18118 {
18119 /* Try the pointer-to-member case. */
18121 /* Look for the optional `::' operator. */
18124 /* Look for the nested-name specifier. */
18131 /* If we found it, and the next token is a `*', then we are
18132 indeed looking at a pointer-to-member operator. */
18135 {
18136 /* Indicate that the `*' operator was used. */
18144 else
18145 {
18146 /* The type of which the member is a member is given by the
18147 current SCOPE. */
18149 /* The next name will not be qualified. */
18153 /* Look for optional c++11 attributes. */
18157 /* Look for the optional cv-qualifier-seq. */
18159 }
18160 }
18161 /* If that didn't work we don't have a ptr-operator. */
18164 }
18167 }
18169 /* Parse an (optional) cv-qualifier-seq.
18171 cv-qualifier-seq:
18172 cv-qualifier cv-qualifier-seq [opt]
18174 cv-qualifier:
18175 const
18176 volatile
18178 GNU Extension:
18180 cv-qualifier:
18181 __restrict__
18183 Returns a bitmask representing the cv-qualifiers. */
18185 static cp_cv_quals
18187 {
18191 {
18193 cp_cv_quals cv_qualifier;
18195 /* Peek at the next token. */
18197 /* See if it's a cv-qualifier. */
18199 {
18215 }
18221 {
18224 }
18225 else
18226 {
18229 }
18230 }
18233 }
18235 /* Parse an (optional) ref-qualifier
18237 ref-qualifier:
18238 &
18239 &&
18241 Returns cp_ref_qualifier representing ref-qualifier. */
18243 static cp_ref_qualifier
18245 {
18248 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18253 {
18258 {
18270 }
18275 {
18278 }
18279 else
18280 {
18283 }
18284 }
18287 }
18289 /* Parse an (optional) virt-specifier-seq.
18291 virt-specifier-seq:
18292 virt-specifier virt-specifier-seq [opt]
18294 virt-specifier:
18295 override
18296 final
18298 Returns a bitmask representing the virt-specifiers. */
18300 static cp_virt_specifiers
18302 {
18306 {
18308 cp_virt_specifiers virt_specifier;
18310 /* Peek at the next token. */
18312 /* See if it's a virt-specifier-qualifier. */
18316 {
18319 }
18321 {
18324 }
18326 {
18328 }
18329 else
18333 {
18336 }
18337 else
18338 {
18341 }
18342 }
18344 }
18346 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18347 is in scope even though it isn't real. */
18349 void
18351 {
18352 tree this_parm;
18355 {
18356 /* We don't clear this between NSDMIs. Is it already what we want? */
18361 }
18364 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18366 current_class_ref
18369 }
18371 /* Return true iff our current scope is a non-static data member
18372 initializer. */
18374 bool
18376 {
18377 /* We recognize NSDMI context by the context-less 'this' pointer set up
18378 by the function above. */
18384 }
18386 /* Parse a late-specified return type, if any. This is not a separate
18387 non-terminal, but part of a function declarator, which looks like
18389 -> trailing-type-specifier-seq abstract-declarator(opt)
18391 Returns the type indicated by the type-id.
18393 In addition to this this parses any queued up omp declare simd
18394 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18396 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18397 function. */
18399 static tree
18401 cp_cv_quals quals)
18402 {
18406 && declarator
18412 /* Peek at the next token. */
18414 /* A late-specified return type is indicated by an initial '->'. */
18421 {
18422 /* DR 1207: 'this' is in scope in the trailing return type. */
18424 }
18427 {
18428 /* Consume the ->. */
18432 }
18435 declarator->std_attributes
18439 declarator->std_attributes
18444 {
18447 }
18450 }
18452 /* Parse a declarator-id.
18454 declarator-id:
18455 id-expression
18456 :: [opt] nested-name-specifier [opt] type-name
18458 In the `id-expression' case, the value returned is as for
18459 cp_parser_id_expression if the id-expression was an unqualified-id.
18460 If the id-expression was a qualified-id, then a SCOPE_REF is
18461 returned. The first operand is the scope (either a NAMESPACE_DECL
18462 or TREE_TYPE), but the second is still just a representation of an
18463 unqualified-id. */
18465 static tree
18467 {
18468 tree id;
18469 /* The expression must be an id-expression. Assume that qualified
18470 names are the names of types so that:
18472 template <class T>
18473 int S<T>::R::i = 3;
18475 will work; we must treat `S<T>::R' as the name of a type.
18476 Similarly, assume that qualified names are templates, where
18477 required, so that:
18479 template <class T>
18480 int S<T>::R<T>::i = 3;
18482 will work, too. */
18488 optional_p);
18492 }
18494 /* Parse a type-id.
18496 type-id:
18497 type-specifier-seq abstract-declarator [opt]
18499 Returns the TYPE specified. */
18501 static tree
18504 {
18505 cp_decl_specifier_seq type_specifier_seq;
18508 /* Parse the type-specifier-seq. */
18510 is_trailing_return,
18515 /* There might or might not be an abstract declarator. */
18517 /* Look for the declarator. */
18518 abstract_declarator
18523 /* Check to see if there really was a declarator. */
18528 /* None of the valid uses of 'auto' in C++14 involve the type-id
18529 nonterminal, but it is valid in a trailing-return-type. */
18532 {
18533 /* A type-id with type 'auto' is only ok if the abstract declarator
18534 is a function declarator with a late-specified return type. */
18539 else
18540 {
18543 }
18544 }
18547 is_template_arg);
18548 }
18551 {
18553 }
18556 {
18557 tree r;
18559 parser->type_definition_forbidden_message
18564 {
18567 }
18569 }
18572 {
18574 }
18576 /* Parse a type-specifier-seq.
18578 type-specifier-seq:
18579 type-specifier type-specifier-seq [opt]
18581 GNU extension:
18583 type-specifier-seq:
18584 attributes type-specifier-seq [opt]
18586 If IS_DECLARATION is true, we are at the start of a "condition" or
18587 exception-declaration, so we might be followed by a declarator-id.
18589 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18590 i.e. we've just seen "->".
18592 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18594 static void
18599 {
18604 /* Clear the TYPE_SPECIFIER_SEQ. */
18607 /* In the context of a trailing return type, enum E { } is an
18608 elaborated-type-specifier followed by a function-body, not an
18609 enum-specifier. */
18613 /* Parse the type-specifiers and attributes. */
18615 {
18616 tree type_specifier;
18619 /* Check for attributes first. */
18621 {
18626 }
18628 /* record the token of the beginning of the type specifier seq,
18629 for error reporting purposes*/
18633 /* Look for the type-specifier. */
18635 flags,
18636 type_specifier_seq,
18638 NULL,
18641 {
18642 /* If the first type-specifier could not be found, this is not a
18643 type-specifier-seq at all. */
18645 {
18646 /* Set in_declarator_p to avoid skipping to the semicolon. */
18658 }
18659 /* If subsequent type-specifiers could not be found, the
18660 type-specifier-seq is complete. */
18662 }
18665 /* The standard says that a condition can be:
18667 type-specifier-seq declarator = assignment-expression
18669 However, given:
18671 struct S {};
18672 if (int S = ...)
18674 we should treat the "S" as a declarator, not as a
18675 type-specifier. The standard doesn't say that explicitly for
18676 type-specifier-seq, but it does say that for
18677 decl-specifier-seq in an ordinary declaration. Perhaps it
18678 would be clearer just to allow a decl-specifier-seq here, and
18679 then add a semantic restriction that if any decl-specifiers
18680 that are not type-specifiers appear, the program is invalid. */
18683 }
18684 }
18686 /* Return whether the function currently being declared has an associated
18687 template parameter list. */
18689 static bool
18691 {
18704 }
18706 /* Parse a parameter-declaration-clause.
18708 parameter-declaration-clause:
18709 parameter-declaration-list [opt] ... [opt]
18710 parameter-declaration-list , ...
18712 Returns a representation for the parameter declarations. A return
18713 value of NULL indicates a parameter-declaration-clause consisting
18714 only of an ellipsis. */
18716 static tree
18718 {
18719 tree parameters;
18728 parser->auto_is_implicit_function_template_parm_p
18730 }
18736 && !processing_template_parmlist
18742 /* Peek at the next token. */
18744 /* Check for trivial parameter-declaration-clauses. */
18746 {
18747 /* Consume the `...' token. */
18750 }
18752 /* There are no parameters. */
18753 {
18754 #ifndef NO_IMPLICIT_EXTERN_C
18759 else
18760 #endif
18762 }
18763 /* Check for `(void)', too, which is a special case. */
18767 {
18768 /* Consume the `void' token. */
18770 /* There are no parameters. */
18772 }
18774 /* Parse the parameter-declaration-list. */
18776 /* If a parse error occurred while parsing the
18777 parameter-declaration-list, then the entire
18778 parameter-declaration-clause is erroneous. */
18782 /* Peek at the next token. */
18784 /* If it's a `,', the clause should terminate with an ellipsis. */
18786 {
18787 /* Consume the `,'. */
18789 /* Expect an ellipsis. */
18790 ellipsis_p
18792 }
18793 /* It might also be `...' if the optional trailing `,' was
18794 omitted. */
18796 {
18797 /* Consume the `...' token. */
18799 /* And remember that we saw it. */
18801 }
18802 else
18805 /* Finish the parameter list. */
18810 }
18812 /* Parse a parameter-declaration-list.
18814 parameter-declaration-list:
18815 parameter-declaration
18816 parameter-declaration-list , parameter-declaration
18818 Returns a representation of the parameter-declaration-list, as for
18819 cp_parser_parameter_declaration_clause. However, the
18820 `void_list_node' is never appended to the list. Upon return,
18821 *IS_ERROR will be true iff an error occurred. */
18823 static tree
18825 {
18831 /* Assume all will go well. */
18833 /* The special considerations that apply to a function within an
18834 unbraced linkage specifications do not apply to the parameters
18835 to the function. */
18836 saved_in_unbraced_linkage_specification_p
18840 /* Look for more parameters. */
18842 {
18850 /* Parse the parameter. */
18851 parameter
18856 /* We don't know yet if the enclosing context is deprecated, so wait
18857 and warn in grokparms if appropriate. */
18861 {
18862 /* If a function parameter pack was specified and an implicit template
18863 parameter was introduced during cp_parser_parameter_declaration,
18864 change any implicit parameters introduced into packs. */
18868 {
18876 }
18880 PARM,
18883 }
18887 /* If a parse error occurred parsing the parameter declaration,
18888 then the entire parameter-declaration-list is erroneous. */
18890 {
18894 }
18904 {
18908 }
18910 /* Add the new parameter to the list. */
18914 /* Peek at the next token. */
18917 /* These are for Objective-C++ */
18920 /* The parameter-declaration-list is complete. */
18923 {
18926 /* Peek at the next token. */
18928 /* If it's an ellipsis, then the list is complete. */
18931 /* Otherwise, there must be more parameters. Consume the
18932 `,'. */
18934 /* When parsing something like:
18936 int i(float f, double d)
18938 we can tell after seeing the declaration for "f" that we
18939 are not looking at an initialization of a variable "i",
18940 but rather at the declaration of a function "i".
18942 Due to the fact that the parsing of template arguments
18943 (as specified to a template-id) requires backtracking we
18944 cannot use this technique when inside a template argument
18945 list. */
18949 /* However, a parameter-declaration of the form
18950 "float(f)" (which is a valid declaration of a
18951 parameter "f") can also be interpreted as an
18952 expression (the conversion of "f" to "float"). */
18955 }
18956 else
18957 {
18965 }
18966 }
18968 parser->in_unbraced_linkage_specification_p
18971 /* Reset implicit_template_scope if we are about to leave the function
18972 parameter list that introduced it. Note that for out-of-line member
18973 definitions, there will be one or more class scopes before we get to
18974 the template parameter scope. */
18978 {
18982 {
18985 }
18986 }
18989 }
18991 /* Parse a parameter declaration.
18993 parameter-declaration:
18994 decl-specifier-seq ... [opt] declarator
18995 decl-specifier-seq declarator = assignment-expression
18996 decl-specifier-seq ... [opt] abstract-declarator [opt]
18997 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18999 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
19000 declares a template parameter. (In that case, a non-nested `>'
19001 token encountered during the parsing of the assignment-expression
19002 is not interpreted as a greater-than operator.)
19004 Returns a representation of the parameter, or NULL if an error
19005 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
19006 true iff the declarator is of the form "(p)". */
19012 {
19014 cp_decl_specifier_seq decl_specifiers;
19016 tree default_argument;
19020 /* In a template parameter, `>' is not an operator.
19022 [temp.param]
19024 When parsing a default template-argument for a non-type
19025 template-parameter, the first non-nested `>' is taken as the end
19026 of the template parameter-list rather than a greater-than
19027 operator. */
19029 /* Type definitions may not appear in parameter types. */
19031 parser->type_definition_forbidden_message
19034 /* Parse the declaration-specifiers. */
19036 CP_PARSER_FLAGS_NONE,
19040 /* Complain about missing 'typename' or other invalid type names. */
19045 /* If an error occurred, there's no reason to attempt to parse the
19046 rest of the declaration. */
19048 {
19051 }
19053 /* Peek at the next token. */
19056 /* If the next token is a `)', `,', `=', `>', or `...', then there
19057 is no declarator. However, when variadic templates are enabled,
19058 there may be a declarator following `...'. */
19063 {
19067 }
19068 /* Otherwise, there should be a declarator. */
19069 else
19070 {
19074 /* After seeing a decl-specifier-seq, if the next token is not a
19075 "(", there is no possibility that the code is a valid
19076 expression. Therefore, if parsing tentatively, we commit at
19077 this point. */
19079 /* In an expression context, having seen:
19081 (int((char ...
19083 we cannot be sure whether we are looking at a
19084 function-type (taking a "char" as a parameter) or a cast
19085 of some object of type "char" to "int". */
19091 /* Parse the declarator. */
19094 CP_PARSER_DECLARATOR_EITHER,
19096 parenthesized_p,
19100 /* After the declarator, allow more attributes. */
19101 decl_specifiers.attributes
19104 }
19106 /* If the next token is an ellipsis, and we have not seen a
19107 declarator name, and the type of the declarator contains parameter
19108 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
19109 a parameter pack expansion expression. Otherwise, leave the
19110 ellipsis for a C-style variadic function. */
19113 {
19124 {
19125 /* Consume the `...'. */
19129 /* Build a pack expansion type */
19132 else
19134 }
19135 }
19137 /* The restriction on defining new types applies only to the type
19138 of the parameter, not to the default argument. */
19141 /* If the next token is `=', then process a default argument. */
19143 {
19145 /* If we are defining a class, then the tokens that make up the
19146 default argument must be saved and processed later. */
19151 /* Outside of a class definition, we can just parse the
19152 assignment-expression. */
19153 else
19154 default_argument
19158 {
19161 else
19162 {
19164 "default arguments are only "
19167 }
19168 }
19172 {
19173 /* Find the name of the parameter pack. */
19180 template_parm_p
19186 else
19188 template_parm_p
19195 }
19196 }
19197 else
19201 declarator,
19202 default_argument);
19203 }
19205 /* Parse a default argument and return it.
19207 TEMPLATE_PARM_P is true if this is a default argument for a
19208 non-type template parameter. */
19209 static tree
19211 {
19217 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19218 set correctly. */
19221 /* Local variable names (and the `this' keyword) may not
19222 appear in a default argument. */
19225 /* Parse the assignment-expression. */
19230 /* The "this" pointer is not valid in a default argument. */
19232 {
19237 }
19238 default_argument
19240 /* Restore the "this" pointer. */
19242 {
19245 }
19254 }
19256 /* Parse a function-body.
19258 function-body:
19259 compound_statement */
19261 static void
19263 {
19265 }
19267 /* Parse a ctor-initializer-opt followed by a function-body. Return
19268 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19269 is true we are parsing a function-try-block. */
19271 static bool
19274 {
19282 /* Begin the function body. */
19284 /* Parse the optional ctor-initializer. */
19287 /* If we're parsing a constexpr constructor definition, we need
19288 to check that the constructor body is indeed empty. However,
19289 before we get to cp_parser_function_body lot of junk has been
19290 generated, so we can't just check that we have an empty block.
19291 Rather we take a snapshot of the outermost block, and check whether
19292 cp_parser_function_body changed its state. */
19294 {
19298 }
19299 /* Parse the function-body. */
19303 /* Finish the function body. */
19307 }
19309 /* Parse an initializer.
19311 initializer:
19312 = initializer-clause
19313 ( expression-list )
19315 Returns an expression representing the initializer. If no
19316 initializer is present, NULL_TREE is returned.
19318 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19319 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19320 set to TRUE if there is no initializer present. If there is an
19321 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19322 is set to true; otherwise it is set to false. */
19324 static tree
19327 {
19329 tree init;
19331 /* Peek at the next token. */
19334 /* Let our caller know whether or not this initializer was
19335 parenthesized. */
19337 /* Assume that the initializer is constant. */
19341 {
19342 /* Consume the `='. */
19344 /* Parse the initializer-clause. */
19346 }
19348 {
19353 non_constant_p);
19358 }
19360 {
19365 }
19366 else
19367 {
19368 /* Anything else is an error. */
19371 }
19374 }
19376 /* Parse an initializer-clause.
19378 initializer-clause:
19379 assignment-expression
19380 braced-init-list
19382 Returns an expression representing the initializer.
19384 If the `assignment-expression' production is used the value
19385 returned is simply a representation for the expression.
19387 Otherwise, calls cp_parser_braced_list. */
19389 static tree
19391 {
19392 tree initializer;
19394 /* Assume the expression is constant. */
19397 /* If it is not a `{', then we are looking at an
19398 assignment-expression. */
19400 {
19401 initializer
19404 non_constant_p);
19405 }
19406 else
19410 }
19412 /* Parse a brace-enclosed initializer list.
19414 braced-init-list:
19415 { initializer-list , [opt] }
19416 { }
19418 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19419 the elements of the initializer-list (or NULL, if the last
19420 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19421 NULL_TREE. There is no way to detect whether or not the optional
19422 trailing `,' was provided. NON_CONSTANT_P is as for
19423 cp_parser_initializer. */
19425 static tree
19427 {
19428 tree initializer;
19430 /* Consume the `{' token. */
19432 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19434 /* If it's not a `}', then there is a non-trivial initializer. */
19436 {
19437 /* Parse the initializer list. */
19440 /* A trailing `,' token is allowed. */
19443 }
19444 else
19446 /* Now, there should be a trailing `}'. */
19450 }
19452 /* Consume tokens up to, and including, the next non-nested closing `]'.
19453 Returns true iff we found a closing `]'. */
19455 static bool
19457 {
19461 {
19465 {
19468 /* If we've run out of tokens, then there is no closing `]'. */
19477 {
19480 }
19485 }
19487 /* Consume the token. */
19489 }
19490 }
19492 /* Return true if we are looking at an array-designator, false otherwise. */
19494 static bool
19496 {
19497 /* Consume the `['. */
19502 /* Skip tokens until the next token is a closing square bracket.
19503 If we find the closing `]', and the next token is a `=', then
19504 we are looking at an array designator. */
19505 bool array_designator_p
19509 /* Roll back the tokens we skipped. */
19513 }
19515 /* Parse an initializer-list.
19517 initializer-list:
19518 initializer-clause ... [opt]
19519 initializer-list , initializer-clause ... [opt]
19521 GNU Extension:
19523 initializer-list:
19524 designation initializer-clause ...[opt]
19525 initializer-list , designation initializer-clause ...[opt]
19527 designation:
19528 . identifier =
19529 identifier :
19530 [ constant-expression ] =
19532 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19533 for the initializer. If the INDEX of the elt is non-NULL, it is the
19534 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19535 as for cp_parser_initializer. */
19539 {
19542 /* Assume all of the expressions are constant. */
19545 /* Parse the rest of the list. */
19547 {
19549 tree designator;
19550 tree initializer;
19553 /* If the next token is an identifier and the following one is a
19554 colon, we are looking at the GNU designated-initializer
19555 syntax. */
19559 {
19560 /* Warn the user that they are using an extension. */
19563 /* Consume the identifier. */
19565 /* Consume the `:'. */
19567 }
19568 /* Also handle the C99 syntax, '. id ='. */
19573 {
19574 /* Warn the user that they are using an extension. */
19577 /* Consume the `.'. */
19579 /* Consume the identifier. */
19581 /* Consume the `='. */
19583 }
19584 /* Also handle C99 array designators, '[ const ] ='. */
19588 {
19589 /* In C++11, [ could start a lambda-introducer. */
19595 {
19598 }
19599 else
19600 {
19605 }
19611 }
19612 else
19615 /* Parse the initializer. */
19618 /* If any clause is non-constant, so is the entire initializer. */
19622 /* If we have an ellipsis, this is an initializer pack
19623 expansion. */
19625 {
19626 /* Consume the `...'. */
19629 /* Turn the initializer into an initializer expansion. */
19631 }
19633 /* Add it to the vector. */
19636 /* If the next token is not a comma, we have reached the end of
19637 the list. */
19641 /* Peek at the next token. */
19643 /* If the next token is a `}', then we're still done. An
19644 initializer-clause can have a trailing `,' after the
19645 initializer-list and before the closing `}'. */
19649 /* Consume the `,' token. */
19651 }
19654 }
19656 /* Classes [gram.class] */
19658 /* Parse a class-name.
19660 class-name:
19661 identifier
19662 template-id
19664 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19665 to indicate that names looked up in dependent types should be
19666 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19667 keyword has been used to indicate that the name that appears next
19668 is a template. TAG_TYPE indicates the explicit tag given before
19669 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19670 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19671 is the class being defined in a class-head. If ENUM_OK is TRUE,
19672 enum-names are also accepted.
19674 Returns the TYPE_DECL representing the class. */
19676 static tree
19685 {
19686 tree decl;
19687 tree scope;
19692 /* All class-names start with an identifier. */
19695 {
19698 }
19700 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19701 to a template-id, so we save it here. */
19706 /* Any name names a type if we're following the `typename' keyword
19707 in a qualified name where the enclosing scope is type-dependent. */
19710 /* Handle the common case (an identifier, but not a template-id)
19711 efficiently. */
19714 {
19718 /* Look for the identifier. */
19722 /* If the next token isn't an identifier, we are certainly not
19723 looking at a class-name. */
19726 /* If we know this is a type-name, there's no need to look it
19727 up. */
19730 else
19731 {
19732 tree ambiguous_decls;
19733 /* If we already know that this lookup is ambiguous, then
19734 we've already issued an error message; there's no reason
19735 to check again. */
19737 {
19740 }
19741 /* If the next token is a `::', then the name must be a type
19742 name.
19744 [basic.lookup.qual]
19746 During the lookup for a name preceding the :: scope
19747 resolution operator, object, function, and enumerator
19748 names are ignored. */
19751 /* Look up the name. */
19753 tag_type,
19756 check_dependency_p,
19760 {
19764 }
19765 }
19766 }
19767 else
19768 {
19769 /* Try a template-id. */
19771 check_dependency_p,
19772 tag_type,
19773 is_declaration);
19776 }
19780 /* If this is a typename, create a TYPENAME_TYPE. */
19782 {
19787 }
19791 /* Check to see that it is really the name of a class. */
19795 /* Situations like this:
19797 template <typename T> struct A {
19798 typename T::template X<int>::I i;
19799 };
19801 are problematic. Is `T::template X<int>' a class-name? The
19802 standard does not seem to be definitive, but there is no other
19803 valid interpretation of the following `::'. Therefore, those
19804 names are considered class-names. */
19805 {
19809 }
19814 /* In Objective-C 2.0, a classname followed by '.' starts a
19815 dot-syntax expression, and it's not a type-name. */
19827 }
19829 /* Parse a class-specifier.
19831 class-specifier:
19832 class-head { member-specification [opt] }
19834 Returns the TREE_TYPE representing the class. */
19836 static tree
19838 {
19839 tree type;
19853 /* Parse the class-head. */
19856 /* If the class-head was a semantic disaster, skip the entire body
19857 of the class. */
19859 {
19863 }
19865 /* Look for the `{'. */
19867 {
19870 }
19874 /* Issue an error message if type-definitions are forbidden here. */
19876 /* Remember that we are defining one more class. */
19878 /* Inside the class, surrounding template-parameter-lists do not
19879 apply. */
19880 saved_num_template_parameter_lists
19883 /* We are not in a function body. */
19886 /* Or in a loop. */
19889 /* Or in a switch. */
19892 /* We are not immediately inside an extern "lang" block. */
19893 saved_in_unbraced_linkage_specification_p
19897 /* Start the class. */
19899 {
19902 }
19906 /* If the type is erroneous, skip the entire body of the class. */
19908 else
19909 /* Parse the member-specification. */
19912 /* Look for the trailing `}'. */
19914 /* Look for trailing attributes to apply to this class. */
19922 /* We've finished a type definition. Check for the common syntax
19923 error of forgetting a semicolon after the definition. We need to
19924 be careful, as we can't just check for not-a-semicolon and be done
19925 with it; the user might have typed:
19927 class X { } c = ...;
19928 class X { } *p = ...;
19930 and so forth. Instead, enumerate all the possible tokens that
19931 might follow this production; if we don't see one of them, then
19932 complain and silently insert the semicolon. */
19933 {
19938 /* Don't try to parse c++11 attributes here. As per the
19939 grammar, that should be a task for
19940 cp_parser_decl_specifier_seq. */
19944 {
19955 /* While it's legal for type qualifiers and storage class
19956 specifiers to follow type definitions in the grammar, only
19957 compiler testsuites contain code like that. Assume that if
19958 we see such code, then what we're really seeing is a case
19959 like:
19961 class X { }
19962 const <type> var = ...;
19964 or
19966 class Y { }
19967 static <type> func (...) ...
19969 i.e. the qualifier or specifier applies to the next
19970 declaration. To do so, however, we need to look ahead one
19971 more token to see if *that* token is a type specifier.
19973 This code could be improved to handle:
19975 class Z { }
19976 static const <type> var = ...; */
19979 {
19982 /* Handling user-defined types here would be nice, but very
19983 tricky. */
19984 want_semicolon
19987 }
19991 }
19993 /* If we don't have a type, then something is very wrong and we
19994 shouldn't try to do anything clever. Likewise for not seeing the
19995 closing brace. */
19997 {
19998 cp_token_position prev
20009 else
20012 /* Unget one token and smash it to look as though we encountered
20013 a semicolon in the input stream. */
20018 }
20019 }
20021 /* If this class is not itself within the scope of another class,
20022 then we need to parse the bodies of all of the queued function
20023 definitions. Note that the queued functions defined in a class
20024 are not always processed immediately following the
20025 class-specifier for that class. Consider:
20027 struct A {
20028 struct B { void f() { sizeof (A); } };
20029 };
20031 If `f' were processed before the processing of `A' were
20032 completed, there would be no way to compute the size of `A'.
20033 Note that the nesting we are interested in here is lexical --
20034 not the semantic nesting given by TYPE_CONTEXT. In particular,
20035 for:
20037 struct A { struct B; };
20038 struct A::B { void f() { } };
20040 there is no need to delay the parsing of `A::B::f'. */
20042 {
20043 tree decl;
20050 /* In a first pass, parse default arguments to the functions.
20051 Then, in a second pass, parse the bodies of the functions.
20052 This two-phased approach handles cases like:
20054 struct S {
20055 void f() { g(); }
20056 void g(int i = 3);
20057 };
20059 */
20061 {
20063 /* If there are default arguments that have not yet been processed,
20064 take care of them now. */
20066 {
20071 }
20072 /* Make sure that any template parameters are in scope. */
20074 /* Parse the default argument expressions. */
20076 /* Remove any template parameters from the symbol table. */
20078 }
20080 /* Now parse any NSDMIs. */
20084 {
20086 {
20091 }
20094 }
20101 /* Now do some post-NSDMI bookkeeping. */
20107 /* Now parse the body of the functions. */
20109 {
20110 /* OpenMP UDRs need to be parsed before all other functions. */
20117 }
20118 else
20122 }
20123 else
20126 /* Put back any saved access checks. */
20129 /* Restore saved state. */
20133 parser->num_template_parameter_lists
20135 parser->in_unbraced_linkage_specification_p
20139 }
20141 static tree
20143 {
20144 tree ret;
20149 }
20151 /* Parse a class-head.
20153 class-head:
20154 class-key identifier [opt] base-clause [opt]
20155 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20156 class-key nested-name-specifier [opt] template-id
20157 base-clause [opt]
20159 class-virt-specifier:
20160 final
20162 GNU Extensions:
20163 class-key attributes identifier [opt] base-clause [opt]
20164 class-key attributes nested-name-specifier identifier base-clause [opt]
20165 class-key attributes nested-name-specifier [opt] template-id
20166 base-clause [opt]
20168 Upon return BASES is initialized to the list of base classes (or
20169 NULL, if there are none) in the same form returned by
20170 cp_parser_base_clause.
20172 Returns the TYPE of the indicated class. Sets
20173 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20174 involving a nested-name-specifier was used, and FALSE otherwise.
20176 Returns error_mark_node if this is not a class-head.
20178 Returns NULL_TREE if the class-head is syntactically valid, but
20179 semantically invalid in a way that means we should skip the entire
20180 body of the class. */
20182 static tree
20185 {
20186 tree nested_name_specifier;
20190 tree attributes;
20191 tree bases;
20201 /* Assume no nested-name-specifier will be present. */
20203 /* Assume no template parameter lists will be used in defining the
20204 type. */
20208 /* Look for the class-key. */
20213 /* Parse the attributes. */
20216 /* If the next token is `::', that is invalid -- but sometimes
20217 people do try to write:
20219 struct ::S {};
20221 Handle this gracefully by accepting the extra qualifier, and then
20222 issuing an error about it later if this really is a
20223 class-head. If it turns out just to be an elaborated type
20224 specifier, remain silent. */
20230 /* Determine the name of the class. Begin by looking for an
20231 optional nested-name-specifier. */
20233 nested_name_specifier
20239 /* If there was a nested-name-specifier, then there *must* be an
20240 identifier. */
20242 {
20244 /* Although the grammar says `identifier', it really means
20245 `class-name' or `template-name'. You are only allowed to
20246 define a class that has already been declared with this
20247 syntax.
20249 The proposed resolution for Core Issue 180 says that wherever
20250 you see `class T::X' you should treat `X' as a type-name.
20252 It is OK to define an inaccessible class; for example:
20254 class A { class B; };
20255 class A::B {};
20257 We do not know if we will see a class-name, or a
20258 template-name. We look for a class-name first, in case the
20259 class-name is a template-id; if we looked for the
20260 template-name first we would stop after the template-name. */
20265 class_type,
20269 /* If that didn't work, ignore the nested-name-specifier. */
20271 {
20277 }
20278 /* If we could not find a corresponding TYPE, treat this
20279 declaration like an unqualified declaration. */
20282 /* Otherwise, count the number of templates used in TYPE and its
20283 containing scopes. */
20284 else
20285 {
20286 tree scope;
20298 }
20299 }
20300 /* Otherwise, the identifier is optional. */
20301 else
20302 {
20303 /* We don't know whether what comes next is a template-id,
20304 an identifier, or nothing at all. */
20306 /* Check for a template-id. */
20311 class_key,
20313 /* If that didn't work, it could still be an identifier. */
20315 {
20317 {
20320 }
20321 else
20323 }
20324 else
20325 {
20328 }
20329 }
20334 {
20336 class_key,
20338 }
20341 /* If it's not a `:' or a `{' then we can't really be looking at a
20342 class-head, since a class-head only appears as part of a
20343 class-specifier. We have to detect this situation before calling
20344 xref_tag, since that has irreversible side-effects. */
20346 {
20350 }
20352 /* At this point, we're going ahead with the class-specifier, even
20353 if some other problem occurs. */
20356 {
20361 }
20362 /* Issue the error about the overly-qualified name now. */
20364 {
20369 }
20371 {
20376 }
20378 {
20379 tree scope;
20381 /* Reject typedef-names in class heads. */
20383 {
20386 type);
20389 }
20391 /* Figure out in what scope the declaration is being placed. */
20393 /* If that scope does not contain the scope in which the
20394 class was originally declared, the program is invalid. */
20396 {
20399 "declaration of %qD in namespace %qD which does not "
20402 else
20408 }
20409 /* [dcl.meaning]
20411 A declarator-id shall not be qualified except for the
20412 definition of a ... nested class outside of its class
20413 ... [or] the definition or explicit instantiation of a
20414 class member of a namespace outside of its namespace. */
20416 {
20421 }
20422 }
20423 /* An explicit-specialization must be preceded by "template <>". If
20424 it is not, try to recover gracefully. */
20428 {
20432 /* Take the same action that would have been taken by
20433 cp_parser_explicit_specialization. */
20436 }
20437 /* There must be no "return" statements between this point and the
20438 end of this function; set "type "to the correct return value and
20439 use "goto done;" to return. */
20440 /* Make sure that the right number of template parameters were
20441 present. */
20445 {
20446 /* If something went wrong, there is no point in even trying to
20447 process the class-definition. */
20450 }
20452 /* Look up the type. */
20454 {
20458 {
20462 }
20463 else
20464 {
20467 }
20470 }
20472 {
20473 tree class_type;
20475 /* Given:
20477 template <typename T> struct S { struct T };
20478 template <typename T> struct S<T>::T { };
20480 we will get a TYPENAME_TYPE when processing the definition of
20481 `S::T'. We need to resolve it to the actual type before we
20482 try to define it. */
20484 {
20489 else
20490 {
20493 }
20494 }
20498 {
20501 }
20504 /* Enter the scope indicated by the nested-name-specifier. */
20506 /* Get the canonical version of this type. */
20508 /* Call push_template_decl if it seems like we should be defining a
20509 template either from the template headers or the type we're
20510 defining, so that we diagnose both extra and missing headers. */
20514 {
20517 {
20520 }
20521 }
20525 }
20527 {
20528 /* If the class was unnamed, create a dummy name. */
20533 }
20535 /* Indicate whether this class was declared as a `class' or as a
20536 `struct'. */
20541 /* If this type was already complete, and we see another definition,
20542 that's an error. */
20544 {
20546 type);
20548 type);
20551 }
20556 {
20557 /* Apply attributes now, before any use of the class as a template
20558 argument in its base list. */
20561 }
20563 /* We will have entered the scope containing the class; the names of
20564 base classes should be looked up in that context. For example:
20566 struct A { struct B {}; struct C; };
20567 struct A::C : B {};
20569 is valid. */
20571 /* Get the list of base-classes, if there is one. */
20573 {
20574 /* PR59482: enter the class scope so that base-specifiers are looked
20575 up correctly. */
20579 /* PR59482: get out of the previously pushed class scope so that the
20580 subsequent pops pop the right thing. */
20583 }
20584 else
20587 /* If we're really defining a class, process the base classes.
20588 If they're invalid, fail. */
20593 done:
20594 /* Leave the scope given by the nested-name-specifier. We will
20595 enter the class scope itself while processing the members. */
20600 {
20603 }
20609 out:
20612 }
20614 /* Parse a class-key.
20616 class-key:
20617 class
20618 struct
20619 union
20621 Returns the kind of class-key specified, or none_type to indicate
20622 error. */
20624 static enum tag_types
20626 {
20630 /* Look for the class-key. */
20635 /* Check to see if the TOKEN is a class-key. */
20640 }
20642 /* Parse a type-parameter-key.
20644 type-parameter-key:
20645 class
20646 typename
20647 */
20649 static void
20651 {
20652 /* Look for the type-parameter-key. */
20656 {
20659 /* typename is not allowed in a template template parameter
20660 by the standard until C++1Z. */
20662 "ISO C++ forbids typename key in template template parameter;"
20664 }
20665 else
20669 }
20671 /* Parse an (optional) member-specification.
20673 member-specification:
20674 member-declaration member-specification [opt]
20675 access-specifier : member-specification [opt] */
20677 static void
20679 {
20681 {
20685 /* Peek at the next token. */
20687 /* If it's a `}', or EOF then we've seen all the members. */
20693 /* See if this token is a keyword. */
20696 {
20700 /* Consume the access-specifier. */
20702 /* Remember which access-specifier is active. */
20704 /* Look for the `:'. */
20709 /* Accept #pragmas at class scope. */
20711 {
20714 }
20716 /* Otherwise, the next construction must be a
20717 member-declaration. */
20719 }
20720 }
20721 }
20723 /* Parse a member-declaration.
20725 member-declaration:
20726 decl-specifier-seq [opt] member-declarator-list [opt] ;
20727 function-definition ; [opt]
20728 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20729 using-declaration
20730 template-declaration
20731 alias-declaration
20733 member-declarator-list:
20734 member-declarator
20735 member-declarator-list , member-declarator
20737 member-declarator:
20738 declarator pure-specifier [opt]
20739 declarator constant-initializer [opt]
20740 identifier [opt] : constant-expression
20742 GNU Extensions:
20744 member-declaration:
20745 __extension__ member-declaration
20747 member-declarator:
20748 declarator attributes [opt] pure-specifier [opt]
20749 declarator attributes [opt] constant-initializer [opt]
20750 identifier [opt] attributes [opt] : constant-expression
20752 C++0x Extensions:
20754 member-declaration:
20755 static_assert-declaration */
20757 static void
20759 {
20760 cp_decl_specifier_seq decl_specifiers;
20761 tree prefix_attributes;
20762 tree decl;
20771 /* Check for the `__extension__' keyword. */
20773 {
20774 /* Recurse. */
20776 /* Restore the old value of the PEDANTIC flag. */
20780 }
20782 /* Check for a template-declaration. */
20784 {
20785 /* An explicit specialization here is an error condition, and we
20786 expect the specialization handler to detect and report this. */
20790 else
20794 }
20796 /* Check for a using-declaration. */
20798 {
20800 {
20801 /* Parse the using-declaration. */
20805 }
20806 else
20807 {
20808 tree decl;
20812 /* Note that if we actually see the '=' token after the
20813 identifier, cp_parser_alias_declaration commits the
20814 tentative parse. In that case, we really expects an
20815 alias-declaration. Otherwise, we expect a using
20816 declaration. */
20817 alias_decl_expected =
20823 else
20827 }
20828 }
20830 /* Check for @defs. */
20832 {
20837 {
20842 }
20844 }
20846 /* If the next token is `static_assert' we have a static assertion. */
20848 {
20851 }
20858 /* Parse the decl-specifier-seq. */
20861 CP_PARSER_FLAGS_OPTIONAL,
20864 /* Check for an invalid type-name. */
20868 /* If there is no declarator, then the decl-specifier-seq should
20869 specify a type. */
20871 {
20872 /* If there was no decl-specifier-seq, and the next token is a
20873 `;', then we have something like:
20875 struct S { ; };
20877 [class.mem]
20879 Each member-declaration shall declare at least one member
20880 name of the class. */
20882 {
20886 }
20887 else
20888 {
20889 tree type;
20891 /* See if this declaration is a friend. */
20893 /* If there were decl-specifiers, check to see if there was
20894 a class-declaration. */
20897 /* Nested classes have already been added to the class, but
20898 a `friend' needs to be explicitly registered. */
20900 {
20901 /* If the `friend' keyword was present, the friend must
20902 be introduced with a class-key. */
20905 "in C++03 a class-key must be used "
20907 /* In this case:
20909 template <typename T> struct A {
20910 friend struct A<T>::B;
20911 };
20913 A<T>::B will be represented by a TYPENAME_TYPE, and
20914 therefore not recognized by check_tag_decl. */
20916 {
20920 }
20923 "friend declaration does not name a class or "
20925 else
20928 }
20929 /* If there is no TYPE, an error message will already have
20930 been issued. */
20932 ;
20933 /* An anonymous aggregate has to be handled specially; such
20934 a declaration really declares a data member (with a
20935 particular type), as opposed to a nested class. */
20937 {
20938 /* C++11 9.5/6. */
20941 "a storage class on an anonymous aggregate "
20944 /* Remove constructors and such from TYPE, now that we
20945 know it is an anonymous aggregate. */
20947 /* And make the corresponding data member. */
20950 /* Add it to the class. */
20952 }
20953 else
20954 cp_parser_check_access_in_redeclaration
20957 }
20958 }
20959 else
20960 {
20963 /* Clear attributes from the decl_specifiers but keep them
20964 around as prefix attributes that apply them to the entity
20965 being declared. */
20969 /* See if these declarations will be friends. */
20972 /* Keep going until we hit the `;' at the end of the
20973 declaration. */
20975 {
20977 tree first_attribute;
20979 /* Peek at the next token. */
20982 /* Check for a bitfield declaration. */
20987 {
20988 tree identifier;
20989 tree width;
20991 /* Get the name of the bitfield. Note that we cannot just
20992 check TOKEN here because it may have been invalidated by
20993 the call to cp_lexer_peek_nth_token above. */
20996 else
20999 /* Consume the `:' token. */
21001 /* Get the width of the bitfield. */
21002 width
21005 /* Look for attributes that apply to the bitfield. */
21007 /* Remember which attributes are prefix attributes and
21008 which are not. */
21010 /* Combine the attributes. */
21013 /* Create the bitfield declaration. */
21016 identifier,
21017 sfk_none)
21020 width,
21021 attributes);
21022 }
21023 else
21024 {
21026 tree initializer;
21027 tree asm_specification;
21030 /* Parse the declarator. */
21031 declarator
21036 friend_p);
21038 /* If something went wrong parsing the declarator, make sure
21039 that we at least consume some tokens. */
21041 {
21042 /* Skip to the end of the statement. */
21044 /* If the next token is not a semicolon, that is
21045 probably because we just skipped over the body of
21046 a function. So, we consume a semicolon if
21047 present, but do not issue an error message if it
21048 is not present. */
21050 CPP_SEMICOLON))
21053 }
21056 cp_parser_check_for_definition_in_return_type
21060 /* Look for an asm-specification. */
21062 /* Look for attributes that apply to the declaration. */
21064 /* Remember which attributes are prefix attributes and
21065 which are not. */
21067 /* Combine the attributes. */
21070 /* If it's an `=', then we have a constant-initializer or a
21071 pure-specifier. It is not correct to parse the
21072 initializer before registering the member declaration
21073 since the member declaration should be in scope while
21074 its initializer is processed. However, the rest of the
21075 front end does not yet provide an interface that allows
21076 us to handle this correctly. */
21078 {
21079 /* In [class.mem]:
21081 A pure-specifier shall be used only in the declaration of
21082 a virtual function.
21084 A member-declarator can contain a constant-initializer
21085 only if it declares a static member of integral or
21086 enumeration type.
21088 Therefore, if the DECLARATOR is for a function, we look
21089 for a pure-specifier; otherwise, we look for a
21090 constant-initializer. When we call `grokfield', it will
21091 perform more stringent semantics checks. */
21103 {
21105 /* Don't require a constant rvalue in C++11, since we
21106 might want a reference constant. We'll enforce
21107 constancy later. */
21109 /* Parse the initializer. */
21112 }
21113 else
21114 /* Parse the initializer. */
21116 }
21119 {
21123 else
21125 }
21126 /* Otherwise, there is no initializer. */
21127 else
21130 /* See if we are probably looking at a function
21131 definition. We are certainly not looking at a
21132 member-declarator. Calling `grokfield' has
21133 side-effects, so we must not do it unless we are sure
21134 that we are looking at a member-declarator. */
21137 {
21138 /* The grammar does not allow a pure-specifier to be
21139 used when a member function is defined. (It is
21140 possible that this fact is an oversight in the
21141 standard, since a pure function may be defined
21142 outside of the class-specifier. */
21148 declarator,
21149 attributes);
21152 /* If the member was not a friend, declare it here. */
21155 /* Peek at the next token. */
21157 /* If the next token is a semicolon, consume it. */
21161 }
21162 else
21165 /* Create the declaration. */
21170 {
21173 else
21175 }
21176 }
21180 /* Reset PREFIX_ATTRIBUTES. */
21186 /* If there is any qualification still in effect, clear it
21187 now; we will be starting fresh with the next declarator. */
21191 /* If it's a `,', then there are more declarators. */
21193 {
21196 {
21200 }
21201 }
21202 /* If the next token isn't a `;', then we have a parse error. */
21204 CPP_SEMICOLON))
21205 {
21206 /* The next token might be a ways away from where the
21207 actual semicolon is missing. Find the previous token
21208 and use that for our error position. */
21213 /* Assume that the user meant to provide a semicolon. If
21214 we were to cp_parser_skip_to_end_of_statement, we might
21215 skip to a semicolon inside a member function definition
21216 and issue nonsensical error messages. */
21218 }
21221 {
21222 /* Add DECL to the list of members. */
21224 /* Explicitly include, eg, NSDMIs, for better error
21225 recovery (c++/58650). */
21234 /* Add DECL to the queue of NSDMI to be parsed later. */
21236 }
21240 }
21241 }
21244 out:
21246 }
21248 /* Parse a pure-specifier.
21250 pure-specifier:
21251 = 0
21253 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21254 Otherwise, ERROR_MARK_NODE is returned. */
21256 static tree
21258 {
21261 /* Look for the `=' token. */
21264 /* Look for the `0' token. */
21273 /* Accept = default or = delete in c++0x mode. */
21276 {
21279 }
21281 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21283 {
21288 }
21290 {
21293 }
21296 }
21298 /* Parse a constant-initializer.
21300 constant-initializer:
21301 = constant-expression
21303 Returns a representation of the constant-expression. */
21305 static tree
21307 {
21308 /* Look for the `=' token. */
21312 /* It is invalid to write:
21314 struct S { static const int i = { 7 }; };
21316 */
21318 {
21321 /* Consume the opening brace. */
21323 /* Skip the initializer. */
21325 /* Look for the trailing `}'. */
21329 }
21332 }
21334 /* Derived classes [gram.class.derived] */
21336 /* Parse a base-clause.
21338 base-clause:
21339 : base-specifier-list
21341 base-specifier-list:
21342 base-specifier ... [opt]
21343 base-specifier-list , base-specifier ... [opt]
21345 Returns a TREE_LIST representing the base-classes, in the order in
21346 which they were declared. The representation of each node is as
21347 described by cp_parser_base_specifier.
21349 In the case that no bases are specified, this function will return
21350 NULL_TREE, not ERROR_MARK_NODE. */
21352 static tree
21354 {
21357 /* Look for the `:' that begins the list. */
21360 /* Scan the base-specifier-list. */
21362 {
21364 tree base;
21367 /* Look for the base-specifier. */
21369 /* Look for the (optional) ellipsis. */
21371 {
21372 /* Consume the `...'. */
21376 }
21378 /* Add BASE to the front of the list. */
21380 {
21382 /* Make this a pack expansion type. */
21386 {
21389 }
21390 }
21391 /* Peek at the next token. */
21393 /* If it's not a comma, then the list is complete. */
21396 /* Consume the `,'. */
21398 }
21400 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21401 base class had a qualified name. However, the next name that
21402 appears is certainly not qualified. */
21408 }
21410 /* Parse a base-specifier.
21412 base-specifier:
21413 :: [opt] nested-name-specifier [opt] class-name
21414 virtual access-specifier [opt] :: [opt] nested-name-specifier
21415 [opt] class-name
21416 access-specifier virtual [opt] :: [opt] nested-name-specifier
21417 [opt] class-name
21419 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21420 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21421 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21422 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21424 static tree
21426 {
21434 tree type;
21436 /* Process the optional `virtual' and `access-specifier'. */
21438 {
21439 /* Peek at the next token. */
21441 /* Process `virtual'. */
21443 {
21445 /* If `virtual' appears more than once, issue an error. */
21447 {
21451 }
21455 /* Consume the `virtual' token. */
21463 /* If more than one access specifier appears, issue an
21464 error. */
21467 {
21471 }
21475 /* Consume the access-specifier. */
21483 }
21484 }
21485 /* It is not uncommon to see programs mechanically, erroneously, use
21486 the 'typename' keyword to denote (dependent) qualified types
21487 as base classes. */
21489 {
21494 else
21496 "keyword %<typename%> not allowed in this context "
21499 }
21501 /* Look for the optional `::' operator. */
21503 /* Look for the nested-name-specifier. The simplest way to
21504 implement:
21506 [temp.res]
21508 The keyword `typename' is not permitted in a base-specifier or
21509 mem-initializer; in these contexts a qualified name that
21510 depends on a template-parameter is implicitly assumed to be a
21511 type name.
21513 is to pretend that we have seen the `typename' keyword at this
21514 point. */
21518 typename_type,
21520 /* If the base class is given by a qualified name, assume that names
21521 we see are type names or templates, as appropriate. */
21527 /* DR 950 allows decltype as a base-specifier. */
21529 else
21530 {
21531 /* Otherwise, look for the class-name. */
21533 class_scope_p,
21534 template_p,
21535 typename_type,
21540 }
21546 }
21548 /* Exception handling [gram.exception] */
21550 /* Parse an (optional) noexcept-specification.
21552 noexcept-specification:
21553 noexcept ( constant-expression ) [opt]
21555 If no noexcept-specification is present, returns NULL_TREE.
21556 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21557 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21558 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21559 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21560 in which case a boolean condition is returned instead. */
21562 static tree
21567 {
21571 /* Peek at the next token. */
21574 /* Is it a noexcept-specification? */
21576 {
21577 tree expr;
21581 {
21585 {
21586 /* Types may not be defined in an exception-specification. */
21588 parser->type_definition_forbidden_message
21593 /* Restore the saved message. */
21595 }
21596 else
21597 {
21600 }
21603 }
21604 else
21605 {
21609 }
21611 /* We cannot build a noexcept-spec right away because this will check
21612 that expr is a constexpr. */
21615 else
21617 }
21618 else
21620 }
21622 /* Parse an (optional) exception-specification.
21624 exception-specification:
21625 throw ( type-id-list [opt] )
21627 Returns a TREE_LIST representing the exception-specification. The
21628 TREE_VALUE of each node is a type. */
21630 static tree
21632 {
21634 tree type_id_list;
21637 /* Peek at the next token. */
21640 /* Is it a noexcept-specification? */
21646 /* If it's not `throw', then there's no exception-specification. */
21650 #if 0
21651 /* Enable this once a lot of code has transitioned to noexcept? */
21655 #endif
21657 /* Consume the `throw'. */
21660 /* Look for the `('. */
21663 /* Peek at the next token. */
21665 /* If it's not a `)', then there is a type-id-list. */
21667 {
21668 /* Types may not be defined in an exception-specification. */
21670 parser->type_definition_forbidden_message
21672 /* Parse the type-id-list. */
21674 /* Restore the saved message. */
21676 }
21677 else
21680 /* Look for the `)'. */
21684 }
21686 /* Parse an (optional) type-id-list.
21688 type-id-list:
21689 type-id ... [opt]
21690 type-id-list , type-id ... [opt]
21692 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21693 in the order that the types were presented. */
21695 static tree
21697 {
21701 {
21703 tree type;
21705 /* Get the next type-id. */
21707 /* Parse the optional ellipsis. */
21709 {
21710 /* Consume the `...'. */
21713 /* Turn the type into a pack expansion expression. */
21715 }
21716 /* Add it to the list. */
21718 /* Peek at the next token. */
21720 /* If it is not a `,', we are done. */
21723 /* Consume the `,'. */
21725 }
21728 }
21730 /* Parse a try-block.
21732 try-block:
21733 try compound-statement handler-seq */
21735 static tree
21737 {
21738 tree try_block;
21752 }
21754 /* Parse a function-try-block.
21756 function-try-block:
21757 try ctor-initializer [opt] function-body handler-seq */
21759 static bool
21761 {
21762 tree compound_stmt;
21763 tree try_block;
21766 /* Look for the `try' keyword. */
21769 /* Let the rest of the front end know where we are. */
21771 /* Parse the function-body. */
21772 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21774 /* We're done with the `try' part. */
21776 /* Parse the handlers. */
21778 /* We're done with the handlers. */
21782 }
21784 /* Parse a handler-seq.
21786 handler-seq:
21787 handler handler-seq [opt] */
21789 static void
21791 {
21793 {
21796 /* Parse the handler. */
21798 /* Peek at the next token. */
21800 /* If it's not `catch' then there are no more handlers. */
21803 }
21804 }
21806 /* Parse a handler.
21808 handler:
21809 catch ( exception-declaration ) compound-statement */
21811 static void
21813 {
21814 tree handler;
21815 tree declaration;
21825 }
21827 /* Parse an exception-declaration.
21829 exception-declaration:
21830 type-specifier-seq declarator
21831 type-specifier-seq abstract-declarator
21832 type-specifier-seq
21833 ...
21835 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21836 ellipsis variant is used. */
21838 static tree
21840 {
21841 cp_decl_specifier_seq type_specifiers;
21845 /* If it's an ellipsis, it's easy to handle. */
21847 {
21848 /* Consume the `...' token. */
21851 }
21853 /* Types may not be defined in exception-declarations. */
21855 parser->type_definition_forbidden_message
21858 /* Parse the type-specifier-seq. */
21862 /* If it's a `)', then there is no declarator. */
21865 else
21872 /* Restore the saved message. */
21879 }
21881 /* Parse a throw-expression.
21883 throw-expression:
21884 throw assignment-expression [opt]
21886 Returns a THROW_EXPR representing the throw-expression. */
21888 static tree
21890 {
21891 tree expression;
21896 /* Figure out whether or not there is an assignment-expression
21897 following the "throw" keyword. */
21905 else
21909 }
21911 /* GNU Extensions */
21913 /* Parse an (optional) asm-specification.
21915 asm-specification:
21916 asm ( string-literal )
21918 If the asm-specification is present, returns a STRING_CST
21919 corresponding to the string-literal. Otherwise, returns
21920 NULL_TREE. */
21922 static tree
21924 {
21926 tree asm_specification;
21928 /* Peek at the next token. */
21930 /* If the next token isn't the `asm' keyword, then there's no
21931 asm-specification. */
21935 /* Consume the `asm' token. */
21937 /* Look for the `('. */
21940 /* Look for the string-literal. */
21943 /* Look for the `)'. */
21947 }
21949 /* Parse an asm-operand-list.
21951 asm-operand-list:
21952 asm-operand
21953 asm-operand-list , asm-operand
21955 asm-operand:
21956 string-literal ( expression )
21957 [ string-literal ] string-literal ( expression )
21959 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21960 each node is the expression. The TREE_PURPOSE is itself a
21961 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21962 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21963 is a STRING_CST for the string literal before the parenthesis. Returns
21964 ERROR_MARK_NODE if any of the operands are invalid. */
21966 static tree
21968 {
21973 {
21974 tree string_literal;
21975 tree expression;
21976 tree name;
21979 {
21980 /* Consume the `[' token. */
21982 /* Read the operand name. */
21987 /* Look for the closing `]'. */
21989 }
21990 else
21992 /* Look for the string-literal. */
21995 /* Look for the `('. */
21997 /* Parse the expression. */
21999 /* Look for the `)'. */
22007 /* Add this operand to the list. */
22009 expression,
22010 asm_operands);
22011 /* If the next token is not a `,', there are no more
22012 operands. */
22015 /* Consume the `,'. */
22017 }
22020 }
22022 /* Parse an asm-clobber-list.
22024 asm-clobber-list:
22025 string-literal
22026 asm-clobber-list , string-literal
22028 Returns a TREE_LIST, indicating the clobbers in the order that they
22029 appeared. The TREE_VALUE of each node is a STRING_CST. */
22031 static tree
22033 {
22037 {
22038 tree string_literal;
22040 /* Look for the string literal. */
22042 /* Add it to the list. */
22044 /* If the next token is not a `,', then the list is
22045 complete. */
22048 /* Consume the `,' token. */
22050 }
22053 }
22055 /* Parse an asm-label-list.
22057 asm-label-list:
22058 identifier
22059 asm-label-list , identifier
22061 Returns a TREE_LIST, indicating the labels in the order that they
22062 appeared. The TREE_VALUE of each node is a label. */
22064 static tree
22066 {
22070 {
22073 /* Look for the identifier. */
22076 {
22079 {
22085 }
22086 }
22087 /* If the next token is not a `,', then the list is
22088 complete. */
22091 /* Consume the `,' token. */
22093 }
22096 }
22098 /* Return TRUE iff the next tokens in the stream are possibly the
22099 beginning of a GNU extension attribute. */
22101 static bool
22103 {
22105 }
22107 /* Return TRUE iff the next tokens in the stream are possibly the
22108 beginning of a standard C++-11 attribute specifier. */
22110 static bool
22112 {
22114 }
22116 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22117 beginning of a standard C++-11 attribute specifier. */
22119 static bool
22121 {
22129 }
22131 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22132 beginning of a GNU extension attribute. */
22134 static bool
22136 {
22140 }
22142 /* Return true iff the next tokens can be the beginning of either a
22143 GNU attribute list, or a standard C++11 attribute sequence. */
22145 static bool
22147 {
22150 }
22152 /* Return true iff the next Nth tokens can be the beginning of either
22153 a GNU attribute list, or a standard C++11 attribute sequence. */
22155 static bool
22157 {
22160 }
22162 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22163 of GNU attributes, or return NULL. */
22165 static tree
22167 {
22171 }
22173 #define CILK_SIMD_FN_CLAUSE_MASK \
22174 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22175 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22176 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22177 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22178 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22180 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22181 vector [(<clauses>)] */
22183 static void
22185 {
22189 {
22194 }
22197 {
22200 paren_scope++;
22201 }
22203 {
22206 paren_scope++;
22208 paren_scope--;
22209 /* Do not push the last ')' */
22212 }
22221 }
22223 /* Parse an (optional) series of attributes.
22225 attributes:
22226 attributes attribute
22228 attribute:
22229 __attribute__ (( attribute-list [opt] ))
22231 The return value is as for cp_parser_gnu_attribute_list. */
22233 static tree
22235 {
22239 {
22241 tree attribute_list;
22244 /* Peek at the next token. */
22246 /* If it's not `__attribute__', then we're done. */
22250 /* Consume the `__attribute__' keyword. */
22252 /* Look for the two `(' tokens. */
22256 /* Peek at the next token. */
22259 /* Parse the attribute-list. */
22261 else
22262 /* If the next token is a `)', then there is no attribute
22263 list. */
22266 /* Look for the two `)' tokens. */
22274 /* Add these new attributes to the list. */
22276 }
22279 }
22281 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22282 "__vector" or "__vector__." */
22286 {
22290 }
22292 /* Parse a GNU attribute-list.
22294 attribute-list:
22295 attribute
22296 attribute-list , attribute
22298 attribute:
22299 identifier
22300 identifier ( identifier )
22301 identifier ( identifier , expression-list )
22302 identifier ( expression-list )
22304 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22305 to an attribute. The TREE_PURPOSE of each node is the identifier
22306 indicating which attribute is in use. The TREE_VALUE represents
22307 the arguments, if any. */
22309 static tree
22311 {
22317 {
22319 tree identifier;
22320 tree attribute;
22322 /* Look for the identifier. We also allow keywords here; for
22323 example `__attribute__ ((const))' is legal. */
22327 {
22330 /* Consume the token, but save it since we need it for the
22331 SIMD enabled function parsing. */
22334 /* Save away the identifier that indicates which attribute
22335 this is. */
22337 /* For keywords, use the canonical spelling, not the
22338 parsed identifier. */
22344 /* Peek at the next token. */
22346 /* If it's an `(', then parse the attribute arguments. */
22348 {
22353 {
22356 }
22357 else
22358 vec = cp_parser_parenthesized_expression_list
22364 else
22365 {
22368 }
22369 /* Save the arguments away. */
22371 }
22373 {
22376 }
22379 {
22380 /* Add this attribute to the list. */
22383 }
22386 }
22387 /* Now, look for more attributes. If the next token isn't a
22388 `,', we're done. */
22392 /* Consume the comma and keep going. */
22394 }
22397 /* We built up the list in reverse order. */
22399 }
22401 /* Parse a standard C++11 attribute.
22403 The returned representation is a TREE_LIST which TREE_PURPOSE is
22404 the scoped name of the attribute, and the TREE_VALUE is its
22405 arguments list.
22407 Note that the scoped name of the attribute is itself a TREE_LIST
22408 which TREE_PURPOSE is the namespace of the attribute, and
22409 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22410 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22411 and which TREE_PURPOSE is directly the attribute name.
22413 Clients of the attribute code should use get_attribute_namespace
22414 and get_attribute_name to get the actual namespace and name of
22415 attributes, regardless of their being GNU or C++11 attributes.
22417 attribute:
22418 attribute-token attribute-argument-clause [opt]
22420 attribute-token:
22421 identifier
22422 attribute-scoped-token
22424 attribute-scoped-token:
22425 attribute-namespace :: identifier
22427 attribute-namespace:
22428 identifier
22430 attribute-argument-clause:
22431 ( balanced-token-seq )
22433 balanced-token-seq:
22434 balanced-token [opt]
22435 balanced-token-seq balanced-token
22437 balanced-token:
22438 ( balanced-token-seq )
22439 [ balanced-token-seq ]
22440 { balanced-token-seq }. */
22442 static tree
22444 {
22448 /* First, parse name of the the attribute, a.k.a
22449 attribute-token. */
22466 {
22467 /* We are seeing a scoped attribute token. */
22477 else
22478 {
22482 }
22484 NULL_TREE);
22486 }
22487 else
22488 {
22490 NULL_TREE);
22491 /* C++11 noreturn attribute is equivalent to GNU's. */
22494 /* C++14 deprecated attribute is equivalent to GNU's. */
22496 {
22499 "%<deprecated%> is a C++14 feature;"
22502 }
22503 }
22505 /* Now parse the optional argument clause of the attribute. */
22510 {
22516 /* A GNU attribute that takes an identifier in parameter. */
22519 vec = cp_parser_parenthesized_expression_list
22525 else
22526 {
22529 }
22533 else
22535 }
22538 }
22540 /* Check that the attribute ATTRIBUTE appears at most once in the
22541 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
22542 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
22543 isn't implemented yet in GCC. */
22545 static void
22547 {
22549 {
22559 }
22560 }
22562 /* Parse a list of standard C++-11 attributes.
22564 attribute-list:
22565 attribute [opt]
22566 attribute-list , attribute[opt]
22567 attribute ...
22568 attribute-list , attribute ...
22569 */
22571 static tree
22573 {
22578 {
22583 {
22587 }
22590 {
22595 }
22599 }
22602 }
22604 /* Parse a standard C++-11 attribute specifier.
22606 attribute-specifier:
22607 [ [ attribute-list ] ]
22608 alignment-specifier
22610 alignment-specifier:
22611 alignas ( type-id ... [opt] )
22612 alignas ( alignment-expression ... [opt] ). */
22614 static tree
22616 {
22622 {
22631 else
22632 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22633 when we are sure that we have actually parsed them. */
22635 }
22636 else
22637 {
22638 tree alignas_expr;
22640 /* Look for an alignment-specifier. */
22652 {
22655 }
22661 {
22665 alignas_expr =
22672 }
22678 {
22681 }
22684 {
22687 }
22689 /* Build the C++-11 representation of an 'aligned'
22690 attribute. */
22691 attributes =
22694 alignas_expr);
22695 }
22698 }
22700 /* Parse a standard C++-11 attribute-specifier-seq.
22702 attribute-specifier-seq:
22703 attribute-specifier-seq [opt] attribute-specifier
22704 */
22706 static tree
22708 {
22712 {
22721 }
22725 }
22727 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22728 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22729 current value of the PEDANTIC flag, regardless of whether or not
22730 the `__extension__' keyword is present. The caller is responsible
22731 for restoring the value of the PEDANTIC flag. */
22733 static bool
22735 {
22736 /* Save the old value of the PEDANTIC flag. */
22740 {
22741 /* Consume the `__extension__' token. */
22743 /* We're not being pedantic while the `__extension__' keyword is
22744 in effect. */
22748 }
22751 }
22753 /* Parse a label declaration.
22755 label-declaration:
22756 __label__ label-declarator-seq ;
22758 label-declarator-seq:
22759 identifier , label-declarator-seq
22760 identifier */
22762 static void
22764 {
22765 /* Look for the `__label__' keyword. */
22769 {
22770 tree identifier;
22772 /* Look for an identifier. */
22774 /* If we failed, stop. */
22777 /* Declare it as a label. */
22779 /* If the next token is a `;', stop. */
22782 /* Look for the `,' separating the label declarations. */
22784 }
22786 /* Look for the final `;'. */
22788 }
22790 /* Support Functions */
22792 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22793 NAME should have one of the representations used for an
22794 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22795 is returned. If PARSER->SCOPE is a dependent type, then a
22796 SCOPE_REF is returned.
22798 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22799 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22800 was formed. Abstractly, such entities should not be passed to this
22801 function, because they do not need to be looked up, but it is
22802 simpler to check for this special case here, rather than at the
22803 call-sites.
22805 In cases not explicitly covered above, this function returns a
22806 DECL, OVERLOAD, or baselink representing the result of the lookup.
22807 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22808 is returned.
22810 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22811 (e.g., "struct") that was used. In that case bindings that do not
22812 refer to types are ignored.
22814 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22815 ignored.
22817 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22818 are ignored.
22820 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22821 types.
22823 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22824 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22825 NULL_TREE otherwise. */
22827 static tree
22834 location_t name_location)
22835 {
22836 tree decl;
22839 /* Assume that the lookup will be unambiguous. */
22843 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22844 no longer valid. Note that if we are parsing tentatively, and
22845 the parse fails, OBJECT_TYPE will be automatically restored. */
22851 /* A template-id has already been resolved; there is no lookup to
22852 do. */
22856 {
22860 }
22862 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22863 it should already have been checked to make sure that the name
22864 used matches the type being destroyed. */
22866 {
22867 tree type;
22869 /* Figure out to which type this destructor applies. */
22874 else
22876 /* If that's not a class type, there is no destructor. */
22883 /* If it was a class type, return the destructor. */
22885 }
22887 /* By this point, the NAME should be an ordinary identifier. If
22888 the id-expression was a qualified name, the qualifying scope is
22889 stored in PARSER->SCOPE at this point. */
22892 /* Perform the lookup. */
22894 {
22900 /* If the SCOPE is dependent, the lookup must be deferred until
22901 the template is instantiated -- unless we are explicitly
22902 looking up names in uninstantiated templates. Even then, we
22903 cannot look up the name if the scope is not a class type; it
22904 might, for example, be a template type parameter. */
22909 /* Defer lookup. */
22911 else
22912 {
22915 /* If PARSER->SCOPE is a dependent type, then it must be a
22916 class type, and we must not be checking dependencies;
22917 otherwise, we would have processed this lookup above. So
22918 that PARSER->SCOPE is not considered a dependent base by
22919 lookup_member, we must enter the scope here. */
22923 /* If the PARSER->SCOPE is a template specialization, it
22924 may be instantiated during name lookup. In that case,
22925 errors may be issued. Even if we rollback the current
22926 tentative parse, those errors are valid. */
22931 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22932 lookup result and the nested-name-specifier nominates a class C:
22933 * if the name specified after the nested-name-specifier, when
22934 looked up in C, is the injected-class-name of C (Clause 9), or
22935 * if the name specified after the nested-name-specifier is the
22936 same as the identifier or the simple-template-id's template-
22937 name in the last component of the nested-name-specifier,
22938 the name is instead considered to name the constructor of
22939 class C. [ Note: for example, the constructor is not an
22940 acceptable lookup result in an elaborated-type-specifier so
22941 the constructor would not be used in place of the
22942 injected-class-name. --end note ] Such a constructor name
22943 shall be used only in the declarator-id of a declaration that
22944 names a constructor or in a using-declaration. */
22952 /* If we have a single function from a using decl, pull it out. */
22959 }
22961 /* If the scope is a dependent type and either we deferred lookup or
22962 we did lookup but didn't find the name, rememeber the name. */
22965 {
22967 {
22968 tree type;
22970 /* The resolution to Core Issue 180 says that `struct
22971 A::B' should be considered a type-name, even if `A'
22972 is dependent. */
22977 }
22981 CPP_CLOSE_PAREN)))
22985 else
22988 is_template);
22989 }
22992 }
22994 {
22995 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22996 OBJECT_TYPE is not a class. */
22998 /* If the OBJECT_TYPE is a template specialization, it may
22999 be instantiated during name lookup. In that case, errors
23000 may be issued. Even if we rollback the current tentative
23001 parse, those errors are valid. */
23003 name,
23006 tf_warning_or_error);
23007 else
23011 /* Look it up in the enclosing context. */
23017 }
23018 else
23019 {
23025 }
23027 /* If the lookup failed, let our caller know. */
23031 /* Pull out the template from an injected-class-name (or multiple). */
23035 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
23037 {
23040 /* The error message we have to print is too complicated for
23041 cp_parser_error, so we incorporate its actions directly. */
23043 {
23045 name);
23047 }
23049 }
23057 /* If we have resolved the name of a member declaration, check to
23058 see if the declaration is accessible. When the name resolves to
23059 set of overloaded functions, accessibility is checked when
23060 overload resolution is done.
23062 During an explicit instantiation, access is not checked at all,
23063 as per [temp.explicit]. */
23070 }
23072 /* Like cp_parser_lookup_name, but for use in the typical case where
23073 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
23074 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
23076 static tree
23078 {
23080 none_type,
23085 location);
23086 }
23088 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
23089 the current context, return the TYPE_DECL. If TAG_NAME_P is
23090 true, the DECL indicates the class being defined in a class-head,
23091 or declared in an elaborated-type-specifier.
23093 Otherwise, return DECL. */
23095 static tree
23097 {
23098 /* If the TEMPLATE_DECL is being declared as part of a class-head,
23099 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
23101 struct A {
23102 template <typename T> struct B;
23103 };
23105 template <typename T> struct A::B {};
23107 Similarly, in an elaborated-type-specifier:
23109 namespace N { struct X{}; }
23111 struct A {
23112 template <typename T> friend struct N::X;
23113 };
23115 However, if the DECL refers to a class type, and we are in
23116 the scope of the class, then the name lookup automatically
23117 finds the TYPE_DECL created by build_self_reference rather
23118 than a TEMPLATE_DECL. For example, in:
23120 template <class T> struct S {
23121 S s;
23122 };
23124 there is no need to handle such case. */
23130 }
23132 /* If too many, or too few, template-parameter lists apply to the
23133 declarator, issue an error message. Returns TRUE if all went well,
23134 and FALSE otherwise. */
23136 static bool
23139 location_t declarator_location)
23140 {
23142 {
23144 {
23152 /* If the DECLARATOR has the form `X<y>' then it uses one
23153 additional level of template parameters. */
23156 return cp_parser_check_template_parameters
23158 }
23173 }
23175 }
23177 /* NUM_TEMPLATES were used in the current declaration. If that is
23178 invalid, return FALSE and issue an error messages. Otherwise,
23179 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23180 declarator and we can print more accurate diagnostics. */
23182 static bool
23185 location_t location,
23187 {
23188 /* If there are the same number of template classes and parameter
23189 lists, that's OK. */
23192 /* If there are more, but only one more, then we are referring to a
23193 member template. That's OK too. */
23196 /* If there are more template classes than parameter lists, we have
23197 something like:
23199 template <class T> void S<T>::R<T>::f (); */
23201 {
23211 else
23214 }
23215 /* Otherwise, there are too many template parameter lists. We have
23216 something like:
23218 template <class T> template <class U> void S::f(); */
23221 }
23223 /* Parse an optional `::' token indicating that the following name is
23224 from the global namespace. If so, PARSER->SCOPE is set to the
23225 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23226 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23227 Returns the new value of PARSER->SCOPE, if the `::' token is
23228 present, and NULL_TREE otherwise. */
23230 static tree
23232 {
23235 /* Peek at the next token. */
23237 /* If we're looking at a `::' token then we're starting from the
23238 global namespace, not our current location. */
23240 {
23241 /* Consume the `::' token. */
23243 /* Set the SCOPE so that we know where to start the lookup. */
23249 }
23251 {
23255 }
23258 }
23260 /* Returns TRUE if the upcoming token sequence is the start of a
23261 constructor declarator. If FRIEND_P is true, the declarator is
23262 preceded by the `friend' specifier. */
23264 static bool
23266 {
23269 tree nested_name_specifier;
23272 /* The common case is that this is not a constructor declarator, so
23273 try to avoid doing lots of work if at all possible. It's not
23274 valid declare a constructor at function scope. */
23277 /* And only certain tokens can begin a constructor declarator. */
23285 /* Parse tentatively; we are going to roll back all of the tokens
23286 consumed here. */
23288 /* Assume that we are looking at a constructor declarator. */
23291 /* Look for the optional `::' operator. */
23294 /* Look for the nested-name-specifier. */
23295 nested_name_specifier
23306 /* Outside of a class-specifier, there must be a
23307 nested-name-specifier. */
23313 /* If we have a class scope, this is easy; DR 147 says that S::S always
23314 names the constructor, and no other qualified name could. */
23317 {
23327 }
23328 /* If we still think that this might be a constructor-declarator,
23329 look for a class-name. */
23331 {
23332 /* If we have:
23334 template <typename T> struct S {
23335 S();
23336 };
23338 we must recognize that the nested `S' names a class. */
23339 tree type_decl;
23343 none_type,
23347 /* If there was no class-name, then this is not a constructor.
23348 Otherwise, if we are in a class-specifier and we aren't
23349 handling a friend declaration, check that its type matches
23350 current_class_type (c++/38313). Note: error_mark_node
23351 is left alone for error recovery purposes. */
23353 && (outside_class_specifier_p
23358 /* If we're still considering a constructor, we have to see a `(',
23359 to begin the parameter-declaration-clause, followed by either a
23360 `)', an `...', or a decl-specifier. We need to check for a
23361 type-specifier to avoid being fooled into thinking that:
23363 S (f) (int);
23365 is a constructor. (It is actually a function named `f' that
23366 takes one parameter (of type `int') and returns a value of type
23367 `S'. */
23375 /* A parameter declaration begins with a decl-specifier,
23376 which is either the "attribute" keyword, a storage class
23377 specifier, or (usually) a type-specifier. */
23379 {
23380 tree type;
23384 /* Names appearing in the type-specifier should be looked up
23385 in the scope of the class. */
23388 else
23389 {
23392 {
23396 {
23399 }
23400 }
23402 }
23404 /* Inside the constructor parameter list, surrounding
23405 template-parameter-lists do not apply. */
23406 saved_num_template_parameter_lists
23410 /* Look for the type-specifier. */
23412 CP_PARSER_FLAGS_NONE,
23418 parser->num_template_parameter_lists
23421 /* Leave the scope of the class. */
23426 }
23427 }
23429 /* We did not really want to consume any tokens. */
23433 }
23435 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23436 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23437 they must be performed once we are in the scope of the function.
23439 Returns the function defined. */
23441 static tree
23442 cp_parser_function_definition_from_specifiers_and_declarator
23445 tree attributes,
23447 {
23448 tree fn;
23451 /* Begin the function-definition. */
23454 /* The things we're about to see are not directly qualified by any
23455 template headers we've seen thus far. */
23458 /* If there were names looked up in the decl-specifier-seq that we
23459 did not check, check them now. We must wait until we are in the
23460 scope of the function to perform the checks, since the function
23461 might be a friend. */
23465 {
23468 }
23471 {
23472 /* Skip the entire function. */
23475 }
23477 {
23478 /* Seen already, skip it. An error message has already been output. */
23482 /* If this is a function from a class, pop the nested class. */
23485 }
23486 else
23487 {
23488 timevar_id_t tv;
23491 else
23497 }
23500 }
23502 /* Parse the part of a function-definition that follows the
23503 declarator. INLINE_P is TRUE iff this function is an inline
23504 function defined within a class-specifier.
23506 Returns the function defined. */
23508 static tree
23511 {
23512 tree fn;
23518 bool fully_implicit_function_template_p
23521 tree implicit_template_parms
23524 cp_binding_level* implicit_template_scope
23530 /* If the next token is `return', then the code may be trying to
23531 make use of the "named return value" extension that G++ used to
23532 support. */
23535 {
23536 /* Consume the `return' keyword. */
23538 /* Look for the identifier that indicates what value is to be
23539 returned. */
23541 /* Issue an error message. */
23544 /* Skip tokens until we reach the start of the function body. */
23546 {
23553 }
23554 }
23555 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23556 anything declared inside `f'. */
23557 saved_in_unbraced_linkage_specification_p
23560 /* Inside the function, surrounding template-parameter-lists do not
23561 apply. */
23562 saved_num_template_parameter_lists
23568 /* If the next token is `try', `__transaction_atomic', or
23569 `__transaction_relaxed`, then we are looking at either function-try-block
23570 or function-transaction-block. Note that all of these include the
23571 function-body. */
23574 RID_TRANSACTION_ATOMIC);
23576 RID_TRANSACTION_RELAXED))
23578 RID_TRANSACTION_RELAXED);
23581 else
23582 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23587 /* Finish the function. */
23590 /* Generate code for it, if necessary. */
23592 /* Restore the saved values. */
23593 parser->in_unbraced_linkage_specification_p
23595 parser->num_template_parameter_lists
23599 parser->fully_implicit_function_template_p
23601 parser->implicit_template_parms
23603 parser->implicit_template_scope
23610 }
23612 /* Parse a template-declaration, assuming that the `export' (and
23613 `extern') keywords, if present, has already been scanned. MEMBER_P
23614 is as for cp_parser_template_declaration. */
23616 static void
23618 {
23621 tree parameter_list;
23626 /* Look for the `template' keyword. */
23631 /* And the `<'. */
23635 {
23636 /* 14.5.2.2 [temp.mem]
23638 A local class shall not have member templates. */
23643 }
23644 /* [temp]
23646 A template ... shall not have C linkage. */
23648 {
23650 /* Give it C++ linkage to avoid confusing other parts of the
23651 front end. */
23654 }
23655 else
23658 /* We cannot perform access checks on the template parameter
23659 declarations until we know what is being declared, just as we
23660 cannot check the decl-specifier list. */
23663 /* If the next token is `>', then we have an invalid
23664 specialization. Rather than complain about an invalid template
23665 parameter, issue an error message here. */
23667 {
23671 }
23672 else
23673 {
23674 /* Parse the template parameters. */
23676 }
23678 /* Get the deferred access checks from the parameter list. These
23679 will be checked once we know what is being declared, as for a
23680 member template the checks must be performed in the scope of the
23681 class containing the member. */
23684 /* Look for the `>'. */
23686 /* We just processed one more parameter list. */
23688 /* If the next token is `template', there are more template
23689 parameters. */
23691 RID_TEMPLATE))
23696 else
23697 {
23698 /* There are no access checks when parsing a template, as we do not
23699 know if a specialization will be a friend. */
23703 checks,
23704 member_p,
23709 /* If this is a member template declaration, let the front
23710 end know. */
23712 {
23717 }
23722 }
23723 /* We are done with the current parameter list. */
23728 /* Finish up. */
23731 /* Check the template arguments for a literal operator template. */
23735 {
23739 else
23740 {
23743 {
23749 }
23751 {
23759 }
23760 else
23762 }
23764 {
23767 " Expected non-type template argument pack <char...>"
23769 decl);
23770 else
23773 decl);
23774 }
23775 }
23776 /* Register member declarations. */
23779 /* For the erroneous case of a template with C linkage, we pushed an
23780 implicit C++ linkage scope; exit that scope now. */
23783 /* If DECL is a function template, we must return to parse it later.
23784 (Even though there is no definition, there might be default
23785 arguments that need handling.) */
23789 }
23791 /* Perform the deferred access checks from a template-parameter-list.
23792 CHECKS is a TREE_LIST of access checks, as returned by
23793 get_deferred_access_checks. */
23795 static void
23796 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23797 {
23801 }
23803 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23804 `function-definition' sequence that follows a template header.
23805 If MEMBER_P is true, this declaration appears in a class scope.
23807 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23808 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23810 static tree
23816 {
23819 cp_decl_specifier_seq decl_specifiers;
23823 /* This function is only used when processing a template
23824 declaration. */
23828 /* Defer access checks until we know what is being declared. */
23831 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23832 alternative. */
23835 CP_PARSER_FLAGS_OPTIONAL,
23841 /* There are no template typedefs. */
23843 {
23847 }
23849 /* Gather up the access checks that occurred the
23850 decl-specifier-seq. */
23853 /* Check for the declaration of a template class. */
23855 {
23857 {
23860 /* In this case:
23862 struct C {
23863 friend template <typename T> struct A<T>::B;
23864 };
23866 A<T>::B will be represented by a TYPENAME_TYPE, and
23867 therefore not recognized by shadow_tag. */
23869 && !decl
23876 else
23879 /* Perform access checks for template parameters. */
23881 }
23882 }
23884 /* Complain about missing 'typename' or other invalid type names. */
23887 {
23888 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23889 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23890 the rest of this declaration. */
23893 }
23895 /* If it's not a template class, try for a template function. If
23896 the next token is a `;', then this declaration does not declare
23897 anything. But, if there were errors in the decl-specifiers, then
23898 the error might well have come from an attempted class-specifier.
23899 In that case, there's no need to warn about a missing declarator. */
23903 {
23906 checks,
23908 member_p,
23909 declares_class_or_enum,
23913 /* 7.1.1-1 [dcl.stc]
23915 A storage-class-specifier shall not be specified in an explicit
23916 specialization... */
23918 && explicit_specialization_p
23920 {
23924 }
23928 }
23930 /* Look for a trailing `;' after the declaration. */
23936 out:
23939 /* Clear any current qualification; whatever comes next is the start
23940 of something new. */
23946 }
23948 /* Parse a cast-expression that is not the operand of a unary "&". */
23950 static tree
23952 {
23955 }
23957 /* Parse a functional cast to TYPE. Returns an expression
23958 representing the cast. */
23960 static tree
23962 {
23964 tree expression_list;
23965 tree cast;
23972 {
23980 tf_warning_or_error);
23981 }
23990 else
23991 {
23994 }
23997 tf_warning_or_error);
23998 /* [expr.const]/1: In an integral constant expression "only type
23999 conversions to integral or enumeration type can be used". */
24005 NIC_CONSTRUCTOR))
24008 }
24010 /* Save the tokens that make up the body of a member function defined
24011 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
24012 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
24013 specifiers applied to the declaration. Returns the FUNCTION_DECL
24014 for the member function. */
24016 static tree
24020 tree attributes)
24021 {
24024 tree fn;
24026 /* Create the FUNCTION_DECL. */
24029 /* If something went badly wrong, bail out now. */
24031 {
24032 /* If there's a function-body, skip it. */
24037 }
24039 /* Remember it, if there default args to post process. */
24042 /* Save away the tokens that make up the body of the
24043 function. */
24045 /* Handle function try blocks. */
24048 /* We can have braced-init-list mem-initializers before the fn body. */
24050 {
24053 {
24054 /* cache_group will stop after an un-nested { } pair, too. */
24058 /* variadic mem-inits have ... after the ')'. */
24061 }
24062 }
24064 /* Handle function try blocks. */
24069 /* Save away the inline definition; we will process it when the
24070 class is complete. */
24074 /* We need to know that this was defined in the class, so that
24075 friend templates are handled correctly. */
24078 /* Add FN to the queue of functions to be parsed later. */
24082 }
24084 /* Save the tokens that make up the in-class initializer for a non-static
24085 data member. Returns a DEFAULT_ARG. */
24087 static tree
24089 {
24091 }
24093 /* Parse a template-argument-list, as well as the trailing ">" (but
24094 not the opening "<"). See cp_parser_template_argument_list for the
24095 return value. */
24097 static tree
24099 {
24100 tree arguments;
24101 tree saved_scope;
24102 tree saved_qualifying_scope;
24103 tree saved_object_scope;
24108 /* [temp.names]
24110 When parsing a template-id, the first non-nested `>' is taken as
24111 the end of the template-argument-list rather than a greater-than
24112 operator. */
24113 saved_greater_than_is_operator_p
24116 /* Parsing the argument list may modify SCOPE, so we save it
24117 here. */
24121 /* We need to evaluate the template arguments, even though this
24122 template-id may be nested within a "sizeof". */
24127 /* Parse the template-argument-list itself. */
24131 else
24133 /* Look for the `>' that ends the template-argument-list. If we find
24134 a '>>' instead, it's probably just a typo. */
24136 {
24138 {
24139 /* In C++0x, a `>>' in a template argument list or cast
24140 expression is considered to be two separate `>'
24141 tokens. So, change the current token to a `>', but don't
24142 consume it: it will be consumed later when the outer
24143 template argument list (or cast expression) is parsed.
24144 Note that this replacement of `>' for `>>' is necessary
24145 even if we are parsing tentatively: in the tentative
24146 case, after calling
24147 cp_parser_enclosed_template_argument_list we will always
24148 throw away all of the template arguments and the first
24149 closing `>', either because the template argument list
24150 was erroneous or because we are replacing those tokens
24151 with a CPP_TEMPLATE_ID token. The second `>' (which will
24152 not have been thrown away) is needed either to close an
24153 outer template argument list or to complete a new-style
24154 cast. */
24157 }
24159 {
24160 /* If we're in a nested template argument list, the '>>' has
24161 to be a typo for '> >'. We emit the error message, but we
24162 continue parsing and we push a '>' as next token, so that
24163 the argument list will be parsed correctly. Note that the
24164 global source location is still on the token before the
24165 '>>', so we need to say explicitly where we want it. */
24171 }
24172 else
24173 {
24174 /* If this is not a nested template argument list, the '>>'
24175 is a typo for '>'. Emit an error message and continue.
24176 Same deal about the token location, but here we can get it
24177 right by consuming the '>>' before issuing the diagnostic. */
24180 "spurious %<>>%>, use %<>%> to terminate "
24182 }
24183 }
24184 else
24186 /* The `>' token might be a greater-than operator again now. */
24187 parser->greater_than_is_operator_p
24189 /* Restore the SAVED_SCOPE. */
24197 }
24199 /* MEMBER_FUNCTION is a member function, or a friend. If default
24200 arguments, or the body of the function have not yet been parsed,
24201 parse them now. */
24203 static void
24205 {
24207 /* If this member is a template, get the underlying
24208 FUNCTION_DECL. */
24212 /* There should not be any class definitions in progress at this
24213 point; the bodies of members are only parsed outside of all class
24214 definitions. */
24216 /* While we're parsing the member functions we might encounter more
24217 classes. We want to handle them right away, but we don't want
24218 them getting mixed up with functions that are currently in the
24219 queue. */
24222 /* Make sure that any template parameters are in scope. */
24225 /* If the body of the function has not yet been parsed, parse it
24226 now. */
24228 {
24229 tree function_scope;
24232 /* The function is no longer pending; we are processing it. */
24237 /* If this is a local class, enter the scope of the containing
24238 function. */
24243 /* Push the body of the function onto the lexer stack. */
24246 /* Let the front end know that we going to be defining this
24247 function. */
24251 /* Don't do access checking if it is a templated function. */
24255 /* #pragma omp declare reduction needs special parsing. */
24257 {
24262 }
24263 else
24264 /* Now, parse the body of the function. */
24271 /* Leave the scope of the containing function. */
24275 }
24277 /* Remove any template parameters from the symbol table. */
24280 /* Restore the queue. */
24283 }
24285 /* If DECL contains any default args, remember it on the unparsed
24286 functions queue. */
24288 static void
24290 {
24291 tree probe;
24294 probe;
24297 {
24301 }
24302 }
24304 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24305 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24306 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24307 from the parameter-type-list. */
24309 static tree
24312 {
24314 tree parsed_arg;
24320 /* Push the saved tokens for the default argument onto the parser's
24321 lexer stack. */
24327 /* Parse the default argument. */
24338 {
24339 /* In a non-template class, check conversions now. In a template,
24340 we'll wait and instantiate these as needed. */
24343 tf_warning_or_error);
24344 else
24346 }
24348 /* If the token stream has not been completely used up, then
24349 there was extra junk after the end of the default
24350 argument. */
24352 {
24355 else
24357 }
24359 /* Revert to the main lexer. */
24363 }
24365 /* FIELD is a non-static data member with an initializer which we saved for
24366 later; parse it now. */
24368 static void
24370 {
24371 tree def;
24378 NULL_TREE);
24384 }
24386 /* FN is a FUNCTION_DECL which may contains a parameter with an
24387 unparsed DEFAULT_ARG. Parse the default args now. This function
24388 assumes that the current scope is the scope in which the default
24389 argument should be processed. */
24391 static void
24393 {
24397 /* While we're parsing the default args, we might (due to the
24398 statement expression extension) encounter more classes. We want
24399 to handle them right away, but we don't want them getting mixed
24400 up with default args that are currently in the queue. */
24403 /* Local variable names (and the `this' keyword) may not appear
24404 in a default argument. */
24415 {
24417 tree parsed_arg;
24419 tree copy;
24426 /* This can happen for a friend declaration for a function
24427 already declared with default arguments. */
24430 parsed_arg
24432 default_arg,
24435 {
24437 }
24441 /* Update any instantiations we've already created. */
24445 }
24449 /* Make sure no default arg is missing. */
24452 /* Restore the state of local_variables_forbidden_p. */
24455 /* Restore the queue. */
24457 }
24459 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24461 sizeof ... ( identifier )
24463 where the 'sizeof' token has already been consumed. */
24465 static tree
24467 {
24468 /* Consume the `...'. */
24475 else
24483 /* The name is not qualified. */
24501 }
24503 /* Parse the operand of `sizeof' (or a similar operator). Returns
24504 either a TYPE or an expression, depending on the form of the
24505 input. The KEYWORD indicates which kind of expression we have
24506 encountered. */
24508 static tree
24510 {
24517 /* If it's a `...', then we are computing the length of a parameter
24518 pack. */
24523 /* Types cannot be defined in a `sizeof' expression. Save away the
24524 old message. */
24526 /* And create the new one. */
24532 /* The restrictions on constant-expressions do not apply inside
24533 sizeof expressions. */
24534 saved_integral_constant_expression_p
24536 saved_non_integral_constant_expression_p
24540 /* Do not actually evaluate the expression. */
24543 /* If it's a `(', then we might be looking at the type-id
24544 construction. */
24546 {
24549 /* We can't be sure yet whether we're looking at a type-id or an
24550 expression. */
24552 /* Note: as a GNU Extension, compound literals are considered
24553 postfix-expressions as they are in C99, so they are valid
24554 arguments to sizeof. See comment in cp_parser_cast_expression
24555 for details. */
24558 else
24559 {
24562 /* Look for the type-id. */
24564 /* Look for the closing `)'. */
24567 }
24569 /* If all went well, then we're done. */
24571 {
24572 cp_decl_specifier_seq decl_specs;
24574 /* Build a trivial decl-specifier-seq. */
24578 /* Call grokdeclarator to figure out what type this is. */
24581 TYPENAME,
24584 }
24585 }
24587 /* If the type-id production did not work out, then we must be
24588 looking at the unary-expression production. */
24592 /* Go back to evaluating expressions. */
24596 /* Free the message we created. */
24598 /* And restore the old one. */
24600 parser->integral_constant_expression_p
24602 parser->non_integral_constant_expression_p
24606 }
24608 /* If the current declaration has no declarator, return true. */
24610 static bool
24612 {
24613 /* If the next token is a `;' or a `,' then there is no
24614 declarator. */
24617 }
24619 /* Update the DECL_SPECS to reflect the storage class indicated by
24620 KEYWORD. */
24622 static void
24627 {
24628 cp_storage_class storage_class;
24631 {
24635 }
24637 {
24640 }
24645 {
24648 }
24651 {
24669 }
24673 /* A storage class specifier cannot be applied alongside a typedef
24674 specifier. If there is a typedef specifier present then set
24675 conflicting_specifiers_p which will trigger an error later
24676 on in grokdeclarator. */
24679 }
24681 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24682 is true, the type is a class or enum definition. */
24684 static void
24686 tree type_spec,
24689 {
24692 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24693 (with, for example, in "typedef int wchar_t;") we remember that
24694 this is what happened. In system headers, we ignore these
24695 declarations so that G++ can work with system headers that are not
24696 C++-safe. */
24698 && !type_definition_p
24708 {
24711 ds_redefined_builtin_type_spec,
24712 token);
24714 {
24718 }
24719 }
24722 else
24723 {
24728 }
24729 }
24731 /* True iff TOKEN is the GNU keyword __thread. */
24733 static bool
24735 {
24738 }
24740 /* Set the location for a declarator specifier and check if it is
24741 duplicated.
24743 DECL_SPECS is the sequence of declarator specifiers onto which to
24744 set the location.
24746 DS is the single declarator specifier to set which location is to
24747 be set onto the existing sequence of declarators.
24749 LOCATION is the location for the declarator specifier to
24750 consider. */
24752 static void
24755 {
24764 {
24768 }
24769 else
24770 {
24772 {
24776 else
24777 {
24780 OPT_Wlong_long,
24782 }
24783 }
24785 {
24790 else
24792 }
24793 else
24794 {
24810 "__complex"
24811 };
24814 }
24815 }
24816 }
24818 /* Return true iff the declarator specifier DS is present in the
24819 sequence of declarator specifiers DECL_SPECS. */
24821 bool
24823 cp_decl_spec ds)
24824 {
24831 }
24833 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24834 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24836 static bool
24838 {
24840 }
24842 /* Issue an error message indicating that TOKEN_DESC was expected.
24843 If KEYWORD is true, it indicated this function is called by
24844 cp_parser_require_keword and the required token can only be
24845 a indicated keyword. */
24847 static void
24849 required_token token_desc,
24851 {
24853 {
24922 }
24924 {
24926 {
25005 }
25006 }
25007 else
25009 }
25013 /* If the next token is of the indicated TYPE, consume it. Otherwise,
25014 issue an error message indicating that TOKEN_DESC was expected.
25016 Returns the token consumed, if the token had the appropriate type.
25017 Otherwise, returns NULL. */
25022 required_token token_desc)
25023 {
25026 else
25027 {
25028 /* Output the MESSAGE -- unless we're parsing tentatively. */
25032 }
25033 }
25035 /* An error message is produced if the next token is not '>'.
25036 All further tokens are skipped until the desired token is
25037 found or '{', '}', ';' or an unbalanced ')' or ']'. */
25039 static void
25041 {
25042 /* Current level of '< ... >'. */
25044 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
25047 /* Are we ready, yet? If not, issue error message. */
25051 /* Skip tokens until the desired token is found. */
25053 {
25054 /* Peek at the next token. */
25056 {
25064 /* C++0x views the `>>' operator as two `>' tokens, but
25065 C++98 does not. */
25068 {
25069 /* We've hit a `>>' where the first `>' closes the
25070 template argument list, and the second `>' is
25071 spurious. Just consume the `>>' and stop; we've
25072 already produced at least one error. */
25075 }
25076 /* Fall through for C++0x, so we handle the second `>' in
25077 the `>>'. */
25081 {
25082 /* We've reached the token we want, consume it and stop. */
25085 }
25104 /* The '>' was probably forgotten, don't look further. */
25109 }
25111 /* Consume this token. */
25113 }
25114 }
25116 /* If the next token is the indicated keyword, consume it. Otherwise,
25117 issue an error message indicating that TOKEN_DESC was expected.
25119 Returns the token consumed, if the token had the appropriate type.
25120 Otherwise, returns NULL. */
25125 required_token token_desc)
25126 {
25130 {
25133 }
25136 }
25138 /* Returns TRUE iff TOKEN is a token that can begin the body of a
25139 function-definition. */
25141 static bool
25143 {
25146 /* A ctor-initializer begins with a `:'. */
25148 /* A function-try-block begins with `try'. */
25150 /* A function-transaction-block begins with `__transaction_atomic'
25151 or `__transaction_relaxed'. */
25154 /* The named return value extension begins with `return'. */
25156 }
25158 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25159 definition. */
25161 static bool
25163 {
25170 }
25172 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25173 C++0x) ending a template-argument. */
25175 static bool
25177 {
25185 }
25187 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25188 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25190 static bool
25193 {
25199 /* Check for the sequence `<::' in the original code. It would be lexed as
25200 `[:', where `[' is a digraph, and there is no whitespace before
25201 `:'. */
25203 {
25208 }
25210 }
25212 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25213 or none_type otherwise. */
25215 static enum tag_types
25217 {
25219 {
25229 }
25230 }
25232 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25233 or none_type otherwise or if the token is null. */
25235 static enum tag_types
25237 {
25242 {
25250 }
25251 }
25253 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25255 static void
25257 {
25261 {
25265 type))
25268 }
25269 }
25271 /* Issue an error message if DECL is redeclared with different
25272 access than its original declaration [class.access.spec/3].
25273 This applies to nested classes and nested class templates.
25274 [class.mem/1]. */
25276 static void
25278 {
25287 }
25289 /* Look for the `template' keyword, as a syntactic disambiguator.
25290 Return TRUE iff it is present, in which case it will be
25291 consumed. */
25293 static bool
25295 {
25297 {
25298 /* In C++98 the `template' keyword can only be used within templates;
25299 outside templates the parser can always figure out what is a
25300 template and what is not. In C++11, per the resolution of DR 468,
25301 `template' is allowed in cases where it is not strictly necessary. */
25304 {
25307 "in C++98 %<template%> (as a disambiguator) is only "
25309 /* If this part of the token stream is rescanned, the same
25310 error message would be generated. So, we purge the token
25311 from the stream. */
25314 }
25315 else
25316 {
25317 /* Consume the `template' keyword. */
25320 }
25321 }
25323 }
25325 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25326 set PARSER->SCOPE, and perform other related actions. */
25328 static void
25330 {
25336 /* Get the stored value. */
25338 /* Perform any access checks that were deferred. */
25341 {
25346 }
25347 /* Set the scope from the stored value. */
25351 }
25353 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25354 encounter the end of a block before what we were looking for. */
25356 static bool
25360 {
25362 {
25365 /* Abort a parenthesized expression if we encounter a semicolon. */
25369 /* If we've reached the end of the file, stop. */
25375 /* We've hit the end of an enclosing block, so there's been some
25376 kind of syntax error. */
25379 /* Consume the token. */
25381 /* See if it starts a new group. */
25383 {
25385 /* In theory this should probably check end == '}', but
25386 cp_parser_save_member_function_body needs it to exit
25387 after either '}' or ')' when called with ')'. */
25390 }
25392 {
25396 }
25401 }
25402 }
25404 /* Like above, for caching a default argument or NSDMI. Both of these are
25405 terminated by a non-nested comma, but it can be unclear whether or not a
25406 comma is nested in a template argument list unless we do more parsing.
25407 In order to handle this ambiguity, when we encounter a ',' after a '<'
25408 we try to parse what follows as a parameter-declaration-list (in the
25409 case of a default argument) or a member-declarator (in the case of an
25410 NSDMI). If that succeeds, then we stop caching. */
25412 static tree
25414 {
25419 tree default_argument;
25421 /* Add tokens until we have processed the entire default
25422 argument. We add the range [first_token, token). */
25425 {
25426 /* For list-initialization, this is straightforward. */
25429 }
25431 {
25434 /* Peek at the next token. */
25436 /* What we do depends on what token we have. */
25438 {
25439 /* In valid code, a default argument must be
25440 immediately followed by a `,' `)', or `...'. */
25443 {
25444 /* If we've seen a '<', we might be in a
25445 template-argument-list. Until Core issue 325 is
25446 resolved, we don't know how this situation ought
25447 to be handled, so try to DTRT. We check whether
25448 what comes after the comma is a valid parameter
25449 declaration list. If it is, then the comma ends
25450 the default argument; otherwise the default
25451 argument continues. */
25455 /* Set ITALP so cp_parser_parameter_declaration_list
25456 doesn't decide to commit to this parse. */
25463 {
25464 /* Parse declarators until we reach a non-comma or
25465 somthing that cannot be an initializer.
25466 Just checking whether we're looking at a single
25467 declarator is insufficient. Consider:
25468 int var = tuple<T,U>::x;
25469 The template parameter 'U' looks exactly like a
25470 declarator. */
25471 do
25472 {
25483 }
25485 /* If we met an '=' or ';' then the original comma
25486 was the end of the NSDMI. Otherwise assume
25487 we're still in the NSDMI. */
25490 }
25491 else
25492 {
25497 }
25504 }
25507 /* If we run into a non-nested `;', `}', or `]',
25508 then the code is invalid -- but the default
25509 argument is certainly over. */
25514 /* Handle correctly int n = sizeof ... ( p ); */
25517 /* Update DEPTH, if necessary. */
25532 /* This might be the comparison operator, or it might
25533 start a template argument list. */
25540 /* Fall through for C++0x, which treats the `>>'
25541 operator like two `>' tokens in certain
25542 cases. */
25546 {
25547 /* This might be an operator, or it might close a
25548 template argument list. But if a previous '<'
25549 started a template argument list, this will have
25550 closed it, so we can't be in one anymore. */
25554 }
25557 /* If we run out of tokens, issue an error message. */
25566 /* In these cases, we should look for template-ids.
25567 For example, if the default argument is
25568 `X<int, double>()', we need to do name lookup to
25569 figure out whether or not `X' is a template; if
25570 so, the `,' does not end the default argument.
25572 That is not yet done. */
25577 }
25579 /* If we've reached the end, stop. */
25583 /* Add the token to the token block. */
25585 }
25587 /* Create a DEFAULT_ARG to represent the unparsed default
25588 argument. */
25595 }
25597 /* Begin parsing tentatively. We always save tokens while parsing
25598 tentatively so that if the tentative parsing fails we can restore the
25599 tokens. */
25601 static void
25603 {
25604 /* Enter a new parsing context. */
25606 /* Begin saving tokens. */
25608 /* In order to avoid repetitive access control error messages,
25609 access checks are queued up until we are no longer parsing
25610 tentatively. */
25612 }
25614 /* Commit to the currently active tentative parse. */
25616 static void
25618 {
25622 /* Mark all of the levels as committed. */
25625 {
25632 }
25633 }
25635 /* Commit to the topmost currently active tentative parse.
25637 Note that this function shouldn't be called when there are
25638 irreversible side-effects while in a tentative state. For
25639 example, we shouldn't create a permanent entry in the symbol
25640 table, or issue an error message that might not apply if the
25641 tentative parse is aborted. */
25643 static void
25645 {
25650 {
25658 }
25659 }
25661 /* Abort the currently active tentative parse. All consumed tokens
25662 will be rolled back, and no diagnostics will be issued. */
25664 static void
25666 {
25670 /* Now, pretend that we want to see if the construct was
25671 successfully parsed. */
25673 }
25675 /* Stop parsing tentatively. If a parse error has occurred, restore the
25676 token stream. Otherwise, commit to the tokens we have consumed.
25677 Returns true if no error occurred; false otherwise. */
25679 static bool
25681 {
25685 /* Remember whether or not an error occurred, since we are about to
25686 destroy that information. */
25688 /* Remove the topmost context from the stack. */
25691 /* If no parse errors occurred, commit to the tentative parse. */
25693 {
25694 /* Commit to the tokens read tentatively, unless that was
25695 already done. */
25700 }
25701 /* Otherwise, if errors occurred, roll back our state so that things
25702 are just as they were before we began the tentative parse. */
25703 else
25704 {
25707 }
25708 /* Add the context to the front of the free list. */
25713 }
25715 /* Returns true if we are parsing tentatively and are not committed to
25716 this tentative parse. */
25718 static bool
25720 {
25723 }
25725 /* Returns nonzero iff an error has occurred during the most recent
25726 tentative parse. */
25728 static bool
25730 {
25733 }
25735 /* Returns nonzero if GNU extensions are allowed. */
25737 static bool
25739 {
25741 }
25742 \f
25743 /* Objective-C++ Productions */
25746 /* Parse an Objective-C expression, which feeds into a primary-expression
25747 above.
25749 objc-expression:
25750 objc-message-expression
25751 objc-string-literal
25752 objc-encode-expression
25753 objc-protocol-expression
25754 objc-selector-expression
25756 Returns a tree representation of the expression. */
25758 static tree
25760 {
25761 /* Try to figure out what kind of declaration is present. */
25765 {
25775 {
25787 }
25793 }
25796 }
25798 /* Parse an Objective-C message expression.
25800 objc-message-expression:
25801 [ objc-message-receiver objc-message-args ]
25803 Returns a representation of an Objective-C message. */
25805 static tree
25807 {
25816 }
25818 /* Parse an objc-message-receiver.
25820 objc-message-receiver:
25821 expression
25822 simple-type-specifier
25824 Returns a representation of the type or expression. */
25826 static tree
25828 {
25829 tree rcv;
25831 /* An Objective-C message receiver may be either (1) a type
25832 or (2) an expression. */
25836 /* If that worked out, fine. */
25843 CP_PARSER_FLAGS_NONE);
25850 }
25852 /* Parse the arguments and selectors comprising an Objective-C message.
25854 objc-message-args:
25855 objc-selector
25856 objc-selector-args
25857 objc-selector-args , objc-comma-args
25859 objc-selector-args:
25860 objc-selector [opt] : assignment-expression
25861 objc-selector-args objc-selector [opt] : assignment-expression
25863 objc-comma-args:
25864 assignment-expression
25865 objc-comma-args , assignment-expression
25867 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25868 selector arguments and TREE_VALUE containing a list of comma
25869 arguments. */
25871 static tree
25873 {
25879 {
25885 /* Detect if we have a unary selector. */
25894 sel_args
25899 }
25901 /* Handle non-selector arguments, if any. */
25903 {
25904 tree arg;
25909 addl_args
25914 }
25917 {
25920 }
25923 }
25925 /* Parse an Objective-C encode expression.
25927 objc-encode-expression:
25928 @encode objc-typename
25930 Returns an encoded representation of the type argument. */
25932 static tree
25934 {
25935 tree type;
25945 {
25949 }
25951 /* This happens if we find @encode(T) (where T is a template
25952 typename or something dependent on a template typename) when
25953 parsing a template. In that case, we can't compile it
25954 immediately, but we rather create an AT_ENCODE_EXPR which will
25955 need to be instantiated when the template is used.
25956 */
25958 {
25962 }
25965 }
25967 /* Parse an Objective-C @defs expression. */
25969 static tree
25971 {
25972 tree name;
25980 }
25982 /* Parse an Objective-C protocol expression.
25984 objc-protocol-expression:
25985 @protocol ( identifier )
25987 Returns a representation of the protocol expression. */
25989 static tree
25991 {
25992 tree proto;
26000 }
26002 /* Parse an Objective-C selector expression.
26004 objc-selector-expression:
26005 @selector ( objc-method-signature )
26007 objc-method-signature:
26008 objc-selector
26009 objc-selector-seq
26011 objc-selector-seq:
26012 objc-selector :
26013 objc-selector-seq objc-selector :
26015 Returns a representation of the method selector. */
26017 static tree
26019 {
26031 {
26040 {
26041 /* Detect if we have a unary selector. */
26043 {
26046 }
26047 else
26048 {
26050 }
26051 }
26056 {
26057 sel_seq
26060 sel_seq
26063 }
26064 else
26065 sel_seq
26070 }
26072 finish_selector:
26076 }
26078 /* Parse a list of identifiers.
26080 objc-identifier-list:
26081 identifier
26082 objc-identifier-list , identifier
26084 Returns a TREE_LIST of identifier nodes. */
26086 static tree
26088 {
26089 tree identifier;
26090 tree list;
26101 {
26108 identifier));
26110 }
26113 }
26115 /* Parse an Objective-C alias declaration.
26117 objc-alias-declaration:
26118 @compatibility_alias identifier identifier ;
26120 This function registers the alias mapping with the Objective-C front end.
26121 It returns nothing. */
26123 static void
26125 {
26133 }
26135 /* Parse an Objective-C class forward-declaration.
26137 objc-class-declaration:
26138 @class objc-identifier-list ;
26140 The function registers the forward declarations with the Objective-C
26141 front end. It returns nothing. */
26143 static void
26145 {
26148 {
26149 tree id;
26159 else
26161 }
26163 }
26165 /* Parse a list of Objective-C protocol references.
26167 objc-protocol-refs-opt:
26168 objc-protocol-refs [opt]
26170 objc-protocol-refs:
26171 < objc-identifier-list >
26173 Returns a TREE_LIST of identifiers, if any. */
26175 static tree
26177 {
26181 {
26185 }
26188 }
26190 /* Parse a Objective-C visibility specification. */
26192 static void
26194 {
26198 {
26213 }
26215 /* Eat '@private'/'@protected'/'@public'. */
26217 }
26219 /* Parse an Objective-C method type. Return 'true' if it is a class
26220 (+) method, and 'false' if it is an instance (-) method. */
26224 {
26227 else
26229 }
26231 /* Parse an Objective-C protocol qualifier. */
26233 static tree
26235 {
26248 {
26253 }
26256 }
26258 /* Parse an Objective-C typename. */
26260 static tree
26262 {
26266 {
26272 /* An ObjC type name may consist of just protocol qualifiers, in which
26273 case the type shall default to 'id'. */
26275 {
26278 /* If the type could not be parsed, an error has already
26279 been produced. For error recovery, behave as if it had
26280 not been specified, which will use the default type
26281 'id'. */
26283 {
26285 /* We need to skip to the closing parenthesis as
26286 cp_parser_type_id() does not seem to do it for
26287 us. */
26292 }
26293 }
26297 }
26300 }
26302 /* Check to see if TYPE refers to an Objective-C selector name. */
26304 static bool
26306 {
26312 }
26314 /* Parse an Objective-C selector. */
26316 static tree
26318 {
26322 {
26325 }
26327 /* C++ operator names are allowed to appear in ObjC selectors. */
26329 {
26342 }
26343 }
26345 /* Parse an Objective-C params list. */
26347 static tree
26349 {
26355 {
26365 /* Detect if we have a unary selector. */
26368 {
26371 }
26375 {
26376 /* Something went quite wrong. There should be a colon
26377 here, but there is not. Stop parsing parameters. */
26379 }
26381 /* New ObjC allows attributes on parameters too. */
26386 params
26389 type_name,
26390 identifier,
26391 parm_attr));
26394 }
26397 {
26400 }
26402 /* We allow tail attributes for the method. */
26404 {
26412 }
26415 {
26418 }
26420 }
26422 /* Parse the non-keyword Objective-C params. */
26424 static tree
26427 {
26433 {
26435 tree parm;
26441 {
26446 }
26448 /* TODO: parse attributes for tail parameters. */
26457 }
26459 /* We allow tail attributes for the method. */
26461 {
26463 {
26468 }
26469 else
26470 /* We have an error, but parse the attributes, so that we can
26471 carry on. */
26477 }
26480 }
26482 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26484 static void
26486 {
26489 /* If the next token is `extern' and the following token is a string
26490 literal, then we have a linkage specification. */
26492 && cp_parser_is_pure_string_literal
26495 /* Handle #pragma, if any. */
26498 /* Allow stray semicolons. */
26501 /* Mark methods as optional or required, when building protocols. */
26503 {
26506 }
26508 {
26511 }
26514 /* Other stray characters must generate errors. */
26516 {
26520 }
26521 /* Finally, try to parse a block-declaration, or a function-definition. */
26522 else
26524 }
26526 /* Parse a method signature. */
26528 static tree
26530 {
26546 }
26548 static bool
26550 {
26551 tree tattr;
26556 /* If the attributes are followed by a method introducer, this is not allowed.
26557 Dump the attributes and flag the situation. */
26562 /* Otherwise, the attributes introduce some interstitial code, possibly so
26563 rewind to allow that check. */
26566 }
26568 /* Parse an Objective-C method prototype list. */
26570 static void
26572 {
26576 {
26578 {
26583 else
26587 {
26591 }
26594 }
26600 OPT_Wattributes,
26602 else
26603 /* Allow for interspersed non-ObjC++ code. */
26607 }
26611 else
26615 }
26617 /* Parse an Objective-C method definition list. */
26619 static void
26621 {
26625 {
26626 tree meth;
26629 {
26635 else
26640 {
26644 }
26646 NULL_TREE);
26648 /* For historical reasons, we accept an optional semicolon. */
26655 {
26662 }
26663 }
26664 /* The following case will be removed once @synthesize is
26665 completely implemented. */
26676 else
26677 /* Allow for interspersed non-ObjC++ code. */
26681 }
26685 else
26689 }
26691 /* Parse Objective-C ivars. */
26693 static void
26695 {
26706 {
26707 cp_decl_specifier_seq declspecs;
26709 tree prefix_attributes;
26717 CP_PARSER_FLAGS_OPTIONAL,
26721 /* auto, register, static, extern, mutable. */
26723 {
26726 }
26728 /* thread_local. */
26730 {
26733 }
26735 /* typedef. */
26737 {
26740 }
26745 /* Keep going until we hit the `;' at the end of the
26746 declaration. */
26748 {
26753 /* Check for a (possibly unnamed) bitfield declaration. */
26761 {
26762 /* Get the name of the bitfield. */
26765 sfk_none);
26767 eat_colon:
26769 /* Get the width of the bitfield. */
26770 width
26772 }
26773 else
26774 {
26775 /* Parse the declarator. */
26776 declarator
26782 }
26784 /* Look for attributes that apply to the ivar. */
26786 /* Remember which attributes are prefix attributes and
26787 which are not. */
26789 /* Combine the attributes. */
26793 /* Create the bitfield declaration. */
26795 width,
26796 attributes);
26797 else
26802 /* Add the instance variable. */
26806 /* Reset PREFIX_ATTRIBUTES. */
26815 {
26818 }
26820 }
26824 }
26829 /* Do not consume the RID_AT_END, so it will be read again as terminating
26830 the @interface of @implementation. */
26834 /* For historical reasons, we accept an optional semicolon. */
26837 }
26839 /* Parse an Objective-C protocol declaration. */
26841 static void
26843 {
26849 {
26854 }
26856 /* See if we have a forward declaration or a definition. */
26859 /* Try a forward declaration first. */
26861 {
26863 {
26864 tree id;
26874 else
26876 }
26878 }
26880 /* Ok, we got a full-fledged definition (or at least should). */
26881 else
26882 {
26887 }
26888 }
26890 /* Parse an Objective-C superclass or category. */
26892 static void
26897 {
26903 {
26906 }
26908 {
26911 /* If there is no category name, and this is an @interface, we
26912 have a class extension. */
26914 {
26917 }
26918 else
26922 }
26923 }
26925 /* Parse an Objective-C class interface. */
26927 static void
26929 {
26936 {
26937 /* It's hard to recover because even if valid @interface stuff
26938 is to follow, we can't compile it (or validate it) if we
26939 don't even know which class it refers to. Let's assume this
26940 was a stray '@interface' token in the stream and skip it.
26941 */
26943 }
26948 /* We have either a class or a category on our hands. */
26951 else
26952 {
26954 /* Handle instance variable declarations, if any. */
26957 }
26960 }
26962 /* Parse an Objective-C class implementation. */
26964 static void
26966 {
26973 {
26974 /* It's hard to recover because even if valid @implementation
26975 stuff is to follow, we can't compile it (or validate it) if
26976 we don't even know which class it refers to. Let's assume
26977 this was a stray '@implementation' token in the stream and
26978 skip it.
26979 */
26981 }
26985 /* We have either a class or a category on our hands. */
26988 else
26989 {
26991 /* Handle instance variable declarations, if any. */
26994 }
26997 }
26999 /* Consume the @end token and finish off the implementation. */
27001 static void
27003 {
27006 }
27008 /* Parse an Objective-C declaration. */
27010 static void
27012 {
27013 /* Try to figure out what kind of declaration is present. */
27018 {
27034 }
27037 {
27060 }
27061 }
27063 /* Parse an Objective-C try-catch-finally statement.
27065 objc-try-catch-finally-stmt:
27066 @try compound-statement objc-catch-clause-seq [opt]
27067 objc-finally-clause [opt]
27069 objc-catch-clause-seq:
27070 objc-catch-clause objc-catch-clause-seq [opt]
27072 objc-catch-clause:
27073 @catch ( objc-exception-declaration ) compound-statement
27075 objc-finally-clause:
27076 @finally compound-statement
27078 objc-exception-declaration:
27079 parameter-declaration
27080 '...'
27082 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
27084 Returns NULL_TREE.
27086 PS: This function is identical to c_parser_objc_try_catch_finally_statement
27087 for C. Keep them in sync. */
27089 static tree
27091 {
27092 location_t location;
27093 tree stmt;
27098 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
27099 node, lest it get absorbed into the surrounding block. */
27105 {
27114 {
27115 /* We have "@catch (...)" (where the '...' are literally
27116 what is in the code). Skip the '...'.
27117 parameter_declaration is set to NULL_TREE, and
27118 objc_being_catch_clauses() knows that that means
27119 '...'. */
27122 }
27123 else
27124 {
27125 /* We have "@catch (NSException *exception)" or something
27126 like that. Parse the parameter declaration. */
27130 else
27135 }
27138 else
27139 {
27140 /* If there was no open parenthesis, we are recovering from
27141 an error, and we are trying to figure out what mistake
27142 the user has made. */
27144 /* If there is an immediate closing parenthesis, the user
27145 probably forgot the opening one (ie, they typed "@catch
27146 NSException *e)". Parse the closing parenthesis and keep
27147 going. */
27151 /* If these is no immediate closing parenthesis, the user
27152 probably doesn't know that parenthesis are required at
27153 all (ie, they typed "@catch NSException *e"). So, just
27154 forget about the closing parenthesis and keep going. */
27155 }
27159 }
27161 {
27164 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
27165 node, lest it get absorbed into the surrounding block. */
27169 }
27172 }
27174 /* Parse an Objective-C synchronized statement.
27176 objc-synchronized-stmt:
27177 @synchronized ( expression ) compound-statement
27179 Returns NULL_TREE. */
27181 static tree
27183 {
27184 location_t location;
27195 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27196 node, lest it get absorbed into the surrounding block. */
27201 }
27203 /* Parse an Objective-C throw statement.
27205 objc-throw-stmt:
27206 @throw assignment-expression [opt] ;
27208 Returns a constructed '@throw' statement. */
27210 static tree
27212 {
27224 }
27226 /* Parse an Objective-C statement. */
27228 static tree
27230 {
27231 /* Try to figure out what kind of declaration is present. */
27235 {
27246 }
27249 }
27251 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27252 look ahead to see if an objc keyword follows the attributes. This
27253 is to detect the use of prefix attributes on ObjC @interface and
27254 @protocol. */
27256 static bool
27258 {
27263 {
27266 }
27269 }
27271 /* This routine is a minimal replacement for
27272 c_parser_struct_declaration () used when parsing the list of
27273 types/names or ObjC++ properties. For example, when parsing the
27274 code
27276 @property (readonly) int a, b, c;
27278 this function is responsible for parsing "int a, int b, int c" and
27279 returning the declarations as CHAIN of DECLs.
27281 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27282 similar parsing. */
27283 static tree
27285 {
27287 cp_decl_specifier_seq declspecs;
27289 tree prefix_attributes;
27292 CP_PARSER_FLAGS_NONE,
27299 /* auto, register, static, extern, mutable. */
27301 {
27304 }
27306 /* thread_local. */
27308 {
27311 }
27313 /* typedef. */
27315 {
27318 }
27323 /* Keep going until we hit the `;' at the end of the declaration. */
27325 {
27330 /* Parse the declarator. */
27334 /* Look for attributes that apply to the ivar. */
27336 /* Remember which attributes are prefix attributes and
27337 which are not. */
27339 /* Combine the attributes. */
27349 /* Reset PREFIX_ATTRIBUTES. */
27360 {
27363 }
27364 else
27366 }
27368 }
27370 /* Parse an Objective-C @property declaration. The syntax is:
27372 objc-property-declaration:
27373 '@property' objc-property-attributes[opt] struct-declaration ;
27375 objc-property-attributes:
27376 '(' objc-property-attribute-list ')'
27378 objc-property-attribute-list:
27379 objc-property-attribute
27380 objc-property-attribute-list, objc-property-attribute
27382 objc-property-attribute
27383 'getter' = identifier
27384 'setter' = identifier
27385 'readonly'
27386 'readwrite'
27387 'assign'
27388 'retain'
27389 'copy'
27390 'nonatomic'
27392 For example:
27393 @property NSString *name;
27394 @property (readonly) id object;
27395 @property (retain, nonatomic, getter=getTheName) id name;
27396 @property int a, b, c;
27398 PS: This function is identical to
27399 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27400 static void
27402 {
27403 /* The following variables hold the attributes of the properties as
27404 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27405 seen. When we see an attribute, we set them to 'true' (if they
27406 are boolean properties) or to the identifier (if they have an
27407 argument, ie, for getter and setter). Note that here we only
27408 parse the list of attributes, check the syntax and accumulate the
27409 attributes that we find. objc_add_property_declaration() will
27410 then process the information. */
27420 /* 'properties' is the list of properties that we read. Usually a
27421 single one, but maybe more (eg, in "@property int a, b, c;" there
27422 are three). */
27423 tree properties;
27424 location_t loc;
27430 /* Parse the optional attribute list... */
27432 {
27433 /* Eat the '('. */
27437 {
27443 {
27446 }
27450 {
27461 {
27465 else
27470 }
27473 {
27477 }
27479 {
27481 {
27484 }
27485 else
27489 else
27491 }
27492 else
27493 {
27495 {
27498 }
27499 else
27501 }
27507 }
27514 else
27516 }
27518 /* FIXME: "@property (setter, assign);" will generate a spurious
27519 "error: expected ‘)’ before ‘,’ token". This is because
27520 cp_parser_require, unlike the C counterpart, will produce an
27521 error even if we are in error recovery. */
27523 {
27528 }
27529 }
27531 /* ... and the property declaration(s). */
27535 {
27537 /* If the next token is now a `;', consume it. */
27541 }
27545 else
27546 {
27547 /* Comma-separated properties are chained together in
27548 reverse order; add them one by one. */
27557 }
27560 }
27562 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27564 objc-synthesize-declaration:
27565 @synthesize objc-synthesize-identifier-list ;
27567 objc-synthesize-identifier-list:
27568 objc-synthesize-identifier
27569 objc-synthesize-identifier-list, objc-synthesize-identifier
27571 objc-synthesize-identifier
27572 identifier
27573 identifier = identifier
27575 For example:
27576 @synthesize MyProperty;
27577 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27579 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27580 for C. Keep them in sync.
27581 */
27582 static void
27584 {
27586 location_t loc;
27591 {
27595 {
27598 }
27600 {
27604 {
27607 }
27608 }
27609 else
27614 else
27616 }
27619 }
27621 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27623 objc-dynamic-declaration:
27624 @dynamic identifier-list ;
27626 For example:
27627 @dynamic MyProperty;
27628 @dynamic MyProperty, AnotherProperty;
27630 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27631 for C. Keep them in sync.
27632 */
27633 static void
27635 {
27637 location_t loc;
27642 {
27643 tree property;
27646 {
27649 }
27653 else
27655 }
27658 }
27660 \f
27661 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27663 /* Returns name of the next clause.
27664 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27665 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27666 returned and the token is consumed. */
27668 static pragma_omp_clause
27670 {
27684 {
27689 {
27856 }
27857 }
27863 }
27865 /* Validate that a clause of the given type does not already exist. */
27867 static void
27870 {
27871 tree c;
27875 {
27878 }
27879 }
27881 /* OpenMP 2.5:
27882 variable-list:
27883 identifier
27884 variable-list , identifier
27886 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27887 colon). An opening parenthesis will have been consumed by the caller.
27889 If KIND is nonzero, create the appropriate node and install the decl
27890 in OMP_CLAUSE_DECL and add the node to the head of the list.
27892 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27893 return the list created.
27895 COLON can be NULL if only closing parenthesis should end the list,
27896 or pointer to bool which will receive false if the list is terminated
27897 by closing parenthesis or true if the list is terminated by colon. */
27899 static tree
27902 {
27906 {
27909 }
27911 {
27916 && current_class_ptr
27918 {
27924 }
27925 else
27926 {
27939 }
27941 ;
27943 {
27945 {
27948 {
27952 }
27953 /* FALL THROUGH. */
27960 {
27968 parser->colon_corrects_to_scope_p
27972 else
27973 {
27974 /* Look for `:'. */
27978 CPP_CLOSE_SQUARE))
27980 }
27981 /* Look for the closing `]'. */
27983 RT_CLOSE_SQUARE))
27987 {
27990 {
27994 }
27998 {
28002 }
28003 }
28006 }
28010 }
28016 }
28017 else
28020 get_comma:
28024 }
28030 {
28034 }
28037 {
28040 /* Try to resync to an unnested comma. Copied from
28041 cp_parser_parenthesized_expression_list. */
28042 skip_comma:
28051 }
28054 }
28056 /* Similarly, but expect leading and trailing parenthesis. This is a very
28057 common case for omp clauses. */
28059 static tree
28061 {
28065 }
28067 /* OpenACC 2.0:
28068 copy ( variable-list )
28069 copyin ( variable-list )
28070 copyout ( variable-list )
28071 create ( variable-list )
28072 delete ( variable-list )
28073 present ( variable-list )
28074 present_or_copy ( variable-list )
28075 pcopy ( variable-list )
28076 present_or_copyin ( variable-list )
28077 pcopyin ( variable-list )
28078 present_or_copyout ( variable-list )
28079 pcopyout ( variable-list )
28080 present_or_create ( variable-list )
28081 pcreate ( variable-list ) */
28083 static tree
28085 tree list)
28086 {
28089 {
28129 }
28137 }
28139 /* OpenACC 2.0:
28140 deviceptr ( variable-list ) */
28142 static tree
28144 {
28148 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
28149 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
28150 variable-list must only allow for pointer variables. */
28153 {
28156 /* FIXME diagnostics: Ideally we should keep individual
28157 locations for all the variables in the var list to make the
28158 following errors more precise. Perhaps
28159 c_parser_omp_var_list_parens should construct a list of
28160 locations to go along with the var list. */
28165 ;
28174 }
28177 }
28179 /* OpenACC:
28180 vector_length ( expression ) */
28182 static tree
28184 {
28194 {
28197 }
28200 {
28205 }
28208 location);
28216 }
28218 /* OpenACC 2.0
28219 Parse wait clause or directive parameters. */
28221 static tree
28223 {
28233 {
28238 }
28245 {
28249 {
28252 else
28253 {
28260 }
28261 }
28262 }
28265 }
28267 /* OpenACC:
28268 wait ( int-expr-list ) */
28270 static tree
28272 {
28281 }
28283 /* OpenMP 3.0:
28284 collapse ( constant-expression ) */
28286 static tree
28288 {
28290 location_t loc;
28291 HOST_WIDE_INT n;
28311 {
28314 }
28322 }
28324 /* OpenMP 2.5:
28325 default ( shared | none ) */
28327 static tree
28329 {
28331 tree c;
28336 {
28341 {
28356 }
28359 }
28360 else
28361 {
28362 invalid_kind:
28364 }
28380 }
28382 /* OpenMP 3.1:
28383 final ( expression ) */
28385 static tree
28387 {
28408 }
28410 /* OpenMP 2.5:
28411 if ( expression )
28413 OpenMP 4.1:
28414 if ( directive-name-modifier : expression )
28416 directive-name-modifier:
28417 parallel | task | taskloop | target data | target | target update
28418 | target enter data | target exit data */
28420 static tree
28423 {
28431 {
28443 {
28446 {
28459 else
28460 {
28461 location_t loc
28466 }
28469 {
28471 {
28476 }
28478 {
28479 location_t loc
28483 }
28484 }
28485 }
28486 }
28488 {
28490 {
28493 }
28494 else
28495 {
28497 {
28498 location_t loc
28501 }
28503 }
28504 }
28505 }
28517 {
28520 {
28523 {
28533 }
28535 p);
28537 }
28539 {
28542 else
28545 }
28548 {
28552 }
28553 }
28561 }
28563 /* OpenMP 3.1:
28564 mergeable */
28566 static tree
28569 {
28570 tree c;
28573 location);
28578 }
28580 /* OpenMP 2.5:
28581 nowait */
28583 static tree
28586 {
28587 tree c;
28594 }
28596 /* OpenACC:
28597 num_gangs ( expression ) */
28599 static tree
28601 {
28617 {
28620 }
28630 }
28632 /* OpenMP 2.5:
28633 num_threads ( expression ) */
28635 static tree
28637 location_t location)
28638 {
28660 }
28662 /* OpenMP 4.1:
28663 num_tasks ( expression ) */
28665 static tree
28667 location_t location)
28668 {
28690 }
28692 /* OpenMP 4.1:
28693 grainsize ( expression ) */
28695 static tree
28697 location_t location)
28698 {
28720 }
28722 /* OpenMP 4.1:
28723 priority ( expression ) */
28725 static tree
28727 location_t location)
28728 {
28750 }
28752 /* OpenMP 4.1:
28753 hint ( expression ) */
28755 static tree
28757 location_t location)
28758 {
28779 }
28781 /* OpenMP 4.1:
28782 defaultmap ( tofrom : scalar ) */
28784 static tree
28786 location_t location)
28787 {
28795 {
28798 }
28802 {
28805 }
28811 {
28814 }
28818 {
28821 }
28827 location);
28833 out_err:
28838 }
28840 /* OpenACC:
28841 num_workers ( expression ) */
28843 static tree
28845 {
28861 {
28864 }
28867 location);
28875 }
28877 /* OpenMP 2.5:
28878 ordered
28880 OpenMP 4.1:
28881 ordered ( constant-expression ) */
28883 static tree
28886 {
28888 HOST_WIDE_INT n;
28894 {
28911 {
28913 "ordered argument needs positive constant integer "
28916 }
28917 }
28923 }
28925 /* OpenMP 2.5:
28926 reduction ( reduction-operator : variable-list )
28928 reduction-operator:
28929 One of: + * - & ^ | && ||
28931 OpenMP 3.1:
28933 reduction-operator:
28934 One of: + * - & ^ | && || min max
28936 OpenMP 4.0:
28938 reduction-operator:
28939 One of: + * - & ^ | && ||
28940 id-expression */
28942 static tree
28944 {
28952 {
28962 }
28966 else
28967 {
28978 {
29008 }
29009 else
29010 {
29012 resync_fail:
29017 }
29018 }
29024 NULL);
29026 {
29029 }
29032 }
29034 /* OpenMP 2.5:
29035 schedule ( schedule-kind )
29036 schedule ( schedule-kind , expression )
29038 schedule-kind:
29039 static | dynamic | guided | runtime | auto
29041 OpenMP 4.1:
29042 schedule ( schedule-modifier : schedule-kind )
29043 schedule ( schedule-modifier : schedule-kind , expression )
29045 schedule-modifier:
29046 simd */
29048 static tree
29050 {
29059 {
29064 {
29068 }
29069 }
29072 {
29077 {
29098 }
29099 }
29104 else
29109 {
29124 else
29129 }
29137 invalid_kind:
29139 resync_fail:
29144 }
29146 /* OpenMP 3.0:
29147 untied */
29149 static tree
29152 {
29153 tree c;
29160 }
29162 /* OpenMP 4.0:
29163 inbranch
29164 notinbranch */
29166 static tree
29169 {
29174 }
29176 /* OpenMP 4.0:
29177 parallel
29178 for
29179 sections
29180 taskgroup */
29182 static tree
29186 {
29190 }
29192 /* OpenMP 4.1:
29193 nogroup */
29195 static tree
29198 {
29203 }
29205 /* OpenMP 4.1:
29206 simd
29207 threads */
29209 static tree
29213 {
29218 }
29220 /* OpenMP 4.0:
29221 num_teams ( expression ) */
29223 static tree
29225 location_t location)
29226 {
29248 }
29250 /* OpenMP 4.0:
29251 thread_limit ( expression ) */
29253 static tree
29255 location_t location)
29256 {
29278 }
29280 /* OpenMP 4.0:
29281 aligned ( variable-list )
29282 aligned ( variable-list : constant-expression ) */
29284 static tree
29286 {
29297 {
29307 }
29313 }
29315 /* OpenMP 4.0:
29316 linear ( variable-list )
29317 linear ( variable-list : expression )
29319 OpenMP 4.1:
29320 linear ( modifier ( variable-list ) )
29321 linear ( modifier ( variable-list ) : expression ) */
29323 static tree
29326 {
29336 {
29348 else
29350 }
29355 else
29356 {
29365 }
29368 {
29372 {
29375 }
29383 }
29386 {
29389 }
29392 }
29394 /* OpenMP 4.0:
29395 safelen ( constant-expression ) */
29397 static tree
29399 location_t location)
29400 {
29421 }
29423 /* OpenMP 4.0:
29424 simdlen ( constant-expression ) */
29426 static tree
29428 location_t location)
29429 {
29450 }
29452 /* OpenMP 4.1:
29453 vec:
29454 identifier [+/- integer]
29455 vec , identifier [+/- integer]
29456 */
29458 static tree
29460 tree list)
29461 {
29465 {
29468 }
29471 {
29478 else
29479 {
29480 t = cp_parser_lookup_name_simple
29485 id_loc);
29486 }
29493 else
29494 {
29497 }
29501 {
29504 }
29508 {
29511 }
29513 {
29519 OPT_Woverflow,
29521 }
29524 add_to_vector:
29532 }
29535 {
29541 }
29543 }
29545 /* OpenMP 4.0:
29546 depend ( depend-kind : variable-list )
29548 depend-kind:
29549 in | out | inout
29551 OpenMP 4.1:
29552 depend ( source )
29554 depend ( sink : vec ) */
29556 static tree
29558 {
29566 {
29580 else
29582 }
29583 else
29589 {
29599 }
29606 else
29607 {
29613 }
29616 invalid_kind:
29618 resync_fail:
29623 }
29625 /* OpenMP 4.0:
29626 map ( map-kind : variable-list )
29627 map ( variable-list )
29629 map-kind:
29630 alloc | to | from | tofrom
29632 OpenMP 4.1:
29633 map-kind:
29634 alloc | to | from | tofrom | release | delete
29636 map ( always [,] map-kind: variable-list ) */
29638 static tree
29640 {
29649 {
29654 {
29657 nth++;
29661 {
29666 }
29667 }
29668 }
29672 {
29688 else
29689 {
29695 }
29698 }
29701 NULL);
29707 }
29709 /* OpenMP 4.0:
29710 device ( expression ) */
29712 static tree
29714 location_t location)
29715 {
29737 }
29739 /* OpenMP 4.0:
29740 dist_schedule ( static )
29741 dist_schedule ( static , expression ) */
29743 static tree
29745 location_t location)
29746 {
29759 {
29770 }
29775 location);
29779 invalid_kind:
29781 resync_fail:
29786 }
29788 /* OpenMP 4.0:
29789 proc_bind ( proc-bind-kind )
29791 proc-bind-kind:
29792 master | close | spread */
29794 static tree
29796 location_t location)
29797 {
29798 tree c;
29805 {
29815 else
29817 }
29818 else
29827 location);
29832 invalid_kind:
29834 resync_fail:
29839 }
29841 /* OpenACC:
29842 async [( int-expr )] */
29844 static tree
29846 {
29853 {
29862 }
29872 }
29874 /* Parse all OpenACC clauses. The set clauses allowed by the directive
29875 is a bitmask in MASK. Return the list of clauses found. */
29877 static tree
29881 {
29886 {
29887 location_t here;
29888 pragma_omp_clause c_kind;
29899 {
29991 }
29996 {
29997 /* Remove the invalid clause(s) from the list to avoid
29998 confusing the rest of the compiler. */
30001 }
30002 }
30004 saw_error:
30011 }
30013 /* Parse all OpenMP clauses. The set clauses allowed by the directive
30014 is a bitmask in MASK. Return the list of clauses found; the result
30015 of clause default goes in *pdefault. */
30017 static tree
30021 {
30028 {
30029 pragma_omp_clause c_kind;
30040 {
30052 clauses);
30066 clauses);
30086 clauses);
30091 clauses);
30101 clauses);
30135 clauses);
30149 clauses);
30166 OMP_CLAUSE_NOTINBRANCH,
30175 {
30176 clause_not_first:
30180 }
30210 clauses);
30211 else
30221 clauses);
30284 clauses
30290 clauses
30302 }
30307 {
30308 /* Remove the invalid clause(s) from the list to avoid
30309 confusing the rest of the compiler. */
30312 }
30313 }
30314 saw_error:
30315 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
30316 no reason to skip to the end. */
30320 {
30323 else
30325 }
30327 }
30329 /* OpenMP 2.5:
30330 structured-block:
30331 statement
30333 In practice, we're also interested in adding the statement to an
30334 outer node. So it is convenient if we work around the fact that
30335 cp_parser_statement calls add_stmt. */
30337 static unsigned
30339 {
30342 /* Only move the values to IN_OMP_BLOCK if they weren't false.
30343 This preserves the "not within loop or switch" style error messages
30344 for nonsense cases like
30345 void foo() {
30346 #pragma omp single
30347 break;
30348 }
30349 */
30354 }
30356 static void
30358 {
30360 }
30362 static tree
30364 {
30372 }
30374 /* OpenMP 2.5:
30375 # pragma omp atomic new-line
30376 expression-stmt
30378 expression-stmt:
30379 x binop= expr | x++ | ++x | x-- | --x
30380 binop:
30381 +, *, -, /, &, ^, |, <<, >>
30383 where x is an lvalue expression with scalar type.
30385 OpenMP 3.1:
30386 # pragma omp atomic new-line
30387 update-stmt
30389 # pragma omp atomic read new-line
30390 read-stmt
30392 # pragma omp atomic write new-line
30393 write-stmt
30395 # pragma omp atomic update new-line
30396 update-stmt
30398 # pragma omp atomic capture new-line
30399 capture-stmt
30401 # pragma omp atomic capture new-line
30402 capture-block
30404 read-stmt:
30405 v = x
30406 write-stmt:
30407 x = expr
30408 update-stmt:
30409 expression-stmt | x = x binop expr
30410 capture-stmt:
30411 v = expression-stmt
30412 capture-block:
30413 { v = x; update-stmt; } | { update-stmt; v = x; }
30415 OpenMP 4.0:
30416 update-stmt:
30417 expression-stmt | x = x binop expr | x = expr binop x
30418 capture-stmt:
30419 v = update-stmt
30420 capture-block:
30421 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
30423 where x and v are lvalue expressions with scalar type. */
30425 static void
30427 {
30435 {
30440 {
30446 }
30447 }
30449 {
30461 else
30465 }
30467 {
30473 {
30478 {
30481 }
30482 }
30483 }
30487 {
30497 else
30502 {
30503 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
30504 opcode. */
30509 }
30513 {
30516 }
30517 else
30518 {
30524 }
30527 }
30529 restart:
30533 {
30540 /* FALLTHROUGH */
30550 /* FALLTHROUGH */
30565 /* Undo effects of boolean_increment for post {in,de}crement. */
30567 /* FALLTHRU */
30571 {
30572 /* Undo effects of boolean_increment. */
30574 {
30575 /* This is pre or post increment. */
30580 && !structured_block
30584 }
30585 }
30586 /* FALLTHRU */
30589 {
30624 {
30628 }
30631 {
30637 {
30642 }
30644 {
30656 {
30658 {
30663 }
30664 else
30666 }
30670 }
30673 {
30680 }
30684 }
30688 {
30691 {
30699 }
30701 {
30706 }
30741 }
30752 /* FALLTHROUGH */
30757 }
30764 }
30765 stmt_done:
30767 {
30778 }
30780 {
30783 }
30784 done:
30790 saw_error:
30793 {
30797 {
30801 }
30802 }
30803 }
30806 /* OpenMP 2.5:
30807 # pragma omp barrier new-line */
30809 static void
30811 {
30814 }
30816 /* OpenMP 2.5:
30817 # pragma omp critical [(name)] new-line
30818 structured-block
30820 OpenMP 4.1:
30821 # pragma omp critical [(name) [hint(expression)]] new-line
30822 structured-block */
30824 #define OMP_CRITICAL_CLAUSE_MASK \
30825 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
30827 static tree
30829 {
30833 {
30847 OMP_CRITICAL_CLAUSE_MASK,
30849 }
30850 else
30855 }
30857 /* OpenMP 2.5:
30858 # pragma omp flush flush-vars[opt] new-line
30860 flush-vars:
30861 ( variable-list ) */
30863 static void
30865 {
30871 }
30873 /* Helper function, to parse omp for increment expression. */
30875 static tree
30877 {
30882 {
30885 }
30888 {
30897 /* Fall through: OpenMP disallows NE_EXPR. */
30900 }
30902 /* If decl is an iterator, preserve LHS and RHS of the relational
30903 expr until finish_omp_for. */
30913 }
30915 /* Helper function, to parse omp for increment expression. */
30917 static tree
30919 {
30923 cp_id_kind idk;
30927 {
30936 }
30945 {
30950 }
30957 {
30961 }
30974 do
30975 {
30982 {
30984 {
30987 else
30989 tf_warning_or_error);
30990 }
30991 else
30994 }
30995 }
30999 {
31005 }
31006 else
31010 }
31012 /* Parse the initialization statement of either an OpenMP for loop or
31013 a Cilk Plus for loop.
31015 Return true if the resulting construct should have an
31016 OMP_CLAUSE_PRIVATE added to it. */
31018 static tree
31026 {
31032 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
31034 init-expr:
31035 var = lb
31036 integer-type var = lb
31037 random-access-iterator-type var = lb
31038 pointer-type var = lb
31039 */
31040 cp_decl_specifier_seq type_specifiers;
31042 /* First, try to parse as an initialized declaration. See
31043 cp_parser_condition, from whence the bulk of this is copied. */
31050 {
31051 /* If parsing a type specifier seq succeeded, then this
31052 MUST be a initialized declaration. */
31057 CP_PARSER_DECLARATOR_NAMED,
31068 else
31069 {
31079 {
31081 CPP_OPEN_PAREN))
31082 {
31086 else
31089 }
31090 else
31091 /* Trigger an error. */
31096 }
31100 {
31108 {
31111 auto_node);
31116 }
31119 asm_specification,
31120 LOOKUP_ONLYCONVERTING);
31122 {
31125 }
31126 else
31129 }
31130 else
31131 {
31132 /* Consume '='. */
31136 non_class:
31139 else
31142 asm_specification,
31143 LOOKUP_ONLYCONVERTING);
31144 }
31148 }
31149 }
31150 else
31151 {
31152 cp_id_kind idk;
31153 /* If parsing a type specifier sequence failed, then
31154 this MUST be a simple expression. */
31163 && decl
31166 {
31177 {
31182 }
31187 }
31189 && decl
31192 {
31193 tree rhs;
31200 rhs,
31201 tf_warning_or_error));
31204 }
31205 else
31206 {
31211 {
31215 }
31216 }
31217 }
31219 }
31221 /* Parse the restricted form of the for statement allowed by OpenMP. */
31223 static tree
31226 {
31230 location_t loc_first;
31253 {
31256 location_t loc;
31260 {
31263 }
31266 {
31269 }
31278 add_private_clause
31285 {
31288 {
31294 }
31295 else
31297 }
31304 {
31309 {
31313 }
31316 {
31317 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
31321 {
31324 }
31325 else
31326 {
31329 }
31331 }
31332 else
31333 {
31338 }
31339 }
31342 {
31343 tree c;
31345 {
31354 decl);
31358 decl);
31359 }
31361 {
31366 else
31371 {
31374 /* For linear, signal that we need to fill up
31375 the so far unknown linear step. */
31378 }
31379 }
31380 }
31389 {
31390 /* If decl is an iterator, preserve the operator on decl
31391 until finish_omp_for. */
31393 && ((processing_template_decl
31398 else
31402 }
31417 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
31418 in between the collapsed for loops to be still considered perfectly
31419 nested. Hopefully the final version clarifies this.
31420 For now handle (multiple) {'s and empty statements. */
31422 do
31423 {
31427 {
31429 bracecount++;
31430 }
31434 else
31435 {
31442 }
31443 }
31447 {
31450 }
31451 }
31453 /* Note that we saved the original contents of this flag when we entered
31454 the structured block, and so we don't need to re-save it here. */
31457 else
31460 /* Note that the grammar doesn't call for a structured block here,
31461 though the loop as a whole is a structured block. */
31468 else
31473 {
31475 {
31477 nbraces--;
31478 }
31481 else
31482 {
31484 {
31487 }
31492 }
31493 }
31500 }
31502 /* Helper function for OpenMP parsing, split clauses and call
31503 finish_omp_clauses on each of the set of clauses afterwards. */
31505 static void
31508 {
31514 }
31516 /* OpenMP 4.0:
31517 #pragma omp simd simd-clause[optseq] new-line
31518 for-loop */
31520 #define OMP_SIMD_CLAUSE_MASK \
31521 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
31522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
31527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31530 static tree
31533 {
31545 {
31548 }
31559 }
31561 /* OpenMP 2.5:
31562 #pragma omp for for-clause[optseq] new-line
31563 for-loop
31565 OpenMP 4.0:
31566 #pragma omp for simd for-simd-clause[optseq] new-line
31567 for-loop */
31569 #define OMP_FOR_CLAUSE_MASK \
31570 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31571 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31572 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
31573 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31574 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31575 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
31576 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
31577 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
31578 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31580 static tree
31583 {
31594 {
31599 {
31607 cclauses);
31611 cclauses);
31623 }
31624 }
31626 {
31629 }
31634 {
31637 }
31648 }
31650 /* OpenMP 2.5:
31651 # pragma omp master new-line
31652 structured-block */
31654 static tree
31656 {
31660 }
31662 /* OpenMP 2.5:
31663 # pragma omp ordered new-line
31664 structured-block
31666 OpenMP 4.1:
31667 # pragma omp ordered ordered-clauses new-line
31668 structured-block */
31670 #define OMP_ORDERED_CLAUSE_MASK \
31671 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
31672 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
31674 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
31675 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
31677 static bool
31680 {
31684 {
31688 }
31691 {
31696 {
31698 {
31700 "%<depend%> clause may only be used in compound "
31704 }
31705 tree clauses
31707 OMP_ORDERED_DEPEND_CLAUSE_MASK,
31711 }
31712 }
31714 tree clauses
31720 }
31722 /* OpenMP 2.5:
31724 section-scope:
31725 { section-sequence }
31727 section-sequence:
31728 section-directive[opt] structured-block
31729 section-sequence section-directive structured-block */
31731 static tree
31733 {
31744 {
31748 }
31751 {
31759 {
31763 }
31765 {
31768 }
31773 }
31784 }
31786 /* OpenMP 2.5:
31787 # pragma omp sections sections-clause[optseq] newline
31788 sections-scope */
31790 #define OMP_SECTIONS_CLAUSE_MASK \
31791 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31792 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31793 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
31794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
31797 static tree
31800 {
31812 {
31815 }
31822 }
31824 /* OpenMP 2.5:
31825 # pragma omp parallel parallel-clause[optseq] new-line
31826 structured-block
31827 # pragma omp parallel for parallel-for-clause[optseq] new-line
31828 structured-block
31829 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
31830 structured-block
31832 OpenMP 4.0:
31833 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
31834 structured-block */
31836 #define OMP_PARALLEL_CLAUSE_MASK \
31837 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
31845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
31847 static tree
31850 {
31859 {
31872 block);
31877 }
31878 /* When combined with distribute, parallel has to be followed by for.
31879 #pragma omp target parallel is allowed though. */
31883 {
31887 }
31889 {
31892 }
31894 {
31898 {
31908 block);
31911 }
31912 }
31916 {
31919 }
31927 }
31929 /* OpenMP 2.5:
31930 # pragma omp single single-clause[optseq] new-line
31931 structured-block */
31933 #define OMP_SINGLE_CLAUSE_MASK \
31934 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31935 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31936 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
31937 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
31939 static tree
31941 {
31951 }
31953 /* OpenMP 3.0:
31954 # pragma omp task task-clause[optseq] new-line
31955 structured-block */
31957 #define OMP_TASK_CLAUSE_MASK \
31958 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
31960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
31965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
31966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
31967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
31969 static tree
31971 {
31982 }
31984 /* OpenMP 3.0:
31985 # pragma omp taskwait new-line */
31987 static void
31989 {
31992 }
31994 /* OpenMP 3.1:
31995 # pragma omp taskyield new-line */
31997 static void
31999 {
32002 }
32004 /* OpenMP 4.0:
32005 # pragma omp taskgroup new-line
32006 structured-block */
32008 static tree
32010 {
32014 }
32017 /* OpenMP 2.5:
32018 # pragma omp threadprivate (variable-list) */
32020 static void
32022 {
32023 tree vars;
32029 }
32031 /* OpenMP 4.0:
32032 # pragma omp cancel cancel-clause[optseq] new-line */
32034 #define OMP_CANCEL_CLAUSE_MASK \
32035 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
32036 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
32037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
32038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
32039 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
32041 static void
32043 {
32047 }
32049 /* OpenMP 4.0:
32050 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
32052 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
32053 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
32054 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
32055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
32056 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
32058 static void
32060 {
32061 tree clauses;
32065 {
32070 {
32073 }
32074 }
32076 {
32080 }
32083 OMP_CANCELLATION_POINT_CLAUSE_MASK,
32085 pragma_tok);
32087 }
32089 /* OpenMP 4.0:
32090 #pragma omp distribute distribute-clause[optseq] new-line
32091 for-loop */
32093 #define OMP_DISTRIBUTE_CLAUSE_MASK \
32094 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
32095 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
32096 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
32097 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
32099 static tree
32102 {
32111 {
32119 else
32122 {
32128 {
32131 cclauses);
32132 else
32134 cclauses);
32135 }
32140 cclauses);
32141 else
32143 cclauses);
32155 }
32156 }
32158 {
32161 }
32166 {
32169 }
32180 }
32182 /* OpenMP 4.0:
32183 # pragma omp teams teams-clause[optseq] new-line
32184 structured-block */
32186 #define OMP_TEAMS_CLAUSE_MASK \
32187 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
32188 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
32189 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
32190 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
32191 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
32192 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
32193 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
32195 static tree
32198 {
32207 {
32211 {
32219 cclauses);
32223 cclauses);
32235 }
32236 }
32238 {
32241 }
32246 {
32249 }
32257 }
32259 /* OpenMP 4.0:
32260 # pragma omp target data target-data-clause[optseq] new-line
32261 structured-block */
32263 #define OMP_TARGET_DATA_CLAUSE_MASK \
32264 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
32265 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
32266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
32267 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
32269 static tree
32271 {
32272 tree clauses
32277 {
32280 {
32295 "%<#pragma omp target data%> with map-type other "
32296 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
32300 }
32302 }
32305 {
32308 "%<#pragma omp target data%> must contain at least "
32311 }
32322 }
32324 /* OpenMP 4.1:
32325 # pragma omp target enter data target-enter-data-clause[optseq] new-line
32326 structured-block */
32328 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
32329 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
32330 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
32331 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
32332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
32333 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
32335 static tree
32338 {
32341 {
32346 {
32349 }
32350 }
32352 {
32356 }
32359 {
32361 "%<#pragma omp target enter data%> may only be "
32365 }
32367 tree clauses
32372 {
32375 {
32386 "%<#pragma omp target enter data%> with map-type other "
32390 }
32392 }
32395 {
32398 "%<#pragma omp target enter data%> must contain at least "
32401 }
32408 }
32410 /* OpenMP 4.1:
32411 # pragma omp target exit data target-enter-data-clause[optseq] new-line
32412 structured-block */
32414 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
32415 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
32416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
32417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
32418 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
32419 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
32421 static tree
32424 {
32427 {
32432 {
32435 }
32436 }
32438 {
32442 }
32445 {
32447 "%<#pragma omp target exit data%> may only be "
32451 }
32453 tree clauses
32458 {
32461 {
32473 "%<#pragma omp target exit data%> with map-type other "
32474 "than %<from%>, %<release%> or %<delete%> on %<map%>"
32478 }
32480 }
32483 {
32486 "%<#pragma omp target exit data%> must contain at least "
32489 }
32496 }
32498 /* OpenMP 4.0:
32499 # pragma omp target update target-update-clause[optseq] new-line */
32501 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
32502 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
32503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
32504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
32505 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
32506 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
32507 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
32509 static bool
32512 {
32514 {
32516 "%<#pragma omp target update%> may only be "
32520 }
32522 tree clauses
32527 {
32529 "%<#pragma omp target update%> must contain at least one "
32532 }
32540 }
32542 /* OpenMP 4.0:
32543 # pragma omp target target-clause[optseq] new-line
32544 structured-block */
32546 #define OMP_TARGET_CLAUSE_MASK \
32547 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
32548 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
32549 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
32550 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
32551 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
32552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
32553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
32554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
32555 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
32557 static bool
32560 {
32564 {
32568 }
32571 {
32583 {
32591 {
32592 tree stmt;
32594 {
32597 OMP_TARGET_CLAUSE_MASK,
32598 cclauses);
32602 OMP_TARGET_CLAUSE_MASK,
32603 cclauses);
32607 OMP_TARGET_CLAUSE_MASK,
32608 cclauses);
32612 }
32614 }
32619 {
32634 }
32647 }
32649 {
32652 }
32654 {
32658 }
32660 {
32664 }
32666 {
32670 }
32672 {
32675 }
32676 }
32691 check_clauses:
32693 {
32696 {
32708 "%<#pragma omp target%> with map-type other "
32709 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
32713 }
32715 }
32717 }
32719 /* OpenACC 2.0:
32720 # pragma acc cache (variable-list) new-line
32721 */
32723 static tree
32725 {
32740 }
32742 /* OpenACC 2.0:
32743 # pragma acc data oacc-data-clause[optseq] new-line
32744 structured-block */
32746 #define OACC_DATA_CLAUSE_MASK \
32747 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
32748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
32749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
32750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
32751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
32752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
32754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
32755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
32756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
32757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
32759 static tree
32761 {
32774 }
32776 /* OpenACC 2.0:
32777 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
32779 or
32781 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
32783 LOC is the location of the #pragma token.
32784 */
32786 #define OACC_ENTER_DATA_CLAUSE_MASK \
32787 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32788 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
32789 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
32790 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
32791 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
32792 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
32793 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
32795 #define OACC_EXIT_DATA_CLAUSE_MASK \
32796 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
32798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
32799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
32800 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
32802 static tree
32805 {
32810 {
32816 }
32821 {
32825 }
32832 else
32837 {
32841 }
32849 }
32851 /* OpenACC 2.0:
32852 # pragma acc kernels oacc-kernels-clause[optseq] new-line
32853 structured-block */
32855 #define OACC_KERNELS_CLAUSE_MASK \
32856 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
32857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
32858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
32859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
32860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
32861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
32862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
32864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
32865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
32866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
32867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
32868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
32870 static tree
32872 {
32885 }
32887 /* OpenACC 2.0:
32888 # pragma acc loop oacc-loop-clause[optseq] new-line
32889 structured-block */
32891 #define OACC_LOOP_CLAUSE_MASK \
32892 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
32893 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION))
32895 static tree
32897 {
32910 }
32912 /* OpenACC 2.0:
32913 # pragma acc parallel oacc-parallel-clause[optseq] new-line
32914 structured-block */
32916 #define OACC_PARALLEL_CLAUSE_MASK \
32917 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
32918 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
32919 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
32920 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
32921 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
32922 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
32923 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32924 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
32925 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
32926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
32927 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
32928 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
32929 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
32930 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
32931 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
32932 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
32933 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
32935 static tree
32937 {
32950 }
32952 /* OpenACC 2.0:
32953 # pragma acc update oacc-update-clause[optseq] new-line
32954 */
32956 #define OACC_UPDATE_CLAUSE_MASK \
32957 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
32958 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
32959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
32960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
32962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
32964 static tree
32966 {
32973 {
32975 "%<#pragma acc update%> must contain at least one "
32978 }
32986 }
32988 /* OpenACC 2.0:
32989 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
32991 LOC is the location of the #pragma token.
32992 */
32994 #define OACC_WAIT_CLAUSE_MASK \
32995 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
32997 static tree
32999 {
33012 }
33014 /* OpenMP 4.0:
33015 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
33017 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
33018 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
33019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33020 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
33021 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
33022 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
33023 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
33025 static void
33028 {
33030 cp_omp_declare_simd_data data;
33032 {
33037 }
33048 {
33052 {
33065 }
33070 "%<#pragma omp declare simd%> not immediately followed by "
33074 }
33075 }
33077 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
33078 This function is modelled similar to the late parsing of omp declare
33079 simd. */
33081 static tree
33083 {
33089 {
33095 }
33097 {
33101 }
33106 {
33113 NULL);
33127 }
33132 }
33134 /* Finalize #pragma omp declare simd clauses after direct declarator has
33135 been parsed, and put that into "omp declare simd" attribute. */
33137 static tree
33139 {
33145 {
33150 }
33155 {
33173 }
33177 }
33180 /* OpenMP 4.0:
33181 # pragma omp declare target new-line
33182 declarations and definitions
33183 # pragma omp end declare target new-line
33185 OpenMP 4.1:
33186 # pragma omp declare target ( extended-list ) new-line
33188 # pragma omp declare target declare-target-clauses[seq] new-line */
33190 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
33191 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
33192 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
33194 static void
33196 {
33199 clauses
33203 {
33205 clauses);
33207 }
33208 else
33209 {
33213 }
33216 "%<#pragma omp declare target%> with clauses in between "
33217 "%<#pragma omp declare target%> without clauses and "
33220 {
33226 {
33229 }
33230 else
33233 {
33235 "%qD specified both in declare target %<link%> and %<to%>"
33238 }
33241 }
33242 }
33244 static void
33246 {
33249 {
33252 }
33254 {
33258 {
33261 }
33264 else
33265 {
33269 }
33270 }
33271 else
33272 {
33276 }
33280 "%<#pragma omp end declare target%> without corresponding "
33282 else
33284 }
33286 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
33287 expression and optional initializer clause of
33288 #pragma omp declare reduction. We store the expression(s) as
33289 either 3, 6 or 7 special statements inside of the artificial function's
33290 body. The first two statements are DECL_EXPRs for the artificial
33291 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
33292 expression that uses those variables.
33293 If there was any INITIALIZER clause, this is followed by further statements,
33294 the fourth and fifth statements are DECL_EXPRs for the artificial
33295 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
33296 constructor variant (first token after open paren is not omp_priv),
33297 then the sixth statement is a statement with the function call expression
33298 that uses the OMP_PRIV and optionally OMP_ORIG variable.
33299 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
33300 to initialize the OMP_PRIV artificial variable and there is seventh
33301 statement, a DECL_EXPR of the OMP_PRIV statement again. */
33303 static bool
33305 {
33317 tree combiner;
33332 {
33335 }
33338 {
33345 {
33348 }
33364 {
33368 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
33372 == CPP_CLOSE_PAREN
33375 {
33379 }
33384 }
33385 else
33386 {
33402 {
33407 }
33409 tree arg;
33422 }
33433 }
33439 }
33441 /* OpenMP 4.0
33442 #pragma omp declare reduction (reduction-id : typename-list : expression) \
33443 initializer-clause[opt] new-line
33445 initializer-clause:
33446 initializer (omp_priv initializer)
33447 initializer (function-name (argument-list)) */
33449 static void
33452 {
33462 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
33469 {
33501 }
33513 /* Types may not be defined in declare reduction type list. */
33516 parser->type_definition_forbidden_message
33522 saved_colon_doesnt_start_class_def_p
33527 {
33531 ;
33552 else
33557 else
33559 }
33561 /* Restore the saved message. */
33564 parser->colon_doesnt_start_class_def_p
33569 {
33570 fail:
33573 }
33579 {
33580 tree fntype
33583 NULL_TREE);
33602 {
33607 }
33609 {
33611 {
33620 }
33627 }
33628 else
33629 {
33632 }
33635 else
33638 {
33641 }
33643 {
33646 else
33651 }
33656 else
33657 {
33666 }
33673 }
33677 done:
33678 /* Free any declarators allocated. */
33680 }
33682 /* OpenMP 4.0
33683 #pragma omp declare simd declare-simd-clauses[optseq] new-line
33684 #pragma omp declare reduction (reduction-id : typename-list : expression) \
33685 initializer-clause[opt] new-line
33686 #pragma omp declare target new-line */
33688 static void
33691 {
33693 {
33698 {
33701 context);
33703 }
33706 {
33709 context);
33711 }
33713 {
33716 }
33718 {
33722 }
33723 }
33727 }
33729 /* OpenMP 4.1:
33730 7 #pragma omp taskloop taskloop-clause[optseq] new-line
33731 for-loop
33733 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
33734 for-loop */
33736 #define OMP_TASKLOOP_CLAUSE_MASK \
33737 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
33738 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33739 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
33740 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33741 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
33742 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
33743 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
33744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
33745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
33746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
33747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
33748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
33749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
33750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
33752 static tree
33755 {
33764 {
33769 {
33777 cclauses);
33781 cclauses);
33793 }
33794 }
33796 {
33799 }
33804 {
33807 }
33818 }
33820 /* Main entry point to OpenMP statement pragmas. */
33822 static void
33824 {
33825 tree stmt;
33830 {
33906 }
33910 }
33911 \f
33912 /* Transactional Memory parsing routines. */
33914 /* Parse a transaction attribute.
33916 txn-attribute:
33917 attribute
33918 [ [ identifier ] ]
33920 ??? Simplify this when C++0x bracket attributes are
33921 implemented properly. */
33923 static tree
33925 {
33940 {
33944 /* For keywords, use the canonical spelling,
33945 not the parsed identifier. */
33949 }
33950 else
33954 error1:
33957 }
33959 /* Parse a __transaction_atomic or __transaction_relaxed statement.
33961 transaction-statement:
33962 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
33963 compound-statement
33964 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
33965 */
33967 static tree
33969 {
33984 else
33985 {
33989 }
33991 /* Parse a noexcept specification. */
33994 /* Keep track if we're in the lexical scope of an outer transaction. */
34006 }
34008 /* Parse a __transaction_atomic or __transaction_relaxed expression.
34010 transaction-expression:
34011 __transaction_atomic txn-noexcept-spec[opt] ( expression )
34012 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
34013 */
34015 static tree
34017 {
34042 /* Set this early. This might mean that we allow transaction_cancel in
34043 an expression that we find out later actually has to be a constexpr.
34044 However, we expect that cxx_constant_value will be able to deal with
34045 this; also, if the noexcept has no constexpr, then what we parse next
34046 really is a transaction's body. */
34049 /* Parse a noexcept specification. */
34055 {
34062 }
34063 else
34064 {
34065 /* The only expression that is available got parsed for the noexcept
34066 already. noexcept is true then. */
34069 }
34078 }
34080 /* Parse a function-transaction-block.
34082 function-transaction-block:
34083 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
34084 function-body
34085 __transaction_atomic txn-attribute[opt] function-try-block
34086 __transaction_relaxed ctor-initializer[opt] function-body
34087 __transaction_relaxed function-try-block
34088 */
34090 static bool
34092 {
34108 else
34109 {
34113 }
34121 else
34122 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
34130 }
34132 /* Parse a __transaction_cancel statement.
34134 cancel-statement:
34135 __transaction_cancel txn-attribute[opt] ;
34136 __transaction_cancel txn-attribute[opt] throw-expression ;
34138 ??? Cancel and throw is not yet implemented. */
34140 static tree
34142 {
34148 RT_TRANSACTION_CANCEL);
34155 /* ??? Parse cancel-and-throw here. */
34160 {
34164 }
34166 {
34170 }
34172 {
34175 {
34181 }
34182 }
34184 {
34188 }
34194 }
34195 \f
34196 /* The parser. */
34200 \f
34201 /* Special handling for the first token or line in the file. The first
34202 thing in the file might be #pragma GCC pch_preprocess, which loads a
34203 PCH file, which is a GC collection point. So we need to handle this
34204 first pragma without benefit of an existing lexer structure.
34206 Always returns one token to the caller in *FIRST_TOKEN. This is
34207 either the true first token of the file, or the first token after
34208 the initial pragma. */
34210 static void
34212 {
34221 {
34228 }
34229 else
34232 /* Skip to the end of the pragma. */
34236 /* Now actually load the PCH file. */
34240 /* Read one more token to return to our caller. We have to do this
34241 after reading the PCH file in, since its pointers have to be
34242 live. */
34244 }
34246 /* Parses the grainsize pragma for the _Cilk_for statement.
34247 Syntax:
34248 #pragma cilk grainsize = <VALUE>. */
34250 static void
34252 {
34254 {
34259 {
34262 }
34264 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
34267 else
34269 "%<#pragma cilk grainsize%> is not followed by "
34272 }
34274 }
34276 /* Normal parsing of a pragma token. Here we can (and must) use the
34277 regular lexer. */
34279 static bool
34281 {
34284 tree stmt;
34295 {
34303 {
34313 }
34318 {
34328 }
34333 {
34339 "%<#pragma omp taskwait%> may only be "
34344 }
34349 {
34355 "%<#pragma omp taskyield%> may only be "
34360 }
34365 {
34371 "%<#pragma omp cancel%> may only be "
34376 }
34381 {
34387 "%<#pragma omp cancellation point%> may only be "
34392 }
34450 "%<#pragma omp section%> may only be used in "
34455 {
34457 {
34461 }
34468 {
34471 }
34474 }
34478 {
34482 }
34490 {
34494 }
34496 /* Ignore the pragma if Cilk Plus is not enabled. */
34498 {
34501 }
34502 else
34503 {
34507 }
34514 bad_stmt:
34517 }
34521 }
34523 /* The interface the pragma parsers have to the lexer. */
34525 enum cpp_ttype
34527 {
34540 else
34541 {
34545 }
34548 }
34550 \f
34551 /* External interface. */
34553 /* Parse one entire translation unit. */
34555 void
34557 {
34570 }
34572 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
34573 vectorlength clause:
34574 Syntax:
34575 vectorlength ( constant-expression ) */
34577 static tree
34580 {
34582 tree expr;
34583 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
34584 safelen clause. Thus, vectorlength is represented as OMP 4.0
34585 safelen. For SIMD-enabled function it is represented by OMP 4.0
34586 simdlen. */
34589 loc);
34590 else
34592 loc);
34600 /* If expr == error_mark_node, then don't emit any errors nor
34601 create a clause. if any of the above functions returns
34602 error mark node then they would have emitted an error message. */
34604 ;
34612 else
34613 {
34614 tree c;
34616 {
34621 }
34622 else
34623 {
34628 }
34629 }
34634 }
34636 /* Handles the Cilk Plus #pragma simd linear clause.
34637 Syntax:
34638 linear ( simd-linear-variable-list )
34640 simd-linear-variable-list:
34641 simd-linear-variable
34642 simd-linear-variable-list , simd-linear-variable
34644 simd-linear-variable:
34645 id-expression
34646 id-expression : simd-linear-step
34648 simd-linear-step:
34649 conditional-expression */
34651 static tree
34653 {
34659 {
34663 }
34668 {
34671 {
34675 }
34682 {
34686 }
34687 else
34688 {
34692 /* If present, parse the linear step. Otherwise, assume the default
34693 value of 1. */
34695 {
34702 {
34703 /* If an error has occurred, then the whole pragma is
34704 considered ill-formed. Thus, no reason to keep
34705 parsing. */
34708 }
34716 else
34718 "step size must be an integer constant "
34720 }
34722 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
34728 }
34733 else
34734 {
34739 }
34740 }
34744 }
34746 /* Returns the name of the next clause. If the clause is not
34747 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
34748 token is not consumed. Otherwise, the appropriate enum from the
34749 pragma_simd_clause is returned and the token is consumed. */
34751 static pragma_omp_clause
34753 {
34754 pragma_omp_clause clause_type;
34771 else
34776 }
34778 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
34780 static tree
34782 {
34787 {
34788 pragma_omp_clause c_kind;
34795 /* Use the OpenMP 4.0 equivalent function. */
34798 /* Use the OpenMP 4.0 equivalent function. */
34800 clauses);
34802 /* Use the OMP 4.0 equivalent function. */
34804 clauses);
34806 /* Use the OMP 4.0 equivalent function. */
34808 else
34809 {
34813 }
34814 }
34820 else
34822 }
34824 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
34826 static void
34828 {
34835 {
34839 }
34848 }
34850 /* Main entry-point for parsing Cilk Plus _Cilk_for
34851 loops. The return value is error_mark_node
34852 when errors happen and CILK_FOR tree on success. */
34854 static tree
34856 {
34871 else
34877 }
34879 /* Create an identifier for a generic parameter type (a synthesized
34880 template parameter implied by `auto' or a concept identifier). */
34883 static tree
34885 {
34889 }
34891 /* Predicate that behaves as is_auto_or_concept but matches the parent
34892 node of the generic type rather than the generic type itself. This
34893 allows for type transformation in add_implicit_template_parms. */
34897 {
34899 }
34901 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
34902 (creating a new template parameter list if necessary). Returns the newly
34903 created template type parm. */
34905 tree
34907 {
34910 /* We are either continuing a function template that already contains implicit
34911 template parameters, creating a new fully-implicit function template, or
34912 extending an existing explicit function template with implicit template
34913 parameters. */
34921 {
34925 }
34926 else
34927 {
34928 /* Roll back to the existing template parameter scope (in the case of
34929 extending an explicit function template) or introduce a new template
34930 parameter scope ahead of the function parameter scope (or class scope
34931 in the case of out-of-line member definitions). The function scope is
34932 added back after template parameter synthesis below. */
34937 {
34940 }
34942 {
34943 /* If not defining a class, then any class scope is a scope level in
34944 an out-of-line member definition. In this case simply wind back
34945 beyond the first such scope to inject the template parameter list.
34946 Otherwise wind back to the class being defined. The latter can
34947 occur in class member friend declarations such as:
34949 class A {
34950 void foo (auto);
34951 };
34952 class B {
34953 friend void A::foo (auto);
34954 };
34956 The template parameter list synthesized for the friend declaration
34957 must be injected in the scope of 'B'. This can also occur in
34958 erroneous cases such as:
34960 struct A {
34961 struct B {
34962 void foo (auto);
34963 };
34964 void B::foo (auto) {}
34965 };
34967 Here the attempted definition of 'B::foo' within 'A' is ill-formed
34968 but, nevertheless, the template parameter list synthesized for the
34969 declarator should be injected into the scope of 'A' as if the
34970 ill-formed template was specified explicitly. */
34973 {
34976 }
34977 }
34983 {
34984 /* Introduce a new template parameter list for implicit template
34985 parameters. */
34989 parser->implicit_template_scope
34996 }
34997 else
34998 {
34999 /* Synthesize implicit template parameters at the end of the explicit
35000 template parameter list. */
35007 parser->implicit_template_parms
35009 }
35010 }
35012 /* Synthesize a new template parameter and track the current template
35013 parameter chain with implicit_template_parms. */
35017 synth_id);
35018 tree new_parm
35020 input_location,
35027 parser->implicit_template_parms
35029 else
35034 /* If creating a fully implicit function template, start the new implicit
35035 template parameter list with this synthesized type, otherwise grow the
35036 current template parameter list. */
35039 {
35046 }
35047 else
35048 {
35053 }
35058 }
35060 /* Finish the declaration of a fully implicit function template. Such a
35061 template has no explicit template parameter list so has not been through the
35062 normal template head and tail processing. synthesize_implicit_template_parm
35063 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
35064 provided if the declaration is a class member such that its template
35065 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
35066 form is returned. Otherwise NULL_TREE is returned. */
35068 tree
35070 {
35075 {
35079 }
35089 }