| blob | 22dff06eb6c7a87b6b6221c41fc5dab76fb96ae4 |
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/>. */
59 \f
60 /* The lexer. */
62 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
63 and c-lex.c) and the C++ parser. */
66 {
68 };
70 /* The various kinds of non integral constant we encounter. */
72 NIC_NONE,
73 /* floating-point literal */
74 NIC_FLOAT,
75 /* %<this%> */
76 NIC_THIS,
77 /* %<__FUNCTION__%> */
78 NIC_FUNC_NAME,
79 /* %<__PRETTY_FUNCTION__%> */
80 NIC_PRETTY_FUNC,
81 /* %<__func__%> */
82 NIC_C99_FUNC,
83 /* "%<va_arg%> */
84 NIC_VA_ARG,
85 /* a cast */
86 NIC_CAST,
87 /* %<typeid%> operator */
88 NIC_TYPEID,
89 /* non-constant compound literals */
90 NIC_NCC,
91 /* a function call */
92 NIC_FUNC_CALL,
93 /* an increment */
94 NIC_INC,
95 /* an decrement */
96 NIC_DEC,
97 /* an array reference */
98 NIC_ARRAY_REF,
99 /* %<->%> */
100 NIC_ARROW,
101 /* %<.%> */
102 NIC_POINT,
103 /* the address of a label */
104 NIC_ADDR_LABEL,
105 /* %<*%> */
106 NIC_STAR,
107 /* %<&%> */
108 NIC_ADDR,
109 /* %<++%> */
110 NIC_PREINCREMENT,
111 /* %<--%> */
112 NIC_PREDECREMENT,
113 /* %<new%> */
114 NIC_NEW,
115 /* %<delete%> */
116 NIC_DEL,
117 /* calls to overloaded operators */
118 NIC_OVERLOADED,
119 /* an assignment */
120 NIC_ASSIGNMENT,
121 /* a comma operator */
122 NIC_COMMA,
123 /* a call to a constructor */
124 NIC_CONSTRUCTOR,
125 /* a transaction expression */
126 NIC_TRANSACTION
129 /* The various kinds of errors about name-lookup failing. */
131 /* NULL */
132 NLE_NULL,
133 /* is not a type */
134 NLE_TYPE,
135 /* is not a class or namespace */
136 NLE_CXX98,
137 /* is not a class, namespace, or enumeration */
138 NLE_NOT_CXX98
141 /* The various kinds of required token */
143 RT_NONE,
165 /* The type is CPP_KEYWORD */
194 RT_TRANSACTION_CANCEL /* __transaction_cancel */
197 /* Prototypes. */
203 static void cp_lexer_destroy
205 static int cp_lexer_saving_tokens
209 static void cp_lexer_get_preprocessor_token
217 static bool cp_lexer_next_token_is_not
219 static bool cp_lexer_next_token_is_keyword
223 static void cp_lexer_purge_token
225 static void cp_lexer_purge_tokens_after
227 static void cp_lexer_save_tokens
229 static void cp_lexer_commit_tokens
231 static void cp_lexer_rollback_tokens
233 static void cp_lexer_print_token
237 static void cp_lexer_start_debugging
239 static void cp_lexer_stop_debugging
245 static void cp_parser_initial_pragma
248 static tree cp_literal_operator_id
251 static void cp_parser_cilk_simd
253 static tree cp_parser_cilk_for
255 static bool cp_parser_omp_declare_reduction_exprs
257 static tree cp_parser_cilk_simd_vectorlength
260 /* Manifest constants. */
261 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
262 #define CP_SAVED_TOKEN_STACK 5
264 /* Variables. */
266 /* The stream to which debugging output should be written. */
269 /* Nonzero if we are parsing an unevaluated operand: an operand to
270 sizeof, typeof, or alignof. */
273 /* Dump up to NUM tokens in BUFFER to FILE starting with token
274 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
275 first token in BUFFER. If NUM is 0, dump all the tokens. If
276 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
277 highlighted by surrounding it in [[ ]]. */
279 static void
283 {
300 {
303 }
308 {
315 nprinted++;
325 {
335 }
336 }
339 {
342 }
345 }
348 /* Dump all tokens in BUFFER to stderr. */
350 void
352 {
354 }
356 DEBUG_FUNCTION void
358 {
360 }
362 DEBUG_FUNCTION void
364 {
367 else
369 }
372 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
373 description for T. */
375 static void
377 {
379 {
382 }
383 }
386 /* Dump parser context C to FILE. */
388 static void
390 {
395 }
398 /* Print the stack of parsing contexts to FILE starting with FIRST. */
400 static void
402 {
408 {
411 }
412 }
415 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
417 static void
419 {
422 }
425 /* Print an unparsed function entry UF to FILE. */
427 static void
429 {
432 tree fn;
437 i++)
438 {
444 }
449 {
452 }
458 {
461 }
463 }
466 /* Print the stack of unparsed member functions S to FILE. */
468 static void
471 {
477 {
480 }
481 }
484 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
485 the given PARSER. If FILE is NULL, the output is printed on stderr. */
487 static void
489 {
501 next_token);
502 }
505 /* Dump debugging information for the given PARSER. If FILE is NULL,
506 the output is printed on stderr. */
508 void
510 {
513 expanded_location eloc;
591 }
593 DEBUG_FUNCTION void
595 {
597 }
599 DEBUG_FUNCTION void
601 {
604 else
606 }
608 /* Allocate memory for a new lexer object and return it. */
612 {
617 /* Allocate the memory. */
620 /* Initially we are not debugging. */
625 /* Create the buffer. */
629 }
632 /* Create a new main C++ lexer, the lexer that gets tokens from the
633 preprocessor. */
637 {
639 cp_token token;
641 /* It's possible that parsing the first pragma will load a PCH file,
642 which is a GC collection point. So we have to do that before
643 allocating any memory. */
648 /* Put the first token in the buffer. */
651 /* Get the remaining tokens from the preprocessor. */
653 {
656 }
665 /* Subsequent preprocessor diagnostics should use compiler
666 diagnostic functions to get the compiler source location. */
671 }
673 /* Create a new lexer whose token stream is primed with the tokens in
674 CACHE. When these tokens are exhausted, no new tokens will be read. */
678 {
683 /* We do not own the buffer. */
690 /* Initially we are not debugging. */
695 }
697 /* Frees all resources associated with LEXER. */
699 static void
701 {
705 }
707 /* Returns nonzero if debugging information should be output. */
711 {
713 }
718 {
722 }
726 {
728 }
732 {
734 }
738 {
741 else
743 }
747 {
751 }
753 /* nonzero if we are presently saving tokens. */
757 {
759 }
761 /* Store the next token from the preprocessor in *TOKEN. Return true
762 if we reach EOF. If LEXER is NULL, assume we are handling an
763 initial #pragma pch_preprocess, and thus want the lexer to return
764 processed strings. */
766 static void
768 {
771 /* Get a new token from the preprocessor. */
772 token->type
780 /* On some systems, some header files are surrounded by an
781 implicit extern "C" block. Set a flag in the token if it
782 comes from such a header. */
787 /* Check to see if this token is a keyword. */
789 {
791 {
792 /* Mark this token as a keyword. */
794 /* Record which keyword. */
796 }
797 else
798 {
802 {
803 /* Warn about the C++0x keyword (but still treat it as
804 an identifier). */
809 /* Clear out the C_RID_CODE so we don't warn about this
810 particular identifier-turned-keyword again. */
812 }
815 }
816 }
818 {
819 /* This only happens in Objective-C++; it must be a keyword. */
822 {
823 /* Replace 'class' with '@class', 'private' with '@private',
824 etc. This prevents confusion with the C++ keyword
825 'class', and makes the tokens consistent with other
826 Objective-C 'AT' keywords. For example '@class' is
827 reported as RID_AT_CLASS which is consistent with
828 '@synchronized', which is reported as
829 RID_AT_SYNCHRONIZED.
830 */
839 }
840 }
842 {
843 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
847 }
848 }
850 /* Update the globals input_location and the input file stack from TOKEN. */
853 {
855 {
857 }
858 }
860 /* Update the globals input_location and the input file stack from LEXER. */
863 {
866 }
868 /* Return a pointer to the next token in the token stream, but do not
869 consume it. */
873 {
875 {
879 }
881 }
883 /* Return true if the next token has the indicated TYPE. */
887 {
889 }
891 /* Return true if the next token does not have the indicated TYPE. */
895 {
897 }
899 /* Return true if the next token is the indicated KEYWORD. */
903 {
905 }
909 {
911 }
915 {
917 }
919 /* Return true if the next token is not the indicated KEYWORD. */
923 {
925 }
927 /* Return true if the next token is a keyword for a decl-specifier. */
929 static bool
931 {
936 {
937 /* auto specifier: storage-class-specifier in C++,
938 simple-type-specifier in C++0x. */
940 /* Storage classes. */
946 /* Elaborated type specifiers. */
952 /* Simple type specifiers. */
966 /* GNU extensions. */
969 /* C++0x extensions. */
980 }
981 }
983 /* Returns TRUE iff the token T begins a decltype type. */
985 static bool
987 {
990 }
992 /* Returns TRUE iff the next token begins a decltype type. */
994 static bool
996 {
999 }
1001 /* Return a pointer to the Nth token in the token stream. If N is 1,
1002 then this is precisely equivalent to cp_lexer_peek_token (except
1003 that it is not inline). One would like to disallow that case, but
1004 there is one case (cp_parser_nth_token_starts_template_id) where
1005 the caller passes a variable for N and it might be 1. */
1009 {
1012 /* N is 1-based, not zero-based. */
1023 {
1026 {
1029 }
1033 }
1036 {
1039 }
1042 }
1044 /* Return the next token, and advance the lexer's next_token pointer
1045 to point to the next non-purged token. */
1049 {
1055 do
1056 {
1059 {
1062 }
1064 }
1069 /* Provide debugging output. */
1071 {
1075 }
1078 }
1080 /* Permanently remove the next token from the token stream, and
1081 advance the next_token pointer to refer to the next non-purged
1082 token. */
1084 static void
1086 {
1095 do
1096 {
1097 tok++;
1099 {
1102 }
1103 }
1106 }
1108 /* Permanently remove all tokens after TOK, up to, but not
1109 including, the token that will be returned next by
1110 cp_lexer_peek_token. */
1112 static void
1114 {
1123 {
1128 }
1129 }
1131 /* Begin saving tokens. All tokens consumed after this point will be
1132 preserved. */
1134 static void
1136 {
1137 /* Provide debugging output. */
1142 }
1144 /* Commit to the portion of the token stream most recently saved. */
1146 static void
1148 {
1149 /* Provide debugging output. */
1154 }
1156 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1157 to the token stream. Stop saving tokens. */
1159 static void
1161 {
1162 /* Provide debugging output. */
1167 }
1169 /* RAII wrapper around the above functions, with sanity checking. Creating
1170 a variable saves tokens, which are committed when the variable is
1171 destroyed unless they are explicitly rolled back by calling the rollback
1172 member function. */
1174 struct saved_token_sentinel
1175 {
1180 {
1183 }
1185 {
1188 }
1190 {
1194 }
1195 };
1197 /* Print a representation of the TOKEN on the STREAM. */
1199 static void
1201 {
1202 /* We don't use cpp_type2name here because the parser defines
1203 a few tokens of its own. */
1205 /* cpplib-defined token types */
1206 #define OP(e, s) #e,
1207 #define TK(e, s) #e,
1208 TTYPE_TABLE
1209 #undef OP
1210 #undef TK
1211 /* C++ parser token types - see "Manifest constants", above. */
1215 };
1217 /* For some tokens, print the associated data. */
1219 {
1221 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1222 For example, `struct' is mapped to an INTEGER_CST. */
1225 /* else fall through */
1243 /* If we have a name for the token, print it out. Otherwise, we
1244 simply give the numeric code. */
1247 else
1250 }
1251 }
1253 DEBUG_FUNCTION void
1255 {
1258 }
1260 DEBUG_FUNCTION void
1262 {
1265 else
1267 }
1270 /* Start emitting debugging information. */
1272 static void
1274 {
1277 }
1279 /* Stop emitting debugging information. */
1281 static void
1283 {
1286 }
1288 /* Create a new cp_token_cache, representing a range of tokens. */
1292 {
1297 }
1299 /* Diagnose if #pragma omp declare simd isn't followed immediately
1300 by function declaration or definition. */
1304 {
1306 {
1310 }
1311 }
1313 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1314 and put that into "omp declare simd" attribute. */
1318 {
1320 {
1322 {
1325 }
1327 {
1330 }
1331 }
1332 }
1333 \f
1334 /* Decl-specifiers. */
1336 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1338 static void
1340 {
1342 }
1344 /* Declarators. */
1346 /* Nothing other than the parser should be creating declarators;
1347 declarators are a semi-syntactic representation of C++ entities.
1348 Other parts of the front end that need to create entities (like
1349 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1364 /* An erroneous declarator. */
1367 /* The obstack on which declarators and related data structures are
1368 allocated. */
1371 /* Alloc BYTES from the declarator memory pool. */
1375 {
1377 }
1379 /* Allocate a declarator of the indicated KIND. Clear fields that are
1380 common to all declarators. */
1384 {
1396 }
1398 /* Make a declarator for a generalized identifier. If
1399 QUALIFYING_SCOPE is non-NULL, the identifier is
1400 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1401 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1402 is, if any. */
1406 special_function_kind sfk)
1407 {
1410 /* It is valid to write:
1412 class C { void f(); };
1413 typedef C D;
1414 void D::f();
1416 The standard is not clear about whether `typedef const C D' is
1417 legal; as of 2002-09-15 the committee is considering that
1418 question. EDG 3.0 allows that syntax. Therefore, we do as
1419 well. */
1433 }
1435 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1436 of modifiers such as const or volatile to apply to the pointer
1437 type, represented as identifiers. ATTRIBUTES represent the attributes that
1438 appertain to the pointer or reference. */
1440 cp_declarator *
1442 tree attributes)
1443 {
1451 {
1455 }
1456 else
1462 }
1464 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1465 represent the attributes that appertain to the pointer or
1466 reference. */
1468 cp_declarator *
1471 {
1479 {
1483 }
1484 else
1490 }
1492 /* Like make_pointer_declarator -- but for a pointer to a non-static
1493 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1494 appertain to the pointer or reference. */
1496 cp_declarator *
1499 tree attributes)
1500 {
1509 {
1512 }
1513 else
1519 }
1521 /* Make a declarator for the function given by TARGET, with the
1522 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1523 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1524 indicates what exceptions can be thrown. */
1526 cp_declarator *
1528 tree parms,
1529 cp_cv_quals cv_qualifiers,
1530 cp_virt_specifiers virt_specifiers,
1531 cp_ref_qualifier ref_qualifier,
1532 tree exception_specification,
1533 tree late_return_type)
1534 {
1546 {
1550 }
1551 else
1555 }
1557 /* Make a declarator for an array of BOUNDS elements, each of which is
1558 defined by ELEMENT. */
1560 cp_declarator *
1562 {
1569 {
1573 }
1574 else
1578 }
1580 /* Determine whether the declarator we've seen so far can be a
1581 parameter pack, when followed by an ellipsis. */
1582 static bool
1584 {
1585 /* Search for a declarator name, or any other declarator that goes
1586 after the point where the ellipsis could appear in a parameter
1587 pack. If we find any of these, then this declarator can not be
1588 made into a parameter pack. */
1591 {
1593 {
1605 }
1606 }
1609 }
1613 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1614 DECLARATOR and DEFAULT_ARGUMENT. */
1616 cp_parameter_declarator *
1619 tree default_argument)
1620 {
1628 else
1635 }
1637 /* Returns true iff DECLARATOR is a declaration for a function. */
1639 static bool
1641 {
1643 {
1651 }
1653 }
1655 /* The parser. */
1657 /* Overview
1658 --------
1660 A cp_parser parses the token stream as specified by the C++
1661 grammar. Its job is purely parsing, not semantic analysis. For
1662 example, the parser breaks the token stream into declarators,
1663 expressions, statements, and other similar syntactic constructs.
1664 It does not check that the types of the expressions on either side
1665 of an assignment-statement are compatible, or that a function is
1666 not declared with a parameter of type `void'.
1668 The parser invokes routines elsewhere in the compiler to perform
1669 semantic analysis and to build up the abstract syntax tree for the
1670 code processed.
1672 The parser (and the template instantiation code, which is, in a
1673 way, a close relative of parsing) are the only parts of the
1674 compiler that should be calling push_scope and pop_scope, or
1675 related functions. The parser (and template instantiation code)
1676 keeps track of what scope is presently active; everything else
1677 should simply honor that. (The code that generates static
1678 initializers may also need to set the scope, in order to check
1679 access control correctly when emitting the initializers.)
1681 Methodology
1682 -----------
1684 The parser is of the standard recursive-descent variety. Upcoming
1685 tokens in the token stream are examined in order to determine which
1686 production to use when parsing a non-terminal. Some C++ constructs
1687 require arbitrary look ahead to disambiguate. For example, it is
1688 impossible, in the general case, to tell whether a statement is an
1689 expression or declaration without scanning the entire statement.
1690 Therefore, the parser is capable of "parsing tentatively." When the
1691 parser is not sure what construct comes next, it enters this mode.
1692 Then, while we attempt to parse the construct, the parser queues up
1693 error messages, rather than issuing them immediately, and saves the
1694 tokens it consumes. If the construct is parsed successfully, the
1695 parser "commits", i.e., it issues any queued error messages and
1696 the tokens that were being preserved are permanently discarded.
1697 If, however, the construct is not parsed successfully, the parser
1698 rolls back its state completely so that it can resume parsing using
1699 a different alternative.
1701 Future Improvements
1702 -------------------
1704 The performance of the parser could probably be improved substantially.
1705 We could often eliminate the need to parse tentatively by looking ahead
1706 a little bit. In some places, this approach might not entirely eliminate
1707 the need to parse tentatively, but it might still speed up the average
1708 case. */
1710 /* Flags that are passed to some parsing functions. These values can
1711 be bitwise-ored together. */
1713 enum
1714 {
1715 /* No flags. */
1717 /* The construct is optional. If it is not present, then no error
1718 should be issued. */
1720 /* When parsing a type-specifier, treat user-defined type-names
1721 as non-type identifiers. */
1723 /* When parsing a type-specifier, do not try to parse a class-specifier
1724 or enum-specifier. */
1726 /* When parsing a decl-specifier-seq, only allow type-specifier or
1727 constexpr. */
1729 };
1731 /* This type is used for parameters and variables which hold
1732 combinations of the above flags. */
1735 /* The different kinds of declarators we want to parse. */
1738 {
1739 /* We want an abstract declarator. */
1740 CP_PARSER_DECLARATOR_ABSTRACT,
1741 /* We want a named declarator. */
1742 CP_PARSER_DECLARATOR_NAMED,
1743 /* We don't mind, but the name must be an unqualified-id. */
1744 CP_PARSER_DECLARATOR_EITHER
1747 /* The precedence values used to parse binary expressions. The minimum value
1748 of PREC must be 1, because zero is reserved to quickly discriminate
1749 binary operators from other tokens. */
1751 enum cp_parser_prec
1752 {
1753 PREC_NOT_OPERATOR,
1754 PREC_LOGICAL_OR_EXPRESSION,
1755 PREC_LOGICAL_AND_EXPRESSION,
1756 PREC_INCLUSIVE_OR_EXPRESSION,
1757 PREC_EXCLUSIVE_OR_EXPRESSION,
1758 PREC_AND_EXPRESSION,
1759 PREC_EQUALITY_EXPRESSION,
1760 PREC_RELATIONAL_EXPRESSION,
1761 PREC_SHIFT_EXPRESSION,
1762 PREC_ADDITIVE_EXPRESSION,
1763 PREC_MULTIPLICATIVE_EXPRESSION,
1764 PREC_PM_EXPRESSION,
1765 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1766 };
1768 /* A mapping from a token type to a corresponding tree node type, with a
1769 precedence value. */
1772 {
1773 /* The token type. */
1775 /* The corresponding tree code. */
1777 /* The precedence of this operator. */
1782 {
1783 /* Left hand side of the binary operation we are currently
1784 parsing. */
1785 tree lhs;
1786 /* Original tree code for left hand side, if it was a binary
1787 expression itself (used for -Wparentheses). */
1789 /* Tree code for the binary operation we are parsing. */
1791 /* Precedence of the binary operation we are parsing. */
1793 /* Location of the binary operation we are parsing. */
1794 location_t loc;
1797 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1798 entries because precedence levels on the stack are monotonically
1799 increasing. */
1803 /* Prototypes. */
1805 /* Constructors and destructors. */
1810 /* Class variables. */
1814 /* The operator-precedence table used by cp_parser_binary_expression.
1815 Transformed into an associative array (binops_by_token) by
1816 cp_parser_new. */
1849 };
1851 /* The same as binops, but initialized by cp_parser_new so that
1852 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1853 for speed. */
1856 /* Constructors and destructors. */
1858 /* Construct a new context. The context below this one on the stack
1859 is given by NEXT. */
1863 {
1866 /* Allocate the storage. */
1868 {
1869 /* Pull the first entry from the free list. */
1873 }
1874 else
1877 /* No errors have occurred yet in this context. */
1879 /* If this is not the bottommost context, copy information that we
1880 need from the previous context. */
1882 {
1883 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1884 expression, then we are parsing one in this context, too. */
1886 /* Thread the stack. */
1888 }
1891 }
1893 /* Managing the unparsed function queues. */
1895 #define unparsed_funs_with_default_args \
1896 parser->unparsed_queues->last ().funs_with_default_args
1897 #define unparsed_funs_with_definitions \
1898 parser->unparsed_queues->last ().funs_with_definitions
1899 #define unparsed_nsdmis \
1900 parser->unparsed_queues->last ().nsdmis
1901 #define unparsed_classes \
1902 parser->unparsed_queues->last ().classes
1904 static void
1906 {
1909 }
1911 static void
1913 {
1916 }
1918 /* Prototypes. */
1920 /* Constructors and destructors. */
1925 /* Routines to parse various constructs.
1927 Those that return `tree' will return the error_mark_node (rather
1928 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1929 Sometimes, they will return an ordinary node if error-recovery was
1930 attempted, even though a parse error occurred. So, to check
1931 whether or not a parse error occurred, you should always use
1932 cp_parser_error_occurred. If the construct is optional (indicated
1933 either by an `_opt' in the name of the function that does the
1934 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1935 the construct is not present. */
1937 /* Lexical conventions [gram.lex] */
1939 static tree cp_parser_identifier
1941 static tree cp_parser_string_literal
1943 static tree cp_parser_userdef_char_literal
1945 static tree cp_parser_userdef_string_literal
1947 static tree cp_parser_userdef_numeric_literal
1950 /* Basic concepts [gram.basic] */
1952 static bool cp_parser_translation_unit
1955 /* Expressions [gram.expr] */
1957 static tree cp_parser_primary_expression
1959 static tree cp_parser_id_expression
1961 static tree cp_parser_unqualified_id
1963 static tree cp_parser_nested_name_specifier_opt
1965 static tree cp_parser_nested_name_specifier
1967 static tree cp_parser_qualifying_entity
1969 static tree cp_parser_postfix_expression
1971 static tree cp_parser_postfix_open_square_expression
1973 static tree cp_parser_postfix_dot_deref_expression
1977 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1979 static void cp_parser_pseudo_destructor_name
1981 static tree cp_parser_unary_expression
1983 static enum tree_code cp_parser_unary_operator
1985 static tree cp_parser_new_expression
1989 static tree cp_parser_new_type_id
1997 static tree cp_parser_delete_expression
1999 static tree cp_parser_cast_expression
2001 static tree cp_parser_binary_expression
2003 static tree cp_parser_question_colon_clause
2005 static tree cp_parser_assignment_expression
2007 static enum tree_code cp_parser_assignment_operator_opt
2009 static tree cp_parser_expression
2011 static tree cp_parser_constant_expression
2013 static tree cp_parser_builtin_offsetof
2015 static tree cp_parser_lambda_expression
2017 static void cp_parser_lambda_introducer
2019 static bool cp_parser_lambda_declarator_opt
2021 static void cp_parser_lambda_body
2024 /* Statements [gram.stmt.stmt] */
2026 static void cp_parser_statement
2028 static void cp_parser_label_for_labeled_statement
2030 static tree cp_parser_expression_statement
2032 static tree cp_parser_compound_statement
2034 static void cp_parser_statement_seq_opt
2036 static tree cp_parser_selection_statement
2038 static tree cp_parser_condition
2040 static tree cp_parser_iteration_statement
2042 static bool cp_parser_for_init_statement
2044 static tree cp_parser_for
2046 static tree cp_parser_c_for
2048 static tree cp_parser_range_for
2050 static void do_range_for_auto_deduction
2052 static tree cp_parser_perform_range_for_lookup
2054 static tree cp_parser_range_for_member_function
2056 static tree cp_parser_jump_statement
2058 static void cp_parser_declaration_statement
2061 static tree cp_parser_implicitly_scoped_statement
2063 static void cp_parser_already_scoped_statement
2066 /* Declarations [gram.dcl.dcl] */
2068 static void cp_parser_declaration_seq_opt
2070 static void cp_parser_declaration
2072 static void cp_parser_block_declaration
2074 static void cp_parser_simple_declaration
2076 static void cp_parser_decl_specifier_seq
2078 static tree cp_parser_storage_class_specifier_opt
2080 static tree cp_parser_function_specifier_opt
2082 static tree cp_parser_type_specifier
2085 static tree cp_parser_simple_type_specifier
2087 static tree cp_parser_type_name
2089 static tree cp_parser_nonclass_name
2091 static tree cp_parser_elaborated_type_specifier
2093 static tree cp_parser_enum_specifier
2095 static void cp_parser_enumerator_list
2097 static void cp_parser_enumerator_definition
2099 static tree cp_parser_namespace_name
2101 static void cp_parser_namespace_definition
2103 static void cp_parser_namespace_body
2105 static tree cp_parser_qualified_namespace_specifier
2107 static void cp_parser_namespace_alias_definition
2109 static bool cp_parser_using_declaration
2111 static void cp_parser_using_directive
2113 static tree cp_parser_alias_declaration
2115 static void cp_parser_asm_definition
2117 static void cp_parser_linkage_specification
2119 static void cp_parser_static_assert
2121 static tree cp_parser_decltype
2124 /* Declarators [gram.dcl.decl] */
2126 static tree cp_parser_init_declarator
2133 static enum tree_code cp_parser_ptr_operator
2135 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2137 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2139 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2141 static tree cp_parser_late_return_type_opt
2143 static tree cp_parser_declarator_id
2145 static tree cp_parser_type_id
2147 static tree cp_parser_template_type_arg
2150 static tree cp_parser_type_id_1
2152 static void cp_parser_type_specifier_seq
2154 static tree cp_parser_parameter_declaration_clause
2156 static tree cp_parser_parameter_declaration_list
2160 static tree cp_parser_default_argument
2162 static void cp_parser_function_body
2164 static tree cp_parser_initializer
2166 static tree cp_parser_initializer_clause
2168 static tree cp_parser_braced_list
2173 static bool cp_parser_ctor_initializer_opt_and_function_body
2176 static tree cp_parser_late_parsing_omp_declare_simd
2179 static tree cp_parser_late_parsing_cilk_simd_fn_info
2182 static tree synthesize_implicit_template_parm
2184 static tree finish_fully_implicit_template
2187 /* Classes [gram.class] */
2189 static tree cp_parser_class_name
2191 static tree cp_parser_class_specifier
2193 static tree cp_parser_class_head
2195 static enum tag_types cp_parser_class_key
2197 static void cp_parser_type_parameter_key
2199 static void cp_parser_member_specification_opt
2201 static void cp_parser_member_declaration
2203 static tree cp_parser_pure_specifier
2205 static tree cp_parser_constant_initializer
2208 /* Derived classes [gram.class.derived] */
2210 static tree cp_parser_base_clause
2212 static tree cp_parser_base_specifier
2215 /* Special member functions [gram.special] */
2217 static tree cp_parser_conversion_function_id
2219 static tree cp_parser_conversion_type_id
2223 static bool cp_parser_ctor_initializer_opt
2225 static void cp_parser_mem_initializer_list
2227 static tree cp_parser_mem_initializer
2229 static tree cp_parser_mem_initializer_id
2232 /* Overloading [gram.over] */
2234 static tree cp_parser_operator_function_id
2236 static tree cp_parser_operator
2239 /* Templates [gram.temp] */
2241 static void cp_parser_template_declaration
2243 static tree cp_parser_template_parameter_list
2245 static tree cp_parser_template_parameter
2247 static tree cp_parser_type_parameter
2249 static tree cp_parser_template_id
2251 static tree cp_parser_template_name
2253 static tree cp_parser_template_argument_list
2255 static tree cp_parser_template_argument
2257 static void cp_parser_explicit_instantiation
2259 static void cp_parser_explicit_specialization
2262 /* Exception handling [gram.exception] */
2264 static tree cp_parser_try_block
2266 static bool cp_parser_function_try_block
2268 static void cp_parser_handler_seq
2270 static void cp_parser_handler
2272 static tree cp_parser_exception_declaration
2274 static tree cp_parser_throw_expression
2276 static tree cp_parser_exception_specification_opt
2278 static tree cp_parser_type_id_list
2281 /* GNU Extensions */
2283 static tree cp_parser_asm_specification_opt
2285 static tree cp_parser_asm_operand_list
2287 static tree cp_parser_asm_clobber_list
2289 static tree cp_parser_asm_label_list
2291 static bool cp_next_tokens_can_be_attribute_p
2293 static bool cp_next_tokens_can_be_gnu_attribute_p
2295 static bool cp_next_tokens_can_be_std_attribute_p
2297 static bool cp_nth_tokens_can_be_std_attribute_p
2299 static bool cp_nth_tokens_can_be_gnu_attribute_p
2301 static bool cp_nth_tokens_can_be_attribute_p
2303 static tree cp_parser_attributes_opt
2305 static tree cp_parser_gnu_attributes_opt
2307 static tree cp_parser_gnu_attribute_list
2309 static tree cp_parser_std_attribute
2311 static tree cp_parser_std_attribute_spec
2313 static tree cp_parser_std_attribute_spec_seq
2315 static bool cp_parser_extension_opt
2317 static void cp_parser_label_declaration
2320 /* Transactional Memory Extensions */
2322 static tree cp_parser_transaction
2324 static tree cp_parser_transaction_expression
2326 static bool cp_parser_function_transaction
2328 static tree cp_parser_transaction_cancel
2332 pragma_external,
2333 pragma_member,
2334 pragma_objc_icode,
2335 pragma_stmt,
2336 pragma_compound
2337 };
2338 static bool cp_parser_pragma
2341 /* Objective-C++ Productions */
2343 static tree cp_parser_objc_message_receiver
2345 static tree cp_parser_objc_message_args
2347 static tree cp_parser_objc_message_expression
2349 static tree cp_parser_objc_encode_expression
2351 static tree cp_parser_objc_defs_expression
2353 static tree cp_parser_objc_protocol_expression
2355 static tree cp_parser_objc_selector_expression
2357 static tree cp_parser_objc_expression
2359 static bool cp_parser_objc_selector_p
2361 static tree cp_parser_objc_selector
2363 static tree cp_parser_objc_protocol_refs_opt
2365 static void cp_parser_objc_declaration
2367 static tree cp_parser_objc_statement
2369 static bool cp_parser_objc_valid_prefix_attributes
2371 static void cp_parser_objc_at_property_declaration
2373 static void cp_parser_objc_at_synthesize_declaration
2375 static void cp_parser_objc_at_dynamic_declaration
2377 static tree cp_parser_objc_struct_declaration
2380 /* Utility Routines */
2382 static tree cp_parser_lookup_name
2384 static tree cp_parser_lookup_name_simple
2386 static tree cp_parser_maybe_treat_template_as_class
2388 static bool cp_parser_check_declarator_template_parameters
2390 static bool cp_parser_check_template_parameters
2392 static tree cp_parser_simple_cast_expression
2394 static tree cp_parser_global_scope_opt
2396 static bool cp_parser_constructor_declarator_p
2398 static tree cp_parser_function_definition_from_specifiers_and_declarator
2400 static tree cp_parser_function_definition_after_declarator
2402 static void cp_parser_template_declaration_after_export
2404 static void cp_parser_perform_template_parameter_access_checks
2406 static tree cp_parser_single_declaration
2408 static tree cp_parser_functional_cast
2410 static tree cp_parser_save_member_function_body
2412 static tree cp_parser_save_nsdmi
2414 static tree cp_parser_enclosed_template_argument_list
2416 static void cp_parser_save_default_args
2418 static void cp_parser_late_parsing_for_member
2420 static tree cp_parser_late_parse_one_default_arg
2422 static void cp_parser_late_parsing_nsdmi
2424 static void cp_parser_late_parsing_default_args
2426 static tree cp_parser_sizeof_operand
2428 static tree cp_parser_trait_expr
2430 static bool cp_parser_declares_only_class_p
2432 static void cp_parser_set_storage_class
2434 static void cp_parser_set_decl_spec_type
2436 static void set_and_check_decl_spec_loc
2439 static bool cp_parser_friend_p
2441 static void cp_parser_required_error
2447 static bool cp_parser_token_starts_function_definition_p
2449 static bool cp_parser_next_token_starts_class_definition_p
2451 static bool cp_parser_next_token_ends_template_argument_p
2453 static bool cp_parser_nth_token_starts_template_argument_list_p
2455 static enum tag_types cp_parser_token_is_class_key
2457 static enum tag_types cp_parser_token_is_type_parameter_key
2459 static void cp_parser_check_class_key
2461 static void cp_parser_check_access_in_redeclaration
2463 static bool cp_parser_optional_template_keyword
2465 static void cp_parser_pre_parsed_nested_name_specifier
2467 static bool cp_parser_cache_group
2469 static tree cp_parser_cache_defarg
2471 static void cp_parser_parse_tentatively
2473 static void cp_parser_commit_to_tentative_parse
2475 static void cp_parser_commit_to_topmost_tentative_parse
2477 static void cp_parser_abort_tentative_parse
2479 static bool cp_parser_parse_definitely
2483 static bool cp_parser_uncommitted_to_tentative_parse_p
2485 static void cp_parser_error
2487 static void cp_parser_name_lookup_error
2489 static bool cp_parser_simulate_error
2491 static bool cp_parser_check_type_definition
2493 static void cp_parser_check_for_definition_in_return_type
2495 static void cp_parser_check_for_invalid_template_id
2497 static bool cp_parser_non_integral_constant_expression
2499 static void cp_parser_diagnose_invalid_type_name
2501 static bool cp_parser_parse_and_diagnose_invalid_type_name
2503 static int cp_parser_skip_to_closing_parenthesis
2505 static void cp_parser_skip_to_end_of_statement
2507 static void cp_parser_consume_semicolon_at_end_of_statement
2509 static void cp_parser_skip_to_end_of_block_or_statement
2511 static bool cp_parser_skip_to_closing_brace
2513 static void cp_parser_skip_to_end_of_template_parameter_list
2515 static void cp_parser_skip_to_pragma_eol
2517 static bool cp_parser_error_occurred
2519 static bool cp_parser_allow_gnu_extensions_p
2521 static bool cp_parser_is_pure_string_literal
2523 static bool cp_parser_is_string_literal
2525 static bool cp_parser_is_keyword
2527 static tree cp_parser_make_typename_type
2531 static bool cp_parser_compound_literal_p
2533 static bool cp_parser_array_designator_p
2535 static bool cp_parser_skip_to_closing_square_bracket
2538 /* Returns nonzero if we are parsing tentatively. */
2542 {
2544 }
2546 /* Returns nonzero if TOKEN is a string literal. */
2548 static bool
2550 {
2556 }
2558 /* Returns nonzero if TOKEN is a string literal
2559 of a user-defined string literal. */
2561 static bool
2563 {
2570 }
2572 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2574 static bool
2576 {
2578 }
2580 /* If not parsing tentatively, issue a diagnostic of the form
2581 FILE:LINE: MESSAGE before TOKEN
2582 where TOKEN is the next token in the input stream. MESSAGE
2583 (specified by the caller) is usually of the form "expected
2584 OTHER-TOKEN". */
2586 static void
2588 {
2590 {
2592 /* This diagnostic makes more sense if it is tagged to the line
2593 of the token we just peeked at. */
2597 {
2602 }
2605 /* Because c_parser_error does not understand
2606 CPP_KEYWORD, keywords are treated like
2607 identifiers. */
2610 }
2611 }
2613 /* Issue an error about name-lookup failing. NAME is the
2614 IDENTIFIER_NODE DECL is the result of
2615 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2616 the thing that we hoped to find. */
2618 static void
2620 tree name,
2621 tree decl,
2622 name_lookup_error desired,
2623 location_t location)
2624 {
2625 /* If name lookup completely failed, tell the user that NAME was not
2626 declared. */
2628 {
2641 else
2643 }
2645 {
2647 {
2664 }
2665 }
2667 {
2669 {
2679 name);
2683 }
2684 }
2685 else
2686 {
2688 {
2701 }
2702 }
2703 }
2705 /* If we are parsing tentatively, remember that an error has occurred
2706 during this tentative parse. Returns true if the error was
2707 simulated; false if a message should be issued by the caller. */
2709 static bool
2711 {
2713 {
2716 }
2718 }
2720 /* This function is called when a type is defined. If type
2721 definitions are forbidden at this point, an error message is
2722 issued. */
2724 static bool
2726 {
2727 /* If types are forbidden here, issue a message. */
2729 {
2730 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2731 in the message need to be interpreted. */
2734 }
2736 }
2738 /* This function is called when the DECLARATOR is processed. The TYPE
2739 was a type defined in the decl-specifiers. If it is invalid to
2740 define a type in the decl-specifiers for DECLARATOR, an error is
2741 issued. TYPE_LOCATION is the location of TYPE and is used
2742 for error reporting. */
2744 static void
2747 {
2748 /* [dcl.fct] forbids type definitions in return types.
2749 Unfortunately, it's not easy to know whether or not we are
2750 processing a return type until after the fact. */
2758 {
2763 type);
2764 }
2765 }
2767 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2768 "<" in any valid C++ program. If the next token is indeed "<",
2769 issue a message warning the user about what appears to be an
2770 invalid attempt to form a template-id. LOCATION is the location
2771 of the type-specifier (TYPE) */
2773 static void
2775 tree type,
2777 location_t location)
2778 {
2782 {
2786 {
2789 else
2791 }
2792 else
2794 /* Remember the location of the invalid "<". */
2797 /* Consume the "<". */
2799 /* Parse the template arguments. */
2801 /* Permanently remove the invalid template arguments so that
2802 this error message is not issued again. */
2805 }
2806 }
2808 /* If parsing an integral constant-expression, issue an error message
2809 about the fact that THING appeared and return true. Otherwise,
2810 return false. In either case, set
2811 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2813 static bool
2815 non_integral_constant thing)
2816 {
2819 {
2821 {
2824 {
2831 "enumeration type cannot appear in a "
2922 }
2926 }
2927 }
2929 }
2931 /* Emit a diagnostic for an invalid type name. This function commits
2932 to the current active tentative parse, if any. (Otherwise, the
2933 problematic construct might be encountered again later, resulting
2934 in duplicate error messages.) LOCATION is the location of ID. */
2936 static void
2938 location_t location)
2939 {
2942 /* Try to lookup the identifier. */
2949 /* If the lookup was ambiguous, an error will already have
2950 been issued. */
2952 /* If the lookup found a template-name, it means that the user forgot
2953 to specify an argument list. Emit a useful error message. */
2957 decl);
2961 /* Something like 'unsigned A a;' */
2964 {
2965 /* Issue an error message. */
2967 /* If we're in a template class, it's possible that the user was
2968 referring to a type from a base class. For example:
2970 template <typename T> struct A { typedef T X; };
2971 template <typename T> struct B : public A<T> { X x; };
2973 The user should have said "typename A<T>::X". */
2987 {
2988 tree b;
2991 b;
2993 {
2997 {
2998 tree field;
2999 /* Go from a particular instantiation of the
3000 template (which will have an empty TYPE_FIELDs),
3001 to the main version. */
3004 field;
3008 {
3013 }
3016 }
3017 }
3018 }
3019 }
3020 /* Here we diagnose qualified-ids where the scope is actually correct,
3021 but the identifier does not resolve to a valid type name. */
3023 {
3025 {
3030 else
3034 }
3037 {
3038 /* A<T>::A<T>() */
3044 }
3051 {
3056 else
3060 }
3061 else
3063 }
3064 }
3066 /* Check for a common situation where a type-name should be present,
3067 but is not, and issue a sensible error message. Returns true if an
3068 invalid type-name was detected.
3070 The situation handled by this function are variable declarations of the
3071 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3072 Usually, `ID' should name a type, but if we got here it means that it
3073 does not. We try to emit the best possible error message depending on
3074 how exactly the id-expression looks like. */
3076 static bool
3078 {
3079 tree id;
3082 /* Avoid duplicate error about ambiguous lookup. */
3084 {
3088 }
3097 /* If the next token is a (, this is a function with no explicit return
3098 type, i.e. constructor, destructor or conversion op. */
3101 {
3104 }
3108 /* Emit a diagnostic for the invalid type. */
3110 out:
3111 /* If we aren't in the middle of a declarator (i.e. in a
3112 parameter-declaration-clause), skip to the end of the declaration;
3113 there's no point in trying to process it. */
3117 }
3119 /* Consume tokens up to, and including, the next non-nested closing `)'.
3120 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3121 are doing error recovery. Returns -1 if OR_COMMA is true and we
3122 found an unnested comma. */
3124 static int
3129 {
3139 {
3143 {
3146 /* If we've run out of tokens, then there is no closing `)'. */
3149 /* This is good for lambda expression capture-lists. */
3159 /* This matches the processing in skip_to_end_of_statement. */
3185 {
3189 }
3194 }
3196 /* Consume the token. */
3198 }
3199 }
3201 /* Consume tokens until we reach the end of the current statement.
3202 Normally, that will be just before consuming a `;'. However, if a
3203 non-nested `}' comes first, then we stop before consuming that. */
3205 static void
3207 {
3210 /* Unwind generic function template scope if necessary. */
3215 {
3219 {
3222 /* If we've run out of tokens, stop. */
3226 /* If the next token is a `;', we have reached the end of the
3227 statement. */
3233 /* If this is a non-nested '}', stop before consuming it.
3234 That way, when confronted with something like:
3236 { 3 + }
3238 we stop before consuming the closing '}', even though we
3239 have not yet reached a `;'. */
3243 /* If it is the closing '}' for a block that we have
3244 scanned, stop -- but only after consuming the token.
3245 That way given:
3247 void f g () { ... }
3248 typedef int I;
3250 we will stop after the body of the erroneously declared
3251 function, but before consuming the following `typedef'
3252 declaration. */
3254 {
3257 }
3265 }
3267 /* Consume the token. */
3269 }
3270 }
3272 /* This function is called at the end of a statement or declaration.
3273 If the next token is a semicolon, it is consumed; otherwise, error
3274 recovery is attempted. */
3276 static void
3278 {
3279 /* Look for the trailing `;'. */
3281 {
3282 /* If there is additional (erroneous) input, skip to the end of
3283 the statement. */
3285 /* If the next token is now a `;', consume it. */
3288 }
3289 }
3291 /* Skip tokens until we have consumed an entire block, or until we
3292 have consumed a non-nested `;'. */
3294 static void
3296 {
3299 /* Unwind generic function template scope if necessary. */
3304 {
3308 {
3311 /* If we've run out of tokens, stop. */
3315 /* Stop if this is an unnested ';'. */
3321 /* Stop if this is an unnested '}', or closes the outermost
3322 nesting level. */
3323 nesting_depth--;
3331 /* Nest. */
3332 nesting_depth++;
3337 }
3339 /* Consume the token. */
3341 }
3342 }
3344 /* Skip tokens until a non-nested closing curly brace is the next
3345 token, or there are no more tokens. Return true in the first case,
3346 false otherwise. */
3348 static bool
3350 {
3354 {
3358 {
3361 /* If we've run out of tokens, stop. */
3365 /* If the next token is a non-nested `}', then we have reached
3366 the end of the current block. */
3372 /* If it the next token is a `{', then we are entering a new
3373 block. Consume the entire block. */
3379 }
3381 /* Consume the token. */
3383 }
3384 }
3386 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3387 parameter is the PRAGMA token, allowing us to purge the entire pragma
3388 sequence. */
3390 static void
3392 {
3397 do
3401 /* Ensure that the pragma is not parsed again. */
3403 }
3405 /* Require pragma end of line, resyncing with it as necessary. The
3406 arguments are as for cp_parser_skip_to_pragma_eol. */
3408 static void
3410 {
3414 }
3416 /* This is a simple wrapper around make_typename_type. When the id is
3417 an unresolved identifier node, we can provide a superior diagnostic
3418 using cp_parser_diagnose_invalid_type_name. */
3420 static tree
3422 location_t id_location)
3423 {
3424 tree result;
3426 {
3432 }
3434 }
3436 /* This is a wrapper around the
3437 make_{pointer,ptrmem,reference}_declarator functions that decides
3438 which one to call based on the CODE and CLASS_TYPE arguments. The
3439 CODE argument should be one of the values returned by
3440 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3441 appertain to the pointer or reference. */
3445 cp_cv_quals cv_qualifiers,
3447 tree attributes)
3448 {
3455 else
3465 }
3467 /* Create a new C++ parser. */
3471 {
3476 /* cp_lexer_new_main is called before doing GC allocation because
3477 cp_lexer_new_main might load a PCH file. */
3480 /* Initialize the binops_by_token so that we can get the tree
3481 directly from the token. */
3489 /* For now, we always accept GNU extensions. */
3492 /* The `>' token is a greater-than operator, not the end of a
3493 template-id. */
3498 /* We are not parsing a constant-expression. */
3503 /* Local variable names are not forbidden. */
3506 /* We are not processing an `extern "C"' declaration. */
3509 /* We are not processing a declarator. */
3512 /* We are not processing a template-argument-list. */
3515 /* We are not in an iteration statement. */
3518 /* We are not in a switch statement. */
3521 /* We are not parsing a type-id inside an expression. */
3524 /* Declarations aren't implicitly extern "C". */
3527 /* String literals should be translated to the execution character set. */
3530 /* We are not parsing a function body. */
3533 /* We can correct until told otherwise. */
3536 /* The unparsed function queue is empty. */
3539 /* There are no classes being defined. */
3542 /* No template parameters apply. */
3545 /* Not declaring an implicit function template. */
3552 }
3554 /* Create a cp_lexer structure which will emit the tokens in CACHE
3555 and push it onto the parser's lexer stack. This is used for delayed
3556 parsing of in-class method bodies and default arguments, and should
3557 not be confused with tentative parsing. */
3558 static void
3560 {
3565 /* Move the current source position to that of the first token in the
3566 new lexer. */
3568 }
3570 /* Pop the top lexer off the parser stack. This is never used for the
3571 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3572 static void
3574 {
3579 /* Put the current source position back where it was before this
3580 lexer was pushed. */
3582 }
3584 /* Lexical conventions [gram.lex] */
3586 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3587 identifier. */
3589 static tree
3591 {
3594 /* Look for the identifier. */
3596 /* Return the value. */
3598 }
3600 /* Parse a sequence of adjacent string constants. Returns a
3601 TREE_STRING representing the combined, nul-terminated string
3602 constant. If TRANSLATE is true, translate the string to the
3603 execution character set. If WIDE_OK is true, a wide string is
3604 invalid here.
3606 C++98 [lex.string] says that if a narrow string literal token is
3607 adjacent to a wide string literal token, the behavior is undefined.
3608 However, C99 6.4.5p4 says that this results in a wide string literal.
3609 We follow C99 here, for consistency with the C front end.
3611 This code is largely lifted from lex_string() in c-lex.c.
3613 FUTURE: ObjC++ will need to handle @-strings here. */
3614 static tree
3617 {
3618 tree value;
3625 tree string_tree;
3631 {
3634 }
3637 {
3641 }
3642 else
3643 {
3646 }
3649 /* Try to avoid the overhead of creating and destroying an obstack
3650 for the common case of just one string. */
3653 {
3661 {
3665 }
3666 else
3670 }
3671 else
3672 {
3676 do
3677 {
3679 count++;
3684 {
3687 {
3690 }
3693 {
3698 }
3700 }
3701 else
3705 {
3710 "unsupported non-standard concatenation "
3712 }
3718 {
3722 }
3723 else
3724 {
3728 }
3729 }
3733 }
3736 {
3739 }
3743 {
3748 {
3763 }
3768 {
3773 else
3775 }
3776 }
3777 else
3778 /* cpp_interpret_string has issued an error. */
3785 }
3787 /* Look up a literal operator with the name and the exact arguments. */
3789 static tree
3791 {
3798 {
3804 {
3807 {
3817 }
3820 /* May be this should be sufficient_parms_p instead,
3821 depending on how exactly should user-defined literals
3822 work in presence of default arguments on the literal
3823 operator parameters. */
3826 }
3827 }
3830 }
3832 /* Parse a user-defined char constant. Returns a call to a user-defined
3833 literal operator taking the character as an argument. */
3835 static tree
3837 {
3845 /* Build up a call to the user-defined operator */
3846 /* Lookup the name we got back from the id-expression. */
3851 {
3856 }
3865 }
3867 /* A subroutine of cp_parser_userdef_numeric_literal to
3868 create a char... template parameter pack from a string node. */
3870 static tree
3872 {
3873 tree charvec;
3879 /* Fill in CHARVEC with all of the parameters. */
3884 /* Build the argument packs. */
3891 }
3893 /* A subroutine of cp_parser_userdef_numeric_literal to
3894 create a char... template parameter pack from a string node. */
3896 static tree
3898 {
3899 tree charvec;
3910 /* First template parm is character type. */
3913 /* Fill in CHARVEC with all of the parameters. */
3920 /* Build the argument packs. */
3927 }
3929 /* Parse a user-defined numeric constant. returns a call to a user-defined
3930 literal operator. */
3932 static tree
3934 {
3945 /* Look for a literal operator taking the exact type of numeric argument
3946 as the literal value. */
3951 {
3954 {
3958 long_long_unsigned_type_node);
3959 else
3960 {
3964 long_double_type_node);
3968 }
3971 }
3972 }
3975 /* If the numeric argument didn't work, look for a raw literal
3976 operator taking a const char* argument consisting of the number
3977 in string format. */
3982 {
3985 {
3988 }
3989 }
3992 /* If the raw literal didn't work, look for a non-type template
3993 function with parameter pack char.... Call the function with
3994 template parameter characters representing the number. */
3998 {
4003 {
4006 }
4007 }
4015 }
4017 /* Parse a user-defined string constant. Returns a call to a user-defined
4018 literal operator taking a character pointer and the length of the string
4019 as arguments. */
4021 static tree
4023 {
4032 /* Look for a template function with typename parameter CharT
4033 and parameter pack CharT... Call the function with
4034 template parameter characters representing the string. */
4038 {
4043 {
4046 }
4047 }
4050 /* Build up a call to the user-defined operator */
4051 /* Lookup the name we got back from the id-expression. */
4057 {
4061 }
4070 }
4073 /* Basic concepts [gram.basic] */
4075 /* Parse a translation-unit.
4077 translation-unit:
4078 declaration-seq [opt]
4080 Returns TRUE if all went well. */
4082 static bool
4084 {
4085 /* The address of the first non-permanent object on the declarator
4086 obstack. */
4091 /* Create the declarator obstack, if necessary. */
4093 {
4095 /* Create the error declarator. */
4097 /* Create the empty parameter list. */
4099 /* Remember where the base of the declarator obstack lies. */
4101 }
4105 /* If there are no tokens left then all went well. */
4107 {
4108 /* Get rid of the token array; we don't need it any more. */
4112 /* This file might have been a context that's implicitly extern
4113 "C". If so, pop the lang context. (Only relevant for PCH.) */
4115 {
4118 }
4120 /* Finish up. */
4124 }
4125 else
4126 {
4129 }
4131 /* Make sure the declarator obstack was fully cleaned up. */
4135 /* All went well. */
4137 }
4139 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4140 decltype context. */
4144 {
4149 }
4151 /* We're about to parse a collection of statements. If we're currently
4152 parsing tentatively, set up a firewall so that any nested
4153 cp_parser_commit_to_tentative_parse won't affect the current context. */
4155 static cp_token_position
4157 {
4164 }
4166 /* We've finished parsing the collection of statements. Wrap up the
4167 firewall and replace the relevant tokens with the parsed form. */
4169 static void
4171 tree expr)
4172 {
4176 /* Finish the firewall level. */
4178 /* And remember the result of the parse for when we try again. */
4184 }
4186 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4187 enclosing parentheses. */
4189 static tree
4191 {
4194 /* Consume the '('. */
4196 /* Start the statement-expression. */
4198 /* Parse the compound-statement. */
4200 /* Finish up. */
4202 /* Consume the ')'. */
4208 }
4210 /* Expressions [gram.expr] */
4212 /* Parse a primary-expression.
4214 primary-expression:
4215 literal
4216 this
4217 ( expression )
4218 id-expression
4219 lambda-expression (C++11)
4221 GNU Extensions:
4223 primary-expression:
4224 ( compound-statement )
4225 __builtin_va_arg ( assignment-expression , type-id )
4226 __builtin_offsetof ( type-id , offsetof-expression )
4228 C++ Extensions:
4229 __has_nothrow_assign ( type-id )
4230 __has_nothrow_constructor ( type-id )
4231 __has_nothrow_copy ( type-id )
4232 __has_trivial_assign ( type-id )
4233 __has_trivial_constructor ( type-id )
4234 __has_trivial_copy ( type-id )
4235 __has_trivial_destructor ( type-id )
4236 __has_virtual_destructor ( type-id )
4237 __is_abstract ( type-id )
4238 __is_base_of ( type-id , type-id )
4239 __is_class ( type-id )
4240 __is_empty ( type-id )
4241 __is_enum ( type-id )
4242 __is_final ( type-id )
4243 __is_literal_type ( type-id )
4244 __is_pod ( type-id )
4245 __is_polymorphic ( type-id )
4246 __is_std_layout ( type-id )
4247 __is_trivial ( type-id )
4248 __is_union ( type-id )
4250 Objective-C++ Extension:
4252 primary-expression:
4253 objc-expression
4255 literal:
4256 __null
4258 ADDRESS_P is true iff this expression was immediately preceded by
4259 "&" and therefore might denote a pointer-to-member. CAST_P is true
4260 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4261 true iff this expression is a template argument.
4263 Returns a representation of the expression. Upon return, *IDK
4264 indicates what kind of id-expression (if any) was present. */
4266 static tree
4273 {
4276 /* Assume the primary expression is not an id-expression. */
4279 /* Peek at the next token. */
4282 {
4283 /* literal:
4284 integer-literal
4285 character-literal
4286 floating-literal
4287 string-literal
4288 boolean-literal
4289 pointer-literal
4290 user-defined-literal */
4301 {
4305 }
4306 /* Floating-point literals are only allowed in an integral
4307 constant expression if they are cast to an integral or
4308 enumeration type. */
4312 {
4313 /* CAST_P will be set even in invalid code like "int(2.7 +
4314 ...)". Therefore, we have to check that the next token
4315 is sure to end the cast. */
4317 {
4322 enumerator-definition. */
4324 /* The curly brace at the end of an enum-specifier. */
4326 /* The end of a statement. */
4328 /* The end of the cast-expression. */
4330 /* The end of an array bound. */
4332 /* The closing ">" in a template-argument-list. */
4335 /* C++0x only: A ">>" treated like two ">" tokens,
4336 in a template-argument-list. */
4341 }
4343 /* If we are within a cast, then the constraint that the
4344 cast is to an integral or enumeration type will be
4345 checked at that point. If we are not within a cast, then
4346 this code is invalid. */
4349 }
4368 /* ??? Should wide strings be allowed when parser->translate_strings_p
4369 is false (i.e. in attributes)? If not, we can kill the third
4370 argument to cp_parser_string_literal. */
4376 /* If we see `( { ' then we are looking at the beginning of
4377 a GNU statement-expression. */
4380 {
4381 /* Statement-expressions are not allowed by the standard. */
4385 /* And they're not allowed outside of a function-body; you
4386 cannot, for example, write:
4388 int i = ({ int j = 3; j + 1; });
4390 at class or namespace scope. */
4393 {
4395 "statement-expressions are not allowed outside "
4401 }
4402 else
4404 }
4405 /* Otherwise it's a normal parenthesized expression. */
4406 {
4407 tree expr;
4410 /* Consume the `('. */
4412 /* Within a parenthesized expression, a `>' token is always
4413 the greater-than operator. */
4414 saved_greater_than_is_operator_p
4418 /* Parse the parenthesized expression. */
4420 /* Let the front end know that this expression was
4421 enclosed in parentheses. This matters in case, for
4422 example, the expression is of the form `A::B', since
4423 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4424 not. */
4426 /* DR 705: Wrapping an unqualified name in parentheses
4427 suppresses arg-dependent lookup. We want to pass back
4428 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4429 (c++/37862), but none of the others. */
4433 /* The `>' token might be the end of a template-id or
4434 template-parameter-list now. */
4435 parser->greater_than_is_operator_p
4437 /* Consume the `)'. */
4442 }
4445 {
4447 {
4448 /* We might have an Objective-C++ message. */
4451 /* If that works out, we're done ... */
4454 /* ... else, fall though to see if it's a lambda. */
4455 }
4457 /* Don't warn about a failed tentative parse. */
4462 }
4466 /* We have an Objective-C++ string literal. */
4473 {
4474 /* These two are the boolean literals. */
4482 /* The `__null' literal. */
4487 /* The `nullptr' literal. */
4492 /* Recognize the `this' keyword. */
4496 {
4500 }
4501 /* Pointers cannot appear in constant-expressions. */
4506 /* The `operator' keyword can be the beginning of an
4507 id-expression. */
4514 {
4515 non_integral_constant name;
4517 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4518 __func__ are the names of variables -- but they are
4519 treated specially. Therefore, they are handled here,
4520 rather than relying on the generic id-expression logic
4521 below. Grammatically, these names are id-expressions.
4523 Consume the token. */
4527 {
4539 }
4544 /* Look up the name. */
4546 }
4549 {
4550 tree expression;
4551 tree type;
4552 source_location type_location;
4554 /* The `__builtin_va_arg' construct is used to handle
4555 `va_arg'. Consume the `__builtin_va_arg' token. */
4557 /* Look for the opening `('. */
4559 /* Now, parse the assignment-expression. */
4561 /* Look for the `,'. */
4564 /* Parse the type-id. */
4566 /* Look for the closing `)'. */
4568 /* Using `va_arg' in a constant-expression is not
4569 allowed. */
4571 NIC_VA_ARG))
4574 }
4604 /* Objective-C++ expressions. */
4614 {
4619 }
4623 }
4625 /* An id-expression can start with either an identifier, a
4626 `::' as the beginning of a qualified-id, or the "operator"
4627 keyword. */
4632 {
4633 tree id_expression;
4634 tree decl;
4640 id_expression:
4641 /* Parse the id-expression. */
4642 id_expression
4659 /* If we have a template-id, then no further lookup is
4660 required. If the template-id was for a template-class, we
4661 will sometimes have a TYPE_DECL at this point. */
4665 /* Look up the name. */
4666 else
4667 {
4668 tree ambiguous_decls;
4670 /* If we already know that this lookup is ambiguous, then
4671 we've already issued an error message; there's no reason
4672 to check again. */
4675 {
4678 }
4681 none_type,
4682 template_p,
4687 /* If the lookup was ambiguous, an error will already have
4688 been issued. */
4692 /* In Objective-C++, we may have an Objective-C 2.0
4693 dot-syntax for classes here. */
4698 {
4699 tree component;
4706 }
4708 /* In Objective-C++, an instance variable (ivar) may be preferred
4709 to whatever cp_parser_lookup_name() found. */
4712 /* If name lookup gives us a SCOPE_REF, then the
4713 qualifying scope was dependent. */
4715 {
4716 /* At this point, we do not know if DECL is a valid
4717 integral constant expression. We assume that it is
4718 in fact such an expression, so that code like:
4720 template <int N> struct A {
4721 int a[B<N>::i];
4722 };
4724 is accepted. At template-instantiation time, we
4725 will check that B<N>::i is actually a constant. */
4727 }
4728 /* Check to see if DECL is a local variable in a context
4729 where that is forbidden. */
4732 {
4733 /* It might be that we only found DECL because we are
4734 trying to be generous with pre-ISO scoping rules.
4735 For example, consider:
4737 int i;
4738 void g() {
4739 for (int i = 0; i < 10; ++i) {}
4740 extern void f(int j = i);
4741 }
4743 Here, name look up will originally find the out
4744 of scope `i'. We need to issue a warning message,
4745 but then use the global `i'. */
4748 {
4751 decl);
4753 }
4754 }
4755 }
4757 decl = (finish_id_expression
4759 idk,
4764 template_arg_p,
4770 }
4772 /* Anything else is an error. */
4776 }
4777 }
4785 {
4788 }
4790 /* Parse an id-expression.
4792 id-expression:
4793 unqualified-id
4794 qualified-id
4796 qualified-id:
4797 :: [opt] nested-name-specifier template [opt] unqualified-id
4798 :: identifier
4799 :: operator-function-id
4800 :: template-id
4802 Return a representation of the unqualified portion of the
4803 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4804 a `::' or nested-name-specifier.
4806 Often, if the id-expression was a qualified-id, the caller will
4807 want to make a SCOPE_REF to represent the qualified-id. This
4808 function does not do this in order to avoid wastefully creating
4809 SCOPE_REFs when they are not required.
4811 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4812 `template' keyword.
4814 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4815 uninstantiated templates.
4817 If *TEMPLATE_P is non-NULL, it is set to true iff the
4818 `template' keyword is used to explicitly indicate that the entity
4819 named is a template.
4821 If DECLARATOR_P is true, the id-expression is appearing as part of
4822 a declarator, rather than as part of an expression. */
4824 static tree
4831 {
4835 /* Assume the `template' keyword was not used. */
4839 /* Look for the optional `::' operator. */
4840 global_scope_p
4843 /* Look for the optional nested-name-specifier. */
4844 nested_name_specifier_p
4847 check_dependency_p,
4849 declarator_p)
4851 /* If there is a nested-name-specifier, then we are looking at
4852 the first qualified-id production. */
4854 {
4855 tree saved_scope;
4856 tree saved_object_scope;
4857 tree saved_qualifying_scope;
4858 tree unqualified_id;
4861 /* See if the next token is the `template' keyword. */
4865 /* Name lookup we do during the processing of the
4866 unqualified-id might obliterate SCOPE. */
4870 /* Process the final unqualified-id. */
4872 check_dependency_p,
4873 declarator_p,
4875 /* Restore the SAVED_SCOPE for our caller. */
4881 }
4882 /* Otherwise, if we are in global scope, then we are looking at one
4883 of the other qualified-id productions. */
4885 {
4887 tree id;
4889 /* Peek at the next token. */
4892 /* If it's an identifier, and the next token is not a "<", then
4893 we can avoid the template-id case. This is an optimization
4894 for this common case. */
4896 && !cp_parser_nth_token_starts_template_argument_list_p
4901 /* Try a template-id. */
4905 none_type,
4906 declarator_p);
4907 /* If that worked, we're done. */
4911 /* Peek at the next token. (Changes in the token buffer may
4912 have invalidated the pointer obtained above.) */
4916 {
4923 /* Fall through. */
4928 }
4929 }
4930 else
4933 declarator_p,
4934 optional_p);
4935 }
4937 /* Parse an unqualified-id.
4939 unqualified-id:
4940 identifier
4941 operator-function-id
4942 conversion-function-id
4943 ~ class-name
4944 template-id
4946 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4947 keyword, in a construct like `A::template ...'.
4949 Returns a representation of unqualified-id. For the `identifier'
4950 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4951 production a BIT_NOT_EXPR is returned; the operand of the
4952 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4953 other productions, see the documentation accompanying the
4954 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4955 names are looked up in uninstantiated templates. If DECLARATOR_P
4956 is true, the unqualified-id is appearing as part of a declarator,
4957 rather than as part of an expression. */
4959 static tree
4965 {
4968 /* Peek at the next token. */
4972 {
4974 {
4975 tree id;
4977 /* We don't know yet whether or not this will be a
4978 template-id. */
4980 /* Try a template-id. */
4982 check_dependency_p,
4983 none_type,
4984 declarator_p);
4985 /* If it worked, we're done. */
4988 /* Otherwise, it's an ordinary identifier. */
4990 }
4994 check_dependency_p,
4995 none_type,
4996 declarator_p);
4999 {
5000 tree type_decl;
5001 tree qualifying_scope;
5002 tree object_scope;
5003 tree scope;
5006 /* Consume the `~' token. */
5008 /* Parse the class-name. The standard, as written, seems to
5009 say that:
5011 template <typename T> struct S { ~S (); };
5012 template <typename T> S<T>::~S() {}
5014 is invalid, since `~' must be followed by a class-name, but
5015 `S<T>' is dependent, and so not known to be a class.
5016 That's not right; we need to look in uninstantiated
5017 templates. A further complication arises from:
5019 template <typename T> void f(T t) {
5020 t.T::~T();
5021 }
5023 Here, it is not possible to look up `T' in the scope of `T'
5024 itself. We must look in both the current scope, and the
5025 scope of the containing complete expression.
5027 Yet another issue is:
5029 struct S {
5030 int S;
5031 ~S();
5032 };
5034 S::~S() {}
5036 The standard does not seem to say that the `S' in `~S'
5037 should refer to the type `S' and not the data member
5038 `S::S'. */
5040 /* DR 244 says that we look up the name after the "~" in the
5041 same scope as we looked up the qualifying name. That idea
5042 isn't fully worked out; it's more complicated than that. */
5047 /* Check for invalid scopes. */
5049 {
5053 }
5055 {
5059 scope);
5064 }
5067 /* If the name is of the form "X::~X" it's OK even if X is a
5068 typedef. */
5077 {
5080 }
5082 /* ~auto means the destructor of whatever the object is. */
5084 {
5087 "%<~auto%> only available with "
5091 }
5093 /* If there was an explicit qualification (S::~T), first look
5094 in the scope given by the qualification (i.e., S).
5096 Note: in the calls to cp_parser_class_name below we pass
5097 typename_type so that lookup finds the injected-class-name
5098 rather than the constructor. */
5102 {
5107 typename_type,
5110 declarator_p);
5113 }
5114 /* In "N::S::~S", look in "N" as well. */
5116 {
5121 type_decl
5125 typename_type,
5128 declarator_p);
5131 }
5132 /* In "p->S::~T", look in the scope given by "*p" as well. */
5134 {
5139 type_decl
5143 typename_type,
5146 declarator_p);
5149 }
5150 /* Look in the surrounding context. */
5152 {
5158 type_decl
5162 typename_type,
5165 declarator_p);
5168 {
5169 /* We couldn't find a type with this name, so just accept
5170 it and check for a match at instantiation time. */
5175 }
5176 }
5177 /* If an error occurred, assume that the name of the
5178 destructor is the same as the name of the qualifying
5179 class. That allows us to keep parsing after running
5180 into ill-formed destructor names. */
5186 /* Check that destructor name and scope match. */
5188 {
5195 }
5197 /* [class.dtor]
5199 A typedef-name that names a class shall not be used as the
5200 identifier in the declarator for a destructor declaration. */
5207 type_decl);
5210 }
5214 {
5215 tree id;
5217 /* This could be a template-id, so we try that first. */
5219 /* Try a template-id. */
5222 none_type,
5223 declarator_p);
5224 /* If that worked, we're done. */
5227 /* We still don't know whether we're looking at an
5228 operator-function-id or a conversion-function-id. */
5230 /* Try an operator-function-id. */
5232 /* If that didn't work, try a conversion-function-id. */
5236 {
5237 /* 17.6.3.3.5 */
5243 }
5246 }
5247 /* Fall through. */
5254 }
5255 }
5257 /* Parse an (optional) nested-name-specifier.
5259 nested-name-specifier: [C++98]
5260 class-or-namespace-name :: nested-name-specifier [opt]
5261 class-or-namespace-name :: template nested-name-specifier [opt]
5263 nested-name-specifier: [C++0x]
5264 type-name ::
5265 namespace-name ::
5266 nested-name-specifier identifier ::
5267 nested-name-specifier template [opt] simple-template-id ::
5269 PARSER->SCOPE should be set appropriately before this function is
5270 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5271 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5272 in name lookups.
5274 Sets PARSER->SCOPE to the class (TYPE) or namespace
5275 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5276 it unchanged if there is no nested-name-specifier. Returns the new
5277 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5279 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5280 part of a declaration and/or decl-specifier. */
5282 static tree
5288 {
5293 /* Remember where the nested-name-specifier starts. */
5295 {
5298 }
5301 {
5302 tree new_scope;
5303 tree old_scope;
5304 tree saved_qualifying_scope;
5307 /* Spot cases that cannot be the beginning of a
5308 nested-name-specifier. */
5311 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5312 the already parsed nested-name-specifier. */
5314 {
5315 /* Grab the nested-name-specifier and continue the loop. */
5317 /* If we originally encountered this nested-name-specifier
5318 with IS_DECLARATION set to false, we will not have
5319 resolved TYPENAME_TYPEs, so we must do so here. */
5322 {
5327 }
5330 }
5332 /* Spot cases that cannot be the beginning of a
5333 nested-name-specifier. On the second and subsequent times
5334 through the loop, we look for the `template' keyword. */
5336 ;
5337 /* A template-id can start a nested-name-specifier. */
5339 ;
5340 /* DR 743: decltype can be used in a nested-name-specifier. */
5342 ;
5343 else
5344 {
5345 /* If the next token is not an identifier, then it is
5346 definitely not a type-name or namespace-name. */
5349 /* If the following token is neither a `<' (to begin a
5350 template-id), nor a `::', then we are not looking at a
5351 nested-name-specifier. */
5357 {
5361 }
5364 && !cp_parser_nth_token_starts_template_argument_list_p
5367 }
5369 /* The nested-name-specifier is optional, so we parse
5370 tentatively. */
5373 /* Look for the optional `template' keyword, if this isn't the
5374 first time through the loop. */
5377 else
5380 /* Save the old scope since the name lookup we are about to do
5381 might destroy it. */
5384 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5385 look up names in "X<T>::I" in order to determine that "Y" is
5386 a template. So, if we have a typename at this point, we make
5387 an effort to look through it. */
5389 && !typename_keyword_p
5394 /* Parse the qualifying entity. */
5395 new_scope
5397 typename_keyword_p,
5398 template_keyword_p,
5399 check_dependency_p,
5400 type_p,
5401 is_declaration);
5402 /* Look for the `::' token. */
5405 /* If we found what we wanted, we keep going; otherwise, we're
5406 done. */
5408 {
5411 /* Restore the OLD_SCOPE since it was valid before the
5412 failed attempt at finding the last
5413 class-or-namespace-name. */
5417 /* If the next token is a decltype, and the one after that is a
5418 `::', then the decltype has failed to resolve to a class or
5419 enumeration type. Give this error even when parsing
5420 tentatively since it can't possibly be valid--and we're going
5421 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5422 won't get another chance.*/
5426 {
5433 /* As below. */
5436 }
5440 /* If the next token is an identifier, and the one after
5441 that is a `::', then any valid interpretation would have
5442 found a class-or-namespace-name. */
5448 {
5451 {
5453 {
5454 tree decl;
5455 tree ambiguous_decls;
5458 none_type,
5467 decl);
5469 {
5470 // cp_parser_lookup_name has the same diagnostic,
5471 // thus make sure to emit it at most once.
5474 {
5479 }
5481 }
5482 else
5483 {
5485 cp_parser_name_lookup_error
5488 else
5489 cp_parser_name_lookup_error
5492 }
5493 }
5496 /* Treat this as a successful nested-name-specifier
5497 due to:
5499 [basic.lookup.qual]
5501 If the name found is not a class-name (clause
5502 _class_) or namespace-name (_namespace.def_), the
5503 program is ill-formed. */
5505 }
5507 }
5509 }
5510 /* We've found one valid nested-name-specifier. */
5512 /* Name lookup always gives us a DECL. */
5515 /* Uses of "template" must be followed by actual templates. */
5527 new_scope);
5528 /* If it is a class scope, try to complete it; we are about to
5529 be looking up names inside the class. */
5531 /* Since checking types for dependency can be expensive,
5532 avoid doing it if the type is already complete. */
5534 /* Do not try to complete dependent types. */
5536 {
5538 /* If it is a typedef to current class, use the current
5539 class instead, as the typedef won't have any names inside
5540 it yet. */
5544 }
5545 /* Make sure we look in the right scope the next time through
5546 the loop. */
5548 }
5550 /* If parsing tentatively, replace the sequence of tokens that makes
5551 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5552 token. That way, should we re-parse the token stream, we will
5553 not have to repeat the effort required to do the parse, nor will
5554 we issue duplicate error messages. */
5556 {
5560 /* Reset the contents of the START token. */
5562 /* Retrieve any deferred checks. Do not pop this access checks yet
5563 so the memory will not be reclaimed during token replacing below. */
5571 /* Purge all subsequent tokens. */
5573 }
5579 }
5581 /* Parse a nested-name-specifier. See
5582 cp_parser_nested_name_specifier_opt for details. This function
5583 behaves identically, except that it will an issue an error if no
5584 nested-name-specifier is present. */
5586 static tree
5592 {
5593 tree scope;
5595 /* Look for the nested-name-specifier. */
5597 typename_keyword_p,
5598 check_dependency_p,
5599 type_p,
5600 is_declaration);
5601 /* If it was not present, issue an error message. */
5603 {
5606 }
5609 }
5611 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5612 this is either a class-name or a namespace-name (which corresponds
5613 to the class-or-namespace-name production in the grammar). For
5614 C++0x, it can also be a type-name that refers to an enumeration
5615 type or a simple-template-id.
5617 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5618 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5619 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5620 TYPE_P is TRUE iff the next name should be taken as a class-name,
5621 even the same name is declared to be another entity in the same
5622 scope.
5624 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5625 specified by the class-or-namespace-name. If neither is found the
5626 ERROR_MARK_NODE is returned. */
5628 static tree
5635 {
5636 tree saved_scope;
5637 tree saved_qualifying_scope;
5638 tree saved_object_scope;
5639 tree scope;
5643 /* DR 743: decltype can appear in a nested-name-specifier. */
5645 {
5649 {
5652 }
5656 }
5658 /* Before we try to parse the class-name, we must save away the
5659 current PARSER->SCOPE since cp_parser_class_name will destroy
5660 it. */
5664 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5665 there is no need to look for a namespace-name. */
5666 only_class_p = template_keyword_p
5671 typename_keyword_p,
5672 template_keyword_p,
5674 check_dependency_p,
5676 is_declaration);
5678 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5682 {
5683 /* Restore the saved scope. */
5688 /* Parse tentatively. */
5691 /* Parse a type-name */
5694 /* "If the name found does not designate a namespace or a class,
5695 enumeration, or dependent type, the program is ill-formed."
5697 We cover classes and dependent types above and namespaces below,
5698 so this code is only looking for enums. */
5704 }
5705 /* If that didn't work, try for a namespace-name. */
5707 {
5708 /* Restore the saved scope. */
5712 /* If we are not looking at an identifier followed by the scope
5713 resolution operator, then this is not part of a
5714 nested-name-specifier. (Note that this function is only used
5715 to parse the components of a nested-name-specifier.) */
5720 }
5723 }
5725 /* Return true if we are looking at a compound-literal, false otherwise. */
5727 static bool
5729 {
5730 /* Consume the `('. */
5735 /* Skip tokens until the next token is a closing parenthesis.
5736 If we find the closing `)', and the next token is a `{', then
5737 we are looking at a compound-literal. */
5738 bool compound_literal_p
5743 /* Roll back the tokens we skipped. */
5747 }
5749 /* Parse a postfix-expression.
5751 postfix-expression:
5752 primary-expression
5753 postfix-expression [ expression ]
5754 postfix-expression ( expression-list [opt] )
5755 simple-type-specifier ( expression-list [opt] )
5756 typename :: [opt] nested-name-specifier identifier
5757 ( expression-list [opt] )
5758 typename :: [opt] nested-name-specifier template [opt] template-id
5759 ( expression-list [opt] )
5760 postfix-expression . template [opt] id-expression
5761 postfix-expression -> template [opt] id-expression
5762 postfix-expression . pseudo-destructor-name
5763 postfix-expression -> pseudo-destructor-name
5764 postfix-expression ++
5765 postfix-expression --
5766 dynamic_cast < type-id > ( expression )
5767 static_cast < type-id > ( expression )
5768 reinterpret_cast < type-id > ( expression )
5769 const_cast < type-id > ( expression )
5770 typeid ( expression )
5771 typeid ( type-id )
5773 GNU Extension:
5775 postfix-expression:
5776 ( type-id ) { initializer-list , [opt] }
5778 This extension is a GNU version of the C99 compound-literal
5779 construct. (The C99 grammar uses `type-name' instead of `type-id',
5780 but they are essentially the same concept.)
5782 If ADDRESS_P is true, the postfix expression is the operand of the
5783 `&' operator. CAST_P is true if this expression is the target of a
5784 cast.
5786 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5787 class member access expressions [expr.ref].
5789 Returns a representation of the expression. */
5791 static tree
5795 {
5797 location_t loc;
5804 /* Peek at the next token. */
5807 /* Some of the productions are determined by keywords. */
5810 {
5815 {
5816 tree type;
5817 tree expression;
5821 /* All of these can be handled in the same way from the point
5822 of view of parsing. Begin by consuming the token
5823 identifying the cast. */
5826 /* New types cannot be defined in the cast. */
5828 parser->type_definition_forbidden_message
5831 /* Look for the opening `<'. */
5833 /* Parse the type to which we are casting. */
5838 /* Look for the closing `>'. */
5840 /* Restore the old message. */
5843 bool saved_greater_than_is_operator_p
5847 /* And the expression which is being cast. */
5852 parser->greater_than_is_operator_p
5855 /* Only type conversions to integral or enumeration types
5856 can be used in constant-expressions. */
5862 {
5864 postfix_expression
5868 postfix_expression
5872 postfix_expression
5874 tf_warning_or_error);
5877 postfix_expression
5882 }
5883 }
5887 {
5888 tree type;
5892 /* Consume the `typeid' token. */
5894 /* Look for the `(' token. */
5896 /* Types cannot be defined in a `typeid' expression. */
5898 parser->type_definition_forbidden_message
5900 /* We can't be sure yet whether we're looking at a type-id or an
5901 expression. */
5903 /* Try a type-id first. */
5908 /* Look for the `)' token. Otherwise, we can't be sure that
5909 we're not looking at an expression: consider `typeid (int
5910 (3))', for example. */
5912 /* If all went well, simply lookup the type-id. */
5915 /* Otherwise, fall back to the expression variant. */
5916 else
5917 {
5918 tree expression;
5920 /* Look for an expression. */
5922 /* Compute its typeid. */
5924 /* Look for the `)' token. */
5926 }
5927 /* Restore the saved message. */
5929 /* `typeid' may not appear in an integral constant expression. */
5932 }
5936 {
5937 tree type;
5938 /* The syntax permitted here is the same permitted for an
5939 elaborated-type-specifier. */
5944 }
5948 {
5952 {
5957 }
5959 {
5964 }
5965 else
5966 {
5967 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5970 }
5972 postfix_expression =
5976 {
5980 }
5982 {
5987 }
5988 else
5989 {
5991 postfix_expression);
5995 }
5997 }
6000 {
6003 tree p;
6017 tf_warning_or_error);
6020 tf_warning_or_error);
6021 else
6022 {
6026 }
6028 }
6031 {
6032 tree type;
6034 /* If the next thing is a simple-type-specifier, we may be
6035 looking at a functional cast. We could also be looking at
6036 an id-expression. So, we try the functional cast, and if
6037 that doesn't work we fall back to the primary-expression. */
6039 /* Look for the simple-type-specifier. */
6042 CP_PARSER_FLAGS_NONE);
6043 /* Parse the cast itself. */
6045 postfix_expression
6047 /* If that worked, we're done. */
6051 /* If the functional-cast didn't work out, try a
6052 compound-literal. */
6055 {
6060 /* Avoid calling cp_parser_type_id pointlessly, see comment
6061 in cp_parser_cast_expression about c++/29234. */
6064 else
6065 {
6066 /* Parse the type. */
6071 /* Look for the `)'. */
6073 }
6075 /* If things aren't going well, there's no need to
6076 keep going. */
6078 {
6080 /* Parse the brace-enclosed initializer list. */
6083 }
6084 /* If that worked, we're definitely looking at a
6085 compound-literal expression. */
6087 {
6088 /* Warn the user that a compound literal is not
6089 allowed in standard C++. */
6092 /* For simplicity, we disallow compound literals in
6093 constant-expressions. We could
6094 allow compound literals of integer type, whose
6095 initializer was a constant, in constant
6096 expressions. Permitting that usage, as a further
6097 extension, would not change the meaning of any
6098 currently accepted programs. (Of course, as
6099 compound literals are not part of ISO C++, the
6100 standard has nothing to say.) */
6102 NIC_NCC))
6103 {
6106 }
6107 /* Form the representation of the compound-literal. */
6108 postfix_expression
6110 tf_warning_or_error);
6112 }
6113 }
6115 /* It must be a primary-expression. */
6116 postfix_expression
6119 decltype_p,
6121 }
6123 }
6125 /* Note that we don't need to worry about calling build_cplus_new on a
6126 class-valued CALL_EXPR in decltype when it isn't the end of the
6127 postfix-expression; unary_complex_lvalue will take care of that for
6128 all these cases. */
6130 /* Keep looping until the postfix-expression is complete. */
6132 {
6136 /* It is not a Koenig lookup function call. */
6137 postfix_expression
6140 /* Peek at the next token. */
6144 {
6147 {
6149 "two consecutive %<[%> shall "
6152 }
6153 postfix_expression
6155 postfix_expression,
6157 decltype_p);
6163 /* postfix-expression ( expression-list [opt] ) */
6164 {
6174 is_builtin_constant_p
6177 {
6178 /* The whole point of __builtin_constant_p is to allow
6179 non-constant expressions to appear as arguments. */
6180 saved_integral_constant_expression_p
6182 saved_non_integral_constant_expression_p
6185 }
6186 args = (cp_parser_parenthesized_expression_list
6192 {
6193 parser->integral_constant_expression_p
6195 parser->non_integral_constant_expression_p
6197 }
6200 {
6203 }
6205 /* Function calls are not permitted in
6206 constant-expressions. */
6209 NIC_FUNC_CALL))
6210 {
6214 }
6219 {
6221 {
6223 {
6226 postfix_expression
6228 complain);
6229 }
6230 else
6231 postfix_expression
6233 }
6234 /* We do not perform argument-dependent lookup if
6235 normal lookup finds a non-function, in accordance
6236 with the expected resolution of DR 218. */
6239 {
6243 /* Do not do argument dependent lookup if regular
6244 lookup finds a member function or a block-scope
6245 function declaration. [basic.lookup.argdep]/3 */
6248 {
6251 postfix_expression
6253 complain);
6254 }
6255 }
6256 }
6259 {
6269 "%<memset%> used with constant zero length "
6270 "parameter; this could be due to transposed "
6273 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6274 to avoid leaking those into folder and middle-end. */
6276 tree arg;
6280 }
6283 {
6293 {
6294 postfix_expression
6298 }
6301 {
6302 postfix_expression
6303 = (build_new_method_call
6309 complain));
6310 }
6311 else
6312 postfix_expression
6316 complain);
6317 }
6321 postfix_expression = (build_offset_ref_call_from_tree
6323 complain));
6325 /* A call to a static class member, or a namespace-scope
6326 function. */
6327 postfix_expression
6330 koenig_p,
6331 complain);
6332 else
6333 /* All other function calls. */
6334 postfix_expression
6337 koenig_p,
6338 complain);
6342 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6346 }
6351 /* postfix-expression . template [opt] id-expression
6352 postfix-expression . pseudo-destructor-name
6353 postfix-expression -> template [opt] id-expression
6354 postfix-expression -> pseudo-destructor-name */
6356 /* Consume the `.' or `->' operator. */
6359 postfix_expression
6361 postfix_expression,
6368 /* postfix-expression ++ */
6369 /* Consume the `++' token. */
6371 /* Generate a representation for the complete expression. */
6372 postfix_expression
6374 POSTINCREMENT_EXPR);
6375 /* Increments may not appear in constant-expressions. */
6383 /* postfix-expression -- */
6384 /* Consume the `--' token. */
6386 /* Generate a representation for the complete expression. */
6387 postfix_expression
6389 POSTDECREMENT_EXPR);
6390 /* Decrements may not appear in constant-expressions. */
6402 else
6404 }
6405 }
6407 /* We should never get here. */
6410 }
6412 /* This function parses Cilk Plus array notations. If a normal array expr. is
6413 parsed then the array index is passed back to the caller through *INIT_INDEX
6414 and the function returns a NULL_TREE. If array notation expr. is parsed,
6415 then *INIT_INDEX is ignored by the caller and the function returns
6416 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6417 error_mark_node. */
6419 static tree
6421 tree array_value)
6422 {
6426 {
6429 }
6438 {
6441 }
6443 {
6444 /* Consume the ':'. */
6447 /* If we are here, then we have a case like this A[:]. */
6449 {
6453 }
6457 }
6458 else
6459 {
6460 /* If we are here, then there are three valid possibilities:
6461 1. ARRAY [ EXP ]
6462 2. ARRAY [ EXP : EXP ]
6463 3. ARRAY [ EXP : EXP : EXP ] */
6467 {
6468 /* This indicates that we have a normal array expression. */
6471 }
6473 /* Consume the ':'. */
6477 {
6480 }
6481 }
6486 {
6490 }
6496 }
6498 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6499 by cp_parser_builtin_offsetof. We're looking for
6501 postfix-expression [ expression ]
6502 postfix-expression [ braced-init-list ] (C++11)
6504 FOR_OFFSETOF is set if we're being called in that context, which
6505 changes how we deal with integer constant expressions. */
6507 static tree
6509 tree postfix_expression,
6512 {
6517 /* Consume the `[' token. */
6523 /* Parse the index expression. */
6524 /* ??? For offsetof, there is a question of what to allow here. If
6525 offsetof is not being used in an integral constant expression context,
6526 then we *could* get the right answer by computing the value at runtime.
6527 If we are in an integral constant expression context, then we might
6528 could accept any constant expression; hard to say without analysis.
6529 Rather than open the barn door too wide right away, allow only integer
6530 constant expressions here. */
6533 else
6534 {
6536 {
6543 {
6545 "braced list index is not allowed with array "
6549 }
6550 }
6552 {
6553 /* Here are have these two options:
6554 ARRAY[EXP : EXP] - Array notation expr with default
6555 stride of 1.
6556 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6557 stride. */
6559 postfix_expression);
6562 }
6563 else
6565 }
6569 /* Look for the closing `]'. */
6572 /* Build the ARRAY_REF. */
6576 /* When not doing offsetof, array references are not permitted in
6577 constant-expressions. */
6583 }
6585 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6586 by cp_parser_builtin_offsetof. We're looking for
6588 postfix-expression . template [opt] id-expression
6589 postfix-expression . pseudo-destructor-name
6590 postfix-expression -> template [opt] id-expression
6591 postfix-expression -> pseudo-destructor-name
6593 FOR_OFFSETOF is set if we're being called in that context. That sorta
6594 limits what of the above we'll actually accept, but nevermind.
6595 TOKEN_TYPE is the "." or "->" token, which will already have been
6596 removed from the stream. */
6598 static tree
6601 tree postfix_expression,
6603 location_t location)
6604 {
6605 tree name;
6610 /* If this is a `->' operator, dereference the pointer. */
6613 tf_warning_or_error);
6614 /* Check to see whether or not the expression is type-dependent. */
6616 /* The identifier following the `->' or `.' is not qualified. */
6622 /* Enter the scope corresponding to the type of the object
6623 given by the POSTFIX_EXPRESSION. */
6625 {
6627 /* According to the standard, no expression should ever have
6628 reference type. Unfortunately, we do not currently match
6629 the standard in this respect in that our internal representation
6630 of an expression may have reference type even when the standard
6631 says it does not. Therefore, we have to manually obtain the
6632 underlying type here. */
6634 /* The type of the POSTFIX_EXPRESSION must be complete. */
6636 {
6638 postfix_expression);
6640 }
6641 /* Unlike the object expression in other contexts, *this is not
6642 required to be of complete type for purposes of class member
6643 access (5.2.5) outside the member function body. */
6647 /* Let the name lookup machinery know that we are processing a
6648 class member access expression. */
6650 /* If something went wrong, we want to be able to discern that case,
6651 as opposed to the case where there was no SCOPE due to the type
6652 of expression being dependent. */
6655 /* If the SCOPE was erroneous, make the various semantic analysis
6656 functions exit quickly -- and without issuing additional error
6657 messages. */
6660 }
6662 /* Assume this expression is not a pseudo-destructor access. */
6665 /* If the SCOPE is a scalar type, then, if this is a valid program,
6666 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6667 is type dependent, it can be pseudo-destructor-name or something else.
6668 Try to parse it as pseudo-destructor-name first. */
6670 {
6671 tree s;
6672 tree type;
6675 /* Parse the pseudo-destructor-name. */
6684 {
6686 postfix_expression
6689 }
6690 }
6693 {
6694 /* If the SCOPE is not a scalar type, we are looking at an
6695 ordinary class member access expression, rather than a
6696 pseudo-destructor-name. */
6699 /* Parse the id-expression. */
6700 name = (cp_parser_id_expression
6707 /* In general, build a SCOPE_REF if the member name is qualified.
6708 However, if the name was not dependent and has already been
6709 resolved; there is no need to build the SCOPE_REF. For example;
6711 struct X { void f(); };
6712 template <typename T> void f(T* t) { t->X::f(); }
6714 Even though "t" is dependent, "X::f" is not and has been resolved
6715 to a BASELINK; there is no need to include scope information. */
6717 /* But we do need to remember that there was an explicit scope for
6718 virtual function calls. */
6722 /* If the name is a template-id that names a type, we will get a
6723 TYPE_DECL here. That is invalid code. */
6725 {
6728 }
6729 else
6730 {
6732 {
6734 {
6738 }
6739 else
6742 name,
6743 template_p);
6747 }
6749 adjust_result_of_qualified_name_lookup
6751 postfix_expression
6753 template_p,
6754 tf_warning_or_error);
6755 }
6756 }
6758 /* We no longer need to look up names in the scope of the object on
6759 the left-hand side of the `.' or `->' operator. */
6762 /* Outside of offsetof, these operators may not appear in
6763 constant-expressions. */
6765 && (cp_parser_non_integral_constant_expression
6770 }
6772 /* Cache of LITERAL_ZERO_P constants. */
6776 /* Parse a parenthesized expression-list.
6778 expression-list:
6779 assignment-expression
6780 expression-list, assignment-expression
6782 attribute-list:
6783 expression-list
6784 identifier
6785 identifier, expression-list
6787 CAST_P is true if this expression is the target of a cast.
6789 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6790 argument pack.
6792 Returns a vector of trees. Each element is a representation of an
6793 assignment-expression. NULL is returned if the ( and or ) are
6794 missing. An empty, but allocated, vector is returned on no
6795 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6796 if we are parsing an attribute list for an attribute that wants a
6797 plain identifier argument, normal_attr for an attribute that wants
6798 an expression, or non_attr if we aren't parsing an attribute list. If
6799 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6800 not all of the expressions in the list were constant.
6801 WANT_LITERAL_ZERO_P is true if the caller is interested in
6802 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6803 immediately, this can be removed. */
6812 {
6818 /* Assume all the expressions will be constant. */
6827 /* Within a parenthesized expression, a `>' token is always
6828 the greater-than operator. */
6829 saved_greater_than_is_operator_p
6833 /* Consume expressions until there are no more. */
6836 {
6837 tree expr;
6839 /* At the beginning of attribute lists, check to see if the
6840 next token is an identifier. */
6843 {
6846 /* Consume the identifier. */
6848 /* Save the identifier. */
6850 }
6851 else
6852 {
6855 /* Parse the next assignment-expression. */
6857 {
6858 /* A braced-init-list. */
6864 }
6866 {
6867 expr = (cp_parser_constant_expression
6872 }
6873 else
6874 {
6878 {
6884 /* If a parameter is literal zero alone, remember it
6885 for -Wmemset-transposed-args warning. */
6888 && want_literal_zero_p
6890 == CPP_COMMA
6893 {
6900 else
6901 {
6906 }
6907 /* Consume the 0 token (or '\0', 0LL etc.). */
6909 }
6913 }
6916 cast_p);
6917 }
6922 /* If we have an ellipsis, then this is an expression
6923 expansion. */
6926 {
6927 /* Consume the `...'. */
6930 /* Build the argument pack. */
6932 }
6934 /* Add it to the list. We add error_mark_node
6935 expressions to the list, so that we can still tell if
6936 the correct form for a parenthesized expression-list
6937 is found. That gives better errors. */
6942 }
6944 /* After the first item, attribute lists look the same as
6945 expression lists. */
6948 get_comma:;
6949 /* If the next token isn't a `,', then we are done. */
6953 /* Otherwise, consume the `,' and keep going. */
6955 }
6958 {
6961 skip_comma:;
6962 /* We try and resync to an unnested comma, as that will give the
6963 user better diagnostics. */
6971 {
6972 parser->greater_than_is_operator_p
6975 }
6976 }
6978 parser->greater_than_is_operator_p
6985 }
6987 /* Parse a pseudo-destructor-name.
6989 pseudo-destructor-name:
6990 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6991 :: [opt] nested-name-specifier template template-id :: ~ type-name
6992 :: [opt] nested-name-specifier [opt] ~ type-name
6994 If either of the first two productions is used, sets *SCOPE to the
6995 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6996 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6997 or ERROR_MARK_NODE if the parse fails. */
6999 static void
7001 tree object,
7004 {
7007 /* Handle ~auto. */
7011 {
7014 "%<~auto%> only available with "
7021 }
7023 /* Assume that things will not work out. */
7026 /* Look for the optional `::' operator. */
7028 /* Look for the optional nested-name-specifier. */
7029 nested_name_specifier_p
7036 /* Now, if we saw a nested-name-specifier, we might be doing the
7037 second production. */
7040 {
7041 /* Consume the `template' keyword. */
7043 /* Parse the template-id. */
7047 class_type,
7049 /* Look for the `::' token. */
7051 }
7052 /* If the next token is not a `~', then there might be some
7053 additional qualification. */
7055 {
7056 /* At this point, we're looking for "type-name :: ~". The type-name
7057 must not be a class-name, since this is a pseudo-destructor. So,
7058 it must be either an enum-name, or a typedef-name -- both of which
7059 are just identifiers. So, we peek ahead to check that the "::"
7060 and "~" tokens are present; if they are not, then we can avoid
7061 calling type_name. */
7065 {
7068 }
7070 /* Look for the type-name. */
7075 /* Look for the `::' token. */
7077 }
7078 else
7081 /* Look for the `~'. */
7084 /* Once we see the ~, this has to be a pseudo-destructor. */
7088 /* Look for the type-name again. We are not responsible for
7089 checking that it matches the first type-name. */
7091 }
7093 /* Parse a unary-expression.
7095 unary-expression:
7096 postfix-expression
7097 ++ cast-expression
7098 -- cast-expression
7099 unary-operator cast-expression
7100 sizeof unary-expression
7101 sizeof ( type-id )
7102 alignof ( type-id ) [C++0x]
7103 new-expression
7104 delete-expression
7106 GNU Extensions:
7108 unary-expression:
7109 __extension__ cast-expression
7110 __alignof__ unary-expression
7111 __alignof__ ( type-id )
7112 alignof unary-expression [C++0x]
7113 __real__ cast-expression
7114 __imag__ cast-expression
7115 && identifier
7116 sizeof ( type-id ) { initializer-list , [opt] }
7117 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7118 __alignof__ ( type-id ) { initializer-list , [opt] }
7120 ADDRESS_P is true iff the unary-expression is appearing as the
7121 operand of the `&' operator. CAST_P is true if this expression is
7122 the target of a cast.
7124 Returns a representation of the expression. */
7126 static tree
7129 {
7133 /* Peek at the next token. */
7135 /* Some keywords give away the kind of expression. */
7137 {
7141 {
7144 {
7147 location_t first_loc;
7150 /* Consume the token. */
7153 /* Parse the operand. */
7158 else
7159 {
7160 /* ISO C++ defines alignof only with types, not with
7161 expressions. So pedwarn if alignof is used with a non-
7162 type expression. However, __alignof__ is ok. */
7165 "ISO C++ does not allow %<alignof%> "
7169 }
7170 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7171 SIZEOF_EXPR with the original operand. */
7173 {
7175 {
7177 {
7180 error_mark_node));
7182 }
7183 else
7187 }
7189 }
7191 }
7200 {
7201 /* The saved value of the PEDANTIC flag. */
7203 tree expr;
7205 /* Save away the PEDANTIC flag. */
7207 /* Parse the cast-expression. */
7209 /* Restore the PEDANTIC flag. */
7213 }
7217 {
7218 tree expression;
7220 /* Consume the `__real__' or `__imag__' token. */
7222 /* Parse the cast-expression. */
7224 /* Create the complete representation. */
7228 expression,
7229 tf_warning_or_error);
7230 }
7238 {
7239 tree expr;
7249 parser->type_definition_forbidden_message
7252 saved_integral_constant_expression_p
7254 saved_non_integral_constant_expression_p
7258 saved_greater_than_is_operator_p
7270 parser->greater_than_is_operator_p
7273 parser->integral_constant_expression_p
7275 parser->non_integral_constant_expression_p
7282 }
7286 }
7287 }
7289 /* Look for the `:: new' and `:: delete', which also signal the
7290 beginning of a new-expression, or delete-expression,
7291 respectively. If the next token is `::', then it might be one of
7292 these. */
7294 {
7297 /* See if the token after the `::' is one of the keywords in
7298 which we're interested. */
7300 /* If it's `new', we have a new-expression. */
7303 /* Similarly, for `delete'. */
7306 }
7308 /* Look for a unary operator. */
7310 /* The `++' and `--' operators can be handled similarly, even though
7311 they are not technically unary-operators in the grammar. */
7313 {
7318 /* Handle the GNU address-of-label extension. */
7321 {
7322 tree identifier;
7323 tree expression;
7326 /* Consume the '&&' token. */
7328 /* Look for the identifier. */
7330 /* Create an expression representing the address. */
7333 NIC_ADDR_LABEL))
7336 }
7337 }
7339 {
7340 tree cast_expression;
7346 /* Consume the operator token. */
7348 /* Parse the cast-expression. */
7349 cast_expression
7354 pidk);
7355 /* Now, build an appropriate representation. */
7357 {
7361 RO_UNARY_STAR,
7362 complain);
7367 /* Fall through. */
7370 cast_expression,
7371 complain);
7378 /* Fall through. */
7388 }
7392 non_constant_p))
7396 }
7400 decltype_p,
7401 pidk);
7402 }
7404 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7405 unary-operator, the corresponding tree code is returned. */
7407 static enum tree_code
7409 {
7411 {
7432 }
7433 }
7435 /* Parse a new-expression.
7437 new-expression:
7438 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7439 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7441 Returns a representation of the expression. */
7443 static tree
7445 {
7448 tree type;
7451 tree ret;
7453 /* Look for the optional `::' operator. */
7454 global_scope_p
7458 /* Look for the `new' operator. */
7460 /* There's no easy way to tell a new-placement from the
7461 `( type-id )' construct. */
7463 /* Look for a new-placement. */
7465 /* If that didn't work out, there's no new-placement. */
7467 {
7471 }
7473 /* If the next token is a `(', then we have a parenthesized
7474 type-id. */
7476 {
7480 /* Consume the `('. */
7483 /* Parse the type-id. */
7484 parser->type_definition_forbidden_message
7489 /* Look for the closing `)'. */
7492 /* There should not be a direct-new-declarator in this production,
7493 but GCC used to allowed this, so we check and emit a sensible error
7494 message for this case. */
7496 {
7502 }
7503 }
7504 /* Otherwise, there must be a new-type-id. */
7505 else
7508 /* If the next token is a `(' or '{', then we have a new-initializer. */
7512 else
7515 /* A new-expression may not appear in an integral constant
7516 expression. */
7519 else
7520 {
7521 /* Create a representation of the new-expression. */
7523 tf_warning_or_error);
7524 }
7532 }
7534 /* Parse a new-placement.
7536 new-placement:
7537 ( expression-list )
7539 Returns the same representation as for an expression-list. */
7543 {
7546 /* Parse the expression-list. */
7547 expression_list = (cp_parser_parenthesized_expression_list
7553 }
7555 /* Parse a new-type-id.
7557 new-type-id:
7558 type-specifier-seq new-declarator [opt]
7560 Returns the TYPE allocated. If the new-type-id indicates an array
7561 type, *NELTS is set to the number of elements in the last array
7562 bound; the TYPE will not include the last array bound. */
7564 static tree
7566 {
7567 cp_decl_specifier_seq type_specifier_seq;
7573 /* The type-specifier sequence must not contain type definitions.
7574 (It cannot contain declarations of new types either, but if they
7575 are not definitions we will catch that because they are not
7576 complete.) */
7578 parser->type_definition_forbidden_message
7580 /* Parse the type-specifier-seq. */
7584 /* Restore the old message. */
7590 /* Parse the new-declarator. */
7593 /* Determine the number of elements in the last array dimension, if
7594 any. */
7596 /* Skip down to the last array dimension. */
7601 {
7604 }
7609 {
7612 }
7615 {
7622 else
7624 }
7627 }
7629 /* Parse an (optional) new-declarator.
7631 new-declarator:
7632 ptr-operator new-declarator [opt]
7633 direct-new-declarator
7635 Returns the declarator. */
7639 {
7642 cp_cv_quals cv_quals;
7644 /* We don't know if there's a ptr-operator next, or not. */
7646 /* Look for a ptr-operator. */
7648 /* If that worked, look for more new-declarators. */
7650 {
7653 /* Parse another optional declarator. */
7656 declarator = cp_parser_make_indirect_declarator
7660 }
7662 /* If the next token is a `[', there is a direct-new-declarator. */
7667 }
7669 /* Parse a direct-new-declarator.
7671 direct-new-declarator:
7672 [ expression ]
7673 direct-new-declarator [constant-expression]
7675 */
7679 {
7683 {
7684 tree expression;
7687 /* Look for the opening `['. */
7692 /* The standard requires that the expression have integral
7693 type. DR 74 adds enumeration types. We believe that the
7694 real intent is that these expressions be handled like the
7695 expression in a `switch' condition, which also allows
7696 classes with a single conversion to integral or
7697 enumeration type. */
7699 {
7700 expression
7702 expression,
7705 {
7707 "expression in new-declarator must have integral "
7710 }
7711 }
7713 /* Look for the closing `]'. */
7716 /* Add this bound to the declarator. */
7719 /* If the next token is not a `[', then there are no more
7720 bounds. */
7723 }
7726 }
7728 /* Parse a new-initializer.
7730 new-initializer:
7731 ( expression-list [opt] )
7732 braced-init-list
7734 Returns a representation of the expression-list. */
7738 {
7742 {
7743 tree t;
7750 }
7751 else
7752 expression_list = (cp_parser_parenthesized_expression_list
7758 }
7760 /* Parse a delete-expression.
7762 delete-expression:
7763 :: [opt] delete cast-expression
7764 :: [opt] delete [ ] cast-expression
7766 Returns a representation of the expression. */
7768 static tree
7770 {
7773 tree expression;
7775 /* Look for the optional `::' operator. */
7776 global_scope_p
7780 /* Look for the `delete' keyword. */
7782 /* See if the array syntax is in use. */
7784 {
7785 /* Consume the `[' token. */
7787 /* Look for the `]' token. */
7789 /* Remember that this is the `[]' construct. */
7791 }
7792 else
7795 /* Parse the cast-expression. */
7798 /* A delete-expression may not appear in an integral constant
7799 expression. */
7804 tf_warning_or_error);
7805 }
7807 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7808 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7809 0 otherwise. */
7811 static int
7813 {
7816 {
7858 /* In ((type ()) () the last () isn't a valid cast-expression,
7859 so the whole must be parsed as postfix-expression. */
7864 /* '[' may start a primary-expression in obj-c++ and in C++11,
7865 as a lambda-expression, eg, '(void)[]{}'. */
7872 /* '++' and '--' may or may not start a cast-expression:
7874 struct T { void operator++(int); };
7875 void f() { (T())++; }
7877 vs
7879 int a;
7880 (int)++a; */
7885 }
7886 }
7888 /* Parse a cast-expression.
7890 cast-expression:
7891 unary-expression
7892 ( type-id ) cast-expression
7894 ADDRESS_P is true iff the unary-expression is appearing as the
7895 operand of the `&' operator. CAST_P is true if this expression is
7896 the target of a cast.
7898 Returns a representation of the expression. */
7900 static tree
7903 {
7904 /* If it's a `(', then we might be looking at a cast. */
7906 {
7912 /* There's no way to know yet whether or not this is a cast.
7913 For example, `(int (3))' is a unary-expression, while `(int)
7914 3' is a cast. So, we resort to parsing tentatively. */
7916 /* Types may not be defined in a cast. */
7918 parser->type_definition_forbidden_message
7920 /* Consume the `('. */
7922 /* A very tricky bit is that `(struct S) { 3 }' is a
7923 compound-literal (which we permit in C++ as an extension).
7924 But, that construct is not a cast-expression -- it is a
7925 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7926 is legal; if the compound-literal were a cast-expression,
7927 you'd need an extra set of parentheses.) But, if we parse
7928 the type-id, and it happens to be a class-specifier, then we
7929 will commit to the parse at that point, because we cannot
7930 undo the action that is done when creating a new class. So,
7931 then we cannot back up and do a postfix-expression.
7933 Another tricky case is the following (c++/29234):
7935 struct S { void operator () (); };
7937 void foo ()
7938 {
7939 ( S()() );
7940 }
7942 As a type-id we parse the parenthesized S()() as a function
7943 returning a function, groktypename complains and we cannot
7944 back up in this case either.
7946 Therefore, we scan ahead to the closing `)', and check to see
7947 if the tokens after the `)' can start a cast-expression. Otherwise
7948 we are dealing with an unary-expression, a postfix-expression
7949 or something else.
7951 Yet another tricky case, in C++11, is the following (c++/54891):
7953 (void)[]{};
7955 The issue is that usually, besides the case of lambda-expressions,
7956 the parenthesized type-id cannot be followed by '[', and, eg, we
7957 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7958 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7959 we don't commit, we try a cast-expression, then an unary-expression.
7961 Save tokens so that we can put them back. */
7964 /* We may be looking at a cast-expression. */
7967 cast_expression
7970 /* Roll back the tokens we skipped. */
7972 /* If we aren't looking at a cast-expression, simulate an error so
7973 that the call to cp_parser_error_occurred below returns true. */
7976 else
7977 {
7980 /* Look for the type-id. */
7982 /* Look for the closing `)'. */
7985 }
7987 /* Restore the saved message. */
7990 /* At this point this can only be either a cast or a
7991 parenthesized ctor such as `(T ())' that looks like a cast to
7992 function returning T. */
7994 {
7995 /* Only commit if the cast-expression doesn't start with
7996 '++', '--', or '[' in C++11. */
8004 pidk);
8007 {
8008 /* Warn about old-style casts, if so requested. */
8015 /* Only type conversions to integral or enumeration types
8016 can be used in constant-expressions. */
8019 NIC_CAST))
8022 /* Perform the cast. */
8025 }
8026 }
8027 else
8029 }
8031 /* If we get here, then it's not a cast, so it must be a
8032 unary-expression. */
8035 }
8037 /* Parse a binary expression of the general form:
8039 pm-expression:
8040 cast-expression
8041 pm-expression .* cast-expression
8042 pm-expression ->* cast-expression
8044 multiplicative-expression:
8045 pm-expression
8046 multiplicative-expression * pm-expression
8047 multiplicative-expression / pm-expression
8048 multiplicative-expression % pm-expression
8050 additive-expression:
8051 multiplicative-expression
8052 additive-expression + multiplicative-expression
8053 additive-expression - multiplicative-expression
8055 shift-expression:
8056 additive-expression
8057 shift-expression << additive-expression
8058 shift-expression >> additive-expression
8060 relational-expression:
8061 shift-expression
8062 relational-expression < shift-expression
8063 relational-expression > shift-expression
8064 relational-expression <= shift-expression
8065 relational-expression >= shift-expression
8067 GNU Extension:
8069 relational-expression:
8070 relational-expression <? shift-expression
8071 relational-expression >? shift-expression
8073 equality-expression:
8074 relational-expression
8075 equality-expression == relational-expression
8076 equality-expression != relational-expression
8078 and-expression:
8079 equality-expression
8080 and-expression & equality-expression
8082 exclusive-or-expression:
8083 and-expression
8084 exclusive-or-expression ^ and-expression
8086 inclusive-or-expression:
8087 exclusive-or-expression
8088 inclusive-or-expression | exclusive-or-expression
8090 logical-and-expression:
8091 inclusive-or-expression
8092 logical-and-expression && inclusive-or-expression
8094 logical-or-expression:
8095 logical-and-expression
8096 logical-or-expression || logical-and-expression
8098 All these are implemented with a single function like:
8100 binary-expression:
8101 simple-cast-expression
8102 binary-expression <token> binary-expression
8104 CAST_P is true if this expression is the target of a cast.
8106 The binops_by_token map is used to get the tree codes for each <token> type.
8107 binary-expressions are associated according to a precedence table. */
8109 #define TOKEN_PRECEDENCE(token) \
8110 (((token->type == CPP_GREATER \
8111 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8112 && !parser->greater_than_is_operator_p) \
8113 ? PREC_NOT_OPERATOR \
8114 : binops_by_token[token->type].prec)
8116 static tree
8122 {
8123 cp_parser_expression_stack stack;
8125 cp_parser_expression_stack_entry current;
8126 tree rhs;
8130 tree overload;
8132 /* Parse the first expression. */
8143 {
8144 /* Get an operator token. */
8150 {
8152 "%<>>%> operator is treated"
8156 }
8160 /* Popping an entry off the stack means we completed a subexpression:
8161 - either we found a token which is not an operator (`>' where it is not
8162 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8163 will happen repeatedly;
8164 - or, we found an operator which has lower priority. This is the case
8165 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8166 parsing `3 * 4'. */
8168 {
8171 else
8173 }
8175 get_rhs:
8179 /* We used the operator token. */
8182 /* For "false && x" or "true || x", x will never be executed;
8183 disable warnings while evaluating it. */
8189 /* Extract another operand. It may be the RHS of this expression
8190 or the LHS of a new, higher priority expression. */
8195 /* Get another operator token. Look up its precedence to avoid
8196 building a useless (immediately popped) stack entry for common
8197 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8201 {
8202 /* ... and prepare to parse the RHS of the new, higher priority
8203 expression. Since precedence levels on the stack are
8204 monotonically increasing, we do not have to care about
8205 stack overflows. */
8214 pop:
8216 /* If the stack is not empty, we have parsed into LHS the right side
8217 (`4' in the example above) of an expression we had suspended.
8218 We can use the information on the stack to recover the LHS (`3')
8219 from the stack together with the tree code (`MULT_EXPR'), and
8220 the precedence of the higher level subexpression
8221 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8222 which will be used to actually build the additive expression. */
8227 }
8229 /* Undo the disabling of warnings done above. */
8240 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8241 ERROR_MARK for everything that is not a binary expression.
8242 This makes warn_about_parentheses miss some warnings that
8243 involve unary operators. For unary expressions we should
8244 pass the correct tree_code unless the unary expression was
8245 surrounded by parentheses.
8246 */
8252 == tcc_comparison
8255 else
8264 /* If the binary operator required the use of an overloaded operator,
8265 then this expression cannot be an integral constant-expression.
8266 An overloaded operator can be used even if both operands are
8267 otherwise permissible in an integral constant-expression if at
8268 least one of the operands is of enumeration type. */
8272 NIC_OVERLOADED))
8274 }
8277 }
8279 static tree
8284 {
8287 }
8289 /* Parse the `? expression : assignment-expression' part of a
8290 conditional-expression. The LOGICAL_OR_EXPR is the
8291 logical-or-expression that started the conditional-expression.
8292 Returns a representation of the entire conditional-expression.
8294 This routine is used by cp_parser_assignment_expression.
8296 ? expression : assignment-expression
8298 GNU Extensions:
8300 ? : assignment-expression */
8302 static tree
8304 {
8305 tree expr;
8306 tree assignment_expr;
8310 /* Consume the `?' token. */
8315 {
8318 /* Implicit true clause. */
8322 }
8323 else
8324 {
8327 /* Parse the expression. */
8330 c_inhibit_evaluation_warnings +=
8334 }
8336 /* The next token should be a `:'. */
8338 /* Parse the assignment-expression. */
8342 /* Build the conditional-expression. */
8344 expr,
8345 assignment_expr,
8346 tf_warning_or_error);
8347 }
8349 /* Parse an assignment-expression.
8351 assignment-expression:
8352 conditional-expression
8353 logical-or-expression assignment-operator assignment_expression
8354 throw-expression
8356 CAST_P is true if this expression is the target of a cast.
8357 DECLTYPE_P is true if this expression is the operand of decltype.
8359 Returns a representation for the expression. */
8361 static tree
8364 {
8365 tree expr;
8367 /* If the next token is the `throw' keyword, then we're looking at
8368 a throw-expression. */
8371 /* Otherwise, it must be that we are looking at a
8372 logical-or-expression. */
8373 else
8374 {
8375 /* Parse the binary expressions (logical-or-expression). */
8377 decltype_p,
8379 /* If the next token is a `?' then we're actually looking at a
8380 conditional-expression. */
8383 else
8384 {
8387 /* If it's an assignment-operator, we're using the second
8388 production. */
8389 enum tree_code assignment_operator
8392 {
8394 location_t saved_input_location;
8396 /* Parse the right-hand side of the assignment. */
8402 /* An assignment may not appear in a
8403 constant-expression. */
8405 NIC_ASSIGNMENT))
8407 /* Build the assignment expression. Its default
8408 location is the location of the '=' token. */
8412 assignment_operator,
8413 rhs,
8416 }
8417 }
8418 }
8421 }
8423 /* Parse an (optional) assignment-operator.
8425 assignment-operator: one of
8426 = *= /= %= += -= >>= <<= &= ^= |=
8428 GNU Extension:
8430 assignment-operator: one of
8431 <?= >?=
8433 If the next token is an assignment operator, the corresponding tree
8434 code is returned, and the token is consumed. For example, for
8435 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8436 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8437 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8438 operator, ERROR_MARK is returned. */
8440 static enum tree_code
8442 {
8446 /* Peek at the next token. */
8450 {
8496 /* Nothing else is an assignment operator. */
8498 }
8500 /* If it was an assignment operator, consume it. */
8505 }
8507 /* Parse an expression.
8509 expression:
8510 assignment-expression
8511 expression , assignment-expression
8513 CAST_P is true if this expression is the target of a cast.
8514 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8515 except possibly parenthesized or on the RHS of a comma (N3276).
8517 Returns a representation of the expression. */
8519 static tree
8522 {
8527 {
8528 tree assignment_expression;
8530 /* Parse the next assignment-expression. */
8531 assignment_expression
8534 /* We don't create a temporary for a call that is the immediate operand
8535 of decltype or on the RHS of a comma. But when we see a comma, we
8536 need to create a temporary for a call on the LHS. */
8541 assignment_expression
8545 /* If this is the first assignment-expression, we can just
8546 save it away. */
8549 else
8551 assignment_expression,
8553 /* If the next token is not a comma, then we are done with the
8554 expression. */
8557 /* Consume the `,'. */
8560 /* A comma operator cannot appear in a constant-expression. */
8563 }
8566 }
8568 /* Parse a constant-expression.
8570 constant-expression:
8571 conditional-expression
8573 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8574 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8575 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8576 is false, NON_CONSTANT_P should be NULL. */
8578 static tree
8582 {
8586 tree expression;
8588 /* It might seem that we could simply parse the
8589 conditional-expression, and then check to see if it were
8590 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8591 one that the compiler can figure out is constant, possibly after
8592 doing some simplifications or optimizations. The standard has a
8593 precise definition of constant-expression, and we must honor
8594 that, even though it is somewhat more restrictive.
8596 For example:
8598 int i[(2, 3)];
8600 is not a legal declaration, because `(2, 3)' is not a
8601 constant-expression. The `,' operator is forbidden in a
8602 constant-expression. However, GCC's constant-folding machinery
8603 will fold this operation to an INTEGER_CST for `3'. */
8605 /* Save the old settings. */
8607 saved_allow_non_integral_constant_expression_p
8610 /* We are now parsing a constant-expression. */
8612 parser->allow_non_integral_constant_expression_p
8615 /* Although the grammar says "conditional-expression", we parse an
8616 "assignment-expression", which also permits "throw-expression"
8617 and the use of assignment operators. In the case that
8618 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8619 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8620 actually essential that we look for an assignment-expression.
8621 For example, cp_parser_initializer_clauses uses this function to
8622 determine whether a particular assignment-expression is in fact
8623 constant. */
8625 /* Restore the old settings. */
8626 parser->integral_constant_expression_p
8628 parser->allow_non_integral_constant_expression_p
8631 {
8632 /* Require an rvalue constant expression here; that's what our
8633 callers expect. Reference constant expressions are handled
8634 separately in e.g. cp_parser_template_argument. */
8639 }
8642 parser->non_integral_constant_expression_p
8646 }
8648 /* Parse __builtin_offsetof.
8650 offsetof-expression:
8651 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8653 offsetof-member-designator:
8654 id-expression
8655 | offsetof-member-designator "." id-expression
8656 | offsetof-member-designator "[" expression "]"
8657 | offsetof-member-designator "->" id-expression */
8659 static tree
8661 {
8664 cp_id_kind dummy;
8667 /* We're about to accept non-integral-constant things, but will
8668 definitely yield an integral constant expression. Save and
8669 restore these values around our local parsing. */
8673 /* Consume the "__builtin_offsetof" token. */
8675 /* Consume the opening `('. */
8677 /* Parse the type-id. */
8680 /* Look for the `,'. */
8684 /* Build the (type *)null that begins the traditional offsetof macro. */
8686 tf_warning_or_error);
8688 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8692 {
8695 {
8697 /* offsetof-member-designator "[" expression "]" */
8703 /* offsetof-member-designator "->" identifier */
8706 /* FALLTHRU */
8709 /* offsetof-member-designator "." identifier */
8717 /* Consume the ")" token. */
8722 /* Error. We know the following require will fail, but
8723 that gives the proper error message. */
8728 }
8729 }
8731 success:
8734 failure:
8739 }
8741 /* Parse a trait expression.
8743 Returns a representation of the expression, the underlying type
8744 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8746 static tree
8748 {
8749 cp_trait_kind kind;
8755 {
8839 }
8841 /* Consume the token. */
8852 {
8859 }
8861 {
8863 {
8867 {
8870 }
8874 }
8875 }
8879 /* Complete the trait expression, which may mean either processing
8880 the trait expr now or saving it for template instantiation. */
8882 {
8891 }
8892 }
8894 /* Lambdas that appear in variable initializer or default argument scope
8895 get that in their mangling, so we need to record it. We might as well
8896 use the count for function and namespace scopes as well. */
8900 {
8901 tree t;
8906 static void
8908 {
8909 tree_int ti;
8911 /* Once we're inside a function, we ignore other scopes and just push
8912 the function again so that popping works properly. */
8919 {
8920 /* Don't reset the count if we're still in the same function. */
8923 }
8924 }
8926 static void
8928 {
8931 }
8933 static void
8935 {
8938 {
8941 }
8943 }
8945 /* Parse a lambda expression.
8947 lambda-expression:
8948 lambda-introducer lambda-declarator [opt] compound-statement
8950 Returns a representation of the expression. */
8952 static tree
8954 {
8956 tree type;
8964 {
8966 {
8970 }
8972 }
8974 {
8976 {
8979 }
8981 }
8983 /* We may be in the middle of deferred access check. Disable
8984 it now. */
8995 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8998 /* Now that we've started the type, add the capture fields for any
8999 explicit captures. */
9002 {
9003 /* Inside the class, surrounding template-parameter-lists do not apply. */
9004 unsigned int saved_num_template_parameter_lists
9008 bool fully_implicit_function_template_p
9012 bool auto_is_implicit_function_template_parm_p
9023 /* By virtue of defining a local class, a lambda expression has access to
9024 the private variables of enclosing classes. */
9029 {
9035 }
9037 {
9040 }
9042 /* The capture list was built up in reverse order; fix that now. */
9054 parser->fully_implicit_function_template_p
9058 parser->auto_is_implicit_function_template_parm_p
9060 }
9064 /* This field is only used during parsing of the lambda. */
9067 /* This lambda shouldn't have any proxies left at this point. */
9069 /* And now that we're done, push proxies for an enclosing lambda. */
9074 else
9080 }
9082 /* Parse the beginning of a lambda expression.
9084 lambda-introducer:
9085 [ lambda-capture [opt] ]
9087 LAMBDA_EXPR is the current representation of the lambda expression. */
9089 static void
9091 {
9092 /* Need commas after the first capture. */
9095 /* Eat the leading `['. */
9098 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9106 {
9109 }
9112 {
9114 tree capture_id;
9115 tree capture_init_expr;
9119 enum capture_kind_type
9120 {
9121 BY_COPY,
9122 BY_REFERENCE
9123 };
9127 {
9130 }
9134 else
9137 /* Possibly capture `this'. */
9139 {
9149 explicit_init_p);
9151 }
9153 /* Remember whether we want to capture as a reference or not. */
9155 {
9158 }
9160 /* Get the identifier. */
9165 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9166 delimiters, but I modified this to stop on unnested ']' as well. It
9167 was already changed to stop on unnested '}', so the
9168 "closing_parenthesis" name is no more misleading with my change. */
9169 {
9175 }
9177 /* Find the initializer for this capture. */
9181 {
9183 /* An explicit initializer exists. */
9186 "lambda capture initializers "
9192 {
9195 }
9196 }
9197 else
9198 {
9201 /* Turn the identifier into an id-expression. */
9202 capture_init_expr
9207 {
9210 }
9214 {
9217 capture_init_expr);
9220 }
9223 {
9226 capture_init_expr))
9229 }
9231 capture_init_expr
9232 = finish_id_expression
9234 capture_init_expr,
9248 {
9251 }
9252 else
9254 }
9258 {
9263 capture_id);
9267 "capture of %qD redundant with by-reference capture "
9269 }
9272 capture_id,
9273 capture_init_expr,
9275 explicit_init_p);
9276 }
9279 }
9281 /* Parse the (optional) middle of a lambda expression.
9283 lambda-declarator:
9284 < template-parameter-list [opt] >
9285 ( parameter-declaration-clause [opt] )
9286 attribute-specifier [opt]
9287 mutable [opt]
9288 exception-specification [opt]
9289 lambda-return-type-clause [opt]
9291 LAMBDA_EXPR is the current representation of the lambda expression. */
9293 static bool
9295 {
9296 /* 5.1.1.4 of the standard says:
9297 If a lambda-expression does not include a lambda-declarator, it is as if
9298 the lambda-declarator were ().
9299 This means an empty parameter list, no attributes, and no exception
9300 specification. */
9306 /* The template-parameter-list is optional, but must begin with
9307 an opening angle if present. */
9309 {
9312 "lambda templates are only available with "
9321 /* We just processed one more parameter list. */
9323 }
9325 /* The parameter-declaration-clause is optional (unless
9326 template-parameter-list was given), but must begin with an
9327 opening parenthesis if present. */
9329 {
9334 /* Parse parameters. */
9337 /* Default arguments shall not be specified in the
9338 parameter-declaration-clause of a lambda-declarator. */
9348 /* Parse optional `mutable' keyword. */
9350 {
9353 }
9355 /* Parse optional exception specification. */
9358 /* Parse optional trailing return type. */
9360 {
9364 }
9366 /* The function parameters must be in scope all the way until after the
9367 trailing-return-type in case of decltype. */
9369 }
9373 /* Create the function call operator.
9375 Messing with declarators like this is no uglier than building up the
9376 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9377 other code. */
9378 {
9379 cp_decl_specifier_seq return_type_specs;
9381 tree fco;
9388 else
9389 /* Maybe we will deduce the return type later. */
9395 sfk_none);
9400 VIRT_SPEC_UNSPECIFIED,
9401 REF_QUAL_NONE,
9402 exception_spec,
9407 declarator,
9408 attributes);
9410 {
9413 /* Give the object parameter a different name. */
9417 }
9419 {
9423 }
9432 }
9433 }
9435 /* Parse the body of a lambda expression, which is simply
9437 compound-statement
9439 but which requires special handling.
9440 LAMBDA_EXPR is the current representation of the lambda expression. */
9442 static void
9444 {
9449 else
9450 /* Still increment function_depth so that we don't GC in the
9451 middle of an expression. */
9453 /* Clear this in case we're in the middle of a default argument. */
9456 /* Finish the function call operator
9457 - class_specifier
9458 + late_parsing_for_member
9459 + function_definition_after_declarator
9460 + ctor_initializer_opt_and_function_body */
9461 {
9463 tree body;
9465 tree compound_stmt;
9466 tree cap;
9468 /* Let the front end know that we are going to be defining this
9469 function. */
9471 NULL_TREE,
9480 /* Push the proxies for any explicit captures. */
9487 /* 5.1.1.4 of the standard says:
9488 If a lambda-expression does not include a trailing-return-type, it
9489 is as if the trailing-return-type denotes the following type:
9490 * if the compound-statement is of the form
9491 { return attribute-specifier [opt] expression ; }
9492 the type of the returned expression after lvalue-to-rvalue
9493 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9494 (_conv.array_ 4.2), and function-to-pointer conversion
9495 (_conv.func_ 4.3);
9496 * otherwise, void. */
9498 /* In a lambda that has neither a lambda-return-type-clause
9499 nor a deducible form, errors should be reported for return statements
9500 in the body. Since we used void as the placeholder return type, parsing
9501 the body as usual will give such desired behavior. */
9505 {
9509 /* Parse tentatively in case there's more after the initial return
9510 statement. */
9521 {
9525 /* Will get error here if type not deduced yet. */
9529 }
9530 }
9533 {
9538 }
9542 out:
9546 /* Finish the function and generate code for it if necessary. */
9549 /* Only expand if the call op is not a template. */
9552 }
9557 else
9559 }
9561 /* Statements [gram.stmt.stmt] */
9563 /* Parse a statement.
9565 statement:
9566 labeled-statement
9567 expression-statement
9568 compound-statement
9569 selection-statement
9570 iteration-statement
9571 jump-statement
9572 declaration-statement
9573 try-block
9575 C++11:
9577 statement:
9578 labeled-statement
9579 attribute-specifier-seq (opt) expression-statement
9580 attribute-specifier-seq (opt) compound-statement
9581 attribute-specifier-seq (opt) selection-statement
9582 attribute-specifier-seq (opt) iteration-statement
9583 attribute-specifier-seq (opt) jump-statement
9584 declaration-statement
9585 attribute-specifier-seq (opt) try-block
9587 TM Extension:
9589 statement:
9590 atomic-statement
9592 IN_COMPOUND is true when the statement is nested inside a
9593 cp_parser_compound_statement; this matters for certain pragmas.
9595 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9596 is a (possibly labeled) if statement which is not enclosed in braces
9597 and has an else clause. This is used to implement -Wparentheses. */
9599 static void
9602 {
9607 restart:
9610 /* There is no statement yet. */
9616 /* In obj-c++, seeing '[[' might be the either the beginning of
9617 c++11 attributes, or a nested objc-message-expression. So
9618 let's parse the c++11 attributes tentatively. */
9622 {
9625 }
9627 /* Peek at the next token. */
9629 /* Remember the location of the first token in the statement. */
9631 /* If this is a keyword, then that will often determine what kind of
9632 statement we have. */
9634 {
9638 {
9641 /* Looks like a labeled-statement with a case label.
9642 Parse the label, and then use tail recursion to parse
9643 the statement. */
9660 {
9665 }
9666 else
9680 {
9685 }
9686 else
9687 {
9691 }
9695 /* Objective-C++ exception-handling constructs. */
9709 /* This must be a namespace alias definition. */
9722 /* It might be a keyword like `int' that can start a
9723 declaration-statement. */
9725 }
9726 }
9728 {
9729 /* If the next token is a `:', then we are looking at a
9730 labeled-statement. */
9733 {
9734 /* Looks like a labeled-statement with an ordinary label.
9735 Parse the label, and then use tail recursion to parse
9736 the statement. */
9740 }
9741 }
9742 /* Anything that starts with a `{' must be a compound-statement. */
9745 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9746 a statement all its own. */
9748 {
9749 /* Only certain OpenMP pragmas are attached to statements, and thus
9750 are considered statements themselves. All others are not. In
9751 the context of a compound, accept the pragma as a "statement" and
9752 return so that we can check for a close brace. Otherwise we
9753 require a real statement and must go back and read one. */
9759 }
9761 {
9764 }
9766 /* Everything else must be a declaration-statement or an
9767 expression-statement. Try for the declaration-statement
9768 first, unless we are looking at a `;', in which case we know that
9769 we have an expression-statement. */
9771 {
9773 {
9775 {
9776 /* Attributes should be parsed as part of the the
9777 declaration, so let's un-parse them. */
9780 }
9783 /* Try to parse the declaration-statement. */
9785 /* If that worked, we're done. */
9788 }
9789 /* Look for an expression-statement instead. */
9791 }
9793 /* Set the line number for the statement. */
9797 /* Note that for now, we don't do anything with c++11 statements
9798 parsed at this level. */
9801 OPT_Wattributes,
9803 }
9805 /* Parse the label for a labeled-statement, i.e.
9807 identifier :
9808 case constant-expression :
9809 default :
9811 GNU Extension:
9812 case constant-expression ... constant-expression : statement
9814 When a label is parsed without errors, the label is added to the
9815 parse tree by the finish_* functions, so this function doesn't
9816 have to return the label. */
9818 static void
9820 {
9825 /* The next token should be an identifier. */
9829 {
9832 }
9836 {
9838 {
9842 /* Consume the `case' token. */
9844 /* Parse the constant-expression. */
9851 {
9852 /* Consume the `...' token. */
9858 /* We don't need to emit warnings here, as the common code
9859 will do this for us. */
9860 }
9861 else
9866 else
9869 expr);
9870 }
9874 /* Consume the `default' token. */
9879 else
9884 /* Anything else must be an ordinary label. */
9887 }
9889 /* Require the `:' token. */
9892 /* An ordinary label may optionally be followed by attributes.
9893 However, this is only permitted if the attributes are then
9894 followed by a semicolon. This is because, for backward
9895 compatibility, when parsing
9896 lab: __attribute__ ((unused)) int i;
9897 we want the attribute to attach to "i", not "lab". */
9900 {
9901 tree attrs;
9908 ;
9909 else
9911 }
9917 }
9919 /* Parse an expression-statement.
9921 expression-statement:
9922 expression [opt] ;
9924 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9925 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9926 indicates whether this expression-statement is part of an
9927 expression statement. */
9929 static tree
9931 {
9935 /* If the next token is a ';', then there is no expression
9936 statement. */
9938 {
9942 {
9945 }
9946 }
9948 /* Give a helpful message for "A<T>::type t;" and the like. */
9951 {
9958 {
9959 /* A::A a; */
9964 }
9965 }
9967 /* Consume the final `;'. */
9972 /* This is the final expression statement of a statement
9973 expression. */
9979 }
9981 /* Parse a compound-statement.
9983 compound-statement:
9984 { statement-seq [opt] }
9986 GNU extension:
9988 compound-statement:
9989 { label-declaration-seq [opt] statement-seq [opt] }
9991 label-declaration-seq:
9992 label-declaration
9993 label-declaration-seq label-declaration
9995 Returns a tree representing the statement. */
9997 static tree
10000 {
10001 tree compound_stmt;
10003 /* Consume the `{'. */
10010 /* Begin the compound-statement. */
10012 /* If the next keyword is `__label__' we have a label declaration. */
10015 /* Parse an (optional) statement-seq. */
10017 /* Finish the compound-statement. */
10019 /* Consume the `}'. */
10023 }
10025 /* Parse an (optional) statement-seq.
10027 statement-seq:
10028 statement
10029 statement-seq [opt] statement */
10031 static void
10033 {
10034 /* Scan statements until there aren't any more. */
10036 {
10039 /* If we are looking at a `}', then we have run out of
10040 statements; the same is true if we have reached the end
10041 of file, or have stumbled upon a stray '@end'. */
10048 /* If we are in a compound statement and find 'else' then
10049 something went wrong. */
10051 {
10054 else
10055 {
10058 }
10059 }
10061 /* Parse the statement. */
10063 }
10064 }
10066 /* Parse a selection-statement.
10068 selection-statement:
10069 if ( condition ) statement
10070 if ( condition ) statement else statement
10071 switch ( condition ) statement
10073 Returns the new IF_STMT or SWITCH_STMT.
10075 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10076 is a (possibly labeled) if statement which is not enclosed in
10077 braces and has an else clause. This is used to implement
10078 -Wparentheses. */
10080 static tree
10082 {
10089 /* Peek at the next token. */
10092 /* See what kind of keyword it is. */
10095 {
10098 {
10099 tree statement;
10100 tree condition;
10102 /* Look for the `('. */
10104 {
10107 }
10109 /* Begin the selection-statement. */
10112 else
10115 /* Parse the condition. */
10117 /* Look for the `)'. */
10123 {
10127 /* Add the condition. */
10130 /* Parse the then-clause. */
10134 {
10142 }
10143 else
10149 /* If the next token is `else', parse the else-clause. */
10151 RID_ELSE))
10152 {
10153 /* Consume the `else' keyword. */
10156 /* Parse the else-clause. */
10158 {
10159 location_t loc;
10166 }
10167 else
10172 /* If we are currently parsing a then-clause, then
10173 IF_P will not be NULL. We set it to true to
10174 indicate that this if statement has an else clause.
10175 This may trigger the Wparentheses warning below
10176 when we get back up to the parent if statement. */
10179 }
10180 else
10181 {
10182 /* This if statement does not have an else clause. If
10183 NESTED_IF is true, then the then-clause is an if
10184 statement which does have an else clause. We warn
10185 about the potential ambiguity. */
10188 "suggest explicit braces to avoid ambiguous"
10190 }
10192 /* Now we're all done with the if-statement. */
10194 }
10195 else
10196 {
10200 /* Add the condition. */
10203 /* Parse the body of the switch-statement. */
10212 /* Now we're all done with the switch-statement. */
10214 }
10217 }
10223 }
10224 }
10226 /* Parse a condition.
10228 condition:
10229 expression
10230 type-specifier-seq declarator = initializer-clause
10231 type-specifier-seq declarator braced-init-list
10233 GNU Extension:
10235 condition:
10236 type-specifier-seq declarator asm-specification [opt]
10237 attributes [opt] = assignment-expression
10239 Returns the expression that should be tested. */
10241 static tree
10243 {
10244 cp_decl_specifier_seq type_specifiers;
10248 /* Try the declaration first. */
10250 /* New types are not allowed in the type-specifier-seq for a
10251 condition. */
10253 parser->type_definition_forbidden_message
10255 /* Parse the type-specifier-seq. */
10257 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10260 /* Restore the saved message. */
10262 /* If all is well, we might be looking at a declaration. */
10264 {
10265 tree decl;
10266 tree asm_specification;
10267 tree attributes;
10271 /* Parse the declarator. */
10277 /* Parse the attributes. */
10279 /* Parse the asm-specification. */
10281 /* If the next token is not an `=' or '{', then we might still be
10282 looking at an expression. For example:
10284 if (A(a).x)
10286 looks like a decl-specifier-seq and a declarator -- but then
10287 there is no `=', so this is an expression. */
10292 /* If we did see an `=' or '{', then we are looking at a declaration
10293 for sure. */
10295 {
10296 tree pushed_scope;
10300 /* Create the declaration. */
10306 /* Parse the initializer. */
10308 {
10312 }
10313 else
10314 {
10315 /* Consume the `='. */
10318 }
10322 /* Process the initializer. */
10325 asm_specification,
10326 flags);
10332 }
10333 }
10334 /* If we didn't even get past the declarator successfully, we are
10335 definitely not looking at a declaration. */
10336 else
10339 /* Otherwise, we are looking at an expression. */
10341 }
10343 /* Parses a for-statement or range-for-statement until the closing ')',
10344 not included. */
10346 static tree
10348 {
10352 /* Begin the for-statement. */
10355 /* Parse the initialization. */
10360 else
10362 }
10364 static tree
10366 {
10367 /* Normal for loop */
10370 tree stmt;
10373 /* The for-init-statement has already been parsed in
10374 cp_parser_for_init_statement, so no work is needed here. */
10377 /* If there's a condition, process it. */
10381 {
10385 }
10387 /* Look for the `;'. */
10390 /* If there's an expression, process it. */
10396 }
10398 /* Tries to parse a range-based for-statement:
10400 range-based-for:
10401 decl-specifier-seq declarator : expression
10403 The decl-specifier-seq declarator and the `:' are already parsed by
10404 cp_parser_for_init_statement. If processing_template_decl it returns a
10405 newly created RANGE_FOR_STMT; if not, it is converted to a
10406 regular FOR_STMT. */
10408 static tree
10411 {
10415 {
10418 }
10419 else
10422 /* If in template, STMT is converted to a normal for-statement
10423 at instantiation. If not, it is done just ahead. */
10425 {
10433 /* do_auto_deduction doesn't mess with template init-lists. */
10436 }
10437 else
10438 {
10441 }
10443 }
10445 /* Subroutine of cp_convert_range_for: given the initializer expression,
10446 builds up the range temporary. */
10448 static tree
10450 {
10453 /* Find out the type deduced by the declaration
10454 `auto &&__range = range_expr'. */
10459 /* Create the __range variable. */
10466 }
10468 /* Used by cp_parser_range_for in template context: we aren't going to
10469 do a full conversion yet, but we still need to resolve auto in the
10470 type of the for-range-declaration if present. This is basically
10471 a shortcut version of cp_convert_range_for. */
10473 static void
10475 {
10478 {
10481 iter_type = (cp_parser_perform_range_for_lookup
10484 {
10486 iter_type);
10488 tf_warning_or_error);
10491 }
10492 }
10493 }
10495 /* Converts a range-based for-statement into a normal
10496 for-statement, as per the definition.
10498 for (RANGE_DECL : RANGE_EXPR)
10499 BLOCK
10501 should be equivalent to:
10503 {
10504 auto &&__range = RANGE_EXPR;
10505 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10506 __begin != __end;
10507 ++__begin)
10508 {
10509 RANGE_DECL = *__begin;
10510 BLOCK
10511 }
10512 }
10514 If RANGE_EXPR is an array:
10515 BEGIN_EXPR = __range
10516 END_EXPR = __range + ARRAY_SIZE(__range)
10517 Else if RANGE_EXPR has a member 'begin' or 'end':
10518 BEGIN_EXPR = __range.begin()
10519 END_EXPR = __range.end()
10520 Else:
10521 BEGIN_EXPR = begin(__range)
10522 END_EXPR = end(__range);
10524 If __range has a member 'begin' but not 'end', or vice versa, we must
10525 still use the second alternative (it will surely fail, however).
10526 When calling begin()/end() in the third alternative we must use
10527 argument dependent lookup, but always considering 'std' as an associated
10528 namespace. */
10530 tree
10533 {
10539 /* If an error happened previously do nothing or else a lot of
10540 unhelpful errors would be issued. */
10542 else
10543 {
10544 tree range_temp;
10548 /* Can't bind a reference to an array of runtime bound. */
10550 else
10551 {
10556 LOOKUP_ONLYCONVERTING);
10558 }
10561 }
10563 /* The new for initialization statement. */
10571 LOOKUP_ONLYCONVERTING);
10580 LOOKUP_ONLYCONVERTING);
10584 /* The new for condition. */
10591 /* The new increment expression. */
10594 tf_warning_or_error);
10597 /* The declaration is initialized with *__begin inside the loop body. */
10600 tf_warning_or_error),
10602 LOOKUP_ONLYCONVERTING);
10605 }
10607 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10608 We need to solve both at the same time because the method used
10609 depends on the existence of members begin or end.
10610 Returns the type deduced for the iterator expression. */
10612 static tree
10614 {
10616 {
10619 }
10622 {
10627 }
10629 {
10630 /* If RANGE is an array, we will use pointer arithmetic. */
10633 range,
10637 }
10638 else
10639 {
10640 /* If it is not an array, we must do a bit of magic. */
10650 tf_warning_or_error);
10653 tf_warning_or_error);
10656 {
10657 /* Use the member functions. */
10660 else
10666 else
10669 }
10670 else
10671 {
10672 /* Use global functions with ADL. */
10679 tf_warning_or_error);
10681 tf_warning_or_error);
10683 tf_warning_or_error);
10685 tf_warning_or_error);
10688 }
10690 /* Last common checks. */
10692 {
10693 /* If one of the expressions is an error do no more checks. */
10696 }
10699 /* Can happen, when, eg, in a template context, Koenig lookup
10700 can't resolve begin/end (c++/58503). */
10702 else
10703 {
10705 /* The unqualified type of the __begin and __end temporaries should
10706 be the same, as required by the multiple auto declaration. */
10712 }
10713 }
10714 }
10716 /* Helper function for cp_parser_perform_range_for_lookup.
10717 Builds a tree for RANGE.IDENTIFIER(). */
10719 static tree
10721 {
10734 tf_warning_or_error);
10737 }
10739 /* Parse an iteration-statement.
10741 iteration-statement:
10742 while ( condition ) statement
10743 do statement while ( expression ) ;
10744 for ( for-init-statement condition [opt] ; expression [opt] )
10745 statement
10747 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10749 static tree
10751 {
10754 tree statement;
10757 /* Peek at the next token. */
10762 /* Remember whether or not we are already within an iteration
10763 statement. */
10766 /* See what kind of keyword it is. */
10769 {
10771 {
10772 tree condition;
10774 /* Begin the while-statement. */
10776 /* Look for the `('. */
10778 /* Parse the condition. */
10781 /* Look for the `)'. */
10783 /* Parse the dependent statement. */
10787 /* We're done with the while-statement. */
10789 }
10793 {
10794 tree expression;
10796 /* Begin the do-statement. */
10798 /* Parse the body of the do-statement. */
10803 /* Look for the `while' keyword. */
10805 /* Look for the `('. */
10807 /* Parse the expression. */
10809 /* We're done with the do-statement. */
10811 /* Look for the `)'. */
10813 /* Look for the `;'. */
10815 }
10819 {
10820 /* Look for the `('. */
10825 /* Look for the `)'. */
10828 /* Parse the body of the for-statement. */
10833 /* We're done with the for-statement. */
10835 }
10842 }
10845 }
10847 /* Parse a for-init-statement or the declarator of a range-based-for.
10848 Returns true if a range-based-for declaration is seen.
10850 for-init-statement:
10851 expression-statement
10852 simple-declaration */
10854 static bool
10856 {
10857 /* If the next token is a `;', then we have an empty
10858 expression-statement. Grammatically, this is also a
10859 simple-declaration, but an invalid one, because it does not
10860 declare anything. Therefore, if we did not handle this case
10861 specially, we would issue an error message about an invalid
10862 declaration. */
10864 {
10870 {
10871 /* N3994 -- for (id : init) ... */
10874 "type-specifier only available with "
10882 }
10884 /* A colon is used in range-based for. */
10887 /* We're going to speculatively look for a declaration, falling back
10888 to an expression, if necessary. */
10890 /* Parse the declaration. */
10893 decl);
10896 {
10897 /* It is a range-for, consume the ':' */
10901 {
10903 "range-based %<for%> loops only available with "
10906 }
10907 }
10908 else
10909 /* The ';' is not consumed yet because we told
10910 cp_parser_simple_declaration not to. */
10915 /* If the tentative parse failed, then we shall need to look for an
10916 expression-statement. */
10917 }
10918 /* If we are here, it is an expression-statement. */
10921 }
10923 /* Parse a jump-statement.
10925 jump-statement:
10926 break ;
10927 continue ;
10928 return expression [opt] ;
10929 return braced-init-list ;
10930 goto identifier ;
10932 GNU extension:
10934 jump-statement:
10935 goto * expression ;
10937 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10939 static tree
10941 {
10947 /* Peek at the next token. */
10952 /* See what kind of keyword it is. */
10955 {
10959 {
10979 }
10985 {
10992 /* Fall through. */
11002 }
11007 {
11008 tree expr;
11012 {
11016 }
11019 else
11020 /* If the next token is a `;', then there is no
11021 expression. */
11023 /* Build the return-statement. */
11025 /* Look for the final `;'. */
11027 }
11033 {
11036 }
11038 /* Create the goto-statement. */
11040 {
11041 /* Issue a warning about this use of a GNU extension. */
11043 /* Consume the '*' token. */
11045 /* Parse the dependent expression. */
11047 }
11048 else
11050 /* Look for the final `;'. */
11057 }
11060 }
11062 /* Parse a declaration-statement.
11064 declaration-statement:
11065 block-declaration */
11067 static void
11069 {
11072 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11075 /* Parse the block-declaration. */
11078 /* Free any declarators allocated. */
11080 }
11082 /* Some dependent statements (like `if (cond) statement'), are
11083 implicitly in their own scope. In other words, if the statement is
11084 a single statement (as opposed to a compound-statement), it is
11085 none-the-less treated as if it were enclosed in braces. Any
11086 declarations appearing in the dependent statement are out of scope
11087 after control passes that point. This function parses a statement,
11088 but ensures that is in its own scope, even if it is not a
11089 compound-statement.
11091 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11092 is a (possibly labeled) if statement which is not enclosed in
11093 braces and has an else clause. This is used to implement
11094 -Wparentheses.
11096 Returns the new statement. */
11098 static tree
11100 {
11101 tree statement;
11106 /* Mark if () ; with a special NOP_EXPR. */
11108 {
11112 }
11113 /* if a compound is opened, we simply parse the statement directly. */
11116 /* If the token is not a `{', then we must take special action. */
11117 else
11118 {
11119 /* Create a compound-statement. */
11121 /* Parse the dependent-statement. */
11123 /* Finish the dummy compound-statement. */
11125 }
11127 /* Return the statement. */
11129 }
11131 /* For some dependent statements (like `while (cond) statement'), we
11132 have already created a scope. Therefore, even if the dependent
11133 statement is a compound-statement, we do not want to create another
11134 scope. */
11136 static void
11138 {
11139 /* If the token is a `{', then we must take special action. */
11142 else
11143 {
11144 /* Avoid calling cp_parser_compound_statement, so that we
11145 don't create a new scope. Do everything else by hand. */
11147 /* If the next keyword is `__label__' we have a label declaration. */
11150 /* Parse an (optional) statement-seq. */
11153 }
11154 }
11156 /* Declarations [gram.dcl.dcl] */
11158 /* Parse an optional declaration-sequence.
11160 declaration-seq:
11161 declaration
11162 declaration-seq declaration */
11164 static void
11166 {
11168 {
11179 {
11180 /* A declaration consisting of a single semicolon is
11181 invalid. Allow it unless we're being pedantic. */
11186 }
11188 /* If we're entering or exiting a region that's implicitly
11189 extern "C", modify the lang context appropriately. */
11191 {
11194 }
11196 {
11199 }
11202 {
11203 /* A top-level declaration can consist solely of a #pragma.
11204 A nested declaration cannot, so this is done here and not
11205 in cp_parser_declaration. (A #pragma at block scope is
11206 handled in cp_parser_statement.) */
11209 }
11211 /* Parse the declaration itself. */
11213 }
11214 }
11216 /* Parse a declaration.
11218 declaration:
11219 block-declaration
11220 function-definition
11221 template-declaration
11222 explicit-instantiation
11223 explicit-specialization
11224 linkage-specification
11225 namespace-definition
11227 GNU extension:
11229 declaration:
11230 __extension__ declaration */
11232 static void
11234 {
11235 cp_token token1;
11236 cp_token token2;
11241 /* Check for the `__extension__' keyword. */
11243 {
11244 /* Parse the qualified declaration. */
11246 /* Restore the PEDANTIC flag. */
11250 }
11252 /* Try to figure out what kind of declaration is present. */
11257 else
11258 {
11261 }
11263 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11266 /* If the next token is `extern' and the following token is a string
11267 literal, then we have a linkage specification. */
11271 /* If the next token is `template', then we have either a template
11272 declaration, an explicit instantiation, or an explicit
11273 specialization. */
11275 {
11276 /* `template <>' indicates a template specialization. */
11280 /* `template <' indicates a template declaration. */
11283 /* Anything else must be an explicit instantiation. */
11284 else
11286 }
11287 /* If the next token is `export', then we have a template
11288 declaration. */
11291 /* If the next token is `extern', 'static' or 'inline' and the one
11292 after that is `template', we have a GNU extended explicit
11293 instantiation directive. */
11300 /* If the next token is `namespace', check for a named or unnamed
11301 namespace definition. */
11307 /* An unnamed namespace definition. */
11311 /* An inline (associated) namespace definition. */
11315 /* Objective-C++ declaration/definition. */
11322 /* We must have either a block declaration or a function
11323 definition. */
11324 else
11325 /* Try to parse a block-declaration, or a function-definition. */
11328 /* Free any declarators allocated. */
11330 }
11332 /* Parse a block-declaration.
11334 block-declaration:
11335 simple-declaration
11336 asm-definition
11337 namespace-alias-definition
11338 using-declaration
11339 using-directive
11341 GNU Extension:
11343 block-declaration:
11344 __extension__ block-declaration
11346 C++0x Extension:
11348 block-declaration:
11349 static_assert-declaration
11351 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11352 part of a declaration-statement. */
11354 static void
11357 {
11361 /* Check for the `__extension__' keyword. */
11363 {
11364 /* Parse the qualified declaration. */
11366 /* Restore the PEDANTIC flag. */
11370 }
11372 /* Peek at the next token to figure out which kind of declaration is
11373 present. */
11376 /* If the next keyword is `asm', we have an asm-definition. */
11378 {
11382 }
11383 /* If the next keyword is `namespace', we have a
11384 namespace-alias-definition. */
11387 /* If the next keyword is `using', we have a
11388 using-declaration, a using-directive, or an alias-declaration. */
11390 {
11395 /* If the token after `using' is `namespace', then we have a
11396 using-directive. */
11400 /* If the second token after 'using' is '=', then we have an
11401 alias-declaration. */
11407 /* Otherwise, it's a using-declaration. */
11408 else
11411 }
11412 /* If the next keyword is `__label__' we have a misplaced label
11413 declaration. */
11415 {
11419 /* If the next token is now a `;', consume it. */
11422 }
11423 /* If the next token is `static_assert' we have a static assertion. */
11426 /* Anything else must be a simple-declaration. */
11427 else
11430 }
11432 /* Parse a simple-declaration.
11434 simple-declaration:
11435 decl-specifier-seq [opt] init-declarator-list [opt] ;
11437 init-declarator-list:
11438 init-declarator
11439 init-declarator-list , init-declarator
11441 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11442 function-definition as a simple-declaration.
11444 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11445 parsed declaration if it is an uninitialized single declarator not followed
11446 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11447 if present, will not be consumed. */
11449 static void
11453 {
11454 cp_decl_specifier_seq decl_specifiers;
11463 /* Defer access checks until we know what is being declared; the
11464 checks for names appearing in the decl-specifier-seq should be
11465 done as if we were in the scope of the thing being declared. */
11468 /* Parse the decl-specifier-seq. We have to keep track of whether
11469 or not the decl-specifier-seq declares a named class or
11470 enumeration type, since that is the only case in which the
11471 init-declarator-list is allowed to be empty.
11473 [dcl.dcl]
11475 In a simple-declaration, the optional init-declarator-list can be
11476 omitted only when declaring a class or enumeration, that is when
11477 the decl-specifier-seq contains either a class-specifier, an
11478 elaborated-type-specifier, or an enum-specifier. */
11480 CP_PARSER_FLAGS_OPTIONAL,
11483 /* We no longer need to defer access checks. */
11486 /* In a block scope, a valid declaration must always have a
11487 decl-specifier-seq. By not trying to parse declarators, we can
11488 resolve the declaration/expression ambiguity more quickly. */
11491 {
11494 }
11496 /* If the next two tokens are both identifiers, the code is
11497 erroneous. The usual cause of this situation is code like:
11499 T t;
11501 where "T" should name a type -- but does not. */
11504 {
11505 /* If parsing tentatively, we should commit; we really are
11506 looking at a declaration. */
11508 /* Give up. */
11510 }
11512 /* If we have seen at least one decl-specifier, and the next token
11513 is not a parenthesis, then we must be looking at a declaration.
11514 (After "int (" we might be looking at a functional cast.) */
11521 /* Keep going until we hit the `;' at the end of the simple
11522 declaration. */
11525 CPP_SEMICOLON))
11526 {
11529 tree decl;
11532 {
11533 /* If we are processing next declarator, comma is expected */
11538 {
11542 }
11543 }
11544 else
11547 /* Parse the init-declarator. */
11550 function_definition_allowed_p,
11552 declares_class_or_enum,
11554 maybe_range_for_decl,
11556 /* If an error occurred while parsing tentatively, exit quickly.
11557 (That usually happens when in the body of a function; each
11558 statement is treated as a declaration-statement until proven
11559 otherwise.) */
11562 /* Handle function definitions specially. */
11564 {
11565 /* If the next token is a `,', then we are probably
11566 processing something like:
11568 void f() {}, *p;
11570 which is erroneous. */
11572 {
11575 "mixing"
11577 }
11578 /* Otherwise, we're done with the list of declarators. */
11579 else
11580 {
11583 }
11584 }
11587 /* The next token should be either a `,' or a `;'. */
11589 /* If it's a `,', there are more declarators to come. */
11592 /* If it's a `;', we are done. */
11595 /* Anything else is an error. */
11596 else
11597 {
11598 /* If we have already issued an error message we don't need
11599 to issue another one. */
11603 /* Skip tokens until we reach the end of the statement. */
11605 /* If the next token is now a `;', consume it. */
11609 }
11610 /* After the first time around, a function-definition is not
11611 allowed -- even if it was OK at first. For example:
11613 int i, f() {}
11615 is not valid. */
11617 }
11619 /* Issue an error message if no declarators are present, and the
11620 decl-specifier-seq does not itself declare a class or
11621 enumeration: [dcl.dcl]/3. */
11623 {
11625 {
11629 /* Ensure an error is issued anyway when finish_decltype_type,
11630 called via cp_parser_decl_specifier_seq, returns a class or
11631 an enumeration (c++/51786). */
11634 }
11635 /* Perform any deferred access checks. */
11637 }
11639 /* Consume the `;'. */
11643 {
11649 }
11651 done:
11653 }
11655 /* Parse a decl-specifier-seq.
11657 decl-specifier-seq:
11658 decl-specifier-seq [opt] decl-specifier
11659 decl-specifier attribute-specifier-seq [opt] (C++11)
11661 decl-specifier:
11662 storage-class-specifier
11663 type-specifier
11664 function-specifier
11665 friend
11666 typedef
11668 GNU Extension:
11670 decl-specifier:
11671 attributes
11673 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11675 The parser flags FLAGS is used to control type-specifier parsing.
11677 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11678 flags:
11680 1: one of the decl-specifiers is an elaborated-type-specifier
11681 (i.e., a type declaration)
11682 2: one of the decl-specifiers is an enum-specifier or a
11683 class-specifier (i.e., a type definition)
11685 */
11687 static void
11689 cp_parser_flags flags,
11692 {
11696 cp_decl_spec ds;
11698 /* Clear DECL_SPECS. */
11701 /* Assume no class or enumeration type is declared. */
11704 /* Keep reading specifiers until there are no more to read. */
11706 {
11711 /* Peek at the next token. */
11714 /* Save the first token of the decl spec list for error
11715 reporting. */
11718 /* Handle attributes. */
11720 {
11721 /* Parse the attributes. */
11724 /* In a sequence of declaration specifiers, c++11 attributes
11725 appertain to the type that precede them. In that case
11726 [dcl.spec]/1 says:
11728 The attribute-specifier-seq affects the type only for
11729 the declaration it appears in, not other declarations
11730 involving the same type.
11732 But for now let's force the user to position the
11733 attribute either at the beginning of the declaration or
11734 after the declarator-id, which would clearly mean that it
11735 applies to the declarator. */
11737 {
11739 /* The c++11 attribute is at the beginning of the
11740 declaration. It appertains to the entity being
11742 else
11743 {
11745 {
11746 /* This is an attribute following a
11747 class-specifier. */
11752 }
11753 else
11754 {
11755 decl_specs->std_attributes
11757 attrs);
11760 }
11762 }
11763 }
11765 decl_specs->attributes
11767 attrs);
11771 }
11772 /* Assume we will find a decl-specifier keyword. */
11774 /* If the next token is an appropriate keyword, we can simply
11775 add it to the list. */
11777 {
11778 /* decl-specifier:
11779 friend
11780 constexpr */
11783 {
11786 }
11787 else
11788 {
11790 /* Consume the token. */
11792 }
11800 /* function-specifier:
11801 inline
11802 virtual
11803 explicit */
11810 /* decl-specifier:
11811 typedef */
11814 /* Consume the token. */
11816 /* A constructor declarator cannot appear in a typedef. */
11818 /* The "typedef" keyword can only occur in a declaration; we
11819 may as well commit at this point. */
11826 /* storage-class-specifier:
11827 auto
11828 register
11829 static
11830 extern
11831 mutable
11833 GNU Extension:
11834 thread */
11837 {
11838 /* Consume the token. */
11841 /* Complain about `auto' as a storage specifier, if
11842 we're complaining about C++0x compatibility. */
11846 /* Set the storage class anyway. */
11848 token);
11849 }
11850 else
11851 /* C++0x auto type-specifier. */
11859 /* Consume the token. */
11862 token);
11865 /* Consume the token. */
11871 /* We did not yet find a decl-specifier yet. */
11874 }
11884 /* Constructors are a special case. The `S' in `S()' is not a
11885 decl-specifier; it is the beginning of the declarator. */
11886 constructor_p
11887 = (!found_decl_spec
11888 && constructor_possible_p
11889 && (cp_parser_constructor_declarator_p
11892 /* If we don't have a DECL_SPEC yet, then we must be looking at
11893 a type-specifier. */
11895 {
11898 tree type_spec;
11900 type_spec
11902 decl_specs,
11908 /* If this type-specifier referenced a user-defined type
11909 (a typedef, class-name, etc.), then we can't allow any
11910 more such type-specifiers henceforth.
11912 [dcl.spec]
11914 The longest sequence of decl-specifiers that could
11915 possibly be a type name is taken as the
11916 decl-specifier-seq of a declaration. The sequence shall
11917 be self-consistent as described below.
11919 [dcl.type]
11921 As a general rule, at most one type-specifier is allowed
11922 in the complete decl-specifier-seq of a declaration. The
11923 only exceptions are the following:
11925 -- const or volatile can be combined with any other
11926 type-specifier.
11928 -- signed or unsigned can be combined with char, long,
11929 short, or int.
11931 -- ..
11933 Example:
11935 typedef char* Pc;
11936 void g (const int Pc);
11938 Here, Pc is *not* part of the decl-specifier seq; it's
11939 the declarator. Therefore, once we see a type-specifier
11940 (other than a cv-qualifier), we forbid any additional
11941 user-defined types. We *do* still allow things like `int
11942 int' to be considered a decl-specifier-seq, and issue the
11943 error message later. */
11946 /* A constructor declarator cannot follow a type-specifier. */
11948 {
11953 }
11954 }
11956 /* If we still do not have a DECL_SPEC, then there are no more
11957 decl-specifiers. */
11962 /* After we see one decl-specifier, further decl-specifiers are
11963 always optional. */
11965 }
11967 /* Don't allow a friend specifier with a class definition. */
11972 }
11974 /* Parse an (optional) storage-class-specifier.
11976 storage-class-specifier:
11977 auto
11978 register
11979 static
11980 extern
11981 mutable
11983 GNU Extension:
11985 storage-class-specifier:
11986 thread
11988 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11990 static tree
11992 {
11994 {
11998 /* Fall through for C++98. */
12005 /* Consume the token. */
12010 }
12011 }
12013 /* Parse an (optional) function-specifier.
12015 function-specifier:
12016 inline
12017 virtual
12018 explicit
12020 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12021 Updates DECL_SPECS, if it is non-NULL. */
12023 static tree
12026 {
12029 {
12035 /* 14.5.2.3 [temp.mem]
12037 A member function template shall not be virtual. */
12040 else
12050 }
12052 /* Consume the token. */
12054 }
12056 /* Parse a linkage-specification.
12058 linkage-specification:
12059 extern string-literal { declaration-seq [opt] }
12060 extern string-literal declaration */
12062 static void
12064 {
12065 tree linkage;
12067 /* Look for the `extern' keyword. */
12070 /* Look for the string-literal. */
12073 /* Transform the literal into an identifier. If the literal is a
12074 wide-character string, or contains embedded NULs, then we can't
12075 handle it as the user wants. */
12078 {
12080 /* Assume C++ linkage. */
12082 }
12083 else
12086 /* We're now using the new linkage. */
12089 /* If the next token is a `{', then we're using the first
12090 production. */
12092 {
12095 /* Consume the `{' token. */
12097 /* Parse the declarations. */
12099 /* Look for the closing `}'. */
12101 }
12102 /* Otherwise, there's just one declaration. */
12103 else
12104 {
12107 saved_in_unbraced_linkage_specification_p
12111 parser->in_unbraced_linkage_specification_p
12113 }
12115 /* We're done with the linkage-specification. */
12117 }
12119 /* Parse a static_assert-declaration.
12121 static_assert-declaration:
12122 static_assert ( constant-expression , string-literal ) ;
12124 If MEMBER_P, this static_assert is a class member. */
12126 static void
12128 {
12129 tree condition;
12130 tree message;
12132 location_t saved_loc;
12135 /* Peek at the `static_assert' token so we can keep track of exactly
12136 where the static assertion started. */
12140 /* Look for the `static_assert' keyword. */
12142 RT_STATIC_ASSERT))
12145 /* We know we are in a static assertion; commit to any tentative
12146 parse. */
12150 /* Parse the `(' starting the static assertion condition. */
12153 /* Parse the constant-expression. Allow a non-constant expression
12154 here in order to give better diagnostics in finish_static_assert. */
12155 condition =
12160 /* Parse the separating `,'. */
12163 /* Parse the string-literal message. */
12168 /* A `)' completes the static assertion. */
12175 /* A semicolon terminates the declaration. */
12178 /* Complete the static assertion, which may mean either processing
12179 the static assert now or saving it for template instantiation. */
12181 }
12183 /* Parse the expression in decltype ( expression ). */
12185 static tree
12188 {
12190 tree expr;
12192 /* First, try parsing an id-expression. */
12203 {
12206 cp_id_kind idk;
12210 /* Lookup the name we got back from the id-expression. */
12220 {
12221 /* Complete lookup of the id-expression. */
12222 expr = (finish_id_expression
12235 /* We found an id-expression, but it was something that we
12236 should not have found. This is an error, not something
12237 we can recover from, so note that we found an
12238 id-expression and we'll recover as gracefully as
12239 possible. */
12241 }
12246 /* We have an id-expression. */
12248 }
12251 {
12252 /* Abort the id-expression parse. */
12255 /* Parsing tentatively, again. */
12258 /* Parse a class member access. */
12266 /* We have an id-expression. */
12268 }
12271 /* We have parsed the complete id-expression or member access. */
12273 else
12274 {
12275 /* Abort our attempt to parse an id-expression or member access
12276 expression. */
12279 /* Parse a full expression. */
12282 }
12285 }
12287 /* Parse a `decltype' type. Returns the type.
12289 simple-type-specifier:
12290 decltype ( expression )
12291 C++14 proposal:
12292 decltype ( auto ) */
12294 static tree
12296 {
12297 tree expr;
12306 {
12307 /* Already parsed. */
12310 }
12312 /* Look for the `decltype' token. */
12316 /* Parse the opening `('. */
12320 /* decltype (auto) */
12323 {
12330 }
12332 /* Types cannot be defined in a `decltype' expression. Save away the
12333 old message. */
12336 /* And create the new one. */
12337 parser->type_definition_forbidden_message
12340 /* The restrictions on constant-expressions do not apply inside
12341 decltype expressions. */
12342 saved_integral_constant_expression_p
12344 saved_non_integral_constant_expression_p
12348 /* Within a parenthesized expression, a `>' token is always
12349 the greater-than operator. */
12350 saved_greater_than_is_operator_p
12354 /* Do not actually evaluate the expression. */
12357 /* Do not warn about problems with the expression. */
12362 /* Go back to evaluating expressions. */
12366 /* The `>' token might be the end of a template-id or
12367 template-parameter-list now. */
12368 parser->greater_than_is_operator_p
12371 /* Restore the old message and the integral constant expression
12372 flags. */
12374 parser->integral_constant_expression_p
12376 parser->non_integral_constant_expression_p
12379 /* Parse to the closing `)'. */
12381 {
12385 }
12388 tf_warning_or_error);
12390 rewrite:
12391 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12392 it again. */
12399 }
12401 /* Special member functions [gram.special] */
12403 /* Parse a conversion-function-id.
12405 conversion-function-id:
12406 operator conversion-type-id
12408 Returns an IDENTIFIER_NODE representing the operator. */
12410 static tree
12412 {
12413 tree type;
12414 tree saved_scope;
12415 tree saved_qualifying_scope;
12416 tree saved_object_scope;
12419 /* Look for the `operator' token. */
12422 /* When we parse the conversion-type-id, the current scope will be
12423 reset. However, we need that information in able to look up the
12424 conversion function later, so we save it here. */
12428 /* We must enter the scope of the class so that the names of
12429 entities declared within the class are available in the
12430 conversion-type-id. For example, consider:
12432 struct S {
12433 typedef int I;
12434 operator I();
12435 };
12437 S::operator I() { ... }
12439 In order to see that `I' is a type-name in the definition, we
12440 must be in the scope of `S'. */
12443 /* Parse the conversion-type-id. */
12445 /* Leave the scope of the class, if any. */
12448 /* Restore the saved scope. */
12452 /* If the TYPE is invalid, indicate failure. */
12456 }
12458 /* Parse a conversion-type-id:
12460 conversion-type-id:
12461 type-specifier-seq conversion-declarator [opt]
12463 Returns the TYPE specified. */
12465 static tree
12467 {
12468 tree attributes;
12469 cp_decl_specifier_seq type_specifiers;
12471 tree type_specified;
12474 /* Parse the attributes. */
12478 parser->type_definition_forbidden_message
12481 /* Parse the type-specifiers. */
12488 /* If that didn't work, stop. */
12491 /* Parse the conversion-declarator. */
12499 /* Don't give this error when parsing tentatively. This happens to
12500 work because we always parse this definitively once. */
12503 {
12505 {
12508 }
12512 }
12515 }
12517 /* Parse an (optional) conversion-declarator.
12519 conversion-declarator:
12520 ptr-operator conversion-declarator [opt]
12522 */
12526 {
12529 cp_cv_quals cv_quals;
12531 /* We don't know if there's a ptr-operator next, or not. */
12533 /* Try the ptr-operator. */
12536 /* If it worked, look for more conversion-declarators. */
12538 {
12541 /* Parse another optional declarator. */
12544 declarator = cp_parser_make_indirect_declarator
12548 }
12551 }
12553 /* Parse an (optional) ctor-initializer.
12555 ctor-initializer:
12556 : mem-initializer-list
12558 Returns TRUE iff the ctor-initializer was actually present. */
12560 static bool
12562 {
12563 /* If the next token is not a `:', then there is no
12564 ctor-initializer. */
12566 {
12567 /* Do default initialization of any bases and members. */
12572 }
12574 /* Consume the `:' token. */
12576 /* And the mem-initializer-list. */
12580 }
12582 /* Parse a mem-initializer-list.
12584 mem-initializer-list:
12585 mem-initializer ... [opt]
12586 mem-initializer ... [opt] , mem-initializer-list */
12588 static void
12590 {
12595 /* Let the semantic analysis code know that we are starting the
12596 mem-initializer-list. */
12601 /* Loop through the list. */
12603 {
12604 tree mem_initializer;
12607 /* Parse the mem-initializer. */
12609 /* If the next token is a `...', we're expanding member initializers. */
12611 {
12612 /* Consume the `...'. */
12615 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12616 can be expanded but members cannot. */
12619 {
12624 }
12626 /* Construct the pack expansion type. */
12629 }
12632 {
12636 }
12637 /* Look for a target constructor. */
12641 {
12644 {
12648 }
12650 }
12651 /* Add it to the list, unless it was erroneous. */
12653 {
12656 }
12657 /* If the next token is not a `,', we're done. */
12660 /* Consume the `,' token. */
12662 }
12664 /* Perform semantic analysis. */
12667 }
12669 /* Parse a mem-initializer.
12671 mem-initializer:
12672 mem-initializer-id ( expression-list [opt] )
12673 mem-initializer-id braced-init-list
12675 GNU extension:
12677 mem-initializer:
12678 ( expression-list [opt] )
12680 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12681 class) or FIELD_DECL (for a non-static data member) to initialize;
12682 the TREE_VALUE is the expression-list. An empty initialization
12683 list is represented by void_list_node. */
12685 static tree
12687 {
12688 tree mem_initializer_id;
12689 tree expression_list;
12690 tree member;
12693 /* Find out what is being initialized. */
12695 {
12699 }
12700 else
12701 {
12705 }
12711 {
12718 }
12719 else
12720 {
12730 }
12740 }
12742 /* Parse a mem-initializer-id.
12744 mem-initializer-id:
12745 :: [opt] nested-name-specifier [opt] class-name
12746 identifier
12748 Returns a TYPE indicating the class to be initializer for the first
12749 production. Returns an IDENTIFIER_NODE indicating the data member
12750 to be initialized for the second production. */
12752 static tree
12754 {
12758 tree id;
12762 /* `typename' is not allowed in this context ([temp.res]). */
12764 {
12766 "keyword %<typename%> not allowed in this context (a qualified "
12769 }
12770 /* Look for the optional `::' operator. */
12771 global_scope_p
12775 /* Look for the optional nested-name-specifier. The simplest way to
12776 implement:
12778 [temp.res]
12780 The keyword `typename' is not permitted in a base-specifier or
12781 mem-initializer; in these contexts a qualified name that
12782 depends on a template-parameter is implicitly assumed to be a
12783 type name.
12785 is to assume that we have seen the `typename' keyword at this
12786 point. */
12787 nested_name_specifier_p
12796 /* If there is a `::' operator or a nested-name-specifier, then we
12797 are definitely looking for a class-name. */
12802 typename_type,
12806 /* Otherwise, we could also be looking for an ordinary identifier. */
12808 /* Try a class-name. */
12812 none_type,
12816 /* If we found one, we're done. */
12819 /* Otherwise, look for an ordinary identifier. */
12821 }
12823 /* Overloading [gram.over] */
12825 /* Parse an operator-function-id.
12827 operator-function-id:
12828 operator operator
12830 Returns an IDENTIFIER_NODE for the operator which is a
12831 human-readable spelling of the identifier, e.g., `operator +'. */
12833 static tree
12835 {
12836 /* Look for the `operator' keyword. */
12839 /* And then the name of the operator itself. */
12841 }
12843 /* Return an identifier node for a user-defined literal operator.
12844 The suffix identifier is chained to the operator name identifier. */
12846 static tree
12848 {
12849 tree identifier;
12856 }
12858 /* Parse an operator.
12860 operator:
12861 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12862 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12863 || ++ -- , ->* -> () []
12865 GNU Extensions:
12867 operator:
12868 <? >? <?= >?=
12870 Returns an IDENTIFIER_NODE for the operator which is a
12871 human-readable spelling of the identifier, e.g., `operator +'. */
12873 static tree
12875 {
12880 /* Peek at the next token. */
12882 /* Figure out which operator we have. */
12884 {
12886 {
12889 /* The keyword should be either `new' or `delete'. */
12894 else
12897 /* Consume the `new' or `delete' token. */
12900 /* Peek at the next token. */
12902 /* If it's a `[' token then this is the array variant of the
12903 operator. */
12905 {
12906 /* Consume the `[' token. */
12908 /* Look for the `]' token. */
12912 }
12913 /* Otherwise, we have the non-array variant. */
12914 else
12918 }
13065 /* Consume the `('. */
13067 /* Look for the matching `)'. */
13072 /* Consume the `['. */
13074 /* Look for the matching `]'. */
13089 {
13096 /* Consume the string. */
13102 {
13105 }
13106 else
13107 {
13109 /* Look for the suffix identifier. */
13114 {
13118 }
13119 else
13120 {
13123 }
13124 }
13129 {
13132 }
13135 {
13138 }
13140 {
13143 }
13145 }
13148 /* Anything else is an error. */
13150 }
13152 /* If we have selected an identifier, we need to consume the
13153 operator token. */
13156 /* Otherwise, no valid operator name was present. */
13157 else
13158 {
13161 }
13164 }
13166 /* Parse a template-declaration.
13168 template-declaration:
13169 export [opt] template < template-parameter-list > declaration
13171 If MEMBER_P is TRUE, this template-declaration occurs within a
13172 class-specifier.
13174 The grammar rule given by the standard isn't correct. What
13175 is really meant is:
13177 template-declaration:
13178 export [opt] template-parameter-list-seq
13179 decl-specifier-seq [opt] init-declarator [opt] ;
13180 export [opt] template-parameter-list-seq
13181 function-definition
13183 template-parameter-list-seq:
13184 template-parameter-list-seq [opt]
13185 template < template-parameter-list > */
13187 static void
13189 {
13190 /* Check for `export'. */
13192 {
13193 /* Consume the `export' token. */
13195 /* Warn that we do not support `export'. */
13197 }
13200 }
13202 /* Parse a template-parameter-list.
13204 template-parameter-list:
13205 template-parameter
13206 template-parameter-list , template-parameter
13208 Returns a TREE_LIST. Each node represents a template parameter.
13209 The nodes are connected via their TREE_CHAINs. */
13211 static tree
13213 {
13218 /* The loop below parses the template parms. We first need to know
13219 the total number of template parms to be able to compute proper
13220 canonical types of each dependent type. So after the loop, when
13221 we know the total number of template parms,
13222 end_template_parm_list computes the proper canonical types and
13223 fixes up the dependent types accordingly. */
13225 {
13226 tree parameter;
13229 location_t parm_loc;
13231 /* Parse the template-parameter. */
13236 /* Add it to the list. */
13239 parm_loc,
13240 parameter,
13241 is_non_type,
13242 is_parameter_pack);
13243 else
13244 {
13247 }
13249 /* If the next token is not a `,', we're done. */
13252 /* Otherwise, consume the `,' token. */
13254 }
13257 }
13259 /* Parse a template-parameter.
13261 template-parameter:
13262 type-parameter
13263 parameter-declaration
13265 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13266 the parameter. The TREE_PURPOSE is the default value, if any.
13267 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13268 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13269 set to true iff this parameter is a parameter pack. */
13271 static tree
13274 {
13278 tree parm;
13280 /* Assume it is a type parameter or a template parameter. */
13282 /* Assume it not a parameter pack. */
13284 /* Peek at the next token. */
13286 /* If it is `class' or `template', we have a type-parameter. */
13289 /* If it is `class' or `typename' we do not know yet whether it is a
13290 type parameter or a non-type parameter. Consider:
13292 template <typename T, typename T::X X> ...
13294 or:
13296 template <class C, class D*> ...
13298 Here, the first parameter is a type parameter, and the second is
13299 a non-type parameter. We can tell by looking at the token after
13300 the identifier -- if it is a `,', `=', or `>' then we have a type
13301 parameter. */
13303 {
13304 /* Peek at the token after `class' or `typename'. */
13306 /* If it's an ellipsis, we have a template type parameter
13307 pack. */
13310 /* If it's an identifier, skip it. */
13313 /* Now, see if the token looks like the end of a template
13314 parameter. */
13319 }
13321 /* Otherwise, it is a non-type parameter.
13323 [temp.param]
13325 When parsing a default template-argument for a non-type
13326 template-parameter, the first non-nested `>' is taken as the end
13327 of the template parameter-list rather than a greater-than
13328 operator. */
13330 parameter_declarator
13337 /* If the parameter declaration is marked as a parameter pack, set
13338 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13339 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13340 grokdeclarator. */
13343 {
13346 }
13349 {
13350 /* Can happen in some cases of erroneous input (c++/34892). */
13352 /* Consume the `...' for better error recovery. */
13354 }
13355 /* If the next token is an ellipsis, and we don't already have it
13356 marked as a parameter pack, then we have a parameter pack (that
13357 has no declarator). */
13360 && (declarator_can_be_parameter_pack
13362 {
13363 /* Consume the `...'. */
13368 }
13369 /* We might end up with a pack expansion as the type of the non-type
13370 template parameter, in which case this is a non-type template
13371 parameter pack. */
13374 {
13378 }
13381 {
13382 /* Parameter packs cannot have default arguments. However, a
13383 user may try to do so, so we'll parse them and give an
13384 appropriate diagnostic here. */
13388 /* Find the name of the parameter pack. */
13397 else
13401 /* Parse the default argument, but throw away the result. */
13403 }
13413 }
13415 /* Parse a type-parameter.
13417 type-parameter:
13418 class identifier [opt]
13419 class identifier [opt] = type-id
13420 typename identifier [opt]
13421 typename identifier [opt] = type-id
13422 template < template-parameter-list > class identifier [opt]
13423 template < template-parameter-list > class identifier [opt]
13424 = id-expression
13426 GNU Extension (variadic templates):
13428 type-parameter:
13429 class ... identifier [opt]
13430 typename ... identifier [opt]
13432 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13433 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13434 the declaration of the parameter.
13436 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13438 static tree
13440 {
13442 tree parameter;
13444 /* Look for a keyword to tell us what kind of parameter this is. */
13450 {
13453 {
13454 tree identifier;
13455 tree default_argument;
13457 /* If the next token is an ellipsis, we have a template
13458 argument pack. */
13460 {
13461 /* Consume the `...' token. */
13466 }
13468 /* If the next token is an identifier, then it names the
13469 parameter. */
13472 else
13475 /* Create the parameter. */
13478 /* If the next token is an `=', we have a default argument. */
13480 {
13481 /* Consume the `=' token. */
13483 /* Parse the default-argument. */
13487 /* Template parameter packs cannot have default
13488 arguments. */
13490 {
13493 "template parameter pack %qD cannot have a "
13495 else
13497 "template parameter packs cannot have "
13500 }
13504 }
13505 else
13508 /* Create the combined representation of the parameter and the
13509 default argument. */
13511 }
13515 {
13516 tree identifier;
13517 tree default_argument;
13519 /* Look for the `<'. */
13521 /* Parse the template-parameter-list. */
13523 /* Look for the `>'. */
13525 /* Look for the `class' or 'typename' keywords. */
13527 /* If the next token is an ellipsis, we have a template
13528 argument pack. */
13530 {
13531 /* Consume the `...' token. */
13536 }
13537 /* If the next token is an `=', then there is a
13538 default-argument. If the next token is a `>', we are at
13539 the end of the parameter-list. If the next token is a `,',
13540 then we are at the end of this parameter. */
13544 {
13546 /* Treat invalid names as if the parameter were nameless. */
13549 }
13550 else
13553 /* Create the template parameter. */
13555 identifier);
13557 /* If the next token is an `=', then there is a
13558 default-argument. */
13560 {
13563 /* Consume the `='. */
13565 /* Parse the id-expression. */
13567 /* save token before parsing the id-expression, for error
13568 reporting */
13570 default_argument
13578 /* If the id-expression was a template-id that refers to
13579 a template-class, we already have the declaration here,
13580 so no further lookup is needed. */
13581 ;
13582 else
13583 /* Look up the name. */
13584 default_argument
13586 none_type,
13592 /* See if the default argument is valid. */
13593 default_argument
13596 /* Template parameter packs cannot have default
13597 arguments. */
13599 {
13602 "template parameter pack %qD cannot "
13604 identifier);
13605 else
13609 }
13611 }
13612 else
13615 /* Create the combined representation of the parameter and the
13616 default argument. */
13618 }
13624 }
13627 }
13629 /* Parse a template-id.
13631 template-id:
13632 template-name < template-argument-list [opt] >
13634 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13635 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13636 returned. Otherwise, if the template-name names a function, or set
13637 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13638 names a class, returns a TYPE_DECL for the specialization.
13640 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13641 uninstantiated templates. */
13643 static tree
13649 {
13651 tree templ;
13652 tree arguments;
13653 tree template_id;
13660 /* If the next token corresponds to a template-id, there is no need
13661 to reparse it. */
13664 {
13667 /* Get the stored value. */
13669 /* Perform any access checks that were deferred. */
13672 {
13677 tf_warning_or_error);
13678 }
13679 /* Return the stored value. */
13681 }
13683 /* Avoid performing name lookup if there is no possibility of
13684 finding a template-id. */
13687 && !cp_parser_nth_token_starts_template_argument_list_p
13689 {
13692 }
13694 /* Remember where the template-id starts. */
13700 /* Parse the template-name. */
13703 check_dependency_p,
13704 is_declaration,
13705 tag_type,
13708 {
13711 }
13713 /* If we find the sequence `[:' after a template-name, it's probably
13714 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13715 parse correctly the argument list. */
13722 {
13724 /* Change `:' into `::'. */
13726 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13727 CPP_LESS. */
13730 /* Parse the arguments. */
13733 {
13734 /* If we couldn't parse an argument list, then we revert our changes
13735 and return simply an error. Maybe this is not a template-id
13736 after all. */
13741 }
13742 /* Otherwise, emit an error about the invalid digraph, but continue
13743 parsing because we got our argument list. */
13746 {
13749 "%<<:%> is an alternate spelling for %<[%>."
13752 {
13754 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13757 }
13758 }
13759 }
13760 else
13761 {
13762 /* Look for the `<' that starts the template-argument-list. */
13764 {
13767 }
13768 /* Parse the arguments. */
13770 }
13772 /* Build a representation of the specialization. */
13775 TEMPLATE_ID_EXPR,
13779 {
13781 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13782 template (rather than some instantiation thereof) only if
13783 is not nested within some other construct. For example, in
13784 "template <typename T> void f(T) { A<T>::", A<T> is just an
13785 instantiation of A. */
13788 CPP_SCOPE));
13789 template_id
13791 }
13793 {
13795 }
13796 else
13797 {
13798 /* If it's not a class-template or a template-template, it should be
13799 a function-template. */
13805 }
13807 /* If parsing tentatively, replace the sequence of tokens that makes
13808 up the template-id with a CPP_TEMPLATE_ID token. That way,
13809 should we re-parse the token stream, we will not have to repeat
13810 the effort required to do the parse, nor will we issue duplicate
13811 error messages about problems during instantiation of the
13812 template. */
13814 /* Don't do this if we had a parse error in a declarator; re-parsing
13815 might succeed if a name changes meaning (60361). */
13819 {
13822 /* Reset the contents of the START_OF_ID token. */
13824 /* Retrieve any deferred checks. Do not pop this access checks yet
13825 so the memory will not be reclaimed during token replacing below. */
13831 /* Purge all subsequent tokens. */
13834 /* ??? Can we actually assume that, if template_id ==
13835 error_mark_node, we will have issued a diagnostic to the
13836 user, as opposed to simply marking the tentative parse as
13837 failed? */
13840 }
13844 }
13846 /* Parse a template-name.
13848 template-name:
13849 identifier
13851 The standard should actually say:
13853 template-name:
13854 identifier
13855 operator-function-id
13857 A defect report has been filed about this issue.
13859 A conversion-function-id cannot be a template name because they cannot
13860 be part of a template-id. In fact, looking at this code:
13862 a.operator K<int>()
13864 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13865 It is impossible to call a templated conversion-function-id with an
13866 explicit argument list, since the only allowed template parameter is
13867 the type to which it is converting.
13869 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13870 `template' keyword, in a construction like:
13872 T::template f<3>()
13874 In that case `f' is taken to be a template-name, even though there
13875 is no way of knowing for sure.
13877 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13878 name refers to a set of overloaded functions, at least one of which
13879 is a template, or an IDENTIFIER_NODE with the name of the template,
13880 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13881 names are looked up inside uninstantiated templates. */
13883 static tree
13890 {
13891 tree identifier;
13892 tree decl;
13893 tree fns;
13896 /* If the next token is `operator', then we have either an
13897 operator-function-id or a conversion-function-id. */
13899 {
13900 /* We don't know whether we're looking at an
13901 operator-function-id or a conversion-function-id. */
13903 /* Try an operator-function-id. */
13905 /* If that didn't work, try a conversion-function-id. */
13907 {
13910 }
13911 }
13912 /* Look for the identifier. */
13913 else
13916 /* If we didn't find an identifier, we don't have a template-id. */
13920 /* If the name immediately followed the `template' keyword, then it
13921 is a template-name. However, if the next token is not `<', then
13922 we do not treat it as a template-name, since it is not being used
13923 as part of a template-id. This enables us to handle constructs
13924 like:
13926 template <typename T> struct S { S(); };
13927 template <typename T> S<T>::S();
13929 correctly. We would treat `S' as a template -- if it were `S<T>'
13930 -- but we do not if there is no `<'. */
13934 {
13935 /* In a declaration, in a dependent context, we pretend that the
13936 "template" keyword was present in order to improve error
13937 recovery. For example, given:
13939 template <typename T> void f(T::X<int>);
13941 we want to treat "X<int>" as a template-id. */
13943 && !template_keyword_p
13945 && check_dependency_p
13947 /* Do not do this for dtors (or ctors), since they never
13948 need the template keyword before their name. */
13950 {
13953 /* Explain what went wrong. */
13955 identifier);
13958 /* If parsing tentatively, find the location of the "<" token. */
13961 /* Parse the template arguments so that we can issue error
13962 messages about them. */
13965 /* Skip tokens until we find a good place from which to
13966 continue parsing. */
13971 /* If parsing tentatively, permanently remove the
13972 template argument list. That will prevent duplicate
13973 error messages from being issued about the missing
13974 "template" keyword. */
13980 }
13982 /* If the "template" keyword is present, then there is generally
13983 no point in doing name-lookup, so we just return IDENTIFIER.
13984 But, if the qualifying scope is non-dependent then we can
13985 (and must) do name-lookup normally. */
13991 }
13993 /* Look up the name. */
13995 tag_type,
13998 check_dependency_p,
14002 /* If DECL is a template, then the name was a template-name. */
14004 {
14008 }
14009 else
14010 {
14013 /* The standard does not explicitly indicate whether a name that
14014 names a set of overloaded declarations, some of which are
14015 templates, is a template-name. However, such a name should
14016 be a template-name; otherwise, there is no way to form a
14017 template-id for the overloaded templates. */
14025 {
14026 /* The name does not name a template. */
14029 }
14030 }
14032 /* If DECL is dependent, and refers to a function, then just return
14033 its name; we will look it up again during template instantiation. */
14035 {
14039 }
14042 }
14044 /* Parse a template-argument-list.
14046 template-argument-list:
14047 template-argument ... [opt]
14048 template-argument-list , template-argument ... [opt]
14050 Returns a TREE_VEC containing the arguments. */
14052 static tree
14054 {
14059 tree vec;
14066 /* Even if the template-id appears in an integral
14067 constant-expression, the contents of the argument list do
14068 not. */
14074 /* Parse the arguments. */
14075 do
14076 {
14077 tree argument;
14080 /* Consume the comma. */
14083 /* Parse the template-argument. */
14086 /* If the next token is an ellipsis, we're expanding a template
14087 argument pack. */
14089 {
14091 {
14095 }
14096 /* Consume the `...' token. */
14099 /* Make the argument into a TYPE_PACK_EXPANSION or
14100 EXPR_PACK_EXPANSION. */
14102 }
14105 {
14109 {
14112 }
14113 else
14115 }
14117 }
14130 #ifdef ENABLE_CHECKING
14132 #endif
14134 }
14136 /* Parse a template-argument.
14138 template-argument:
14139 assignment-expression
14140 type-id
14141 id-expression
14143 The representation is that of an assignment-expression, type-id, or
14144 id-expression -- except that the qualified id-expression is
14145 evaluated, so that the value returned is either a DECL or an
14146 OVERLOAD.
14148 Although the standard says "assignment-expression", it forbids
14149 throw-expressions or assignments in the template argument.
14150 Therefore, we use "conditional-expression" instead. */
14152 static tree
14154 {
14155 tree argument;
14161 cp_id_kind idk;
14163 /* There's really no way to know what we're looking at, so we just
14164 try each alternative in order.
14166 [temp.arg]
14168 In a template-argument, an ambiguity between a type-id and an
14169 expression is resolved to a type-id, regardless of the form of
14170 the corresponding template-parameter.
14172 Therefore, we try a type-id first. */
14175 /* If there was no error parsing the type-id but the next token is a
14176 '>>', our behavior depends on which dialect of C++ we're
14177 parsing. In C++98, we probably found a typo for '> >'. But there
14178 are type-id which are also valid expressions. For instance:
14180 struct X { int operator >> (int); };
14181 template <int V> struct Foo {};
14182 Foo<X () >> 5> r;
14184 Here 'X()' is a valid type-id of a function type, but the user just
14185 wanted to write the expression "X() >> 5". Thus, we remember that we
14186 found a valid type-id, but we still try to parse the argument as an
14187 expression to see what happens.
14189 In C++0x, the '>>' will be considered two separate '>'
14190 tokens. */
14194 {
14197 }
14198 else
14199 {
14200 /* If the next token isn't a `,' or a `>', then this argument wasn't
14201 really finished. This means that the argument is not a valid
14202 type-id. */
14205 /* If that worked, we're done. */
14208 }
14209 /* We're still not sure what the argument will be. */
14211 /* Try a template. */
14219 /* If the next token isn't a `,' or a `>', then this argument wasn't
14220 really finished. */
14224 {
14225 /* Figure out what is being referred to. If the id-expression
14226 was for a class template specialization, then we will have a
14227 TYPE_DECL at this point. There is no need to do name lookup
14228 at this point in that case. */
14231 none_type,
14240 }
14242 {
14246 }
14247 /* It must be a non-type argument. There permitted cases are given
14248 in [temp.arg.nontype]:
14250 -- an integral constant-expression of integral or enumeration
14251 type; or
14253 -- the name of a non-type template-parameter; or
14255 -- the name of an object or function with external linkage...
14257 -- the address of an object or function with external linkage...
14259 -- a pointer to member... */
14260 /* Look for a non-type template parameter. */
14262 {
14274 }
14276 /* If the next token is "&", the argument must be the address of an
14277 object or function with external linkage. */
14280 {
14283 }
14284 /* See if we might have an id-expression. */
14291 {
14294 address_p,
14301 else
14302 {
14303 tree probe;
14306 {
14307 /* Strip the dereference temporarily. */
14310 }
14312 /* If we're in a template, we represent a qualified-id referring
14313 to a static data member as a SCOPE_REF even if the scope isn't
14314 dependent so that we can check access control later. */
14319 {
14320 /* A variable without external linkage might still be a
14321 valid constant-expression, so no error is issued here
14322 if the external-linkage check fails. */
14325 }
14327 /* All overloaded functions are allowed; if the external
14328 linkage test does not pass, an error will be issued
14329 later. */
14330 ;
14334 /* A pointer-to-member. */
14335 ;
14337 ;
14338 else
14342 {
14345 tf_warning_or_error);
14346 else
14349 }
14350 }
14351 }
14352 /* If the argument started with "&", there are no other valid
14353 alternatives at this point. */
14355 {
14358 }
14360 /* If the argument wasn't successfully parsed as a type-id followed
14361 by '>>', the argument can only be a constant expression now.
14362 Otherwise, we try parsing the constant-expression tentatively,
14363 because the argument could really be a type-id. */
14374 /* We did our best to parse the argument as a non type-id, but that
14375 was the only alternative that matched (albeit with a '>' after
14376 it). We can assume it's just a typo from the user, and a
14377 diagnostic will then be issued. */
14379 }
14381 /* Parse an explicit-instantiation.
14383 explicit-instantiation:
14384 template declaration
14386 Although the standard says `declaration', what it really means is:
14388 explicit-instantiation:
14389 template decl-specifier-seq [opt] declarator [opt] ;
14391 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14392 supposed to be allowed. A defect report has been filed about this
14393 issue.
14395 GNU Extension:
14397 explicit-instantiation:
14398 storage-class-specifier template
14399 decl-specifier-seq [opt] declarator [opt] ;
14400 function-specifier template
14401 decl-specifier-seq [opt] declarator [opt] ; */
14403 static void
14405 {
14407 cp_decl_specifier_seq decl_specifiers;
14412 /* Look for an (optional) storage-class-specifier or
14413 function-specifier. */
14415 {
14416 extension_specifier
14419 extension_specifier
14422 }
14424 /* Look for the `template' keyword. */
14426 /* Let the front end know that we are processing an explicit
14427 instantiation. */
14429 /* [temp.explicit] says that we are supposed to ignore access
14430 control while processing explicit instantiation directives. */
14432 /* Parse a decl-specifier-seq. */
14434 CP_PARSER_FLAGS_OPTIONAL,
14437 /* If there was exactly one decl-specifier, and it declared a class,
14438 and there's no declarator, then we have an explicit type
14439 instantiation. */
14441 {
14442 tree type;
14446 /* Turn access control back on for names used during
14447 template instantiation. */
14452 }
14453 else
14454 {
14456 tree decl;
14458 /* Parse the declarator. */
14459 declarator
14470 {
14473 "explicit instantiation shall not use"
14477 "explicit instantiation shall not use"
14482 /* Turn access control back on for names used during
14483 template instantiation. */
14485 /* Do the explicit instantiation. */
14487 }
14488 else
14489 {
14491 /* Skip the body of the explicit instantiation. */
14493 }
14494 }
14495 /* We're done with the instantiation. */
14501 }
14503 /* Parse an explicit-specialization.
14505 explicit-specialization:
14506 template < > declaration
14508 Although the standard says `declaration', what it really means is:
14510 explicit-specialization:
14511 template <> decl-specifier [opt] init-declarator [opt] ;
14512 template <> function-definition
14513 template <> explicit-specialization
14514 template <> template-declaration */
14516 static void
14518 {
14522 /* Look for the `template' keyword. */
14524 /* Look for the `<'. */
14526 /* Look for the `>'. */
14528 /* We have processed another parameter list. */
14530 /* [temp]
14532 A template ... explicit specialization ... shall not have C
14533 linkage. */
14535 {
14537 /* Give it C++ linkage to avoid confusing other parts of the
14538 front end. */
14541 }
14542 else
14544 /* Let the front end know that we are beginning a specialization. */
14546 {
14549 }
14551 /* If the next keyword is `template', we need to figure out whether
14552 or not we're looking a template-declaration. */
14554 {
14559 else
14561 }
14562 else
14563 /* Parse the dependent declaration. */
14569 /* We're done with the specialization. */
14571 /* For the erroneous case of a template with C linkage, we pushed an
14572 implicit C++ linkage scope; exit that scope now. */
14575 /* We're done with this parameter list. */
14577 }
14579 /* Parse a type-specifier.
14581 type-specifier:
14582 simple-type-specifier
14583 class-specifier
14584 enum-specifier
14585 elaborated-type-specifier
14586 cv-qualifier
14588 GNU Extension:
14590 type-specifier:
14591 __complex__
14593 Returns a representation of the type-specifier. For a
14594 class-specifier, enum-specifier, or elaborated-type-specifier, a
14595 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14597 The parser flags FLAGS is used to control type-specifier parsing.
14599 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14600 in a decl-specifier-seq.
14602 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14603 class-specifier, enum-specifier, or elaborated-type-specifier, then
14604 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14605 if a type is declared; 2 if it is defined. Otherwise, it is set to
14606 zero.
14608 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14609 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14610 is set to FALSE. */
14612 static tree
14614 cp_parser_flags flags,
14619 {
14625 /* Assume this type-specifier does not declare a new type. */
14628 /* And that it does not specify a cv-qualifier. */
14631 /* Peek at the next token. */
14634 /* If we're looking at a keyword, we can use that to guide the
14635 production we choose. */
14638 {
14643 /* Look for the enum-specifier. */
14645 /* If that worked, we're done. */
14647 {
14652 type_spec,
14653 token,
14656 }
14657 else
14660 /* Any of these indicate either a class-specifier, or an
14661 elaborated-type-specifier. */
14668 /* Parse tentatively so that we can back up if we don't find a
14669 class-specifier. */
14671 /* Look for the class-specifier. */
14674 /* If that worked, we're done. */
14676 {
14681 type_spec,
14682 token,
14685 }
14687 /* Fall through. */
14688 elaborated_type_specifier:
14689 /* We're declaring (not defining) a class or enum. */
14693 /* Fall through. */
14695 /* Look for an elaborated-type-specifier. */
14696 type_spec
14697 = (cp_parser_elaborated_type_specifier
14700 is_declaration));
14703 type_spec,
14704 token,
14727 /* The `__complex__' keyword is a GNU extension. */
14733 }
14735 /* Handle simple keywords. */
14737 {
14739 {
14742 }
14744 }
14746 /* If we do not already have a type-specifier, assume we are looking
14747 at a simple-type-specifier. */
14749 decl_specs,
14750 flags);
14752 /* If we didn't find a type-specifier, and a type-specifier was not
14753 optional in this context, issue an error message. */
14755 {
14758 }
14761 }
14763 /* Parse a simple-type-specifier.
14765 simple-type-specifier:
14766 :: [opt] nested-name-specifier [opt] type-name
14767 :: [opt] nested-name-specifier template template-id
14768 char
14769 wchar_t
14770 bool
14771 short
14772 int
14773 long
14774 signed
14775 unsigned
14776 float
14777 double
14778 void
14780 C++0x Extension:
14782 simple-type-specifier:
14783 auto
14784 decltype ( expression )
14785 char16_t
14786 char32_t
14787 __underlying_type ( type-id )
14789 GNU Extension:
14791 simple-type-specifier:
14792 __int128
14793 __typeof__ unary-expression
14794 __typeof__ ( type-id )
14795 __typeof__ ( type-id ) { initializer-list , [opt] }
14797 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14798 appropriately updated. */
14800 static tree
14803 cp_parser_flags flags)
14804 {
14809 /* Peek at the next token. */
14812 /* If we're looking at a keyword, things are easy. */
14814 {
14849 {
14852 }
14881 {
14884 else
14888 {
14891 "use of %<auto%> in lambda parameter declaration "
14892 "only available with "
14894 }
14897 "use of %<auto%> in parameter declaration "
14898 "only available with "
14900 else
14902 "ISO C++ forbids use of %<auto%> in parameter "
14904 }
14905 else
14910 /* Since DR 743, decltype can either be a simple-type-specifier by
14911 itself or begin a nested-name-specifier. Parsing it will replace
14912 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14913 handling below decide what to do. */
14919 /* Consume the `typeof' token. */
14921 /* Parse the operand to `typeof'. */
14923 /* If it is not already a TYPE, take its type. */
14929 token,
14938 token,
14948 token,
14953 }
14955 /* If token is an already-parsed decltype not followed by ::,
14956 it's a simple-type-specifier. */
14959 {
14962 {
14964 token,
14966 /* Remember that we are handling a decltype in order to
14967 implement the resolution of DR 1510 when the argument
14968 isn't instantiation dependent. */
14970 }
14973 }
14975 /* If the type-specifier was for a built-in type, we're done. */
14977 {
14978 /* Record the type. */
14985 type,
14986 token,
14991 /* Consume the token. */
14997 /* There is no valid C++ program where a non-template type is
14998 followed by a "<". That usually indicates that the user thought
14999 that the type was a template. */
15004 }
15006 /* The type-specifier must be a user-defined type. */
15008 {
15012 /* Don't gobble tokens or issue error messages if this is an
15013 optional type-specifier. */
15017 /* Look for the optional `::' operator. */
15018 global_p
15022 /* Look for the nested-name specifier. */
15023 qualified_p
15031 /* If we have seen a nested-name-specifier, and the next token
15032 is `template', then we are using the template-id production. */
15035 {
15036 /* Look for the template-id. */
15040 none_type,
15042 /* If the template-id did not name a type, we are out of
15043 luck. */
15045 {
15048 }
15049 }
15050 /* Otherwise, look for a type-name. */
15051 else
15053 /* Keep track of all name-lookups performed in class scopes. */
15055 && !global_p
15056 && !qualified_p
15060 /* If it didn't work out, we don't have a TYPE. */
15066 token,
15068 }
15070 /* If we didn't get a type-name, issue an error message. */
15072 {
15075 }
15078 {
15079 /* See if TYPE is an Objective-C type, and if so, parse and
15080 accept any protocol references following it. Do this before
15081 the cp_parser_check_for_invalid_template_id() call, because
15082 Objective-C types can be followed by '<...>' which would
15083 enclose protocol names rather than template arguments, and so
15084 everything is fine. */
15087 {
15091 /* Clobber the "unqualified" type previously entered into
15092 DECL_SPECS with the new, improved protocol-qualified version. */
15097 }
15099 /* There is no valid C++ program where a non-template type is
15100 followed by a "<". That usually indicates that the user
15101 thought that the type was a template. */
15103 none_type,
15105 }
15108 }
15110 /* Parse a type-name.
15112 type-name:
15113 class-name
15114 enum-name
15115 typedef-name
15116 simple-template-id [in c++0x]
15118 enum-name:
15119 identifier
15121 typedef-name:
15122 identifier
15124 Returns a TYPE_DECL for the type. */
15126 static tree
15128 {
15129 tree type_decl;
15131 /* We can't know yet whether it is a class-name or not. */
15133 /* Try a class-name. */
15137 none_type,
15141 /* If it's not a class-name, keep looking. */
15143 {
15145 /* It must be a typedef-name or an enum-name. */
15149 /* It is either a simple-template-id representing an
15150 instantiation of an alias template... */
15154 none_type,
15156 /* Note that this must be an instantiation of an alias template
15157 because [temp.names]/6 says:
15159 A template-id that names an alias template specialization
15160 is a type-name.
15162 Whereas [temp.names]/7 says:
15164 A simple-template-id that names a class template
15165 specialization is a class-name. */
15170 else
15174 /* ... Or a typedef-name or an enum-name. */
15176 }
15179 }
15181 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15183 enum-name:
15184 identifier
15186 typedef-name:
15187 identifier
15189 Returns a TYPE_DECL for the type. */
15191 static tree
15193 {
15194 tree type_decl;
15195 tree identifier;
15202 /* Look up the type-name. */
15209 {
15210 /* See if this is an Objective-C type. */
15215 }
15217 /* Issue an error if we did not find a type-name. */
15219 /* In Objective-C, we have the complication that class names are
15220 normally type names and start declarations (eg, the
15221 "NSObject" in "NSObject *object;"), but can be used in an
15222 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15223 is an expression. So, a classname followed by a dot is not a
15224 valid type-name. */
15227 {
15232 }
15233 /* Remember that the name was used in the definition of the
15234 current class so that we can check later to see if the
15235 meaning would have been different after the class was
15236 entirely defined. */
15242 }
15244 /* Parse an elaborated-type-specifier. Note that the grammar given
15245 here incorporates the resolution to DR68.
15247 elaborated-type-specifier:
15248 class-key :: [opt] nested-name-specifier [opt] identifier
15249 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15250 enum-key :: [opt] nested-name-specifier [opt] identifier
15251 typename :: [opt] nested-name-specifier identifier
15252 typename :: [opt] nested-name-specifier template [opt]
15253 template-id
15255 GNU extension:
15257 elaborated-type-specifier:
15258 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15259 class-key attributes :: [opt] nested-name-specifier [opt]
15260 template [opt] template-id
15261 enum attributes :: [opt] nested-name-specifier [opt] identifier
15263 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15264 declared `friend'. If IS_DECLARATION is TRUE, then this
15265 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15266 something is being declared.
15268 Returns the TYPE specified. */
15270 static tree
15274 {
15276 tree identifier;
15279 tree globalscope;
15282 /* See if we're looking at the `enum' keyword. */
15284 {
15285 /* Consume the `enum' token. */
15287 /* Remember that it's an enumeration type. */
15289 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15290 enums) is used here. */
15293 {
15297 /* Consume the `struct' or `class' and parse it anyway. */
15299 }
15300 /* Parse the attributes. */
15302 }
15303 /* Or, it might be `typename'. */
15305 RID_TYPENAME))
15306 {
15307 /* Consume the `typename' token. */
15309 /* Remember that it's a `typename' type. */
15311 }
15312 /* Otherwise it must be a class-key. */
15313 else
15314 {
15318 /* Parse the attributes. */
15320 }
15322 /* Look for the `::' operator. */
15325 /* Look for the nested-name-specifier. */
15327 {
15332 is_declaration))
15334 }
15335 else
15336 /* Even though `typename' is not present, the proposed resolution
15337 to Core Issue 180 says that in `class A<T>::B', `B' should be
15338 considered a type-name, even if `A<T>' is dependent. */
15343 is_declaration);
15344 /* For everything but enumeration types, consider a template-id.
15345 For an enumeration type, consider only a plain identifier. */
15347 {
15349 tree decl;
15351 /* Allow the `template' keyword. */
15353 /* If we didn't see `template', we don't know if there's a
15354 template-id or not. */
15357 /* Parse the template-id. */
15361 tag_type,
15362 is_declaration);
15363 /* If we didn't find a template-id, look for an ordinary
15364 identifier. */
15366 ;
15367 /* We can get here when cp_parser_template_id, called by
15368 cp_parser_class_name with tag_type == none_type, succeeds
15369 and caches a BASELINK. Then, when called again here,
15370 instead of failing and returning an error_mark_node
15371 returns it (see template/typename17.C in C++11).
15372 ??? Could we diagnose this earlier? */
15374 {
15377 }
15378 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15379 in effect, then we must assume that, upon instantiation, the
15380 template will correspond to a class. */
15384 typename_type,
15386 /* If the `typename' keyword is in effect and DECL is not a type
15387 decl, then type is non existent. */
15389 ;
15395 }
15398 {
15403 {
15406 }
15408 /* For a `typename', we needn't call xref_tag. */
15414 /* Template parameter lists apply only if we are not within a
15415 function parameter list. */
15416 bool template_parm_lists_apply
15425 /* Look up a qualified name in the usual way. */
15427 {
15428 tree decl;
15429 tree ambiguous_decls;
15432 tag_type,
15439 /* If the lookup was ambiguous, an error will already have been
15440 issued. */
15444 /* If we are parsing friend declaration, DECL may be a
15445 TEMPLATE_DECL tree node here. However, we need to check
15446 whether this TEMPLATE_DECL results in valid code. Consider
15447 the following example:
15449 namespace N {
15450 template <class T> class C {};
15451 }
15452 class X {
15453 template <class T> friend class N::C; // #1, valid code
15454 };
15455 template <class T> class Y {
15456 friend class N::C; // #2, invalid code
15457 };
15459 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15460 name lookup of `N::C'. We see that friend declaration must
15461 be template for the code to be valid. Note that
15462 processing_template_decl does not work here since it is
15463 always 1 for the above two cases. */
15465 decl = (cp_parser_maybe_treat_template_as_class
15470 {
15472 identifier,
15475 }
15478 {
15482 allow_template);
15486 }
15488 /* Forward declarations of nested types, such as
15490 class C1::C2;
15491 class C1::C2::C3;
15493 are invalid unless all components preceding the final '::'
15494 are complete. If all enclosing types are complete, these
15495 declarations become merely pointless.
15497 Invalid forward declarations of nested types are errors
15498 caught elsewhere in parsing. Those that are pointless arrive
15499 here. */
15506 }
15507 else
15508 {
15509 /* An elaborated-type-specifier sometimes introduces a new type and
15510 sometimes names an existing type. Normally, the rule is that it
15511 introduces a new type only if there is not an existing type of
15512 the same name already in scope. For example, given:
15514 struct S {};
15515 void f() { struct S s; }
15517 the `struct S' in the body of `f' is the same `struct S' as in
15518 the global scope; the existing definition is used. However, if
15519 there were no global declaration, this would introduce a new
15520 local class named `S'.
15522 An exception to this rule applies to the following code:
15524 namespace N { struct S; }
15526 Here, the elaborated-type-specifier names a new type
15527 unconditionally; even if there is already an `S' in the
15528 containing scope this declaration names a new type.
15529 This exception only applies if the elaborated-type-specifier
15530 forms the complete declaration:
15532 [class.name]
15534 A declaration consisting solely of `class-key identifier ;' is
15535 either a redeclaration of the name in the current scope or a
15536 forward declaration of the identifier as a class name. It
15537 introduces the name into the current scope.
15539 We are in this situation precisely when the next token is a `;'.
15541 An exception to the exception is that a `friend' declaration does
15542 *not* name a new type; i.e., given:
15544 struct S { friend struct T; };
15546 `T' is not a new type in the scope of `S'.
15548 Also, `new struct S' or `sizeof (struct S)' never results in the
15549 definition of a new type; a new type can only be declared in a
15550 declaration context. */
15552 tag_scope ts;
15556 /* Friends have special name lookup rules. */
15560 CPP_SEMICOLON))
15561 /* This is a `class-key identifier ;' */
15563 else
15566 template_p =
15567 (template_parm_lists_apply
15570 /* An unqualified name was used to reference this type, so
15571 there were no qualifying templates. */
15579 }
15580 }
15585 /* Allow attributes on forward declarations of classes. */
15587 {
15597 else
15600 }
15603 {
15604 /* Indicate whether this class was declared as a `class' or as a
15605 `struct'. */
15609 }
15611 /* A "<" cannot follow an elaborated type specifier. If that
15612 happens, the user was probably trying to form a template-id. */
15617 }
15619 /* Parse an enum-specifier.
15621 enum-specifier:
15622 enum-head { enumerator-list [opt] }
15623 enum-head { enumerator-list , } [C++0x]
15625 enum-head:
15626 enum-key identifier [opt] enum-base [opt]
15627 enum-key nested-name-specifier identifier enum-base [opt]
15629 enum-key:
15630 enum
15631 enum class [C++0x]
15632 enum struct [C++0x]
15634 enum-base: [C++0x]
15635 : type-specifier-seq
15637 opaque-enum-specifier:
15638 enum-key identifier enum-base [opt] ;
15640 GNU Extensions:
15641 enum-key attributes[opt] identifier [opt] enum-base [opt]
15642 { enumerator-list [opt] }attributes[opt]
15643 enum-key attributes[opt] identifier [opt] enum-base [opt]
15644 { enumerator-list, }attributes[opt] [C++0x]
15646 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15647 if the token stream isn't an enum-specifier after all. */
15649 static tree
15651 {
15652 tree identifier;
15654 tree prev_scope;
15656 tree attributes;
15669 /* Parse tentatively so that we can back up if we don't find a
15670 enum-specifier. */
15673 /* Caller guarantees that the current token is 'enum', an identifier
15674 possibly follows, and the token after that is an opening brace.
15675 If we don't have an identifier, fabricate an anonymous name for
15676 the enumeration being defined. */
15679 /* Parse the "class" or "struct", which indicates a scoped
15680 enumeration type in C++0x. */
15683 {
15687 /* Consume the `struct' or `class' token. */
15691 }
15695 /* Clear the qualification. */
15700 /* Figure out in what scope the declaration is being placed. */
15706 nested_name_specifier
15714 {
15715 tree name;
15719 enum_type,
15724 input_location);
15726 {
15729 {
15730 /* Are template enums allowed in ISO? */
15734 /* ignore a typename reference, for it will be solved by name
15735 in start_enum. */
15737 }
15738 }
15741 else
15744 }
15745 else
15746 {
15749 else
15750 {
15756 }
15757 }
15760 /* Check for the `:' that denotes a specified underlying type in C++0x.
15761 Note that a ':' could also indicate a bitfield width, however. */
15763 {
15764 cp_decl_specifier_seq type_specifiers;
15766 /* Consume the `:'. */
15769 /* Parse the type-specifier-seq. */
15774 /* At this point this is surely not elaborated type specifier. */
15783 /* If that didn't work, stop. */
15785 {
15791 }
15792 }
15794 /* Look for the `{' but don't consume it yet. */
15796 {
15798 {
15801 {
15804 }
15805 }
15806 /* An opaque-enum-specifier must have a ';' here. */
15809 {
15812 {
15815 }
15816 }
15817 }
15823 {
15825 {
15829 }
15831 {
15833 }
15834 }
15836 /* Issue an error message if type-definitions are forbidden here. */
15839 else
15840 /* Create the new type. We do this before consuming the opening
15841 brace so the enum will be recorded as being on the line of its
15842 tag (or the 'enum' keyword, if there is no tag). */
15846 /* If the next token is not '{' it is an opaque-enum-specifier or an
15847 elaborated-type-specifier. */
15849 {
15853 {
15854 /* The following catches invalid code such as:
15855 enum class S<int>::E { A, B, C }; */
15863 {
15867 nested_name_specifier);
15869 }
15870 /* If that scope does not contain the scope in which the
15871 class was originally declared, the program is invalid. */
15873 nested_name_specifier))
15874 {
15877 "declaration of %qD in namespace %qD which does not "
15880 else
15882 "declaration of %qD in %qD which does not "
15886 }
15887 }
15892 /* Consume the opening brace. */
15899 {
15903 }
15904 else
15905 {
15911 }
15915 /* If the next token is not '}', then there are some enumerators. */
15917 {
15921 }
15922 else
15925 /* Consume the final '}'. */
15931 }
15932 else
15933 {
15934 /* If a ';' follows, then it is an opaque-enum-specifier
15935 and additional restrictions apply. */
15937 {
15944 }
15945 }
15947 /* Look for trailing attributes to apply to this enumeration, and
15948 apply them if appropriate. */
15950 {
15954 trailing_attr,
15956 }
15958 /* Finish up the enumeration. */
15960 {
15965 }
15968 {
15970 {
15973 }
15975 {
15977 }
15978 }
15979 out:
15982 }
15984 /* Parse an enumerator-list. The enumerators all have the indicated
15985 TYPE.
15987 enumerator-list:
15988 enumerator-definition
15989 enumerator-list , enumerator-definition */
15991 static void
15993 {
15995 {
15996 /* Parse an enumerator-definition. */
15999 /* If the next token is not a ',', we've reached the end of
16000 the list. */
16003 /* Otherwise, consume the `,' and keep going. */
16005 /* If the next token is a `}', there is a trailing comma. */
16007 {
16012 }
16013 }
16014 }
16016 /* Parse an enumerator-definition. The enumerator has the indicated
16017 TYPE.
16019 enumerator-definition:
16020 enumerator
16021 enumerator = constant-expression
16023 enumerator:
16024 identifier */
16026 static void
16028 {
16029 tree identifier;
16030 tree value;
16031 location_t loc;
16033 /* Save the input location because we are interested in the location
16034 of the identifier and not the location of the explicit value. */
16037 /* Look for the identifier. */
16042 /* If the next token is an '=', then there is an explicit value. */
16044 {
16045 /* Consume the `=' token. */
16047 /* Parse the value. */
16049 }
16050 else
16053 /* If we are processing a template, make sure the initializer of the
16054 enumerator doesn't contain any bare template parameter pack. */
16058 /* Create the enumerator. */
16060 }
16062 /* Parse a namespace-name.
16064 namespace-name:
16065 original-namespace-name
16066 namespace-alias
16068 Returns the NAMESPACE_DECL for the namespace. */
16070 static tree
16072 {
16073 tree identifier;
16074 tree namespace_decl;
16078 /* Get the name of the namespace. */
16083 /* Look up the identifier in the currently active scope. Look only
16084 for namespaces, due to:
16086 [basic.lookup.udir]
16088 When looking up a namespace-name in a using-directive or alias
16089 definition, only namespace names are considered.
16091 And:
16093 [basic.lookup.qual]
16095 During the lookup of a name preceding the :: scope resolution
16096 operator, object, function, and enumerator names are ignored.
16098 (Note that cp_parser_qualifying_entity only calls this
16099 function if the token after the name is the scope resolution
16100 operator.) */
16102 none_type,
16108 /* If it's not a namespace, issue an error. */
16111 {
16116 }
16119 }
16121 /* Parse a namespace-definition.
16123 namespace-definition:
16124 named-namespace-definition
16125 unnamed-namespace-definition
16127 named-namespace-definition:
16128 original-namespace-definition
16129 extension-namespace-definition
16131 original-namespace-definition:
16132 namespace identifier { namespace-body }
16134 extension-namespace-definition:
16135 namespace original-namespace-name { namespace-body }
16137 unnamed-namespace-definition:
16138 namespace { namespace-body } */
16140 static void
16142 {
16149 {
16153 }
16154 else
16157 /* Look for the `namespace' keyword. */
16160 /* Get the name of the namespace. We do not attempt to distinguish
16161 between an original-namespace-definition and an
16162 extension-namespace-definition at this point. The semantic
16163 analysis routines are responsible for that. */
16166 else
16169 /* Parse any specified attributes. */
16172 /* Look for the `{' to start the namespace. */
16174 /* Start the namespace. */
16177 /* "inline namespace" is equivalent to a stub namespace definition
16178 followed by a strong using directive. */
16180 {
16182 /* Set up namespace association. */
16186 /* Import the contents of the inline namespace. */
16190 }
16194 /* Parse the body of the namespace. */
16200 /* Finish the namespace. */
16202 /* Look for the final `}'. */
16204 }
16206 /* Parse a namespace-body.
16208 namespace-body:
16209 declaration-seq [opt] */
16211 static void
16213 {
16215 }
16217 /* Parse a namespace-alias-definition.
16219 namespace-alias-definition:
16220 namespace identifier = qualified-namespace-specifier ; */
16222 static void
16224 {
16225 tree identifier;
16226 tree namespace_specifier;
16230 /* Look for the `namespace' keyword. */
16232 /* Look for the identifier. */
16236 /* Look for the `=' token. */
16239 {
16241 /* Skip the definition. */
16246 }
16248 /* Look for the qualified-namespace-specifier. */
16249 namespace_specifier
16251 /* Look for the `;' token. */
16254 /* Register the alias in the symbol table. */
16256 }
16258 /* Parse a qualified-namespace-specifier.
16260 qualified-namespace-specifier:
16261 :: [opt] nested-name-specifier [opt] namespace-name
16263 Returns a NAMESPACE_DECL corresponding to the specified
16264 namespace. */
16266 static tree
16268 {
16269 /* Look for the optional `::'. */
16273 /* Look for the optional nested-name-specifier. */
16281 }
16283 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16284 access declaration.
16286 using-declaration:
16287 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16288 using :: unqualified-id ;
16290 access-declaration:
16291 qualified-id ;
16293 */
16295 static bool
16298 {
16302 tree decl;
16303 tree identifier;
16304 tree qscope;
16309 {
16312 }
16313 else
16314 {
16315 /* Look for the `using' keyword. */
16318 /* Peek at the next token. */
16320 /* See if it's `typename'. */
16322 {
16323 /* Remember that we've seen it. */
16325 /* Consume the `typename' token. */
16327 }
16328 }
16330 /* Look for the optional global scope qualification. */
16331 global_scope_p
16336 /* If we saw `typename', or didn't see `::', then there must be a
16337 nested-name-specifier present. */
16339 {
16345 {
16348 }
16349 }
16350 /* Otherwise, we could be in either of the two productions. In that
16351 case, treat the nested-name-specifier as optional. */
16352 else
16364 /* Something has already gone wrong; there's no need to parse
16365 further. Since an error has occurred, the return value of
16366 cp_parser_parse_definitely will be false, as required. */
16370 /* Parse the unqualified-id. */
16378 {
16383 }
16385 /* The function we call to handle a using-declaration is different
16386 depending on what scope we are in. */
16388 ;
16391 /* [namespace.udecl]
16393 A using declaration shall not name a template-id. */
16396 else
16397 {
16399 {
16400 /* Create the USING_DECL. */
16407 {
16410 }
16411 else
16412 /* Add it to the list of members in this class. */
16414 }
16415 else
16416 {
16418 identifier,
16425 {
16428 }
16431 else
16433 }
16434 }
16436 /* Look for the final `;'. */
16441 "access declarations are deprecated "
16442 "in favour of using-declarations; "
16446 }
16448 /* Parse an alias-declaration.
16450 alias-declaration:
16451 using identifier attribute-specifier-seq [opt] = type-id */
16453 static tree
16455 {
16457 location_t id_location;
16459 cp_decl_specifier_seq decl_specs;
16463 /* Look for the `using' keyword. */
16464 cp_token *using_token
16486 /* Now we are going to parse the type-id of the declaration. */
16488 /*
16489 [dcl.type]/3 says:
16491 "A type-specifier-seq shall not define a class or enumeration
16492 unless it appears in the type-id of an alias-declaration (7.1.3) that
16493 is not the declaration of a template-declaration."
16495 In other words, if we currently are in an alias template, the
16496 type-id should not define a type.
16498 So let's set parser->type_definition_forbidden_message in that
16499 case; cp_parser_check_type_definition (called by
16500 cp_parser_class_specifier) will then emit an error if a type is
16501 defined in the type-id. */
16503 {
16507 }
16511 /* Restore the error message if need be. */
16517 {
16520 }
16522 /* A typedef-name can also be introduced by an alias-declaration. The
16523 identifier following the using keyword becomes a typedef-name. It has
16524 the same semantics as if it were introduced by the typedef
16525 specifier. In particular, it does not define a new type and it shall
16526 not appear in the type-id. */
16531 {
16534 ds_attribute,
16535 attrs_token);
16536 }
16538 ds_typedef,
16539 using_token);
16541 ds_alias,
16542 using_token);
16551 else
16562 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16563 added into the symbol table; otherwise, return the TYPE_DECL. */
16567 {
16571 }
16574 }
16576 /* Parse a using-directive.
16578 using-directive:
16579 using namespace :: [opt] nested-name-specifier [opt]
16580 namespace-name ; */
16582 static void
16584 {
16585 tree namespace_decl;
16586 tree attribs;
16588 /* Look for the `using' keyword. */
16590 /* And the `namespace' keyword. */
16592 /* Look for the optional `::' operator. */
16594 /* And the optional nested-name-specifier. */
16600 /* Get the namespace being used. */
16602 /* And any specified attributes. */
16604 /* Update the symbol table. */
16606 /* Look for the final `;'. */
16608 }
16610 /* Parse an asm-definition.
16612 asm-definition:
16613 asm ( string-literal ) ;
16615 GNU Extension:
16617 asm-definition:
16618 asm volatile [opt] ( string-literal ) ;
16619 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16620 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16621 : asm-operand-list [opt] ) ;
16622 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16623 : asm-operand-list [opt]
16624 : asm-clobber-list [opt] ) ;
16625 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16626 : asm-clobber-list [opt]
16627 : asm-goto-list ) ; */
16629 static void
16631 {
16632 tree string;
16637 tree asm_stmt;
16645 /* Look for the `asm' keyword. */
16650 {
16653 }
16655 /* See if the next token is `volatile'. */
16658 {
16659 /* Remember that we saw the `volatile' keyword. */
16661 /* Consume the token. */
16663 }
16667 {
16668 /* Remember that we saw the `goto' keyword. */
16670 /* Consume the token. */
16672 }
16673 /* Look for the opening `('. */
16676 /* Look for the string. */
16679 {
16683 }
16685 /* If we're allowing GNU extensions, check for the extended assembly
16686 syntax. Unfortunately, the `:' tokens need not be separated by
16687 a space in C, and so, for compatibility, we tolerate that here
16688 too. Doing that means that we have to treat the `::' operator as
16689 two `:' tokens. */
16694 {
16699 /* The extended syntax was used. */
16702 /* Look for outputs. */
16704 {
16705 /* Consume the `:'. */
16707 /* Parse the output-operands. */
16709 CPP_COLON)
16711 CPP_SCOPE)
16713 CPP_CLOSE_PAREN)
16719 }
16720 /* If the next token is `::', there are no outputs, and the
16721 next token is the beginning of the inputs. */
16723 /* The inputs are coming next. */
16726 /* Look for inputs. */
16729 {
16730 /* Consume the `:' or `::'. */
16732 /* Parse the output-operands. */
16734 CPP_COLON)
16736 CPP_SCOPE)
16738 CPP_CLOSE_PAREN))
16743 }
16745 /* The clobbers are coming next. */
16748 /* Look for clobbers. */
16751 {
16753 /* Consume the `:' or `::'. */
16755 /* Parse the clobbers. */
16757 CPP_COLON)
16759 CPP_CLOSE_PAREN))
16761 }
16764 /* The labels are coming next. */
16767 /* Look for labels. */
16770 {
16772 /* Consume the `:' or `::'. */
16774 /* Parse the labels. */
16776 }
16780 }
16784 /* Look for the closing `)'. */
16792 {
16793 /* Create the ASM_EXPR. */
16795 {
16798 /* If the extended syntax was not used, mark the ASM_EXPR. */
16800 {
16806 }
16807 }
16808 else
16810 }
16811 }
16813 /* Declarators [gram.dcl.decl] */
16815 /* Parse an init-declarator.
16817 init-declarator:
16818 declarator initializer [opt]
16820 GNU Extension:
16822 init-declarator:
16823 declarator asm-specification [opt] attributes [opt] initializer [opt]
16825 function-definition:
16826 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16827 function-body
16828 decl-specifier-seq [opt] declarator function-try-block
16830 GNU Extension:
16832 function-definition:
16833 __extension__ function-definition
16835 TM Extension:
16837 function-definition:
16838 decl-specifier-seq [opt] declarator function-transaction-block
16840 The DECL_SPECIFIERS apply to this declarator. Returns a
16841 representation of the entity declared. If MEMBER_P is TRUE, then
16842 this declarator appears in a class scope. The new DECL created by
16843 this declarator is returned.
16845 The CHECKS are access checks that should be performed once we know
16846 what entity is being declared (and, therefore, what classes have
16847 befriended it).
16849 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16850 for a function-definition here as well. If the declarator is a
16851 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16852 be TRUE upon return. By that point, the function-definition will
16853 have been completely parsed.
16855 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16856 is FALSE.
16858 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16859 parsed declaration if it is an uninitialized single declarator not followed
16860 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16861 if present, will not be consumed. If returned, this declarator will be
16862 created with SD_INITIALIZED but will not call cp_finish_decl.
16864 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
16865 and there is an initializer, the pointed location_t is set to the
16866 location of the '=' or `(', or '{' in C++11 token introducing the
16867 initializer. */
16869 static tree
16879 {
16883 tree prefix_attributes;
16885 tree asm_specification;
16886 tree initializer;
16888 tree scope;
16890 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16891 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16892 "(...)". */
16903 /* Gather the attributes that were provided with the
16904 decl-specifiers. */
16907 /* Assume that this is not the declarator for a function
16908 definition. */
16912 /* Default arguments are only permitted for function parameters. */
16916 /* Defer access checks while parsing the declarator; we cannot know
16917 what names are accessible until we know what is being
16918 declared. */
16921 /* Parse the declarator. */
16923 declarator
16928 /* Gather up the deferred checks. */
16933 /* If the DECLARATOR was erroneous, there's no need to go
16934 further. */
16938 /* Check that the number of template-parameter-lists is OK. */
16948 /* Figure out what scope the entity declared by the DECLARATOR is
16949 located in. `grokdeclarator' sometimes changes the scope, so
16950 we compute it now. */
16953 /* Perform any lookups in the declared type which were thought to be
16954 dependent, but are not in the scope of the declarator. */
16955 decl_specifiers->type
16958 /* If we're allowing GNU extensions, look for an
16959 asm-specification. */
16961 {
16962 /* Look for an asm-specification. */
16965 }
16966 else
16969 /* Look for attributes. */
16973 /* Peek at the next token. */
16979 {
16980 /* Check to see if the token indicates the start of a
16981 function-definition. */
16983 {
16985 {
16986 /* If a function-definition should not appear here, issue an
16987 error message. */
16991 }
16993 location_t func_brace_location
16996 /* Neither attributes nor an asm-specification are allowed
16997 on a function-definition. */
17000 "an asm-specification is not allowed "
17004 "attributes are not allowed "
17006 /* This is a function-definition. */
17009 /* Parse the function definition. */
17012 decl_specifiers,
17013 declarator,
17014 prefix_attributes);
17015 else
17016 decl =
17017 (cp_parser_function_definition_from_specifiers_and_declarator
17021 {
17022 /* This is where the prologue starts... */
17025 }
17028 }
17029 }
17031 {
17032 /* A non-template declaration involving a function parameter list
17033 containing an implicit template parameter will be made into a
17034 template. If the resulting declaration is not going to be an
17035 actual function then finish the template scope here to prevent it.
17036 An error message will be issued once we have a decl to talk about.
17038 FIXME probably we should do type deduction rather than create an
17039 implicit template, but the standard currently doesn't allow it. */
17042 }
17044 /* [dcl.dcl]
17046 Only in function declarations for constructors, destructors, and
17047 type conversions can the decl-specifier-seq be omitted.
17049 We explicitly postpone this check past the point where we handle
17050 function-definitions because we tolerate function-definitions
17051 that are missing their return types in some modes. */
17053 {
17057 }
17059 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17063 {
17074 {
17080 }
17081 }
17082 else
17083 {
17084 /* If the init-declarator isn't initialized and isn't followed by a
17085 `,' or `;', it's not a valid init-declarator. */
17088 {
17091 else
17092 {
17096 }
17097 }
17100 }
17102 /* Because start_decl has side-effects, we should only call it if we
17103 know we're going ahead. By this point, we know that we cannot
17104 possibly be looking at any other construct. */
17107 /* Enter the newly declared entry in the symbol table. If we're
17108 processing a declaration in a class-specifier, we wait until
17109 after processing the initializer. */
17111 {
17118 /* Adjust location of decl if declarator->id_loc is more appropriate:
17119 set, and decl wasn't merged with another decl, in which case its
17120 location would be different from input_location, and more accurate. */
17125 }
17127 /* Enter the SCOPE. That way unqualified names appearing in the
17128 initializer will be looked up in SCOPE. */
17131 /* Perform deferred access control checks, now that we know in which
17132 SCOPE the declared entity resides. */
17134 {
17137 /* If the entity being declared is a function, pretend that we
17138 are in its scope. If it is a `friend', it may have access to
17139 things that would not otherwise be accessible. */
17141 {
17144 }
17146 /* Perform access checks for template parameters. */
17149 /* Perform the access control checks for the declarator and the
17150 decl-specifiers. */
17153 /* Restore the saved value. */
17156 }
17158 /* Parse the initializer. */
17163 {
17165 {
17168 else
17169 {
17170 /* If the declaration was erroneous, we don't really
17171 know what the user intended, so just silently
17172 consume the initializer. */
17179 }
17180 }
17181 else
17182 {
17183 /* We want to record the extra mangling scope for in-class
17184 initializers of class members and initializers of static data
17185 member templates. The former involves deferring
17186 parsing of the initializer until end of class as with default
17187 arguments. So right here we only handle the latter. */
17197 }
17198 }
17200 /* The old parser allows attributes to appear after a parenthesized
17201 initializer. Mark Mitchell proposed removing this functionality
17202 on the GCC mailing lists on 2002-08-13. This parser accepts the
17203 attributes -- but ignores them. */
17210 /* And now complain about a non-function implicit template. */
17215 /* For an in-class declaration, use `grokfield' to create the
17216 declaration. */
17218 {
17220 {
17223 }
17231 }
17233 /* Finish processing the declaration. But, skip member
17234 declarations. */
17236 {
17239 asm_specification,
17240 /* If the initializer is in parentheses, then this is
17241 a direct-initialization, which means that an
17242 `explicit' constructor is OK. Otherwise, an
17243 `explicit' constructor cannot be used. */
17246 }
17249 /* Core issue #226 (C++0x only): A default template-argument
17250 shall not be specified in a friend class template
17251 declaration. */
17260 {
17263 else
17265 }
17268 }
17270 /* Parse a declarator.
17272 declarator:
17273 direct-declarator
17274 ptr-operator declarator
17276 abstract-declarator:
17277 ptr-operator abstract-declarator [opt]
17278 direct-abstract-declarator
17280 GNU Extensions:
17282 declarator:
17283 attributes [opt] direct-declarator
17284 attributes [opt] ptr-operator declarator
17286 abstract-declarator:
17287 attributes [opt] ptr-operator abstract-declarator [opt]
17288 attributes [opt] direct-abstract-declarator
17290 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17291 detect constructor, destructor or conversion operators. It is set
17292 to -1 if the declarator is a name, and +1 if it is a
17293 function. Otherwise it is set to zero. Usually you just want to
17294 test for >0, but internally the negative value is used.
17296 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17297 a decl-specifier-seq unless it declares a constructor, destructor,
17298 or conversion. It might seem that we could check this condition in
17299 semantic analysis, rather than parsing, but that makes it difficult
17300 to handle something like `f()'. We want to notice that there are
17301 no decl-specifiers, and therefore realize that this is an
17302 expression, not a declaration.)
17304 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17305 the declarator is a direct-declarator of the form "(...)".
17307 MEMBER_P is true iff this declarator is a member-declarator.
17309 FRIEND_P is true iff this declarator is a friend. */
17313 cp_parser_declarator_kind dcl_kind,
17317 {
17320 cp_cv_quals cv_quals;
17321 tree class_type;
17324 /* Assume this is not a constructor, destructor, or type-conversion
17325 operator. */
17332 /* Check for the ptr-operator production. */
17334 /* Parse the ptr-operator. */
17340 /* If that worked, then we have a ptr-operator. */
17342 {
17343 /* If a ptr-operator was found, then this declarator was not
17344 parenthesized. */
17347 /* The dependent declarator is optional if we are parsing an
17348 abstract-declarator. */
17352 /* Parse the dependent declarator. */
17357 friend_p);
17359 /* If we are parsing an abstract-declarator, we must handle the
17360 case where the dependent declarator is absent. */
17365 declarator = cp_parser_make_indirect_declarator
17367 }
17368 /* Everything else is a direct-declarator. */
17369 else
17370 {
17373 CPP_OPEN_PAREN);
17375 ctor_dtor_or_conv_p,
17377 }
17382 }
17384 /* Parse a direct-declarator or direct-abstract-declarator.
17386 direct-declarator:
17387 declarator-id
17388 direct-declarator ( parameter-declaration-clause )
17389 cv-qualifier-seq [opt]
17390 ref-qualifier [opt]
17391 exception-specification [opt]
17392 direct-declarator [ constant-expression [opt] ]
17393 ( declarator )
17395 direct-abstract-declarator:
17396 direct-abstract-declarator [opt]
17397 ( parameter-declaration-clause )
17398 cv-qualifier-seq [opt]
17399 ref-qualifier [opt]
17400 exception-specification [opt]
17401 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17402 ( abstract-declarator )
17404 Returns a representation of the declarator. DCL_KIND is
17405 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17406 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17407 we are parsing a direct-declarator. It is
17408 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17409 of ambiguity we prefer an abstract declarator, as per
17410 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17411 as for cp_parser_declarator. */
17415 cp_parser_declarator_kind dcl_kind,
17418 {
17428 {
17429 /* Peek at the next token. */
17432 {
17433 /* This is either a parameter-declaration-clause, or a
17434 parenthesized declarator. When we know we are parsing a
17435 named declarator, it must be a parenthesized declarator
17436 if FIRST is true. For instance, `(int)' is a
17437 parameter-declaration-clause, with an omitted
17438 direct-abstract-declarator. But `((*))', is a
17439 parenthesized abstract declarator. Finally, when T is a
17440 template parameter `(T)' is a
17441 parameter-declaration-clause, and not a parenthesized
17442 named declarator.
17444 We first try and parse a parameter-declaration-clause,
17445 and then try a nested declarator (if FIRST is true).
17447 It is not an error for it not to be a
17448 parameter-declaration-clause, even when FIRST is
17449 false. Consider,
17451 int i (int);
17452 int i (3);
17454 The first is the declaration of a function while the
17455 second is the definition of a variable, including its
17456 initializer.
17458 Having seen only the parenthesis, we cannot know which of
17459 these two alternatives should be selected. Even more
17460 complex are examples like:
17462 int i (int (a));
17463 int i (int (3));
17465 The former is a function-declaration; the latter is a
17466 variable initialization.
17468 Thus again, we try a parameter-declaration-clause, and if
17469 that fails, we back out and return. */
17472 {
17473 tree params;
17476 /* In a member-declarator, the only valid interpretation
17477 of a parenthesis is the start of a
17478 parameter-declaration-clause. (It is invalid to
17479 initialize a static data member with a parenthesized
17480 initializer; only the "=" form of initialization is
17481 permitted.) */
17485 /* Consume the `('. */
17488 {
17489 /* If this is going to be an abstract declarator, we're
17490 in a declarator and we can't have default args. */
17493 }
17497 /* Parse the parameter-declaration-clause. */
17500 /* Consume the `)'. */
17503 /* If all went well, parse the cv-qualifier-seq,
17504 ref-qualifier and the exception-specification. */
17506 {
17507 cp_cv_quals cv_quals;
17508 cp_virt_specifiers virt_specifiers;
17509 cp_ref_qualifier ref_qual;
17510 tree exception_specification;
17511 tree late_return;
17512 tree attrs;
17522 /* Parse the cv-qualifier-seq. */
17524 /* Parse the ref-qualifier. */
17526 /* And the exception-specification. */
17527 exception_specification
17532 /* In here, we handle cases where attribute is used after
17533 the function declaration. For example:
17534 void func (int x) __attribute__((vector(..))); */
17537 {
17541 CPP_SEMICOLON)
17543 CPP_OPEN_BRACE))
17546 ;
17547 else
17549 }
17550 late_return = (cp_parser_late_return_type_opt
17555 /* Parse the virt-specifier-seq. */
17558 /* Create the function-declarator. */
17560 params,
17561 cv_quals,
17562 virt_specifiers,
17563 ref_qual,
17564 exception_specification,
17565 late_return);
17567 /* Any subsequent parameter lists are to do with
17568 return type, so are not those of the declared
17569 function. */
17571 }
17573 /* Remove the function parms from scope. */
17577 /* Repeat the main loop. */
17579 }
17581 /* If this is the first, we can try a parenthesized
17582 declarator. */
17584 {
17590 /* Consume the `('. */
17592 /* Parse the nested declarator. */
17595 declarator
17601 /* Expect a `)'. */
17608 }
17609 /* Otherwise, we must be done. */
17610 else
17612 }
17616 {
17617 /* Parse an array-declarator. */
17626 /* Consume the `['. */
17628 /* Peek at the next token. */
17630 /* If the next token is `]', then there is no
17631 constant-expression. */
17633 {
17635 bounds
17645 {
17646 /* Normally, the array bound must be an integral constant
17647 expression. However, as an extension, we allow VLAs
17648 in function scopes as long as they aren't part of a
17649 parameter declaration. */
17653 }
17656 {
17657 /* Remember this wasn't a constant-expression. */
17660 }
17661 }
17662 else
17664 /* Look for the closing `]'. */
17666 {
17669 }
17674 }
17676 {
17677 {
17678 tree qualifying_scope;
17679 tree unqualified_name;
17680 tree attrs;
17681 special_function_kind sfk;
17686 /* Parse a declarator-id */
17689 {
17692 /* If we see an ellipsis, we should be looking at a
17693 parameter pack. */
17695 {
17696 /* Consume the `...' */
17700 }
17701 }
17704 unqualified_name
17708 {
17712 {
17713 /* Check whether an error occurred. */
17716 /* We already consumed the ellipsis to mark a
17717 parameter pack, but we have no way to report it,
17718 so abort the tentative parse. We will be exiting
17719 immediately anyway. */
17721 }
17722 else
17728 && (qualifying_scope
17730 {
17733 }
17734 }
17739 {
17744 }
17750 {
17751 /* In the declaration of a member of a template class
17752 outside of the class itself, the SCOPE will sometimes
17753 be a TYPENAME_TYPE. For example, given:
17755 template <typename T>
17756 int S<T>::R::i = 3;
17758 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17759 this context, we must resolve S<T>::R to an ordinary
17760 type, rather than a typename type.
17762 The reason we normally avoid resolving TYPENAME_TYPEs
17763 is that a specialization of `S' might render
17764 `S<T>::R' not a type. However, if `S' is
17765 specialized, then this `i' will not be used, so there
17766 is no harm in resolving the types here. */
17767 tree type;
17769 /* Resolve the TYPENAME_TYPE. */
17772 /* If that failed, the declarator is invalid. */
17774 {
17777 "cannot define member of dependent typedef "
17779 else
17784 }
17786 }
17791 {
17792 tree class_type;
17797 else
17801 {
17804 {
17807 {
17811 "use %<%T::%D%> instead of %<%T::%D%> to "
17813 class_type,
17818 }
17819 else
17821 }
17822 else
17823 {
17824 /* We do not attempt to print the declarator
17825 here because we do not have enough
17826 information about its original syntactic
17827 form. */
17831 }
17832 }
17835 {
17841 for an anonymous type, even if the type
17842 got a name for linkage purposes. */
17844 /* Handle correctly (c++/19200):
17846 struct S {
17847 struct T{};
17848 friend void S(T);
17849 };
17851 and also:
17853 namespace N {
17854 void S();
17855 }
17857 struct S {
17858 friend void N::S();
17859 }; */
17860 && !(friend_p
17863 class_type))
17864 {
17867 }
17875 }
17876 }
17878 unqualified_name,
17879 sfk);
17886 }
17888 handle_declarator:;
17891 {
17892 /* Any names that appear after the declarator-id for a
17893 member are looked up in the containing scope. */
17895 {
17896 /* But declarations with qualified-ids can't appear in a
17897 function. */
17901 }
17903 }
17907 /* Default args are only allowed on function
17908 declarations. */
17910 else
17914 }
17915 /* We're done. */
17916 else
17918 }
17920 /* For an abstract declarator, we might wind up with nothing at this
17921 point. That's an error; the declarator is not optional. */
17925 /* If we entered a scope, we must exit it now. */
17933 }
17935 /* Parse a ptr-operator.
17937 ptr-operator:
17938 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17939 * cv-qualifier-seq [opt]
17940 &
17941 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17942 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17944 GNU Extension:
17946 ptr-operator:
17947 & cv-qualifier-seq [opt]
17949 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17950 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17951 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17952 filled in with the TYPE containing the member. *CV_QUALS is
17953 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17954 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17955 Note that the tree codes returned by this function have nothing
17956 to do with the types of trees that will be eventually be created
17957 to represent the pointer or reference type being parsed. They are
17958 just constants with suggestive names. */
17959 static enum tree_code
17964 {
17969 /* Assume that it's not a pointer-to-member. */
17971 /* And that there are no cv-qualifiers. */
17974 /* Peek at the next token. */
17977 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17987 {
17988 /* Consume the `*', `&' or `&&'. */
17991 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17992 `&', if we are allowing GNU extensions. (The only qualifier
17993 that can legally appear after `&' is `restrict', but that is
17994 enforced during semantic analysis. */
18002 }
18003 else
18004 {
18005 /* Try the pointer-to-member case. */
18007 /* Look for the optional `::' operator. */
18010 /* Look for the nested-name specifier. */
18017 /* If we found it, and the next token is a `*', then we are
18018 indeed looking at a pointer-to-member operator. */
18021 {
18022 /* Indicate that the `*' operator was used. */
18030 else
18031 {
18032 /* The type of which the member is a member is given by the
18033 current SCOPE. */
18035 /* The next name will not be qualified. */
18039 /* Look for optional c++11 attributes. */
18043 /* Look for the optional cv-qualifier-seq. */
18045 }
18046 }
18047 /* If that didn't work we don't have a ptr-operator. */
18050 }
18053 }
18055 /* Parse an (optional) cv-qualifier-seq.
18057 cv-qualifier-seq:
18058 cv-qualifier cv-qualifier-seq [opt]
18060 cv-qualifier:
18061 const
18062 volatile
18064 GNU Extension:
18066 cv-qualifier:
18067 __restrict__
18069 Returns a bitmask representing the cv-qualifiers. */
18071 static cp_cv_quals
18073 {
18077 {
18079 cp_cv_quals cv_qualifier;
18081 /* Peek at the next token. */
18083 /* See if it's a cv-qualifier. */
18085 {
18101 }
18107 {
18110 }
18111 else
18112 {
18115 }
18116 }
18119 }
18121 /* Parse an (optional) ref-qualifier
18123 ref-qualifier:
18124 &
18125 &&
18127 Returns cp_ref_qualifier representing ref-qualifier. */
18129 static cp_ref_qualifier
18131 {
18134 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18139 {
18144 {
18156 }
18161 {
18164 }
18165 else
18166 {
18169 }
18170 }
18173 }
18175 /* Parse an (optional) virt-specifier-seq.
18177 virt-specifier-seq:
18178 virt-specifier virt-specifier-seq [opt]
18180 virt-specifier:
18181 override
18182 final
18184 Returns a bitmask representing the virt-specifiers. */
18186 static cp_virt_specifiers
18188 {
18192 {
18194 cp_virt_specifiers virt_specifier;
18196 /* Peek at the next token. */
18198 /* See if it's a virt-specifier-qualifier. */
18202 {
18205 }
18207 {
18210 }
18212 {
18214 }
18215 else
18219 {
18222 }
18223 else
18224 {
18227 }
18228 }
18230 }
18232 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18233 is in scope even though it isn't real. */
18235 void
18237 {
18238 tree this_parm;
18241 {
18242 /* We don't clear this between NSDMIs. Is it already what we want? */
18247 }
18250 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18252 current_class_ref
18255 }
18257 /* Return true iff our current scope is a non-static data member
18258 initializer. */
18260 bool
18262 {
18263 /* We recognize NSDMI context by the context-less 'this' pointer set up
18264 by the function above. */
18268 }
18270 /* Parse a late-specified return type, if any. This is not a separate
18271 non-terminal, but part of a function declarator, which looks like
18273 -> trailing-type-specifier-seq abstract-declarator(opt)
18275 Returns the type indicated by the type-id.
18277 In addition to this this parses any queued up omp declare simd
18278 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18280 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18281 function. */
18283 static tree
18285 cp_cv_quals quals)
18286 {
18290 && declarator
18296 /* Peek at the next token. */
18298 /* A late-specified return type is indicated by an initial '->'. */
18305 {
18306 /* DR 1207: 'this' is in scope in the trailing return type. */
18308 }
18311 {
18312 /* Consume the ->. */
18316 }
18319 declarator->std_attributes
18323 declarator->std_attributes
18328 {
18331 }
18334 }
18336 /* Parse a declarator-id.
18338 declarator-id:
18339 id-expression
18340 :: [opt] nested-name-specifier [opt] type-name
18342 In the `id-expression' case, the value returned is as for
18343 cp_parser_id_expression if the id-expression was an unqualified-id.
18344 If the id-expression was a qualified-id, then a SCOPE_REF is
18345 returned. The first operand is the scope (either a NAMESPACE_DECL
18346 or TREE_TYPE), but the second is still just a representation of an
18347 unqualified-id. */
18349 static tree
18351 {
18352 tree id;
18353 /* The expression must be an id-expression. Assume that qualified
18354 names are the names of types so that:
18356 template <class T>
18357 int S<T>::R::i = 3;
18359 will work; we must treat `S<T>::R' as the name of a type.
18360 Similarly, assume that qualified names are templates, where
18361 required, so that:
18363 template <class T>
18364 int S<T>::R<T>::i = 3;
18366 will work, too. */
18372 optional_p);
18376 }
18378 /* Parse a type-id.
18380 type-id:
18381 type-specifier-seq abstract-declarator [opt]
18383 Returns the TYPE specified. */
18385 static tree
18388 {
18389 cp_decl_specifier_seq type_specifier_seq;
18392 /* Parse the type-specifier-seq. */
18394 is_trailing_return,
18399 /* There might or might not be an abstract declarator. */
18401 /* Look for the declarator. */
18402 abstract_declarator
18407 /* Check to see if there really was a declarator. */
18412 /* None of the valid uses of 'auto' in C++14 involve the type-id
18413 nonterminal, but it is valid in a trailing-return-type. */
18416 {
18417 /* A type-id with type 'auto' is only ok if the abstract declarator
18418 is a function declarator with a late-specified return type. */
18423 else
18424 {
18427 }
18428 }
18431 is_template_arg);
18432 }
18435 {
18437 }
18440 {
18441 tree r;
18443 parser->type_definition_forbidden_message
18448 {
18451 }
18453 }
18456 {
18458 }
18460 /* Parse a type-specifier-seq.
18462 type-specifier-seq:
18463 type-specifier type-specifier-seq [opt]
18465 GNU extension:
18467 type-specifier-seq:
18468 attributes type-specifier-seq [opt]
18470 If IS_DECLARATION is true, we are at the start of a "condition" or
18471 exception-declaration, so we might be followed by a declarator-id.
18473 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18474 i.e. we've just seen "->".
18476 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18478 static void
18483 {
18488 /* Clear the TYPE_SPECIFIER_SEQ. */
18491 /* In the context of a trailing return type, enum E { } is an
18492 elaborated-type-specifier followed by a function-body, not an
18493 enum-specifier. */
18497 /* Parse the type-specifiers and attributes. */
18499 {
18500 tree type_specifier;
18503 /* Check for attributes first. */
18505 {
18510 }
18512 /* record the token of the beginning of the type specifier seq,
18513 for error reporting purposes*/
18517 /* Look for the type-specifier. */
18519 flags,
18520 type_specifier_seq,
18522 NULL,
18525 {
18526 /* If the first type-specifier could not be found, this is not a
18527 type-specifier-seq at all. */
18529 {
18530 /* Set in_declarator_p to avoid skipping to the semicolon. */
18542 }
18543 /* If subsequent type-specifiers could not be found, the
18544 type-specifier-seq is complete. */
18546 }
18549 /* The standard says that a condition can be:
18551 type-specifier-seq declarator = assignment-expression
18553 However, given:
18555 struct S {};
18556 if (int S = ...)
18558 we should treat the "S" as a declarator, not as a
18559 type-specifier. The standard doesn't say that explicitly for
18560 type-specifier-seq, but it does say that for
18561 decl-specifier-seq in an ordinary declaration. Perhaps it
18562 would be clearer just to allow a decl-specifier-seq here, and
18563 then add a semantic restriction that if any decl-specifiers
18564 that are not type-specifiers appear, the program is invalid. */
18567 }
18568 }
18570 /* Return whether the function currently being declared has an associated
18571 template parameter list. */
18573 static bool
18575 {
18588 }
18590 /* Parse a parameter-declaration-clause.
18592 parameter-declaration-clause:
18593 parameter-declaration-list [opt] ... [opt]
18594 parameter-declaration-list , ...
18596 Returns a representation for the parameter declarations. A return
18597 value of NULL indicates a parameter-declaration-clause consisting
18598 only of an ellipsis. */
18600 static tree
18602 {
18603 tree parameters;
18612 parser->auto_is_implicit_function_template_parm_p
18614 }
18620 && !processing_template_parmlist
18626 /* Peek at the next token. */
18628 /* Check for trivial parameter-declaration-clauses. */
18630 {
18631 /* Consume the `...' token. */
18634 }
18636 /* There are no parameters. */
18637 {
18638 #ifndef NO_IMPLICIT_EXTERN_C
18643 else
18644 #endif
18646 }
18647 /* Check for `(void)', too, which is a special case. */
18651 {
18652 /* Consume the `void' token. */
18654 /* There are no parameters. */
18656 }
18658 /* Parse the parameter-declaration-list. */
18660 /* If a parse error occurred while parsing the
18661 parameter-declaration-list, then the entire
18662 parameter-declaration-clause is erroneous. */
18666 /* Peek at the next token. */
18668 /* If it's a `,', the clause should terminate with an ellipsis. */
18670 {
18671 /* Consume the `,'. */
18673 /* Expect an ellipsis. */
18674 ellipsis_p
18676 }
18677 /* It might also be `...' if the optional trailing `,' was
18678 omitted. */
18680 {
18681 /* Consume the `...' token. */
18683 /* And remember that we saw it. */
18685 }
18686 else
18689 /* Finish the parameter list. */
18694 }
18696 /* Parse a parameter-declaration-list.
18698 parameter-declaration-list:
18699 parameter-declaration
18700 parameter-declaration-list , parameter-declaration
18702 Returns a representation of the parameter-declaration-list, as for
18703 cp_parser_parameter_declaration_clause. However, the
18704 `void_list_node' is never appended to the list. Upon return,
18705 *IS_ERROR will be true iff an error occurred. */
18707 static tree
18709 {
18715 /* Assume all will go well. */
18717 /* The special considerations that apply to a function within an
18718 unbraced linkage specifications do not apply to the parameters
18719 to the function. */
18720 saved_in_unbraced_linkage_specification_p
18724 /* Look for more parameters. */
18726 {
18734 /* Parse the parameter. */
18735 parameter
18740 /* We don't know yet if the enclosing context is deprecated, so wait
18741 and warn in grokparms if appropriate. */
18745 {
18746 /* If a function parameter pack was specified and an implicit template
18747 parameter was introduced during cp_parser_parameter_declaration,
18748 change any implicit parameters introduced into packs. */
18752 {
18760 }
18764 PARM,
18767 }
18771 /* If a parse error occurred parsing the parameter declaration,
18772 then the entire parameter-declaration-list is erroneous. */
18774 {
18778 }
18788 {
18792 }
18794 /* Add the new parameter to the list. */
18798 /* Peek at the next token. */
18801 /* These are for Objective-C++ */
18804 /* The parameter-declaration-list is complete. */
18807 {
18810 /* Peek at the next token. */
18812 /* If it's an ellipsis, then the list is complete. */
18815 /* Otherwise, there must be more parameters. Consume the
18816 `,'. */
18818 /* When parsing something like:
18820 int i(float f, double d)
18822 we can tell after seeing the declaration for "f" that we
18823 are not looking at an initialization of a variable "i",
18824 but rather at the declaration of a function "i".
18826 Due to the fact that the parsing of template arguments
18827 (as specified to a template-id) requires backtracking we
18828 cannot use this technique when inside a template argument
18829 list. */
18833 /* However, a parameter-declaration of the form
18834 "float(f)" (which is a valid declaration of a
18835 parameter "f") can also be interpreted as an
18836 expression (the conversion of "f" to "float"). */
18839 }
18840 else
18841 {
18849 }
18850 }
18852 parser->in_unbraced_linkage_specification_p
18855 /* Reset implicit_template_scope if we are about to leave the function
18856 parameter list that introduced it. Note that for out-of-line member
18857 definitions, there will be one or more class scopes before we get to
18858 the template parameter scope. */
18862 {
18866 {
18869 }
18870 }
18873 }
18875 /* Parse a parameter declaration.
18877 parameter-declaration:
18878 decl-specifier-seq ... [opt] declarator
18879 decl-specifier-seq declarator = assignment-expression
18880 decl-specifier-seq ... [opt] abstract-declarator [opt]
18881 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18883 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18884 declares a template parameter. (In that case, a non-nested `>'
18885 token encountered during the parsing of the assignment-expression
18886 is not interpreted as a greater-than operator.)
18888 Returns a representation of the parameter, or NULL if an error
18889 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18890 true iff the declarator is of the form "(p)". */
18896 {
18898 cp_decl_specifier_seq decl_specifiers;
18900 tree default_argument;
18904 /* In a template parameter, `>' is not an operator.
18906 [temp.param]
18908 When parsing a default template-argument for a non-type
18909 template-parameter, the first non-nested `>' is taken as the end
18910 of the template parameter-list rather than a greater-than
18911 operator. */
18913 /* Type definitions may not appear in parameter types. */
18915 parser->type_definition_forbidden_message
18918 /* Parse the declaration-specifiers. */
18920 CP_PARSER_FLAGS_NONE,
18924 /* Complain about missing 'typename' or other invalid type names. */
18929 /* If an error occurred, there's no reason to attempt to parse the
18930 rest of the declaration. */
18932 {
18935 }
18937 /* Peek at the next token. */
18940 /* If the next token is a `)', `,', `=', `>', or `...', then there
18941 is no declarator. However, when variadic templates are enabled,
18942 there may be a declarator following `...'. */
18947 {
18951 }
18952 /* Otherwise, there should be a declarator. */
18953 else
18954 {
18958 /* After seeing a decl-specifier-seq, if the next token is not a
18959 "(", there is no possibility that the code is a valid
18960 expression. Therefore, if parsing tentatively, we commit at
18961 this point. */
18963 /* In an expression context, having seen:
18965 (int((char ...
18967 we cannot be sure whether we are looking at a
18968 function-type (taking a "char" as a parameter) or a cast
18969 of some object of type "char" to "int". */
18975 /* Parse the declarator. */
18978 CP_PARSER_DECLARATOR_EITHER,
18980 parenthesized_p,
18984 /* After the declarator, allow more attributes. */
18985 decl_specifiers.attributes
18988 }
18990 /* If the next token is an ellipsis, and we have not seen a
18991 declarator name, and the type of the declarator contains parameter
18992 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18993 a parameter pack expansion expression. Otherwise, leave the
18994 ellipsis for a C-style variadic function. */
18997 {
19008 {
19009 /* Consume the `...'. */
19013 /* Build a pack expansion type */
19016 else
19018 }
19019 }
19021 /* The restriction on defining new types applies only to the type
19022 of the parameter, not to the default argument. */
19025 /* If the next token is `=', then process a default argument. */
19027 {
19029 /* If we are defining a class, then the tokens that make up the
19030 default argument must be saved and processed later. */
19035 /* Outside of a class definition, we can just parse the
19036 assignment-expression. */
19037 else
19038 default_argument
19042 {
19045 else
19046 {
19048 "default arguments are only "
19051 }
19052 }
19056 {
19057 /* Find the name of the parameter pack. */
19064 template_parm_p
19070 else
19072 template_parm_p
19079 }
19080 }
19081 else
19085 declarator,
19086 default_argument);
19087 }
19089 /* Parse a default argument and return it.
19091 TEMPLATE_PARM_P is true if this is a default argument for a
19092 non-type template parameter. */
19093 static tree
19095 {
19101 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19102 set correctly. */
19105 /* Local variable names (and the `this' keyword) may not
19106 appear in a default argument. */
19109 /* Parse the assignment-expression. */
19114 /* The "this" pointer is not valid in a default argument. */
19116 {
19121 }
19122 default_argument
19124 /* Restore the "this" pointer. */
19126 {
19129 }
19138 }
19140 /* Parse a function-body.
19142 function-body:
19143 compound_statement */
19145 static void
19147 {
19149 }
19151 /* Parse a ctor-initializer-opt followed by a function-body. Return
19152 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19153 is true we are parsing a function-try-block. */
19155 static bool
19158 {
19166 /* Begin the function body. */
19168 /* Parse the optional ctor-initializer. */
19171 /* If we're parsing a constexpr constructor definition, we need
19172 to check that the constructor body is indeed empty. However,
19173 before we get to cp_parser_function_body lot of junk has been
19174 generated, so we can't just check that we have an empty block.
19175 Rather we take a snapshot of the outermost block, and check whether
19176 cp_parser_function_body changed its state. */
19178 {
19182 }
19183 /* Parse the function-body. */
19187 /* Finish the function body. */
19191 }
19193 /* Parse an initializer.
19195 initializer:
19196 = initializer-clause
19197 ( expression-list )
19199 Returns an expression representing the initializer. If no
19200 initializer is present, NULL_TREE is returned.
19202 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19203 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19204 set to TRUE if there is no initializer present. If there is an
19205 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19206 is set to true; otherwise it is set to false. */
19208 static tree
19211 {
19213 tree init;
19215 /* Peek at the next token. */
19218 /* Let our caller know whether or not this initializer was
19219 parenthesized. */
19221 /* Assume that the initializer is constant. */
19225 {
19226 /* Consume the `='. */
19228 /* Parse the initializer-clause. */
19230 }
19232 {
19237 non_constant_p);
19242 }
19244 {
19249 }
19250 else
19251 {
19252 /* Anything else is an error. */
19255 }
19258 }
19260 /* Parse an initializer-clause.
19262 initializer-clause:
19263 assignment-expression
19264 braced-init-list
19266 Returns an expression representing the initializer.
19268 If the `assignment-expression' production is used the value
19269 returned is simply a representation for the expression.
19271 Otherwise, calls cp_parser_braced_list. */
19273 static tree
19275 {
19276 tree initializer;
19278 /* Assume the expression is constant. */
19281 /* If it is not a `{', then we are looking at an
19282 assignment-expression. */
19284 {
19285 initializer
19288 non_constant_p);
19289 }
19290 else
19294 }
19296 /* Parse a brace-enclosed initializer list.
19298 braced-init-list:
19299 { initializer-list , [opt] }
19300 { }
19302 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19303 the elements of the initializer-list (or NULL, if the last
19304 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19305 NULL_TREE. There is no way to detect whether or not the optional
19306 trailing `,' was provided. NON_CONSTANT_P is as for
19307 cp_parser_initializer. */
19309 static tree
19311 {
19312 tree initializer;
19314 /* Consume the `{' token. */
19316 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19318 /* If it's not a `}', then there is a non-trivial initializer. */
19320 {
19321 /* Parse the initializer list. */
19324 /* A trailing `,' token is allowed. */
19327 }
19328 else
19330 /* Now, there should be a trailing `}'. */
19334 }
19336 /* Consume tokens up to, and including, the next non-nested closing `]'.
19337 Returns true iff we found a closing `]'. */
19339 static bool
19341 {
19345 {
19349 {
19352 /* If we've run out of tokens, then there is no closing `]'. */
19361 {
19364 }
19369 }
19371 /* Consume the token. */
19373 }
19374 }
19376 /* Return true if we are looking at an array-designator, false otherwise. */
19378 static bool
19380 {
19381 /* Consume the `['. */
19386 /* Skip tokens until the next token is a closing square bracket.
19387 If we find the closing `]', and the next token is a `=', then
19388 we are looking at an array designator. */
19389 bool array_designator_p
19393 /* Roll back the tokens we skipped. */
19397 }
19399 /* Parse an initializer-list.
19401 initializer-list:
19402 initializer-clause ... [opt]
19403 initializer-list , initializer-clause ... [opt]
19405 GNU Extension:
19407 initializer-list:
19408 designation initializer-clause ...[opt]
19409 initializer-list , designation initializer-clause ...[opt]
19411 designation:
19412 . identifier =
19413 identifier :
19414 [ constant-expression ] =
19416 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19417 for the initializer. If the INDEX of the elt is non-NULL, it is the
19418 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19419 as for cp_parser_initializer. */
19423 {
19426 /* Assume all of the expressions are constant. */
19429 /* Parse the rest of the list. */
19431 {
19433 tree designator;
19434 tree initializer;
19437 /* If the next token is an identifier and the following one is a
19438 colon, we are looking at the GNU designated-initializer
19439 syntax. */
19443 {
19444 /* Warn the user that they are using an extension. */
19447 /* Consume the identifier. */
19449 /* Consume the `:'. */
19451 }
19452 /* Also handle the C99 syntax, '. id ='. */
19457 {
19458 /* Warn the user that they are using an extension. */
19461 /* Consume the `.'. */
19463 /* Consume the identifier. */
19465 /* Consume the `='. */
19467 }
19468 /* Also handle C99 array designators, '[ const ] ='. */
19472 {
19473 /* In C++11, [ could start a lambda-introducer. */
19479 {
19482 }
19483 else
19484 {
19489 }
19495 }
19496 else
19499 /* Parse the initializer. */
19502 /* If any clause is non-constant, so is the entire initializer. */
19506 /* If we have an ellipsis, this is an initializer pack
19507 expansion. */
19509 {
19510 /* Consume the `...'. */
19513 /* Turn the initializer into an initializer expansion. */
19515 }
19517 /* Add it to the vector. */
19520 /* If the next token is not a comma, we have reached the end of
19521 the list. */
19525 /* Peek at the next token. */
19527 /* If the next token is a `}', then we're still done. An
19528 initializer-clause can have a trailing `,' after the
19529 initializer-list and before the closing `}'. */
19533 /* Consume the `,' token. */
19535 }
19538 }
19540 /* Classes [gram.class] */
19542 /* Parse a class-name.
19544 class-name:
19545 identifier
19546 template-id
19548 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19549 to indicate that names looked up in dependent types should be
19550 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19551 keyword has been used to indicate that the name that appears next
19552 is a template. TAG_TYPE indicates the explicit tag given before
19553 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19554 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19555 is the class being defined in a class-head.
19557 Returns the TYPE_DECL representing the class. */
19559 static tree
19567 {
19568 tree decl;
19569 tree scope;
19574 /* All class-names start with an identifier. */
19577 {
19580 }
19582 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19583 to a template-id, so we save it here. */
19588 /* Any name names a type if we're following the `typename' keyword
19589 in a qualified name where the enclosing scope is type-dependent. */
19592 /* Handle the common case (an identifier, but not a template-id)
19593 efficiently. */
19596 {
19600 /* Look for the identifier. */
19604 /* If the next token isn't an identifier, we are certainly not
19605 looking at a class-name. */
19608 /* If we know this is a type-name, there's no need to look it
19609 up. */
19612 else
19613 {
19614 tree ambiguous_decls;
19615 /* If we already know that this lookup is ambiguous, then
19616 we've already issued an error message; there's no reason
19617 to check again. */
19619 {
19622 }
19623 /* If the next token is a `::', then the name must be a type
19624 name.
19626 [basic.lookup.qual]
19628 During the lookup for a name preceding the :: scope
19629 resolution operator, object, function, and enumerator
19630 names are ignored. */
19633 /* Look up the name. */
19635 tag_type,
19638 check_dependency_p,
19642 {
19646 }
19647 }
19648 }
19649 else
19650 {
19651 /* Try a template-id. */
19653 check_dependency_p,
19654 tag_type,
19655 is_declaration);
19658 }
19662 /* If this is a typename, create a TYPENAME_TYPE. */
19664 {
19669 }
19673 /* Check to see that it is really the name of a class. */
19677 /* Situations like this:
19679 template <typename T> struct A {
19680 typename T::template X<int>::I i;
19681 };
19683 are problematic. Is `T::template X<int>' a class-name? The
19684 standard does not seem to be definitive, but there is no other
19685 valid interpretation of the following `::'. Therefore, those
19686 names are considered class-names. */
19687 {
19691 }
19695 /* In Objective-C 2.0, a classname followed by '.' starts a
19696 dot-syntax expression, and it's not a type-name. */
19708 }
19710 /* Parse a class-specifier.
19712 class-specifier:
19713 class-head { member-specification [opt] }
19715 Returns the TREE_TYPE representing the class. */
19717 static tree
19719 {
19720 tree type;
19734 /* Parse the class-head. */
19737 /* If the class-head was a semantic disaster, skip the entire body
19738 of the class. */
19740 {
19744 }
19746 /* Look for the `{'. */
19748 {
19751 }
19755 /* Issue an error message if type-definitions are forbidden here. */
19757 /* Remember that we are defining one more class. */
19759 /* Inside the class, surrounding template-parameter-lists do not
19760 apply. */
19761 saved_num_template_parameter_lists
19764 /* We are not in a function body. */
19767 /* Or in a loop. */
19770 /* Or in a switch. */
19773 /* We are not immediately inside an extern "lang" block. */
19774 saved_in_unbraced_linkage_specification_p
19778 /* Start the class. */
19780 {
19783 }
19787 /* If the type is erroneous, skip the entire body of the class. */
19789 else
19790 /* Parse the member-specification. */
19793 /* Look for the trailing `}'. */
19795 /* Look for trailing attributes to apply to this class. */
19803 /* We've finished a type definition. Check for the common syntax
19804 error of forgetting a semicolon after the definition. We need to
19805 be careful, as we can't just check for not-a-semicolon and be done
19806 with it; the user might have typed:
19808 class X { } c = ...;
19809 class X { } *p = ...;
19811 and so forth. Instead, enumerate all the possible tokens that
19812 might follow this production; if we don't see one of them, then
19813 complain and silently insert the semicolon. */
19814 {
19819 /* Don't try to parse c++11 attributes here. As per the
19820 grammar, that should be a task for
19821 cp_parser_decl_specifier_seq. */
19825 {
19836 /* While it's legal for type qualifiers and storage class
19837 specifiers to follow type definitions in the grammar, only
19838 compiler testsuites contain code like that. Assume that if
19839 we see such code, then what we're really seeing is a case
19840 like:
19842 class X { }
19843 const <type> var = ...;
19845 or
19847 class Y { }
19848 static <type> func (...) ...
19850 i.e. the qualifier or specifier applies to the next
19851 declaration. To do so, however, we need to look ahead one
19852 more token to see if *that* token is a type specifier.
19854 This code could be improved to handle:
19856 class Z { }
19857 static const <type> var = ...; */
19860 {
19863 /* Handling user-defined types here would be nice, but very
19864 tricky. */
19865 want_semicolon
19868 }
19872 }
19874 /* If we don't have a type, then something is very wrong and we
19875 shouldn't try to do anything clever. Likewise for not seeing the
19876 closing brace. */
19878 {
19879 cp_token_position prev
19890 else
19893 /* Unget one token and smash it to look as though we encountered
19894 a semicolon in the input stream. */
19899 }
19900 }
19902 /* If this class is not itself within the scope of another class,
19903 then we need to parse the bodies of all of the queued function
19904 definitions. Note that the queued functions defined in a class
19905 are not always processed immediately following the
19906 class-specifier for that class. Consider:
19908 struct A {
19909 struct B { void f() { sizeof (A); } };
19910 };
19912 If `f' were processed before the processing of `A' were
19913 completed, there would be no way to compute the size of `A'.
19914 Note that the nesting we are interested in here is lexical --
19915 not the semantic nesting given by TYPE_CONTEXT. In particular,
19916 for:
19918 struct A { struct B; };
19919 struct A::B { void f() { } };
19921 there is no need to delay the parsing of `A::B::f'. */
19923 {
19924 tree decl;
19931 /* In a first pass, parse default arguments to the functions.
19932 Then, in a second pass, parse the bodies of the functions.
19933 This two-phased approach handles cases like:
19935 struct S {
19936 void f() { g(); }
19937 void g(int i = 3);
19938 };
19940 */
19942 {
19944 /* If there are default arguments that have not yet been processed,
19945 take care of them now. */
19947 {
19952 }
19953 /* Make sure that any template parameters are in scope. */
19955 /* Parse the default argument expressions. */
19957 /* Remove any template parameters from the symbol table. */
19959 }
19961 /* Now parse any NSDMIs. */
19965 {
19967 {
19972 }
19975 }
19982 /* Now do some post-NSDMI bookkeeping. */
19988 /* Now parse the body of the functions. */
19990 {
19991 /* OpenMP UDRs need to be parsed before all other functions. */
19998 }
19999 else
20003 }
20004 else
20007 /* Put back any saved access checks. */
20010 /* Restore saved state. */
20014 parser->num_template_parameter_lists
20016 parser->in_unbraced_linkage_specification_p
20020 }
20022 static tree
20024 {
20025 tree ret;
20030 }
20032 /* Parse a class-head.
20034 class-head:
20035 class-key identifier [opt] base-clause [opt]
20036 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20037 class-key nested-name-specifier [opt] template-id
20038 base-clause [opt]
20040 class-virt-specifier:
20041 final
20043 GNU Extensions:
20044 class-key attributes identifier [opt] base-clause [opt]
20045 class-key attributes nested-name-specifier identifier base-clause [opt]
20046 class-key attributes nested-name-specifier [opt] template-id
20047 base-clause [opt]
20049 Upon return BASES is initialized to the list of base classes (or
20050 NULL, if there are none) in the same form returned by
20051 cp_parser_base_clause.
20053 Returns the TYPE of the indicated class. Sets
20054 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20055 involving a nested-name-specifier was used, and FALSE otherwise.
20057 Returns error_mark_node if this is not a class-head.
20059 Returns NULL_TREE if the class-head is syntactically valid, but
20060 semantically invalid in a way that means we should skip the entire
20061 body of the class. */
20063 static tree
20066 {
20067 tree nested_name_specifier;
20071 tree attributes;
20072 tree bases;
20082 /* Assume no nested-name-specifier will be present. */
20084 /* Assume no template parameter lists will be used in defining the
20085 type. */
20089 /* Look for the class-key. */
20094 /* Parse the attributes. */
20097 /* If the next token is `::', that is invalid -- but sometimes
20098 people do try to write:
20100 struct ::S {};
20102 Handle this gracefully by accepting the extra qualifier, and then
20103 issuing an error about it later if this really is a
20104 class-head. If it turns out just to be an elaborated type
20105 specifier, remain silent. */
20111 /* Determine the name of the class. Begin by looking for an
20112 optional nested-name-specifier. */
20114 nested_name_specifier
20120 /* If there was a nested-name-specifier, then there *must* be an
20121 identifier. */
20123 {
20125 /* Although the grammar says `identifier', it really means
20126 `class-name' or `template-name'. You are only allowed to
20127 define a class that has already been declared with this
20128 syntax.
20130 The proposed resolution for Core Issue 180 says that wherever
20131 you see `class T::X' you should treat `X' as a type-name.
20133 It is OK to define an inaccessible class; for example:
20135 class A { class B; };
20136 class A::B {};
20138 We do not know if we will see a class-name, or a
20139 template-name. We look for a class-name first, in case the
20140 class-name is a template-id; if we looked for the
20141 template-name first we would stop after the template-name. */
20146 class_type,
20150 /* If that didn't work, ignore the nested-name-specifier. */
20152 {
20158 }
20159 /* If we could not find a corresponding TYPE, treat this
20160 declaration like an unqualified declaration. */
20163 /* Otherwise, count the number of templates used in TYPE and its
20164 containing scopes. */
20165 else
20166 {
20167 tree scope;
20179 }
20180 }
20181 /* Otherwise, the identifier is optional. */
20182 else
20183 {
20184 /* We don't know whether what comes next is a template-id,
20185 an identifier, or nothing at all. */
20187 /* Check for a template-id. */
20192 class_key,
20194 /* If that didn't work, it could still be an identifier. */
20196 {
20198 {
20201 }
20202 else
20204 }
20205 else
20206 {
20209 }
20210 }
20215 {
20217 class_key,
20219 }
20222 /* If it's not a `:' or a `{' then we can't really be looking at a
20223 class-head, since a class-head only appears as part of a
20224 class-specifier. We have to detect this situation before calling
20225 xref_tag, since that has irreversible side-effects. */
20227 {
20231 }
20233 /* At this point, we're going ahead with the class-specifier, even
20234 if some other problem occurs. */
20237 {
20242 }
20243 /* Issue the error about the overly-qualified name now. */
20245 {
20250 }
20252 {
20257 }
20259 {
20260 tree scope;
20262 /* Reject typedef-names in class heads. */
20264 {
20267 type);
20270 }
20272 /* Figure out in what scope the declaration is being placed. */
20274 /* If that scope does not contain the scope in which the
20275 class was originally declared, the program is invalid. */
20277 {
20280 "declaration of %qD in namespace %qD which does not "
20283 else
20289 }
20290 /* [dcl.meaning]
20292 A declarator-id shall not be qualified except for the
20293 definition of a ... nested class outside of its class
20294 ... [or] the definition or explicit instantiation of a
20295 class member of a namespace outside of its namespace. */
20297 {
20302 }
20303 }
20304 /* An explicit-specialization must be preceded by "template <>". If
20305 it is not, try to recover gracefully. */
20309 {
20313 /* Take the same action that would have been taken by
20314 cp_parser_explicit_specialization. */
20317 }
20318 /* There must be no "return" statements between this point and the
20319 end of this function; set "type "to the correct return value and
20320 use "goto done;" to return. */
20321 /* Make sure that the right number of template parameters were
20322 present. */
20326 {
20327 /* If something went wrong, there is no point in even trying to
20328 process the class-definition. */
20331 }
20333 /* Look up the type. */
20335 {
20339 {
20343 }
20344 else
20345 {
20348 }
20351 }
20353 {
20354 tree class_type;
20356 /* Given:
20358 template <typename T> struct S { struct T };
20359 template <typename T> struct S<T>::T { };
20361 we will get a TYPENAME_TYPE when processing the definition of
20362 `S::T'. We need to resolve it to the actual type before we
20363 try to define it. */
20365 {
20370 else
20371 {
20374 }
20375 }
20379 {
20382 }
20385 /* Enter the scope indicated by the nested-name-specifier. */
20387 /* Get the canonical version of this type. */
20389 /* Call push_template_decl if it seems like we should be defining a
20390 template either from the template headers or the type we're
20391 defining, so that we diagnose both extra and missing headers. */
20395 {
20398 {
20401 }
20402 }
20406 }
20408 {
20409 /* If the class was unnamed, create a dummy name. */
20414 }
20416 /* Indicate whether this class was declared as a `class' or as a
20417 `struct'. */
20422 /* If this type was already complete, and we see another definition,
20423 that's an error. */
20425 {
20427 type);
20429 type);
20432 }
20437 {
20438 /* Apply attributes now, before any use of the class as a template
20439 argument in its base list. */
20442 }
20444 /* We will have entered the scope containing the class; the names of
20445 base classes should be looked up in that context. For example:
20447 struct A { struct B {}; struct C; };
20448 struct A::C : B {};
20450 is valid. */
20452 /* Get the list of base-classes, if there is one. */
20454 {
20455 /* PR59482: enter the class scope so that base-specifiers are looked
20456 up correctly. */
20460 /* PR59482: get out of the previously pushed class scope so that the
20461 subsequent pops pop the right thing. */
20464 }
20465 else
20468 /* If we're really defining a class, process the base classes.
20469 If they're invalid, fail. */
20474 done:
20475 /* Leave the scope given by the nested-name-specifier. We will
20476 enter the class scope itself while processing the members. */
20481 {
20484 }
20490 out:
20493 }
20495 /* Parse a class-key.
20497 class-key:
20498 class
20499 struct
20500 union
20502 Returns the kind of class-key specified, or none_type to indicate
20503 error. */
20505 static enum tag_types
20507 {
20511 /* Look for the class-key. */
20516 /* Check to see if the TOKEN is a class-key. */
20521 }
20523 /* Parse a type-parameter-key.
20525 type-parameter-key:
20526 class
20527 typename
20528 */
20530 static void
20532 {
20533 /* Look for the type-parameter-key. */
20537 {
20540 /* typename is not allowed in a template template parameter
20541 by the standard until C++1Z. */
20543 "ISO C++ forbids typename key in template template parameter;"
20545 }
20546 else
20550 }
20552 /* Parse an (optional) member-specification.
20554 member-specification:
20555 member-declaration member-specification [opt]
20556 access-specifier : member-specification [opt] */
20558 static void
20560 {
20562 {
20566 /* Peek at the next token. */
20568 /* If it's a `}', or EOF then we've seen all the members. */
20574 /* See if this token is a keyword. */
20577 {
20581 /* Consume the access-specifier. */
20583 /* Remember which access-specifier is active. */
20585 /* Look for the `:'. */
20590 /* Accept #pragmas at class scope. */
20592 {
20595 }
20597 /* Otherwise, the next construction must be a
20598 member-declaration. */
20600 }
20601 }
20602 }
20604 /* Parse a member-declaration.
20606 member-declaration:
20607 decl-specifier-seq [opt] member-declarator-list [opt] ;
20608 function-definition ; [opt]
20609 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20610 using-declaration
20611 template-declaration
20612 alias-declaration
20614 member-declarator-list:
20615 member-declarator
20616 member-declarator-list , member-declarator
20618 member-declarator:
20619 declarator pure-specifier [opt]
20620 declarator constant-initializer [opt]
20621 identifier [opt] : constant-expression
20623 GNU Extensions:
20625 member-declaration:
20626 __extension__ member-declaration
20628 member-declarator:
20629 declarator attributes [opt] pure-specifier [opt]
20630 declarator attributes [opt] constant-initializer [opt]
20631 identifier [opt] attributes [opt] : constant-expression
20633 C++0x Extensions:
20635 member-declaration:
20636 static_assert-declaration */
20638 static void
20640 {
20641 cp_decl_specifier_seq decl_specifiers;
20642 tree prefix_attributes;
20643 tree decl;
20652 /* Check for the `__extension__' keyword. */
20654 {
20655 /* Recurse. */
20657 /* Restore the old value of the PEDANTIC flag. */
20661 }
20663 /* Check for a template-declaration. */
20665 {
20666 /* An explicit specialization here is an error condition, and we
20667 expect the specialization handler to detect and report this. */
20671 else
20675 }
20677 /* Check for a using-declaration. */
20679 {
20681 {
20682 /* Parse the using-declaration. */
20686 }
20687 else
20688 {
20689 tree decl;
20693 /* Note that if we actually see the '=' token after the
20694 identifier, cp_parser_alias_declaration commits the
20695 tentative parse. In that case, we really expects an
20696 alias-declaration. Otherwise, we expect a using
20697 declaration. */
20698 alias_decl_expected =
20704 else
20708 }
20709 }
20711 /* Check for @defs. */
20713 {
20718 {
20723 }
20725 }
20727 /* If the next token is `static_assert' we have a static assertion. */
20729 {
20732 }
20739 /* Parse the decl-specifier-seq. */
20742 CP_PARSER_FLAGS_OPTIONAL,
20745 /* Check for an invalid type-name. */
20749 /* If there is no declarator, then the decl-specifier-seq should
20750 specify a type. */
20752 {
20753 /* If there was no decl-specifier-seq, and the next token is a
20754 `;', then we have something like:
20756 struct S { ; };
20758 [class.mem]
20760 Each member-declaration shall declare at least one member
20761 name of the class. */
20763 {
20767 }
20768 else
20769 {
20770 tree type;
20772 /* See if this declaration is a friend. */
20774 /* If there were decl-specifiers, check to see if there was
20775 a class-declaration. */
20778 /* Nested classes have already been added to the class, but
20779 a `friend' needs to be explicitly registered. */
20781 {
20782 /* If the `friend' keyword was present, the friend must
20783 be introduced with a class-key. */
20786 "in C++03 a class-key must be used "
20788 /* In this case:
20790 template <typename T> struct A {
20791 friend struct A<T>::B;
20792 };
20794 A<T>::B will be represented by a TYPENAME_TYPE, and
20795 therefore not recognized by check_tag_decl. */
20797 {
20801 }
20804 "friend declaration does not name a class or "
20806 else
20809 }
20810 /* If there is no TYPE, an error message will already have
20811 been issued. */
20813 ;
20814 /* An anonymous aggregate has to be handled specially; such
20815 a declaration really declares a data member (with a
20816 particular type), as opposed to a nested class. */
20818 {
20819 /* C++11 9.5/6. */
20822 "a storage class on an anonymous aggregate "
20825 /* Remove constructors and such from TYPE, now that we
20826 know it is an anonymous aggregate. */
20828 /* And make the corresponding data member. */
20831 /* Add it to the class. */
20833 }
20834 else
20835 cp_parser_check_access_in_redeclaration
20838 }
20839 }
20840 else
20841 {
20844 /* Clear attributes from the decl_specifiers but keep them
20845 around as prefix attributes that apply them to the entity
20846 being declared. */
20850 /* See if these declarations will be friends. */
20853 /* Keep going until we hit the `;' at the end of the
20854 declaration. */
20856 {
20858 tree first_attribute;
20860 /* Peek at the next token. */
20863 /* Check for a bitfield declaration. */
20868 {
20869 tree identifier;
20870 tree width;
20872 /* Get the name of the bitfield. Note that we cannot just
20873 check TOKEN here because it may have been invalidated by
20874 the call to cp_lexer_peek_nth_token above. */
20877 else
20880 /* Consume the `:' token. */
20882 /* Get the width of the bitfield. */
20883 width
20886 /* Look for attributes that apply to the bitfield. */
20888 /* Remember which attributes are prefix attributes and
20889 which are not. */
20891 /* Combine the attributes. */
20894 /* Create the bitfield declaration. */
20897 identifier,
20898 sfk_none)
20901 width,
20902 attributes);
20903 }
20904 else
20905 {
20907 tree initializer;
20908 tree asm_specification;
20911 /* Parse the declarator. */
20912 declarator
20917 friend_p);
20919 /* If something went wrong parsing the declarator, make sure
20920 that we at least consume some tokens. */
20922 {
20923 /* Skip to the end of the statement. */
20925 /* If the next token is not a semicolon, that is
20926 probably because we just skipped over the body of
20927 a function. So, we consume a semicolon if
20928 present, but do not issue an error message if it
20929 is not present. */
20931 CPP_SEMICOLON))
20934 }
20937 cp_parser_check_for_definition_in_return_type
20941 /* Look for an asm-specification. */
20943 /* Look for attributes that apply to the declaration. */
20945 /* Remember which attributes are prefix attributes and
20946 which are not. */
20948 /* Combine the attributes. */
20951 /* If it's an `=', then we have a constant-initializer or a
20952 pure-specifier. It is not correct to parse the
20953 initializer before registering the member declaration
20954 since the member declaration should be in scope while
20955 its initializer is processed. However, the rest of the
20956 front end does not yet provide an interface that allows
20957 us to handle this correctly. */
20959 {
20960 /* In [class.mem]:
20962 A pure-specifier shall be used only in the declaration of
20963 a virtual function.
20965 A member-declarator can contain a constant-initializer
20966 only if it declares a static member of integral or
20967 enumeration type.
20969 Therefore, if the DECLARATOR is for a function, we look
20970 for a pure-specifier; otherwise, we look for a
20971 constant-initializer. When we call `grokfield', it will
20972 perform more stringent semantics checks. */
20984 {
20986 /* Don't require a constant rvalue in C++11, since we
20987 might want a reference constant. We'll enforce
20988 constancy later. */
20990 /* Parse the initializer. */
20993 }
20994 else
20995 /* Parse the initializer. */
20997 }
21000 {
21004 else
21006 }
21007 /* Otherwise, there is no initializer. */
21008 else
21011 /* See if we are probably looking at a function
21012 definition. We are certainly not looking at a
21013 member-declarator. Calling `grokfield' has
21014 side-effects, so we must not do it unless we are sure
21015 that we are looking at a member-declarator. */
21018 {
21019 /* The grammar does not allow a pure-specifier to be
21020 used when a member function is defined. (It is
21021 possible that this fact is an oversight in the
21022 standard, since a pure function may be defined
21023 outside of the class-specifier. */
21029 declarator,
21030 attributes);
21033 /* If the member was not a friend, declare it here. */
21036 /* Peek at the next token. */
21038 /* If the next token is a semicolon, consume it. */
21042 }
21043 else
21046 /* Create the declaration. */
21051 {
21054 else
21056 }
21057 }
21061 /* Reset PREFIX_ATTRIBUTES. */
21067 /* If there is any qualification still in effect, clear it
21068 now; we will be starting fresh with the next declarator. */
21072 /* If it's a `,', then there are more declarators. */
21074 {
21077 {
21081 }
21082 }
21083 /* If the next token isn't a `;', then we have a parse error. */
21085 CPP_SEMICOLON))
21086 {
21087 /* The next token might be a ways away from where the
21088 actual semicolon is missing. Find the previous token
21089 and use that for our error position. */
21094 /* Assume that the user meant to provide a semicolon. If
21095 we were to cp_parser_skip_to_end_of_statement, we might
21096 skip to a semicolon inside a member function definition
21097 and issue nonsensical error messages. */
21099 }
21102 {
21103 /* Add DECL to the list of members. */
21105 /* Explicitly include, eg, NSDMIs, for better error
21106 recovery (c++/58650). */
21115 /* Add DECL to the queue of NSDMI to be parsed later. */
21117 }
21121 }
21122 }
21125 out:
21127 }
21129 /* Parse a pure-specifier.
21131 pure-specifier:
21132 = 0
21134 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21135 Otherwise, ERROR_MARK_NODE is returned. */
21137 static tree
21139 {
21142 /* Look for the `=' token. */
21145 /* Look for the `0' token. */
21154 /* Accept = default or = delete in c++0x mode. */
21157 {
21160 }
21162 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21164 {
21169 }
21171 {
21174 }
21177 }
21179 /* Parse a constant-initializer.
21181 constant-initializer:
21182 = constant-expression
21184 Returns a representation of the constant-expression. */
21186 static tree
21188 {
21189 /* Look for the `=' token. */
21193 /* It is invalid to write:
21195 struct S { static const int i = { 7 }; };
21197 */
21199 {
21202 /* Consume the opening brace. */
21204 /* Skip the initializer. */
21206 /* Look for the trailing `}'. */
21210 }
21213 }
21215 /* Derived classes [gram.class.derived] */
21217 /* Parse a base-clause.
21219 base-clause:
21220 : base-specifier-list
21222 base-specifier-list:
21223 base-specifier ... [opt]
21224 base-specifier-list , base-specifier ... [opt]
21226 Returns a TREE_LIST representing the base-classes, in the order in
21227 which they were declared. The representation of each node is as
21228 described by cp_parser_base_specifier.
21230 In the case that no bases are specified, this function will return
21231 NULL_TREE, not ERROR_MARK_NODE. */
21233 static tree
21235 {
21238 /* Look for the `:' that begins the list. */
21241 /* Scan the base-specifier-list. */
21243 {
21245 tree base;
21248 /* Look for the base-specifier. */
21250 /* Look for the (optional) ellipsis. */
21252 {
21253 /* Consume the `...'. */
21257 }
21259 /* Add BASE to the front of the list. */
21261 {
21263 /* Make this a pack expansion type. */
21267 {
21270 }
21271 }
21272 /* Peek at the next token. */
21274 /* If it's not a comma, then the list is complete. */
21277 /* Consume the `,'. */
21279 }
21281 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21282 base class had a qualified name. However, the next name that
21283 appears is certainly not qualified. */
21289 }
21291 /* Parse a base-specifier.
21293 base-specifier:
21294 :: [opt] nested-name-specifier [opt] class-name
21295 virtual access-specifier [opt] :: [opt] nested-name-specifier
21296 [opt] class-name
21297 access-specifier virtual [opt] :: [opt] nested-name-specifier
21298 [opt] class-name
21300 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21301 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21302 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21303 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21305 static tree
21307 {
21315 tree type;
21317 /* Process the optional `virtual' and `access-specifier'. */
21319 {
21320 /* Peek at the next token. */
21322 /* Process `virtual'. */
21324 {
21326 /* If `virtual' appears more than once, issue an error. */
21328 {
21332 }
21336 /* Consume the `virtual' token. */
21344 /* If more than one access specifier appears, issue an
21345 error. */
21348 {
21352 }
21356 /* Consume the access-specifier. */
21364 }
21365 }
21366 /* It is not uncommon to see programs mechanically, erroneously, use
21367 the 'typename' keyword to denote (dependent) qualified types
21368 as base classes. */
21370 {
21375 else
21377 "keyword %<typename%> not allowed in this context "
21380 }
21382 /* Look for the optional `::' operator. */
21384 /* Look for the nested-name-specifier. The simplest way to
21385 implement:
21387 [temp.res]
21389 The keyword `typename' is not permitted in a base-specifier or
21390 mem-initializer; in these contexts a qualified name that
21391 depends on a template-parameter is implicitly assumed to be a
21392 type name.
21394 is to pretend that we have seen the `typename' keyword at this
21395 point. */
21399 typename_type,
21401 /* If the base class is given by a qualified name, assume that names
21402 we see are type names or templates, as appropriate. */
21408 /* DR 950 allows decltype as a base-specifier. */
21410 else
21411 {
21412 /* Otherwise, look for the class-name. */
21414 class_scope_p,
21415 template_p,
21416 typename_type,
21421 }
21427 }
21429 /* Exception handling [gram.exception] */
21431 /* Parse an (optional) noexcept-specification.
21433 noexcept-specification:
21434 noexcept ( constant-expression ) [opt]
21436 If no noexcept-specification is present, returns NULL_TREE.
21437 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21438 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21439 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21440 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21441 in which case a boolean condition is returned instead. */
21443 static tree
21448 {
21452 /* Peek at the next token. */
21455 /* Is it a noexcept-specification? */
21457 {
21458 tree expr;
21462 {
21466 {
21467 /* Types may not be defined in an exception-specification. */
21469 parser->type_definition_forbidden_message
21474 /* Restore the saved message. */
21476 }
21477 else
21478 {
21481 }
21484 }
21485 else
21486 {
21490 }
21492 /* We cannot build a noexcept-spec right away because this will check
21493 that expr is a constexpr. */
21496 else
21498 }
21499 else
21501 }
21503 /* Parse an (optional) exception-specification.
21505 exception-specification:
21506 throw ( type-id-list [opt] )
21508 Returns a TREE_LIST representing the exception-specification. The
21509 TREE_VALUE of each node is a type. */
21511 static tree
21513 {
21515 tree type_id_list;
21518 /* Peek at the next token. */
21521 /* Is it a noexcept-specification? */
21527 /* If it's not `throw', then there's no exception-specification. */
21531 #if 0
21532 /* Enable this once a lot of code has transitioned to noexcept? */
21536 #endif
21538 /* Consume the `throw'. */
21541 /* Look for the `('. */
21544 /* Peek at the next token. */
21546 /* If it's not a `)', then there is a type-id-list. */
21548 {
21549 /* Types may not be defined in an exception-specification. */
21551 parser->type_definition_forbidden_message
21553 /* Parse the type-id-list. */
21555 /* Restore the saved message. */
21557 }
21558 else
21561 /* Look for the `)'. */
21565 }
21567 /* Parse an (optional) type-id-list.
21569 type-id-list:
21570 type-id ... [opt]
21571 type-id-list , type-id ... [opt]
21573 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21574 in the order that the types were presented. */
21576 static tree
21578 {
21582 {
21584 tree type;
21586 /* Get the next type-id. */
21588 /* Parse the optional ellipsis. */
21590 {
21591 /* Consume the `...'. */
21594 /* Turn the type into a pack expansion expression. */
21596 }
21597 /* Add it to the list. */
21599 /* Peek at the next token. */
21601 /* If it is not a `,', we are done. */
21604 /* Consume the `,'. */
21606 }
21609 }
21611 /* Parse a try-block.
21613 try-block:
21614 try compound-statement handler-seq */
21616 static tree
21618 {
21619 tree try_block;
21633 }
21635 /* Parse a function-try-block.
21637 function-try-block:
21638 try ctor-initializer [opt] function-body handler-seq */
21640 static bool
21642 {
21643 tree compound_stmt;
21644 tree try_block;
21647 /* Look for the `try' keyword. */
21650 /* Let the rest of the front end know where we are. */
21652 /* Parse the function-body. */
21653 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21655 /* We're done with the `try' part. */
21657 /* Parse the handlers. */
21659 /* We're done with the handlers. */
21663 }
21665 /* Parse a handler-seq.
21667 handler-seq:
21668 handler handler-seq [opt] */
21670 static void
21672 {
21674 {
21677 /* Parse the handler. */
21679 /* Peek at the next token. */
21681 /* If it's not `catch' then there are no more handlers. */
21684 }
21685 }
21687 /* Parse a handler.
21689 handler:
21690 catch ( exception-declaration ) compound-statement */
21692 static void
21694 {
21695 tree handler;
21696 tree declaration;
21706 }
21708 /* Parse an exception-declaration.
21710 exception-declaration:
21711 type-specifier-seq declarator
21712 type-specifier-seq abstract-declarator
21713 type-specifier-seq
21714 ...
21716 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21717 ellipsis variant is used. */
21719 static tree
21721 {
21722 cp_decl_specifier_seq type_specifiers;
21726 /* If it's an ellipsis, it's easy to handle. */
21728 {
21729 /* Consume the `...' token. */
21732 }
21734 /* Types may not be defined in exception-declarations. */
21736 parser->type_definition_forbidden_message
21739 /* Parse the type-specifier-seq. */
21743 /* If it's a `)', then there is no declarator. */
21746 else
21753 /* Restore the saved message. */
21760 }
21762 /* Parse a throw-expression.
21764 throw-expression:
21765 throw assignment-expression [opt]
21767 Returns a THROW_EXPR representing the throw-expression. */
21769 static tree
21771 {
21772 tree expression;
21777 /* Figure out whether or not there is an assignment-expression
21778 following the "throw" keyword. */
21786 else
21790 }
21792 /* GNU Extensions */
21794 /* Parse an (optional) asm-specification.
21796 asm-specification:
21797 asm ( string-literal )
21799 If the asm-specification is present, returns a STRING_CST
21800 corresponding to the string-literal. Otherwise, returns
21801 NULL_TREE. */
21803 static tree
21805 {
21807 tree asm_specification;
21809 /* Peek at the next token. */
21811 /* If the next token isn't the `asm' keyword, then there's no
21812 asm-specification. */
21816 /* Consume the `asm' token. */
21818 /* Look for the `('. */
21821 /* Look for the string-literal. */
21824 /* Look for the `)'. */
21828 }
21830 /* Parse an asm-operand-list.
21832 asm-operand-list:
21833 asm-operand
21834 asm-operand-list , asm-operand
21836 asm-operand:
21837 string-literal ( expression )
21838 [ string-literal ] string-literal ( expression )
21840 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21841 each node is the expression. The TREE_PURPOSE is itself a
21842 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21843 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21844 is a STRING_CST for the string literal before the parenthesis. Returns
21845 ERROR_MARK_NODE if any of the operands are invalid. */
21847 static tree
21849 {
21854 {
21855 tree string_literal;
21856 tree expression;
21857 tree name;
21860 {
21861 /* Consume the `[' token. */
21863 /* Read the operand name. */
21868 /* Look for the closing `]'. */
21870 }
21871 else
21873 /* Look for the string-literal. */
21876 /* Look for the `('. */
21878 /* Parse the expression. */
21880 /* Look for the `)'. */
21888 /* Add this operand to the list. */
21890 expression,
21891 asm_operands);
21892 /* If the next token is not a `,', there are no more
21893 operands. */
21896 /* Consume the `,'. */
21898 }
21901 }
21903 /* Parse an asm-clobber-list.
21905 asm-clobber-list:
21906 string-literal
21907 asm-clobber-list , string-literal
21909 Returns a TREE_LIST, indicating the clobbers in the order that they
21910 appeared. The TREE_VALUE of each node is a STRING_CST. */
21912 static tree
21914 {
21918 {
21919 tree string_literal;
21921 /* Look for the string literal. */
21923 /* Add it to the list. */
21925 /* If the next token is not a `,', then the list is
21926 complete. */
21929 /* Consume the `,' token. */
21931 }
21934 }
21936 /* Parse an asm-label-list.
21938 asm-label-list:
21939 identifier
21940 asm-label-list , identifier
21942 Returns a TREE_LIST, indicating the labels in the order that they
21943 appeared. The TREE_VALUE of each node is a label. */
21945 static tree
21947 {
21951 {
21954 /* Look for the identifier. */
21957 {
21960 {
21966 }
21967 }
21968 /* If the next token is not a `,', then the list is
21969 complete. */
21972 /* Consume the `,' token. */
21974 }
21977 }
21979 /* Return TRUE iff the next tokens in the stream are possibly the
21980 beginning of a GNU extension attribute. */
21982 static bool
21984 {
21986 }
21988 /* Return TRUE iff the next tokens in the stream are possibly the
21989 beginning of a standard C++-11 attribute specifier. */
21991 static bool
21993 {
21995 }
21997 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21998 beginning of a standard C++-11 attribute specifier. */
22000 static bool
22002 {
22010 }
22012 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22013 beginning of a GNU extension attribute. */
22015 static bool
22017 {
22021 }
22023 /* Return true iff the next tokens can be the beginning of either a
22024 GNU attribute list, or a standard C++11 attribute sequence. */
22026 static bool
22028 {
22031 }
22033 /* Return true iff the next Nth tokens can be the beginning of either
22034 a GNU attribute list, or a standard C++11 attribute sequence. */
22036 static bool
22038 {
22041 }
22043 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22044 of GNU attributes, or return NULL. */
22046 static tree
22048 {
22052 }
22054 #define CILK_SIMD_FN_CLAUSE_MASK \
22055 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22056 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22057 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22058 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22059 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22061 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22062 vector [(<clauses>)] */
22064 static void
22066 {
22070 {
22075 }
22078 {
22081 paren_scope++;
22082 }
22084 {
22087 paren_scope++;
22089 paren_scope--;
22090 /* Do not push the last ')' */
22093 }
22102 }
22104 /* Parse an (optional) series of attributes.
22106 attributes:
22107 attributes attribute
22109 attribute:
22110 __attribute__ (( attribute-list [opt] ))
22112 The return value is as for cp_parser_gnu_attribute_list. */
22114 static tree
22116 {
22120 {
22122 tree attribute_list;
22125 /* Peek at the next token. */
22127 /* If it's not `__attribute__', then we're done. */
22131 /* Consume the `__attribute__' keyword. */
22133 /* Look for the two `(' tokens. */
22137 /* Peek at the next token. */
22140 /* Parse the attribute-list. */
22142 else
22143 /* If the next token is a `)', then there is no attribute
22144 list. */
22147 /* Look for the two `)' tokens. */
22155 /* Add these new attributes to the list. */
22157 }
22160 }
22162 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22163 "__vector" or "__vector__." */
22167 {
22171 }
22173 /* Parse a GNU attribute-list.
22175 attribute-list:
22176 attribute
22177 attribute-list , attribute
22179 attribute:
22180 identifier
22181 identifier ( identifier )
22182 identifier ( identifier , expression-list )
22183 identifier ( expression-list )
22185 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22186 to an attribute. The TREE_PURPOSE of each node is the identifier
22187 indicating which attribute is in use. The TREE_VALUE represents
22188 the arguments, if any. */
22190 static tree
22192 {
22198 {
22200 tree identifier;
22201 tree attribute;
22203 /* Look for the identifier. We also allow keywords here; for
22204 example `__attribute__ ((const))' is legal. */
22208 {
22211 /* Consume the token, but save it since we need it for the
22212 SIMD enabled function parsing. */
22215 /* Save away the identifier that indicates which attribute
22216 this is. */
22218 /* For keywords, use the canonical spelling, not the
22219 parsed identifier. */
22225 /* Peek at the next token. */
22227 /* If it's an `(', then parse the attribute arguments. */
22229 {
22234 {
22237 }
22238 else
22239 vec = cp_parser_parenthesized_expression_list
22245 else
22246 {
22249 }
22250 /* Save the arguments away. */
22252 }
22254 {
22257 }
22260 {
22261 /* Add this attribute to the list. */
22264 }
22267 }
22268 /* Now, look for more attributes. If the next token isn't a
22269 `,', we're done. */
22273 /* Consume the comma and keep going. */
22275 }
22278 /* We built up the list in reverse order. */
22280 }
22282 /* Parse a standard C++11 attribute.
22284 The returned representation is a TREE_LIST which TREE_PURPOSE is
22285 the scoped name of the attribute, and the TREE_VALUE is its
22286 arguments list.
22288 Note that the scoped name of the attribute is itself a TREE_LIST
22289 which TREE_PURPOSE is the namespace of the attribute, and
22290 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22291 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22292 and which TREE_PURPOSE is directly the attribute name.
22294 Clients of the attribute code should use get_attribute_namespace
22295 and get_attribute_name to get the actual namespace and name of
22296 attributes, regardless of their being GNU or C++11 attributes.
22298 attribute:
22299 attribute-token attribute-argument-clause [opt]
22301 attribute-token:
22302 identifier
22303 attribute-scoped-token
22305 attribute-scoped-token:
22306 attribute-namespace :: identifier
22308 attribute-namespace:
22309 identifier
22311 attribute-argument-clause:
22312 ( balanced-token-seq )
22314 balanced-token-seq:
22315 balanced-token [opt]
22316 balanced-token-seq balanced-token
22318 balanced-token:
22319 ( balanced-token-seq )
22320 [ balanced-token-seq ]
22321 { balanced-token-seq }. */
22323 static tree
22325 {
22329 /* First, parse name of the the attribute, a.k.a
22330 attribute-token. */
22347 {
22348 /* We are seeing a scoped attribute token. */
22358 else
22359 {
22363 }
22365 NULL_TREE);
22367 }
22368 else
22369 {
22371 NULL_TREE);
22372 /* C++11 noreturn attribute is equivalent to GNU's. */
22375 /* C++14 deprecated attribute is equivalent to GNU's. */
22377 {
22380 "%<deprecated%> is a C++14 feature;"
22383 }
22384 }
22386 /* Now parse the optional argument clause of the attribute. */
22391 {
22397 /* A GNU attribute that takes an identifier in parameter. */
22400 vec = cp_parser_parenthesized_expression_list
22406 else
22407 {
22410 }
22414 else
22416 }
22419 }
22421 /* Parse a list of standard C++-11 attributes.
22423 attribute-list:
22424 attribute [opt]
22425 attribute-list , attribute[opt]
22426 attribute ...
22427 attribute-list , attribute ...
22428 */
22430 static tree
22432 {
22437 {
22442 {
22445 }
22450 }
22453 }
22455 /* Parse a standard C++-11 attribute specifier.
22457 attribute-specifier:
22458 [ [ attribute-list ] ]
22459 alignment-specifier
22461 alignment-specifier:
22462 alignas ( type-id ... [opt] )
22463 alignas ( alignment-expression ... [opt] ). */
22465 static tree
22467 {
22473 {
22482 else
22483 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22484 when we are sure that we have actually parsed them. */
22486 }
22487 else
22488 {
22489 tree alignas_expr;
22491 /* Look for an alignment-specifier. */
22503 {
22506 }
22512 {
22516 alignas_expr =
22523 }
22526 {
22529 }
22533 /* Build the C++-11 representation of an 'aligned'
22534 attribute. */
22535 attributes =
22539 }
22542 }
22544 /* Parse a standard C++-11 attribute-specifier-seq.
22546 attribute-specifier-seq:
22547 attribute-specifier-seq [opt] attribute-specifier
22548 */
22550 static tree
22552 {
22556 {
22565 }
22569 }
22571 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22572 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22573 current value of the PEDANTIC flag, regardless of whether or not
22574 the `__extension__' keyword is present. The caller is responsible
22575 for restoring the value of the PEDANTIC flag. */
22577 static bool
22579 {
22580 /* Save the old value of the PEDANTIC flag. */
22584 {
22585 /* Consume the `__extension__' token. */
22587 /* We're not being pedantic while the `__extension__' keyword is
22588 in effect. */
22592 }
22595 }
22597 /* Parse a label declaration.
22599 label-declaration:
22600 __label__ label-declarator-seq ;
22602 label-declarator-seq:
22603 identifier , label-declarator-seq
22604 identifier */
22606 static void
22608 {
22609 /* Look for the `__label__' keyword. */
22613 {
22614 tree identifier;
22616 /* Look for an identifier. */
22618 /* If we failed, stop. */
22621 /* Declare it as a label. */
22623 /* If the next token is a `;', stop. */
22626 /* Look for the `,' separating the label declarations. */
22628 }
22630 /* Look for the final `;'. */
22632 }
22634 /* Support Functions */
22636 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22637 NAME should have one of the representations used for an
22638 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22639 is returned. If PARSER->SCOPE is a dependent type, then a
22640 SCOPE_REF is returned.
22642 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22643 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22644 was formed. Abstractly, such entities should not be passed to this
22645 function, because they do not need to be looked up, but it is
22646 simpler to check for this special case here, rather than at the
22647 call-sites.
22649 In cases not explicitly covered above, this function returns a
22650 DECL, OVERLOAD, or baselink representing the result of the lookup.
22651 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22652 is returned.
22654 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22655 (e.g., "struct") that was used. In that case bindings that do not
22656 refer to types are ignored.
22658 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22659 ignored.
22661 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22662 are ignored.
22664 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22665 types.
22667 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22668 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22669 NULL_TREE otherwise. */
22671 static tree
22678 location_t name_location)
22679 {
22680 tree decl;
22683 /* Assume that the lookup will be unambiguous. */
22687 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22688 no longer valid. Note that if we are parsing tentatively, and
22689 the parse fails, OBJECT_TYPE will be automatically restored. */
22695 /* A template-id has already been resolved; there is no lookup to
22696 do. */
22700 {
22704 }
22706 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22707 it should already have been checked to make sure that the name
22708 used matches the type being destroyed. */
22710 {
22711 tree type;
22713 /* Figure out to which type this destructor applies. */
22718 else
22720 /* If that's not a class type, there is no destructor. */
22727 /* If it was a class type, return the destructor. */
22729 }
22731 /* By this point, the NAME should be an ordinary identifier. If
22732 the id-expression was a qualified name, the qualifying scope is
22733 stored in PARSER->SCOPE at this point. */
22736 /* Perform the lookup. */
22738 {
22744 /* If the SCOPE is dependent, the lookup must be deferred until
22745 the template is instantiated -- unless we are explicitly
22746 looking up names in uninstantiated templates. Even then, we
22747 cannot look up the name if the scope is not a class type; it
22748 might, for example, be a template type parameter. */
22753 /* Defer lookup. */
22755 else
22756 {
22759 /* If PARSER->SCOPE is a dependent type, then it must be a
22760 class type, and we must not be checking dependencies;
22761 otherwise, we would have processed this lookup above. So
22762 that PARSER->SCOPE is not considered a dependent base by
22763 lookup_member, we must enter the scope here. */
22767 /* If the PARSER->SCOPE is a template specialization, it
22768 may be instantiated during name lookup. In that case,
22769 errors may be issued. Even if we rollback the current
22770 tentative parse, those errors are valid. */
22775 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22776 lookup result and the nested-name-specifier nominates a class C:
22777 * if the name specified after the nested-name-specifier, when
22778 looked up in C, is the injected-class-name of C (Clause 9), or
22779 * if the name specified after the nested-name-specifier is the
22780 same as the identifier or the simple-template-id's template-
22781 name in the last component of the nested-name-specifier,
22782 the name is instead considered to name the constructor of
22783 class C. [ Note: for example, the constructor is not an
22784 acceptable lookup result in an elaborated-type-specifier so
22785 the constructor would not be used in place of the
22786 injected-class-name. --end note ] Such a constructor name
22787 shall be used only in the declarator-id of a declaration that
22788 names a constructor or in a using-declaration. */
22796 /* If we have a single function from a using decl, pull it out. */
22803 }
22805 /* If the scope is a dependent type and either we deferred lookup or
22806 we did lookup but didn't find the name, rememeber the name. */
22809 {
22811 {
22812 tree type;
22814 /* The resolution to Core Issue 180 says that `struct
22815 A::B' should be considered a type-name, even if `A'
22816 is dependent. */
22821 }
22825 CPP_CLOSE_PAREN)))
22829 else
22832 is_template);
22833 }
22836 }
22838 {
22839 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22840 OBJECT_TYPE is not a class. */
22842 /* If the OBJECT_TYPE is a template specialization, it may
22843 be instantiated during name lookup. In that case, errors
22844 may be issued. Even if we rollback the current tentative
22845 parse, those errors are valid. */
22847 name,
22850 tf_warning_or_error);
22851 else
22855 /* Look it up in the enclosing context. */
22861 }
22862 else
22863 {
22869 }
22871 /* If the lookup failed, let our caller know. */
22875 /* Pull out the template from an injected-class-name (or multiple). */
22879 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22881 {
22884 /* The error message we have to print is too complicated for
22885 cp_parser_error, so we incorporate its actions directly. */
22887 {
22889 name);
22891 }
22893 }
22901 /* If we have resolved the name of a member declaration, check to
22902 see if the declaration is accessible. When the name resolves to
22903 set of overloaded functions, accessibility is checked when
22904 overload resolution is done.
22906 During an explicit instantiation, access is not checked at all,
22907 as per [temp.explicit]. */
22914 }
22916 /* Like cp_parser_lookup_name, but for use in the typical case where
22917 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22918 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22920 static tree
22922 {
22924 none_type,
22929 location);
22930 }
22932 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22933 the current context, return the TYPE_DECL. If TAG_NAME_P is
22934 true, the DECL indicates the class being defined in a class-head,
22935 or declared in an elaborated-type-specifier.
22937 Otherwise, return DECL. */
22939 static tree
22941 {
22942 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22943 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22945 struct A {
22946 template <typename T> struct B;
22947 };
22949 template <typename T> struct A::B {};
22951 Similarly, in an elaborated-type-specifier:
22953 namespace N { struct X{}; }
22955 struct A {
22956 template <typename T> friend struct N::X;
22957 };
22959 However, if the DECL refers to a class type, and we are in
22960 the scope of the class, then the name lookup automatically
22961 finds the TYPE_DECL created by build_self_reference rather
22962 than a TEMPLATE_DECL. For example, in:
22964 template <class T> struct S {
22965 S s;
22966 };
22968 there is no need to handle such case. */
22974 }
22976 /* If too many, or too few, template-parameter lists apply to the
22977 declarator, issue an error message. Returns TRUE if all went well,
22978 and FALSE otherwise. */
22980 static bool
22983 location_t declarator_location)
22984 {
22986 {
22988 {
22996 /* If the DECLARATOR has the form `X<y>' then it uses one
22997 additional level of template parameters. */
23000 return cp_parser_check_template_parameters
23002 }
23017 }
23019 }
23021 /* NUM_TEMPLATES were used in the current declaration. If that is
23022 invalid, return FALSE and issue an error messages. Otherwise,
23023 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23024 declarator and we can print more accurate diagnostics. */
23026 static bool
23029 location_t location,
23031 {
23032 /* If there are the same number of template classes and parameter
23033 lists, that's OK. */
23036 /* If there are more, but only one more, then we are referring to a
23037 member template. That's OK too. */
23040 /* If there are more template classes than parameter lists, we have
23041 something like:
23043 template <class T> void S<T>::R<T>::f (); */
23045 {
23055 else
23058 }
23059 /* Otherwise, there are too many template parameter lists. We have
23060 something like:
23062 template <class T> template <class U> void S::f(); */
23065 }
23067 /* Parse an optional `::' token indicating that the following name is
23068 from the global namespace. If so, PARSER->SCOPE is set to the
23069 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23070 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23071 Returns the new value of PARSER->SCOPE, if the `::' token is
23072 present, and NULL_TREE otherwise. */
23074 static tree
23076 {
23079 /* Peek at the next token. */
23081 /* If we're looking at a `::' token then we're starting from the
23082 global namespace, not our current location. */
23084 {
23085 /* Consume the `::' token. */
23087 /* Set the SCOPE so that we know where to start the lookup. */
23093 }
23095 {
23099 }
23102 }
23104 /* Returns TRUE if the upcoming token sequence is the start of a
23105 constructor declarator. If FRIEND_P is true, the declarator is
23106 preceded by the `friend' specifier. */
23108 static bool
23110 {
23113 tree nested_name_specifier;
23116 /* The common case is that this is not a constructor declarator, so
23117 try to avoid doing lots of work if at all possible. It's not
23118 valid declare a constructor at function scope. */
23121 /* And only certain tokens can begin a constructor declarator. */
23129 /* Parse tentatively; we are going to roll back all of the tokens
23130 consumed here. */
23132 /* Assume that we are looking at a constructor declarator. */
23135 /* Look for the optional `::' operator. */
23138 /* Look for the nested-name-specifier. */
23139 nested_name_specifier
23150 /* Outside of a class-specifier, there must be a
23151 nested-name-specifier. */
23157 /* If we have a class scope, this is easy; DR 147 says that S::S always
23158 names the constructor, and no other qualified name could. */
23161 {
23171 }
23172 /* If we still think that this might be a constructor-declarator,
23173 look for a class-name. */
23175 {
23176 /* If we have:
23178 template <typename T> struct S {
23179 S();
23180 };
23182 we must recognize that the nested `S' names a class. */
23183 tree type_decl;
23187 none_type,
23191 /* If there was no class-name, then this is not a constructor.
23192 Otherwise, if we are in a class-specifier and we aren't
23193 handling a friend declaration, check that its type matches
23194 current_class_type (c++/38313). Note: error_mark_node
23195 is left alone for error recovery purposes. */
23197 && (outside_class_specifier_p
23202 /* If we're still considering a constructor, we have to see a `(',
23203 to begin the parameter-declaration-clause, followed by either a
23204 `)', an `...', or a decl-specifier. We need to check for a
23205 type-specifier to avoid being fooled into thinking that:
23207 S (f) (int);
23209 is a constructor. (It is actually a function named `f' that
23210 takes one parameter (of type `int') and returns a value of type
23211 `S'. */
23219 /* A parameter declaration begins with a decl-specifier,
23220 which is either the "attribute" keyword, a storage class
23221 specifier, or (usually) a type-specifier. */
23223 {
23224 tree type;
23228 /* Names appearing in the type-specifier should be looked up
23229 in the scope of the class. */
23232 else
23233 {
23236 {
23240 {
23243 }
23244 }
23246 }
23248 /* Inside the constructor parameter list, surrounding
23249 template-parameter-lists do not apply. */
23250 saved_num_template_parameter_lists
23254 /* Look for the type-specifier. */
23256 CP_PARSER_FLAGS_NONE,
23262 parser->num_template_parameter_lists
23265 /* Leave the scope of the class. */
23270 }
23271 }
23273 /* We did not really want to consume any tokens. */
23277 }
23279 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23280 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23281 they must be performed once we are in the scope of the function.
23283 Returns the function defined. */
23285 static tree
23286 cp_parser_function_definition_from_specifiers_and_declarator
23289 tree attributes,
23291 {
23292 tree fn;
23295 /* Begin the function-definition. */
23298 /* The things we're about to see are not directly qualified by any
23299 template headers we've seen thus far. */
23302 /* If there were names looked up in the decl-specifier-seq that we
23303 did not check, check them now. We must wait until we are in the
23304 scope of the function to perform the checks, since the function
23305 might be a friend. */
23309 {
23312 }
23315 {
23316 /* Skip the entire function. */
23319 }
23321 {
23322 /* Seen already, skip it. An error message has already been output. */
23326 /* If this is a function from a class, pop the nested class. */
23329 }
23330 else
23331 {
23332 timevar_id_t tv;
23335 else
23341 }
23344 }
23346 /* Parse the part of a function-definition that follows the
23347 declarator. INLINE_P is TRUE iff this function is an inline
23348 function defined within a class-specifier.
23350 Returns the function defined. */
23352 static tree
23355 {
23356 tree fn;
23362 bool fully_implicit_function_template_p
23365 tree implicit_template_parms
23368 cp_binding_level* implicit_template_scope
23374 /* If the next token is `return', then the code may be trying to
23375 make use of the "named return value" extension that G++ used to
23376 support. */
23379 {
23380 /* Consume the `return' keyword. */
23382 /* Look for the identifier that indicates what value is to be
23383 returned. */
23385 /* Issue an error message. */
23388 /* Skip tokens until we reach the start of the function body. */
23390 {
23397 }
23398 }
23399 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23400 anything declared inside `f'. */
23401 saved_in_unbraced_linkage_specification_p
23404 /* Inside the function, surrounding template-parameter-lists do not
23405 apply. */
23406 saved_num_template_parameter_lists
23412 /* If the next token is `try', `__transaction_atomic', or
23413 `__transaction_relaxed`, then we are looking at either function-try-block
23414 or function-transaction-block. Note that all of these include the
23415 function-body. */
23418 RID_TRANSACTION_ATOMIC);
23420 RID_TRANSACTION_RELAXED))
23422 RID_TRANSACTION_RELAXED);
23425 else
23426 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23431 /* Finish the function. */
23434 /* Generate code for it, if necessary. */
23436 /* Restore the saved values. */
23437 parser->in_unbraced_linkage_specification_p
23439 parser->num_template_parameter_lists
23443 parser->fully_implicit_function_template_p
23445 parser->implicit_template_parms
23447 parser->implicit_template_scope
23454 }
23456 /* Parse a template-declaration, assuming that the `export' (and
23457 `extern') keywords, if present, has already been scanned. MEMBER_P
23458 is as for cp_parser_template_declaration. */
23460 static void
23462 {
23465 tree parameter_list;
23470 /* Look for the `template' keyword. */
23475 /* And the `<'. */
23479 {
23480 /* 14.5.2.2 [temp.mem]
23482 A local class shall not have member templates. */
23487 }
23488 /* [temp]
23490 A template ... shall not have C linkage. */
23492 {
23494 /* Give it C++ linkage to avoid confusing other parts of the
23495 front end. */
23498 }
23499 else
23502 /* We cannot perform access checks on the template parameter
23503 declarations until we know what is being declared, just as we
23504 cannot check the decl-specifier list. */
23507 /* If the next token is `>', then we have an invalid
23508 specialization. Rather than complain about an invalid template
23509 parameter, issue an error message here. */
23511 {
23515 }
23516 else
23517 {
23518 /* Parse the template parameters. */
23520 }
23522 /* Get the deferred access checks from the parameter list. These
23523 will be checked once we know what is being declared, as for a
23524 member template the checks must be performed in the scope of the
23525 class containing the member. */
23528 /* Look for the `>'. */
23530 /* We just processed one more parameter list. */
23532 /* If the next token is `template', there are more template
23533 parameters. */
23535 RID_TEMPLATE))
23540 else
23541 {
23542 /* There are no access checks when parsing a template, as we do not
23543 know if a specialization will be a friend. */
23547 checks,
23548 member_p,
23553 /* If this is a member template declaration, let the front
23554 end know. */
23556 {
23561 }
23566 }
23567 /* We are done with the current parameter list. */
23572 /* Finish up. */
23575 /* Check the template arguments for a literal operator template. */
23579 {
23583 else
23584 {
23587 {
23593 }
23595 {
23603 }
23604 else
23606 }
23608 {
23611 " Expected non-type template argument pack <char...>"
23613 decl);
23614 else
23617 decl);
23618 }
23619 }
23620 /* Register member declarations. */
23623 /* For the erroneous case of a template with C linkage, we pushed an
23624 implicit C++ linkage scope; exit that scope now. */
23627 /* If DECL is a function template, we must return to parse it later.
23628 (Even though there is no definition, there might be default
23629 arguments that need handling.) */
23633 }
23635 /* Perform the deferred access checks from a template-parameter-list.
23636 CHECKS is a TREE_LIST of access checks, as returned by
23637 get_deferred_access_checks. */
23639 static void
23640 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23641 {
23645 }
23647 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23648 `function-definition' sequence that follows a template header.
23649 If MEMBER_P is true, this declaration appears in a class scope.
23651 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23652 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23654 static tree
23660 {
23663 cp_decl_specifier_seq decl_specifiers;
23667 /* This function is only used when processing a template
23668 declaration. */
23672 /* Defer access checks until we know what is being declared. */
23675 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23676 alternative. */
23679 CP_PARSER_FLAGS_OPTIONAL,
23685 /* There are no template typedefs. */
23687 {
23691 }
23693 /* Gather up the access checks that occurred the
23694 decl-specifier-seq. */
23697 /* Check for the declaration of a template class. */
23699 {
23701 {
23704 /* In this case:
23706 struct C {
23707 friend template <typename T> struct A<T>::B;
23708 };
23710 A<T>::B will be represented by a TYPENAME_TYPE, and
23711 therefore not recognized by shadow_tag. */
23713 && !decl
23720 else
23723 /* Perform access checks for template parameters. */
23725 }
23726 }
23728 /* Complain about missing 'typename' or other invalid type names. */
23731 {
23732 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23733 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23734 the rest of this declaration. */
23737 }
23739 /* If it's not a template class, try for a template function. If
23740 the next token is a `;', then this declaration does not declare
23741 anything. But, if there were errors in the decl-specifiers, then
23742 the error might well have come from an attempted class-specifier.
23743 In that case, there's no need to warn about a missing declarator. */
23747 {
23750 checks,
23752 member_p,
23753 declares_class_or_enum,
23757 /* 7.1.1-1 [dcl.stc]
23759 A storage-class-specifier shall not be specified in an explicit
23760 specialization... */
23762 && explicit_specialization_p
23764 {
23768 }
23772 }
23774 /* Look for a trailing `;' after the declaration. */
23780 out:
23783 /* Clear any current qualification; whatever comes next is the start
23784 of something new. */
23790 }
23792 /* Parse a cast-expression that is not the operand of a unary "&". */
23794 static tree
23796 {
23799 }
23801 /* Parse a functional cast to TYPE. Returns an expression
23802 representing the cast. */
23804 static tree
23806 {
23808 tree expression_list;
23809 tree cast;
23816 {
23824 tf_warning_or_error);
23825 }
23834 else
23835 {
23838 }
23841 tf_warning_or_error);
23842 /* [expr.const]/1: In an integral constant expression "only type
23843 conversions to integral or enumeration type can be used". */
23849 NIC_CONSTRUCTOR))
23852 }
23854 /* Save the tokens that make up the body of a member function defined
23855 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23856 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23857 specifiers applied to the declaration. Returns the FUNCTION_DECL
23858 for the member function. */
23860 static tree
23864 tree attributes)
23865 {
23868 tree fn;
23870 /* Create the FUNCTION_DECL. */
23873 /* If something went badly wrong, bail out now. */
23875 {
23876 /* If there's a function-body, skip it. */
23881 }
23883 /* Remember it, if there default args to post process. */
23886 /* Save away the tokens that make up the body of the
23887 function. */
23889 /* Handle function try blocks. */
23892 /* We can have braced-init-list mem-initializers before the fn body. */
23894 {
23897 {
23898 /* cache_group will stop after an un-nested { } pair, too. */
23902 /* variadic mem-inits have ... after the ')'. */
23905 }
23906 }
23908 /* Handle function try blocks. */
23913 /* Save away the inline definition; we will process it when the
23914 class is complete. */
23918 /* We need to know that this was defined in the class, so that
23919 friend templates are handled correctly. */
23922 /* Add FN to the queue of functions to be parsed later. */
23926 }
23928 /* Save the tokens that make up the in-class initializer for a non-static
23929 data member. Returns a DEFAULT_ARG. */
23931 static tree
23933 {
23935 }
23937 /* Parse a template-argument-list, as well as the trailing ">" (but
23938 not the opening "<"). See cp_parser_template_argument_list for the
23939 return value. */
23941 static tree
23943 {
23944 tree arguments;
23945 tree saved_scope;
23946 tree saved_qualifying_scope;
23947 tree saved_object_scope;
23952 /* [temp.names]
23954 When parsing a template-id, the first non-nested `>' is taken as
23955 the end of the template-argument-list rather than a greater-than
23956 operator. */
23957 saved_greater_than_is_operator_p
23960 /* Parsing the argument list may modify SCOPE, so we save it
23961 here. */
23965 /* We need to evaluate the template arguments, even though this
23966 template-id may be nested within a "sizeof". */
23971 /* Parse the template-argument-list itself. */
23975 else
23977 /* Look for the `>' that ends the template-argument-list. If we find
23978 a '>>' instead, it's probably just a typo. */
23980 {
23982 {
23983 /* In C++0x, a `>>' in a template argument list or cast
23984 expression is considered to be two separate `>'
23985 tokens. So, change the current token to a `>', but don't
23986 consume it: it will be consumed later when the outer
23987 template argument list (or cast expression) is parsed.
23988 Note that this replacement of `>' for `>>' is necessary
23989 even if we are parsing tentatively: in the tentative
23990 case, after calling
23991 cp_parser_enclosed_template_argument_list we will always
23992 throw away all of the template arguments and the first
23993 closing `>', either because the template argument list
23994 was erroneous or because we are replacing those tokens
23995 with a CPP_TEMPLATE_ID token. The second `>' (which will
23996 not have been thrown away) is needed either to close an
23997 outer template argument list or to complete a new-style
23998 cast. */
24001 }
24003 {
24004 /* If we're in a nested template argument list, the '>>' has
24005 to be a typo for '> >'. We emit the error message, but we
24006 continue parsing and we push a '>' as next token, so that
24007 the argument list will be parsed correctly. Note that the
24008 global source location is still on the token before the
24009 '>>', so we need to say explicitly where we want it. */
24015 }
24016 else
24017 {
24018 /* If this is not a nested template argument list, the '>>'
24019 is a typo for '>'. Emit an error message and continue.
24020 Same deal about the token location, but here we can get it
24021 right by consuming the '>>' before issuing the diagnostic. */
24024 "spurious %<>>%>, use %<>%> to terminate "
24026 }
24027 }
24028 else
24030 /* The `>' token might be a greater-than operator again now. */
24031 parser->greater_than_is_operator_p
24033 /* Restore the SAVED_SCOPE. */
24041 }
24043 /* MEMBER_FUNCTION is a member function, or a friend. If default
24044 arguments, or the body of the function have not yet been parsed,
24045 parse them now. */
24047 static void
24049 {
24051 /* If this member is a template, get the underlying
24052 FUNCTION_DECL. */
24056 /* There should not be any class definitions in progress at this
24057 point; the bodies of members are only parsed outside of all class
24058 definitions. */
24060 /* While we're parsing the member functions we might encounter more
24061 classes. We want to handle them right away, but we don't want
24062 them getting mixed up with functions that are currently in the
24063 queue. */
24066 /* Make sure that any template parameters are in scope. */
24069 /* If the body of the function has not yet been parsed, parse it
24070 now. */
24072 {
24073 tree function_scope;
24076 /* The function is no longer pending; we are processing it. */
24081 /* If this is a local class, enter the scope of the containing
24082 function. */
24087 /* Push the body of the function onto the lexer stack. */
24090 /* Let the front end know that we going to be defining this
24091 function. */
24095 /* Don't do access checking if it is a templated function. */
24099 /* #pragma omp declare reduction needs special parsing. */
24101 {
24106 }
24107 else
24108 /* Now, parse the body of the function. */
24115 /* Leave the scope of the containing function. */
24119 }
24121 /* Remove any template parameters from the symbol table. */
24124 /* Restore the queue. */
24127 }
24129 /* If DECL contains any default args, remember it on the unparsed
24130 functions queue. */
24132 static void
24134 {
24135 tree probe;
24138 probe;
24141 {
24145 }
24146 }
24148 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24149 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24150 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24151 from the parameter-type-list. */
24153 static tree
24156 {
24158 tree parsed_arg;
24164 /* Push the saved tokens for the default argument onto the parser's
24165 lexer stack. */
24171 /* Parse the default argument. */
24182 {
24183 /* In a non-template class, check conversions now. In a template,
24184 we'll wait and instantiate these as needed. */
24187 tf_warning_or_error);
24188 else
24190 }
24192 /* If the token stream has not been completely used up, then
24193 there was extra junk after the end of the default
24194 argument. */
24196 {
24199 else
24201 }
24203 /* Revert to the main lexer. */
24207 }
24209 /* FIELD is a non-static data member with an initializer which we saved for
24210 later; parse it now. */
24212 static void
24214 {
24215 tree def;
24222 NULL_TREE);
24228 }
24230 /* FN is a FUNCTION_DECL which may contains a parameter with an
24231 unparsed DEFAULT_ARG. Parse the default args now. This function
24232 assumes that the current scope is the scope in which the default
24233 argument should be processed. */
24235 static void
24237 {
24241 /* While we're parsing the default args, we might (due to the
24242 statement expression extension) encounter more classes. We want
24243 to handle them right away, but we don't want them getting mixed
24244 up with default args that are currently in the queue. */
24247 /* Local variable names (and the `this' keyword) may not appear
24248 in a default argument. */
24259 {
24261 tree parsed_arg;
24263 tree copy;
24270 /* This can happen for a friend declaration for a function
24271 already declared with default arguments. */
24274 parsed_arg
24276 default_arg,
24279 {
24281 }
24285 /* Update any instantiations we've already created. */
24289 }
24293 /* Make sure no default arg is missing. */
24296 /* Restore the state of local_variables_forbidden_p. */
24299 /* Restore the queue. */
24301 }
24303 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24305 sizeof ... ( identifier )
24307 where the 'sizeof' token has already been consumed. */
24309 static tree
24311 {
24312 /* Consume the `...'. */
24319 else
24327 /* The name is not qualified. */
24345 }
24347 /* Parse the operand of `sizeof' (or a similar operator). Returns
24348 either a TYPE or an expression, depending on the form of the
24349 input. The KEYWORD indicates which kind of expression we have
24350 encountered. */
24352 static tree
24354 {
24361 /* If it's a `...', then we are computing the length of a parameter
24362 pack. */
24367 /* Types cannot be defined in a `sizeof' expression. Save away the
24368 old message. */
24370 /* And create the new one. */
24376 /* The restrictions on constant-expressions do not apply inside
24377 sizeof expressions. */
24378 saved_integral_constant_expression_p
24380 saved_non_integral_constant_expression_p
24384 /* Do not actually evaluate the expression. */
24387 /* If it's a `(', then we might be looking at the type-id
24388 construction. */
24390 {
24393 /* We can't be sure yet whether we're looking at a type-id or an
24394 expression. */
24396 /* Note: as a GNU Extension, compound literals are considered
24397 postfix-expressions as they are in C99, so they are valid
24398 arguments to sizeof. See comment in cp_parser_cast_expression
24399 for details. */
24402 else
24403 {
24406 /* Look for the type-id. */
24408 /* Look for the closing `)'. */
24411 }
24413 /* If all went well, then we're done. */
24415 {
24416 cp_decl_specifier_seq decl_specs;
24418 /* Build a trivial decl-specifier-seq. */
24422 /* Call grokdeclarator to figure out what type this is. */
24425 TYPENAME,
24428 }
24429 }
24431 /* If the type-id production did not work out, then we must be
24432 looking at the unary-expression production. */
24436 /* Go back to evaluating expressions. */
24440 /* Free the message we created. */
24442 /* And restore the old one. */
24444 parser->integral_constant_expression_p
24446 parser->non_integral_constant_expression_p
24450 }
24452 /* If the current declaration has no declarator, return true. */
24454 static bool
24456 {
24457 /* If the next token is a `;' or a `,' then there is no
24458 declarator. */
24461 }
24463 /* Update the DECL_SPECS to reflect the storage class indicated by
24464 KEYWORD. */
24466 static void
24471 {
24472 cp_storage_class storage_class;
24475 {
24479 }
24481 {
24484 }
24489 {
24492 }
24495 {
24513 }
24517 /* A storage class specifier cannot be applied alongside a typedef
24518 specifier. If there is a typedef specifier present then set
24519 conflicting_specifiers_p which will trigger an error later
24520 on in grokdeclarator. */
24523 }
24525 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24526 is true, the type is a class or enum definition. */
24528 static void
24530 tree type_spec,
24533 {
24536 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24537 (with, for example, in "typedef int wchar_t;") we remember that
24538 this is what happened. In system headers, we ignore these
24539 declarations so that G++ can work with system headers that are not
24540 C++-safe. */
24542 && !type_definition_p
24552 {
24555 ds_redefined_builtin_type_spec,
24556 token);
24558 {
24562 }
24563 }
24566 else
24567 {
24572 }
24573 }
24575 /* True iff TOKEN is the GNU keyword __thread. */
24577 static bool
24579 {
24582 }
24584 /* Set the location for a declarator specifier and check if it is
24585 duplicated.
24587 DECL_SPECS is the sequence of declarator specifiers onto which to
24588 set the location.
24590 DS is the single declarator specifier to set which location is to
24591 be set onto the existing sequence of declarators.
24593 LOCATION is the location for the declarator specifier to
24594 consider. */
24596 static void
24599 {
24608 {
24612 }
24613 else
24614 {
24616 {
24620 else
24621 {
24624 OPT_Wlong_long,
24626 }
24627 }
24629 {
24634 else
24636 }
24637 else
24638 {
24654 "__complex"
24655 };
24658 }
24659 }
24660 }
24662 /* Return true iff the declarator specifier DS is present in the
24663 sequence of declarator specifiers DECL_SPECS. */
24665 bool
24667 cp_decl_spec ds)
24668 {
24675 }
24677 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24678 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24680 static bool
24682 {
24684 }
24686 /* Issue an error message indicating that TOKEN_DESC was expected.
24687 If KEYWORD is true, it indicated this function is called by
24688 cp_parser_require_keword and the required token can only be
24689 a indicated keyword. */
24691 static void
24693 required_token token_desc,
24695 {
24697 {
24766 }
24768 {
24770 {
24849 }
24850 }
24851 else
24853 }
24857 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24858 issue an error message indicating that TOKEN_DESC was expected.
24860 Returns the token consumed, if the token had the appropriate type.
24861 Otherwise, returns NULL. */
24866 required_token token_desc)
24867 {
24870 else
24871 {
24872 /* Output the MESSAGE -- unless we're parsing tentatively. */
24876 }
24877 }
24879 /* An error message is produced if the next token is not '>'.
24880 All further tokens are skipped until the desired token is
24881 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24883 static void
24885 {
24886 /* Current level of '< ... >'. */
24888 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24891 /* Are we ready, yet? If not, issue error message. */
24895 /* Skip tokens until the desired token is found. */
24897 {
24898 /* Peek at the next token. */
24900 {
24908 /* C++0x views the `>>' operator as two `>' tokens, but
24909 C++98 does not. */
24912 {
24913 /* We've hit a `>>' where the first `>' closes the
24914 template argument list, and the second `>' is
24915 spurious. Just consume the `>>' and stop; we've
24916 already produced at least one error. */
24919 }
24920 /* Fall through for C++0x, so we handle the second `>' in
24921 the `>>'. */
24925 {
24926 /* We've reached the token we want, consume it and stop. */
24929 }
24948 /* The '>' was probably forgotten, don't look further. */
24953 }
24955 /* Consume this token. */
24957 }
24958 }
24960 /* If the next token is the indicated keyword, consume it. Otherwise,
24961 issue an error message indicating that TOKEN_DESC was expected.
24963 Returns the token consumed, if the token had the appropriate type.
24964 Otherwise, returns NULL. */
24969 required_token token_desc)
24970 {
24974 {
24977 }
24980 }
24982 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24983 function-definition. */
24985 static bool
24987 {
24990 /* A ctor-initializer begins with a `:'. */
24992 /* A function-try-block begins with `try'. */
24994 /* A function-transaction-block begins with `__transaction_atomic'
24995 or `__transaction_relaxed'. */
24998 /* The named return value extension begins with `return'. */
25000 }
25002 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25003 definition. */
25005 static bool
25007 {
25014 }
25016 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25017 C++0x) ending a template-argument. */
25019 static bool
25021 {
25029 }
25031 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25032 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25034 static bool
25037 {
25043 /* Check for the sequence `<::' in the original code. It would be lexed as
25044 `[:', where `[' is a digraph, and there is no whitespace before
25045 `:'. */
25047 {
25052 }
25054 }
25056 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25057 or none_type otherwise. */
25059 static enum tag_types
25061 {
25063 {
25073 }
25074 }
25076 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25077 or none_type otherwise or if the token is null. */
25079 static enum tag_types
25081 {
25086 {
25094 }
25095 }
25097 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25099 static void
25101 {
25105 {
25109 type))
25112 }
25113 }
25115 /* Issue an error message if DECL is redeclared with different
25116 access than its original declaration [class.access.spec/3].
25117 This applies to nested classes and nested class templates.
25118 [class.mem/1]. */
25120 static void
25122 {
25131 }
25133 /* Look for the `template' keyword, as a syntactic disambiguator.
25134 Return TRUE iff it is present, in which case it will be
25135 consumed. */
25137 static bool
25139 {
25141 {
25142 /* In C++98 the `template' keyword can only be used within templates;
25143 outside templates the parser can always figure out what is a
25144 template and what is not. In C++11, per the resolution of DR 468,
25145 `template' is allowed in cases where it is not strictly necessary. */
25148 {
25151 "in C++98 %<template%> (as a disambiguator) is only "
25153 /* If this part of the token stream is rescanned, the same
25154 error message would be generated. So, we purge the token
25155 from the stream. */
25158 }
25159 else
25160 {
25161 /* Consume the `template' keyword. */
25164 }
25165 }
25167 }
25169 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25170 set PARSER->SCOPE, and perform other related actions. */
25172 static void
25174 {
25180 /* Get the stored value. */
25182 /* Perform any access checks that were deferred. */
25185 {
25190 }
25191 /* Set the scope from the stored value. */
25195 }
25197 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25198 encounter the end of a block before what we were looking for. */
25200 static bool
25204 {
25206 {
25209 /* Abort a parenthesized expression if we encounter a semicolon. */
25213 /* If we've reached the end of the file, stop. */
25219 /* We've hit the end of an enclosing block, so there's been some
25220 kind of syntax error. */
25223 /* Consume the token. */
25225 /* See if it starts a new group. */
25227 {
25229 /* In theory this should probably check end == '}', but
25230 cp_parser_save_member_function_body needs it to exit
25231 after either '}' or ')' when called with ')'. */
25234 }
25236 {
25240 }
25245 }
25246 }
25248 /* Like above, for caching a default argument or NSDMI. Both of these are
25249 terminated by a non-nested comma, but it can be unclear whether or not a
25250 comma is nested in a template argument list unless we do more parsing.
25251 In order to handle this ambiguity, when we encounter a ',' after a '<'
25252 we try to parse what follows as a parameter-declaration-list (in the
25253 case of a default argument) or a member-declarator (in the case of an
25254 NSDMI). If that succeeds, then we stop caching. */
25256 static tree
25258 {
25263 tree default_argument;
25265 /* Add tokens until we have processed the entire default
25266 argument. We add the range [first_token, token). */
25269 {
25270 /* For list-initialization, this is straightforward. */
25273 }
25275 {
25278 /* Peek at the next token. */
25280 /* What we do depends on what token we have. */
25282 {
25283 /* In valid code, a default argument must be
25284 immediately followed by a `,' `)', or `...'. */
25287 {
25288 /* If we've seen a '<', we might be in a
25289 template-argument-list. Until Core issue 325 is
25290 resolved, we don't know how this situation ought
25291 to be handled, so try to DTRT. We check whether
25292 what comes after the comma is a valid parameter
25293 declaration list. If it is, then the comma ends
25294 the default argument; otherwise the default
25295 argument continues. */
25298 /* Set ITALP so cp_parser_parameter_declaration_list
25299 doesn't decide to commit to this parse. */
25307 {
25314 }
25315 else
25316 {
25320 }
25327 }
25330 /* If we run into a non-nested `;', `}', or `]',
25331 then the code is invalid -- but the default
25332 argument is certainly over. */
25337 /* Handle correctly int n = sizeof ... ( p ); */
25340 /* Update DEPTH, if necessary. */
25355 /* This might be the comparison operator, or it might
25356 start a template argument list. */
25363 /* Fall through for C++0x, which treats the `>>'
25364 operator like two `>' tokens in certain
25365 cases. */
25369 {
25370 /* This might be an operator, or it might close a
25371 template argument list. But if a previous '<'
25372 started a template argument list, this will have
25373 closed it, so we can't be in one anymore. */
25377 }
25380 /* If we run out of tokens, issue an error message. */
25389 /* In these cases, we should look for template-ids.
25390 For example, if the default argument is
25391 `X<int, double>()', we need to do name lookup to
25392 figure out whether or not `X' is a template; if
25393 so, the `,' does not end the default argument.
25395 That is not yet done. */
25400 }
25402 /* If we've reached the end, stop. */
25406 /* Add the token to the token block. */
25408 }
25410 /* Create a DEFAULT_ARG to represent the unparsed default
25411 argument. */
25418 }
25420 /* Begin parsing tentatively. We always save tokens while parsing
25421 tentatively so that if the tentative parsing fails we can restore the
25422 tokens. */
25424 static void
25426 {
25427 /* Enter a new parsing context. */
25429 /* Begin saving tokens. */
25431 /* In order to avoid repetitive access control error messages,
25432 access checks are queued up until we are no longer parsing
25433 tentatively. */
25435 }
25437 /* Commit to the currently active tentative parse. */
25439 static void
25441 {
25445 /* Mark all of the levels as committed. */
25448 {
25455 }
25456 }
25458 /* Commit to the topmost currently active tentative parse.
25460 Note that this function shouldn't be called when there are
25461 irreversible side-effects while in a tentative state. For
25462 example, we shouldn't create a permanent entry in the symbol
25463 table, or issue an error message that might not apply if the
25464 tentative parse is aborted. */
25466 static void
25468 {
25473 {
25481 }
25482 }
25484 /* Abort the currently active tentative parse. All consumed tokens
25485 will be rolled back, and no diagnostics will be issued. */
25487 static void
25489 {
25493 /* Now, pretend that we want to see if the construct was
25494 successfully parsed. */
25496 }
25498 /* Stop parsing tentatively. If a parse error has occurred, restore the
25499 token stream. Otherwise, commit to the tokens we have consumed.
25500 Returns true if no error occurred; false otherwise. */
25502 static bool
25504 {
25508 /* Remember whether or not an error occurred, since we are about to
25509 destroy that information. */
25511 /* Remove the topmost context from the stack. */
25514 /* If no parse errors occurred, commit to the tentative parse. */
25516 {
25517 /* Commit to the tokens read tentatively, unless that was
25518 already done. */
25523 }
25524 /* Otherwise, if errors occurred, roll back our state so that things
25525 are just as they were before we began the tentative parse. */
25526 else
25527 {
25530 }
25531 /* Add the context to the front of the free list. */
25536 }
25538 /* Returns true if we are parsing tentatively and are not committed to
25539 this tentative parse. */
25541 static bool
25543 {
25546 }
25548 /* Returns nonzero iff an error has occurred during the most recent
25549 tentative parse. */
25551 static bool
25553 {
25556 }
25558 /* Returns nonzero if GNU extensions are allowed. */
25560 static bool
25562 {
25564 }
25565 \f
25566 /* Objective-C++ Productions */
25569 /* Parse an Objective-C expression, which feeds into a primary-expression
25570 above.
25572 objc-expression:
25573 objc-message-expression
25574 objc-string-literal
25575 objc-encode-expression
25576 objc-protocol-expression
25577 objc-selector-expression
25579 Returns a tree representation of the expression. */
25581 static tree
25583 {
25584 /* Try to figure out what kind of declaration is present. */
25588 {
25598 {
25610 }
25616 }
25619 }
25621 /* Parse an Objective-C message expression.
25623 objc-message-expression:
25624 [ objc-message-receiver objc-message-args ]
25626 Returns a representation of an Objective-C message. */
25628 static tree
25630 {
25639 }
25641 /* Parse an objc-message-receiver.
25643 objc-message-receiver:
25644 expression
25645 simple-type-specifier
25647 Returns a representation of the type or expression. */
25649 static tree
25651 {
25652 tree rcv;
25654 /* An Objective-C message receiver may be either (1) a type
25655 or (2) an expression. */
25659 /* If that worked out, fine. */
25666 CP_PARSER_FLAGS_NONE);
25673 }
25675 /* Parse the arguments and selectors comprising an Objective-C message.
25677 objc-message-args:
25678 objc-selector
25679 objc-selector-args
25680 objc-selector-args , objc-comma-args
25682 objc-selector-args:
25683 objc-selector [opt] : assignment-expression
25684 objc-selector-args objc-selector [opt] : assignment-expression
25686 objc-comma-args:
25687 assignment-expression
25688 objc-comma-args , assignment-expression
25690 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25691 selector arguments and TREE_VALUE containing a list of comma
25692 arguments. */
25694 static tree
25696 {
25702 {
25708 /* Detect if we have a unary selector. */
25717 sel_args
25722 }
25724 /* Handle non-selector arguments, if any. */
25726 {
25727 tree arg;
25732 addl_args
25737 }
25740 {
25743 }
25746 }
25748 /* Parse an Objective-C encode expression.
25750 objc-encode-expression:
25751 @encode objc-typename
25753 Returns an encoded representation of the type argument. */
25755 static tree
25757 {
25758 tree type;
25768 {
25772 }
25774 /* This happens if we find @encode(T) (where T is a template
25775 typename or something dependent on a template typename) when
25776 parsing a template. In that case, we can't compile it
25777 immediately, but we rather create an AT_ENCODE_EXPR which will
25778 need to be instantiated when the template is used.
25779 */
25781 {
25785 }
25788 }
25790 /* Parse an Objective-C @defs expression. */
25792 static tree
25794 {
25795 tree name;
25803 }
25805 /* Parse an Objective-C protocol expression.
25807 objc-protocol-expression:
25808 @protocol ( identifier )
25810 Returns a representation of the protocol expression. */
25812 static tree
25814 {
25815 tree proto;
25823 }
25825 /* Parse an Objective-C selector expression.
25827 objc-selector-expression:
25828 @selector ( objc-method-signature )
25830 objc-method-signature:
25831 objc-selector
25832 objc-selector-seq
25834 objc-selector-seq:
25835 objc-selector :
25836 objc-selector-seq objc-selector :
25838 Returns a representation of the method selector. */
25840 static tree
25842 {
25854 {
25863 {
25864 /* Detect if we have a unary selector. */
25866 {
25869 }
25870 else
25871 {
25873 }
25874 }
25879 {
25880 sel_seq
25883 sel_seq
25886 }
25887 else
25888 sel_seq
25893 }
25895 finish_selector:
25899 }
25901 /* Parse a list of identifiers.
25903 objc-identifier-list:
25904 identifier
25905 objc-identifier-list , identifier
25907 Returns a TREE_LIST of identifier nodes. */
25909 static tree
25911 {
25912 tree identifier;
25913 tree list;
25924 {
25931 identifier));
25933 }
25936 }
25938 /* Parse an Objective-C alias declaration.
25940 objc-alias-declaration:
25941 @compatibility_alias identifier identifier ;
25943 This function registers the alias mapping with the Objective-C front end.
25944 It returns nothing. */
25946 static void
25948 {
25956 }
25958 /* Parse an Objective-C class forward-declaration.
25960 objc-class-declaration:
25961 @class objc-identifier-list ;
25963 The function registers the forward declarations with the Objective-C
25964 front end. It returns nothing. */
25966 static void
25968 {
25971 {
25972 tree id;
25982 else
25984 }
25986 }
25988 /* Parse a list of Objective-C protocol references.
25990 objc-protocol-refs-opt:
25991 objc-protocol-refs [opt]
25993 objc-protocol-refs:
25994 < objc-identifier-list >
25996 Returns a TREE_LIST of identifiers, if any. */
25998 static tree
26000 {
26004 {
26008 }
26011 }
26013 /* Parse a Objective-C visibility specification. */
26015 static void
26017 {
26021 {
26036 }
26038 /* Eat '@private'/'@protected'/'@public'. */
26040 }
26042 /* Parse an Objective-C method type. Return 'true' if it is a class
26043 (+) method, and 'false' if it is an instance (-) method. */
26047 {
26050 else
26052 }
26054 /* Parse an Objective-C protocol qualifier. */
26056 static tree
26058 {
26071 {
26076 }
26079 }
26081 /* Parse an Objective-C typename. */
26083 static tree
26085 {
26089 {
26095 /* An ObjC type name may consist of just protocol qualifiers, in which
26096 case the type shall default to 'id'. */
26098 {
26101 /* If the type could not be parsed, an error has already
26102 been produced. For error recovery, behave as if it had
26103 not been specified, which will use the default type
26104 'id'. */
26106 {
26108 /* We need to skip to the closing parenthesis as
26109 cp_parser_type_id() does not seem to do it for
26110 us. */
26115 }
26116 }
26120 }
26123 }
26125 /* Check to see if TYPE refers to an Objective-C selector name. */
26127 static bool
26129 {
26135 }
26137 /* Parse an Objective-C selector. */
26139 static tree
26141 {
26145 {
26148 }
26150 /* C++ operator names are allowed to appear in ObjC selectors. */
26152 {
26165 }
26166 }
26168 /* Parse an Objective-C params list. */
26170 static tree
26172 {
26178 {
26188 /* Detect if we have a unary selector. */
26191 {
26194 }
26198 {
26199 /* Something went quite wrong. There should be a colon
26200 here, but there is not. Stop parsing parameters. */
26202 }
26204 /* New ObjC allows attributes on parameters too. */
26209 params
26212 type_name,
26213 identifier,
26214 parm_attr));
26217 }
26220 {
26223 }
26225 /* We allow tail attributes for the method. */
26227 {
26235 }
26238 {
26241 }
26243 }
26245 /* Parse the non-keyword Objective-C params. */
26247 static tree
26250 {
26256 {
26258 tree parm;
26264 {
26269 }
26271 /* TODO: parse attributes for tail parameters. */
26280 }
26282 /* We allow tail attributes for the method. */
26284 {
26286 {
26291 }
26292 else
26293 /* We have an error, but parse the attributes, so that we can
26294 carry on. */
26300 }
26303 }
26305 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26307 static void
26309 {
26312 /* If the next token is `extern' and the following token is a string
26313 literal, then we have a linkage specification. */
26315 && cp_parser_is_pure_string_literal
26318 /* Handle #pragma, if any. */
26321 /* Allow stray semicolons. */
26324 /* Mark methods as optional or required, when building protocols. */
26326 {
26329 }
26331 {
26334 }
26337 /* Other stray characters must generate errors. */
26339 {
26343 }
26344 /* Finally, try to parse a block-declaration, or a function-definition. */
26345 else
26347 }
26349 /* Parse a method signature. */
26351 static tree
26353 {
26369 }
26371 static bool
26373 {
26374 tree tattr;
26379 /* If the attributes are followed by a method introducer, this is not allowed.
26380 Dump the attributes and flag the situation. */
26385 /* Otherwise, the attributes introduce some interstitial code, possibly so
26386 rewind to allow that check. */
26389 }
26391 /* Parse an Objective-C method prototype list. */
26393 static void
26395 {
26399 {
26401 {
26406 else
26410 {
26414 }
26417 }
26423 OPT_Wattributes,
26425 else
26426 /* Allow for interspersed non-ObjC++ code. */
26430 }
26434 else
26438 }
26440 /* Parse an Objective-C method definition list. */
26442 static void
26444 {
26448 {
26449 tree meth;
26452 {
26458 else
26463 {
26467 }
26469 NULL_TREE);
26471 /* For historical reasons, we accept an optional semicolon. */
26478 {
26485 }
26486 }
26487 /* The following case will be removed once @synthesize is
26488 completely implemented. */
26499 else
26500 /* Allow for interspersed non-ObjC++ code. */
26504 }
26508 else
26512 }
26514 /* Parse Objective-C ivars. */
26516 static void
26518 {
26529 {
26530 cp_decl_specifier_seq declspecs;
26532 tree prefix_attributes;
26540 CP_PARSER_FLAGS_OPTIONAL,
26544 /* auto, register, static, extern, mutable. */
26546 {
26549 }
26551 /* thread_local. */
26553 {
26556 }
26558 /* typedef. */
26560 {
26563 }
26568 /* Keep going until we hit the `;' at the end of the
26569 declaration. */
26571 {
26576 /* Check for a (possibly unnamed) bitfield declaration. */
26584 {
26585 /* Get the name of the bitfield. */
26588 sfk_none);
26590 eat_colon:
26592 /* Get the width of the bitfield. */
26593 width
26595 }
26596 else
26597 {
26598 /* Parse the declarator. */
26599 declarator
26605 }
26607 /* Look for attributes that apply to the ivar. */
26609 /* Remember which attributes are prefix attributes and
26610 which are not. */
26612 /* Combine the attributes. */
26616 /* Create the bitfield declaration. */
26618 width,
26619 attributes);
26620 else
26625 /* Add the instance variable. */
26629 /* Reset PREFIX_ATTRIBUTES. */
26638 {
26641 }
26643 }
26647 }
26652 /* Do not consume the RID_AT_END, so it will be read again as terminating
26653 the @interface of @implementation. */
26657 /* For historical reasons, we accept an optional semicolon. */
26660 }
26662 /* Parse an Objective-C protocol declaration. */
26664 static void
26666 {
26672 {
26677 }
26679 /* See if we have a forward declaration or a definition. */
26682 /* Try a forward declaration first. */
26684 {
26686 {
26687 tree id;
26697 else
26699 }
26701 }
26703 /* Ok, we got a full-fledged definition (or at least should). */
26704 else
26705 {
26710 }
26711 }
26713 /* Parse an Objective-C superclass or category. */
26715 static void
26720 {
26726 {
26729 }
26731 {
26734 /* If there is no category name, and this is an @interface, we
26735 have a class extension. */
26737 {
26740 }
26741 else
26745 }
26746 }
26748 /* Parse an Objective-C class interface. */
26750 static void
26752 {
26759 {
26760 /* It's hard to recover because even if valid @interface stuff
26761 is to follow, we can't compile it (or validate it) if we
26762 don't even know which class it refers to. Let's assume this
26763 was a stray '@interface' token in the stream and skip it.
26764 */
26766 }
26771 /* We have either a class or a category on our hands. */
26774 else
26775 {
26777 /* Handle instance variable declarations, if any. */
26780 }
26783 }
26785 /* Parse an Objective-C class implementation. */
26787 static void
26789 {
26796 {
26797 /* It's hard to recover because even if valid @implementation
26798 stuff is to follow, we can't compile it (or validate it) if
26799 we don't even know which class it refers to. Let's assume
26800 this was a stray '@implementation' token in the stream and
26801 skip it.
26802 */
26804 }
26808 /* We have either a class or a category on our hands. */
26811 else
26812 {
26814 /* Handle instance variable declarations, if any. */
26817 }
26820 }
26822 /* Consume the @end token and finish off the implementation. */
26824 static void
26826 {
26829 }
26831 /* Parse an Objective-C declaration. */
26833 static void
26835 {
26836 /* Try to figure out what kind of declaration is present. */
26841 {
26857 }
26860 {
26883 }
26884 }
26886 /* Parse an Objective-C try-catch-finally statement.
26888 objc-try-catch-finally-stmt:
26889 @try compound-statement objc-catch-clause-seq [opt]
26890 objc-finally-clause [opt]
26892 objc-catch-clause-seq:
26893 objc-catch-clause objc-catch-clause-seq [opt]
26895 objc-catch-clause:
26896 @catch ( objc-exception-declaration ) compound-statement
26898 objc-finally-clause:
26899 @finally compound-statement
26901 objc-exception-declaration:
26902 parameter-declaration
26903 '...'
26905 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26907 Returns NULL_TREE.
26909 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26910 for C. Keep them in sync. */
26912 static tree
26914 {
26915 location_t location;
26916 tree stmt;
26921 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26922 node, lest it get absorbed into the surrounding block. */
26928 {
26937 {
26938 /* We have "@catch (...)" (where the '...' are literally
26939 what is in the code). Skip the '...'.
26940 parameter_declaration is set to NULL_TREE, and
26941 objc_being_catch_clauses() knows that that means
26942 '...'. */
26945 }
26946 else
26947 {
26948 /* We have "@catch (NSException *exception)" or something
26949 like that. Parse the parameter declaration. */
26953 else
26958 }
26961 else
26962 {
26963 /* If there was no open parenthesis, we are recovering from
26964 an error, and we are trying to figure out what mistake
26965 the user has made. */
26967 /* If there is an immediate closing parenthesis, the user
26968 probably forgot the opening one (ie, they typed "@catch
26969 NSException *e)". Parse the closing parenthesis and keep
26970 going. */
26974 /* If these is no immediate closing parenthesis, the user
26975 probably doesn't know that parenthesis are required at
26976 all (ie, they typed "@catch NSException *e"). So, just
26977 forget about the closing parenthesis and keep going. */
26978 }
26982 }
26984 {
26987 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26988 node, lest it get absorbed into the surrounding block. */
26992 }
26995 }
26997 /* Parse an Objective-C synchronized statement.
26999 objc-synchronized-stmt:
27000 @synchronized ( expression ) compound-statement
27002 Returns NULL_TREE. */
27004 static tree
27006 {
27007 location_t location;
27018 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27019 node, lest it get absorbed into the surrounding block. */
27024 }
27026 /* Parse an Objective-C throw statement.
27028 objc-throw-stmt:
27029 @throw assignment-expression [opt] ;
27031 Returns a constructed '@throw' statement. */
27033 static tree
27035 {
27047 }
27049 /* Parse an Objective-C statement. */
27051 static tree
27053 {
27054 /* Try to figure out what kind of declaration is present. */
27058 {
27069 }
27072 }
27074 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27075 look ahead to see if an objc keyword follows the attributes. This
27076 is to detect the use of prefix attributes on ObjC @interface and
27077 @protocol. */
27079 static bool
27081 {
27086 {
27089 }
27092 }
27094 /* This routine is a minimal replacement for
27095 c_parser_struct_declaration () used when parsing the list of
27096 types/names or ObjC++ properties. For example, when parsing the
27097 code
27099 @property (readonly) int a, b, c;
27101 this function is responsible for parsing "int a, int b, int c" and
27102 returning the declarations as CHAIN of DECLs.
27104 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27105 similar parsing. */
27106 static tree
27108 {
27110 cp_decl_specifier_seq declspecs;
27112 tree prefix_attributes;
27115 CP_PARSER_FLAGS_NONE,
27122 /* auto, register, static, extern, mutable. */
27124 {
27127 }
27129 /* thread_local. */
27131 {
27134 }
27136 /* typedef. */
27138 {
27141 }
27146 /* Keep going until we hit the `;' at the end of the declaration. */
27148 {
27153 /* Parse the declarator. */
27157 /* Look for attributes that apply to the ivar. */
27159 /* Remember which attributes are prefix attributes and
27160 which are not. */
27162 /* Combine the attributes. */
27172 /* Reset PREFIX_ATTRIBUTES. */
27183 {
27186 }
27187 else
27189 }
27191 }
27193 /* Parse an Objective-C @property declaration. The syntax is:
27195 objc-property-declaration:
27196 '@property' objc-property-attributes[opt] struct-declaration ;
27198 objc-property-attributes:
27199 '(' objc-property-attribute-list ')'
27201 objc-property-attribute-list:
27202 objc-property-attribute
27203 objc-property-attribute-list, objc-property-attribute
27205 objc-property-attribute
27206 'getter' = identifier
27207 'setter' = identifier
27208 'readonly'
27209 'readwrite'
27210 'assign'
27211 'retain'
27212 'copy'
27213 'nonatomic'
27215 For example:
27216 @property NSString *name;
27217 @property (readonly) id object;
27218 @property (retain, nonatomic, getter=getTheName) id name;
27219 @property int a, b, c;
27221 PS: This function is identical to
27222 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27223 static void
27225 {
27226 /* The following variables hold the attributes of the properties as
27227 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27228 seen. When we see an attribute, we set them to 'true' (if they
27229 are boolean properties) or to the identifier (if they have an
27230 argument, ie, for getter and setter). Note that here we only
27231 parse the list of attributes, check the syntax and accumulate the
27232 attributes that we find. objc_add_property_declaration() will
27233 then process the information. */
27243 /* 'properties' is the list of properties that we read. Usually a
27244 single one, but maybe more (eg, in "@property int a, b, c;" there
27245 are three). */
27246 tree properties;
27247 location_t loc;
27253 /* Parse the optional attribute list... */
27255 {
27256 /* Eat the '('. */
27260 {
27266 {
27269 }
27273 {
27284 {
27288 else
27293 }
27296 {
27300 }
27302 {
27304 {
27307 }
27308 else
27312 else
27314 }
27315 else
27316 {
27318 {
27321 }
27322 else
27324 }
27330 }
27337 else
27339 }
27341 /* FIXME: "@property (setter, assign);" will generate a spurious
27342 "error: expected ‘)’ before ‘,’ token". This is because
27343 cp_parser_require, unlike the C counterpart, will produce an
27344 error even if we are in error recovery. */
27346 {
27351 }
27352 }
27354 /* ... and the property declaration(s). */
27358 {
27360 /* If the next token is now a `;', consume it. */
27364 }
27368 else
27369 {
27370 /* Comma-separated properties are chained together in
27371 reverse order; add them one by one. */
27380 }
27383 }
27385 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27387 objc-synthesize-declaration:
27388 @synthesize objc-synthesize-identifier-list ;
27390 objc-synthesize-identifier-list:
27391 objc-synthesize-identifier
27392 objc-synthesize-identifier-list, objc-synthesize-identifier
27394 objc-synthesize-identifier
27395 identifier
27396 identifier = identifier
27398 For example:
27399 @synthesize MyProperty;
27400 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27402 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27403 for C. Keep them in sync.
27404 */
27405 static void
27407 {
27409 location_t loc;
27414 {
27418 {
27421 }
27423 {
27427 {
27430 }
27431 }
27432 else
27437 else
27439 }
27442 }
27444 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27446 objc-dynamic-declaration:
27447 @dynamic identifier-list ;
27449 For example:
27450 @dynamic MyProperty;
27451 @dynamic MyProperty, AnotherProperty;
27453 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27454 for C. Keep them in sync.
27455 */
27456 static void
27458 {
27460 location_t loc;
27465 {
27466 tree property;
27469 {
27472 }
27476 else
27478 }
27481 }
27483 \f
27484 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27486 /* Returns name of the next clause.
27487 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27488 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27489 returned and the token is consumed. */
27491 static pragma_omp_clause
27493 {
27505 {
27510 {
27613 }
27614 }
27620 }
27622 /* Validate that a clause of the given type does not already exist. */
27624 static void
27627 {
27628 tree c;
27632 {
27635 }
27636 }
27638 /* OpenMP 2.5:
27639 variable-list:
27640 identifier
27641 variable-list , identifier
27643 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27644 colon). An opening parenthesis will have been consumed by the caller.
27646 If KIND is nonzero, create the appropriate node and install the decl
27647 in OMP_CLAUSE_DECL and add the node to the head of the list.
27649 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27650 return the list created.
27652 COLON can be NULL if only closing parenthesis should end the list,
27653 or pointer to bool which will receive false if the list is terminated
27654 by closing parenthesis or true if the list is terminated by colon. */
27656 static tree
27659 {
27663 {
27666 }
27668 {
27685 {
27687 {
27693 {
27701 parser->colon_corrects_to_scope_p
27705 else
27706 {
27707 /* Look for `:'. */
27711 CPP_CLOSE_SQUARE))
27713 }
27714 /* Look for the closing `]'. */
27716 RT_CLOSE_SQUARE))
27719 }
27723 }
27729 }
27730 else
27733 get_comma:
27737 }
27743 {
27747 }
27750 {
27753 /* Try to resync to an unnested comma. Copied from
27754 cp_parser_parenthesized_expression_list. */
27755 skip_comma:
27764 }
27767 }
27769 /* Similarly, but expect leading and trailing parenthesis. This is a very
27770 common case for omp clauses. */
27772 static tree
27774 {
27778 }
27780 /* OpenMP 3.0:
27781 collapse ( constant-expression ) */
27783 static tree
27785 {
27787 location_t loc;
27788 HOST_WIDE_INT n;
27808 {
27811 }
27819 }
27821 /* OpenMP 2.5:
27822 default ( shared | none ) */
27824 static tree
27826 {
27828 tree c;
27833 {
27838 {
27853 }
27856 }
27857 else
27858 {
27859 invalid_kind:
27861 }
27877 }
27879 /* OpenMP 3.1:
27880 final ( expression ) */
27882 static tree
27884 {
27905 }
27907 /* OpenMP 2.5:
27908 if ( expression ) */
27910 static tree
27912 {
27933 }
27935 /* OpenMP 3.1:
27936 mergeable */
27938 static tree
27941 {
27942 tree c;
27945 location);
27950 }
27952 /* OpenMP 2.5:
27953 nowait */
27955 static tree
27958 {
27959 tree c;
27966 }
27968 /* OpenMP 2.5:
27969 num_threads ( expression ) */
27971 static tree
27973 location_t location)
27974 {
27996 }
27998 /* OpenMP 2.5:
27999 ordered */
28001 static tree
28004 {
28005 tree c;
28013 }
28015 /* OpenMP 2.5:
28016 reduction ( reduction-operator : variable-list )
28018 reduction-operator:
28019 One of: + * - & ^ | && ||
28021 OpenMP 3.1:
28023 reduction-operator:
28024 One of: + * - & ^ | && || min max
28026 OpenMP 4.0:
28028 reduction-operator:
28029 One of: + * - & ^ | && ||
28030 id-expression */
28032 static tree
28034 {
28042 {
28052 }
28056 else
28057 {
28068 {
28098 }
28099 else
28100 {
28102 resync_fail:
28107 }
28108 }
28114 NULL);
28116 {
28119 }
28122 }
28124 /* OpenMP 2.5:
28125 schedule ( schedule-kind )
28126 schedule ( schedule-kind , expression )
28128 schedule-kind:
28129 static | dynamic | guided | runtime | auto */
28131 static tree
28133 {
28142 {
28147 {
28168 }
28169 }
28174 else
28179 {
28194 else
28199 }
28207 invalid_kind:
28209 resync_fail:
28214 }
28216 /* OpenMP 3.0:
28217 untied */
28219 static tree
28222 {
28223 tree c;
28230 }
28232 /* OpenMP 4.0:
28233 inbranch
28234 notinbranch */
28236 static tree
28239 {
28244 }
28246 /* OpenMP 4.0:
28247 parallel
28248 for
28249 sections
28250 taskgroup */
28252 static tree
28256 {
28260 }
28262 /* OpenMP 4.0:
28263 num_teams ( expression ) */
28265 static tree
28267 location_t location)
28268 {
28290 }
28292 /* OpenMP 4.0:
28293 thread_limit ( expression ) */
28295 static tree
28297 location_t location)
28298 {
28320 }
28322 /* OpenMP 4.0:
28323 aligned ( variable-list )
28324 aligned ( variable-list : constant-expression ) */
28326 static tree
28328 {
28339 {
28349 }
28355 }
28357 /* OpenMP 4.0:
28358 linear ( variable-list )
28359 linear ( variable-list : expression ) */
28361 static tree
28364 {
28375 {
28379 {
28382 }
28390 }
28396 }
28398 /* OpenMP 4.0:
28399 safelen ( constant-expression ) */
28401 static tree
28403 location_t location)
28404 {
28425 }
28427 /* OpenMP 4.0:
28428 simdlen ( constant-expression ) */
28430 static tree
28432 location_t location)
28433 {
28454 }
28456 /* OpenMP 4.0:
28457 depend ( depend-kind : variable-list )
28459 depend-kind:
28460 in | out | inout */
28462 static tree
28464 {
28472 {
28482 else
28484 }
28485 else
28493 NULL);
28500 invalid_kind:
28502 resync_fail:
28507 }
28509 /* OpenMP 4.0:
28510 map ( map-kind : variable-list )
28511 map ( variable-list )
28513 map-kind:
28514 alloc | to | from | tofrom */
28516 static tree
28518 {
28527 {
28539 else
28540 {
28546 }
28549 }
28552 NULL);
28558 }
28560 /* OpenMP 4.0:
28561 device ( expression ) */
28563 static tree
28565 location_t location)
28566 {
28588 }
28590 /* OpenMP 4.0:
28591 dist_schedule ( static )
28592 dist_schedule ( static , expression ) */
28594 static tree
28596 location_t location)
28597 {
28610 {
28621 }
28626 location);
28630 invalid_kind:
28632 resync_fail:
28637 }
28639 /* OpenMP 4.0:
28640 proc_bind ( proc-bind-kind )
28642 proc-bind-kind:
28643 master | close | spread */
28645 static tree
28647 location_t location)
28648 {
28649 tree c;
28656 {
28666 else
28668 }
28669 else
28678 location);
28683 invalid_kind:
28685 resync_fail:
28690 }
28692 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28693 is a bitmask in MASK. Return the list of clauses found; the result
28694 of clause default goes in *pdefault. */
28696 static tree
28700 {
28707 {
28708 pragma_omp_clause c_kind;
28719 {
28731 clauses);
28745 clauses);
28754 clauses);
28778 clauses);
28792 clauses);
28809 OMP_CLAUSE_NOTINBRANCH,
28818 {
28819 clause_not_first:
28823 }
28848 clauses);
28853 clauses);
28858 clauses);
28921 }
28926 {
28927 /* Remove the invalid clause(s) from the list to avoid
28928 confusing the rest of the compiler. */
28931 }
28932 }
28933 saw_error:
28934 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
28935 no reason to skip to the end. */
28941 }
28943 /* OpenMP 2.5:
28944 structured-block:
28945 statement
28947 In practice, we're also interested in adding the statement to an
28948 outer node. So it is convenient if we work around the fact that
28949 cp_parser_statement calls add_stmt. */
28951 static unsigned
28953 {
28956 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28957 This preserves the "not within loop or switch" style error messages
28958 for nonsense cases like
28959 void foo() {
28960 #pragma omp single
28961 break;
28962 }
28963 */
28968 }
28970 static void
28972 {
28974 }
28976 static tree
28978 {
28986 }
28988 /* OpenMP 2.5:
28989 # pragma omp atomic new-line
28990 expression-stmt
28992 expression-stmt:
28993 x binop= expr | x++ | ++x | x-- | --x
28994 binop:
28995 +, *, -, /, &, ^, |, <<, >>
28997 where x is an lvalue expression with scalar type.
28999 OpenMP 3.1:
29000 # pragma omp atomic new-line
29001 update-stmt
29003 # pragma omp atomic read new-line
29004 read-stmt
29006 # pragma omp atomic write new-line
29007 write-stmt
29009 # pragma omp atomic update new-line
29010 update-stmt
29012 # pragma omp atomic capture new-line
29013 capture-stmt
29015 # pragma omp atomic capture new-line
29016 capture-block
29018 read-stmt:
29019 v = x
29020 write-stmt:
29021 x = expr
29022 update-stmt:
29023 expression-stmt | x = x binop expr
29024 capture-stmt:
29025 v = expression-stmt
29026 capture-block:
29027 { v = x; update-stmt; } | { update-stmt; v = x; }
29029 OpenMP 4.0:
29030 update-stmt:
29031 expression-stmt | x = x binop expr | x = expr binop x
29032 capture-stmt:
29033 v = update-stmt
29034 capture-block:
29035 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29037 where x and v are lvalue expressions with scalar type. */
29039 static void
29041 {
29049 {
29054 {
29060 }
29061 }
29063 {
29075 else
29079 }
29081 {
29087 {
29092 {
29095 }
29096 }
29097 }
29101 {
29111 else
29116 {
29117 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29118 opcode. */
29123 }
29127 {
29130 }
29131 else
29132 {
29138 }
29141 }
29143 restart:
29147 {
29154 /* FALLTHROUGH */
29164 /* FALLTHROUGH */
29179 /* Undo effects of boolean_increment for post {in,de}crement. */
29181 /* FALLTHRU */
29185 {
29186 /* Undo effects of boolean_increment. */
29188 {
29189 /* This is pre or post increment. */
29194 && !structured_block
29198 }
29199 }
29200 /* FALLTHRU */
29203 {
29238 {
29242 }
29245 {
29251 {
29256 }
29258 {
29269 {
29271 {
29276 }
29277 else
29279 }
29283 }
29286 {
29293 }
29297 }
29301 {
29304 {
29312 }
29314 {
29319 }
29354 }
29365 /* FALLTHROUGH */
29370 }
29377 }
29378 stmt_done:
29380 {
29391 }
29393 {
29396 }
29397 done:
29403 saw_error:
29406 {
29410 {
29414 }
29415 }
29416 }
29419 /* OpenMP 2.5:
29420 # pragma omp barrier new-line */
29422 static void
29424 {
29427 }
29429 /* OpenMP 2.5:
29430 # pragma omp critical [(name)] new-line
29431 structured-block */
29433 static tree
29435 {
29439 {
29451 }
29456 }
29458 /* OpenMP 2.5:
29459 # pragma omp flush flush-vars[opt] new-line
29461 flush-vars:
29462 ( variable-list ) */
29464 static void
29466 {
29472 }
29474 /* Helper function, to parse omp for increment expression. */
29476 static tree
29478 {
29483 {
29486 }
29489 {
29498 /* Fall through: OpenMP disallows NE_EXPR. */
29501 }
29503 /* If decl is an iterator, preserve LHS and RHS of the relational
29504 expr until finish_omp_for. */
29514 }
29516 /* Helper function, to parse omp for increment expression. */
29518 static tree
29520 {
29524 cp_id_kind idk;
29528 {
29536 }
29544 {
29549 }
29556 {
29560 }
29572 do
29573 {
29580 {
29582 {
29585 else
29587 tf_warning_or_error);
29588 }
29589 else
29592 }
29593 }
29597 {
29601 }
29602 else
29606 }
29608 /* Parse the initialization statement of either an OpenMP for loop or
29609 a Cilk Plus for loop.
29611 Return true if the resulting construct should have an
29612 OMP_CLAUSE_PRIVATE added to it. */
29614 static bool
29622 {
29628 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29630 init-expr:
29631 var = lb
29632 integer-type var = lb
29633 random-access-iterator-type var = lb
29634 pointer-type var = lb
29635 */
29636 cp_decl_specifier_seq type_specifiers;
29638 /* First, try to parse as an initialized declaration. See
29639 cp_parser_condition, from whence the bulk of this is copied. */
29646 {
29647 /* If parsing a type specifier seq succeeded, then this
29648 MUST be a initialized declaration. */
29653 CP_PARSER_DECLARATOR_NAMED,
29664 else
29665 {
29675 {
29677 CPP_OPEN_PAREN))
29678 {
29682 else
29685 }
29686 else
29687 /* Trigger an error. */
29692 }
29696 {
29704 {
29707 auto_node);
29712 }
29715 asm_specification,
29716 LOOKUP_ONLYCONVERTING);
29718 {
29721 }
29722 else
29725 }
29726 else
29727 {
29728 /* Consume '='. */
29732 non_class:
29735 else
29738 asm_specification,
29739 LOOKUP_ONLYCONVERTING);
29740 }
29744 }
29745 }
29746 else
29747 {
29748 cp_id_kind idk;
29749 /* If parsing a type specifier sequence failed, then
29750 this MUST be a simple expression. */
29758 && decl
29761 {
29762 tree rhs;
29769 rhs,
29770 tf_warning_or_error));
29772 }
29773 else
29774 {
29779 {
29783 }
29784 }
29785 }
29787 }
29789 /* Parse the restricted form of the for statement allowed by OpenMP. */
29791 static tree
29794 {
29798 location_t loc_first;
29817 {
29820 location_t loc;
29824 {
29827 }
29830 {
29833 }
29842 add_private_clause
29849 {
29852 {
29858 }
29859 else
29861 }
29868 {
29873 {
29877 }
29880 {
29881 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29882 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29887 {
29890 }
29891 else
29892 {
29895 }
29899 }
29900 else
29901 {
29906 }
29907 }
29910 {
29911 tree c;
29913 {
29922 decl);
29926 decl);
29927 }
29929 {
29934 {
29937 }
29938 }
29939 }
29948 {
29949 /* If decl is an iterator, preserve the operator on decl
29950 until finish_omp_for. */
29952 && ((processing_template_decl
29956 else
29960 }
29975 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29976 in between the collapsed for loops to be still considered perfectly
29977 nested. Hopefully the final version clarifies this.
29978 For now handle (multiple) {'s and empty statements. */
29980 do
29981 {
29985 {
29987 bracecount++;
29988 }
29992 else
29993 {
30000 }
30001 }
30005 {
30008 }
30009 }
30011 /* Note that we saved the original contents of this flag when we entered
30012 the structured block, and so we don't need to re-save it here. */
30015 else
30018 /* Note that the grammar doesn't call for a structured block here,
30019 though the loop as a whole is a structured block. */
30026 else
30031 {
30033 {
30035 nbraces--;
30036 }
30039 else
30040 {
30042 {
30045 }
30050 }
30051 }
30058 }
30060 /* Helper function for OpenMP parsing, split clauses and call
30061 finish_omp_clauses on each of the set of clauses afterwards. */
30063 static void
30066 {
30072 }
30074 /* OpenMP 4.0:
30075 #pragma omp simd simd-clause[optseq] new-line
30076 for-loop */
30078 #define OMP_SIMD_CLAUSE_MASK \
30079 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30080 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30081 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30082 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30083 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30084 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30085 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30087 static tree
30090 {
30102 {
30105 }
30116 }
30118 /* OpenMP 2.5:
30119 #pragma omp for for-clause[optseq] new-line
30120 for-loop
30122 OpenMP 4.0:
30123 #pragma omp for simd for-simd-clause[optseq] new-line
30124 for-loop */
30126 #define OMP_FOR_CLAUSE_MASK \
30127 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30134 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30136 static tree
30139 {
30150 {
30155 {
30163 cclauses);
30167 cclauses);
30179 }
30180 }
30182 {
30185 }
30190 {
30193 }
30204 }
30206 /* OpenMP 2.5:
30207 # pragma omp master new-line
30208 structured-block */
30210 static tree
30212 {
30216 }
30218 /* OpenMP 2.5:
30219 # pragma omp ordered new-line
30220 structured-block */
30222 static tree
30224 {
30228 }
30230 /* OpenMP 2.5:
30232 section-scope:
30233 { section-sequence }
30235 section-sequence:
30236 section-directive[opt] structured-block
30237 section-sequence section-directive structured-block */
30239 static tree
30241 {
30252 {
30256 }
30259 {
30267 {
30271 }
30273 {
30276 }
30281 }
30292 }
30294 /* OpenMP 2.5:
30295 # pragma omp sections sections-clause[optseq] newline
30296 sections-scope */
30298 #define OMP_SECTIONS_CLAUSE_MASK \
30299 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30300 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30301 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30302 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30303 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30305 static tree
30308 {
30320 {
30323 }
30330 }
30332 /* OpenMP 2.5:
30333 # pragma omp parallel parallel-clause[optseq] new-line
30334 structured-block
30335 # pragma omp parallel for parallel-for-clause[optseq] new-line
30336 structured-block
30337 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30338 structured-block
30340 OpenMP 4.0:
30341 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30342 structured-block */
30344 #define OMP_PARALLEL_CLAUSE_MASK \
30345 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30348 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30349 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30350 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30351 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30353 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30355 static tree
30358 {
30367 {
30380 block);
30385 }
30387 {
30391 }
30393 {
30396 }
30398 {
30402 {
30412 block);
30415 }
30416 }
30426 }
30428 /* OpenMP 2.5:
30429 # pragma omp single single-clause[optseq] new-line
30430 structured-block */
30432 #define OMP_SINGLE_CLAUSE_MASK \
30433 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30434 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30435 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30436 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30438 static tree
30440 {
30450 }
30452 /* OpenMP 3.0:
30453 # pragma omp task task-clause[optseq] new-line
30454 structured-block */
30456 #define OMP_TASK_CLAUSE_MASK \
30457 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30467 static tree
30469 {
30480 }
30482 /* OpenMP 3.0:
30483 # pragma omp taskwait new-line */
30485 static void
30487 {
30490 }
30492 /* OpenMP 3.1:
30493 # pragma omp taskyield new-line */
30495 static void
30497 {
30500 }
30502 /* OpenMP 4.0:
30503 # pragma omp taskgroup new-line
30504 structured-block */
30506 static tree
30508 {
30512 }
30515 /* OpenMP 2.5:
30516 # pragma omp threadprivate (variable-list) */
30518 static void
30520 {
30521 tree vars;
30527 }
30529 /* OpenMP 4.0:
30530 # pragma omp cancel cancel-clause[optseq] new-line */
30532 #define OMP_CANCEL_CLAUSE_MASK \
30533 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30539 static void
30541 {
30545 }
30547 /* OpenMP 4.0:
30548 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30550 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30551 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30556 static void
30558 {
30559 tree clauses;
30563 {
30568 {
30571 }
30572 }
30574 {
30578 }
30581 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30583 pragma_tok);
30585 }
30587 /* OpenMP 4.0:
30588 #pragma omp distribute distribute-clause[optseq] new-line
30589 for-loop */
30591 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30592 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30595 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30597 static tree
30600 {
30609 {
30617 else
30620 {
30626 {
30629 cclauses);
30630 else
30632 cclauses);
30633 }
30638 cclauses);
30639 else
30641 cclauses);
30653 }
30654 }
30656 {
30659 }
30664 {
30667 }
30678 }
30680 /* OpenMP 4.0:
30681 # pragma omp teams teams-clause[optseq] new-line
30682 structured-block */
30684 #define OMP_TEAMS_CLAUSE_MASK \
30685 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30686 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30687 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30688 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30689 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30690 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30691 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30693 static tree
30696 {
30705 {
30709 {
30717 cclauses);
30721 cclauses);
30732 }
30733 }
30735 {
30738 }
30743 {
30746 }
30754 }
30756 /* OpenMP 4.0:
30757 # pragma omp target data target-data-clause[optseq] new-line
30758 structured-block */
30760 #define OMP_TARGET_DATA_CLAUSE_MASK \
30761 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30765 static tree
30767 {
30779 }
30781 /* OpenMP 4.0:
30782 # pragma omp target update target-update-clause[optseq] new-line */
30784 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30785 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30788 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30790 static bool
30793 {
30795 {
30797 "%<#pragma omp target update%> may only be "
30801 }
30803 tree clauses
30808 {
30810 "%<#pragma omp target update must contain at least one "
30813 }
30821 }
30823 /* OpenMP 4.0:
30824 # pragma omp target target-clause[optseq] new-line
30825 structured-block */
30827 #define OMP_TARGET_CLAUSE_MASK \
30828 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30832 static bool
30835 {
30837 {
30841 }
30844 {
30849 {
30857 {
30859 OMP_TARGET_CLAUSE_MASK,
30860 cclauses);
30862 }
30878 }
30880 {
30883 }
30885 {
30889 }
30891 {
30894 }
30895 }
30909 }
30911 /* OpenMP 4.0:
30912 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30914 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30915 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30916 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30917 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30918 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30919 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30920 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30922 static void
30925 {
30927 cp_omp_declare_simd_data data;
30929 {
30934 }
30945 {
30949 {
30962 }
30967 "%<#pragma omp declare simd%> not immediately followed by "
30971 }
30972 }
30974 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
30975 This function is modelled similar to the late parsing of omp declare
30976 simd. */
30978 static tree
30980 {
30986 {
30992 }
30994 {
30998 }
31003 {
31010 NULL);
31024 }
31029 }
31031 /* Finalize #pragma omp declare simd clauses after direct declarator has
31032 been parsed, and put that into "omp declare simd" attribute. */
31034 static tree
31036 {
31042 {
31047 }
31052 {
31070 }
31074 }
31077 /* OpenMP 4.0:
31078 # pragma omp declare target new-line
31079 declarations and definitions
31080 # pragma omp end declare target new-line */
31082 static void
31084 {
31087 }
31089 static void
31091 {
31094 {
31097 }
31099 {
31103 {
31106 }
31109 else
31110 {
31114 }
31115 }
31116 else
31117 {
31121 }
31125 "%<#pragma omp end declare target%> without corresponding "
31127 else
31129 }
31131 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
31132 expression and optional initializer clause of
31133 #pragma omp declare reduction. We store the expression(s) as
31134 either 3, 6 or 7 special statements inside of the artificial function's
31135 body. The first two statements are DECL_EXPRs for the artificial
31136 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
31137 expression that uses those variables.
31138 If there was any INITIALIZER clause, this is followed by further statements,
31139 the fourth and fifth statements are DECL_EXPRs for the artificial
31140 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
31141 constructor variant (first token after open paren is not omp_priv),
31142 then the sixth statement is a statement with the function call expression
31143 that uses the OMP_PRIV and optionally OMP_ORIG variable.
31144 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
31145 to initialize the OMP_PRIV artificial variable and there is seventh
31146 statement, a DECL_EXPR of the OMP_PRIV statement again. */
31148 static bool
31150 {
31162 tree combiner;
31177 {
31180 }
31183 {
31190 {
31193 }
31209 {
31213 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
31217 == CPP_CLOSE_PAREN
31220 {
31224 }
31229 }
31230 else
31231 {
31247 {
31252 }
31254 tree arg;
31267 }
31278 }
31284 }
31286 /* OpenMP 4.0
31287 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31288 initializer-clause[opt] new-line
31290 initializer-clause:
31291 initializer (omp_priv initializer)
31292 initializer (function-name (argument-list)) */
31294 static void
31297 {
31307 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
31314 {
31346 }
31358 /* Types may not be defined in declare reduction type list. */
31361 parser->type_definition_forbidden_message
31367 saved_colon_doesnt_start_class_def_p
31372 {
31376 ;
31397 else
31402 else
31404 }
31406 /* Restore the saved message. */
31409 parser->colon_doesnt_start_class_def_p
31414 {
31415 fail:
31418 }
31424 {
31425 tree fntype
31428 NULL_TREE);
31447 {
31452 }
31454 {
31456 {
31465 }
31472 }
31473 else
31474 {
31477 }
31480 else
31483 {
31486 }
31488 {
31491 else
31496 }
31501 else
31502 {
31511 }
31518 }
31522 done:
31523 /* Free any declarators allocated. */
31525 }
31527 /* OpenMP 4.0
31528 #pragma omp declare simd declare-simd-clauses[optseq] new-line
31529 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31530 initializer-clause[opt] new-line
31531 #pragma omp declare target new-line */
31533 static void
31536 {
31538 {
31543 {
31546 context);
31548 }
31551 {
31554 context);
31556 }
31558 {
31561 }
31563 {
31567 }
31568 }
31572 }
31574 /* Main entry point to OpenMP statement pragmas. */
31576 static void
31578 {
31579 tree stmt;
31584 {
31632 }
31636 }
31637 \f
31638 /* Transactional Memory parsing routines. */
31640 /* Parse a transaction attribute.
31642 txn-attribute:
31643 attribute
31644 [ [ identifier ] ]
31646 ??? Simplify this when C++0x bracket attributes are
31647 implemented properly. */
31649 static tree
31651 {
31666 {
31670 /* For keywords, use the canonical spelling,
31671 not the parsed identifier. */
31675 }
31676 else
31680 error1:
31683 }
31685 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31687 transaction-statement:
31688 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31689 compound-statement
31690 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31691 */
31693 static tree
31695 {
31710 else
31711 {
31715 }
31717 /* Parse a noexcept specification. */
31720 /* Keep track if we're in the lexical scope of an outer transaction. */
31732 }
31734 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31736 transaction-expression:
31737 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31738 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31739 */
31741 static tree
31743 {
31768 /* Set this early. This might mean that we allow transaction_cancel in
31769 an expression that we find out later actually has to be a constexpr.
31770 However, we expect that cxx_constant_value will be able to deal with
31771 this; also, if the noexcept has no constexpr, then what we parse next
31772 really is a transaction's body. */
31775 /* Parse a noexcept specification. */
31781 {
31788 }
31789 else
31790 {
31791 /* The only expression that is available got parsed for the noexcept
31792 already. noexcept is true then. */
31795 }
31804 }
31806 /* Parse a function-transaction-block.
31808 function-transaction-block:
31809 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31810 function-body
31811 __transaction_atomic txn-attribute[opt] function-try-block
31812 __transaction_relaxed ctor-initializer[opt] function-body
31813 __transaction_relaxed function-try-block
31814 */
31816 static bool
31818 {
31834 else
31835 {
31839 }
31847 else
31848 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31856 }
31858 /* Parse a __transaction_cancel statement.
31860 cancel-statement:
31861 __transaction_cancel txn-attribute[opt] ;
31862 __transaction_cancel txn-attribute[opt] throw-expression ;
31864 ??? Cancel and throw is not yet implemented. */
31866 static tree
31868 {
31874 RT_TRANSACTION_CANCEL);
31881 /* ??? Parse cancel-and-throw here. */
31886 {
31890 }
31892 {
31896 }
31898 {
31901 {
31907 }
31908 }
31910 {
31914 }
31920 }
31921 \f
31922 /* The parser. */
31926 \f
31927 /* Special handling for the first token or line in the file. The first
31928 thing in the file might be #pragma GCC pch_preprocess, which loads a
31929 PCH file, which is a GC collection point. So we need to handle this
31930 first pragma without benefit of an existing lexer structure.
31932 Always returns one token to the caller in *FIRST_TOKEN. This is
31933 either the true first token of the file, or the first token after
31934 the initial pragma. */
31936 static void
31938 {
31947 {
31954 }
31955 else
31958 /* Skip to the end of the pragma. */
31962 /* Now actually load the PCH file. */
31966 /* Read one more token to return to our caller. We have to do this
31967 after reading the PCH file in, since its pointers have to be
31968 live. */
31970 }
31972 /* Parses the grainsize pragma for the _Cilk_for statement.
31973 Syntax:
31974 #pragma cilk grainsize = <VALUE>. */
31976 static void
31978 {
31980 {
31985 {
31988 }
31990 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
31993 else
31995 "%<#pragma cilk grainsize%> is not followed by "
31998 }
32000 }
32002 /* Normal parsing of a pragma token. Here we can (and must) use the
32003 regular lexer. */
32005 static bool
32007 {
32019 {
32027 {
32037 }
32042 {
32052 }
32057 {
32063 "%<#pragma omp taskwait%> may only be "
32068 }
32073 {
32079 "%<#pragma omp taskyield%> may only be "
32084 }
32089 {
32095 "%<#pragma omp cancel%> may only be "
32100 }
32105 {
32111 "%<#pragma omp cancellation point%> may only be "
32116 }
32154 "%<#pragma omp section%> may only be used in "
32159 {
32166 {
32169 }
32172 }
32176 {
32180 }
32186 {
32190 }
32192 /* Ignore the pragma if Cilk Plus is not enabled. */
32194 {
32197 }
32198 else
32199 {
32203 }
32210 bad_stmt:
32213 }
32217 }
32219 /* The interface the pragma parsers have to the lexer. */
32221 enum cpp_ttype
32223 {
32236 else
32237 {
32241 }
32244 }
32246 \f
32247 /* External interface. */
32249 /* Parse one entire translation unit. */
32251 void
32253 {
32265 }
32267 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
32268 vectorlength clause:
32269 Syntax:
32270 vectorlength ( constant-expression ) */
32272 static tree
32275 {
32277 tree expr;
32278 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
32279 safelen clause. Thus, vectorlength is represented as OMP 4.0
32280 safelen. For SIMD-enabled function it is represented by OMP 4.0
32281 simdlen. */
32284 loc);
32285 else
32287 loc);
32295 /* If expr == error_mark_node, then don't emit any errors nor
32296 create a clause. if any of the above functions returns
32297 error mark node then they would have emitted an error message. */
32299 ;
32307 else
32308 {
32309 tree c;
32311 {
32316 }
32317 else
32318 {
32323 }
32324 }
32329 }
32331 /* Handles the Cilk Plus #pragma simd linear clause.
32332 Syntax:
32333 linear ( simd-linear-variable-list )
32335 simd-linear-variable-list:
32336 simd-linear-variable
32337 simd-linear-variable-list , simd-linear-variable
32339 simd-linear-variable:
32340 id-expression
32341 id-expression : simd-linear-step
32343 simd-linear-step:
32344 conditional-expression */
32346 static tree
32348 {
32354 {
32358 }
32363 {
32366 {
32370 }
32377 {
32381 }
32382 else
32383 {
32387 /* If present, parse the linear step. Otherwise, assume the default
32388 value of 1. */
32390 {
32397 {
32398 /* If an error has occurred, then the whole pragma is
32399 considered ill-formed. Thus, no reason to keep
32400 parsing. */
32403 }
32411 else
32413 "step size must be an integer constant "
32415 }
32417 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
32423 }
32428 else
32429 {
32434 }
32435 }
32439 }
32441 /* Returns the name of the next clause. If the clause is not
32442 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
32443 token is not consumed. Otherwise, the appropriate enum from the
32444 pragma_simd_clause is returned and the token is consumed. */
32446 static pragma_omp_clause
32448 {
32449 pragma_omp_clause clause_type;
32466 else
32471 }
32473 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
32475 static tree
32477 {
32482 {
32483 pragma_omp_clause c_kind;
32490 /* Use the OpenMP 4.0 equivalent function. */
32493 /* Use the OpenMP 4.0 equivalent function. */
32495 clauses);
32497 /* Use the OMP 4.0 equivalent function. */
32499 clauses);
32501 /* Use the OMP 4.0 equivalent function. */
32503 else
32504 {
32508 }
32509 }
32515 else
32517 }
32519 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
32521 static void
32523 {
32530 {
32534 }
32543 }
32545 /* Main entry-point for parsing Cilk Plus _Cilk_for
32546 loops. The return value is error_mark_node
32547 when errors happen and CILK_FOR tree on success. */
32549 static tree
32551 {
32566 else
32572 }
32574 /* Create an identifier for a generic parameter type (a synthesized
32575 template parameter implied by `auto' or a concept identifier). */
32578 static tree
32580 {
32584 }
32586 /* Predicate that behaves as is_auto_or_concept but matches the parent
32587 node of the generic type rather than the generic type itself. This
32588 allows for type transformation in add_implicit_template_parms. */
32592 {
32594 }
32596 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
32597 (creating a new template parameter list if necessary). Returns the newly
32598 created template type parm. */
32600 tree
32602 {
32605 /* We are either continuing a function template that already contains implicit
32606 template parameters, creating a new fully-implicit function template, or
32607 extending an existing explicit function template with implicit template
32608 parameters. */
32616 {
32620 }
32621 else
32622 {
32623 /* Roll back to the existing template parameter scope (in the case of
32624 extending an explicit function template) or introduce a new template
32625 parameter scope ahead of the function parameter scope (or class scope
32626 in the case of out-of-line member definitions). The function scope is
32627 added back after template parameter synthesis below. */
32632 {
32635 }
32637 {
32638 /* If not defining a class, then any class scope is a scope level in
32639 an out-of-line member definition. In this case simply wind back
32640 beyond the first such scope to inject the template parameter list.
32641 Otherwise wind back to the class being defined. The latter can
32642 occur in class member friend declarations such as:
32644 class A {
32645 void foo (auto);
32646 };
32647 class B {
32648 friend void A::foo (auto);
32649 };
32651 The template parameter list synthesized for the friend declaration
32652 must be injected in the scope of 'B'. This can also occur in
32653 erroneous cases such as:
32655 struct A {
32656 struct B {
32657 void foo (auto);
32658 };
32659 void B::foo (auto) {}
32660 };
32662 Here the attempted definition of 'B::foo' within 'A' is ill-formed
32663 but, nevertheless, the template parameter list synthesized for the
32664 declarator should be injected into the scope of 'A' as if the
32665 ill-formed template was specified explicitly. */
32668 {
32671 }
32672 }
32678 {
32679 /* Introduce a new template parameter list for implicit template
32680 parameters. */
32684 parser->implicit_template_scope
32691 }
32692 else
32693 {
32694 /* Synthesize implicit template parameters at the end of the explicit
32695 template parameter list. */
32702 parser->implicit_template_parms
32704 }
32705 }
32707 /* Synthesize a new template parameter and track the current template
32708 parameter chain with implicit_template_parms. */
32712 synth_id);
32713 tree new_parm
32715 input_location,
32722 parser->implicit_template_parms
32724 else
32729 /* If creating a fully implicit function template, start the new implicit
32730 template parameter list with this synthesized type, otherwise grow the
32731 current template parameter list. */
32734 {
32741 }
32742 else
32743 {
32748 }
32753 }
32755 /* Finish the declaration of a fully implicit function template. Such a
32756 template has no explicit template parameter list so has not been through the
32757 normal template head and tail processing. synthesize_implicit_template_parm
32758 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32759 provided if the declaration is a class member such that its template
32760 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32761 form is returned. Otherwise NULL_TREE is returned. */
32763 tree
32765 {
32770 {
32774 }
32784 }