| blob | 62a815eb42cf3d272a1b7ee4b325337b09a964dd |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2014 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/>. */
48 \f
49 /* The lexer. */
51 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
52 and c-lex.c) and the C++ parser. */
55 {
57 };
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
186 /* Prototypes. */
192 static void cp_lexer_destroy
194 static int cp_lexer_saving_tokens
198 static void cp_lexer_get_preprocessor_token
206 static bool cp_lexer_next_token_is_not
208 static bool cp_lexer_next_token_is_keyword
212 static void cp_lexer_purge_token
214 static void cp_lexer_purge_tokens_after
216 static void cp_lexer_save_tokens
218 static void cp_lexer_commit_tokens
220 static void cp_lexer_rollback_tokens
222 static void cp_lexer_print_token
226 static void cp_lexer_start_debugging
228 static void cp_lexer_stop_debugging
234 static void cp_parser_initial_pragma
237 static tree cp_literal_operator_id
240 static void cp_parser_cilk_simd
242 static tree cp_parser_cilk_for
244 static bool cp_parser_omp_declare_reduction_exprs
246 static tree cp_parser_cilk_simd_vectorlength
249 /* Manifest constants. */
250 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
251 #define CP_SAVED_TOKEN_STACK 5
253 /* Variables. */
255 /* The stream to which debugging output should be written. */
258 /* Nonzero if we are parsing an unevaluated operand: an operand to
259 sizeof, typeof, or alignof. */
262 /* Dump up to NUM tokens in BUFFER to FILE starting with token
263 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
264 first token in BUFFER. If NUM is 0, dump all the tokens. If
265 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
266 highlighted by surrounding it in [[ ]]. */
268 static void
272 {
289 {
292 }
297 {
304 nprinted++;
314 {
324 }
325 }
328 {
331 }
334 }
337 /* Dump all tokens in BUFFER to stderr. */
339 void
341 {
343 }
345 DEBUG_FUNCTION void
347 {
349 }
351 DEBUG_FUNCTION void
353 {
356 else
358 }
361 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
362 description for T. */
364 static void
366 {
368 {
371 }
372 }
375 /* Dump parser context C to FILE. */
377 static void
379 {
384 }
387 /* Print the stack of parsing contexts to FILE starting with FIRST. */
389 static void
391 {
397 {
400 }
401 }
404 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
406 static void
408 {
411 }
414 /* Print an unparsed function entry UF to FILE. */
416 static void
418 {
421 tree fn;
426 i++)
427 {
433 }
438 {
441 }
447 {
450 }
452 }
455 /* Print the stack of unparsed member functions S to FILE. */
457 static void
460 {
466 {
469 }
470 }
473 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
474 the given PARSER. If FILE is NULL, the output is printed on stderr. */
476 static void
478 {
490 next_token);
491 }
494 /* Dump debugging information for the given PARSER. If FILE is NULL,
495 the output is printed on stderr. */
497 void
499 {
502 expanded_location eloc;
580 }
582 DEBUG_FUNCTION void
584 {
586 }
588 DEBUG_FUNCTION void
590 {
593 else
595 }
597 /* Allocate memory for a new lexer object and return it. */
601 {
606 /* Allocate the memory. */
609 /* Initially we are not debugging. */
614 /* Create the buffer. */
618 }
621 /* Create a new main C++ lexer, the lexer that gets tokens from the
622 preprocessor. */
626 {
628 cp_token token;
630 /* It's possible that parsing the first pragma will load a PCH file,
631 which is a GC collection point. So we have to do that before
632 allocating any memory. */
637 /* Put the first token in the buffer. */
640 /* Get the remaining tokens from the preprocessor. */
642 {
645 }
654 /* Subsequent preprocessor diagnostics should use compiler
655 diagnostic functions to get the compiler source location. */
660 }
662 /* Create a new lexer whose token stream is primed with the tokens in
663 CACHE. When these tokens are exhausted, no new tokens will be read. */
667 {
672 /* We do not own the buffer. */
679 /* Initially we are not debugging. */
684 }
686 /* Frees all resources associated with LEXER. */
688 static void
690 {
694 }
696 /* Returns nonzero if debugging information should be output. */
700 {
702 }
707 {
711 }
715 {
717 }
721 {
723 }
727 {
730 else
732 }
736 {
740 }
742 /* nonzero if we are presently saving tokens. */
746 {
748 }
750 /* Store the next token from the preprocessor in *TOKEN. Return true
751 if we reach EOF. If LEXER is NULL, assume we are handling an
752 initial #pragma pch_preprocess, and thus want the lexer to return
753 processed strings. */
755 static void
757 {
760 /* Get a new token from the preprocessor. */
761 token->type
769 /* On some systems, some header files are surrounded by an
770 implicit extern "C" block. Set a flag in the token if it
771 comes from such a header. */
776 /* Check to see if this token is a keyword. */
778 {
780 {
781 /* Mark this token as a keyword. */
783 /* Record which keyword. */
785 }
786 else
787 {
791 {
792 /* Warn about the C++0x keyword (but still treat it as
793 an identifier). */
798 /* Clear out the C_RID_CODE so we don't warn about this
799 particular identifier-turned-keyword again. */
801 }
804 }
805 }
807 {
808 /* This only happens in Objective-C++; it must be a keyword. */
811 {
812 /* Replace 'class' with '@class', 'private' with '@private',
813 etc. This prevents confusion with the C++ keyword
814 'class', and makes the tokens consistent with other
815 Objective-C 'AT' keywords. For example '@class' is
816 reported as RID_AT_CLASS which is consistent with
817 '@synchronized', which is reported as
818 RID_AT_SYNCHRONIZED.
819 */
828 }
829 }
831 {
832 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
836 }
837 }
839 /* Update the globals input_location and the input file stack from TOKEN. */
842 {
844 {
846 }
847 }
849 /* Update the globals input_location and the input file stack from LEXER. */
852 {
855 }
857 /* Return a pointer to the next token in the token stream, but do not
858 consume it. */
862 {
864 {
868 }
870 }
872 /* Return true if the next token has the indicated TYPE. */
876 {
878 }
880 /* Return true if the next token does not have the indicated TYPE. */
884 {
886 }
888 /* Return true if the next token is the indicated KEYWORD. */
892 {
894 }
898 {
900 }
904 {
906 }
908 /* Return true if the next token is not the indicated KEYWORD. */
912 {
914 }
916 /* Return true if the next token is a keyword for a decl-specifier. */
918 static bool
920 {
925 {
926 /* auto specifier: storage-class-specifier in C++,
927 simple-type-specifier in C++0x. */
929 /* Storage classes. */
935 /* Elaborated type specifiers. */
941 /* Simple type specifiers. */
955 /* GNU extensions. */
958 /* C++0x extensions. */
969 }
970 }
972 /* Returns TRUE iff the token T begins a decltype type. */
974 static bool
976 {
979 }
981 /* Returns TRUE iff the next token begins a decltype type. */
983 static bool
985 {
988 }
990 /* Return a pointer to the Nth token in the token stream. If N is 1,
991 then this is precisely equivalent to cp_lexer_peek_token (except
992 that it is not inline). One would like to disallow that case, but
993 there is one case (cp_parser_nth_token_starts_template_id) where
994 the caller passes a variable for N and it might be 1. */
998 {
1001 /* N is 1-based, not zero-based. */
1012 {
1015 {
1018 }
1022 }
1025 {
1028 }
1031 }
1033 /* Return the next token, and advance the lexer's next_token pointer
1034 to point to the next non-purged token. */
1038 {
1044 do
1045 {
1048 {
1051 }
1053 }
1058 /* Provide debugging output. */
1060 {
1064 }
1067 }
1069 /* Permanently remove the next token from the token stream, and
1070 advance the next_token pointer to refer to the next non-purged
1071 token. */
1073 static void
1075 {
1084 do
1085 {
1086 tok++;
1088 {
1091 }
1092 }
1095 }
1097 /* Permanently remove all tokens after TOK, up to, but not
1098 including, the token that will be returned next by
1099 cp_lexer_peek_token. */
1101 static void
1103 {
1112 {
1117 }
1118 }
1120 /* Begin saving tokens. All tokens consumed after this point will be
1121 preserved. */
1123 static void
1125 {
1126 /* Provide debugging output. */
1131 }
1133 /* Commit to the portion of the token stream most recently saved. */
1135 static void
1137 {
1138 /* Provide debugging output. */
1143 }
1145 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1146 to the token stream. Stop saving tokens. */
1148 static void
1150 {
1151 /* Provide debugging output. */
1156 }
1158 /* RAII wrapper around the above functions, with sanity checking. Creating
1159 a variable saves tokens, which are committed when the variable is
1160 destroyed unless they are explicitly rolled back by calling the rollback
1161 member function. */
1163 struct saved_token_sentinel
1164 {
1169 {
1172 }
1174 {
1177 }
1179 {
1183 }
1184 };
1186 /* Print a representation of the TOKEN on the STREAM. */
1188 static void
1190 {
1191 /* We don't use cpp_type2name here because the parser defines
1192 a few tokens of its own. */
1194 /* cpplib-defined token types */
1195 #define OP(e, s) #e,
1196 #define TK(e, s) #e,
1197 TTYPE_TABLE
1198 #undef OP
1199 #undef TK
1200 /* C++ parser token types - see "Manifest constants", above. */
1204 };
1206 /* For some tokens, print the associated data. */
1208 {
1210 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1211 For example, `struct' is mapped to an INTEGER_CST. */
1214 /* else fall through */
1232 /* If we have a name for the token, print it out. Otherwise, we
1233 simply give the numeric code. */
1236 else
1239 }
1240 }
1242 DEBUG_FUNCTION void
1244 {
1247 }
1249 DEBUG_FUNCTION void
1251 {
1254 else
1256 }
1259 /* Start emitting debugging information. */
1261 static void
1263 {
1266 }
1268 /* Stop emitting debugging information. */
1270 static void
1272 {
1275 }
1277 /* Create a new cp_token_cache, representing a range of tokens. */
1281 {
1286 }
1288 /* Diagnose if #pragma omp declare simd isn't followed immediately
1289 by function declaration or definition. */
1293 {
1295 {
1299 }
1300 }
1302 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1303 and put that into "omp declare simd" attribute. */
1307 {
1309 {
1311 {
1314 }
1316 {
1319 }
1320 }
1321 }
1322 \f
1323 /* Decl-specifiers. */
1325 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1327 static void
1329 {
1331 }
1333 /* Declarators. */
1335 /* Nothing other than the parser should be creating declarators;
1336 declarators are a semi-syntactic representation of C++ entities.
1337 Other parts of the front end that need to create entities (like
1338 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1353 /* An erroneous declarator. */
1356 /* The obstack on which declarators and related data structures are
1357 allocated. */
1360 /* Alloc BYTES from the declarator memory pool. */
1364 {
1366 }
1368 /* Allocate a declarator of the indicated KIND. Clear fields that are
1369 common to all declarators. */
1373 {
1385 }
1387 /* Make a declarator for a generalized identifier. If
1388 QUALIFYING_SCOPE is non-NULL, the identifier is
1389 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1390 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1391 is, if any. */
1395 special_function_kind sfk)
1396 {
1399 /* It is valid to write:
1401 class C { void f(); };
1402 typedef C D;
1403 void D::f();
1405 The standard is not clear about whether `typedef const C D' is
1406 legal; as of 2002-09-15 the committee is considering that
1407 question. EDG 3.0 allows that syntax. Therefore, we do as
1408 well. */
1422 }
1424 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1425 of modifiers such as const or volatile to apply to the pointer
1426 type, represented as identifiers. ATTRIBUTES represent the attributes that
1427 appertain to the pointer or reference. */
1429 cp_declarator *
1431 tree attributes)
1432 {
1440 {
1444 }
1445 else
1451 }
1453 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1454 represent the attributes that appertain to the pointer or
1455 reference. */
1457 cp_declarator *
1460 {
1468 {
1472 }
1473 else
1479 }
1481 /* Like make_pointer_declarator -- but for a pointer to a non-static
1482 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1483 appertain to the pointer or reference. */
1485 cp_declarator *
1488 tree attributes)
1489 {
1498 {
1501 }
1502 else
1508 }
1510 /* Make a declarator for the function given by TARGET, with the
1511 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1512 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1513 indicates what exceptions can be thrown. */
1515 cp_declarator *
1517 tree parms,
1518 cp_cv_quals cv_qualifiers,
1519 cp_virt_specifiers virt_specifiers,
1520 cp_ref_qualifier ref_qualifier,
1521 tree exception_specification,
1522 tree late_return_type)
1523 {
1535 {
1539 }
1540 else
1544 }
1546 /* Make a declarator for an array of BOUNDS elements, each of which is
1547 defined by ELEMENT. */
1549 cp_declarator *
1551 {
1558 {
1562 }
1563 else
1567 }
1569 /* Determine whether the declarator we've seen so far can be a
1570 parameter pack, when followed by an ellipsis. */
1571 static bool
1573 {
1574 /* Search for a declarator name, or any other declarator that goes
1575 after the point where the ellipsis could appear in a parameter
1576 pack. If we find any of these, then this declarator can not be
1577 made into a parameter pack. */
1580 {
1582 {
1594 }
1595 }
1598 }
1602 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1603 DECLARATOR and DEFAULT_ARGUMENT. */
1605 cp_parameter_declarator *
1608 tree default_argument)
1609 {
1617 else
1624 }
1626 /* Returns true iff DECLARATOR is a declaration for a function. */
1628 static bool
1630 {
1632 {
1640 }
1642 }
1644 /* The parser. */
1646 /* Overview
1647 --------
1649 A cp_parser parses the token stream as specified by the C++
1650 grammar. Its job is purely parsing, not semantic analysis. For
1651 example, the parser breaks the token stream into declarators,
1652 expressions, statements, and other similar syntactic constructs.
1653 It does not check that the types of the expressions on either side
1654 of an assignment-statement are compatible, or that a function is
1655 not declared with a parameter of type `void'.
1657 The parser invokes routines elsewhere in the compiler to perform
1658 semantic analysis and to build up the abstract syntax tree for the
1659 code processed.
1661 The parser (and the template instantiation code, which is, in a
1662 way, a close relative of parsing) are the only parts of the
1663 compiler that should be calling push_scope and pop_scope, or
1664 related functions. The parser (and template instantiation code)
1665 keeps track of what scope is presently active; everything else
1666 should simply honor that. (The code that generates static
1667 initializers may also need to set the scope, in order to check
1668 access control correctly when emitting the initializers.)
1670 Methodology
1671 -----------
1673 The parser is of the standard recursive-descent variety. Upcoming
1674 tokens in the token stream are examined in order to determine which
1675 production to use when parsing a non-terminal. Some C++ constructs
1676 require arbitrary look ahead to disambiguate. For example, it is
1677 impossible, in the general case, to tell whether a statement is an
1678 expression or declaration without scanning the entire statement.
1679 Therefore, the parser is capable of "parsing tentatively." When the
1680 parser is not sure what construct comes next, it enters this mode.
1681 Then, while we attempt to parse the construct, the parser queues up
1682 error messages, rather than issuing them immediately, and saves the
1683 tokens it consumes. If the construct is parsed successfully, the
1684 parser "commits", i.e., it issues any queued error messages and
1685 the tokens that were being preserved are permanently discarded.
1686 If, however, the construct is not parsed successfully, the parser
1687 rolls back its state completely so that it can resume parsing using
1688 a different alternative.
1690 Future Improvements
1691 -------------------
1693 The performance of the parser could probably be improved substantially.
1694 We could often eliminate the need to parse tentatively by looking ahead
1695 a little bit. In some places, this approach might not entirely eliminate
1696 the need to parse tentatively, but it might still speed up the average
1697 case. */
1699 /* Flags that are passed to some parsing functions. These values can
1700 be bitwise-ored together. */
1702 enum
1703 {
1704 /* No flags. */
1706 /* The construct is optional. If it is not present, then no error
1707 should be issued. */
1709 /* When parsing a type-specifier, treat user-defined type-names
1710 as non-type identifiers. */
1712 /* When parsing a type-specifier, do not try to parse a class-specifier
1713 or enum-specifier. */
1715 /* When parsing a decl-specifier-seq, only allow type-specifier or
1716 constexpr. */
1718 };
1720 /* This type is used for parameters and variables which hold
1721 combinations of the above flags. */
1724 /* The different kinds of declarators we want to parse. */
1727 {
1728 /* We want an abstract declarator. */
1729 CP_PARSER_DECLARATOR_ABSTRACT,
1730 /* We want a named declarator. */
1731 CP_PARSER_DECLARATOR_NAMED,
1732 /* We don't mind, but the name must be an unqualified-id. */
1733 CP_PARSER_DECLARATOR_EITHER
1736 /* The precedence values used to parse binary expressions. The minimum value
1737 of PREC must be 1, because zero is reserved to quickly discriminate
1738 binary operators from other tokens. */
1740 enum cp_parser_prec
1741 {
1742 PREC_NOT_OPERATOR,
1743 PREC_LOGICAL_OR_EXPRESSION,
1744 PREC_LOGICAL_AND_EXPRESSION,
1745 PREC_INCLUSIVE_OR_EXPRESSION,
1746 PREC_EXCLUSIVE_OR_EXPRESSION,
1747 PREC_AND_EXPRESSION,
1748 PREC_EQUALITY_EXPRESSION,
1749 PREC_RELATIONAL_EXPRESSION,
1750 PREC_SHIFT_EXPRESSION,
1751 PREC_ADDITIVE_EXPRESSION,
1752 PREC_MULTIPLICATIVE_EXPRESSION,
1753 PREC_PM_EXPRESSION,
1754 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1755 };
1757 /* A mapping from a token type to a corresponding tree node type, with a
1758 precedence value. */
1761 {
1762 /* The token type. */
1764 /* The corresponding tree code. */
1766 /* The precedence of this operator. */
1771 {
1772 /* Left hand side of the binary operation we are currently
1773 parsing. */
1774 tree lhs;
1775 /* Original tree code for left hand side, if it was a binary
1776 expression itself (used for -Wparentheses). */
1778 /* Tree code for the binary operation we are parsing. */
1780 /* Precedence of the binary operation we are parsing. */
1782 /* Location of the binary operation we are parsing. */
1783 location_t loc;
1786 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1787 entries because precedence levels on the stack are monotonically
1788 increasing. */
1792 /* Prototypes. */
1794 /* Constructors and destructors. */
1799 /* Class variables. */
1803 /* The operator-precedence table used by cp_parser_binary_expression.
1804 Transformed into an associative array (binops_by_token) by
1805 cp_parser_new. */
1838 };
1840 /* The same as binops, but initialized by cp_parser_new so that
1841 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1842 for speed. */
1845 /* Constructors and destructors. */
1847 /* Construct a new context. The context below this one on the stack
1848 is given by NEXT. */
1852 {
1855 /* Allocate the storage. */
1857 {
1858 /* Pull the first entry from the free list. */
1862 }
1863 else
1866 /* No errors have occurred yet in this context. */
1868 /* If this is not the bottommost context, copy information that we
1869 need from the previous context. */
1871 {
1872 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1873 expression, then we are parsing one in this context, too. */
1875 /* Thread the stack. */
1877 }
1880 }
1882 /* Managing the unparsed function queues. */
1884 #define unparsed_funs_with_default_args \
1885 parser->unparsed_queues->last ().funs_with_default_args
1886 #define unparsed_funs_with_definitions \
1887 parser->unparsed_queues->last ().funs_with_definitions
1888 #define unparsed_nsdmis \
1889 parser->unparsed_queues->last ().nsdmis
1890 #define unparsed_classes \
1891 parser->unparsed_queues->last ().classes
1893 static void
1895 {
1898 }
1900 static void
1902 {
1905 }
1907 /* Prototypes. */
1909 /* Constructors and destructors. */
1914 /* Routines to parse various constructs.
1916 Those that return `tree' will return the error_mark_node (rather
1917 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1918 Sometimes, they will return an ordinary node if error-recovery was
1919 attempted, even though a parse error occurred. So, to check
1920 whether or not a parse error occurred, you should always use
1921 cp_parser_error_occurred. If the construct is optional (indicated
1922 either by an `_opt' in the name of the function that does the
1923 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1924 the construct is not present. */
1926 /* Lexical conventions [gram.lex] */
1928 static tree cp_parser_identifier
1930 static tree cp_parser_string_literal
1932 static tree cp_parser_userdef_char_literal
1934 static tree cp_parser_userdef_string_literal
1936 static tree cp_parser_userdef_numeric_literal
1939 /* Basic concepts [gram.basic] */
1941 static bool cp_parser_translation_unit
1944 /* Expressions [gram.expr] */
1946 static tree cp_parser_primary_expression
1948 static tree cp_parser_id_expression
1950 static tree cp_parser_unqualified_id
1952 static tree cp_parser_nested_name_specifier_opt
1954 static tree cp_parser_nested_name_specifier
1956 static tree cp_parser_qualifying_entity
1958 static tree cp_parser_postfix_expression
1960 static tree cp_parser_postfix_open_square_expression
1962 static tree cp_parser_postfix_dot_deref_expression
1966 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1968 static void cp_parser_pseudo_destructor_name
1970 static tree cp_parser_unary_expression
1972 static enum tree_code cp_parser_unary_operator
1974 static tree cp_parser_new_expression
1978 static tree cp_parser_new_type_id
1986 static tree cp_parser_delete_expression
1988 static tree cp_parser_cast_expression
1990 static tree cp_parser_binary_expression
1992 static tree cp_parser_question_colon_clause
1994 static tree cp_parser_assignment_expression
1996 static enum tree_code cp_parser_assignment_operator_opt
1998 static tree cp_parser_expression
2000 static tree cp_parser_constant_expression
2002 static tree cp_parser_builtin_offsetof
2004 static tree cp_parser_lambda_expression
2006 static void cp_parser_lambda_introducer
2008 static bool cp_parser_lambda_declarator_opt
2010 static void cp_parser_lambda_body
2013 /* Statements [gram.stmt.stmt] */
2015 static void cp_parser_statement
2017 static void cp_parser_label_for_labeled_statement
2019 static tree cp_parser_expression_statement
2021 static tree cp_parser_compound_statement
2023 static void cp_parser_statement_seq_opt
2025 static tree cp_parser_selection_statement
2027 static tree cp_parser_condition
2029 static tree cp_parser_iteration_statement
2031 static bool cp_parser_for_init_statement
2033 static tree cp_parser_for
2035 static tree cp_parser_c_for
2037 static tree cp_parser_range_for
2039 static void do_range_for_auto_deduction
2041 static tree cp_parser_perform_range_for_lookup
2043 static tree cp_parser_range_for_member_function
2045 static tree cp_parser_jump_statement
2047 static void cp_parser_declaration_statement
2050 static tree cp_parser_implicitly_scoped_statement
2052 static void cp_parser_already_scoped_statement
2055 /* Declarations [gram.dcl.dcl] */
2057 static void cp_parser_declaration_seq_opt
2059 static void cp_parser_declaration
2061 static void cp_parser_block_declaration
2063 static void cp_parser_simple_declaration
2065 static void cp_parser_decl_specifier_seq
2067 static tree cp_parser_storage_class_specifier_opt
2069 static tree cp_parser_function_specifier_opt
2071 static tree cp_parser_type_specifier
2074 static tree cp_parser_simple_type_specifier
2076 static tree cp_parser_type_name
2078 static tree cp_parser_nonclass_name
2080 static tree cp_parser_elaborated_type_specifier
2082 static tree cp_parser_enum_specifier
2084 static void cp_parser_enumerator_list
2086 static void cp_parser_enumerator_definition
2088 static tree cp_parser_namespace_name
2090 static void cp_parser_namespace_definition
2092 static void cp_parser_namespace_body
2094 static tree cp_parser_qualified_namespace_specifier
2096 static void cp_parser_namespace_alias_definition
2098 static bool cp_parser_using_declaration
2100 static void cp_parser_using_directive
2102 static tree cp_parser_alias_declaration
2104 static void cp_parser_asm_definition
2106 static void cp_parser_linkage_specification
2108 static void cp_parser_static_assert
2110 static tree cp_parser_decltype
2113 /* Declarators [gram.dcl.decl] */
2115 static tree cp_parser_init_declarator
2116 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2121 static enum tree_code cp_parser_ptr_operator
2123 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2125 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2127 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2129 static tree cp_parser_late_return_type_opt
2131 static tree cp_parser_declarator_id
2133 static tree cp_parser_type_id
2135 static tree cp_parser_template_type_arg
2138 static tree cp_parser_type_id_1
2140 static void cp_parser_type_specifier_seq
2142 static tree cp_parser_parameter_declaration_clause
2144 static tree cp_parser_parameter_declaration_list
2148 static tree cp_parser_default_argument
2150 static void cp_parser_function_body
2152 static tree cp_parser_initializer
2154 static tree cp_parser_initializer_clause
2156 static tree cp_parser_braced_list
2161 static bool cp_parser_ctor_initializer_opt_and_function_body
2164 static tree cp_parser_late_parsing_omp_declare_simd
2167 static tree cp_parser_late_parsing_cilk_simd_fn_info
2170 static tree synthesize_implicit_template_parm
2172 static tree finish_fully_implicit_template
2175 /* Classes [gram.class] */
2177 static tree cp_parser_class_name
2179 static tree cp_parser_class_specifier
2181 static tree cp_parser_class_head
2183 static enum tag_types cp_parser_class_key
2185 static void cp_parser_type_parameter_key
2187 static void cp_parser_member_specification_opt
2189 static void cp_parser_member_declaration
2191 static tree cp_parser_pure_specifier
2193 static tree cp_parser_constant_initializer
2196 /* Derived classes [gram.class.derived] */
2198 static tree cp_parser_base_clause
2200 static tree cp_parser_base_specifier
2203 /* Special member functions [gram.special] */
2205 static tree cp_parser_conversion_function_id
2207 static tree cp_parser_conversion_type_id
2211 static bool cp_parser_ctor_initializer_opt
2213 static void cp_parser_mem_initializer_list
2215 static tree cp_parser_mem_initializer
2217 static tree cp_parser_mem_initializer_id
2220 /* Overloading [gram.over] */
2222 static tree cp_parser_operator_function_id
2224 static tree cp_parser_operator
2227 /* Templates [gram.temp] */
2229 static void cp_parser_template_declaration
2231 static tree cp_parser_template_parameter_list
2233 static tree cp_parser_template_parameter
2235 static tree cp_parser_type_parameter
2237 static tree cp_parser_template_id
2239 static tree cp_parser_template_name
2241 static tree cp_parser_template_argument_list
2243 static tree cp_parser_template_argument
2245 static void cp_parser_explicit_instantiation
2247 static void cp_parser_explicit_specialization
2250 /* Exception handling [gram.exception] */
2252 static tree cp_parser_try_block
2254 static bool cp_parser_function_try_block
2256 static void cp_parser_handler_seq
2258 static void cp_parser_handler
2260 static tree cp_parser_exception_declaration
2262 static tree cp_parser_throw_expression
2264 static tree cp_parser_exception_specification_opt
2266 static tree cp_parser_type_id_list
2269 /* GNU Extensions */
2271 static tree cp_parser_asm_specification_opt
2273 static tree cp_parser_asm_operand_list
2275 static tree cp_parser_asm_clobber_list
2277 static tree cp_parser_asm_label_list
2279 static bool cp_next_tokens_can_be_attribute_p
2281 static bool cp_next_tokens_can_be_gnu_attribute_p
2283 static bool cp_next_tokens_can_be_std_attribute_p
2285 static bool cp_nth_tokens_can_be_std_attribute_p
2287 static bool cp_nth_tokens_can_be_gnu_attribute_p
2289 static bool cp_nth_tokens_can_be_attribute_p
2291 static tree cp_parser_attributes_opt
2293 static tree cp_parser_gnu_attributes_opt
2295 static tree cp_parser_gnu_attribute_list
2297 static tree cp_parser_std_attribute
2299 static tree cp_parser_std_attribute_spec
2301 static tree cp_parser_std_attribute_spec_seq
2303 static bool cp_parser_extension_opt
2305 static void cp_parser_label_declaration
2308 /* Transactional Memory Extensions */
2310 static tree cp_parser_transaction
2312 static tree cp_parser_transaction_expression
2314 static bool cp_parser_function_transaction
2316 static tree cp_parser_transaction_cancel
2320 pragma_external,
2321 pragma_member,
2322 pragma_objc_icode,
2323 pragma_stmt,
2324 pragma_compound
2325 };
2326 static bool cp_parser_pragma
2329 /* Objective-C++ Productions */
2331 static tree cp_parser_objc_message_receiver
2333 static tree cp_parser_objc_message_args
2335 static tree cp_parser_objc_message_expression
2337 static tree cp_parser_objc_encode_expression
2339 static tree cp_parser_objc_defs_expression
2341 static tree cp_parser_objc_protocol_expression
2343 static tree cp_parser_objc_selector_expression
2345 static tree cp_parser_objc_expression
2347 static bool cp_parser_objc_selector_p
2349 static tree cp_parser_objc_selector
2351 static tree cp_parser_objc_protocol_refs_opt
2353 static void cp_parser_objc_declaration
2355 static tree cp_parser_objc_statement
2357 static bool cp_parser_objc_valid_prefix_attributes
2359 static void cp_parser_objc_at_property_declaration
2361 static void cp_parser_objc_at_synthesize_declaration
2363 static void cp_parser_objc_at_dynamic_declaration
2365 static tree cp_parser_objc_struct_declaration
2368 /* Utility Routines */
2370 static tree cp_parser_lookup_name
2372 static tree cp_parser_lookup_name_simple
2374 static tree cp_parser_maybe_treat_template_as_class
2376 static bool cp_parser_check_declarator_template_parameters
2378 static bool cp_parser_check_template_parameters
2380 static tree cp_parser_simple_cast_expression
2382 static tree cp_parser_global_scope_opt
2384 static bool cp_parser_constructor_declarator_p
2386 static tree cp_parser_function_definition_from_specifiers_and_declarator
2388 static tree cp_parser_function_definition_after_declarator
2390 static void cp_parser_template_declaration_after_export
2392 static void cp_parser_perform_template_parameter_access_checks
2394 static tree cp_parser_single_declaration
2396 static tree cp_parser_functional_cast
2398 static tree cp_parser_save_member_function_body
2400 static tree cp_parser_save_nsdmi
2402 static tree cp_parser_enclosed_template_argument_list
2404 static void cp_parser_save_default_args
2406 static void cp_parser_late_parsing_for_member
2408 static tree cp_parser_late_parse_one_default_arg
2410 static void cp_parser_late_parsing_nsdmi
2412 static void cp_parser_late_parsing_default_args
2414 static tree cp_parser_sizeof_operand
2416 static tree cp_parser_trait_expr
2418 static bool cp_parser_declares_only_class_p
2420 static void cp_parser_set_storage_class
2422 static void cp_parser_set_decl_spec_type
2424 static void set_and_check_decl_spec_loc
2427 static bool cp_parser_friend_p
2429 static void cp_parser_required_error
2435 static bool cp_parser_token_starts_function_definition_p
2437 static bool cp_parser_next_token_starts_class_definition_p
2439 static bool cp_parser_next_token_ends_template_argument_p
2441 static bool cp_parser_nth_token_starts_template_argument_list_p
2443 static enum tag_types cp_parser_token_is_class_key
2445 static enum tag_types cp_parser_token_is_type_parameter_key
2447 static void cp_parser_check_class_key
2449 static void cp_parser_check_access_in_redeclaration
2451 static bool cp_parser_optional_template_keyword
2453 static void cp_parser_pre_parsed_nested_name_specifier
2455 static bool cp_parser_cache_group
2457 static tree cp_parser_cache_defarg
2459 static void cp_parser_parse_tentatively
2461 static void cp_parser_commit_to_tentative_parse
2463 static void cp_parser_commit_to_topmost_tentative_parse
2465 static void cp_parser_abort_tentative_parse
2467 static bool cp_parser_parse_definitely
2471 static bool cp_parser_uncommitted_to_tentative_parse_p
2473 static void cp_parser_error
2475 static void cp_parser_name_lookup_error
2477 static bool cp_parser_simulate_error
2479 static bool cp_parser_check_type_definition
2481 static void cp_parser_check_for_definition_in_return_type
2483 static void cp_parser_check_for_invalid_template_id
2485 static bool cp_parser_non_integral_constant_expression
2487 static void cp_parser_diagnose_invalid_type_name
2489 static bool cp_parser_parse_and_diagnose_invalid_type_name
2491 static int cp_parser_skip_to_closing_parenthesis
2493 static void cp_parser_skip_to_end_of_statement
2495 static void cp_parser_consume_semicolon_at_end_of_statement
2497 static void cp_parser_skip_to_end_of_block_or_statement
2499 static bool cp_parser_skip_to_closing_brace
2501 static void cp_parser_skip_to_end_of_template_parameter_list
2503 static void cp_parser_skip_to_pragma_eol
2505 static bool cp_parser_error_occurred
2507 static bool cp_parser_allow_gnu_extensions_p
2509 static bool cp_parser_is_pure_string_literal
2511 static bool cp_parser_is_string_literal
2513 static bool cp_parser_is_keyword
2515 static tree cp_parser_make_typename_type
2519 static bool cp_parser_compound_literal_p
2521 static bool cp_parser_array_designator_p
2523 static bool cp_parser_skip_to_closing_square_bracket
2526 /* Returns nonzero if we are parsing tentatively. */
2530 {
2532 }
2534 /* Returns nonzero if TOKEN is a string literal. */
2536 static bool
2538 {
2544 }
2546 /* Returns nonzero if TOKEN is a string literal
2547 of a user-defined string literal. */
2549 static bool
2551 {
2558 }
2560 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2562 static bool
2564 {
2566 }
2568 /* If not parsing tentatively, issue a diagnostic of the form
2569 FILE:LINE: MESSAGE before TOKEN
2570 where TOKEN is the next token in the input stream. MESSAGE
2571 (specified by the caller) is usually of the form "expected
2572 OTHER-TOKEN". */
2574 static void
2576 {
2578 {
2580 /* This diagnostic makes more sense if it is tagged to the line
2581 of the token we just peeked at. */
2585 {
2590 }
2593 /* Because c_parser_error does not understand
2594 CPP_KEYWORD, keywords are treated like
2595 identifiers. */
2598 }
2599 }
2601 /* Issue an error about name-lookup failing. NAME is the
2602 IDENTIFIER_NODE DECL is the result of
2603 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2604 the thing that we hoped to find. */
2606 static void
2608 tree name,
2609 tree decl,
2610 name_lookup_error desired,
2611 location_t location)
2612 {
2613 /* If name lookup completely failed, tell the user that NAME was not
2614 declared. */
2616 {
2629 else
2631 }
2633 {
2635 {
2652 }
2653 }
2655 {
2657 {
2667 name);
2671 }
2672 }
2673 else
2674 {
2676 {
2689 }
2690 }
2691 }
2693 /* If we are parsing tentatively, remember that an error has occurred
2694 during this tentative parse. Returns true if the error was
2695 simulated; false if a message should be issued by the caller. */
2697 static bool
2699 {
2701 {
2704 }
2706 }
2708 /* This function is called when a type is defined. If type
2709 definitions are forbidden at this point, an error message is
2710 issued. */
2712 static bool
2714 {
2715 /* If types are forbidden here, issue a message. */
2717 {
2718 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2719 in the message need to be interpreted. */
2722 }
2724 }
2726 /* This function is called when the DECLARATOR is processed. The TYPE
2727 was a type defined in the decl-specifiers. If it is invalid to
2728 define a type in the decl-specifiers for DECLARATOR, an error is
2729 issued. TYPE_LOCATION is the location of TYPE and is used
2730 for error reporting. */
2732 static void
2735 {
2736 /* [dcl.fct] forbids type definitions in return types.
2737 Unfortunately, it's not easy to know whether or not we are
2738 processing a return type until after the fact. */
2746 {
2751 type);
2752 }
2753 }
2755 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2756 "<" in any valid C++ program. If the next token is indeed "<",
2757 issue a message warning the user about what appears to be an
2758 invalid attempt to form a template-id. LOCATION is the location
2759 of the type-specifier (TYPE) */
2761 static void
2763 tree type,
2765 location_t location)
2766 {
2770 {
2774 {
2777 else
2779 }
2780 else
2782 /* Remember the location of the invalid "<". */
2785 /* Consume the "<". */
2787 /* Parse the template arguments. */
2789 /* Permanently remove the invalid template arguments so that
2790 this error message is not issued again. */
2793 }
2794 }
2796 /* If parsing an integral constant-expression, issue an error message
2797 about the fact that THING appeared and return true. Otherwise,
2798 return false. In either case, set
2799 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2801 static bool
2803 non_integral_constant thing)
2804 {
2807 {
2809 {
2812 {
2819 "enumeration type cannot appear in a "
2910 }
2914 }
2915 }
2917 }
2919 /* Emit a diagnostic for an invalid type name. This function commits
2920 to the current active tentative parse, if any. (Otherwise, the
2921 problematic construct might be encountered again later, resulting
2922 in duplicate error messages.) LOCATION is the location of ID. */
2924 static void
2926 location_t location)
2927 {
2930 /* Try to lookup the identifier. */
2937 /* If the lookup was ambiguous, an error will already have
2938 been issued. */
2940 /* If the lookup found a template-name, it means that the user forgot
2941 to specify an argument list. Emit a useful error message. */
2945 decl);
2949 /* Something like 'unsigned A a;' */
2952 {
2953 /* Issue an error message. */
2955 /* If we're in a template class, it's possible that the user was
2956 referring to a type from a base class. For example:
2958 template <typename T> struct A { typedef T X; };
2959 template <typename T> struct B : public A<T> { X x; };
2961 The user should have said "typename A<T>::X". */
2974 {
2975 tree b;
2978 b;
2980 {
2984 {
2985 tree field;
2986 /* Go from a particular instantiation of the
2987 template (which will have an empty TYPE_FIELDs),
2988 to the main version. */
2991 field;
2995 {
3000 }
3003 }
3004 }
3005 }
3006 }
3007 /* Here we diagnose qualified-ids where the scope is actually correct,
3008 but the identifier does not resolve to a valid type name. */
3010 {
3012 {
3017 else
3021 }
3024 {
3025 /* A<T>::A<T>() */
3031 }
3038 {
3043 else
3047 }
3048 else
3050 }
3051 }
3053 /* Check for a common situation where a type-name should be present,
3054 but is not, and issue a sensible error message. Returns true if an
3055 invalid type-name was detected.
3057 The situation handled by this function are variable declarations of the
3058 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3059 Usually, `ID' should name a type, but if we got here it means that it
3060 does not. We try to emit the best possible error message depending on
3061 how exactly the id-expression looks like. */
3063 static bool
3065 {
3066 tree id;
3069 /* Avoid duplicate error about ambiguous lookup. */
3071 {
3075 }
3084 /* If the next token is a (, this is a function with no explicit return
3085 type, i.e. constructor, destructor or conversion op. */
3088 {
3091 }
3095 /* Emit a diagnostic for the invalid type. */
3097 out:
3098 /* If we aren't in the middle of a declarator (i.e. in a
3099 parameter-declaration-clause), skip to the end of the declaration;
3100 there's no point in trying to process it. */
3104 }
3106 /* Consume tokens up to, and including, the next non-nested closing `)'.
3107 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3108 are doing error recovery. Returns -1 if OR_COMMA is true and we
3109 found an unnested comma. */
3111 static int
3116 {
3126 {
3130 {
3133 /* If we've run out of tokens, then there is no closing `)'. */
3136 /* This is good for lambda expression capture-lists. */
3146 /* This matches the processing in skip_to_end_of_statement. */
3172 {
3176 }
3181 }
3183 /* Consume the token. */
3185 }
3186 }
3188 /* Consume tokens until we reach the end of the current statement.
3189 Normally, that will be just before consuming a `;'. However, if a
3190 non-nested `}' comes first, then we stop before consuming that. */
3192 static void
3194 {
3197 /* Unwind generic function template scope if necessary. */
3202 {
3206 {
3209 /* If we've run out of tokens, stop. */
3213 /* If the next token is a `;', we have reached the end of the
3214 statement. */
3220 /* If this is a non-nested '}', stop before consuming it.
3221 That way, when confronted with something like:
3223 { 3 + }
3225 we stop before consuming the closing '}', even though we
3226 have not yet reached a `;'. */
3230 /* If it is the closing '}' for a block that we have
3231 scanned, stop -- but only after consuming the token.
3232 That way given:
3234 void f g () { ... }
3235 typedef int I;
3237 we will stop after the body of the erroneously declared
3238 function, but before consuming the following `typedef'
3239 declaration. */
3241 {
3244 }
3252 }
3254 /* Consume the token. */
3256 }
3257 }
3259 /* This function is called at the end of a statement or declaration.
3260 If the next token is a semicolon, it is consumed; otherwise, error
3261 recovery is attempted. */
3263 static void
3265 {
3266 /* Look for the trailing `;'. */
3268 {
3269 /* If there is additional (erroneous) input, skip to the end of
3270 the statement. */
3272 /* If the next token is now a `;', consume it. */
3275 }
3276 }
3278 /* Skip tokens until we have consumed an entire block, or until we
3279 have consumed a non-nested `;'. */
3281 static void
3283 {
3286 /* Unwind generic function template scope if necessary. */
3291 {
3295 {
3298 /* If we've run out of tokens, stop. */
3302 /* Stop if this is an unnested ';'. */
3308 /* Stop if this is an unnested '}', or closes the outermost
3309 nesting level. */
3310 nesting_depth--;
3318 /* Nest. */
3319 nesting_depth++;
3324 }
3326 /* Consume the token. */
3328 }
3329 }
3331 /* Skip tokens until a non-nested closing curly brace is the next
3332 token, or there are no more tokens. Return true in the first case,
3333 false otherwise. */
3335 static bool
3337 {
3341 {
3345 {
3348 /* If we've run out of tokens, stop. */
3352 /* If the next token is a non-nested `}', then we have reached
3353 the end of the current block. */
3359 /* If it the next token is a `{', then we are entering a new
3360 block. Consume the entire block. */
3366 }
3368 /* Consume the token. */
3370 }
3371 }
3373 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3374 parameter is the PRAGMA token, allowing us to purge the entire pragma
3375 sequence. */
3377 static void
3379 {
3384 do
3388 /* Ensure that the pragma is not parsed again. */
3390 }
3392 /* Require pragma end of line, resyncing with it as necessary. The
3393 arguments are as for cp_parser_skip_to_pragma_eol. */
3395 static void
3397 {
3401 }
3403 /* This is a simple wrapper around make_typename_type. When the id is
3404 an unresolved identifier node, we can provide a superior diagnostic
3405 using cp_parser_diagnose_invalid_type_name. */
3407 static tree
3409 location_t id_location)
3410 {
3411 tree result;
3413 {
3419 }
3421 }
3423 /* This is a wrapper around the
3424 make_{pointer,ptrmem,reference}_declarator functions that decides
3425 which one to call based on the CODE and CLASS_TYPE arguments. The
3426 CODE argument should be one of the values returned by
3427 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3428 appertain to the pointer or reference. */
3432 cp_cv_quals cv_qualifiers,
3434 tree attributes)
3435 {
3442 else
3452 }
3454 /* Create a new C++ parser. */
3458 {
3463 /* cp_lexer_new_main is called before doing GC allocation because
3464 cp_lexer_new_main might load a PCH file. */
3467 /* Initialize the binops_by_token so that we can get the tree
3468 directly from the token. */
3476 /* For now, we always accept GNU extensions. */
3479 /* The `>' token is a greater-than operator, not the end of a
3480 template-id. */
3485 /* We are not parsing a constant-expression. */
3490 /* Local variable names are not forbidden. */
3493 /* We are not processing an `extern "C"' declaration. */
3496 /* We are not processing a declarator. */
3499 /* We are not processing a template-argument-list. */
3502 /* We are not in an iteration statement. */
3505 /* We are not in a switch statement. */
3508 /* We are not parsing a type-id inside an expression. */
3511 /* Declarations aren't implicitly extern "C". */
3514 /* String literals should be translated to the execution character set. */
3517 /* We are not parsing a function body. */
3520 /* We can correct until told otherwise. */
3523 /* The unparsed function queue is empty. */
3526 /* There are no classes being defined. */
3529 /* No template parameters apply. */
3532 /* Not declaring an implicit function template. */
3539 }
3541 /* Create a cp_lexer structure which will emit the tokens in CACHE
3542 and push it onto the parser's lexer stack. This is used for delayed
3543 parsing of in-class method bodies and default arguments, and should
3544 not be confused with tentative parsing. */
3545 static void
3547 {
3552 /* Move the current source position to that of the first token in the
3553 new lexer. */
3555 }
3557 /* Pop the top lexer off the parser stack. This is never used for the
3558 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3559 static void
3561 {
3566 /* Put the current source position back where it was before this
3567 lexer was pushed. */
3569 }
3571 /* Lexical conventions [gram.lex] */
3573 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3574 identifier. */
3576 static tree
3578 {
3581 /* Look for the identifier. */
3583 /* Return the value. */
3585 }
3587 /* Parse a sequence of adjacent string constants. Returns a
3588 TREE_STRING representing the combined, nul-terminated string
3589 constant. If TRANSLATE is true, translate the string to the
3590 execution character set. If WIDE_OK is true, a wide string is
3591 invalid here.
3593 C++98 [lex.string] says that if a narrow string literal token is
3594 adjacent to a wide string literal token, the behavior is undefined.
3595 However, C99 6.4.5p4 says that this results in a wide string literal.
3596 We follow C99 here, for consistency with the C front end.
3598 This code is largely lifted from lex_string() in c-lex.c.
3600 FUTURE: ObjC++ will need to handle @-strings here. */
3601 static tree
3604 {
3605 tree value;
3612 tree string_tree;
3618 {
3621 }
3624 {
3628 }
3629 else
3630 {
3633 }
3636 /* Try to avoid the overhead of creating and destroying an obstack
3637 for the common case of just one string. */
3640 {
3648 {
3652 }
3653 else
3657 }
3658 else
3659 {
3663 do
3664 {
3666 count++;
3671 {
3674 {
3677 }
3680 {
3685 }
3687 }
3688 else
3692 {
3697 "unsupported non-standard concatenation "
3699 }
3705 {
3709 }
3710 else
3711 {
3715 }
3716 }
3720 }
3723 {
3726 }
3730 {
3735 {
3750 }
3755 {
3760 else
3762 }
3763 }
3764 else
3765 /* cpp_interpret_string has issued an error. */
3772 }
3774 /* Look up a literal operator with the name and the exact arguments. */
3776 static tree
3778 {
3785 {
3791 {
3794 {
3804 }
3807 /* May be this should be sufficient_parms_p instead,
3808 depending on how exactly should user-defined literals
3809 work in presence of default arguments on the literal
3810 operator parameters. */
3813 }
3814 }
3817 }
3819 /* Parse a user-defined char constant. Returns a call to a user-defined
3820 literal operator taking the character as an argument. */
3822 static tree
3824 {
3832 /* Build up a call to the user-defined operator */
3833 /* Lookup the name we got back from the id-expression. */
3838 {
3843 }
3852 }
3854 /* A subroutine of cp_parser_userdef_numeric_literal to
3855 create a char... template parameter pack from a string node. */
3857 static tree
3859 {
3860 tree charvec;
3866 /* Fill in CHARVEC with all of the parameters. */
3871 /* Build the argument packs. */
3878 }
3880 /* A subroutine of cp_parser_userdef_numeric_literal to
3881 create a char... template parameter pack from a string node. */
3883 static tree
3885 {
3886 tree charvec;
3897 /* First template parm is character type. */
3900 /* Fill in CHARVEC with all of the parameters. */
3907 /* Build the argument packs. */
3914 }
3916 /* Parse a user-defined numeric constant. returns a call to a user-defined
3917 literal operator. */
3919 static tree
3921 {
3932 /* Look for a literal operator taking the exact type of numeric argument
3933 as the literal value. */
3938 {
3941 {
3945 long_long_unsigned_type_node);
3946 else
3947 {
3951 long_double_type_node);
3955 }
3958 }
3959 }
3962 /* If the numeric argument didn't work, look for a raw literal
3963 operator taking a const char* argument consisting of the number
3964 in string format. */
3969 {
3972 {
3975 }
3976 }
3979 /* If the raw literal didn't work, look for a non-type template
3980 function with parameter pack char.... Call the function with
3981 template parameter characters representing the number. */
3985 {
3990 {
3993 }
3994 }
4002 }
4004 /* Parse a user-defined string constant. Returns a call to a user-defined
4005 literal operator taking a character pointer and the length of the string
4006 as arguments. */
4008 static tree
4010 {
4019 /* Look for a template function with typename parameter CharT
4020 and parameter pack CharT... Call the function with
4021 template parameter characters representing the string. */
4025 {
4030 {
4033 }
4034 }
4037 /* Build up a call to the user-defined operator */
4038 /* Lookup the name we got back from the id-expression. */
4044 {
4048 }
4057 }
4060 /* Basic concepts [gram.basic] */
4062 /* Parse a translation-unit.
4064 translation-unit:
4065 declaration-seq [opt]
4067 Returns TRUE if all went well. */
4069 static bool
4071 {
4072 /* The address of the first non-permanent object on the declarator
4073 obstack. */
4078 /* Create the declarator obstack, if necessary. */
4080 {
4082 /* Create the error declarator. */
4084 /* Create the empty parameter list. */
4086 /* Remember where the base of the declarator obstack lies. */
4088 }
4092 /* If there are no tokens left then all went well. */
4094 {
4095 /* Get rid of the token array; we don't need it any more. */
4099 /* This file might have been a context that's implicitly extern
4100 "C". If so, pop the lang context. (Only relevant for PCH.) */
4102 {
4105 }
4107 /* Finish up. */
4111 }
4112 else
4113 {
4116 }
4118 /* Make sure the declarator obstack was fully cleaned up. */
4122 /* All went well. */
4124 }
4126 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4127 decltype context. */
4131 {
4136 }
4138 /* We're about to parse a collection of statements. If we're currently
4139 parsing tentatively, set up a firewall so that any nested
4140 cp_parser_commit_to_tentative_parse won't affect the current context. */
4142 static cp_token_position
4144 {
4151 }
4153 /* We've finished parsing the collection of statements. Wrap up the
4154 firewall and replace the relevant tokens with the parsed form. */
4156 static void
4158 tree expr)
4159 {
4163 /* Finish the firewall level. */
4165 /* And remember the result of the parse for when we try again. */
4171 }
4173 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4174 enclosing parentheses. */
4176 static tree
4178 {
4181 /* Consume the '('. */
4183 /* Start the statement-expression. */
4185 /* Parse the compound-statement. */
4187 /* Finish up. */
4189 /* Consume the ')'. */
4195 }
4197 /* Expressions [gram.expr] */
4199 /* Parse a primary-expression.
4201 primary-expression:
4202 literal
4203 this
4204 ( expression )
4205 id-expression
4206 lambda-expression (C++11)
4208 GNU Extensions:
4210 primary-expression:
4211 ( compound-statement )
4212 __builtin_va_arg ( assignment-expression , type-id )
4213 __builtin_offsetof ( type-id , offsetof-expression )
4215 C++ Extensions:
4216 __has_nothrow_assign ( type-id )
4217 __has_nothrow_constructor ( type-id )
4218 __has_nothrow_copy ( type-id )
4219 __has_trivial_assign ( type-id )
4220 __has_trivial_constructor ( type-id )
4221 __has_trivial_copy ( type-id )
4222 __has_trivial_destructor ( type-id )
4223 __has_virtual_destructor ( type-id )
4224 __is_abstract ( type-id )
4225 __is_base_of ( type-id , type-id )
4226 __is_class ( type-id )
4227 __is_empty ( type-id )
4228 __is_enum ( type-id )
4229 __is_final ( type-id )
4230 __is_literal_type ( type-id )
4231 __is_pod ( type-id )
4232 __is_polymorphic ( type-id )
4233 __is_std_layout ( type-id )
4234 __is_trivial ( type-id )
4235 __is_union ( type-id )
4237 Objective-C++ Extension:
4239 primary-expression:
4240 objc-expression
4242 literal:
4243 __null
4245 ADDRESS_P is true iff this expression was immediately preceded by
4246 "&" and therefore might denote a pointer-to-member. CAST_P is true
4247 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4248 true iff this expression is a template argument.
4250 Returns a representation of the expression. Upon return, *IDK
4251 indicates what kind of id-expression (if any) was present. */
4253 static tree
4260 {
4263 /* Assume the primary expression is not an id-expression. */
4266 /* Peek at the next token. */
4269 {
4270 /* literal:
4271 integer-literal
4272 character-literal
4273 floating-literal
4274 string-literal
4275 boolean-literal
4276 pointer-literal
4277 user-defined-literal */
4288 {
4292 }
4293 /* Floating-point literals are only allowed in an integral
4294 constant expression if they are cast to an integral or
4295 enumeration type. */
4299 {
4300 /* CAST_P will be set even in invalid code like "int(2.7 +
4301 ...)". Therefore, we have to check that the next token
4302 is sure to end the cast. */
4304 {
4309 enumerator-definition. */
4311 /* The curly brace at the end of an enum-specifier. */
4313 /* The end of a statement. */
4315 /* The end of the cast-expression. */
4317 /* The end of an array bound. */
4319 /* The closing ">" in a template-argument-list. */
4322 /* C++0x only: A ">>" treated like two ">" tokens,
4323 in a template-argument-list. */
4328 }
4330 /* If we are within a cast, then the constraint that the
4331 cast is to an integral or enumeration type will be
4332 checked at that point. If we are not within a cast, then
4333 this code is invalid. */
4336 }
4355 /* ??? Should wide strings be allowed when parser->translate_strings_p
4356 is false (i.e. in attributes)? If not, we can kill the third
4357 argument to cp_parser_string_literal. */
4363 /* If we see `( { ' then we are looking at the beginning of
4364 a GNU statement-expression. */
4367 {
4368 /* Statement-expressions are not allowed by the standard. */
4372 /* And they're not allowed outside of a function-body; you
4373 cannot, for example, write:
4375 int i = ({ int j = 3; j + 1; });
4377 at class or namespace scope. */
4380 {
4382 "statement-expressions are not allowed outside "
4388 }
4389 else
4391 }
4392 /* Otherwise it's a normal parenthesized expression. */
4393 {
4394 tree expr;
4397 /* Consume the `('. */
4399 /* Within a parenthesized expression, a `>' token is always
4400 the greater-than operator. */
4401 saved_greater_than_is_operator_p
4405 /* Parse the parenthesized expression. */
4407 /* Let the front end know that this expression was
4408 enclosed in parentheses. This matters in case, for
4409 example, the expression is of the form `A::B', since
4410 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4411 not. */
4413 /* DR 705: Wrapping an unqualified name in parentheses
4414 suppresses arg-dependent lookup. We want to pass back
4415 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4416 (c++/37862), but none of the others. */
4420 /* The `>' token might be the end of a template-id or
4421 template-parameter-list now. */
4422 parser->greater_than_is_operator_p
4424 /* Consume the `)'. */
4429 }
4433 /* We have an Objective-C++ message. */
4435 {
4437 /* Don't warn about a failed tentative parse. */
4442 }
4446 /* We have an Objective-C++ string literal. */
4453 {
4454 /* These two are the boolean literals. */
4462 /* The `__null' literal. */
4467 /* The `nullptr' literal. */
4472 /* Recognize the `this' keyword. */
4476 {
4480 }
4481 /* Pointers cannot appear in constant-expressions. */
4486 /* The `operator' keyword can be the beginning of an
4487 id-expression. */
4494 {
4495 non_integral_constant name;
4497 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4498 __func__ are the names of variables -- but they are
4499 treated specially. Therefore, they are handled here,
4500 rather than relying on the generic id-expression logic
4501 below. Grammatically, these names are id-expressions.
4503 Consume the token. */
4507 {
4519 }
4524 /* Look up the name. */
4526 }
4529 {
4530 tree expression;
4531 tree type;
4532 source_location type_location;
4534 /* The `__builtin_va_arg' construct is used to handle
4535 `va_arg'. Consume the `__builtin_va_arg' token. */
4537 /* Look for the opening `('. */
4539 /* Now, parse the assignment-expression. */
4541 /* Look for the `,'. */
4544 /* Parse the type-id. */
4546 /* Look for the closing `)'. */
4548 /* Using `va_arg' in a constant-expression is not
4549 allowed. */
4551 NIC_VA_ARG))
4554 }
4584 /* Objective-C++ expressions. */
4594 {
4599 }
4603 }
4605 /* An id-expression can start with either an identifier, a
4606 `::' as the beginning of a qualified-id, or the "operator"
4607 keyword. */
4612 {
4613 tree id_expression;
4614 tree decl;
4620 id_expression:
4621 /* Parse the id-expression. */
4622 id_expression
4639 /* If we have a template-id, then no further lookup is
4640 required. If the template-id was for a template-class, we
4641 will sometimes have a TYPE_DECL at this point. */
4645 /* Look up the name. */
4646 else
4647 {
4648 tree ambiguous_decls;
4650 /* If we already know that this lookup is ambiguous, then
4651 we've already issued an error message; there's no reason
4652 to check again. */
4655 {
4658 }
4661 none_type,
4662 template_p,
4667 /* If the lookup was ambiguous, an error will already have
4668 been issued. */
4672 /* In Objective-C++, we may have an Objective-C 2.0
4673 dot-syntax for classes here. */
4678 {
4679 tree component;
4686 }
4688 /* In Objective-C++, an instance variable (ivar) may be preferred
4689 to whatever cp_parser_lookup_name() found. */
4692 /* If name lookup gives us a SCOPE_REF, then the
4693 qualifying scope was dependent. */
4695 {
4696 /* At this point, we do not know if DECL is a valid
4697 integral constant expression. We assume that it is
4698 in fact such an expression, so that code like:
4700 template <int N> struct A {
4701 int a[B<N>::i];
4702 };
4704 is accepted. At template-instantiation time, we
4705 will check that B<N>::i is actually a constant. */
4707 }
4708 /* Check to see if DECL is a local variable in a context
4709 where that is forbidden. */
4712 {
4713 /* It might be that we only found DECL because we are
4714 trying to be generous with pre-ISO scoping rules.
4715 For example, consider:
4717 int i;
4718 void g() {
4719 for (int i = 0; i < 10; ++i) {}
4720 extern void f(int j = i);
4721 }
4723 Here, name look up will originally find the out
4724 of scope `i'. We need to issue a warning message,
4725 but then use the global `i'. */
4728 {
4731 decl);
4733 }
4734 }
4735 }
4737 decl = (finish_id_expression
4739 idk,
4744 template_arg_p,
4750 }
4752 /* Anything else is an error. */
4756 }
4757 }
4765 {
4768 }
4770 /* Parse an id-expression.
4772 id-expression:
4773 unqualified-id
4774 qualified-id
4776 qualified-id:
4777 :: [opt] nested-name-specifier template [opt] unqualified-id
4778 :: identifier
4779 :: operator-function-id
4780 :: template-id
4782 Return a representation of the unqualified portion of the
4783 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4784 a `::' or nested-name-specifier.
4786 Often, if the id-expression was a qualified-id, the caller will
4787 want to make a SCOPE_REF to represent the qualified-id. This
4788 function does not do this in order to avoid wastefully creating
4789 SCOPE_REFs when they are not required.
4791 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4792 `template' keyword.
4794 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4795 uninstantiated templates.
4797 If *TEMPLATE_P is non-NULL, it is set to true iff the
4798 `template' keyword is used to explicitly indicate that the entity
4799 named is a template.
4801 If DECLARATOR_P is true, the id-expression is appearing as part of
4802 a declarator, rather than as part of an expression. */
4804 static tree
4811 {
4815 /* Assume the `template' keyword was not used. */
4819 /* Look for the optional `::' operator. */
4820 global_scope_p
4823 /* Look for the optional nested-name-specifier. */
4824 nested_name_specifier_p
4827 check_dependency_p,
4829 declarator_p)
4831 /* If there is a nested-name-specifier, then we are looking at
4832 the first qualified-id production. */
4834 {
4835 tree saved_scope;
4836 tree saved_object_scope;
4837 tree saved_qualifying_scope;
4838 tree unqualified_id;
4841 /* See if the next token is the `template' keyword. */
4845 /* Name lookup we do during the processing of the
4846 unqualified-id might obliterate SCOPE. */
4850 /* Process the final unqualified-id. */
4852 check_dependency_p,
4853 declarator_p,
4855 /* Restore the SAVED_SCOPE for our caller. */
4861 }
4862 /* Otherwise, if we are in global scope, then we are looking at one
4863 of the other qualified-id productions. */
4865 {
4867 tree id;
4869 /* Peek at the next token. */
4872 /* If it's an identifier, and the next token is not a "<", then
4873 we can avoid the template-id case. This is an optimization
4874 for this common case. */
4876 && !cp_parser_nth_token_starts_template_argument_list_p
4881 /* Try a template-id. */
4885 none_type,
4886 declarator_p);
4887 /* If that worked, we're done. */
4891 /* Peek at the next token. (Changes in the token buffer may
4892 have invalidated the pointer obtained above.) */
4896 {
4903 /* Fall through. */
4908 }
4909 }
4910 else
4913 declarator_p,
4914 optional_p);
4915 }
4917 /* Parse an unqualified-id.
4919 unqualified-id:
4920 identifier
4921 operator-function-id
4922 conversion-function-id
4923 ~ class-name
4924 template-id
4926 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4927 keyword, in a construct like `A::template ...'.
4929 Returns a representation of unqualified-id. For the `identifier'
4930 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4931 production a BIT_NOT_EXPR is returned; the operand of the
4932 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4933 other productions, see the documentation accompanying the
4934 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4935 names are looked up in uninstantiated templates. If DECLARATOR_P
4936 is true, the unqualified-id is appearing as part of a declarator,
4937 rather than as part of an expression. */
4939 static tree
4945 {
4948 /* Peek at the next token. */
4952 {
4954 {
4955 tree id;
4957 /* We don't know yet whether or not this will be a
4958 template-id. */
4960 /* Try a template-id. */
4962 check_dependency_p,
4963 none_type,
4964 declarator_p);
4965 /* If it worked, we're done. */
4968 /* Otherwise, it's an ordinary identifier. */
4970 }
4974 check_dependency_p,
4975 none_type,
4976 declarator_p);
4979 {
4980 tree type_decl;
4981 tree qualifying_scope;
4982 tree object_scope;
4983 tree scope;
4986 /* Consume the `~' token. */
4988 /* Parse the class-name. The standard, as written, seems to
4989 say that:
4991 template <typename T> struct S { ~S (); };
4992 template <typename T> S<T>::~S() {}
4994 is invalid, since `~' must be followed by a class-name, but
4995 `S<T>' is dependent, and so not known to be a class.
4996 That's not right; we need to look in uninstantiated
4997 templates. A further complication arises from:
4999 template <typename T> void f(T t) {
5000 t.T::~T();
5001 }
5003 Here, it is not possible to look up `T' in the scope of `T'
5004 itself. We must look in both the current scope, and the
5005 scope of the containing complete expression.
5007 Yet another issue is:
5009 struct S {
5010 int S;
5011 ~S();
5012 };
5014 S::~S() {}
5016 The standard does not seem to say that the `S' in `~S'
5017 should refer to the type `S' and not the data member
5018 `S::S'. */
5020 /* DR 244 says that we look up the name after the "~" in the
5021 same scope as we looked up the qualifying name. That idea
5022 isn't fully worked out; it's more complicated than that. */
5027 /* Check for invalid scopes. */
5029 {
5033 }
5035 {
5039 scope);
5044 }
5047 /* If the name is of the form "X::~X" it's OK even if X is a
5048 typedef. */
5057 {
5060 }
5062 /* ~auto means the destructor of whatever the object is. */
5064 {
5067 "%<~auto%> only available with "
5071 }
5073 /* If there was an explicit qualification (S::~T), first look
5074 in the scope given by the qualification (i.e., S).
5076 Note: in the calls to cp_parser_class_name below we pass
5077 typename_type so that lookup finds the injected-class-name
5078 rather than the constructor. */
5082 {
5087 typename_type,
5090 declarator_p);
5093 }
5094 /* In "N::S::~S", look in "N" as well. */
5096 {
5101 type_decl
5105 typename_type,
5108 declarator_p);
5111 }
5112 /* In "p->S::~T", look in the scope given by "*p" as well. */
5114 {
5119 type_decl
5123 typename_type,
5126 declarator_p);
5129 }
5130 /* Look in the surrounding context. */
5132 {
5138 type_decl
5142 typename_type,
5145 declarator_p);
5148 {
5149 /* We couldn't find a type with this name, so just accept
5150 it and check for a match at instantiation time. */
5155 }
5156 }
5157 /* If an error occurred, assume that the name of the
5158 destructor is the same as the name of the qualifying
5159 class. That allows us to keep parsing after running
5160 into ill-formed destructor names. */
5166 /* Check that destructor name and scope match. */
5168 {
5175 }
5177 /* [class.dtor]
5179 A typedef-name that names a class shall not be used as the
5180 identifier in the declarator for a destructor declaration. */
5187 type_decl);
5190 }
5194 {
5195 tree id;
5197 /* This could be a template-id, so we try that first. */
5199 /* Try a template-id. */
5202 none_type,
5203 declarator_p);
5204 /* If that worked, we're done. */
5207 /* We still don't know whether we're looking at an
5208 operator-function-id or a conversion-function-id. */
5210 /* Try an operator-function-id. */
5212 /* If that didn't work, try a conversion-function-id. */
5216 {
5217 /* 17.6.3.3.5 */
5223 }
5226 }
5227 /* Fall through. */
5234 }
5235 }
5237 /* Parse an (optional) nested-name-specifier.
5239 nested-name-specifier: [C++98]
5240 class-or-namespace-name :: nested-name-specifier [opt]
5241 class-or-namespace-name :: template nested-name-specifier [opt]
5243 nested-name-specifier: [C++0x]
5244 type-name ::
5245 namespace-name ::
5246 nested-name-specifier identifier ::
5247 nested-name-specifier template [opt] simple-template-id ::
5249 PARSER->SCOPE should be set appropriately before this function is
5250 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5251 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5252 in name lookups.
5254 Sets PARSER->SCOPE to the class (TYPE) or namespace
5255 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5256 it unchanged if there is no nested-name-specifier. Returns the new
5257 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5259 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5260 part of a declaration and/or decl-specifier. */
5262 static tree
5268 {
5273 /* Remember where the nested-name-specifier starts. */
5275 {
5278 }
5281 {
5282 tree new_scope;
5283 tree old_scope;
5284 tree saved_qualifying_scope;
5287 /* Spot cases that cannot be the beginning of a
5288 nested-name-specifier. */
5291 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5292 the already parsed nested-name-specifier. */
5294 {
5295 /* Grab the nested-name-specifier and continue the loop. */
5297 /* If we originally encountered this nested-name-specifier
5298 with IS_DECLARATION set to false, we will not have
5299 resolved TYPENAME_TYPEs, so we must do so here. */
5302 {
5307 }
5310 }
5312 /* Spot cases that cannot be the beginning of a
5313 nested-name-specifier. On the second and subsequent times
5314 through the loop, we look for the `template' keyword. */
5316 ;
5317 /* A template-id can start a nested-name-specifier. */
5319 ;
5320 /* DR 743: decltype can be used in a nested-name-specifier. */
5322 ;
5323 else
5324 {
5325 /* If the next token is not an identifier, then it is
5326 definitely not a type-name or namespace-name. */
5329 /* If the following token is neither a `<' (to begin a
5330 template-id), nor a `::', then we are not looking at a
5331 nested-name-specifier. */
5337 {
5341 }
5344 && !cp_parser_nth_token_starts_template_argument_list_p
5347 }
5349 /* The nested-name-specifier is optional, so we parse
5350 tentatively. */
5353 /* Look for the optional `template' keyword, if this isn't the
5354 first time through the loop. */
5357 else
5360 /* Save the old scope since the name lookup we are about to do
5361 might destroy it. */
5364 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5365 look up names in "X<T>::I" in order to determine that "Y" is
5366 a template. So, if we have a typename at this point, we make
5367 an effort to look through it. */
5369 && !typename_keyword_p
5374 /* Parse the qualifying entity. */
5375 new_scope
5377 typename_keyword_p,
5378 template_keyword_p,
5379 check_dependency_p,
5380 type_p,
5381 is_declaration);
5382 /* Look for the `::' token. */
5385 /* If we found what we wanted, we keep going; otherwise, we're
5386 done. */
5388 {
5391 /* Restore the OLD_SCOPE since it was valid before the
5392 failed attempt at finding the last
5393 class-or-namespace-name. */
5397 /* If the next token is a decltype, and the one after that is a
5398 `::', then the decltype has failed to resolve to a class or
5399 enumeration type. Give this error even when parsing
5400 tentatively since it can't possibly be valid--and we're going
5401 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5402 won't get another chance.*/
5406 {
5413 /* As below. */
5416 }
5420 /* If the next token is an identifier, and the one after
5421 that is a `::', then any valid interpretation would have
5422 found a class-or-namespace-name. */
5428 {
5431 {
5433 {
5434 tree decl;
5435 tree ambiguous_decls;
5438 none_type,
5447 decl);
5449 {
5450 // cp_parser_lookup_name has the same diagnostic,
5451 // thus make sure to emit it at most once.
5454 {
5459 }
5461 }
5462 else
5463 {
5465 cp_parser_name_lookup_error
5468 else
5469 cp_parser_name_lookup_error
5472 }
5473 }
5476 /* Treat this as a successful nested-name-specifier
5477 due to:
5479 [basic.lookup.qual]
5481 If the name found is not a class-name (clause
5482 _class_) or namespace-name (_namespace.def_), the
5483 program is ill-formed. */
5485 }
5487 }
5489 }
5490 /* We've found one valid nested-name-specifier. */
5492 /* Name lookup always gives us a DECL. */
5495 /* Uses of "template" must be followed by actual templates. */
5507 new_scope);
5508 /* If it is a class scope, try to complete it; we are about to
5509 be looking up names inside the class. */
5511 /* Since checking types for dependency can be expensive,
5512 avoid doing it if the type is already complete. */
5514 /* Do not try to complete dependent types. */
5516 {
5518 /* If it is a typedef to current class, use the current
5519 class instead, as the typedef won't have any names inside
5520 it yet. */
5524 }
5525 /* Make sure we look in the right scope the next time through
5526 the loop. */
5528 }
5530 /* If parsing tentatively, replace the sequence of tokens that makes
5531 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5532 token. That way, should we re-parse the token stream, we will
5533 not have to repeat the effort required to do the parse, nor will
5534 we issue duplicate error messages. */
5536 {
5540 /* Reset the contents of the START token. */
5542 /* Retrieve any deferred checks. Do not pop this access checks yet
5543 so the memory will not be reclaimed during token replacing below. */
5551 /* Purge all subsequent tokens. */
5553 }
5559 }
5561 /* Parse a nested-name-specifier. See
5562 cp_parser_nested_name_specifier_opt for details. This function
5563 behaves identically, except that it will an issue an error if no
5564 nested-name-specifier is present. */
5566 static tree
5572 {
5573 tree scope;
5575 /* Look for the nested-name-specifier. */
5577 typename_keyword_p,
5578 check_dependency_p,
5579 type_p,
5580 is_declaration);
5581 /* If it was not present, issue an error message. */
5583 {
5586 }
5589 }
5591 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5592 this is either a class-name or a namespace-name (which corresponds
5593 to the class-or-namespace-name production in the grammar). For
5594 C++0x, it can also be a type-name that refers to an enumeration
5595 type or a simple-template-id.
5597 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5598 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5599 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5600 TYPE_P is TRUE iff the next name should be taken as a class-name,
5601 even the same name is declared to be another entity in the same
5602 scope.
5604 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5605 specified by the class-or-namespace-name. If neither is found the
5606 ERROR_MARK_NODE is returned. */
5608 static tree
5615 {
5616 tree saved_scope;
5617 tree saved_qualifying_scope;
5618 tree saved_object_scope;
5619 tree scope;
5623 /* DR 743: decltype can appear in a nested-name-specifier. */
5625 {
5629 {
5632 }
5636 }
5638 /* Before we try to parse the class-name, we must save away the
5639 current PARSER->SCOPE since cp_parser_class_name will destroy
5640 it. */
5644 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5645 there is no need to look for a namespace-name. */
5646 only_class_p = template_keyword_p
5651 typename_keyword_p,
5652 template_keyword_p,
5654 check_dependency_p,
5656 is_declaration);
5658 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5662 {
5663 /* Restore the saved scope. */
5668 /* Parse tentatively. */
5671 /* Parse a type-name */
5674 /* "If the name found does not designate a namespace or a class,
5675 enumeration, or dependent type, the program is ill-formed."
5677 We cover classes and dependent types above and namespaces below,
5678 so this code is only looking for enums. */
5684 }
5685 /* If that didn't work, try for a namespace-name. */
5687 {
5688 /* Restore the saved scope. */
5692 /* If we are not looking at an identifier followed by the scope
5693 resolution operator, then this is not part of a
5694 nested-name-specifier. (Note that this function is only used
5695 to parse the components of a nested-name-specifier.) */
5700 }
5703 }
5705 /* Return true if we are looking at a compound-literal, false otherwise. */
5707 static bool
5709 {
5710 /* Consume the `('. */
5715 /* Skip tokens until the next token is a closing parenthesis.
5716 If we find the closing `)', and the next token is a `{', then
5717 we are looking at a compound-literal. */
5718 bool compound_literal_p
5723 /* Roll back the tokens we skipped. */
5727 }
5729 /* Parse a postfix-expression.
5731 postfix-expression:
5732 primary-expression
5733 postfix-expression [ expression ]
5734 postfix-expression ( expression-list [opt] )
5735 simple-type-specifier ( expression-list [opt] )
5736 typename :: [opt] nested-name-specifier identifier
5737 ( expression-list [opt] )
5738 typename :: [opt] nested-name-specifier template [opt] template-id
5739 ( expression-list [opt] )
5740 postfix-expression . template [opt] id-expression
5741 postfix-expression -> template [opt] id-expression
5742 postfix-expression . pseudo-destructor-name
5743 postfix-expression -> pseudo-destructor-name
5744 postfix-expression ++
5745 postfix-expression --
5746 dynamic_cast < type-id > ( expression )
5747 static_cast < type-id > ( expression )
5748 reinterpret_cast < type-id > ( expression )
5749 const_cast < type-id > ( expression )
5750 typeid ( expression )
5751 typeid ( type-id )
5753 GNU Extension:
5755 postfix-expression:
5756 ( type-id ) { initializer-list , [opt] }
5758 This extension is a GNU version of the C99 compound-literal
5759 construct. (The C99 grammar uses `type-name' instead of `type-id',
5760 but they are essentially the same concept.)
5762 If ADDRESS_P is true, the postfix expression is the operand of the
5763 `&' operator. CAST_P is true if this expression is the target of a
5764 cast.
5766 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5767 class member access expressions [expr.ref].
5769 Returns a representation of the expression. */
5771 static tree
5775 {
5777 location_t loc;
5784 /* Peek at the next token. */
5787 /* Some of the productions are determined by keywords. */
5790 {
5795 {
5796 tree type;
5797 tree expression;
5801 /* All of these can be handled in the same way from the point
5802 of view of parsing. Begin by consuming the token
5803 identifying the cast. */
5806 /* New types cannot be defined in the cast. */
5808 parser->type_definition_forbidden_message
5811 /* Look for the opening `<'. */
5813 /* Parse the type to which we are casting. */
5818 /* Look for the closing `>'. */
5820 /* Restore the old message. */
5823 bool saved_greater_than_is_operator_p
5827 /* And the expression which is being cast. */
5832 parser->greater_than_is_operator_p
5835 /* Only type conversions to integral or enumeration types
5836 can be used in constant-expressions. */
5842 {
5844 postfix_expression
5848 postfix_expression
5852 postfix_expression
5854 tf_warning_or_error);
5857 postfix_expression
5862 }
5863 }
5867 {
5868 tree type;
5872 /* Consume the `typeid' token. */
5874 /* Look for the `(' token. */
5876 /* Types cannot be defined in a `typeid' expression. */
5878 parser->type_definition_forbidden_message
5880 /* We can't be sure yet whether we're looking at a type-id or an
5881 expression. */
5883 /* Try a type-id first. */
5888 /* Look for the `)' token. Otherwise, we can't be sure that
5889 we're not looking at an expression: consider `typeid (int
5890 (3))', for example. */
5892 /* If all went well, simply lookup the type-id. */
5895 /* Otherwise, fall back to the expression variant. */
5896 else
5897 {
5898 tree expression;
5900 /* Look for an expression. */
5902 /* Compute its typeid. */
5904 /* Look for the `)' token. */
5906 }
5907 /* Restore the saved message. */
5909 /* `typeid' may not appear in an integral constant expression. */
5912 }
5916 {
5917 tree type;
5918 /* The syntax permitted here is the same permitted for an
5919 elaborated-type-specifier. */
5924 }
5928 {
5932 {
5937 }
5939 {
5944 }
5945 else
5946 {
5947 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5950 }
5952 postfix_expression =
5956 {
5960 }
5962 {
5967 }
5968 else
5969 {
5971 postfix_expression);
5975 }
5977 }
5980 {
5983 tree p;
5997 tf_warning_or_error);
6000 tf_warning_or_error);
6001 else
6002 {
6006 }
6008 }
6011 {
6012 tree type;
6014 /* If the next thing is a simple-type-specifier, we may be
6015 looking at a functional cast. We could also be looking at
6016 an id-expression. So, we try the functional cast, and if
6017 that doesn't work we fall back to the primary-expression. */
6019 /* Look for the simple-type-specifier. */
6022 CP_PARSER_FLAGS_NONE);
6023 /* Parse the cast itself. */
6025 postfix_expression
6027 /* If that worked, we're done. */
6031 /* If the functional-cast didn't work out, try a
6032 compound-literal. */
6035 {
6040 /* Avoid calling cp_parser_type_id pointlessly, see comment
6041 in cp_parser_cast_expression about c++/29234. */
6044 else
6045 {
6046 /* Parse the type. */
6051 /* Look for the `)'. */
6053 }
6055 /* If things aren't going well, there's no need to
6056 keep going. */
6058 {
6060 /* Parse the brace-enclosed initializer list. */
6063 }
6064 /* If that worked, we're definitely looking at a
6065 compound-literal expression. */
6067 {
6068 /* Warn the user that a compound literal is not
6069 allowed in standard C++. */
6072 /* For simplicity, we disallow compound literals in
6073 constant-expressions. We could
6074 allow compound literals of integer type, whose
6075 initializer was a constant, in constant
6076 expressions. Permitting that usage, as a further
6077 extension, would not change the meaning of any
6078 currently accepted programs. (Of course, as
6079 compound literals are not part of ISO C++, the
6080 standard has nothing to say.) */
6082 NIC_NCC))
6083 {
6086 }
6087 /* Form the representation of the compound-literal. */
6088 postfix_expression
6090 tf_warning_or_error);
6092 }
6093 }
6095 /* It must be a primary-expression. */
6096 postfix_expression
6099 decltype_p,
6101 }
6103 }
6105 /* Note that we don't need to worry about calling build_cplus_new on a
6106 class-valued CALL_EXPR in decltype when it isn't the end of the
6107 postfix-expression; unary_complex_lvalue will take care of that for
6108 all these cases. */
6110 /* Keep looping until the postfix-expression is complete. */
6112 {
6116 /* It is not a Koenig lookup function call. */
6117 postfix_expression
6120 /* Peek at the next token. */
6124 {
6127 {
6129 "two consecutive %<[%> shall "
6132 }
6133 postfix_expression
6135 postfix_expression,
6137 decltype_p);
6143 /* postfix-expression ( expression-list [opt] ) */
6144 {
6154 is_builtin_constant_p
6157 {
6158 /* The whole point of __builtin_constant_p is to allow
6159 non-constant expressions to appear as arguments. */
6160 saved_integral_constant_expression_p
6162 saved_non_integral_constant_expression_p
6165 }
6166 args = (cp_parser_parenthesized_expression_list
6172 {
6173 parser->integral_constant_expression_p
6175 parser->non_integral_constant_expression_p
6177 }
6180 {
6183 }
6185 /* Function calls are not permitted in
6186 constant-expressions. */
6189 NIC_FUNC_CALL))
6190 {
6194 }
6199 {
6201 {
6203 {
6206 postfix_expression
6208 complain);
6209 }
6210 else
6211 postfix_expression
6213 }
6214 /* We do not perform argument-dependent lookup if
6215 normal lookup finds a non-function, in accordance
6216 with the expected resolution of DR 218. */
6219 {
6223 /* Do not do argument dependent lookup if regular
6224 lookup finds a member function or a block-scope
6225 function declaration. [basic.lookup.argdep]/3 */
6228 {
6231 postfix_expression
6233 complain);
6234 }
6235 }
6236 }
6239 {
6249 "%<memset%> used with constant zero length "
6250 "parameter; this could be due to transposed "
6253 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6254 to avoid leaking those into folder and middle-end. */
6256 tree arg;
6260 }
6263 {
6273 {
6274 postfix_expression
6278 }
6281 {
6282 postfix_expression
6283 = (build_new_method_call
6289 complain));
6290 }
6291 else
6292 postfix_expression
6296 complain);
6297 }
6301 postfix_expression = (build_offset_ref_call_from_tree
6303 complain));
6305 /* A call to a static class member, or a namespace-scope
6306 function. */
6307 postfix_expression
6310 koenig_p,
6311 complain);
6312 else
6313 /* All other function calls. */
6314 postfix_expression
6317 koenig_p,
6318 complain);
6322 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6326 }
6331 /* postfix-expression . template [opt] id-expression
6332 postfix-expression . pseudo-destructor-name
6333 postfix-expression -> template [opt] id-expression
6334 postfix-expression -> pseudo-destructor-name */
6336 /* Consume the `.' or `->' operator. */
6339 postfix_expression
6341 postfix_expression,
6348 /* postfix-expression ++ */
6349 /* Consume the `++' token. */
6351 /* Generate a representation for the complete expression. */
6352 postfix_expression
6354 POSTINCREMENT_EXPR);
6355 /* Increments may not appear in constant-expressions. */
6363 /* postfix-expression -- */
6364 /* Consume the `--' token. */
6366 /* Generate a representation for the complete expression. */
6367 postfix_expression
6369 POSTDECREMENT_EXPR);
6370 /* Decrements may not appear in constant-expressions. */
6382 else
6384 }
6385 }
6387 /* We should never get here. */
6390 }
6392 /* This function parses Cilk Plus array notations. If a normal array expr. is
6393 parsed then the array index is passed back to the caller through *INIT_INDEX
6394 and the function returns a NULL_TREE. If array notation expr. is parsed,
6395 then *INIT_INDEX is ignored by the caller and the function returns
6396 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6397 error_mark_node. */
6399 static tree
6401 tree array_value)
6402 {
6406 {
6409 }
6418 {
6421 }
6423 {
6424 /* Consume the ':'. */
6427 /* If we are here, then we have a case like this A[:]. */
6429 {
6433 }
6437 }
6438 else
6439 {
6440 /* If we are here, then there are three valid possibilities:
6441 1. ARRAY [ EXP ]
6442 2. ARRAY [ EXP : EXP ]
6443 3. ARRAY [ EXP : EXP : EXP ] */
6447 {
6448 /* This indicates that we have a normal array expression. */
6451 }
6453 /* Consume the ':'. */
6457 {
6460 }
6461 }
6466 {
6470 }
6476 }
6478 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6479 by cp_parser_builtin_offsetof. We're looking for
6481 postfix-expression [ expression ]
6482 postfix-expression [ braced-init-list ] (C++11)
6484 FOR_OFFSETOF is set if we're being called in that context, which
6485 changes how we deal with integer constant expressions. */
6487 static tree
6489 tree postfix_expression,
6492 {
6497 /* Consume the `[' token. */
6503 /* Parse the index expression. */
6504 /* ??? For offsetof, there is a question of what to allow here. If
6505 offsetof is not being used in an integral constant expression context,
6506 then we *could* get the right answer by computing the value at runtime.
6507 If we are in an integral constant expression context, then we might
6508 could accept any constant expression; hard to say without analysis.
6509 Rather than open the barn door too wide right away, allow only integer
6510 constant expressions here. */
6513 else
6514 {
6516 {
6523 {
6525 "braced list index is not allowed with array "
6529 }
6530 }
6532 {
6533 /* Here are have these two options:
6534 ARRAY[EXP : EXP] - Array notation expr with default
6535 stride of 1.
6536 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6537 stride. */
6539 postfix_expression);
6542 }
6543 else
6545 }
6549 /* Look for the closing `]'. */
6552 /* Build the ARRAY_REF. */
6556 /* When not doing offsetof, array references are not permitted in
6557 constant-expressions. */
6563 }
6565 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6566 by cp_parser_builtin_offsetof. We're looking for
6568 postfix-expression . template [opt] id-expression
6569 postfix-expression . pseudo-destructor-name
6570 postfix-expression -> template [opt] id-expression
6571 postfix-expression -> pseudo-destructor-name
6573 FOR_OFFSETOF is set if we're being called in that context. That sorta
6574 limits what of the above we'll actually accept, but nevermind.
6575 TOKEN_TYPE is the "." or "->" token, which will already have been
6576 removed from the stream. */
6578 static tree
6581 tree postfix_expression,
6583 location_t location)
6584 {
6585 tree name;
6590 /* If this is a `->' operator, dereference the pointer. */
6593 tf_warning_or_error);
6594 /* Check to see whether or not the expression is type-dependent. */
6596 /* The identifier following the `->' or `.' is not qualified. */
6602 /* Enter the scope corresponding to the type of the object
6603 given by the POSTFIX_EXPRESSION. */
6605 {
6607 /* According to the standard, no expression should ever have
6608 reference type. Unfortunately, we do not currently match
6609 the standard in this respect in that our internal representation
6610 of an expression may have reference type even when the standard
6611 says it does not. Therefore, we have to manually obtain the
6612 underlying type here. */
6614 /* The type of the POSTFIX_EXPRESSION must be complete. */
6616 {
6618 postfix_expression);
6620 }
6621 /* Unlike the object expression in other contexts, *this is not
6622 required to be of complete type for purposes of class member
6623 access (5.2.5) outside the member function body. */
6627 /* Let the name lookup machinery know that we are processing a
6628 class member access expression. */
6630 /* If something went wrong, we want to be able to discern that case,
6631 as opposed to the case where there was no SCOPE due to the type
6632 of expression being dependent. */
6635 /* If the SCOPE was erroneous, make the various semantic analysis
6636 functions exit quickly -- and without issuing additional error
6637 messages. */
6640 }
6642 /* Assume this expression is not a pseudo-destructor access. */
6645 /* If the SCOPE is a scalar type, then, if this is a valid program,
6646 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6647 is type dependent, it can be pseudo-destructor-name or something else.
6648 Try to parse it as pseudo-destructor-name first. */
6650 {
6651 tree s;
6652 tree type;
6655 /* Parse the pseudo-destructor-name. */
6664 {
6666 postfix_expression
6669 }
6670 }
6673 {
6674 /* If the SCOPE is not a scalar type, we are looking at an
6675 ordinary class member access expression, rather than a
6676 pseudo-destructor-name. */
6679 /* Parse the id-expression. */
6680 name = (cp_parser_id_expression
6687 /* In general, build a SCOPE_REF if the member name is qualified.
6688 However, if the name was not dependent and has already been
6689 resolved; there is no need to build the SCOPE_REF. For example;
6691 struct X { void f(); };
6692 template <typename T> void f(T* t) { t->X::f(); }
6694 Even though "t" is dependent, "X::f" is not and has been resolved
6695 to a BASELINK; there is no need to include scope information. */
6697 /* But we do need to remember that there was an explicit scope for
6698 virtual function calls. */
6702 /* If the name is a template-id that names a type, we will get a
6703 TYPE_DECL here. That is invalid code. */
6705 {
6708 }
6709 else
6710 {
6712 {
6714 {
6718 }
6719 else
6722 name,
6723 template_p);
6727 }
6729 adjust_result_of_qualified_name_lookup
6731 postfix_expression
6733 template_p,
6734 tf_warning_or_error);
6735 }
6736 }
6738 /* We no longer need to look up names in the scope of the object on
6739 the left-hand side of the `.' or `->' operator. */
6742 /* Outside of offsetof, these operators may not appear in
6743 constant-expressions. */
6745 && (cp_parser_non_integral_constant_expression
6750 }
6752 /* Cache of LITERAL_ZERO_P constants. */
6756 /* Parse a parenthesized expression-list.
6758 expression-list:
6759 assignment-expression
6760 expression-list, assignment-expression
6762 attribute-list:
6763 expression-list
6764 identifier
6765 identifier, expression-list
6767 CAST_P is true if this expression is the target of a cast.
6769 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6770 argument pack.
6772 Returns a vector of trees. Each element is a representation of an
6773 assignment-expression. NULL is returned if the ( and or ) are
6774 missing. An empty, but allocated, vector is returned on no
6775 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6776 if we are parsing an attribute list for an attribute that wants a
6777 plain identifier argument, normal_attr for an attribute that wants
6778 an expression, or non_attr if we aren't parsing an attribute list. If
6779 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6780 not all of the expressions in the list were constant.
6781 WANT_LITERAL_ZERO_P is true if the caller is interested in
6782 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6783 immediately, this can be removed. */
6792 {
6798 /* Assume all the expressions will be constant. */
6807 /* Within a parenthesized expression, a `>' token is always
6808 the greater-than operator. */
6809 saved_greater_than_is_operator_p
6813 /* Consume expressions until there are no more. */
6816 {
6817 tree expr;
6819 /* At the beginning of attribute lists, check to see if the
6820 next token is an identifier. */
6823 {
6826 /* Consume the identifier. */
6828 /* Save the identifier. */
6830 }
6831 else
6832 {
6835 /* Parse the next assignment-expression. */
6837 {
6838 /* A braced-init-list. */
6844 }
6846 {
6847 expr = (cp_parser_constant_expression
6852 }
6853 else
6854 {
6858 {
6864 /* If a parameter is literal zero alone, remember it
6865 for -Wmemset-transposed-args warning. */
6868 && want_literal_zero_p
6870 == CPP_COMMA
6873 {
6880 else
6881 {
6886 }
6887 /* Consume the 0 token (or '\0', 0LL etc.). */
6889 }
6893 }
6896 cast_p);
6897 }
6902 /* If we have an ellipsis, then this is an expression
6903 expansion. */
6906 {
6907 /* Consume the `...'. */
6910 /* Build the argument pack. */
6912 }
6914 /* Add it to the list. We add error_mark_node
6915 expressions to the list, so that we can still tell if
6916 the correct form for a parenthesized expression-list
6917 is found. That gives better errors. */
6922 }
6924 /* After the first item, attribute lists look the same as
6925 expression lists. */
6928 get_comma:;
6929 /* If the next token isn't a `,', then we are done. */
6933 /* Otherwise, consume the `,' and keep going. */
6935 }
6938 {
6941 skip_comma:;
6942 /* We try and resync to an unnested comma, as that will give the
6943 user better diagnostics. */
6951 {
6952 parser->greater_than_is_operator_p
6955 }
6956 }
6958 parser->greater_than_is_operator_p
6965 }
6967 /* Parse a pseudo-destructor-name.
6969 pseudo-destructor-name:
6970 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6971 :: [opt] nested-name-specifier template template-id :: ~ type-name
6972 :: [opt] nested-name-specifier [opt] ~ type-name
6974 If either of the first two productions is used, sets *SCOPE to the
6975 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6976 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6977 or ERROR_MARK_NODE if the parse fails. */
6979 static void
6981 tree object,
6984 {
6987 /* Handle ~auto. */
6991 {
6994 "%<~auto%> only available with "
7001 }
7003 /* Assume that things will not work out. */
7006 /* Look for the optional `::' operator. */
7008 /* Look for the optional nested-name-specifier. */
7009 nested_name_specifier_p
7016 /* Now, if we saw a nested-name-specifier, we might be doing the
7017 second production. */
7020 {
7021 /* Consume the `template' keyword. */
7023 /* Parse the template-id. */
7027 class_type,
7029 /* Look for the `::' token. */
7031 }
7032 /* If the next token is not a `~', then there might be some
7033 additional qualification. */
7035 {
7036 /* At this point, we're looking for "type-name :: ~". The type-name
7037 must not be a class-name, since this is a pseudo-destructor. So,
7038 it must be either an enum-name, or a typedef-name -- both of which
7039 are just identifiers. So, we peek ahead to check that the "::"
7040 and "~" tokens are present; if they are not, then we can avoid
7041 calling type_name. */
7045 {
7048 }
7050 /* Look for the type-name. */
7055 /* Look for the `::' token. */
7057 }
7058 else
7061 /* Look for the `~'. */
7064 /* Once we see the ~, this has to be a pseudo-destructor. */
7068 /* Look for the type-name again. We are not responsible for
7069 checking that it matches the first type-name. */
7071 }
7073 /* Parse a unary-expression.
7075 unary-expression:
7076 postfix-expression
7077 ++ cast-expression
7078 -- cast-expression
7079 unary-operator cast-expression
7080 sizeof unary-expression
7081 sizeof ( type-id )
7082 alignof ( type-id ) [C++0x]
7083 new-expression
7084 delete-expression
7086 GNU Extensions:
7088 unary-expression:
7089 __extension__ cast-expression
7090 __alignof__ unary-expression
7091 __alignof__ ( type-id )
7092 alignof unary-expression [C++0x]
7093 __real__ cast-expression
7094 __imag__ cast-expression
7095 && identifier
7096 sizeof ( type-id ) { initializer-list , [opt] }
7097 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7098 __alignof__ ( type-id ) { initializer-list , [opt] }
7100 ADDRESS_P is true iff the unary-expression is appearing as the
7101 operand of the `&' operator. CAST_P is true if this expression is
7102 the target of a cast.
7104 Returns a representation of the expression. */
7106 static tree
7109 {
7113 /* Peek at the next token. */
7115 /* Some keywords give away the kind of expression. */
7117 {
7121 {
7124 {
7127 location_t first_loc;
7130 /* Consume the token. */
7133 /* Parse the operand. */
7138 else
7139 {
7140 /* ISO C++ defines alignof only with types, not with
7141 expressions. So pedwarn if alignof is used with a non-
7142 type expression. However, __alignof__ is ok. */
7145 "ISO C++ does not allow %<alignof%> "
7149 }
7150 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7151 SIZEOF_EXPR with the original operand. */
7153 {
7155 {
7157 {
7160 error_mark_node));
7162 }
7163 else
7167 }
7169 }
7171 }
7180 {
7181 /* The saved value of the PEDANTIC flag. */
7183 tree expr;
7185 /* Save away the PEDANTIC flag. */
7187 /* Parse the cast-expression. */
7189 /* Restore the PEDANTIC flag. */
7193 }
7197 {
7198 tree expression;
7200 /* Consume the `__real__' or `__imag__' token. */
7202 /* Parse the cast-expression. */
7204 /* Create the complete representation. */
7208 expression,
7209 tf_warning_or_error);
7210 }
7218 {
7219 tree expr;
7229 parser->type_definition_forbidden_message
7232 saved_integral_constant_expression_p
7234 saved_non_integral_constant_expression_p
7238 saved_greater_than_is_operator_p
7250 parser->greater_than_is_operator_p
7253 parser->integral_constant_expression_p
7255 parser->non_integral_constant_expression_p
7262 }
7266 }
7267 }
7269 /* Look for the `:: new' and `:: delete', which also signal the
7270 beginning of a new-expression, or delete-expression,
7271 respectively. If the next token is `::', then it might be one of
7272 these. */
7274 {
7277 /* See if the token after the `::' is one of the keywords in
7278 which we're interested. */
7280 /* If it's `new', we have a new-expression. */
7283 /* Similarly, for `delete'. */
7286 }
7288 /* Look for a unary operator. */
7290 /* The `++' and `--' operators can be handled similarly, even though
7291 they are not technically unary-operators in the grammar. */
7293 {
7298 /* Handle the GNU address-of-label extension. */
7301 {
7302 tree identifier;
7303 tree expression;
7306 /* Consume the '&&' token. */
7308 /* Look for the identifier. */
7310 /* Create an expression representing the address. */
7313 NIC_ADDR_LABEL))
7316 }
7317 }
7319 {
7320 tree cast_expression;
7326 /* Consume the operator token. */
7328 /* Parse the cast-expression. */
7329 cast_expression
7334 pidk);
7335 /* Now, build an appropriate representation. */
7337 {
7341 RO_UNARY_STAR,
7342 complain);
7347 /* Fall through. */
7350 cast_expression,
7351 complain);
7358 /* Fall through. */
7368 }
7372 non_constant_p))
7376 }
7380 decltype_p,
7381 pidk);
7382 }
7384 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7385 unary-operator, the corresponding tree code is returned. */
7387 static enum tree_code
7389 {
7391 {
7412 }
7413 }
7415 /* Parse a new-expression.
7417 new-expression:
7418 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7419 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7421 Returns a representation of the expression. */
7423 static tree
7425 {
7428 tree type;
7431 tree ret;
7433 /* Look for the optional `::' operator. */
7434 global_scope_p
7438 /* Look for the `new' operator. */
7440 /* There's no easy way to tell a new-placement from the
7441 `( type-id )' construct. */
7443 /* Look for a new-placement. */
7445 /* If that didn't work out, there's no new-placement. */
7447 {
7451 }
7453 /* If the next token is a `(', then we have a parenthesized
7454 type-id. */
7456 {
7460 /* Consume the `('. */
7463 /* Parse the type-id. */
7464 parser->type_definition_forbidden_message
7469 /* Look for the closing `)'. */
7472 /* There should not be a direct-new-declarator in this production,
7473 but GCC used to allowed this, so we check and emit a sensible error
7474 message for this case. */
7476 {
7482 }
7483 }
7484 /* Otherwise, there must be a new-type-id. */
7485 else
7488 /* If the next token is a `(' or '{', then we have a new-initializer. */
7492 else
7495 /* A new-expression may not appear in an integral constant
7496 expression. */
7499 else
7500 {
7501 /* Create a representation of the new-expression. */
7503 tf_warning_or_error);
7504 }
7512 }
7514 /* Parse a new-placement.
7516 new-placement:
7517 ( expression-list )
7519 Returns the same representation as for an expression-list. */
7523 {
7526 /* Parse the expression-list. */
7527 expression_list = (cp_parser_parenthesized_expression_list
7533 }
7535 /* Parse a new-type-id.
7537 new-type-id:
7538 type-specifier-seq new-declarator [opt]
7540 Returns the TYPE allocated. If the new-type-id indicates an array
7541 type, *NELTS is set to the number of elements in the last array
7542 bound; the TYPE will not include the last array bound. */
7544 static tree
7546 {
7547 cp_decl_specifier_seq type_specifier_seq;
7553 /* The type-specifier sequence must not contain type definitions.
7554 (It cannot contain declarations of new types either, but if they
7555 are not definitions we will catch that because they are not
7556 complete.) */
7558 parser->type_definition_forbidden_message
7560 /* Parse the type-specifier-seq. */
7564 /* Restore the old message. */
7570 /* Parse the new-declarator. */
7573 /* Determine the number of elements in the last array dimension, if
7574 any. */
7576 /* Skip down to the last array dimension. */
7581 {
7584 }
7589 {
7592 }
7595 {
7602 else
7604 }
7607 }
7609 /* Parse an (optional) new-declarator.
7611 new-declarator:
7612 ptr-operator new-declarator [opt]
7613 direct-new-declarator
7615 Returns the declarator. */
7619 {
7622 cp_cv_quals cv_quals;
7624 /* We don't know if there's a ptr-operator next, or not. */
7626 /* Look for a ptr-operator. */
7628 /* If that worked, look for more new-declarators. */
7630 {
7633 /* Parse another optional declarator. */
7636 declarator = cp_parser_make_indirect_declarator
7640 }
7642 /* If the next token is a `[', there is a direct-new-declarator. */
7647 }
7649 /* Parse a direct-new-declarator.
7651 direct-new-declarator:
7652 [ expression ]
7653 direct-new-declarator [constant-expression]
7655 */
7659 {
7663 {
7664 tree expression;
7667 /* Look for the opening `['. */
7672 /* The standard requires that the expression have integral
7673 type. DR 74 adds enumeration types. We believe that the
7674 real intent is that these expressions be handled like the
7675 expression in a `switch' condition, which also allows
7676 classes with a single conversion to integral or
7677 enumeration type. */
7679 {
7680 expression
7682 expression,
7685 {
7687 "expression in new-declarator must have integral "
7690 }
7691 }
7693 /* Look for the closing `]'. */
7696 /* Add this bound to the declarator. */
7699 /* If the next token is not a `[', then there are no more
7700 bounds. */
7703 }
7706 }
7708 /* Parse a new-initializer.
7710 new-initializer:
7711 ( expression-list [opt] )
7712 braced-init-list
7714 Returns a representation of the expression-list. */
7718 {
7722 {
7723 tree t;
7730 }
7731 else
7732 expression_list = (cp_parser_parenthesized_expression_list
7738 }
7740 /* Parse a delete-expression.
7742 delete-expression:
7743 :: [opt] delete cast-expression
7744 :: [opt] delete [ ] cast-expression
7746 Returns a representation of the expression. */
7748 static tree
7750 {
7753 tree expression;
7755 /* Look for the optional `::' operator. */
7756 global_scope_p
7760 /* Look for the `delete' keyword. */
7762 /* See if the array syntax is in use. */
7764 {
7765 /* Consume the `[' token. */
7767 /* Look for the `]' token. */
7769 /* Remember that this is the `[]' construct. */
7771 }
7772 else
7775 /* Parse the cast-expression. */
7778 /* A delete-expression may not appear in an integral constant
7779 expression. */
7784 tf_warning_or_error);
7785 }
7787 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7788 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7789 0 otherwise. */
7791 static int
7793 {
7796 {
7838 /* In ((type ()) () the last () isn't a valid cast-expression,
7839 so the whole must be parsed as postfix-expression. */
7844 /* '[' may start a primary-expression in obj-c++ and in C++11,
7845 as a lambda-expression, eg, '(void)[]{}'. */
7852 /* '++' and '--' may or may not start a cast-expression:
7854 struct T { void operator++(int); };
7855 void f() { (T())++; }
7857 vs
7859 int a;
7860 (int)++a; */
7865 }
7866 }
7868 /* Parse a cast-expression.
7870 cast-expression:
7871 unary-expression
7872 ( type-id ) cast-expression
7874 ADDRESS_P is true iff the unary-expression is appearing as the
7875 operand of the `&' operator. CAST_P is true if this expression is
7876 the target of a cast.
7878 Returns a representation of the expression. */
7880 static tree
7883 {
7884 /* If it's a `(', then we might be looking at a cast. */
7886 {
7892 /* There's no way to know yet whether or not this is a cast.
7893 For example, `(int (3))' is a unary-expression, while `(int)
7894 3' is a cast. So, we resort to parsing tentatively. */
7896 /* Types may not be defined in a cast. */
7898 parser->type_definition_forbidden_message
7900 /* Consume the `('. */
7902 /* A very tricky bit is that `(struct S) { 3 }' is a
7903 compound-literal (which we permit in C++ as an extension).
7904 But, that construct is not a cast-expression -- it is a
7905 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7906 is legal; if the compound-literal were a cast-expression,
7907 you'd need an extra set of parentheses.) But, if we parse
7908 the type-id, and it happens to be a class-specifier, then we
7909 will commit to the parse at that point, because we cannot
7910 undo the action that is done when creating a new class. So,
7911 then we cannot back up and do a postfix-expression.
7913 Another tricky case is the following (c++/29234):
7915 struct S { void operator () (); };
7917 void foo ()
7918 {
7919 ( S()() );
7920 }
7922 As a type-id we parse the parenthesized S()() as a function
7923 returning a function, groktypename complains and we cannot
7924 back up in this case either.
7926 Therefore, we scan ahead to the closing `)', and check to see
7927 if the tokens after the `)' can start a cast-expression. Otherwise
7928 we are dealing with an unary-expression, a postfix-expression
7929 or something else.
7931 Yet another tricky case, in C++11, is the following (c++/54891):
7933 (void)[]{};
7935 The issue is that usually, besides the case of lambda-expressions,
7936 the parenthesized type-id cannot be followed by '[', and, eg, we
7937 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7938 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7939 we don't commit, we try a cast-expression, then an unary-expression.
7941 Save tokens so that we can put them back. */
7944 /* We may be looking at a cast-expression. */
7947 cast_expression
7950 /* Roll back the tokens we skipped. */
7952 /* If we aren't looking at a cast-expression, simulate an error so
7953 that the call to cp_parser_error_occurred below returns true. */
7956 else
7957 {
7960 /* Look for the type-id. */
7962 /* Look for the closing `)'. */
7965 }
7967 /* Restore the saved message. */
7970 /* At this point this can only be either a cast or a
7971 parenthesized ctor such as `(T ())' that looks like a cast to
7972 function returning T. */
7974 {
7975 /* Only commit if the cast-expression doesn't start with
7976 '++', '--', or '[' in C++11. */
7984 pidk);
7987 {
7988 /* Warn about old-style casts, if so requested. */
7995 /* Only type conversions to integral or enumeration types
7996 can be used in constant-expressions. */
7999 NIC_CAST))
8002 /* Perform the cast. */
8005 }
8006 }
8007 else
8009 }
8011 /* If we get here, then it's not a cast, so it must be a
8012 unary-expression. */
8015 }
8017 /* Parse a binary expression of the general form:
8019 pm-expression:
8020 cast-expression
8021 pm-expression .* cast-expression
8022 pm-expression ->* cast-expression
8024 multiplicative-expression:
8025 pm-expression
8026 multiplicative-expression * pm-expression
8027 multiplicative-expression / pm-expression
8028 multiplicative-expression % pm-expression
8030 additive-expression:
8031 multiplicative-expression
8032 additive-expression + multiplicative-expression
8033 additive-expression - multiplicative-expression
8035 shift-expression:
8036 additive-expression
8037 shift-expression << additive-expression
8038 shift-expression >> additive-expression
8040 relational-expression:
8041 shift-expression
8042 relational-expression < shift-expression
8043 relational-expression > shift-expression
8044 relational-expression <= shift-expression
8045 relational-expression >= shift-expression
8047 GNU Extension:
8049 relational-expression:
8050 relational-expression <? shift-expression
8051 relational-expression >? shift-expression
8053 equality-expression:
8054 relational-expression
8055 equality-expression == relational-expression
8056 equality-expression != relational-expression
8058 and-expression:
8059 equality-expression
8060 and-expression & equality-expression
8062 exclusive-or-expression:
8063 and-expression
8064 exclusive-or-expression ^ and-expression
8066 inclusive-or-expression:
8067 exclusive-or-expression
8068 inclusive-or-expression | exclusive-or-expression
8070 logical-and-expression:
8071 inclusive-or-expression
8072 logical-and-expression && inclusive-or-expression
8074 logical-or-expression:
8075 logical-and-expression
8076 logical-or-expression || logical-and-expression
8078 All these are implemented with a single function like:
8080 binary-expression:
8081 simple-cast-expression
8082 binary-expression <token> binary-expression
8084 CAST_P is true if this expression is the target of a cast.
8086 The binops_by_token map is used to get the tree codes for each <token> type.
8087 binary-expressions are associated according to a precedence table. */
8089 #define TOKEN_PRECEDENCE(token) \
8090 (((token->type == CPP_GREATER \
8091 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8092 && !parser->greater_than_is_operator_p) \
8093 ? PREC_NOT_OPERATOR \
8094 : binops_by_token[token->type].prec)
8096 static tree
8102 {
8103 cp_parser_expression_stack stack;
8105 cp_parser_expression_stack_entry current;
8106 tree rhs;
8110 tree overload;
8112 /* Parse the first expression. */
8123 {
8124 /* Get an operator token. */
8130 {
8132 "%<>>%> operator is treated"
8136 }
8140 /* Popping an entry off the stack means we completed a subexpression:
8141 - either we found a token which is not an operator (`>' where it is not
8142 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8143 will happen repeatedly;
8144 - or, we found an operator which has lower priority. This is the case
8145 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8146 parsing `3 * 4'. */
8148 {
8151 else
8153 }
8155 get_rhs:
8159 /* We used the operator token. */
8162 /* For "false && x" or "true || x", x will never be executed;
8163 disable warnings while evaluating it. */
8169 /* Extract another operand. It may be the RHS of this expression
8170 or the LHS of a new, higher priority expression. */
8175 /* Get another operator token. Look up its precedence to avoid
8176 building a useless (immediately popped) stack entry for common
8177 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8181 {
8182 /* ... and prepare to parse the RHS of the new, higher priority
8183 expression. Since precedence levels on the stack are
8184 monotonically increasing, we do not have to care about
8185 stack overflows. */
8194 pop:
8196 /* If the stack is not empty, we have parsed into LHS the right side
8197 (`4' in the example above) of an expression we had suspended.
8198 We can use the information on the stack to recover the LHS (`3')
8199 from the stack together with the tree code (`MULT_EXPR'), and
8200 the precedence of the higher level subexpression
8201 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8202 which will be used to actually build the additive expression. */
8207 }
8209 /* Undo the disabling of warnings done above. */
8220 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8221 ERROR_MARK for everything that is not a binary expression.
8222 This makes warn_about_parentheses miss some warnings that
8223 involve unary operators. For unary expressions we should
8224 pass the correct tree_code unless the unary expression was
8225 surrounded by parentheses.
8226 */
8232 == tcc_comparison
8235 else
8244 /* If the binary operator required the use of an overloaded operator,
8245 then this expression cannot be an integral constant-expression.
8246 An overloaded operator can be used even if both operands are
8247 otherwise permissible in an integral constant-expression if at
8248 least one of the operands is of enumeration type. */
8252 NIC_OVERLOADED))
8254 }
8257 }
8259 static tree
8264 {
8267 }
8269 /* Parse the `? expression : assignment-expression' part of a
8270 conditional-expression. The LOGICAL_OR_EXPR is the
8271 logical-or-expression that started the conditional-expression.
8272 Returns a representation of the entire conditional-expression.
8274 This routine is used by cp_parser_assignment_expression.
8276 ? expression : assignment-expression
8278 GNU Extensions:
8280 ? : assignment-expression */
8282 static tree
8284 {
8285 tree expr;
8286 tree assignment_expr;
8290 /* Consume the `?' token. */
8295 {
8298 /* Implicit true clause. */
8302 }
8303 else
8304 {
8307 /* Parse the expression. */
8310 c_inhibit_evaluation_warnings +=
8314 }
8316 /* The next token should be a `:'. */
8318 /* Parse the assignment-expression. */
8322 /* Build the conditional-expression. */
8324 expr,
8325 assignment_expr,
8326 tf_warning_or_error);
8327 }
8329 /* Parse an assignment-expression.
8331 assignment-expression:
8332 conditional-expression
8333 logical-or-expression assignment-operator assignment_expression
8334 throw-expression
8336 CAST_P is true if this expression is the target of a cast.
8337 DECLTYPE_P is true if this expression is the operand of decltype.
8339 Returns a representation for the expression. */
8341 static tree
8344 {
8345 tree expr;
8347 /* If the next token is the `throw' keyword, then we're looking at
8348 a throw-expression. */
8351 /* Otherwise, it must be that we are looking at a
8352 logical-or-expression. */
8353 else
8354 {
8355 /* Parse the binary expressions (logical-or-expression). */
8357 decltype_p,
8359 /* If the next token is a `?' then we're actually looking at a
8360 conditional-expression. */
8363 else
8364 {
8367 /* If it's an assignment-operator, we're using the second
8368 production. */
8369 enum tree_code assignment_operator
8372 {
8374 location_t saved_input_location;
8376 /* Parse the right-hand side of the assignment. */
8382 /* An assignment may not appear in a
8383 constant-expression. */
8385 NIC_ASSIGNMENT))
8387 /* Build the assignment expression. Its default
8388 location is the location of the '=' token. */
8392 assignment_operator,
8393 rhs,
8396 }
8397 }
8398 }
8401 }
8403 /* Parse an (optional) assignment-operator.
8405 assignment-operator: one of
8406 = *= /= %= += -= >>= <<= &= ^= |=
8408 GNU Extension:
8410 assignment-operator: one of
8411 <?= >?=
8413 If the next token is an assignment operator, the corresponding tree
8414 code is returned, and the token is consumed. For example, for
8415 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8416 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8417 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8418 operator, ERROR_MARK is returned. */
8420 static enum tree_code
8422 {
8426 /* Peek at the next token. */
8430 {
8476 /* Nothing else is an assignment operator. */
8478 }
8480 /* If it was an assignment operator, consume it. */
8485 }
8487 /* Parse an expression.
8489 expression:
8490 assignment-expression
8491 expression , assignment-expression
8493 CAST_P is true if this expression is the target of a cast.
8494 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8495 except possibly parenthesized or on the RHS of a comma (N3276).
8497 Returns a representation of the expression. */
8499 static tree
8502 {
8507 {
8508 tree assignment_expression;
8510 /* Parse the next assignment-expression. */
8511 assignment_expression
8514 /* We don't create a temporary for a call that is the immediate operand
8515 of decltype or on the RHS of a comma. But when we see a comma, we
8516 need to create a temporary for a call on the LHS. */
8521 assignment_expression
8525 /* If this is the first assignment-expression, we can just
8526 save it away. */
8529 else
8531 assignment_expression,
8533 /* If the next token is not a comma, then we are done with the
8534 expression. */
8537 /* Consume the `,'. */
8540 /* A comma operator cannot appear in a constant-expression. */
8543 }
8546 }
8548 /* Parse a constant-expression.
8550 constant-expression:
8551 conditional-expression
8553 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8554 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8555 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8556 is false, NON_CONSTANT_P should be NULL. */
8558 static tree
8562 {
8566 tree expression;
8568 /* It might seem that we could simply parse the
8569 conditional-expression, and then check to see if it were
8570 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8571 one that the compiler can figure out is constant, possibly after
8572 doing some simplifications or optimizations. The standard has a
8573 precise definition of constant-expression, and we must honor
8574 that, even though it is somewhat more restrictive.
8576 For example:
8578 int i[(2, 3)];
8580 is not a legal declaration, because `(2, 3)' is not a
8581 constant-expression. The `,' operator is forbidden in a
8582 constant-expression. However, GCC's constant-folding machinery
8583 will fold this operation to an INTEGER_CST for `3'. */
8585 /* Save the old settings. */
8587 saved_allow_non_integral_constant_expression_p
8590 /* We are now parsing a constant-expression. */
8592 parser->allow_non_integral_constant_expression_p
8595 /* Although the grammar says "conditional-expression", we parse an
8596 "assignment-expression", which also permits "throw-expression"
8597 and the use of assignment operators. In the case that
8598 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8599 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8600 actually essential that we look for an assignment-expression.
8601 For example, cp_parser_initializer_clauses uses this function to
8602 determine whether a particular assignment-expression is in fact
8603 constant. */
8605 /* Restore the old settings. */
8606 parser->integral_constant_expression_p
8608 parser->allow_non_integral_constant_expression_p
8611 {
8612 /* Require an rvalue constant expression here; that's what our
8613 callers expect. Reference constant expressions are handled
8614 separately in e.g. cp_parser_template_argument. */
8619 }
8622 parser->non_integral_constant_expression_p
8626 }
8628 /* Parse __builtin_offsetof.
8630 offsetof-expression:
8631 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8633 offsetof-member-designator:
8634 id-expression
8635 | offsetof-member-designator "." id-expression
8636 | offsetof-member-designator "[" expression "]"
8637 | offsetof-member-designator "->" id-expression */
8639 static tree
8641 {
8644 cp_id_kind dummy;
8647 /* We're about to accept non-integral-constant things, but will
8648 definitely yield an integral constant expression. Save and
8649 restore these values around our local parsing. */
8653 /* Consume the "__builtin_offsetof" token. */
8655 /* Consume the opening `('. */
8657 /* Parse the type-id. */
8660 /* Look for the `,'. */
8664 /* Build the (type *)null that begins the traditional offsetof macro. */
8666 tf_warning_or_error);
8668 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8672 {
8675 {
8677 /* offsetof-member-designator "[" expression "]" */
8683 /* offsetof-member-designator "->" identifier */
8686 /* FALLTHRU */
8689 /* offsetof-member-designator "." identifier */
8697 /* Consume the ")" token. */
8702 /* Error. We know the following require will fail, but
8703 that gives the proper error message. */
8708 }
8709 }
8711 success:
8712 /* If we're processing a template, we can't finish the semantics yet.
8713 Otherwise we can fold the entire expression now. */
8715 {
8718 }
8719 else
8722 failure:
8727 }
8729 /* Parse a trait expression.
8731 Returns a representation of the expression, the underlying type
8732 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8734 static tree
8736 {
8737 cp_trait_kind kind;
8743 {
8827 }
8829 /* Consume the token. */
8840 {
8847 }
8849 {
8851 {
8855 {
8858 }
8862 }
8863 }
8867 /* Complete the trait expression, which may mean either processing
8868 the trait expr now or saving it for template instantiation. */
8870 {
8879 }
8880 }
8882 /* Lambdas that appear in variable initializer or default argument scope
8883 get that in their mangling, so we need to record it. We might as well
8884 use the count for function and namespace scopes as well. */
8888 {
8889 tree t;
8894 static void
8896 {
8897 tree_int ti;
8899 /* Once we're inside a function, we ignore other scopes and just push
8900 the function again so that popping works properly. */
8907 {
8908 /* Don't reset the count if we're still in the same function. */
8911 }
8912 }
8914 static void
8916 {
8919 }
8921 static void
8923 {
8926 {
8929 }
8931 }
8933 /* Parse a lambda expression.
8935 lambda-expression:
8936 lambda-introducer lambda-declarator [opt] compound-statement
8938 Returns a representation of the expression. */
8940 static tree
8942 {
8944 tree type;
8952 {
8954 {
8958 }
8960 }
8962 {
8964 {
8967 }
8969 }
8971 /* We may be in the middle of deferred access check. Disable
8972 it now. */
8983 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8986 /* Now that we've started the type, add the capture fields for any
8987 explicit captures. */
8990 {
8991 /* Inside the class, surrounding template-parameter-lists do not apply. */
8992 unsigned int saved_num_template_parameter_lists
8996 bool fully_implicit_function_template_p
9000 bool auto_is_implicit_function_template_parm_p
9011 /* By virtue of defining a local class, a lambda expression has access to
9012 the private variables of enclosing classes. */
9017 {
9023 }
9025 {
9028 }
9030 /* The capture list was built up in reverse order; fix that now. */
9042 parser->fully_implicit_function_template_p
9046 parser->auto_is_implicit_function_template_parm_p
9048 }
9052 /* This field is only used during parsing of the lambda. */
9055 /* This lambda shouldn't have any proxies left at this point. */
9057 /* And now that we're done, push proxies for an enclosing lambda. */
9062 else
9068 }
9070 /* Parse the beginning of a lambda expression.
9072 lambda-introducer:
9073 [ lambda-capture [opt] ]
9075 LAMBDA_EXPR is the current representation of the lambda expression. */
9077 static void
9079 {
9080 /* Need commas after the first capture. */
9083 /* Eat the leading `['. */
9086 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9094 {
9097 }
9100 {
9102 tree capture_id;
9103 tree capture_init_expr;
9107 enum capture_kind_type
9108 {
9109 BY_COPY,
9110 BY_REFERENCE
9111 };
9115 {
9118 }
9122 else
9125 /* Possibly capture `this'. */
9127 {
9137 explicit_init_p);
9139 }
9141 /* Remember whether we want to capture as a reference or not. */
9143 {
9146 }
9148 /* Get the identifier. */
9153 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9154 delimiters, but I modified this to stop on unnested ']' as well. It
9155 was already changed to stop on unnested '}', so the
9156 "closing_parenthesis" name is no more misleading with my change. */
9157 {
9163 }
9165 /* Find the initializer for this capture. */
9169 {
9171 /* An explicit initializer exists. */
9174 "lambda capture initializers "
9180 {
9183 }
9184 }
9185 else
9186 {
9189 /* Turn the identifier into an id-expression. */
9190 capture_init_expr
9195 {
9198 }
9202 {
9205 capture_init_expr);
9208 }
9211 {
9214 capture_init_expr))
9217 }
9219 capture_init_expr
9220 = finish_id_expression
9222 capture_init_expr,
9236 {
9239 }
9240 else
9242 }
9246 {
9251 capture_id);
9255 "capture of %qD redundant with by-reference capture "
9257 }
9260 capture_id,
9261 capture_init_expr,
9263 explicit_init_p);
9264 }
9267 }
9269 /* Parse the (optional) middle of a lambda expression.
9271 lambda-declarator:
9272 < template-parameter-list [opt] >
9273 ( parameter-declaration-clause [opt] )
9274 attribute-specifier [opt]
9275 mutable [opt]
9276 exception-specification [opt]
9277 lambda-return-type-clause [opt]
9279 LAMBDA_EXPR is the current representation of the lambda expression. */
9281 static bool
9283 {
9284 /* 5.1.1.4 of the standard says:
9285 If a lambda-expression does not include a lambda-declarator, it is as if
9286 the lambda-declarator were ().
9287 This means an empty parameter list, no attributes, and no exception
9288 specification. */
9294 /* The template-parameter-list is optional, but must begin with
9295 an opening angle if present. */
9297 {
9300 "lambda templates are only available with "
9309 /* We just processed one more parameter list. */
9311 }
9313 /* The parameter-declaration-clause is optional (unless
9314 template-parameter-list was given), but must begin with an
9315 opening parenthesis if present. */
9317 {
9322 /* Parse parameters. */
9325 /* Default arguments shall not be specified in the
9326 parameter-declaration-clause of a lambda-declarator. */
9336 /* Parse optional `mutable' keyword. */
9338 {
9341 }
9343 /* Parse optional exception specification. */
9346 /* Parse optional trailing return type. */
9348 {
9352 }
9354 /* The function parameters must be in scope all the way until after the
9355 trailing-return-type in case of decltype. */
9357 }
9361 /* Create the function call operator.
9363 Messing with declarators like this is no uglier than building up the
9364 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9365 other code. */
9366 {
9367 cp_decl_specifier_seq return_type_specs;
9369 tree fco;
9376 else
9377 /* Maybe we will deduce the return type later. */
9383 sfk_none);
9388 VIRT_SPEC_UNSPECIFIED,
9389 REF_QUAL_NONE,
9390 exception_spec,
9395 declarator,
9396 attributes);
9398 {
9401 /* Give the object parameter a different name. */
9405 }
9407 {
9411 }
9420 }
9421 }
9423 /* Parse the body of a lambda expression, which is simply
9425 compound-statement
9427 but which requires special handling.
9428 LAMBDA_EXPR is the current representation of the lambda expression. */
9430 static void
9432 {
9437 else
9438 /* Still increment function_depth so that we don't GC in the
9439 middle of an expression. */
9441 /* Clear this in case we're in the middle of a default argument. */
9444 /* Finish the function call operator
9445 - class_specifier
9446 + late_parsing_for_member
9447 + function_definition_after_declarator
9448 + ctor_initializer_opt_and_function_body */
9449 {
9451 tree body;
9453 tree compound_stmt;
9454 tree cap;
9456 /* Let the front end know that we are going to be defining this
9457 function. */
9459 NULL_TREE,
9468 /* Push the proxies for any explicit captures. */
9475 /* 5.1.1.4 of the standard says:
9476 If a lambda-expression does not include a trailing-return-type, it
9477 is as if the trailing-return-type denotes the following type:
9478 * if the compound-statement is of the form
9479 { return attribute-specifier [opt] expression ; }
9480 the type of the returned expression after lvalue-to-rvalue
9481 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9482 (_conv.array_ 4.2), and function-to-pointer conversion
9483 (_conv.func_ 4.3);
9484 * otherwise, void. */
9486 /* In a lambda that has neither a lambda-return-type-clause
9487 nor a deducible form, errors should be reported for return statements
9488 in the body. Since we used void as the placeholder return type, parsing
9489 the body as usual will give such desired behavior. */
9493 {
9497 /* Parse tentatively in case there's more after the initial return
9498 statement. */
9509 {
9513 /* Will get error here if type not deduced yet. */
9517 }
9518 }
9521 {
9526 }
9530 out:
9534 /* Finish the function and generate code for it if necessary. */
9537 /* Only expand if the call op is not a template. */
9540 }
9545 else
9547 }
9549 /* Statements [gram.stmt.stmt] */
9551 /* Parse a statement.
9553 statement:
9554 labeled-statement
9555 expression-statement
9556 compound-statement
9557 selection-statement
9558 iteration-statement
9559 jump-statement
9560 declaration-statement
9561 try-block
9563 C++11:
9565 statement:
9566 labeled-statement
9567 attribute-specifier-seq (opt) expression-statement
9568 attribute-specifier-seq (opt) compound-statement
9569 attribute-specifier-seq (opt) selection-statement
9570 attribute-specifier-seq (opt) iteration-statement
9571 attribute-specifier-seq (opt) jump-statement
9572 declaration-statement
9573 attribute-specifier-seq (opt) try-block
9575 TM Extension:
9577 statement:
9578 atomic-statement
9580 IN_COMPOUND is true when the statement is nested inside a
9581 cp_parser_compound_statement; this matters for certain pragmas.
9583 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9584 is a (possibly labeled) if statement which is not enclosed in braces
9585 and has an else clause. This is used to implement -Wparentheses. */
9587 static void
9590 {
9595 restart:
9598 /* There is no statement yet. */
9604 /* In obj-c++, seeing '[[' might be the either the beginning of
9605 c++11 attributes, or a nested objc-message-expression. So
9606 let's parse the c++11 attributes tentatively. */
9610 {
9613 }
9615 /* Peek at the next token. */
9617 /* Remember the location of the first token in the statement. */
9619 /* If this is a keyword, then that will often determine what kind of
9620 statement we have. */
9622 {
9626 {
9629 /* Looks like a labeled-statement with a case label.
9630 Parse the label, and then use tail recursion to parse
9631 the statement. */
9648 {
9653 }
9654 else
9668 {
9673 }
9674 else
9675 {
9679 }
9683 /* Objective-C++ exception-handling constructs. */
9697 /* This must be a namespace alias definition. */
9710 /* It might be a keyword like `int' that can start a
9711 declaration-statement. */
9713 }
9714 }
9716 {
9717 /* If the next token is a `:', then we are looking at a
9718 labeled-statement. */
9721 {
9722 /* Looks like a labeled-statement with an ordinary label.
9723 Parse the label, and then use tail recursion to parse
9724 the statement. */
9728 }
9729 }
9730 /* Anything that starts with a `{' must be a compound-statement. */
9733 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9734 a statement all its own. */
9736 {
9737 /* Only certain OpenMP pragmas are attached to statements, and thus
9738 are considered statements themselves. All others are not. In
9739 the context of a compound, accept the pragma as a "statement" and
9740 return so that we can check for a close brace. Otherwise we
9741 require a real statement and must go back and read one. */
9747 }
9749 {
9752 }
9754 /* Everything else must be a declaration-statement or an
9755 expression-statement. Try for the declaration-statement
9756 first, unless we are looking at a `;', in which case we know that
9757 we have an expression-statement. */
9759 {
9761 {
9763 {
9764 /* Attributes should be parsed as part of the the
9765 declaration, so let's un-parse them. */
9768 }
9771 /* Try to parse the declaration-statement. */
9773 /* If that worked, we're done. */
9776 }
9777 /* Look for an expression-statement instead. */
9779 }
9781 /* Set the line number for the statement. */
9785 /* Note that for now, we don't do anything with c++11 statements
9786 parsed at this level. */
9789 OPT_Wattributes,
9791 }
9793 /* Parse the label for a labeled-statement, i.e.
9795 identifier :
9796 case constant-expression :
9797 default :
9799 GNU Extension:
9800 case constant-expression ... constant-expression : statement
9802 When a label is parsed without errors, the label is added to the
9803 parse tree by the finish_* functions, so this function doesn't
9804 have to return the label. */
9806 static void
9808 {
9813 /* The next token should be an identifier. */
9817 {
9820 }
9824 {
9826 {
9830 /* Consume the `case' token. */
9832 /* Parse the constant-expression. */
9837 {
9838 /* Consume the `...' token. */
9840 expr_hi =
9843 /* We don't need to emit warnings here, as the common code
9844 will do this for us. */
9845 }
9846 else
9851 else
9854 expr);
9855 }
9859 /* Consume the `default' token. */
9864 else
9869 /* Anything else must be an ordinary label. */
9872 }
9874 /* Require the `:' token. */
9877 /* An ordinary label may optionally be followed by attributes.
9878 However, this is only permitted if the attributes are then
9879 followed by a semicolon. This is because, for backward
9880 compatibility, when parsing
9881 lab: __attribute__ ((unused)) int i;
9882 we want the attribute to attach to "i", not "lab". */
9885 {
9886 tree attrs;
9893 ;
9894 else
9896 }
9902 }
9904 /* Parse an expression-statement.
9906 expression-statement:
9907 expression [opt] ;
9909 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9910 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9911 indicates whether this expression-statement is part of an
9912 expression statement. */
9914 static tree
9916 {
9920 /* If the next token is a ';', then there is no expression
9921 statement. */
9923 {
9927 {
9930 }
9931 }
9933 /* Give a helpful message for "A<T>::type t;" and the like. */
9936 {
9943 {
9944 /* A::A a; */
9949 }
9950 }
9952 /* Consume the final `;'. */
9957 /* This is the final expression statement of a statement
9958 expression. */
9964 }
9966 /* Parse a compound-statement.
9968 compound-statement:
9969 { statement-seq [opt] }
9971 GNU extension:
9973 compound-statement:
9974 { label-declaration-seq [opt] statement-seq [opt] }
9976 label-declaration-seq:
9977 label-declaration
9978 label-declaration-seq label-declaration
9980 Returns a tree representing the statement. */
9982 static tree
9985 {
9986 tree compound_stmt;
9988 /* Consume the `{'. */
9995 /* Begin the compound-statement. */
9997 /* If the next keyword is `__label__' we have a label declaration. */
10000 /* Parse an (optional) statement-seq. */
10002 /* Finish the compound-statement. */
10004 /* Consume the `}'. */
10008 }
10010 /* Parse an (optional) statement-seq.
10012 statement-seq:
10013 statement
10014 statement-seq [opt] statement */
10016 static void
10018 {
10019 /* Scan statements until there aren't any more. */
10021 {
10024 /* If we are looking at a `}', then we have run out of
10025 statements; the same is true if we have reached the end
10026 of file, or have stumbled upon a stray '@end'. */
10033 /* If we are in a compound statement and find 'else' then
10034 something went wrong. */
10036 {
10039 else
10040 {
10043 }
10044 }
10046 /* Parse the statement. */
10048 }
10049 }
10051 /* Parse a selection-statement.
10053 selection-statement:
10054 if ( condition ) statement
10055 if ( condition ) statement else statement
10056 switch ( condition ) statement
10058 Returns the new IF_STMT or SWITCH_STMT.
10060 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10061 is a (possibly labeled) if statement which is not enclosed in
10062 braces and has an else clause. This is used to implement
10063 -Wparentheses. */
10065 static tree
10067 {
10074 /* Peek at the next token. */
10077 /* See what kind of keyword it is. */
10080 {
10083 {
10084 tree statement;
10085 tree condition;
10087 /* Look for the `('. */
10089 {
10092 }
10094 /* Begin the selection-statement. */
10097 else
10100 /* Parse the condition. */
10102 /* Look for the `)'. */
10108 {
10112 /* Add the condition. */
10115 /* Parse the then-clause. */
10119 {
10127 }
10128 else
10134 /* If the next token is `else', parse the else-clause. */
10136 RID_ELSE))
10137 {
10138 /* Consume the `else' keyword. */
10141 /* Parse the else-clause. */
10143 {
10144 location_t loc;
10151 }
10152 else
10157 /* If we are currently parsing a then-clause, then
10158 IF_P will not be NULL. We set it to true to
10159 indicate that this if statement has an else clause.
10160 This may trigger the Wparentheses warning below
10161 when we get back up to the parent if statement. */
10164 }
10165 else
10166 {
10167 /* This if statement does not have an else clause. If
10168 NESTED_IF is true, then the then-clause is an if
10169 statement which does have an else clause. We warn
10170 about the potential ambiguity. */
10173 "suggest explicit braces to avoid ambiguous"
10175 }
10177 /* Now we're all done with the if-statement. */
10179 }
10180 else
10181 {
10185 /* Add the condition. */
10188 /* Parse the body of the switch-statement. */
10197 /* Now we're all done with the switch-statement. */
10199 }
10202 }
10208 }
10209 }
10211 /* Parse a condition.
10213 condition:
10214 expression
10215 type-specifier-seq declarator = initializer-clause
10216 type-specifier-seq declarator braced-init-list
10218 GNU Extension:
10220 condition:
10221 type-specifier-seq declarator asm-specification [opt]
10222 attributes [opt] = assignment-expression
10224 Returns the expression that should be tested. */
10226 static tree
10228 {
10229 cp_decl_specifier_seq type_specifiers;
10233 /* Try the declaration first. */
10235 /* New types are not allowed in the type-specifier-seq for a
10236 condition. */
10238 parser->type_definition_forbidden_message
10240 /* Parse the type-specifier-seq. */
10242 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10245 /* Restore the saved message. */
10247 /* If all is well, we might be looking at a declaration. */
10249 {
10250 tree decl;
10251 tree asm_specification;
10252 tree attributes;
10256 /* Parse the declarator. */
10262 /* Parse the attributes. */
10264 /* Parse the asm-specification. */
10266 /* If the next token is not an `=' or '{', then we might still be
10267 looking at an expression. For example:
10269 if (A(a).x)
10271 looks like a decl-specifier-seq and a declarator -- but then
10272 there is no `=', so this is an expression. */
10277 /* If we did see an `=' or '{', then we are looking at a declaration
10278 for sure. */
10280 {
10281 tree pushed_scope;
10285 /* Create the declaration. */
10291 /* Parse the initializer. */
10293 {
10297 }
10298 else
10299 {
10300 /* Consume the `='. */
10303 }
10307 /* Process the initializer. */
10310 asm_specification,
10311 flags);
10317 }
10318 }
10319 /* If we didn't even get past the declarator successfully, we are
10320 definitely not looking at a declaration. */
10321 else
10324 /* Otherwise, we are looking at an expression. */
10326 }
10328 /* Parses a for-statement or range-for-statement until the closing ')',
10329 not included. */
10331 static tree
10333 {
10337 /* Begin the for-statement. */
10340 /* Parse the initialization. */
10345 else
10347 }
10349 static tree
10351 {
10352 /* Normal for loop */
10355 tree stmt;
10358 /* The for-init-statement has already been parsed in
10359 cp_parser_for_init_statement, so no work is needed here. */
10362 /* If there's a condition, process it. */
10366 {
10370 }
10372 /* Look for the `;'. */
10375 /* If there's an expression, process it. */
10381 }
10383 /* Tries to parse a range-based for-statement:
10385 range-based-for:
10386 decl-specifier-seq declarator : expression
10388 The decl-specifier-seq declarator and the `:' are already parsed by
10389 cp_parser_for_init_statement. If processing_template_decl it returns a
10390 newly created RANGE_FOR_STMT; if not, it is converted to a
10391 regular FOR_STMT. */
10393 static tree
10396 {
10400 {
10403 }
10404 else
10407 /* If in template, STMT is converted to a normal for-statement
10408 at instantiation. If not, it is done just ahead. */
10410 {
10418 /* do_auto_deduction doesn't mess with template init-lists. */
10421 }
10422 else
10423 {
10426 }
10428 }
10430 /* Subroutine of cp_convert_range_for: given the initializer expression,
10431 builds up the range temporary. */
10433 static tree
10435 {
10438 /* Find out the type deduced by the declaration
10439 `auto &&__range = range_expr'. */
10444 /* Create the __range variable. */
10451 }
10453 /* Used by cp_parser_range_for in template context: we aren't going to
10454 do a full conversion yet, but we still need to resolve auto in the
10455 type of the for-range-declaration if present. This is basically
10456 a shortcut version of cp_convert_range_for. */
10458 static void
10460 {
10463 {
10466 iter_type = (cp_parser_perform_range_for_lookup
10469 {
10471 iter_type);
10473 tf_warning_or_error);
10476 }
10477 }
10478 }
10480 /* Converts a range-based for-statement into a normal
10481 for-statement, as per the definition.
10483 for (RANGE_DECL : RANGE_EXPR)
10484 BLOCK
10486 should be equivalent to:
10488 {
10489 auto &&__range = RANGE_EXPR;
10490 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10491 __begin != __end;
10492 ++__begin)
10493 {
10494 RANGE_DECL = *__begin;
10495 BLOCK
10496 }
10497 }
10499 If RANGE_EXPR is an array:
10500 BEGIN_EXPR = __range
10501 END_EXPR = __range + ARRAY_SIZE(__range)
10502 Else if RANGE_EXPR has a member 'begin' or 'end':
10503 BEGIN_EXPR = __range.begin()
10504 END_EXPR = __range.end()
10505 Else:
10506 BEGIN_EXPR = begin(__range)
10507 END_EXPR = end(__range);
10509 If __range has a member 'begin' but not 'end', or vice versa, we must
10510 still use the second alternative (it will surely fail, however).
10511 When calling begin()/end() in the third alternative we must use
10512 argument dependent lookup, but always considering 'std' as an associated
10513 namespace. */
10515 tree
10518 {
10524 /* If an error happened previously do nothing or else a lot of
10525 unhelpful errors would be issued. */
10527 else
10528 {
10529 tree range_temp;
10533 /* Can't bind a reference to an array of runtime bound. */
10535 else
10536 {
10541 LOOKUP_ONLYCONVERTING);
10543 }
10546 }
10548 /* The new for initialization statement. */
10556 LOOKUP_ONLYCONVERTING);
10565 LOOKUP_ONLYCONVERTING);
10569 /* The new for condition. */
10576 /* The new increment expression. */
10579 tf_warning_or_error);
10582 /* The declaration is initialized with *__begin inside the loop body. */
10585 tf_warning_or_error),
10587 LOOKUP_ONLYCONVERTING);
10590 }
10592 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10593 We need to solve both at the same time because the method used
10594 depends on the existence of members begin or end.
10595 Returns the type deduced for the iterator expression. */
10597 static tree
10599 {
10601 {
10604 }
10607 {
10612 }
10614 {
10615 /* If RANGE is an array, we will use pointer arithmetic. */
10618 range,
10622 }
10623 else
10624 {
10625 /* If it is not an array, we must do a bit of magic. */
10635 tf_warning_or_error);
10638 tf_warning_or_error);
10641 {
10642 /* Use the member functions. */
10645 else
10651 else
10654 }
10655 else
10656 {
10657 /* Use global functions with ADL. */
10664 tf_warning_or_error);
10666 tf_warning_or_error);
10668 tf_warning_or_error);
10670 tf_warning_or_error);
10673 }
10675 /* Last common checks. */
10677 {
10678 /* If one of the expressions is an error do no more checks. */
10681 }
10684 /* Can happen, when, eg, in a template context, Koenig lookup
10685 can't resolve begin/end (c++/58503). */
10687 else
10688 {
10690 /* The unqualified type of the __begin and __end temporaries should
10691 be the same, as required by the multiple auto declaration. */
10697 }
10698 }
10699 }
10701 /* Helper function for cp_parser_perform_range_for_lookup.
10702 Builds a tree for RANGE.IDENTIFIER(). */
10704 static tree
10706 {
10719 tf_warning_or_error);
10722 }
10724 /* Parse an iteration-statement.
10726 iteration-statement:
10727 while ( condition ) statement
10728 do statement while ( expression ) ;
10729 for ( for-init-statement condition [opt] ; expression [opt] )
10730 statement
10732 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10734 static tree
10736 {
10739 tree statement;
10742 /* Peek at the next token. */
10747 /* Remember whether or not we are already within an iteration
10748 statement. */
10751 /* See what kind of keyword it is. */
10754 {
10756 {
10757 tree condition;
10759 /* Begin the while-statement. */
10761 /* Look for the `('. */
10763 /* Parse the condition. */
10766 /* Look for the `)'. */
10768 /* Parse the dependent statement. */
10772 /* We're done with the while-statement. */
10774 }
10778 {
10779 tree expression;
10781 /* Begin the do-statement. */
10783 /* Parse the body of the do-statement. */
10788 /* Look for the `while' keyword. */
10790 /* Look for the `('. */
10792 /* Parse the expression. */
10794 /* We're done with the do-statement. */
10796 /* Look for the `)'. */
10798 /* Look for the `;'. */
10800 }
10804 {
10805 /* Look for the `('. */
10810 /* Look for the `)'. */
10813 /* Parse the body of the for-statement. */
10818 /* We're done with the for-statement. */
10820 }
10827 }
10830 }
10832 /* Parse a for-init-statement or the declarator of a range-based-for.
10833 Returns true if a range-based-for declaration is seen.
10835 for-init-statement:
10836 expression-statement
10837 simple-declaration */
10839 static bool
10841 {
10842 /* If the next token is a `;', then we have an empty
10843 expression-statement. Grammatically, this is also a
10844 simple-declaration, but an invalid one, because it does not
10845 declare anything. Therefore, if we did not handle this case
10846 specially, we would issue an error message about an invalid
10847 declaration. */
10849 {
10855 {
10856 /* N3994 -- for (id : init) ... */
10859 "type-specifier only available with "
10867 }
10869 /* A colon is used in range-based for. */
10872 /* We're going to speculatively look for a declaration, falling back
10873 to an expression, if necessary. */
10875 /* Parse the declaration. */
10878 decl);
10881 {
10882 /* It is a range-for, consume the ':' */
10886 {
10888 "range-based %<for%> loops only available with "
10891 }
10892 }
10893 else
10894 /* The ';' is not consumed yet because we told
10895 cp_parser_simple_declaration not to. */
10900 /* If the tentative parse failed, then we shall need to look for an
10901 expression-statement. */
10902 }
10903 /* If we are here, it is an expression-statement. */
10906 }
10908 /* Parse a jump-statement.
10910 jump-statement:
10911 break ;
10912 continue ;
10913 return expression [opt] ;
10914 return braced-init-list ;
10915 goto identifier ;
10917 GNU extension:
10919 jump-statement:
10920 goto * expression ;
10922 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10924 static tree
10926 {
10932 /* Peek at the next token. */
10937 /* See what kind of keyword it is. */
10940 {
10944 {
10964 }
10970 {
10977 /* Fall through. */
10987 }
10992 {
10993 tree expr;
10997 {
11001 }
11004 else
11005 /* If the next token is a `;', then there is no
11006 expression. */
11008 /* Build the return-statement. */
11010 /* Look for the final `;'. */
11012 }
11020 /* Create the goto-statement. */
11022 {
11023 /* Issue a warning about this use of a GNU extension. */
11025 /* Consume the '*' token. */
11027 /* Parse the dependent expression. */
11029 }
11030 else
11032 /* Look for the final `;'. */
11039 }
11042 }
11044 /* Parse a declaration-statement.
11046 declaration-statement:
11047 block-declaration */
11049 static void
11051 {
11054 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11057 /* Parse the block-declaration. */
11060 /* Free any declarators allocated. */
11062 }
11064 /* Some dependent statements (like `if (cond) statement'), are
11065 implicitly in their own scope. In other words, if the statement is
11066 a single statement (as opposed to a compound-statement), it is
11067 none-the-less treated as if it were enclosed in braces. Any
11068 declarations appearing in the dependent statement are out of scope
11069 after control passes that point. This function parses a statement,
11070 but ensures that is in its own scope, even if it is not a
11071 compound-statement.
11073 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11074 is a (possibly labeled) if statement which is not enclosed in
11075 braces and has an else clause. This is used to implement
11076 -Wparentheses.
11078 Returns the new statement. */
11080 static tree
11082 {
11083 tree statement;
11088 /* Mark if () ; with a special NOP_EXPR. */
11090 {
11094 }
11095 /* if a compound is opened, we simply parse the statement directly. */
11098 /* If the token is not a `{', then we must take special action. */
11099 else
11100 {
11101 /* Create a compound-statement. */
11103 /* Parse the dependent-statement. */
11105 /* Finish the dummy compound-statement. */
11107 }
11109 /* Return the statement. */
11111 }
11113 /* For some dependent statements (like `while (cond) statement'), we
11114 have already created a scope. Therefore, even if the dependent
11115 statement is a compound-statement, we do not want to create another
11116 scope. */
11118 static void
11120 {
11121 /* If the token is a `{', then we must take special action. */
11124 else
11125 {
11126 /* Avoid calling cp_parser_compound_statement, so that we
11127 don't create a new scope. Do everything else by hand. */
11129 /* If the next keyword is `__label__' we have a label declaration. */
11132 /* Parse an (optional) statement-seq. */
11135 }
11136 }
11138 /* Declarations [gram.dcl.dcl] */
11140 /* Parse an optional declaration-sequence.
11142 declaration-seq:
11143 declaration
11144 declaration-seq declaration */
11146 static void
11148 {
11150 {
11161 {
11162 /* A declaration consisting of a single semicolon is
11163 invalid. Allow it unless we're being pedantic. */
11168 }
11170 /* If we're entering or exiting a region that's implicitly
11171 extern "C", modify the lang context appropriately. */
11173 {
11176 }
11178 {
11181 }
11184 {
11185 /* A top-level declaration can consist solely of a #pragma.
11186 A nested declaration cannot, so this is done here and not
11187 in cp_parser_declaration. (A #pragma at block scope is
11188 handled in cp_parser_statement.) */
11191 }
11193 /* Parse the declaration itself. */
11195 }
11196 }
11198 /* Parse a declaration.
11200 declaration:
11201 block-declaration
11202 function-definition
11203 template-declaration
11204 explicit-instantiation
11205 explicit-specialization
11206 linkage-specification
11207 namespace-definition
11209 GNU extension:
11211 declaration:
11212 __extension__ declaration */
11214 static void
11216 {
11217 cp_token token1;
11218 cp_token token2;
11223 /* Check for the `__extension__' keyword. */
11225 {
11226 /* Parse the qualified declaration. */
11228 /* Restore the PEDANTIC flag. */
11232 }
11234 /* Try to figure out what kind of declaration is present. */
11239 else
11240 {
11243 }
11245 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11248 /* If the next token is `extern' and the following token is a string
11249 literal, then we have a linkage specification. */
11253 /* If the next token is `template', then we have either a template
11254 declaration, an explicit instantiation, or an explicit
11255 specialization. */
11257 {
11258 /* `template <>' indicates a template specialization. */
11262 /* `template <' indicates a template declaration. */
11265 /* Anything else must be an explicit instantiation. */
11266 else
11268 }
11269 /* If the next token is `export', then we have a template
11270 declaration. */
11273 /* If the next token is `extern', 'static' or 'inline' and the one
11274 after that is `template', we have a GNU extended explicit
11275 instantiation directive. */
11282 /* If the next token is `namespace', check for a named or unnamed
11283 namespace definition. */
11289 /* An unnamed namespace definition. */
11293 /* An inline (associated) namespace definition. */
11297 /* Objective-C++ declaration/definition. */
11304 /* We must have either a block declaration or a function
11305 definition. */
11306 else
11307 /* Try to parse a block-declaration, or a function-definition. */
11310 /* Free any declarators allocated. */
11312 }
11314 /* Parse a block-declaration.
11316 block-declaration:
11317 simple-declaration
11318 asm-definition
11319 namespace-alias-definition
11320 using-declaration
11321 using-directive
11323 GNU Extension:
11325 block-declaration:
11326 __extension__ block-declaration
11328 C++0x Extension:
11330 block-declaration:
11331 static_assert-declaration
11333 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11334 part of a declaration-statement. */
11336 static void
11339 {
11343 /* Check for the `__extension__' keyword. */
11345 {
11346 /* Parse the qualified declaration. */
11348 /* Restore the PEDANTIC flag. */
11352 }
11354 /* Peek at the next token to figure out which kind of declaration is
11355 present. */
11358 /* If the next keyword is `asm', we have an asm-definition. */
11360 {
11364 }
11365 /* If the next keyword is `namespace', we have a
11366 namespace-alias-definition. */
11369 /* If the next keyword is `using', we have a
11370 using-declaration, a using-directive, or an alias-declaration. */
11372 {
11377 /* If the token after `using' is `namespace', then we have a
11378 using-directive. */
11382 /* If the second token after 'using' is '=', then we have an
11383 alias-declaration. */
11389 /* Otherwise, it's a using-declaration. */
11390 else
11393 }
11394 /* If the next keyword is `__label__' we have a misplaced label
11395 declaration. */
11397 {
11401 /* If the next token is now a `;', consume it. */
11404 }
11405 /* If the next token is `static_assert' we have a static assertion. */
11408 /* Anything else must be a simple-declaration. */
11409 else
11412 }
11414 /* Parse a simple-declaration.
11416 simple-declaration:
11417 decl-specifier-seq [opt] init-declarator-list [opt] ;
11419 init-declarator-list:
11420 init-declarator
11421 init-declarator-list , init-declarator
11423 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11424 function-definition as a simple-declaration.
11426 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11427 parsed declaration if it is an uninitialized single declarator not followed
11428 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11429 if present, will not be consumed. */
11431 static void
11435 {
11436 cp_decl_specifier_seq decl_specifiers;
11443 /* Defer access checks until we know what is being declared; the
11444 checks for names appearing in the decl-specifier-seq should be
11445 done as if we were in the scope of the thing being declared. */
11448 /* Parse the decl-specifier-seq. We have to keep track of whether
11449 or not the decl-specifier-seq declares a named class or
11450 enumeration type, since that is the only case in which the
11451 init-declarator-list is allowed to be empty.
11453 [dcl.dcl]
11455 In a simple-declaration, the optional init-declarator-list can be
11456 omitted only when declaring a class or enumeration, that is when
11457 the decl-specifier-seq contains either a class-specifier, an
11458 elaborated-type-specifier, or an enum-specifier. */
11460 CP_PARSER_FLAGS_OPTIONAL,
11463 /* We no longer need to defer access checks. */
11466 /* In a block scope, a valid declaration must always have a
11467 decl-specifier-seq. By not trying to parse declarators, we can
11468 resolve the declaration/expression ambiguity more quickly. */
11471 {
11474 }
11476 /* If the next two tokens are both identifiers, the code is
11477 erroneous. The usual cause of this situation is code like:
11479 T t;
11481 where "T" should name a type -- but does not. */
11484 {
11485 /* If parsing tentatively, we should commit; we really are
11486 looking at a declaration. */
11488 /* Give up. */
11490 }
11492 /* If we have seen at least one decl-specifier, and the next token
11493 is not a parenthesis, then we must be looking at a declaration.
11494 (After "int (" we might be looking at a functional cast.) */
11501 /* Keep going until we hit the `;' at the end of the simple
11502 declaration. */
11505 CPP_SEMICOLON))
11506 {
11509 tree decl;
11512 {
11513 /* If we are processing next declarator, coma is expected */
11519 }
11520 else
11523 /* Parse the init-declarator. */
11526 function_definition_allowed_p,
11528 declares_class_or_enum,
11530 maybe_range_for_decl);
11531 /* If an error occurred while parsing tentatively, exit quickly.
11532 (That usually happens when in the body of a function; each
11533 statement is treated as a declaration-statement until proven
11534 otherwise.) */
11537 /* Handle function definitions specially. */
11539 {
11540 /* If the next token is a `,', then we are probably
11541 processing something like:
11543 void f() {}, *p;
11545 which is erroneous. */
11547 {
11550 "mixing"
11552 }
11553 /* Otherwise, we're done with the list of declarators. */
11554 else
11555 {
11558 }
11559 }
11562 /* The next token should be either a `,' or a `;'. */
11564 /* If it's a `,', there are more declarators to come. */
11567 /* If it's a `;', we are done. */
11570 /* Anything else is an error. */
11571 else
11572 {
11573 /* If we have already issued an error message we don't need
11574 to issue another one. */
11578 /* Skip tokens until we reach the end of the statement. */
11580 /* If the next token is now a `;', consume it. */
11584 }
11585 /* After the first time around, a function-definition is not
11586 allowed -- even if it was OK at first. For example:
11588 int i, f() {}
11590 is not valid. */
11592 }
11594 /* Issue an error message if no declarators are present, and the
11595 decl-specifier-seq does not itself declare a class or
11596 enumeration: [dcl.dcl]/3. */
11598 {
11600 {
11604 /* Ensure an error is issued anyway when finish_decltype_type,
11605 called via cp_parser_decl_specifier_seq, returns a class or
11606 an enumeration (c++/51786). */
11609 }
11610 /* Perform any deferred access checks. */
11612 }
11614 /* Consume the `;'. */
11618 done:
11620 }
11622 /* Parse a decl-specifier-seq.
11624 decl-specifier-seq:
11625 decl-specifier-seq [opt] decl-specifier
11626 decl-specifier attribute-specifier-seq [opt] (C++11)
11628 decl-specifier:
11629 storage-class-specifier
11630 type-specifier
11631 function-specifier
11632 friend
11633 typedef
11635 GNU Extension:
11637 decl-specifier:
11638 attributes
11640 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11642 The parser flags FLAGS is used to control type-specifier parsing.
11644 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11645 flags:
11647 1: one of the decl-specifiers is an elaborated-type-specifier
11648 (i.e., a type declaration)
11649 2: one of the decl-specifiers is an enum-specifier or a
11650 class-specifier (i.e., a type definition)
11652 */
11654 static void
11656 cp_parser_flags flags,
11659 {
11663 cp_decl_spec ds;
11665 /* Clear DECL_SPECS. */
11668 /* Assume no class or enumeration type is declared. */
11671 /* Keep reading specifiers until there are no more to read. */
11673 {
11678 /* Peek at the next token. */
11681 /* Save the first token of the decl spec list for error
11682 reporting. */
11685 /* Handle attributes. */
11687 {
11688 /* Parse the attributes. */
11691 /* In a sequence of declaration specifiers, c++11 attributes
11692 appertain to the type that precede them. In that case
11693 [dcl.spec]/1 says:
11695 The attribute-specifier-seq affects the type only for
11696 the declaration it appears in, not other declarations
11697 involving the same type.
11699 But for now let's force the user to position the
11700 attribute either at the beginning of the declaration or
11701 after the declarator-id, which would clearly mean that it
11702 applies to the declarator. */
11704 {
11706 /* The c++11 attribute is at the beginning of the
11707 declaration. It appertains to the entity being
11709 else
11710 {
11712 {
11713 /* This is an attribute following a
11714 class-specifier. */
11719 }
11720 else
11721 {
11722 decl_specs->std_attributes
11724 attrs);
11727 }
11729 }
11730 }
11732 decl_specs->attributes
11734 attrs);
11738 }
11739 /* Assume we will find a decl-specifier keyword. */
11741 /* If the next token is an appropriate keyword, we can simply
11742 add it to the list. */
11744 {
11745 /* decl-specifier:
11746 friend
11747 constexpr */
11750 {
11753 }
11754 else
11755 {
11757 /* Consume the token. */
11759 }
11767 /* function-specifier:
11768 inline
11769 virtual
11770 explicit */
11777 /* decl-specifier:
11778 typedef */
11781 /* Consume the token. */
11783 /* A constructor declarator cannot appear in a typedef. */
11785 /* The "typedef" keyword can only occur in a declaration; we
11786 may as well commit at this point. */
11793 /* storage-class-specifier:
11794 auto
11795 register
11796 static
11797 extern
11798 mutable
11800 GNU Extension:
11801 thread */
11804 {
11805 /* Consume the token. */
11808 /* Complain about `auto' as a storage specifier, if
11809 we're complaining about C++0x compatibility. */
11813 /* Set the storage class anyway. */
11815 token);
11816 }
11817 else
11818 /* C++0x auto type-specifier. */
11826 /* Consume the token. */
11829 token);
11832 /* Consume the token. */
11838 /* We did not yet find a decl-specifier yet. */
11841 }
11851 /* Constructors are a special case. The `S' in `S()' is not a
11852 decl-specifier; it is the beginning of the declarator. */
11853 constructor_p
11854 = (!found_decl_spec
11855 && constructor_possible_p
11856 && (cp_parser_constructor_declarator_p
11859 /* If we don't have a DECL_SPEC yet, then we must be looking at
11860 a type-specifier. */
11862 {
11865 tree type_spec;
11867 type_spec
11869 decl_specs,
11875 /* If this type-specifier referenced a user-defined type
11876 (a typedef, class-name, etc.), then we can't allow any
11877 more such type-specifiers henceforth.
11879 [dcl.spec]
11881 The longest sequence of decl-specifiers that could
11882 possibly be a type name is taken as the
11883 decl-specifier-seq of a declaration. The sequence shall
11884 be self-consistent as described below.
11886 [dcl.type]
11888 As a general rule, at most one type-specifier is allowed
11889 in the complete decl-specifier-seq of a declaration. The
11890 only exceptions are the following:
11892 -- const or volatile can be combined with any other
11893 type-specifier.
11895 -- signed or unsigned can be combined with char, long,
11896 short, or int.
11898 -- ..
11900 Example:
11902 typedef char* Pc;
11903 void g (const int Pc);
11905 Here, Pc is *not* part of the decl-specifier seq; it's
11906 the declarator. Therefore, once we see a type-specifier
11907 (other than a cv-qualifier), we forbid any additional
11908 user-defined types. We *do* still allow things like `int
11909 int' to be considered a decl-specifier-seq, and issue the
11910 error message later. */
11913 /* A constructor declarator cannot follow a type-specifier. */
11915 {
11920 }
11921 }
11923 /* If we still do not have a DECL_SPEC, then there are no more
11924 decl-specifiers. */
11929 /* After we see one decl-specifier, further decl-specifiers are
11930 always optional. */
11932 }
11934 /* Don't allow a friend specifier with a class definition. */
11939 }
11941 /* Parse an (optional) storage-class-specifier.
11943 storage-class-specifier:
11944 auto
11945 register
11946 static
11947 extern
11948 mutable
11950 GNU Extension:
11952 storage-class-specifier:
11953 thread
11955 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11957 static tree
11959 {
11961 {
11965 /* Fall through for C++98. */
11972 /* Consume the token. */
11977 }
11978 }
11980 /* Parse an (optional) function-specifier.
11982 function-specifier:
11983 inline
11984 virtual
11985 explicit
11987 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11988 Updates DECL_SPECS, if it is non-NULL. */
11990 static tree
11993 {
11996 {
12002 /* 14.5.2.3 [temp.mem]
12004 A member function template shall not be virtual. */
12007 else
12017 }
12019 /* Consume the token. */
12021 }
12023 /* Parse a linkage-specification.
12025 linkage-specification:
12026 extern string-literal { declaration-seq [opt] }
12027 extern string-literal declaration */
12029 static void
12031 {
12032 tree linkage;
12034 /* Look for the `extern' keyword. */
12037 /* Look for the string-literal. */
12040 /* Transform the literal into an identifier. If the literal is a
12041 wide-character string, or contains embedded NULs, then we can't
12042 handle it as the user wants. */
12045 {
12047 /* Assume C++ linkage. */
12049 }
12050 else
12053 /* We're now using the new linkage. */
12056 /* If the next token is a `{', then we're using the first
12057 production. */
12059 {
12062 /* Consume the `{' token. */
12064 /* Parse the declarations. */
12066 /* Look for the closing `}'. */
12068 }
12069 /* Otherwise, there's just one declaration. */
12070 else
12071 {
12074 saved_in_unbraced_linkage_specification_p
12078 parser->in_unbraced_linkage_specification_p
12080 }
12082 /* We're done with the linkage-specification. */
12084 }
12086 /* Parse a static_assert-declaration.
12088 static_assert-declaration:
12089 static_assert ( constant-expression , string-literal ) ;
12091 If MEMBER_P, this static_assert is a class member. */
12093 static void
12095 {
12096 tree condition;
12097 tree message;
12099 location_t saved_loc;
12102 /* Peek at the `static_assert' token so we can keep track of exactly
12103 where the static assertion started. */
12107 /* Look for the `static_assert' keyword. */
12109 RT_STATIC_ASSERT))
12112 /* We know we are in a static assertion; commit to any tentative
12113 parse. */
12117 /* Parse the `(' starting the static assertion condition. */
12120 /* Parse the constant-expression. Allow a non-constant expression
12121 here in order to give better diagnostics in finish_static_assert. */
12122 condition =
12127 /* Parse the separating `,'. */
12130 /* Parse the string-literal message. */
12135 /* A `)' completes the static assertion. */
12142 /* A semicolon terminates the declaration. */
12145 /* Complete the static assertion, which may mean either processing
12146 the static assert now or saving it for template instantiation. */
12148 }
12150 /* Parse the expression in decltype ( expression ). */
12152 static tree
12155 {
12157 tree expr;
12159 /* First, try parsing an id-expression. */
12170 {
12173 cp_id_kind idk;
12177 /* Lookup the name we got back from the id-expression. */
12188 {
12189 /* Complete lookup of the id-expression. */
12190 expr = (finish_id_expression
12203 /* We found an id-expression, but it was something that we
12204 should not have found. This is an error, not something
12205 we can recover from, so note that we found an
12206 id-expression and we'll recover as gracefully as
12207 possible. */
12209 }
12214 /* We have an id-expression. */
12216 }
12219 {
12220 /* Abort the id-expression parse. */
12223 /* Parsing tentatively, again. */
12226 /* Parse a class member access. */
12234 /* We have an id-expression. */
12236 }
12239 /* We have parsed the complete id-expression or member access. */
12241 else
12242 {
12243 /* Abort our attempt to parse an id-expression or member access
12244 expression. */
12247 /* Parse a full expression. */
12250 }
12253 }
12255 /* Parse a `decltype' type. Returns the type.
12257 simple-type-specifier:
12258 decltype ( expression )
12259 C++14 proposal:
12260 decltype ( auto ) */
12262 static tree
12264 {
12265 tree expr;
12274 {
12275 /* Already parsed. */
12278 }
12280 /* Look for the `decltype' token. */
12284 /* Parse the opening `('. */
12288 /* decltype (auto) */
12291 {
12298 }
12300 /* Types cannot be defined in a `decltype' expression. Save away the
12301 old message. */
12304 /* And create the new one. */
12305 parser->type_definition_forbidden_message
12308 /* The restrictions on constant-expressions do not apply inside
12309 decltype expressions. */
12310 saved_integral_constant_expression_p
12312 saved_non_integral_constant_expression_p
12316 /* Within a parenthesized expression, a `>' token is always
12317 the greater-than operator. */
12318 saved_greater_than_is_operator_p
12322 /* Do not actually evaluate the expression. */
12325 /* Do not warn about problems with the expression. */
12330 /* Go back to evaluating expressions. */
12334 /* The `>' token might be the end of a template-id or
12335 template-parameter-list now. */
12336 parser->greater_than_is_operator_p
12339 /* Restore the old message and the integral constant expression
12340 flags. */
12342 parser->integral_constant_expression_p
12344 parser->non_integral_constant_expression_p
12347 /* Parse to the closing `)'. */
12349 {
12353 }
12356 tf_warning_or_error);
12358 rewrite:
12359 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12360 it again. */
12367 }
12369 /* Special member functions [gram.special] */
12371 /* Parse a conversion-function-id.
12373 conversion-function-id:
12374 operator conversion-type-id
12376 Returns an IDENTIFIER_NODE representing the operator. */
12378 static tree
12380 {
12381 tree type;
12382 tree saved_scope;
12383 tree saved_qualifying_scope;
12384 tree saved_object_scope;
12387 /* Look for the `operator' token. */
12390 /* When we parse the conversion-type-id, the current scope will be
12391 reset. However, we need that information in able to look up the
12392 conversion function later, so we save it here. */
12396 /* We must enter the scope of the class so that the names of
12397 entities declared within the class are available in the
12398 conversion-type-id. For example, consider:
12400 struct S {
12401 typedef int I;
12402 operator I();
12403 };
12405 S::operator I() { ... }
12407 In order to see that `I' is a type-name in the definition, we
12408 must be in the scope of `S'. */
12411 /* Parse the conversion-type-id. */
12413 /* Leave the scope of the class, if any. */
12416 /* Restore the saved scope. */
12420 /* If the TYPE is invalid, indicate failure. */
12424 }
12426 /* Parse a conversion-type-id:
12428 conversion-type-id:
12429 type-specifier-seq conversion-declarator [opt]
12431 Returns the TYPE specified. */
12433 static tree
12435 {
12436 tree attributes;
12437 cp_decl_specifier_seq type_specifiers;
12439 tree type_specified;
12442 /* Parse the attributes. */
12446 parser->type_definition_forbidden_message
12449 /* Parse the type-specifiers. */
12456 /* If that didn't work, stop. */
12459 /* Parse the conversion-declarator. */
12467 /* Don't give this error when parsing tentatively. This happens to
12468 work because we always parse this definitively once. */
12471 {
12473 {
12476 }
12480 }
12483 }
12485 /* Parse an (optional) conversion-declarator.
12487 conversion-declarator:
12488 ptr-operator conversion-declarator [opt]
12490 */
12494 {
12497 cp_cv_quals cv_quals;
12499 /* We don't know if there's a ptr-operator next, or not. */
12501 /* Try the ptr-operator. */
12504 /* If it worked, look for more conversion-declarators. */
12506 {
12509 /* Parse another optional declarator. */
12512 declarator = cp_parser_make_indirect_declarator
12516 }
12519 }
12521 /* Parse an (optional) ctor-initializer.
12523 ctor-initializer:
12524 : mem-initializer-list
12526 Returns TRUE iff the ctor-initializer was actually present. */
12528 static bool
12530 {
12531 /* If the next token is not a `:', then there is no
12532 ctor-initializer. */
12534 {
12535 /* Do default initialization of any bases and members. */
12540 }
12542 /* Consume the `:' token. */
12544 /* And the mem-initializer-list. */
12548 }
12550 /* Parse a mem-initializer-list.
12552 mem-initializer-list:
12553 mem-initializer ... [opt]
12554 mem-initializer ... [opt] , mem-initializer-list */
12556 static void
12558 {
12563 /* Let the semantic analysis code know that we are starting the
12564 mem-initializer-list. */
12569 /* Loop through the list. */
12571 {
12572 tree mem_initializer;
12575 /* Parse the mem-initializer. */
12577 /* If the next token is a `...', we're expanding member initializers. */
12579 {
12580 /* Consume the `...'. */
12583 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12584 can be expanded but members cannot. */
12587 {
12592 }
12594 /* Construct the pack expansion type. */
12597 }
12600 {
12604 }
12605 /* Look for a target constructor. */
12609 {
12612 {
12616 }
12618 }
12619 /* Add it to the list, unless it was erroneous. */
12621 {
12624 }
12625 /* If the next token is not a `,', we're done. */
12628 /* Consume the `,' token. */
12630 }
12632 /* Perform semantic analysis. */
12635 }
12637 /* Parse a mem-initializer.
12639 mem-initializer:
12640 mem-initializer-id ( expression-list [opt] )
12641 mem-initializer-id braced-init-list
12643 GNU extension:
12645 mem-initializer:
12646 ( expression-list [opt] )
12648 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12649 class) or FIELD_DECL (for a non-static data member) to initialize;
12650 the TREE_VALUE is the expression-list. An empty initialization
12651 list is represented by void_list_node. */
12653 static tree
12655 {
12656 tree mem_initializer_id;
12657 tree expression_list;
12658 tree member;
12661 /* Find out what is being initialized. */
12663 {
12667 }
12668 else
12669 {
12673 }
12679 {
12686 }
12687 else
12688 {
12698 }
12708 }
12710 /* Parse a mem-initializer-id.
12712 mem-initializer-id:
12713 :: [opt] nested-name-specifier [opt] class-name
12714 identifier
12716 Returns a TYPE indicating the class to be initializer for the first
12717 production. Returns an IDENTIFIER_NODE indicating the data member
12718 to be initialized for the second production. */
12720 static tree
12722 {
12726 tree id;
12730 /* `typename' is not allowed in this context ([temp.res]). */
12732 {
12734 "keyword %<typename%> not allowed in this context (a qualified "
12737 }
12738 /* Look for the optional `::' operator. */
12739 global_scope_p
12743 /* Look for the optional nested-name-specifier. The simplest way to
12744 implement:
12746 [temp.res]
12748 The keyword `typename' is not permitted in a base-specifier or
12749 mem-initializer; in these contexts a qualified name that
12750 depends on a template-parameter is implicitly assumed to be a
12751 type name.
12753 is to assume that we have seen the `typename' keyword at this
12754 point. */
12755 nested_name_specifier_p
12764 /* If there is a `::' operator or a nested-name-specifier, then we
12765 are definitely looking for a class-name. */
12770 typename_type,
12774 /* Otherwise, we could also be looking for an ordinary identifier. */
12776 /* Try a class-name. */
12780 none_type,
12784 /* If we found one, we're done. */
12787 /* Otherwise, look for an ordinary identifier. */
12789 }
12791 /* Overloading [gram.over] */
12793 /* Parse an operator-function-id.
12795 operator-function-id:
12796 operator operator
12798 Returns an IDENTIFIER_NODE for the operator which is a
12799 human-readable spelling of the identifier, e.g., `operator +'. */
12801 static tree
12803 {
12804 /* Look for the `operator' keyword. */
12807 /* And then the name of the operator itself. */
12809 }
12811 /* Return an identifier node for a user-defined literal operator.
12812 The suffix identifier is chained to the operator name identifier. */
12814 static tree
12816 {
12817 tree identifier;
12824 }
12826 /* Parse an operator.
12828 operator:
12829 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12830 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12831 || ++ -- , ->* -> () []
12833 GNU Extensions:
12835 operator:
12836 <? >? <?= >?=
12838 Returns an IDENTIFIER_NODE for the operator which is a
12839 human-readable spelling of the identifier, e.g., `operator +'. */
12841 static tree
12843 {
12848 /* Peek at the next token. */
12850 /* Figure out which operator we have. */
12852 {
12854 {
12857 /* The keyword should be either `new' or `delete'. */
12862 else
12865 /* Consume the `new' or `delete' token. */
12868 /* Peek at the next token. */
12870 /* If it's a `[' token then this is the array variant of the
12871 operator. */
12873 {
12874 /* Consume the `[' token. */
12876 /* Look for the `]' token. */
12880 }
12881 /* Otherwise, we have the non-array variant. */
12882 else
12886 }
13033 /* Consume the `('. */
13035 /* Look for the matching `)'. */
13040 /* Consume the `['. */
13042 /* Look for the matching `]'. */
13057 {
13064 /* Consume the string. */
13070 {
13073 }
13074 else
13075 {
13077 /* Look for the suffix identifier. */
13082 {
13086 }
13087 else
13088 {
13091 }
13092 }
13097 {
13100 }
13103 {
13106 }
13108 {
13111 }
13113 }
13116 /* Anything else is an error. */
13118 }
13120 /* If we have selected an identifier, we need to consume the
13121 operator token. */
13124 /* Otherwise, no valid operator name was present. */
13125 else
13126 {
13129 }
13132 }
13134 /* Parse a template-declaration.
13136 template-declaration:
13137 export [opt] template < template-parameter-list > declaration
13139 If MEMBER_P is TRUE, this template-declaration occurs within a
13140 class-specifier.
13142 The grammar rule given by the standard isn't correct. What
13143 is really meant is:
13145 template-declaration:
13146 export [opt] template-parameter-list-seq
13147 decl-specifier-seq [opt] init-declarator [opt] ;
13148 export [opt] template-parameter-list-seq
13149 function-definition
13151 template-parameter-list-seq:
13152 template-parameter-list-seq [opt]
13153 template < template-parameter-list > */
13155 static void
13157 {
13158 /* Check for `export'. */
13160 {
13161 /* Consume the `export' token. */
13163 /* Warn that we do not support `export'. */
13165 }
13168 }
13170 /* Parse a template-parameter-list.
13172 template-parameter-list:
13173 template-parameter
13174 template-parameter-list , template-parameter
13176 Returns a TREE_LIST. Each node represents a template parameter.
13177 The nodes are connected via their TREE_CHAINs. */
13179 static tree
13181 {
13186 /* The loop below parses the template parms. We first need to know
13187 the total number of template parms to be able to compute proper
13188 canonical types of each dependent type. So after the loop, when
13189 we know the total number of template parms,
13190 end_template_parm_list computes the proper canonical types and
13191 fixes up the dependent types accordingly. */
13193 {
13194 tree parameter;
13197 location_t parm_loc;
13199 /* Parse the template-parameter. */
13204 /* Add it to the list. */
13207 parm_loc,
13208 parameter,
13209 is_non_type,
13210 is_parameter_pack);
13211 else
13212 {
13215 }
13217 /* If the next token is not a `,', we're done. */
13220 /* Otherwise, consume the `,' token. */
13222 }
13225 }
13227 /* Parse a template-parameter.
13229 template-parameter:
13230 type-parameter
13231 parameter-declaration
13233 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13234 the parameter. The TREE_PURPOSE is the default value, if any.
13235 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13236 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13237 set to true iff this parameter is a parameter pack. */
13239 static tree
13242 {
13246 tree parm;
13248 /* Assume it is a type parameter or a template parameter. */
13250 /* Assume it not a parameter pack. */
13252 /* Peek at the next token. */
13254 /* If it is `class' or `template', we have a type-parameter. */
13257 /* If it is `class' or `typename' we do not know yet whether it is a
13258 type parameter or a non-type parameter. Consider:
13260 template <typename T, typename T::X X> ...
13262 or:
13264 template <class C, class D*> ...
13266 Here, the first parameter is a type parameter, and the second is
13267 a non-type parameter. We can tell by looking at the token after
13268 the identifier -- if it is a `,', `=', or `>' then we have a type
13269 parameter. */
13271 {
13272 /* Peek at the token after `class' or `typename'. */
13274 /* If it's an ellipsis, we have a template type parameter
13275 pack. */
13278 /* If it's an identifier, skip it. */
13281 /* Now, see if the token looks like the end of a template
13282 parameter. */
13287 }
13289 /* Otherwise, it is a non-type parameter.
13291 [temp.param]
13293 When parsing a default template-argument for a non-type
13294 template-parameter, the first non-nested `>' is taken as the end
13295 of the template parameter-list rather than a greater-than
13296 operator. */
13298 parameter_declarator
13305 /* If the parameter declaration is marked as a parameter pack, set
13306 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13307 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13308 grokdeclarator. */
13311 {
13314 }
13317 {
13318 /* Can happen in some cases of erroneous input (c++/34892). */
13320 /* Consume the `...' for better error recovery. */
13322 }
13323 /* If the next token is an ellipsis, and we don't already have it
13324 marked as a parameter pack, then we have a parameter pack (that
13325 has no declarator). */
13328 && (declarator_can_be_parameter_pack
13330 {
13331 /* Consume the `...'. */
13336 }
13337 /* We might end up with a pack expansion as the type of the non-type
13338 template parameter, in which case this is a non-type template
13339 parameter pack. */
13342 {
13346 }
13349 {
13350 /* Parameter packs cannot have default arguments. However, a
13351 user may try to do so, so we'll parse them and give an
13352 appropriate diagnostic here. */
13356 /* Find the name of the parameter pack. */
13365 else
13369 /* Parse the default argument, but throw away the result. */
13371 }
13381 }
13383 /* Parse a type-parameter.
13385 type-parameter:
13386 class identifier [opt]
13387 class identifier [opt] = type-id
13388 typename identifier [opt]
13389 typename identifier [opt] = type-id
13390 template < template-parameter-list > class identifier [opt]
13391 template < template-parameter-list > class identifier [opt]
13392 = id-expression
13394 GNU Extension (variadic templates):
13396 type-parameter:
13397 class ... identifier [opt]
13398 typename ... identifier [opt]
13400 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13401 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13402 the declaration of the parameter.
13404 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13406 static tree
13408 {
13410 tree parameter;
13412 /* Look for a keyword to tell us what kind of parameter this is. */
13418 {
13421 {
13422 tree identifier;
13423 tree default_argument;
13425 /* If the next token is an ellipsis, we have a template
13426 argument pack. */
13428 {
13429 /* Consume the `...' token. */
13434 }
13436 /* If the next token is an identifier, then it names the
13437 parameter. */
13440 else
13443 /* Create the parameter. */
13446 /* If the next token is an `=', we have a default argument. */
13448 {
13449 /* Consume the `=' token. */
13451 /* Parse the default-argument. */
13455 /* Template parameter packs cannot have default
13456 arguments. */
13458 {
13461 "template parameter pack %qD cannot have a "
13463 else
13465 "template parameter packs cannot have "
13468 }
13470 }
13471 else
13474 /* Create the combined representation of the parameter and the
13475 default argument. */
13477 }
13481 {
13482 tree identifier;
13483 tree default_argument;
13485 /* Look for the `<'. */
13487 /* Parse the template-parameter-list. */
13489 /* Look for the `>'. */
13491 /* Look for the `class' or 'typename' keywords. */
13493 /* If the next token is an ellipsis, we have a template
13494 argument pack. */
13496 {
13497 /* Consume the `...' token. */
13502 }
13503 /* If the next token is an `=', then there is a
13504 default-argument. If the next token is a `>', we are at
13505 the end of the parameter-list. If the next token is a `,',
13506 then we are at the end of this parameter. */
13510 {
13512 /* Treat invalid names as if the parameter were nameless. */
13515 }
13516 else
13519 /* Create the template parameter. */
13521 identifier);
13523 /* If the next token is an `=', then there is a
13524 default-argument. */
13526 {
13529 /* Consume the `='. */
13531 /* Parse the id-expression. */
13533 /* save token before parsing the id-expression, for error
13534 reporting */
13536 default_argument
13544 /* If the id-expression was a template-id that refers to
13545 a template-class, we already have the declaration here,
13546 so no further lookup is needed. */
13547 ;
13548 else
13549 /* Look up the name. */
13550 default_argument
13552 none_type,
13558 /* See if the default argument is valid. */
13559 default_argument
13562 /* Template parameter packs cannot have default
13563 arguments. */
13565 {
13568 "template parameter pack %qD cannot "
13570 identifier);
13571 else
13575 }
13577 }
13578 else
13581 /* Create the combined representation of the parameter and the
13582 default argument. */
13584 }
13590 }
13593 }
13595 /* Parse a template-id.
13597 template-id:
13598 template-name < template-argument-list [opt] >
13600 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13601 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13602 returned. Otherwise, if the template-name names a function, or set
13603 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13604 names a class, returns a TYPE_DECL for the specialization.
13606 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13607 uninstantiated templates. */
13609 static tree
13615 {
13617 tree templ;
13618 tree arguments;
13619 tree template_id;
13626 /* If the next token corresponds to a template-id, there is no need
13627 to reparse it. */
13630 {
13633 /* Get the stored value. */
13635 /* Perform any access checks that were deferred. */
13638 {
13643 tf_warning_or_error);
13644 }
13645 /* Return the stored value. */
13647 }
13649 /* Avoid performing name lookup if there is no possibility of
13650 finding a template-id. */
13653 && !cp_parser_nth_token_starts_template_argument_list_p
13655 {
13658 }
13660 /* Remember where the template-id starts. */
13666 /* Parse the template-name. */
13669 check_dependency_p,
13670 is_declaration,
13671 tag_type,
13674 {
13677 }
13679 /* If we find the sequence `[:' after a template-name, it's probably
13680 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13681 parse correctly the argument list. */
13688 {
13690 /* Change `:' into `::'. */
13692 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13693 CPP_LESS. */
13696 /* Parse the arguments. */
13699 {
13700 /* If we couldn't parse an argument list, then we revert our changes
13701 and return simply an error. Maybe this is not a template-id
13702 after all. */
13707 }
13708 /* Otherwise, emit an error about the invalid digraph, but continue
13709 parsing because we got our argument list. */
13712 {
13715 "%<<:%> is an alternate spelling for %<[%>."
13718 {
13720 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13723 }
13724 }
13725 }
13726 else
13727 {
13728 /* Look for the `<' that starts the template-argument-list. */
13730 {
13733 }
13734 /* Parse the arguments. */
13736 }
13738 /* Build a representation of the specialization. */
13741 TEMPLATE_ID_EXPR,
13745 {
13747 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13748 template (rather than some instantiation thereof) only if
13749 is not nested within some other construct. For example, in
13750 "template <typename T> void f(T) { A<T>::", A<T> is just an
13751 instantiation of A. */
13754 CPP_SCOPE));
13755 template_id
13757 }
13759 {
13761 }
13762 else
13763 {
13764 /* If it's not a class-template or a template-template, it should be
13765 a function-template. */
13771 }
13773 /* If parsing tentatively, replace the sequence of tokens that makes
13774 up the template-id with a CPP_TEMPLATE_ID token. That way,
13775 should we re-parse the token stream, we will not have to repeat
13776 the effort required to do the parse, nor will we issue duplicate
13777 error messages about problems during instantiation of the
13778 template. */
13780 /* Don't do this if we had a parse error in a declarator; re-parsing
13781 might succeed if a name changes meaning (60361). */
13785 {
13788 /* Reset the contents of the START_OF_ID token. */
13790 /* Retrieve any deferred checks. Do not pop this access checks yet
13791 so the memory will not be reclaimed during token replacing below. */
13797 /* Purge all subsequent tokens. */
13800 /* ??? Can we actually assume that, if template_id ==
13801 error_mark_node, we will have issued a diagnostic to the
13802 user, as opposed to simply marking the tentative parse as
13803 failed? */
13806 }
13810 }
13812 /* Parse a template-name.
13814 template-name:
13815 identifier
13817 The standard should actually say:
13819 template-name:
13820 identifier
13821 operator-function-id
13823 A defect report has been filed about this issue.
13825 A conversion-function-id cannot be a template name because they cannot
13826 be part of a template-id. In fact, looking at this code:
13828 a.operator K<int>()
13830 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13831 It is impossible to call a templated conversion-function-id with an
13832 explicit argument list, since the only allowed template parameter is
13833 the type to which it is converting.
13835 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13836 `template' keyword, in a construction like:
13838 T::template f<3>()
13840 In that case `f' is taken to be a template-name, even though there
13841 is no way of knowing for sure.
13843 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13844 name refers to a set of overloaded functions, at least one of which
13845 is a template, or an IDENTIFIER_NODE with the name of the template,
13846 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13847 names are looked up inside uninstantiated templates. */
13849 static tree
13856 {
13857 tree identifier;
13858 tree decl;
13859 tree fns;
13862 /* If the next token is `operator', then we have either an
13863 operator-function-id or a conversion-function-id. */
13865 {
13866 /* We don't know whether we're looking at an
13867 operator-function-id or a conversion-function-id. */
13869 /* Try an operator-function-id. */
13871 /* If that didn't work, try a conversion-function-id. */
13873 {
13876 }
13877 }
13878 /* Look for the identifier. */
13879 else
13882 /* If we didn't find an identifier, we don't have a template-id. */
13886 /* If the name immediately followed the `template' keyword, then it
13887 is a template-name. However, if the next token is not `<', then
13888 we do not treat it as a template-name, since it is not being used
13889 as part of a template-id. This enables us to handle constructs
13890 like:
13892 template <typename T> struct S { S(); };
13893 template <typename T> S<T>::S();
13895 correctly. We would treat `S' as a template -- if it were `S<T>'
13896 -- but we do not if there is no `<'. */
13900 {
13901 /* In a declaration, in a dependent context, we pretend that the
13902 "template" keyword was present in order to improve error
13903 recovery. For example, given:
13905 template <typename T> void f(T::X<int>);
13907 we want to treat "X<int>" as a template-id. */
13909 && !template_keyword_p
13911 && check_dependency_p
13913 /* Do not do this for dtors (or ctors), since they never
13914 need the template keyword before their name. */
13916 {
13919 /* Explain what went wrong. */
13921 identifier);
13924 /* If parsing tentatively, find the location of the "<" token. */
13927 /* Parse the template arguments so that we can issue error
13928 messages about them. */
13931 /* Skip tokens until we find a good place from which to
13932 continue parsing. */
13937 /* If parsing tentatively, permanently remove the
13938 template argument list. That will prevent duplicate
13939 error messages from being issued about the missing
13940 "template" keyword. */
13946 }
13948 /* If the "template" keyword is present, then there is generally
13949 no point in doing name-lookup, so we just return IDENTIFIER.
13950 But, if the qualifying scope is non-dependent then we can
13951 (and must) do name-lookup normally. */
13957 }
13959 /* Look up the name. */
13961 tag_type,
13964 check_dependency_p,
13968 /* If DECL is a template, then the name was a template-name. */
13970 ;
13971 else
13972 {
13975 /* The standard does not explicitly indicate whether a name that
13976 names a set of overloaded declarations, some of which are
13977 templates, is a template-name. However, such a name should
13978 be a template-name; otherwise, there is no way to form a
13979 template-id for the overloaded templates. */
13987 {
13988 /* The name does not name a template. */
13991 }
13992 }
13994 /* If DECL is dependent, and refers to a function, then just return
13995 its name; we will look it up again during template instantiation. */
13997 {
14001 }
14004 }
14006 /* Parse a template-argument-list.
14008 template-argument-list:
14009 template-argument ... [opt]
14010 template-argument-list , template-argument ... [opt]
14012 Returns a TREE_VEC containing the arguments. */
14014 static tree
14016 {
14021 tree vec;
14028 /* Even if the template-id appears in an integral
14029 constant-expression, the contents of the argument list do
14030 not. */
14036 /* Parse the arguments. */
14037 do
14038 {
14039 tree argument;
14042 /* Consume the comma. */
14045 /* Parse the template-argument. */
14048 /* If the next token is an ellipsis, we're expanding a template
14049 argument pack. */
14051 {
14053 {
14057 }
14058 /* Consume the `...' token. */
14061 /* Make the argument into a TYPE_PACK_EXPANSION or
14062 EXPR_PACK_EXPANSION. */
14064 }
14067 {
14071 {
14074 }
14075 else
14077 }
14079 }
14092 #ifdef ENABLE_CHECKING
14094 #endif
14096 }
14098 /* Parse a template-argument.
14100 template-argument:
14101 assignment-expression
14102 type-id
14103 id-expression
14105 The representation is that of an assignment-expression, type-id, or
14106 id-expression -- except that the qualified id-expression is
14107 evaluated, so that the value returned is either a DECL or an
14108 OVERLOAD.
14110 Although the standard says "assignment-expression", it forbids
14111 throw-expressions or assignments in the template argument.
14112 Therefore, we use "conditional-expression" instead. */
14114 static tree
14116 {
14117 tree argument;
14123 cp_id_kind idk;
14125 /* There's really no way to know what we're looking at, so we just
14126 try each alternative in order.
14128 [temp.arg]
14130 In a template-argument, an ambiguity between a type-id and an
14131 expression is resolved to a type-id, regardless of the form of
14132 the corresponding template-parameter.
14134 Therefore, we try a type-id first. */
14137 /* If there was no error parsing the type-id but the next token is a
14138 '>>', our behavior depends on which dialect of C++ we're
14139 parsing. In C++98, we probably found a typo for '> >'. But there
14140 are type-id which are also valid expressions. For instance:
14142 struct X { int operator >> (int); };
14143 template <int V> struct Foo {};
14144 Foo<X () >> 5> r;
14146 Here 'X()' is a valid type-id of a function type, but the user just
14147 wanted to write the expression "X() >> 5". Thus, we remember that we
14148 found a valid type-id, but we still try to parse the argument as an
14149 expression to see what happens.
14151 In C++0x, the '>>' will be considered two separate '>'
14152 tokens. */
14156 {
14159 }
14160 else
14161 {
14162 /* If the next token isn't a `,' or a `>', then this argument wasn't
14163 really finished. This means that the argument is not a valid
14164 type-id. */
14167 /* If that worked, we're done. */
14170 }
14171 /* We're still not sure what the argument will be. */
14173 /* Try a template. */
14181 /* If the next token isn't a `,' or a `>', then this argument wasn't
14182 really finished. */
14186 {
14187 /* Figure out what is being referred to. If the id-expression
14188 was for a class template specialization, then we will have a
14189 TYPE_DECL at this point. There is no need to do name lookup
14190 at this point in that case. */
14193 none_type,
14202 }
14205 /* It must be a non-type argument. There permitted cases are given
14206 in [temp.arg.nontype]:
14208 -- an integral constant-expression of integral or enumeration
14209 type; or
14211 -- the name of a non-type template-parameter; or
14213 -- the name of an object or function with external linkage...
14215 -- the address of an object or function with external linkage...
14217 -- a pointer to member... */
14218 /* Look for a non-type template parameter. */
14220 {
14232 }
14234 /* If the next token is "&", the argument must be the address of an
14235 object or function with external linkage. */
14238 {
14241 }
14242 /* See if we might have an id-expression. */
14249 {
14252 address_p,
14259 else
14260 {
14261 tree probe;
14264 {
14265 /* Strip the dereference temporarily. */
14268 }
14270 /* If we're in a template, we represent a qualified-id referring
14271 to a static data member as a SCOPE_REF even if the scope isn't
14272 dependent so that we can check access control later. */
14277 {
14278 /* A variable without external linkage might still be a
14279 valid constant-expression, so no error is issued here
14280 if the external-linkage check fails. */
14283 }
14285 /* All overloaded functions are allowed; if the external
14286 linkage test does not pass, an error will be issued
14287 later. */
14288 ;
14292 /* A pointer-to-member. */
14293 ;
14295 ;
14296 else
14300 {
14303 tf_warning_or_error);
14304 else
14307 }
14308 }
14309 }
14310 /* If the argument started with "&", there are no other valid
14311 alternatives at this point. */
14313 {
14316 }
14318 /* If the argument wasn't successfully parsed as a type-id followed
14319 by '>>', the argument can only be a constant expression now.
14320 Otherwise, we try parsing the constant-expression tentatively,
14321 because the argument could really be a type-id. */
14332 /* We did our best to parse the argument as a non type-id, but that
14333 was the only alternative that matched (albeit with a '>' after
14334 it). We can assume it's just a typo from the user, and a
14335 diagnostic will then be issued. */
14337 }
14339 /* Parse an explicit-instantiation.
14341 explicit-instantiation:
14342 template declaration
14344 Although the standard says `declaration', what it really means is:
14346 explicit-instantiation:
14347 template decl-specifier-seq [opt] declarator [opt] ;
14349 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14350 supposed to be allowed. A defect report has been filed about this
14351 issue.
14353 GNU Extension:
14355 explicit-instantiation:
14356 storage-class-specifier template
14357 decl-specifier-seq [opt] declarator [opt] ;
14358 function-specifier template
14359 decl-specifier-seq [opt] declarator [opt] ; */
14361 static void
14363 {
14365 cp_decl_specifier_seq decl_specifiers;
14370 /* Look for an (optional) storage-class-specifier or
14371 function-specifier. */
14373 {
14374 extension_specifier
14377 extension_specifier
14380 }
14382 /* Look for the `template' keyword. */
14384 /* Let the front end know that we are processing an explicit
14385 instantiation. */
14387 /* [temp.explicit] says that we are supposed to ignore access
14388 control while processing explicit instantiation directives. */
14390 /* Parse a decl-specifier-seq. */
14392 CP_PARSER_FLAGS_OPTIONAL,
14395 /* If there was exactly one decl-specifier, and it declared a class,
14396 and there's no declarator, then we have an explicit type
14397 instantiation. */
14399 {
14400 tree type;
14404 /* Turn access control back on for names used during
14405 template instantiation. */
14410 }
14411 else
14412 {
14414 tree decl;
14416 /* Parse the declarator. */
14417 declarator
14428 {
14431 "explicit instantiation shall not use"
14435 "explicit instantiation shall not use"
14440 /* Turn access control back on for names used during
14441 template instantiation. */
14443 /* Do the explicit instantiation. */
14445 }
14446 else
14447 {
14449 /* Skip the body of the explicit instantiation. */
14451 }
14452 }
14453 /* We're done with the instantiation. */
14459 }
14461 /* Parse an explicit-specialization.
14463 explicit-specialization:
14464 template < > declaration
14466 Although the standard says `declaration', what it really means is:
14468 explicit-specialization:
14469 template <> decl-specifier [opt] init-declarator [opt] ;
14470 template <> function-definition
14471 template <> explicit-specialization
14472 template <> template-declaration */
14474 static void
14476 {
14480 /* Look for the `template' keyword. */
14482 /* Look for the `<'. */
14484 /* Look for the `>'. */
14486 /* We have processed another parameter list. */
14488 /* [temp]
14490 A template ... explicit specialization ... shall not have C
14491 linkage. */
14493 {
14495 /* Give it C++ linkage to avoid confusing other parts of the
14496 front end. */
14499 }
14500 else
14502 /* Let the front end know that we are beginning a specialization. */
14504 {
14507 }
14509 /* If the next keyword is `template', we need to figure out whether
14510 or not we're looking a template-declaration. */
14512 {
14517 else
14519 }
14520 else
14521 /* Parse the dependent declaration. */
14527 /* We're done with the specialization. */
14529 /* For the erroneous case of a template with C linkage, we pushed an
14530 implicit C++ linkage scope; exit that scope now. */
14533 /* We're done with this parameter list. */
14535 }
14537 /* Parse a type-specifier.
14539 type-specifier:
14540 simple-type-specifier
14541 class-specifier
14542 enum-specifier
14543 elaborated-type-specifier
14544 cv-qualifier
14546 GNU Extension:
14548 type-specifier:
14549 __complex__
14551 Returns a representation of the type-specifier. For a
14552 class-specifier, enum-specifier, or elaborated-type-specifier, a
14553 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14555 The parser flags FLAGS is used to control type-specifier parsing.
14557 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14558 in a decl-specifier-seq.
14560 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14561 class-specifier, enum-specifier, or elaborated-type-specifier, then
14562 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14563 if a type is declared; 2 if it is defined. Otherwise, it is set to
14564 zero.
14566 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14567 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14568 is set to FALSE. */
14570 static tree
14572 cp_parser_flags flags,
14577 {
14583 /* Assume this type-specifier does not declare a new type. */
14586 /* And that it does not specify a cv-qualifier. */
14589 /* Peek at the next token. */
14592 /* If we're looking at a keyword, we can use that to guide the
14593 production we choose. */
14596 {
14601 /* Look for the enum-specifier. */
14603 /* If that worked, we're done. */
14605 {
14610 type_spec,
14611 token,
14614 }
14615 else
14618 /* Any of these indicate either a class-specifier, or an
14619 elaborated-type-specifier. */
14626 /* Parse tentatively so that we can back up if we don't find a
14627 class-specifier. */
14629 /* Look for the class-specifier. */
14632 /* If that worked, we're done. */
14634 {
14639 type_spec,
14640 token,
14643 }
14645 /* Fall through. */
14646 elaborated_type_specifier:
14647 /* We're declaring (not defining) a class or enum. */
14651 /* Fall through. */
14653 /* Look for an elaborated-type-specifier. */
14654 type_spec
14655 = (cp_parser_elaborated_type_specifier
14658 is_declaration));
14661 type_spec,
14662 token,
14685 /* The `__complex__' keyword is a GNU extension. */
14691 }
14693 /* Handle simple keywords. */
14695 {
14697 {
14700 }
14702 }
14704 /* If we do not already have a type-specifier, assume we are looking
14705 at a simple-type-specifier. */
14707 decl_specs,
14708 flags);
14710 /* If we didn't find a type-specifier, and a type-specifier was not
14711 optional in this context, issue an error message. */
14713 {
14716 }
14719 }
14721 /* Parse a simple-type-specifier.
14723 simple-type-specifier:
14724 :: [opt] nested-name-specifier [opt] type-name
14725 :: [opt] nested-name-specifier template template-id
14726 char
14727 wchar_t
14728 bool
14729 short
14730 int
14731 long
14732 signed
14733 unsigned
14734 float
14735 double
14736 void
14738 C++0x Extension:
14740 simple-type-specifier:
14741 auto
14742 decltype ( expression )
14743 char16_t
14744 char32_t
14745 __underlying_type ( type-id )
14747 GNU Extension:
14749 simple-type-specifier:
14750 __int128
14751 __typeof__ unary-expression
14752 __typeof__ ( type-id )
14753 __typeof__ ( type-id ) { initializer-list , [opt] }
14755 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14756 appropriately updated. */
14758 static tree
14761 cp_parser_flags flags)
14762 {
14767 /* Peek at the next token. */
14770 /* If we're looking at a keyword, things are easy. */
14772 {
14807 {
14810 }
14839 {
14843 {
14846 "use of %<auto%> in lambda parameter declaration "
14847 "only available with "
14849 }
14852 "use of %<auto%> in parameter declaration "
14853 "only available with "
14855 else
14857 "ISO C++ forbids use of %<auto%> in parameter "
14859 }
14860 else
14865 /* Since DR 743, decltype can either be a simple-type-specifier by
14866 itself or begin a nested-name-specifier. Parsing it will replace
14867 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14868 handling below decide what to do. */
14874 /* Consume the `typeof' token. */
14876 /* Parse the operand to `typeof'. */
14878 /* If it is not already a TYPE, take its type. */
14884 token,
14893 token,
14903 token,
14908 }
14910 /* If token is an already-parsed decltype not followed by ::,
14911 it's a simple-type-specifier. */
14914 {
14918 token,
14922 }
14924 /* If the type-specifier was for a built-in type, we're done. */
14926 {
14927 /* Record the type. */
14934 type,
14935 token,
14940 /* Consume the token. */
14943 /* There is no valid C++ program where a non-template type is
14944 followed by a "<". That usually indicates that the user thought
14945 that the type was a template. */
14950 }
14952 /* The type-specifier must be a user-defined type. */
14954 {
14958 /* Don't gobble tokens or issue error messages if this is an
14959 optional type-specifier. */
14963 /* Look for the optional `::' operator. */
14964 global_p
14968 /* Look for the nested-name specifier. */
14969 qualified_p
14977 /* If we have seen a nested-name-specifier, and the next token
14978 is `template', then we are using the template-id production. */
14981 {
14982 /* Look for the template-id. */
14986 none_type,
14988 /* If the template-id did not name a type, we are out of
14989 luck. */
14991 {
14994 }
14995 }
14996 /* Otherwise, look for a type-name. */
14997 else
14999 /* Keep track of all name-lookups performed in class scopes. */
15001 && !global_p
15002 && !qualified_p
15006 /* If it didn't work out, we don't have a TYPE. */
15012 token,
15014 }
15016 /* If we didn't get a type-name, issue an error message. */
15018 {
15021 }
15024 {
15025 /* See if TYPE is an Objective-C type, and if so, parse and
15026 accept any protocol references following it. Do this before
15027 the cp_parser_check_for_invalid_template_id() call, because
15028 Objective-C types can be followed by '<...>' which would
15029 enclose protocol names rather than template arguments, and so
15030 everything is fine. */
15033 {
15037 /* Clobber the "unqualified" type previously entered into
15038 DECL_SPECS with the new, improved protocol-qualified version. */
15043 }
15045 /* There is no valid C++ program where a non-template type is
15046 followed by a "<". That usually indicates that the user
15047 thought that the type was a template. */
15049 none_type,
15051 }
15054 }
15056 /* Parse a type-name.
15058 type-name:
15059 class-name
15060 enum-name
15061 typedef-name
15062 simple-template-id [in c++0x]
15064 enum-name:
15065 identifier
15067 typedef-name:
15068 identifier
15070 Returns a TYPE_DECL for the type. */
15072 static tree
15074 {
15075 tree type_decl;
15077 /* We can't know yet whether it is a class-name or not. */
15079 /* Try a class-name. */
15083 none_type,
15087 /* If it's not a class-name, keep looking. */
15089 {
15091 /* It must be a typedef-name or an enum-name. */
15095 /* It is either a simple-template-id representing an
15096 instantiation of an alias template... */
15100 none_type,
15102 /* Note that this must be an instantiation of an alias template
15103 because [temp.names]/6 says:
15105 A template-id that names an alias template specialization
15106 is a type-name.
15108 Whereas [temp.names]/7 says:
15110 A simple-template-id that names a class template
15111 specialization is a class-name. */
15116 else
15120 /* ... Or a typedef-name or an enum-name. */
15122 }
15125 }
15127 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15129 enum-name:
15130 identifier
15132 typedef-name:
15133 identifier
15135 Returns a TYPE_DECL for the type. */
15137 static tree
15139 {
15140 tree type_decl;
15141 tree identifier;
15148 /* Look up the type-name. */
15155 {
15156 /* See if this is an Objective-C type. */
15161 }
15163 /* Issue an error if we did not find a type-name. */
15165 /* In Objective-C, we have the complication that class names are
15166 normally type names and start declarations (eg, the
15167 "NSObject" in "NSObject *object;"), but can be used in an
15168 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15169 is an expression. So, a classname followed by a dot is not a
15170 valid type-name. */
15173 {
15178 }
15179 /* Remember that the name was used in the definition of the
15180 current class so that we can check later to see if the
15181 meaning would have been different after the class was
15182 entirely defined. */
15188 }
15190 /* Parse an elaborated-type-specifier. Note that the grammar given
15191 here incorporates the resolution to DR68.
15193 elaborated-type-specifier:
15194 class-key :: [opt] nested-name-specifier [opt] identifier
15195 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15196 enum-key :: [opt] nested-name-specifier [opt] identifier
15197 typename :: [opt] nested-name-specifier identifier
15198 typename :: [opt] nested-name-specifier template [opt]
15199 template-id
15201 GNU extension:
15203 elaborated-type-specifier:
15204 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15205 class-key attributes :: [opt] nested-name-specifier [opt]
15206 template [opt] template-id
15207 enum attributes :: [opt] nested-name-specifier [opt] identifier
15209 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15210 declared `friend'. If IS_DECLARATION is TRUE, then this
15211 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15212 something is being declared.
15214 Returns the TYPE specified. */
15216 static tree
15220 {
15222 tree identifier;
15225 tree globalscope;
15228 /* See if we're looking at the `enum' keyword. */
15230 {
15231 /* Consume the `enum' token. */
15233 /* Remember that it's an enumeration type. */
15235 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15236 enums) is used here. */
15239 {
15243 /* Consume the `struct' or `class' and parse it anyway. */
15245 }
15246 /* Parse the attributes. */
15248 }
15249 /* Or, it might be `typename'. */
15251 RID_TYPENAME))
15252 {
15253 /* Consume the `typename' token. */
15255 /* Remember that it's a `typename' type. */
15257 }
15258 /* Otherwise it must be a class-key. */
15259 else
15260 {
15264 /* Parse the attributes. */
15266 }
15268 /* Look for the `::' operator. */
15271 /* Look for the nested-name-specifier. */
15273 {
15278 is_declaration))
15280 }
15281 else
15282 /* Even though `typename' is not present, the proposed resolution
15283 to Core Issue 180 says that in `class A<T>::B', `B' should be
15284 considered a type-name, even if `A<T>' is dependent. */
15289 is_declaration);
15290 /* For everything but enumeration types, consider a template-id.
15291 For an enumeration type, consider only a plain identifier. */
15293 {
15295 tree decl;
15297 /* Allow the `template' keyword. */
15299 /* If we didn't see `template', we don't know if there's a
15300 template-id or not. */
15303 /* Parse the template-id. */
15307 tag_type,
15308 is_declaration);
15309 /* If we didn't find a template-id, look for an ordinary
15310 identifier. */
15312 ;
15313 /* We can get here when cp_parser_template_id, called by
15314 cp_parser_class_name with tag_type == none_type, succeeds
15315 and caches a BASELINK. Then, when called again here,
15316 instead of failing and returning an error_mark_node
15317 returns it (see template/typename17.C in C++11).
15318 ??? Could we diagnose this earlier? */
15320 {
15323 }
15324 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15325 in effect, then we must assume that, upon instantiation, the
15326 template will correspond to a class. */
15330 typename_type,
15332 /* If the `typename' keyword is in effect and DECL is not a type
15333 decl, then type is non existent. */
15335 ;
15341 }
15344 {
15349 {
15352 }
15354 /* For a `typename', we needn't call xref_tag. */
15360 /* Template parameter lists apply only if we are not within a
15361 function parameter list. */
15362 bool template_parm_lists_apply
15371 /* Look up a qualified name in the usual way. */
15373 {
15374 tree decl;
15375 tree ambiguous_decls;
15378 tag_type,
15385 /* If the lookup was ambiguous, an error will already have been
15386 issued. */
15390 /* If we are parsing friend declaration, DECL may be a
15391 TEMPLATE_DECL tree node here. However, we need to check
15392 whether this TEMPLATE_DECL results in valid code. Consider
15393 the following example:
15395 namespace N {
15396 template <class T> class C {};
15397 }
15398 class X {
15399 template <class T> friend class N::C; // #1, valid code
15400 };
15401 template <class T> class Y {
15402 friend class N::C; // #2, invalid code
15403 };
15405 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15406 name lookup of `N::C'. We see that friend declaration must
15407 be template for the code to be valid. Note that
15408 processing_template_decl does not work here since it is
15409 always 1 for the above two cases. */
15411 decl = (cp_parser_maybe_treat_template_as_class
15416 {
15418 identifier,
15421 }
15424 {
15428 allow_template);
15432 }
15434 /* Forward declarations of nested types, such as
15436 class C1::C2;
15437 class C1::C2::C3;
15439 are invalid unless all components preceding the final '::'
15440 are complete. If all enclosing types are complete, these
15441 declarations become merely pointless.
15443 Invalid forward declarations of nested types are errors
15444 caught elsewhere in parsing. Those that are pointless arrive
15445 here. */
15452 }
15453 else
15454 {
15455 /* An elaborated-type-specifier sometimes introduces a new type and
15456 sometimes names an existing type. Normally, the rule is that it
15457 introduces a new type only if there is not an existing type of
15458 the same name already in scope. For example, given:
15460 struct S {};
15461 void f() { struct S s; }
15463 the `struct S' in the body of `f' is the same `struct S' as in
15464 the global scope; the existing definition is used. However, if
15465 there were no global declaration, this would introduce a new
15466 local class named `S'.
15468 An exception to this rule applies to the following code:
15470 namespace N { struct S; }
15472 Here, the elaborated-type-specifier names a new type
15473 unconditionally; even if there is already an `S' in the
15474 containing scope this declaration names a new type.
15475 This exception only applies if the elaborated-type-specifier
15476 forms the complete declaration:
15478 [class.name]
15480 A declaration consisting solely of `class-key identifier ;' is
15481 either a redeclaration of the name in the current scope or a
15482 forward declaration of the identifier as a class name. It
15483 introduces the name into the current scope.
15485 We are in this situation precisely when the next token is a `;'.
15487 An exception to the exception is that a `friend' declaration does
15488 *not* name a new type; i.e., given:
15490 struct S { friend struct T; };
15492 `T' is not a new type in the scope of `S'.
15494 Also, `new struct S' or `sizeof (struct S)' never results in the
15495 definition of a new type; a new type can only be declared in a
15496 declaration context. */
15498 tag_scope ts;
15502 /* Friends have special name lookup rules. */
15506 CPP_SEMICOLON))
15507 /* This is a `class-key identifier ;' */
15509 else
15512 template_p =
15513 (template_parm_lists_apply
15516 /* An unqualified name was used to reference this type, so
15517 there were no qualifying templates. */
15525 }
15526 }
15531 /* Allow attributes on forward declarations of classes. */
15533 {
15543 else
15546 }
15549 {
15550 /* Indicate whether this class was declared as a `class' or as a
15551 `struct'. */
15555 }
15557 /* A "<" cannot follow an elaborated type specifier. If that
15558 happens, the user was probably trying to form a template-id. */
15563 }
15565 /* Parse an enum-specifier.
15567 enum-specifier:
15568 enum-head { enumerator-list [opt] }
15569 enum-head { enumerator-list , } [C++0x]
15571 enum-head:
15572 enum-key identifier [opt] enum-base [opt]
15573 enum-key nested-name-specifier identifier enum-base [opt]
15575 enum-key:
15576 enum
15577 enum class [C++0x]
15578 enum struct [C++0x]
15580 enum-base: [C++0x]
15581 : type-specifier-seq
15583 opaque-enum-specifier:
15584 enum-key identifier enum-base [opt] ;
15586 GNU Extensions:
15587 enum-key attributes[opt] identifier [opt] enum-base [opt]
15588 { enumerator-list [opt] }attributes[opt]
15589 enum-key attributes[opt] identifier [opt] enum-base [opt]
15590 { enumerator-list, }attributes[opt] [C++0x]
15592 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15593 if the token stream isn't an enum-specifier after all. */
15595 static tree
15597 {
15598 tree identifier;
15600 tree prev_scope;
15602 tree attributes;
15615 /* Parse tentatively so that we can back up if we don't find a
15616 enum-specifier. */
15619 /* Caller guarantees that the current token is 'enum', an identifier
15620 possibly follows, and the token after that is an opening brace.
15621 If we don't have an identifier, fabricate an anonymous name for
15622 the enumeration being defined. */
15625 /* Parse the "class" or "struct", which indicates a scoped
15626 enumeration type in C++0x. */
15629 {
15633 /* Consume the `struct' or `class' token. */
15637 }
15641 /* Clear the qualification. */
15646 /* Figure out in what scope the declaration is being placed. */
15652 nested_name_specifier
15660 {
15661 tree name;
15665 enum_type,
15670 input_location);
15672 {
15675 {
15676 /* Are template enums allowed in ISO? */
15680 /* ignore a typename reference, for it will be solved by name
15681 in start_enum. */
15683 }
15684 }
15687 else
15690 }
15691 else
15692 {
15695 else
15696 {
15702 }
15703 }
15706 /* Check for the `:' that denotes a specified underlying type in C++0x.
15707 Note that a ':' could also indicate a bitfield width, however. */
15709 {
15710 cp_decl_specifier_seq type_specifiers;
15712 /* Consume the `:'. */
15715 /* Parse the type-specifier-seq. */
15720 /* At this point this is surely not elaborated type specifier. */
15729 /* If that didn't work, stop. */
15731 {
15737 }
15738 }
15740 /* Look for the `{' but don't consume it yet. */
15742 {
15744 {
15747 {
15750 }
15751 }
15752 /* An opaque-enum-specifier must have a ';' here. */
15755 {
15758 {
15761 }
15762 }
15763 }
15769 {
15771 {
15775 }
15777 {
15779 }
15780 }
15782 /* Issue an error message if type-definitions are forbidden here. */
15785 else
15786 /* Create the new type. We do this before consuming the opening
15787 brace so the enum will be recorded as being on the line of its
15788 tag (or the 'enum' keyword, if there is no tag). */
15792 /* If the next token is not '{' it is an opaque-enum-specifier or an
15793 elaborated-type-specifier. */
15795 {
15799 {
15800 /* The following catches invalid code such as:
15801 enum class S<int>::E { A, B, C }; */
15809 {
15813 nested_name_specifier);
15815 }
15816 /* If that scope does not contain the scope in which the
15817 class was originally declared, the program is invalid. */
15819 nested_name_specifier))
15820 {
15823 "declaration of %qD in namespace %qD which does not "
15826 else
15828 "declaration of %qD in %qD which does not "
15832 }
15833 }
15838 /* Consume the opening brace. */
15845 {
15849 }
15850 else
15851 {
15857 }
15861 /* If the next token is not '}', then there are some enumerators. */
15863 {
15867 }
15868 else
15871 /* Consume the final '}'. */
15877 }
15878 else
15879 {
15880 /* If a ';' follows, then it is an opaque-enum-specifier
15881 and additional restrictions apply. */
15883 {
15890 }
15891 }
15893 /* Look for trailing attributes to apply to this enumeration, and
15894 apply them if appropriate. */
15896 {
15900 trailing_attr,
15902 }
15904 /* Finish up the enumeration. */
15906 {
15911 }
15914 {
15916 {
15919 }
15921 {
15923 }
15924 }
15925 out:
15928 }
15930 /* Parse an enumerator-list. The enumerators all have the indicated
15931 TYPE.
15933 enumerator-list:
15934 enumerator-definition
15935 enumerator-list , enumerator-definition */
15937 static void
15939 {
15941 {
15942 /* Parse an enumerator-definition. */
15945 /* If the next token is not a ',', we've reached the end of
15946 the list. */
15949 /* Otherwise, consume the `,' and keep going. */
15951 /* If the next token is a `}', there is a trailing comma. */
15953 {
15958 }
15959 }
15960 }
15962 /* Parse an enumerator-definition. The enumerator has the indicated
15963 TYPE.
15965 enumerator-definition:
15966 enumerator
15967 enumerator = constant-expression
15969 enumerator:
15970 identifier */
15972 static void
15974 {
15975 tree identifier;
15976 tree value;
15977 location_t loc;
15979 /* Save the input location because we are interested in the location
15980 of the identifier and not the location of the explicit value. */
15983 /* Look for the identifier. */
15988 /* If the next token is an '=', then there is an explicit value. */
15990 {
15991 /* Consume the `=' token. */
15993 /* Parse the value. */
15995 }
15996 else
15999 /* If we are processing a template, make sure the initializer of the
16000 enumerator doesn't contain any bare template parameter pack. */
16004 /* integral_constant_value will pull out this expression, so make sure
16005 it's folded as appropriate. */
16008 /* Create the enumerator. */
16010 }
16012 /* Parse a namespace-name.
16014 namespace-name:
16015 original-namespace-name
16016 namespace-alias
16018 Returns the NAMESPACE_DECL for the namespace. */
16020 static tree
16022 {
16023 tree identifier;
16024 tree namespace_decl;
16028 /* Get the name of the namespace. */
16033 /* Look up the identifier in the currently active scope. Look only
16034 for namespaces, due to:
16036 [basic.lookup.udir]
16038 When looking up a namespace-name in a using-directive or alias
16039 definition, only namespace names are considered.
16041 And:
16043 [basic.lookup.qual]
16045 During the lookup of a name preceding the :: scope resolution
16046 operator, object, function, and enumerator names are ignored.
16048 (Note that cp_parser_qualifying_entity only calls this
16049 function if the token after the name is the scope resolution
16050 operator.) */
16052 none_type,
16058 /* If it's not a namespace, issue an error. */
16061 {
16066 }
16069 }
16071 /* Parse a namespace-definition.
16073 namespace-definition:
16074 named-namespace-definition
16075 unnamed-namespace-definition
16077 named-namespace-definition:
16078 original-namespace-definition
16079 extension-namespace-definition
16081 original-namespace-definition:
16082 namespace identifier { namespace-body }
16084 extension-namespace-definition:
16085 namespace original-namespace-name { namespace-body }
16087 unnamed-namespace-definition:
16088 namespace { namespace-body } */
16090 static void
16092 {
16099 {
16103 }
16104 else
16107 /* Look for the `namespace' keyword. */
16110 /* Get the name of the namespace. We do not attempt to distinguish
16111 between an original-namespace-definition and an
16112 extension-namespace-definition at this point. The semantic
16113 analysis routines are responsible for that. */
16116 else
16119 /* Parse any specified attributes. */
16122 /* Look for the `{' to start the namespace. */
16124 /* Start the namespace. */
16127 /* "inline namespace" is equivalent to a stub namespace definition
16128 followed by a strong using directive. */
16130 {
16132 /* Set up namespace association. */
16136 /* Import the contents of the inline namespace. */
16140 }
16144 /* Parse the body of the namespace. */
16150 /* Finish the namespace. */
16152 /* Look for the final `}'. */
16154 }
16156 /* Parse a namespace-body.
16158 namespace-body:
16159 declaration-seq [opt] */
16161 static void
16163 {
16165 }
16167 /* Parse a namespace-alias-definition.
16169 namespace-alias-definition:
16170 namespace identifier = qualified-namespace-specifier ; */
16172 static void
16174 {
16175 tree identifier;
16176 tree namespace_specifier;
16180 /* Look for the `namespace' keyword. */
16182 /* Look for the identifier. */
16186 /* Look for the `=' token. */
16189 {
16191 /* Skip the definition. */
16196 }
16198 /* Look for the qualified-namespace-specifier. */
16199 namespace_specifier
16201 /* Look for the `;' token. */
16204 /* Register the alias in the symbol table. */
16206 }
16208 /* Parse a qualified-namespace-specifier.
16210 qualified-namespace-specifier:
16211 :: [opt] nested-name-specifier [opt] namespace-name
16213 Returns a NAMESPACE_DECL corresponding to the specified
16214 namespace. */
16216 static tree
16218 {
16219 /* Look for the optional `::'. */
16223 /* Look for the optional nested-name-specifier. */
16231 }
16233 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16234 access declaration.
16236 using-declaration:
16237 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16238 using :: unqualified-id ;
16240 access-declaration:
16241 qualified-id ;
16243 */
16245 static bool
16248 {
16252 tree decl;
16253 tree identifier;
16254 tree qscope;
16259 {
16262 }
16263 else
16264 {
16265 /* Look for the `using' keyword. */
16268 /* Peek at the next token. */
16270 /* See if it's `typename'. */
16272 {
16273 /* Remember that we've seen it. */
16275 /* Consume the `typename' token. */
16277 }
16278 }
16280 /* Look for the optional global scope qualification. */
16281 global_scope_p
16286 /* If we saw `typename', or didn't see `::', then there must be a
16287 nested-name-specifier present. */
16289 {
16295 {
16298 }
16299 }
16300 /* Otherwise, we could be in either of the two productions. In that
16301 case, treat the nested-name-specifier as optional. */
16302 else
16314 /* Something has already gone wrong; there's no need to parse
16315 further. Since an error has occurred, the return value of
16316 cp_parser_parse_definitely will be false, as required. */
16320 /* Parse the unqualified-id. */
16328 {
16333 }
16335 /* The function we call to handle a using-declaration is different
16336 depending on what scope we are in. */
16338 ;
16341 /* [namespace.udecl]
16343 A using declaration shall not name a template-id. */
16346 else
16347 {
16349 {
16350 /* Create the USING_DECL. */
16357 {
16360 }
16361 else
16362 /* Add it to the list of members in this class. */
16364 }
16365 else
16366 {
16368 identifier,
16375 {
16378 }
16381 else
16383 }
16384 }
16386 /* Look for the final `;'. */
16391 "access declarations are deprecated "
16392 "in favour of using-declarations; "
16396 }
16398 /* Parse an alias-declaration.
16400 alias-declaration:
16401 using identifier attribute-specifier-seq [opt] = type-id */
16403 static tree
16405 {
16407 location_t id_location;
16409 cp_decl_specifier_seq decl_specs;
16413 /* Look for the `using' keyword. */
16414 cp_token *using_token
16436 /* Now we are going to parse the type-id of the declaration. */
16438 /*
16439 [dcl.type]/3 says:
16441 "A type-specifier-seq shall not define a class or enumeration
16442 unless it appears in the type-id of an alias-declaration (7.1.3) that
16443 is not the declaration of a template-declaration."
16445 In other words, if we currently are in an alias template, the
16446 type-id should not define a type.
16448 So let's set parser->type_definition_forbidden_message in that
16449 case; cp_parser_check_type_definition (called by
16450 cp_parser_class_specifier) will then emit an error if a type is
16451 defined in the type-id. */
16453 {
16457 }
16461 /* Restore the error message if need be. */
16467 {
16470 }
16472 /* A typedef-name can also be introduced by an alias-declaration. The
16473 identifier following the using keyword becomes a typedef-name. It has
16474 the same semantics as if it were introduced by the typedef
16475 specifier. In particular, it does not define a new type and it shall
16476 not appear in the type-id. */
16481 {
16484 ds_attribute,
16485 attrs_token);
16486 }
16488 ds_typedef,
16489 using_token);
16491 ds_alias,
16492 using_token);
16501 else
16512 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16513 added into the symbol table; otherwise, return the TYPE_DECL. */
16517 {
16521 }
16524 }
16526 /* Parse a using-directive.
16528 using-directive:
16529 using namespace :: [opt] nested-name-specifier [opt]
16530 namespace-name ; */
16532 static void
16534 {
16535 tree namespace_decl;
16536 tree attribs;
16538 /* Look for the `using' keyword. */
16540 /* And the `namespace' keyword. */
16542 /* Look for the optional `::' operator. */
16544 /* And the optional nested-name-specifier. */
16550 /* Get the namespace being used. */
16552 /* And any specified attributes. */
16554 /* Update the symbol table. */
16556 /* Look for the final `;'. */
16558 }
16560 /* Parse an asm-definition.
16562 asm-definition:
16563 asm ( string-literal ) ;
16565 GNU Extension:
16567 asm-definition:
16568 asm volatile [opt] ( string-literal ) ;
16569 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16570 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16571 : asm-operand-list [opt] ) ;
16572 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16573 : asm-operand-list [opt]
16574 : asm-clobber-list [opt] ) ;
16575 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16576 : asm-clobber-list [opt]
16577 : asm-goto-list ) ; */
16579 static void
16581 {
16582 tree string;
16587 tree asm_stmt;
16595 /* Look for the `asm' keyword. */
16602 /* See if the next token is `volatile'. */
16605 {
16606 /* Remember that we saw the `volatile' keyword. */
16608 /* Consume the token. */
16610 }
16614 {
16615 /* Remember that we saw the `goto' keyword. */
16617 /* Consume the token. */
16619 }
16620 /* Look for the opening `('. */
16623 /* Look for the string. */
16626 {
16630 }
16632 /* If we're allowing GNU extensions, check for the extended assembly
16633 syntax. Unfortunately, the `:' tokens need not be separated by
16634 a space in C, and so, for compatibility, we tolerate that here
16635 too. Doing that means that we have to treat the `::' operator as
16636 two `:' tokens. */
16641 {
16646 /* The extended syntax was used. */
16649 /* Look for outputs. */
16651 {
16652 /* Consume the `:'. */
16654 /* Parse the output-operands. */
16656 CPP_COLON)
16658 CPP_SCOPE)
16660 CPP_CLOSE_PAREN)
16666 }
16667 /* If the next token is `::', there are no outputs, and the
16668 next token is the beginning of the inputs. */
16670 /* The inputs are coming next. */
16673 /* Look for inputs. */
16676 {
16677 /* Consume the `:' or `::'. */
16679 /* Parse the output-operands. */
16681 CPP_COLON)
16683 CPP_SCOPE)
16685 CPP_CLOSE_PAREN))
16690 }
16692 /* The clobbers are coming next. */
16695 /* Look for clobbers. */
16698 {
16700 /* Consume the `:' or `::'. */
16702 /* Parse the clobbers. */
16704 CPP_COLON)
16706 CPP_CLOSE_PAREN))
16708 }
16711 /* The labels are coming next. */
16714 /* Look for labels. */
16717 {
16719 /* Consume the `:' or `::'. */
16721 /* Parse the labels. */
16723 }
16727 }
16731 /* Look for the closing `)'. */
16739 {
16740 /* Create the ASM_EXPR. */
16742 {
16745 /* If the extended syntax was not used, mark the ASM_EXPR. */
16747 {
16753 }
16754 }
16755 else
16757 }
16758 }
16760 /* Declarators [gram.dcl.decl] */
16762 /* Parse an init-declarator.
16764 init-declarator:
16765 declarator initializer [opt]
16767 GNU Extension:
16769 init-declarator:
16770 declarator asm-specification [opt] attributes [opt] initializer [opt]
16772 function-definition:
16773 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16774 function-body
16775 decl-specifier-seq [opt] declarator function-try-block
16777 GNU Extension:
16779 function-definition:
16780 __extension__ function-definition
16782 TM Extension:
16784 function-definition:
16785 decl-specifier-seq [opt] declarator function-transaction-block
16787 The DECL_SPECIFIERS apply to this declarator. Returns a
16788 representation of the entity declared. If MEMBER_P is TRUE, then
16789 this declarator appears in a class scope. The new DECL created by
16790 this declarator is returned.
16792 The CHECKS are access checks that should be performed once we know
16793 what entity is being declared (and, therefore, what classes have
16794 befriended it).
16796 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16797 for a function-definition here as well. If the declarator is a
16798 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16799 be TRUE upon return. By that point, the function-definition will
16800 have been completely parsed.
16802 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16803 is FALSE.
16805 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16806 parsed declaration if it is an uninitialized single declarator not followed
16807 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16808 if present, will not be consumed. If returned, this declarator will be
16809 created with SD_INITIALIZED but will not call cp_finish_decl. */
16811 static tree
16820 {
16824 tree prefix_attributes;
16826 tree asm_specification;
16827 tree initializer;
16829 tree scope;
16831 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16832 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16833 "(...)". */
16843 /* Gather the attributes that were provided with the
16844 decl-specifiers. */
16847 /* Assume that this is not the declarator for a function
16848 definition. */
16852 /* Default arguments are only permitted for function parameters. */
16856 /* Defer access checks while parsing the declarator; we cannot know
16857 what names are accessible until we know what is being
16858 declared. */
16861 /* Parse the declarator. */
16863 declarator
16868 /* Gather up the deferred checks. */
16873 /* If the DECLARATOR was erroneous, there's no need to go
16874 further. */
16878 /* Check that the number of template-parameter-lists is OK. */
16888 /* Figure out what scope the entity declared by the DECLARATOR is
16889 located in. `grokdeclarator' sometimes changes the scope, so
16890 we compute it now. */
16893 /* Perform any lookups in the declared type which were thought to be
16894 dependent, but are not in the scope of the declarator. */
16895 decl_specifiers->type
16898 /* If we're allowing GNU extensions, look for an
16899 asm-specification. */
16901 {
16902 /* Look for an asm-specification. */
16905 }
16906 else
16909 /* Look for attributes. */
16913 /* Peek at the next token. */
16919 {
16920 /* Check to see if the token indicates the start of a
16921 function-definition. */
16923 {
16925 {
16926 /* If a function-definition should not appear here, issue an
16927 error message. */
16931 }
16933 location_t func_brace_location
16936 /* Neither attributes nor an asm-specification are allowed
16937 on a function-definition. */
16940 "an asm-specification is not allowed "
16944 "attributes are not allowed "
16946 /* This is a function-definition. */
16949 /* Parse the function definition. */
16952 decl_specifiers,
16953 declarator,
16954 prefix_attributes);
16955 else
16956 decl =
16957 (cp_parser_function_definition_from_specifiers_and_declarator
16961 {
16962 /* This is where the prologue starts... */
16965 }
16968 }
16969 }
16971 {
16972 /* A non-template declaration involving a function parameter list
16973 containing an implicit template parameter will be made into a
16974 template. If the resulting declaration is not going to be an
16975 actual function then finish the template scope here to prevent it.
16976 An error message will be issued once we have a decl to talk about.
16978 FIXME probably we should do type deduction rather than create an
16979 implicit template, but the standard currently doesn't allow it. */
16982 }
16984 /* [dcl.dcl]
16986 Only in function declarations for constructors, destructors, and
16987 type conversions can the decl-specifier-seq be omitted.
16989 We explicitly postpone this check past the point where we handle
16990 function-definitions because we tolerate function-definitions
16991 that are missing their return types in some modes. */
16993 {
16997 }
16999 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17003 {
17011 {
17017 }
17018 }
17019 else
17020 {
17021 /* If the init-declarator isn't initialized and isn't followed by a
17022 `,' or `;', it's not a valid init-declarator. */
17025 {
17028 else
17029 {
17032 }
17033 }
17036 }
17038 /* Because start_decl has side-effects, we should only call it if we
17039 know we're going ahead. By this point, we know that we cannot
17040 possibly be looking at any other construct. */
17043 /* Enter the newly declared entry in the symbol table. If we're
17044 processing a declaration in a class-specifier, we wait until
17045 after processing the initializer. */
17047 {
17054 /* Adjust location of decl if declarator->id_loc is more appropriate:
17055 set, and decl wasn't merged with another decl, in which case its
17056 location would be different from input_location, and more accurate. */
17061 }
17063 /* Enter the SCOPE. That way unqualified names appearing in the
17064 initializer will be looked up in SCOPE. */
17067 /* Perform deferred access control checks, now that we know in which
17068 SCOPE the declared entity resides. */
17070 {
17073 /* If the entity being declared is a function, pretend that we
17074 are in its scope. If it is a `friend', it may have access to
17075 things that would not otherwise be accessible. */
17077 {
17080 }
17082 /* Perform access checks for template parameters. */
17085 /* Perform the access control checks for the declarator and the
17086 decl-specifiers. */
17089 /* Restore the saved value. */
17092 }
17094 /* Parse the initializer. */
17099 {
17101 {
17105 else
17106 {
17107 /* If the declaration was erroneous, we don't really
17108 know what the user intended, so just silently
17109 consume the initializer. */
17117 }
17118 }
17119 else
17120 {
17121 /* We want to record the extra mangling scope for in-class
17122 initializers of class members and initializers of static data
17123 member templates. The former involves deferring
17124 parsing of the initializer until end of class as with default
17125 arguments. So right here we only handle the latter. */
17135 }
17136 }
17138 /* The old parser allows attributes to appear after a parenthesized
17139 initializer. Mark Mitchell proposed removing this functionality
17140 on the GCC mailing lists on 2002-08-13. This parser accepts the
17141 attributes -- but ignores them. */
17148 /* And now complain about a non-function implicit template. */
17153 /* For an in-class declaration, use `grokfield' to create the
17154 declaration. */
17156 {
17158 {
17161 }
17169 }
17171 /* Finish processing the declaration. But, skip member
17172 declarations. */
17174 {
17177 asm_specification,
17178 /* If the initializer is in parentheses, then this is
17179 a direct-initialization, which means that an
17180 `explicit' constructor is OK. Otherwise, an
17181 `explicit' constructor cannot be used. */
17184 }
17187 /* Core issue #226 (C++0x only): A default template-argument
17188 shall not be specified in a friend class template
17189 declaration. */
17198 {
17201 else
17203 }
17206 }
17208 /* Parse a declarator.
17210 declarator:
17211 direct-declarator
17212 ptr-operator declarator
17214 abstract-declarator:
17215 ptr-operator abstract-declarator [opt]
17216 direct-abstract-declarator
17218 GNU Extensions:
17220 declarator:
17221 attributes [opt] direct-declarator
17222 attributes [opt] ptr-operator declarator
17224 abstract-declarator:
17225 attributes [opt] ptr-operator abstract-declarator [opt]
17226 attributes [opt] direct-abstract-declarator
17228 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17229 detect constructor, destructor or conversion operators. It is set
17230 to -1 if the declarator is a name, and +1 if it is a
17231 function. Otherwise it is set to zero. Usually you just want to
17232 test for >0, but internally the negative value is used.
17234 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17235 a decl-specifier-seq unless it declares a constructor, destructor,
17236 or conversion. It might seem that we could check this condition in
17237 semantic analysis, rather than parsing, but that makes it difficult
17238 to handle something like `f()'. We want to notice that there are
17239 no decl-specifiers, and therefore realize that this is an
17240 expression, not a declaration.)
17242 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17243 the declarator is a direct-declarator of the form "(...)".
17245 MEMBER_P is true iff this declarator is a member-declarator.
17247 FRIEND_P is true iff this declarator is a friend. */
17251 cp_parser_declarator_kind dcl_kind,
17255 {
17258 cp_cv_quals cv_quals;
17259 tree class_type;
17262 /* Assume this is not a constructor, destructor, or type-conversion
17263 operator. */
17270 /* Check for the ptr-operator production. */
17272 /* Parse the ptr-operator. */
17278 /* If that worked, then we have a ptr-operator. */
17280 {
17281 /* If a ptr-operator was found, then this declarator was not
17282 parenthesized. */
17285 /* The dependent declarator is optional if we are parsing an
17286 abstract-declarator. */
17290 /* Parse the dependent declarator. */
17295 friend_p);
17297 /* If we are parsing an abstract-declarator, we must handle the
17298 case where the dependent declarator is absent. */
17303 declarator = cp_parser_make_indirect_declarator
17305 }
17306 /* Everything else is a direct-declarator. */
17307 else
17308 {
17311 CPP_OPEN_PAREN);
17313 ctor_dtor_or_conv_p,
17315 }
17320 }
17322 /* Parse a direct-declarator or direct-abstract-declarator.
17324 direct-declarator:
17325 declarator-id
17326 direct-declarator ( parameter-declaration-clause )
17327 cv-qualifier-seq [opt]
17328 ref-qualifier [opt]
17329 exception-specification [opt]
17330 direct-declarator [ constant-expression [opt] ]
17331 ( declarator )
17333 direct-abstract-declarator:
17334 direct-abstract-declarator [opt]
17335 ( parameter-declaration-clause )
17336 cv-qualifier-seq [opt]
17337 ref-qualifier [opt]
17338 exception-specification [opt]
17339 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17340 ( abstract-declarator )
17342 Returns a representation of the declarator. DCL_KIND is
17343 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17344 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17345 we are parsing a direct-declarator. It is
17346 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17347 of ambiguity we prefer an abstract declarator, as per
17348 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17349 as for cp_parser_declarator. */
17353 cp_parser_declarator_kind dcl_kind,
17356 {
17366 {
17367 /* Peek at the next token. */
17370 {
17371 /* This is either a parameter-declaration-clause, or a
17372 parenthesized declarator. When we know we are parsing a
17373 named declarator, it must be a parenthesized declarator
17374 if FIRST is true. For instance, `(int)' is a
17375 parameter-declaration-clause, with an omitted
17376 direct-abstract-declarator. But `((*))', is a
17377 parenthesized abstract declarator. Finally, when T is a
17378 template parameter `(T)' is a
17379 parameter-declaration-clause, and not a parenthesized
17380 named declarator.
17382 We first try and parse a parameter-declaration-clause,
17383 and then try a nested declarator (if FIRST is true).
17385 It is not an error for it not to be a
17386 parameter-declaration-clause, even when FIRST is
17387 false. Consider,
17389 int i (int);
17390 int i (3);
17392 The first is the declaration of a function while the
17393 second is the definition of a variable, including its
17394 initializer.
17396 Having seen only the parenthesis, we cannot know which of
17397 these two alternatives should be selected. Even more
17398 complex are examples like:
17400 int i (int (a));
17401 int i (int (3));
17403 The former is a function-declaration; the latter is a
17404 variable initialization.
17406 Thus again, we try a parameter-declaration-clause, and if
17407 that fails, we back out and return. */
17410 {
17411 tree params;
17414 /* In a member-declarator, the only valid interpretation
17415 of a parenthesis is the start of a
17416 parameter-declaration-clause. (It is invalid to
17417 initialize a static data member with a parenthesized
17418 initializer; only the "=" form of initialization is
17419 permitted.) */
17423 /* Consume the `('. */
17426 {
17427 /* If this is going to be an abstract declarator, we're
17428 in a declarator and we can't have default args. */
17431 }
17435 /* Parse the parameter-declaration-clause. */
17438 /* Consume the `)'. */
17441 /* If all went well, parse the cv-qualifier-seq,
17442 ref-qualifier and the exception-specification. */
17444 {
17445 cp_cv_quals cv_quals;
17446 cp_virt_specifiers virt_specifiers;
17447 cp_ref_qualifier ref_qual;
17448 tree exception_specification;
17449 tree late_return;
17450 tree attrs;
17460 /* Parse the cv-qualifier-seq. */
17462 /* Parse the ref-qualifier. */
17464 /* And the exception-specification. */
17465 exception_specification
17470 /* In here, we handle cases where attribute is used after
17471 the function declaration. For example:
17472 void func (int x) __attribute__((vector(..))); */
17475 {
17479 CPP_SEMICOLON)
17481 CPP_OPEN_BRACE))
17484 ;
17485 else
17487 }
17488 late_return = (cp_parser_late_return_type_opt
17493 /* Parse the virt-specifier-seq. */
17496 /* Create the function-declarator. */
17498 params,
17499 cv_quals,
17500 virt_specifiers,
17501 ref_qual,
17502 exception_specification,
17503 late_return);
17505 /* Any subsequent parameter lists are to do with
17506 return type, so are not those of the declared
17507 function. */
17509 }
17511 /* Remove the function parms from scope. */
17515 /* Repeat the main loop. */
17517 }
17519 /* If this is the first, we can try a parenthesized
17520 declarator. */
17522 {
17528 /* Consume the `('. */
17530 /* Parse the nested declarator. */
17533 declarator
17539 /* Expect a `)'. */
17546 }
17547 /* Otherwise, we must be done. */
17548 else
17550 }
17554 {
17555 /* Parse an array-declarator. */
17564 /* Consume the `['. */
17566 /* Peek at the next token. */
17568 /* If the next token is `]', then there is no
17569 constant-expression. */
17571 {
17573 bounds
17583 {
17584 /* Normally, the array bound must be an integral constant
17585 expression. However, as an extension, we allow VLAs
17586 in function scopes as long as they aren't part of a
17587 parameter declaration. */
17591 }
17594 {
17595 /* Remember this wasn't a constant-expression. */
17598 }
17599 }
17600 else
17602 /* Look for the closing `]'. */
17604 {
17607 }
17612 }
17614 {
17615 {
17616 tree qualifying_scope;
17617 tree unqualified_name;
17618 tree attrs;
17619 special_function_kind sfk;
17624 /* Parse a declarator-id */
17627 {
17630 /* If we see an ellipsis, we should be looking at a
17631 parameter pack. */
17633 {
17634 /* Consume the `...' */
17638 }
17639 }
17642 unqualified_name
17646 {
17650 {
17651 /* Check whether an error occurred. */
17654 /* We already consumed the ellipsis to mark a
17655 parameter pack, but we have no way to report it,
17656 so abort the tentative parse. We will be exiting
17657 immediately anyway. */
17659 }
17660 else
17666 && (qualifying_scope
17668 {
17671 }
17672 }
17677 {
17682 }
17688 {
17689 /* In the declaration of a member of a template class
17690 outside of the class itself, the SCOPE will sometimes
17691 be a TYPENAME_TYPE. For example, given:
17693 template <typename T>
17694 int S<T>::R::i = 3;
17696 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17697 this context, we must resolve S<T>::R to an ordinary
17698 type, rather than a typename type.
17700 The reason we normally avoid resolving TYPENAME_TYPEs
17701 is that a specialization of `S' might render
17702 `S<T>::R' not a type. However, if `S' is
17703 specialized, then this `i' will not be used, so there
17704 is no harm in resolving the types here. */
17705 tree type;
17707 /* Resolve the TYPENAME_TYPE. */
17710 /* If that failed, the declarator is invalid. */
17712 {
17715 "cannot define member of dependent typedef "
17717 else
17722 }
17724 }
17729 {
17730 tree class_type;
17735 else
17739 {
17742 {
17745 {
17749 "use %<%T::%D%> instead of %<%T::%D%> to "
17751 class_type,
17756 }
17757 else
17759 }
17760 else
17761 {
17762 /* We do not attempt to print the declarator
17763 here because we do not have enough
17764 information about its original syntactic
17765 form. */
17769 }
17770 }
17773 {
17779 for an anonymous type, even if the type
17780 got a name for linkage purposes. */
17782 /* Handle correctly (c++/19200):
17784 struct S {
17785 struct T{};
17786 friend void S(T);
17787 };
17789 and also:
17791 namespace N {
17792 void S();
17793 }
17795 struct S {
17796 friend void N::S();
17797 }; */
17798 && !(friend_p
17801 class_type))
17802 {
17805 }
17813 }
17814 }
17816 unqualified_name,
17817 sfk);
17824 }
17826 handle_declarator:;
17829 {
17830 /* Any names that appear after the declarator-id for a
17831 member are looked up in the containing scope. */
17833 {
17834 /* But declarations with qualified-ids can't appear in a
17835 function. */
17839 }
17841 }
17845 /* Default args are only allowed on function
17846 declarations. */
17848 else
17852 }
17853 /* We're done. */
17854 else
17856 }
17858 /* For an abstract declarator, we might wind up with nothing at this
17859 point. That's an error; the declarator is not optional. */
17863 /* If we entered a scope, we must exit it now. */
17871 }
17873 /* Parse a ptr-operator.
17875 ptr-operator:
17876 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17877 * cv-qualifier-seq [opt]
17878 &
17879 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17880 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17882 GNU Extension:
17884 ptr-operator:
17885 & cv-qualifier-seq [opt]
17887 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17888 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17889 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17890 filled in with the TYPE containing the member. *CV_QUALS is
17891 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17892 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17893 Note that the tree codes returned by this function have nothing
17894 to do with the types of trees that will be eventually be created
17895 to represent the pointer or reference type being parsed. They are
17896 just constants with suggestive names. */
17897 static enum tree_code
17902 {
17907 /* Assume that it's not a pointer-to-member. */
17909 /* And that there are no cv-qualifiers. */
17912 /* Peek at the next token. */
17915 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17925 {
17926 /* Consume the `*', `&' or `&&'. */
17929 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17930 `&', if we are allowing GNU extensions. (The only qualifier
17931 that can legally appear after `&' is `restrict', but that is
17932 enforced during semantic analysis. */
17940 }
17941 else
17942 {
17943 /* Try the pointer-to-member case. */
17945 /* Look for the optional `::' operator. */
17948 /* Look for the nested-name specifier. */
17955 /* If we found it, and the next token is a `*', then we are
17956 indeed looking at a pointer-to-member operator. */
17959 {
17960 /* Indicate that the `*' operator was used. */
17968 else
17969 {
17970 /* The type of which the member is a member is given by the
17971 current SCOPE. */
17973 /* The next name will not be qualified. */
17977 /* Look for optional c++11 attributes. */
17981 /* Look for the optional cv-qualifier-seq. */
17983 }
17984 }
17985 /* If that didn't work we don't have a ptr-operator. */
17988 }
17991 }
17993 /* Parse an (optional) cv-qualifier-seq.
17995 cv-qualifier-seq:
17996 cv-qualifier cv-qualifier-seq [opt]
17998 cv-qualifier:
17999 const
18000 volatile
18002 GNU Extension:
18004 cv-qualifier:
18005 __restrict__
18007 Returns a bitmask representing the cv-qualifiers. */
18009 static cp_cv_quals
18011 {
18015 {
18017 cp_cv_quals cv_qualifier;
18019 /* Peek at the next token. */
18021 /* See if it's a cv-qualifier. */
18023 {
18039 }
18045 {
18048 }
18049 else
18050 {
18053 }
18054 }
18057 }
18059 /* Parse an (optional) ref-qualifier
18061 ref-qualifier:
18062 &
18063 &&
18065 Returns cp_ref_qualifier representing ref-qualifier. */
18067 static cp_ref_qualifier
18069 {
18072 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18077 {
18082 {
18094 }
18099 {
18102 }
18103 else
18104 {
18107 }
18108 }
18111 }
18113 /* Parse an (optional) virt-specifier-seq.
18115 virt-specifier-seq:
18116 virt-specifier virt-specifier-seq [opt]
18118 virt-specifier:
18119 override
18120 final
18122 Returns a bitmask representing the virt-specifiers. */
18124 static cp_virt_specifiers
18126 {
18130 {
18132 cp_virt_specifiers virt_specifier;
18134 /* Peek at the next token. */
18136 /* See if it's a virt-specifier-qualifier. */
18140 {
18143 }
18145 {
18148 }
18150 {
18152 }
18153 else
18157 {
18160 }
18161 else
18162 {
18165 }
18166 }
18168 }
18170 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18171 is in scope even though it isn't real. */
18173 void
18175 {
18176 tree this_parm;
18179 {
18180 /* We don't clear this between NSDMIs. Is it already what we want? */
18185 }
18188 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18190 current_class_ref
18193 }
18195 /* Return true iff our current scope is a non-static data member
18196 initializer. */
18198 bool
18200 {
18201 /* We recognize NSDMI context by the context-less 'this' pointer set up
18202 by the function above. */
18206 }
18208 /* Parse a late-specified return type, if any. This is not a separate
18209 non-terminal, but part of a function declarator, which looks like
18211 -> trailing-type-specifier-seq abstract-declarator(opt)
18213 Returns the type indicated by the type-id.
18215 In addition to this this parses any queued up omp declare simd
18216 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18218 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18219 function. */
18221 static tree
18223 cp_cv_quals quals)
18224 {
18228 && declarator
18234 /* Peek at the next token. */
18236 /* A late-specified return type is indicated by an initial '->'. */
18243 {
18244 /* DR 1207: 'this' is in scope in the trailing return type. */
18246 }
18249 {
18250 /* Consume the ->. */
18254 }
18257 declarator->std_attributes
18261 declarator->std_attributes
18266 {
18269 }
18272 }
18274 /* Parse a declarator-id.
18276 declarator-id:
18277 id-expression
18278 :: [opt] nested-name-specifier [opt] type-name
18280 In the `id-expression' case, the value returned is as for
18281 cp_parser_id_expression if the id-expression was an unqualified-id.
18282 If the id-expression was a qualified-id, then a SCOPE_REF is
18283 returned. The first operand is the scope (either a NAMESPACE_DECL
18284 or TREE_TYPE), but the second is still just a representation of an
18285 unqualified-id. */
18287 static tree
18289 {
18290 tree id;
18291 /* The expression must be an id-expression. Assume that qualified
18292 names are the names of types so that:
18294 template <class T>
18295 int S<T>::R::i = 3;
18297 will work; we must treat `S<T>::R' as the name of a type.
18298 Similarly, assume that qualified names are templates, where
18299 required, so that:
18301 template <class T>
18302 int S<T>::R<T>::i = 3;
18304 will work, too. */
18310 optional_p);
18314 }
18316 /* Parse a type-id.
18318 type-id:
18319 type-specifier-seq abstract-declarator [opt]
18321 Returns the TYPE specified. */
18323 static tree
18326 {
18327 cp_decl_specifier_seq type_specifier_seq;
18330 /* Parse the type-specifier-seq. */
18332 is_trailing_return,
18337 /* There might or might not be an abstract declarator. */
18339 /* Look for the declarator. */
18340 abstract_declarator
18345 /* Check to see if there really was a declarator. */
18350 /* None of the valid uses of 'auto' in C++14 involve the type-id
18351 nonterminal, but it is valid in a trailing-return-type. */
18354 {
18355 /* A type-id with type 'auto' is only ok if the abstract declarator
18356 is a function declarator with a late-specified return type. */
18361 else
18362 {
18365 }
18366 }
18369 is_template_arg);
18370 }
18373 {
18375 }
18378 {
18379 tree r;
18381 parser->type_definition_forbidden_message
18386 {
18389 }
18391 }
18394 {
18396 }
18398 /* Parse a type-specifier-seq.
18400 type-specifier-seq:
18401 type-specifier type-specifier-seq [opt]
18403 GNU extension:
18405 type-specifier-seq:
18406 attributes type-specifier-seq [opt]
18408 If IS_DECLARATION is true, we are at the start of a "condition" or
18409 exception-declaration, so we might be followed by a declarator-id.
18411 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18412 i.e. we've just seen "->".
18414 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18416 static void
18421 {
18426 /* Clear the TYPE_SPECIFIER_SEQ. */
18429 /* In the context of a trailing return type, enum E { } is an
18430 elaborated-type-specifier followed by a function-body, not an
18431 enum-specifier. */
18435 /* Parse the type-specifiers and attributes. */
18437 {
18438 tree type_specifier;
18441 /* Check for attributes first. */
18443 {
18448 }
18450 /* record the token of the beginning of the type specifier seq,
18451 for error reporting purposes*/
18455 /* Look for the type-specifier. */
18457 flags,
18458 type_specifier_seq,
18460 NULL,
18463 {
18464 /* If the first type-specifier could not be found, this is not a
18465 type-specifier-seq at all. */
18467 {
18468 /* Set in_declarator_p to avoid skipping to the semicolon. */
18480 }
18481 /* If subsequent type-specifiers could not be found, the
18482 type-specifier-seq is complete. */
18484 }
18487 /* The standard says that a condition can be:
18489 type-specifier-seq declarator = assignment-expression
18491 However, given:
18493 struct S {};
18494 if (int S = ...)
18496 we should treat the "S" as a declarator, not as a
18497 type-specifier. The standard doesn't say that explicitly for
18498 type-specifier-seq, but it does say that for
18499 decl-specifier-seq in an ordinary declaration. Perhaps it
18500 would be clearer just to allow a decl-specifier-seq here, and
18501 then add a semantic restriction that if any decl-specifiers
18502 that are not type-specifiers appear, the program is invalid. */
18505 }
18506 }
18508 /* Return whether the function currently being declared has an associated
18509 template parameter list. */
18511 static bool
18513 {
18526 }
18528 /* Parse a parameter-declaration-clause.
18530 parameter-declaration-clause:
18531 parameter-declaration-list [opt] ... [opt]
18532 parameter-declaration-list , ...
18534 Returns a representation for the parameter declarations. A return
18535 value of NULL indicates a parameter-declaration-clause consisting
18536 only of an ellipsis. */
18538 static tree
18540 {
18541 tree parameters;
18550 parser->auto_is_implicit_function_template_parm_p
18552 }
18558 && !processing_template_parmlist
18564 /* Peek at the next token. */
18566 /* Check for trivial parameter-declaration-clauses. */
18568 {
18569 /* Consume the `...' token. */
18572 }
18574 /* There are no parameters. */
18575 {
18576 #ifndef NO_IMPLICIT_EXTERN_C
18581 else
18582 #endif
18584 }
18585 /* Check for `(void)', too, which is a special case. */
18589 {
18590 /* Consume the `void' token. */
18592 /* There are no parameters. */
18594 }
18596 /* Parse the parameter-declaration-list. */
18598 /* If a parse error occurred while parsing the
18599 parameter-declaration-list, then the entire
18600 parameter-declaration-clause is erroneous. */
18604 /* Peek at the next token. */
18606 /* If it's a `,', the clause should terminate with an ellipsis. */
18608 {
18609 /* Consume the `,'. */
18611 /* Expect an ellipsis. */
18612 ellipsis_p
18614 }
18615 /* It might also be `...' if the optional trailing `,' was
18616 omitted. */
18618 {
18619 /* Consume the `...' token. */
18621 /* And remember that we saw it. */
18623 }
18624 else
18627 /* Finish the parameter list. */
18632 }
18634 /* Parse a parameter-declaration-list.
18636 parameter-declaration-list:
18637 parameter-declaration
18638 parameter-declaration-list , parameter-declaration
18640 Returns a representation of the parameter-declaration-list, as for
18641 cp_parser_parameter_declaration_clause. However, the
18642 `void_list_node' is never appended to the list. Upon return,
18643 *IS_ERROR will be true iff an error occurred. */
18645 static tree
18647 {
18653 /* Assume all will go well. */
18655 /* The special considerations that apply to a function within an
18656 unbraced linkage specifications do not apply to the parameters
18657 to the function. */
18658 saved_in_unbraced_linkage_specification_p
18662 /* Look for more parameters. */
18664 {
18672 /* Parse the parameter. */
18673 parameter
18678 /* We don't know yet if the enclosing context is deprecated, so wait
18679 and warn in grokparms if appropriate. */
18683 {
18684 /* If a function parameter pack was specified and an implicit template
18685 parameter was introduced during cp_parser_parameter_declaration,
18686 change any implicit parameters introduced into packs. */
18690 {
18698 }
18702 PARM,
18705 }
18709 /* If a parse error occurred parsing the parameter declaration,
18710 then the entire parameter-declaration-list is erroneous. */
18712 {
18716 }
18726 {
18730 }
18732 /* Add the new parameter to the list. */
18736 /* Peek at the next token. */
18739 /* These are for Objective-C++ */
18742 /* The parameter-declaration-list is complete. */
18745 {
18748 /* Peek at the next token. */
18750 /* If it's an ellipsis, then the list is complete. */
18753 /* Otherwise, there must be more parameters. Consume the
18754 `,'. */
18756 /* When parsing something like:
18758 int i(float f, double d)
18760 we can tell after seeing the declaration for "f" that we
18761 are not looking at an initialization of a variable "i",
18762 but rather at the declaration of a function "i".
18764 Due to the fact that the parsing of template arguments
18765 (as specified to a template-id) requires backtracking we
18766 cannot use this technique when inside a template argument
18767 list. */
18771 /* However, a parameter-declaration of the form
18772 "float(f)" (which is a valid declaration of a
18773 parameter "f") can also be interpreted as an
18774 expression (the conversion of "f" to "float"). */
18777 }
18778 else
18779 {
18787 }
18788 }
18790 parser->in_unbraced_linkage_specification_p
18793 /* Reset implicit_template_scope if we are about to leave the function
18794 parameter list that introduced it. Note that for out-of-line member
18795 definitions, there will be one or more class scopes before we get to
18796 the template parameter scope. */
18800 {
18804 {
18807 }
18808 }
18811 }
18813 /* Parse a parameter declaration.
18815 parameter-declaration:
18816 decl-specifier-seq ... [opt] declarator
18817 decl-specifier-seq declarator = assignment-expression
18818 decl-specifier-seq ... [opt] abstract-declarator [opt]
18819 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18821 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18822 declares a template parameter. (In that case, a non-nested `>'
18823 token encountered during the parsing of the assignment-expression
18824 is not interpreted as a greater-than operator.)
18826 Returns a representation of the parameter, or NULL if an error
18827 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18828 true iff the declarator is of the form "(p)". */
18834 {
18836 cp_decl_specifier_seq decl_specifiers;
18838 tree default_argument;
18842 /* In a template parameter, `>' is not an operator.
18844 [temp.param]
18846 When parsing a default template-argument for a non-type
18847 template-parameter, the first non-nested `>' is taken as the end
18848 of the template parameter-list rather than a greater-than
18849 operator. */
18851 /* Type definitions may not appear in parameter types. */
18853 parser->type_definition_forbidden_message
18856 /* Parse the declaration-specifiers. */
18858 CP_PARSER_FLAGS_NONE,
18862 /* Complain about missing 'typename' or other invalid type names. */
18867 /* If an error occurred, there's no reason to attempt to parse the
18868 rest of the declaration. */
18870 {
18873 }
18875 /* Peek at the next token. */
18878 /* If the next token is a `)', `,', `=', `>', or `...', then there
18879 is no declarator. However, when variadic templates are enabled,
18880 there may be a declarator following `...'. */
18885 {
18889 }
18890 /* Otherwise, there should be a declarator. */
18891 else
18892 {
18896 /* After seeing a decl-specifier-seq, if the next token is not a
18897 "(", there is no possibility that the code is a valid
18898 expression. Therefore, if parsing tentatively, we commit at
18899 this point. */
18901 /* In an expression context, having seen:
18903 (int((char ...
18905 we cannot be sure whether we are looking at a
18906 function-type (taking a "char" as a parameter) or a cast
18907 of some object of type "char" to "int". */
18913 /* Parse the declarator. */
18916 CP_PARSER_DECLARATOR_EITHER,
18918 parenthesized_p,
18922 /* After the declarator, allow more attributes. */
18923 decl_specifiers.attributes
18926 }
18928 /* If the next token is an ellipsis, and we have not seen a
18929 declarator name, and the type of the declarator contains parameter
18930 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18931 a parameter pack expansion expression. Otherwise, leave the
18932 ellipsis for a C-style variadic function. */
18935 {
18946 {
18947 /* Consume the `...'. */
18951 /* Build a pack expansion type */
18954 else
18956 }
18957 }
18959 /* The restriction on defining new types applies only to the type
18960 of the parameter, not to the default argument. */
18963 /* If the next token is `=', then process a default argument. */
18965 {
18967 /* If we are defining a class, then the tokens that make up the
18968 default argument must be saved and processed later. */
18973 /* Outside of a class definition, we can just parse the
18974 assignment-expression. */
18975 else
18976 default_argument
18980 {
18983 else
18984 {
18986 "default arguments are only "
18989 }
18990 }
18994 {
18995 /* Find the name of the parameter pack. */
19002 template_parm_p
19008 else
19010 template_parm_p
19017 }
19018 }
19019 else
19023 declarator,
19024 default_argument);
19025 }
19027 /* Parse a default argument and return it.
19029 TEMPLATE_PARM_P is true if this is a default argument for a
19030 non-type template parameter. */
19031 static tree
19033 {
19039 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19040 set correctly. */
19043 /* Local variable names (and the `this' keyword) may not
19044 appear in a default argument. */
19047 /* Parse the assignment-expression. */
19052 /* The "this" pointer is not valid in a default argument. */
19054 {
19059 }
19060 default_argument
19062 /* Restore the "this" pointer. */
19064 {
19067 }
19076 }
19078 /* Parse a function-body.
19080 function-body:
19081 compound_statement */
19083 static void
19085 {
19087 }
19089 /* Parse a ctor-initializer-opt followed by a function-body. Return
19090 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19091 is true we are parsing a function-try-block. */
19093 static bool
19096 {
19104 /* Begin the function body. */
19106 /* Parse the optional ctor-initializer. */
19109 /* If we're parsing a constexpr constructor definition, we need
19110 to check that the constructor body is indeed empty. However,
19111 before we get to cp_parser_function_body lot of junk has been
19112 generated, so we can't just check that we have an empty block.
19113 Rather we take a snapshot of the outermost block, and check whether
19114 cp_parser_function_body changed its state. */
19116 {
19120 }
19121 /* Parse the function-body. */
19125 /* Finish the function body. */
19129 }
19131 /* Parse an initializer.
19133 initializer:
19134 = initializer-clause
19135 ( expression-list )
19137 Returns an expression representing the initializer. If no
19138 initializer is present, NULL_TREE is returned.
19140 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19141 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19142 set to TRUE if there is no initializer present. If there is an
19143 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19144 is set to true; otherwise it is set to false. */
19146 static tree
19149 {
19151 tree init;
19153 /* Peek at the next token. */
19156 /* Let our caller know whether or not this initializer was
19157 parenthesized. */
19159 /* Assume that the initializer is constant. */
19163 {
19164 /* Consume the `='. */
19166 /* Parse the initializer-clause. */
19168 }
19170 {
19175 non_constant_p);
19180 }
19182 {
19187 }
19188 else
19189 {
19190 /* Anything else is an error. */
19193 }
19196 }
19198 /* Parse an initializer-clause.
19200 initializer-clause:
19201 assignment-expression
19202 braced-init-list
19204 Returns an expression representing the initializer.
19206 If the `assignment-expression' production is used the value
19207 returned is simply a representation for the expression.
19209 Otherwise, calls cp_parser_braced_list. */
19211 static tree
19213 {
19214 tree initializer;
19216 /* Assume the expression is constant. */
19219 /* If it is not a `{', then we are looking at an
19220 assignment-expression. */
19222 {
19223 initializer
19226 non_constant_p);
19227 }
19228 else
19232 }
19234 /* Parse a brace-enclosed initializer list.
19236 braced-init-list:
19237 { initializer-list , [opt] }
19238 { }
19240 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19241 the elements of the initializer-list (or NULL, if the last
19242 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19243 NULL_TREE. There is no way to detect whether or not the optional
19244 trailing `,' was provided. NON_CONSTANT_P is as for
19245 cp_parser_initializer. */
19247 static tree
19249 {
19250 tree initializer;
19252 /* Consume the `{' token. */
19254 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19256 /* If it's not a `}', then there is a non-trivial initializer. */
19258 {
19259 /* Parse the initializer list. */
19262 /* A trailing `,' token is allowed. */
19265 }
19266 else
19268 /* Now, there should be a trailing `}'. */
19272 }
19274 /* Consume tokens up to, and including, the next non-nested closing `]'.
19275 Returns true iff we found a closing `]'. */
19277 static bool
19279 {
19283 {
19287 {
19290 /* If we've run out of tokens, then there is no closing `]'. */
19299 {
19302 }
19307 }
19309 /* Consume the token. */
19311 }
19312 }
19314 /* Return true if we are looking at an array-designator, false otherwise. */
19316 static bool
19318 {
19319 /* Consume the `['. */
19324 /* Skip tokens until the next token is a closing square bracket.
19325 If we find the closing `]', and the next token is a `=', then
19326 we are looking at an array designator. */
19327 bool array_designator_p
19331 /* Roll back the tokens we skipped. */
19335 }
19337 /* Parse an initializer-list.
19339 initializer-list:
19340 initializer-clause ... [opt]
19341 initializer-list , initializer-clause ... [opt]
19343 GNU Extension:
19345 initializer-list:
19346 designation initializer-clause ...[opt]
19347 initializer-list , designation initializer-clause ...[opt]
19349 designation:
19350 . identifier =
19351 identifier :
19352 [ constant-expression ] =
19354 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19355 for the initializer. If the INDEX of the elt is non-NULL, it is the
19356 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19357 as for cp_parser_initializer. */
19361 {
19364 /* Assume all of the expressions are constant. */
19367 /* Parse the rest of the list. */
19369 {
19371 tree designator;
19372 tree initializer;
19375 /* If the next token is an identifier and the following one is a
19376 colon, we are looking at the GNU designated-initializer
19377 syntax. */
19381 {
19382 /* Warn the user that they are using an extension. */
19385 /* Consume the identifier. */
19387 /* Consume the `:'. */
19389 }
19390 /* Also handle the C99 syntax, '. id ='. */
19395 {
19396 /* Warn the user that they are using an extension. */
19399 /* Consume the `.'. */
19401 /* Consume the identifier. */
19403 /* Consume the `='. */
19405 }
19406 /* Also handle C99 array designators, '[ const ] ='. */
19410 {
19411 /* In C++11, [ could start a lambda-introducer. */
19417 {
19420 }
19421 else
19422 {
19427 }
19433 }
19434 else
19437 /* Parse the initializer. */
19440 /* If any clause is non-constant, so is the entire initializer. */
19444 /* If we have an ellipsis, this is an initializer pack
19445 expansion. */
19447 {
19448 /* Consume the `...'. */
19451 /* Turn the initializer into an initializer expansion. */
19453 }
19455 /* Add it to the vector. */
19458 /* If the next token is not a comma, we have reached the end of
19459 the list. */
19463 /* Peek at the next token. */
19465 /* If the next token is a `}', then we're still done. An
19466 initializer-clause can have a trailing `,' after the
19467 initializer-list and before the closing `}'. */
19471 /* Consume the `,' token. */
19473 }
19476 }
19478 /* Classes [gram.class] */
19480 /* Parse a class-name.
19482 class-name:
19483 identifier
19484 template-id
19486 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19487 to indicate that names looked up in dependent types should be
19488 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19489 keyword has been used to indicate that the name that appears next
19490 is a template. TAG_TYPE indicates the explicit tag given before
19491 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19492 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19493 is the class being defined in a class-head.
19495 Returns the TYPE_DECL representing the class. */
19497 static tree
19505 {
19506 tree decl;
19507 tree scope;
19512 /* All class-names start with an identifier. */
19515 {
19518 }
19520 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19521 to a template-id, so we save it here. */
19526 /* Any name names a type if we're following the `typename' keyword
19527 in a qualified name where the enclosing scope is type-dependent. */
19530 /* Handle the common case (an identifier, but not a template-id)
19531 efficiently. */
19534 {
19538 /* Look for the identifier. */
19542 /* If the next token isn't an identifier, we are certainly not
19543 looking at a class-name. */
19546 /* If we know this is a type-name, there's no need to look it
19547 up. */
19550 else
19551 {
19552 tree ambiguous_decls;
19553 /* If we already know that this lookup is ambiguous, then
19554 we've already issued an error message; there's no reason
19555 to check again. */
19557 {
19560 }
19561 /* If the next token is a `::', then the name must be a type
19562 name.
19564 [basic.lookup.qual]
19566 During the lookup for a name preceding the :: scope
19567 resolution operator, object, function, and enumerator
19568 names are ignored. */
19571 /* Look up the name. */
19573 tag_type,
19576 check_dependency_p,
19580 {
19584 }
19585 }
19586 }
19587 else
19588 {
19589 /* Try a template-id. */
19591 check_dependency_p,
19592 tag_type,
19593 is_declaration);
19596 }
19600 /* If this is a typename, create a TYPENAME_TYPE. */
19602 {
19607 }
19611 /* Check to see that it is really the name of a class. */
19615 /* Situations like this:
19617 template <typename T> struct A {
19618 typename T::template X<int>::I i;
19619 };
19621 are problematic. Is `T::template X<int>' a class-name? The
19622 standard does not seem to be definitive, but there is no other
19623 valid interpretation of the following `::'. Therefore, those
19624 names are considered class-names. */
19625 {
19629 }
19633 /* In Objective-C 2.0, a classname followed by '.' starts a
19634 dot-syntax expression, and it's not a type-name. */
19646 }
19648 /* Parse a class-specifier.
19650 class-specifier:
19651 class-head { member-specification [opt] }
19653 Returns the TREE_TYPE representing the class. */
19655 static tree
19657 {
19658 tree type;
19672 /* Parse the class-head. */
19675 /* If the class-head was a semantic disaster, skip the entire body
19676 of the class. */
19678 {
19682 }
19684 /* Look for the `{'. */
19686 {
19689 }
19693 /* Issue an error message if type-definitions are forbidden here. */
19695 /* Remember that we are defining one more class. */
19697 /* Inside the class, surrounding template-parameter-lists do not
19698 apply. */
19699 saved_num_template_parameter_lists
19702 /* We are not in a function body. */
19705 /* Or in a loop. */
19708 /* Or in a switch. */
19711 /* We are not immediately inside an extern "lang" block. */
19712 saved_in_unbraced_linkage_specification_p
19716 /* Start the class. */
19718 {
19721 }
19725 /* If the type is erroneous, skip the entire body of the class. */
19727 else
19728 /* Parse the member-specification. */
19731 /* Look for the trailing `}'. */
19733 /* Look for trailing attributes to apply to this class. */
19741 /* We've finished a type definition. Check for the common syntax
19742 error of forgetting a semicolon after the definition. We need to
19743 be careful, as we can't just check for not-a-semicolon and be done
19744 with it; the user might have typed:
19746 class X { } c = ...;
19747 class X { } *p = ...;
19749 and so forth. Instead, enumerate all the possible tokens that
19750 might follow this production; if we don't see one of them, then
19751 complain and silently insert the semicolon. */
19752 {
19757 /* Don't try to parse c++11 attributes here. As per the
19758 grammar, that should be a task for
19759 cp_parser_decl_specifier_seq. */
19763 {
19774 /* While it's legal for type qualifiers and storage class
19775 specifiers to follow type definitions in the grammar, only
19776 compiler testsuites contain code like that. Assume that if
19777 we see such code, then what we're really seeing is a case
19778 like:
19780 class X { }
19781 const <type> var = ...;
19783 or
19785 class Y { }
19786 static <type> func (...) ...
19788 i.e. the qualifier or specifier applies to the next
19789 declaration. To do so, however, we need to look ahead one
19790 more token to see if *that* token is a type specifier.
19792 This code could be improved to handle:
19794 class Z { }
19795 static const <type> var = ...; */
19798 {
19801 /* Handling user-defined types here would be nice, but very
19802 tricky. */
19803 want_semicolon
19806 }
19810 }
19812 /* If we don't have a type, then something is very wrong and we
19813 shouldn't try to do anything clever. Likewise for not seeing the
19814 closing brace. */
19816 {
19817 cp_token_position prev
19828 else
19831 /* Unget one token and smash it to look as though we encountered
19832 a semicolon in the input stream. */
19837 }
19838 }
19840 /* If this class is not itself within the scope of another class,
19841 then we need to parse the bodies of all of the queued function
19842 definitions. Note that the queued functions defined in a class
19843 are not always processed immediately following the
19844 class-specifier for that class. Consider:
19846 struct A {
19847 struct B { void f() { sizeof (A); } };
19848 };
19850 If `f' were processed before the processing of `A' were
19851 completed, there would be no way to compute the size of `A'.
19852 Note that the nesting we are interested in here is lexical --
19853 not the semantic nesting given by TYPE_CONTEXT. In particular,
19854 for:
19856 struct A { struct B; };
19857 struct A::B { void f() { } };
19859 there is no need to delay the parsing of `A::B::f'. */
19861 {
19862 tree decl;
19869 /* In a first pass, parse default arguments to the functions.
19870 Then, in a second pass, parse the bodies of the functions.
19871 This two-phased approach handles cases like:
19873 struct S {
19874 void f() { g(); }
19875 void g(int i = 3);
19876 };
19878 */
19880 {
19882 /* If there are default arguments that have not yet been processed,
19883 take care of them now. */
19885 {
19890 }
19891 /* Make sure that any template parameters are in scope. */
19893 /* Parse the default argument expressions. */
19895 /* Remove any template parameters from the symbol table. */
19897 }
19899 /* Now parse any NSDMIs. */
19903 {
19905 {
19910 }
19913 }
19920 /* Now do some post-NSDMI bookkeeping. */
19926 /* Now parse the body of the functions. */
19928 {
19929 /* OpenMP UDRs need to be parsed before all other functions. */
19936 }
19937 else
19941 }
19942 else
19945 /* Put back any saved access checks. */
19948 /* Restore saved state. */
19952 parser->num_template_parameter_lists
19954 parser->in_unbraced_linkage_specification_p
19958 }
19960 static tree
19962 {
19963 tree ret;
19968 }
19970 /* Parse a class-head.
19972 class-head:
19973 class-key identifier [opt] base-clause [opt]
19974 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19975 class-key nested-name-specifier [opt] template-id
19976 base-clause [opt]
19978 class-virt-specifier:
19979 final
19981 GNU Extensions:
19982 class-key attributes identifier [opt] base-clause [opt]
19983 class-key attributes nested-name-specifier identifier base-clause [opt]
19984 class-key attributes nested-name-specifier [opt] template-id
19985 base-clause [opt]
19987 Upon return BASES is initialized to the list of base classes (or
19988 NULL, if there are none) in the same form returned by
19989 cp_parser_base_clause.
19991 Returns the TYPE of the indicated class. Sets
19992 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19993 involving a nested-name-specifier was used, and FALSE otherwise.
19995 Returns error_mark_node if this is not a class-head.
19997 Returns NULL_TREE if the class-head is syntactically valid, but
19998 semantically invalid in a way that means we should skip the entire
19999 body of the class. */
20001 static tree
20004 {
20005 tree nested_name_specifier;
20009 tree attributes;
20010 tree bases;
20020 /* Assume no nested-name-specifier will be present. */
20022 /* Assume no template parameter lists will be used in defining the
20023 type. */
20027 /* Look for the class-key. */
20032 /* Parse the attributes. */
20035 /* If the next token is `::', that is invalid -- but sometimes
20036 people do try to write:
20038 struct ::S {};
20040 Handle this gracefully by accepting the extra qualifier, and then
20041 issuing an error about it later if this really is a
20042 class-head. If it turns out just to be an elaborated type
20043 specifier, remain silent. */
20049 /* Determine the name of the class. Begin by looking for an
20050 optional nested-name-specifier. */
20052 nested_name_specifier
20058 /* If there was a nested-name-specifier, then there *must* be an
20059 identifier. */
20061 {
20063 /* Although the grammar says `identifier', it really means
20064 `class-name' or `template-name'. You are only allowed to
20065 define a class that has already been declared with this
20066 syntax.
20068 The proposed resolution for Core Issue 180 says that wherever
20069 you see `class T::X' you should treat `X' as a type-name.
20071 It is OK to define an inaccessible class; for example:
20073 class A { class B; };
20074 class A::B {};
20076 We do not know if we will see a class-name, or a
20077 template-name. We look for a class-name first, in case the
20078 class-name is a template-id; if we looked for the
20079 template-name first we would stop after the template-name. */
20084 class_type,
20088 /* If that didn't work, ignore the nested-name-specifier. */
20090 {
20096 }
20097 /* If we could not find a corresponding TYPE, treat this
20098 declaration like an unqualified declaration. */
20101 /* Otherwise, count the number of templates used in TYPE and its
20102 containing scopes. */
20103 else
20104 {
20105 tree scope;
20117 }
20118 }
20119 /* Otherwise, the identifier is optional. */
20120 else
20121 {
20122 /* We don't know whether what comes next is a template-id,
20123 an identifier, or nothing at all. */
20125 /* Check for a template-id. */
20130 class_key,
20132 /* If that didn't work, it could still be an identifier. */
20134 {
20136 {
20139 }
20140 else
20142 }
20143 else
20144 {
20147 }
20148 }
20153 {
20155 class_key,
20157 }
20160 /* If it's not a `:' or a `{' then we can't really be looking at a
20161 class-head, since a class-head only appears as part of a
20162 class-specifier. We have to detect this situation before calling
20163 xref_tag, since that has irreversible side-effects. */
20165 {
20169 }
20171 /* At this point, we're going ahead with the class-specifier, even
20172 if some other problem occurs. */
20175 {
20180 }
20181 /* Issue the error about the overly-qualified name now. */
20183 {
20188 }
20190 {
20195 }
20197 {
20198 tree scope;
20200 /* Reject typedef-names in class heads. */
20202 {
20205 type);
20208 }
20210 /* Figure out in what scope the declaration is being placed. */
20212 /* If that scope does not contain the scope in which the
20213 class was originally declared, the program is invalid. */
20215 {
20218 "declaration of %qD in namespace %qD which does not "
20221 else
20227 }
20228 /* [dcl.meaning]
20230 A declarator-id shall not be qualified except for the
20231 definition of a ... nested class outside of its class
20232 ... [or] the definition or explicit instantiation of a
20233 class member of a namespace outside of its namespace. */
20235 {
20240 }
20241 }
20242 /* An explicit-specialization must be preceded by "template <>". If
20243 it is not, try to recover gracefully. */
20247 {
20251 /* Take the same action that would have been taken by
20252 cp_parser_explicit_specialization. */
20255 }
20256 /* There must be no "return" statements between this point and the
20257 end of this function; set "type "to the correct return value and
20258 use "goto done;" to return. */
20259 /* Make sure that the right number of template parameters were
20260 present. */
20264 {
20265 /* If something went wrong, there is no point in even trying to
20266 process the class-definition. */
20269 }
20271 /* Look up the type. */
20273 {
20277 {
20281 }
20282 else
20283 {
20286 }
20289 }
20291 {
20292 tree class_type;
20294 /* Given:
20296 template <typename T> struct S { struct T };
20297 template <typename T> struct S<T>::T { };
20299 we will get a TYPENAME_TYPE when processing the definition of
20300 `S::T'. We need to resolve it to the actual type before we
20301 try to define it. */
20303 {
20308 else
20309 {
20312 }
20313 }
20317 {
20320 }
20323 /* Enter the scope indicated by the nested-name-specifier. */
20325 /* Get the canonical version of this type. */
20327 /* Call push_template_decl if it seems like we should be defining a
20328 template either from the template headers or the type we're
20329 defining, so that we diagnose both extra and missing headers. */
20333 {
20336 {
20339 }
20340 }
20344 }
20346 {
20347 /* If the class was unnamed, create a dummy name. */
20352 }
20354 /* Indicate whether this class was declared as a `class' or as a
20355 `struct'. */
20360 /* If this type was already complete, and we see another definition,
20361 that's an error. */
20363 {
20365 type);
20367 type);
20370 }
20375 {
20376 /* Apply attributes now, before any use of the class as a template
20377 argument in its base list. */
20380 }
20382 /* We will have entered the scope containing the class; the names of
20383 base classes should be looked up in that context. For example:
20385 struct A { struct B {}; struct C; };
20386 struct A::C : B {};
20388 is valid. */
20390 /* Get the list of base-classes, if there is one. */
20392 {
20393 /* PR59482: enter the class scope so that base-specifiers are looked
20394 up correctly. */
20398 /* PR59482: get out of the previously pushed class scope so that the
20399 subsequent pops pop the right thing. */
20402 }
20403 else
20406 /* If we're really defining a class, process the base classes.
20407 If they're invalid, fail. */
20412 done:
20413 /* Leave the scope given by the nested-name-specifier. We will
20414 enter the class scope itself while processing the members. */
20419 {
20422 }
20428 out:
20431 }
20433 /* Parse a class-key.
20435 class-key:
20436 class
20437 struct
20438 union
20440 Returns the kind of class-key specified, or none_type to indicate
20441 error. */
20443 static enum tag_types
20445 {
20449 /* Look for the class-key. */
20454 /* Check to see if the TOKEN is a class-key. */
20459 }
20461 /* Parse a type-parameter-key.
20463 type-parameter-key:
20464 class
20465 typename
20466 */
20468 static void
20470 {
20471 /* Look for the type-parameter-key. */
20475 {
20478 /* typename is not allowed in a template template parameter
20479 by the standard until C++1Z. */
20481 "ISO C++ forbids typename key in template template parameter;"
20483 }
20484 else
20488 }
20490 /* Parse an (optional) member-specification.
20492 member-specification:
20493 member-declaration member-specification [opt]
20494 access-specifier : member-specification [opt] */
20496 static void
20498 {
20500 {
20504 /* Peek at the next token. */
20506 /* If it's a `}', or EOF then we've seen all the members. */
20512 /* See if this token is a keyword. */
20515 {
20519 /* Consume the access-specifier. */
20521 /* Remember which access-specifier is active. */
20523 /* Look for the `:'. */
20528 /* Accept #pragmas at class scope. */
20530 {
20533 }
20535 /* Otherwise, the next construction must be a
20536 member-declaration. */
20538 }
20539 }
20540 }
20542 /* Parse a member-declaration.
20544 member-declaration:
20545 decl-specifier-seq [opt] member-declarator-list [opt] ;
20546 function-definition ; [opt]
20547 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20548 using-declaration
20549 template-declaration
20550 alias-declaration
20552 member-declarator-list:
20553 member-declarator
20554 member-declarator-list , member-declarator
20556 member-declarator:
20557 declarator pure-specifier [opt]
20558 declarator constant-initializer [opt]
20559 identifier [opt] : constant-expression
20561 GNU Extensions:
20563 member-declaration:
20564 __extension__ member-declaration
20566 member-declarator:
20567 declarator attributes [opt] pure-specifier [opt]
20568 declarator attributes [opt] constant-initializer [opt]
20569 identifier [opt] attributes [opt] : constant-expression
20571 C++0x Extensions:
20573 member-declaration:
20574 static_assert-declaration */
20576 static void
20578 {
20579 cp_decl_specifier_seq decl_specifiers;
20580 tree prefix_attributes;
20581 tree decl;
20590 /* Check for the `__extension__' keyword. */
20592 {
20593 /* Recurse. */
20595 /* Restore the old value of the PEDANTIC flag. */
20599 }
20601 /* Check for a template-declaration. */
20603 {
20604 /* An explicit specialization here is an error condition, and we
20605 expect the specialization handler to detect and report this. */
20609 else
20613 }
20615 /* Check for a using-declaration. */
20617 {
20619 {
20620 /* Parse the using-declaration. */
20624 }
20625 else
20626 {
20627 tree decl;
20631 /* Note that if we actually see the '=' token after the
20632 identifier, cp_parser_alias_declaration commits the
20633 tentative parse. In that case, we really expects an
20634 alias-declaration. Otherwise, we expect a using
20635 declaration. */
20636 alias_decl_expected =
20642 else
20646 }
20647 }
20649 /* Check for @defs. */
20651 {
20656 {
20661 }
20663 }
20665 /* If the next token is `static_assert' we have a static assertion. */
20667 {
20670 }
20677 /* Parse the decl-specifier-seq. */
20680 CP_PARSER_FLAGS_OPTIONAL,
20683 /* Check for an invalid type-name. */
20687 /* If there is no declarator, then the decl-specifier-seq should
20688 specify a type. */
20690 {
20691 /* If there was no decl-specifier-seq, and the next token is a
20692 `;', then we have something like:
20694 struct S { ; };
20696 [class.mem]
20698 Each member-declaration shall declare at least one member
20699 name of the class. */
20701 {
20705 }
20706 else
20707 {
20708 tree type;
20710 /* See if this declaration is a friend. */
20712 /* If there were decl-specifiers, check to see if there was
20713 a class-declaration. */
20716 /* Nested classes have already been added to the class, but
20717 a `friend' needs to be explicitly registered. */
20719 {
20720 /* If the `friend' keyword was present, the friend must
20721 be introduced with a class-key. */
20724 "in C++03 a class-key must be used "
20726 /* In this case:
20728 template <typename T> struct A {
20729 friend struct A<T>::B;
20730 };
20732 A<T>::B will be represented by a TYPENAME_TYPE, and
20733 therefore not recognized by check_tag_decl. */
20735 {
20739 }
20742 "friend declaration does not name a class or "
20744 else
20747 }
20748 /* If there is no TYPE, an error message will already have
20749 been issued. */
20751 ;
20752 /* An anonymous aggregate has to be handled specially; such
20753 a declaration really declares a data member (with a
20754 particular type), as opposed to a nested class. */
20756 {
20757 /* C++11 9.5/6. */
20760 "a storage class on an anonymous aggregate "
20763 /* Remove constructors and such from TYPE, now that we
20764 know it is an anonymous aggregate. */
20766 /* And make the corresponding data member. */
20769 /* Add it to the class. */
20771 }
20772 else
20773 cp_parser_check_access_in_redeclaration
20776 }
20777 }
20778 else
20779 {
20782 /* Clear attributes from the decl_specifiers but keep them
20783 around as prefix attributes that apply them to the entity
20784 being declared. */
20788 /* See if these declarations will be friends. */
20791 /* Keep going until we hit the `;' at the end of the
20792 declaration. */
20794 {
20796 tree first_attribute;
20798 /* Peek at the next token. */
20801 /* Check for a bitfield declaration. */
20806 {
20807 tree identifier;
20808 tree width;
20810 /* Get the name of the bitfield. Note that we cannot just
20811 check TOKEN here because it may have been invalidated by
20812 the call to cp_lexer_peek_nth_token above. */
20815 else
20818 /* Consume the `:' token. */
20820 /* Get the width of the bitfield. */
20821 width
20824 /* Look for attributes that apply to the bitfield. */
20826 /* Remember which attributes are prefix attributes and
20827 which are not. */
20829 /* Combine the attributes. */
20832 /* Create the bitfield declaration. */
20835 identifier,
20836 sfk_none)
20839 width,
20840 attributes);
20841 }
20842 else
20843 {
20845 tree initializer;
20846 tree asm_specification;
20849 /* Parse the declarator. */
20850 declarator
20855 friend_p);
20857 /* If something went wrong parsing the declarator, make sure
20858 that we at least consume some tokens. */
20860 {
20861 /* Skip to the end of the statement. */
20863 /* If the next token is not a semicolon, that is
20864 probably because we just skipped over the body of
20865 a function. So, we consume a semicolon if
20866 present, but do not issue an error message if it
20867 is not present. */
20869 CPP_SEMICOLON))
20872 }
20875 cp_parser_check_for_definition_in_return_type
20879 /* Look for an asm-specification. */
20881 /* Look for attributes that apply to the declaration. */
20883 /* Remember which attributes are prefix attributes and
20884 which are not. */
20886 /* Combine the attributes. */
20889 /* If it's an `=', then we have a constant-initializer or a
20890 pure-specifier. It is not correct to parse the
20891 initializer before registering the member declaration
20892 since the member declaration should be in scope while
20893 its initializer is processed. However, the rest of the
20894 front end does not yet provide an interface that allows
20895 us to handle this correctly. */
20897 {
20898 /* In [class.mem]:
20900 A pure-specifier shall be used only in the declaration of
20901 a virtual function.
20903 A member-declarator can contain a constant-initializer
20904 only if it declares a static member of integral or
20905 enumeration type.
20907 Therefore, if the DECLARATOR is for a function, we look
20908 for a pure-specifier; otherwise, we look for a
20909 constant-initializer. When we call `grokfield', it will
20910 perform more stringent semantics checks. */
20922 {
20924 /* Don't require a constant rvalue in C++11, since we
20925 might want a reference constant. We'll enforce
20926 constancy later. */
20928 /* Parse the initializer. */
20931 }
20932 else
20933 /* Parse the initializer. */
20935 }
20938 {
20942 else
20944 }
20945 /* Otherwise, there is no initializer. */
20946 else
20949 /* See if we are probably looking at a function
20950 definition. We are certainly not looking at a
20951 member-declarator. Calling `grokfield' has
20952 side-effects, so we must not do it unless we are sure
20953 that we are looking at a member-declarator. */
20956 {
20957 /* The grammar does not allow a pure-specifier to be
20958 used when a member function is defined. (It is
20959 possible that this fact is an oversight in the
20960 standard, since a pure function may be defined
20961 outside of the class-specifier. */
20967 declarator,
20968 attributes);
20971 /* If the member was not a friend, declare it here. */
20974 /* Peek at the next token. */
20976 /* If the next token is a semicolon, consume it. */
20980 }
20981 else
20984 /* Create the declaration. */
20989 {
20992 else
20994 }
20995 }
20999 /* Reset PREFIX_ATTRIBUTES. */
21005 /* If there is any qualification still in effect, clear it
21006 now; we will be starting fresh with the next declarator. */
21010 /* If it's a `,', then there are more declarators. */
21012 {
21015 {
21019 }
21020 }
21021 /* If the next token isn't a `;', then we have a parse error. */
21023 CPP_SEMICOLON))
21024 {
21025 /* The next token might be a ways away from where the
21026 actual semicolon is missing. Find the previous token
21027 and use that for our error position. */
21032 /* Assume that the user meant to provide a semicolon. If
21033 we were to cp_parser_skip_to_end_of_statement, we might
21034 skip to a semicolon inside a member function definition
21035 and issue nonsensical error messages. */
21037 }
21040 {
21041 /* Add DECL to the list of members. */
21050 /* Add DECL to the queue of NSDMI to be parsed later. */
21052 }
21056 }
21057 }
21060 out:
21062 }
21064 /* Parse a pure-specifier.
21066 pure-specifier:
21067 = 0
21069 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21070 Otherwise, ERROR_MARK_NODE is returned. */
21072 static tree
21074 {
21077 /* Look for the `=' token. */
21080 /* Look for the `0' token. */
21089 /* Accept = default or = delete in c++0x mode. */
21092 {
21095 }
21097 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21099 {
21104 }
21106 {
21109 }
21112 }
21114 /* Parse a constant-initializer.
21116 constant-initializer:
21117 = constant-expression
21119 Returns a representation of the constant-expression. */
21121 static tree
21123 {
21124 /* Look for the `=' token. */
21128 /* It is invalid to write:
21130 struct S { static const int i = { 7 }; };
21132 */
21134 {
21137 /* Consume the opening brace. */
21139 /* Skip the initializer. */
21141 /* Look for the trailing `}'. */
21145 }
21148 }
21150 /* Derived classes [gram.class.derived] */
21152 /* Parse a base-clause.
21154 base-clause:
21155 : base-specifier-list
21157 base-specifier-list:
21158 base-specifier ... [opt]
21159 base-specifier-list , base-specifier ... [opt]
21161 Returns a TREE_LIST representing the base-classes, in the order in
21162 which they were declared. The representation of each node is as
21163 described by cp_parser_base_specifier.
21165 In the case that no bases are specified, this function will return
21166 NULL_TREE, not ERROR_MARK_NODE. */
21168 static tree
21170 {
21173 /* Look for the `:' that begins the list. */
21176 /* Scan the base-specifier-list. */
21178 {
21180 tree base;
21183 /* Look for the base-specifier. */
21185 /* Look for the (optional) ellipsis. */
21187 {
21188 /* Consume the `...'. */
21192 }
21194 /* Add BASE to the front of the list. */
21196 {
21198 /* Make this a pack expansion type. */
21202 {
21205 }
21206 }
21207 /* Peek at the next token. */
21209 /* If it's not a comma, then the list is complete. */
21212 /* Consume the `,'. */
21214 }
21216 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21217 base class had a qualified name. However, the next name that
21218 appears is certainly not qualified. */
21224 }
21226 /* Parse a base-specifier.
21228 base-specifier:
21229 :: [opt] nested-name-specifier [opt] class-name
21230 virtual access-specifier [opt] :: [opt] nested-name-specifier
21231 [opt] class-name
21232 access-specifier virtual [opt] :: [opt] nested-name-specifier
21233 [opt] class-name
21235 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21236 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21237 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21238 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21240 static tree
21242 {
21250 tree type;
21252 /* Process the optional `virtual' and `access-specifier'. */
21254 {
21255 /* Peek at the next token. */
21257 /* Process `virtual'. */
21259 {
21261 /* If `virtual' appears more than once, issue an error. */
21263 {
21267 }
21271 /* Consume the `virtual' token. */
21279 /* If more than one access specifier appears, issue an
21280 error. */
21283 {
21287 }
21291 /* Consume the access-specifier. */
21299 }
21300 }
21301 /* It is not uncommon to see programs mechanically, erroneously, use
21302 the 'typename' keyword to denote (dependent) qualified types
21303 as base classes. */
21305 {
21310 else
21312 "keyword %<typename%> not allowed in this context "
21315 }
21317 /* Look for the optional `::' operator. */
21319 /* Look for the nested-name-specifier. The simplest way to
21320 implement:
21322 [temp.res]
21324 The keyword `typename' is not permitted in a base-specifier or
21325 mem-initializer; in these contexts a qualified name that
21326 depends on a template-parameter is implicitly assumed to be a
21327 type name.
21329 is to pretend that we have seen the `typename' keyword at this
21330 point. */
21334 typename_type,
21336 /* If the base class is given by a qualified name, assume that names
21337 we see are type names or templates, as appropriate. */
21343 /* DR 950 allows decltype as a base-specifier. */
21345 else
21346 {
21347 /* Otherwise, look for the class-name. */
21349 class_scope_p,
21350 template_p,
21351 typename_type,
21356 }
21362 }
21364 /* Exception handling [gram.exception] */
21366 /* Parse an (optional) noexcept-specification.
21368 noexcept-specification:
21369 noexcept ( constant-expression ) [opt]
21371 If no noexcept-specification is present, returns NULL_TREE.
21372 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21373 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21374 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21375 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21376 in which case a boolean condition is returned instead. */
21378 static tree
21383 {
21387 /* Peek at the next token. */
21390 /* Is it a noexcept-specification? */
21392 {
21393 tree expr;
21397 {
21401 {
21402 /* Types may not be defined in an exception-specification. */
21404 parser->type_definition_forbidden_message
21409 /* Restore the saved message. */
21411 }
21412 else
21413 {
21416 }
21419 }
21420 else
21421 {
21425 }
21427 /* We cannot build a noexcept-spec right away because this will check
21428 that expr is a constexpr. */
21431 else
21433 }
21434 else
21436 }
21438 /* Parse an (optional) exception-specification.
21440 exception-specification:
21441 throw ( type-id-list [opt] )
21443 Returns a TREE_LIST representing the exception-specification. The
21444 TREE_VALUE of each node is a type. */
21446 static tree
21448 {
21450 tree type_id_list;
21453 /* Peek at the next token. */
21456 /* Is it a noexcept-specification? */
21462 /* If it's not `throw', then there's no exception-specification. */
21466 #if 0
21467 /* Enable this once a lot of code has transitioned to noexcept? */
21471 #endif
21473 /* Consume the `throw'. */
21476 /* Look for the `('. */
21479 /* Peek at the next token. */
21481 /* If it's not a `)', then there is a type-id-list. */
21483 {
21484 /* Types may not be defined in an exception-specification. */
21486 parser->type_definition_forbidden_message
21488 /* Parse the type-id-list. */
21490 /* Restore the saved message. */
21492 }
21493 else
21496 /* Look for the `)'. */
21500 }
21502 /* Parse an (optional) type-id-list.
21504 type-id-list:
21505 type-id ... [opt]
21506 type-id-list , type-id ... [opt]
21508 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21509 in the order that the types were presented. */
21511 static tree
21513 {
21517 {
21519 tree type;
21521 /* Get the next type-id. */
21523 /* Parse the optional ellipsis. */
21525 {
21526 /* Consume the `...'. */
21529 /* Turn the type into a pack expansion expression. */
21531 }
21532 /* Add it to the list. */
21534 /* Peek at the next token. */
21536 /* If it is not a `,', we are done. */
21539 /* Consume the `,'. */
21541 }
21544 }
21546 /* Parse a try-block.
21548 try-block:
21549 try compound-statement handler-seq */
21551 static tree
21553 {
21554 tree try_block;
21568 }
21570 /* Parse a function-try-block.
21572 function-try-block:
21573 try ctor-initializer [opt] function-body handler-seq */
21575 static bool
21577 {
21578 tree compound_stmt;
21579 tree try_block;
21582 /* Look for the `try' keyword. */
21585 /* Let the rest of the front end know where we are. */
21587 /* Parse the function-body. */
21588 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21590 /* We're done with the `try' part. */
21592 /* Parse the handlers. */
21594 /* We're done with the handlers. */
21598 }
21600 /* Parse a handler-seq.
21602 handler-seq:
21603 handler handler-seq [opt] */
21605 static void
21607 {
21609 {
21612 /* Parse the handler. */
21614 /* Peek at the next token. */
21616 /* If it's not `catch' then there are no more handlers. */
21619 }
21620 }
21622 /* Parse a handler.
21624 handler:
21625 catch ( exception-declaration ) compound-statement */
21627 static void
21629 {
21630 tree handler;
21631 tree declaration;
21641 }
21643 /* Parse an exception-declaration.
21645 exception-declaration:
21646 type-specifier-seq declarator
21647 type-specifier-seq abstract-declarator
21648 type-specifier-seq
21649 ...
21651 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21652 ellipsis variant is used. */
21654 static tree
21656 {
21657 cp_decl_specifier_seq type_specifiers;
21661 /* If it's an ellipsis, it's easy to handle. */
21663 {
21664 /* Consume the `...' token. */
21667 }
21669 /* Types may not be defined in exception-declarations. */
21671 parser->type_definition_forbidden_message
21674 /* Parse the type-specifier-seq. */
21678 /* If it's a `)', then there is no declarator. */
21681 else
21688 /* Restore the saved message. */
21695 }
21697 /* Parse a throw-expression.
21699 throw-expression:
21700 throw assignment-expression [opt]
21702 Returns a THROW_EXPR representing the throw-expression. */
21704 static tree
21706 {
21707 tree expression;
21712 /* Figure out whether or not there is an assignment-expression
21713 following the "throw" keyword. */
21721 else
21725 }
21727 /* GNU Extensions */
21729 /* Parse an (optional) asm-specification.
21731 asm-specification:
21732 asm ( string-literal )
21734 If the asm-specification is present, returns a STRING_CST
21735 corresponding to the string-literal. Otherwise, returns
21736 NULL_TREE. */
21738 static tree
21740 {
21742 tree asm_specification;
21744 /* Peek at the next token. */
21746 /* If the next token isn't the `asm' keyword, then there's no
21747 asm-specification. */
21751 /* Consume the `asm' token. */
21753 /* Look for the `('. */
21756 /* Look for the string-literal. */
21759 /* Look for the `)'. */
21763 }
21765 /* Parse an asm-operand-list.
21767 asm-operand-list:
21768 asm-operand
21769 asm-operand-list , asm-operand
21771 asm-operand:
21772 string-literal ( expression )
21773 [ string-literal ] string-literal ( expression )
21775 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21776 each node is the expression. The TREE_PURPOSE is itself a
21777 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21778 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21779 is a STRING_CST for the string literal before the parenthesis. Returns
21780 ERROR_MARK_NODE if any of the operands are invalid. */
21782 static tree
21784 {
21789 {
21790 tree string_literal;
21791 tree expression;
21792 tree name;
21795 {
21796 /* Consume the `[' token. */
21798 /* Read the operand name. */
21803 /* Look for the closing `]'. */
21805 }
21806 else
21808 /* Look for the string-literal. */
21811 /* Look for the `('. */
21813 /* Parse the expression. */
21815 /* Look for the `)'. */
21823 /* Add this operand to the list. */
21825 expression,
21826 asm_operands);
21827 /* If the next token is not a `,', there are no more
21828 operands. */
21831 /* Consume the `,'. */
21833 }
21836 }
21838 /* Parse an asm-clobber-list.
21840 asm-clobber-list:
21841 string-literal
21842 asm-clobber-list , string-literal
21844 Returns a TREE_LIST, indicating the clobbers in the order that they
21845 appeared. The TREE_VALUE of each node is a STRING_CST. */
21847 static tree
21849 {
21853 {
21854 tree string_literal;
21856 /* Look for the string literal. */
21858 /* Add it to the list. */
21860 /* If the next token is not a `,', then the list is
21861 complete. */
21864 /* Consume the `,' token. */
21866 }
21869 }
21871 /* Parse an asm-label-list.
21873 asm-label-list:
21874 identifier
21875 asm-label-list , identifier
21877 Returns a TREE_LIST, indicating the labels in the order that they
21878 appeared. The TREE_VALUE of each node is a label. */
21880 static tree
21882 {
21886 {
21889 /* Look for the identifier. */
21892 {
21895 {
21901 }
21902 }
21903 /* If the next token is not a `,', then the list is
21904 complete. */
21907 /* Consume the `,' token. */
21909 }
21912 }
21914 /* Return TRUE iff the next tokens in the stream are possibly the
21915 beginning of a GNU extension attribute. */
21917 static bool
21919 {
21921 }
21923 /* Return TRUE iff the next tokens in the stream are possibly the
21924 beginning of a standard C++-11 attribute specifier. */
21926 static bool
21928 {
21930 }
21932 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21933 beginning of a standard C++-11 attribute specifier. */
21935 static bool
21937 {
21945 }
21947 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21948 beginning of a GNU extension attribute. */
21950 static bool
21952 {
21956 }
21958 /* Return true iff the next tokens can be the beginning of either a
21959 GNU attribute list, or a standard C++11 attribute sequence. */
21961 static bool
21963 {
21966 }
21968 /* Return true iff the next Nth tokens can be the beginning of either
21969 a GNU attribute list, or a standard C++11 attribute sequence. */
21971 static bool
21973 {
21976 }
21978 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21979 of GNU attributes, or return NULL. */
21981 static tree
21983 {
21987 }
21989 #define CILK_SIMD_FN_CLAUSE_MASK \
21990 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
21991 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
21992 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
21993 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
21994 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
21996 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
21997 vector [(<clauses>)] */
21999 static void
22001 {
22005 {
22010 }
22013 {
22016 paren_scope++;
22017 }
22019 {
22022 paren_scope++;
22024 paren_scope--;
22025 /* Do not push the last ')' */
22028 }
22037 }
22039 /* Parse an (optional) series of attributes.
22041 attributes:
22042 attributes attribute
22044 attribute:
22045 __attribute__ (( attribute-list [opt] ))
22047 The return value is as for cp_parser_gnu_attribute_list. */
22049 static tree
22051 {
22055 {
22057 tree attribute_list;
22060 /* Peek at the next token. */
22062 /* If it's not `__attribute__', then we're done. */
22066 /* Consume the `__attribute__' keyword. */
22068 /* Look for the two `(' tokens. */
22072 /* Peek at the next token. */
22075 /* Parse the attribute-list. */
22077 else
22078 /* If the next token is a `)', then there is no attribute
22079 list. */
22082 /* Look for the two `)' tokens. */
22090 /* Add these new attributes to the list. */
22092 }
22095 }
22097 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22098 "__vector" or "__vector__." */
22102 {
22106 }
22108 /* Parse a GNU attribute-list.
22110 attribute-list:
22111 attribute
22112 attribute-list , attribute
22114 attribute:
22115 identifier
22116 identifier ( identifier )
22117 identifier ( identifier , expression-list )
22118 identifier ( expression-list )
22120 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22121 to an attribute. The TREE_PURPOSE of each node is the identifier
22122 indicating which attribute is in use. The TREE_VALUE represents
22123 the arguments, if any. */
22125 static tree
22127 {
22133 {
22135 tree identifier;
22136 tree attribute;
22138 /* Look for the identifier. We also allow keywords here; for
22139 example `__attribute__ ((const))' is legal. */
22143 {
22146 /* Consume the token, but save it since we need it for the
22147 SIMD enabled function parsing. */
22150 /* Save away the identifier that indicates which attribute
22151 this is. */
22153 /* For keywords, use the canonical spelling, not the
22154 parsed identifier. */
22160 /* Peek at the next token. */
22162 /* If it's an `(', then parse the attribute arguments. */
22164 {
22169 {
22172 }
22173 else
22174 vec = cp_parser_parenthesized_expression_list
22180 else
22181 {
22184 }
22185 /* Save the arguments away. */
22187 }
22189 {
22192 }
22195 {
22196 /* Add this attribute to the list. */
22199 }
22202 }
22203 /* Now, look for more attributes. If the next token isn't a
22204 `,', we're done. */
22208 /* Consume the comma and keep going. */
22210 }
22213 /* We built up the list in reverse order. */
22215 }
22217 /* Parse a standard C++11 attribute.
22219 The returned representation is a TREE_LIST which TREE_PURPOSE is
22220 the scoped name of the attribute, and the TREE_VALUE is its
22221 arguments list.
22223 Note that the scoped name of the attribute is itself a TREE_LIST
22224 which TREE_PURPOSE is the namespace of the attribute, and
22225 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22226 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22227 and which TREE_PURPOSE is directly the attribute name.
22229 Clients of the attribute code should use get_attribute_namespace
22230 and get_attribute_name to get the actual namespace and name of
22231 attributes, regardless of their being GNU or C++11 attributes.
22233 attribute:
22234 attribute-token attribute-argument-clause [opt]
22236 attribute-token:
22237 identifier
22238 attribute-scoped-token
22240 attribute-scoped-token:
22241 attribute-namespace :: identifier
22243 attribute-namespace:
22244 identifier
22246 attribute-argument-clause:
22247 ( balanced-token-seq )
22249 balanced-token-seq:
22250 balanced-token [opt]
22251 balanced-token-seq balanced-token
22253 balanced-token:
22254 ( balanced-token-seq )
22255 [ balanced-token-seq ]
22256 { balanced-token-seq }. */
22258 static tree
22260 {
22264 /* First, parse name of the the attribute, a.k.a
22265 attribute-token. */
22282 {
22283 /* We are seeing a scoped attribute token. */
22293 else
22294 {
22298 }
22300 NULL_TREE);
22302 }
22303 else
22304 {
22306 NULL_TREE);
22307 /* C++11 noreturn attribute is equivalent to GNU's. */
22310 /* C++14 deprecated attribute is equivalent to GNU's. */
22312 {
22315 "%<deprecated%> is a C++14 feature;"
22318 }
22319 }
22321 /* Now parse the optional argument clause of the attribute. */
22326 {
22332 /* A GNU attribute that takes an identifier in parameter. */
22335 vec = cp_parser_parenthesized_expression_list
22341 else
22342 {
22345 }
22349 else
22351 }
22354 }
22356 /* Parse a list of standard C++-11 attributes.
22358 attribute-list:
22359 attribute [opt]
22360 attribute-list , attribute[opt]
22361 attribute ...
22362 attribute-list , attribute ...
22363 */
22365 static tree
22367 {
22372 {
22377 {
22380 }
22385 }
22388 }
22390 /* Parse a standard C++-11 attribute specifier.
22392 attribute-specifier:
22393 [ [ attribute-list ] ]
22394 alignment-specifier
22396 alignment-specifier:
22397 alignas ( type-id ... [opt] )
22398 alignas ( alignment-expression ... [opt] ). */
22400 static tree
22402 {
22408 {
22417 else
22418 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22419 when we are sure that we have actually parsed them. */
22421 }
22422 else
22423 {
22424 tree alignas_expr;
22426 /* Look for an alignment-specifier. */
22438 {
22441 }
22447 {
22451 alignas_expr =
22458 }
22461 {
22464 }
22468 /* Build the C++-11 representation of an 'aligned'
22469 attribute. */
22470 attributes =
22474 }
22477 }
22479 /* Parse a standard C++-11 attribute-specifier-seq.
22481 attribute-specifier-seq:
22482 attribute-specifier-seq [opt] attribute-specifier
22483 */
22485 static tree
22487 {
22491 {
22500 }
22504 }
22506 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22507 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22508 current value of the PEDANTIC flag, regardless of whether or not
22509 the `__extension__' keyword is present. The caller is responsible
22510 for restoring the value of the PEDANTIC flag. */
22512 static bool
22514 {
22515 /* Save the old value of the PEDANTIC flag. */
22519 {
22520 /* Consume the `__extension__' token. */
22522 /* We're not being pedantic while the `__extension__' keyword is
22523 in effect. */
22527 }
22530 }
22532 /* Parse a label declaration.
22534 label-declaration:
22535 __label__ label-declarator-seq ;
22537 label-declarator-seq:
22538 identifier , label-declarator-seq
22539 identifier */
22541 static void
22543 {
22544 /* Look for the `__label__' keyword. */
22548 {
22549 tree identifier;
22551 /* Look for an identifier. */
22553 /* If we failed, stop. */
22556 /* Declare it as a label. */
22558 /* If the next token is a `;', stop. */
22561 /* Look for the `,' separating the label declarations. */
22563 }
22565 /* Look for the final `;'. */
22567 }
22569 /* Support Functions */
22571 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22572 NAME should have one of the representations used for an
22573 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22574 is returned. If PARSER->SCOPE is a dependent type, then a
22575 SCOPE_REF is returned.
22577 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22578 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22579 was formed. Abstractly, such entities should not be passed to this
22580 function, because they do not need to be looked up, but it is
22581 simpler to check for this special case here, rather than at the
22582 call-sites.
22584 In cases not explicitly covered above, this function returns a
22585 DECL, OVERLOAD, or baselink representing the result of the lookup.
22586 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22587 is returned.
22589 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22590 (e.g., "struct") that was used. In that case bindings that do not
22591 refer to types are ignored.
22593 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22594 ignored.
22596 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22597 are ignored.
22599 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22600 types.
22602 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22603 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22604 NULL_TREE otherwise. */
22606 static tree
22613 location_t name_location)
22614 {
22615 tree decl;
22618 /* Assume that the lookup will be unambiguous. */
22622 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22623 no longer valid. Note that if we are parsing tentatively, and
22624 the parse fails, OBJECT_TYPE will be automatically restored. */
22630 /* A template-id has already been resolved; there is no lookup to
22631 do. */
22635 {
22639 }
22641 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22642 it should already have been checked to make sure that the name
22643 used matches the type being destroyed. */
22645 {
22646 tree type;
22648 /* Figure out to which type this destructor applies. */
22653 else
22655 /* If that's not a class type, there is no destructor. */
22662 /* If it was a class type, return the destructor. */
22664 }
22666 /* By this point, the NAME should be an ordinary identifier. If
22667 the id-expression was a qualified name, the qualifying scope is
22668 stored in PARSER->SCOPE at this point. */
22671 /* Perform the lookup. */
22673 {
22679 /* If the SCOPE is dependent, the lookup must be deferred until
22680 the template is instantiated -- unless we are explicitly
22681 looking up names in uninstantiated templates. Even then, we
22682 cannot look up the name if the scope is not a class type; it
22683 might, for example, be a template type parameter. */
22688 /* Defer lookup. */
22690 else
22691 {
22694 /* If PARSER->SCOPE is a dependent type, then it must be a
22695 class type, and we must not be checking dependencies;
22696 otherwise, we would have processed this lookup above. So
22697 that PARSER->SCOPE is not considered a dependent base by
22698 lookup_member, we must enter the scope here. */
22702 /* If the PARSER->SCOPE is a template specialization, it
22703 may be instantiated during name lookup. In that case,
22704 errors may be issued. Even if we rollback the current
22705 tentative parse, those errors are valid. */
22710 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22711 lookup result and the nested-name-specifier nominates a class C:
22712 * if the name specified after the nested-name-specifier, when
22713 looked up in C, is the injected-class-name of C (Clause 9), or
22714 * if the name specified after the nested-name-specifier is the
22715 same as the identifier or the simple-template-id's template-
22716 name in the last component of the nested-name-specifier,
22717 the name is instead considered to name the constructor of
22718 class C. [ Note: for example, the constructor is not an
22719 acceptable lookup result in an elaborated-type-specifier so
22720 the constructor would not be used in place of the
22721 injected-class-name. --end note ] Such a constructor name
22722 shall be used only in the declarator-id of a declaration that
22723 names a constructor or in a using-declaration. */
22731 /* If we have a single function from a using decl, pull it out. */
22738 }
22740 /* If the scope is a dependent type and either we deferred lookup or
22741 we did lookup but didn't find the name, rememeber the name. */
22744 {
22746 {
22747 tree type;
22749 /* The resolution to Core Issue 180 says that `struct
22750 A::B' should be considered a type-name, even if `A'
22751 is dependent. */
22756 }
22760 CPP_CLOSE_PAREN)))
22764 else
22767 is_template);
22768 }
22771 }
22773 {
22774 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22775 OBJECT_TYPE is not a class. */
22777 /* If the OBJECT_TYPE is a template specialization, it may
22778 be instantiated during name lookup. In that case, errors
22779 may be issued. Even if we rollback the current tentative
22780 parse, those errors are valid. */
22782 name,
22785 tf_warning_or_error);
22786 else
22790 /* Look it up in the enclosing context. */
22796 }
22797 else
22798 {
22804 }
22806 /* If the lookup failed, let our caller know. */
22810 /* Pull out the template from an injected-class-name (or multiple). */
22814 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22816 {
22819 /* The error message we have to print is too complicated for
22820 cp_parser_error, so we incorporate its actions directly. */
22822 {
22824 name);
22826 }
22828 }
22836 /* If we have resolved the name of a member declaration, check to
22837 see if the declaration is accessible. When the name resolves to
22838 set of overloaded functions, accessibility is checked when
22839 overload resolution is done.
22841 During an explicit instantiation, access is not checked at all,
22842 as per [temp.explicit]. */
22849 }
22851 /* Like cp_parser_lookup_name, but for use in the typical case where
22852 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22853 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22855 static tree
22857 {
22859 none_type,
22864 location);
22865 }
22867 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22868 the current context, return the TYPE_DECL. If TAG_NAME_P is
22869 true, the DECL indicates the class being defined in a class-head,
22870 or declared in an elaborated-type-specifier.
22872 Otherwise, return DECL. */
22874 static tree
22876 {
22877 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22878 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22880 struct A {
22881 template <typename T> struct B;
22882 };
22884 template <typename T> struct A::B {};
22886 Similarly, in an elaborated-type-specifier:
22888 namespace N { struct X{}; }
22890 struct A {
22891 template <typename T> friend struct N::X;
22892 };
22894 However, if the DECL refers to a class type, and we are in
22895 the scope of the class, then the name lookup automatically
22896 finds the TYPE_DECL created by build_self_reference rather
22897 than a TEMPLATE_DECL. For example, in:
22899 template <class T> struct S {
22900 S s;
22901 };
22903 there is no need to handle such case. */
22909 }
22911 /* If too many, or too few, template-parameter lists apply to the
22912 declarator, issue an error message. Returns TRUE if all went well,
22913 and FALSE otherwise. */
22915 static bool
22918 location_t declarator_location)
22919 {
22921 {
22923 {
22931 /* If the DECLARATOR has the form `X<y>' then it uses one
22932 additional level of template parameters. */
22935 return cp_parser_check_template_parameters
22937 }
22952 }
22954 }
22956 /* NUM_TEMPLATES were used in the current declaration. If that is
22957 invalid, return FALSE and issue an error messages. Otherwise,
22958 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22959 declarator and we can print more accurate diagnostics. */
22961 static bool
22964 location_t location,
22966 {
22967 /* If there are the same number of template classes and parameter
22968 lists, that's OK. */
22971 /* If there are more, but only one more, then we are referring to a
22972 member template. That's OK too. */
22975 /* If there are more template classes than parameter lists, we have
22976 something like:
22978 template <class T> void S<T>::R<T>::f (); */
22980 {
22990 else
22993 }
22994 /* Otherwise, there are too many template parameter lists. We have
22995 something like:
22997 template <class T> template <class U> void S::f(); */
23000 }
23002 /* Parse an optional `::' token indicating that the following name is
23003 from the global namespace. If so, PARSER->SCOPE is set to the
23004 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23005 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23006 Returns the new value of PARSER->SCOPE, if the `::' token is
23007 present, and NULL_TREE otherwise. */
23009 static tree
23011 {
23014 /* Peek at the next token. */
23016 /* If we're looking at a `::' token then we're starting from the
23017 global namespace, not our current location. */
23019 {
23020 /* Consume the `::' token. */
23022 /* Set the SCOPE so that we know where to start the lookup. */
23028 }
23030 {
23034 }
23037 }
23039 /* Returns TRUE if the upcoming token sequence is the start of a
23040 constructor declarator. If FRIEND_P is true, the declarator is
23041 preceded by the `friend' specifier. */
23043 static bool
23045 {
23048 tree nested_name_specifier;
23051 /* The common case is that this is not a constructor declarator, so
23052 try to avoid doing lots of work if at all possible. It's not
23053 valid declare a constructor at function scope. */
23056 /* And only certain tokens can begin a constructor declarator. */
23064 /* Parse tentatively; we are going to roll back all of the tokens
23065 consumed here. */
23067 /* Assume that we are looking at a constructor declarator. */
23070 /* Look for the optional `::' operator. */
23073 /* Look for the nested-name-specifier. */
23074 nested_name_specifier
23085 /* Outside of a class-specifier, there must be a
23086 nested-name-specifier. */
23092 /* If we have a class scope, this is easy; DR 147 says that S::S always
23093 names the constructor, and no other qualified name could. */
23096 {
23106 }
23107 /* If we still think that this might be a constructor-declarator,
23108 look for a class-name. */
23110 {
23111 /* If we have:
23113 template <typename T> struct S {
23114 S();
23115 };
23117 we must recognize that the nested `S' names a class. */
23118 tree type_decl;
23122 none_type,
23126 /* If there was no class-name, then this is not a constructor.
23127 Otherwise, if we are in a class-specifier and we aren't
23128 handling a friend declaration, check that its type matches
23129 current_class_type (c++/38313). Note: error_mark_node
23130 is left alone for error recovery purposes. */
23132 && (outside_class_specifier_p
23137 /* If we're still considering a constructor, we have to see a `(',
23138 to begin the parameter-declaration-clause, followed by either a
23139 `)', an `...', or a decl-specifier. We need to check for a
23140 type-specifier to avoid being fooled into thinking that:
23142 S (f) (int);
23144 is a constructor. (It is actually a function named `f' that
23145 takes one parameter (of type `int') and returns a value of type
23146 `S'. */
23154 /* A parameter declaration begins with a decl-specifier,
23155 which is either the "attribute" keyword, a storage class
23156 specifier, or (usually) a type-specifier. */
23158 {
23159 tree type;
23163 /* Names appearing in the type-specifier should be looked up
23164 in the scope of the class. */
23167 else
23168 {
23171 {
23175 {
23178 }
23179 }
23181 }
23183 /* Inside the constructor parameter list, surrounding
23184 template-parameter-lists do not apply. */
23185 saved_num_template_parameter_lists
23189 /* Look for the type-specifier. */
23191 CP_PARSER_FLAGS_NONE,
23197 parser->num_template_parameter_lists
23200 /* Leave the scope of the class. */
23205 }
23206 }
23208 /* We did not really want to consume any tokens. */
23212 }
23214 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23215 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23216 they must be performed once we are in the scope of the function.
23218 Returns the function defined. */
23220 static tree
23221 cp_parser_function_definition_from_specifiers_and_declarator
23224 tree attributes,
23226 {
23227 tree fn;
23230 /* Begin the function-definition. */
23233 /* The things we're about to see are not directly qualified by any
23234 template headers we've seen thus far. */
23237 /* If there were names looked up in the decl-specifier-seq that we
23238 did not check, check them now. We must wait until we are in the
23239 scope of the function to perform the checks, since the function
23240 might be a friend. */
23244 {
23247 }
23250 {
23251 /* Skip the entire function. */
23254 }
23256 {
23257 /* Seen already, skip it. An error message has already been output. */
23261 /* If this is a function from a class, pop the nested class. */
23264 }
23265 else
23266 {
23267 timevar_id_t tv;
23270 else
23276 }
23279 }
23281 /* Parse the part of a function-definition that follows the
23282 declarator. INLINE_P is TRUE iff this function is an inline
23283 function defined within a class-specifier.
23285 Returns the function defined. */
23287 static tree
23290 {
23291 tree fn;
23297 bool fully_implicit_function_template_p
23300 tree implicit_template_parms
23303 cp_binding_level* implicit_template_scope
23309 /* If the next token is `return', then the code may be trying to
23310 make use of the "named return value" extension that G++ used to
23311 support. */
23314 {
23315 /* Consume the `return' keyword. */
23317 /* Look for the identifier that indicates what value is to be
23318 returned. */
23320 /* Issue an error message. */
23323 /* Skip tokens until we reach the start of the function body. */
23325 {
23332 }
23333 }
23334 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23335 anything declared inside `f'. */
23336 saved_in_unbraced_linkage_specification_p
23339 /* Inside the function, surrounding template-parameter-lists do not
23340 apply. */
23341 saved_num_template_parameter_lists
23347 /* If the next token is `try', `__transaction_atomic', or
23348 `__transaction_relaxed`, then we are looking at either function-try-block
23349 or function-transaction-block. Note that all of these include the
23350 function-body. */
23353 RID_TRANSACTION_ATOMIC);
23355 RID_TRANSACTION_RELAXED))
23357 RID_TRANSACTION_RELAXED);
23360 else
23361 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23366 /* Finish the function. */
23369 /* Generate code for it, if necessary. */
23371 /* Restore the saved values. */
23372 parser->in_unbraced_linkage_specification_p
23374 parser->num_template_parameter_lists
23378 parser->fully_implicit_function_template_p
23380 parser->implicit_template_parms
23382 parser->implicit_template_scope
23389 }
23391 /* Parse a template-declaration, assuming that the `export' (and
23392 `extern') keywords, if present, has already been scanned. MEMBER_P
23393 is as for cp_parser_template_declaration. */
23395 static void
23397 {
23400 tree parameter_list;
23405 /* Look for the `template' keyword. */
23410 /* And the `<'. */
23414 {
23415 /* 14.5.2.2 [temp.mem]
23417 A local class shall not have member templates. */
23422 }
23423 /* [temp]
23425 A template ... shall not have C linkage. */
23427 {
23429 /* Give it C++ linkage to avoid confusing other parts of the
23430 front end. */
23433 }
23434 else
23437 /* We cannot perform access checks on the template parameter
23438 declarations until we know what is being declared, just as we
23439 cannot check the decl-specifier list. */
23442 /* If the next token is `>', then we have an invalid
23443 specialization. Rather than complain about an invalid template
23444 parameter, issue an error message here. */
23446 {
23450 }
23451 else
23452 {
23453 /* Parse the template parameters. */
23455 }
23457 /* Get the deferred access checks from the parameter list. These
23458 will be checked once we know what is being declared, as for a
23459 member template the checks must be performed in the scope of the
23460 class containing the member. */
23463 /* Look for the `>'. */
23465 /* We just processed one more parameter list. */
23467 /* If the next token is `template', there are more template
23468 parameters. */
23470 RID_TEMPLATE))
23475 else
23476 {
23477 /* There are no access checks when parsing a template, as we do not
23478 know if a specialization will be a friend. */
23482 checks,
23483 member_p,
23488 /* If this is a member template declaration, let the front
23489 end know. */
23491 {
23496 }
23501 }
23502 /* We are done with the current parameter list. */
23507 /* Finish up. */
23510 /* Check the template arguments for a literal operator template. */
23514 {
23518 else
23519 {
23522 {
23528 }
23530 {
23538 }
23539 else
23541 }
23543 {
23546 " Expected non-type template argument pack <char...>"
23548 decl);
23549 else
23552 decl);
23553 }
23554 }
23555 /* Register member declarations. */
23558 /* For the erroneous case of a template with C linkage, we pushed an
23559 implicit C++ linkage scope; exit that scope now. */
23562 /* If DECL is a function template, we must return to parse it later.
23563 (Even though there is no definition, there might be default
23564 arguments that need handling.) */
23568 }
23570 /* Perform the deferred access checks from a template-parameter-list.
23571 CHECKS is a TREE_LIST of access checks, as returned by
23572 get_deferred_access_checks. */
23574 static void
23575 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23576 {
23580 }
23582 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23583 `function-definition' sequence that follows a template header.
23584 If MEMBER_P is true, this declaration appears in a class scope.
23586 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23587 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23589 static tree
23595 {
23598 cp_decl_specifier_seq decl_specifiers;
23602 /* This function is only used when processing a template
23603 declaration. */
23607 /* Defer access checks until we know what is being declared. */
23610 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23611 alternative. */
23614 CP_PARSER_FLAGS_OPTIONAL,
23620 /* There are no template typedefs. */
23622 {
23626 }
23628 /* Gather up the access checks that occurred the
23629 decl-specifier-seq. */
23632 /* Check for the declaration of a template class. */
23634 {
23636 {
23639 /* In this case:
23641 struct C {
23642 friend template <typename T> struct A<T>::B;
23643 };
23645 A<T>::B will be represented by a TYPENAME_TYPE, and
23646 therefore not recognized by shadow_tag. */
23648 && !decl
23655 else
23658 /* Perform access checks for template parameters. */
23660 }
23661 }
23663 /* Complain about missing 'typename' or other invalid type names. */
23666 {
23667 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23668 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23669 the rest of this declaration. */
23672 }
23674 /* If it's not a template class, try for a template function. If
23675 the next token is a `;', then this declaration does not declare
23676 anything. But, if there were errors in the decl-specifiers, then
23677 the error might well have come from an attempted class-specifier.
23678 In that case, there's no need to warn about a missing declarator. */
23682 {
23685 checks,
23687 member_p,
23688 declares_class_or_enum,
23690 NULL);
23692 /* 7.1.1-1 [dcl.stc]
23694 A storage-class-specifier shall not be specified in an explicit
23695 specialization... */
23697 && explicit_specialization_p
23699 {
23703 }
23707 }
23709 /* Look for a trailing `;' after the declaration. */
23715 out:
23718 /* Clear any current qualification; whatever comes next is the start
23719 of something new. */
23725 }
23727 /* Parse a cast-expression that is not the operand of a unary "&". */
23729 static tree
23731 {
23734 }
23736 /* Parse a functional cast to TYPE. Returns an expression
23737 representing the cast. */
23739 static tree
23741 {
23743 tree expression_list;
23744 tree cast;
23751 {
23759 tf_warning_or_error);
23760 }
23769 else
23770 {
23773 }
23776 tf_warning_or_error);
23777 /* [expr.const]/1: In an integral constant expression "only type
23778 conversions to integral or enumeration type can be used". */
23784 NIC_CONSTRUCTOR))
23787 }
23789 /* Save the tokens that make up the body of a member function defined
23790 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23791 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23792 specifiers applied to the declaration. Returns the FUNCTION_DECL
23793 for the member function. */
23795 static tree
23799 tree attributes)
23800 {
23803 tree fn;
23805 /* Create the FUNCTION_DECL. */
23808 /* If something went badly wrong, bail out now. */
23810 {
23811 /* If there's a function-body, skip it. */
23816 }
23818 /* Remember it, if there default args to post process. */
23821 /* Save away the tokens that make up the body of the
23822 function. */
23824 /* Handle function try blocks. */
23827 /* We can have braced-init-list mem-initializers before the fn body. */
23829 {
23832 {
23833 /* cache_group will stop after an un-nested { } pair, too. */
23837 /* variadic mem-inits have ... after the ')'. */
23840 }
23841 }
23843 /* Handle function try blocks. */
23848 /* Save away the inline definition; we will process it when the
23849 class is complete. */
23853 /* We need to know that this was defined in the class, so that
23854 friend templates are handled correctly. */
23857 /* Add FN to the queue of functions to be parsed later. */
23861 }
23863 /* Save the tokens that make up the in-class initializer for a non-static
23864 data member. Returns a DEFAULT_ARG. */
23866 static tree
23868 {
23870 }
23872 /* Parse a template-argument-list, as well as the trailing ">" (but
23873 not the opening "<"). See cp_parser_template_argument_list for the
23874 return value. */
23876 static tree
23878 {
23879 tree arguments;
23880 tree saved_scope;
23881 tree saved_qualifying_scope;
23882 tree saved_object_scope;
23887 /* [temp.names]
23889 When parsing a template-id, the first non-nested `>' is taken as
23890 the end of the template-argument-list rather than a greater-than
23891 operator. */
23892 saved_greater_than_is_operator_p
23895 /* Parsing the argument list may modify SCOPE, so we save it
23896 here. */
23900 /* We need to evaluate the template arguments, even though this
23901 template-id may be nested within a "sizeof". */
23906 /* Parse the template-argument-list itself. */
23910 else
23912 /* Look for the `>' that ends the template-argument-list. If we find
23913 a '>>' instead, it's probably just a typo. */
23915 {
23917 {
23918 /* In C++0x, a `>>' in a template argument list or cast
23919 expression is considered to be two separate `>'
23920 tokens. So, change the current token to a `>', but don't
23921 consume it: it will be consumed later when the outer
23922 template argument list (or cast expression) is parsed.
23923 Note that this replacement of `>' for `>>' is necessary
23924 even if we are parsing tentatively: in the tentative
23925 case, after calling
23926 cp_parser_enclosed_template_argument_list we will always
23927 throw away all of the template arguments and the first
23928 closing `>', either because the template argument list
23929 was erroneous or because we are replacing those tokens
23930 with a CPP_TEMPLATE_ID token. The second `>' (which will
23931 not have been thrown away) is needed either to close an
23932 outer template argument list or to complete a new-style
23933 cast. */
23936 }
23938 {
23939 /* If we're in a nested template argument list, the '>>' has
23940 to be a typo for '> >'. We emit the error message, but we
23941 continue parsing and we push a '>' as next token, so that
23942 the argument list will be parsed correctly. Note that the
23943 global source location is still on the token before the
23944 '>>', so we need to say explicitly where we want it. */
23950 }
23951 else
23952 {
23953 /* If this is not a nested template argument list, the '>>'
23954 is a typo for '>'. Emit an error message and continue.
23955 Same deal about the token location, but here we can get it
23956 right by consuming the '>>' before issuing the diagnostic. */
23959 "spurious %<>>%>, use %<>%> to terminate "
23961 }
23962 }
23963 else
23965 /* The `>' token might be a greater-than operator again now. */
23966 parser->greater_than_is_operator_p
23968 /* Restore the SAVED_SCOPE. */
23976 }
23978 /* MEMBER_FUNCTION is a member function, or a friend. If default
23979 arguments, or the body of the function have not yet been parsed,
23980 parse them now. */
23982 static void
23984 {
23986 /* If this member is a template, get the underlying
23987 FUNCTION_DECL. */
23991 /* There should not be any class definitions in progress at this
23992 point; the bodies of members are only parsed outside of all class
23993 definitions. */
23995 /* While we're parsing the member functions we might encounter more
23996 classes. We want to handle them right away, but we don't want
23997 them getting mixed up with functions that are currently in the
23998 queue. */
24001 /* Make sure that any template parameters are in scope. */
24004 /* If the body of the function has not yet been parsed, parse it
24005 now. */
24007 {
24008 tree function_scope;
24011 /* The function is no longer pending; we are processing it. */
24016 /* If this is a local class, enter the scope of the containing
24017 function. */
24022 /* Push the body of the function onto the lexer stack. */
24025 /* Let the front end know that we going to be defining this
24026 function. */
24030 /* Don't do access checking if it is a templated function. */
24034 /* #pragma omp declare reduction needs special parsing. */
24036 {
24041 }
24042 else
24043 /* Now, parse the body of the function. */
24050 /* Leave the scope of the containing function. */
24054 }
24056 /* Remove any template parameters from the symbol table. */
24059 /* Restore the queue. */
24062 }
24064 /* If DECL contains any default args, remember it on the unparsed
24065 functions queue. */
24067 static void
24069 {
24070 tree probe;
24073 probe;
24076 {
24080 }
24081 }
24083 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24084 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24085 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24086 from the parameter-type-list. */
24088 static tree
24091 {
24093 tree parsed_arg;
24099 /* Push the saved tokens for the default argument onto the parser's
24100 lexer stack. */
24106 /* Parse the default argument. */
24117 {
24118 /* In a non-template class, check conversions now. In a template,
24119 we'll wait and instantiate these as needed. */
24122 tf_warning_or_error);
24123 else
24125 }
24127 /* If the token stream has not been completely used up, then
24128 there was extra junk after the end of the default
24129 argument. */
24131 {
24134 else
24136 }
24138 /* Revert to the main lexer. */
24142 }
24144 /* FIELD is a non-static data member with an initializer which we saved for
24145 later; parse it now. */
24147 static void
24149 {
24150 tree def;
24157 NULL_TREE);
24163 }
24165 /* FN is a FUNCTION_DECL which may contains a parameter with an
24166 unparsed DEFAULT_ARG. Parse the default args now. This function
24167 assumes that the current scope is the scope in which the default
24168 argument should be processed. */
24170 static void
24172 {
24176 /* While we're parsing the default args, we might (due to the
24177 statement expression extension) encounter more classes. We want
24178 to handle them right away, but we don't want them getting mixed
24179 up with default args that are currently in the queue. */
24182 /* Local variable names (and the `this' keyword) may not appear
24183 in a default argument. */
24194 {
24196 tree parsed_arg;
24198 tree copy;
24205 /* This can happen for a friend declaration for a function
24206 already declared with default arguments. */
24209 parsed_arg
24211 default_arg,
24214 {
24216 }
24220 /* Update any instantiations we've already created. */
24224 }
24228 /* Make sure no default arg is missing. */
24231 /* Restore the state of local_variables_forbidden_p. */
24234 /* Restore the queue. */
24236 }
24238 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24240 sizeof ... ( identifier )
24242 where the 'sizeof' token has already been consumed. */
24244 static tree
24246 {
24247 /* Consume the `...'. */
24254 else
24262 /* The name is not qualified. */
24280 }
24282 /* Parse the operand of `sizeof' (or a similar operator). Returns
24283 either a TYPE or an expression, depending on the form of the
24284 input. The KEYWORD indicates which kind of expression we have
24285 encountered. */
24287 static tree
24289 {
24296 /* If it's a `...', then we are computing the length of a parameter
24297 pack. */
24302 /* Types cannot be defined in a `sizeof' expression. Save away the
24303 old message. */
24305 /* And create the new one. */
24311 /* The restrictions on constant-expressions do not apply inside
24312 sizeof expressions. */
24313 saved_integral_constant_expression_p
24315 saved_non_integral_constant_expression_p
24319 /* Do not actually evaluate the expression. */
24322 /* If it's a `(', then we might be looking at the type-id
24323 construction. */
24325 {
24328 /* We can't be sure yet whether we're looking at a type-id or an
24329 expression. */
24331 /* Note: as a GNU Extension, compound literals are considered
24332 postfix-expressions as they are in C99, so they are valid
24333 arguments to sizeof. See comment in cp_parser_cast_expression
24334 for details. */
24337 else
24338 {
24341 /* Look for the type-id. */
24343 /* Look for the closing `)'. */
24346 }
24348 /* If all went well, then we're done. */
24350 {
24351 cp_decl_specifier_seq decl_specs;
24353 /* Build a trivial decl-specifier-seq. */
24357 /* Call grokdeclarator to figure out what type this is. */
24360 TYPENAME,
24363 }
24364 }
24366 /* If the type-id production did not work out, then we must be
24367 looking at the unary-expression production. */
24371 /* Go back to evaluating expressions. */
24375 /* Free the message we created. */
24377 /* And restore the old one. */
24379 parser->integral_constant_expression_p
24381 parser->non_integral_constant_expression_p
24385 }
24387 /* If the current declaration has no declarator, return true. */
24389 static bool
24391 {
24392 /* If the next token is a `;' or a `,' then there is no
24393 declarator. */
24396 }
24398 /* Update the DECL_SPECS to reflect the storage class indicated by
24399 KEYWORD. */
24401 static void
24406 {
24407 cp_storage_class storage_class;
24410 {
24414 }
24416 {
24419 }
24424 {
24427 }
24430 {
24448 }
24452 /* A storage class specifier cannot be applied alongside a typedef
24453 specifier. If there is a typedef specifier present then set
24454 conflicting_specifiers_p which will trigger an error later
24455 on in grokdeclarator. */
24458 }
24460 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24461 is true, the type is a class or enum definition. */
24463 static void
24465 tree type_spec,
24468 {
24471 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24472 (with, for example, in "typedef int wchar_t;") we remember that
24473 this is what happened. In system headers, we ignore these
24474 declarations so that G++ can work with system headers that are not
24475 C++-safe. */
24477 && !type_definition_p
24487 {
24490 ds_redefined_builtin_type_spec,
24491 token);
24493 {
24497 }
24498 }
24501 else
24502 {
24507 }
24508 }
24510 /* True iff TOKEN is the GNU keyword __thread. */
24512 static bool
24514 {
24517 }
24519 /* Set the location for a declarator specifier and check if it is
24520 duplicated.
24522 DECL_SPECS is the sequence of declarator specifiers onto which to
24523 set the location.
24525 DS is the single declarator specifier to set which location is to
24526 be set onto the existing sequence of declarators.
24528 LOCATION is the location for the declarator specifier to
24529 consider. */
24531 static void
24534 {
24543 {
24547 }
24548 else
24549 {
24551 {
24555 else
24556 {
24559 OPT_Wlong_long,
24561 }
24562 }
24564 {
24569 else
24571 }
24572 else
24573 {
24589 "__complex"
24590 };
24593 }
24594 }
24595 }
24597 /* Return true iff the declarator specifier DS is present in the
24598 sequence of declarator specifiers DECL_SPECS. */
24600 bool
24602 cp_decl_spec ds)
24603 {
24610 }
24612 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24613 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24615 static bool
24617 {
24619 }
24621 /* Issue an error message indicating that TOKEN_DESC was expected.
24622 If KEYWORD is true, it indicated this function is called by
24623 cp_parser_require_keword and the required token can only be
24624 a indicated keyword. */
24626 static void
24628 required_token token_desc,
24630 {
24632 {
24701 }
24703 {
24705 {
24784 }
24785 }
24786 else
24788 }
24792 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24793 issue an error message indicating that TOKEN_DESC was expected.
24795 Returns the token consumed, if the token had the appropriate type.
24796 Otherwise, returns NULL. */
24801 required_token token_desc)
24802 {
24805 else
24806 {
24807 /* Output the MESSAGE -- unless we're parsing tentatively. */
24811 }
24812 }
24814 /* An error message is produced if the next token is not '>'.
24815 All further tokens are skipped until the desired token is
24816 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24818 static void
24820 {
24821 /* Current level of '< ... >'. */
24823 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24826 /* Are we ready, yet? If not, issue error message. */
24830 /* Skip tokens until the desired token is found. */
24832 {
24833 /* Peek at the next token. */
24835 {
24843 /* C++0x views the `>>' operator as two `>' tokens, but
24844 C++98 does not. */
24847 {
24848 /* We've hit a `>>' where the first `>' closes the
24849 template argument list, and the second `>' is
24850 spurious. Just consume the `>>' and stop; we've
24851 already produced at least one error. */
24854 }
24855 /* Fall through for C++0x, so we handle the second `>' in
24856 the `>>'. */
24860 {
24861 /* We've reached the token we want, consume it and stop. */
24864 }
24883 /* The '>' was probably forgotten, don't look further. */
24888 }
24890 /* Consume this token. */
24892 }
24893 }
24895 /* If the next token is the indicated keyword, consume it. Otherwise,
24896 issue an error message indicating that TOKEN_DESC was expected.
24898 Returns the token consumed, if the token had the appropriate type.
24899 Otherwise, returns NULL. */
24904 required_token token_desc)
24905 {
24909 {
24912 }
24915 }
24917 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24918 function-definition. */
24920 static bool
24922 {
24925 /* A ctor-initializer begins with a `:'. */
24927 /* A function-try-block begins with `try'. */
24929 /* A function-transaction-block begins with `__transaction_atomic'
24930 or `__transaction_relaxed'. */
24933 /* The named return value extension begins with `return'. */
24935 }
24937 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24938 definition. */
24940 static bool
24942 {
24949 }
24951 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24952 C++0x) ending a template-argument. */
24954 static bool
24956 {
24964 }
24966 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24967 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24969 static bool
24972 {
24978 /* Check for the sequence `<::' in the original code. It would be lexed as
24979 `[:', where `[' is a digraph, and there is no whitespace before
24980 `:'. */
24982 {
24987 }
24989 }
24991 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24992 or none_type otherwise. */
24994 static enum tag_types
24996 {
24998 {
25008 }
25009 }
25011 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25012 or none_type otherwise or if the token is null. */
25014 static enum tag_types
25016 {
25021 {
25029 }
25030 }
25032 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25034 static void
25036 {
25040 {
25044 type))
25047 }
25048 }
25050 /* Issue an error message if DECL is redeclared with different
25051 access than its original declaration [class.access.spec/3].
25052 This applies to nested classes and nested class templates.
25053 [class.mem/1]. */
25055 static void
25057 {
25066 }
25068 /* Look for the `template' keyword, as a syntactic disambiguator.
25069 Return TRUE iff it is present, in which case it will be
25070 consumed. */
25072 static bool
25074 {
25076 {
25077 /* In C++98 the `template' keyword can only be used within templates;
25078 outside templates the parser can always figure out what is a
25079 template and what is not. In C++11, per the resolution of DR 468,
25080 `template' is allowed in cases where it is not strictly necessary. */
25083 {
25086 "in C++98 %<template%> (as a disambiguator) is only "
25088 /* If this part of the token stream is rescanned, the same
25089 error message would be generated. So, we purge the token
25090 from the stream. */
25093 }
25094 else
25095 {
25096 /* Consume the `template' keyword. */
25099 }
25100 }
25102 }
25104 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25105 set PARSER->SCOPE, and perform other related actions. */
25107 static void
25109 {
25115 /* Get the stored value. */
25117 /* Perform any access checks that were deferred. */
25120 {
25125 }
25126 /* Set the scope from the stored value. */
25130 }
25132 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25133 encounter the end of a block before what we were looking for. */
25135 static bool
25139 {
25141 {
25144 /* Abort a parenthesized expression if we encounter a semicolon. */
25148 /* If we've reached the end of the file, stop. */
25154 /* We've hit the end of an enclosing block, so there's been some
25155 kind of syntax error. */
25158 /* Consume the token. */
25160 /* See if it starts a new group. */
25162 {
25164 /* In theory this should probably check end == '}', but
25165 cp_parser_save_member_function_body needs it to exit
25166 after either '}' or ')' when called with ')'. */
25169 }
25171 {
25175 }
25180 }
25181 }
25183 /* Like above, for caching a default argument or NSDMI. Both of these are
25184 terminated by a non-nested comma, but it can be unclear whether or not a
25185 comma is nested in a template argument list unless we do more parsing.
25186 In order to handle this ambiguity, when we encounter a ',' after a '<'
25187 we try to parse what follows as a parameter-declaration-list (in the
25188 case of a default argument) or a member-declarator (in the case of an
25189 NSDMI). If that succeeds, then we stop caching. */
25191 static tree
25193 {
25198 tree default_argument;
25200 /* Add tokens until we have processed the entire default
25201 argument. We add the range [first_token, token). */
25204 {
25205 /* For list-initialization, this is straightforward. */
25208 }
25210 {
25213 /* Peek at the next token. */
25215 /* What we do depends on what token we have. */
25217 {
25218 /* In valid code, a default argument must be
25219 immediately followed by a `,' `)', or `...'. */
25222 {
25223 /* If we've seen a '<', we might be in a
25224 template-argument-list. Until Core issue 325 is
25225 resolved, we don't know how this situation ought
25226 to be handled, so try to DTRT. We check whether
25227 what comes after the comma is a valid parameter
25228 declaration list. If it is, then the comma ends
25229 the default argument; otherwise the default
25230 argument continues. */
25233 /* Set ITALP so cp_parser_parameter_declaration_list
25234 doesn't decide to commit to this parse. */
25242 {
25249 }
25250 else
25251 {
25255 }
25262 }
25265 /* If we run into a non-nested `;', `}', or `]',
25266 then the code is invalid -- but the default
25267 argument is certainly over. */
25272 /* Handle correctly int n = sizeof ... ( p ); */
25275 /* Update DEPTH, if necessary. */
25290 /* This might be the comparison operator, or it might
25291 start a template argument list. */
25298 /* Fall through for C++0x, which treats the `>>'
25299 operator like two `>' tokens in certain
25300 cases. */
25304 {
25305 /* This might be an operator, or it might close a
25306 template argument list. But if a previous '<'
25307 started a template argument list, this will have
25308 closed it, so we can't be in one anymore. */
25312 }
25315 /* If we run out of tokens, issue an error message. */
25324 /* In these cases, we should look for template-ids.
25325 For example, if the default argument is
25326 `X<int, double>()', we need to do name lookup to
25327 figure out whether or not `X' is a template; if
25328 so, the `,' does not end the default argument.
25330 That is not yet done. */
25335 }
25337 /* If we've reached the end, stop. */
25341 /* Add the token to the token block. */
25343 }
25345 /* Create a DEFAULT_ARG to represent the unparsed default
25346 argument. */
25353 }
25355 /* Begin parsing tentatively. We always save tokens while parsing
25356 tentatively so that if the tentative parsing fails we can restore the
25357 tokens. */
25359 static void
25361 {
25362 /* Enter a new parsing context. */
25364 /* Begin saving tokens. */
25366 /* In order to avoid repetitive access control error messages,
25367 access checks are queued up until we are no longer parsing
25368 tentatively. */
25370 }
25372 /* Commit to the currently active tentative parse. */
25374 static void
25376 {
25380 /* Mark all of the levels as committed. */
25383 {
25390 }
25391 }
25393 /* Commit to the topmost currently active tentative parse.
25395 Note that this function shouldn't be called when there are
25396 irreversible side-effects while in a tentative state. For
25397 example, we shouldn't create a permanent entry in the symbol
25398 table, or issue an error message that might not apply if the
25399 tentative parse is aborted. */
25401 static void
25403 {
25408 {
25416 }
25417 }
25419 /* Abort the currently active tentative parse. All consumed tokens
25420 will be rolled back, and no diagnostics will be issued. */
25422 static void
25424 {
25428 /* Now, pretend that we want to see if the construct was
25429 successfully parsed. */
25431 }
25433 /* Stop parsing tentatively. If a parse error has occurred, restore the
25434 token stream. Otherwise, commit to the tokens we have consumed.
25435 Returns true if no error occurred; false otherwise. */
25437 static bool
25439 {
25443 /* Remember whether or not an error occurred, since we are about to
25444 destroy that information. */
25446 /* Remove the topmost context from the stack. */
25449 /* If no parse errors occurred, commit to the tentative parse. */
25451 {
25452 /* Commit to the tokens read tentatively, unless that was
25453 already done. */
25458 }
25459 /* Otherwise, if errors occurred, roll back our state so that things
25460 are just as they were before we began the tentative parse. */
25461 else
25462 {
25465 }
25466 /* Add the context to the front of the free list. */
25471 }
25473 /* Returns true if we are parsing tentatively and are not committed to
25474 this tentative parse. */
25476 static bool
25478 {
25481 }
25483 /* Returns nonzero iff an error has occurred during the most recent
25484 tentative parse. */
25486 static bool
25488 {
25491 }
25493 /* Returns nonzero if GNU extensions are allowed. */
25495 static bool
25497 {
25499 }
25500 \f
25501 /* Objective-C++ Productions */
25504 /* Parse an Objective-C expression, which feeds into a primary-expression
25505 above.
25507 objc-expression:
25508 objc-message-expression
25509 objc-string-literal
25510 objc-encode-expression
25511 objc-protocol-expression
25512 objc-selector-expression
25514 Returns a tree representation of the expression. */
25516 static tree
25518 {
25519 /* Try to figure out what kind of declaration is present. */
25523 {
25533 {
25545 }
25551 }
25554 }
25556 /* Parse an Objective-C message expression.
25558 objc-message-expression:
25559 [ objc-message-receiver objc-message-args ]
25561 Returns a representation of an Objective-C message. */
25563 static tree
25565 {
25574 }
25576 /* Parse an objc-message-receiver.
25578 objc-message-receiver:
25579 expression
25580 simple-type-specifier
25582 Returns a representation of the type or expression. */
25584 static tree
25586 {
25587 tree rcv;
25589 /* An Objective-C message receiver may be either (1) a type
25590 or (2) an expression. */
25599 CP_PARSER_FLAGS_NONE);
25602 }
25604 /* Parse the arguments and selectors comprising an Objective-C message.
25606 objc-message-args:
25607 objc-selector
25608 objc-selector-args
25609 objc-selector-args , objc-comma-args
25611 objc-selector-args:
25612 objc-selector [opt] : assignment-expression
25613 objc-selector-args objc-selector [opt] : assignment-expression
25615 objc-comma-args:
25616 assignment-expression
25617 objc-comma-args , assignment-expression
25619 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25620 selector arguments and TREE_VALUE containing a list of comma
25621 arguments. */
25623 static tree
25625 {
25631 {
25637 /* Detect if we have a unary selector. */
25646 sel_args
25651 }
25653 /* Handle non-selector arguments, if any. */
25655 {
25656 tree arg;
25661 addl_args
25666 }
25669 {
25672 }
25675 }
25677 /* Parse an Objective-C encode expression.
25679 objc-encode-expression:
25680 @encode objc-typename
25682 Returns an encoded representation of the type argument. */
25684 static tree
25686 {
25687 tree type;
25697 {
25701 }
25703 /* This happens if we find @encode(T) (where T is a template
25704 typename or something dependent on a template typename) when
25705 parsing a template. In that case, we can't compile it
25706 immediately, but we rather create an AT_ENCODE_EXPR which will
25707 need to be instantiated when the template is used.
25708 */
25710 {
25714 }
25717 }
25719 /* Parse an Objective-C @defs expression. */
25721 static tree
25723 {
25724 tree name;
25732 }
25734 /* Parse an Objective-C protocol expression.
25736 objc-protocol-expression:
25737 @protocol ( identifier )
25739 Returns a representation of the protocol expression. */
25741 static tree
25743 {
25744 tree proto;
25752 }
25754 /* Parse an Objective-C selector expression.
25756 objc-selector-expression:
25757 @selector ( objc-method-signature )
25759 objc-method-signature:
25760 objc-selector
25761 objc-selector-seq
25763 objc-selector-seq:
25764 objc-selector :
25765 objc-selector-seq objc-selector :
25767 Returns a representation of the method selector. */
25769 static tree
25771 {
25783 {
25792 {
25793 /* Detect if we have a unary selector. */
25795 {
25798 }
25799 else
25800 {
25802 }
25803 }
25808 {
25809 sel_seq
25812 sel_seq
25815 }
25816 else
25817 sel_seq
25822 }
25824 finish_selector:
25828 }
25830 /* Parse a list of identifiers.
25832 objc-identifier-list:
25833 identifier
25834 objc-identifier-list , identifier
25836 Returns a TREE_LIST of identifier nodes. */
25838 static tree
25840 {
25841 tree identifier;
25842 tree list;
25853 {
25860 identifier));
25862 }
25865 }
25867 /* Parse an Objective-C alias declaration.
25869 objc-alias-declaration:
25870 @compatibility_alias identifier identifier ;
25872 This function registers the alias mapping with the Objective-C front end.
25873 It returns nothing. */
25875 static void
25877 {
25885 }
25887 /* Parse an Objective-C class forward-declaration.
25889 objc-class-declaration:
25890 @class objc-identifier-list ;
25892 The function registers the forward declarations with the Objective-C
25893 front end. It returns nothing. */
25895 static void
25897 {
25900 {
25901 tree id;
25911 else
25913 }
25915 }
25917 /* Parse a list of Objective-C protocol references.
25919 objc-protocol-refs-opt:
25920 objc-protocol-refs [opt]
25922 objc-protocol-refs:
25923 < objc-identifier-list >
25925 Returns a TREE_LIST of identifiers, if any. */
25927 static tree
25929 {
25933 {
25937 }
25940 }
25942 /* Parse a Objective-C visibility specification. */
25944 static void
25946 {
25950 {
25965 }
25967 /* Eat '@private'/'@protected'/'@public'. */
25969 }
25971 /* Parse an Objective-C method type. Return 'true' if it is a class
25972 (+) method, and 'false' if it is an instance (-) method. */
25976 {
25979 else
25981 }
25983 /* Parse an Objective-C protocol qualifier. */
25985 static tree
25987 {
26000 {
26005 }
26008 }
26010 /* Parse an Objective-C typename. */
26012 static tree
26014 {
26018 {
26024 /* An ObjC type name may consist of just protocol qualifiers, in which
26025 case the type shall default to 'id'. */
26027 {
26030 /* If the type could not be parsed, an error has already
26031 been produced. For error recovery, behave as if it had
26032 not been specified, which will use the default type
26033 'id'. */
26035 {
26037 /* We need to skip to the closing parenthesis as
26038 cp_parser_type_id() does not seem to do it for
26039 us. */
26044 }
26045 }
26049 }
26052 }
26054 /* Check to see if TYPE refers to an Objective-C selector name. */
26056 static bool
26058 {
26064 }
26066 /* Parse an Objective-C selector. */
26068 static tree
26070 {
26074 {
26077 }
26079 /* C++ operator names are allowed to appear in ObjC selectors. */
26081 {
26094 }
26095 }
26097 /* Parse an Objective-C params list. */
26099 static tree
26101 {
26107 {
26117 /* Detect if we have a unary selector. */
26120 {
26123 }
26127 {
26128 /* Something went quite wrong. There should be a colon
26129 here, but there is not. Stop parsing parameters. */
26131 }
26133 /* New ObjC allows attributes on parameters too. */
26138 params
26141 type_name,
26142 identifier,
26143 parm_attr));
26146 }
26149 {
26152 }
26154 /* We allow tail attributes for the method. */
26156 {
26164 }
26167 {
26170 }
26172 }
26174 /* Parse the non-keyword Objective-C params. */
26176 static tree
26179 {
26185 {
26187 tree parm;
26193 {
26198 }
26200 /* TODO: parse attributes for tail parameters. */
26209 }
26211 /* We allow tail attributes for the method. */
26213 {
26215 {
26220 }
26221 else
26222 /* We have an error, but parse the attributes, so that we can
26223 carry on. */
26229 }
26232 }
26234 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26236 static void
26238 {
26241 /* If the next token is `extern' and the following token is a string
26242 literal, then we have a linkage specification. */
26244 && cp_parser_is_pure_string_literal
26247 /* Handle #pragma, if any. */
26250 /* Allow stray semicolons. */
26253 /* Mark methods as optional or required, when building protocols. */
26255 {
26258 }
26260 {
26263 }
26266 /* Other stray characters must generate errors. */
26268 {
26272 }
26273 /* Finally, try to parse a block-declaration, or a function-definition. */
26274 else
26276 }
26278 /* Parse a method signature. */
26280 static tree
26282 {
26298 }
26300 static bool
26302 {
26303 tree tattr;
26308 /* If the attributes are followed by a method introducer, this is not allowed.
26309 Dump the attributes and flag the situation. */
26314 /* Otherwise, the attributes introduce some interstitial code, possibly so
26315 rewind to allow that check. */
26318 }
26320 /* Parse an Objective-C method prototype list. */
26322 static void
26324 {
26328 {
26330 {
26335 else
26339 {
26343 }
26346 }
26352 OPT_Wattributes,
26354 else
26355 /* Allow for interspersed non-ObjC++ code. */
26359 }
26363 else
26367 }
26369 /* Parse an Objective-C method definition list. */
26371 static void
26373 {
26377 {
26378 tree meth;
26381 {
26387 else
26392 {
26396 }
26398 NULL_TREE);
26400 /* For historical reasons, we accept an optional semicolon. */
26407 {
26414 }
26415 }
26416 /* The following case will be removed once @synthesize is
26417 completely implemented. */
26428 else
26429 /* Allow for interspersed non-ObjC++ code. */
26433 }
26437 else
26441 }
26443 /* Parse Objective-C ivars. */
26445 static void
26447 {
26458 {
26459 cp_decl_specifier_seq declspecs;
26461 tree prefix_attributes;
26469 CP_PARSER_FLAGS_OPTIONAL,
26473 /* auto, register, static, extern, mutable. */
26475 {
26478 }
26480 /* thread_local. */
26482 {
26485 }
26487 /* typedef. */
26489 {
26492 }
26497 /* Keep going until we hit the `;' at the end of the
26498 declaration. */
26500 {
26505 /* Check for a (possibly unnamed) bitfield declaration. */
26513 {
26514 /* Get the name of the bitfield. */
26517 sfk_none);
26519 eat_colon:
26521 /* Get the width of the bitfield. */
26522 width
26524 }
26525 else
26526 {
26527 /* Parse the declarator. */
26528 declarator
26534 }
26536 /* Look for attributes that apply to the ivar. */
26538 /* Remember which attributes are prefix attributes and
26539 which are not. */
26541 /* Combine the attributes. */
26545 /* Create the bitfield declaration. */
26547 width,
26548 attributes);
26549 else
26554 /* Add the instance variable. */
26558 /* Reset PREFIX_ATTRIBUTES. */
26567 {
26570 }
26572 }
26576 }
26581 /* Do not consume the RID_AT_END, so it will be read again as terminating
26582 the @interface of @implementation. */
26586 /* For historical reasons, we accept an optional semicolon. */
26589 }
26591 /* Parse an Objective-C protocol declaration. */
26593 static void
26595 {
26601 {
26606 }
26608 /* See if we have a forward declaration or a definition. */
26611 /* Try a forward declaration first. */
26613 {
26615 {
26616 tree id;
26626 else
26628 }
26630 }
26632 /* Ok, we got a full-fledged definition (or at least should). */
26633 else
26634 {
26639 }
26640 }
26642 /* Parse an Objective-C superclass or category. */
26644 static void
26649 {
26655 {
26658 }
26660 {
26663 /* If there is no category name, and this is an @interface, we
26664 have a class extension. */
26666 {
26669 }
26670 else
26674 }
26675 }
26677 /* Parse an Objective-C class interface. */
26679 static void
26681 {
26688 {
26689 /* It's hard to recover because even if valid @interface stuff
26690 is to follow, we can't compile it (or validate it) if we
26691 don't even know which class it refers to. Let's assume this
26692 was a stray '@interface' token in the stream and skip it.
26693 */
26695 }
26700 /* We have either a class or a category on our hands. */
26703 else
26704 {
26706 /* Handle instance variable declarations, if any. */
26709 }
26712 }
26714 /* Parse an Objective-C class implementation. */
26716 static void
26718 {
26725 {
26726 /* It's hard to recover because even if valid @implementation
26727 stuff is to follow, we can't compile it (or validate it) if
26728 we don't even know which class it refers to. Let's assume
26729 this was a stray '@implementation' token in the stream and
26730 skip it.
26731 */
26733 }
26737 /* We have either a class or a category on our hands. */
26740 else
26741 {
26743 /* Handle instance variable declarations, if any. */
26746 }
26749 }
26751 /* Consume the @end token and finish off the implementation. */
26753 static void
26755 {
26758 }
26760 /* Parse an Objective-C declaration. */
26762 static void
26764 {
26765 /* Try to figure out what kind of declaration is present. */
26770 {
26786 }
26789 {
26812 }
26813 }
26815 /* Parse an Objective-C try-catch-finally statement.
26817 objc-try-catch-finally-stmt:
26818 @try compound-statement objc-catch-clause-seq [opt]
26819 objc-finally-clause [opt]
26821 objc-catch-clause-seq:
26822 objc-catch-clause objc-catch-clause-seq [opt]
26824 objc-catch-clause:
26825 @catch ( objc-exception-declaration ) compound-statement
26827 objc-finally-clause:
26828 @finally compound-statement
26830 objc-exception-declaration:
26831 parameter-declaration
26832 '...'
26834 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26836 Returns NULL_TREE.
26838 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26839 for C. Keep them in sync. */
26841 static tree
26843 {
26844 location_t location;
26845 tree stmt;
26850 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26851 node, lest it get absorbed into the surrounding block. */
26857 {
26866 {
26867 /* We have "@catch (...)" (where the '...' are literally
26868 what is in the code). Skip the '...'.
26869 parameter_declaration is set to NULL_TREE, and
26870 objc_being_catch_clauses() knows that that means
26871 '...'. */
26874 }
26875 else
26876 {
26877 /* We have "@catch (NSException *exception)" or something
26878 like that. Parse the parameter declaration. */
26882 else
26887 }
26890 else
26891 {
26892 /* If there was no open parenthesis, we are recovering from
26893 an error, and we are trying to figure out what mistake
26894 the user has made. */
26896 /* If there is an immediate closing parenthesis, the user
26897 probably forgot the opening one (ie, they typed "@catch
26898 NSException *e)". Parse the closing parenthesis and keep
26899 going. */
26903 /* If these is no immediate closing parenthesis, the user
26904 probably doesn't know that parenthesis are required at
26905 all (ie, they typed "@catch NSException *e"). So, just
26906 forget about the closing parenthesis and keep going. */
26907 }
26911 }
26913 {
26916 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26917 node, lest it get absorbed into the surrounding block. */
26921 }
26924 }
26926 /* Parse an Objective-C synchronized statement.
26928 objc-synchronized-stmt:
26929 @synchronized ( expression ) compound-statement
26931 Returns NULL_TREE. */
26933 static tree
26935 {
26936 location_t location;
26947 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26948 node, lest it get absorbed into the surrounding block. */
26953 }
26955 /* Parse an Objective-C throw statement.
26957 objc-throw-stmt:
26958 @throw assignment-expression [opt] ;
26960 Returns a constructed '@throw' statement. */
26962 static tree
26964 {
26976 }
26978 /* Parse an Objective-C statement. */
26980 static tree
26982 {
26983 /* Try to figure out what kind of declaration is present. */
26987 {
26998 }
27001 }
27003 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27004 look ahead to see if an objc keyword follows the attributes. This
27005 is to detect the use of prefix attributes on ObjC @interface and
27006 @protocol. */
27008 static bool
27010 {
27015 {
27018 }
27021 }
27023 /* This routine is a minimal replacement for
27024 c_parser_struct_declaration () used when parsing the list of
27025 types/names or ObjC++ properties. For example, when parsing the
27026 code
27028 @property (readonly) int a, b, c;
27030 this function is responsible for parsing "int a, int b, int c" and
27031 returning the declarations as CHAIN of DECLs.
27033 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27034 similar parsing. */
27035 static tree
27037 {
27039 cp_decl_specifier_seq declspecs;
27041 tree prefix_attributes;
27044 CP_PARSER_FLAGS_NONE,
27051 /* auto, register, static, extern, mutable. */
27053 {
27056 }
27058 /* thread_local. */
27060 {
27063 }
27065 /* typedef. */
27067 {
27070 }
27075 /* Keep going until we hit the `;' at the end of the declaration. */
27077 {
27082 /* Parse the declarator. */
27086 /* Look for attributes that apply to the ivar. */
27088 /* Remember which attributes are prefix attributes and
27089 which are not. */
27091 /* Combine the attributes. */
27101 /* Reset PREFIX_ATTRIBUTES. */
27112 {
27115 }
27116 else
27118 }
27120 }
27122 /* Parse an Objective-C @property declaration. The syntax is:
27124 objc-property-declaration:
27125 '@property' objc-property-attributes[opt] struct-declaration ;
27127 objc-property-attributes:
27128 '(' objc-property-attribute-list ')'
27130 objc-property-attribute-list:
27131 objc-property-attribute
27132 objc-property-attribute-list, objc-property-attribute
27134 objc-property-attribute
27135 'getter' = identifier
27136 'setter' = identifier
27137 'readonly'
27138 'readwrite'
27139 'assign'
27140 'retain'
27141 'copy'
27142 'nonatomic'
27144 For example:
27145 @property NSString *name;
27146 @property (readonly) id object;
27147 @property (retain, nonatomic, getter=getTheName) id name;
27148 @property int a, b, c;
27150 PS: This function is identical to
27151 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27152 static void
27154 {
27155 /* The following variables hold the attributes of the properties as
27156 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27157 seen. When we see an attribute, we set them to 'true' (if they
27158 are boolean properties) or to the identifier (if they have an
27159 argument, ie, for getter and setter). Note that here we only
27160 parse the list of attributes, check the syntax and accumulate the
27161 attributes that we find. objc_add_property_declaration() will
27162 then process the information. */
27172 /* 'properties' is the list of properties that we read. Usually a
27173 single one, but maybe more (eg, in "@property int a, b, c;" there
27174 are three). */
27175 tree properties;
27176 location_t loc;
27182 /* Parse the optional attribute list... */
27184 {
27185 /* Eat the '('. */
27189 {
27195 {
27198 }
27202 {
27213 {
27217 else
27222 }
27225 {
27229 }
27231 {
27233 {
27236 }
27237 else
27241 else
27243 }
27244 else
27245 {
27247 {
27250 }
27251 else
27253 }
27259 }
27266 else
27268 }
27270 /* FIXME: "@property (setter, assign);" will generate a spurious
27271 "error: expected ‘)’ before ‘,’ token". This is because
27272 cp_parser_require, unlike the C counterpart, will produce an
27273 error even if we are in error recovery. */
27275 {
27280 }
27281 }
27283 /* ... and the property declaration(s). */
27287 {
27289 /* If the next token is now a `;', consume it. */
27293 }
27297 else
27298 {
27299 /* Comma-separated properties are chained together in
27300 reverse order; add them one by one. */
27309 }
27312 }
27314 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27316 objc-synthesize-declaration:
27317 @synthesize objc-synthesize-identifier-list ;
27319 objc-synthesize-identifier-list:
27320 objc-synthesize-identifier
27321 objc-synthesize-identifier-list, objc-synthesize-identifier
27323 objc-synthesize-identifier
27324 identifier
27325 identifier = identifier
27327 For example:
27328 @synthesize MyProperty;
27329 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27331 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27332 for C. Keep them in sync.
27333 */
27334 static void
27336 {
27338 location_t loc;
27343 {
27347 {
27350 }
27352 {
27356 {
27359 }
27360 }
27361 else
27366 else
27368 }
27371 }
27373 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27375 objc-dynamic-declaration:
27376 @dynamic identifier-list ;
27378 For example:
27379 @dynamic MyProperty;
27380 @dynamic MyProperty, AnotherProperty;
27382 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27383 for C. Keep them in sync.
27384 */
27385 static void
27387 {
27389 location_t loc;
27394 {
27395 tree property;
27398 {
27401 }
27405 else
27407 }
27410 }
27412 \f
27413 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27415 /* Returns name of the next clause.
27416 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27417 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27418 returned and the token is consumed. */
27420 static pragma_omp_clause
27422 {
27434 {
27439 {
27542 }
27543 }
27549 }
27551 /* Validate that a clause of the given type does not already exist. */
27553 static void
27556 {
27557 tree c;
27561 {
27564 }
27565 }
27567 /* OpenMP 2.5:
27568 variable-list:
27569 identifier
27570 variable-list , identifier
27572 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27573 colon). An opening parenthesis will have been consumed by the caller.
27575 If KIND is nonzero, create the appropriate node and install the decl
27576 in OMP_CLAUSE_DECL and add the node to the head of the list.
27578 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27579 return the list created.
27581 COLON can be NULL if only closing parenthesis should end the list,
27582 or pointer to bool which will receive false if the list is terminated
27583 by closing parenthesis or true if the list is terminated by colon. */
27585 static tree
27588 {
27592 {
27595 }
27597 {
27614 {
27616 {
27622 {
27630 parser->colon_corrects_to_scope_p
27634 else
27635 {
27636 /* Look for `:'. */
27640 CPP_CLOSE_SQUARE))
27642 }
27643 /* Look for the closing `]'. */
27645 RT_CLOSE_SQUARE))
27648 }
27652 }
27658 }
27659 else
27662 get_comma:
27666 }
27672 {
27676 }
27679 {
27682 /* Try to resync to an unnested comma. Copied from
27683 cp_parser_parenthesized_expression_list. */
27684 skip_comma:
27693 }
27696 }
27698 /* Similarly, but expect leading and trailing parenthesis. This is a very
27699 common case for omp clauses. */
27701 static tree
27703 {
27707 }
27709 /* OpenMP 3.0:
27710 collapse ( constant-expression ) */
27712 static tree
27714 {
27716 location_t loc;
27717 HOST_WIDE_INT n;
27737 {
27740 }
27748 }
27750 /* OpenMP 2.5:
27751 default ( shared | none ) */
27753 static tree
27755 {
27757 tree c;
27762 {
27767 {
27782 }
27785 }
27786 else
27787 {
27788 invalid_kind:
27790 }
27806 }
27808 /* OpenMP 3.1:
27809 final ( expression ) */
27811 static tree
27813 {
27834 }
27836 /* OpenMP 2.5:
27837 if ( expression ) */
27839 static tree
27841 {
27862 }
27864 /* OpenMP 3.1:
27865 mergeable */
27867 static tree
27870 {
27871 tree c;
27874 location);
27879 }
27881 /* OpenMP 2.5:
27882 nowait */
27884 static tree
27887 {
27888 tree c;
27895 }
27897 /* OpenMP 2.5:
27898 num_threads ( expression ) */
27900 static tree
27902 location_t location)
27903 {
27925 }
27927 /* OpenMP 2.5:
27928 ordered */
27930 static tree
27933 {
27934 tree c;
27942 }
27944 /* OpenMP 2.5:
27945 reduction ( reduction-operator : variable-list )
27947 reduction-operator:
27948 One of: + * - & ^ | && ||
27950 OpenMP 3.1:
27952 reduction-operator:
27953 One of: + * - & ^ | && || min max
27955 OpenMP 4.0:
27957 reduction-operator:
27958 One of: + * - & ^ | && ||
27959 id-expression */
27961 static tree
27963 {
27971 {
27981 }
27985 else
27986 {
27997 {
28027 }
28028 else
28029 {
28031 resync_fail:
28036 }
28037 }
28043 NULL);
28045 {
28048 }
28051 }
28053 /* OpenMP 2.5:
28054 schedule ( schedule-kind )
28055 schedule ( schedule-kind , expression )
28057 schedule-kind:
28058 static | dynamic | guided | runtime | auto */
28060 static tree
28062 {
28071 {
28076 {
28097 }
28098 }
28103 else
28108 {
28123 else
28128 }
28136 invalid_kind:
28138 resync_fail:
28143 }
28145 /* OpenMP 3.0:
28146 untied */
28148 static tree
28151 {
28152 tree c;
28159 }
28161 /* OpenMP 4.0:
28162 inbranch
28163 notinbranch */
28165 static tree
28168 {
28173 }
28175 /* OpenMP 4.0:
28176 parallel
28177 for
28178 sections
28179 taskgroup */
28181 static tree
28185 {
28189 }
28191 /* OpenMP 4.0:
28192 num_teams ( expression ) */
28194 static tree
28196 location_t location)
28197 {
28219 }
28221 /* OpenMP 4.0:
28222 thread_limit ( expression ) */
28224 static tree
28226 location_t location)
28227 {
28249 }
28251 /* OpenMP 4.0:
28252 aligned ( variable-list )
28253 aligned ( variable-list : constant-expression ) */
28255 static tree
28257 {
28268 {
28278 }
28284 }
28286 /* OpenMP 4.0:
28287 linear ( variable-list )
28288 linear ( variable-list : expression ) */
28290 static tree
28293 {
28304 {
28308 {
28311 }
28319 }
28325 }
28327 /* OpenMP 4.0:
28328 safelen ( constant-expression ) */
28330 static tree
28332 location_t location)
28333 {
28354 }
28356 /* OpenMP 4.0:
28357 simdlen ( constant-expression ) */
28359 static tree
28361 location_t location)
28362 {
28383 }
28385 /* OpenMP 4.0:
28386 depend ( depend-kind : variable-list )
28388 depend-kind:
28389 in | out | inout */
28391 static tree
28393 {
28401 {
28411 else
28413 }
28414 else
28422 NULL);
28429 invalid_kind:
28431 resync_fail:
28436 }
28438 /* OpenMP 4.0:
28439 map ( map-kind : variable-list )
28440 map ( variable-list )
28442 map-kind:
28443 alloc | to | from | tofrom */
28445 static tree
28447 {
28456 {
28468 else
28469 {
28475 }
28478 }
28481 NULL);
28487 }
28489 /* OpenMP 4.0:
28490 device ( expression ) */
28492 static tree
28494 location_t location)
28495 {
28517 }
28519 /* OpenMP 4.0:
28520 dist_schedule ( static )
28521 dist_schedule ( static , expression ) */
28523 static tree
28525 location_t location)
28526 {
28539 {
28550 }
28555 location);
28559 invalid_kind:
28561 resync_fail:
28566 }
28568 /* OpenMP 4.0:
28569 proc_bind ( proc-bind-kind )
28571 proc-bind-kind:
28572 master | close | spread */
28574 static tree
28576 location_t location)
28577 {
28578 tree c;
28585 {
28595 else
28597 }
28598 else
28607 location);
28612 invalid_kind:
28614 resync_fail:
28619 }
28621 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28622 is a bitmask in MASK. Return the list of clauses found; the result
28623 of clause default goes in *pdefault. */
28625 static tree
28629 {
28636 {
28637 pragma_omp_clause c_kind;
28648 {
28660 clauses);
28674 clauses);
28683 clauses);
28707 clauses);
28721 clauses);
28738 OMP_CLAUSE_NOTINBRANCH,
28747 {
28748 clause_not_first:
28752 }
28777 clauses);
28782 clauses);
28787 clauses);
28850 }
28855 {
28856 /* Remove the invalid clause(s) from the list to avoid
28857 confusing the rest of the compiler. */
28860 }
28861 }
28862 saw_error:
28863 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
28864 no reason to skip to the end. */
28870 }
28872 /* OpenMP 2.5:
28873 structured-block:
28874 statement
28876 In practice, we're also interested in adding the statement to an
28877 outer node. So it is convenient if we work around the fact that
28878 cp_parser_statement calls add_stmt. */
28880 static unsigned
28882 {
28885 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28886 This preserves the "not within loop or switch" style error messages
28887 for nonsense cases like
28888 void foo() {
28889 #pragma omp single
28890 break;
28891 }
28892 */
28897 }
28899 static void
28901 {
28903 }
28905 static tree
28907 {
28915 }
28917 /* OpenMP 2.5:
28918 # pragma omp atomic new-line
28919 expression-stmt
28921 expression-stmt:
28922 x binop= expr | x++ | ++x | x-- | --x
28923 binop:
28924 +, *, -, /, &, ^, |, <<, >>
28926 where x is an lvalue expression with scalar type.
28928 OpenMP 3.1:
28929 # pragma omp atomic new-line
28930 update-stmt
28932 # pragma omp atomic read new-line
28933 read-stmt
28935 # pragma omp atomic write new-line
28936 write-stmt
28938 # pragma omp atomic update new-line
28939 update-stmt
28941 # pragma omp atomic capture new-line
28942 capture-stmt
28944 # pragma omp atomic capture new-line
28945 capture-block
28947 read-stmt:
28948 v = x
28949 write-stmt:
28950 x = expr
28951 update-stmt:
28952 expression-stmt | x = x binop expr
28953 capture-stmt:
28954 v = expression-stmt
28955 capture-block:
28956 { v = x; update-stmt; } | { update-stmt; v = x; }
28958 OpenMP 4.0:
28959 update-stmt:
28960 expression-stmt | x = x binop expr | x = expr binop x
28961 capture-stmt:
28962 v = update-stmt
28963 capture-block:
28964 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28966 where x and v are lvalue expressions with scalar type. */
28968 static void
28970 {
28978 {
28983 {
28989 }
28990 }
28992 {
29004 else
29008 }
29010 {
29016 {
29021 {
29024 }
29025 }
29026 }
29030 {
29040 else
29045 {
29046 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29047 opcode. */
29052 }
29056 {
29059 }
29060 else
29061 {
29067 }
29070 }
29072 restart:
29076 {
29083 /* FALLTHROUGH */
29093 /* FALLTHROUGH */
29108 /* Undo effects of boolean_increment for post {in,de}crement. */
29110 /* FALLTHRU */
29114 {
29115 /* Undo effects of boolean_increment. */
29117 {
29118 /* This is pre or post increment. */
29123 && !structured_block
29127 }
29128 }
29129 /* FALLTHRU */
29132 {
29167 {
29171 }
29174 {
29180 {
29185 }
29187 {
29198 {
29200 {
29205 }
29206 else
29208 }
29212 }
29215 {
29222 }
29226 }
29230 {
29233 {
29241 }
29243 {
29248 }
29283 }
29294 /* FALLTHROUGH */
29299 }
29306 }
29307 stmt_done:
29309 {
29320 }
29322 {
29325 }
29326 done:
29332 saw_error:
29335 {
29339 {
29343 }
29344 }
29345 }
29348 /* OpenMP 2.5:
29349 # pragma omp barrier new-line */
29351 static void
29353 {
29356 }
29358 /* OpenMP 2.5:
29359 # pragma omp critical [(name)] new-line
29360 structured-block */
29362 static tree
29364 {
29368 {
29380 }
29385 }
29387 /* OpenMP 2.5:
29388 # pragma omp flush flush-vars[opt] new-line
29390 flush-vars:
29391 ( variable-list ) */
29393 static void
29395 {
29401 }
29403 /* Helper function, to parse omp for increment expression. */
29405 static tree
29407 {
29412 {
29415 }
29418 {
29427 /* Fall through: OpenMP disallows NE_EXPR. */
29430 }
29432 /* If decl is an iterator, preserve LHS and RHS of the relational
29433 expr until finish_omp_for. */
29443 }
29445 /* Helper function, to parse omp for increment expression. */
29447 static tree
29449 {
29453 cp_id_kind idk;
29457 {
29465 }
29473 {
29478 }
29485 {
29489 }
29501 do
29502 {
29509 {
29511 {
29514 else
29516 tf_warning_or_error);
29517 }
29518 else
29521 }
29522 }
29526 {
29530 }
29531 else
29535 }
29537 /* Parse the initialization statement of either an OpenMP for loop or
29538 a Cilk Plus for loop.
29540 Return true if the resulting construct should have an
29541 OMP_CLAUSE_PRIVATE added to it. */
29543 static bool
29551 {
29557 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29559 init-expr:
29560 var = lb
29561 integer-type var = lb
29562 random-access-iterator-type var = lb
29563 pointer-type var = lb
29564 */
29565 cp_decl_specifier_seq type_specifiers;
29567 /* First, try to parse as an initialized declaration. See
29568 cp_parser_condition, from whence the bulk of this is copied. */
29575 {
29576 /* If parsing a type specifier seq succeeded, then this
29577 MUST be a initialized declaration. */
29582 CP_PARSER_DECLARATOR_NAMED,
29593 else
29594 {
29604 {
29606 CPP_OPEN_PAREN))
29607 {
29611 else
29614 }
29615 else
29616 /* Trigger an error. */
29621 }
29625 {
29633 {
29636 auto_node);
29641 }
29644 asm_specification,
29645 LOOKUP_ONLYCONVERTING);
29647 {
29650 }
29651 else
29654 }
29655 else
29656 {
29657 /* Consume '='. */
29661 non_class:
29664 else
29667 asm_specification,
29668 LOOKUP_ONLYCONVERTING);
29669 }
29673 }
29674 }
29675 else
29676 {
29677 cp_id_kind idk;
29678 /* If parsing a type specifier sequence failed, then
29679 this MUST be a simple expression. */
29687 && decl
29690 {
29691 tree rhs;
29698 rhs,
29699 tf_warning_or_error));
29701 }
29702 else
29703 {
29708 {
29712 }
29713 }
29714 }
29716 }
29718 /* Parse the restricted form of the for statement allowed by OpenMP. */
29720 static tree
29723 {
29727 location_t loc_first;
29746 {
29749 location_t loc;
29753 {
29756 }
29759 {
29762 }
29771 add_private_clause
29778 {
29781 {
29787 }
29788 else
29790 }
29797 {
29802 {
29806 }
29809 {
29810 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29811 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29816 {
29819 }
29820 else
29821 {
29824 }
29828 }
29829 else
29830 {
29835 }
29836 }
29839 {
29840 tree c;
29842 {
29851 decl);
29855 decl);
29856 }
29858 {
29863 {
29866 }
29867 }
29868 }
29877 {
29878 /* If decl is an iterator, preserve the operator on decl
29879 until finish_omp_for. */
29881 && ((processing_template_decl
29885 else
29889 }
29904 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29905 in between the collapsed for loops to be still considered perfectly
29906 nested. Hopefully the final version clarifies this.
29907 For now handle (multiple) {'s and empty statements. */
29909 do
29910 {
29914 {
29916 bracecount++;
29917 }
29921 else
29922 {
29929 }
29930 }
29934 {
29937 }
29938 }
29940 /* Note that we saved the original contents of this flag when we entered
29941 the structured block, and so we don't need to re-save it here. */
29944 else
29947 /* Note that the grammar doesn't call for a structured block here,
29948 though the loop as a whole is a structured block. */
29955 else
29960 {
29962 {
29964 nbraces--;
29965 }
29968 else
29969 {
29971 {
29974 }
29979 }
29980 }
29987 }
29989 /* Helper function for OpenMP parsing, split clauses and call
29990 finish_omp_clauses on each of the set of clauses afterwards. */
29992 static void
29995 {
30001 }
30003 /* OpenMP 4.0:
30004 #pragma omp simd simd-clause[optseq] new-line
30005 for-loop */
30007 #define OMP_SIMD_CLAUSE_MASK \
30008 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30009 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30010 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30011 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30012 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30013 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30014 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30016 static tree
30019 {
30031 {
30034 }
30045 }
30047 /* OpenMP 2.5:
30048 #pragma omp for for-clause[optseq] new-line
30049 for-loop
30051 OpenMP 4.0:
30052 #pragma omp for simd for-simd-clause[optseq] new-line
30053 for-loop */
30055 #define OMP_FOR_CLAUSE_MASK \
30056 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30057 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30058 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30065 static tree
30068 {
30079 {
30084 {
30092 cclauses);
30096 cclauses);
30108 }
30109 }
30111 {
30114 }
30119 {
30122 }
30133 }
30135 /* OpenMP 2.5:
30136 # pragma omp master new-line
30137 structured-block */
30139 static tree
30141 {
30145 }
30147 /* OpenMP 2.5:
30148 # pragma omp ordered new-line
30149 structured-block */
30151 static tree
30153 {
30157 }
30159 /* OpenMP 2.5:
30161 section-scope:
30162 { section-sequence }
30164 section-sequence:
30165 section-directive[opt] structured-block
30166 section-sequence section-directive structured-block */
30168 static tree
30170 {
30181 {
30185 }
30188 {
30196 {
30200 }
30202 {
30205 }
30210 }
30221 }
30223 /* OpenMP 2.5:
30224 # pragma omp sections sections-clause[optseq] newline
30225 sections-scope */
30227 #define OMP_SECTIONS_CLAUSE_MASK \
30228 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30229 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30231 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30232 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30234 static tree
30237 {
30249 {
30252 }
30259 }
30261 /* OpenMP 2.5:
30262 # pragma omp parallel parallel-clause[optseq] new-line
30263 structured-block
30264 # pragma omp parallel for parallel-for-clause[optseq] new-line
30265 structured-block
30266 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30267 structured-block
30269 OpenMP 4.0:
30270 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30271 structured-block */
30273 #define OMP_PARALLEL_CLAUSE_MASK \
30274 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30275 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30276 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30277 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30278 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30279 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30284 static tree
30287 {
30296 {
30309 block);
30314 }
30316 {
30320 }
30322 {
30325 }
30327 {
30331 {
30341 block);
30344 }
30345 }
30355 }
30357 /* OpenMP 2.5:
30358 # pragma omp single single-clause[optseq] new-line
30359 structured-block */
30361 #define OMP_SINGLE_CLAUSE_MASK \
30362 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30363 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30364 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30367 static tree
30369 {
30379 }
30381 /* OpenMP 3.0:
30382 # pragma omp task task-clause[optseq] new-line
30383 structured-block */
30385 #define OMP_TASK_CLAUSE_MASK \
30386 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30387 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30388 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30389 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30390 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30391 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30396 static tree
30398 {
30409 }
30411 /* OpenMP 3.0:
30412 # pragma omp taskwait new-line */
30414 static void
30416 {
30419 }
30421 /* OpenMP 3.1:
30422 # pragma omp taskyield new-line */
30424 static void
30426 {
30429 }
30431 /* OpenMP 4.0:
30432 # pragma omp taskgroup new-line
30433 structured-block */
30435 static tree
30437 {
30441 }
30444 /* OpenMP 2.5:
30445 # pragma omp threadprivate (variable-list) */
30447 static void
30449 {
30450 tree vars;
30456 }
30458 /* OpenMP 4.0:
30459 # pragma omp cancel cancel-clause[optseq] new-line */
30461 #define OMP_CANCEL_CLAUSE_MASK \
30462 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30468 static void
30470 {
30474 }
30476 /* OpenMP 4.0:
30477 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30479 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30480 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30485 static void
30487 {
30488 tree clauses;
30492 {
30497 {
30500 }
30501 }
30503 {
30507 }
30510 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30512 pragma_tok);
30514 }
30516 /* OpenMP 4.0:
30517 #pragma omp distribute distribute-clause[optseq] new-line
30518 for-loop */
30520 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30521 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30526 static tree
30529 {
30538 {
30546 else
30549 {
30555 {
30558 cclauses);
30559 else
30561 cclauses);
30562 }
30567 cclauses);
30568 else
30570 cclauses);
30582 }
30583 }
30585 {
30588 }
30593 {
30596 }
30607 }
30609 /* OpenMP 4.0:
30610 # pragma omp teams teams-clause[optseq] new-line
30611 structured-block */
30613 #define OMP_TEAMS_CLAUSE_MASK \
30614 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30615 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30616 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30617 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30618 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30619 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30620 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30622 static tree
30625 {
30634 {
30638 {
30646 cclauses);
30650 cclauses);
30661 }
30662 }
30664 {
30667 }
30672 {
30675 }
30683 }
30685 /* OpenMP 4.0:
30686 # pragma omp target data target-data-clause[optseq] new-line
30687 structured-block */
30689 #define OMP_TARGET_DATA_CLAUSE_MASK \
30690 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30691 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30694 static tree
30696 {
30708 }
30710 /* OpenMP 4.0:
30711 # pragma omp target update target-update-clause[optseq] new-line */
30713 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30714 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30715 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30716 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30717 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30719 static bool
30722 {
30724 {
30726 "%<#pragma omp target update%> may only be "
30730 }
30732 tree clauses
30737 {
30739 "%<#pragma omp target update must contain at least one "
30742 }
30750 }
30752 /* OpenMP 4.0:
30753 # pragma omp target target-clause[optseq] new-line
30754 structured-block */
30756 #define OMP_TARGET_CLAUSE_MASK \
30757 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30761 static bool
30764 {
30766 {
30770 }
30773 {
30778 {
30786 {
30788 OMP_TARGET_CLAUSE_MASK,
30789 cclauses);
30791 }
30807 }
30809 {
30812 }
30814 {
30818 }
30820 {
30823 }
30824 }
30838 }
30840 /* OpenMP 4.0:
30841 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30843 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30844 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30848 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30851 static void
30854 {
30856 cp_omp_declare_simd_data data;
30858 {
30863 }
30874 {
30878 {
30891 }
30896 "%<#pragma omp declare simd%> not immediately followed by "
30900 }
30901 }
30903 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
30904 This function is modelled similar to the late parsing of omp declare
30905 simd. */
30907 static tree
30909 {
30915 {
30921 }
30923 {
30927 }
30932 {
30939 NULL);
30953 }
30958 }
30960 /* Finalize #pragma omp declare simd clauses after direct declarator has
30961 been parsed, and put that into "omp declare simd" attribute. */
30963 static tree
30965 {
30971 {
30976 }
30981 {
30999 }
31003 }
31006 /* OpenMP 4.0:
31007 # pragma omp declare target new-line
31008 declarations and definitions
31009 # pragma omp end declare target new-line */
31011 static void
31013 {
31016 }
31018 static void
31020 {
31023 {
31026 }
31028 {
31032 {
31035 }
31038 else
31039 {
31043 }
31044 }
31045 else
31046 {
31050 }
31054 "%<#pragma omp end declare target%> without corresponding "
31056 else
31058 }
31060 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
31061 expression and optional initializer clause of
31062 #pragma omp declare reduction. We store the expression(s) as
31063 either 3, 6 or 7 special statements inside of the artificial function's
31064 body. The first two statements are DECL_EXPRs for the artificial
31065 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
31066 expression that uses those variables.
31067 If there was any INITIALIZER clause, this is followed by further statements,
31068 the fourth and fifth statements are DECL_EXPRs for the artificial
31069 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
31070 constructor variant (first token after open paren is not omp_priv),
31071 then the sixth statement is a statement with the function call expression
31072 that uses the OMP_PRIV and optionally OMP_ORIG variable.
31073 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
31074 to initialize the OMP_PRIV artificial variable and there is seventh
31075 statement, a DECL_EXPR of the OMP_PRIV statement again. */
31077 static bool
31079 {
31091 tree combiner;
31106 {
31109 }
31112 {
31119 {
31122 }
31138 {
31142 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
31146 == CPP_CLOSE_PAREN
31149 {
31153 }
31158 }
31159 else
31160 {
31176 {
31181 }
31183 tree arg;
31196 }
31207 }
31213 }
31215 /* OpenMP 4.0
31216 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31217 initializer-clause[opt] new-line
31219 initializer-clause:
31220 initializer (omp_priv initializer)
31221 initializer (function-name (argument-list)) */
31223 static void
31226 {
31236 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
31243 {
31275 }
31287 /* Types may not be defined in declare reduction type list. */
31290 parser->type_definition_forbidden_message
31296 saved_colon_doesnt_start_class_def_p
31301 {
31305 ;
31326 else
31331 else
31333 }
31335 /* Restore the saved message. */
31338 parser->colon_doesnt_start_class_def_p
31343 {
31344 fail:
31347 }
31353 {
31354 tree fntype
31357 NULL_TREE);
31376 {
31381 }
31383 {
31385 {
31394 }
31401 }
31402 else
31403 {
31406 }
31409 else
31412 {
31415 }
31417 {
31420 else
31425 }
31430 else
31431 {
31440 }
31447 }
31451 done:
31452 /* Free any declarators allocated. */
31454 }
31456 /* OpenMP 4.0
31457 #pragma omp declare simd declare-simd-clauses[optseq] new-line
31458 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31459 initializer-clause[opt] new-line
31460 #pragma omp declare target new-line */
31462 static void
31465 {
31467 {
31472 {
31475 context);
31477 }
31480 {
31483 context);
31485 }
31487 {
31490 }
31492 {
31496 }
31497 }
31501 }
31503 /* Main entry point to OpenMP statement pragmas. */
31505 static void
31507 {
31508 tree stmt;
31513 {
31561 }
31565 }
31566 \f
31567 /* Transactional Memory parsing routines. */
31569 /* Parse a transaction attribute.
31571 txn-attribute:
31572 attribute
31573 [ [ identifier ] ]
31575 ??? Simplify this when C++0x bracket attributes are
31576 implemented properly. */
31578 static tree
31580 {
31595 {
31599 /* For keywords, use the canonical spelling,
31600 not the parsed identifier. */
31604 }
31605 else
31609 error1:
31612 }
31614 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31616 transaction-statement:
31617 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31618 compound-statement
31619 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31620 */
31622 static tree
31624 {
31639 else
31640 {
31644 }
31646 /* Parse a noexcept specification. */
31649 /* Keep track if we're in the lexical scope of an outer transaction. */
31661 }
31663 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31665 transaction-expression:
31666 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31667 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31668 */
31670 static tree
31672 {
31697 /* Set this early. This might mean that we allow transaction_cancel in
31698 an expression that we find out later actually has to be a constexpr.
31699 However, we expect that cxx_constant_value will be able to deal with
31700 this; also, if the noexcept has no constexpr, then what we parse next
31701 really is a transaction's body. */
31704 /* Parse a noexcept specification. */
31710 {
31717 }
31718 else
31719 {
31720 /* The only expression that is available got parsed for the noexcept
31721 already. noexcept is true then. */
31724 }
31733 }
31735 /* Parse a function-transaction-block.
31737 function-transaction-block:
31738 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31739 function-body
31740 __transaction_atomic txn-attribute[opt] function-try-block
31741 __transaction_relaxed ctor-initializer[opt] function-body
31742 __transaction_relaxed function-try-block
31743 */
31745 static bool
31747 {
31763 else
31764 {
31768 }
31776 else
31777 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31785 }
31787 /* Parse a __transaction_cancel statement.
31789 cancel-statement:
31790 __transaction_cancel txn-attribute[opt] ;
31791 __transaction_cancel txn-attribute[opt] throw-expression ;
31793 ??? Cancel and throw is not yet implemented. */
31795 static tree
31797 {
31803 RT_TRANSACTION_CANCEL);
31810 /* ??? Parse cancel-and-throw here. */
31815 {
31819 }
31821 {
31825 }
31827 {
31830 {
31836 }
31837 }
31839 {
31843 }
31849 }
31850 \f
31851 /* The parser. */
31855 \f
31856 /* Special handling for the first token or line in the file. The first
31857 thing in the file might be #pragma GCC pch_preprocess, which loads a
31858 PCH file, which is a GC collection point. So we need to handle this
31859 first pragma without benefit of an existing lexer structure.
31861 Always returns one token to the caller in *FIRST_TOKEN. This is
31862 either the true first token of the file, or the first token after
31863 the initial pragma. */
31865 static void
31867 {
31876 {
31883 }
31884 else
31887 /* Skip to the end of the pragma. */
31891 /* Now actually load the PCH file. */
31895 /* Read one more token to return to our caller. We have to do this
31896 after reading the PCH file in, since its pointers have to be
31897 live. */
31899 }
31901 /* Parses the grainsize pragma for the _Cilk_for statement.
31902 Syntax:
31903 #pragma cilk grainsize = <VALUE>. */
31905 static void
31907 {
31909 {
31914 {
31917 }
31919 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
31922 else
31924 "%<#pragma cilk grainsize%> is not followed by "
31927 }
31929 }
31931 /* Normal parsing of a pragma token. Here we can (and must) use the
31932 regular lexer. */
31934 static bool
31936 {
31948 {
31956 {
31966 }
31971 {
31981 }
31986 {
31992 "%<#pragma omp taskwait%> may only be "
31997 }
32002 {
32008 "%<#pragma omp taskyield%> may only be "
32013 }
32018 {
32024 "%<#pragma omp cancel%> may only be "
32029 }
32034 {
32040 "%<#pragma omp cancellation point%> may only be "
32045 }
32083 "%<#pragma omp section%> may only be used in "
32088 {
32095 {
32098 }
32101 }
32105 {
32109 }
32115 {
32119 }
32121 /* Ignore the pragma if Cilk Plus is not enabled. */
32123 {
32126 }
32127 else
32128 {
32132 }
32139 bad_stmt:
32142 }
32146 }
32148 /* The interface the pragma parsers have to the lexer. */
32150 enum cpp_ttype
32152 {
32165 else
32166 {
32170 }
32173 }
32175 \f
32176 /* External interface. */
32178 /* Parse one entire translation unit. */
32180 void
32182 {
32194 }
32196 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
32197 vectorlength clause:
32198 Syntax:
32199 vectorlength ( constant-expression ) */
32201 static tree
32204 {
32206 tree expr;
32207 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
32208 safelen clause. Thus, vectorlength is represented as OMP 4.0
32209 safelen. For SIMD-enabled function it is represented by OMP 4.0
32210 simdlen. */
32213 loc);
32214 else
32216 loc);
32224 /* If expr == error_mark_node, then don't emit any errors nor
32225 create a clause. if any of the above functions returns
32226 error mark node then they would have emitted an error message. */
32228 ;
32236 else
32237 {
32238 tree c;
32240 {
32245 }
32246 else
32247 {
32252 }
32253 }
32258 }
32260 /* Handles the Cilk Plus #pragma simd linear clause.
32261 Syntax:
32262 linear ( simd-linear-variable-list )
32264 simd-linear-variable-list:
32265 simd-linear-variable
32266 simd-linear-variable-list , simd-linear-variable
32268 simd-linear-variable:
32269 id-expression
32270 id-expression : simd-linear-step
32272 simd-linear-step:
32273 conditional-expression */
32275 static tree
32277 {
32283 {
32287 }
32292 {
32295 {
32299 }
32306 {
32310 }
32311 else
32312 {
32316 /* If present, parse the linear step. Otherwise, assume the default
32317 value of 1. */
32319 {
32326 {
32327 /* If an error has occurred, then the whole pragma is
32328 considered ill-formed. Thus, no reason to keep
32329 parsing. */
32332 }
32340 else
32342 "step size must be an integer constant "
32344 }
32346 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
32352 }
32357 else
32358 {
32363 }
32364 }
32368 }
32370 /* Returns the name of the next clause. If the clause is not
32371 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
32372 token is not consumed. Otherwise, the appropriate enum from the
32373 pragma_simd_clause is returned and the token is consumed. */
32375 static pragma_omp_clause
32377 {
32378 pragma_omp_clause clause_type;
32395 else
32400 }
32402 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
32404 static tree
32406 {
32411 {
32412 pragma_omp_clause c_kind;
32419 /* Use the OpenMP 4.0 equivalent function. */
32422 /* Use the OpenMP 4.0 equivalent function. */
32424 clauses);
32426 /* Use the OMP 4.0 equivalent function. */
32428 clauses);
32430 /* Use the OMP 4.0 equivalent function. */
32432 else
32433 {
32437 }
32438 }
32444 else
32446 }
32448 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
32450 static void
32452 {
32459 {
32463 }
32472 }
32474 /* Main entry-point for parsing Cilk Plus _Cilk_for
32475 loops. The return value is error_mark_node
32476 when errors happen and CILK_FOR tree on success. */
32478 static tree
32480 {
32495 else
32501 }
32503 /* Create an identifier for a generic parameter type (a synthesized
32504 template parameter implied by `auto' or a concept identifier). */
32507 static tree
32509 {
32513 }
32515 /* Predicate that behaves as is_auto_or_concept but matches the parent
32516 node of the generic type rather than the generic type itself. This
32517 allows for type transformation in add_implicit_template_parms. */
32521 {
32523 }
32525 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
32526 (creating a new template parameter list if necessary). Returns the newly
32527 created template type parm. */
32529 tree
32531 {
32534 /* We are either continuing a function template that already contains implicit
32535 template parameters, creating a new fully-implicit function template, or
32536 extending an existing explicit function template with implicit template
32537 parameters. */
32545 {
32549 }
32550 else
32551 {
32552 /* Roll back to the existing template parameter scope (in the case of
32553 extending an explicit function template) or introduce a new template
32554 parameter scope ahead of the function parameter scope (or class scope
32555 in the case of out-of-line member definitions). The function scope is
32556 added back after template parameter synthesis below. */
32561 {
32564 }
32566 {
32567 /* If not defining a class, then any class scope is a scope level in
32568 an out-of-line member definition. In this case simply wind back
32569 beyond the first such scope to inject the template parameter list.
32570 Otherwise wind back to the class being defined. The latter can
32571 occur in class member friend declarations such as:
32573 class A {
32574 void foo (auto);
32575 };
32576 class B {
32577 friend void A::foo (auto);
32578 };
32580 The template parameter list synthesized for the friend declaration
32581 must be injected in the scope of 'B'. This can also occur in
32582 erroneous cases such as:
32584 struct A {
32585 struct B {
32586 void foo (auto);
32587 };
32588 void B::foo (auto) {}
32589 };
32591 Here the attempted definition of 'B::foo' within 'A' is ill-formed
32592 but, nevertheless, the template parameter list synthesized for the
32593 declarator should be injected into the scope of 'A' as if the
32594 ill-formed template was specified explicitly. */
32597 {
32600 }
32601 }
32607 {
32608 /* Introduce a new template parameter list for implicit template
32609 parameters. */
32613 parser->implicit_template_scope
32620 }
32621 else
32622 {
32623 /* Synthesize implicit template parameters at the end of the explicit
32624 template parameter list. */
32631 parser->implicit_template_parms
32633 }
32634 }
32636 /* Synthesize a new template parameter and track the current template
32637 parameter chain with implicit_template_parms. */
32641 synth_id);
32642 tree new_parm
32644 input_location,
32651 parser->implicit_template_parms
32653 else
32658 /* If creating a fully implicit function template, start the new implicit
32659 template parameter list with this synthesized type, otherwise grow the
32660 current template parameter list. */
32663 {
32670 }
32671 else
32672 {
32677 }
32682 }
32684 /* Finish the declaration of a fully implicit function template. Such a
32685 template has no explicit template parameter list so has not been through the
32686 normal template head and tail processing. synthesize_implicit_template_parm
32687 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32688 provided if the declaration is a class member such that its template
32689 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32690 form is returned. Otherwise NULL_TREE is returned. */
32692 tree
32694 {
32699 {
32703 }
32713 }