| blob | 4aa0f42e29cac50927999f39b705a0244abf8254 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2015 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
65 \f
68 // A helper function. Returns the object pointed to by P
69 // and sets P to NULL.
72 {
76 }
80 /* The lexer. */
82 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
83 and c-lex.c) and the C++ parser. */
86 {
88 };
90 /* The various kinds of non integral constant we encounter. */
92 NIC_NONE,
93 /* floating-point literal */
94 NIC_FLOAT,
95 /* %<this%> */
96 NIC_THIS,
97 /* %<__FUNCTION__%> */
98 NIC_FUNC_NAME,
99 /* %<__PRETTY_FUNCTION__%> */
100 NIC_PRETTY_FUNC,
101 /* %<__func__%> */
102 NIC_C99_FUNC,
103 /* "%<va_arg%> */
104 NIC_VA_ARG,
105 /* a cast */
106 NIC_CAST,
107 /* %<typeid%> operator */
108 NIC_TYPEID,
109 /* non-constant compound literals */
110 NIC_NCC,
111 /* a function call */
112 NIC_FUNC_CALL,
113 /* an increment */
114 NIC_INC,
115 /* an decrement */
116 NIC_DEC,
117 /* an array reference */
118 NIC_ARRAY_REF,
119 /* %<->%> */
120 NIC_ARROW,
121 /* %<.%> */
122 NIC_POINT,
123 /* the address of a label */
124 NIC_ADDR_LABEL,
125 /* %<*%> */
126 NIC_STAR,
127 /* %<&%> */
128 NIC_ADDR,
129 /* %<++%> */
130 NIC_PREINCREMENT,
131 /* %<--%> */
132 NIC_PREDECREMENT,
133 /* %<new%> */
134 NIC_NEW,
135 /* %<delete%> */
136 NIC_DEL,
137 /* calls to overloaded operators */
138 NIC_OVERLOADED,
139 /* an assignment */
140 NIC_ASSIGNMENT,
141 /* a comma operator */
142 NIC_COMMA,
143 /* a call to a constructor */
144 NIC_CONSTRUCTOR,
145 /* a transaction expression */
146 NIC_TRANSACTION
149 /* The various kinds of errors about name-lookup failing. */
151 /* NULL */
152 NLE_NULL,
153 /* is not a type */
154 NLE_TYPE,
155 /* is not a class or namespace */
156 NLE_CXX98,
157 /* is not a class, namespace, or enumeration */
158 NLE_NOT_CXX98
161 /* The various kinds of required token */
163 RT_NONE,
185 /* The type is CPP_KEYWORD */
214 RT_TRANSACTION_CANCEL /* __transaction_cancel */
217 /* Prototypes. */
223 static void cp_lexer_destroy
225 static int cp_lexer_saving_tokens
229 static void cp_lexer_get_preprocessor_token
237 static bool cp_lexer_next_token_is_not
239 static bool cp_lexer_next_token_is_keyword
243 static void cp_lexer_purge_token
245 static void cp_lexer_purge_tokens_after
247 static void cp_lexer_save_tokens
249 static void cp_lexer_commit_tokens
251 static void cp_lexer_rollback_tokens
253 static void cp_lexer_print_token
257 static void cp_lexer_start_debugging
259 static void cp_lexer_stop_debugging
265 static void cp_parser_initial_pragma
268 static tree cp_literal_operator_id
271 static void cp_parser_cilk_simd
273 static tree cp_parser_cilk_for
275 static bool cp_parser_omp_declare_reduction_exprs
277 static tree cp_parser_cilk_simd_vectorlength
280 /* Manifest constants. */
281 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
282 #define CP_SAVED_TOKEN_STACK 5
284 /* Variables. */
286 /* The stream to which debugging output should be written. */
289 /* Nonzero if we are parsing an unevaluated operand: an operand to
290 sizeof, typeof, or alignof. */
293 /* Dump up to NUM tokens in BUFFER to FILE starting with token
294 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
295 first token in BUFFER. If NUM is 0, dump all the tokens. If
296 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
297 highlighted by surrounding it in [[ ]]. */
299 static void
303 {
320 {
323 }
328 {
335 nprinted++;
345 {
355 }
356 }
359 {
362 }
365 }
368 /* Dump all tokens in BUFFER to stderr. */
370 void
372 {
374 }
376 DEBUG_FUNCTION void
378 {
380 }
382 DEBUG_FUNCTION void
384 {
387 else
389 }
392 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
393 description for T. */
395 static void
397 {
399 {
402 }
403 }
406 /* Dump parser context C to FILE. */
408 static void
410 {
415 }
418 /* Print the stack of parsing contexts to FILE starting with FIRST. */
420 static void
422 {
428 {
431 }
432 }
435 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
437 static void
439 {
442 }
445 /* Print an unparsed function entry UF to FILE. */
447 static void
449 {
452 tree fn;
457 i++)
458 {
464 }
469 {
472 }
478 {
481 }
483 }
486 /* Print the stack of unparsed member functions S to FILE. */
488 static void
491 {
497 {
500 }
501 }
504 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
505 the given PARSER. If FILE is NULL, the output is printed on stderr. */
507 static void
509 {
521 next_token);
522 }
525 /* Dump debugging information for the given PARSER. If FILE is NULL,
526 the output is printed on stderr. */
528 void
530 {
533 expanded_location eloc;
611 }
613 DEBUG_FUNCTION void
615 {
617 }
619 DEBUG_FUNCTION void
621 {
624 else
626 }
628 /* Allocate memory for a new lexer object and return it. */
632 {
637 /* Allocate the memory. */
640 /* Initially we are not debugging. */
645 /* Create the buffer. */
649 }
652 /* Create a new main C++ lexer, the lexer that gets tokens from the
653 preprocessor. */
657 {
659 cp_token token;
661 /* It's possible that parsing the first pragma will load a PCH file,
662 which is a GC collection point. So we have to do that before
663 allocating any memory. */
668 /* Put the first token in the buffer. */
671 /* Get the remaining tokens from the preprocessor. */
673 {
676 }
685 /* Subsequent preprocessor diagnostics should use compiler
686 diagnostic functions to get the compiler source location. */
691 }
693 /* Create a new lexer whose token stream is primed with the tokens in
694 CACHE. When these tokens are exhausted, no new tokens will be read. */
698 {
703 /* We do not own the buffer. */
710 /* Initially we are not debugging. */
715 }
717 /* Frees all resources associated with LEXER. */
719 static void
721 {
725 }
727 /* Returns nonzero if debugging information should be output. */
731 {
733 }
738 {
742 }
746 {
748 }
752 {
754 }
758 {
761 else
763 }
767 {
771 }
773 /* nonzero if we are presently saving tokens. */
777 {
779 }
781 /* Store the next token from the preprocessor in *TOKEN. Return true
782 if we reach EOF. If LEXER is NULL, assume we are handling an
783 initial #pragma pch_preprocess, and thus want the lexer to return
784 processed strings. */
786 static void
788 {
791 /* Get a new token from the preprocessor. */
792 token->type
800 /* On some systems, some header files are surrounded by an
801 implicit extern "C" block. Set a flag in the token if it
802 comes from such a header. */
807 /* Check to see if this token is a keyword. */
809 {
811 {
812 /* Mark this token as a keyword. */
814 /* Record which keyword. */
816 }
817 else
818 {
822 {
823 /* Warn about the C++0x keyword (but still treat it as
824 an identifier). */
829 /* Clear out the C_RID_CODE so we don't warn about this
830 particular identifier-turned-keyword again. */
832 }
835 }
836 }
838 {
839 /* This only happens in Objective-C++; it must be a keyword. */
842 {
843 /* Replace 'class' with '@class', 'private' with '@private',
844 etc. This prevents confusion with the C++ keyword
845 'class', and makes the tokens consistent with other
846 Objective-C 'AT' keywords. For example '@class' is
847 reported as RID_AT_CLASS which is consistent with
848 '@synchronized', which is reported as
849 RID_AT_SYNCHRONIZED.
850 */
859 }
860 }
862 {
863 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
867 }
868 }
870 /* Update the globals input_location and the input file stack from TOKEN. */
873 {
875 {
877 }
878 }
880 /* Update the globals input_location and the input file stack from LEXER. */
883 {
886 }
888 /* Return a pointer to the next token in the token stream, but do not
889 consume it. */
893 {
895 {
899 }
901 }
903 /* Return true if the next token has the indicated TYPE. */
907 {
909 }
911 /* Return true if the next token does not have the indicated TYPE. */
915 {
917 }
919 /* Return true if the next token is the indicated KEYWORD. */
923 {
925 }
929 {
931 }
935 {
937 }
939 /* Return true if the next token is not the indicated KEYWORD. */
943 {
945 }
947 /* Return true if the next token is a keyword for a decl-specifier. */
949 static bool
951 {
956 {
957 /* auto specifier: storage-class-specifier in C++,
958 simple-type-specifier in C++0x. */
960 /* Storage classes. */
966 /* Elaborated type specifiers. */
972 /* Simple type specifiers. */
986 /* GNU extensions. */
989 /* C++0x extensions. */
1000 }
1001 }
1003 /* Returns TRUE iff the token T begins a decltype type. */
1005 static bool
1007 {
1010 }
1012 /* Returns TRUE iff the next token begins a decltype type. */
1014 static bool
1016 {
1019 }
1021 /* Return a pointer to the Nth token in the token stream. If N is 1,
1022 then this is precisely equivalent to cp_lexer_peek_token (except
1023 that it is not inline). One would like to disallow that case, but
1024 there is one case (cp_parser_nth_token_starts_template_id) where
1025 the caller passes a variable for N and it might be 1. */
1029 {
1032 /* N is 1-based, not zero-based. */
1043 {
1046 {
1049 }
1053 }
1056 {
1059 }
1062 }
1064 /* Return the next token, and advance the lexer's next_token pointer
1065 to point to the next non-purged token. */
1069 {
1075 do
1076 {
1079 {
1082 }
1084 }
1089 /* Provide debugging output. */
1091 {
1095 }
1098 }
1100 /* Permanently remove the next token from the token stream, and
1101 advance the next_token pointer to refer to the next non-purged
1102 token. */
1104 static void
1106 {
1115 do
1116 {
1117 tok++;
1119 {
1122 }
1123 }
1126 }
1128 /* Permanently remove all tokens after TOK, up to, but not
1129 including, the token that will be returned next by
1130 cp_lexer_peek_token. */
1132 static void
1134 {
1143 {
1148 }
1149 }
1151 /* Begin saving tokens. All tokens consumed after this point will be
1152 preserved. */
1154 static void
1156 {
1157 /* Provide debugging output. */
1162 }
1164 /* Commit to the portion of the token stream most recently saved. */
1166 static void
1168 {
1169 /* Provide debugging output. */
1174 }
1176 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1177 to the token stream. Stop saving tokens. */
1179 static void
1181 {
1182 /* Provide debugging output. */
1187 }
1189 /* RAII wrapper around the above functions, with sanity checking. Creating
1190 a variable saves tokens, which are committed when the variable is
1191 destroyed unless they are explicitly rolled back by calling the rollback
1192 member function. */
1194 struct saved_token_sentinel
1195 {
1200 {
1203 }
1205 {
1208 }
1210 {
1214 }
1215 };
1217 /* Print a representation of the TOKEN on the STREAM. */
1219 static void
1221 {
1222 /* We don't use cpp_type2name here because the parser defines
1223 a few tokens of its own. */
1225 /* cpplib-defined token types */
1226 #define OP(e, s) #e,
1227 #define TK(e, s) #e,
1228 TTYPE_TABLE
1229 #undef OP
1230 #undef TK
1231 /* C++ parser token types - see "Manifest constants", above. */
1235 };
1237 /* For some tokens, print the associated data. */
1239 {
1241 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1242 For example, `struct' is mapped to an INTEGER_CST. */
1245 /* else fall through */
1263 /* If we have a name for the token, print it out. Otherwise, we
1264 simply give the numeric code. */
1267 else
1270 }
1271 }
1273 DEBUG_FUNCTION void
1275 {
1278 }
1280 DEBUG_FUNCTION void
1282 {
1285 else
1287 }
1290 /* Start emitting debugging information. */
1292 static void
1294 {
1297 }
1299 /* Stop emitting debugging information. */
1301 static void
1303 {
1306 }
1308 /* Create a new cp_token_cache, representing a range of tokens. */
1312 {
1317 }
1319 /* Diagnose if #pragma omp declare simd isn't followed immediately
1320 by function declaration or definition. */
1324 {
1326 {
1330 }
1331 }
1333 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1334 and put that into "omp declare simd" attribute. */
1338 {
1340 {
1342 {
1345 }
1347 {
1350 }
1351 }
1352 }
1353 \f
1354 /* Decl-specifiers. */
1356 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1358 static void
1360 {
1362 }
1364 /* Declarators. */
1366 /* Nothing other than the parser should be creating declarators;
1367 declarators are a semi-syntactic representation of C++ entities.
1368 Other parts of the front end that need to create entities (like
1369 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1384 /* An erroneous declarator. */
1387 /* The obstack on which declarators and related data structures are
1388 allocated. */
1391 /* Alloc BYTES from the declarator memory pool. */
1395 {
1397 }
1399 /* Allocate a declarator of the indicated KIND. Clear fields that are
1400 common to all declarators. */
1404 {
1416 }
1418 /* Make a declarator for a generalized identifier. If
1419 QUALIFYING_SCOPE is non-NULL, the identifier is
1420 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1421 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1422 is, if any. */
1426 special_function_kind sfk)
1427 {
1430 /* It is valid to write:
1432 class C { void f(); };
1433 typedef C D;
1434 void D::f();
1436 The standard is not clear about whether `typedef const C D' is
1437 legal; as of 2002-09-15 the committee is considering that
1438 question. EDG 3.0 allows that syntax. Therefore, we do as
1439 well. */
1453 }
1455 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1456 of modifiers such as const or volatile to apply to the pointer
1457 type, represented as identifiers. ATTRIBUTES represent the attributes that
1458 appertain to the pointer or reference. */
1460 cp_declarator *
1462 tree attributes)
1463 {
1471 {
1475 }
1476 else
1482 }
1484 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1485 represent the attributes that appertain to the pointer or
1486 reference. */
1488 cp_declarator *
1491 {
1499 {
1503 }
1504 else
1510 }
1512 /* Like make_pointer_declarator -- but for a pointer to a non-static
1513 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1514 appertain to the pointer or reference. */
1516 cp_declarator *
1519 tree attributes)
1520 {
1529 {
1532 }
1533 else
1539 }
1541 /* Make a declarator for the function given by TARGET, with the
1542 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1543 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1544 indicates what exceptions can be thrown. */
1546 cp_declarator *
1548 tree parms,
1549 cp_cv_quals cv_qualifiers,
1550 cp_virt_specifiers virt_specifiers,
1551 cp_ref_qualifier ref_qualifier,
1552 tree exception_specification,
1553 tree late_return_type,
1554 tree requires_clause)
1555 {
1568 {
1572 }
1573 else
1577 }
1579 /* Make a declarator for an array of BOUNDS elements, each of which is
1580 defined by ELEMENT. */
1582 cp_declarator *
1584 {
1591 {
1595 }
1596 else
1600 }
1602 /* Determine whether the declarator we've seen so far can be a
1603 parameter pack, when followed by an ellipsis. */
1604 static bool
1606 {
1607 /* Search for a declarator name, or any other declarator that goes
1608 after the point where the ellipsis could appear in a parameter
1609 pack. If we find any of these, then this declarator can not be
1610 made into a parameter pack. */
1613 {
1615 {
1627 }
1628 }
1631 }
1635 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1636 DECLARATOR and DEFAULT_ARGUMENT. */
1638 cp_parameter_declarator *
1641 tree default_argument)
1642 {
1650 else
1657 }
1659 /* Returns true iff DECLARATOR is a declaration for a function. */
1661 static bool
1663 {
1665 }
1667 /* The parser. */
1669 /* Overview
1670 --------
1672 A cp_parser parses the token stream as specified by the C++
1673 grammar. Its job is purely parsing, not semantic analysis. For
1674 example, the parser breaks the token stream into declarators,
1675 expressions, statements, and other similar syntactic constructs.
1676 It does not check that the types of the expressions on either side
1677 of an assignment-statement are compatible, or that a function is
1678 not declared with a parameter of type `void'.
1680 The parser invokes routines elsewhere in the compiler to perform
1681 semantic analysis and to build up the abstract syntax tree for the
1682 code processed.
1684 The parser (and the template instantiation code, which is, in a
1685 way, a close relative of parsing) are the only parts of the
1686 compiler that should be calling push_scope and pop_scope, or
1687 related functions. The parser (and template instantiation code)
1688 keeps track of what scope is presently active; everything else
1689 should simply honor that. (The code that generates static
1690 initializers may also need to set the scope, in order to check
1691 access control correctly when emitting the initializers.)
1693 Methodology
1694 -----------
1696 The parser is of the standard recursive-descent variety. Upcoming
1697 tokens in the token stream are examined in order to determine which
1698 production to use when parsing a non-terminal. Some C++ constructs
1699 require arbitrary look ahead to disambiguate. For example, it is
1700 impossible, in the general case, to tell whether a statement is an
1701 expression or declaration without scanning the entire statement.
1702 Therefore, the parser is capable of "parsing tentatively." When the
1703 parser is not sure what construct comes next, it enters this mode.
1704 Then, while we attempt to parse the construct, the parser queues up
1705 error messages, rather than issuing them immediately, and saves the
1706 tokens it consumes. If the construct is parsed successfully, the
1707 parser "commits", i.e., it issues any queued error messages and
1708 the tokens that were being preserved are permanently discarded.
1709 If, however, the construct is not parsed successfully, the parser
1710 rolls back its state completely so that it can resume parsing using
1711 a different alternative.
1713 Future Improvements
1714 -------------------
1716 The performance of the parser could probably be improved substantially.
1717 We could often eliminate the need to parse tentatively by looking ahead
1718 a little bit. In some places, this approach might not entirely eliminate
1719 the need to parse tentatively, but it might still speed up the average
1720 case. */
1722 /* Flags that are passed to some parsing functions. These values can
1723 be bitwise-ored together. */
1725 enum
1726 {
1727 /* No flags. */
1729 /* The construct is optional. If it is not present, then no error
1730 should be issued. */
1732 /* When parsing a type-specifier, treat user-defined type-names
1733 as non-type identifiers. */
1735 /* When parsing a type-specifier, do not try to parse a class-specifier
1736 or enum-specifier. */
1738 /* When parsing a decl-specifier-seq, only allow type-specifier or
1739 constexpr. */
1741 };
1743 /* This type is used for parameters and variables which hold
1744 combinations of the above flags. */
1747 /* The different kinds of declarators we want to parse. */
1750 {
1751 /* We want an abstract declarator. */
1752 CP_PARSER_DECLARATOR_ABSTRACT,
1753 /* We want a named declarator. */
1754 CP_PARSER_DECLARATOR_NAMED,
1755 /* We don't mind, but the name must be an unqualified-id. */
1756 CP_PARSER_DECLARATOR_EITHER
1759 /* The precedence values used to parse binary expressions. The minimum value
1760 of PREC must be 1, because zero is reserved to quickly discriminate
1761 binary operators from other tokens. */
1763 enum cp_parser_prec
1764 {
1765 PREC_NOT_OPERATOR,
1766 PREC_LOGICAL_OR_EXPRESSION,
1767 PREC_LOGICAL_AND_EXPRESSION,
1768 PREC_INCLUSIVE_OR_EXPRESSION,
1769 PREC_EXCLUSIVE_OR_EXPRESSION,
1770 PREC_AND_EXPRESSION,
1771 PREC_EQUALITY_EXPRESSION,
1772 PREC_RELATIONAL_EXPRESSION,
1773 PREC_SHIFT_EXPRESSION,
1774 PREC_ADDITIVE_EXPRESSION,
1775 PREC_MULTIPLICATIVE_EXPRESSION,
1776 PREC_PM_EXPRESSION,
1777 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1778 };
1780 /* A mapping from a token type to a corresponding tree node type, with a
1781 precedence value. */
1784 {
1785 /* The token type. */
1787 /* The corresponding tree code. */
1789 /* The precedence of this operator. */
1794 {
1795 /* Left hand side of the binary operation we are currently
1796 parsing. */
1797 tree lhs;
1798 /* Original tree code for left hand side, if it was a binary
1799 expression itself (used for -Wparentheses). */
1801 /* Tree code for the binary operation we are parsing. */
1803 /* Precedence of the binary operation we are parsing. */
1805 /* Location of the binary operation we are parsing. */
1806 location_t loc;
1809 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1810 entries because precedence levels on the stack are monotonically
1811 increasing. */
1815 /* Prototypes. */
1817 /* Constructors and destructors. */
1822 /* Class variables. */
1826 /* The operator-precedence table used by cp_parser_binary_expression.
1827 Transformed into an associative array (binops_by_token) by
1828 cp_parser_new. */
1861 };
1863 /* The same as binops, but initialized by cp_parser_new so that
1864 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1865 for speed. */
1868 /* Constructors and destructors. */
1870 /* Construct a new context. The context below this one on the stack
1871 is given by NEXT. */
1875 {
1878 /* Allocate the storage. */
1880 {
1881 /* Pull the first entry from the free list. */
1885 }
1886 else
1889 /* No errors have occurred yet in this context. */
1891 /* If this is not the bottommost context, copy information that we
1892 need from the previous context. */
1894 {
1895 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1896 expression, then we are parsing one in this context, too. */
1898 /* Thread the stack. */
1900 }
1903 }
1905 /* Managing the unparsed function queues. */
1907 #define unparsed_funs_with_default_args \
1908 parser->unparsed_queues->last ().funs_with_default_args
1909 #define unparsed_funs_with_definitions \
1910 parser->unparsed_queues->last ().funs_with_definitions
1911 #define unparsed_nsdmis \
1912 parser->unparsed_queues->last ().nsdmis
1913 #define unparsed_classes \
1914 parser->unparsed_queues->last ().classes
1916 static void
1918 {
1921 }
1923 static void
1925 {
1928 }
1930 /* Prototypes. */
1932 /* Constructors and destructors. */
1937 /* Routines to parse various constructs.
1939 Those that return `tree' will return the error_mark_node (rather
1940 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1941 Sometimes, they will return an ordinary node if error-recovery was
1942 attempted, even though a parse error occurred. So, to check
1943 whether or not a parse error occurred, you should always use
1944 cp_parser_error_occurred. If the construct is optional (indicated
1945 either by an `_opt' in the name of the function that does the
1946 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1947 the construct is not present. */
1949 /* Lexical conventions [gram.lex] */
1951 static tree cp_parser_identifier
1953 static tree cp_parser_string_literal
1955 static tree cp_parser_userdef_char_literal
1957 static tree cp_parser_userdef_string_literal
1959 static tree cp_parser_userdef_numeric_literal
1962 /* Basic concepts [gram.basic] */
1964 static bool cp_parser_translation_unit
1967 /* Expressions [gram.expr] */
1969 static tree cp_parser_primary_expression
1971 static tree cp_parser_id_expression
1973 static tree cp_parser_unqualified_id
1975 static tree cp_parser_nested_name_specifier_opt
1977 static tree cp_parser_nested_name_specifier
1979 static tree cp_parser_qualifying_entity
1981 static tree cp_parser_postfix_expression
1983 static tree cp_parser_postfix_open_square_expression
1985 static tree cp_parser_postfix_dot_deref_expression
1989 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1991 static void cp_parser_pseudo_destructor_name
1993 static tree cp_parser_unary_expression
1995 static enum tree_code cp_parser_unary_operator
1997 static tree cp_parser_new_expression
2001 static tree cp_parser_new_type_id
2009 static tree cp_parser_delete_expression
2011 static tree cp_parser_cast_expression
2013 static tree cp_parser_binary_expression
2015 static tree cp_parser_question_colon_clause
2017 static tree cp_parser_assignment_expression
2019 static enum tree_code cp_parser_assignment_operator_opt
2021 static tree cp_parser_expression
2023 static tree cp_parser_constant_expression
2025 static tree cp_parser_builtin_offsetof
2027 static tree cp_parser_lambda_expression
2029 static void cp_parser_lambda_introducer
2031 static bool cp_parser_lambda_declarator_opt
2033 static void cp_parser_lambda_body
2036 /* Statements [gram.stmt.stmt] */
2038 static void cp_parser_statement
2040 static void cp_parser_label_for_labeled_statement
2042 static tree cp_parser_expression_statement
2044 static tree cp_parser_compound_statement
2046 static void cp_parser_statement_seq_opt
2048 static tree cp_parser_selection_statement
2050 static tree cp_parser_condition
2052 static tree cp_parser_iteration_statement
2054 static bool cp_parser_for_init_statement
2056 static tree cp_parser_for
2058 static tree cp_parser_c_for
2060 static tree cp_parser_range_for
2062 static void do_range_for_auto_deduction
2064 static tree cp_parser_perform_range_for_lookup
2066 static tree cp_parser_range_for_member_function
2068 static tree cp_parser_jump_statement
2070 static void cp_parser_declaration_statement
2073 static tree cp_parser_implicitly_scoped_statement
2075 static void cp_parser_already_scoped_statement
2078 /* Declarations [gram.dcl.dcl] */
2080 static void cp_parser_declaration_seq_opt
2082 static void cp_parser_declaration
2084 static void cp_parser_block_declaration
2086 static void cp_parser_simple_declaration
2088 static void cp_parser_decl_specifier_seq
2090 static tree cp_parser_storage_class_specifier_opt
2092 static tree cp_parser_function_specifier_opt
2094 static tree cp_parser_type_specifier
2097 static tree cp_parser_simple_type_specifier
2099 static tree cp_parser_type_name
2101 static tree cp_parser_type_name
2103 static tree cp_parser_nonclass_name
2105 static tree cp_parser_elaborated_type_specifier
2107 static tree cp_parser_enum_specifier
2109 static void cp_parser_enumerator_list
2111 static void cp_parser_enumerator_definition
2113 static tree cp_parser_namespace_name
2115 static void cp_parser_namespace_definition
2117 static void cp_parser_namespace_body
2119 static tree cp_parser_qualified_namespace_specifier
2121 static void cp_parser_namespace_alias_definition
2123 static bool cp_parser_using_declaration
2125 static void cp_parser_using_directive
2127 static tree cp_parser_alias_declaration
2129 static void cp_parser_asm_definition
2131 static void cp_parser_linkage_specification
2133 static void cp_parser_static_assert
2135 static tree cp_parser_decltype
2138 /* Declarators [gram.dcl.decl] */
2140 static tree cp_parser_init_declarator
2147 static enum tree_code cp_parser_ptr_operator
2149 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2151 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2153 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2155 static tree cp_parser_late_return_type_opt
2157 static tree cp_parser_declarator_id
2159 static tree cp_parser_type_id
2161 static tree cp_parser_template_type_arg
2164 static tree cp_parser_type_id_1
2166 static void cp_parser_type_specifier_seq
2168 static tree cp_parser_parameter_declaration_clause
2170 static tree cp_parser_parameter_declaration_list
2174 static tree cp_parser_default_argument
2176 static void cp_parser_function_body
2178 static tree cp_parser_initializer
2180 static tree cp_parser_initializer_clause
2182 static tree cp_parser_braced_list
2187 static bool cp_parser_ctor_initializer_opt_and_function_body
2190 static tree cp_parser_late_parsing_omp_declare_simd
2193 static tree cp_parser_late_parsing_cilk_simd_fn_info
2196 static tree synthesize_implicit_template_parm
2198 static tree finish_fully_implicit_template
2201 /* Classes [gram.class] */
2203 static tree cp_parser_class_name
2205 static tree cp_parser_class_specifier
2207 static tree cp_parser_class_head
2209 static enum tag_types cp_parser_class_key
2211 static void cp_parser_type_parameter_key
2213 static void cp_parser_member_specification_opt
2215 static void cp_parser_member_declaration
2217 static tree cp_parser_pure_specifier
2219 static tree cp_parser_constant_initializer
2222 /* Derived classes [gram.class.derived] */
2224 static tree cp_parser_base_clause
2226 static tree cp_parser_base_specifier
2229 /* Special member functions [gram.special] */
2231 static tree cp_parser_conversion_function_id
2233 static tree cp_parser_conversion_type_id
2237 static bool cp_parser_ctor_initializer_opt
2239 static void cp_parser_mem_initializer_list
2241 static tree cp_parser_mem_initializer
2243 static tree cp_parser_mem_initializer_id
2246 /* Overloading [gram.over] */
2248 static tree cp_parser_operator_function_id
2250 static tree cp_parser_operator
2253 /* Templates [gram.temp] */
2255 static void cp_parser_template_declaration
2257 static tree cp_parser_template_parameter_list
2259 static tree cp_parser_template_parameter
2261 static tree cp_parser_type_parameter
2263 static tree cp_parser_template_id
2265 static tree cp_parser_template_name
2267 static tree cp_parser_template_argument_list
2269 static tree cp_parser_template_argument
2271 static void cp_parser_explicit_instantiation
2273 static void cp_parser_explicit_specialization
2276 /* Exception handling [gram.exception] */
2278 static tree cp_parser_try_block
2280 static bool cp_parser_function_try_block
2282 static void cp_parser_handler_seq
2284 static void cp_parser_handler
2286 static tree cp_parser_exception_declaration
2288 static tree cp_parser_throw_expression
2290 static tree cp_parser_exception_specification_opt
2292 static tree cp_parser_type_id_list
2295 /* GNU Extensions */
2297 static tree cp_parser_asm_specification_opt
2299 static tree cp_parser_asm_operand_list
2301 static tree cp_parser_asm_clobber_list
2303 static tree cp_parser_asm_label_list
2305 static bool cp_next_tokens_can_be_attribute_p
2307 static bool cp_next_tokens_can_be_gnu_attribute_p
2309 static bool cp_next_tokens_can_be_std_attribute_p
2311 static bool cp_nth_tokens_can_be_std_attribute_p
2313 static bool cp_nth_tokens_can_be_gnu_attribute_p
2315 static bool cp_nth_tokens_can_be_attribute_p
2317 static tree cp_parser_attributes_opt
2319 static tree cp_parser_gnu_attributes_opt
2321 static tree cp_parser_gnu_attribute_list
2323 static tree cp_parser_std_attribute
2325 static tree cp_parser_std_attribute_spec
2327 static tree cp_parser_std_attribute_spec_seq
2329 static bool cp_parser_extension_opt
2331 static void cp_parser_label_declaration
2334 /* Concept Extensions */
2336 static tree cp_parser_requires_clause
2338 static tree cp_parser_requires_clause_opt
2340 static tree cp_parser_requires_expression
2342 static tree cp_parser_requirement_parameter_list
2344 static tree cp_parser_requirement_body
2346 static tree cp_parser_requirement_list
2348 static tree cp_parser_requirement
2350 static tree cp_parser_simple_requirement
2352 static tree cp_parser_compound_requirement
2354 static tree cp_parser_type_requirement
2356 static tree cp_parser_nested_requirement
2359 /* Transactional Memory Extensions */
2361 static tree cp_parser_transaction
2363 static tree cp_parser_transaction_expression
2365 static bool cp_parser_function_transaction
2367 static tree cp_parser_transaction_cancel
2371 pragma_external,
2372 pragma_member,
2373 pragma_objc_icode,
2374 pragma_stmt,
2375 pragma_compound
2376 };
2377 static bool cp_parser_pragma
2380 /* Objective-C++ Productions */
2382 static tree cp_parser_objc_message_receiver
2384 static tree cp_parser_objc_message_args
2386 static tree cp_parser_objc_message_expression
2388 static tree cp_parser_objc_encode_expression
2390 static tree cp_parser_objc_defs_expression
2392 static tree cp_parser_objc_protocol_expression
2394 static tree cp_parser_objc_selector_expression
2396 static tree cp_parser_objc_expression
2398 static bool cp_parser_objc_selector_p
2400 static tree cp_parser_objc_selector
2402 static tree cp_parser_objc_protocol_refs_opt
2404 static void cp_parser_objc_declaration
2406 static tree cp_parser_objc_statement
2408 static bool cp_parser_objc_valid_prefix_attributes
2410 static void cp_parser_objc_at_property_declaration
2412 static void cp_parser_objc_at_synthesize_declaration
2414 static void cp_parser_objc_at_dynamic_declaration
2416 static tree cp_parser_objc_struct_declaration
2419 /* Utility Routines */
2421 static tree cp_parser_lookup_name
2423 static tree cp_parser_lookup_name_simple
2425 static tree cp_parser_maybe_treat_template_as_class
2427 static bool cp_parser_check_declarator_template_parameters
2429 static bool cp_parser_check_template_parameters
2431 static tree cp_parser_simple_cast_expression
2433 static tree cp_parser_global_scope_opt
2435 static bool cp_parser_constructor_declarator_p
2437 static tree cp_parser_function_definition_from_specifiers_and_declarator
2439 static tree cp_parser_function_definition_after_declarator
2441 static void cp_parser_template_declaration_after_export
2443 static void cp_parser_perform_template_parameter_access_checks
2445 static tree cp_parser_single_declaration
2447 static tree cp_parser_functional_cast
2449 static tree cp_parser_save_member_function_body
2451 static tree cp_parser_save_nsdmi
2453 static tree cp_parser_enclosed_template_argument_list
2455 static void cp_parser_save_default_args
2457 static void cp_parser_late_parsing_for_member
2459 static tree cp_parser_late_parse_one_default_arg
2461 static void cp_parser_late_parsing_nsdmi
2463 static void cp_parser_late_parsing_default_args
2465 static tree cp_parser_sizeof_operand
2467 static tree cp_parser_trait_expr
2469 static bool cp_parser_declares_only_class_p
2471 static void cp_parser_set_storage_class
2473 static void cp_parser_set_decl_spec_type
2475 static void set_and_check_decl_spec_loc
2478 static bool cp_parser_friend_p
2480 static void cp_parser_required_error
2486 static bool cp_parser_token_starts_function_definition_p
2488 static bool cp_parser_next_token_starts_class_definition_p
2490 static bool cp_parser_next_token_ends_template_argument_p
2492 static bool cp_parser_nth_token_starts_template_argument_list_p
2494 static enum tag_types cp_parser_token_is_class_key
2496 static enum tag_types cp_parser_token_is_type_parameter_key
2498 static void cp_parser_check_class_key
2500 static void cp_parser_check_access_in_redeclaration
2502 static bool cp_parser_optional_template_keyword
2504 static void cp_parser_pre_parsed_nested_name_specifier
2506 static bool cp_parser_cache_group
2508 static tree cp_parser_cache_defarg
2510 static void cp_parser_parse_tentatively
2512 static void cp_parser_commit_to_tentative_parse
2514 static void cp_parser_commit_to_topmost_tentative_parse
2516 static void cp_parser_abort_tentative_parse
2518 static bool cp_parser_parse_definitely
2522 static bool cp_parser_uncommitted_to_tentative_parse_p
2524 static void cp_parser_error
2526 static void cp_parser_name_lookup_error
2528 static bool cp_parser_simulate_error
2530 static bool cp_parser_check_type_definition
2532 static void cp_parser_check_for_definition_in_return_type
2534 static void cp_parser_check_for_invalid_template_id
2536 static bool cp_parser_non_integral_constant_expression
2538 static void cp_parser_diagnose_invalid_type_name
2540 static bool cp_parser_parse_and_diagnose_invalid_type_name
2542 static int cp_parser_skip_to_closing_parenthesis
2544 static void cp_parser_skip_to_end_of_statement
2546 static void cp_parser_consume_semicolon_at_end_of_statement
2548 static void cp_parser_skip_to_end_of_block_or_statement
2550 static bool cp_parser_skip_to_closing_brace
2552 static void cp_parser_skip_to_end_of_template_parameter_list
2554 static void cp_parser_skip_to_pragma_eol
2556 static bool cp_parser_error_occurred
2558 static bool cp_parser_allow_gnu_extensions_p
2560 static bool cp_parser_is_pure_string_literal
2562 static bool cp_parser_is_string_literal
2564 static bool cp_parser_is_keyword
2566 static tree cp_parser_make_typename_type
2570 static bool cp_parser_compound_literal_p
2572 static bool cp_parser_array_designator_p
2574 static bool cp_parser_skip_to_closing_square_bracket
2577 /* Concept-related syntactic transformations */
2582 // -------------------------------------------------------------------------- //
2583 // Unevaluated Operand Guard
2584 //
2585 // Implementation of an RAII helper for unevaluated operand parsing.
2587 {
2590 }
2593 {
2596 }
2598 // -------------------------------------------------------------------------- //
2599 // Tentative Parsing
2601 /* Returns nonzero if we are parsing tentatively. */
2605 {
2607 }
2609 /* Returns nonzero if TOKEN is a string literal. */
2611 static bool
2613 {
2619 }
2621 /* Returns nonzero if TOKEN is a string literal
2622 of a user-defined string literal. */
2624 static bool
2626 {
2633 }
2635 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2637 static bool
2639 {
2641 }
2643 /* If not parsing tentatively, issue a diagnostic of the form
2644 FILE:LINE: MESSAGE before TOKEN
2645 where TOKEN is the next token in the input stream. MESSAGE
2646 (specified by the caller) is usually of the form "expected
2647 OTHER-TOKEN". */
2649 static void
2651 {
2653 {
2655 /* This diagnostic makes more sense if it is tagged to the line
2656 of the token we just peeked at. */
2660 {
2665 }
2668 /* Because c_parser_error does not understand
2669 CPP_KEYWORD, keywords are treated like
2670 identifiers. */
2673 }
2674 }
2676 /* Issue an error about name-lookup failing. NAME is the
2677 IDENTIFIER_NODE DECL is the result of
2678 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2679 the thing that we hoped to find. */
2681 static void
2683 tree name,
2684 tree decl,
2685 name_lookup_error desired,
2686 location_t location)
2687 {
2688 /* If name lookup completely failed, tell the user that NAME was not
2689 declared. */
2691 {
2704 else
2706 }
2708 {
2710 {
2727 }
2728 }
2730 {
2732 {
2742 name);
2746 }
2747 }
2748 else
2749 {
2751 {
2764 }
2765 }
2766 }
2768 /* If we are parsing tentatively, remember that an error has occurred
2769 during this tentative parse. Returns true if the error was
2770 simulated; false if a message should be issued by the caller. */
2772 static bool
2774 {
2776 {
2779 }
2781 }
2783 /* This function is called when a type is defined. If type
2784 definitions are forbidden at this point, an error message is
2785 issued. */
2787 static bool
2789 {
2790 /* If types are forbidden here, issue a message. */
2792 {
2793 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2794 in the message need to be interpreted. */
2797 }
2799 }
2801 /* This function is called when the DECLARATOR is processed. The TYPE
2802 was a type defined in the decl-specifiers. If it is invalid to
2803 define a type in the decl-specifiers for DECLARATOR, an error is
2804 issued. TYPE_LOCATION is the location of TYPE and is used
2805 for error reporting. */
2807 static void
2810 {
2811 /* [dcl.fct] forbids type definitions in return types.
2812 Unfortunately, it's not easy to know whether or not we are
2813 processing a return type until after the fact. */
2821 {
2826 type);
2827 }
2828 }
2830 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2831 "<" in any valid C++ program. If the next token is indeed "<",
2832 issue a message warning the user about what appears to be an
2833 invalid attempt to form a template-id. LOCATION is the location
2834 of the type-specifier (TYPE) */
2836 static void
2838 tree type,
2840 location_t location)
2841 {
2845 {
2849 {
2852 else
2854 }
2855 else
2857 /* Remember the location of the invalid "<". */
2860 /* Consume the "<". */
2862 /* Parse the template arguments. */
2864 /* Permanently remove the invalid template arguments so that
2865 this error message is not issued again. */
2868 }
2869 }
2871 /* If parsing an integral constant-expression, issue an error message
2872 about the fact that THING appeared and return true. Otherwise,
2873 return false. In either case, set
2874 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2876 static bool
2878 non_integral_constant thing)
2879 {
2882 {
2884 {
2887 {
2894 "enumeration type cannot appear in a "
2985 }
2989 }
2990 }
2992 }
2994 /* Emit a diagnostic for an invalid type name. This function commits
2995 to the current active tentative parse, if any. (Otherwise, the
2996 problematic construct might be encountered again later, resulting
2997 in duplicate error messages.) LOCATION is the location of ID. */
2999 static void
3001 location_t location)
3002 {
3005 /* Try to lookup the identifier. */
3012 /* If the lookup was ambiguous, an error will already have
3013 been issued. */
3015 /* If the lookup found a template-name, it means that the user forgot
3016 to specify an argument list. Emit a useful error message. */
3020 decl);
3024 /* Something like 'unsigned A a;' */
3027 {
3028 /* Issue an error message. */
3030 /* If we're in a template class, it's possible that the user was
3031 referring to a type from a base class. For example:
3033 template <typename T> struct A { typedef T X; };
3034 template <typename T> struct B : public A<T> { X x; };
3036 The user should have said "typename A<T>::X". */
3050 {
3051 tree b;
3054 b;
3056 {
3060 {
3061 tree field;
3062 /* Go from a particular instantiation of the
3063 template (which will have an empty TYPE_FIELDs),
3064 to the main version. */
3067 field;
3071 {
3076 }
3079 }
3080 }
3081 }
3082 }
3083 /* Here we diagnose qualified-ids where the scope is actually correct,
3084 but the identifier does not resolve to a valid type name. */
3086 {
3088 {
3093 else
3097 }
3100 {
3101 /* A<T>::A<T>() */
3107 }
3114 {
3119 else
3123 }
3124 else
3126 }
3127 }
3129 /* Check for a common situation where a type-name should be present,
3130 but is not, and issue a sensible error message. Returns true if an
3131 invalid type-name was detected.
3133 The situation handled by this function are variable declarations of the
3134 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3135 Usually, `ID' should name a type, but if we got here it means that it
3136 does not. We try to emit the best possible error message depending on
3137 how exactly the id-expression looks like. */
3139 static bool
3141 {
3142 tree id;
3145 /* Avoid duplicate error about ambiguous lookup. */
3147 {
3151 }
3160 /* If the next token is a (, this is a function with no explicit return
3161 type, i.e. constructor, destructor or conversion op. */
3164 {
3167 }
3171 /* Emit a diagnostic for the invalid type. */
3173 out:
3174 /* If we aren't in the middle of a declarator (i.e. in a
3175 parameter-declaration-clause), skip to the end of the declaration;
3176 there's no point in trying to process it. */
3180 }
3182 /* Consume tokens up to, and including, the next non-nested closing `)'.
3183 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3184 are doing error recovery. Returns -1 if OR_COMMA is true and we
3185 found an unnested comma. */
3187 static int
3192 {
3202 {
3206 {
3209 /* If we've run out of tokens, then there is no closing `)'. */
3212 /* This is good for lambda expression capture-lists. */
3222 /* This matches the processing in skip_to_end_of_statement. */
3248 {
3252 }
3257 }
3259 /* Consume the token. */
3261 }
3262 }
3264 /* Consume tokens until we reach the end of the current statement.
3265 Normally, that will be just before consuming a `;'. However, if a
3266 non-nested `}' comes first, then we stop before consuming that. */
3268 static void
3270 {
3273 /* Unwind generic function template scope if necessary. */
3278 {
3282 {
3285 /* If we've run out of tokens, stop. */
3289 /* If the next token is a `;', we have reached the end of the
3290 statement. */
3296 /* If this is a non-nested '}', stop before consuming it.
3297 That way, when confronted with something like:
3299 { 3 + }
3301 we stop before consuming the closing '}', even though we
3302 have not yet reached a `;'. */
3306 /* If it is the closing '}' for a block that we have
3307 scanned, stop -- but only after consuming the token.
3308 That way given:
3310 void f g () { ... }
3311 typedef int I;
3313 we will stop after the body of the erroneously declared
3314 function, but before consuming the following `typedef'
3315 declaration. */
3317 {
3320 }
3328 }
3330 /* Consume the token. */
3332 }
3333 }
3335 /* This function is called at the end of a statement or declaration.
3336 If the next token is a semicolon, it is consumed; otherwise, error
3337 recovery is attempted. */
3339 static void
3341 {
3342 /* Look for the trailing `;'. */
3344 {
3345 /* If there is additional (erroneous) input, skip to the end of
3346 the statement. */
3348 /* If the next token is now a `;', consume it. */
3351 }
3352 }
3354 /* Skip tokens until we have consumed an entire block, or until we
3355 have consumed a non-nested `;'. */
3357 static void
3359 {
3362 /* Unwind generic function template scope if necessary. */
3367 {
3371 {
3374 /* If we've run out of tokens, stop. */
3378 /* Stop if this is an unnested ';'. */
3384 /* Stop if this is an unnested '}', or closes the outermost
3385 nesting level. */
3386 nesting_depth--;
3394 /* Nest. */
3395 nesting_depth++;
3400 }
3402 /* Consume the token. */
3404 }
3405 }
3407 /* Skip tokens until a non-nested closing curly brace is the next
3408 token, or there are no more tokens. Return true in the first case,
3409 false otherwise. */
3411 static bool
3413 {
3417 {
3421 {
3424 /* If we've run out of tokens, stop. */
3428 /* If the next token is a non-nested `}', then we have reached
3429 the end of the current block. */
3435 /* If it the next token is a `{', then we are entering a new
3436 block. Consume the entire block. */
3442 }
3444 /* Consume the token. */
3446 }
3447 }
3449 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3450 parameter is the PRAGMA token, allowing us to purge the entire pragma
3451 sequence. */
3453 static void
3455 {
3460 do
3464 /* Ensure that the pragma is not parsed again. */
3466 }
3468 /* Require pragma end of line, resyncing with it as necessary. The
3469 arguments are as for cp_parser_skip_to_pragma_eol. */
3471 static void
3473 {
3477 }
3479 /* This is a simple wrapper around make_typename_type. When the id is
3480 an unresolved identifier node, we can provide a superior diagnostic
3481 using cp_parser_diagnose_invalid_type_name. */
3483 static tree
3485 location_t id_location)
3486 {
3487 tree result;
3489 {
3495 }
3497 }
3499 /* This is a wrapper around the
3500 make_{pointer,ptrmem,reference}_declarator functions that decides
3501 which one to call based on the CODE and CLASS_TYPE arguments. The
3502 CODE argument should be one of the values returned by
3503 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3504 appertain to the pointer or reference. */
3508 cp_cv_quals cv_qualifiers,
3510 tree attributes)
3511 {
3518 else
3528 }
3530 /* Create a new C++ parser. */
3534 {
3539 /* cp_lexer_new_main is called before doing GC allocation because
3540 cp_lexer_new_main might load a PCH file. */
3543 /* Initialize the binops_by_token so that we can get the tree
3544 directly from the token. */
3552 /* For now, we always accept GNU extensions. */
3555 /* The `>' token is a greater-than operator, not the end of a
3556 template-id. */
3561 /* We are not parsing a constant-expression. */
3566 /* Local variable names are not forbidden. */
3569 /* We are not processing an `extern "C"' declaration. */
3572 /* We are not processing a declarator. */
3575 /* We are not processing a template-argument-list. */
3578 /* We are not in an iteration statement. */
3581 /* We are not in a switch statement. */
3584 /* We are not parsing a type-id inside an expression. */
3587 /* Declarations aren't implicitly extern "C". */
3590 /* String literals should be translated to the execution character set. */
3593 /* We are not parsing a function body. */
3596 /* We can correct until told otherwise. */
3599 /* The unparsed function queue is empty. */
3602 /* There are no classes being defined. */
3605 /* No template parameters apply. */
3608 /* Not declaring an implicit function template. */
3614 /* Allow constrained-type-specifiers. */
3618 }
3620 /* Create a cp_lexer structure which will emit the tokens in CACHE
3621 and push it onto the parser's lexer stack. This is used for delayed
3622 parsing of in-class method bodies and default arguments, and should
3623 not be confused with tentative parsing. */
3624 static void
3626 {
3631 /* Move the current source position to that of the first token in the
3632 new lexer. */
3634 }
3636 /* Pop the top lexer off the parser stack. This is never used for the
3637 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3638 static void
3640 {
3645 /* Put the current source position back where it was before this
3646 lexer was pushed. */
3648 }
3650 /* Lexical conventions [gram.lex] */
3652 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3653 identifier. */
3655 static tree
3657 {
3660 /* Look for the identifier. */
3662 /* Return the value. */
3664 }
3666 /* Parse a sequence of adjacent string constants. Returns a
3667 TREE_STRING representing the combined, nul-terminated string
3668 constant. If TRANSLATE is true, translate the string to the
3669 execution character set. If WIDE_OK is true, a wide string is
3670 invalid here.
3672 C++98 [lex.string] says that if a narrow string literal token is
3673 adjacent to a wide string literal token, the behavior is undefined.
3674 However, C99 6.4.5p4 says that this results in a wide string literal.
3675 We follow C99 here, for consistency with the C front end.
3677 This code is largely lifted from lex_string() in c-lex.c.
3679 FUTURE: ObjC++ will need to handle @-strings here. */
3680 static tree
3683 {
3684 tree value;
3691 tree string_tree;
3697 {
3700 }
3703 {
3707 }
3708 else
3709 {
3712 }
3715 /* Try to avoid the overhead of creating and destroying an obstack
3716 for the common case of just one string. */
3719 {
3727 {
3731 }
3732 else
3736 }
3737 else
3738 {
3742 do
3743 {
3745 count++;
3750 {
3753 {
3756 }
3759 {
3764 }
3766 }
3767 else
3771 {
3776 "unsupported non-standard concatenation "
3778 }
3784 {
3788 }
3789 else
3790 {
3794 }
3795 }
3799 }
3802 {
3805 }
3809 {
3814 {
3829 }
3834 {
3839 else
3841 }
3842 }
3843 else
3844 /* cpp_interpret_string has issued an error. */
3851 }
3853 /* Look up a literal operator with the name and the exact arguments. */
3855 static tree
3857 {
3864 {
3870 {
3873 {
3883 }
3886 /* May be this should be sufficient_parms_p instead,
3887 depending on how exactly should user-defined literals
3888 work in presence of default arguments on the literal
3889 operator parameters. */
3892 }
3893 }
3896 }
3898 /* Parse a user-defined char constant. Returns a call to a user-defined
3899 literal operator taking the character as an argument. */
3901 static tree
3903 {
3911 /* Build up a call to the user-defined operator */
3912 /* Lookup the name we got back from the id-expression. */
3917 {
3922 }
3926 }
3928 /* A subroutine of cp_parser_userdef_numeric_literal to
3929 create a char... template parameter pack from a string node. */
3931 static tree
3933 {
3934 tree charvec;
3940 /* Fill in CHARVEC with all of the parameters. */
3945 /* Build the argument packs. */
3952 }
3954 /* A subroutine of cp_parser_userdef_numeric_literal to
3955 create a char... template parameter pack from a string node. */
3957 static tree
3959 {
3960 tree charvec;
3971 /* First template parm is character type. */
3974 /* Fill in CHARVEC with all of the parameters. */
3981 /* Build the argument packs. */
3988 }
3990 /* Parse a user-defined numeric constant. returns a call to a user-defined
3991 literal operator. */
3993 static tree
3995 {
4006 /* Look for a literal operator taking the exact type of numeric argument
4007 as the literal value. */
4012 {
4014 tf_warning_or_error);
4017 {
4020 long_long_unsigned_type_node);
4021 }
4022 else
4023 {
4027 long_double_type_node);
4031 }
4035 }
4038 /* If the numeric argument didn't work, look for a raw literal
4039 operator taking a const char* argument consisting of the number
4040 in string format. */
4045 {
4047 tf_warning_or_error);
4050 }
4053 /* If the raw literal didn't work, look for a non-type template
4054 function with parameter pack char.... Call the function with
4055 template parameter characters representing the number. */
4059 {
4063 tf_warning_or_error);
4066 }
4075 }
4077 /* Parse a user-defined string constant. Returns a call to a user-defined
4078 literal operator taking a character pointer and the length of the string
4079 as arguments. */
4081 static tree
4083 {
4092 /* Build up a call to the user-defined operator. */
4093 /* Lookup the name we got back from the id-expression. */
4100 {
4102 tf_warning_or_error);
4105 }
4108 /* Look for a template function with typename parameter CharT
4109 and parameter pack CharT... Call the function with
4110 template parameter characters representing the string. */
4114 {
4118 tf_warning_or_error);
4121 }
4127 }
4130 /* Basic concepts [gram.basic] */
4132 /* Parse a translation-unit.
4134 translation-unit:
4135 declaration-seq [opt]
4137 Returns TRUE if all went well. */
4139 static bool
4141 {
4142 /* The address of the first non-permanent object on the declarator
4143 obstack. */
4148 /* Create the declarator obstack, if necessary. */
4150 {
4152 /* Create the error declarator. */
4154 /* Create the empty parameter list. */
4156 /* Remember where the base of the declarator obstack lies. */
4158 }
4162 /* If there are no tokens left then all went well. */
4164 {
4165 /* Get rid of the token array; we don't need it any more. */
4169 /* This file might have been a context that's implicitly extern
4170 "C". If so, pop the lang context. (Only relevant for PCH.) */
4172 {
4175 }
4177 /* Finish up. */
4181 }
4182 else
4183 {
4186 }
4188 /* Make sure the declarator obstack was fully cleaned up. */
4192 /* All went well. */
4194 }
4196 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4197 decltype context. */
4201 {
4206 }
4208 /* We're about to parse a collection of statements. If we're currently
4209 parsing tentatively, set up a firewall so that any nested
4210 cp_parser_commit_to_tentative_parse won't affect the current context. */
4212 static cp_token_position
4214 {
4221 }
4223 /* We've finished parsing the collection of statements. Wrap up the
4224 firewall and replace the relevant tokens with the parsed form. */
4226 static void
4228 tree expr)
4229 {
4233 /* Finish the firewall level. */
4235 /* And remember the result of the parse for when we try again. */
4241 }
4243 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4244 enclosing parentheses. */
4246 static tree
4248 {
4251 /* Consume the '('. */
4253 /* Start the statement-expression. */
4255 /* Parse the compound-statement. */
4257 /* Finish up. */
4259 /* Consume the ')'. */
4265 }
4267 /* Expressions [gram.expr] */
4269 /* Parse a primary-expression.
4271 primary-expression:
4272 literal
4273 this
4274 ( expression )
4275 id-expression
4276 lambda-expression (C++11)
4278 GNU Extensions:
4280 primary-expression:
4281 ( compound-statement )
4282 __builtin_va_arg ( assignment-expression , type-id )
4283 __builtin_offsetof ( type-id , offsetof-expression )
4285 C++ Extensions:
4286 __has_nothrow_assign ( type-id )
4287 __has_nothrow_constructor ( type-id )
4288 __has_nothrow_copy ( type-id )
4289 __has_trivial_assign ( type-id )
4290 __has_trivial_constructor ( type-id )
4291 __has_trivial_copy ( type-id )
4292 __has_trivial_destructor ( type-id )
4293 __has_virtual_destructor ( type-id )
4294 __is_abstract ( type-id )
4295 __is_base_of ( type-id , type-id )
4296 __is_class ( type-id )
4297 __is_empty ( type-id )
4298 __is_enum ( type-id )
4299 __is_final ( type-id )
4300 __is_literal_type ( type-id )
4301 __is_pod ( type-id )
4302 __is_polymorphic ( type-id )
4303 __is_std_layout ( type-id )
4304 __is_trivial ( type-id )
4305 __is_union ( type-id )
4307 Objective-C++ Extension:
4309 primary-expression:
4310 objc-expression
4312 literal:
4313 __null
4315 ADDRESS_P is true iff this expression was immediately preceded by
4316 "&" and therefore might denote a pointer-to-member. CAST_P is true
4317 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4318 true iff this expression is a template argument.
4320 Returns a representation of the expression. Upon return, *IDK
4321 indicates what kind of id-expression (if any) was present. */
4323 static tree
4330 {
4333 /* Assume the primary expression is not an id-expression. */
4336 /* Peek at the next token. */
4339 {
4340 /* literal:
4341 integer-literal
4342 character-literal
4343 floating-literal
4344 string-literal
4345 boolean-literal
4346 pointer-literal
4347 user-defined-literal */
4358 {
4362 }
4363 /* Floating-point literals are only allowed in an integral
4364 constant expression if they are cast to an integral or
4365 enumeration type. */
4369 {
4370 /* CAST_P will be set even in invalid code like "int(2.7 +
4371 ...)". Therefore, we have to check that the next token
4372 is sure to end the cast. */
4374 {
4379 enumerator-definition. */
4381 /* The curly brace at the end of an enum-specifier. */
4383 /* The end of a statement. */
4385 /* The end of the cast-expression. */
4387 /* The end of an array bound. */
4389 /* The closing ">" in a template-argument-list. */
4392 /* C++0x only: A ">>" treated like two ">" tokens,
4393 in a template-argument-list. */
4398 }
4400 /* If we are within a cast, then the constraint that the
4401 cast is to an integral or enumeration type will be
4402 checked at that point. If we are not within a cast, then
4403 this code is invalid. */
4406 }
4425 /* ??? Should wide strings be allowed when parser->translate_strings_p
4426 is false (i.e. in attributes)? If not, we can kill the third
4427 argument to cp_parser_string_literal. */
4433 /* If we see `( { ' then we are looking at the beginning of
4434 a GNU statement-expression. */
4437 {
4438 /* Statement-expressions are not allowed by the standard. */
4442 /* And they're not allowed outside of a function-body; you
4443 cannot, for example, write:
4445 int i = ({ int j = 3; j + 1; });
4447 at class or namespace scope. */
4450 {
4452 "statement-expressions are not allowed outside "
4458 }
4459 else
4461 }
4462 /* Otherwise it's a normal parenthesized expression. */
4463 {
4464 tree expr;
4467 /* Consume the `('. */
4469 /* Within a parenthesized expression, a `>' token is always
4470 the greater-than operator. */
4471 saved_greater_than_is_operator_p
4475 /* Parse the parenthesized expression. */
4477 /* Let the front end know that this expression was
4478 enclosed in parentheses. This matters in case, for
4479 example, the expression is of the form `A::B', since
4480 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4481 not. */
4483 /* DR 705: Wrapping an unqualified name in parentheses
4484 suppresses arg-dependent lookup. We want to pass back
4485 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4486 (c++/37862), but none of the others. */
4490 /* The `>' token might be the end of a template-id or
4491 template-parameter-list now. */
4492 parser->greater_than_is_operator_p
4494 /* Consume the `)'. */
4499 }
4502 {
4504 {
4505 /* We might have an Objective-C++ message. */
4508 /* If that works out, we're done ... */
4511 /* ... else, fall though to see if it's a lambda. */
4512 }
4514 /* Don't warn about a failed tentative parse. */
4519 }
4523 /* We have an Objective-C++ string literal. */
4530 {
4531 /* These two are the boolean literals. */
4539 /* The `__null' literal. */
4544 /* The `nullptr' literal. */
4549 /* Recognize the `this' keyword. */
4553 {
4557 }
4558 /* Pointers cannot appear in constant-expressions. */
4563 /* The `operator' keyword can be the beginning of an
4564 id-expression. */
4571 {
4572 non_integral_constant name;
4574 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4575 __func__ are the names of variables -- but they are
4576 treated specially. Therefore, they are handled here,
4577 rather than relying on the generic id-expression logic
4578 below. Grammatically, these names are id-expressions.
4580 Consume the token. */
4584 {
4596 }
4601 /* Look up the name. */
4603 }
4606 {
4607 tree expression;
4608 tree type;
4609 source_location type_location;
4611 /* The `__builtin_va_arg' construct is used to handle
4612 `va_arg'. Consume the `__builtin_va_arg' token. */
4614 /* Look for the opening `('. */
4616 /* Now, parse the assignment-expression. */
4618 /* Look for the `,'. */
4621 /* Parse the type-id. */
4623 /* Look for the closing `)'. */
4625 /* Using `va_arg' in a constant-expression is not
4626 allowed. */
4628 NIC_VA_ARG))
4631 }
4662 // C++ concepts
4666 /* Objective-C++ expressions. */
4676 {
4681 }
4685 }
4687 /* An id-expression can start with either an identifier, a
4688 `::' as the beginning of a qualified-id, or the "operator"
4689 keyword. */
4694 {
4695 tree id_expression;
4696 tree decl;
4702 id_expression:
4703 /* Parse the id-expression. */
4704 id_expression
4721 /* If we have a template-id, then no further lookup is
4722 required. If the template-id was for a template-class, we
4723 will sometimes have a TYPE_DECL at this point. */
4727 /* Look up the name. */
4728 else
4729 {
4730 tree ambiguous_decls;
4732 /* If we already know that this lookup is ambiguous, then
4733 we've already issued an error message; there's no reason
4734 to check again. */
4737 {
4740 }
4743 none_type,
4744 template_p,
4749 /* If the lookup was ambiguous, an error will already have
4750 been issued. */
4754 /* In Objective-C++, we may have an Objective-C 2.0
4755 dot-syntax for classes here. */
4760 {
4761 tree component;
4768 }
4770 /* In Objective-C++, an instance variable (ivar) may be preferred
4771 to whatever cp_parser_lookup_name() found. */
4774 /* If name lookup gives us a SCOPE_REF, then the
4775 qualifying scope was dependent. */
4777 {
4778 /* At this point, we do not know if DECL is a valid
4779 integral constant expression. We assume that it is
4780 in fact such an expression, so that code like:
4782 template <int N> struct A {
4783 int a[B<N>::i];
4784 };
4786 is accepted. At template-instantiation time, we
4787 will check that B<N>::i is actually a constant. */
4789 }
4790 /* Check to see if DECL is a local variable in a context
4791 where that is forbidden. */
4794 {
4795 /* It might be that we only found DECL because we are
4796 trying to be generous with pre-ISO scoping rules.
4797 For example, consider:
4799 int i;
4800 void g() {
4801 for (int i = 0; i < 10; ++i) {}
4802 extern void f(int j = i);
4803 }
4805 Here, name look up will originally find the out
4806 of scope `i'. We need to issue a warning message,
4807 but then use the global `i'. */
4810 {
4813 decl);
4815 }
4816 }
4817 }
4819 decl = (finish_id_expression
4821 idk,
4826 template_arg_p,
4832 }
4834 /* Anything else is an error. */
4838 }
4839 }
4847 {
4850 }
4852 /* Parse an id-expression.
4854 id-expression:
4855 unqualified-id
4856 qualified-id
4858 qualified-id:
4859 :: [opt] nested-name-specifier template [opt] unqualified-id
4860 :: identifier
4861 :: operator-function-id
4862 :: template-id
4864 Return a representation of the unqualified portion of the
4865 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4866 a `::' or nested-name-specifier.
4868 Often, if the id-expression was a qualified-id, the caller will
4869 want to make a SCOPE_REF to represent the qualified-id. This
4870 function does not do this in order to avoid wastefully creating
4871 SCOPE_REFs when they are not required.
4873 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4874 `template' keyword.
4876 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4877 uninstantiated templates.
4879 If *TEMPLATE_P is non-NULL, it is set to true iff the
4880 `template' keyword is used to explicitly indicate that the entity
4881 named is a template.
4883 If DECLARATOR_P is true, the id-expression is appearing as part of
4884 a declarator, rather than as part of an expression. */
4886 static tree
4893 {
4897 /* Assume the `template' keyword was not used. */
4901 /* Look for the optional `::' operator. */
4902 global_scope_p
4905 /* Look for the optional nested-name-specifier. */
4906 nested_name_specifier_p
4909 check_dependency_p,
4911 declarator_p)
4913 /* If there is a nested-name-specifier, then we are looking at
4914 the first qualified-id production. */
4916 {
4917 tree saved_scope;
4918 tree saved_object_scope;
4919 tree saved_qualifying_scope;
4920 tree unqualified_id;
4923 /* See if the next token is the `template' keyword. */
4927 /* Name lookup we do during the processing of the
4928 unqualified-id might obliterate SCOPE. */
4932 /* Process the final unqualified-id. */
4934 check_dependency_p,
4935 declarator_p,
4937 /* Restore the SAVED_SCOPE for our caller. */
4943 }
4944 /* Otherwise, if we are in global scope, then we are looking at one
4945 of the other qualified-id productions. */
4947 {
4949 tree id;
4951 /* Peek at the next token. */
4954 /* If it's an identifier, and the next token is not a "<", then
4955 we can avoid the template-id case. This is an optimization
4956 for this common case. */
4958 && !cp_parser_nth_token_starts_template_argument_list_p
4963 /* Try a template-id. */
4967 none_type,
4968 declarator_p);
4969 /* If that worked, we're done. */
4973 /* Peek at the next token. (Changes in the token buffer may
4974 have invalidated the pointer obtained above.) */
4978 {
4985 /* Fall through. */
4990 }
4991 }
4992 else
4995 declarator_p,
4996 optional_p);
4997 }
4999 /* Parse an unqualified-id.
5001 unqualified-id:
5002 identifier
5003 operator-function-id
5004 conversion-function-id
5005 ~ class-name
5006 template-id
5008 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5009 keyword, in a construct like `A::template ...'.
5011 Returns a representation of unqualified-id. For the `identifier'
5012 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5013 production a BIT_NOT_EXPR is returned; the operand of the
5014 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5015 other productions, see the documentation accompanying the
5016 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5017 names are looked up in uninstantiated templates. If DECLARATOR_P
5018 is true, the unqualified-id is appearing as part of a declarator,
5019 rather than as part of an expression. */
5021 static tree
5027 {
5030 /* Peek at the next token. */
5034 {
5036 {
5037 tree id;
5039 /* We don't know yet whether or not this will be a
5040 template-id. */
5042 /* Try a template-id. */
5044 check_dependency_p,
5045 none_type,
5046 declarator_p);
5047 /* If it worked, we're done. */
5050 /* Otherwise, it's an ordinary identifier. */
5052 }
5056 check_dependency_p,
5057 none_type,
5058 declarator_p);
5061 {
5062 tree type_decl;
5063 tree qualifying_scope;
5064 tree object_scope;
5065 tree scope;
5068 /* Consume the `~' token. */
5070 /* Parse the class-name. The standard, as written, seems to
5071 say that:
5073 template <typename T> struct S { ~S (); };
5074 template <typename T> S<T>::~S() {}
5076 is invalid, since `~' must be followed by a class-name, but
5077 `S<T>' is dependent, and so not known to be a class.
5078 That's not right; we need to look in uninstantiated
5079 templates. A further complication arises from:
5081 template <typename T> void f(T t) {
5082 t.T::~T();
5083 }
5085 Here, it is not possible to look up `T' in the scope of `T'
5086 itself. We must look in both the current scope, and the
5087 scope of the containing complete expression.
5089 Yet another issue is:
5091 struct S {
5092 int S;
5093 ~S();
5094 };
5096 S::~S() {}
5098 The standard does not seem to say that the `S' in `~S'
5099 should refer to the type `S' and not the data member
5100 `S::S'. */
5102 /* DR 244 says that we look up the name after the "~" in the
5103 same scope as we looked up the qualifying name. That idea
5104 isn't fully worked out; it's more complicated than that. */
5109 /* Check for invalid scopes. */
5111 {
5115 }
5117 {
5121 scope);
5126 }
5129 /* If the name is of the form "X::~X" it's OK even if X is a
5130 typedef. */
5139 {
5142 }
5144 /* ~auto means the destructor of whatever the object is. */
5146 {
5149 "%<~auto%> only available with "
5153 }
5155 /* If there was an explicit qualification (S::~T), first look
5156 in the scope given by the qualification (i.e., S).
5158 Note: in the calls to cp_parser_class_name below we pass
5159 typename_type so that lookup finds the injected-class-name
5160 rather than the constructor. */
5164 {
5169 typename_type,
5172 declarator_p);
5175 }
5176 /* In "N::S::~S", look in "N" as well. */
5178 {
5183 type_decl
5187 typename_type,
5190 declarator_p);
5193 }
5194 /* In "p->S::~T", look in the scope given by "*p" as well. */
5196 {
5201 type_decl
5205 typename_type,
5208 declarator_p);
5211 }
5212 /* Look in the surrounding context. */
5214 {
5220 type_decl
5224 typename_type,
5227 declarator_p);
5230 {
5231 /* We couldn't find a type with this name, so just accept
5232 it and check for a match at instantiation time. */
5237 }
5238 }
5239 /* If an error occurred, assume that the name of the
5240 destructor is the same as the name of the qualifying
5241 class. That allows us to keep parsing after running
5242 into ill-formed destructor names. */
5248 /* Check that destructor name and scope match. */
5250 {
5257 }
5259 /* [class.dtor]
5261 A typedef-name that names a class shall not be used as the
5262 identifier in the declarator for a destructor declaration. */
5269 type_decl);
5272 }
5276 {
5277 tree id;
5279 /* This could be a template-id, so we try that first. */
5281 /* Try a template-id. */
5284 none_type,
5285 declarator_p);
5286 /* If that worked, we're done. */
5289 /* We still don't know whether we're looking at an
5290 operator-function-id or a conversion-function-id. */
5292 /* Try an operator-function-id. */
5294 /* If that didn't work, try a conversion-function-id. */
5298 {
5299 /* 17.6.3.3.5 */
5305 }
5308 }
5309 /* Fall through. */
5316 }
5317 }
5319 /* Parse an (optional) nested-name-specifier.
5321 nested-name-specifier: [C++98]
5322 class-or-namespace-name :: nested-name-specifier [opt]
5323 class-or-namespace-name :: template nested-name-specifier [opt]
5325 nested-name-specifier: [C++0x]
5326 type-name ::
5327 namespace-name ::
5328 nested-name-specifier identifier ::
5329 nested-name-specifier template [opt] simple-template-id ::
5331 PARSER->SCOPE should be set appropriately before this function is
5332 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5333 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5334 in name lookups.
5336 Sets PARSER->SCOPE to the class (TYPE) or namespace
5337 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5338 it unchanged if there is no nested-name-specifier. Returns the new
5339 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5341 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5342 part of a declaration and/or decl-specifier. */
5344 static tree
5350 {
5355 /* Remember where the nested-name-specifier starts. */
5357 {
5360 }
5363 {
5364 tree new_scope;
5365 tree old_scope;
5366 tree saved_qualifying_scope;
5369 /* Spot cases that cannot be the beginning of a
5370 nested-name-specifier. */
5373 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5374 the already parsed nested-name-specifier. */
5376 {
5377 /* Grab the nested-name-specifier and continue the loop. */
5379 /* If we originally encountered this nested-name-specifier
5380 with IS_DECLARATION set to false, we will not have
5381 resolved TYPENAME_TYPEs, so we must do so here. */
5384 {
5389 }
5392 }
5394 /* Spot cases that cannot be the beginning of a
5395 nested-name-specifier. On the second and subsequent times
5396 through the loop, we look for the `template' keyword. */
5398 ;
5399 /* A template-id can start a nested-name-specifier. */
5401 ;
5402 /* DR 743: decltype can be used in a nested-name-specifier. */
5404 ;
5405 else
5406 {
5407 /* If the next token is not an identifier, then it is
5408 definitely not a type-name or namespace-name. */
5411 /* If the following token is neither a `<' (to begin a
5412 template-id), nor a `::', then we are not looking at a
5413 nested-name-specifier. */
5419 {
5423 }
5426 && !cp_parser_nth_token_starts_template_argument_list_p
5429 }
5431 /* The nested-name-specifier is optional, so we parse
5432 tentatively. */
5435 /* Look for the optional `template' keyword, if this isn't the
5436 first time through the loop. */
5439 else
5442 /* Save the old scope since the name lookup we are about to do
5443 might destroy it. */
5446 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5447 look up names in "X<T>::I" in order to determine that "Y" is
5448 a template. So, if we have a typename at this point, we make
5449 an effort to look through it. */
5451 && !typename_keyword_p
5456 /* Parse the qualifying entity. */
5457 new_scope
5459 typename_keyword_p,
5460 template_keyword_p,
5461 check_dependency_p,
5462 type_p,
5463 is_declaration);
5464 /* Look for the `::' token. */
5467 /* If we found what we wanted, we keep going; otherwise, we're
5468 done. */
5470 {
5473 /* Restore the OLD_SCOPE since it was valid before the
5474 failed attempt at finding the last
5475 class-or-namespace-name. */
5479 /* If the next token is a decltype, and the one after that is a
5480 `::', then the decltype has failed to resolve to a class or
5481 enumeration type. Give this error even when parsing
5482 tentatively since it can't possibly be valid--and we're going
5483 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5484 won't get another chance.*/
5488 {
5495 /* As below. */
5498 }
5502 {
5503 /* If we have a non-type template-id followed by ::, it can't
5504 possibly be valid. */
5509 {
5512 {
5518 }
5519 else
5520 {
5521 /* Variable template. */
5526 }
5533 /* As below. */
5537 }
5538 }
5542 /* If the next token is an identifier, and the one after
5543 that is a `::', then any valid interpretation would have
5544 found a class-or-namespace-name. */
5550 {
5553 {
5555 {
5556 tree decl;
5557 tree ambiguous_decls;
5560 none_type,
5569 decl);
5571 {
5572 // cp_parser_lookup_name has the same diagnostic,
5573 // thus make sure to emit it at most once.
5576 {
5581 }
5583 }
5584 else
5585 {
5587 cp_parser_name_lookup_error
5590 else
5591 cp_parser_name_lookup_error
5594 }
5595 }
5598 /* Treat this as a successful nested-name-specifier
5599 due to:
5601 [basic.lookup.qual]
5603 If the name found is not a class-name (clause
5604 _class_) or namespace-name (_namespace.def_), the
5605 program is ill-formed. */
5607 }
5609 }
5611 }
5612 /* We've found one valid nested-name-specifier. */
5614 /* Name lookup always gives us a DECL. */
5617 /* Uses of "template" must be followed by actual templates. */
5629 new_scope);
5630 /* If it is a class scope, try to complete it; we are about to
5631 be looking up names inside the class. */
5633 /* Since checking types for dependency can be expensive,
5634 avoid doing it if the type is already complete. */
5636 /* Do not try to complete dependent types. */
5638 {
5640 /* If it is a typedef to current class, use the current
5641 class instead, as the typedef won't have any names inside
5642 it yet. */
5646 }
5647 /* Make sure we look in the right scope the next time through
5648 the loop. */
5650 }
5652 /* If parsing tentatively, replace the sequence of tokens that makes
5653 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5654 token. That way, should we re-parse the token stream, we will
5655 not have to repeat the effort required to do the parse, nor will
5656 we issue duplicate error messages. */
5658 {
5662 /* Reset the contents of the START token. */
5664 /* Retrieve any deferred checks. Do not pop this access checks yet
5665 so the memory will not be reclaimed during token replacing below. */
5673 /* Purge all subsequent tokens. */
5675 }
5681 }
5683 /* Parse a nested-name-specifier. See
5684 cp_parser_nested_name_specifier_opt for details. This function
5685 behaves identically, except that it will an issue an error if no
5686 nested-name-specifier is present. */
5688 static tree
5694 {
5695 tree scope;
5697 /* Look for the nested-name-specifier. */
5699 typename_keyword_p,
5700 check_dependency_p,
5701 type_p,
5702 is_declaration);
5703 /* If it was not present, issue an error message. */
5705 {
5708 }
5711 }
5713 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5714 this is either a class-name or a namespace-name (which corresponds
5715 to the class-or-namespace-name production in the grammar). For
5716 C++0x, it can also be a type-name that refers to an enumeration
5717 type or a simple-template-id.
5719 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5720 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5721 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5722 TYPE_P is TRUE iff the next name should be taken as a class-name,
5723 even the same name is declared to be another entity in the same
5724 scope.
5726 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5727 specified by the class-or-namespace-name. If neither is found the
5728 ERROR_MARK_NODE is returned. */
5730 static tree
5737 {
5738 tree saved_scope;
5739 tree saved_qualifying_scope;
5740 tree saved_object_scope;
5741 tree scope;
5745 /* DR 743: decltype can appear in a nested-name-specifier. */
5747 {
5751 {
5754 }
5758 }
5760 /* Before we try to parse the class-name, we must save away the
5761 current PARSER->SCOPE since cp_parser_class_name will destroy
5762 it. */
5766 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5767 there is no need to look for a namespace-name. */
5768 only_class_p = template_keyword_p
5773 typename_keyword_p,
5774 template_keyword_p,
5776 check_dependency_p,
5778 is_declaration);
5780 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5784 {
5785 /* Restore the saved scope. */
5790 /* Parse tentatively. */
5793 /* Parse a type-name */
5796 /* "If the name found does not designate a namespace or a class,
5797 enumeration, or dependent type, the program is ill-formed."
5799 We cover classes and dependent types above and namespaces below,
5800 so this code is only looking for enums. */
5806 }
5807 /* If that didn't work, try for a namespace-name. */
5809 {
5810 /* Restore the saved scope. */
5814 /* If we are not looking at an identifier followed by the scope
5815 resolution operator, then this is not part of a
5816 nested-name-specifier. (Note that this function is only used
5817 to parse the components of a nested-name-specifier.) */
5822 }
5825 }
5827 /* Return true if we are looking at a compound-literal, false otherwise. */
5829 static bool
5831 {
5832 /* Consume the `('. */
5837 /* Skip tokens until the next token is a closing parenthesis.
5838 If we find the closing `)', and the next token is a `{', then
5839 we are looking at a compound-literal. */
5840 bool compound_literal_p
5845 /* Roll back the tokens we skipped. */
5849 }
5851 /* Parse a postfix-expression.
5853 postfix-expression:
5854 primary-expression
5855 postfix-expression [ expression ]
5856 postfix-expression ( expression-list [opt] )
5857 simple-type-specifier ( expression-list [opt] )
5858 typename :: [opt] nested-name-specifier identifier
5859 ( expression-list [opt] )
5860 typename :: [opt] nested-name-specifier template [opt] template-id
5861 ( expression-list [opt] )
5862 postfix-expression . template [opt] id-expression
5863 postfix-expression -> template [opt] id-expression
5864 postfix-expression . pseudo-destructor-name
5865 postfix-expression -> pseudo-destructor-name
5866 postfix-expression ++
5867 postfix-expression --
5868 dynamic_cast < type-id > ( expression )
5869 static_cast < type-id > ( expression )
5870 reinterpret_cast < type-id > ( expression )
5871 const_cast < type-id > ( expression )
5872 typeid ( expression )
5873 typeid ( type-id )
5875 GNU Extension:
5877 postfix-expression:
5878 ( type-id ) { initializer-list , [opt] }
5880 This extension is a GNU version of the C99 compound-literal
5881 construct. (The C99 grammar uses `type-name' instead of `type-id',
5882 but they are essentially the same concept.)
5884 If ADDRESS_P is true, the postfix expression is the operand of the
5885 `&' operator. CAST_P is true if this expression is the target of a
5886 cast.
5888 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5889 class member access expressions [expr.ref].
5891 Returns a representation of the expression. */
5893 static tree
5897 {
5899 location_t loc;
5906 /* Peek at the next token. */
5909 /* Some of the productions are determined by keywords. */
5912 {
5917 {
5918 tree type;
5919 tree expression;
5923 /* All of these can be handled in the same way from the point
5924 of view of parsing. Begin by consuming the token
5925 identifying the cast. */
5928 /* New types cannot be defined in the cast. */
5930 parser->type_definition_forbidden_message
5933 /* Look for the opening `<'. */
5935 /* Parse the type to which we are casting. */
5940 /* Look for the closing `>'. */
5942 /* Restore the old message. */
5945 bool saved_greater_than_is_operator_p
5949 /* And the expression which is being cast. */
5954 parser->greater_than_is_operator_p
5957 /* Only type conversions to integral or enumeration types
5958 can be used in constant-expressions. */
5964 {
5966 postfix_expression
5970 postfix_expression
5974 postfix_expression
5976 tf_warning_or_error);
5979 postfix_expression
5984 }
5985 }
5989 {
5990 tree type;
5994 /* Consume the `typeid' token. */
5996 /* Look for the `(' token. */
5998 /* Types cannot be defined in a `typeid' expression. */
6000 parser->type_definition_forbidden_message
6002 /* We can't be sure yet whether we're looking at a type-id or an
6003 expression. */
6005 /* Try a type-id first. */
6010 /* Look for the `)' token. Otherwise, we can't be sure that
6011 we're not looking at an expression: consider `typeid (int
6012 (3))', for example. */
6014 /* If all went well, simply lookup the type-id. */
6017 /* Otherwise, fall back to the expression variant. */
6018 else
6019 {
6020 tree expression;
6022 /* Look for an expression. */
6024 /* Compute its typeid. */
6026 /* Look for the `)' token. */
6028 }
6029 /* Restore the saved message. */
6031 /* `typeid' may not appear in an integral constant expression. */
6034 }
6038 {
6039 tree type;
6040 /* The syntax permitted here is the same permitted for an
6041 elaborated-type-specifier. */
6048 }
6052 {
6056 {
6061 }
6063 {
6068 }
6069 else
6070 {
6071 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6074 }
6076 postfix_expression =
6080 {
6084 }
6086 {
6091 }
6092 else
6093 {
6095 postfix_expression);
6099 }
6101 }
6104 {
6107 tree p;
6121 tf_warning_or_error);
6124 tf_warning_or_error);
6125 else
6126 {
6130 }
6132 }
6135 {
6136 tree type;
6138 /* If the next thing is a simple-type-specifier, we may be
6139 looking at a functional cast. We could also be looking at
6140 an id-expression. So, we try the functional cast, and if
6141 that doesn't work we fall back to the primary-expression. */
6143 /* Look for the simple-type-specifier. */
6147 CP_PARSER_FLAGS_NONE);
6149 /* Parse the cast itself. */
6151 postfix_expression
6153 /* If that worked, we're done. */
6157 /* If the functional-cast didn't work out, try a
6158 compound-literal. */
6161 {
6166 /* Avoid calling cp_parser_type_id pointlessly, see comment
6167 in cp_parser_cast_expression about c++/29234. */
6170 else
6171 {
6172 /* Parse the type. */
6177 /* Look for the `)'. */
6179 }
6181 /* If things aren't going well, there's no need to
6182 keep going. */
6184 {
6186 /* Parse the brace-enclosed initializer list. */
6189 }
6190 /* If that worked, we're definitely looking at a
6191 compound-literal expression. */
6193 {
6194 /* Warn the user that a compound literal is not
6195 allowed in standard C++. */
6198 /* For simplicity, we disallow compound literals in
6199 constant-expressions. We could
6200 allow compound literals of integer type, whose
6201 initializer was a constant, in constant
6202 expressions. Permitting that usage, as a further
6203 extension, would not change the meaning of any
6204 currently accepted programs. (Of course, as
6205 compound literals are not part of ISO C++, the
6206 standard has nothing to say.) */
6208 NIC_NCC))
6209 {
6212 }
6213 /* Form the representation of the compound-literal. */
6214 postfix_expression
6216 tf_warning_or_error);
6218 }
6219 }
6221 /* It must be a primary-expression. */
6222 postfix_expression
6225 decltype_p,
6227 }
6229 }
6231 /* Note that we don't need to worry about calling build_cplus_new on a
6232 class-valued CALL_EXPR in decltype when it isn't the end of the
6233 postfix-expression; unary_complex_lvalue will take care of that for
6234 all these cases. */
6236 /* Keep looping until the postfix-expression is complete. */
6238 {
6242 /* It is not a Koenig lookup function call. */
6243 postfix_expression
6246 /* Peek at the next token. */
6250 {
6253 {
6255 "two consecutive %<[%> shall "
6258 }
6259 postfix_expression
6261 postfix_expression,
6263 decltype_p);
6269 /* postfix-expression ( expression-list [opt] ) */
6270 {
6280 is_builtin_constant_p
6283 {
6284 /* The whole point of __builtin_constant_p is to allow
6285 non-constant expressions to appear as arguments. */
6286 saved_integral_constant_expression_p
6288 saved_non_integral_constant_expression_p
6291 }
6292 args = (cp_parser_parenthesized_expression_list
6298 {
6299 parser->integral_constant_expression_p
6301 parser->non_integral_constant_expression_p
6303 }
6306 {
6309 }
6311 /* Function calls are not permitted in
6312 constant-expressions. */
6315 NIC_FUNC_CALL))
6316 {
6320 }
6325 {
6327 {
6329 {
6332 postfix_expression
6334 complain);
6335 }
6336 else
6337 postfix_expression
6339 }
6340 /* We do not perform argument-dependent lookup if
6341 normal lookup finds a non-function, in accordance
6342 with the expected resolution of DR 218. */
6345 {
6349 /* Do not do argument dependent lookup if regular
6350 lookup finds a member function or a block-scope
6351 function declaration. [basic.lookup.argdep]/3 */
6354 {
6357 postfix_expression
6359 complain);
6360 }
6361 }
6362 }
6365 {
6375 "%<memset%> used with constant zero length "
6376 "parameter; this could be due to transposed "
6379 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6380 to avoid leaking those into folder and middle-end. */
6382 tree arg;
6386 }
6389 {
6399 {
6400 postfix_expression
6404 }
6407 {
6408 postfix_expression
6409 = (build_new_method_call
6415 complain));
6416 }
6417 else
6418 postfix_expression
6422 complain);
6423 }
6427 postfix_expression = (build_offset_ref_call_from_tree
6429 complain));
6431 /* A call to a static class member, or a namespace-scope
6432 function. */
6433 postfix_expression
6436 koenig_p,
6437 complain);
6438 else
6439 /* All other function calls. */
6440 postfix_expression
6443 koenig_p,
6444 complain);
6448 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6452 }
6457 /* postfix-expression . template [opt] id-expression
6458 postfix-expression . pseudo-destructor-name
6459 postfix-expression -> template [opt] id-expression
6460 postfix-expression -> pseudo-destructor-name */
6462 /* Consume the `.' or `->' operator. */
6465 postfix_expression
6467 postfix_expression,
6474 /* postfix-expression ++ */
6475 /* Consume the `++' token. */
6477 /* Generate a representation for the complete expression. */
6478 postfix_expression
6480 POSTINCREMENT_EXPR);
6481 /* Increments may not appear in constant-expressions. */
6489 /* postfix-expression -- */
6490 /* Consume the `--' token. */
6492 /* Generate a representation for the complete expression. */
6493 postfix_expression
6495 POSTDECREMENT_EXPR);
6496 /* Decrements may not appear in constant-expressions. */
6508 else
6510 }
6511 }
6513 /* We should never get here. */
6516 }
6518 /* This function parses Cilk Plus array notations. If a normal array expr. is
6519 parsed then the array index is passed back to the caller through *INIT_INDEX
6520 and the function returns a NULL_TREE. If array notation expr. is parsed,
6521 then *INIT_INDEX is ignored by the caller and the function returns
6522 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6523 error_mark_node. */
6525 static tree
6527 tree array_value)
6528 {
6532 {
6535 }
6544 {
6547 }
6549 {
6550 /* Consume the ':'. */
6553 /* If we are here, then we have a case like this A[:]. */
6555 {
6559 }
6563 }
6564 else
6565 {
6566 /* If we are here, then there are three valid possibilities:
6567 1. ARRAY [ EXP ]
6568 2. ARRAY [ EXP : EXP ]
6569 3. ARRAY [ EXP : EXP : EXP ] */
6573 {
6574 /* This indicates that we have a normal array expression. */
6577 }
6579 /* Consume the ':'. */
6583 {
6586 }
6587 }
6592 {
6596 }
6602 }
6604 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6605 by cp_parser_builtin_offsetof. We're looking for
6607 postfix-expression [ expression ]
6608 postfix-expression [ braced-init-list ] (C++11)
6610 FOR_OFFSETOF is set if we're being called in that context, which
6611 changes how we deal with integer constant expressions. */
6613 static tree
6615 tree postfix_expression,
6618 {
6623 /* Consume the `[' token. */
6629 /* Parse the index expression. */
6630 /* ??? For offsetof, there is a question of what to allow here. If
6631 offsetof is not being used in an integral constant expression context,
6632 then we *could* get the right answer by computing the value at runtime.
6633 If we are in an integral constant expression context, then we might
6634 could accept any constant expression; hard to say without analysis.
6635 Rather than open the barn door too wide right away, allow only integer
6636 constant expressions here. */
6639 else
6640 {
6642 {
6649 {
6651 "braced list index is not allowed with array "
6655 }
6656 }
6658 {
6659 /* Here are have these two options:
6660 ARRAY[EXP : EXP] - Array notation expr with default
6661 stride of 1.
6662 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6663 stride. */
6665 postfix_expression);
6668 }
6669 else
6671 }
6675 /* Look for the closing `]'. */
6678 /* Build the ARRAY_REF. */
6682 /* When not doing offsetof, array references are not permitted in
6683 constant-expressions. */
6689 }
6691 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6692 by cp_parser_builtin_offsetof. We're looking for
6694 postfix-expression . template [opt] id-expression
6695 postfix-expression . pseudo-destructor-name
6696 postfix-expression -> template [opt] id-expression
6697 postfix-expression -> pseudo-destructor-name
6699 FOR_OFFSETOF is set if we're being called in that context. That sorta
6700 limits what of the above we'll actually accept, but nevermind.
6701 TOKEN_TYPE is the "." or "->" token, which will already have been
6702 removed from the stream. */
6704 static tree
6707 tree postfix_expression,
6709 location_t location)
6710 {
6711 tree name;
6716 /* If this is a `->' operator, dereference the pointer. */
6719 tf_warning_or_error);
6720 /* Check to see whether or not the expression is type-dependent. */
6722 /* The identifier following the `->' or `.' is not qualified. */
6728 /* Enter the scope corresponding to the type of the object
6729 given by the POSTFIX_EXPRESSION. */
6731 {
6733 /* According to the standard, no expression should ever have
6734 reference type. Unfortunately, we do not currently match
6735 the standard in this respect in that our internal representation
6736 of an expression may have reference type even when the standard
6737 says it does not. Therefore, we have to manually obtain the
6738 underlying type here. */
6740 /* The type of the POSTFIX_EXPRESSION must be complete. */
6742 {
6744 postfix_expression);
6746 }
6747 /* Unlike the object expression in other contexts, *this is not
6748 required to be of complete type for purposes of class member
6749 access (5.2.5) outside the member function body. */
6753 /* Let the name lookup machinery know that we are processing a
6754 class member access expression. */
6756 /* If something went wrong, we want to be able to discern that case,
6757 as opposed to the case where there was no SCOPE due to the type
6758 of expression being dependent. */
6761 /* If the SCOPE was erroneous, make the various semantic analysis
6762 functions exit quickly -- and without issuing additional error
6763 messages. */
6766 }
6768 /* Assume this expression is not a pseudo-destructor access. */
6771 /* If the SCOPE is a scalar type, then, if this is a valid program,
6772 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6773 is type dependent, it can be pseudo-destructor-name or something else.
6774 Try to parse it as pseudo-destructor-name first. */
6776 {
6777 tree s;
6778 tree type;
6781 /* Parse the pseudo-destructor-name. */
6790 {
6792 postfix_expression
6795 }
6796 }
6799 {
6800 /* If the SCOPE is not a scalar type, we are looking at an
6801 ordinary class member access expression, rather than a
6802 pseudo-destructor-name. */
6805 /* Parse the id-expression. */
6806 name = (cp_parser_id_expression
6813 /* In general, build a SCOPE_REF if the member name is qualified.
6814 However, if the name was not dependent and has already been
6815 resolved; there is no need to build the SCOPE_REF. For example;
6817 struct X { void f(); };
6818 template <typename T> void f(T* t) { t->X::f(); }
6820 Even though "t" is dependent, "X::f" is not and has been resolved
6821 to a BASELINK; there is no need to include scope information. */
6823 /* But we do need to remember that there was an explicit scope for
6824 virtual function calls. */
6828 /* If the name is a template-id that names a type, we will get a
6829 TYPE_DECL here. That is invalid code. */
6831 {
6834 }
6835 else
6836 {
6838 {
6840 {
6844 }
6845 else
6848 name,
6849 template_p);
6853 }
6855 adjust_result_of_qualified_name_lookup
6857 postfix_expression
6859 template_p,
6860 tf_warning_or_error);
6861 }
6862 }
6864 /* We no longer need to look up names in the scope of the object on
6865 the left-hand side of the `.' or `->' operator. */
6868 /* Outside of offsetof, these operators may not appear in
6869 constant-expressions. */
6871 && (cp_parser_non_integral_constant_expression
6876 }
6878 /* Cache of LITERAL_ZERO_P constants. */
6882 /* Parse a parenthesized expression-list.
6884 expression-list:
6885 assignment-expression
6886 expression-list, assignment-expression
6888 attribute-list:
6889 expression-list
6890 identifier
6891 identifier, expression-list
6893 CAST_P is true if this expression is the target of a cast.
6895 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6896 argument pack.
6898 Returns a vector of trees. Each element is a representation of an
6899 assignment-expression. NULL is returned if the ( and or ) are
6900 missing. An empty, but allocated, vector is returned on no
6901 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6902 if we are parsing an attribute list for an attribute that wants a
6903 plain identifier argument, normal_attr for an attribute that wants
6904 an expression, or non_attr if we aren't parsing an attribute list. If
6905 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6906 not all of the expressions in the list were constant.
6907 WANT_LITERAL_ZERO_P is true if the caller is interested in
6908 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6909 immediately, this can be removed. */
6918 {
6924 /* Assume all the expressions will be constant. */
6933 /* Within a parenthesized expression, a `>' token is always
6934 the greater-than operator. */
6935 saved_greater_than_is_operator_p
6939 /* Consume expressions until there are no more. */
6942 {
6943 tree expr;
6945 /* At the beginning of attribute lists, check to see if the
6946 next token is an identifier. */
6949 {
6952 /* Consume the identifier. */
6954 /* Save the identifier. */
6956 }
6957 else
6958 {
6961 /* Parse the next assignment-expression. */
6963 {
6964 /* A braced-init-list. */
6970 }
6972 {
6973 expr = (cp_parser_constant_expression
6978 }
6979 else
6980 {
6984 {
6990 /* If a parameter is literal zero alone, remember it
6991 for -Wmemset-transposed-args warning. */
6994 && want_literal_zero_p
6996 == CPP_COMMA
6999 {
7006 else
7007 {
7012 }
7013 /* Consume the 0 token (or '\0', 0LL etc.). */
7015 }
7019 }
7022 cast_p);
7023 }
7028 /* If we have an ellipsis, then this is an expression
7029 expansion. */
7032 {
7033 /* Consume the `...'. */
7036 /* Build the argument pack. */
7038 }
7040 /* Add it to the list. We add error_mark_node
7041 expressions to the list, so that we can still tell if
7042 the correct form for a parenthesized expression-list
7043 is found. That gives better errors. */
7048 }
7050 /* After the first item, attribute lists look the same as
7051 expression lists. */
7054 get_comma:;
7055 /* If the next token isn't a `,', then we are done. */
7059 /* Otherwise, consume the `,' and keep going. */
7061 }
7064 {
7067 skip_comma:;
7068 /* We try and resync to an unnested comma, as that will give the
7069 user better diagnostics. */
7077 {
7078 parser->greater_than_is_operator_p
7081 }
7082 }
7084 parser->greater_than_is_operator_p
7091 }
7093 /* Parse a pseudo-destructor-name.
7095 pseudo-destructor-name:
7096 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7097 :: [opt] nested-name-specifier template template-id :: ~ type-name
7098 :: [opt] nested-name-specifier [opt] ~ type-name
7100 If either of the first two productions is used, sets *SCOPE to the
7101 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7102 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7103 or ERROR_MARK_NODE if the parse fails. */
7105 static void
7107 tree object,
7110 {
7113 /* Handle ~auto. */
7117 {
7120 "%<~auto%> only available with "
7127 }
7129 /* Assume that things will not work out. */
7132 /* Look for the optional `::' operator. */
7134 /* Look for the optional nested-name-specifier. */
7135 nested_name_specifier_p
7142 /* Now, if we saw a nested-name-specifier, we might be doing the
7143 second production. */
7146 {
7147 /* Consume the `template' keyword. */
7149 /* Parse the template-id. */
7153 class_type,
7155 /* Look for the `::' token. */
7157 }
7158 /* If the next token is not a `~', then there might be some
7159 additional qualification. */
7161 {
7162 /* At this point, we're looking for "type-name :: ~". The type-name
7163 must not be a class-name, since this is a pseudo-destructor. So,
7164 it must be either an enum-name, or a typedef-name -- both of which
7165 are just identifiers. So, we peek ahead to check that the "::"
7166 and "~" tokens are present; if they are not, then we can avoid
7167 calling type_name. */
7171 {
7174 }
7176 /* Look for the type-name. */
7181 /* Look for the `::' token. */
7183 }
7184 else
7187 /* Look for the `~'. */
7190 /* Once we see the ~, this has to be a pseudo-destructor. */
7194 /* Look for the type-name again. We are not responsible for
7195 checking that it matches the first type-name. */
7197 }
7199 /* Parse a unary-expression.
7201 unary-expression:
7202 postfix-expression
7203 ++ cast-expression
7204 -- cast-expression
7205 unary-operator cast-expression
7206 sizeof unary-expression
7207 sizeof ( type-id )
7208 alignof ( type-id ) [C++0x]
7209 new-expression
7210 delete-expression
7212 GNU Extensions:
7214 unary-expression:
7215 __extension__ cast-expression
7216 __alignof__ unary-expression
7217 __alignof__ ( type-id )
7218 alignof unary-expression [C++0x]
7219 __real__ cast-expression
7220 __imag__ cast-expression
7221 && identifier
7222 sizeof ( type-id ) { initializer-list , [opt] }
7223 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7224 __alignof__ ( type-id ) { initializer-list , [opt] }
7226 ADDRESS_P is true iff the unary-expression is appearing as the
7227 operand of the `&' operator. CAST_P is true if this expression is
7228 the target of a cast.
7230 Returns a representation of the expression. */
7232 static tree
7235 {
7239 /* Peek at the next token. */
7241 /* Some keywords give away the kind of expression. */
7243 {
7247 {
7250 {
7253 location_t first_loc;
7256 /* Consume the token. */
7259 /* Parse the operand. */
7264 else
7265 {
7266 /* ISO C++ defines alignof only with types, not with
7267 expressions. So pedwarn if alignof is used with a non-
7268 type expression. However, __alignof__ is ok. */
7271 "ISO C++ does not allow %<alignof%> "
7275 }
7276 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7277 SIZEOF_EXPR with the original operand. */
7279 {
7281 {
7283 {
7286 error_mark_node));
7288 }
7289 else
7293 }
7295 }
7297 }
7306 {
7307 /* The saved value of the PEDANTIC flag. */
7309 tree expr;
7311 /* Save away the PEDANTIC flag. */
7313 /* Parse the cast-expression. */
7315 /* Restore the PEDANTIC flag. */
7319 }
7323 {
7324 tree expression;
7326 /* Consume the `__real__' or `__imag__' token. */
7328 /* Parse the cast-expression. */
7330 /* Create the complete representation. */
7334 expression,
7335 tf_warning_or_error);
7336 }
7344 {
7345 tree expr;
7355 parser->type_definition_forbidden_message
7358 saved_integral_constant_expression_p
7360 saved_non_integral_constant_expression_p
7364 saved_greater_than_is_operator_p
7376 parser->greater_than_is_operator_p
7379 parser->integral_constant_expression_p
7381 parser->non_integral_constant_expression_p
7388 }
7392 }
7393 }
7395 /* Look for the `:: new' and `:: delete', which also signal the
7396 beginning of a new-expression, or delete-expression,
7397 respectively. If the next token is `::', then it might be one of
7398 these. */
7400 {
7403 /* See if the token after the `::' is one of the keywords in
7404 which we're interested. */
7406 /* If it's `new', we have a new-expression. */
7409 /* Similarly, for `delete'. */
7412 }
7414 /* Look for a unary operator. */
7416 /* The `++' and `--' operators can be handled similarly, even though
7417 they are not technically unary-operators in the grammar. */
7419 {
7424 /* Handle the GNU address-of-label extension. */
7427 {
7428 tree identifier;
7429 tree expression;
7432 /* Consume the '&&' token. */
7434 /* Look for the identifier. */
7436 /* Create an expression representing the address. */
7439 NIC_ADDR_LABEL))
7442 }
7443 }
7445 {
7446 tree cast_expression;
7452 /* Consume the operator token. */
7454 /* Parse the cast-expression. */
7455 cast_expression
7460 pidk);
7461 /* Now, build an appropriate representation. */
7463 {
7467 RO_UNARY_STAR,
7468 complain);
7473 /* Fall through. */
7476 cast_expression,
7477 complain);
7484 /* Fall through. */
7494 }
7498 non_constant_p))
7502 }
7506 decltype_p,
7507 pidk);
7508 }
7510 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7511 unary-operator, the corresponding tree code is returned. */
7513 static enum tree_code
7515 {
7517 {
7538 }
7539 }
7541 /* Parse a new-expression.
7543 new-expression:
7544 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7545 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7547 Returns a representation of the expression. */
7549 static tree
7551 {
7554 tree type;
7557 tree ret;
7559 /* Look for the optional `::' operator. */
7560 global_scope_p
7564 /* Look for the `new' operator. */
7566 /* There's no easy way to tell a new-placement from the
7567 `( type-id )' construct. */
7569 /* Look for a new-placement. */
7571 /* If that didn't work out, there's no new-placement. */
7573 {
7577 }
7579 /* If the next token is a `(', then we have a parenthesized
7580 type-id. */
7582 {
7586 /* Consume the `('. */
7589 /* Parse the type-id. */
7590 parser->type_definition_forbidden_message
7595 /* Look for the closing `)'. */
7598 /* There should not be a direct-new-declarator in this production,
7599 but GCC used to allowed this, so we check and emit a sensible error
7600 message for this case. */
7602 {
7608 }
7609 }
7610 /* Otherwise, there must be a new-type-id. */
7611 else
7614 /* If the next token is a `(' or '{', then we have a new-initializer. */
7618 else
7621 /* A new-expression may not appear in an integral constant
7622 expression. */
7625 else
7626 {
7627 /* Create a representation of the new-expression. */
7629 tf_warning_or_error);
7630 }
7638 }
7640 /* Parse a new-placement.
7642 new-placement:
7643 ( expression-list )
7645 Returns the same representation as for an expression-list. */
7649 {
7652 /* Parse the expression-list. */
7653 expression_list = (cp_parser_parenthesized_expression_list
7659 }
7661 /* Parse a new-type-id.
7663 new-type-id:
7664 type-specifier-seq new-declarator [opt]
7666 Returns the TYPE allocated. If the new-type-id indicates an array
7667 type, *NELTS is set to the number of elements in the last array
7668 bound; the TYPE will not include the last array bound. */
7670 static tree
7672 {
7673 cp_decl_specifier_seq type_specifier_seq;
7679 /* The type-specifier sequence must not contain type definitions.
7680 (It cannot contain declarations of new types either, but if they
7681 are not definitions we will catch that because they are not
7682 complete.) */
7684 parser->type_definition_forbidden_message
7686 /* Parse the type-specifier-seq. */
7690 /* Restore the old message. */
7696 /* Parse the new-declarator. */
7699 /* Determine the number of elements in the last array dimension, if
7700 any. */
7702 /* Skip down to the last array dimension. */
7707 {
7710 }
7715 {
7718 }
7721 {
7728 else
7730 }
7733 }
7735 /* Parse an (optional) new-declarator.
7737 new-declarator:
7738 ptr-operator new-declarator [opt]
7739 direct-new-declarator
7741 Returns the declarator. */
7745 {
7748 cp_cv_quals cv_quals;
7750 /* We don't know if there's a ptr-operator next, or not. */
7752 /* Look for a ptr-operator. */
7754 /* If that worked, look for more new-declarators. */
7756 {
7759 /* Parse another optional declarator. */
7762 declarator = cp_parser_make_indirect_declarator
7766 }
7768 /* If the next token is a `[', there is a direct-new-declarator. */
7773 }
7775 /* Parse a direct-new-declarator.
7777 direct-new-declarator:
7778 [ expression ]
7779 direct-new-declarator [constant-expression]
7781 */
7785 {
7789 {
7790 tree expression;
7793 /* Look for the opening `['. */
7798 /* The standard requires that the expression have integral
7799 type. DR 74 adds enumeration types. We believe that the
7800 real intent is that these expressions be handled like the
7801 expression in a `switch' condition, which also allows
7802 classes with a single conversion to integral or
7803 enumeration type. */
7805 {
7806 expression
7808 expression,
7811 {
7813 "expression in new-declarator must have integral "
7816 }
7817 }
7819 /* Look for the closing `]'. */
7822 /* Add this bound to the declarator. */
7825 /* If the next token is not a `[', then there are no more
7826 bounds. */
7829 }
7832 }
7834 /* Parse a new-initializer.
7836 new-initializer:
7837 ( expression-list [opt] )
7838 braced-init-list
7840 Returns a representation of the expression-list. */
7844 {
7848 {
7849 tree t;
7856 }
7857 else
7858 expression_list = (cp_parser_parenthesized_expression_list
7864 }
7866 /* Parse a delete-expression.
7868 delete-expression:
7869 :: [opt] delete cast-expression
7870 :: [opt] delete [ ] cast-expression
7872 Returns a representation of the expression. */
7874 static tree
7876 {
7879 tree expression;
7881 /* Look for the optional `::' operator. */
7882 global_scope_p
7886 /* Look for the `delete' keyword. */
7888 /* See if the array syntax is in use. */
7890 {
7891 /* Consume the `[' token. */
7893 /* Look for the `]' token. */
7895 /* Remember that this is the `[]' construct. */
7897 }
7898 else
7901 /* Parse the cast-expression. */
7904 /* A delete-expression may not appear in an integral constant
7905 expression. */
7910 tf_warning_or_error);
7911 }
7913 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7914 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7915 0 otherwise. */
7917 static int
7919 {
7922 {
7964 /* In ((type ()) () the last () isn't a valid cast-expression,
7965 so the whole must be parsed as postfix-expression. */
7970 /* '[' may start a primary-expression in obj-c++ and in C++11,
7971 as a lambda-expression, eg, '(void)[]{}'. */
7978 /* '++' and '--' may or may not start a cast-expression:
7980 struct T { void operator++(int); };
7981 void f() { (T())++; }
7983 vs
7985 int a;
7986 (int)++a; */
7991 }
7992 }
7994 /* Parse a cast-expression.
7996 cast-expression:
7997 unary-expression
7998 ( type-id ) cast-expression
8000 ADDRESS_P is true iff the unary-expression is appearing as the
8001 operand of the `&' operator. CAST_P is true if this expression is
8002 the target of a cast.
8004 Returns a representation of the expression. */
8006 static tree
8009 {
8010 /* If it's a `(', then we might be looking at a cast. */
8012 {
8018 /* There's no way to know yet whether or not this is a cast.
8019 For example, `(int (3))' is a unary-expression, while `(int)
8020 3' is a cast. So, we resort to parsing tentatively. */
8022 /* Types may not be defined in a cast. */
8024 parser->type_definition_forbidden_message
8026 /* Consume the `('. */
8028 /* A very tricky bit is that `(struct S) { 3 }' is a
8029 compound-literal (which we permit in C++ as an extension).
8030 But, that construct is not a cast-expression -- it is a
8031 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8032 is legal; if the compound-literal were a cast-expression,
8033 you'd need an extra set of parentheses.) But, if we parse
8034 the type-id, and it happens to be a class-specifier, then we
8035 will commit to the parse at that point, because we cannot
8036 undo the action that is done when creating a new class. So,
8037 then we cannot back up and do a postfix-expression.
8039 Another tricky case is the following (c++/29234):
8041 struct S { void operator () (); };
8043 void foo ()
8044 {
8045 ( S()() );
8046 }
8048 As a type-id we parse the parenthesized S()() as a function
8049 returning a function, groktypename complains and we cannot
8050 back up in this case either.
8052 Therefore, we scan ahead to the closing `)', and check to see
8053 if the tokens after the `)' can start a cast-expression. Otherwise
8054 we are dealing with an unary-expression, a postfix-expression
8055 or something else.
8057 Yet another tricky case, in C++11, is the following (c++/54891):
8059 (void)[]{};
8061 The issue is that usually, besides the case of lambda-expressions,
8062 the parenthesized type-id cannot be followed by '[', and, eg, we
8063 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8064 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8065 we don't commit, we try a cast-expression, then an unary-expression.
8067 Save tokens so that we can put them back. */
8070 /* We may be looking at a cast-expression. */
8073 cast_expression
8076 /* Roll back the tokens we skipped. */
8078 /* If we aren't looking at a cast-expression, simulate an error so
8079 that the call to cp_parser_error_occurred below returns true. */
8082 else
8083 {
8086 /* Look for the type-id. */
8088 /* Look for the closing `)'. */
8091 }
8093 /* Restore the saved message. */
8096 /* At this point this can only be either a cast or a
8097 parenthesized ctor such as `(T ())' that looks like a cast to
8098 function returning T. */
8100 {
8101 /* Only commit if the cast-expression doesn't start with
8102 '++', '--', or '[' in C++11. */
8110 pidk);
8113 {
8114 /* Warn about old-style casts, if so requested. */
8121 /* Only type conversions to integral or enumeration types
8122 can be used in constant-expressions. */
8125 NIC_CAST))
8128 /* Perform the cast. */
8131 }
8132 }
8133 else
8135 }
8137 /* If we get here, then it's not a cast, so it must be a
8138 unary-expression. */
8141 }
8143 /* Parse a binary expression of the general form:
8145 pm-expression:
8146 cast-expression
8147 pm-expression .* cast-expression
8148 pm-expression ->* cast-expression
8150 multiplicative-expression:
8151 pm-expression
8152 multiplicative-expression * pm-expression
8153 multiplicative-expression / pm-expression
8154 multiplicative-expression % pm-expression
8156 additive-expression:
8157 multiplicative-expression
8158 additive-expression + multiplicative-expression
8159 additive-expression - multiplicative-expression
8161 shift-expression:
8162 additive-expression
8163 shift-expression << additive-expression
8164 shift-expression >> additive-expression
8166 relational-expression:
8167 shift-expression
8168 relational-expression < shift-expression
8169 relational-expression > shift-expression
8170 relational-expression <= shift-expression
8171 relational-expression >= shift-expression
8173 GNU Extension:
8175 relational-expression:
8176 relational-expression <? shift-expression
8177 relational-expression >? shift-expression
8179 equality-expression:
8180 relational-expression
8181 equality-expression == relational-expression
8182 equality-expression != relational-expression
8184 and-expression:
8185 equality-expression
8186 and-expression & equality-expression
8188 exclusive-or-expression:
8189 and-expression
8190 exclusive-or-expression ^ and-expression
8192 inclusive-or-expression:
8193 exclusive-or-expression
8194 inclusive-or-expression | exclusive-or-expression
8196 logical-and-expression:
8197 inclusive-or-expression
8198 logical-and-expression && inclusive-or-expression
8200 logical-or-expression:
8201 logical-and-expression
8202 logical-or-expression || logical-and-expression
8204 All these are implemented with a single function like:
8206 binary-expression:
8207 simple-cast-expression
8208 binary-expression <token> binary-expression
8210 CAST_P is true if this expression is the target of a cast.
8212 The binops_by_token map is used to get the tree codes for each <token> type.
8213 binary-expressions are associated according to a precedence table. */
8215 #define TOKEN_PRECEDENCE(token) \
8216 (((token->type == CPP_GREATER \
8217 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8218 && !parser->greater_than_is_operator_p) \
8219 ? PREC_NOT_OPERATOR \
8220 : binops_by_token[token->type].prec)
8222 static tree
8228 {
8229 cp_parser_expression_stack stack;
8231 cp_parser_expression_stack_entry current;
8232 tree rhs;
8236 tree overload;
8238 /* Parse the first expression. */
8249 {
8250 /* Get an operator token. */
8256 {
8258 "%<>>%> operator is treated"
8262 }
8266 /* Popping an entry off the stack means we completed a subexpression:
8267 - either we found a token which is not an operator (`>' where it is not
8268 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8269 will happen repeatedly;
8270 - or, we found an operator which has lower priority. This is the case
8271 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8272 parsing `3 * 4'. */
8274 {
8277 else
8279 }
8281 get_rhs:
8285 /* We used the operator token. */
8288 /* For "false && x" or "true || x", x will never be executed;
8289 disable warnings while evaluating it. */
8295 /* Extract another operand. It may be the RHS of this expression
8296 or the LHS of a new, higher priority expression. */
8301 /* Get another operator token. Look up its precedence to avoid
8302 building a useless (immediately popped) stack entry for common
8303 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8307 {
8308 /* ... and prepare to parse the RHS of the new, higher priority
8309 expression. Since precedence levels on the stack are
8310 monotonically increasing, we do not have to care about
8311 stack overflows. */
8320 pop:
8322 /* If the stack is not empty, we have parsed into LHS the right side
8323 (`4' in the example above) of an expression we had suspended.
8324 We can use the information on the stack to recover the LHS (`3')
8325 from the stack together with the tree code (`MULT_EXPR'), and
8326 the precedence of the higher level subexpression
8327 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8328 which will be used to actually build the additive expression. */
8333 }
8335 /* Undo the disabling of warnings done above. */
8344 /* Avoid warning for !!x == y. */
8349 /* Avoid warning for !b == y where b is boolean. */
8353 /* Avoid warning for !!b == y where b is boolean. */
8361 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8362 ERROR_MARK for everything that is not a binary expression.
8363 This makes warn_about_parentheses miss some warnings that
8364 involve unary operators. For unary expressions we should
8365 pass the correct tree_code unless the unary expression was
8366 surrounded by parentheses.
8367 */
8373 == tcc_comparison
8376 else
8385 /* If the binary operator required the use of an overloaded operator,
8386 then this expression cannot be an integral constant-expression.
8387 An overloaded operator can be used even if both operands are
8388 otherwise permissible in an integral constant-expression if at
8389 least one of the operands is of enumeration type. */
8393 NIC_OVERLOADED))
8395 }
8398 }
8400 static tree
8405 {
8408 }
8410 /* Parse the `? expression : assignment-expression' part of a
8411 conditional-expression. The LOGICAL_OR_EXPR is the
8412 logical-or-expression that started the conditional-expression.
8413 Returns a representation of the entire conditional-expression.
8415 This routine is used by cp_parser_assignment_expression.
8417 ? expression : assignment-expression
8419 GNU Extensions:
8421 ? : assignment-expression */
8423 static tree
8425 {
8426 tree expr;
8427 tree assignment_expr;
8431 /* Consume the `?' token. */
8436 {
8439 /* Implicit true clause. */
8443 }
8444 else
8445 {
8448 /* Parse the expression. */
8451 c_inhibit_evaluation_warnings +=
8455 }
8457 /* The next token should be a `:'. */
8459 /* Parse the assignment-expression. */
8463 /* Build the conditional-expression. */
8465 expr,
8466 assignment_expr,
8467 tf_warning_or_error);
8468 }
8470 /* Parse an assignment-expression.
8472 assignment-expression:
8473 conditional-expression
8474 logical-or-expression assignment-operator assignment_expression
8475 throw-expression
8477 CAST_P is true if this expression is the target of a cast.
8478 DECLTYPE_P is true if this expression is the operand of decltype.
8480 Returns a representation for the expression. */
8482 static tree
8485 {
8486 tree expr;
8488 /* If the next token is the `throw' keyword, then we're looking at
8489 a throw-expression. */
8492 /* Otherwise, it must be that we are looking at a
8493 logical-or-expression. */
8494 else
8495 {
8496 /* Parse the binary expressions (logical-or-expression). */
8498 decltype_p,
8500 /* If the next token is a `?' then we're actually looking at a
8501 conditional-expression. */
8504 else
8505 {
8508 /* If it's an assignment-operator, we're using the second
8509 production. */
8510 enum tree_code assignment_operator
8513 {
8515 location_t saved_input_location;
8517 /* Parse the right-hand side of the assignment. */
8523 /* An assignment may not appear in a
8524 constant-expression. */
8526 NIC_ASSIGNMENT))
8528 /* Build the assignment expression. Its default
8529 location is the location of the '=' token. */
8533 assignment_operator,
8534 rhs,
8537 }
8538 }
8539 }
8542 }
8544 /* Parse an (optional) assignment-operator.
8546 assignment-operator: one of
8547 = *= /= %= += -= >>= <<= &= ^= |=
8549 GNU Extension:
8551 assignment-operator: one of
8552 <?= >?=
8554 If the next token is an assignment operator, the corresponding tree
8555 code is returned, and the token is consumed. For example, for
8556 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8557 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8558 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8559 operator, ERROR_MARK is returned. */
8561 static enum tree_code
8563 {
8567 /* Peek at the next token. */
8571 {
8617 /* Nothing else is an assignment operator. */
8619 }
8621 /* If it was an assignment operator, consume it. */
8626 }
8628 /* Parse an expression.
8630 expression:
8631 assignment-expression
8632 expression , assignment-expression
8634 CAST_P is true if this expression is the target of a cast.
8635 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8636 except possibly parenthesized or on the RHS of a comma (N3276).
8638 Returns a representation of the expression. */
8640 static tree
8643 {
8648 {
8649 tree assignment_expression;
8651 /* Parse the next assignment-expression. */
8652 assignment_expression
8655 /* We don't create a temporary for a call that is the immediate operand
8656 of decltype or on the RHS of a comma. But when we see a comma, we
8657 need to create a temporary for a call on the LHS. */
8662 assignment_expression
8666 /* If this is the first assignment-expression, we can just
8667 save it away. */
8670 else
8672 assignment_expression,
8674 /* If the next token is not a comma, then we are done with the
8675 expression. */
8678 /* Consume the `,'. */
8681 /* A comma operator cannot appear in a constant-expression. */
8684 }
8687 }
8689 /* Parse a constant-expression.
8691 constant-expression:
8692 conditional-expression
8694 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8695 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8696 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8697 is false, NON_CONSTANT_P should be NULL. */
8699 static tree
8703 {
8707 tree expression;
8709 /* It might seem that we could simply parse the
8710 conditional-expression, and then check to see if it were
8711 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8712 one that the compiler can figure out is constant, possibly after
8713 doing some simplifications or optimizations. The standard has a
8714 precise definition of constant-expression, and we must honor
8715 that, even though it is somewhat more restrictive.
8717 For example:
8719 int i[(2, 3)];
8721 is not a legal declaration, because `(2, 3)' is not a
8722 constant-expression. The `,' operator is forbidden in a
8723 constant-expression. However, GCC's constant-folding machinery
8724 will fold this operation to an INTEGER_CST for `3'. */
8726 /* Save the old settings. */
8728 saved_allow_non_integral_constant_expression_p
8731 /* We are now parsing a constant-expression. */
8733 parser->allow_non_integral_constant_expression_p
8736 /* Although the grammar says "conditional-expression", we parse an
8737 "assignment-expression", which also permits "throw-expression"
8738 and the use of assignment operators. In the case that
8739 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8740 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8741 actually essential that we look for an assignment-expression.
8742 For example, cp_parser_initializer_clauses uses this function to
8743 determine whether a particular assignment-expression is in fact
8744 constant. */
8746 /* Restore the old settings. */
8747 parser->integral_constant_expression_p
8749 parser->allow_non_integral_constant_expression_p
8752 {
8753 /* Require an rvalue constant expression here; that's what our
8754 callers expect. Reference constant expressions are handled
8755 separately in e.g. cp_parser_template_argument. */
8760 }
8763 parser->non_integral_constant_expression_p
8767 }
8769 /* Parse __builtin_offsetof.
8771 offsetof-expression:
8772 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8774 offsetof-member-designator:
8775 id-expression
8776 | offsetof-member-designator "." id-expression
8777 | offsetof-member-designator "[" expression "]"
8778 | offsetof-member-designator "->" id-expression */
8780 static tree
8782 {
8785 cp_id_kind dummy;
8788 /* We're about to accept non-integral-constant things, but will
8789 definitely yield an integral constant expression. Save and
8790 restore these values around our local parsing. */
8794 /* Consume the "__builtin_offsetof" token. */
8796 /* Consume the opening `('. */
8798 /* Parse the type-id. */
8801 /* Look for the `,'. */
8805 /* Build the (type *)null that begins the traditional offsetof macro. */
8807 tf_warning_or_error);
8809 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8813 {
8816 {
8818 /* offsetof-member-designator "[" expression "]" */
8824 /* offsetof-member-designator "->" identifier */
8827 /* FALLTHRU */
8830 /* offsetof-member-designator "." identifier */
8838 /* Consume the ")" token. */
8843 /* Error. We know the following require will fail, but
8844 that gives the proper error message. */
8849 }
8850 }
8852 success:
8855 failure:
8860 }
8862 /* Parse a trait expression.
8864 Returns a representation of the expression, the underlying type
8865 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8867 static tree
8869 {
8870 cp_trait_kind kind;
8876 {
8964 }
8966 /* Consume the token. */
8977 {
8984 }
8986 {
8988 {
8992 {
8995 }
8999 }
9000 }
9004 /* Complete the trait expression, which may mean either processing
9005 the trait expr now or saving it for template instantiation. */
9007 {
9016 }
9017 }
9019 /* Lambdas that appear in variable initializer or default argument scope
9020 get that in their mangling, so we need to record it. We might as well
9021 use the count for function and namespace scopes as well. */
9025 {
9026 tree t;
9031 static void
9033 {
9034 tree_int ti;
9036 /* Once we're inside a function, we ignore other scopes and just push
9037 the function again so that popping works properly. */
9044 {
9045 /* Don't reset the count if we're still in the same function. */
9048 }
9049 }
9051 static void
9053 {
9056 }
9058 static void
9060 {
9063 {
9066 }
9068 }
9070 /* Parse a lambda expression.
9072 lambda-expression:
9073 lambda-introducer lambda-declarator [opt] compound-statement
9075 Returns a representation of the expression. */
9077 static tree
9079 {
9081 tree type;
9089 {
9091 {
9095 }
9097 }
9099 {
9101 {
9104 }
9106 }
9108 /* We may be in the middle of deferred access check. Disable
9109 it now. */
9120 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9123 /* Now that we've started the type, add the capture fields for any
9124 explicit captures. */
9127 {
9128 /* Inside the class, surrounding template-parameter-lists do not apply. */
9129 unsigned int saved_num_template_parameter_lists
9133 bool fully_implicit_function_template_p
9137 bool auto_is_implicit_function_template_parm_p
9148 /* By virtue of defining a local class, a lambda expression has access to
9149 the private variables of enclosing classes. */
9154 {
9160 }
9162 {
9165 }
9167 /* The capture list was built up in reverse order; fix that now. */
9179 parser->fully_implicit_function_template_p
9183 parser->auto_is_implicit_function_template_parm_p
9185 }
9189 /* This field is only used during parsing of the lambda. */
9192 /* This lambda shouldn't have any proxies left at this point. */
9194 /* And now that we're done, push proxies for an enclosing lambda. */
9199 else
9205 }
9207 /* Parse the beginning of a lambda expression.
9209 lambda-introducer:
9210 [ lambda-capture [opt] ]
9212 LAMBDA_EXPR is the current representation of the lambda expression. */
9214 static void
9216 {
9217 /* Need commas after the first capture. */
9220 /* Eat the leading `['. */
9223 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9231 {
9234 }
9237 {
9239 tree capture_id;
9240 tree capture_init_expr;
9244 enum capture_kind_type
9245 {
9246 BY_COPY,
9247 BY_REFERENCE
9248 };
9252 {
9255 }
9259 else
9262 /* Possibly capture `this'. */
9264 {
9274 explicit_init_p);
9276 }
9278 /* Remember whether we want to capture as a reference or not. */
9280 {
9283 }
9285 /* Get the identifier. */
9290 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9291 delimiters, but I modified this to stop on unnested ']' as well. It
9292 was already changed to stop on unnested '}', so the
9293 "closing_parenthesis" name is no more misleading with my change. */
9294 {
9300 }
9302 /* Find the initializer for this capture. */
9306 {
9308 /* An explicit initializer exists. */
9311 "lambda capture initializers "
9317 {
9320 }
9321 }
9322 else
9323 {
9326 /* Turn the identifier into an id-expression. */
9327 capture_init_expr
9332 {
9335 }
9339 {
9342 capture_init_expr);
9345 }
9348 {
9351 capture_init_expr))
9354 }
9356 capture_init_expr
9357 = finish_id_expression
9359 capture_init_expr,
9373 {
9376 }
9377 else
9379 }
9383 {
9388 capture_id);
9392 "capture of %qD redundant with by-reference capture "
9394 }
9397 capture_id,
9398 capture_init_expr,
9400 explicit_init_p);
9401 }
9404 }
9406 /* Parse the (optional) middle of a lambda expression.
9408 lambda-declarator:
9409 < template-parameter-list [opt] >
9410 ( parameter-declaration-clause [opt] )
9411 attribute-specifier [opt]
9412 mutable [opt]
9413 exception-specification [opt]
9414 lambda-return-type-clause [opt]
9416 LAMBDA_EXPR is the current representation of the lambda expression. */
9418 static bool
9420 {
9421 /* 5.1.1.4 of the standard says:
9422 If a lambda-expression does not include a lambda-declarator, it is as if
9423 the lambda-declarator were ().
9424 This means an empty parameter list, no attributes, and no exception
9425 specification. */
9431 /* The template-parameter-list is optional, but must begin with
9432 an opening angle if present. */
9434 {
9437 "lambda templates are only available with "
9446 /* We just processed one more parameter list. */
9448 }
9450 /* The parameter-declaration-clause is optional (unless
9451 template-parameter-list was given), but must begin with an
9452 opening parenthesis if present. */
9454 {
9459 /* Parse parameters. */
9462 /* Default arguments shall not be specified in the
9463 parameter-declaration-clause of a lambda-declarator. */
9473 /* Parse optional `mutable' keyword. */
9475 {
9478 }
9480 /* Parse optional exception specification. */
9483 /* Parse optional trailing return type. */
9485 {
9489 }
9491 /* The function parameters must be in scope all the way until after the
9492 trailing-return-type in case of decltype. */
9494 }
9498 /* Create the function call operator.
9500 Messing with declarators like this is no uglier than building up the
9501 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9502 other code. */
9503 {
9504 cp_decl_specifier_seq return_type_specs;
9506 tree fco;
9513 else
9514 /* Maybe we will deduce the return type later. */
9520 sfk_none);
9525 VIRT_SPEC_UNSPECIFIED,
9526 REF_QUAL_NONE,
9527 exception_spec,
9534 declarator,
9535 attributes);
9537 {
9540 /* Give the object parameter a different name. */
9544 }
9546 {
9550 }
9559 }
9560 }
9562 /* Parse the body of a lambda expression, which is simply
9564 compound-statement
9566 but which requires special handling.
9567 LAMBDA_EXPR is the current representation of the lambda expression. */
9569 static void
9571 {
9576 else
9577 /* Still increment function_depth so that we don't GC in the
9578 middle of an expression. */
9580 /* Clear this in case we're in the middle of a default argument. */
9583 /* Finish the function call operator
9584 - class_specifier
9585 + late_parsing_for_member
9586 + function_definition_after_declarator
9587 + ctor_initializer_opt_and_function_body */
9588 {
9590 tree body;
9592 tree compound_stmt;
9593 tree cap;
9595 /* Let the front end know that we are going to be defining this
9596 function. */
9598 NULL_TREE,
9607 /* Push the proxies for any explicit captures. */
9614 /* 5.1.1.4 of the standard says:
9615 If a lambda-expression does not include a trailing-return-type, it
9616 is as if the trailing-return-type denotes the following type:
9617 * if the compound-statement is of the form
9618 { return attribute-specifier [opt] expression ; }
9619 the type of the returned expression after lvalue-to-rvalue
9620 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9621 (_conv.array_ 4.2), and function-to-pointer conversion
9622 (_conv.func_ 4.3);
9623 * otherwise, void. */
9625 /* In a lambda that has neither a lambda-return-type-clause
9626 nor a deducible form, errors should be reported for return statements
9627 in the body. Since we used void as the placeholder return type, parsing
9628 the body as usual will give such desired behavior. */
9632 {
9636 /* Parse tentatively in case there's more after the initial return
9637 statement. */
9648 {
9652 /* Will get error here if type not deduced yet. */
9656 }
9657 }
9660 {
9665 }
9669 out:
9673 /* Finish the function and generate code for it if necessary. */
9676 /* Only expand if the call op is not a template. */
9679 }
9684 else
9686 }
9688 /* Statements [gram.stmt.stmt] */
9690 /* Parse a statement.
9692 statement:
9693 labeled-statement
9694 expression-statement
9695 compound-statement
9696 selection-statement
9697 iteration-statement
9698 jump-statement
9699 declaration-statement
9700 try-block
9702 C++11:
9704 statement:
9705 labeled-statement
9706 attribute-specifier-seq (opt) expression-statement
9707 attribute-specifier-seq (opt) compound-statement
9708 attribute-specifier-seq (opt) selection-statement
9709 attribute-specifier-seq (opt) iteration-statement
9710 attribute-specifier-seq (opt) jump-statement
9711 declaration-statement
9712 attribute-specifier-seq (opt) try-block
9714 TM Extension:
9716 statement:
9717 atomic-statement
9719 IN_COMPOUND is true when the statement is nested inside a
9720 cp_parser_compound_statement; this matters for certain pragmas.
9722 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9723 is a (possibly labeled) if statement which is not enclosed in braces
9724 and has an else clause. This is used to implement -Wparentheses. */
9726 static void
9729 {
9734 restart:
9737 /* There is no statement yet. */
9743 /* In obj-c++, seeing '[[' might be the either the beginning of
9744 c++11 attributes, or a nested objc-message-expression. So
9745 let's parse the c++11 attributes tentatively. */
9749 {
9752 }
9754 /* Peek at the next token. */
9756 /* Remember the location of the first token in the statement. */
9758 /* If this is a keyword, then that will often determine what kind of
9759 statement we have. */
9761 {
9765 {
9768 /* Looks like a labeled-statement with a case label.
9769 Parse the label, and then use tail recursion to parse
9770 the statement. */
9787 {
9792 }
9793 else
9807 {
9812 }
9813 else
9814 {
9818 }
9822 /* Objective-C++ exception-handling constructs. */
9836 /* This must be a namespace alias definition. */
9849 /* It might be a keyword like `int' that can start a
9850 declaration-statement. */
9852 }
9853 }
9855 {
9856 /* If the next token is a `:', then we are looking at a
9857 labeled-statement. */
9860 {
9861 /* Looks like a labeled-statement with an ordinary label.
9862 Parse the label, and then use tail recursion to parse
9863 the statement. */
9867 }
9868 }
9869 /* Anything that starts with a `{' must be a compound-statement. */
9872 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9873 a statement all its own. */
9875 {
9876 /* Only certain OpenMP pragmas are attached to statements, and thus
9877 are considered statements themselves. All others are not. In
9878 the context of a compound, accept the pragma as a "statement" and
9879 return so that we can check for a close brace. Otherwise we
9880 require a real statement and must go back and read one. */
9886 }
9888 {
9891 }
9893 /* Everything else must be a declaration-statement or an
9894 expression-statement. Try for the declaration-statement
9895 first, unless we are looking at a `;', in which case we know that
9896 we have an expression-statement. */
9898 {
9900 {
9902 {
9903 /* Attributes should be parsed as part of the the
9904 declaration, so let's un-parse them. */
9907 }
9910 /* Try to parse the declaration-statement. */
9912 /* If that worked, we're done. */
9915 }
9916 /* Look for an expression-statement instead. */
9918 }
9920 /* Set the line number for the statement. */
9924 /* Note that for now, we don't do anything with c++11 statements
9925 parsed at this level. */
9928 OPT_Wattributes,
9930 }
9932 /* Parse the label for a labeled-statement, i.e.
9934 identifier :
9935 case constant-expression :
9936 default :
9938 GNU Extension:
9939 case constant-expression ... constant-expression : statement
9941 When a label is parsed without errors, the label is added to the
9942 parse tree by the finish_* functions, so this function doesn't
9943 have to return the label. */
9945 static void
9947 {
9952 /* The next token should be an identifier. */
9956 {
9959 }
9963 {
9965 {
9969 /* Consume the `case' token. */
9971 /* Parse the constant-expression. */
9978 {
9979 /* Consume the `...' token. */
9985 /* We don't need to emit warnings here, as the common code
9986 will do this for us. */
9987 }
9988 else
9993 else
9996 expr);
9997 }
10001 /* Consume the `default' token. */
10006 else
10011 /* Anything else must be an ordinary label. */
10014 }
10016 /* Require the `:' token. */
10019 /* An ordinary label may optionally be followed by attributes.
10020 However, this is only permitted if the attributes are then
10021 followed by a semicolon. This is because, for backward
10022 compatibility, when parsing
10023 lab: __attribute__ ((unused)) int i;
10024 we want the attribute to attach to "i", not "lab". */
10027 {
10028 tree attrs;
10035 ;
10036 else
10038 }
10044 }
10046 /* Parse an expression-statement.
10048 expression-statement:
10049 expression [opt] ;
10051 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10052 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10053 indicates whether this expression-statement is part of an
10054 expression statement. */
10056 static tree
10058 {
10062 /* If the next token is a ';', then there is no expression
10063 statement. */
10065 {
10069 {
10072 }
10073 }
10075 /* Give a helpful message for "A<T>::type t;" and the like. */
10078 {
10085 {
10086 /* A::A a; */
10091 }
10092 }
10094 /* Consume the final `;'. */
10099 /* This is the final expression statement of a statement
10100 expression. */
10106 }
10108 /* Parse a compound-statement.
10110 compound-statement:
10111 { statement-seq [opt] }
10113 GNU extension:
10115 compound-statement:
10116 { label-declaration-seq [opt] statement-seq [opt] }
10118 label-declaration-seq:
10119 label-declaration
10120 label-declaration-seq label-declaration
10122 Returns a tree representing the statement. */
10124 static tree
10127 {
10128 tree compound_stmt;
10130 /* Consume the `{'. */
10137 /* Begin the compound-statement. */
10139 /* If the next keyword is `__label__' we have a label declaration. */
10142 /* Parse an (optional) statement-seq. */
10144 /* Finish the compound-statement. */
10146 /* Consume the `}'. */
10150 }
10152 /* Parse an (optional) statement-seq.
10154 statement-seq:
10155 statement
10156 statement-seq [opt] statement */
10158 static void
10160 {
10161 /* Scan statements until there aren't any more. */
10163 {
10166 /* If we are looking at a `}', then we have run out of
10167 statements; the same is true if we have reached the end
10168 of file, or have stumbled upon a stray '@end'. */
10175 /* If we are in a compound statement and find 'else' then
10176 something went wrong. */
10178 {
10181 else
10182 {
10185 }
10186 }
10188 /* Parse the statement. */
10190 }
10191 }
10193 /* Parse a selection-statement.
10195 selection-statement:
10196 if ( condition ) statement
10197 if ( condition ) statement else statement
10198 switch ( condition ) statement
10200 Returns the new IF_STMT or SWITCH_STMT.
10202 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10203 is a (possibly labeled) if statement which is not enclosed in
10204 braces and has an else clause. This is used to implement
10205 -Wparentheses. */
10207 static tree
10209 {
10216 /* Peek at the next token. */
10219 /* See what kind of keyword it is. */
10222 {
10225 {
10226 tree statement;
10227 tree condition;
10229 /* Look for the `('. */
10231 {
10234 }
10236 /* Begin the selection-statement. */
10239 else
10242 /* Parse the condition. */
10244 /* Look for the `)'. */
10250 {
10254 /* Add the condition. */
10257 /* Parse the then-clause. */
10261 {
10269 }
10270 else
10276 /* If the next token is `else', parse the else-clause. */
10278 RID_ELSE))
10279 {
10280 /* Consume the `else' keyword. */
10283 /* Parse the else-clause. */
10285 {
10286 location_t loc;
10293 }
10294 else
10299 /* If we are currently parsing a then-clause, then
10300 IF_P will not be NULL. We set it to true to
10301 indicate that this if statement has an else clause.
10302 This may trigger the Wparentheses warning below
10303 when we get back up to the parent if statement. */
10306 }
10307 else
10308 {
10309 /* This if statement does not have an else clause. If
10310 NESTED_IF is true, then the then-clause is an if
10311 statement which does have an else clause. We warn
10312 about the potential ambiguity. */
10315 "suggest explicit braces to avoid ambiguous"
10317 }
10319 /* Now we're all done with the if-statement. */
10321 }
10322 else
10323 {
10327 /* Add the condition. */
10330 /* Parse the body of the switch-statement. */
10339 /* Now we're all done with the switch-statement. */
10341 }
10344 }
10350 }
10351 }
10353 /* Parse a condition.
10355 condition:
10356 expression
10357 type-specifier-seq declarator = initializer-clause
10358 type-specifier-seq declarator braced-init-list
10360 GNU Extension:
10362 condition:
10363 type-specifier-seq declarator asm-specification [opt]
10364 attributes [opt] = assignment-expression
10366 Returns the expression that should be tested. */
10368 static tree
10370 {
10371 cp_decl_specifier_seq type_specifiers;
10375 /* Try the declaration first. */
10377 /* New types are not allowed in the type-specifier-seq for a
10378 condition. */
10380 parser->type_definition_forbidden_message
10382 /* Parse the type-specifier-seq. */
10384 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10387 /* Restore the saved message. */
10389 /* If all is well, we might be looking at a declaration. */
10391 {
10392 tree decl;
10393 tree asm_specification;
10394 tree attributes;
10398 /* Parse the declarator. */
10404 /* Parse the attributes. */
10406 /* Parse the asm-specification. */
10408 /* If the next token is not an `=' or '{', then we might still be
10409 looking at an expression. For example:
10411 if (A(a).x)
10413 looks like a decl-specifier-seq and a declarator -- but then
10414 there is no `=', so this is an expression. */
10419 /* If we did see an `=' or '{', then we are looking at a declaration
10420 for sure. */
10422 {
10423 tree pushed_scope;
10427 /* Create the declaration. */
10433 /* Parse the initializer. */
10435 {
10439 }
10440 else
10441 {
10442 /* Consume the `='. */
10445 }
10449 /* Process the initializer. */
10452 asm_specification,
10453 flags);
10459 }
10460 }
10461 /* If we didn't even get past the declarator successfully, we are
10462 definitely not looking at a declaration. */
10463 else
10466 /* Otherwise, we are looking at an expression. */
10468 }
10470 /* Parses a for-statement or range-for-statement until the closing ')',
10471 not included. */
10473 static tree
10475 {
10479 /* Begin the for-statement. */
10482 /* Parse the initialization. */
10487 else
10489 }
10491 static tree
10493 {
10494 /* Normal for loop */
10497 tree stmt;
10500 /* The for-init-statement has already been parsed in
10501 cp_parser_for_init_statement, so no work is needed here. */
10504 /* If there's a condition, process it. */
10508 {
10512 }
10514 /* Look for the `;'. */
10517 /* If there's an expression, process it. */
10523 }
10525 /* Tries to parse a range-based for-statement:
10527 range-based-for:
10528 decl-specifier-seq declarator : expression
10530 The decl-specifier-seq declarator and the `:' are already parsed by
10531 cp_parser_for_init_statement. If processing_template_decl it returns a
10532 newly created RANGE_FOR_STMT; if not, it is converted to a
10533 regular FOR_STMT. */
10535 static tree
10538 {
10542 {
10545 }
10546 else
10549 /* If in template, STMT is converted to a normal for-statement
10550 at instantiation. If not, it is done just ahead. */
10552 {
10560 /* do_auto_deduction doesn't mess with template init-lists. */
10563 }
10564 else
10565 {
10568 }
10570 }
10572 /* Subroutine of cp_convert_range_for: given the initializer expression,
10573 builds up the range temporary. */
10575 static tree
10577 {
10580 /* Find out the type deduced by the declaration
10581 `auto &&__range = range_expr'. */
10586 /* Create the __range variable. */
10593 }
10595 /* Used by cp_parser_range_for in template context: we aren't going to
10596 do a full conversion yet, but we still need to resolve auto in the
10597 type of the for-range-declaration if present. This is basically
10598 a shortcut version of cp_convert_range_for. */
10600 static void
10602 {
10605 {
10608 iter_type = (cp_parser_perform_range_for_lookup
10611 {
10613 iter_type);
10615 tf_warning_or_error);
10618 }
10619 }
10620 }
10622 /* Converts a range-based for-statement into a normal
10623 for-statement, as per the definition.
10625 for (RANGE_DECL : RANGE_EXPR)
10626 BLOCK
10628 should be equivalent to:
10630 {
10631 auto &&__range = RANGE_EXPR;
10632 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10633 __begin != __end;
10634 ++__begin)
10635 {
10636 RANGE_DECL = *__begin;
10637 BLOCK
10638 }
10639 }
10641 If RANGE_EXPR is an array:
10642 BEGIN_EXPR = __range
10643 END_EXPR = __range + ARRAY_SIZE(__range)
10644 Else if RANGE_EXPR has a member 'begin' or 'end':
10645 BEGIN_EXPR = __range.begin()
10646 END_EXPR = __range.end()
10647 Else:
10648 BEGIN_EXPR = begin(__range)
10649 END_EXPR = end(__range);
10651 If __range has a member 'begin' but not 'end', or vice versa, we must
10652 still use the second alternative (it will surely fail, however).
10653 When calling begin()/end() in the third alternative we must use
10654 argument dependent lookup, but always considering 'std' as an associated
10655 namespace. */
10657 tree
10660 {
10666 /* If an error happened previously do nothing or else a lot of
10667 unhelpful errors would be issued. */
10669 else
10670 {
10671 tree range_temp;
10675 /* Can't bind a reference to an array of runtime bound. */
10677 else
10678 {
10683 LOOKUP_ONLYCONVERTING);
10685 }
10688 }
10690 /* The new for initialization statement. */
10698 LOOKUP_ONLYCONVERTING);
10707 LOOKUP_ONLYCONVERTING);
10711 /* The new for condition. */
10718 /* The new increment expression. */
10721 tf_warning_or_error);
10724 /* The declaration is initialized with *__begin inside the loop body. */
10727 tf_warning_or_error),
10729 LOOKUP_ONLYCONVERTING);
10732 }
10734 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10735 We need to solve both at the same time because the method used
10736 depends on the existence of members begin or end.
10737 Returns the type deduced for the iterator expression. */
10739 static tree
10741 {
10743 {
10746 }
10749 {
10754 }
10756 {
10757 /* If RANGE is an array, we will use pointer arithmetic. */
10760 range,
10764 }
10765 else
10766 {
10767 /* If it is not an array, we must do a bit of magic. */
10777 tf_warning_or_error);
10780 tf_warning_or_error);
10783 {
10784 /* Use the member functions. */
10787 else
10793 else
10796 }
10797 else
10798 {
10799 /* Use global functions with ADL. */
10806 tf_warning_or_error);
10808 tf_warning_or_error);
10810 tf_warning_or_error);
10812 tf_warning_or_error);
10815 }
10817 /* Last common checks. */
10819 {
10820 /* If one of the expressions is an error do no more checks. */
10823 }
10826 /* Can happen, when, eg, in a template context, Koenig lookup
10827 can't resolve begin/end (c++/58503). */
10829 else
10830 {
10832 /* The unqualified type of the __begin and __end temporaries should
10833 be the same, as required by the multiple auto declaration. */
10839 }
10840 }
10841 }
10843 /* Helper function for cp_parser_perform_range_for_lookup.
10844 Builds a tree for RANGE.IDENTIFIER(). */
10846 static tree
10848 {
10861 tf_warning_or_error);
10864 }
10866 /* Parse an iteration-statement.
10868 iteration-statement:
10869 while ( condition ) statement
10870 do statement while ( expression ) ;
10871 for ( for-init-statement condition [opt] ; expression [opt] )
10872 statement
10874 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10876 static tree
10878 {
10881 tree statement;
10884 /* Peek at the next token. */
10889 /* Remember whether or not we are already within an iteration
10890 statement. */
10893 /* See what kind of keyword it is. */
10896 {
10898 {
10899 tree condition;
10901 /* Begin the while-statement. */
10903 /* Look for the `('. */
10905 /* Parse the condition. */
10908 /* Look for the `)'. */
10910 /* Parse the dependent statement. */
10914 /* We're done with the while-statement. */
10916 }
10920 {
10921 tree expression;
10923 /* Begin the do-statement. */
10925 /* Parse the body of the do-statement. */
10930 /* Look for the `while' keyword. */
10932 /* Look for the `('. */
10934 /* Parse the expression. */
10936 /* We're done with the do-statement. */
10938 /* Look for the `)'. */
10940 /* Look for the `;'. */
10942 }
10946 {
10947 /* Look for the `('. */
10952 /* Look for the `)'. */
10955 /* Parse the body of the for-statement. */
10960 /* We're done with the for-statement. */
10962 }
10969 }
10972 }
10974 /* Parse a for-init-statement or the declarator of a range-based-for.
10975 Returns true if a range-based-for declaration is seen.
10977 for-init-statement:
10978 expression-statement
10979 simple-declaration */
10981 static bool
10983 {
10984 /* If the next token is a `;', then we have an empty
10985 expression-statement. Grammatically, this is also a
10986 simple-declaration, but an invalid one, because it does not
10987 declare anything. Therefore, if we did not handle this case
10988 specially, we would issue an error message about an invalid
10989 declaration. */
10991 {
10997 {
10998 /* N3994 -- for (id : init) ... */
11001 "type-specifier only available with "
11009 }
11011 /* A colon is used in range-based for. */
11014 /* We're going to speculatively look for a declaration, falling back
11015 to an expression, if necessary. */
11017 /* Parse the declaration. */
11020 decl);
11023 {
11024 /* It is a range-for, consume the ':' */
11028 {
11030 "range-based %<for%> loops only available with "
11033 }
11034 }
11035 else
11036 /* The ';' is not consumed yet because we told
11037 cp_parser_simple_declaration not to. */
11042 /* If the tentative parse failed, then we shall need to look for an
11043 expression-statement. */
11044 }
11045 /* If we are here, it is an expression-statement. */
11048 }
11050 /* Parse a jump-statement.
11052 jump-statement:
11053 break ;
11054 continue ;
11055 return expression [opt] ;
11056 return braced-init-list ;
11057 goto identifier ;
11059 GNU extension:
11061 jump-statement:
11062 goto * expression ;
11064 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
11066 static tree
11068 {
11074 /* Peek at the next token. */
11079 /* See what kind of keyword it is. */
11082 {
11086 {
11106 }
11112 {
11119 /* Fall through. */
11129 }
11134 {
11135 tree expr;
11139 {
11143 }
11146 else
11147 /* If the next token is a `;', then there is no
11148 expression. */
11150 /* Build the return-statement. */
11152 /* Look for the final `;'. */
11154 }
11160 {
11163 }
11165 /* Create the goto-statement. */
11167 {
11168 /* Issue a warning about this use of a GNU extension. */
11170 /* Consume the '*' token. */
11172 /* Parse the dependent expression. */
11174 }
11175 else
11177 /* Look for the final `;'. */
11184 }
11187 }
11189 /* Parse a declaration-statement.
11191 declaration-statement:
11192 block-declaration */
11194 static void
11196 {
11199 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11202 /* Parse the block-declaration. */
11205 /* Free any declarators allocated. */
11207 }
11209 /* Some dependent statements (like `if (cond) statement'), are
11210 implicitly in their own scope. In other words, if the statement is
11211 a single statement (as opposed to a compound-statement), it is
11212 none-the-less treated as if it were enclosed in braces. Any
11213 declarations appearing in the dependent statement are out of scope
11214 after control passes that point. This function parses a statement,
11215 but ensures that is in its own scope, even if it is not a
11216 compound-statement.
11218 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11219 is a (possibly labeled) if statement which is not enclosed in
11220 braces and has an else clause. This is used to implement
11221 -Wparentheses.
11223 Returns the new statement. */
11225 static tree
11227 {
11228 tree statement;
11233 /* Mark if () ; with a special NOP_EXPR. */
11235 {
11239 }
11240 /* if a compound is opened, we simply parse the statement directly. */
11243 /* If the token is not a `{', then we must take special action. */
11244 else
11245 {
11246 /* Create a compound-statement. */
11248 /* Parse the dependent-statement. */
11250 /* Finish the dummy compound-statement. */
11252 }
11254 /* Return the statement. */
11256 }
11258 /* For some dependent statements (like `while (cond) statement'), we
11259 have already created a scope. Therefore, even if the dependent
11260 statement is a compound-statement, we do not want to create another
11261 scope. */
11263 static void
11265 {
11266 /* If the token is a `{', then we must take special action. */
11269 else
11270 {
11271 /* Avoid calling cp_parser_compound_statement, so that we
11272 don't create a new scope. Do everything else by hand. */
11274 /* If the next keyword is `__label__' we have a label declaration. */
11277 /* Parse an (optional) statement-seq. */
11280 }
11281 }
11283 /* Declarations [gram.dcl.dcl] */
11285 /* Parse an optional declaration-sequence.
11287 declaration-seq:
11288 declaration
11289 declaration-seq declaration */
11291 static void
11293 {
11295 {
11306 {
11307 /* A declaration consisting of a single semicolon is
11308 invalid. Allow it unless we're being pedantic. */
11313 }
11315 /* If we're entering or exiting a region that's implicitly
11316 extern "C", modify the lang context appropriately. */
11318 {
11321 }
11323 {
11326 }
11329 {
11330 /* A top-level declaration can consist solely of a #pragma.
11331 A nested declaration cannot, so this is done here and not
11332 in cp_parser_declaration. (A #pragma at block scope is
11333 handled in cp_parser_statement.) */
11336 }
11338 /* Parse the declaration itself. */
11340 }
11341 }
11343 /* Parse a declaration.
11345 declaration:
11346 block-declaration
11347 function-definition
11348 template-declaration
11349 explicit-instantiation
11350 explicit-specialization
11351 linkage-specification
11352 namespace-definition
11354 GNU extension:
11356 declaration:
11357 __extension__ declaration */
11359 static void
11361 {
11362 cp_token token1;
11363 cp_token token2;
11368 /* Check for the `__extension__' keyword. */
11370 {
11371 /* Parse the qualified declaration. */
11373 /* Restore the PEDANTIC flag. */
11377 }
11379 /* Try to figure out what kind of declaration is present. */
11384 else
11385 {
11388 }
11390 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11393 /* If the next token is `extern' and the following token is a string
11394 literal, then we have a linkage specification. */
11398 /* If the next token is `template', then we have either a template
11399 declaration, an explicit instantiation, or an explicit
11400 specialization. */
11402 {
11403 /* `template <>' indicates a template specialization. */
11407 /* `template <' indicates a template declaration. */
11410 /* Anything else must be an explicit instantiation. */
11411 else
11413 }
11414 /* If the next token is `export', then we have a template
11415 declaration. */
11418 /* If the next token is `extern', 'static' or 'inline' and the one
11419 after that is `template', we have a GNU extended explicit
11420 instantiation directive. */
11427 /* If the next token is `namespace', check for a named or unnamed
11428 namespace definition. */
11434 /* An unnamed namespace definition. */
11438 /* An inline (associated) namespace definition. */
11442 /* Objective-C++ declaration/definition. */
11449 /* We must have either a block declaration or a function
11450 definition. */
11451 else
11452 {
11453 /* At this point we may have a template declared by a concept
11454 introduction. */
11459 /* Try to parse a block-declaration, or a function-definition. */
11461 }
11463 /* Free any declarators allocated. */
11465 }
11467 /* Parse a block-declaration.
11469 block-declaration:
11470 simple-declaration
11471 asm-definition
11472 namespace-alias-definition
11473 using-declaration
11474 using-directive
11476 GNU Extension:
11478 block-declaration:
11479 __extension__ block-declaration
11481 C++0x Extension:
11483 block-declaration:
11484 static_assert-declaration
11486 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11487 part of a declaration-statement. */
11489 static void
11492 {
11496 /* Check for the `__extension__' keyword. */
11498 {
11499 /* Parse the qualified declaration. */
11501 /* Restore the PEDANTIC flag. */
11505 }
11507 /* Peek at the next token to figure out which kind of declaration is
11508 present. */
11511 /* If the next keyword is `asm', we have an asm-definition. */
11513 {
11517 }
11518 /* If the next keyword is `namespace', we have a
11519 namespace-alias-definition. */
11522 /* If the next keyword is `using', we have a
11523 using-declaration, a using-directive, or an alias-declaration. */
11525 {
11530 /* If the token after `using' is `namespace', then we have a
11531 using-directive. */
11535 /* If the second token after 'using' is '=', then we have an
11536 alias-declaration. */
11542 /* Otherwise, it's a using-declaration. */
11543 else
11546 }
11547 /* If the next keyword is `__label__' we have a misplaced label
11548 declaration. */
11550 {
11554 /* If the next token is now a `;', consume it. */
11557 }
11558 /* If the next token is `static_assert' we have a static assertion. */
11561 /* Anything else must be a simple-declaration. */
11562 else
11565 }
11567 /* Parse a simple-declaration.
11569 simple-declaration:
11570 decl-specifier-seq [opt] init-declarator-list [opt] ;
11572 init-declarator-list:
11573 init-declarator
11574 init-declarator-list , init-declarator
11576 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11577 function-definition as a simple-declaration.
11579 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11580 parsed declaration if it is an uninitialized single declarator not followed
11581 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11582 if present, will not be consumed. */
11584 static void
11588 {
11589 cp_decl_specifier_seq decl_specifiers;
11598 /* Defer access checks until we know what is being declared; the
11599 checks for names appearing in the decl-specifier-seq should be
11600 done as if we were in the scope of the thing being declared. */
11603 /* Parse the decl-specifier-seq. We have to keep track of whether
11604 or not the decl-specifier-seq declares a named class or
11605 enumeration type, since that is the only case in which the
11606 init-declarator-list is allowed to be empty.
11608 [dcl.dcl]
11610 In a simple-declaration, the optional init-declarator-list can be
11611 omitted only when declaring a class or enumeration, that is when
11612 the decl-specifier-seq contains either a class-specifier, an
11613 elaborated-type-specifier, or an enum-specifier. */
11615 CP_PARSER_FLAGS_OPTIONAL,
11618 /* We no longer need to defer access checks. */
11621 /* In a block scope, a valid declaration must always have a
11622 decl-specifier-seq. By not trying to parse declarators, we can
11623 resolve the declaration/expression ambiguity more quickly. */
11626 {
11629 }
11631 /* If the next two tokens are both identifiers, the code is
11632 erroneous. The usual cause of this situation is code like:
11634 T t;
11636 where "T" should name a type -- but does not. */
11639 {
11640 /* If parsing tentatively, we should commit; we really are
11641 looking at a declaration. */
11643 /* Give up. */
11645 }
11647 /* If we have seen at least one decl-specifier, and the next token
11648 is not a parenthesis, then we must be looking at a declaration.
11649 (After "int (" we might be looking at a functional cast.) */
11656 /* Keep going until we hit the `;' at the end of the simple
11657 declaration. */
11660 CPP_SEMICOLON))
11661 {
11664 tree decl;
11667 {
11668 /* If we are processing next declarator, comma is expected */
11673 {
11677 }
11678 }
11679 else
11682 /* Parse the init-declarator. */
11685 function_definition_allowed_p,
11687 declares_class_or_enum,
11689 maybe_range_for_decl,
11691 /* If an error occurred while parsing tentatively, exit quickly.
11692 (That usually happens when in the body of a function; each
11693 statement is treated as a declaration-statement until proven
11694 otherwise.) */
11697 /* Handle function definitions specially. */
11699 {
11700 /* If the next token is a `,', then we are probably
11701 processing something like:
11703 void f() {}, *p;
11705 which is erroneous. */
11707 {
11710 "mixing"
11712 }
11713 /* Otherwise, we're done with the list of declarators. */
11714 else
11715 {
11718 }
11719 }
11722 /* The next token should be either a `,' or a `;'. */
11724 /* If it's a `,', there are more declarators to come. */
11727 /* If it's a `;', we are done. */
11730 /* Anything else is an error. */
11731 else
11732 {
11733 /* If we have already issued an error message we don't need
11734 to issue another one. */
11738 /* Skip tokens until we reach the end of the statement. */
11740 /* If the next token is now a `;', consume it. */
11744 }
11745 /* After the first time around, a function-definition is not
11746 allowed -- even if it was OK at first. For example:
11748 int i, f() {}
11750 is not valid. */
11752 }
11754 /* Issue an error message if no declarators are present, and the
11755 decl-specifier-seq does not itself declare a class or
11756 enumeration: [dcl.dcl]/3. */
11758 {
11760 {
11764 /* Ensure an error is issued anyway when finish_decltype_type,
11765 called via cp_parser_decl_specifier_seq, returns a class or
11766 an enumeration (c++/51786). */
11769 }
11770 /* Perform any deferred access checks. */
11772 }
11774 /* Consume the `;'. */
11778 {
11784 }
11786 done:
11788 }
11790 /* Parse a decl-specifier-seq.
11792 decl-specifier-seq:
11793 decl-specifier-seq [opt] decl-specifier
11794 decl-specifier attribute-specifier-seq [opt] (C++11)
11796 decl-specifier:
11797 storage-class-specifier
11798 type-specifier
11799 function-specifier
11800 friend
11801 typedef
11803 GNU Extension:
11805 decl-specifier:
11806 attributes
11808 Concepts Extension:
11810 decl-specifier:
11811 concept
11814 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11816 The parser flags FLAGS is used to control type-specifier parsing.
11818 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11819 flags:
11821 1: one of the decl-specifiers is an elaborated-type-specifier
11822 (i.e., a type declaration)
11823 2: one of the decl-specifiers is an enum-specifier or a
11824 class-specifier (i.e., a type definition)
11826 */
11828 static void
11830 cp_parser_flags flags,
11833 {
11837 cp_decl_spec ds;
11839 /* Clear DECL_SPECS. */
11842 /* Assume no class or enumeration type is declared. */
11845 /* Keep reading specifiers until there are no more to read. */
11847 {
11852 /* Peek at the next token. */
11855 /* Save the first token of the decl spec list for error
11856 reporting. */
11859 /* Handle attributes. */
11861 {
11862 /* Parse the attributes. */
11865 /* In a sequence of declaration specifiers, c++11 attributes
11866 appertain to the type that precede them. In that case
11867 [dcl.spec]/1 says:
11869 The attribute-specifier-seq affects the type only for
11870 the declaration it appears in, not other declarations
11871 involving the same type.
11873 But for now let's force the user to position the
11874 attribute either at the beginning of the declaration or
11875 after the declarator-id, which would clearly mean that it
11876 applies to the declarator. */
11878 {
11880 /* The c++11 attribute is at the beginning of the
11881 declaration. It appertains to the entity being
11883 else
11884 {
11886 {
11887 /* This is an attribute following a
11888 class-specifier. */
11893 }
11894 else
11895 {
11896 decl_specs->std_attributes
11898 attrs);
11901 }
11903 }
11904 }
11906 decl_specs->attributes
11908 attrs);
11912 }
11913 /* Assume we will find a decl-specifier keyword. */
11915 /* If the next token is an appropriate keyword, we can simply
11916 add it to the list. */
11918 {
11919 /* decl-specifier:
11920 friend
11921 constexpr */
11924 {
11927 }
11928 else
11929 {
11931 /* Consume the token. */
11933 }
11946 /* function-specifier:
11947 inline
11948 virtual
11949 explicit */
11956 /* decl-specifier:
11957 typedef */
11960 /* Consume the token. */
11962 /* A constructor declarator cannot appear in a typedef. */
11964 /* The "typedef" keyword can only occur in a declaration; we
11965 may as well commit at this point. */
11972 /* storage-class-specifier:
11973 auto
11974 register
11975 static
11976 extern
11977 mutable
11979 GNU Extension:
11980 thread */
11983 {
11984 /* Consume the token. */
11987 /* Complain about `auto' as a storage specifier, if
11988 we're complaining about C++0x compatibility. */
11992 /* Set the storage class anyway. */
11994 token);
11995 }
11996 else
11997 /* C++0x auto type-specifier. */
12005 /* Consume the token. */
12008 token);
12011 /* Consume the token. */
12017 /* We did not yet find a decl-specifier yet. */
12020 }
12030 /* Constructors are a special case. The `S' in `S()' is not a
12031 decl-specifier; it is the beginning of the declarator. */
12032 constructor_p
12033 = (!found_decl_spec
12034 && constructor_possible_p
12035 && (cp_parser_constructor_declarator_p
12038 /* If we don't have a DECL_SPEC yet, then we must be looking at
12039 a type-specifier. */
12041 {
12044 tree type_spec;
12046 type_spec
12048 decl_specs,
12054 /* If this type-specifier referenced a user-defined type
12055 (a typedef, class-name, etc.), then we can't allow any
12056 more such type-specifiers henceforth.
12058 [dcl.spec]
12060 The longest sequence of decl-specifiers that could
12061 possibly be a type name is taken as the
12062 decl-specifier-seq of a declaration. The sequence shall
12063 be self-consistent as described below.
12065 [dcl.type]
12067 As a general rule, at most one type-specifier is allowed
12068 in the complete decl-specifier-seq of a declaration. The
12069 only exceptions are the following:
12071 -- const or volatile can be combined with any other
12072 type-specifier.
12074 -- signed or unsigned can be combined with char, long,
12075 short, or int.
12077 -- ..
12079 Example:
12081 typedef char* Pc;
12082 void g (const int Pc);
12084 Here, Pc is *not* part of the decl-specifier seq; it's
12085 the declarator. Therefore, once we see a type-specifier
12086 (other than a cv-qualifier), we forbid any additional
12087 user-defined types. We *do* still allow things like `int
12088 int' to be considered a decl-specifier-seq, and issue the
12089 error message later. */
12092 /* A constructor declarator cannot follow a type-specifier. */
12094 {
12099 }
12100 }
12102 /* If we still do not have a DECL_SPEC, then there are no more
12103 decl-specifiers. */
12108 /* After we see one decl-specifier, further decl-specifiers are
12109 always optional. */
12111 }
12113 /* Don't allow a friend specifier with a class definition. */
12118 }
12120 /* Parse an (optional) storage-class-specifier.
12122 storage-class-specifier:
12123 auto
12124 register
12125 static
12126 extern
12127 mutable
12129 GNU Extension:
12131 storage-class-specifier:
12132 thread
12134 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12136 static tree
12138 {
12140 {
12144 /* Fall through for C++98. */
12151 /* Consume the token. */
12156 }
12157 }
12159 /* Parse an (optional) function-specifier.
12161 function-specifier:
12162 inline
12163 virtual
12164 explicit
12166 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12167 Updates DECL_SPECS, if it is non-NULL. */
12169 static tree
12172 {
12175 {
12181 /* 14.5.2.3 [temp.mem]
12183 A member function template shall not be virtual. */
12186 else
12196 }
12198 /* Consume the token. */
12200 }
12202 /* Parse a linkage-specification.
12204 linkage-specification:
12205 extern string-literal { declaration-seq [opt] }
12206 extern string-literal declaration */
12208 static void
12210 {
12211 tree linkage;
12213 /* Look for the `extern' keyword. */
12216 /* Look for the string-literal. */
12219 /* Transform the literal into an identifier. If the literal is a
12220 wide-character string, or contains embedded NULs, then we can't
12221 handle it as the user wants. */
12224 {
12226 /* Assume C++ linkage. */
12228 }
12229 else
12232 /* We're now using the new linkage. */
12235 /* If the next token is a `{', then we're using the first
12236 production. */
12238 {
12241 /* Consume the `{' token. */
12243 /* Parse the declarations. */
12245 /* Look for the closing `}'. */
12247 }
12248 /* Otherwise, there's just one declaration. */
12249 else
12250 {
12253 saved_in_unbraced_linkage_specification_p
12257 parser->in_unbraced_linkage_specification_p
12259 }
12261 /* We're done with the linkage-specification. */
12263 }
12265 /* Parse a static_assert-declaration.
12267 static_assert-declaration:
12268 static_assert ( constant-expression , string-literal ) ;
12270 If MEMBER_P, this static_assert is a class member. */
12272 static void
12274 {
12275 tree condition;
12276 tree message;
12278 location_t saved_loc;
12281 /* Peek at the `static_assert' token so we can keep track of exactly
12282 where the static assertion started. */
12286 /* Look for the `static_assert' keyword. */
12288 RT_STATIC_ASSERT))
12291 /* We know we are in a static assertion; commit to any tentative
12292 parse. */
12296 /* Parse the `(' starting the static assertion condition. */
12299 /* Parse the constant-expression. Allow a non-constant expression
12300 here in order to give better diagnostics in finish_static_assert. */
12301 condition =
12306 /* Parse the separating `,'. */
12309 /* Parse the string-literal message. */
12314 /* A `)' completes the static assertion. */
12321 /* A semicolon terminates the declaration. */
12324 /* Complete the static assertion, which may mean either processing
12325 the static assert now or saving it for template instantiation. */
12327 }
12329 /* Parse the expression in decltype ( expression ). */
12331 static tree
12334 {
12336 tree expr;
12338 /* First, try parsing an id-expression. */
12349 {
12352 cp_id_kind idk;
12356 /* Lookup the name we got back from the id-expression. */
12366 {
12367 /* Complete lookup of the id-expression. */
12368 expr = (finish_id_expression
12381 /* We found an id-expression, but it was something that we
12382 should not have found. This is an error, not something
12383 we can recover from, so note that we found an
12384 id-expression and we'll recover as gracefully as
12385 possible. */
12387 }
12392 /* We have an id-expression. */
12394 }
12397 {
12398 /* Abort the id-expression parse. */
12401 /* Parsing tentatively, again. */
12404 /* Parse a class member access. */
12412 /* We have an id-expression. */
12414 }
12417 /* We have parsed the complete id-expression or member access. */
12419 else
12420 {
12421 /* Abort our attempt to parse an id-expression or member access
12422 expression. */
12425 /* Parse a full expression. */
12428 }
12431 }
12433 /* Parse a `decltype' type. Returns the type.
12435 simple-type-specifier:
12436 decltype ( expression )
12437 C++14 proposal:
12438 decltype ( auto ) */
12440 static tree
12442 {
12443 tree expr;
12452 {
12453 /* Already parsed. */
12456 }
12458 /* Look for the `decltype' token. */
12462 /* Parse the opening `('. */
12466 /* decltype (auto) */
12469 {
12476 }
12478 /* Types cannot be defined in a `decltype' expression. Save away the
12479 old message. */
12482 /* And create the new one. */
12483 parser->type_definition_forbidden_message
12486 /* The restrictions on constant-expressions do not apply inside
12487 decltype expressions. */
12488 saved_integral_constant_expression_p
12490 saved_non_integral_constant_expression_p
12494 /* Within a parenthesized expression, a `>' token is always
12495 the greater-than operator. */
12496 saved_greater_than_is_operator_p
12500 /* Do not actually evaluate the expression. */
12503 /* Do not warn about problems with the expression. */
12508 /* Go back to evaluating expressions. */
12512 /* The `>' token might be the end of a template-id or
12513 template-parameter-list now. */
12514 parser->greater_than_is_operator_p
12517 /* Restore the old message and the integral constant expression
12518 flags. */
12520 parser->integral_constant_expression_p
12522 parser->non_integral_constant_expression_p
12525 /* Parse to the closing `)'. */
12527 {
12531 }
12534 tf_warning_or_error);
12536 rewrite:
12537 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12538 it again. */
12545 }
12547 /* Special member functions [gram.special] */
12549 /* Parse a conversion-function-id.
12551 conversion-function-id:
12552 operator conversion-type-id
12554 Returns an IDENTIFIER_NODE representing the operator. */
12556 static tree
12558 {
12559 tree type;
12560 tree saved_scope;
12561 tree saved_qualifying_scope;
12562 tree saved_object_scope;
12565 /* Look for the `operator' token. */
12568 /* When we parse the conversion-type-id, the current scope will be
12569 reset. However, we need that information in able to look up the
12570 conversion function later, so we save it here. */
12574 /* We must enter the scope of the class so that the names of
12575 entities declared within the class are available in the
12576 conversion-type-id. For example, consider:
12578 struct S {
12579 typedef int I;
12580 operator I();
12581 };
12583 S::operator I() { ... }
12585 In order to see that `I' is a type-name in the definition, we
12586 must be in the scope of `S'. */
12589 /* Parse the conversion-type-id. */
12591 /* Leave the scope of the class, if any. */
12594 /* Restore the saved scope. */
12598 /* If the TYPE is invalid, indicate failure. */
12602 }
12604 /* Parse a conversion-type-id:
12606 conversion-type-id:
12607 type-specifier-seq conversion-declarator [opt]
12609 Returns the TYPE specified. */
12611 static tree
12613 {
12614 tree attributes;
12615 cp_decl_specifier_seq type_specifiers;
12617 tree type_specified;
12620 /* Parse the attributes. */
12624 parser->type_definition_forbidden_message
12627 /* Parse the type-specifiers. */
12634 /* If that didn't work, stop. */
12637 /* Parse the conversion-declarator. */
12645 /* Don't give this error when parsing tentatively. This happens to
12646 work because we always parse this definitively once. */
12649 {
12651 {
12654 }
12658 }
12661 }
12663 /* Parse an (optional) conversion-declarator.
12665 conversion-declarator:
12666 ptr-operator conversion-declarator [opt]
12668 */
12672 {
12675 cp_cv_quals cv_quals;
12677 /* We don't know if there's a ptr-operator next, or not. */
12679 /* Try the ptr-operator. */
12682 /* If it worked, look for more conversion-declarators. */
12684 {
12687 /* Parse another optional declarator. */
12690 declarator = cp_parser_make_indirect_declarator
12694 }
12697 }
12699 /* Parse an (optional) ctor-initializer.
12701 ctor-initializer:
12702 : mem-initializer-list
12704 Returns TRUE iff the ctor-initializer was actually present. */
12706 static bool
12708 {
12709 /* If the next token is not a `:', then there is no
12710 ctor-initializer. */
12712 {
12713 /* Do default initialization of any bases and members. */
12718 }
12720 /* Consume the `:' token. */
12722 /* And the mem-initializer-list. */
12726 }
12728 /* Parse a mem-initializer-list.
12730 mem-initializer-list:
12731 mem-initializer ... [opt]
12732 mem-initializer ... [opt] , mem-initializer-list */
12734 static void
12736 {
12741 /* Let the semantic analysis code know that we are starting the
12742 mem-initializer-list. */
12747 /* Loop through the list. */
12749 {
12750 tree mem_initializer;
12753 /* Parse the mem-initializer. */
12755 /* If the next token is a `...', we're expanding member initializers. */
12757 {
12758 /* Consume the `...'. */
12761 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12762 can be expanded but members cannot. */
12765 {
12770 }
12772 /* Construct the pack expansion type. */
12775 }
12778 {
12782 }
12783 /* Look for a target constructor. */
12787 {
12790 {
12794 }
12796 }
12797 /* Add it to the list, unless it was erroneous. */
12799 {
12802 }
12803 /* If the next token is not a `,', we're done. */
12806 /* Consume the `,' token. */
12808 }
12810 /* Perform semantic analysis. */
12813 }
12815 /* Parse a mem-initializer.
12817 mem-initializer:
12818 mem-initializer-id ( expression-list [opt] )
12819 mem-initializer-id braced-init-list
12821 GNU extension:
12823 mem-initializer:
12824 ( expression-list [opt] )
12826 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12827 class) or FIELD_DECL (for a non-static data member) to initialize;
12828 the TREE_VALUE is the expression-list. An empty initialization
12829 list is represented by void_list_node. */
12831 static tree
12833 {
12834 tree mem_initializer_id;
12835 tree expression_list;
12836 tree member;
12839 /* Find out what is being initialized. */
12841 {
12845 }
12846 else
12847 {
12851 }
12857 {
12864 }
12865 else
12866 {
12876 }
12886 }
12888 /* Parse a mem-initializer-id.
12890 mem-initializer-id:
12891 :: [opt] nested-name-specifier [opt] class-name
12892 identifier
12894 Returns a TYPE indicating the class to be initializer for the first
12895 production. Returns an IDENTIFIER_NODE indicating the data member
12896 to be initialized for the second production. */
12898 static tree
12900 {
12904 tree id;
12908 /* `typename' is not allowed in this context ([temp.res]). */
12910 {
12912 "keyword %<typename%> not allowed in this context (a qualified "
12915 }
12916 /* Look for the optional `::' operator. */
12917 global_scope_p
12921 /* Look for the optional nested-name-specifier. The simplest way to
12922 implement:
12924 [temp.res]
12926 The keyword `typename' is not permitted in a base-specifier or
12927 mem-initializer; in these contexts a qualified name that
12928 depends on a template-parameter is implicitly assumed to be a
12929 type name.
12931 is to assume that we have seen the `typename' keyword at this
12932 point. */
12933 nested_name_specifier_p
12942 /* If there is a `::' operator or a nested-name-specifier, then we
12943 are definitely looking for a class-name. */
12948 typename_type,
12952 /* Otherwise, we could also be looking for an ordinary identifier. */
12954 /* Try a class-name. */
12958 none_type,
12962 /* If we found one, we're done. */
12965 /* Otherwise, look for an ordinary identifier. */
12967 }
12969 /* Overloading [gram.over] */
12971 /* Parse an operator-function-id.
12973 operator-function-id:
12974 operator operator
12976 Returns an IDENTIFIER_NODE for the operator which is a
12977 human-readable spelling of the identifier, e.g., `operator +'. */
12979 static tree
12981 {
12982 /* Look for the `operator' keyword. */
12985 /* And then the name of the operator itself. */
12987 }
12989 /* Return an identifier node for a user-defined literal operator.
12990 The suffix identifier is chained to the operator name identifier. */
12992 static tree
12994 {
12995 tree identifier;
13002 }
13004 /* Parse an operator.
13006 operator:
13007 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
13008 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
13009 || ++ -- , ->* -> () []
13011 GNU Extensions:
13013 operator:
13014 <? >? <?= >?=
13016 Returns an IDENTIFIER_NODE for the operator which is a
13017 human-readable spelling of the identifier, e.g., `operator +'. */
13019 static tree
13021 {
13026 /* Peek at the next token. */
13028 /* Figure out which operator we have. */
13030 {
13032 {
13035 /* The keyword should be either `new' or `delete'. */
13040 else
13043 /* Consume the `new' or `delete' token. */
13046 /* Peek at the next token. */
13048 /* If it's a `[' token then this is the array variant of the
13049 operator. */
13051 {
13052 /* Consume the `[' token. */
13054 /* Look for the `]' token. */
13058 }
13059 /* Otherwise, we have the non-array variant. */
13060 else
13064 }
13211 /* Consume the `('. */
13213 /* Look for the matching `)'. */
13218 /* Consume the `['. */
13220 /* Look for the matching `]'. */
13235 {
13242 /* Consume the string. */
13248 {
13251 }
13252 else
13253 {
13255 /* Look for the suffix identifier. */
13260 {
13264 }
13265 else
13266 {
13269 }
13270 }
13275 {
13278 }
13281 {
13284 }
13286 {
13289 }
13291 }
13294 /* Anything else is an error. */
13296 }
13298 /* If we have selected an identifier, we need to consume the
13299 operator token. */
13302 /* Otherwise, no valid operator name was present. */
13303 else
13304 {
13307 }
13310 }
13312 /* Parse a template-declaration.
13314 template-declaration:
13315 export [opt] template < template-parameter-list > declaration
13317 If MEMBER_P is TRUE, this template-declaration occurs within a
13318 class-specifier.
13320 The grammar rule given by the standard isn't correct. What
13321 is really meant is:
13323 template-declaration:
13324 export [opt] template-parameter-list-seq
13325 decl-specifier-seq [opt] init-declarator [opt] ;
13326 export [opt] template-parameter-list-seq
13327 function-definition
13329 template-parameter-list-seq:
13330 template-parameter-list-seq [opt]
13331 template < template-parameter-list >
13333 Concept Extensions:
13335 template-parameter-list-seq:
13336 template < template-parameter-list > template-requirement [opt]
13338 template-requirement:
13339 requires logical-or-expression
13340 */
13342 static void
13344 {
13345 /* Check for `export'. */
13347 {
13348 /* Consume the `export' token. */
13350 /* Warn that we do not support `export'. */
13352 }
13355 }
13357 /* Parse a template-parameter-list.
13359 template-parameter-list:
13360 template-parameter
13361 template-parameter-list , template-parameter
13363 Returns a TREE_LIST. Each node represents a template parameter.
13364 The nodes are connected via their TREE_CHAINs. */
13366 static tree
13368 {
13373 /* The loop below parses the template parms. We first need to know
13374 the total number of template parms to be able to compute proper
13375 canonical types of each dependent type. So after the loop, when
13376 we know the total number of template parms,
13377 end_template_parm_list computes the proper canonical types and
13378 fixes up the dependent types accordingly. */
13380 {
13381 tree parameter;
13384 location_t parm_loc;
13386 /* Parse the template-parameter. */
13391 /* Add it to the list. */
13394 parm_loc,
13395 parameter,
13396 is_non_type,
13397 is_parameter_pack);
13398 else
13399 {
13402 }
13404 /* If the next token is not a `,', we're done. */
13407 /* Otherwise, consume the `,' token. */
13409 }
13412 }
13414 #if 0
13415 /* Parse a introduction-list.
13417 introduction-list:
13418 introduced-parameter
13419 introduction-list , introduced-parameter
13421 introduced-parameter:
13422 ...[opt] identifier
13424 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
13425 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
13426 WILDCARD_DECL will also have DECL_NAME set and token location in
13427 DECL_SOURCE_LOCATION. */
13429 static tree
13431 {
13435 {
13440 // Build placeholder.
13448 // If the next token is not a `,', we're done.
13451 // Otherwise, consume the `,' token.
13453 }
13455 // Convert the vec into a TREE_VEC.
13458 tree parm;
13460 {
13462 }
13466 }
13467 #endif
13469 // Given a declarator, get the declarator-id part, or NULL_TREE if this
13470 // is an abstract declarator.
13473 {
13478 }
13480 // Get the unqualified-id from the DECLARATOR or NULL_TREE if this
13481 // is an abstract declarator.
13484 {
13488 else
13490 }
13492 // Returns true if PARM declares a constrained-parameter.
13495 {
13504 }
13507 // Check that the type parameter is only a declarator-id, and that its
13508 // type is not cv-qualified.
13509 bool
13512 {
13517 {
13520 }
13522 // Don't allow cv-qualified type parameters.
13525 {
13528 }
13531 }
13533 // Finish parsing/processing a template type parameter and checking
13534 // various restrictions.
13537 tree id,
13539 {
13542 else
13544 }
13546 // Finish parsing/processing a template template parameter by borrowing
13547 // the template parameter list from the prototype parameter.
13548 static tree
13550 tree proto,
13551 tree id,
13553 {
13557 // FIXME: This should probably be copied, and we may need to adjust
13558 // the template parameter depths.
13568 }
13570 // Create a new non-type template parameter from the given PARM declarator.
13571 static tree
13574 {
13580 }
13582 // Build a constrained template parameter based on the PARMDECL
13583 // declarator. The type of PARMDECL is the constrained type, which
13584 // refers to the prototype template parameter that ultimately
13585 // specifies the type of the declared parameter.
13586 static tree
13591 {
13597 // A template parameter constrained by a variadic concept shall also
13598 // be declared as a template parameter pack.
13603 // Build the parameter. Return an error if the declarator was invalid.
13604 tree parm;
13609 parmdecl);
13610 else
13615 // Finish the parameter decl and create a node attaching the
13616 // default argument and constraint.
13621 }
13623 // Returns the type of the given TYPE may represent the declaration of
13624 // a template type parameter. This is a helper function for the
13625 // cp_declares_type* functions below.
13628 {
13629 return type
13633 }
13635 // Returns true if the parsed type actually represents a type or template
13636 // template parameter.
13639 {
13641 {
13644 }
13646 }
13648 // Returns true if the parsed type actually represents the declaration
13649 // of a type template-parameter.
13652 {
13655 }
13658 // Returns true if the parsed type actually represents the declaration of
13659 // a template template-parameter.
13660 static bool
13662 {
13665 }
13667 // Parse a default argument for a type template-parameter.
13668 //
13669 // Note that diagnostics are handled in cp_parser_template_parameter.
13670 static tree
13672 {
13675 /* Consume the `=' token. */
13678 /* Parse the default-argument. */
13684 }
13686 // Parse a default argument for a template template-parameter.
13687 static tree
13689 {
13694 /* Consume the `='. */
13696 /* Parse the id-expression. */
13698 /* save token before parsing the id-expression, for error
13699 reporting */
13701 tree default_argument
13709 /* If the id-expression was a template-id that refers to
13710 a template-class, we already have the declaration here,
13711 so no further lookup is needed. */
13712 ;
13713 else
13714 /* Look up the name. */
13715 default_argument
13717 none_type,
13723 /* See if the default argument is valid. */
13727 }
13729 /* Parse a template-parameter.
13731 template-parameter:
13732 type-parameter
13733 parameter-declaration
13735 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13736 the parameter. The TREE_PURPOSE is the default value, if any.
13737 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13738 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13739 set to true iff this parameter is a parameter pack. */
13741 static tree
13744 {
13748 tree parm;
13750 /* Assume it is a type parameter or a template parameter. */
13752 /* Assume it not a parameter pack. */
13754 /* Peek at the next token. */
13756 /* If it is `class' or `template', we have a type-parameter. */
13759 /* If it is `class' or `typename' we do not know yet whether it is a
13760 type parameter or a non-type parameter. Consider:
13762 template <typename T, typename T::X X> ...
13764 or:
13766 template <class C, class D*> ...
13768 Here, the first parameter is a type parameter, and the second is
13769 a non-type parameter. We can tell by looking at the token after
13770 the identifier -- if it is a `,', `=', or `>' then we have a type
13771 parameter. */
13773 {
13774 /* Peek at the token after `class' or `typename'. */
13776 /* If it's an ellipsis, we have a template type parameter
13777 pack. */
13780 /* If it's an identifier, skip it. */
13783 /* Now, see if the token looks like the end of a template
13784 parameter. */
13789 }
13791 /* Otherwise, it is a non-type parameter or a constrained parameter.
13793 [temp.param]
13795 When parsing a default template-argument for a non-type
13796 template-parameter, the first non-nested `>' is taken as the end
13797 of the template parameter-list rather than a greater-than
13798 operator. */
13799 parameter_declarator
13806 /* If the parameter declaration is marked as a parameter pack, set
13807 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13808 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13809 grokdeclarator. */
13812 {
13815 }
13819 {
13820 /* Can happen in some cases of erroneous input (c++/34892). */
13822 /* Consume the `...' for better error recovery. */
13824 }
13825 /* If the next token is an ellipsis, and we don't already have it
13826 marked as a parameter pack, then we have a parameter pack (that
13827 has no declarator). */
13830 && (declarator_can_be_parameter_pack
13832 {
13833 /* Consume the `...'. */
13838 }
13839 /* We might end up with a pack expansion as the type of the non-type
13840 template parameter, in which case this is a non-type template
13841 parameter pack. */
13843 {
13847 }
13850 {
13851 /* Parameter packs cannot have default arguments. However, a
13852 user may try to do so, so we'll parse them and give an
13853 appropriate diagnostic here. */
13857 /* Find the name of the parameter pack. */
13866 else
13870 /* Parse the default argument, but throw away the result. */
13875 else
13877 }
13879 // The parameter may have been constrained.
13882 parameter_declarator,
13883 is_non_type,
13884 is_parameter_pack);
13886 // Now we're sure that the parameter is a non-type parameter.
13897 }
13899 /* Parse a type-parameter.
13901 type-parameter:
13902 class identifier [opt]
13903 class identifier [opt] = type-id
13904 typename identifier [opt]
13905 typename identifier [opt] = type-id
13906 template < template-parameter-list > class identifier [opt]
13907 template < template-parameter-list > class identifier [opt]
13908 = id-expression
13910 GNU Extension (variadic templates):
13912 type-parameter:
13913 class ... identifier [opt]
13914 typename ... identifier [opt]
13916 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13917 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13918 the declaration of the parameter.
13920 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13922 static tree
13924 {
13926 tree parameter;
13928 /* Look for a keyword to tell us what kind of parameter this is. */
13934 {
13937 {
13938 tree identifier;
13939 tree default_argument;
13941 /* If the next token is an ellipsis, we have a template
13942 argument pack. */
13944 {
13945 /* Consume the `...' token. */
13950 }
13952 /* If the next token is an identifier, then it names the
13953 parameter. */
13956 else
13959 /* Create the parameter. */
13962 /* If the next token is an `=', we have a default argument. */
13964 {
13965 default_argument
13968 /* Template parameter packs cannot have default
13969 arguments. */
13971 {
13974 "template parameter pack %qD cannot have a "
13976 else
13978 "template parameter packs cannot have "
13981 }
13985 /* ANS: FIXME: This appears to be a stray pop. Check again once
13986 concept introdutions have been disabled. */
13987 // pop_deferring_access_checks ();
13988 }
13989 else
13992 /* Create the combined representation of the parameter and the
13993 default argument. */
13995 }
13999 {
14000 tree identifier;
14001 tree default_argument;
14003 /* Look for the `<'. */
14005 /* Parse the template-parameter-list. */
14007 /* Look for the `>'. */
14010 // If template requirements are present, parse them.
14012 {
14017 }
14019 /* Look for the `class' or 'typename' keywords. */
14021 /* If the next token is an ellipsis, we have a template
14022 argument pack. */
14024 {
14025 /* Consume the `...' token. */
14030 }
14031 /* If the next token is an `=', then there is a
14032 default-argument. If the next token is a `>', we are at
14033 the end of the parameter-list. If the next token is a `,',
14034 then we are at the end of this parameter. */
14038 {
14040 /* Treat invalid names as if the parameter were nameless. */
14043 }
14044 else
14047 /* Create the template parameter. */
14049 identifier);
14051 /* If the next token is an `=', then there is a
14052 default-argument. */
14054 {
14055 default_argument
14058 /* Template parameter packs cannot have default
14059 arguments. */
14061 {
14064 "template parameter pack %qD cannot "
14066 identifier);
14067 else
14071 }
14072 }
14073 else
14076 /* Create the combined representation of the parameter and the
14077 default argument. */
14079 }
14085 }
14088 }
14090 /* Parse a template-id.
14092 template-id:
14093 template-name < template-argument-list [opt] >
14095 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
14096 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
14097 returned. Otherwise, if the template-name names a function, or set
14098 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
14099 names a class, returns a TYPE_DECL for the specialization.
14101 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
14102 uninstantiated templates. */
14104 static tree
14110 {
14112 tree templ;
14113 tree arguments;
14114 tree template_id;
14121 /* If the next token corresponds to a template-id, there is no need
14122 to reparse it. */
14125 {
14128 /* Get the stored value. */
14130 /* Perform any access checks that were deferred. */
14133 {
14138 tf_warning_or_error);
14139 }
14140 /* Return the stored value. */
14142 }
14144 /* Avoid performing name lookup if there is no possibility of
14145 finding a template-id. */
14148 && !cp_parser_nth_token_starts_template_argument_list_p
14150 {
14153 }
14155 /* Remember where the template-id starts. */
14161 /* Parse the template-name. */
14164 check_dependency_p,
14165 is_declaration,
14166 tag_type,
14169 {
14172 }
14174 /* If we find the sequence `[:' after a template-name, it's probably
14175 a digraph-typo for `< ::'. Substitute the tokens and check if we can
14176 parse correctly the argument list. */
14183 {
14185 /* Change `:' into `::'. */
14187 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
14188 CPP_LESS. */
14191 /* Parse the arguments. */
14194 {
14195 /* If we couldn't parse an argument list, then we revert our changes
14196 and return simply an error. Maybe this is not a template-id
14197 after all. */
14202 }
14203 /* Otherwise, emit an error about the invalid digraph, but continue
14204 parsing because we got our argument list. */
14207 {
14210 "%<<:%> is an alternate spelling for %<[%>."
14213 {
14215 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
14218 }
14219 }
14220 }
14221 else
14222 {
14223 /* Look for the `<' that starts the template-argument-list. */
14225 {
14228 }
14229 /* Parse the arguments. */
14231 }
14233 /* Build a representation of the specialization. */
14234 tree partial_concept_id;
14237 TEMPLATE_ID_EXPR,
14241 {
14243 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
14244 template (rather than some instantiation thereof) only if
14245 is not nested within some other construct. For example, in
14246 "template <typename T> void f(T) { A<T>::", A<T> is just an
14247 instantiation of A. */
14250 CPP_SCOPE));
14251 template_id
14253 }
14254 /* A template-like identifier may be a partial concept id. */
14256 && cp_maybe_partial_concept_id
14258 {
14260 }
14262 {
14264 }
14265 else
14266 {
14267 /* If it's not a class-template or a template-template, it should be
14268 a function-template. */
14273 }
14275 /* If parsing tentatively, replace the sequence of tokens that makes
14276 up the template-id with a CPP_TEMPLATE_ID token. That way,
14277 should we re-parse the token stream, we will not have to repeat
14278 the effort required to do the parse, nor will we issue duplicate
14279 error messages about problems during instantiation of the
14280 template. */
14282 /* Don't do this if we had a parse error in a declarator; re-parsing
14283 might succeed if a name changes meaning (60361). */
14287 {
14290 /* Reset the contents of the START_OF_ID token. */
14292 /* Retrieve any deferred checks. Do not pop this access checks yet
14293 so the memory will not be reclaimed during token replacing below. */
14299 /* Purge all subsequent tokens. */
14302 /* ??? Can we actually assume that, if template_id ==
14303 error_mark_node, we will have issued a diagnostic to the
14304 user, as opposed to simply marking the tentative parse as
14305 failed? */
14308 }
14313 }
14315 /* Parse a template-name.
14317 template-name:
14318 identifier
14320 The standard should actually say:
14322 template-name:
14323 identifier
14324 operator-function-id
14326 A defect report has been filed about this issue.
14328 A conversion-function-id cannot be a template name because they cannot
14329 be part of a template-id. In fact, looking at this code:
14331 a.operator K<int>()
14333 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
14334 It is impossible to call a templated conversion-function-id with an
14335 explicit argument list, since the only allowed template parameter is
14336 the type to which it is converting.
14338 If TEMPLATE_KEYWORD_P is true, then we have just seen the
14339 `template' keyword, in a construction like:
14341 T::template f<3>()
14343 In that case `f' is taken to be a template-name, even though there
14344 is no way of knowing for sure.
14346 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
14347 name refers to a set of overloaded functions, at least one of which
14348 is a template, or an IDENTIFIER_NODE with the name of the template,
14349 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
14350 names are looked up inside uninstantiated templates. */
14352 static tree
14359 {
14360 tree identifier;
14361 tree decl;
14362 tree fns;
14365 /* If the next token is `operator', then we have either an
14366 operator-function-id or a conversion-function-id. */
14368 {
14369 /* We don't know whether we're looking at an
14370 operator-function-id or a conversion-function-id. */
14372 /* Try an operator-function-id. */
14374 /* If that didn't work, try a conversion-function-id. */
14376 {
14379 }
14380 }
14381 /* Look for the identifier. */
14382 else
14385 /* If we didn't find an identifier, we don't have a template-id. */
14389 /* If the name immediately followed the `template' keyword, then it
14390 is a template-name. However, if the next token is not `<', then
14391 we do not treat it as a template-name, since it is not being used
14392 as part of a template-id. This enables us to handle constructs
14393 like:
14395 template <typename T> struct S { S(); };
14396 template <typename T> S<T>::S();
14398 correctly. We would treat `S' as a template -- if it were `S<T>'
14399 -- but we do not if there is no `<'. */
14403 {
14404 /* In a declaration, in a dependent context, we pretend that the
14405 "template" keyword was present in order to improve error
14406 recovery. For example, given:
14408 template <typename T> void f(T::X<int>);
14410 we want to treat "X<int>" as a template-id. */
14412 && !template_keyword_p
14414 && check_dependency_p
14416 /* Do not do this for dtors (or ctors), since they never
14417 need the template keyword before their name. */
14419 {
14422 /* Explain what went wrong. */
14424 identifier);
14427 /* If parsing tentatively, find the location of the "<" token. */
14430 /* Parse the template arguments so that we can issue error
14431 messages about them. */
14434 /* Skip tokens until we find a good place from which to
14435 continue parsing. */
14440 /* If parsing tentatively, permanently remove the
14441 template argument list. That will prevent duplicate
14442 error messages from being issued about the missing
14443 "template" keyword. */
14449 }
14451 /* If the "template" keyword is present, then there is generally
14452 no point in doing name-lookup, so we just return IDENTIFIER.
14453 But, if the qualifying scope is non-dependent then we can
14454 (and must) do name-lookup normally. */
14460 }
14462 /* Look up the name. */
14464 tag_type,
14467 check_dependency_p,
14473 /* If DECL is a template, then the name was a template-name. */
14475 {
14479 }
14480 else
14481 {
14484 /* The standard does not explicitly indicate whether a name that
14485 names a set of overloaded declarations, some of which are
14486 templates, is a template-name. However, such a name should
14487 be a template-name; otherwise, there is no way to form a
14488 template-id for the overloaded templates. */
14496 {
14497 /* The name does not name a template. */
14500 }
14501 }
14503 /* If DECL is dependent, and refers to a function, then just return
14504 its name; we will look it up again during template instantiation. */
14506 {
14510 }
14513 }
14515 /* Parse a template-argument-list.
14517 template-argument-list:
14518 template-argument ... [opt]
14519 template-argument-list , template-argument ... [opt]
14521 Returns a TREE_VEC containing the arguments. */
14523 static tree
14525 {
14530 tree vec;
14537 /* Even if the template-id appears in an integral
14538 constant-expression, the contents of the argument list do
14539 not. */
14545 /* Parse the arguments. */
14546 do
14547 {
14548 tree argument;
14551 /* Consume the comma. */
14554 /* Parse the template-argument. */
14557 /* If the next token is an ellipsis, we're expanding a template
14558 argument pack. */
14560 {
14562 {
14566 }
14567 /* Consume the `...' token. */
14570 /* Make the argument into a TYPE_PACK_EXPANSION or
14571 EXPR_PACK_EXPANSION. */
14573 }
14575 // If we end up with a template decl argument, check if this is actually
14576 // a template template parameter and drop the outer wrapping.
14581 {
14585 {
14588 }
14589 else
14591 }
14593 }
14606 #ifdef ENABLE_CHECKING
14608 #endif
14610 }
14612 /* Parse a template-argument.
14614 template-argument:
14615 assignment-expression
14616 type-id
14617 id-expression
14619 The representation is that of an assignment-expression, type-id, or
14620 id-expression -- except that the qualified id-expression is
14621 evaluated, so that the value returned is either a DECL or an
14622 OVERLOAD.
14624 Although the standard says "assignment-expression", it forbids
14625 throw-expressions or assignments in the template argument.
14626 Therefore, we use "conditional-expression" instead. */
14628 static tree
14630 {
14631 tree argument;
14637 cp_id_kind idk;
14639 /* There's really no way to know what we're looking at, so we just
14640 try each alternative in order.
14642 [temp.arg]
14644 In a template-argument, an ambiguity between a type-id and an
14645 expression is resolved to a type-id, regardless of the form of
14646 the corresponding template-parameter.
14648 Therefore, we try a type-id first. */
14651 /* If there was no error parsing the type-id but the next token is a
14652 '>>', our behavior depends on which dialect of C++ we're
14653 parsing. In C++98, we probably found a typo for '> >'. But there
14654 are type-id which are also valid expressions. For instance:
14656 struct X { int operator >> (int); };
14657 template <int V> struct Foo {};
14658 Foo<X () >> 5> r;
14660 Here 'X()' is a valid type-id of a function type, but the user just
14661 wanted to write the expression "X() >> 5". Thus, we remember that we
14662 found a valid type-id, but we still try to parse the argument as an
14663 expression to see what happens.
14665 In C++0x, the '>>' will be considered two separate '>'
14666 tokens. */
14670 {
14673 }
14674 else
14675 {
14676 /* If the next token isn't a `,' or a `>', then this argument wasn't
14677 really finished. This means that the argument is not a valid
14678 type-id. */
14681 /* If that worked, we're done. */
14684 }
14685 /* We're still not sure what the argument will be. */
14687 /* Try a template. */
14695 /* If the next token isn't a `,' or a `>', then this argument wasn't
14696 really finished. */
14700 {
14701 /* Figure out what is being referred to. If the id-expression
14702 was for a class template specialization, then we will have a
14703 TYPE_DECL at this point. There is no need to do name lookup
14704 at this point in that case. */
14707 none_type,
14716 }
14718 {
14722 }
14723 /* It must be a non-type argument. There permitted cases are given
14724 in [temp.arg.nontype]:
14726 -- an integral constant-expression of integral or enumeration
14727 type; or
14729 -- the name of a non-type template-parameter; or
14731 -- the name of an object or function with external linkage...
14733 -- the address of an object or function with external linkage...
14735 -- a pointer to member... */
14736 /* Look for a non-type template parameter. */
14738 {
14750 }
14752 /* If the next token is "&", the argument must be the address of an
14753 object or function with external linkage. */
14756 {
14759 }
14760 /* See if we might have an id-expression. */
14767 {
14770 address_p,
14777 else
14778 {
14779 tree probe;
14782 {
14783 /* Strip the dereference temporarily. */
14786 }
14788 /* If we're in a template, we represent a qualified-id referring
14789 to a static data member as a SCOPE_REF even if the scope isn't
14790 dependent so that we can check access control later. */
14795 {
14796 /* A variable without external linkage might still be a
14797 valid constant-expression, so no error is issued here
14798 if the external-linkage check fails. */
14801 }
14803 /* All overloaded functions are allowed; if the external
14804 linkage test does not pass, an error will be issued
14805 later. */
14806 ;
14810 /* A pointer-to-member. */
14811 ;
14813 ;
14814 else
14818 {
14821 tf_warning_or_error);
14822 else
14825 }
14826 }
14827 }
14828 /* If the argument started with "&", there are no other valid
14829 alternatives at this point. */
14831 {
14834 }
14836 /* If the argument wasn't successfully parsed as a type-id followed
14837 by '>>', the argument can only be a constant expression now.
14838 Otherwise, we try parsing the constant-expression tentatively,
14839 because the argument could really be a type-id. */
14850 /* We did our best to parse the argument as a non type-id, but that
14851 was the only alternative that matched (albeit with a '>' after
14852 it). We can assume it's just a typo from the user, and a
14853 diagnostic will then be issued. */
14855 }
14857 /* Parse an explicit-instantiation.
14859 explicit-instantiation:
14860 template declaration
14862 Although the standard says `declaration', what it really means is:
14864 explicit-instantiation:
14865 template decl-specifier-seq [opt] declarator [opt] ;
14867 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14868 supposed to be allowed. A defect report has been filed about this
14869 issue.
14871 GNU Extension:
14873 explicit-instantiation:
14874 storage-class-specifier template
14875 decl-specifier-seq [opt] declarator [opt] ;
14876 function-specifier template
14877 decl-specifier-seq [opt] declarator [opt] ; */
14879 static void
14881 {
14883 cp_decl_specifier_seq decl_specifiers;
14888 /* Look for an (optional) storage-class-specifier or
14889 function-specifier. */
14891 {
14892 extension_specifier
14895 extension_specifier
14898 }
14900 /* Look for the `template' keyword. */
14902 /* Let the front end know that we are processing an explicit
14903 instantiation. */
14905 /* [temp.explicit] says that we are supposed to ignore access
14906 control while processing explicit instantiation directives. */
14908 /* Parse a decl-specifier-seq. */
14910 CP_PARSER_FLAGS_OPTIONAL,
14913 /* If there was exactly one decl-specifier, and it declared a class,
14914 and there's no declarator, then we have an explicit type
14915 instantiation. */
14917 {
14918 tree type;
14922 /* Turn access control back on for names used during
14923 template instantiation. */
14928 }
14929 else
14930 {
14932 tree decl;
14934 /* Parse the declarator. */
14935 declarator
14946 {
14949 "explicit instantiation shall not use"
14953 "explicit instantiation shall not use"
14958 /* Turn access control back on for names used during
14959 template instantiation. */
14961 /* Do the explicit instantiation. */
14963 }
14964 else
14965 {
14967 /* Skip the body of the explicit instantiation. */
14969 }
14970 }
14971 /* We're done with the instantiation. */
14977 }
14979 /* Parse an explicit-specialization.
14981 explicit-specialization:
14982 template < > declaration
14984 Although the standard says `declaration', what it really means is:
14986 explicit-specialization:
14987 template <> decl-specifier [opt] init-declarator [opt] ;
14988 template <> function-definition
14989 template <> explicit-specialization
14990 template <> template-declaration */
14992 static void
14994 {
14998 /* Look for the `template' keyword. */
15000 /* Look for the `<'. */
15002 /* Look for the `>'. */
15004 /* We have processed another parameter list. */
15006 /* [temp]
15008 A template ... explicit specialization ... shall not have C
15009 linkage. */
15011 {
15013 /* Give it C++ linkage to avoid confusing other parts of the
15014 front end. */
15017 }
15018 else
15020 /* Let the front end know that we are beginning a specialization. */
15022 {
15025 }
15027 /* If the next keyword is `template', we need to figure out whether
15028 or not we're looking a template-declaration. */
15030 {
15035 else
15037 }
15038 else
15039 /* Parse the dependent declaration. */
15045 /* We're done with the specialization. */
15047 /* For the erroneous case of a template with C linkage, we pushed an
15048 implicit C++ linkage scope; exit that scope now. */
15051 /* We're done with this parameter list. */
15053 }
15055 /* Parse a type-specifier.
15057 type-specifier:
15058 simple-type-specifier
15059 class-specifier
15060 enum-specifier
15061 elaborated-type-specifier
15062 cv-qualifier
15064 GNU Extension:
15066 type-specifier:
15067 __complex__
15069 Returns a representation of the type-specifier. For a
15070 class-specifier, enum-specifier, or elaborated-type-specifier, a
15071 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
15073 The parser flags FLAGS is used to control type-specifier parsing.
15075 If IS_DECLARATION is TRUE, then this type-specifier is appearing
15076 in a decl-specifier-seq.
15078 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
15079 class-specifier, enum-specifier, or elaborated-type-specifier, then
15080 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
15081 if a type is declared; 2 if it is defined. Otherwise, it is set to
15082 zero.
15084 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
15085 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
15086 is set to FALSE. */
15088 static tree
15090 cp_parser_flags flags,
15095 {
15101 /* Assume this type-specifier does not declare a new type. */
15104 /* And that it does not specify a cv-qualifier. */
15107 /* Peek at the next token. */
15110 /* If we're looking at a keyword, we can use that to guide the
15111 production we choose. */
15114 {
15119 /* Look for the enum-specifier. */
15121 /* If that worked, we're done. */
15123 {
15128 type_spec,
15129 token,
15132 }
15133 else
15136 /* Any of these indicate either a class-specifier, or an
15137 elaborated-type-specifier. */
15144 /* Parse tentatively so that we can back up if we don't find a
15145 class-specifier. */
15147 /* Look for the class-specifier. */
15150 /* If that worked, we're done. */
15152 {
15157 type_spec,
15158 token,
15161 }
15163 /* Fall through. */
15164 elaborated_type_specifier:
15165 /* We're declaring (not defining) a class or enum. */
15169 /* Fall through. */
15171 /* Look for an elaborated-type-specifier. */
15172 type_spec
15173 = (cp_parser_elaborated_type_specifier
15176 is_declaration));
15179 type_spec,
15180 token,
15203 /* The `__complex__' keyword is a GNU extension. */
15209 }
15211 /* Handle simple keywords. */
15213 {
15215 {
15218 }
15220 }
15222 /* If we do not already have a type-specifier, assume we are looking
15223 at a simple-type-specifier. */
15225 decl_specs,
15226 flags);
15228 /* If we didn't find a type-specifier, and a type-specifier was not
15229 optional in this context, issue an error message. */
15231 {
15234 }
15237 }
15239 /* Parse a simple-type-specifier.
15241 simple-type-specifier:
15242 :: [opt] nested-name-specifier [opt] type-name
15243 :: [opt] nested-name-specifier template template-id
15244 char
15245 wchar_t
15246 bool
15247 short
15248 int
15249 long
15250 signed
15251 unsigned
15252 float
15253 double
15254 void
15256 C++0x Extension:
15258 simple-type-specifier:
15259 auto
15260 decltype ( expression )
15261 char16_t
15262 char32_t
15263 __underlying_type ( type-id )
15265 GNU Extension:
15267 simple-type-specifier:
15268 __int128
15269 __typeof__ unary-expression
15270 __typeof__ ( type-id )
15271 __typeof__ ( type-id ) { initializer-list , [opt] }
15273 Concepts Extension:
15275 simple-type-specifier:
15276 constrained-type-specifier
15278 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
15279 appropriately updated. */
15281 static tree
15284 cp_parser_flags flags)
15285 {
15290 /* Peek at the next token. */
15293 /* If we're looking at a keyword, things are easy. */
15295 {
15330 {
15333 }
15362 {
15365 else
15369 {
15372 "use of %<auto%> in lambda parameter declaration "
15373 "only available with "
15375 }
15378 "use of %<auto%> in parameter declaration "
15379 "only available with "
15381 else
15383 "ISO C++ forbids use of %<auto%> in parameter "
15385 }
15386 else
15391 /* Since DR 743, decltype can either be a simple-type-specifier by
15392 itself or begin a nested-name-specifier. Parsing it will replace
15393 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
15394 handling below decide what to do. */
15400 /* Consume the `typeof' token. */
15402 /* Parse the operand to `typeof'. */
15404 /* If it is not already a TYPE, take its type. */
15410 token,
15419 token,
15429 token,
15434 }
15436 /* If token is an already-parsed decltype not followed by ::,
15437 it's a simple-type-specifier. */
15440 {
15443 {
15445 token,
15447 /* Remember that we are handling a decltype in order to
15448 implement the resolution of DR 1510 when the argument
15449 isn't instantiation dependent. */
15451 }
15454 }
15456 /* If the type-specifier was for a built-in type, we're done. */
15458 {
15459 /* Record the type. */
15466 type,
15467 token,
15472 /* Consume the token. */
15478 /* There is no valid C++ program where a non-template type is
15479 followed by a "<". That usually indicates that the user thought
15480 that the type was a template. */
15485 }
15487 /* The type-specifier must be a user-defined type. */
15489 {
15493 /* Don't gobble tokens or issue error messages if this is an
15494 optional type-specifier. */
15498 /* Look for the optional `::' operator. */
15499 global_p
15503 /* Look for the nested-name specifier. */
15504 qualified_p
15512 /* If we have seen a nested-name-specifier, and the next token
15513 is `template', then we are using the template-id production. */
15516 {
15517 /* Look for the template-id. */
15521 none_type,
15523 /* If the template-id did not name a type, we are out of
15524 luck. */
15526 {
15529 }
15530 }
15531 /* Otherwise, look for a type-name. */
15532 else
15535 /* Keep track of all name-lookups performed in class scopes. */
15537 && !global_p
15538 && !qualified_p
15542 /* If it didn't work out, we don't have a TYPE. */
15548 token,
15550 }
15552 /* If we didn't get a type-name, issue an error message. */
15554 {
15557 }
15560 {
15561 /* See if TYPE is an Objective-C type, and if so, parse and
15562 accept any protocol references following it. Do this before
15563 the cp_parser_check_for_invalid_template_id() call, because
15564 Objective-C types can be followed by '<...>' which would
15565 enclose protocol names rather than template arguments, and so
15566 everything is fine. */
15569 {
15573 /* Clobber the "unqualified" type previously entered into
15574 DECL_SPECS with the new, improved protocol-qualified version. */
15579 }
15581 /* There is no valid C++ program where a non-template type is
15582 followed by a "<". That usually indicates that the user
15583 thought that the type was a template. */
15585 none_type,
15587 }
15590 }
15592 /* Parse a type-name.
15594 type-name:
15595 class-name
15596 enum-name
15597 typedef-name
15598 simple-template-id [in c++0x]
15600 enum-name:
15601 identifier
15603 typedef-name:
15604 identifier
15606 Concepts:
15608 type-name:
15609 concept-name
15610 partial-concept-id
15612 concept-name:
15613 identifier
15615 Returns a TYPE_DECL for the type. */
15617 static tree
15619 {
15621 }
15623 /* See above. */
15624 static tree
15626 {
15627 tree type_decl;
15629 /* We can't know yet whether it is a class-name or not. */
15631 /* Try a class-name. */
15633 typename_keyword_p,
15635 none_type,
15640 /* If it's not a class-name, keep looking. */
15642 {
15644 /* It must be a typedef-name or an enum-name. */
15648 /* It is either a simple-template-id representing an
15649 instantiation of an alias template... */
15653 none_type,
15656 /* Note that this must be an instantiation of an alias template
15657 because [temp.names]/6 says:
15659 A template-id that names an alias template specialization
15660 is a type-name.
15662 Whereas [temp.names]/7 says:
15664 A simple-template-id that names a class template
15665 specialization is a class-name.
15667 With concepts, this could also be a partial-concept-id that
15668 declares a non-type template parameter. */
15675 else
15679 /* ... Or a typedef-name or an enum-name. */
15681 }
15684 }
15686 /* Returns true if proto is a type parameter, but not a template
15687 template parameter. */
15688 static bool
15690 {
15692 {
15695 }
15697 }
15700 /* Check if DECL and ARGS can form a constrained-type-specifier.
15701 If ARGS is non-null, we try to form a concept check of the
15702 form DECL<?, ARGS> where ? is a wildcard that matches any
15703 kind of template argument. If ARGS is NULL, then we try to
15704 form a concept check of the form DECL<?>. */
15706 static tree
15708 {
15711 /* If we a constrained-type-specifier cannot be deduced. */
15715 /* A constrained type specifier can only be found in an
15716 overload set or as a reference to a template declaration.
15718 FIXME: This might be masking a bug. It's possible that
15719 that the deduction below is causing template specializations
15720 to be formed with the wildcard as an argument. */
15724 /* Try to build a call expression that evaluates the
15725 concept. This can fail if the overload set refers
15726 only to non-templates. */
15732 /* Deduce the checked constraint and the prototype parameter.
15734 FIXME: In certain cases, failure to deduce should be a
15735 diagnosable error. */
15736 tree conc;
15737 tree proto;
15741 /* In template parameter scope, this results in a constrained
15742 parameter. Return a descriptor of that parm. */
15746 /* In any other context, a concept must be a type concept.
15748 FIXME: A constrained-type-specifier can be a placeholder
15749 of any kind. */
15753 /* In a parameter-declaration-clause, constrained-type
15754 specifiers result in invented template parameters. */
15756 {
15759 }
15760 else
15761 {
15762 /* Otherwise, we're in a context where the constrained
15763 type name is deduced and the constraint applies
15764 after deduction. */
15766 }
15769 }
15772 /* If DECL refers to a concept, return a TYPE_DECL representing
15773 the result of using the constrained type specifier in the
15774 current context. DECL refers to a concept if
15776 - it is an overload set containing a function concept taking a single
15777 type argument, or
15779 - it is a variable concept taking a single type argument. */
15781 static tree
15783 {
15785 }
15788 /* Check if DECL and ARGS form a partial-concept-id. If so,
15789 assign ID to the resulting constrained placeholder.
15791 Returns true if the partial-concept-id designates a placeholder
15792 and false otherwise. Note that *id is set to NULL_TREE in
15793 this case. */
15795 bool
15797 {
15800 }
15803 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
15804 or a concept-name.
15806 enum-name:
15807 identifier
15809 typedef-name:
15810 identifier
15812 concept-name:
15813 identifier
15815 Returns a TYPE_DECL for the type. */
15817 static tree
15819 {
15820 tree type_decl;
15821 tree identifier;
15828 /* Look up the type-name. */
15832 /* If we found an overload set, then it may refer to a concept-name. */
15837 {
15838 /* Determine whether the overload refers to a concept. */
15841 }
15845 {
15846 /* See if this is an Objective-C type. */
15851 }
15853 /* Issue an error if we did not find a type-name. */
15855 /* In Objective-C, we have the complication that class names are
15856 normally type names and start declarations (eg, the
15857 "NSObject" in "NSObject *object;"), but can be used in an
15858 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15859 is an expression. So, a classname followed by a dot is not a
15860 valid type-name. */
15863 {
15868 }
15869 /* Remember that the name was used in the definition of the
15870 current class so that we can check later to see if the
15871 meaning would have been different after the class was
15872 entirely defined. */
15878 }
15880 /* Parse an elaborated-type-specifier. Note that the grammar given
15881 here incorporates the resolution to DR68.
15883 elaborated-type-specifier:
15884 class-key :: [opt] nested-name-specifier [opt] identifier
15885 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15886 enum-key :: [opt] nested-name-specifier [opt] identifier
15887 typename :: [opt] nested-name-specifier identifier
15888 typename :: [opt] nested-name-specifier template [opt]
15889 template-id
15891 GNU extension:
15893 elaborated-type-specifier:
15894 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15895 class-key attributes :: [opt] nested-name-specifier [opt]
15896 template [opt] template-id
15897 enum attributes :: [opt] nested-name-specifier [opt] identifier
15899 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15900 declared `friend'. If IS_DECLARATION is TRUE, then this
15901 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15902 something is being declared.
15904 Returns the TYPE specified. */
15906 static tree
15910 {
15912 tree identifier;
15915 tree globalscope;
15918 /* See if we're looking at the `enum' keyword. */
15920 {
15921 /* Consume the `enum' token. */
15923 /* Remember that it's an enumeration type. */
15925 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15926 enums) is used here. */
15929 {
15933 /* Consume the `struct' or `class' and parse it anyway. */
15935 }
15936 /* Parse the attributes. */
15938 }
15939 /* Or, it might be `typename'. */
15941 RID_TYPENAME))
15942 {
15943 /* Consume the `typename' token. */
15945 /* Remember that it's a `typename' type. */
15947 }
15948 /* Otherwise it must be a class-key. */
15949 else
15950 {
15954 /* Parse the attributes. */
15956 }
15958 /* Look for the `::' operator. */
15961 /* Look for the nested-name-specifier. */
15963 {
15968 is_declaration))
15970 }
15971 else
15972 /* Even though `typename' is not present, the proposed resolution
15973 to Core Issue 180 says that in `class A<T>::B', `B' should be
15974 considered a type-name, even if `A<T>' is dependent. */
15979 is_declaration);
15980 /* For everything but enumeration types, consider a template-id.
15981 For an enumeration type, consider only a plain identifier. */
15983 {
15985 tree decl;
15987 /* Allow the `template' keyword. */
15989 /* If we didn't see `template', we don't know if there's a
15990 template-id or not. */
15993 /* Parse the template-id. */
15997 tag_type,
15998 is_declaration);
15999 /* If we didn't find a template-id, look for an ordinary
16000 identifier. */
16002 ;
16003 /* We can get here when cp_parser_template_id, called by
16004 cp_parser_class_name with tag_type == none_type, succeeds
16005 and caches a BASELINK. Then, when called again here,
16006 instead of failing and returning an error_mark_node
16007 returns it (see template/typename17.C in C++11).
16008 ??? Could we diagnose this earlier? */
16010 {
16013 }
16014 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
16015 in effect, then we must assume that, upon instantiation, the
16016 template will correspond to a class. */
16020 typename_type,
16022 /* If the `typename' keyword is in effect and DECL is not a type
16023 decl, then type is non existent. */
16025 ;
16031 }
16034 {
16039 {
16042 }
16044 /* For a `typename', we needn't call xref_tag. */
16050 /* Template parameter lists apply only if we are not within a
16051 function parameter list. */
16052 bool template_parm_lists_apply
16061 /* Look up a qualified name in the usual way. */
16063 {
16064 tree decl;
16065 tree ambiguous_decls;
16068 tag_type,
16075 /* If the lookup was ambiguous, an error will already have been
16076 issued. */
16080 /* If we are parsing friend declaration, DECL may be a
16081 TEMPLATE_DECL tree node here. However, we need to check
16082 whether this TEMPLATE_DECL results in valid code. Consider
16083 the following example:
16085 namespace N {
16086 template <class T> class C {};
16087 }
16088 class X {
16089 template <class T> friend class N::C; // #1, valid code
16090 };
16091 template <class T> class Y {
16092 friend class N::C; // #2, invalid code
16093 };
16095 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
16096 name lookup of `N::C'. We see that friend declaration must
16097 be template for the code to be valid. Note that
16098 processing_template_decl does not work here since it is
16099 always 1 for the above two cases. */
16101 decl = (cp_parser_maybe_treat_template_as_class
16106 {
16108 identifier,
16111 }
16114 {
16118 allow_template);
16122 }
16124 /* Forward declarations of nested types, such as
16126 class C1::C2;
16127 class C1::C2::C3;
16129 are invalid unless all components preceding the final '::'
16130 are complete. If all enclosing types are complete, these
16131 declarations become merely pointless.
16133 Invalid forward declarations of nested types are errors
16134 caught elsewhere in parsing. Those that are pointless arrive
16135 here. */
16142 }
16143 else
16144 {
16145 /* An elaborated-type-specifier sometimes introduces a new type and
16146 sometimes names an existing type. Normally, the rule is that it
16147 introduces a new type only if there is not an existing type of
16148 the same name already in scope. For example, given:
16150 struct S {};
16151 void f() { struct S s; }
16153 the `struct S' in the body of `f' is the same `struct S' as in
16154 the global scope; the existing definition is used. However, if
16155 there were no global declaration, this would introduce a new
16156 local class named `S'.
16158 An exception to this rule applies to the following code:
16160 namespace N { struct S; }
16162 Here, the elaborated-type-specifier names a new type
16163 unconditionally; even if there is already an `S' in the
16164 containing scope this declaration names a new type.
16165 This exception only applies if the elaborated-type-specifier
16166 forms the complete declaration:
16168 [class.name]
16170 A declaration consisting solely of `class-key identifier ;' is
16171 either a redeclaration of the name in the current scope or a
16172 forward declaration of the identifier as a class name. It
16173 introduces the name into the current scope.
16175 We are in this situation precisely when the next token is a `;'.
16177 An exception to the exception is that a `friend' declaration does
16178 *not* name a new type; i.e., given:
16180 struct S { friend struct T; };
16182 `T' is not a new type in the scope of `S'.
16184 Also, `new struct S' or `sizeof (struct S)' never results in the
16185 definition of a new type; a new type can only be declared in a
16186 declaration context. */
16188 tag_scope ts;
16192 /* Friends have special name lookup rules. */
16196 CPP_SEMICOLON))
16197 /* This is a `class-key identifier ;' */
16199 else
16202 template_p =
16203 (template_parm_lists_apply
16206 /* An unqualified name was used to reference this type, so
16207 there were no qualifying templates. */
16215 }
16216 }
16221 /* Allow attributes on forward declarations of classes. */
16223 {
16233 else
16236 }
16239 {
16240 /* Indicate whether this class was declared as a `class' or as a
16241 `struct'. */
16245 }
16247 /* A "<" cannot follow an elaborated type specifier. If that
16248 happens, the user was probably trying to form a template-id. */
16253 }
16255 /* Parse an enum-specifier.
16257 enum-specifier:
16258 enum-head { enumerator-list [opt] }
16259 enum-head { enumerator-list , } [C++0x]
16261 enum-head:
16262 enum-key identifier [opt] enum-base [opt]
16263 enum-key nested-name-specifier identifier enum-base [opt]
16265 enum-key:
16266 enum
16267 enum class [C++0x]
16268 enum struct [C++0x]
16270 enum-base: [C++0x]
16271 : type-specifier-seq
16273 opaque-enum-specifier:
16274 enum-key identifier enum-base [opt] ;
16276 GNU Extensions:
16277 enum-key attributes[opt] identifier [opt] enum-base [opt]
16278 { enumerator-list [opt] }attributes[opt]
16279 enum-key attributes[opt] identifier [opt] enum-base [opt]
16280 { enumerator-list, }attributes[opt] [C++0x]
16282 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
16283 if the token stream isn't an enum-specifier after all. */
16285 static tree
16287 {
16288 tree identifier;
16290 tree prev_scope;
16292 tree attributes;
16305 /* Parse tentatively so that we can back up if we don't find a
16306 enum-specifier. */
16309 /* Caller guarantees that the current token is 'enum', an identifier
16310 possibly follows, and the token after that is an opening brace.
16311 If we don't have an identifier, fabricate an anonymous name for
16312 the enumeration being defined. */
16315 /* Parse the "class" or "struct", which indicates a scoped
16316 enumeration type in C++0x. */
16319 {
16323 /* Consume the `struct' or `class' token. */
16327 }
16331 /* Clear the qualification. */
16336 /* Figure out in what scope the declaration is being placed. */
16342 nested_name_specifier
16350 {
16351 tree name;
16355 enum_type,
16360 input_location);
16362 {
16365 {
16366 /* Are template enums allowed in ISO? */
16370 /* ignore a typename reference, for it will be solved by name
16371 in start_enum. */
16373 }
16374 }
16377 else
16380 }
16381 else
16382 {
16385 else
16386 {
16392 }
16393 }
16396 /* Check for the `:' that denotes a specified underlying type in C++0x.
16397 Note that a ':' could also indicate a bitfield width, however. */
16399 {
16400 cp_decl_specifier_seq type_specifiers;
16402 /* Consume the `:'. */
16405 /* Parse the type-specifier-seq. */
16410 /* At this point this is surely not elaborated type specifier. */
16419 /* If that didn't work, stop. */
16421 {
16427 }
16428 }
16430 /* Look for the `{' but don't consume it yet. */
16432 {
16434 {
16437 {
16440 }
16441 }
16442 /* An opaque-enum-specifier must have a ';' here. */
16445 {
16448 {
16451 }
16452 }
16453 }
16459 {
16461 {
16465 }
16467 {
16469 }
16470 }
16472 /* Issue an error message if type-definitions are forbidden here. */
16475 else
16476 /* Create the new type. We do this before consuming the opening
16477 brace so the enum will be recorded as being on the line of its
16478 tag (or the 'enum' keyword, if there is no tag). */
16482 /* If the next token is not '{' it is an opaque-enum-specifier or an
16483 elaborated-type-specifier. */
16485 {
16489 {
16490 /* The following catches invalid code such as:
16491 enum class S<int>::E { A, B, C }; */
16499 {
16503 nested_name_specifier);
16505 }
16506 /* If that scope does not contain the scope in which the
16507 class was originally declared, the program is invalid. */
16509 nested_name_specifier))
16510 {
16513 "declaration of %qD in namespace %qD which does not "
16516 else
16518 "declaration of %qD in %qD which does not "
16522 }
16523 }
16528 /* Consume the opening brace. */
16535 {
16539 }
16540 else
16541 {
16547 }
16551 /* If the next token is not '}', then there are some enumerators. */
16553 {
16557 }
16558 else
16561 /* Consume the final '}'. */
16567 }
16568 else
16569 {
16570 /* If a ';' follows, then it is an opaque-enum-specifier
16571 and additional restrictions apply. */
16573 {
16580 }
16581 }
16583 /* Look for trailing attributes to apply to this enumeration, and
16584 apply them if appropriate. */
16586 {
16590 trailing_attr,
16592 }
16594 /* Finish up the enumeration. */
16596 {
16601 }
16604 {
16606 {
16609 }
16611 {
16613 }
16614 }
16615 out:
16618 }
16620 /* Parse an enumerator-list. The enumerators all have the indicated
16621 TYPE.
16623 enumerator-list:
16624 enumerator-definition
16625 enumerator-list , enumerator-definition */
16627 static void
16629 {
16631 {
16632 /* Parse an enumerator-definition. */
16635 /* If the next token is not a ',', we've reached the end of
16636 the list. */
16639 /* Otherwise, consume the `,' and keep going. */
16641 /* If the next token is a `}', there is a trailing comma. */
16643 {
16648 }
16649 }
16650 }
16652 /* Parse an enumerator-definition. The enumerator has the indicated
16653 TYPE.
16655 enumerator-definition:
16656 enumerator
16657 enumerator = constant-expression
16659 enumerator:
16660 identifier */
16662 static void
16664 {
16665 tree identifier;
16666 tree value;
16667 location_t loc;
16669 /* Save the input location because we are interested in the location
16670 of the identifier and not the location of the explicit value. */
16673 /* Look for the identifier. */
16678 /* If the next token is an '=', then there is an explicit value. */
16680 {
16681 /* Consume the `=' token. */
16683 /* Parse the value. */
16685 }
16686 else
16689 /* If we are processing a template, make sure the initializer of the
16690 enumerator doesn't contain any bare template parameter pack. */
16694 /* Create the enumerator. */
16696 }
16698 /* Parse a namespace-name.
16700 namespace-name:
16701 original-namespace-name
16702 namespace-alias
16704 Returns the NAMESPACE_DECL for the namespace. */
16706 static tree
16708 {
16709 tree identifier;
16710 tree namespace_decl;
16714 /* Get the name of the namespace. */
16719 /* Look up the identifier in the currently active scope. Look only
16720 for namespaces, due to:
16722 [basic.lookup.udir]
16724 When looking up a namespace-name in a using-directive or alias
16725 definition, only namespace names are considered.
16727 And:
16729 [basic.lookup.qual]
16731 During the lookup of a name preceding the :: scope resolution
16732 operator, object, function, and enumerator names are ignored.
16734 (Note that cp_parser_qualifying_entity only calls this
16735 function if the token after the name is the scope resolution
16736 operator.) */
16738 none_type,
16744 /* If it's not a namespace, issue an error. */
16747 {
16752 }
16755 }
16757 /* Parse a namespace-definition.
16759 namespace-definition:
16760 named-namespace-definition
16761 unnamed-namespace-definition
16763 named-namespace-definition:
16764 original-namespace-definition
16765 extension-namespace-definition
16767 original-namespace-definition:
16768 namespace identifier { namespace-body }
16770 extension-namespace-definition:
16771 namespace original-namespace-name { namespace-body }
16773 unnamed-namespace-definition:
16774 namespace { namespace-body } */
16776 static void
16778 {
16785 {
16789 }
16790 else
16793 /* Look for the `namespace' keyword. */
16796 /* Get the name of the namespace. We do not attempt to distinguish
16797 between an original-namespace-definition and an
16798 extension-namespace-definition at this point. The semantic
16799 analysis routines are responsible for that. */
16802 else
16805 /* Parse any specified attributes. */
16808 /* Look for the `{' to start the namespace. */
16810 /* Start the namespace. */
16813 /* "inline namespace" is equivalent to a stub namespace definition
16814 followed by a strong using directive. */
16816 {
16818 /* Set up namespace association. */
16822 /* Import the contents of the inline namespace. */
16826 }
16830 /* Parse the body of the namespace. */
16836 /* Finish the namespace. */
16838 /* Look for the final `}'. */
16840 }
16842 /* Parse a namespace-body.
16844 namespace-body:
16845 declaration-seq [opt] */
16847 static void
16849 {
16851 }
16853 /* Parse a namespace-alias-definition.
16855 namespace-alias-definition:
16856 namespace identifier = qualified-namespace-specifier ; */
16858 static void
16860 {
16861 tree identifier;
16862 tree namespace_specifier;
16866 /* Look for the `namespace' keyword. */
16868 /* Look for the identifier. */
16872 /* Look for the `=' token. */
16875 {
16877 /* Skip the definition. */
16882 }
16884 /* Look for the qualified-namespace-specifier. */
16885 namespace_specifier
16887 /* Look for the `;' token. */
16890 /* Register the alias in the symbol table. */
16892 }
16894 /* Parse a qualified-namespace-specifier.
16896 qualified-namespace-specifier:
16897 :: [opt] nested-name-specifier [opt] namespace-name
16899 Returns a NAMESPACE_DECL corresponding to the specified
16900 namespace. */
16902 static tree
16904 {
16905 /* Look for the optional `::'. */
16909 /* Look for the optional nested-name-specifier. */
16917 }
16919 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16920 access declaration.
16922 using-declaration:
16923 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16924 using :: unqualified-id ;
16926 access-declaration:
16927 qualified-id ;
16929 */
16931 static bool
16934 {
16938 tree decl;
16939 tree identifier;
16940 tree qscope;
16945 {
16948 }
16949 else
16950 {
16951 /* Look for the `using' keyword. */
16954 /* Peek at the next token. */
16956 /* See if it's `typename'. */
16958 {
16959 /* Remember that we've seen it. */
16961 /* Consume the `typename' token. */
16963 }
16964 }
16966 /* Look for the optional global scope qualification. */
16967 global_scope_p
16972 /* If we saw `typename', or didn't see `::', then there must be a
16973 nested-name-specifier present. */
16975 {
16981 {
16984 }
16985 }
16986 /* Otherwise, we could be in either of the two productions. In that
16987 case, treat the nested-name-specifier as optional. */
16988 else
17000 /* Something has already gone wrong; there's no need to parse
17001 further. Since an error has occurred, the return value of
17002 cp_parser_parse_definitely will be false, as required. */
17006 /* Parse the unqualified-id. */
17014 {
17019 }
17021 /* The function we call to handle a using-declaration is different
17022 depending on what scope we are in. */
17024 ;
17027 /* [namespace.udecl]
17029 A using declaration shall not name a template-id. */
17032 else
17033 {
17035 {
17036 /* Create the USING_DECL. */
17043 {
17046 }
17047 else
17048 /* Add it to the list of members in this class. */
17050 }
17051 else
17052 {
17054 identifier,
17061 {
17064 }
17067 else
17069 }
17070 }
17072 /* Look for the final `;'. */
17077 "access declarations are deprecated "
17078 "in favour of using-declarations; "
17082 }
17084 /* Parse an alias-declaration.
17086 alias-declaration:
17087 using identifier attribute-specifier-seq [opt] = type-id */
17089 static tree
17091 {
17093 location_t id_location;
17095 cp_decl_specifier_seq decl_specs;
17099 /* Look for the `using' keyword. */
17100 cp_token *using_token
17122 /* Now we are going to parse the type-id of the declaration. */
17124 /*
17125 [dcl.type]/3 says:
17127 "A type-specifier-seq shall not define a class or enumeration
17128 unless it appears in the type-id of an alias-declaration (7.1.3) that
17129 is not the declaration of a template-declaration."
17131 In other words, if we currently are in an alias template, the
17132 type-id should not define a type.
17134 So let's set parser->type_definition_forbidden_message in that
17135 case; cp_parser_check_type_definition (called by
17136 cp_parser_class_specifier) will then emit an error if a type is
17137 defined in the type-id. */
17139 {
17143 }
17147 /* Restore the error message if need be. */
17153 {
17156 }
17158 /* A typedef-name can also be introduced by an alias-declaration. The
17159 identifier following the using keyword becomes a typedef-name. It has
17160 the same semantics as if it were introduced by the typedef
17161 specifier. In particular, it does not define a new type and it shall
17162 not appear in the type-id. */
17167 {
17170 ds_attribute,
17171 attrs_token);
17172 }
17174 ds_typedef,
17175 using_token);
17177 ds_alias,
17178 using_token);
17187 else
17193 // Attach constraints to the alias declaration.
17195 {
17199 }
17206 /* If decl is a template, return its TEMPLATE_DECL so that it gets
17207 added into the symbol table; otherwise, return the TYPE_DECL. */
17211 {
17215 }
17218 }
17220 /* Parse a using-directive.
17222 using-directive:
17223 using namespace :: [opt] nested-name-specifier [opt]
17224 namespace-name ; */
17226 static void
17228 {
17229 tree namespace_decl;
17230 tree attribs;
17232 /* Look for the `using' keyword. */
17234 /* And the `namespace' keyword. */
17236 /* Look for the optional `::' operator. */
17238 /* And the optional nested-name-specifier. */
17244 /* Get the namespace being used. */
17246 /* And any specified attributes. */
17248 /* Update the symbol table. */
17250 /* Look for the final `;'. */
17252 }
17254 /* Parse an asm-definition.
17256 asm-definition:
17257 asm ( string-literal ) ;
17259 GNU Extension:
17261 asm-definition:
17262 asm volatile [opt] ( string-literal ) ;
17263 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
17264 asm volatile [opt] ( string-literal : asm-operand-list [opt]
17265 : asm-operand-list [opt] ) ;
17266 asm volatile [opt] ( string-literal : asm-operand-list [opt]
17267 : asm-operand-list [opt]
17268 : asm-clobber-list [opt] ) ;
17269 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
17270 : asm-clobber-list [opt]
17271 : asm-goto-list ) ; */
17273 static void
17275 {
17276 tree string;
17281 tree asm_stmt;
17289 /* Look for the `asm' keyword. */
17294 {
17297 }
17299 /* See if the next token is `volatile'. */
17302 {
17303 /* Remember that we saw the `volatile' keyword. */
17305 /* Consume the token. */
17307 }
17311 {
17312 /* Remember that we saw the `goto' keyword. */
17314 /* Consume the token. */
17316 }
17317 /* Look for the opening `('. */
17320 /* Look for the string. */
17323 {
17327 }
17329 /* If we're allowing GNU extensions, check for the extended assembly
17330 syntax. Unfortunately, the `:' tokens need not be separated by
17331 a space in C, and so, for compatibility, we tolerate that here
17332 too. Doing that means that we have to treat the `::' operator as
17333 two `:' tokens. */
17338 {
17343 /* The extended syntax was used. */
17346 /* Look for outputs. */
17348 {
17349 /* Consume the `:'. */
17351 /* Parse the output-operands. */
17353 CPP_COLON)
17355 CPP_SCOPE)
17357 CPP_CLOSE_PAREN)
17363 }
17364 /* If the next token is `::', there are no outputs, and the
17365 next token is the beginning of the inputs. */
17367 /* The inputs are coming next. */
17370 /* Look for inputs. */
17373 {
17374 /* Consume the `:' or `::'. */
17376 /* Parse the output-operands. */
17378 CPP_COLON)
17380 CPP_SCOPE)
17382 CPP_CLOSE_PAREN))
17387 }
17389 /* The clobbers are coming next. */
17392 /* Look for clobbers. */
17395 {
17397 /* Consume the `:' or `::'. */
17399 /* Parse the clobbers. */
17401 CPP_COLON)
17403 CPP_CLOSE_PAREN))
17405 }
17408 /* The labels are coming next. */
17411 /* Look for labels. */
17414 {
17416 /* Consume the `:' or `::'. */
17418 /* Parse the labels. */
17420 }
17424 }
17428 /* Look for the closing `)'. */
17436 {
17437 /* Create the ASM_EXPR. */
17439 {
17442 /* If the extended syntax was not used, mark the ASM_EXPR. */
17444 {
17450 }
17451 }
17452 else
17454 }
17455 }
17457 /* Declarators [gram.dcl.decl] */
17459 /* Parse an init-declarator.
17461 init-declarator:
17462 declarator initializer [opt]
17464 GNU Extension:
17466 init-declarator:
17467 declarator asm-specification [opt] attributes [opt] initializer [opt]
17469 function-definition:
17470 decl-specifier-seq [opt] declarator ctor-initializer [opt]
17471 function-body
17472 decl-specifier-seq [opt] declarator function-try-block
17474 GNU Extension:
17476 function-definition:
17477 __extension__ function-definition
17479 TM Extension:
17481 function-definition:
17482 decl-specifier-seq [opt] declarator function-transaction-block
17484 The DECL_SPECIFIERS apply to this declarator. Returns a
17485 representation of the entity declared. If MEMBER_P is TRUE, then
17486 this declarator appears in a class scope. The new DECL created by
17487 this declarator is returned.
17489 The CHECKS are access checks that should be performed once we know
17490 what entity is being declared (and, therefore, what classes have
17491 befriended it).
17493 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
17494 for a function-definition here as well. If the declarator is a
17495 declarator for a function-definition, *FUNCTION_DEFINITION_P will
17496 be TRUE upon return. By that point, the function-definition will
17497 have been completely parsed.
17499 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
17500 is FALSE.
17502 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
17503 parsed declaration if it is an uninitialized single declarator not followed
17504 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
17505 if present, will not be consumed. If returned, this declarator will be
17506 created with SD_INITIALIZED but will not call cp_finish_decl.
17508 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
17509 and there is an initializer, the pointed location_t is set to the
17510 location of the '=' or `(', or '{' in C++11 token introducing the
17511 initializer. */
17513 static tree
17523 {
17527 tree prefix_attributes;
17529 tree asm_specification;
17530 tree initializer;
17532 tree scope;
17534 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
17535 initialized with "= ..", CPP_OPEN_PAREN if initialized with
17536 "(...)". */
17547 /* Gather the attributes that were provided with the
17548 decl-specifiers. */
17551 /* Assume that this is not the declarator for a function
17552 definition. */
17556 /* Default arguments are only permitted for function parameters. */
17560 /* Defer access checks while parsing the declarator; we cannot know
17561 what names are accessible until we know what is being
17562 declared. */
17565 /* Parse the declarator. */
17567 declarator
17572 /* Gather up the deferred checks. */
17577 /* If the DECLARATOR was erroneous, there's no need to go
17578 further. */
17582 /* Check that the number of template-parameter-lists is OK. */
17592 /* Figure out what scope the entity declared by the DECLARATOR is
17593 located in. `grokdeclarator' sometimes changes the scope, so
17594 we compute it now. */
17597 /* Perform any lookups in the declared type which were thought to be
17598 dependent, but are not in the scope of the declarator. */
17599 decl_specifiers->type
17602 /* If we're allowing GNU extensions, look for an
17603 asm-specification. */
17605 {
17606 /* Look for an asm-specification. */
17609 }
17610 else
17613 /* Look for attributes. */
17617 /* Peek at the next token. */
17623 {
17624 /* Check to see if the token indicates the start of a
17625 function-definition. */
17627 {
17629 {
17630 /* If a function-definition should not appear here, issue an
17631 error message. */
17635 }
17637 location_t func_brace_location
17640 /* Neither attributes nor an asm-specification are allowed
17641 on a function-definition. */
17644 "an asm-specification is not allowed "
17648 "attributes are not allowed "
17650 /* This is a function-definition. */
17653 /* Parse the function definition. */
17656 decl_specifiers,
17657 declarator,
17658 prefix_attributes);
17659 else
17660 decl =
17661 (cp_parser_function_definition_from_specifiers_and_declarator
17665 {
17666 /* This is where the prologue starts... */
17669 }
17672 }
17673 }
17675 {
17676 /* A non-template declaration involving a function parameter list
17677 containing an implicit template parameter will be made into a
17678 template. If the resulting declaration is not going to be an
17679 actual function then finish the template scope here to prevent it.
17680 An error message will be issued once we have a decl to talk about.
17682 FIXME probably we should do type deduction rather than create an
17683 implicit template, but the standard currently doesn't allow it. */
17686 }
17688 /* [dcl.dcl]
17690 Only in function declarations for constructors, destructors, and
17691 type conversions can the decl-specifier-seq be omitted.
17693 We explicitly postpone this check past the point where we handle
17694 function-definitions because we tolerate function-definitions
17695 that are missing their return types in some modes. */
17697 {
17701 }
17703 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17707 {
17718 {
17724 }
17725 }
17726 else
17727 {
17728 /* If the init-declarator isn't initialized and isn't followed by a
17729 `,' or `;', it's not a valid init-declarator. */
17732 {
17735 else
17736 {
17740 }
17741 }
17744 }
17746 /* Because start_decl has side-effects, we should only call it if we
17747 know we're going ahead. By this point, we know that we cannot
17748 possibly be looking at any other construct. */
17751 /* Enter the newly declared entry in the symbol table. If we're
17752 processing a declaration in a class-specifier, we wait until
17753 after processing the initializer. */
17755 {
17762 /* Adjust location of decl if declarator->id_loc is more appropriate:
17763 set, and decl wasn't merged with another decl, in which case its
17764 location would be different from input_location, and more accurate. */
17769 }
17771 /* Enter the SCOPE. That way unqualified names appearing in the
17772 initializer will be looked up in SCOPE. */
17775 /* Perform deferred access control checks, now that we know in which
17776 SCOPE the declared entity resides. */
17778 {
17781 /* If the entity being declared is a function, pretend that we
17782 are in its scope. If it is a `friend', it may have access to
17783 things that would not otherwise be accessible. */
17785 {
17788 }
17790 /* Perform access checks for template parameters. */
17793 /* Perform the access control checks for the declarator and the
17794 decl-specifiers. */
17797 /* Restore the saved value. */
17800 }
17802 /* Parse the initializer. */
17807 {
17809 {
17812 else
17813 {
17814 /* If the declaration was erroneous, we don't really
17815 know what the user intended, so just silently
17816 consume the initializer. */
17823 }
17824 }
17825 else
17826 {
17827 /* We want to record the extra mangling scope for in-class
17828 initializers of class members and initializers of static data
17829 member templates. The former involves deferring
17830 parsing of the initializer until end of class as with default
17831 arguments. So right here we only handle the latter. */
17841 }
17842 }
17844 /* The old parser allows attributes to appear after a parenthesized
17845 initializer. Mark Mitchell proposed removing this functionality
17846 on the GCC mailing lists on 2002-08-13. This parser accepts the
17847 attributes -- but ignores them. */
17854 /* And now complain about a non-function implicit template. */
17859 /* For an in-class declaration, use `grokfield' to create the
17860 declaration. */
17862 {
17864 {
17867 }
17875 }
17877 /* Finish processing the declaration. But, skip member
17878 declarations. */
17880 {
17883 asm_specification,
17884 /* If the initializer is in parentheses, then this is
17885 a direct-initialization, which means that an
17886 `explicit' constructor is OK. Otherwise, an
17887 `explicit' constructor cannot be used. */
17890 }
17893 /* Core issue #226 (C++0x only): A default template-argument
17894 shall not be specified in a friend class template
17895 declaration. */
17904 {
17907 else
17909 }
17912 }
17914 /* Parse a declarator.
17916 declarator:
17917 direct-declarator
17918 ptr-operator declarator
17920 abstract-declarator:
17921 ptr-operator abstract-declarator [opt]
17922 direct-abstract-declarator
17924 GNU Extensions:
17926 declarator:
17927 attributes [opt] direct-declarator
17928 attributes [opt] ptr-operator declarator
17930 abstract-declarator:
17931 attributes [opt] ptr-operator abstract-declarator [opt]
17932 attributes [opt] direct-abstract-declarator
17934 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17935 detect constructor, destructor or conversion operators. It is set
17936 to -1 if the declarator is a name, and +1 if it is a
17937 function. Otherwise it is set to zero. Usually you just want to
17938 test for >0, but internally the negative value is used.
17940 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17941 a decl-specifier-seq unless it declares a constructor, destructor,
17942 or conversion. It might seem that we could check this condition in
17943 semantic analysis, rather than parsing, but that makes it difficult
17944 to handle something like `f()'. We want to notice that there are
17945 no decl-specifiers, and therefore realize that this is an
17946 expression, not a declaration.)
17948 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17949 the declarator is a direct-declarator of the form "(...)".
17951 MEMBER_P is true iff this declarator is a member-declarator.
17953 FRIEND_P is true iff this declarator is a friend. */
17957 cp_parser_declarator_kind dcl_kind,
17961 {
17964 cp_cv_quals cv_quals;
17965 tree class_type;
17968 /* Assume this is not a constructor, destructor, or type-conversion
17969 operator. */
17976 /* Check for the ptr-operator production. */
17978 /* Parse the ptr-operator. */
17984 /* If that worked, then we have a ptr-operator. */
17986 {
17987 /* If a ptr-operator was found, then this declarator was not
17988 parenthesized. */
17991 /* The dependent declarator is optional if we are parsing an
17992 abstract-declarator. */
17996 /* Parse the dependent declarator. */
18001 friend_p);
18003 /* If we are parsing an abstract-declarator, we must handle the
18004 case where the dependent declarator is absent. */
18009 declarator = cp_parser_make_indirect_declarator
18011 }
18012 /* Everything else is a direct-declarator. */
18013 else
18014 {
18017 CPP_OPEN_PAREN);
18019 ctor_dtor_or_conv_p,
18021 }
18027 }
18030 // A declarator may have a trailing requires clause. Because the
18031 // requires clause is part of the declarator the function parameters
18032 // are visibile in that expression.
18033 static tree
18035 {
18038 {
18045 }
18047 }
18049 /* Parse a declarator. See cp_parser_basic_declarator for details.
18051 In concepts, we allow a requires-clause to be parsed at
18052 after a function declarator. The program is ill-formed for
18053 any other kind of declarator.
18055 declarator:
18056 basic-declarator requires-clause [opt]
18058 basic-declarator:
18059 direct-declarator
18060 ptr-operator-declarator */
18064 cp_parser_declarator_kind dcl_kind,
18068 {
18071 ctor_dtor_or_conv_p,
18072 parenthesized_p,
18073 member_p,
18074 friend_p);
18078 /* Function declarations may be followed by a trailing
18079 requires-clause. Declarators for function declartions
18080 are function declarators wrapping an id-declarator.
18081 If the inner declarator is anything else, it does not
18082 declare a function. These may also be reference or
18083 pointer declarators enclosing such a function declarator.
18084 In the declaration :
18086 int *f(args)
18088 the declarator is *f(args).
18090 Abstract declarators cannot have a requires-clauses
18091 because they do not declare functions. Here:
18093 void f() -> int& requires false
18095 The trailing return type contains an abstract declarator,
18096 and the requires-clause applies to the function
18097 declaration and not the abstract declarator. */
18099 {
18103 }
18105 }
18107 /* Parse a direct-declarator or direct-abstract-declarator.
18109 direct-declarator:
18110 declarator-id
18111 direct-declarator ( parameter-declaration-clause )
18112 cv-qualifier-seq [opt]
18113 ref-qualifier [opt]
18114 exception-specification [opt]
18115 direct-declarator [ constant-expression [opt] ]
18116 ( declarator )
18118 direct-abstract-declarator:
18119 direct-abstract-declarator [opt]
18120 ( parameter-declaration-clause )
18121 cv-qualifier-seq [opt]
18122 ref-qualifier [opt]
18123 exception-specification [opt]
18124 direct-abstract-declarator [opt] [ constant-expression [opt] ]
18125 ( abstract-declarator )
18127 Returns a representation of the declarator. DCL_KIND is
18128 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
18129 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
18130 we are parsing a direct-declarator. It is
18131 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
18132 of ambiguity we prefer an abstract declarator, as per
18133 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
18134 as for cp_parser_declarator. */
18138 cp_parser_declarator_kind dcl_kind,
18141 {
18151 {
18152 /* Peek at the next token. */
18155 {
18156 /* This is either a parameter-declaration-clause, or a
18157 parenthesized declarator. When we know we are parsing a
18158 named declarator, it must be a parenthesized declarator
18159 if FIRST is true. For instance, `(int)' is a
18160 parameter-declaration-clause, with an omitted
18161 direct-abstract-declarator. But `((*))', is a
18162 parenthesized abstract declarator. Finally, when T is a
18163 template parameter `(T)' is a
18164 parameter-declaration-clause, and not a parenthesized
18165 named declarator.
18167 We first try and parse a parameter-declaration-clause,
18168 and then try a nested declarator (if FIRST is true).
18170 It is not an error for it not to be a
18171 parameter-declaration-clause, even when FIRST is
18172 false. Consider,
18174 int i (int);
18175 int i (3);
18177 The first is the declaration of a function while the
18178 second is the definition of a variable, including its
18179 initializer.
18181 Having seen only the parenthesis, we cannot know which of
18182 these two alternatives should be selected. Even more
18183 complex are examples like:
18185 int i (int (a));
18186 int i (int (3));
18188 The former is a function-declaration; the latter is a
18189 variable initialization.
18191 Thus again, we try a parameter-declaration-clause, and if
18192 that fails, we back out and return. */
18195 {
18196 tree params;
18199 /* In a member-declarator, the only valid interpretation
18200 of a parenthesis is the start of a
18201 parameter-declaration-clause. (It is invalid to
18202 initialize a static data member with a parenthesized
18203 initializer; only the "=" form of initialization is
18204 permitted.) */
18208 /* Consume the `('. */
18211 {
18212 /* If this is going to be an abstract declarator, we're
18213 in a declarator and we can't have default args. */
18216 }
18220 /* Parse the parameter-declaration-clause. */
18223 /* Consume the `)'. */
18226 /* If all went well, parse the cv-qualifier-seq,
18227 ref-qualifier and the exception-specification. */
18229 {
18230 cp_cv_quals cv_quals;
18231 cp_virt_specifiers virt_specifiers;
18232 cp_ref_qualifier ref_qual;
18233 tree exception_specification;
18234 tree late_return;
18235 tree attrs;
18245 /* Parse the cv-qualifier-seq. */
18247 /* Parse the ref-qualifier. */
18249 /* And the exception-specification. */
18250 exception_specification
18255 /* In here, we handle cases where attribute is used after
18256 the function declaration. For example:
18257 void func (int x) __attribute__((vector(..))); */
18260 {
18264 CPP_SEMICOLON)
18266 CPP_OPEN_BRACE))
18269 ;
18270 else
18272 }
18273 late_return = (cp_parser_late_return_type_opt
18278 /* Parse the virt-specifier-seq. */
18281 /* Create the function-declarator. */
18283 params,
18284 cv_quals,
18285 virt_specifiers,
18286 ref_qual,
18287 exception_specification,
18288 late_return,
18291 /* Any subsequent parameter lists are to do with
18292 return type, so are not those of the declared
18293 function. */
18295 }
18297 /* Remove the function parms from scope. */
18301 /* Repeat the main loop. */
18303 }
18305 /* If this is the first, we can try a parenthesized
18306 declarator. */
18308 {
18314 /* Consume the `('. */
18316 /* Parse the nested declarator. */
18319 declarator
18325 /* Expect a `)'. */
18332 }
18333 /* Otherwise, we must be done. */
18334 else
18336 }
18340 {
18341 /* Parse an array-declarator. */
18350 /* Consume the `['. */
18352 /* Peek at the next token. */
18354 /* If the next token is `]', then there is no
18355 constant-expression. */
18357 {
18359 bounds
18369 {
18370 /* Normally, the array bound must be an integral constant
18371 expression. However, as an extension, we allow VLAs
18372 in function scopes as long as they aren't part of a
18373 parameter declaration. */
18377 }
18380 {
18381 /* Remember this wasn't a constant-expression. */
18384 }
18385 }
18386 else
18388 /* Look for the closing `]'. */
18390 {
18393 }
18398 }
18400 {
18401 {
18402 tree qualifying_scope;
18403 tree unqualified_name;
18404 tree attrs;
18405 special_function_kind sfk;
18410 /* Parse a declarator-id */
18413 {
18416 /* If we see an ellipsis, we should be looking at a
18417 parameter pack. */
18419 {
18420 /* Consume the `...' */
18424 }
18425 }
18428 unqualified_name
18432 {
18436 {
18437 /* Check whether an error occurred. */
18440 /* We already consumed the ellipsis to mark a
18441 parameter pack, but we have no way to report it,
18442 so abort the tentative parse. We will be exiting
18443 immediately anyway. */
18445 }
18446 else
18452 && (qualifying_scope
18454 {
18457 }
18458 }
18463 {
18468 }
18474 {
18475 /* In the declaration of a member of a template class
18476 outside of the class itself, the SCOPE will sometimes
18477 be a TYPENAME_TYPE. For example, given:
18479 template <typename T>
18480 int S<T>::R::i = 3;
18482 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
18483 this context, we must resolve S<T>::R to an ordinary
18484 type, rather than a typename type.
18486 The reason we normally avoid resolving TYPENAME_TYPEs
18487 is that a specialization of `S' might render
18488 `S<T>::R' not a type. However, if `S' is
18489 specialized, then this `i' will not be used, so there
18490 is no harm in resolving the types here. */
18491 tree type;
18493 /* Resolve the TYPENAME_TYPE. */
18496 /* If that failed, the declarator is invalid. */
18498 {
18501 "cannot define member of dependent typedef "
18503 else
18508 }
18510 }
18515 {
18516 tree class_type;
18521 else
18525 {
18528 {
18531 {
18535 "use %<%T::%D%> instead of %<%T::%D%> to "
18537 class_type,
18542 }
18543 else
18545 }
18546 else
18547 {
18548 /* We do not attempt to print the declarator
18549 here because we do not have enough
18550 information about its original syntactic
18551 form. */
18555 }
18556 }
18559 {
18565 for an anonymous type, even if the type
18566 got a name for linkage purposes. */
18568 /* Handle correctly (c++/19200):
18570 struct S {
18571 struct T{};
18572 friend void S(T);
18573 };
18575 and also:
18577 namespace N {
18578 void S();
18579 }
18581 struct S {
18582 friend void N::S();
18583 }; */
18584 && !(friend_p
18587 class_type))
18588 {
18591 }
18599 }
18600 }
18602 unqualified_name,
18603 sfk);
18610 }
18612 handle_declarator:;
18615 {
18616 /* Any names that appear after the declarator-id for a
18617 member are looked up in the containing scope. */
18619 {
18620 /* But declarations with qualified-ids can't appear in a
18621 function. */
18625 }
18627 }
18631 /* Default args are only allowed on function
18632 declarations. */
18634 else
18638 }
18639 /* We're done. */
18640 else
18642 }
18644 /* For an abstract declarator, we might wind up with nothing at this
18645 point. That's an error; the declarator is not optional. */
18649 /* If we entered a scope, we must exit it now. */
18657 }
18659 /* Parse a ptr-operator.
18661 ptr-operator:
18662 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18663 * cv-qualifier-seq [opt]
18664 &
18665 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
18666 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18668 GNU Extension:
18670 ptr-operator:
18671 & cv-qualifier-seq [opt]
18673 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
18674 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
18675 an rvalue reference. In the case of a pointer-to-member, *TYPE is
18676 filled in with the TYPE containing the member. *CV_QUALS is
18677 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
18678 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
18679 Note that the tree codes returned by this function have nothing
18680 to do with the types of trees that will be eventually be created
18681 to represent the pointer or reference type being parsed. They are
18682 just constants with suggestive names. */
18683 static enum tree_code
18688 {
18693 /* Assume that it's not a pointer-to-member. */
18695 /* And that there are no cv-qualifiers. */
18698 /* Peek at the next token. */
18701 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18711 {
18712 /* Consume the `*', `&' or `&&'. */
18715 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18716 `&', if we are allowing GNU extensions. (The only qualifier
18717 that can legally appear after `&' is `restrict', but that is
18718 enforced during semantic analysis. */
18726 }
18727 else
18728 {
18729 /* Try the pointer-to-member case. */
18731 /* Look for the optional `::' operator. */
18734 /* Look for the nested-name specifier. */
18741 /* If we found it, and the next token is a `*', then we are
18742 indeed looking at a pointer-to-member operator. */
18745 {
18746 /* Indicate that the `*' operator was used. */
18754 else
18755 {
18756 /* The type of which the member is a member is given by the
18757 current SCOPE. */
18759 /* The next name will not be qualified. */
18763 /* Look for optional c++11 attributes. */
18767 /* Look for the optional cv-qualifier-seq. */
18769 }
18770 }
18771 /* If that didn't work we don't have a ptr-operator. */
18774 }
18777 }
18779 /* Parse an (optional) cv-qualifier-seq.
18781 cv-qualifier-seq:
18782 cv-qualifier cv-qualifier-seq [opt]
18784 cv-qualifier:
18785 const
18786 volatile
18788 GNU Extension:
18790 cv-qualifier:
18791 __restrict__
18793 Returns a bitmask representing the cv-qualifiers. */
18795 static cp_cv_quals
18797 {
18801 {
18803 cp_cv_quals cv_qualifier;
18805 /* Peek at the next token. */
18807 /* See if it's a cv-qualifier. */
18809 {
18825 }
18831 {
18834 }
18835 else
18836 {
18839 }
18840 }
18843 }
18845 /* Parse an (optional) ref-qualifier
18847 ref-qualifier:
18848 &
18849 &&
18851 Returns cp_ref_qualifier representing ref-qualifier. */
18853 static cp_ref_qualifier
18855 {
18858 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18863 {
18868 {
18880 }
18885 {
18888 }
18889 else
18890 {
18893 }
18894 }
18897 }
18899 /* Parse an (optional) virt-specifier-seq.
18901 virt-specifier-seq:
18902 virt-specifier virt-specifier-seq [opt]
18904 virt-specifier:
18905 override
18906 final
18908 Returns a bitmask representing the virt-specifiers. */
18910 static cp_virt_specifiers
18912 {
18916 {
18918 cp_virt_specifiers virt_specifier;
18920 /* Peek at the next token. */
18922 /* See if it's a virt-specifier-qualifier. */
18926 {
18929 }
18931 {
18934 }
18936 {
18938 }
18939 else
18943 {
18946 }
18947 else
18948 {
18951 }
18952 }
18954 }
18956 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18957 is in scope even though it isn't real. */
18959 void
18961 {
18962 tree this_parm;
18965 {
18966 /* We don't clear this between NSDMIs. Is it already what we want? */
18971 }
18974 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18976 current_class_ref
18979 }
18981 /* Return true iff our current scope is a non-static data member
18982 initializer. */
18984 bool
18986 {
18987 /* We recognize NSDMI context by the context-less 'this' pointer set up
18988 by the function above. */
18994 }
18996 /* Parse a late-specified return type, if any. This is not a separate
18997 non-terminal, but part of a function declarator, which looks like
18999 -> trailing-type-specifier-seq abstract-declarator(opt)
19001 Returns the type indicated by the type-id.
19003 In addition to this this parses any queued up omp declare simd
19004 clauses and Cilk Plus SIMD-enabled function's vector attributes.
19006 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
19007 function. */
19009 static tree
19011 cp_cv_quals quals)
19012 {
19016 && declarator
19022 /* Peek at the next token. */
19024 /* A late-specified return type is indicated by an initial '->'. */
19031 {
19032 /* DR 1207: 'this' is in scope in the trailing return type. */
19034 }
19037 {
19038 /* Consume the ->. */
19041 }
19044 declarator->std_attributes
19048 declarator->std_attributes
19053 {
19056 }
19059 }
19061 /* Parse a declarator-id.
19063 declarator-id:
19064 id-expression
19065 :: [opt] nested-name-specifier [opt] type-name
19067 In the `id-expression' case, the value returned is as for
19068 cp_parser_id_expression if the id-expression was an unqualified-id.
19069 If the id-expression was a qualified-id, then a SCOPE_REF is
19070 returned. The first operand is the scope (either a NAMESPACE_DECL
19071 or TREE_TYPE), but the second is still just a representation of an
19072 unqualified-id. */
19074 static tree
19076 {
19077 tree id;
19078 /* The expression must be an id-expression. Assume that qualified
19079 names are the names of types so that:
19081 template <class T>
19082 int S<T>::R::i = 3;
19084 will work; we must treat `S<T>::R' as the name of a type.
19085 Similarly, assume that qualified names are templates, where
19086 required, so that:
19088 template <class T>
19089 int S<T>::R<T>::i = 3;
19091 will work, too. */
19097 optional_p);
19101 }
19103 /* Parse a type-id.
19105 type-id:
19106 type-specifier-seq abstract-declarator [opt]
19108 Returns the TYPE specified. */
19110 static tree
19113 {
19114 cp_decl_specifier_seq type_specifier_seq;
19117 /* Parse the type-specifier-seq. */
19119 is_trailing_return,
19124 /* There might or might not be an abstract declarator. */
19126 /* Look for the declarator. */
19127 abstract_declarator
19132 /* Check to see if there really was a declarator. */
19137 /* None of the valid uses of 'auto' in C++14 involve the type-id
19138 nonterminal, but it is valid in a trailing-return-type. */
19141 {
19142 /* A type-id with type 'auto' is only ok if the abstract declarator
19143 is a function declarator with a late-specified return type.
19145 A type-id with 'auto' is also valid in a trailing-return-type
19146 in a compound-requirment. */
19153 else
19154 {
19157 }
19158 }
19161 is_template_arg);
19162 }
19165 {
19167 }
19170 {
19171 tree r;
19173 parser->type_definition_forbidden_message
19178 {
19181 }
19183 }
19185 static tree
19187 {
19189 }
19191 /* Parse a type-specifier-seq.
19193 type-specifier-seq:
19194 type-specifier type-specifier-seq [opt]
19196 GNU extension:
19198 type-specifier-seq:
19199 attributes type-specifier-seq [opt]
19201 If IS_DECLARATION is true, we are at the start of a "condition" or
19202 exception-declaration, so we might be followed by a declarator-id.
19204 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
19205 i.e. we've just seen "->".
19207 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
19209 static void
19214 {
19219 /* Clear the TYPE_SPECIFIER_SEQ. */
19222 /* In the context of a trailing return type, enum E { } is an
19223 elaborated-type-specifier followed by a function-body, not an
19224 enum-specifier. */
19228 /* Parse the type-specifiers and attributes. */
19230 {
19231 tree type_specifier;
19234 /* Check for attributes first. */
19236 {
19241 }
19243 /* record the token of the beginning of the type specifier seq,
19244 for error reporting purposes*/
19248 /* Look for the type-specifier. */
19250 flags,
19251 type_specifier_seq,
19253 NULL,
19256 {
19257 /* If the first type-specifier could not be found, this is not a
19258 type-specifier-seq at all. */
19260 {
19261 /* Set in_declarator_p to avoid skipping to the semicolon. */
19273 }
19274 /* If subsequent type-specifiers could not be found, the
19275 type-specifier-seq is complete. */
19277 }
19280 /* The standard says that a condition can be:
19282 type-specifier-seq declarator = assignment-expression
19284 However, given:
19286 struct S {};
19287 if (int S = ...)
19289 we should treat the "S" as a declarator, not as a
19290 type-specifier. The standard doesn't say that explicitly for
19291 type-specifier-seq, but it does say that for
19292 decl-specifier-seq in an ordinary declaration. Perhaps it
19293 would be clearer just to allow a decl-specifier-seq here, and
19294 then add a semantic restriction that if any decl-specifiers
19295 that are not type-specifiers appear, the program is invalid. */
19298 }
19299 }
19301 /* Return whether the function currently being declared has an associated
19302 template parameter list. */
19304 static bool
19306 {
19319 }
19321 /* Parse a parameter-declaration-clause.
19323 parameter-declaration-clause:
19324 parameter-declaration-list [opt] ... [opt]
19325 parameter-declaration-list , ...
19327 Returns a representation for the parameter declarations. A return
19328 value of NULL indicates a parameter-declaration-clause consisting
19329 only of an ellipsis. */
19331 static tree
19333 {
19334 tree parameters;
19343 parser->auto_is_implicit_function_template_parm_p
19345 }
19351 && !processing_template_parmlist
19357 /* Peek at the next token. */
19359 /* Check for trivial parameter-declaration-clauses. */
19361 {
19362 /* Consume the `...' token. */
19365 }
19367 /* There are no parameters. */
19368 {
19369 #ifndef NO_IMPLICIT_EXTERN_C
19374 else
19375 #endif
19377 }
19378 /* Check for `(void)', too, which is a special case. */
19382 {
19383 /* Consume the `void' token. */
19385 /* There are no parameters. */
19387 }
19389 /* Parse the parameter-declaration-list. */
19391 /* If a parse error occurred while parsing the
19392 parameter-declaration-list, then the entire
19393 parameter-declaration-clause is erroneous. */
19397 /* Peek at the next token. */
19399 /* If it's a `,', the clause should terminate with an ellipsis. */
19401 {
19402 /* Consume the `,'. */
19404 /* Expect an ellipsis. */
19405 ellipsis_p
19407 }
19408 /* It might also be `...' if the optional trailing `,' was
19409 omitted. */
19411 {
19412 /* Consume the `...' token. */
19414 /* And remember that we saw it. */
19416 }
19417 else
19420 /* Finish the parameter list. */
19425 }
19427 /* Parse a parameter-declaration-list.
19429 parameter-declaration-list:
19430 parameter-declaration
19431 parameter-declaration-list , parameter-declaration
19433 Returns a representation of the parameter-declaration-list, as for
19434 cp_parser_parameter_declaration_clause. However, the
19435 `void_list_node' is never appended to the list. Upon return,
19436 *IS_ERROR will be true iff an error occurred. */
19438 static tree
19440 {
19446 /* Assume all will go well. */
19448 /* The special considerations that apply to a function within an
19449 unbraced linkage specifications do not apply to the parameters
19450 to the function. */
19451 saved_in_unbraced_linkage_specification_p
19455 /* Look for more parameters. */
19457 {
19465 /* Parse the parameter. */
19466 parameter
19471 /* We don't know yet if the enclosing context is deprecated, so wait
19472 and warn in grokparms if appropriate. */
19476 {
19477 /* If a function parameter pack was specified and an implicit template
19478 parameter was introduced during cp_parser_parameter_declaration,
19479 change any implicit parameters introduced into packs. */
19483 {
19491 }
19495 PARM,
19498 }
19502 /* If a parse error occurred parsing the parameter declaration,
19503 then the entire parameter-declaration-list is erroneous. */
19505 {
19509 }
19519 {
19523 }
19525 /* Add the new parameter to the list. */
19529 /* Peek at the next token. */
19532 /* These are for Objective-C++ */
19535 /* The parameter-declaration-list is complete. */
19538 {
19541 /* Peek at the next token. */
19543 /* If it's an ellipsis, then the list is complete. */
19546 /* Otherwise, there must be more parameters. Consume the
19547 `,'. */
19549 /* When parsing something like:
19551 int i(float f, double d)
19553 we can tell after seeing the declaration for "f" that we
19554 are not looking at an initialization of a variable "i",
19555 but rather at the declaration of a function "i".
19557 Due to the fact that the parsing of template arguments
19558 (as specified to a template-id) requires backtracking we
19559 cannot use this technique when inside a template argument
19560 list. */
19564 /* However, a parameter-declaration of the form
19565 "float(f)" (which is a valid declaration of a
19566 parameter "f") can also be interpreted as an
19567 expression (the conversion of "f" to "float"). */
19570 }
19571 else
19572 {
19580 }
19581 }
19583 parser->in_unbraced_linkage_specification_p
19586 /* Reset implicit_template_scope if we are about to leave the function
19587 parameter list that introduced it. Note that for out-of-line member
19588 definitions, there will be one or more class scopes before we get to
19589 the template parameter scope. */
19593 {
19597 {
19600 }
19601 }
19604 }
19606 /* Parse a parameter declaration.
19608 parameter-declaration:
19609 decl-specifier-seq ... [opt] declarator
19610 decl-specifier-seq declarator = assignment-expression
19611 decl-specifier-seq ... [opt] abstract-declarator [opt]
19612 decl-specifier-seq abstract-declarator [opt] = assignment-expression
19614 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
19615 declares a template parameter. (In that case, a non-nested `>'
19616 token encountered during the parsing of the assignment-expression
19617 is not interpreted as a greater-than operator.)
19619 Returns a representation of the parameter, or NULL if an error
19620 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
19621 true iff the declarator is of the form "(p)". */
19627 {
19629 cp_decl_specifier_seq decl_specifiers;
19631 tree default_argument;
19635 /* In a template parameter, `>' is not an operator.
19637 [temp.param]
19639 When parsing a default template-argument for a non-type
19640 template-parameter, the first non-nested `>' is taken as the end
19641 of the template parameter-list rather than a greater-than
19642 operator. */
19644 /* Type definitions may not appear in parameter types. */
19646 parser->type_definition_forbidden_message
19649 /* Parse the declaration-specifiers. */
19651 CP_PARSER_FLAGS_NONE,
19655 /* Complain about missing 'typename' or other invalid type names. */
19660 /* If an error occurred, there's no reason to attempt to parse the
19661 rest of the declaration. */
19663 {
19666 }
19668 /* Peek at the next token. */
19671 /* If the next token is a `)', `,', `=', `>', or `...', then there
19672 is no declarator. However, when variadic templates are enabled,
19673 there may be a declarator following `...'. */
19678 {
19682 }
19683 /* Otherwise, there should be a declarator. */
19684 else
19685 {
19689 /* After seeing a decl-specifier-seq, if the next token is not a
19690 "(", there is no possibility that the code is a valid
19691 expression. Therefore, if parsing tentatively, we commit at
19692 this point. */
19694 /* In an expression context, having seen:
19696 (int((char ...
19698 we cannot be sure whether we are looking at a
19699 function-type (taking a "char" as a parameter) or a cast
19700 of some object of type "char" to "int". */
19706 /* Parse the declarator. */
19709 CP_PARSER_DECLARATOR_EITHER,
19711 parenthesized_p,
19715 /* After the declarator, allow more attributes. */
19716 decl_specifiers.attributes
19719 }
19721 /* If the next token is an ellipsis, and we have not seen a
19722 declarator name, and the type of the declarator contains parameter
19723 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
19724 a parameter pack expansion expression. Otherwise, leave the
19725 ellipsis for a C-style variadic function. */
19728 {
19739 {
19740 /* Consume the `...'. */
19744 /* Build a pack expansion type */
19747 else
19749 }
19750 }
19752 /* The restriction on defining new types applies only to the type
19753 of the parameter, not to the default argument. */
19756 /* If the next token is `=', then process a default argument. */
19758 {
19761 /* If we are defining a class, then the tokens that make up the
19762 default argument must be saved and processed later. */
19768 // A constrained-type-specifier may declare a type template-parameter.
19770 default_argument
19773 // A constrained-type-specifier may declare a template-template-parameter.
19775 default_argument
19778 /* Outside of a class definition, we can just parse the
19779 assignment-expression. */
19780 else
19781 default_argument
19785 {
19788 else
19789 {
19791 "default arguments are only "
19794 }
19795 }
19799 {
19800 /* Find the name of the parameter pack. */
19807 template_parm_p
19813 else
19815 template_parm_p
19822 }
19823 }
19824 else
19828 declarator,
19829 default_argument);
19830 }
19832 /* Parse a default argument and return it.
19834 TEMPLATE_PARM_P is true if this is a default argument for a
19835 non-type template parameter. */
19836 static tree
19838 {
19844 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19845 set correctly. */
19848 /* Local variable names (and the `this' keyword) may not
19849 appear in a default argument. */
19852 /* Parse the assignment-expression. */
19857 /* The "this" pointer is not valid in a default argument. */
19859 {
19864 }
19865 default_argument
19867 /* Restore the "this" pointer. */
19869 {
19872 }
19881 }
19883 /* Parse a function-body.
19885 function-body:
19886 compound_statement */
19888 static void
19890 {
19892 }
19894 /* Parse a ctor-initializer-opt followed by a function-body. Return
19895 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19896 is true we are parsing a function-try-block. */
19898 static bool
19901 {
19909 /* Begin the function body. */
19911 /* Parse the optional ctor-initializer. */
19914 /* If we're parsing a constexpr constructor definition, we need
19915 to check that the constructor body is indeed empty. However,
19916 before we get to cp_parser_function_body lot of junk has been
19917 generated, so we can't just check that we have an empty block.
19918 Rather we take a snapshot of the outermost block, and check whether
19919 cp_parser_function_body changed its state. */
19921 {
19925 }
19926 /* Parse the function-body. */
19930 /* Finish the function body. */
19934 }
19936 /* Parse an initializer.
19938 initializer:
19939 = initializer-clause
19940 ( expression-list )
19942 Returns an expression representing the initializer. If no
19943 initializer is present, NULL_TREE is returned.
19945 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19946 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19947 set to TRUE if there is no initializer present. If there is an
19948 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19949 is set to true; otherwise it is set to false. */
19951 static tree
19954 {
19956 tree init;
19958 /* Peek at the next token. */
19961 /* Let our caller know whether or not this initializer was
19962 parenthesized. */
19964 /* Assume that the initializer is constant. */
19968 {
19969 /* Consume the `='. */
19971 /* Parse the initializer-clause. */
19973 }
19975 {
19980 non_constant_p);
19985 }
19987 {
19992 }
19993 else
19994 {
19995 /* Anything else is an error. */
19998 }
20001 }
20003 /* Parse an initializer-clause.
20005 initializer-clause:
20006 assignment-expression
20007 braced-init-list
20009 Returns an expression representing the initializer.
20011 If the `assignment-expression' production is used the value
20012 returned is simply a representation for the expression.
20014 Otherwise, calls cp_parser_braced_list. */
20016 static tree
20018 {
20019 tree initializer;
20021 /* Assume the expression is constant. */
20024 /* If it is not a `{', then we are looking at an
20025 assignment-expression. */
20027 {
20028 initializer
20031 non_constant_p);
20032 }
20033 else
20037 }
20039 /* Parse a brace-enclosed initializer list.
20041 braced-init-list:
20042 { initializer-list , [opt] }
20043 { }
20045 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
20046 the elements of the initializer-list (or NULL, if the last
20047 production is used). The TREE_TYPE for the CONSTRUCTOR will be
20048 NULL_TREE. There is no way to detect whether or not the optional
20049 trailing `,' was provided. NON_CONSTANT_P is as for
20050 cp_parser_initializer. */
20052 static tree
20054 {
20055 tree initializer;
20057 /* Consume the `{' token. */
20059 /* Create a CONSTRUCTOR to represent the braced-initializer. */
20061 /* If it's not a `}', then there is a non-trivial initializer. */
20063 {
20064 /* Parse the initializer list. */
20067 /* A trailing `,' token is allowed. */
20070 }
20071 else
20073 /* Now, there should be a trailing `}'. */
20077 }
20079 /* Consume tokens up to, and including, the next non-nested closing `]'.
20080 Returns true iff we found a closing `]'. */
20082 static bool
20084 {
20088 {
20092 {
20095 /* If we've run out of tokens, then there is no closing `]'. */
20104 {
20107 }
20112 }
20114 /* Consume the token. */
20116 }
20117 }
20119 /* Return true if we are looking at an array-designator, false otherwise. */
20121 static bool
20123 {
20124 /* Consume the `['. */
20129 /* Skip tokens until the next token is a closing square bracket.
20130 If we find the closing `]', and the next token is a `=', then
20131 we are looking at an array designator. */
20132 bool array_designator_p
20136 /* Roll back the tokens we skipped. */
20140 }
20142 /* Parse an initializer-list.
20144 initializer-list:
20145 initializer-clause ... [opt]
20146 initializer-list , initializer-clause ... [opt]
20148 GNU Extension:
20150 initializer-list:
20151 designation initializer-clause ...[opt]
20152 initializer-list , designation initializer-clause ...[opt]
20154 designation:
20155 . identifier =
20156 identifier :
20157 [ constant-expression ] =
20159 Returns a vec of constructor_elt. The VALUE of each elt is an expression
20160 for the initializer. If the INDEX of the elt is non-NULL, it is the
20161 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
20162 as for cp_parser_initializer. */
20166 {
20169 /* Assume all of the expressions are constant. */
20172 /* Parse the rest of the list. */
20174 {
20176 tree designator;
20177 tree initializer;
20180 /* If the next token is an identifier and the following one is a
20181 colon, we are looking at the GNU designated-initializer
20182 syntax. */
20186 {
20187 /* Warn the user that they are using an extension. */
20190 /* Consume the identifier. */
20192 /* Consume the `:'. */
20194 }
20195 /* Also handle the C99 syntax, '. id ='. */
20200 {
20201 /* Warn the user that they are using an extension. */
20204 /* Consume the `.'. */
20206 /* Consume the identifier. */
20208 /* Consume the `='. */
20210 }
20211 /* Also handle C99 array designators, '[ const ] ='. */
20215 {
20216 /* In C++11, [ could start a lambda-introducer. */
20222 {
20225 }
20226 else
20227 {
20232 }
20238 }
20239 else
20242 /* Parse the initializer. */
20245 /* If any clause is non-constant, so is the entire initializer. */
20249 /* If we have an ellipsis, this is an initializer pack
20250 expansion. */
20252 {
20253 /* Consume the `...'. */
20256 /* Turn the initializer into an initializer expansion. */
20258 }
20260 /* Add it to the vector. */
20263 /* If the next token is not a comma, we have reached the end of
20264 the list. */
20268 /* Peek at the next token. */
20270 /* If the next token is a `}', then we're still done. An
20271 initializer-clause can have a trailing `,' after the
20272 initializer-list and before the closing `}'. */
20276 /* Consume the `,' token. */
20278 }
20281 }
20283 /* Classes [gram.class] */
20285 /* Parse a class-name.
20287 class-name:
20288 identifier
20289 template-id
20291 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
20292 to indicate that names looked up in dependent types should be
20293 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
20294 keyword has been used to indicate that the name that appears next
20295 is a template. TAG_TYPE indicates the explicit tag given before
20296 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
20297 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
20298 is the class being defined in a class-head.
20300 Returns the TYPE_DECL representing the class. */
20302 static tree
20310 {
20311 tree decl;
20312 tree scope;
20317 /* All class-names start with an identifier. */
20320 {
20323 }
20325 /* PARSER->SCOPE can be cleared when parsing the template-arguments
20326 to a template-id, so we save it here. */
20331 /* Any name names a type if we're following the `typename' keyword
20332 in a qualified name where the enclosing scope is type-dependent. */
20335 /* Handle the common case (an identifier, but not a template-id)
20336 efficiently. */
20339 {
20343 /* Look for the identifier. */
20347 /* If the next token isn't an identifier, we are certainly not
20348 looking at a class-name. */
20351 /* If we know this is a type-name, there's no need to look it
20352 up. */
20355 else
20356 {
20357 tree ambiguous_decls;
20358 /* If we already know that this lookup is ambiguous, then
20359 we've already issued an error message; there's no reason
20360 to check again. */
20362 {
20365 }
20366 /* If the next token is a `::', then the name must be a type
20367 name.
20369 [basic.lookup.qual]
20371 During the lookup for a name preceding the :: scope
20372 resolution operator, object, function, and enumerator
20373 names are ignored. */
20376 /* Look up the name. */
20378 tag_type,
20381 check_dependency_p,
20385 {
20389 }
20390 }
20391 }
20392 else
20393 {
20394 /* Try a template-id. */
20396 check_dependency_p,
20397 tag_type,
20398 is_declaration);
20401 }
20405 /* If this is a typename, create a TYPENAME_TYPE. */
20407 {
20412 }
20416 /* Check to see that it is really the name of a class. */
20420 /* Situations like this:
20422 template <typename T> struct A {
20423 typename T::template X<int>::I i;
20424 };
20426 are problematic. Is `T::template X<int>' a class-name? The
20427 standard does not seem to be definitive, but there is no other
20428 valid interpretation of the following `::'. Therefore, those
20429 names are considered class-names. */
20430 {
20434 }
20438 /* In Objective-C 2.0, a classname followed by '.' starts a
20439 dot-syntax expression, and it's not a type-name. */
20451 }
20453 /* Parse a class-specifier.
20455 class-specifier:
20456 class-head { member-specification [opt] }
20458 Returns the TREE_TYPE representing the class. */
20460 static tree
20462 {
20463 tree type;
20477 /* Parse the class-head. */
20481 /* If the class-head was a semantic disaster, skip the entire body
20482 of the class. */
20484 {
20488 }
20490 /* Look for the `{'. */
20492 {
20495 }
20499 /* Issue an error message if type-definitions are forbidden here. */
20501 /* Remember that we are defining one more class. */
20503 /* Inside the class, surrounding template-parameter-lists do not
20504 apply. */
20505 saved_num_template_parameter_lists
20508 /* We are not in a function body. */
20511 /* Or in a loop. */
20514 /* Or in a switch. */
20517 /* We are not immediately inside an extern "lang" block. */
20518 saved_in_unbraced_linkage_specification_p
20522 // Associate constraints with the type.
20526 /* Start the class. */
20528 {
20531 }
20535 /* If the type is erroneous, skip the entire body of the class. */
20537 else
20538 /* Parse the member-specification. */
20541 /* Look for the trailing `}'. */
20543 /* Look for trailing attributes to apply to this class. */
20551 /* We've finished a type definition. Check for the common syntax
20552 error of forgetting a semicolon after the definition. We need to
20553 be careful, as we can't just check for not-a-semicolon and be done
20554 with it; the user might have typed:
20556 class X { } c = ...;
20557 class X { } *p = ...;
20559 and so forth. Instead, enumerate all the possible tokens that
20560 might follow this production; if we don't see one of them, then
20561 complain and silently insert the semicolon. */
20562 {
20567 /* Don't try to parse c++11 attributes here. As per the
20568 grammar, that should be a task for
20569 cp_parser_decl_specifier_seq. */
20573 {
20584 /* While it's legal for type qualifiers and storage class
20585 specifiers to follow type definitions in the grammar, only
20586 compiler testsuites contain code like that. Assume that if
20587 we see such code, then what we're really seeing is a case
20588 like:
20590 class X { }
20591 const <type> var = ...;
20593 or
20595 class Y { }
20596 static <type> func (...) ...
20598 i.e. the qualifier or specifier applies to the next
20599 declaration. To do so, however, we need to look ahead one
20600 more token to see if *that* token is a type specifier.
20602 This code could be improved to handle:
20604 class Z { }
20605 static const <type> var = ...; */
20608 {
20611 /* Handling user-defined types here would be nice, but very
20612 tricky. */
20613 want_semicolon
20616 }
20620 }
20622 /* If we don't have a type, then something is very wrong and we
20623 shouldn't try to do anything clever. Likewise for not seeing the
20624 closing brace. */
20626 {
20627 cp_token_position prev
20638 else
20641 /* Unget one token and smash it to look as though we encountered
20642 a semicolon in the input stream. */
20647 }
20648 }
20650 /* If this class is not itself within the scope of another class,
20651 then we need to parse the bodies of all of the queued function
20652 definitions. Note that the queued functions defined in a class
20653 are not always processed immediately following the
20654 class-specifier for that class. Consider:
20656 struct A {
20657 struct B { void f() { sizeof (A); } };
20658 };
20660 If `f' were processed before the processing of `A' were
20661 completed, there would be no way to compute the size of `A'.
20662 Note that the nesting we are interested in here is lexical --
20663 not the semantic nesting given by TYPE_CONTEXT. In particular,
20664 for:
20666 struct A { struct B; };
20667 struct A::B { void f() { } };
20669 there is no need to delay the parsing of `A::B::f'. */
20671 {
20672 tree decl;
20679 /* In a first pass, parse default arguments to the functions.
20680 Then, in a second pass, parse the bodies of the functions.
20681 This two-phased approach handles cases like:
20683 struct S {
20684 void f() { g(); }
20685 void g(int i = 3);
20686 };
20688 */
20690 {
20692 /* If there are default arguments that have not yet been processed,
20693 take care of them now. */
20695 {
20700 }
20701 /* Make sure that any template parameters are in scope. */
20703 /* Parse the default argument expressions. */
20705 /* Remove any template parameters from the symbol table. */
20707 }
20709 /* Now parse any NSDMIs. */
20713 {
20715 {
20720 }
20723 }
20730 /* Now do some post-NSDMI bookkeeping. */
20736 /* Now parse the body of the functions. */
20738 {
20739 /* OpenMP UDRs need to be parsed before all other functions. */
20746 }
20747 else
20751 }
20752 else
20755 /* Put back any saved access checks. */
20758 /* Restore saved state. */
20762 parser->num_template_parameter_lists
20764 parser->in_unbraced_linkage_specification_p
20768 }
20770 static tree
20772 {
20773 tree ret;
20778 }
20780 /* Parse a class-head.
20782 class-head:
20783 class-key identifier [opt] base-clause [opt]
20784 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20785 class-key nested-name-specifier [opt] template-id
20786 base-clause [opt]
20788 class-virt-specifier:
20789 final
20791 GNU Extensions:
20792 class-key attributes identifier [opt] base-clause [opt]
20793 class-key attributes nested-name-specifier identifier base-clause [opt]
20794 class-key attributes nested-name-specifier [opt] template-id
20795 base-clause [opt]
20797 Upon return BASES is initialized to the list of base classes (or
20798 NULL, if there are none) in the same form returned by
20799 cp_parser_base_clause.
20801 Returns the TYPE of the indicated class. Sets
20802 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20803 involving a nested-name-specifier was used, and FALSE otherwise.
20805 Returns error_mark_node if this is not a class-head.
20807 Returns NULL_TREE if the class-head is syntactically valid, but
20808 semantically invalid in a way that means we should skip the entire
20809 body of the class. */
20811 static tree
20814 {
20815 tree nested_name_specifier;
20819 tree attributes;
20820 tree bases;
20830 /* Assume no nested-name-specifier will be present. */
20832 /* Assume no template parameter lists will be used in defining the
20833 type. */
20837 /* Look for the class-key. */
20842 /* Parse the attributes. */
20845 /* If the next token is `::', that is invalid -- but sometimes
20846 people do try to write:
20848 struct ::S {};
20850 Handle this gracefully by accepting the extra qualifier, and then
20851 issuing an error about it later if this really is a
20852 class-head. If it turns out just to be an elaborated type
20853 specifier, remain silent. */
20859 /* Determine the name of the class. Begin by looking for an
20860 optional nested-name-specifier. */
20862 nested_name_specifier
20868 /* If there was a nested-name-specifier, then there *must* be an
20869 identifier. */
20871 {
20873 /* Although the grammar says `identifier', it really means
20874 `class-name' or `template-name'. You are only allowed to
20875 define a class that has already been declared with this
20876 syntax.
20878 The proposed resolution for Core Issue 180 says that wherever
20879 you see `class T::X' you should treat `X' as a type-name.
20881 It is OK to define an inaccessible class; for example:
20883 class A { class B; };
20884 class A::B {};
20886 We do not know if we will see a class-name, or a
20887 template-name. We look for a class-name first, in case the
20888 class-name is a template-id; if we looked for the
20889 template-name first we would stop after the template-name. */
20894 class_type,
20898 /* If that didn't work, ignore the nested-name-specifier. */
20900 {
20906 }
20907 /* If we could not find a corresponding TYPE, treat this
20908 declaration like an unqualified declaration. */
20911 /* Otherwise, count the number of templates used in TYPE and its
20912 containing scopes. */
20913 else
20914 {
20915 tree scope;
20927 }
20928 }
20929 /* Otherwise, the identifier is optional. */
20930 else
20931 {
20932 /* We don't know whether what comes next is a template-id,
20933 an identifier, or nothing at all. */
20935 /* Check for a template-id. */
20940 class_key,
20942 /* If that didn't work, it could still be an identifier. */
20944 {
20946 {
20949 }
20950 else
20952 }
20953 else
20954 {
20957 }
20958 }
20963 {
20965 class_key,
20967 }
20970 /* If it's not a `:' or a `{' then we can't really be looking at a
20971 class-head, since a class-head only appears as part of a
20972 class-specifier. We have to detect this situation before calling
20973 xref_tag, since that has irreversible side-effects. */
20975 {
20979 }
20981 /* At this point, we're going ahead with the class-specifier, even
20982 if some other problem occurs. */
20985 {
20990 }
20991 /* Issue the error about the overly-qualified name now. */
20993 {
20998 }
21000 {
21005 }
21007 {
21008 tree scope;
21010 /* Reject typedef-names in class heads. */
21012 {
21015 type);
21018 }
21020 /* Figure out in what scope the declaration is being placed. */
21022 /* If that scope does not contain the scope in which the
21023 class was originally declared, the program is invalid. */
21025 {
21028 "declaration of %qD in namespace %qD which does not "
21031 else
21037 }
21038 /* [dcl.meaning]
21040 A declarator-id shall not be qualified except for the
21041 definition of a ... nested class outside of its class
21042 ... [or] the definition or explicit instantiation of a
21043 class member of a namespace outside of its namespace. */
21045 {
21050 }
21051 }
21052 /* An explicit-specialization must be preceded by "template <>". If
21053 it is not, try to recover gracefully. */
21057 {
21061 /* Take the same action that would have been taken by
21062 cp_parser_explicit_specialization. */
21065 }
21066 /* There must be no "return" statements between this point and the
21067 end of this function; set "type "to the correct return value and
21068 use "goto done;" to return. */
21069 /* Make sure that the right number of template parameters were
21070 present. */
21074 {
21075 /* If something went wrong, there is no point in even trying to
21076 process the class-definition. */
21079 }
21081 /* Look up the type. */
21083 {
21087 {
21091 }
21092 else
21093 {
21096 }
21099 }
21101 {
21102 tree class_type;
21104 /* Given:
21106 template <typename T> struct S { struct T };
21107 template <typename T> struct S<T>::T { };
21109 we will get a TYPENAME_TYPE when processing the definition of
21110 `S::T'. We need to resolve it to the actual type before we
21111 try to define it. */
21113 {
21118 else
21119 {
21122 }
21123 }
21127 {
21130 }
21133 /* Enter the scope indicated by the nested-name-specifier. */
21135 /* Get the canonical version of this type. */
21137 /* Call push_template_decl if it seems like we should be defining a
21138 template either from the template headers or the type we're
21139 defining, so that we diagnose both extra and missing headers. */
21143 {
21146 {
21149 }
21150 }
21154 }
21156 {
21157 /* If the class was unnamed, create a dummy name. */
21162 }
21164 /* Indicate whether this class was declared as a `class' or as a
21165 `struct'. */
21170 /* If this type was already complete, and we see another definition,
21171 that's an error. */
21173 {
21175 type);
21177 type);
21180 }
21185 {
21186 /* Apply attributes now, before any use of the class as a template
21187 argument in its base list. */
21190 }
21192 /* We will have entered the scope containing the class; the names of
21193 base classes should be looked up in that context. For example:
21195 struct A { struct B {}; struct C; };
21196 struct A::C : B {};
21198 is valid. */
21200 /* Get the list of base-classes, if there is one. */
21202 {
21203 /* PR59482: enter the class scope so that base-specifiers are looked
21204 up correctly. */
21208 /* PR59482: get out of the previously pushed class scope so that the
21209 subsequent pops pop the right thing. */
21212 }
21213 else
21216 /* If we're really defining a class, process the base classes.
21217 If they're invalid, fail. */
21222 done:
21223 /* Leave the scope given by the nested-name-specifier. We will
21224 enter the class scope itself while processing the members. */
21229 {
21232 }
21238 out:
21241 }
21243 /* Parse a class-key.
21245 class-key:
21246 class
21247 struct
21248 union
21250 Returns the kind of class-key specified, or none_type to indicate
21251 error. */
21253 static enum tag_types
21255 {
21259 /* Look for the class-key. */
21264 /* Check to see if the TOKEN is a class-key. */
21269 }
21271 /* Parse a type-parameter-key.
21273 type-parameter-key:
21274 class
21275 typename
21276 */
21278 static void
21280 {
21281 /* Look for the type-parameter-key. */
21285 {
21288 /* typename is not allowed in a template template parameter
21289 by the standard until C++1Z. */
21291 "ISO C++ forbids typename key in template template parameter;"
21293 }
21294 else
21298 }
21300 /* Parse an (optional) member-specification.
21302 member-specification:
21303 member-declaration member-specification [opt]
21304 access-specifier : member-specification [opt] */
21306 static void
21308 {
21310 {
21314 /* Peek at the next token. */
21316 /* If it's a `}', or EOF then we've seen all the members. */
21322 /* See if this token is a keyword. */
21325 {
21329 /* Consume the access-specifier. */
21331 /* Remember which access-specifier is active. */
21333 /* Look for the `:'. */
21338 /* Accept #pragmas at class scope. */
21340 {
21343 }
21345 /* Otherwise, the next construction must be a
21346 member-declaration. */
21348 }
21349 }
21350 }
21352 /* Parse a member-declaration.
21354 member-declaration:
21355 decl-specifier-seq [opt] member-declarator-list [opt] ;
21356 function-definition ; [opt]
21357 :: [opt] nested-name-specifier template [opt] unqualified-id ;
21358 using-declaration
21359 template-declaration
21360 alias-declaration
21362 member-declarator-list:
21363 member-declarator
21364 member-declarator-list , member-declarator
21366 member-declarator:
21367 declarator pure-specifier [opt]
21368 declarator constant-initializer [opt]
21369 identifier [opt] : constant-expression
21371 GNU Extensions:
21373 member-declaration:
21374 __extension__ member-declaration
21376 member-declarator:
21377 declarator attributes [opt] pure-specifier [opt]
21378 declarator attributes [opt] constant-initializer [opt]
21379 identifier [opt] attributes [opt] : constant-expression
21381 C++0x Extensions:
21383 member-declaration:
21384 static_assert-declaration */
21386 static void
21388 {
21389 cp_decl_specifier_seq decl_specifiers;
21390 tree prefix_attributes;
21391 tree decl;
21400 /* Check for the `__extension__' keyword. */
21402 {
21403 /* Recurse. */
21405 /* Restore the old value of the PEDANTIC flag. */
21409 }
21411 /* Check for a template-declaration. */
21413 {
21414 /* An explicit specialization here is an error condition, and we
21415 expect the specialization handler to detect and report this. */
21419 else
21423 }
21425 /* Check for a using-declaration. */
21427 {
21429 {
21430 /* Parse the using-declaration. */
21434 }
21435 else
21436 {
21437 tree decl;
21441 /* Note that if we actually see the '=' token after the
21442 identifier, cp_parser_alias_declaration commits the
21443 tentative parse. In that case, we really expect an
21444 alias-declaration. Otherwise, we expect a using
21445 declaration. */
21446 alias_decl_expected =
21452 else
21456 }
21457 }
21459 /* Check for @defs. */
21461 {
21466 {
21471 }
21473 }
21475 /* If the next token is `static_assert' we have a static assertion. */
21477 {
21480 }
21482 /* Tentatively parse for a template since we may have a concept
21483 introduction. */
21494 /* Parse the decl-specifier-seq. */
21497 CP_PARSER_FLAGS_OPTIONAL,
21500 /* Check for an invalid type-name. */
21504 /* If there is no declarator, then the decl-specifier-seq should
21505 specify a type. */
21507 {
21508 /* If there was no decl-specifier-seq, and the next token is a
21509 `;', then we have something like:
21511 struct S { ; };
21513 [class.mem]
21515 Each member-declaration shall declare at least one member
21516 name of the class. */
21518 {
21522 }
21523 else
21524 {
21525 tree type;
21527 /* See if this declaration is a friend. */
21529 /* If there were decl-specifiers, check to see if there was
21530 a class-declaration. */
21533 /* Nested classes have already been added to the class, but
21534 a `friend' needs to be explicitly registered. */
21536 {
21537 /* If the `friend' keyword was present, the friend must
21538 be introduced with a class-key. */
21541 "in C++03 a class-key must be used "
21543 /* In this case:
21545 template <typename T> struct A {
21546 friend struct A<T>::B;
21547 };
21549 A<T>::B will be represented by a TYPENAME_TYPE, and
21550 therefore not recognized by check_tag_decl. */
21552 {
21556 }
21559 "friend declaration does not name a class or "
21561 else
21564 }
21565 /* If there is no TYPE, an error message will already have
21566 been issued. */
21568 ;
21569 /* An anonymous aggregate has to be handled specially; such
21570 a declaration really declares a data member (with a
21571 particular type), as opposed to a nested class. */
21573 {
21574 /* C++11 9.5/6. */
21577 "a storage class on an anonymous aggregate "
21580 /* Remove constructors and such from TYPE, now that we
21581 know it is an anonymous aggregate. */
21583 /* And make the corresponding data member. */
21586 /* Add it to the class. */
21588 }
21589 else
21590 cp_parser_check_access_in_redeclaration
21593 }
21594 }
21595 else
21596 {
21599 /* Clear attributes from the decl_specifiers but keep them
21600 around as prefix attributes that apply them to the entity
21601 being declared. */
21605 /* See if these declarations will be friends. */
21608 /* Keep going until we hit the `;' at the end of the
21609 declaration. */
21611 {
21613 tree first_attribute;
21615 /* Peek at the next token. */
21618 /* Check for a bitfield declaration. */
21623 {
21624 tree identifier;
21625 tree width;
21627 /* Get the name of the bitfield. Note that we cannot just
21628 check TOKEN here because it may have been invalidated by
21629 the call to cp_lexer_peek_nth_token above. */
21632 else
21635 /* Consume the `:' token. */
21637 /* Get the width of the bitfield. */
21638 width
21641 /* Look for attributes that apply to the bitfield. */
21643 /* Remember which attributes are prefix attributes and
21644 which are not. */
21646 /* Combine the attributes. */
21649 /* Create the bitfield declaration. */
21652 identifier,
21653 sfk_none)
21656 width,
21657 attributes);
21658 }
21659 else
21660 {
21662 tree initializer;
21663 tree asm_specification;
21666 /* Parse the declarator. */
21667 declarator
21672 friend_p);
21674 /* If something went wrong parsing the declarator, make sure
21675 that we at least consume some tokens. */
21677 {
21678 /* Skip to the end of the statement. */
21680 /* If the next token is not a semicolon, that is
21681 probably because we just skipped over the body of
21682 a function. So, we consume a semicolon if
21683 present, but do not issue an error message if it
21684 is not present. */
21686 CPP_SEMICOLON))
21689 }
21692 cp_parser_check_for_definition_in_return_type
21696 /* Look for an asm-specification. */
21698 /* Look for attributes that apply to the declaration. */
21700 /* Remember which attributes are prefix attributes and
21701 which are not. */
21703 /* Combine the attributes. */
21706 /* If it's an `=', then we have a constant-initializer or a
21707 pure-specifier. It is not correct to parse the
21708 initializer before registering the member declaration
21709 since the member declaration should be in scope while
21710 its initializer is processed. However, the rest of the
21711 front end does not yet provide an interface that allows
21712 us to handle this correctly. */
21714 {
21715 /* In [class.mem]:
21717 A pure-specifier shall be used only in the declaration of
21718 a virtual function.
21720 A member-declarator can contain a constant-initializer
21721 only if it declares a static member of integral or
21722 enumeration type.
21724 Therefore, if the DECLARATOR is for a function, we look
21725 for a pure-specifier; otherwise, we look for a
21726 constant-initializer. When we call `grokfield', it will
21727 perform more stringent semantics checks. */
21739 {
21741 /* Don't require a constant rvalue in C++11, since we
21742 might want a reference constant. We'll enforce
21743 constancy later. */
21745 /* Parse the initializer. */
21748 }
21749 else
21750 /* Parse the initializer. */
21752 }
21755 {
21759 else
21761 }
21762 /* Otherwise, there is no initializer. */
21763 else
21766 /* See if we are probably looking at a function
21767 definition. We are certainly not looking at a
21768 member-declarator. Calling `grokfield' has
21769 side-effects, so we must not do it unless we are sure
21770 that we are looking at a member-declarator. */
21773 {
21774 /* The grammar does not allow a pure-specifier to be
21775 used when a member function is defined. (It is
21776 possible that this fact is an oversight in the
21777 standard, since a pure function may be defined
21778 outside of the class-specifier. */
21784 declarator,
21785 attributes);
21788 /* If the member was not a friend, declare it here. */
21792 /* Peek at the next token. */
21794 /* If the next token is a semicolon, consume it. */
21798 }
21799 else
21802 /* Create the declaration. */
21807 {
21810 else
21812 }
21813 }
21817 /* Reset PREFIX_ATTRIBUTES. */
21823 /* If there is any qualification still in effect, clear it
21824 now; we will be starting fresh with the next declarator. */
21828 /* If it's a `,', then there are more declarators. */
21830 {
21833 {
21837 }
21838 }
21839 /* If the next token isn't a `;', then we have a parse error. */
21841 CPP_SEMICOLON))
21842 {
21843 /* The next token might be a ways away from where the
21844 actual semicolon is missing. Find the previous token
21845 and use that for our error position. */
21850 /* Assume that the user meant to provide a semicolon. If
21851 we were to cp_parser_skip_to_end_of_statement, we might
21852 skip to a semicolon inside a member function definition
21853 and issue nonsensical error messages. */
21855 }
21858 {
21859 /* Add DECL to the list of members. */
21861 /* Explicitly include, eg, NSDMIs, for better error
21862 recovery (c++/58650). */
21871 /* Add DECL to the queue of NSDMI to be parsed later. */
21873 }
21877 }
21878 }
21881 out:
21883 }
21885 /* Parse a pure-specifier.
21887 pure-specifier:
21888 = 0
21890 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21891 Otherwise, ERROR_MARK_NODE is returned. */
21893 static tree
21895 {
21898 /* Look for the `=' token. */
21901 /* Look for the `0' token. */
21910 /* Accept = default or = delete in c++0x mode. */
21913 {
21916 }
21918 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21920 {
21925 }
21927 {
21930 }
21933 }
21935 /* Parse a constant-initializer.
21937 constant-initializer:
21938 = constant-expression
21940 Returns a representation of the constant-expression. */
21942 static tree
21944 {
21945 /* Look for the `=' token. */
21949 /* It is invalid to write:
21951 struct S { static const int i = { 7 }; };
21953 */
21955 {
21958 /* Consume the opening brace. */
21960 /* Skip the initializer. */
21962 /* Look for the trailing `}'. */
21966 }
21969 }
21971 /* Derived classes [gram.class.derived] */
21973 /* Parse a base-clause.
21975 base-clause:
21976 : base-specifier-list
21978 base-specifier-list:
21979 base-specifier ... [opt]
21980 base-specifier-list , base-specifier ... [opt]
21982 Returns a TREE_LIST representing the base-classes, in the order in
21983 which they were declared. The representation of each node is as
21984 described by cp_parser_base_specifier.
21986 In the case that no bases are specified, this function will return
21987 NULL_TREE, not ERROR_MARK_NODE. */
21989 static tree
21991 {
21994 /* Look for the `:' that begins the list. */
21997 /* Scan the base-specifier-list. */
21999 {
22001 tree base;
22004 /* Look for the base-specifier. */
22006 /* Look for the (optional) ellipsis. */
22008 {
22009 /* Consume the `...'. */
22013 }
22015 /* Add BASE to the front of the list. */
22017 {
22019 /* Make this a pack expansion type. */
22023 {
22026 }
22027 }
22028 /* Peek at the next token. */
22030 /* If it's not a comma, then the list is complete. */
22033 /* Consume the `,'. */
22035 }
22037 /* PARSER->SCOPE may still be non-NULL at this point, if the last
22038 base class had a qualified name. However, the next name that
22039 appears is certainly not qualified. */
22045 }
22047 /* Parse a base-specifier.
22049 base-specifier:
22050 :: [opt] nested-name-specifier [opt] class-name
22051 virtual access-specifier [opt] :: [opt] nested-name-specifier
22052 [opt] class-name
22053 access-specifier virtual [opt] :: [opt] nested-name-specifier
22054 [opt] class-name
22056 Returns a TREE_LIST. The TREE_PURPOSE will be one of
22057 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
22058 indicate the specifiers provided. The TREE_VALUE will be a TYPE
22059 (or the ERROR_MARK_NODE) indicating the type that was specified. */
22061 static tree
22063 {
22071 tree type;
22073 /* Process the optional `virtual' and `access-specifier'. */
22075 {
22076 /* Peek at the next token. */
22078 /* Process `virtual'. */
22080 {
22082 /* If `virtual' appears more than once, issue an error. */
22084 {
22088 }
22092 /* Consume the `virtual' token. */
22100 /* If more than one access specifier appears, issue an
22101 error. */
22104 {
22108 }
22112 /* Consume the access-specifier. */
22120 }
22121 }
22122 /* It is not uncommon to see programs mechanically, erroneously, use
22123 the 'typename' keyword to denote (dependent) qualified types
22124 as base classes. */
22126 {
22131 else
22133 "keyword %<typename%> not allowed in this context "
22136 }
22138 /* Look for the optional `::' operator. */
22140 /* Look for the nested-name-specifier. The simplest way to
22141 implement:
22143 [temp.res]
22145 The keyword `typename' is not permitted in a base-specifier or
22146 mem-initializer; in these contexts a qualified name that
22147 depends on a template-parameter is implicitly assumed to be a
22148 type name.
22150 is to pretend that we have seen the `typename' keyword at this
22151 point. */
22155 typename_type,
22157 /* If the base class is given by a qualified name, assume that names
22158 we see are type names or templates, as appropriate. */
22164 /* DR 950 allows decltype as a base-specifier. */
22166 else
22167 {
22168 /* Otherwise, look for the class-name. */
22170 class_scope_p,
22171 template_p,
22172 typename_type,
22177 }
22183 }
22185 /* Exception handling [gram.exception] */
22187 /* Parse an (optional) noexcept-specification.
22189 noexcept-specification:
22190 noexcept ( constant-expression ) [opt]
22192 If no noexcept-specification is present, returns NULL_TREE.
22193 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
22194 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
22195 there are no parentheses. CONSUMED_EXPR will be set accordingly.
22196 Otherwise, returns a noexcept specification unless RETURN_COND is true,
22197 in which case a boolean condition is returned instead. */
22199 static tree
22204 {
22208 /* Peek at the next token. */
22211 /* Is it a noexcept-specification? */
22213 {
22214 tree expr;
22218 {
22222 {
22223 /* Types may not be defined in an exception-specification. */
22225 parser->type_definition_forbidden_message
22230 /* Restore the saved message. */
22232 }
22233 else
22234 {
22237 }
22240 }
22241 else
22242 {
22246 }
22248 /* We cannot build a noexcept-spec right away because this will check
22249 that expr is a constexpr. */
22252 else
22254 }
22255 else
22257 }
22259 /* Parse an (optional) exception-specification.
22261 exception-specification:
22262 throw ( type-id-list [opt] )
22264 Returns a TREE_LIST representing the exception-specification. The
22265 TREE_VALUE of each node is a type. */
22267 static tree
22269 {
22271 tree type_id_list;
22274 /* Peek at the next token. */
22277 /* Is it a noexcept-specification? */
22283 /* If it's not `throw', then there's no exception-specification. */
22287 #if 0
22288 /* Enable this once a lot of code has transitioned to noexcept? */
22292 #endif
22294 /* Consume the `throw'. */
22297 /* Look for the `('. */
22300 /* Peek at the next token. */
22302 /* If it's not a `)', then there is a type-id-list. */
22304 {
22305 /* Types may not be defined in an exception-specification. */
22307 parser->type_definition_forbidden_message
22309 /* Parse the type-id-list. */
22311 /* Restore the saved message. */
22313 }
22314 else
22317 /* Look for the `)'. */
22321 }
22323 /* Parse an (optional) type-id-list.
22325 type-id-list:
22326 type-id ... [opt]
22327 type-id-list , type-id ... [opt]
22329 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
22330 in the order that the types were presented. */
22332 static tree
22334 {
22338 {
22340 tree type;
22342 /* Get the next type-id. */
22344 /* Parse the optional ellipsis. */
22346 {
22347 /* Consume the `...'. */
22350 /* Turn the type into a pack expansion expression. */
22352 }
22353 /* Add it to the list. */
22355 /* Peek at the next token. */
22357 /* If it is not a `,', we are done. */
22360 /* Consume the `,'. */
22362 }
22365 }
22367 /* Parse a try-block.
22369 try-block:
22370 try compound-statement handler-seq */
22372 static tree
22374 {
22375 tree try_block;
22389 }
22391 /* Parse a function-try-block.
22393 function-try-block:
22394 try ctor-initializer [opt] function-body handler-seq */
22396 static bool
22398 {
22399 tree compound_stmt;
22400 tree try_block;
22403 /* Look for the `try' keyword. */
22406 /* Let the rest of the front end know where we are. */
22408 /* Parse the function-body. */
22409 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
22411 /* We're done with the `try' part. */
22413 /* Parse the handlers. */
22415 /* We're done with the handlers. */
22419 }
22421 /* Parse a handler-seq.
22423 handler-seq:
22424 handler handler-seq [opt] */
22426 static void
22428 {
22430 {
22433 /* Parse the handler. */
22435 /* Peek at the next token. */
22437 /* If it's not `catch' then there are no more handlers. */
22440 }
22441 }
22443 /* Parse a handler.
22445 handler:
22446 catch ( exception-declaration ) compound-statement */
22448 static void
22450 {
22451 tree handler;
22452 tree declaration;
22462 }
22464 /* Parse an exception-declaration.
22466 exception-declaration:
22467 type-specifier-seq declarator
22468 type-specifier-seq abstract-declarator
22469 type-specifier-seq
22470 ...
22472 Returns a VAR_DECL for the declaration, or NULL_TREE if the
22473 ellipsis variant is used. */
22475 static tree
22477 {
22478 cp_decl_specifier_seq type_specifiers;
22482 /* If it's an ellipsis, it's easy to handle. */
22484 {
22485 /* Consume the `...' token. */
22488 }
22490 /* Types may not be defined in exception-declarations. */
22492 parser->type_definition_forbidden_message
22495 /* Parse the type-specifier-seq. */
22499 /* If it's a `)', then there is no declarator. */
22502 else
22509 /* Restore the saved message. */
22516 }
22518 /* Parse a throw-expression.
22520 throw-expression:
22521 throw assignment-expression [opt]
22523 Returns a THROW_EXPR representing the throw-expression. */
22525 static tree
22527 {
22528 tree expression;
22533 /* Figure out whether or not there is an assignment-expression
22534 following the "throw" keyword. */
22542 else
22546 }
22548 /* GNU Extensions */
22550 /* Parse an (optional) asm-specification.
22552 asm-specification:
22553 asm ( string-literal )
22555 If the asm-specification is present, returns a STRING_CST
22556 corresponding to the string-literal. Otherwise, returns
22557 NULL_TREE. */
22559 static tree
22561 {
22563 tree asm_specification;
22565 /* Peek at the next token. */
22567 /* If the next token isn't the `asm' keyword, then there's no
22568 asm-specification. */
22572 /* Consume the `asm' token. */
22574 /* Look for the `('. */
22577 /* Look for the string-literal. */
22580 /* Look for the `)'. */
22584 }
22586 /* Parse an asm-operand-list.
22588 asm-operand-list:
22589 asm-operand
22590 asm-operand-list , asm-operand
22592 asm-operand:
22593 string-literal ( expression )
22594 [ string-literal ] string-literal ( expression )
22596 Returns a TREE_LIST representing the operands. The TREE_VALUE of
22597 each node is the expression. The TREE_PURPOSE is itself a
22598 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
22599 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
22600 is a STRING_CST for the string literal before the parenthesis. Returns
22601 ERROR_MARK_NODE if any of the operands are invalid. */
22603 static tree
22605 {
22610 {
22611 tree string_literal;
22612 tree expression;
22613 tree name;
22616 {
22617 /* Consume the `[' token. */
22619 /* Read the operand name. */
22624 /* Look for the closing `]'. */
22626 }
22627 else
22629 /* Look for the string-literal. */
22632 /* Look for the `('. */
22634 /* Parse the expression. */
22636 /* Look for the `)'. */
22644 /* Add this operand to the list. */
22646 expression,
22647 asm_operands);
22648 /* If the next token is not a `,', there are no more
22649 operands. */
22652 /* Consume the `,'. */
22654 }
22657 }
22659 /* Parse an asm-clobber-list.
22661 asm-clobber-list:
22662 string-literal
22663 asm-clobber-list , string-literal
22665 Returns a TREE_LIST, indicating the clobbers in the order that they
22666 appeared. The TREE_VALUE of each node is a STRING_CST. */
22668 static tree
22670 {
22674 {
22675 tree string_literal;
22677 /* Look for the string literal. */
22679 /* Add it to the list. */
22681 /* If the next token is not a `,', then the list is
22682 complete. */
22685 /* Consume the `,' token. */
22687 }
22690 }
22692 /* Parse an asm-label-list.
22694 asm-label-list:
22695 identifier
22696 asm-label-list , identifier
22698 Returns a TREE_LIST, indicating the labels in the order that they
22699 appeared. The TREE_VALUE of each node is a label. */
22701 static tree
22703 {
22707 {
22710 /* Look for the identifier. */
22713 {
22716 {
22722 }
22723 }
22724 /* If the next token is not a `,', then the list is
22725 complete. */
22728 /* Consume the `,' token. */
22730 }
22733 }
22735 /* Return TRUE iff the next tokens in the stream are possibly the
22736 beginning of a GNU extension attribute. */
22738 static bool
22740 {
22742 }
22744 /* Return TRUE iff the next tokens in the stream are possibly the
22745 beginning of a standard C++-11 attribute specifier. */
22747 static bool
22749 {
22751 }
22753 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22754 beginning of a standard C++-11 attribute specifier. */
22756 static bool
22758 {
22766 }
22768 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22769 beginning of a GNU extension attribute. */
22771 static bool
22773 {
22777 }
22779 /* Return true iff the next tokens can be the beginning of either a
22780 GNU attribute list, or a standard C++11 attribute sequence. */
22782 static bool
22784 {
22787 }
22789 /* Return true iff the next Nth tokens can be the beginning of either
22790 a GNU attribute list, or a standard C++11 attribute sequence. */
22792 static bool
22794 {
22797 }
22799 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22800 of GNU attributes, or return NULL. */
22802 static tree
22804 {
22808 }
22810 #define CILK_SIMD_FN_CLAUSE_MASK \
22811 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22812 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22813 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22814 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22815 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22817 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22818 vector [(<clauses>)] */
22820 static void
22822 {
22826 {
22831 }
22834 {
22837 paren_scope++;
22838 }
22840 {
22843 paren_scope++;
22845 paren_scope--;
22846 /* Do not push the last ')' */
22849 }
22858 }
22860 /* Parse an (optional) series of attributes.
22862 attributes:
22863 attributes attribute
22865 attribute:
22866 __attribute__ (( attribute-list [opt] ))
22868 The return value is as for cp_parser_gnu_attribute_list. */
22870 static tree
22872 {
22876 {
22878 tree attribute_list;
22881 /* Peek at the next token. */
22883 /* If it's not `__attribute__', then we're done. */
22887 /* Consume the `__attribute__' keyword. */
22889 /* Look for the two `(' tokens. */
22893 /* Peek at the next token. */
22896 /* Parse the attribute-list. */
22898 else
22899 /* If the next token is a `)', then there is no attribute
22900 list. */
22903 /* Look for the two `)' tokens. */
22911 /* Add these new attributes to the list. */
22913 }
22916 }
22918 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22919 "__vector" or "__vector__." */
22923 {
22927 }
22929 /* Parse a GNU attribute-list.
22931 attribute-list:
22932 attribute
22933 attribute-list , attribute
22935 attribute:
22936 identifier
22937 identifier ( identifier )
22938 identifier ( identifier , expression-list )
22939 identifier ( expression-list )
22941 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22942 to an attribute. The TREE_PURPOSE of each node is the identifier
22943 indicating which attribute is in use. The TREE_VALUE represents
22944 the arguments, if any. */
22946 static tree
22948 {
22954 {
22956 tree identifier;
22957 tree attribute;
22959 /* Look for the identifier. We also allow keywords here; for
22960 example `__attribute__ ((const))' is legal. */
22964 {
22967 /* Consume the token, but save it since we need it for the
22968 SIMD enabled function parsing. */
22971 /* Save away the identifier that indicates which attribute
22972 this is. */
22974 /* For keywords, use the canonical spelling, not the
22975 parsed identifier. */
22981 /* Peek at the next token. */
22983 /* If it's an `(', then parse the attribute arguments. */
22985 {
22990 {
22993 }
22994 else
22995 vec = cp_parser_parenthesized_expression_list
23001 else
23002 {
23005 }
23006 /* Save the arguments away. */
23008 }
23010 {
23013 }
23016 {
23017 /* Add this attribute to the list. */
23020 }
23023 }
23024 /* Now, look for more attributes. If the next token isn't a
23025 `,', we're done. */
23029 /* Consume the comma and keep going. */
23031 }
23034 /* We built up the list in reverse order. */
23036 }
23038 /* Parse a standard C++11 attribute.
23040 The returned representation is a TREE_LIST which TREE_PURPOSE is
23041 the scoped name of the attribute, and the TREE_VALUE is its
23042 arguments list.
23044 Note that the scoped name of the attribute is itself a TREE_LIST
23045 which TREE_PURPOSE is the namespace of the attribute, and
23046 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
23047 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
23048 and which TREE_PURPOSE is directly the attribute name.
23050 Clients of the attribute code should use get_attribute_namespace
23051 and get_attribute_name to get the actual namespace and name of
23052 attributes, regardless of their being GNU or C++11 attributes.
23054 attribute:
23055 attribute-token attribute-argument-clause [opt]
23057 attribute-token:
23058 identifier
23059 attribute-scoped-token
23061 attribute-scoped-token:
23062 attribute-namespace :: identifier
23064 attribute-namespace:
23065 identifier
23067 attribute-argument-clause:
23068 ( balanced-token-seq )
23070 balanced-token-seq:
23071 balanced-token [opt]
23072 balanced-token-seq balanced-token
23074 balanced-token:
23075 ( balanced-token-seq )
23076 [ balanced-token-seq ]
23077 { balanced-token-seq }. */
23079 static tree
23081 {
23085 /* First, parse name of the the attribute, a.k.a
23086 attribute-token. */
23103 {
23104 /* We are seeing a scoped attribute token. */
23114 else
23115 {
23119 }
23121 NULL_TREE);
23123 }
23124 else
23125 {
23127 NULL_TREE);
23128 /* C++11 noreturn attribute is equivalent to GNU's. */
23131 /* C++14 deprecated attribute is equivalent to GNU's. */
23133 {
23136 "%<deprecated%> is a C++14 feature;"
23139 }
23140 }
23142 /* Now parse the optional argument clause of the attribute. */
23147 {
23153 /* A GNU attribute that takes an identifier in parameter. */
23156 vec = cp_parser_parenthesized_expression_list
23162 else
23163 {
23166 }
23170 else
23172 }
23175 }
23177 /* Parse a list of standard C++-11 attributes.
23179 attribute-list:
23180 attribute [opt]
23181 attribute-list , attribute[opt]
23182 attribute ...
23183 attribute-list , attribute ...
23184 */
23186 static tree
23188 {
23193 {
23198 {
23201 }
23206 }
23209 }
23211 /* Parse a standard C++-11 attribute specifier.
23213 attribute-specifier:
23214 [ [ attribute-list ] ]
23215 alignment-specifier
23217 alignment-specifier:
23218 alignas ( type-id ... [opt] )
23219 alignas ( alignment-expression ... [opt] ). */
23221 static tree
23223 {
23229 {
23238 else
23239 /* Warn about parsing c++11 attribute in non-c++1 mode, only
23240 when we are sure that we have actually parsed them. */
23242 }
23243 else
23244 {
23245 tree alignas_expr;
23247 /* Look for an alignment-specifier. */
23259 {
23262 }
23268 {
23272 alignas_expr =
23279 }
23282 {
23285 }
23289 /* Build the C++-11 representation of an 'aligned'
23290 attribute. */
23291 attributes =
23295 }
23298 }
23300 /* Parse a standard C++-11 attribute-specifier-seq.
23302 attribute-specifier-seq:
23303 attribute-specifier-seq [opt] attribute-specifier
23304 */
23306 static tree
23308 {
23312 {
23321 }
23325 }
23327 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
23328 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
23329 current value of the PEDANTIC flag, regardless of whether or not
23330 the `__extension__' keyword is present. The caller is responsible
23331 for restoring the value of the PEDANTIC flag. */
23333 static bool
23335 {
23336 /* Save the old value of the PEDANTIC flag. */
23340 {
23341 /* Consume the `__extension__' token. */
23343 /* We're not being pedantic while the `__extension__' keyword is
23344 in effect. */
23348 }
23351 }
23353 /* Parse a label declaration.
23355 label-declaration:
23356 __label__ label-declarator-seq ;
23358 label-declarator-seq:
23359 identifier , label-declarator-seq
23360 identifier */
23362 static void
23364 {
23365 /* Look for the `__label__' keyword. */
23369 {
23370 tree identifier;
23372 /* Look for an identifier. */
23374 /* If we failed, stop. */
23377 /* Declare it as a label. */
23379 /* If the next token is a `;', stop. */
23382 /* Look for the `,' separating the label declarations. */
23384 }
23386 /* Look for the final `;'. */
23388 }
23390 // -------------------------------------------------------------------------- //
23391 // Requires Clause
23393 // Parse a requires clause.
23394 //
23395 // requires-clause:
23396 // 'requires' logical-or-expression
23397 //
23398 // The required logical-or-expression must be a constant expression. Note
23399 // that we don't check that the expression is constepxr here. We defer until
23400 // we analyze constraints and then, we only check atomic constraints.
23401 static tree
23403 {
23404 // Parse the requires clause so that it is not automatically folded.
23406 tree expr =
23410 }
23412 // Optionally parse a requires clause:
23413 //
23414 // requires-clause:
23415 // 'requires' logical-or-expression
23416 //
23417 // The required logical-or-expression must be a constant expression.
23418 static tree
23420 {
23425 }
23428 /*---------------------------------------------------------------------------
23429 Requires expressions
23430 ---------------------------------------------------------------------------*/
23432 /* Parse a requires expression
23434 requirement-expression:
23435 'requires' requirement-parameter-list [opt] requirement-body */
23436 static tree
23438 {
23442 /* A requires-expression shall appear only within a concept
23443 definition or a requires-clause.
23445 TODO: Implement this diagnostic correctly. */
23447 {
23451 }
23453 /* Local parameters are delared as variables within the scope
23454 of the expression. They are not visible past the end of
23455 the expression. Expressions within the requires-expression
23456 are unevaluated. */
23457 struct scope_sentinel
23458 {
23460 {
23463 }
23466 {
23469 }
23472 /* Parse the optional parameter list. */
23475 {
23479 }
23481 /* Parse the requirement body. */
23487 }
23489 /* Parse a parameterized requirement.
23491 requirement-parameter-list:
23492 '(' parameter-declaration-clause ')' */
23493 static tree
23495 {
23507 }
23509 /* Parse the body of a requirement.
23511 requirement-body:
23512 '{' requirement-list '}' */
23513 static tree
23515 {
23525 }
23527 /* Parse a list of requirements.
23529 requirement-list:
23530 requirement
23531 requirement-list ';' requirement[opt] */
23532 static tree
23534 {
23537 {
23544 /* If we see a semi-colon, consume it. */
23548 /* Stop processing at the end of the list. */
23551 }
23553 /* Reverse the order of requirements so they are analyzed in
23554 declaration order. */
23556 }
23558 /* Parse a syntactic requirement or type requirement.
23560 requirement:
23561 simple-requirement
23562 compound-requirement
23563 type-requirement
23564 nested-requirement */
23565 static tree
23567 {
23574 else
23576 }
23578 /* Parse a simple requirement.
23580 simple-requirement:
23581 expression ';' */
23582 static tree
23584 {
23593 }
23595 /* Parse a type requirement
23597 type-requirement
23598 nested-name-specifier [opt] required-type-name ';'
23600 required-type-name:
23601 type-name
23602 'template' [opt] simple-template-id */
23603 static tree
23605 {
23608 // Save the scope before parsing name specifiers.
23619 tree type;
23621 {
23630 }
23631 else
23634 /* If we got an alias template, unwrap its aliased type. */
23651 }
23653 /* Parse a compound requirement
23655 compound-requirement:
23656 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
23657 static tree
23659 {
23660 /* Parse an expression enclosed in '{ }'s. */
23671 /* Parse the optional noexcept. */
23674 {
23677 }
23679 /* Parse the optional trailing return type. */
23682 {
23690 }
23693 }
23695 /* Parse a nested requirement. This is the same as a requires clause.
23697 nested-requirement:
23698 requires-clause */
23699 static tree
23701 {
23707 }
23709 /* Support Functions */
23711 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
23712 NAME should have one of the representations used for an
23713 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
23714 is returned. If PARSER->SCOPE is a dependent type, then a
23715 SCOPE_REF is returned.
23717 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
23718 returned; the name was already resolved when the TEMPLATE_ID_EXPR
23719 was formed. Abstractly, such entities should not be passed to this
23720 function, because they do not need to be looked up, but it is
23721 simpler to check for this special case here, rather than at the
23722 call-sites.
23724 In cases not explicitly covered above, this function returns a
23725 DECL, OVERLOAD, or baselink representing the result of the lookup.
23726 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
23727 is returned.
23729 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
23730 (e.g., "struct") that was used. In that case bindings that do not
23731 refer to types are ignored.
23733 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
23734 ignored.
23736 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
23737 are ignored.
23739 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
23740 types.
23742 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
23743 TREE_LIST of candidates if name-lookup results in an ambiguity, and
23744 NULL_TREE otherwise. */
23746 static tree
23753 location_t name_location)
23754 {
23755 tree decl;
23758 /* Assume that the lookup will be unambiguous. */
23762 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
23763 no longer valid. Note that if we are parsing tentatively, and
23764 the parse fails, OBJECT_TYPE will be automatically restored. */
23770 /* A template-id has already been resolved; there is no lookup to
23771 do. */
23775 {
23779 }
23781 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
23782 it should already have been checked to make sure that the name
23783 used matches the type being destroyed. */
23785 {
23786 tree type;
23788 /* Figure out to which type this destructor applies. */
23793 else
23795 /* If that's not a class type, there is no destructor. */
23802 /* If it was a class type, return the destructor. */
23804 }
23806 /* By this point, the NAME should be an ordinary identifier. If
23807 the id-expression was a qualified name, the qualifying scope is
23808 stored in PARSER->SCOPE at this point. */
23811 /* Perform the lookup. */
23813 {
23819 /* If the SCOPE is dependent, the lookup must be deferred until
23820 the template is instantiated -- unless we are explicitly
23821 looking up names in uninstantiated templates. Even then, we
23822 cannot look up the name if the scope is not a class type; it
23823 might, for example, be a template type parameter. */
23828 /* Defer lookup. */
23830 else
23831 {
23834 /* If PARSER->SCOPE is a dependent type, then it must be a
23835 class type, and we must not be checking dependencies;
23836 otherwise, we would have processed this lookup above. So
23837 that PARSER->SCOPE is not considered a dependent base by
23838 lookup_member, we must enter the scope here. */
23842 /* If the PARSER->SCOPE is a template specialization, it
23843 may be instantiated during name lookup. In that case,
23844 errors may be issued. Even if we rollback the current
23845 tentative parse, those errors are valid. */
23850 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
23851 lookup result and the nested-name-specifier nominates a class C:
23852 * if the name specified after the nested-name-specifier, when
23853 looked up in C, is the injected-class-name of C (Clause 9), or
23854 * if the name specified after the nested-name-specifier is the
23855 same as the identifier or the simple-template-id's template-
23856 name in the last component of the nested-name-specifier,
23857 the name is instead considered to name the constructor of
23858 class C. [ Note: for example, the constructor is not an
23859 acceptable lookup result in an elaborated-type-specifier so
23860 the constructor would not be used in place of the
23861 injected-class-name. --end note ] Such a constructor name
23862 shall be used only in the declarator-id of a declaration that
23863 names a constructor or in a using-declaration. */
23871 /* If we have a single function from a using decl, pull it out. */
23878 }
23880 /* If the scope is a dependent type and either we deferred lookup or
23881 we did lookup but didn't find the name, rememeber the name. */
23884 {
23886 {
23887 tree type;
23889 /* The resolution to Core Issue 180 says that `struct
23890 A::B' should be considered a type-name, even if `A'
23891 is dependent. */
23896 }
23900 CPP_CLOSE_PAREN)))
23904 else
23907 is_template);
23908 }
23911 }
23913 {
23914 /* Look up the name in the scope of the OBJECT_TYPE, unless the
23915 OBJECT_TYPE is not a class. */
23917 /* If the OBJECT_TYPE is a template specialization, it may
23918 be instantiated during name lookup. In that case, errors
23919 may be issued. Even if we rollback the current tentative
23920 parse, those errors are valid. */
23922 name,
23925 tf_warning_or_error);
23926 else
23930 /* Look it up in the enclosing context. */
23936 }
23937 else
23938 {
23944 }
23946 /* If the lookup failed, let our caller know. */
23950 /* Pull out the template from an injected-class-name (or multiple). */
23954 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
23956 {
23959 /* The error message we have to print is too complicated for
23960 cp_parser_error, so we incorporate its actions directly. */
23962 {
23964 name);
23966 }
23968 }
23976 /* If we have resolved the name of a member declaration, check to
23977 see if the declaration is accessible. When the name resolves to
23978 set of overloaded functions, accessibility is checked when
23979 overload resolution is done.
23981 During an explicit instantiation, access is not checked at all,
23982 as per [temp.explicit]. */
23989 }
23991 /* Like cp_parser_lookup_name, but for use in the typical case where
23992 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
23993 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
23995 static tree
23997 {
23999 none_type,
24004 location);
24005 }
24007 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
24008 the current context, return the TYPE_DECL. If TAG_NAME_P is
24009 true, the DECL indicates the class being defined in a class-head,
24010 or declared in an elaborated-type-specifier.
24012 Otherwise, return DECL. */
24014 static tree
24016 {
24017 /* If the TEMPLATE_DECL is being declared as part of a class-head,
24018 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
24020 struct A {
24021 template <typename T> struct B;
24022 };
24024 template <typename T> struct A::B {};
24026 Similarly, in an elaborated-type-specifier:
24028 namespace N { struct X{}; }
24030 struct A {
24031 template <typename T> friend struct N::X;
24032 };
24034 However, if the DECL refers to a class type, and we are in
24035 the scope of the class, then the name lookup automatically
24036 finds the TYPE_DECL created by build_self_reference rather
24037 than a TEMPLATE_DECL. For example, in:
24039 template <class T> struct S {
24040 S s;
24041 };
24043 there is no need to handle such case. */
24049 }
24051 /* If too many, or too few, template-parameter lists apply to the
24052 declarator, issue an error message. Returns TRUE if all went well,
24053 and FALSE otherwise. */
24055 static bool
24058 location_t declarator_location)
24059 {
24061 {
24063 {
24071 /* If the DECLARATOR has the form `X<y>' then it uses one
24072 additional level of template parameters. */
24075 return cp_parser_check_template_parameters
24077 }
24092 }
24094 }
24096 /* NUM_TEMPLATES were used in the current declaration. If that is
24097 invalid, return FALSE and issue an error messages. Otherwise,
24098 return TRUE. If DECLARATOR is non-NULL, then we are checking a
24099 declarator and we can print more accurate diagnostics. */
24101 static bool
24104 location_t location,
24106 {
24107 /* If there are the same number of template classes and parameter
24108 lists, that's OK. */
24111 /* If there are more, but only one more, then we are referring to a
24112 member template. That's OK too. */
24115 /* If there are more template classes than parameter lists, we have
24116 something like:
24118 template <class T> void S<T>::R<T>::f (); */
24120 {
24130 else
24133 }
24134 /* Otherwise, there are too many template parameter lists. We have
24135 something like:
24137 template <class T> template <class U> void S::f(); */
24140 }
24142 /* Parse an optional `::' token indicating that the following name is
24143 from the global namespace. If so, PARSER->SCOPE is set to the
24144 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
24145 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
24146 Returns the new value of PARSER->SCOPE, if the `::' token is
24147 present, and NULL_TREE otherwise. */
24149 static tree
24151 {
24154 /* Peek at the next token. */
24156 /* If we're looking at a `::' token then we're starting from the
24157 global namespace, not our current location. */
24159 {
24160 /* Consume the `::' token. */
24162 /* Set the SCOPE so that we know where to start the lookup. */
24168 }
24170 {
24174 }
24177 }
24179 /* Returns TRUE if the upcoming token sequence is the start of a
24180 constructor declarator. If FRIEND_P is true, the declarator is
24181 preceded by the `friend' specifier. */
24183 static bool
24185 {
24188 tree nested_name_specifier;
24191 /* The common case is that this is not a constructor declarator, so
24192 try to avoid doing lots of work if at all possible. It's not
24193 valid declare a constructor at function scope. */
24196 /* And only certain tokens can begin a constructor declarator. */
24204 /* Parse tentatively; we are going to roll back all of the tokens
24205 consumed here. */
24207 /* Assume that we are looking at a constructor declarator. */
24210 /* Look for the optional `::' operator. */
24213 /* Look for the nested-name-specifier. */
24214 nested_name_specifier
24225 /* Outside of a class-specifier, there must be a
24226 nested-name-specifier. */
24232 /* If we have a class scope, this is easy; DR 147 says that S::S always
24233 names the constructor, and no other qualified name could. */
24236 {
24246 }
24247 /* If we still think that this might be a constructor-declarator,
24248 look for a class-name. */
24250 {
24251 /* If we have:
24253 template <typename T> struct S {
24254 S();
24255 };
24257 we must recognize that the nested `S' names a class. */
24258 tree type_decl;
24262 none_type,
24266 /* If there was no class-name, then this is not a constructor.
24267 Otherwise, if we are in a class-specifier and we aren't
24268 handling a friend declaration, check that its type matches
24269 current_class_type (c++/38313). Note: error_mark_node
24270 is left alone for error recovery purposes. */
24272 && (outside_class_specifier_p
24277 /* If we're still considering a constructor, we have to see a `(',
24278 to begin the parameter-declaration-clause, followed by either a
24279 `)', an `...', or a decl-specifier. We need to check for a
24280 type-specifier to avoid being fooled into thinking that:
24282 S (f) (int);
24284 is a constructor. (It is actually a function named `f' that
24285 takes one parameter (of type `int') and returns a value of type
24286 `S'. */
24294 /* A parameter declaration begins with a decl-specifier,
24295 which is either the "attribute" keyword, a storage class
24296 specifier, or (usually) a type-specifier. */
24298 {
24299 tree type;
24303 /* Names appearing in the type-specifier should be looked up
24304 in the scope of the class. */
24307 else
24308 {
24311 {
24315 {
24318 }
24319 }
24321 }
24323 /* Inside the constructor parameter list, surrounding
24324 template-parameter-lists do not apply. */
24325 saved_num_template_parameter_lists
24329 /* Look for the type-specifier. */
24331 CP_PARSER_FLAGS_NONE,
24337 parser->num_template_parameter_lists
24340 /* Leave the scope of the class. */
24345 }
24346 }
24348 /* We did not really want to consume any tokens. */
24352 }
24354 /* Parse the definition of the function given by the DECL_SPECIFIERS,
24355 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
24356 they must be performed once we are in the scope of the function.
24358 Returns the function defined. */
24360 static tree
24361 cp_parser_function_definition_from_specifiers_and_declarator
24364 tree attributes,
24366 {
24367 tree fn;
24370 /* Begin the function-definition. */
24373 /* The things we're about to see are not directly qualified by any
24374 template headers we've seen thus far. */
24377 /* If there were names looked up in the decl-specifier-seq that we
24378 did not check, check them now. We must wait until we are in the
24379 scope of the function to perform the checks, since the function
24380 might be a friend. */
24384 {
24387 }
24390 {
24391 /* Skip the entire function. */
24394 }
24396 {
24397 /* Seen already, skip it. An error message has already been output. */
24401 /* If this is a function from a class, pop the nested class. */
24404 }
24405 else
24406 {
24407 timevar_id_t tv;
24410 else
24416 }
24419 }
24421 /* Parse the part of a function-definition that follows the
24422 declarator. INLINE_P is TRUE iff this function is an inline
24423 function defined within a class-specifier.
24425 Returns the function defined. */
24427 static tree
24430 {
24431 tree fn;
24437 bool fully_implicit_function_template_p
24440 tree implicit_template_parms
24443 cp_binding_level* implicit_template_scope
24449 /* If the next token is `return', then the code may be trying to
24450 make use of the "named return value" extension that G++ used to
24451 support. */
24454 {
24455 /* Consume the `return' keyword. */
24457 /* Look for the identifier that indicates what value is to be
24458 returned. */
24460 /* Issue an error message. */
24463 /* Skip tokens until we reach the start of the function body. */
24465 {
24472 }
24473 }
24474 /* The `extern' in `extern "C" void f () { ... }' does not apply to
24475 anything declared inside `f'. */
24476 saved_in_unbraced_linkage_specification_p
24479 /* Inside the function, surrounding template-parameter-lists do not
24480 apply. */
24481 saved_num_template_parameter_lists
24487 /* If the next token is `try', `__transaction_atomic', or
24488 `__transaction_relaxed`, then we are looking at either function-try-block
24489 or function-transaction-block. Note that all of these include the
24490 function-body. */
24493 RID_TRANSACTION_ATOMIC);
24495 RID_TRANSACTION_RELAXED))
24497 RID_TRANSACTION_RELAXED);
24500 else
24501 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
24506 /* Finish the function. */
24509 /* Generate code for it, if necessary. */
24511 /* Restore the saved values. */
24512 parser->in_unbraced_linkage_specification_p
24514 parser->num_template_parameter_lists
24518 parser->fully_implicit_function_template_p
24520 parser->implicit_template_parms
24522 parser->implicit_template_scope
24529 }
24531 #if 0
24532 /* Parse a concept introduction header for a template-declaration. If
24533 successful, returns the template parameters. Otherwise returns
24534 error_mark_node. */
24536 static tree
24538 {
24539 // Look for the optional `::' operator.
24542 // Look for the nested-name-specifier.
24554 // Look for opening brace for introduction
24558 // This must be a concept introduction.
24562 // Build vector of placeholder parameters and grab matching identifiers.
24565 // The introduction-list shall not be empty
24568 {
24571 }
24573 // Look for closing brace for introduction
24577 // Look up the concept for which we will be matching template parameters.
24581 {
24585 }
24587 // Build and associate the constraint.
24594 }
24595 #endif
24597 /* Parse a template-declaration, assuming that the `export' (and
24598 `extern') keywords, if present, has already been scanned. MEMBER_P
24599 is as for cp_parser_template_declaration. */
24601 static void
24603 {
24606 tree parameter_list;
24611 /* Look for the `template' keyword. */
24615 /* Look for the `template' keyword. */
24620 /* And the `<'. */
24624 {
24625 /* 14.5.2.2 [temp.mem]
24627 A local class shall not have member templates. */
24632 }
24633 /* [temp]
24635 A template ... shall not have C linkage. */
24637 {
24639 /* Give it C++ linkage to avoid confusing other parts of the
24640 front end. */
24643 }
24644 else
24647 /* We cannot perform access checks on the template parameter
24648 declarations until we know what is being declared, just as we
24649 cannot check the decl-specifier list. */
24652 /* If the next token is `>', then we have an invalid
24653 specialization. Rather than complain about an invalid template
24654 parameter, issue an error message here. */
24656 {
24660 }
24661 else
24662 {
24663 /* Parse the template parameters. */
24665 }
24667 /* Get the deferred access checks from the parameter list. These
24668 will be checked once we know what is being declared, as for a
24669 member template the checks must be performed in the scope of the
24670 class containing the member. */
24673 /* Look for the `>'. */
24676 /* Manage template requirements */
24678 {
24682 }
24684 }
24686 /* We just processed one more parameter list. */
24688 /* If the next token is `template', there are more template
24689 parameters. */
24691 RID_TEMPLATE))
24696 else
24697 {
24698 /* There are no access checks when parsing a template, as we do not
24699 know if a specialization will be a friend. */
24703 checks,
24704 member_p,
24709 /* If this is a member template declaration, let the front
24710 end know. */
24712 {
24717 }
24722 }
24723 /* We are done with the current parameter list. */
24728 /* Finish up. */
24731 /* Check the template arguments for a literal operator template. */
24735 {
24739 else
24740 {
24743 {
24749 }
24751 {
24759 }
24760 else
24762 }
24764 {
24767 " Expected non-type template argument pack <char...>"
24769 decl);
24770 else
24773 decl);
24774 }
24775 }
24777 /* Register member declarations. */
24780 /* For the erroneous case of a template with C linkage, we pushed an
24781 implicit C++ linkage scope; exit that scope now. */
24784 /* If DECL is a function template, we must return to parse it later.
24785 (Even though there is no definition, there might be default
24786 arguments that need handling.) */
24790 }
24792 /* Perform the deferred access checks from a template-parameter-list.
24793 CHECKS is a TREE_LIST of access checks, as returned by
24794 get_deferred_access_checks. */
24796 static void
24797 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
24798 {
24802 }
24804 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
24805 `function-definition' sequence that follows a template header.
24806 If MEMBER_P is true, this declaration appears in a class scope.
24808 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
24809 *FRIEND_P is set to TRUE iff the declaration is a friend. */
24811 static tree
24817 {
24820 cp_decl_specifier_seq decl_specifiers;
24824 /* This function is only used when processing a template
24825 declaration. */
24829 /* Defer access checks until we know what is being declared. */
24832 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
24833 alternative. */
24836 CP_PARSER_FLAGS_OPTIONAL,
24842 /* There are no template typedefs. */
24844 {
24848 }
24850 /* Gather up the access checks that occurred the
24851 decl-specifier-seq. */
24854 /* Check for the declaration of a template class. */
24856 {
24858 {
24859 // If this is a declaration, but not a definition, associate
24860 // any constraints with the type declaration. Constraints
24861 // are associated with definitions in cp_parser_class_specifier.
24867 /* In this case:
24869 struct C {
24870 friend template <typename T> struct A<T>::B;
24871 };
24873 A<T>::B will be represented by a TYPENAME_TYPE, and
24874 therefore not recognized by shadow_tag. */
24876 && !decl
24883 else
24886 /* Perform access checks for template parameters. */
24888 }
24889 }
24891 /* Complain about missing 'typename' or other invalid type names. */
24894 {
24895 /* cp_parser_parse_and_diagnose_invalid_type_name calls
24896 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
24897 the rest of this declaration. */
24900 }
24902 /* If it's not a template class, try for a template function. If
24903 the next token is a `;', then this declaration does not declare
24904 anything. But, if there were errors in the decl-specifiers, then
24905 the error might well have come from an attempted class-specifier.
24906 In that case, there's no need to warn about a missing declarator. */
24910 {
24913 checks,
24915 member_p,
24916 declares_class_or_enum,
24920 /* 7.1.1-1 [dcl.stc]
24922 A storage-class-specifier shall not be specified in an explicit
24923 specialization... */
24925 && explicit_specialization_p
24927 {
24931 }
24935 }
24937 /* Look for a trailing `;' after the declaration. */
24943 out:
24946 /* Clear any current qualification; whatever comes next is the start
24947 of something new. */
24953 }
24955 /* Parse a cast-expression that is not the operand of a unary "&". */
24957 static tree
24959 {
24962 }
24964 /* Parse a functional cast to TYPE. Returns an expression
24965 representing the cast. */
24967 static tree
24969 {
24971 tree expression_list;
24972 tree cast;
24979 {
24987 tf_warning_or_error);
24988 }
24997 else
24998 {
25001 }
25004 tf_warning_or_error);
25005 /* [expr.const]/1: In an integral constant expression "only type
25006 conversions to integral or enumeration type can be used". */
25012 NIC_CONSTRUCTOR))
25015 }
25017 /* Save the tokens that make up the body of a member function defined
25018 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
25019 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
25020 specifiers applied to the declaration. Returns the FUNCTION_DECL
25021 for the member function. */
25023 static tree
25027 tree attributes)
25028 {
25031 tree fn;
25033 /* Create the FUNCTION_DECL. */
25036 /* If something went badly wrong, bail out now. */
25038 {
25039 /* If there's a function-body, skip it. */
25044 }
25046 /* Remember it, if there default args to post process. */
25049 /* Save away the tokens that make up the body of the
25050 function. */
25052 /* Handle function try blocks. */
25055 /* We can have braced-init-list mem-initializers before the fn body. */
25057 {
25060 {
25061 /* cache_group will stop after an un-nested { } pair, too. */
25065 /* variadic mem-inits have ... after the ')'. */
25068 }
25069 }
25071 /* Handle function try blocks. */
25076 /* Save away the inline definition; we will process it when the
25077 class is complete. */
25081 /* We need to know that this was defined in the class, so that
25082 friend templates are handled correctly. */
25085 /* Add FN to the queue of functions to be parsed later. */
25089 }
25091 /* Save the tokens that make up the in-class initializer for a non-static
25092 data member. Returns a DEFAULT_ARG. */
25094 static tree
25096 {
25098 }
25100 /* Parse a template-argument-list, as well as the trailing ">" (but
25101 not the opening "<"). See cp_parser_template_argument_list for the
25102 return value. */
25104 static tree
25106 {
25107 tree arguments;
25108 tree saved_scope;
25109 tree saved_qualifying_scope;
25110 tree saved_object_scope;
25115 /* [temp.names]
25117 When parsing a template-id, the first non-nested `>' is taken as
25118 the end of the template-argument-list rather than a greater-than
25119 operator. */
25120 saved_greater_than_is_operator_p
25123 /* Parsing the argument list may modify SCOPE, so we save it
25124 here. */
25128 /* We need to evaluate the template arguments, even though this
25129 template-id may be nested within a "sizeof". */
25134 /* Parse the template-argument-list itself. */
25138 else
25140 /* Look for the `>' that ends the template-argument-list. If we find
25141 a '>>' instead, it's probably just a typo. */
25143 {
25145 {
25146 /* In C++0x, a `>>' in a template argument list or cast
25147 expression is considered to be two separate `>'
25148 tokens. So, change the current token to a `>', but don't
25149 consume it: it will be consumed later when the outer
25150 template argument list (or cast expression) is parsed.
25151 Note that this replacement of `>' for `>>' is necessary
25152 even if we are parsing tentatively: in the tentative
25153 case, after calling
25154 cp_parser_enclosed_template_argument_list we will always
25155 throw away all of the template arguments and the first
25156 closing `>', either because the template argument list
25157 was erroneous or because we are replacing those tokens
25158 with a CPP_TEMPLATE_ID token. The second `>' (which will
25159 not have been thrown away) is needed either to close an
25160 outer template argument list or to complete a new-style
25161 cast. */
25164 }
25166 {
25167 /* If we're in a nested template argument list, the '>>' has
25168 to be a typo for '> >'. We emit the error message, but we
25169 continue parsing and we push a '>' as next token, so that
25170 the argument list will be parsed correctly. Note that the
25171 global source location is still on the token before the
25172 '>>', so we need to say explicitly where we want it. */
25178 }
25179 else
25180 {
25181 /* If this is not a nested template argument list, the '>>'
25182 is a typo for '>'. Emit an error message and continue.
25183 Same deal about the token location, but here we can get it
25184 right by consuming the '>>' before issuing the diagnostic. */
25187 "spurious %<>>%>, use %<>%> to terminate "
25189 }
25190 }
25191 else
25193 /* The `>' token might be a greater-than operator again now. */
25194 parser->greater_than_is_operator_p
25196 /* Restore the SAVED_SCOPE. */
25204 }
25206 /* MEMBER_FUNCTION is a member function, or a friend. If default
25207 arguments, or the body of the function have not yet been parsed,
25208 parse them now. */
25210 static void
25212 {
25214 /* If this member is a template, get the underlying
25215 FUNCTION_DECL. */
25219 /* There should not be any class definitions in progress at this
25220 point; the bodies of members are only parsed outside of all class
25221 definitions. */
25223 /* While we're parsing the member functions we might encounter more
25224 classes. We want to handle them right away, but we don't want
25225 them getting mixed up with functions that are currently in the
25226 queue. */
25229 /* Make sure that any template parameters are in scope. */
25232 /* If the body of the function has not yet been parsed, parse it
25233 now. */
25235 {
25236 tree function_scope;
25239 /* The function is no longer pending; we are processing it. */
25244 /* If this is a local class, enter the scope of the containing
25245 function. */
25250 /* Push the body of the function onto the lexer stack. */
25253 /* Let the front end know that we going to be defining this
25254 function. */
25258 /* Don't do access checking if it is a templated function. */
25262 /* #pragma omp declare reduction needs special parsing. */
25264 {
25269 }
25270 else
25271 /* Now, parse the body of the function. */
25278 /* Leave the scope of the containing function. */
25282 }
25284 /* Remove any template parameters from the symbol table. */
25287 /* Restore the queue. */
25290 }
25292 /* If DECL contains any default args, remember it on the unparsed
25293 functions queue. */
25295 static void
25297 {
25298 tree probe;
25301 probe;
25304 {
25308 }
25309 }
25311 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
25312 which is either a FIELD_DECL or PARM_DECL. Parse it and return
25313 the result. For a PARM_DECL, PARMTYPE is the corresponding type
25314 from the parameter-type-list. */
25316 static tree
25319 {
25321 tree parsed_arg;
25327 /* Push the saved tokens for the default argument onto the parser's
25328 lexer stack. */
25334 /* Parse the default argument. */
25345 {
25346 /* In a non-template class, check conversions now. In a template,
25347 we'll wait and instantiate these as needed. */
25350 tf_warning_or_error);
25351 else
25353 }
25355 /* If the token stream has not been completely used up, then
25356 there was extra junk after the end of the default
25357 argument. */
25359 {
25362 else
25364 }
25366 /* Revert to the main lexer. */
25370 }
25372 /* FIELD is a non-static data member with an initializer which we saved for
25373 later; parse it now. */
25375 static void
25377 {
25378 tree def;
25385 NULL_TREE);
25391 }
25393 /* FN is a FUNCTION_DECL which may contains a parameter with an
25394 unparsed DEFAULT_ARG. Parse the default args now. This function
25395 assumes that the current scope is the scope in which the default
25396 argument should be processed. */
25398 static void
25400 {
25404 /* While we're parsing the default args, we might (due to the
25405 statement expression extension) encounter more classes. We want
25406 to handle them right away, but we don't want them getting mixed
25407 up with default args that are currently in the queue. */
25410 /* Local variable names (and the `this' keyword) may not appear
25411 in a default argument. */
25422 {
25424 tree parsed_arg;
25426 tree copy;
25433 /* This can happen for a friend declaration for a function
25434 already declared with default arguments. */
25437 parsed_arg
25439 default_arg,
25442 {
25444 }
25448 /* Update any instantiations we've already created. */
25452 }
25456 /* Make sure no default arg is missing. */
25459 /* Restore the state of local_variables_forbidden_p. */
25462 /* Restore the queue. */
25464 }
25466 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
25468 sizeof ... ( identifier )
25470 where the 'sizeof' token has already been consumed. */
25472 static tree
25474 {
25475 /* Consume the `...'. */
25482 else
25490 /* The name is not qualified. */
25508 }
25510 /* Parse the operand of `sizeof' (or a similar operator). Returns
25511 either a TYPE or an expression, depending on the form of the
25512 input. The KEYWORD indicates which kind of expression we have
25513 encountered. */
25515 static tree
25517 {
25524 /* If it's a `...', then we are computing the length of a parameter
25525 pack. */
25530 /* Types cannot be defined in a `sizeof' expression. Save away the
25531 old message. */
25533 /* And create the new one. */
25539 /* The restrictions on constant-expressions do not apply inside
25540 sizeof expressions. */
25541 saved_integral_constant_expression_p
25543 saved_non_integral_constant_expression_p
25547 /* Do not actually evaluate the expression. */
25550 /* If it's a `(', then we might be looking at the type-id
25551 construction. */
25553 {
25556 /* We can't be sure yet whether we're looking at a type-id or an
25557 expression. */
25559 /* Note: as a GNU Extension, compound literals are considered
25560 postfix-expressions as they are in C99, so they are valid
25561 arguments to sizeof. See comment in cp_parser_cast_expression
25562 for details. */
25565 else
25566 {
25569 /* Look for the type-id. */
25571 /* Look for the closing `)'. */
25574 }
25576 /* If all went well, then we're done. */
25578 {
25579 cp_decl_specifier_seq decl_specs;
25581 /* Build a trivial decl-specifier-seq. */
25585 /* Call grokdeclarator to figure out what type this is. */
25588 TYPENAME,
25591 }
25592 }
25594 /* If the type-id production did not work out, then we must be
25595 looking at the unary-expression production. */
25599 /* Go back to evaluating expressions. */
25603 /* Free the message we created. */
25605 /* And restore the old one. */
25607 parser->integral_constant_expression_p
25609 parser->non_integral_constant_expression_p
25613 }
25615 /* If the current declaration has no declarator, return true. */
25617 static bool
25619 {
25620 /* If the next token is a `;' or a `,' then there is no
25621 declarator. */
25624 }
25626 /* Update the DECL_SPECS to reflect the storage class indicated by
25627 KEYWORD. */
25629 static void
25634 {
25635 cp_storage_class storage_class;
25638 {
25642 }
25644 {
25647 }
25652 {
25655 }
25658 {
25676 }
25680 /* A storage class specifier cannot be applied alongside a typedef
25681 specifier. If there is a typedef specifier present then set
25682 conflicting_specifiers_p which will trigger an error later
25683 on in grokdeclarator. */
25686 }
25688 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
25689 is true, the type is a class or enum definition. */
25691 static void
25693 tree type_spec,
25696 {
25699 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
25700 (with, for example, in "typedef int wchar_t;") we remember that
25701 this is what happened. In system headers, we ignore these
25702 declarations so that G++ can work with system headers that are not
25703 C++-safe. */
25705 && !type_definition_p
25715 {
25718 ds_redefined_builtin_type_spec,
25719 token);
25721 {
25725 }
25726 }
25729 else
25730 {
25735 }
25736 }
25738 /* True iff TOKEN is the GNU keyword __thread. */
25740 static bool
25742 {
25745 }
25747 /* Set the location for a declarator specifier and check if it is
25748 duplicated.
25750 DECL_SPECS is the sequence of declarator specifiers onto which to
25751 set the location.
25753 DS is the single declarator specifier to set which location is to
25754 be set onto the existing sequence of declarators.
25756 LOCATION is the location for the declarator specifier to
25757 consider. */
25759 static void
25762 {
25771 {
25775 }
25776 else
25777 {
25779 {
25783 else
25784 {
25787 OPT_Wlong_long,
25789 }
25790 }
25792 {
25797 else
25799 }
25800 else
25801 {
25817 "__complex"
25818 };
25821 }
25822 }
25823 }
25825 /* Return true iff the declarator specifier DS is present in the
25826 sequence of declarator specifiers DECL_SPECS. */
25828 bool
25830 cp_decl_spec ds)
25831 {
25838 }
25840 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
25841 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
25843 static bool
25845 {
25847 }
25849 /* Issue an error message indicating that TOKEN_DESC was expected.
25850 If KEYWORD is true, it indicated this function is called by
25851 cp_parser_require_keword and the required token can only be
25852 a indicated keyword. */
25854 static void
25856 required_token token_desc,
25858 {
25860 {
25929 }
25931 {
25933 {
26012 }
26013 }
26014 else
26016 }
26020 /* If the next token is of the indicated TYPE, consume it. Otherwise,
26021 issue an error message indicating that TOKEN_DESC was expected.
26023 Returns the token consumed, if the token had the appropriate type.
26024 Otherwise, returns NULL. */
26029 required_token token_desc)
26030 {
26033 else
26034 {
26035 /* Output the MESSAGE -- unless we're parsing tentatively. */
26039 }
26040 }
26042 /* An error message is produced if the next token is not '>'.
26043 All further tokens are skipped until the desired token is
26044 found or '{', '}', ';' or an unbalanced ')' or ']'. */
26046 static void
26048 {
26049 /* Current level of '< ... >'. */
26051 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
26054 /* Are we ready, yet? If not, issue error message. */
26058 /* Skip tokens until the desired token is found. */
26060 {
26061 /* Peek at the next token. */
26063 {
26071 /* C++0x views the `>>' operator as two `>' tokens, but
26072 C++98 does not. */
26075 {
26076 /* We've hit a `>>' where the first `>' closes the
26077 template argument list, and the second `>' is
26078 spurious. Just consume the `>>' and stop; we've
26079 already produced at least one error. */
26082 }
26083 /* Fall through for C++0x, so we handle the second `>' in
26084 the `>>'. */
26088 {
26089 /* We've reached the token we want, consume it and stop. */
26092 }
26111 /* The '>' was probably forgotten, don't look further. */
26116 }
26118 /* Consume this token. */
26120 }
26121 }
26123 /* If the next token is the indicated keyword, consume it. Otherwise,
26124 issue an error message indicating that TOKEN_DESC was expected.
26126 Returns the token consumed, if the token had the appropriate type.
26127 Otherwise, returns NULL. */
26132 required_token token_desc)
26133 {
26137 {
26140 }
26143 }
26145 /* Returns TRUE iff TOKEN is a token that can begin the body of a
26146 function-definition. */
26148 static bool
26150 {
26153 /* A ctor-initializer begins with a `:'. */
26155 /* A function-try-block begins with `try'. */
26157 /* A function-transaction-block begins with `__transaction_atomic'
26158 or `__transaction_relaxed'. */
26161 /* The named return value extension begins with `return'. */
26163 }
26165 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
26166 definition. */
26168 static bool
26170 {
26177 }
26179 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
26180 C++0x) ending a template-argument. */
26182 static bool
26184 {
26192 }
26194 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
26195 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
26197 static bool
26200 {
26206 /* Check for the sequence `<::' in the original code. It would be lexed as
26207 `[:', where `[' is a digraph, and there is no whitespace before
26208 `:'. */
26210 {
26215 }
26217 }
26219 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
26220 or none_type otherwise. */
26222 static enum tag_types
26224 {
26226 {
26236 }
26237 }
26239 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
26240 or none_type otherwise or if the token is null. */
26242 static enum tag_types
26244 {
26249 {
26257 }
26258 }
26260 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
26262 static void
26264 {
26268 {
26272 type))
26275 }
26276 }
26278 /* Issue an error message if DECL is redeclared with different
26279 access than its original declaration [class.access.spec/3].
26280 This applies to nested classes and nested class templates.
26281 [class.mem/1]. */
26283 static void
26285 {
26294 }
26296 /* Look for the `template' keyword, as a syntactic disambiguator.
26297 Return TRUE iff it is present, in which case it will be
26298 consumed. */
26300 static bool
26302 {
26304 {
26305 /* In C++98 the `template' keyword can only be used within templates;
26306 outside templates the parser can always figure out what is a
26307 template and what is not. In C++11, per the resolution of DR 468,
26308 `template' is allowed in cases where it is not strictly necessary. */
26311 {
26314 "in C++98 %<template%> (as a disambiguator) is only "
26316 /* If this part of the token stream is rescanned, the same
26317 error message would be generated. So, we purge the token
26318 from the stream. */
26321 }
26322 else
26323 {
26324 /* Consume the `template' keyword. */
26327 }
26328 }
26330 }
26332 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
26333 set PARSER->SCOPE, and perform other related actions. */
26335 static void
26337 {
26343 /* Get the stored value. */
26345 /* Perform any access checks that were deferred. */
26348 {
26353 }
26354 /* Set the scope from the stored value. */
26358 }
26360 /* Consume tokens up through a non-nested END token. Returns TRUE if we
26361 encounter the end of a block before what we were looking for. */
26363 static bool
26367 {
26369 {
26372 /* Abort a parenthesized expression if we encounter a semicolon. */
26376 /* If we've reached the end of the file, stop. */
26382 /* We've hit the end of an enclosing block, so there's been some
26383 kind of syntax error. */
26386 /* Consume the token. */
26388 /* See if it starts a new group. */
26390 {
26392 /* In theory this should probably check end == '}', but
26393 cp_parser_save_member_function_body needs it to exit
26394 after either '}' or ')' when called with ')'. */
26397 }
26399 {
26403 }
26408 }
26409 }
26411 /* Like above, for caching a default argument or NSDMI. Both of these are
26412 terminated by a non-nested comma, but it can be unclear whether or not a
26413 comma is nested in a template argument list unless we do more parsing.
26414 In order to handle this ambiguity, when we encounter a ',' after a '<'
26415 we try to parse what follows as a parameter-declaration-list (in the
26416 case of a default argument) or a member-declarator (in the case of an
26417 NSDMI). If that succeeds, then we stop caching. */
26419 static tree
26421 {
26426 tree default_argument;
26428 /* Add tokens until we have processed the entire default
26429 argument. We add the range [first_token, token). */
26432 {
26433 /* For list-initialization, this is straightforward. */
26436 }
26438 {
26441 /* Peek at the next token. */
26443 /* What we do depends on what token we have. */
26445 {
26446 /* In valid code, a default argument must be
26447 immediately followed by a `,' `)', or `...'. */
26450 {
26451 /* If we've seen a '<', we might be in a
26452 template-argument-list. Until Core issue 325 is
26453 resolved, we don't know how this situation ought
26454 to be handled, so try to DTRT. We check whether
26455 what comes after the comma is a valid parameter
26456 declaration list. If it is, then the comma ends
26457 the default argument; otherwise the default
26458 argument continues. */
26461 /* Set ITALP so cp_parser_parameter_declaration_list
26462 doesn't decide to commit to this parse. */
26470 {
26477 }
26478 else
26479 {
26483 }
26490 }
26493 /* If we run into a non-nested `;', `}', or `]',
26494 then the code is invalid -- but the default
26495 argument is certainly over. */
26500 /* Handle correctly int n = sizeof ... ( p ); */
26503 /* Update DEPTH, if necessary. */
26518 /* This might be the comparison operator, or it might
26519 start a template argument list. */
26526 /* Fall through for C++0x, which treats the `>>'
26527 operator like two `>' tokens in certain
26528 cases. */
26532 {
26533 /* This might be an operator, or it might close a
26534 template argument list. But if a previous '<'
26535 started a template argument list, this will have
26536 closed it, so we can't be in one anymore. */
26540 }
26543 /* If we run out of tokens, issue an error message. */
26552 /* In these cases, we should look for template-ids.
26553 For example, if the default argument is
26554 `X<int, double>()', we need to do name lookup to
26555 figure out whether or not `X' is a template; if
26556 so, the `,' does not end the default argument.
26558 That is not yet done. */
26563 }
26565 /* If we've reached the end, stop. */
26569 /* Add the token to the token block. */
26571 }
26573 /* Create a DEFAULT_ARG to represent the unparsed default
26574 argument. */
26581 }
26583 /* Begin parsing tentatively. We always save tokens while parsing
26584 tentatively so that if the tentative parsing fails we can restore the
26585 tokens. */
26587 static void
26589 {
26590 /* Enter a new parsing context. */
26592 /* Begin saving tokens. */
26594 /* In order to avoid repetitive access control error messages,
26595 access checks are queued up until we are no longer parsing
26596 tentatively. */
26598 }
26600 /* Commit to the currently active tentative parse. */
26602 static void
26604 {
26608 /* Mark all of the levels as committed. */
26611 {
26618 }
26619 }
26621 /* Commit to the topmost currently active tentative parse.
26623 Note that this function shouldn't be called when there are
26624 irreversible side-effects while in a tentative state. For
26625 example, we shouldn't create a permanent entry in the symbol
26626 table, or issue an error message that might not apply if the
26627 tentative parse is aborted. */
26629 static void
26631 {
26636 {
26644 }
26645 }
26647 /* Abort the currently active tentative parse. All consumed tokens
26648 will be rolled back, and no diagnostics will be issued. */
26650 static void
26652 {
26656 /* Now, pretend that we want to see if the construct was
26657 successfully parsed. */
26659 }
26661 /* Stop parsing tentatively. If a parse error has occurred, restore the
26662 token stream. Otherwise, commit to the tokens we have consumed.
26663 Returns true if no error occurred; false otherwise. */
26665 static bool
26667 {
26671 /* Remember whether or not an error occurred, since we are about to
26672 destroy that information. */
26674 /* Remove the topmost context from the stack. */
26677 /* If no parse errors occurred, commit to the tentative parse. */
26679 {
26680 /* Commit to the tokens read tentatively, unless that was
26681 already done. */
26686 }
26687 /* Otherwise, if errors occurred, roll back our state so that things
26688 are just as they were before we began the tentative parse. */
26689 else
26690 {
26693 }
26694 /* Add the context to the front of the free list. */
26699 }
26701 /* Returns true if we are parsing tentatively and are not committed to
26702 this tentative parse. */
26704 static bool
26706 {
26709 }
26711 /* Returns nonzero iff an error has occurred during the most recent
26712 tentative parse. */
26714 static bool
26716 {
26719 }
26721 /* Returns nonzero if GNU extensions are allowed. */
26723 static bool
26725 {
26727 }
26728 \f
26729 /* Objective-C++ Productions */
26732 /* Parse an Objective-C expression, which feeds into a primary-expression
26733 above.
26735 objc-expression:
26736 objc-message-expression
26737 objc-string-literal
26738 objc-encode-expression
26739 objc-protocol-expression
26740 objc-selector-expression
26742 Returns a tree representation of the expression. */
26744 static tree
26746 {
26747 /* Try to figure out what kind of declaration is present. */
26751 {
26761 {
26773 }
26779 }
26782 }
26784 /* Parse an Objective-C message expression.
26786 objc-message-expression:
26787 [ objc-message-receiver objc-message-args ]
26789 Returns a representation of an Objective-C message. */
26791 static tree
26793 {
26802 }
26804 /* Parse an objc-message-receiver.
26806 objc-message-receiver:
26807 expression
26808 simple-type-specifier
26810 Returns a representation of the type or expression. */
26812 static tree
26814 {
26815 tree rcv;
26817 /* An Objective-C message receiver may be either (1) a type
26818 or (2) an expression. */
26822 /* If that worked out, fine. */
26829 CP_PARSER_FLAGS_NONE);
26836 }
26838 /* Parse the arguments and selectors comprising an Objective-C message.
26840 objc-message-args:
26841 objc-selector
26842 objc-selector-args
26843 objc-selector-args , objc-comma-args
26845 objc-selector-args:
26846 objc-selector [opt] : assignment-expression
26847 objc-selector-args objc-selector [opt] : assignment-expression
26849 objc-comma-args:
26850 assignment-expression
26851 objc-comma-args , assignment-expression
26853 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
26854 selector arguments and TREE_VALUE containing a list of comma
26855 arguments. */
26857 static tree
26859 {
26865 {
26871 /* Detect if we have a unary selector. */
26880 sel_args
26885 }
26887 /* Handle non-selector arguments, if any. */
26889 {
26890 tree arg;
26895 addl_args
26900 }
26903 {
26906 }
26909 }
26911 /* Parse an Objective-C encode expression.
26913 objc-encode-expression:
26914 @encode objc-typename
26916 Returns an encoded representation of the type argument. */
26918 static tree
26920 {
26921 tree type;
26931 {
26935 }
26937 /* This happens if we find @encode(T) (where T is a template
26938 typename or something dependent on a template typename) when
26939 parsing a template. In that case, we can't compile it
26940 immediately, but we rather create an AT_ENCODE_EXPR which will
26941 need to be instantiated when the template is used.
26942 */
26944 {
26948 }
26951 }
26953 /* Parse an Objective-C @defs expression. */
26955 static tree
26957 {
26958 tree name;
26966 }
26968 /* Parse an Objective-C protocol expression.
26970 objc-protocol-expression:
26971 @protocol ( identifier )
26973 Returns a representation of the protocol expression. */
26975 static tree
26977 {
26978 tree proto;
26986 }
26988 /* Parse an Objective-C selector expression.
26990 objc-selector-expression:
26991 @selector ( objc-method-signature )
26993 objc-method-signature:
26994 objc-selector
26995 objc-selector-seq
26997 objc-selector-seq:
26998 objc-selector :
26999 objc-selector-seq objc-selector :
27001 Returns a representation of the method selector. */
27003 static tree
27005 {
27017 {
27026 {
27027 /* Detect if we have a unary selector. */
27029 {
27032 }
27033 else
27034 {
27036 }
27037 }
27042 {
27043 sel_seq
27046 sel_seq
27049 }
27050 else
27051 sel_seq
27056 }
27058 finish_selector:
27062 }
27064 /* Parse a list of identifiers.
27066 objc-identifier-list:
27067 identifier
27068 objc-identifier-list , identifier
27070 Returns a TREE_LIST of identifier nodes. */
27072 static tree
27074 {
27075 tree identifier;
27076 tree list;
27087 {
27094 identifier));
27096 }
27099 }
27101 /* Parse an Objective-C alias declaration.
27103 objc-alias-declaration:
27104 @compatibility_alias identifier identifier ;
27106 This function registers the alias mapping with the Objective-C front end.
27107 It returns nothing. */
27109 static void
27111 {
27119 }
27121 /* Parse an Objective-C class forward-declaration.
27123 objc-class-declaration:
27124 @class objc-identifier-list ;
27126 The function registers the forward declarations with the Objective-C
27127 front end. It returns nothing. */
27129 static void
27131 {
27134 {
27135 tree id;
27145 else
27147 }
27149 }
27151 /* Parse a list of Objective-C protocol references.
27153 objc-protocol-refs-opt:
27154 objc-protocol-refs [opt]
27156 objc-protocol-refs:
27157 < objc-identifier-list >
27159 Returns a TREE_LIST of identifiers, if any. */
27161 static tree
27163 {
27167 {
27171 }
27174 }
27176 /* Parse a Objective-C visibility specification. */
27178 static void
27180 {
27184 {
27199 }
27201 /* Eat '@private'/'@protected'/'@public'. */
27203 }
27205 /* Parse an Objective-C method type. Return 'true' if it is a class
27206 (+) method, and 'false' if it is an instance (-) method. */
27210 {
27213 else
27215 }
27217 /* Parse an Objective-C protocol qualifier. */
27219 static tree
27221 {
27234 {
27239 }
27242 }
27244 /* Parse an Objective-C typename. */
27246 static tree
27248 {
27252 {
27258 /* An ObjC type name may consist of just protocol qualifiers, in which
27259 case the type shall default to 'id'. */
27261 {
27264 /* If the type could not be parsed, an error has already
27265 been produced. For error recovery, behave as if it had
27266 not been specified, which will use the default type
27267 'id'. */
27269 {
27271 /* We need to skip to the closing parenthesis as
27272 cp_parser_type_id() does not seem to do it for
27273 us. */
27278 }
27279 }
27283 }
27286 }
27288 /* Check to see if TYPE refers to an Objective-C selector name. */
27290 static bool
27292 {
27298 }
27300 /* Parse an Objective-C selector. */
27302 static tree
27304 {
27308 {
27311 }
27313 /* C++ operator names are allowed to appear in ObjC selectors. */
27315 {
27328 }
27329 }
27331 /* Parse an Objective-C params list. */
27333 static tree
27335 {
27341 {
27351 /* Detect if we have a unary selector. */
27354 {
27357 }
27361 {
27362 /* Something went quite wrong. There should be a colon
27363 here, but there is not. Stop parsing parameters. */
27365 }
27367 /* New ObjC allows attributes on parameters too. */
27372 params
27375 type_name,
27376 identifier,
27377 parm_attr));
27380 }
27383 {
27386 }
27388 /* We allow tail attributes for the method. */
27390 {
27398 }
27401 {
27404 }
27406 }
27408 /* Parse the non-keyword Objective-C params. */
27410 static tree
27413 {
27419 {
27421 tree parm;
27427 {
27432 }
27434 /* TODO: parse attributes for tail parameters. */
27443 }
27445 /* We allow tail attributes for the method. */
27447 {
27449 {
27454 }
27455 else
27456 /* We have an error, but parse the attributes, so that we can
27457 carry on. */
27463 }
27466 }
27468 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
27470 static void
27472 {
27475 /* If the next token is `extern' and the following token is a string
27476 literal, then we have a linkage specification. */
27478 && cp_parser_is_pure_string_literal
27481 /* Handle #pragma, if any. */
27484 /* Allow stray semicolons. */
27487 /* Mark methods as optional or required, when building protocols. */
27489 {
27492 }
27494 {
27497 }
27500 /* Other stray characters must generate errors. */
27502 {
27506 }
27507 /* Finally, try to parse a block-declaration, or a function-definition. */
27508 else
27510 }
27512 /* Parse a method signature. */
27514 static tree
27516 {
27532 }
27534 static bool
27536 {
27537 tree tattr;
27542 /* If the attributes are followed by a method introducer, this is not allowed.
27543 Dump the attributes and flag the situation. */
27548 /* Otherwise, the attributes introduce some interstitial code, possibly so
27549 rewind to allow that check. */
27552 }
27554 /* Parse an Objective-C method prototype list. */
27556 static void
27558 {
27562 {
27564 {
27569 else
27573 {
27577 }
27580 }
27586 OPT_Wattributes,
27588 else
27589 /* Allow for interspersed non-ObjC++ code. */
27593 }
27597 else
27601 }
27603 /* Parse an Objective-C method definition list. */
27605 static void
27607 {
27611 {
27612 tree meth;
27615 {
27621 else
27626 {
27630 }
27632 NULL_TREE);
27634 /* For historical reasons, we accept an optional semicolon. */
27641 {
27648 }
27649 }
27650 /* The following case will be removed once @synthesize is
27651 completely implemented. */
27662 else
27663 /* Allow for interspersed non-ObjC++ code. */
27667 }
27671 else
27675 }
27677 /* Parse Objective-C ivars. */
27679 static void
27681 {
27692 {
27693 cp_decl_specifier_seq declspecs;
27695 tree prefix_attributes;
27703 CP_PARSER_FLAGS_OPTIONAL,
27707 /* auto, register, static, extern, mutable. */
27709 {
27712 }
27714 /* thread_local. */
27716 {
27719 }
27721 /* typedef. */
27723 {
27726 }
27731 /* Keep going until we hit the `;' at the end of the
27732 declaration. */
27734 {
27739 /* Check for a (possibly unnamed) bitfield declaration. */
27747 {
27748 /* Get the name of the bitfield. */
27751 sfk_none);
27753 eat_colon:
27755 /* Get the width of the bitfield. */
27756 width
27758 }
27759 else
27760 {
27761 /* Parse the declarator. */
27762 declarator
27768 }
27770 /* Look for attributes that apply to the ivar. */
27772 /* Remember which attributes are prefix attributes and
27773 which are not. */
27775 /* Combine the attributes. */
27779 /* Create the bitfield declaration. */
27781 width,
27782 attributes);
27783 else
27788 /* Add the instance variable. */
27792 /* Reset PREFIX_ATTRIBUTES. */
27801 {
27804 }
27806 }
27810 }
27815 /* Do not consume the RID_AT_END, so it will be read again as terminating
27816 the @interface of @implementation. */
27820 /* For historical reasons, we accept an optional semicolon. */
27823 }
27825 /* Parse an Objective-C protocol declaration. */
27827 static void
27829 {
27835 {
27840 }
27842 /* See if we have a forward declaration or a definition. */
27845 /* Try a forward declaration first. */
27847 {
27849 {
27850 tree id;
27860 else
27862 }
27864 }
27866 /* Ok, we got a full-fledged definition (or at least should). */
27867 else
27868 {
27873 }
27874 }
27876 /* Parse an Objective-C superclass or category. */
27878 static void
27883 {
27889 {
27892 }
27894 {
27897 /* If there is no category name, and this is an @interface, we
27898 have a class extension. */
27900 {
27903 }
27904 else
27908 }
27909 }
27911 /* Parse an Objective-C class interface. */
27913 static void
27915 {
27922 {
27923 /* It's hard to recover because even if valid @interface stuff
27924 is to follow, we can't compile it (or validate it) if we
27925 don't even know which class it refers to. Let's assume this
27926 was a stray '@interface' token in the stream and skip it.
27927 */
27929 }
27934 /* We have either a class or a category on our hands. */
27937 else
27938 {
27940 /* Handle instance variable declarations, if any. */
27943 }
27946 }
27948 /* Parse an Objective-C class implementation. */
27950 static void
27952 {
27959 {
27960 /* It's hard to recover because even if valid @implementation
27961 stuff is to follow, we can't compile it (or validate it) if
27962 we don't even know which class it refers to. Let's assume
27963 this was a stray '@implementation' token in the stream and
27964 skip it.
27965 */
27967 }
27971 /* We have either a class or a category on our hands. */
27974 else
27975 {
27977 /* Handle instance variable declarations, if any. */
27980 }
27983 }
27985 /* Consume the @end token and finish off the implementation. */
27987 static void
27989 {
27992 }
27994 /* Parse an Objective-C declaration. */
27996 static void
27998 {
27999 /* Try to figure out what kind of declaration is present. */
28004 {
28020 }
28023 {
28046 }
28047 }
28049 /* Parse an Objective-C try-catch-finally statement.
28051 objc-try-catch-finally-stmt:
28052 @try compound-statement objc-catch-clause-seq [opt]
28053 objc-finally-clause [opt]
28055 objc-catch-clause-seq:
28056 objc-catch-clause objc-catch-clause-seq [opt]
28058 objc-catch-clause:
28059 @catch ( objc-exception-declaration ) compound-statement
28061 objc-finally-clause:
28062 @finally compound-statement
28064 objc-exception-declaration:
28065 parameter-declaration
28066 '...'
28068 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
28070 Returns NULL_TREE.
28072 PS: This function is identical to c_parser_objc_try_catch_finally_statement
28073 for C. Keep them in sync. */
28075 static tree
28077 {
28078 location_t location;
28079 tree stmt;
28084 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
28085 node, lest it get absorbed into the surrounding block. */
28091 {
28100 {
28101 /* We have "@catch (...)" (where the '...' are literally
28102 what is in the code). Skip the '...'.
28103 parameter_declaration is set to NULL_TREE, and
28104 objc_being_catch_clauses() knows that that means
28105 '...'. */
28108 }
28109 else
28110 {
28111 /* We have "@catch (NSException *exception)" or something
28112 like that. Parse the parameter declaration. */
28116 else
28121 }
28124 else
28125 {
28126 /* If there was no open parenthesis, we are recovering from
28127 an error, and we are trying to figure out what mistake
28128 the user has made. */
28130 /* If there is an immediate closing parenthesis, the user
28131 probably forgot the opening one (ie, they typed "@catch
28132 NSException *e)". Parse the closing parenthesis and keep
28133 going. */
28137 /* If these is no immediate closing parenthesis, the user
28138 probably doesn't know that parenthesis are required at
28139 all (ie, they typed "@catch NSException *e"). So, just
28140 forget about the closing parenthesis and keep going. */
28141 }
28145 }
28147 {
28150 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
28151 node, lest it get absorbed into the surrounding block. */
28155 }
28158 }
28160 /* Parse an Objective-C synchronized statement.
28162 objc-synchronized-stmt:
28163 @synchronized ( expression ) compound-statement
28165 Returns NULL_TREE. */
28167 static tree
28169 {
28170 location_t location;
28181 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
28182 node, lest it get absorbed into the surrounding block. */
28187 }
28189 /* Parse an Objective-C throw statement.
28191 objc-throw-stmt:
28192 @throw assignment-expression [opt] ;
28194 Returns a constructed '@throw' statement. */
28196 static tree
28198 {
28210 }
28212 /* Parse an Objective-C statement. */
28214 static tree
28216 {
28217 /* Try to figure out what kind of declaration is present. */
28221 {
28232 }
28235 }
28237 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
28238 look ahead to see if an objc keyword follows the attributes. This
28239 is to detect the use of prefix attributes on ObjC @interface and
28240 @protocol. */
28242 static bool
28244 {
28249 {
28252 }
28255 }
28257 /* This routine is a minimal replacement for
28258 c_parser_struct_declaration () used when parsing the list of
28259 types/names or ObjC++ properties. For example, when parsing the
28260 code
28262 @property (readonly) int a, b, c;
28264 this function is responsible for parsing "int a, int b, int c" and
28265 returning the declarations as CHAIN of DECLs.
28267 TODO: Share this code with cp_parser_objc_class_ivars. It's very
28268 similar parsing. */
28269 static tree
28271 {
28273 cp_decl_specifier_seq declspecs;
28275 tree prefix_attributes;
28278 CP_PARSER_FLAGS_NONE,
28285 /* auto, register, static, extern, mutable. */
28287 {
28290 }
28292 /* thread_local. */
28294 {
28297 }
28299 /* typedef. */
28301 {
28304 }
28309 /* Keep going until we hit the `;' at the end of the declaration. */
28311 {
28316 /* Parse the declarator. */
28320 /* Look for attributes that apply to the ivar. */
28322 /* Remember which attributes are prefix attributes and
28323 which are not. */
28325 /* Combine the attributes. */
28335 /* Reset PREFIX_ATTRIBUTES. */
28346 {
28349 }
28350 else
28352 }
28354 }
28356 /* Parse an Objective-C @property declaration. The syntax is:
28358 objc-property-declaration:
28359 '@property' objc-property-attributes[opt] struct-declaration ;
28361 objc-property-attributes:
28362 '(' objc-property-attribute-list ')'
28364 objc-property-attribute-list:
28365 objc-property-attribute
28366 objc-property-attribute-list, objc-property-attribute
28368 objc-property-attribute
28369 'getter' = identifier
28370 'setter' = identifier
28371 'readonly'
28372 'readwrite'
28373 'assign'
28374 'retain'
28375 'copy'
28376 'nonatomic'
28378 For example:
28379 @property NSString *name;
28380 @property (readonly) id object;
28381 @property (retain, nonatomic, getter=getTheName) id name;
28382 @property int a, b, c;
28384 PS: This function is identical to
28385 c_parser_objc_at_property_declaration for C. Keep them in sync. */
28386 static void
28388 {
28389 /* The following variables hold the attributes of the properties as
28390 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
28391 seen. When we see an attribute, we set them to 'true' (if they
28392 are boolean properties) or to the identifier (if they have an
28393 argument, ie, for getter and setter). Note that here we only
28394 parse the list of attributes, check the syntax and accumulate the
28395 attributes that we find. objc_add_property_declaration() will
28396 then process the information. */
28406 /* 'properties' is the list of properties that we read. Usually a
28407 single one, but maybe more (eg, in "@property int a, b, c;" there
28408 are three). */
28409 tree properties;
28410 location_t loc;
28416 /* Parse the optional attribute list... */
28418 {
28419 /* Eat the '('. */
28423 {
28429 {
28432 }
28436 {
28447 {
28451 else
28456 }
28459 {
28463 }
28465 {
28467 {
28470 }
28471 else
28475 else
28477 }
28478 else
28479 {
28481 {
28484 }
28485 else
28487 }
28493 }
28500 else
28502 }
28504 /* FIXME: "@property (setter, assign);" will generate a spurious
28505 "error: expected ‘)’ before ‘,’ token". This is because
28506 cp_parser_require, unlike the C counterpart, will produce an
28507 error even if we are in error recovery. */
28509 {
28514 }
28515 }
28517 /* ... and the property declaration(s). */
28521 {
28523 /* If the next token is now a `;', consume it. */
28527 }
28531 else
28532 {
28533 /* Comma-separated properties are chained together in
28534 reverse order; add them one by one. */
28543 }
28546 }
28548 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
28550 objc-synthesize-declaration:
28551 @synthesize objc-synthesize-identifier-list ;
28553 objc-synthesize-identifier-list:
28554 objc-synthesize-identifier
28555 objc-synthesize-identifier-list, objc-synthesize-identifier
28557 objc-synthesize-identifier
28558 identifier
28559 identifier = identifier
28561 For example:
28562 @synthesize MyProperty;
28563 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
28565 PS: This function is identical to c_parser_objc_at_synthesize_declaration
28566 for C. Keep them in sync.
28567 */
28568 static void
28570 {
28572 location_t loc;
28577 {
28581 {
28584 }
28586 {
28590 {
28593 }
28594 }
28595 else
28600 else
28602 }
28605 }
28607 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
28609 objc-dynamic-declaration:
28610 @dynamic identifier-list ;
28612 For example:
28613 @dynamic MyProperty;
28614 @dynamic MyProperty, AnotherProperty;
28616 PS: This function is identical to c_parser_objc_at_dynamic_declaration
28617 for C. Keep them in sync.
28618 */
28619 static void
28621 {
28623 location_t loc;
28628 {
28629 tree property;
28632 {
28635 }
28639 else
28641 }
28644 }
28646 \f
28647 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
28649 /* Returns name of the next clause.
28650 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
28651 the token is not consumed. Otherwise appropriate pragma_omp_clause is
28652 returned and the token is consumed. */
28654 static pragma_omp_clause
28656 {
28670 {
28675 {
28818 }
28819 }
28825 }
28827 /* Validate that a clause of the given type does not already exist. */
28829 static void
28832 {
28833 tree c;
28837 {
28840 }
28841 }
28843 /* OpenMP 2.5:
28844 variable-list:
28845 identifier
28846 variable-list , identifier
28848 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
28849 colon). An opening parenthesis will have been consumed by the caller.
28851 If KIND is nonzero, create the appropriate node and install the decl
28852 in OMP_CLAUSE_DECL and add the node to the head of the list.
28854 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
28855 return the list created.
28857 COLON can be NULL if only closing parenthesis should end the list,
28858 or pointer to bool which will receive false if the list is terminated
28859 by closing parenthesis or true if the list is terminated by colon. */
28861 static tree
28864 {
28868 {
28871 }
28873 {
28890 {
28892 {
28895 {
28899 }
28900 /* FALL THROUGH. */
28906 {
28914 parser->colon_corrects_to_scope_p
28918 else
28919 {
28920 /* Look for `:'. */
28924 CPP_CLOSE_SQUARE))
28926 }
28927 /* Look for the closing `]'. */
28929 RT_CLOSE_SQUARE))
28933 {
28936 {
28940 }
28944 {
28948 }
28949 }
28952 }
28956 }
28962 }
28963 else
28966 get_comma:
28970 }
28976 {
28980 }
28983 {
28986 /* Try to resync to an unnested comma. Copied from
28987 cp_parser_parenthesized_expression_list. */
28988 skip_comma:
28997 }
29000 }
29002 /* Similarly, but expect leading and trailing parenthesis. This is a very
29003 common case for omp clauses. */
29005 static tree
29007 {
29011 }
29013 /* OpenACC 2.0:
29014 copy ( variable-list )
29015 copyin ( variable-list )
29016 copyout ( variable-list )
29017 create ( variable-list )
29018 delete ( variable-list )
29019 present ( variable-list )
29020 present_or_copy ( variable-list )
29021 pcopy ( variable-list )
29022 present_or_copyin ( variable-list )
29023 pcopyin ( variable-list )
29024 present_or_copyout ( variable-list )
29025 pcopyout ( variable-list )
29026 present_or_create ( variable-list )
29027 pcreate ( variable-list ) */
29029 static tree
29031 tree list)
29032 {
29035 {
29075 }
29083 }
29085 /* OpenACC 2.0:
29086 deviceptr ( variable-list ) */
29088 static tree
29090 {
29094 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
29095 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
29096 variable-list must only allow for pointer variables. */
29099 {
29102 /* FIXME diagnostics: Ideally we should keep individual
29103 locations for all the variables in the var list to make the
29104 following errors more precise. Perhaps
29105 c_parser_omp_var_list_parens should construct a list of
29106 locations to go along with the var list. */
29111 ;
29120 }
29123 }
29125 /* OpenACC:
29126 vector_length ( expression ) */
29128 static tree
29130 {
29140 {
29143 }
29146 {
29151 }
29154 location);
29162 }
29164 /* OpenACC 2.0
29165 Parse wait clause or directive parameters. */
29167 static tree
29169 {
29179 {
29184 }
29191 {
29195 {
29198 else
29199 {
29206 }
29207 }
29208 }
29211 }
29213 /* OpenACC:
29214 wait ( int-expr-list ) */
29216 static tree
29218 {
29227 }
29229 /* OpenMP 3.0:
29230 collapse ( constant-expression ) */
29232 static tree
29234 {
29236 location_t loc;
29237 HOST_WIDE_INT n;
29257 {
29260 }
29268 }
29270 /* OpenMP 2.5:
29271 default ( shared | none ) */
29273 static tree
29275 {
29277 tree c;
29282 {
29287 {
29302 }
29305 }
29306 else
29307 {
29308 invalid_kind:
29310 }
29326 }
29328 /* OpenMP 3.1:
29329 final ( expression ) */
29331 static tree
29333 {
29354 }
29356 /* OpenMP 2.5:
29357 if ( expression ) */
29359 static tree
29361 {
29382 }
29384 /* OpenMP 3.1:
29385 mergeable */
29387 static tree
29390 {
29391 tree c;
29394 location);
29399 }
29401 /* OpenMP 2.5:
29402 nowait */
29404 static tree
29407 {
29408 tree c;
29415 }
29417 /* OpenACC:
29418 num_gangs ( expression ) */
29420 static tree
29422 {
29438 {
29441 }
29451 }
29453 /* OpenMP 2.5:
29454 num_threads ( expression ) */
29456 static tree
29458 location_t location)
29459 {
29481 }
29483 /* OpenACC:
29484 num_workers ( expression ) */
29486 static tree
29488 {
29504 {
29507 }
29510 location);
29518 }
29520 /* OpenMP 2.5:
29521 ordered */
29523 static tree
29526 {
29527 tree c;
29535 }
29537 /* OpenMP 2.5:
29538 reduction ( reduction-operator : variable-list )
29540 reduction-operator:
29541 One of: + * - & ^ | && ||
29543 OpenMP 3.1:
29545 reduction-operator:
29546 One of: + * - & ^ | && || min max
29548 OpenMP 4.0:
29550 reduction-operator:
29551 One of: + * - & ^ | && ||
29552 id-expression */
29554 static tree
29556 {
29564 {
29574 }
29578 else
29579 {
29590 {
29620 }
29621 else
29622 {
29624 resync_fail:
29629 }
29630 }
29636 NULL);
29638 {
29641 }
29644 }
29646 /* OpenMP 2.5:
29647 schedule ( schedule-kind )
29648 schedule ( schedule-kind , expression )
29650 schedule-kind:
29651 static | dynamic | guided | runtime | auto */
29653 static tree
29655 {
29664 {
29669 {
29690 }
29691 }
29696 else
29701 {
29716 else
29721 }
29729 invalid_kind:
29731 resync_fail:
29736 }
29738 /* OpenMP 3.0:
29739 untied */
29741 static tree
29744 {
29745 tree c;
29752 }
29754 /* OpenMP 4.0:
29755 inbranch
29756 notinbranch */
29758 static tree
29761 {
29766 }
29768 /* OpenMP 4.0:
29769 parallel
29770 for
29771 sections
29772 taskgroup */
29774 static tree
29778 {
29782 }
29784 /* OpenMP 4.0:
29785 num_teams ( expression ) */
29787 static tree
29789 location_t location)
29790 {
29812 }
29814 /* OpenMP 4.0:
29815 thread_limit ( expression ) */
29817 static tree
29819 location_t location)
29820 {
29842 }
29844 /* OpenMP 4.0:
29845 aligned ( variable-list )
29846 aligned ( variable-list : constant-expression ) */
29848 static tree
29850 {
29861 {
29871 }
29877 }
29879 /* OpenMP 4.0:
29880 linear ( variable-list )
29881 linear ( variable-list : expression ) */
29883 static tree
29886 {
29897 {
29901 {
29904 }
29912 }
29918 }
29920 /* OpenMP 4.0:
29921 safelen ( constant-expression ) */
29923 static tree
29925 location_t location)
29926 {
29947 }
29949 /* OpenMP 4.0:
29950 simdlen ( constant-expression ) */
29952 static tree
29954 location_t location)
29955 {
29976 }
29978 /* OpenMP 4.0:
29979 depend ( depend-kind : variable-list )
29981 depend-kind:
29982 in | out | inout */
29984 static tree
29986 {
29994 {
30004 else
30006 }
30007 else
30015 NULL);
30022 invalid_kind:
30024 resync_fail:
30029 }
30031 /* OpenMP 4.0:
30032 map ( map-kind : variable-list )
30033 map ( variable-list )
30035 map-kind:
30036 alloc | to | from | tofrom */
30038 static tree
30040 {
30049 {
30061 else
30062 {
30068 }
30071 }
30074 NULL);
30080 }
30082 /* OpenMP 4.0:
30083 device ( expression ) */
30085 static tree
30087 location_t location)
30088 {
30110 }
30112 /* OpenMP 4.0:
30113 dist_schedule ( static )
30114 dist_schedule ( static , expression ) */
30116 static tree
30118 location_t location)
30119 {
30132 {
30143 }
30148 location);
30152 invalid_kind:
30154 resync_fail:
30159 }
30161 /* OpenMP 4.0:
30162 proc_bind ( proc-bind-kind )
30164 proc-bind-kind:
30165 master | close | spread */
30167 static tree
30169 location_t location)
30170 {
30171 tree c;
30178 {
30188 else
30190 }
30191 else
30200 location);
30205 invalid_kind:
30207 resync_fail:
30212 }
30214 /* OpenACC:
30215 async [( int-expr )] */
30217 static tree
30219 {
30226 {
30235 }
30245 }
30247 /* Parse all OpenACC clauses. The set clauses allowed by the directive
30248 is a bitmask in MASK. Return the list of clauses found. */
30250 static tree
30254 {
30259 {
30260 location_t here;
30261 pragma_omp_clause c_kind;
30272 {
30364 }
30369 {
30370 /* Remove the invalid clause(s) from the list to avoid
30371 confusing the rest of the compiler. */
30374 }
30375 }
30377 saw_error:
30384 }
30386 /* Parse all OpenMP clauses. The set clauses allowed by the directive
30387 is a bitmask in MASK. Return the list of clauses found; the result
30388 of clause default goes in *pdefault. */
30390 static tree
30394 {
30401 {
30402 pragma_omp_clause c_kind;
30413 {
30425 clauses);
30439 clauses);
30448 clauses);
30472 clauses);
30486 clauses);
30503 OMP_CLAUSE_NOTINBRANCH,
30512 {
30513 clause_not_first:
30517 }
30542 clauses);
30547 clauses);
30552 clauses);
30615 }
30620 {
30621 /* Remove the invalid clause(s) from the list to avoid
30622 confusing the rest of the compiler. */
30625 }
30626 }
30627 saw_error:
30628 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
30629 no reason to skip to the end. */
30635 }
30637 /* OpenMP 2.5:
30638 structured-block:
30639 statement
30641 In practice, we're also interested in adding the statement to an
30642 outer node. So it is convenient if we work around the fact that
30643 cp_parser_statement calls add_stmt. */
30645 static unsigned
30647 {
30650 /* Only move the values to IN_OMP_BLOCK if they weren't false.
30651 This preserves the "not within loop or switch" style error messages
30652 for nonsense cases like
30653 void foo() {
30654 #pragma omp single
30655 break;
30656 }
30657 */
30662 }
30664 static void
30666 {
30668 }
30670 static tree
30672 {
30680 }
30682 /* OpenMP 2.5:
30683 # pragma omp atomic new-line
30684 expression-stmt
30686 expression-stmt:
30687 x binop= expr | x++ | ++x | x-- | --x
30688 binop:
30689 +, *, -, /, &, ^, |, <<, >>
30691 where x is an lvalue expression with scalar type.
30693 OpenMP 3.1:
30694 # pragma omp atomic new-line
30695 update-stmt
30697 # pragma omp atomic read new-line
30698 read-stmt
30700 # pragma omp atomic write new-line
30701 write-stmt
30703 # pragma omp atomic update new-line
30704 update-stmt
30706 # pragma omp atomic capture new-line
30707 capture-stmt
30709 # pragma omp atomic capture new-line
30710 capture-block
30712 read-stmt:
30713 v = x
30714 write-stmt:
30715 x = expr
30716 update-stmt:
30717 expression-stmt | x = x binop expr
30718 capture-stmt:
30719 v = expression-stmt
30720 capture-block:
30721 { v = x; update-stmt; } | { update-stmt; v = x; }
30723 OpenMP 4.0:
30724 update-stmt:
30725 expression-stmt | x = x binop expr | x = expr binop x
30726 capture-stmt:
30727 v = update-stmt
30728 capture-block:
30729 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
30731 where x and v are lvalue expressions with scalar type. */
30733 static void
30735 {
30743 {
30748 {
30754 }
30755 }
30757 {
30769 else
30773 }
30775 {
30781 {
30786 {
30789 }
30790 }
30791 }
30795 {
30805 else
30810 {
30811 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
30812 opcode. */
30817 }
30821 {
30824 }
30825 else
30826 {
30832 }
30835 }
30837 restart:
30841 {
30848 /* FALLTHROUGH */
30858 /* FALLTHROUGH */
30873 /* Undo effects of boolean_increment for post {in,de}crement. */
30875 /* FALLTHRU */
30879 {
30880 /* Undo effects of boolean_increment. */
30882 {
30883 /* This is pre or post increment. */
30888 && !structured_block
30892 }
30893 }
30894 /* FALLTHRU */
30897 {
30932 {
30936 }
30939 {
30945 {
30950 }
30952 {
30964 {
30966 {
30971 }
30972 else
30974 }
30978 }
30981 {
30988 }
30992 }
30996 {
30999 {
31007 }
31009 {
31014 }
31049 }
31060 /* FALLTHROUGH */
31065 }
31072 }
31073 stmt_done:
31075 {
31086 }
31088 {
31091 }
31092 done:
31098 saw_error:
31101 {
31105 {
31109 }
31110 }
31111 }
31114 /* OpenMP 2.5:
31115 # pragma omp barrier new-line */
31117 static void
31119 {
31122 }
31124 /* OpenMP 2.5:
31125 # pragma omp critical [(name)] new-line
31126 structured-block */
31128 static tree
31130 {
31134 {
31146 }
31151 }
31153 /* OpenMP 2.5:
31154 # pragma omp flush flush-vars[opt] new-line
31156 flush-vars:
31157 ( variable-list ) */
31159 static void
31161 {
31167 }
31169 /* Helper function, to parse omp for increment expression. */
31171 static tree
31173 {
31178 {
31181 }
31184 {
31193 /* Fall through: OpenMP disallows NE_EXPR. */
31196 }
31198 /* If decl is an iterator, preserve LHS and RHS of the relational
31199 expr until finish_omp_for. */
31209 }
31211 /* Helper function, to parse omp for increment expression. */
31213 static tree
31215 {
31219 cp_id_kind idk;
31223 {
31231 }
31239 {
31244 }
31251 {
31255 }
31267 do
31268 {
31275 {
31277 {
31280 else
31282 tf_warning_or_error);
31283 }
31284 else
31287 }
31288 }
31292 {
31296 }
31297 else
31301 }
31303 /* Parse the initialization statement of either an OpenMP for loop or
31304 a Cilk Plus for loop.
31306 Return true if the resulting construct should have an
31307 OMP_CLAUSE_PRIVATE added to it. */
31309 static bool
31317 {
31323 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
31325 init-expr:
31326 var = lb
31327 integer-type var = lb
31328 random-access-iterator-type var = lb
31329 pointer-type var = lb
31330 */
31331 cp_decl_specifier_seq type_specifiers;
31333 /* First, try to parse as an initialized declaration. See
31334 cp_parser_condition, from whence the bulk of this is copied. */
31341 {
31342 /* If parsing a type specifier seq succeeded, then this
31343 MUST be a initialized declaration. */
31348 CP_PARSER_DECLARATOR_NAMED,
31359 else
31360 {
31370 {
31372 CPP_OPEN_PAREN))
31373 {
31377 else
31380 }
31381 else
31382 /* Trigger an error. */
31387 }
31391 {
31399 {
31402 auto_node);
31407 }
31410 asm_specification,
31411 LOOKUP_ONLYCONVERTING);
31413 {
31416 }
31417 else
31420 }
31421 else
31422 {
31423 /* Consume '='. */
31427 non_class:
31430 else
31433 asm_specification,
31434 LOOKUP_ONLYCONVERTING);
31435 }
31439 }
31440 }
31441 else
31442 {
31443 cp_id_kind idk;
31444 /* If parsing a type specifier sequence failed, then
31445 this MUST be a simple expression. */
31453 && decl
31456 {
31457 tree rhs;
31464 rhs,
31465 tf_warning_or_error));
31467 }
31468 else
31469 {
31474 {
31478 }
31479 }
31480 }
31482 }
31484 /* Parse the restricted form of the for statement allowed by OpenMP. */
31486 static tree
31489 {
31493 location_t loc_first;
31512 {
31515 location_t loc;
31519 {
31522 }
31525 {
31528 }
31537 add_private_clause
31544 {
31547 {
31553 }
31554 else
31556 }
31563 {
31568 {
31572 }
31575 {
31576 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
31577 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
31582 {
31585 }
31586 else
31587 {
31590 }
31594 }
31595 else
31596 {
31601 }
31602 }
31605 {
31606 tree c;
31608 {
31617 decl);
31621 decl);
31622 }
31624 {
31629 {
31632 }
31633 }
31634 }
31643 {
31644 /* If decl is an iterator, preserve the operator on decl
31645 until finish_omp_for. */
31647 && ((processing_template_decl
31651 else
31655 }
31670 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
31671 in between the collapsed for loops to be still considered perfectly
31672 nested. Hopefully the final version clarifies this.
31673 For now handle (multiple) {'s and empty statements. */
31675 do
31676 {
31680 {
31682 bracecount++;
31683 }
31687 else
31688 {
31695 }
31696 }
31700 {
31703 }
31704 }
31706 /* Note that we saved the original contents of this flag when we entered
31707 the structured block, and so we don't need to re-save it here. */
31710 else
31713 /* Note that the grammar doesn't call for a structured block here,
31714 though the loop as a whole is a structured block. */
31721 else
31726 {
31728 {
31730 nbraces--;
31731 }
31734 else
31735 {
31737 {
31740 }
31745 }
31746 }
31753 }
31755 /* Helper function for OpenMP parsing, split clauses and call
31756 finish_omp_clauses on each of the set of clauses afterwards. */
31758 static void
31761 {
31767 }
31769 /* OpenMP 4.0:
31770 #pragma omp simd simd-clause[optseq] new-line
31771 for-loop */
31773 #define OMP_SIMD_CLAUSE_MASK \
31774 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
31775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
31779 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31780 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31782 static tree
31785 {
31797 {
31800 }
31811 }
31813 /* OpenMP 2.5:
31814 #pragma omp for for-clause[optseq] new-line
31815 for-loop
31817 OpenMP 4.0:
31818 #pragma omp for simd for-simd-clause[optseq] new-line
31819 for-loop */
31821 #define OMP_FOR_CLAUSE_MASK \
31822 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
31825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
31827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
31828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
31829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31831 static tree
31834 {
31845 {
31850 {
31858 cclauses);
31862 cclauses);
31874 }
31875 }
31877 {
31880 }
31885 {
31888 }
31899 }
31901 /* OpenMP 2.5:
31902 # pragma omp master new-line
31903 structured-block */
31905 static tree
31907 {
31911 }
31913 /* OpenMP 2.5:
31914 # pragma omp ordered new-line
31915 structured-block */
31917 static tree
31919 {
31923 }
31925 /* OpenMP 2.5:
31927 section-scope:
31928 { section-sequence }
31930 section-sequence:
31931 section-directive[opt] structured-block
31932 section-sequence section-directive structured-block */
31934 static tree
31936 {
31947 {
31951 }
31954 {
31962 {
31966 }
31968 {
31971 }
31976 }
31987 }
31989 /* OpenMP 2.5:
31990 # pragma omp sections sections-clause[optseq] newline
31991 sections-scope */
31993 #define OMP_SECTIONS_CLAUSE_MASK \
31994 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31995 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31996 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
31997 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31998 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
32000 static tree
32003 {
32015 {
32018 }
32025 }
32027 /* OpenMP 2.5:
32028 # pragma omp parallel parallel-clause[optseq] new-line
32029 structured-block
32030 # pragma omp parallel for parallel-for-clause[optseq] new-line
32031 structured-block
32032 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
32033 structured-block
32035 OpenMP 4.0:
32036 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
32037 structured-block */
32039 #define OMP_PARALLEL_CLAUSE_MASK \
32040 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
32041 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
32042 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
32043 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
32044 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
32045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
32046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
32047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
32048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
32050 static tree
32053 {
32062 {
32075 block);
32080 }
32082 {
32086 }
32088 {
32091 }
32093 {
32097 {
32107 block);
32110 }
32111 }
32121 }
32123 /* OpenMP 2.5:
32124 # pragma omp single single-clause[optseq] new-line
32125 structured-block */
32127 #define OMP_SINGLE_CLAUSE_MASK \
32128 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
32129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
32130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
32131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
32133 static tree
32135 {
32145 }
32147 /* OpenMP 3.0:
32148 # pragma omp task task-clause[optseq] new-line
32149 structured-block */
32151 #define OMP_TASK_CLAUSE_MASK \
32152 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
32153 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
32154 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
32155 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
32156 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
32157 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
32158 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
32159 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
32160 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
32162 static tree
32164 {
32175 }
32177 /* OpenMP 3.0:
32178 # pragma omp taskwait new-line */
32180 static void
32182 {
32185 }
32187 /* OpenMP 3.1:
32188 # pragma omp taskyield new-line */
32190 static void
32192 {
32195 }
32197 /* OpenMP 4.0:
32198 # pragma omp taskgroup new-line
32199 structured-block */
32201 static tree
32203 {
32207 }
32210 /* OpenMP 2.5:
32211 # pragma omp threadprivate (variable-list) */
32213 static void
32215 {
32216 tree vars;
32222 }
32224 /* OpenMP 4.0:
32225 # pragma omp cancel cancel-clause[optseq] new-line */
32227 #define OMP_CANCEL_CLAUSE_MASK \
32228 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
32229 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
32230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
32231 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
32232 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
32234 static void
32236 {
32240 }
32242 /* OpenMP 4.0:
32243 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
32245 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
32246 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
32247 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
32248 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
32249 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
32251 static void
32253 {
32254 tree clauses;
32258 {
32263 {
32266 }
32267 }
32269 {
32273 }
32276 OMP_CANCELLATION_POINT_CLAUSE_MASK,
32278 pragma_tok);
32280 }
32282 /* OpenMP 4.0:
32283 #pragma omp distribute distribute-clause[optseq] new-line
32284 for-loop */
32286 #define OMP_DISTRIBUTE_CLAUSE_MASK \
32287 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
32288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
32289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
32290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
32292 static tree
32295 {
32304 {
32312 else
32315 {
32321 {
32324 cclauses);
32325 else
32327 cclauses);
32328 }
32333 cclauses);
32334 else
32336 cclauses);
32348 }
32349 }
32351 {
32354 }
32359 {
32362 }
32373 }
32375 /* OpenMP 4.0:
32376 # pragma omp teams teams-clause[optseq] new-line
32377 structured-block */
32379 #define OMP_TEAMS_CLAUSE_MASK \
32380 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
32381 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
32382 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
32383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
32384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
32385 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
32386 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
32388 static tree
32391 {
32400 {
32404 {
32412 cclauses);
32416 cclauses);
32427 }
32428 }
32430 {
32433 }
32438 {
32441 }
32449 }
32451 /* OpenMP 4.0:
32452 # pragma omp target data target-data-clause[optseq] new-line
32453 structured-block */
32455 #define OMP_TARGET_DATA_CLAUSE_MASK \
32456 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
32457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
32458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
32460 static tree
32462 {
32474 }
32476 /* OpenMP 4.0:
32477 # pragma omp target update target-update-clause[optseq] new-line */
32479 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
32480 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
32481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
32482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
32483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
32485 static bool
32488 {
32490 {
32492 "%<#pragma omp target update%> may only be "
32496 }
32498 tree clauses
32503 {
32505 "%<#pragma omp target update must contain at least one "
32508 }
32516 }
32518 /* OpenMP 4.0:
32519 # pragma omp target target-clause[optseq] new-line
32520 structured-block */
32522 #define OMP_TARGET_CLAUSE_MASK \
32523 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
32524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
32525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
32527 static bool
32530 {
32532 {
32536 }
32539 {
32544 {
32552 {
32554 OMP_TARGET_CLAUSE_MASK,
32555 cclauses);
32557 }
32573 }
32575 {
32578 }
32580 {
32584 }
32586 {
32589 }
32590 }
32604 }
32606 /* OpenACC 2.0:
32607 # pragma acc cache (variable-list) new-line
32608 */
32610 static tree
32612 {
32627 }
32629 /* OpenACC 2.0:
32630 # pragma acc data oacc-data-clause[optseq] new-line
32631 structured-block */
32633 #define OACC_DATA_CLAUSE_MASK \
32634 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
32635 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
32636 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
32637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
32638 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
32639 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32640 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
32641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
32642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
32643 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
32644 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
32646 static tree
32648 {
32661 }
32663 /* OpenACC 2.0:
32664 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
32666 or
32668 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
32670 LOC is the location of the #pragma token.
32671 */
32673 #define OACC_ENTER_DATA_CLAUSE_MASK \
32674 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32675 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
32676 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
32677 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
32678 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
32679 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
32680 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
32682 #define OACC_EXIT_DATA_CLAUSE_MASK \
32683 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
32685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
32686 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
32687 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
32689 static tree
32692 {
32697 {
32703 }
32708 {
32712 }
32719 else
32724 {
32728 }
32734 else
32739 }
32741 /* OpenACC 2.0:
32742 # pragma acc kernels oacc-kernels-clause[optseq] new-line
32743 structured-block */
32745 #define OACC_KERNELS_CLAUSE_MASK \
32746 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
32747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
32748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
32749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
32750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
32751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
32752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
32754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
32755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
32756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
32757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
32758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
32760 static tree
32762 {
32775 }
32777 /* OpenACC 2.0:
32778 # pragma acc loop oacc-loop-clause[optseq] new-line
32779 structured-block */
32781 #define OACC_LOOP_CLAUSE_MASK \
32782 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
32783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION))
32785 static tree
32787 {
32800 }
32802 /* OpenACC 2.0:
32803 # pragma acc parallel oacc-parallel-clause[optseq] new-line
32804 structured-block */
32806 #define OACC_PARALLEL_CLAUSE_MASK \
32807 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
32808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
32809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
32810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
32811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
32812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
32813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
32815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
32816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
32817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
32818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
32819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
32820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
32821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
32822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
32823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
32825 static tree
32827 {
32840 }
32842 /* OpenACC 2.0:
32843 # pragma acc update oacc-update-clause[optseq] new-line
32844 */
32846 #define OACC_UPDATE_CLAUSE_MASK \
32847 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
32848 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
32849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
32850 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
32851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
32852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
32854 static tree
32856 {
32863 {
32865 "%<#pragma acc update%> must contain at least one "
32868 }
32876 }
32878 /* OpenACC 2.0:
32879 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
32881 LOC is the location of the #pragma token.
32882 */
32884 #define OACC_WAIT_CLAUSE_MASK \
32885 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
32887 static tree
32889 {
32902 }
32904 /* OpenMP 4.0:
32905 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
32907 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
32908 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
32909 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
32910 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
32911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
32912 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
32913 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
32915 static void
32918 {
32920 cp_omp_declare_simd_data data;
32922 {
32927 }
32938 {
32942 {
32955 }
32960 "%<#pragma omp declare simd%> not immediately followed by "
32964 }
32965 }
32967 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
32968 This function is modelled similar to the late parsing of omp declare
32969 simd. */
32971 static tree
32973 {
32979 {
32985 }
32987 {
32991 }
32996 {
33003 NULL);
33017 }
33022 }
33024 /* Finalize #pragma omp declare simd clauses after direct declarator has
33025 been parsed, and put that into "omp declare simd" attribute. */
33027 static tree
33029 {
33035 {
33040 }
33045 {
33063 }
33067 }
33070 /* OpenMP 4.0:
33071 # pragma omp declare target new-line
33072 declarations and definitions
33073 # pragma omp end declare target new-line */
33075 static void
33077 {
33080 }
33082 static void
33084 {
33087 {
33090 }
33092 {
33096 {
33099 }
33102 else
33103 {
33107 }
33108 }
33109 else
33110 {
33114 }
33118 "%<#pragma omp end declare target%> without corresponding "
33120 else
33122 }
33124 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
33125 expression and optional initializer clause of
33126 #pragma omp declare reduction. We store the expression(s) as
33127 either 3, 6 or 7 special statements inside of the artificial function's
33128 body. The first two statements are DECL_EXPRs for the artificial
33129 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
33130 expression that uses those variables.
33131 If there was any INITIALIZER clause, this is followed by further statements,
33132 the fourth and fifth statements are DECL_EXPRs for the artificial
33133 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
33134 constructor variant (first token after open paren is not omp_priv),
33135 then the sixth statement is a statement with the function call expression
33136 that uses the OMP_PRIV and optionally OMP_ORIG variable.
33137 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
33138 to initialize the OMP_PRIV artificial variable and there is seventh
33139 statement, a DECL_EXPR of the OMP_PRIV statement again. */
33141 static bool
33143 {
33155 tree combiner;
33170 {
33173 }
33176 {
33183 {
33186 }
33202 {
33206 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
33210 == CPP_CLOSE_PAREN
33213 {
33217 }
33222 }
33223 else
33224 {
33240 {
33245 }
33247 tree arg;
33260 }
33271 }
33277 }
33279 /* OpenMP 4.0
33280 #pragma omp declare reduction (reduction-id : typename-list : expression) \
33281 initializer-clause[opt] new-line
33283 initializer-clause:
33284 initializer (omp_priv initializer)
33285 initializer (function-name (argument-list)) */
33287 static void
33290 {
33300 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
33307 {
33339 }
33351 /* Types may not be defined in declare reduction type list. */
33354 parser->type_definition_forbidden_message
33360 saved_colon_doesnt_start_class_def_p
33365 {
33369 ;
33390 else
33395 else
33397 }
33399 /* Restore the saved message. */
33402 parser->colon_doesnt_start_class_def_p
33407 {
33408 fail:
33411 }
33417 {
33418 tree fntype
33421 NULL_TREE);
33440 {
33445 }
33447 {
33449 {
33458 }
33465 }
33466 else
33467 {
33470 }
33473 else
33476 {
33479 }
33481 {
33484 else
33489 }
33494 else
33495 {
33504 }
33511 }
33515 done:
33516 /* Free any declarators allocated. */
33518 }
33520 /* OpenMP 4.0
33521 #pragma omp declare simd declare-simd-clauses[optseq] new-line
33522 #pragma omp declare reduction (reduction-id : typename-list : expression) \
33523 initializer-clause[opt] new-line
33524 #pragma omp declare target new-line */
33526 static void
33529 {
33531 {
33536 {
33539 context);
33541 }
33544 {
33547 context);
33549 }
33551 {
33554 }
33556 {
33560 }
33561 }
33565 }
33567 /* Main entry point to OpenMP statement pragmas. */
33569 static void
33571 {
33572 tree stmt;
33577 {
33652 }
33656 }
33657 \f
33658 /* Transactional Memory parsing routines. */
33660 /* Parse a transaction attribute.
33662 txn-attribute:
33663 attribute
33664 [ [ identifier ] ]
33666 ??? Simplify this when C++0x bracket attributes are
33667 implemented properly. */
33669 static tree
33671 {
33686 {
33690 /* For keywords, use the canonical spelling,
33691 not the parsed identifier. */
33695 }
33696 else
33700 error1:
33703 }
33705 /* Parse a __transaction_atomic or __transaction_relaxed statement.
33707 transaction-statement:
33708 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
33709 compound-statement
33710 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
33711 */
33713 static tree
33715 {
33730 else
33731 {
33735 }
33737 /* Parse a noexcept specification. */
33740 /* Keep track if we're in the lexical scope of an outer transaction. */
33752 }
33754 /* Parse a __transaction_atomic or __transaction_relaxed expression.
33756 transaction-expression:
33757 __transaction_atomic txn-noexcept-spec[opt] ( expression )
33758 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
33759 */
33761 static tree
33763 {
33788 /* Set this early. This might mean that we allow transaction_cancel in
33789 an expression that we find out later actually has to be a constexpr.
33790 However, we expect that cxx_constant_value will be able to deal with
33791 this; also, if the noexcept has no constexpr, then what we parse next
33792 really is a transaction's body. */
33795 /* Parse a noexcept specification. */
33801 {
33808 }
33809 else
33810 {
33811 /* The only expression that is available got parsed for the noexcept
33812 already. noexcept is true then. */
33815 }
33824 }
33826 /* Parse a function-transaction-block.
33828 function-transaction-block:
33829 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
33830 function-body
33831 __transaction_atomic txn-attribute[opt] function-try-block
33832 __transaction_relaxed ctor-initializer[opt] function-body
33833 __transaction_relaxed function-try-block
33834 */
33836 static bool
33838 {
33854 else
33855 {
33859 }
33867 else
33868 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
33876 }
33878 /* Parse a __transaction_cancel statement.
33880 cancel-statement:
33881 __transaction_cancel txn-attribute[opt] ;
33882 __transaction_cancel txn-attribute[opt] throw-expression ;
33884 ??? Cancel and throw is not yet implemented. */
33886 static tree
33888 {
33894 RT_TRANSACTION_CANCEL);
33901 /* ??? Parse cancel-and-throw here. */
33906 {
33910 }
33912 {
33916 }
33918 {
33921 {
33927 }
33928 }
33930 {
33934 }
33940 }
33941 \f
33942 /* The parser. */
33946 \f
33947 /* Special handling for the first token or line in the file. The first
33948 thing in the file might be #pragma GCC pch_preprocess, which loads a
33949 PCH file, which is a GC collection point. So we need to handle this
33950 first pragma without benefit of an existing lexer structure.
33952 Always returns one token to the caller in *FIRST_TOKEN. This is
33953 either the true first token of the file, or the first token after
33954 the initial pragma. */
33956 static void
33958 {
33967 {
33974 }
33975 else
33978 /* Skip to the end of the pragma. */
33982 /* Now actually load the PCH file. */
33986 /* Read one more token to return to our caller. We have to do this
33987 after reading the PCH file in, since its pointers have to be
33988 live. */
33990 }
33992 /* Parses the grainsize pragma for the _Cilk_for statement.
33993 Syntax:
33994 #pragma cilk grainsize = <VALUE>. */
33996 static void
33998 {
34000 {
34005 {
34008 }
34010 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
34013 else
34015 "%<#pragma cilk grainsize%> is not followed by "
34018 }
34020 }
34022 /* Normal parsing of a pragma token. Here we can (and must) use the
34023 regular lexer. */
34025 static bool
34027 {
34039 {
34047 {
34057 }
34062 {
34072 }
34077 {
34083 "%<#pragma omp taskwait%> may only be "
34088 }
34093 {
34099 "%<#pragma omp taskyield%> may only be "
34104 }
34109 {
34115 "%<#pragma omp cancel%> may only be "
34120 }
34125 {
34131 "%<#pragma omp cancellation point%> may only be "
34136 }
34183 "%<#pragma omp section%> may only be used in "
34188 {
34190 {
34194 }
34201 {
34204 }
34207 }
34211 {
34215 }
34221 {
34225 }
34227 /* Ignore the pragma if Cilk Plus is not enabled. */
34229 {
34232 }
34233 else
34234 {
34238 }
34245 bad_stmt:
34248 }
34252 }
34254 /* The interface the pragma parsers have to the lexer. */
34256 enum cpp_ttype
34258 {
34271 else
34272 {
34276 }
34279 }
34281 \f
34282 /* External interface. */
34284 /* Parse one entire translation unit. */
34286 void
34288 {
34301 }
34303 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
34304 vectorlength clause:
34305 Syntax:
34306 vectorlength ( constant-expression ) */
34308 static tree
34311 {
34313 tree expr;
34314 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
34315 safelen clause. Thus, vectorlength is represented as OMP 4.0
34316 safelen. For SIMD-enabled function it is represented by OMP 4.0
34317 simdlen. */
34320 loc);
34321 else
34323 loc);
34331 /* If expr == error_mark_node, then don't emit any errors nor
34332 create a clause. if any of the above functions returns
34333 error mark node then they would have emitted an error message. */
34335 ;
34343 else
34344 {
34345 tree c;
34347 {
34352 }
34353 else
34354 {
34359 }
34360 }
34365 }
34367 /* Handles the Cilk Plus #pragma simd linear clause.
34368 Syntax:
34369 linear ( simd-linear-variable-list )
34371 simd-linear-variable-list:
34372 simd-linear-variable
34373 simd-linear-variable-list , simd-linear-variable
34375 simd-linear-variable:
34376 id-expression
34377 id-expression : simd-linear-step
34379 simd-linear-step:
34380 conditional-expression */
34382 static tree
34384 {
34390 {
34394 }
34399 {
34402 {
34406 }
34413 {
34417 }
34418 else
34419 {
34423 /* If present, parse the linear step. Otherwise, assume the default
34424 value of 1. */
34426 {
34433 {
34434 /* If an error has occurred, then the whole pragma is
34435 considered ill-formed. Thus, no reason to keep
34436 parsing. */
34439 }
34447 else
34449 "step size must be an integer constant "
34451 }
34453 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
34459 }
34464 else
34465 {
34470 }
34471 }
34475 }
34477 /* Returns the name of the next clause. If the clause is not
34478 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
34479 token is not consumed. Otherwise, the appropriate enum from the
34480 pragma_simd_clause is returned and the token is consumed. */
34482 static pragma_omp_clause
34484 {
34485 pragma_omp_clause clause_type;
34502 else
34507 }
34509 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
34511 static tree
34513 {
34518 {
34519 pragma_omp_clause c_kind;
34526 /* Use the OpenMP 4.0 equivalent function. */
34529 /* Use the OpenMP 4.0 equivalent function. */
34531 clauses);
34533 /* Use the OMP 4.0 equivalent function. */
34535 clauses);
34537 /* Use the OMP 4.0 equivalent function. */
34539 else
34540 {
34544 }
34545 }
34551 else
34553 }
34555 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
34557 static void
34559 {
34566 {
34570 }
34579 }
34581 /* Main entry-point for parsing Cilk Plus _Cilk_for
34582 loops. The return value is error_mark_node
34583 when errors happen and CILK_FOR tree on success. */
34585 static tree
34587 {
34602 else
34608 }
34610 /* Create an identifier for a generic parameter type (a synthesized
34611 template parameter implied by `auto' or a concept identifier). */
34614 static tree
34616 {
34620 }
34622 /* Predicate that behaves as is_auto_or_concept but matches the parent
34623 node of the generic type rather than the generic type itself. This
34624 allows for type transformation in add_implicit_template_parms. */
34628 {
34630 }
34632 /* Returns the template declaration being called or evaluated as
34633 part of the constraint check. Note that T must be a predicate
34634 constraint (it can't be any other kind of constraint). */
34635 static tree
34637 {
34648 else
34649 {
34654 }
34655 }
34657 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
34658 (creating a new template parameter list if necessary). Returns the newly
34659 created template type parm. */
34661 tree
34663 {
34666 /* Before committing to modifying any scope, if we're in an
34667 implicit template scope, and we're trying to synthesize a
34668 constrained parameter, try to find a previous parameter with
34669 the same name. This is the same-type rule for abbreviated
34670 function templates. */
34672 {
34675 {
34680 }
34681 }
34683 /* We are either continuing a function template that already contains implicit
34684 template parameters, creating a new fully-implicit function template, or
34685 extending an existing explicit function template with implicit template
34686 parameters. */
34694 {
34698 }
34699 else
34700 {
34701 /* Roll back to the existing template parameter scope (in the case of
34702 extending an explicit function template) or introduce a new template
34703 parameter scope ahead of the function parameter scope (or class scope
34704 in the case of out-of-line member definitions). The function scope is
34705 added back after template parameter synthesis below. */
34710 {
34713 }
34715 {
34716 /* If not defining a class, then any class scope is a scope level in
34717 an out-of-line member definition. In this case simply wind back
34718 beyond the first such scope to inject the template parameter list.
34719 Otherwise wind back to the class being defined. The latter can
34720 occur in class member friend declarations such as:
34722 class A {
34723 void foo (auto);
34724 };
34725 class B {
34726 friend void A::foo (auto);
34727 };
34729 The template parameter list synthesized for the friend declaration
34730 must be injected in the scope of 'B'. This can also occur in
34731 erroneous cases such as:
34733 struct A {
34734 struct B {
34735 void foo (auto);
34736 };
34737 void B::foo (auto) {}
34738 };
34740 Here the attempted definition of 'B::foo' within 'A' is ill-formed
34741 but, nevertheless, the template parameter list synthesized for the
34742 declarator should be injected into the scope of 'A' as if the
34743 ill-formed template was specified explicitly. */
34746 {
34749 }
34750 }
34756 {
34757 /* Introduce a new template parameter list for implicit template
34758 parameters. */
34761 parser->implicit_template_scope
34768 }
34769 else
34770 {
34771 /* Synthesize implicit template parameters at the end of the explicit
34772 template parameter list. */
34779 parser->implicit_template_parms
34781 }
34782 }
34784 /* Synthesize a new template parameter and track the current template
34785 parameter chain with implicit_template_parms. */
34789 synth_id);
34791 // Attach the constraint to the parm before processing.
34794 tree new_parm
34796 input_location,
34797 node,
34801 // Chain the new parameter to the list of implicit parameters.
34803 parser->implicit_template_parms
34805 else
34810 /* If creating a fully implicit function template, start the new implicit
34811 template parameter list with this synthesized type, otherwise grow the
34812 current template parameter list. */
34815 {
34822 }
34823 else
34824 {
34829 }
34831 // If the new parameter was constrained, we need to add that to the
34832 // constraints in the tmeplate parameter list.
34834 {
34838 }
34843 }
34845 /* Finish the declaration of a fully implicit function template. Such a
34846 template has no explicit template parameter list so has not been through the
34847 normal template head and tail processing. synthesize_implicit_template_parm
34848 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
34849 provided if the declaration is a class member such that its template
34850 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
34851 form is returned. Otherwise NULL_TREE is returned. */
34853 tree
34855 {
34860 {
34864 }
34874 }