| blob | b106f3b03cdf64d1a0762bee740a121bfa38083a |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2014 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
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
2127 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2132 static enum tree_code cp_parser_ptr_operator
2134 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2136 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2138 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2140 static tree cp_parser_late_return_type_opt
2142 static tree cp_parser_declarator_id
2144 static tree cp_parser_type_id
2146 static tree cp_parser_template_type_arg
2149 static tree cp_parser_type_id_1
2151 static void cp_parser_type_specifier_seq
2153 static tree cp_parser_parameter_declaration_clause
2155 static tree cp_parser_parameter_declaration_list
2159 static tree cp_parser_default_argument
2161 static void cp_parser_function_body
2163 static tree cp_parser_initializer
2165 static tree cp_parser_initializer_clause
2167 static tree cp_parser_braced_list
2172 static bool cp_parser_ctor_initializer_opt_and_function_body
2175 static tree cp_parser_late_parsing_omp_declare_simd
2178 static tree cp_parser_late_parsing_cilk_simd_fn_info
2181 static tree synthesize_implicit_template_parm
2183 static tree finish_fully_implicit_template
2186 /* Classes [gram.class] */
2188 static tree cp_parser_class_name
2190 static tree cp_parser_class_specifier
2192 static tree cp_parser_class_head
2194 static enum tag_types cp_parser_class_key
2196 static void cp_parser_type_parameter_key
2198 static void cp_parser_member_specification_opt
2200 static void cp_parser_member_declaration
2202 static tree cp_parser_pure_specifier
2204 static tree cp_parser_constant_initializer
2207 /* Derived classes [gram.class.derived] */
2209 static tree cp_parser_base_clause
2211 static tree cp_parser_base_specifier
2214 /* Special member functions [gram.special] */
2216 static tree cp_parser_conversion_function_id
2218 static tree cp_parser_conversion_type_id
2222 static bool cp_parser_ctor_initializer_opt
2224 static void cp_parser_mem_initializer_list
2226 static tree cp_parser_mem_initializer
2228 static tree cp_parser_mem_initializer_id
2231 /* Overloading [gram.over] */
2233 static tree cp_parser_operator_function_id
2235 static tree cp_parser_operator
2238 /* Templates [gram.temp] */
2240 static void cp_parser_template_declaration
2242 static tree cp_parser_template_parameter_list
2244 static tree cp_parser_template_parameter
2246 static tree cp_parser_type_parameter
2248 static tree cp_parser_template_id
2250 static tree cp_parser_template_name
2252 static tree cp_parser_template_argument_list
2254 static tree cp_parser_template_argument
2256 static void cp_parser_explicit_instantiation
2258 static void cp_parser_explicit_specialization
2261 /* Exception handling [gram.exception] */
2263 static tree cp_parser_try_block
2265 static bool cp_parser_function_try_block
2267 static void cp_parser_handler_seq
2269 static void cp_parser_handler
2271 static tree cp_parser_exception_declaration
2273 static tree cp_parser_throw_expression
2275 static tree cp_parser_exception_specification_opt
2277 static tree cp_parser_type_id_list
2280 /* GNU Extensions */
2282 static tree cp_parser_asm_specification_opt
2284 static tree cp_parser_asm_operand_list
2286 static tree cp_parser_asm_clobber_list
2288 static tree cp_parser_asm_label_list
2290 static bool cp_next_tokens_can_be_attribute_p
2292 static bool cp_next_tokens_can_be_gnu_attribute_p
2294 static bool cp_next_tokens_can_be_std_attribute_p
2296 static bool cp_nth_tokens_can_be_std_attribute_p
2298 static bool cp_nth_tokens_can_be_gnu_attribute_p
2300 static bool cp_nth_tokens_can_be_attribute_p
2302 static tree cp_parser_attributes_opt
2304 static tree cp_parser_gnu_attributes_opt
2306 static tree cp_parser_gnu_attribute_list
2308 static tree cp_parser_std_attribute
2310 static tree cp_parser_std_attribute_spec
2312 static tree cp_parser_std_attribute_spec_seq
2314 static bool cp_parser_extension_opt
2316 static void cp_parser_label_declaration
2319 /* Transactional Memory Extensions */
2321 static tree cp_parser_transaction
2323 static tree cp_parser_transaction_expression
2325 static bool cp_parser_function_transaction
2327 static tree cp_parser_transaction_cancel
2331 pragma_external,
2332 pragma_member,
2333 pragma_objc_icode,
2334 pragma_stmt,
2335 pragma_compound
2336 };
2337 static bool cp_parser_pragma
2340 /* Objective-C++ Productions */
2342 static tree cp_parser_objc_message_receiver
2344 static tree cp_parser_objc_message_args
2346 static tree cp_parser_objc_message_expression
2348 static tree cp_parser_objc_encode_expression
2350 static tree cp_parser_objc_defs_expression
2352 static tree cp_parser_objc_protocol_expression
2354 static tree cp_parser_objc_selector_expression
2356 static tree cp_parser_objc_expression
2358 static bool cp_parser_objc_selector_p
2360 static tree cp_parser_objc_selector
2362 static tree cp_parser_objc_protocol_refs_opt
2364 static void cp_parser_objc_declaration
2366 static tree cp_parser_objc_statement
2368 static bool cp_parser_objc_valid_prefix_attributes
2370 static void cp_parser_objc_at_property_declaration
2372 static void cp_parser_objc_at_synthesize_declaration
2374 static void cp_parser_objc_at_dynamic_declaration
2376 static tree cp_parser_objc_struct_declaration
2379 /* Utility Routines */
2381 static tree cp_parser_lookup_name
2383 static tree cp_parser_lookup_name_simple
2385 static tree cp_parser_maybe_treat_template_as_class
2387 static bool cp_parser_check_declarator_template_parameters
2389 static bool cp_parser_check_template_parameters
2391 static tree cp_parser_simple_cast_expression
2393 static tree cp_parser_global_scope_opt
2395 static bool cp_parser_constructor_declarator_p
2397 static tree cp_parser_function_definition_from_specifiers_and_declarator
2399 static tree cp_parser_function_definition_after_declarator
2401 static void cp_parser_template_declaration_after_export
2403 static void cp_parser_perform_template_parameter_access_checks
2405 static tree cp_parser_single_declaration
2407 static tree cp_parser_functional_cast
2409 static tree cp_parser_save_member_function_body
2411 static tree cp_parser_save_nsdmi
2413 static tree cp_parser_enclosed_template_argument_list
2415 static void cp_parser_save_default_args
2417 static void cp_parser_late_parsing_for_member
2419 static tree cp_parser_late_parse_one_default_arg
2421 static void cp_parser_late_parsing_nsdmi
2423 static void cp_parser_late_parsing_default_args
2425 static tree cp_parser_sizeof_operand
2427 static tree cp_parser_trait_expr
2429 static bool cp_parser_declares_only_class_p
2431 static void cp_parser_set_storage_class
2433 static void cp_parser_set_decl_spec_type
2435 static void set_and_check_decl_spec_loc
2438 static bool cp_parser_friend_p
2440 static void cp_parser_required_error
2446 static bool cp_parser_token_starts_function_definition_p
2448 static bool cp_parser_next_token_starts_class_definition_p
2450 static bool cp_parser_next_token_ends_template_argument_p
2452 static bool cp_parser_nth_token_starts_template_argument_list_p
2454 static enum tag_types cp_parser_token_is_class_key
2456 static enum tag_types cp_parser_token_is_type_parameter_key
2458 static void cp_parser_check_class_key
2460 static void cp_parser_check_access_in_redeclaration
2462 static bool cp_parser_optional_template_keyword
2464 static void cp_parser_pre_parsed_nested_name_specifier
2466 static bool cp_parser_cache_group
2468 static tree cp_parser_cache_defarg
2470 static void cp_parser_parse_tentatively
2472 static void cp_parser_commit_to_tentative_parse
2474 static void cp_parser_commit_to_topmost_tentative_parse
2476 static void cp_parser_abort_tentative_parse
2478 static bool cp_parser_parse_definitely
2482 static bool cp_parser_uncommitted_to_tentative_parse_p
2484 static void cp_parser_error
2486 static void cp_parser_name_lookup_error
2488 static bool cp_parser_simulate_error
2490 static bool cp_parser_check_type_definition
2492 static void cp_parser_check_for_definition_in_return_type
2494 static void cp_parser_check_for_invalid_template_id
2496 static bool cp_parser_non_integral_constant_expression
2498 static void cp_parser_diagnose_invalid_type_name
2500 static bool cp_parser_parse_and_diagnose_invalid_type_name
2502 static int cp_parser_skip_to_closing_parenthesis
2504 static void cp_parser_skip_to_end_of_statement
2506 static void cp_parser_consume_semicolon_at_end_of_statement
2508 static void cp_parser_skip_to_end_of_block_or_statement
2510 static bool cp_parser_skip_to_closing_brace
2512 static void cp_parser_skip_to_end_of_template_parameter_list
2514 static void cp_parser_skip_to_pragma_eol
2516 static bool cp_parser_error_occurred
2518 static bool cp_parser_allow_gnu_extensions_p
2520 static bool cp_parser_is_pure_string_literal
2522 static bool cp_parser_is_string_literal
2524 static bool cp_parser_is_keyword
2526 static tree cp_parser_make_typename_type
2530 static bool cp_parser_compound_literal_p
2532 static bool cp_parser_array_designator_p
2534 static bool cp_parser_skip_to_closing_square_bracket
2537 /* Returns nonzero if we are parsing tentatively. */
2541 {
2543 }
2545 /* Returns nonzero if TOKEN is a string literal. */
2547 static bool
2549 {
2555 }
2557 /* Returns nonzero if TOKEN is a string literal
2558 of a user-defined string literal. */
2560 static bool
2562 {
2569 }
2571 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2573 static bool
2575 {
2577 }
2579 /* If not parsing tentatively, issue a diagnostic of the form
2580 FILE:LINE: MESSAGE before TOKEN
2581 where TOKEN is the next token in the input stream. MESSAGE
2582 (specified by the caller) is usually of the form "expected
2583 OTHER-TOKEN". */
2585 static void
2587 {
2589 {
2591 /* This diagnostic makes more sense if it is tagged to the line
2592 of the token we just peeked at. */
2596 {
2601 }
2604 /* Because c_parser_error does not understand
2605 CPP_KEYWORD, keywords are treated like
2606 identifiers. */
2609 }
2610 }
2612 /* Issue an error about name-lookup failing. NAME is the
2613 IDENTIFIER_NODE DECL is the result of
2614 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2615 the thing that we hoped to find. */
2617 static void
2619 tree name,
2620 tree decl,
2621 name_lookup_error desired,
2622 location_t location)
2623 {
2624 /* If name lookup completely failed, tell the user that NAME was not
2625 declared. */
2627 {
2640 else
2642 }
2644 {
2646 {
2663 }
2664 }
2666 {
2668 {
2678 name);
2682 }
2683 }
2684 else
2685 {
2687 {
2700 }
2701 }
2702 }
2704 /* If we are parsing tentatively, remember that an error has occurred
2705 during this tentative parse. Returns true if the error was
2706 simulated; false if a message should be issued by the caller. */
2708 static bool
2710 {
2712 {
2715 }
2717 }
2719 /* This function is called when a type is defined. If type
2720 definitions are forbidden at this point, an error message is
2721 issued. */
2723 static bool
2725 {
2726 /* If types are forbidden here, issue a message. */
2728 {
2729 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2730 in the message need to be interpreted. */
2733 }
2735 }
2737 /* This function is called when the DECLARATOR is processed. The TYPE
2738 was a type defined in the decl-specifiers. If it is invalid to
2739 define a type in the decl-specifiers for DECLARATOR, an error is
2740 issued. TYPE_LOCATION is the location of TYPE and is used
2741 for error reporting. */
2743 static void
2746 {
2747 /* [dcl.fct] forbids type definitions in return types.
2748 Unfortunately, it's not easy to know whether or not we are
2749 processing a return type until after the fact. */
2757 {
2762 type);
2763 }
2764 }
2766 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2767 "<" in any valid C++ program. If the next token is indeed "<",
2768 issue a message warning the user about what appears to be an
2769 invalid attempt to form a template-id. LOCATION is the location
2770 of the type-specifier (TYPE) */
2772 static void
2774 tree type,
2776 location_t location)
2777 {
2781 {
2785 {
2788 else
2790 }
2791 else
2793 /* Remember the location of the invalid "<". */
2796 /* Consume the "<". */
2798 /* Parse the template arguments. */
2800 /* Permanently remove the invalid template arguments so that
2801 this error message is not issued again. */
2804 }
2805 }
2807 /* If parsing an integral constant-expression, issue an error message
2808 about the fact that THING appeared and return true. Otherwise,
2809 return false. In either case, set
2810 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2812 static bool
2814 non_integral_constant thing)
2815 {
2818 {
2820 {
2823 {
2830 "enumeration type cannot appear in a "
2921 }
2925 }
2926 }
2928 }
2930 /* Emit a diagnostic for an invalid type name. This function commits
2931 to the current active tentative parse, if any. (Otherwise, the
2932 problematic construct might be encountered again later, resulting
2933 in duplicate error messages.) LOCATION is the location of ID. */
2935 static void
2937 location_t location)
2938 {
2941 /* Try to lookup the identifier. */
2948 /* If the lookup was ambiguous, an error will already have
2949 been issued. */
2951 /* If the lookup found a template-name, it means that the user forgot
2952 to specify an argument list. Emit a useful error message. */
2956 decl);
2960 /* Something like 'unsigned A a;' */
2963 {
2964 /* Issue an error message. */
2966 /* If we're in a template class, it's possible that the user was
2967 referring to a type from a base class. For example:
2969 template <typename T> struct A { typedef T X; };
2970 template <typename T> struct B : public A<T> { X x; };
2972 The user should have said "typename A<T>::X". */
2985 {
2986 tree b;
2989 b;
2991 {
2995 {
2996 tree field;
2997 /* Go from a particular instantiation of the
2998 template (which will have an empty TYPE_FIELDs),
2999 to the main version. */
3002 field;
3006 {
3011 }
3014 }
3015 }
3016 }
3017 }
3018 /* Here we diagnose qualified-ids where the scope is actually correct,
3019 but the identifier does not resolve to a valid type name. */
3021 {
3023 {
3028 else
3032 }
3035 {
3036 /* A<T>::A<T>() */
3042 }
3049 {
3054 else
3058 }
3059 else
3061 }
3062 }
3064 /* Check for a common situation where a type-name should be present,
3065 but is not, and issue a sensible error message. Returns true if an
3066 invalid type-name was detected.
3068 The situation handled by this function are variable declarations of the
3069 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3070 Usually, `ID' should name a type, but if we got here it means that it
3071 does not. We try to emit the best possible error message depending on
3072 how exactly the id-expression looks like. */
3074 static bool
3076 {
3077 tree id;
3080 /* Avoid duplicate error about ambiguous lookup. */
3082 {
3086 }
3095 /* If the next token is a (, this is a function with no explicit return
3096 type, i.e. constructor, destructor or conversion op. */
3099 {
3102 }
3106 /* Emit a diagnostic for the invalid type. */
3108 out:
3109 /* If we aren't in the middle of a declarator (i.e. in a
3110 parameter-declaration-clause), skip to the end of the declaration;
3111 there's no point in trying to process it. */
3115 }
3117 /* Consume tokens up to, and including, the next non-nested closing `)'.
3118 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3119 are doing error recovery. Returns -1 if OR_COMMA is true and we
3120 found an unnested comma. */
3122 static int
3127 {
3137 {
3141 {
3144 /* If we've run out of tokens, then there is no closing `)'. */
3147 /* This is good for lambda expression capture-lists. */
3157 /* This matches the processing in skip_to_end_of_statement. */
3183 {
3187 }
3192 }
3194 /* Consume the token. */
3196 }
3197 }
3199 /* Consume tokens until we reach the end of the current statement.
3200 Normally, that will be just before consuming a `;'. However, if a
3201 non-nested `}' comes first, then we stop before consuming that. */
3203 static void
3205 {
3208 /* Unwind generic function template scope if necessary. */
3213 {
3217 {
3220 /* If we've run out of tokens, stop. */
3224 /* If the next token is a `;', we have reached the end of the
3225 statement. */
3231 /* If this is a non-nested '}', stop before consuming it.
3232 That way, when confronted with something like:
3234 { 3 + }
3236 we stop before consuming the closing '}', even though we
3237 have not yet reached a `;'. */
3241 /* If it is the closing '}' for a block that we have
3242 scanned, stop -- but only after consuming the token.
3243 That way given:
3245 void f g () { ... }
3246 typedef int I;
3248 we will stop after the body of the erroneously declared
3249 function, but before consuming the following `typedef'
3250 declaration. */
3252 {
3255 }
3263 }
3265 /* Consume the token. */
3267 }
3268 }
3270 /* This function is called at the end of a statement or declaration.
3271 If the next token is a semicolon, it is consumed; otherwise, error
3272 recovery is attempted. */
3274 static void
3276 {
3277 /* Look for the trailing `;'. */
3279 {
3280 /* If there is additional (erroneous) input, skip to the end of
3281 the statement. */
3283 /* If the next token is now a `;', consume it. */
3286 }
3287 }
3289 /* Skip tokens until we have consumed an entire block, or until we
3290 have consumed a non-nested `;'. */
3292 static void
3294 {
3297 /* Unwind generic function template scope if necessary. */
3302 {
3306 {
3309 /* If we've run out of tokens, stop. */
3313 /* Stop if this is an unnested ';'. */
3319 /* Stop if this is an unnested '}', or closes the outermost
3320 nesting level. */
3321 nesting_depth--;
3329 /* Nest. */
3330 nesting_depth++;
3335 }
3337 /* Consume the token. */
3339 }
3340 }
3342 /* Skip tokens until a non-nested closing curly brace is the next
3343 token, or there are no more tokens. Return true in the first case,
3344 false otherwise. */
3346 static bool
3348 {
3352 {
3356 {
3359 /* If we've run out of tokens, stop. */
3363 /* If the next token is a non-nested `}', then we have reached
3364 the end of the current block. */
3370 /* If it the next token is a `{', then we are entering a new
3371 block. Consume the entire block. */
3377 }
3379 /* Consume the token. */
3381 }
3382 }
3384 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3385 parameter is the PRAGMA token, allowing us to purge the entire pragma
3386 sequence. */
3388 static void
3390 {
3395 do
3399 /* Ensure that the pragma is not parsed again. */
3401 }
3403 /* Require pragma end of line, resyncing with it as necessary. The
3404 arguments are as for cp_parser_skip_to_pragma_eol. */
3406 static void
3408 {
3412 }
3414 /* This is a simple wrapper around make_typename_type. When the id is
3415 an unresolved identifier node, we can provide a superior diagnostic
3416 using cp_parser_diagnose_invalid_type_name. */
3418 static tree
3420 location_t id_location)
3421 {
3422 tree result;
3424 {
3430 }
3432 }
3434 /* This is a wrapper around the
3435 make_{pointer,ptrmem,reference}_declarator functions that decides
3436 which one to call based on the CODE and CLASS_TYPE arguments. The
3437 CODE argument should be one of the values returned by
3438 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3439 appertain to the pointer or reference. */
3443 cp_cv_quals cv_qualifiers,
3445 tree attributes)
3446 {
3453 else
3463 }
3465 /* Create a new C++ parser. */
3469 {
3474 /* cp_lexer_new_main is called before doing GC allocation because
3475 cp_lexer_new_main might load a PCH file. */
3478 /* Initialize the binops_by_token so that we can get the tree
3479 directly from the token. */
3487 /* For now, we always accept GNU extensions. */
3490 /* The `>' token is a greater-than operator, not the end of a
3491 template-id. */
3496 /* We are not parsing a constant-expression. */
3501 /* Local variable names are not forbidden. */
3504 /* We are not processing an `extern "C"' declaration. */
3507 /* We are not processing a declarator. */
3510 /* We are not processing a template-argument-list. */
3513 /* We are not in an iteration statement. */
3516 /* We are not in a switch statement. */
3519 /* We are not parsing a type-id inside an expression. */
3522 /* Declarations aren't implicitly extern "C". */
3525 /* String literals should be translated to the execution character set. */
3528 /* We are not parsing a function body. */
3531 /* We can correct until told otherwise. */
3534 /* The unparsed function queue is empty. */
3537 /* There are no classes being defined. */
3540 /* No template parameters apply. */
3543 /* Not declaring an implicit function template. */
3550 }
3552 /* Create a cp_lexer structure which will emit the tokens in CACHE
3553 and push it onto the parser's lexer stack. This is used for delayed
3554 parsing of in-class method bodies and default arguments, and should
3555 not be confused with tentative parsing. */
3556 static void
3558 {
3563 /* Move the current source position to that of the first token in the
3564 new lexer. */
3566 }
3568 /* Pop the top lexer off the parser stack. This is never used for the
3569 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3570 static void
3572 {
3577 /* Put the current source position back where it was before this
3578 lexer was pushed. */
3580 }
3582 /* Lexical conventions [gram.lex] */
3584 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3585 identifier. */
3587 static tree
3589 {
3592 /* Look for the identifier. */
3594 /* Return the value. */
3596 }
3598 /* Parse a sequence of adjacent string constants. Returns a
3599 TREE_STRING representing the combined, nul-terminated string
3600 constant. If TRANSLATE is true, translate the string to the
3601 execution character set. If WIDE_OK is true, a wide string is
3602 invalid here.
3604 C++98 [lex.string] says that if a narrow string literal token is
3605 adjacent to a wide string literal token, the behavior is undefined.
3606 However, C99 6.4.5p4 says that this results in a wide string literal.
3607 We follow C99 here, for consistency with the C front end.
3609 This code is largely lifted from lex_string() in c-lex.c.
3611 FUTURE: ObjC++ will need to handle @-strings here. */
3612 static tree
3615 {
3616 tree value;
3623 tree string_tree;
3629 {
3632 }
3635 {
3639 }
3640 else
3641 {
3644 }
3647 /* Try to avoid the overhead of creating and destroying an obstack
3648 for the common case of just one string. */
3651 {
3659 {
3663 }
3664 else
3668 }
3669 else
3670 {
3674 do
3675 {
3677 count++;
3682 {
3685 {
3688 }
3691 {
3696 }
3698 }
3699 else
3703 {
3708 "unsupported non-standard concatenation "
3710 }
3716 {
3720 }
3721 else
3722 {
3726 }
3727 }
3731 }
3734 {
3737 }
3741 {
3746 {
3761 }
3766 {
3771 else
3773 }
3774 }
3775 else
3776 /* cpp_interpret_string has issued an error. */
3783 }
3785 /* Look up a literal operator with the name and the exact arguments. */
3787 static tree
3789 {
3796 {
3802 {
3805 {
3815 }
3818 /* May be this should be sufficient_parms_p instead,
3819 depending on how exactly should user-defined literals
3820 work in presence of default arguments on the literal
3821 operator parameters. */
3824 }
3825 }
3828 }
3830 /* Parse a user-defined char constant. Returns a call to a user-defined
3831 literal operator taking the character as an argument. */
3833 static tree
3835 {
3843 /* Build up a call to the user-defined operator */
3844 /* Lookup the name we got back from the id-expression. */
3849 {
3854 }
3863 }
3865 /* A subroutine of cp_parser_userdef_numeric_literal to
3866 create a char... template parameter pack from a string node. */
3868 static tree
3870 {
3871 tree charvec;
3877 /* Fill in CHARVEC with all of the parameters. */
3882 /* Build the argument packs. */
3889 }
3891 /* A subroutine of cp_parser_userdef_numeric_literal to
3892 create a char... template parameter pack from a string node. */
3894 static tree
3896 {
3897 tree charvec;
3908 /* First template parm is character type. */
3911 /* Fill in CHARVEC with all of the parameters. */
3918 /* Build the argument packs. */
3925 }
3927 /* Parse a user-defined numeric constant. returns a call to a user-defined
3928 literal operator. */
3930 static tree
3932 {
3943 /* Look for a literal operator taking the exact type of numeric argument
3944 as the literal value. */
3949 {
3952 {
3956 long_long_unsigned_type_node);
3957 else
3958 {
3962 long_double_type_node);
3966 }
3969 }
3970 }
3973 /* If the numeric argument didn't work, look for a raw literal
3974 operator taking a const char* argument consisting of the number
3975 in string format. */
3980 {
3983 {
3986 }
3987 }
3990 /* If the raw literal didn't work, look for a non-type template
3991 function with parameter pack char.... Call the function with
3992 template parameter characters representing the number. */
3996 {
4001 {
4004 }
4005 }
4013 }
4015 /* Parse a user-defined string constant. Returns a call to a user-defined
4016 literal operator taking a character pointer and the length of the string
4017 as arguments. */
4019 static tree
4021 {
4030 /* Look for a template function with typename parameter CharT
4031 and parameter pack CharT... Call the function with
4032 template parameter characters representing the string. */
4036 {
4041 {
4044 }
4045 }
4048 /* Build up a call to the user-defined operator */
4049 /* Lookup the name we got back from the id-expression. */
4055 {
4059 }
4068 }
4071 /* Basic concepts [gram.basic] */
4073 /* Parse a translation-unit.
4075 translation-unit:
4076 declaration-seq [opt]
4078 Returns TRUE if all went well. */
4080 static bool
4082 {
4083 /* The address of the first non-permanent object on the declarator
4084 obstack. */
4089 /* Create the declarator obstack, if necessary. */
4091 {
4093 /* Create the error declarator. */
4095 /* Create the empty parameter list. */
4097 /* Remember where the base of the declarator obstack lies. */
4099 }
4103 /* If there are no tokens left then all went well. */
4105 {
4106 /* Get rid of the token array; we don't need it any more. */
4110 /* This file might have been a context that's implicitly extern
4111 "C". If so, pop the lang context. (Only relevant for PCH.) */
4113 {
4116 }
4118 /* Finish up. */
4122 }
4123 else
4124 {
4127 }
4129 /* Make sure the declarator obstack was fully cleaned up. */
4133 /* All went well. */
4135 }
4137 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4138 decltype context. */
4142 {
4147 }
4149 /* We're about to parse a collection of statements. If we're currently
4150 parsing tentatively, set up a firewall so that any nested
4151 cp_parser_commit_to_tentative_parse won't affect the current context. */
4153 static cp_token_position
4155 {
4162 }
4164 /* We've finished parsing the collection of statements. Wrap up the
4165 firewall and replace the relevant tokens with the parsed form. */
4167 static void
4169 tree expr)
4170 {
4174 /* Finish the firewall level. */
4176 /* And remember the result of the parse for when we try again. */
4182 }
4184 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4185 enclosing parentheses. */
4187 static tree
4189 {
4192 /* Consume the '('. */
4194 /* Start the statement-expression. */
4196 /* Parse the compound-statement. */
4198 /* Finish up. */
4200 /* Consume the ')'. */
4206 }
4208 /* Expressions [gram.expr] */
4210 /* Parse a primary-expression.
4212 primary-expression:
4213 literal
4214 this
4215 ( expression )
4216 id-expression
4217 lambda-expression (C++11)
4219 GNU Extensions:
4221 primary-expression:
4222 ( compound-statement )
4223 __builtin_va_arg ( assignment-expression , type-id )
4224 __builtin_offsetof ( type-id , offsetof-expression )
4226 C++ Extensions:
4227 __has_nothrow_assign ( type-id )
4228 __has_nothrow_constructor ( type-id )
4229 __has_nothrow_copy ( type-id )
4230 __has_trivial_assign ( type-id )
4231 __has_trivial_constructor ( type-id )
4232 __has_trivial_copy ( type-id )
4233 __has_trivial_destructor ( type-id )
4234 __has_virtual_destructor ( type-id )
4235 __is_abstract ( type-id )
4236 __is_base_of ( type-id , type-id )
4237 __is_class ( type-id )
4238 __is_empty ( type-id )
4239 __is_enum ( type-id )
4240 __is_final ( type-id )
4241 __is_literal_type ( type-id )
4242 __is_pod ( type-id )
4243 __is_polymorphic ( type-id )
4244 __is_std_layout ( type-id )
4245 __is_trivial ( type-id )
4246 __is_union ( type-id )
4248 Objective-C++ Extension:
4250 primary-expression:
4251 objc-expression
4253 literal:
4254 __null
4256 ADDRESS_P is true iff this expression was immediately preceded by
4257 "&" and therefore might denote a pointer-to-member. CAST_P is true
4258 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4259 true iff this expression is a template argument.
4261 Returns a representation of the expression. Upon return, *IDK
4262 indicates what kind of id-expression (if any) was present. */
4264 static tree
4271 {
4274 /* Assume the primary expression is not an id-expression. */
4277 /* Peek at the next token. */
4280 {
4281 /* literal:
4282 integer-literal
4283 character-literal
4284 floating-literal
4285 string-literal
4286 boolean-literal
4287 pointer-literal
4288 user-defined-literal */
4299 {
4303 }
4304 /* Floating-point literals are only allowed in an integral
4305 constant expression if they are cast to an integral or
4306 enumeration type. */
4310 {
4311 /* CAST_P will be set even in invalid code like "int(2.7 +
4312 ...)". Therefore, we have to check that the next token
4313 is sure to end the cast. */
4315 {
4320 enumerator-definition. */
4322 /* The curly brace at the end of an enum-specifier. */
4324 /* The end of a statement. */
4326 /* The end of the cast-expression. */
4328 /* The end of an array bound. */
4330 /* The closing ">" in a template-argument-list. */
4333 /* C++0x only: A ">>" treated like two ">" tokens,
4334 in a template-argument-list. */
4339 }
4341 /* If we are within a cast, then the constraint that the
4342 cast is to an integral or enumeration type will be
4343 checked at that point. If we are not within a cast, then
4344 this code is invalid. */
4347 }
4366 /* ??? Should wide strings be allowed when parser->translate_strings_p
4367 is false (i.e. in attributes)? If not, we can kill the third
4368 argument to cp_parser_string_literal. */
4374 /* If we see `( { ' then we are looking at the beginning of
4375 a GNU statement-expression. */
4378 {
4379 /* Statement-expressions are not allowed by the standard. */
4383 /* And they're not allowed outside of a function-body; you
4384 cannot, for example, write:
4386 int i = ({ int j = 3; j + 1; });
4388 at class or namespace scope. */
4391 {
4393 "statement-expressions are not allowed outside "
4399 }
4400 else
4402 }
4403 /* Otherwise it's a normal parenthesized expression. */
4404 {
4405 tree expr;
4408 /* Consume the `('. */
4410 /* Within a parenthesized expression, a `>' token is always
4411 the greater-than operator. */
4412 saved_greater_than_is_operator_p
4416 /* Parse the parenthesized expression. */
4418 /* Let the front end know that this expression was
4419 enclosed in parentheses. This matters in case, for
4420 example, the expression is of the form `A::B', since
4421 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4422 not. */
4424 /* DR 705: Wrapping an unqualified name in parentheses
4425 suppresses arg-dependent lookup. We want to pass back
4426 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4427 (c++/37862), but none of the others. */
4431 /* The `>' token might be the end of a template-id or
4432 template-parameter-list now. */
4433 parser->greater_than_is_operator_p
4435 /* Consume the `)'. */
4440 }
4444 /* We have an Objective-C++ message. */
4446 {
4448 /* Don't warn about a failed tentative parse. */
4453 }
4457 /* We have an Objective-C++ string literal. */
4464 {
4465 /* These two are the boolean literals. */
4473 /* The `__null' literal. */
4478 /* The `nullptr' literal. */
4483 /* Recognize the `this' keyword. */
4487 {
4491 }
4492 /* Pointers cannot appear in constant-expressions. */
4497 /* The `operator' keyword can be the beginning of an
4498 id-expression. */
4505 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4506 __func__ are the names of variables. */
4510 {
4511 tree expression;
4512 tree type;
4513 source_location type_location;
4515 /* The `__builtin_va_arg' construct is used to handle
4516 `va_arg'. Consume the `__builtin_va_arg' token. */
4518 /* Look for the opening `('. */
4520 /* Now, parse the assignment-expression. */
4522 /* Look for the `,'. */
4525 /* Parse the type-id. */
4527 /* Look for the closing `)'. */
4529 /* Using `va_arg' in a constant-expression is not
4530 allowed. */
4532 NIC_VA_ARG))
4535 }
4565 /* Objective-C++ expressions. */
4575 {
4580 }
4584 }
4586 /* An id-expression can start with either an identifier, a
4587 `::' as the beginning of a qualified-id, or the "operator"
4588 keyword. */
4593 {
4594 tree id_expression;
4595 tree decl;
4601 id_expression:
4602 /* Parse the id-expression. */
4603 id_expression
4620 /* If we have a template-id, then no further lookup is
4621 required. If the template-id was for a template-class, we
4622 will sometimes have a TYPE_DECL at this point. */
4626 /* Look up the name. */
4627 else
4628 {
4629 tree ambiguous_decls;
4631 /* If we already know that this lookup is ambiguous, then
4632 we've already issued an error message; there's no reason
4633 to check again. */
4636 {
4639 }
4642 none_type,
4643 template_p,
4648 /* If the lookup was ambiguous, an error will already have
4649 been issued. */
4653 /* In Objective-C++, we may have an Objective-C 2.0
4654 dot-syntax for classes here. */
4659 {
4660 tree component;
4667 }
4669 /* In Objective-C++, an instance variable (ivar) may be preferred
4670 to whatever cp_parser_lookup_name() found. */
4673 /* If name lookup gives us a SCOPE_REF, then the
4674 qualifying scope was dependent. */
4676 {
4677 /* At this point, we do not know if DECL is a valid
4678 integral constant expression. We assume that it is
4679 in fact such an expression, so that code like:
4681 template <int N> struct A {
4682 int a[B<N>::i];
4683 };
4685 is accepted. At template-instantiation time, we
4686 will check that B<N>::i is actually a constant. */
4688 }
4689 /* Check to see if DECL is a local variable in a context
4690 where that is forbidden. */
4693 {
4694 /* It might be that we only found DECL because we are
4695 trying to be generous with pre-ISO scoping rules.
4696 For example, consider:
4698 int i;
4699 void g() {
4700 for (int i = 0; i < 10; ++i) {}
4701 extern void f(int j = i);
4702 }
4704 Here, name look up will originally find the out
4705 of scope `i'. We need to issue a warning message,
4706 but then use the global `i'. */
4709 {
4712 decl);
4714 }
4715 }
4716 }
4718 decl = (finish_id_expression
4720 idk,
4725 template_arg_p,
4731 }
4733 /* Anything else is an error. */
4737 }
4738 }
4746 {
4749 }
4751 /* Parse an id-expression.
4753 id-expression:
4754 unqualified-id
4755 qualified-id
4757 qualified-id:
4758 :: [opt] nested-name-specifier template [opt] unqualified-id
4759 :: identifier
4760 :: operator-function-id
4761 :: template-id
4763 Return a representation of the unqualified portion of the
4764 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4765 a `::' or nested-name-specifier.
4767 Often, if the id-expression was a qualified-id, the caller will
4768 want to make a SCOPE_REF to represent the qualified-id. This
4769 function does not do this in order to avoid wastefully creating
4770 SCOPE_REFs when they are not required.
4772 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4773 `template' keyword.
4775 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4776 uninstantiated templates.
4778 If *TEMPLATE_P is non-NULL, it is set to true iff the
4779 `template' keyword is used to explicitly indicate that the entity
4780 named is a template.
4782 If DECLARATOR_P is true, the id-expression is appearing as part of
4783 a declarator, rather than as part of an expression. */
4785 static tree
4792 {
4796 /* Assume the `template' keyword was not used. */
4800 /* Look for the optional `::' operator. */
4801 global_scope_p
4804 /* Look for the optional nested-name-specifier. */
4805 nested_name_specifier_p
4808 check_dependency_p,
4810 declarator_p)
4812 /* If there is a nested-name-specifier, then we are looking at
4813 the first qualified-id production. */
4815 {
4816 tree saved_scope;
4817 tree saved_object_scope;
4818 tree saved_qualifying_scope;
4819 tree unqualified_id;
4822 /* See if the next token is the `template' keyword. */
4826 /* Name lookup we do during the processing of the
4827 unqualified-id might obliterate SCOPE. */
4831 /* Process the final unqualified-id. */
4833 check_dependency_p,
4834 declarator_p,
4836 /* Restore the SAVED_SCOPE for our caller. */
4842 }
4843 /* Otherwise, if we are in global scope, then we are looking at one
4844 of the other qualified-id productions. */
4846 {
4848 tree id;
4850 /* Peek at the next token. */
4853 /* If it's an identifier, and the next token is not a "<", then
4854 we can avoid the template-id case. This is an optimization
4855 for this common case. */
4857 && !cp_parser_nth_token_starts_template_argument_list_p
4862 /* Try a template-id. */
4866 none_type,
4867 declarator_p);
4868 /* If that worked, we're done. */
4872 /* Peek at the next token. (Changes in the token buffer may
4873 have invalidated the pointer obtained above.) */
4877 {
4884 /* Fall through. */
4889 }
4890 }
4891 else
4894 declarator_p,
4895 optional_p);
4896 }
4898 /* Parse an unqualified-id.
4900 unqualified-id:
4901 identifier
4902 operator-function-id
4903 conversion-function-id
4904 ~ class-name
4905 template-id
4907 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4908 keyword, in a construct like `A::template ...'.
4910 Returns a representation of unqualified-id. For the `identifier'
4911 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4912 production a BIT_NOT_EXPR is returned; the operand of the
4913 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4914 other productions, see the documentation accompanying the
4915 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4916 names are looked up in uninstantiated templates. If DECLARATOR_P
4917 is true, the unqualified-id is appearing as part of a declarator,
4918 rather than as part of an expression. */
4920 static tree
4926 {
4928 tree id;
4930 /* Peek at the next token. */
4934 {
4936 {
4937 /* We don't know yet whether or not this will be a
4938 template-id. */
4940 /* Try a template-id. */
4942 check_dependency_p,
4943 none_type,
4944 declarator_p);
4945 /* If it worked, we're done. */
4948 /* Otherwise, it's an ordinary identifier. */
4950 }
4954 check_dependency_p,
4955 none_type,
4956 declarator_p);
4959 {
4960 tree type_decl;
4961 tree qualifying_scope;
4962 tree object_scope;
4963 tree scope;
4966 /* Consume the `~' token. */
4968 /* Parse the class-name. The standard, as written, seems to
4969 say that:
4971 template <typename T> struct S { ~S (); };
4972 template <typename T> S<T>::~S() {}
4974 is invalid, since `~' must be followed by a class-name, but
4975 `S<T>' is dependent, and so not known to be a class.
4976 That's not right; we need to look in uninstantiated
4977 templates. A further complication arises from:
4979 template <typename T> void f(T t) {
4980 t.T::~T();
4981 }
4983 Here, it is not possible to look up `T' in the scope of `T'
4984 itself. We must look in both the current scope, and the
4985 scope of the containing complete expression.
4987 Yet another issue is:
4989 struct S {
4990 int S;
4991 ~S();
4992 };
4994 S::~S() {}
4996 The standard does not seem to say that the `S' in `~S'
4997 should refer to the type `S' and not the data member
4998 `S::S'. */
5000 /* DR 244 says that we look up the name after the "~" in the
5001 same scope as we looked up the qualifying name. That idea
5002 isn't fully worked out; it's more complicated than that. */
5007 /* Check for invalid scopes. */
5009 {
5013 }
5015 {
5019 scope);
5024 }
5027 /* If the name is of the form "X::~X" it's OK even if X is a
5028 typedef. */
5037 {
5040 }
5042 /* ~auto means the destructor of whatever the object is. */
5044 {
5047 "%<~auto%> only available with "
5051 }
5053 /* If there was an explicit qualification (S::~T), first look
5054 in the scope given by the qualification (i.e., S).
5056 Note: in the calls to cp_parser_class_name below we pass
5057 typename_type so that lookup finds the injected-class-name
5058 rather than the constructor. */
5062 {
5067 typename_type,
5070 declarator_p);
5073 }
5074 /* In "N::S::~S", look in "N" as well. */
5076 {
5081 type_decl
5085 typename_type,
5088 declarator_p);
5091 }
5092 /* In "p->S::~T", look in the scope given by "*p" as well. */
5094 {
5099 type_decl
5103 typename_type,
5106 declarator_p);
5109 }
5110 /* Look in the surrounding context. */
5112 {
5118 type_decl
5122 typename_type,
5125 declarator_p);
5128 {
5129 /* We couldn't find a type with this name, so just accept
5130 it and check for a match at instantiation time. */
5135 }
5136 }
5137 /* If an error occurred, assume that the name of the
5138 destructor is the same as the name of the qualifying
5139 class. That allows us to keep parsing after running
5140 into ill-formed destructor names. */
5146 /* Check that destructor name and scope match. */
5148 {
5155 }
5157 /* [class.dtor]
5159 A typedef-name that names a class shall not be used as the
5160 identifier in the declarator for a destructor declaration. */
5167 type_decl);
5170 }
5174 {
5176 /* This could be a template-id, so we try that first. */
5178 /* Try a template-id. */
5181 none_type,
5182 declarator_p);
5183 /* If that worked, we're done. */
5186 /* We still don't know whether we're looking at an
5187 operator-function-id or a conversion-function-id. */
5189 /* Try an operator-function-id. */
5191 /* If that didn't work, try a conversion-function-id. */
5195 {
5196 /* 17.6.3.3.5 */
5202 }
5215 }
5216 /* Fall through. */
5223 }
5224 }
5226 /* Parse an (optional) nested-name-specifier.
5228 nested-name-specifier: [C++98]
5229 class-or-namespace-name :: nested-name-specifier [opt]
5230 class-or-namespace-name :: template nested-name-specifier [opt]
5232 nested-name-specifier: [C++0x]
5233 type-name ::
5234 namespace-name ::
5235 nested-name-specifier identifier ::
5236 nested-name-specifier template [opt] simple-template-id ::
5238 PARSER->SCOPE should be set appropriately before this function is
5239 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5240 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5241 in name lookups.
5243 Sets PARSER->SCOPE to the class (TYPE) or namespace
5244 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5245 it unchanged if there is no nested-name-specifier. Returns the new
5246 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5248 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5249 part of a declaration and/or decl-specifier. */
5251 static tree
5257 {
5262 /* Remember where the nested-name-specifier starts. */
5264 {
5267 }
5270 {
5271 tree new_scope;
5272 tree old_scope;
5273 tree saved_qualifying_scope;
5276 /* Spot cases that cannot be the beginning of a
5277 nested-name-specifier. */
5280 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5281 the already parsed nested-name-specifier. */
5283 {
5284 /* Grab the nested-name-specifier and continue the loop. */
5286 /* If we originally encountered this nested-name-specifier
5287 with IS_DECLARATION set to false, we will not have
5288 resolved TYPENAME_TYPEs, so we must do so here. */
5291 {
5296 }
5299 }
5301 /* Spot cases that cannot be the beginning of a
5302 nested-name-specifier. On the second and subsequent times
5303 through the loop, we look for the `template' keyword. */
5305 ;
5306 /* A template-id can start a nested-name-specifier. */
5308 ;
5309 /* DR 743: decltype can be used in a nested-name-specifier. */
5311 ;
5312 else
5313 {
5314 /* If the next token is not an identifier, then it is
5315 definitely not a type-name or namespace-name. */
5318 /* If the following token is neither a `<' (to begin a
5319 template-id), nor a `::', then we are not looking at a
5320 nested-name-specifier. */
5326 {
5330 }
5333 && !cp_parser_nth_token_starts_template_argument_list_p
5336 }
5338 /* The nested-name-specifier is optional, so we parse
5339 tentatively. */
5342 /* Look for the optional `template' keyword, if this isn't the
5343 first time through the loop. */
5346 else
5349 /* Save the old scope since the name lookup we are about to do
5350 might destroy it. */
5353 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5354 look up names in "X<T>::I" in order to determine that "Y" is
5355 a template. So, if we have a typename at this point, we make
5356 an effort to look through it. */
5358 && !typename_keyword_p
5363 /* Parse the qualifying entity. */
5364 new_scope
5366 typename_keyword_p,
5367 template_keyword_p,
5368 check_dependency_p,
5369 type_p,
5370 is_declaration);
5371 /* Look for the `::' token. */
5374 /* If we found what we wanted, we keep going; otherwise, we're
5375 done. */
5377 {
5380 /* Restore the OLD_SCOPE since it was valid before the
5381 failed attempt at finding the last
5382 class-or-namespace-name. */
5386 /* If the next token is a decltype, and the one after that is a
5387 `::', then the decltype has failed to resolve to a class or
5388 enumeration type. Give this error even when parsing
5389 tentatively since it can't possibly be valid--and we're going
5390 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5391 won't get another chance.*/
5395 {
5402 /* As below. */
5405 }
5409 /* If the next token is an identifier, and the one after
5410 that is a `::', then any valid interpretation would have
5411 found a class-or-namespace-name. */
5417 {
5420 {
5422 {
5423 tree decl;
5424 tree ambiguous_decls;
5427 none_type,
5436 decl);
5438 {
5439 // cp_parser_lookup_name has the same diagnostic,
5440 // thus make sure to emit it at most once.
5443 {
5448 }
5450 }
5451 else
5452 {
5454 cp_parser_name_lookup_error
5457 else
5458 cp_parser_name_lookup_error
5461 }
5462 }
5465 /* Treat this as a successful nested-name-specifier
5466 due to:
5468 [basic.lookup.qual]
5470 If the name found is not a class-name (clause
5471 _class_) or namespace-name (_namespace.def_), the
5472 program is ill-formed. */
5474 }
5476 }
5478 }
5479 /* We've found one valid nested-name-specifier. */
5481 /* Name lookup always gives us a DECL. */
5484 /* Uses of "template" must be followed by actual templates. */
5496 new_scope);
5497 /* If it is a class scope, try to complete it; we are about to
5498 be looking up names inside the class. */
5500 /* Since checking types for dependency can be expensive,
5501 avoid doing it if the type is already complete. */
5503 /* Do not try to complete dependent types. */
5505 {
5507 /* If it is a typedef to current class, use the current
5508 class instead, as the typedef won't have any names inside
5509 it yet. */
5513 }
5514 /* Make sure we look in the right scope the next time through
5515 the loop. */
5517 }
5519 /* If parsing tentatively, replace the sequence of tokens that makes
5520 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5521 token. That way, should we re-parse the token stream, we will
5522 not have to repeat the effort required to do the parse, nor will
5523 we issue duplicate error messages. */
5525 {
5529 /* Reset the contents of the START token. */
5531 /* Retrieve any deferred checks. Do not pop this access checks yet
5532 so the memory will not be reclaimed during token replacing below. */
5540 /* Purge all subsequent tokens. */
5542 }
5548 }
5550 /* Parse a nested-name-specifier. See
5551 cp_parser_nested_name_specifier_opt for details. This function
5552 behaves identically, except that it will an issue an error if no
5553 nested-name-specifier is present. */
5555 static tree
5561 {
5562 tree scope;
5564 /* Look for the nested-name-specifier. */
5566 typename_keyword_p,
5567 check_dependency_p,
5568 type_p,
5569 is_declaration);
5570 /* If it was not present, issue an error message. */
5572 {
5575 }
5578 }
5580 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5581 this is either a class-name or a namespace-name (which corresponds
5582 to the class-or-namespace-name production in the grammar). For
5583 C++0x, it can also be a type-name that refers to an enumeration
5584 type or a simple-template-id.
5586 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5587 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5588 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5589 TYPE_P is TRUE iff the next name should be taken as a class-name,
5590 even the same name is declared to be another entity in the same
5591 scope.
5593 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5594 specified by the class-or-namespace-name. If neither is found the
5595 ERROR_MARK_NODE is returned. */
5597 static tree
5604 {
5605 tree saved_scope;
5606 tree saved_qualifying_scope;
5607 tree saved_object_scope;
5608 tree scope;
5612 /* DR 743: decltype can appear in a nested-name-specifier. */
5614 {
5618 {
5621 }
5625 }
5627 /* Before we try to parse the class-name, we must save away the
5628 current PARSER->SCOPE since cp_parser_class_name will destroy
5629 it. */
5633 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5634 there is no need to look for a namespace-name. */
5635 only_class_p = template_keyword_p
5640 typename_keyword_p,
5641 template_keyword_p,
5643 check_dependency_p,
5645 is_declaration);
5647 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5651 {
5652 /* Restore the saved scope. */
5657 /* Parse tentatively. */
5660 /* Parse a type-name */
5663 /* "If the name found does not designate a namespace or a class,
5664 enumeration, or dependent type, the program is ill-formed."
5666 We cover classes and dependent types above and namespaces below,
5667 so this code is only looking for enums. */
5673 }
5674 /* If that didn't work, try for a namespace-name. */
5676 {
5677 /* Restore the saved scope. */
5681 /* If we are not looking at an identifier followed by the scope
5682 resolution operator, then this is not part of a
5683 nested-name-specifier. (Note that this function is only used
5684 to parse the components of a nested-name-specifier.) */
5689 }
5692 }
5694 /* Return true if we are looking at a compound-literal, false otherwise. */
5696 static bool
5698 {
5699 /* Consume the `('. */
5704 /* Skip tokens until the next token is a closing parenthesis.
5705 If we find the closing `)', and the next token is a `{', then
5706 we are looking at a compound-literal. */
5707 bool compound_literal_p
5712 /* Roll back the tokens we skipped. */
5716 }
5718 /* Parse a postfix-expression.
5720 postfix-expression:
5721 primary-expression
5722 postfix-expression [ expression ]
5723 postfix-expression ( expression-list [opt] )
5724 simple-type-specifier ( expression-list [opt] )
5725 typename :: [opt] nested-name-specifier identifier
5726 ( expression-list [opt] )
5727 typename :: [opt] nested-name-specifier template [opt] template-id
5728 ( expression-list [opt] )
5729 postfix-expression . template [opt] id-expression
5730 postfix-expression -> template [opt] id-expression
5731 postfix-expression . pseudo-destructor-name
5732 postfix-expression -> pseudo-destructor-name
5733 postfix-expression ++
5734 postfix-expression --
5735 dynamic_cast < type-id > ( expression )
5736 static_cast < type-id > ( expression )
5737 reinterpret_cast < type-id > ( expression )
5738 const_cast < type-id > ( expression )
5739 typeid ( expression )
5740 typeid ( type-id )
5742 GNU Extension:
5744 postfix-expression:
5745 ( type-id ) { initializer-list , [opt] }
5747 This extension is a GNU version of the C99 compound-literal
5748 construct. (The C99 grammar uses `type-name' instead of `type-id',
5749 but they are essentially the same concept.)
5751 If ADDRESS_P is true, the postfix expression is the operand of the
5752 `&' operator. CAST_P is true if this expression is the target of a
5753 cast.
5755 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5756 class member access expressions [expr.ref].
5758 Returns a representation of the expression. */
5760 static tree
5764 {
5766 location_t loc;
5773 /* Peek at the next token. */
5776 /* Some of the productions are determined by keywords. */
5779 {
5784 {
5785 tree type;
5786 tree expression;
5790 /* All of these can be handled in the same way from the point
5791 of view of parsing. Begin by consuming the token
5792 identifying the cast. */
5795 /* New types cannot be defined in the cast. */
5797 parser->type_definition_forbidden_message
5800 /* Look for the opening `<'. */
5802 /* Parse the type to which we are casting. */
5807 /* Look for the closing `>'. */
5809 /* Restore the old message. */
5812 bool saved_greater_than_is_operator_p
5816 /* And the expression which is being cast. */
5821 parser->greater_than_is_operator_p
5824 /* Only type conversions to integral or enumeration types
5825 can be used in constant-expressions. */
5831 {
5833 postfix_expression
5837 postfix_expression
5841 postfix_expression
5843 tf_warning_or_error);
5846 postfix_expression
5851 }
5852 }
5856 {
5857 tree type;
5861 /* Consume the `typeid' token. */
5863 /* Look for the `(' token. */
5865 /* Types cannot be defined in a `typeid' expression. */
5867 parser->type_definition_forbidden_message
5869 /* We can't be sure yet whether we're looking at a type-id or an
5870 expression. */
5872 /* Try a type-id first. */
5877 /* Look for the `)' token. Otherwise, we can't be sure that
5878 we're not looking at an expression: consider `typeid (int
5879 (3))', for example. */
5881 /* If all went well, simply lookup the type-id. */
5884 /* Otherwise, fall back to the expression variant. */
5885 else
5886 {
5887 tree expression;
5889 /* Look for an expression. */
5891 /* Compute its typeid. */
5893 /* Look for the `)' token. */
5895 }
5896 /* Restore the saved message. */
5898 /* `typeid' may not appear in an integral constant expression. */
5901 }
5905 {
5906 tree type;
5907 /* The syntax permitted here is the same permitted for an
5908 elaborated-type-specifier. */
5913 }
5917 {
5921 {
5926 }
5928 {
5933 }
5934 else
5935 {
5936 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5939 }
5941 postfix_expression =
5945 {
5949 }
5951 {
5956 }
5957 else
5958 {
5960 postfix_expression);
5964 }
5966 }
5969 {
5972 tree p;
5986 tf_warning_or_error);
5989 tf_warning_or_error);
5990 else
5991 {
5995 }
5997 }
6000 {
6001 tree type;
6003 /* If the next thing is a simple-type-specifier, we may be
6004 looking at a functional cast. We could also be looking at
6005 an id-expression. So, we try the functional cast, and if
6006 that doesn't work we fall back to the primary-expression. */
6008 /* Look for the simple-type-specifier. */
6011 CP_PARSER_FLAGS_NONE);
6012 /* Parse the cast itself. */
6014 postfix_expression
6016 /* If that worked, we're done. */
6020 /* If the functional-cast didn't work out, try a
6021 compound-literal. */
6024 {
6029 /* Avoid calling cp_parser_type_id pointlessly, see comment
6030 in cp_parser_cast_expression about c++/29234. */
6033 else
6034 {
6035 /* Parse the type. */
6040 /* Look for the `)'. */
6042 }
6044 /* If things aren't going well, there's no need to
6045 keep going. */
6047 {
6049 /* Parse the brace-enclosed initializer list. */
6052 }
6053 /* If that worked, we're definitely looking at a
6054 compound-literal expression. */
6056 {
6057 /* Warn the user that a compound literal is not
6058 allowed in standard C++. */
6061 /* For simplicity, we disallow compound literals in
6062 constant-expressions. We could
6063 allow compound literals of integer type, whose
6064 initializer was a constant, in constant
6065 expressions. Permitting that usage, as a further
6066 extension, would not change the meaning of any
6067 currently accepted programs. (Of course, as
6068 compound literals are not part of ISO C++, the
6069 standard has nothing to say.) */
6071 NIC_NCC))
6072 {
6075 }
6076 /* Form the representation of the compound-literal. */
6077 postfix_expression
6079 tf_warning_or_error);
6081 }
6082 }
6084 /* It must be a primary-expression. */
6085 postfix_expression
6088 decltype_p,
6090 }
6092 }
6094 /* Note that we don't need to worry about calling build_cplus_new on a
6095 class-valued CALL_EXPR in decltype when it isn't the end of the
6096 postfix-expression; unary_complex_lvalue will take care of that for
6097 all these cases. */
6099 /* Keep looping until the postfix-expression is complete. */
6101 {
6105 /* It is not a Koenig lookup function call. */
6106 postfix_expression
6109 /* Peek at the next token. */
6113 {
6116 {
6118 "two consecutive %<[%> shall "
6121 }
6122 postfix_expression
6124 postfix_expression,
6126 decltype_p);
6132 /* postfix-expression ( expression-list [opt] ) */
6133 {
6143 is_builtin_constant_p
6146 {
6147 /* The whole point of __builtin_constant_p is to allow
6148 non-constant expressions to appear as arguments. */
6149 saved_integral_constant_expression_p
6151 saved_non_integral_constant_expression_p
6154 }
6155 args = (cp_parser_parenthesized_expression_list
6161 {
6162 parser->integral_constant_expression_p
6164 parser->non_integral_constant_expression_p
6166 }
6169 {
6172 }
6174 /* Function calls are not permitted in
6175 constant-expressions. */
6178 NIC_FUNC_CALL))
6179 {
6183 }
6188 {
6190 {
6192 {
6195 postfix_expression
6197 complain);
6198 }
6199 else
6200 postfix_expression
6202 }
6203 /* We do not perform argument-dependent lookup if
6204 normal lookup finds a non-function, in accordance
6205 with the expected resolution of DR 218. */
6208 {
6212 /* Do not do argument dependent lookup if regular
6213 lookup finds a member function or a block-scope
6214 function declaration. [basic.lookup.argdep]/3 */
6217 {
6220 postfix_expression
6222 complain);
6223 }
6224 }
6225 }
6228 {
6238 "%<memset%> used with constant zero length "
6239 "parameter; this could be due to transposed "
6242 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6243 to avoid leaking those into folder and middle-end. */
6245 tree arg;
6249 }
6252 {
6262 {
6263 postfix_expression
6267 }
6270 {
6271 postfix_expression
6272 = (build_new_method_call
6278 complain));
6279 }
6280 else
6281 postfix_expression
6285 complain);
6286 }
6290 postfix_expression = (build_offset_ref_call_from_tree
6292 complain));
6294 /* A call to a static class member, or a namespace-scope
6295 function. */
6296 postfix_expression
6299 koenig_p,
6300 complain);
6301 else
6302 /* All other function calls. */
6303 postfix_expression
6306 koenig_p,
6307 complain);
6311 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6315 }
6320 /* postfix-expression . template [opt] id-expression
6321 postfix-expression . pseudo-destructor-name
6322 postfix-expression -> template [opt] id-expression
6323 postfix-expression -> pseudo-destructor-name */
6325 /* Consume the `.' or `->' operator. */
6328 postfix_expression
6330 postfix_expression,
6337 /* postfix-expression ++ */
6338 /* Consume the `++' token. */
6340 /* Generate a representation for the complete expression. */
6341 postfix_expression
6343 POSTINCREMENT_EXPR);
6344 /* Increments may not appear in constant-expressions. */
6352 /* postfix-expression -- */
6353 /* Consume the `--' token. */
6355 /* Generate a representation for the complete expression. */
6356 postfix_expression
6358 POSTDECREMENT_EXPR);
6359 /* Decrements may not appear in constant-expressions. */
6371 else
6373 }
6374 }
6376 /* We should never get here. */
6379 }
6381 /* This function parses Cilk Plus array notations. If a normal array expr. is
6382 parsed then the array index is passed back to the caller through *INIT_INDEX
6383 and the function returns a NULL_TREE. If array notation expr. is parsed,
6384 then *INIT_INDEX is ignored by the caller and the function returns
6385 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6386 error_mark_node. */
6388 static tree
6390 tree array_value)
6391 {
6395 {
6398 }
6407 {
6410 }
6412 {
6413 /* Consume the ':'. */
6416 /* If we are here, then we have a case like this A[:]. */
6418 {
6422 }
6426 }
6427 else
6428 {
6429 /* If we are here, then there are three valid possibilities:
6430 1. ARRAY [ EXP ]
6431 2. ARRAY [ EXP : EXP ]
6432 3. ARRAY [ EXP : EXP : EXP ] */
6436 {
6437 /* This indicates that we have a normal array expression. */
6440 }
6442 /* Consume the ':'. */
6446 {
6449 }
6450 }
6455 {
6459 }
6465 }
6467 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6468 by cp_parser_builtin_offsetof. We're looking for
6470 postfix-expression [ expression ]
6471 postfix-expression [ braced-init-list ] (C++11)
6473 FOR_OFFSETOF is set if we're being called in that context, which
6474 changes how we deal with integer constant expressions. */
6476 static tree
6478 tree postfix_expression,
6481 {
6486 /* Consume the `[' token. */
6492 /* Parse the index expression. */
6493 /* ??? For offsetof, there is a question of what to allow here. If
6494 offsetof is not being used in an integral constant expression context,
6495 then we *could* get the right answer by computing the value at runtime.
6496 If we are in an integral constant expression context, then we might
6497 could accept any constant expression; hard to say without analysis.
6498 Rather than open the barn door too wide right away, allow only integer
6499 constant expressions here. */
6502 else
6503 {
6505 {
6512 {
6514 "braced list index is not allowed with array "
6518 }
6519 }
6521 {
6522 /* Here are have these two options:
6523 ARRAY[EXP : EXP] - Array notation expr with default
6524 stride of 1.
6525 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6526 stride. */
6528 postfix_expression);
6531 }
6532 else
6534 }
6538 /* Look for the closing `]'. */
6541 /* Build the ARRAY_REF. */
6545 /* When not doing offsetof, array references are not permitted in
6546 constant-expressions. */
6552 }
6554 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6555 by cp_parser_builtin_offsetof. We're looking for
6557 postfix-expression . template [opt] id-expression
6558 postfix-expression . pseudo-destructor-name
6559 postfix-expression -> template [opt] id-expression
6560 postfix-expression -> pseudo-destructor-name
6562 FOR_OFFSETOF is set if we're being called in that context. That sorta
6563 limits what of the above we'll actually accept, but nevermind.
6564 TOKEN_TYPE is the "." or "->" token, which will already have been
6565 removed from the stream. */
6567 static tree
6570 tree postfix_expression,
6572 location_t location)
6573 {
6574 tree name;
6579 /* If this is a `->' operator, dereference the pointer. */
6582 tf_warning_or_error);
6583 /* Check to see whether or not the expression is type-dependent. */
6585 /* The identifier following the `->' or `.' is not qualified. */
6591 /* Enter the scope corresponding to the type of the object
6592 given by the POSTFIX_EXPRESSION. */
6594 {
6596 /* According to the standard, no expression should ever have
6597 reference type. Unfortunately, we do not currently match
6598 the standard in this respect in that our internal representation
6599 of an expression may have reference type even when the standard
6600 says it does not. Therefore, we have to manually obtain the
6601 underlying type here. */
6603 /* The type of the POSTFIX_EXPRESSION must be complete. */
6605 {
6607 postfix_expression);
6609 }
6610 /* Unlike the object expression in other contexts, *this is not
6611 required to be of complete type for purposes of class member
6612 access (5.2.5) outside the member function body. */
6616 /* Let the name lookup machinery know that we are processing a
6617 class member access expression. */
6619 /* If something went wrong, we want to be able to discern that case,
6620 as opposed to the case where there was no SCOPE due to the type
6621 of expression being dependent. */
6624 /* If the SCOPE was erroneous, make the various semantic analysis
6625 functions exit quickly -- and without issuing additional error
6626 messages. */
6629 }
6631 /* Assume this expression is not a pseudo-destructor access. */
6634 /* If the SCOPE is a scalar type, then, if this is a valid program,
6635 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6636 is type dependent, it can be pseudo-destructor-name or something else.
6637 Try to parse it as pseudo-destructor-name first. */
6639 {
6640 tree s;
6641 tree type;
6644 /* Parse the pseudo-destructor-name. */
6653 {
6655 postfix_expression
6658 }
6659 }
6662 {
6663 /* If the SCOPE is not a scalar type, we are looking at an
6664 ordinary class member access expression, rather than a
6665 pseudo-destructor-name. */
6668 /* Parse the id-expression. */
6669 name = (cp_parser_id_expression
6676 /* In general, build a SCOPE_REF if the member name is qualified.
6677 However, if the name was not dependent and has already been
6678 resolved; there is no need to build the SCOPE_REF. For example;
6680 struct X { void f(); };
6681 template <typename T> void f(T* t) { t->X::f(); }
6683 Even though "t" is dependent, "X::f" is not and has been resolved
6684 to a BASELINK; there is no need to include scope information. */
6686 /* But we do need to remember that there was an explicit scope for
6687 virtual function calls. */
6691 /* If the name is a template-id that names a type, we will get a
6692 TYPE_DECL here. That is invalid code. */
6694 {
6697 }
6698 else
6699 {
6701 {
6703 {
6707 }
6708 else
6711 name,
6712 template_p);
6716 }
6718 adjust_result_of_qualified_name_lookup
6720 postfix_expression
6722 template_p,
6723 tf_warning_or_error);
6724 }
6725 }
6727 /* We no longer need to look up names in the scope of the object on
6728 the left-hand side of the `.' or `->' operator. */
6731 /* Outside of offsetof, these operators may not appear in
6732 constant-expressions. */
6734 && (cp_parser_non_integral_constant_expression
6739 }
6741 /* Cache of LITERAL_ZERO_P constants. */
6745 /* Parse a parenthesized expression-list.
6747 expression-list:
6748 assignment-expression
6749 expression-list, assignment-expression
6751 attribute-list:
6752 expression-list
6753 identifier
6754 identifier, expression-list
6756 CAST_P is true if this expression is the target of a cast.
6758 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6759 argument pack.
6761 Returns a vector of trees. Each element is a representation of an
6762 assignment-expression. NULL is returned if the ( and or ) are
6763 missing. An empty, but allocated, vector is returned on no
6764 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6765 if we are parsing an attribute list for an attribute that wants a
6766 plain identifier argument, normal_attr for an attribute that wants
6767 an expression, or non_attr if we aren't parsing an attribute list. If
6768 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6769 not all of the expressions in the list were constant.
6770 WANT_LITERAL_ZERO_P is true if the caller is interested in
6771 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6772 immediately, this can be removed. */
6781 {
6787 /* Assume all the expressions will be constant. */
6796 /* Within a parenthesized expression, a `>' token is always
6797 the greater-than operator. */
6798 saved_greater_than_is_operator_p
6802 /* Consume expressions until there are no more. */
6805 {
6806 tree expr;
6808 /* At the beginning of attribute lists, check to see if the
6809 next token is an identifier. */
6812 {
6815 /* Consume the identifier. */
6817 /* Save the identifier. */
6819 }
6820 else
6821 {
6824 /* Parse the next assignment-expression. */
6826 {
6827 /* A braced-init-list. */
6833 }
6835 {
6836 expr = (cp_parser_constant_expression
6841 }
6842 else
6843 {
6847 {
6853 /* If a parameter is literal zero alone, remember it
6854 for -Wmemset-transposed-args warning. */
6857 && want_literal_zero_p
6859 == CPP_COMMA
6862 {
6869 else
6870 {
6875 }
6876 /* Consume the 0 token (or '\0', 0LL etc.). */
6878 }
6882 }
6885 cast_p);
6886 }
6891 /* If we have an ellipsis, then this is an expression
6892 expansion. */
6895 {
6896 /* Consume the `...'. */
6899 /* Build the argument pack. */
6901 }
6903 /* Add it to the list. We add error_mark_node
6904 expressions to the list, so that we can still tell if
6905 the correct form for a parenthesized expression-list
6906 is found. That gives better errors. */
6911 }
6913 /* After the first item, attribute lists look the same as
6914 expression lists. */
6917 get_comma:;
6918 /* If the next token isn't a `,', then we are done. */
6922 /* Otherwise, consume the `,' and keep going. */
6924 }
6927 {
6930 skip_comma:;
6931 /* We try and resync to an unnested comma, as that will give the
6932 user better diagnostics. */
6940 {
6941 parser->greater_than_is_operator_p
6944 }
6945 }
6947 parser->greater_than_is_operator_p
6954 }
6956 /* Parse a pseudo-destructor-name.
6958 pseudo-destructor-name:
6959 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6960 :: [opt] nested-name-specifier template template-id :: ~ type-name
6961 :: [opt] nested-name-specifier [opt] ~ type-name
6963 If either of the first two productions is used, sets *SCOPE to the
6964 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6965 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6966 or ERROR_MARK_NODE if the parse fails. */
6968 static void
6970 tree object,
6973 {
6976 /* Handle ~auto. */
6980 {
6983 "%<~auto%> only available with "
6990 }
6992 /* Assume that things will not work out. */
6995 /* Look for the optional `::' operator. */
6997 /* Look for the optional nested-name-specifier. */
6998 nested_name_specifier_p
7005 /* Now, if we saw a nested-name-specifier, we might be doing the
7006 second production. */
7009 {
7010 /* Consume the `template' keyword. */
7012 /* Parse the template-id. */
7016 class_type,
7018 /* Look for the `::' token. */
7020 }
7021 /* If the next token is not a `~', then there might be some
7022 additional qualification. */
7024 {
7025 /* At this point, we're looking for "type-name :: ~". The type-name
7026 must not be a class-name, since this is a pseudo-destructor. So,
7027 it must be either an enum-name, or a typedef-name -- both of which
7028 are just identifiers. So, we peek ahead to check that the "::"
7029 and "~" tokens are present; if they are not, then we can avoid
7030 calling type_name. */
7034 {
7037 }
7039 /* Look for the type-name. */
7044 /* Look for the `::' token. */
7046 }
7047 else
7050 /* Look for the `~'. */
7053 /* Once we see the ~, this has to be a pseudo-destructor. */
7057 /* Look for the type-name again. We are not responsible for
7058 checking that it matches the first type-name. */
7060 }
7062 /* Parse a unary-expression.
7064 unary-expression:
7065 postfix-expression
7066 ++ cast-expression
7067 -- cast-expression
7068 unary-operator cast-expression
7069 sizeof unary-expression
7070 sizeof ( type-id )
7071 alignof ( type-id ) [C++0x]
7072 new-expression
7073 delete-expression
7075 GNU Extensions:
7077 unary-expression:
7078 __extension__ cast-expression
7079 __alignof__ unary-expression
7080 __alignof__ ( type-id )
7081 alignof unary-expression [C++0x]
7082 __real__ cast-expression
7083 __imag__ cast-expression
7084 && identifier
7085 sizeof ( type-id ) { initializer-list , [opt] }
7086 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7087 __alignof__ ( type-id ) { initializer-list , [opt] }
7089 ADDRESS_P is true iff the unary-expression is appearing as the
7090 operand of the `&' operator. CAST_P is true if this expression is
7091 the target of a cast.
7093 Returns a representation of the expression. */
7095 static tree
7098 {
7102 /* Peek at the next token. */
7104 /* Some keywords give away the kind of expression. */
7106 {
7110 {
7113 {
7116 location_t first_loc;
7119 /* Consume the token. */
7122 /* Parse the operand. */
7127 else
7128 {
7129 /* ISO C++ defines alignof only with types, not with
7130 expressions. So pedwarn if alignof is used with a non-
7131 type expression. However, __alignof__ is ok. */
7134 "ISO C++ does not allow %<alignof%> "
7138 }
7139 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7140 SIZEOF_EXPR with the original operand. */
7142 {
7144 {
7146 {
7149 error_mark_node));
7151 }
7152 else
7156 }
7158 }
7160 }
7169 {
7170 /* The saved value of the PEDANTIC flag. */
7172 tree expr;
7174 /* Save away the PEDANTIC flag. */
7176 /* Parse the cast-expression. */
7178 /* Restore the PEDANTIC flag. */
7182 }
7186 {
7187 tree expression;
7189 /* Consume the `__real__' or `__imag__' token. */
7191 /* Parse the cast-expression. */
7193 /* Create the complete representation. */
7197 expression,
7198 tf_warning_or_error);
7199 }
7207 {
7208 tree expr;
7218 parser->type_definition_forbidden_message
7221 saved_integral_constant_expression_p
7223 saved_non_integral_constant_expression_p
7227 saved_greater_than_is_operator_p
7239 parser->greater_than_is_operator_p
7242 parser->integral_constant_expression_p
7244 parser->non_integral_constant_expression_p
7251 }
7255 }
7256 }
7258 /* Look for the `:: new' and `:: delete', which also signal the
7259 beginning of a new-expression, or delete-expression,
7260 respectively. If the next token is `::', then it might be one of
7261 these. */
7263 {
7266 /* See if the token after the `::' is one of the keywords in
7267 which we're interested. */
7269 /* If it's `new', we have a new-expression. */
7272 /* Similarly, for `delete'. */
7275 }
7277 /* Look for a unary operator. */
7279 /* The `++' and `--' operators can be handled similarly, even though
7280 they are not technically unary-operators in the grammar. */
7282 {
7287 /* Handle the GNU address-of-label extension. */
7290 {
7291 tree identifier;
7292 tree expression;
7295 /* Consume the '&&' token. */
7297 /* Look for the identifier. */
7299 /* Create an expression representing the address. */
7302 NIC_ADDR_LABEL))
7305 }
7306 }
7308 {
7309 tree cast_expression;
7315 /* Consume the operator token. */
7317 /* Parse the cast-expression. */
7318 cast_expression
7323 pidk);
7324 /* Now, build an appropriate representation. */
7326 {
7330 RO_UNARY_STAR,
7331 complain);
7336 /* Fall through. */
7339 cast_expression,
7340 complain);
7347 /* Fall through. */
7357 }
7361 non_constant_p))
7365 }
7369 decltype_p,
7370 pidk);
7371 }
7373 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7374 unary-operator, the corresponding tree code is returned. */
7376 static enum tree_code
7378 {
7380 {
7401 }
7402 }
7404 /* Parse a new-expression.
7406 new-expression:
7407 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7408 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7410 Returns a representation of the expression. */
7412 static tree
7414 {
7417 tree type;
7420 tree ret;
7422 /* Look for the optional `::' operator. */
7423 global_scope_p
7427 /* Look for the `new' operator. */
7429 /* There's no easy way to tell a new-placement from the
7430 `( type-id )' construct. */
7432 /* Look for a new-placement. */
7434 /* If that didn't work out, there's no new-placement. */
7436 {
7440 }
7442 /* If the next token is a `(', then we have a parenthesized
7443 type-id. */
7445 {
7449 /* Consume the `('. */
7452 /* Parse the type-id. */
7453 parser->type_definition_forbidden_message
7458 /* Look for the closing `)'. */
7461 /* There should not be a direct-new-declarator in this production,
7462 but GCC used to allowed this, so we check and emit a sensible error
7463 message for this case. */
7465 {
7471 }
7472 }
7473 /* Otherwise, there must be a new-type-id. */
7474 else
7477 /* If the next token is a `(' or '{', then we have a new-initializer. */
7481 else
7484 /* A new-expression may not appear in an integral constant
7485 expression. */
7488 else
7489 {
7490 /* Create a representation of the new-expression. */
7492 tf_warning_or_error);
7493 }
7501 }
7503 /* Parse a new-placement.
7505 new-placement:
7506 ( expression-list )
7508 Returns the same representation as for an expression-list. */
7512 {
7515 /* Parse the expression-list. */
7516 expression_list = (cp_parser_parenthesized_expression_list
7522 }
7524 /* Parse a new-type-id.
7526 new-type-id:
7527 type-specifier-seq new-declarator [opt]
7529 Returns the TYPE allocated. If the new-type-id indicates an array
7530 type, *NELTS is set to the number of elements in the last array
7531 bound; the TYPE will not include the last array bound. */
7533 static tree
7535 {
7536 cp_decl_specifier_seq type_specifier_seq;
7542 /* The type-specifier sequence must not contain type definitions.
7543 (It cannot contain declarations of new types either, but if they
7544 are not definitions we will catch that because they are not
7545 complete.) */
7547 parser->type_definition_forbidden_message
7549 /* Parse the type-specifier-seq. */
7553 /* Restore the old message. */
7559 /* Parse the new-declarator. */
7562 /* Determine the number of elements in the last array dimension, if
7563 any. */
7565 /* Skip down to the last array dimension. */
7570 {
7573 }
7578 {
7581 }
7584 {
7591 else
7593 }
7596 }
7598 /* Parse an (optional) new-declarator.
7600 new-declarator:
7601 ptr-operator new-declarator [opt]
7602 direct-new-declarator
7604 Returns the declarator. */
7608 {
7611 cp_cv_quals cv_quals;
7613 /* We don't know if there's a ptr-operator next, or not. */
7615 /* Look for a ptr-operator. */
7617 /* If that worked, look for more new-declarators. */
7619 {
7622 /* Parse another optional declarator. */
7625 declarator = cp_parser_make_indirect_declarator
7629 }
7631 /* If the next token is a `[', there is a direct-new-declarator. */
7636 }
7638 /* Parse a direct-new-declarator.
7640 direct-new-declarator:
7641 [ expression ]
7642 direct-new-declarator [constant-expression]
7644 */
7648 {
7652 {
7653 tree expression;
7656 /* Look for the opening `['. */
7661 /* The standard requires that the expression have integral
7662 type. DR 74 adds enumeration types. We believe that the
7663 real intent is that these expressions be handled like the
7664 expression in a `switch' condition, which also allows
7665 classes with a single conversion to integral or
7666 enumeration type. */
7668 {
7669 expression
7671 expression,
7674 {
7676 "expression in new-declarator must have integral "
7679 }
7680 }
7682 /* Look for the closing `]'. */
7685 /* Add this bound to the declarator. */
7688 /* If the next token is not a `[', then there are no more
7689 bounds. */
7692 }
7695 }
7697 /* Parse a new-initializer.
7699 new-initializer:
7700 ( expression-list [opt] )
7701 braced-init-list
7703 Returns a representation of the expression-list. */
7707 {
7711 {
7712 tree t;
7719 }
7720 else
7721 expression_list = (cp_parser_parenthesized_expression_list
7727 }
7729 /* Parse a delete-expression.
7731 delete-expression:
7732 :: [opt] delete cast-expression
7733 :: [opt] delete [ ] cast-expression
7735 Returns a representation of the expression. */
7737 static tree
7739 {
7742 tree expression;
7744 /* Look for the optional `::' operator. */
7745 global_scope_p
7749 /* Look for the `delete' keyword. */
7751 /* See if the array syntax is in use. */
7753 {
7754 /* Consume the `[' token. */
7756 /* Look for the `]' token. */
7758 /* Remember that this is the `[]' construct. */
7760 }
7761 else
7764 /* Parse the cast-expression. */
7767 /* A delete-expression may not appear in an integral constant
7768 expression. */
7773 tf_warning_or_error);
7774 }
7776 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7777 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7778 0 otherwise. */
7780 static int
7782 {
7785 {
7827 /* In ((type ()) () the last () isn't a valid cast-expression,
7828 so the whole must be parsed as postfix-expression. */
7833 /* '[' may start a primary-expression in obj-c++ and in C++11,
7834 as a lambda-expression, eg, '(void)[]{}'. */
7841 /* '++' and '--' may or may not start a cast-expression:
7843 struct T { void operator++(int); };
7844 void f() { (T())++; }
7846 vs
7848 int a;
7849 (int)++a; */
7854 }
7855 }
7857 /* Parse a cast-expression.
7859 cast-expression:
7860 unary-expression
7861 ( type-id ) cast-expression
7863 ADDRESS_P is true iff the unary-expression is appearing as the
7864 operand of the `&' operator. CAST_P is true if this expression is
7865 the target of a cast.
7867 Returns a representation of the expression. */
7869 static tree
7872 {
7873 /* If it's a `(', then we might be looking at a cast. */
7875 {
7881 /* There's no way to know yet whether or not this is a cast.
7882 For example, `(int (3))' is a unary-expression, while `(int)
7883 3' is a cast. So, we resort to parsing tentatively. */
7885 /* Types may not be defined in a cast. */
7887 parser->type_definition_forbidden_message
7889 /* Consume the `('. */
7891 /* A very tricky bit is that `(struct S) { 3 }' is a
7892 compound-literal (which we permit in C++ as an extension).
7893 But, that construct is not a cast-expression -- it is a
7894 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7895 is legal; if the compound-literal were a cast-expression,
7896 you'd need an extra set of parentheses.) But, if we parse
7897 the type-id, and it happens to be a class-specifier, then we
7898 will commit to the parse at that point, because we cannot
7899 undo the action that is done when creating a new class. So,
7900 then we cannot back up and do a postfix-expression.
7902 Another tricky case is the following (c++/29234):
7904 struct S { void operator () (); };
7906 void foo ()
7907 {
7908 ( S()() );
7909 }
7911 As a type-id we parse the parenthesized S()() as a function
7912 returning a function, groktypename complains and we cannot
7913 back up in this case either.
7915 Therefore, we scan ahead to the closing `)', and check to see
7916 if the tokens after the `)' can start a cast-expression. Otherwise
7917 we are dealing with an unary-expression, a postfix-expression
7918 or something else.
7920 Yet another tricky case, in C++11, is the following (c++/54891):
7922 (void)[]{};
7924 The issue is that usually, besides the case of lambda-expressions,
7925 the parenthesized type-id cannot be followed by '[', and, eg, we
7926 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7927 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7928 we don't commit, we try a cast-expression, then an unary-expression.
7930 Save tokens so that we can put them back. */
7933 /* We may be looking at a cast-expression. */
7936 cast_expression
7939 /* Roll back the tokens we skipped. */
7941 /* If we aren't looking at a cast-expression, simulate an error so
7942 that the call to cp_parser_error_occurred below returns true. */
7945 else
7946 {
7949 /* Look for the type-id. */
7951 /* Look for the closing `)'. */
7954 }
7956 /* Restore the saved message. */
7959 /* At this point this can only be either a cast or a
7960 parenthesized ctor such as `(T ())' that looks like a cast to
7961 function returning T. */
7963 {
7964 /* Only commit if the cast-expression doesn't start with
7965 '++', '--', or '[' in C++11. */
7973 pidk);
7976 {
7977 /* Warn about old-style casts, if so requested. */
7984 /* Only type conversions to integral or enumeration types
7985 can be used in constant-expressions. */
7988 NIC_CAST))
7991 /* Perform the cast. */
7994 }
7995 }
7996 else
7998 }
8000 /* If we get here, then it's not a cast, so it must be a
8001 unary-expression. */
8004 }
8006 /* Parse a binary expression of the general form:
8008 pm-expression:
8009 cast-expression
8010 pm-expression .* cast-expression
8011 pm-expression ->* cast-expression
8013 multiplicative-expression:
8014 pm-expression
8015 multiplicative-expression * pm-expression
8016 multiplicative-expression / pm-expression
8017 multiplicative-expression % pm-expression
8019 additive-expression:
8020 multiplicative-expression
8021 additive-expression + multiplicative-expression
8022 additive-expression - multiplicative-expression
8024 shift-expression:
8025 additive-expression
8026 shift-expression << additive-expression
8027 shift-expression >> additive-expression
8029 relational-expression:
8030 shift-expression
8031 relational-expression < shift-expression
8032 relational-expression > shift-expression
8033 relational-expression <= shift-expression
8034 relational-expression >= shift-expression
8036 GNU Extension:
8038 relational-expression:
8039 relational-expression <? shift-expression
8040 relational-expression >? shift-expression
8042 equality-expression:
8043 relational-expression
8044 equality-expression == relational-expression
8045 equality-expression != relational-expression
8047 and-expression:
8048 equality-expression
8049 and-expression & equality-expression
8051 exclusive-or-expression:
8052 and-expression
8053 exclusive-or-expression ^ and-expression
8055 inclusive-or-expression:
8056 exclusive-or-expression
8057 inclusive-or-expression | exclusive-or-expression
8059 logical-and-expression:
8060 inclusive-or-expression
8061 logical-and-expression && inclusive-or-expression
8063 logical-or-expression:
8064 logical-and-expression
8065 logical-or-expression || logical-and-expression
8067 All these are implemented with a single function like:
8069 binary-expression:
8070 simple-cast-expression
8071 binary-expression <token> binary-expression
8073 CAST_P is true if this expression is the target of a cast.
8075 The binops_by_token map is used to get the tree codes for each <token> type.
8076 binary-expressions are associated according to a precedence table. */
8078 #define TOKEN_PRECEDENCE(token) \
8079 (((token->type == CPP_GREATER \
8080 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8081 && !parser->greater_than_is_operator_p) \
8082 ? PREC_NOT_OPERATOR \
8083 : binops_by_token[token->type].prec)
8085 static tree
8091 {
8092 cp_parser_expression_stack stack;
8094 cp_parser_expression_stack_entry current;
8095 tree rhs;
8099 tree overload;
8101 /* Parse the first expression. */
8112 {
8113 /* Get an operator token. */
8119 {
8121 "%<>>%> operator is treated"
8125 }
8129 /* Popping an entry off the stack means we completed a subexpression:
8130 - either we found a token which is not an operator (`>' where it is not
8131 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8132 will happen repeatedly;
8133 - or, we found an operator which has lower priority. This is the case
8134 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8135 parsing `3 * 4'. */
8137 {
8140 else
8142 }
8144 get_rhs:
8148 /* We used the operator token. */
8151 /* For "false && x" or "true || x", x will never be executed;
8152 disable warnings while evaluating it. */
8158 /* Extract another operand. It may be the RHS of this expression
8159 or the LHS of a new, higher priority expression. */
8164 /* Get another operator token. Look up its precedence to avoid
8165 building a useless (immediately popped) stack entry for common
8166 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8170 {
8171 /* ... and prepare to parse the RHS of the new, higher priority
8172 expression. Since precedence levels on the stack are
8173 monotonically increasing, we do not have to care about
8174 stack overflows. */
8183 pop:
8185 /* If the stack is not empty, we have parsed into LHS the right side
8186 (`4' in the example above) of an expression we had suspended.
8187 We can use the information on the stack to recover the LHS (`3')
8188 from the stack together with the tree code (`MULT_EXPR'), and
8189 the precedence of the higher level subexpression
8190 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8191 which will be used to actually build the additive expression. */
8196 }
8198 /* Undo the disabling of warnings done above. */
8209 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8210 ERROR_MARK for everything that is not a binary expression.
8211 This makes warn_about_parentheses miss some warnings that
8212 involve unary operators. For unary expressions we should
8213 pass the correct tree_code unless the unary expression was
8214 surrounded by parentheses.
8215 */
8221 == tcc_comparison
8224 else
8233 /* If the binary operator required the use of an overloaded operator,
8234 then this expression cannot be an integral constant-expression.
8235 An overloaded operator can be used even if both operands are
8236 otherwise permissible in an integral constant-expression if at
8237 least one of the operands is of enumeration type. */
8241 NIC_OVERLOADED))
8243 }
8246 }
8248 static tree
8253 {
8256 }
8258 /* Parse the `? expression : assignment-expression' part of a
8259 conditional-expression. The LOGICAL_OR_EXPR is the
8260 logical-or-expression that started the conditional-expression.
8261 Returns a representation of the entire conditional-expression.
8263 This routine is used by cp_parser_assignment_expression.
8265 ? expression : assignment-expression
8267 GNU Extensions:
8269 ? : assignment-expression */
8271 static tree
8273 {
8274 tree expr;
8275 tree assignment_expr;
8279 /* Consume the `?' token. */
8284 {
8287 /* Implicit true clause. */
8291 }
8292 else
8293 {
8296 /* Parse the expression. */
8299 c_inhibit_evaluation_warnings +=
8303 }
8305 /* The next token should be a `:'. */
8307 /* Parse the assignment-expression. */
8311 /* Build the conditional-expression. */
8313 expr,
8314 assignment_expr,
8315 tf_warning_or_error);
8316 }
8318 /* Parse an assignment-expression.
8320 assignment-expression:
8321 conditional-expression
8322 logical-or-expression assignment-operator assignment_expression
8323 throw-expression
8325 CAST_P is true if this expression is the target of a cast.
8326 DECLTYPE_P is true if this expression is the operand of decltype.
8328 Returns a representation for the expression. */
8330 static tree
8333 {
8334 tree expr;
8336 /* If the next token is the `throw' keyword, then we're looking at
8337 a throw-expression. */
8340 /* Otherwise, it must be that we are looking at a
8341 logical-or-expression. */
8342 else
8343 {
8344 /* Parse the binary expressions (logical-or-expression). */
8346 decltype_p,
8348 /* If the next token is a `?' then we're actually looking at a
8349 conditional-expression. */
8352 else
8353 {
8356 /* If it's an assignment-operator, we're using the second
8357 production. */
8358 enum tree_code assignment_operator
8361 {
8363 location_t saved_input_location;
8365 /* Parse the right-hand side of the assignment. */
8371 /* An assignment may not appear in a
8372 constant-expression. */
8374 NIC_ASSIGNMENT))
8376 /* Build the assignment expression. Its default
8377 location is the location of the '=' token. */
8381 assignment_operator,
8382 rhs,
8385 }
8386 }
8387 }
8390 }
8392 /* Parse an (optional) assignment-operator.
8394 assignment-operator: one of
8395 = *= /= %= += -= >>= <<= &= ^= |=
8397 GNU Extension:
8399 assignment-operator: one of
8400 <?= >?=
8402 If the next token is an assignment operator, the corresponding tree
8403 code is returned, and the token is consumed. For example, for
8404 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8405 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8406 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8407 operator, ERROR_MARK is returned. */
8409 static enum tree_code
8411 {
8415 /* Peek at the next token. */
8419 {
8465 /* Nothing else is an assignment operator. */
8467 }
8469 /* If it was an assignment operator, consume it. */
8474 }
8476 /* Parse an expression.
8478 expression:
8479 assignment-expression
8480 expression , assignment-expression
8482 CAST_P is true if this expression is the target of a cast.
8483 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8484 except possibly parenthesized or on the RHS of a comma (N3276).
8486 Returns a representation of the expression. */
8488 static tree
8491 {
8496 {
8497 tree assignment_expression;
8499 /* Parse the next assignment-expression. */
8500 assignment_expression
8503 /* We don't create a temporary for a call that is the immediate operand
8504 of decltype or on the RHS of a comma. But when we see a comma, we
8505 need to create a temporary for a call on the LHS. */
8510 assignment_expression
8514 /* If this is the first assignment-expression, we can just
8515 save it away. */
8518 else
8520 assignment_expression,
8522 /* If the next token is not a comma, then we are done with the
8523 expression. */
8526 /* Consume the `,'. */
8529 /* A comma operator cannot appear in a constant-expression. */
8532 }
8535 }
8537 /* Parse a constant-expression.
8539 constant-expression:
8540 conditional-expression
8542 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8543 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8544 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8545 is false, NON_CONSTANT_P should be NULL. */
8547 static tree
8551 {
8555 tree expression;
8557 /* It might seem that we could simply parse the
8558 conditional-expression, and then check to see if it were
8559 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8560 one that the compiler can figure out is constant, possibly after
8561 doing some simplifications or optimizations. The standard has a
8562 precise definition of constant-expression, and we must honor
8563 that, even though it is somewhat more restrictive.
8565 For example:
8567 int i[(2, 3)];
8569 is not a legal declaration, because `(2, 3)' is not a
8570 constant-expression. The `,' operator is forbidden in a
8571 constant-expression. However, GCC's constant-folding machinery
8572 will fold this operation to an INTEGER_CST for `3'. */
8574 /* Save the old settings. */
8576 saved_allow_non_integral_constant_expression_p
8579 /* We are now parsing a constant-expression. */
8581 parser->allow_non_integral_constant_expression_p
8584 /* Although the grammar says "conditional-expression", we parse an
8585 "assignment-expression", which also permits "throw-expression"
8586 and the use of assignment operators. In the case that
8587 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8588 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8589 actually essential that we look for an assignment-expression.
8590 For example, cp_parser_initializer_clauses uses this function to
8591 determine whether a particular assignment-expression is in fact
8592 constant. */
8594 /* Restore the old settings. */
8595 parser->integral_constant_expression_p
8597 parser->allow_non_integral_constant_expression_p
8600 {
8601 /* Require an rvalue constant expression here; that's what our
8602 callers expect. Reference constant expressions are handled
8603 separately in e.g. cp_parser_template_argument. */
8608 }
8611 parser->non_integral_constant_expression_p
8615 }
8617 /* Parse __builtin_offsetof.
8619 offsetof-expression:
8620 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8622 offsetof-member-designator:
8623 id-expression
8624 | offsetof-member-designator "." id-expression
8625 | offsetof-member-designator "[" expression "]"
8626 | offsetof-member-designator "->" id-expression */
8628 static tree
8630 {
8633 cp_id_kind dummy;
8636 /* We're about to accept non-integral-constant things, but will
8637 definitely yield an integral constant expression. Save and
8638 restore these values around our local parsing. */
8642 /* Consume the "__builtin_offsetof" token. */
8644 /* Consume the opening `('. */
8646 /* Parse the type-id. */
8649 /* Look for the `,'. */
8653 /* Build the (type *)null that begins the traditional offsetof macro. */
8655 tf_warning_or_error);
8657 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8661 {
8664 {
8666 /* offsetof-member-designator "[" expression "]" */
8672 /* offsetof-member-designator "->" identifier */
8675 /* FALLTHRU */
8678 /* offsetof-member-designator "." identifier */
8686 /* Consume the ")" token. */
8691 /* Error. We know the following require will fail, but
8692 that gives the proper error message. */
8697 }
8698 }
8700 success:
8701 /* If we're processing a template, we can't finish the semantics yet.
8702 Otherwise we can fold the entire expression now. */
8704 {
8707 }
8708 else
8711 failure:
8716 }
8718 /* Parse a trait expression.
8720 Returns a representation of the expression, the underlying type
8721 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8723 static tree
8725 {
8726 cp_trait_kind kind;
8732 {
8816 }
8818 /* Consume the token. */
8829 {
8836 }
8838 {
8840 {
8844 {
8847 }
8851 }
8852 }
8856 /* Complete the trait expression, which may mean either processing
8857 the trait expr now or saving it for template instantiation. */
8859 {
8868 }
8869 }
8871 /* Lambdas that appear in variable initializer or default argument scope
8872 get that in their mangling, so we need to record it. We might as well
8873 use the count for function and namespace scopes as well. */
8877 {
8878 tree t;
8883 static void
8885 {
8886 tree_int ti;
8888 /* Once we're inside a function, we ignore other scopes and just push
8889 the function again so that popping works properly. */
8896 {
8897 /* Don't reset the count if we're still in the same function. */
8900 }
8901 }
8903 static void
8905 {
8908 }
8910 static void
8912 {
8915 {
8918 }
8920 }
8922 /* Parse a lambda expression.
8924 lambda-expression:
8925 lambda-introducer lambda-declarator [opt] compound-statement
8927 Returns a representation of the expression. */
8929 static tree
8931 {
8933 tree type;
8941 {
8943 {
8947 }
8949 }
8951 {
8953 {
8956 }
8958 }
8960 /* We may be in the middle of deferred access check. Disable
8961 it now. */
8972 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8975 /* Now that we've started the type, add the capture fields for any
8976 explicit captures. */
8979 {
8980 /* Inside the class, surrounding template-parameter-lists do not apply. */
8981 unsigned int saved_num_template_parameter_lists
8985 bool fully_implicit_function_template_p
8989 bool auto_is_implicit_function_template_parm_p
9000 /* By virtue of defining a local class, a lambda expression has access to
9001 the private variables of enclosing classes. */
9006 {
9012 }
9014 {
9017 }
9019 /* The capture list was built up in reverse order; fix that now. */
9031 parser->fully_implicit_function_template_p
9035 parser->auto_is_implicit_function_template_parm_p
9037 }
9041 /* This field is only used during parsing of the lambda. */
9044 /* This lambda shouldn't have any proxies left at this point. */
9046 /* And now that we're done, push proxies for an enclosing lambda. */
9051 else
9057 }
9059 /* Parse the beginning of a lambda expression.
9061 lambda-introducer:
9062 [ lambda-capture [opt] ]
9064 LAMBDA_EXPR is the current representation of the lambda expression. */
9066 static void
9068 {
9069 /* Need commas after the first capture. */
9072 /* Eat the leading `['. */
9075 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9083 {
9086 }
9089 {
9091 tree capture_id;
9092 tree capture_init_expr;
9096 enum capture_kind_type
9097 {
9098 BY_COPY,
9099 BY_REFERENCE
9100 };
9104 {
9107 }
9111 else
9114 /* Possibly capture `this'. */
9116 {
9126 explicit_init_p);
9128 }
9130 /* Remember whether we want to capture as a reference or not. */
9132 {
9135 }
9137 /* Get the identifier. */
9142 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9143 delimiters, but I modified this to stop on unnested ']' as well. It
9144 was already changed to stop on unnested '}', so the
9145 "closing_parenthesis" name is no more misleading with my change. */
9146 {
9152 }
9154 /* Find the initializer for this capture. */
9158 {
9160 /* An explicit initializer exists. */
9163 "lambda capture initializers "
9169 {
9172 }
9173 }
9174 else
9175 {
9178 /* Turn the identifier into an id-expression. */
9179 capture_init_expr
9184 {
9187 }
9191 {
9194 capture_init_expr);
9197 }
9200 {
9203 capture_init_expr))
9206 }
9208 capture_init_expr
9209 = finish_id_expression
9211 capture_init_expr,
9225 {
9228 }
9229 else
9231 }
9235 {
9240 capture_id);
9244 "capture of %qD redundant with by-reference capture "
9246 }
9249 capture_id,
9250 capture_init_expr,
9252 explicit_init_p);
9253 }
9256 }
9258 /* Parse the (optional) middle of a lambda expression.
9260 lambda-declarator:
9261 < template-parameter-list [opt] >
9262 ( parameter-declaration-clause [opt] )
9263 attribute-specifier [opt]
9264 mutable [opt]
9265 exception-specification [opt]
9266 lambda-return-type-clause [opt]
9268 LAMBDA_EXPR is the current representation of the lambda expression. */
9270 static bool
9272 {
9273 /* 5.1.1.4 of the standard says:
9274 If a lambda-expression does not include a lambda-declarator, it is as if
9275 the lambda-declarator were ().
9276 This means an empty parameter list, no attributes, and no exception
9277 specification. */
9283 /* The template-parameter-list is optional, but must begin with
9284 an opening angle if present. */
9286 {
9289 "lambda templates are only available with "
9298 /* We just processed one more parameter list. */
9300 }
9302 /* The parameter-declaration-clause is optional (unless
9303 template-parameter-list was given), but must begin with an
9304 opening parenthesis if present. */
9306 {
9311 /* Parse parameters. */
9314 /* Default arguments shall not be specified in the
9315 parameter-declaration-clause of a lambda-declarator. */
9325 /* Parse optional `mutable' keyword. */
9327 {
9330 }
9332 /* Parse optional exception specification. */
9335 /* Parse optional trailing return type. */
9337 {
9341 }
9343 /* The function parameters must be in scope all the way until after the
9344 trailing-return-type in case of decltype. */
9346 }
9350 /* Create the function call operator.
9352 Messing with declarators like this is no uglier than building up the
9353 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9354 other code. */
9355 {
9356 cp_decl_specifier_seq return_type_specs;
9358 tree fco;
9365 else
9366 /* Maybe we will deduce the return type later. */
9372 sfk_none);
9377 VIRT_SPEC_UNSPECIFIED,
9378 REF_QUAL_NONE,
9379 exception_spec,
9384 declarator,
9385 attributes);
9387 {
9390 /* Give the object parameter a different name. */
9394 }
9396 {
9400 }
9409 }
9410 }
9412 /* Parse the body of a lambda expression, which is simply
9414 compound-statement
9416 but which requires special handling.
9417 LAMBDA_EXPR is the current representation of the lambda expression. */
9419 static void
9421 {
9426 else
9427 /* Still increment function_depth so that we don't GC in the
9428 middle of an expression. */
9430 /* Clear this in case we're in the middle of a default argument. */
9433 /* Finish the function call operator
9434 - class_specifier
9435 + late_parsing_for_member
9436 + function_definition_after_declarator
9437 + ctor_initializer_opt_and_function_body */
9438 {
9440 tree body;
9442 tree compound_stmt;
9443 tree cap;
9445 /* Let the front end know that we are going to be defining this
9446 function. */
9448 NULL_TREE,
9457 /* Push the proxies for any explicit captures. */
9464 /* 5.1.1.4 of the standard says:
9465 If a lambda-expression does not include a trailing-return-type, it
9466 is as if the trailing-return-type denotes the following type:
9467 * if the compound-statement is of the form
9468 { return attribute-specifier [opt] expression ; }
9469 the type of the returned expression after lvalue-to-rvalue
9470 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9471 (_conv.array_ 4.2), and function-to-pointer conversion
9472 (_conv.func_ 4.3);
9473 * otherwise, void. */
9475 /* In a lambda that has neither a lambda-return-type-clause
9476 nor a deducible form, errors should be reported for return statements
9477 in the body. Since we used void as the placeholder return type, parsing
9478 the body as usual will give such desired behavior. */
9482 {
9486 /* Parse tentatively in case there's more after the initial return
9487 statement. */
9498 {
9502 /* Will get error here if type not deduced yet. */
9506 }
9507 }
9510 {
9515 }
9519 out:
9523 /* Finish the function and generate code for it if necessary. */
9526 /* Only expand if the call op is not a template. */
9529 }
9534 else
9536 }
9538 /* Statements [gram.stmt.stmt] */
9540 /* Parse a statement.
9542 statement:
9543 labeled-statement
9544 expression-statement
9545 compound-statement
9546 selection-statement
9547 iteration-statement
9548 jump-statement
9549 declaration-statement
9550 try-block
9552 C++11:
9554 statement:
9555 labeled-statement
9556 attribute-specifier-seq (opt) expression-statement
9557 attribute-specifier-seq (opt) compound-statement
9558 attribute-specifier-seq (opt) selection-statement
9559 attribute-specifier-seq (opt) iteration-statement
9560 attribute-specifier-seq (opt) jump-statement
9561 declaration-statement
9562 attribute-specifier-seq (opt) try-block
9564 TM Extension:
9566 statement:
9567 atomic-statement
9569 IN_COMPOUND is true when the statement is nested inside a
9570 cp_parser_compound_statement; this matters for certain pragmas.
9572 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9573 is a (possibly labeled) if statement which is not enclosed in braces
9574 and has an else clause. This is used to implement -Wparentheses. */
9576 static void
9579 {
9584 restart:
9587 /* There is no statement yet. */
9593 /* In obj-c++, seeing '[[' might be the either the beginning of
9594 c++11 attributes, or a nested objc-message-expression. So
9595 let's parse the c++11 attributes tentatively. */
9599 {
9602 }
9604 /* Peek at the next token. */
9606 /* Remember the location of the first token in the statement. */
9608 /* If this is a keyword, then that will often determine what kind of
9609 statement we have. */
9611 {
9615 {
9618 /* Looks like a labeled-statement with a case label.
9619 Parse the label, and then use tail recursion to parse
9620 the statement. */
9637 {
9642 }
9643 else
9657 {
9662 }
9663 else
9664 {
9668 }
9672 /* Objective-C++ exception-handling constructs. */
9686 /* This must be a namespace alias definition. */
9699 /* It might be a keyword like `int' that can start a
9700 declaration-statement. */
9702 }
9703 }
9705 {
9706 /* If the next token is a `:', then we are looking at a
9707 labeled-statement. */
9710 {
9711 /* Looks like a labeled-statement with an ordinary label.
9712 Parse the label, and then use tail recursion to parse
9713 the statement. */
9717 }
9718 }
9719 /* Anything that starts with a `{' must be a compound-statement. */
9722 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9723 a statement all its own. */
9725 {
9726 /* Only certain OpenMP pragmas are attached to statements, and thus
9727 are considered statements themselves. All others are not. In
9728 the context of a compound, accept the pragma as a "statement" and
9729 return so that we can check for a close brace. Otherwise we
9730 require a real statement and must go back and read one. */
9736 }
9738 {
9741 }
9743 /* Everything else must be a declaration-statement or an
9744 expression-statement. Try for the declaration-statement
9745 first, unless we are looking at a `;', in which case we know that
9746 we have an expression-statement. */
9748 {
9750 {
9752 {
9753 /* Attributes should be parsed as part of the the
9754 declaration, so let's un-parse them. */
9757 }
9760 /* Try to parse the declaration-statement. */
9762 /* If that worked, we're done. */
9765 }
9766 /* Look for an expression-statement instead. */
9768 }
9770 /* Set the line number for the statement. */
9774 /* Note that for now, we don't do anything with c++11 statements
9775 parsed at this level. */
9778 OPT_Wattributes,
9780 }
9782 /* Parse the label for a labeled-statement, i.e.
9784 identifier :
9785 case constant-expression :
9786 default :
9788 GNU Extension:
9789 case constant-expression ... constant-expression : statement
9791 When a label is parsed without errors, the label is added to the
9792 parse tree by the finish_* functions, so this function doesn't
9793 have to return the label. */
9795 static void
9797 {
9802 /* The next token should be an identifier. */
9806 {
9809 }
9813 {
9815 {
9819 /* Consume the `case' token. */
9821 /* Parse the constant-expression. */
9826 {
9827 /* Consume the `...' token. */
9829 expr_hi =
9832 /* We don't need to emit warnings here, as the common code
9833 will do this for us. */
9834 }
9835 else
9840 else
9843 expr);
9844 }
9848 /* Consume the `default' token. */
9853 else
9858 /* Anything else must be an ordinary label. */
9861 }
9863 /* Require the `:' token. */
9866 /* An ordinary label may optionally be followed by attributes.
9867 However, this is only permitted if the attributes are then
9868 followed by a semicolon. This is because, for backward
9869 compatibility, when parsing
9870 lab: __attribute__ ((unused)) int i;
9871 we want the attribute to attach to "i", not "lab". */
9874 {
9875 tree attrs;
9882 ;
9883 else
9885 }
9891 }
9893 /* Parse an expression-statement.
9895 expression-statement:
9896 expression [opt] ;
9898 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9899 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9900 indicates whether this expression-statement is part of an
9901 expression statement. */
9903 static tree
9905 {
9909 /* If the next token is a ';', then there is no expression
9910 statement. */
9912 {
9916 {
9919 }
9920 }
9922 /* Give a helpful message for "A<T>::type t;" and the like. */
9925 {
9932 {
9933 /* A::A a; */
9938 }
9939 }
9941 /* Consume the final `;'. */
9946 /* This is the final expression statement of a statement
9947 expression. */
9953 }
9955 /* Parse a compound-statement.
9957 compound-statement:
9958 { statement-seq [opt] }
9960 GNU extension:
9962 compound-statement:
9963 { label-declaration-seq [opt] statement-seq [opt] }
9965 label-declaration-seq:
9966 label-declaration
9967 label-declaration-seq label-declaration
9969 Returns a tree representing the statement. */
9971 static tree
9974 {
9975 tree compound_stmt;
9977 /* Consume the `{'. */
9984 /* Begin the compound-statement. */
9986 /* If the next keyword is `__label__' we have a label declaration. */
9989 /* Parse an (optional) statement-seq. */
9991 /* Finish the compound-statement. */
9993 /* Consume the `}'. */
9997 }
9999 /* Parse an (optional) statement-seq.
10001 statement-seq:
10002 statement
10003 statement-seq [opt] statement */
10005 static void
10007 {
10008 /* Scan statements until there aren't any more. */
10010 {
10013 /* If we are looking at a `}', then we have run out of
10014 statements; the same is true if we have reached the end
10015 of file, or have stumbled upon a stray '@end'. */
10022 /* If we are in a compound statement and find 'else' then
10023 something went wrong. */
10025 {
10028 else
10029 {
10032 }
10033 }
10035 /* Parse the statement. */
10037 }
10038 }
10040 /* Parse a selection-statement.
10042 selection-statement:
10043 if ( condition ) statement
10044 if ( condition ) statement else statement
10045 switch ( condition ) statement
10047 Returns the new IF_STMT or SWITCH_STMT.
10049 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10050 is a (possibly labeled) if statement which is not enclosed in
10051 braces and has an else clause. This is used to implement
10052 -Wparentheses. */
10054 static tree
10056 {
10063 /* Peek at the next token. */
10066 /* See what kind of keyword it is. */
10069 {
10072 {
10073 tree statement;
10074 tree condition;
10076 /* Look for the `('. */
10078 {
10081 }
10083 /* Begin the selection-statement. */
10086 else
10089 /* Parse the condition. */
10091 /* Look for the `)'. */
10097 {
10101 /* Add the condition. */
10104 /* Parse the then-clause. */
10108 {
10116 }
10117 else
10123 /* If the next token is `else', parse the else-clause. */
10125 RID_ELSE))
10126 {
10127 /* Consume the `else' keyword. */
10130 /* Parse the else-clause. */
10132 {
10133 location_t loc;
10140 }
10141 else
10146 /* If we are currently parsing a then-clause, then
10147 IF_P will not be NULL. We set it to true to
10148 indicate that this if statement has an else clause.
10149 This may trigger the Wparentheses warning below
10150 when we get back up to the parent if statement. */
10153 }
10154 else
10155 {
10156 /* This if statement does not have an else clause. If
10157 NESTED_IF is true, then the then-clause is an if
10158 statement which does have an else clause. We warn
10159 about the potential ambiguity. */
10162 "suggest explicit braces to avoid ambiguous"
10164 }
10166 /* Now we're all done with the if-statement. */
10168 }
10169 else
10170 {
10174 /* Add the condition. */
10177 /* Parse the body of the switch-statement. */
10186 /* Now we're all done with the switch-statement. */
10188 }
10191 }
10197 }
10198 }
10200 /* Parse a condition.
10202 condition:
10203 expression
10204 type-specifier-seq declarator = initializer-clause
10205 type-specifier-seq declarator braced-init-list
10207 GNU Extension:
10209 condition:
10210 type-specifier-seq declarator asm-specification [opt]
10211 attributes [opt] = assignment-expression
10213 Returns the expression that should be tested. */
10215 static tree
10217 {
10218 cp_decl_specifier_seq type_specifiers;
10222 /* Try the declaration first. */
10224 /* New types are not allowed in the type-specifier-seq for a
10225 condition. */
10227 parser->type_definition_forbidden_message
10229 /* Parse the type-specifier-seq. */
10231 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10234 /* Restore the saved message. */
10236 /* If all is well, we might be looking at a declaration. */
10238 {
10239 tree decl;
10240 tree asm_specification;
10241 tree attributes;
10245 /* Parse the declarator. */
10251 /* Parse the attributes. */
10253 /* Parse the asm-specification. */
10255 /* If the next token is not an `=' or '{', then we might still be
10256 looking at an expression. For example:
10258 if (A(a).x)
10260 looks like a decl-specifier-seq and a declarator -- but then
10261 there is no `=', so this is an expression. */
10266 /* If we did see an `=' or '{', then we are looking at a declaration
10267 for sure. */
10269 {
10270 tree pushed_scope;
10274 /* Create the declaration. */
10280 /* Parse the initializer. */
10282 {
10286 }
10287 else
10288 {
10289 /* Consume the `='. */
10292 }
10296 /* Process the initializer. */
10299 asm_specification,
10300 flags);
10306 }
10307 }
10308 /* If we didn't even get past the declarator successfully, we are
10309 definitely not looking at a declaration. */
10310 else
10313 /* Otherwise, we are looking at an expression. */
10315 }
10317 /* Parses a for-statement or range-for-statement until the closing ')',
10318 not included. */
10320 static tree
10322 {
10326 /* Begin the for-statement. */
10329 /* Parse the initialization. */
10334 else
10336 }
10338 static tree
10340 {
10341 /* Normal for loop */
10344 tree stmt;
10347 /* The for-init-statement has already been parsed in
10348 cp_parser_for_init_statement, so no work is needed here. */
10351 /* If there's a condition, process it. */
10355 {
10359 }
10361 /* Look for the `;'. */
10364 /* If there's an expression, process it. */
10370 }
10372 /* Tries to parse a range-based for-statement:
10374 range-based-for:
10375 decl-specifier-seq declarator : expression
10377 The decl-specifier-seq declarator and the `:' are already parsed by
10378 cp_parser_for_init_statement. If processing_template_decl it returns a
10379 newly created RANGE_FOR_STMT; if not, it is converted to a
10380 regular FOR_STMT. */
10382 static tree
10385 {
10389 {
10392 }
10393 else
10396 /* If in template, STMT is converted to a normal for-statement
10397 at instantiation. If not, it is done just ahead. */
10399 {
10407 /* do_auto_deduction doesn't mess with template init-lists. */
10410 }
10411 else
10412 {
10415 }
10417 }
10419 /* Subroutine of cp_convert_range_for: given the initializer expression,
10420 builds up the range temporary. */
10422 static tree
10424 {
10427 /* Find out the type deduced by the declaration
10428 `auto &&__range = range_expr'. */
10433 /* Create the __range variable. */
10440 }
10442 /* Used by cp_parser_range_for in template context: we aren't going to
10443 do a full conversion yet, but we still need to resolve auto in the
10444 type of the for-range-declaration if present. This is basically
10445 a shortcut version of cp_convert_range_for. */
10447 static void
10449 {
10452 {
10455 iter_type = (cp_parser_perform_range_for_lookup
10458 {
10460 iter_type);
10462 tf_warning_or_error);
10465 }
10466 }
10467 }
10469 /* Converts a range-based for-statement into a normal
10470 for-statement, as per the definition.
10472 for (RANGE_DECL : RANGE_EXPR)
10473 BLOCK
10475 should be equivalent to:
10477 {
10478 auto &&__range = RANGE_EXPR;
10479 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10480 __begin != __end;
10481 ++__begin)
10482 {
10483 RANGE_DECL = *__begin;
10484 BLOCK
10485 }
10486 }
10488 If RANGE_EXPR is an array:
10489 BEGIN_EXPR = __range
10490 END_EXPR = __range + ARRAY_SIZE(__range)
10491 Else if RANGE_EXPR has a member 'begin' or 'end':
10492 BEGIN_EXPR = __range.begin()
10493 END_EXPR = __range.end()
10494 Else:
10495 BEGIN_EXPR = begin(__range)
10496 END_EXPR = end(__range);
10498 If __range has a member 'begin' but not 'end', or vice versa, we must
10499 still use the second alternative (it will surely fail, however).
10500 When calling begin()/end() in the third alternative we must use
10501 argument dependent lookup, but always considering 'std' as an associated
10502 namespace. */
10504 tree
10507 {
10513 /* If an error happened previously do nothing or else a lot of
10514 unhelpful errors would be issued. */
10516 else
10517 {
10518 tree range_temp;
10522 /* Can't bind a reference to an array of runtime bound. */
10524 else
10525 {
10530 LOOKUP_ONLYCONVERTING);
10532 }
10535 }
10537 /* The new for initialization statement. */
10545 LOOKUP_ONLYCONVERTING);
10554 LOOKUP_ONLYCONVERTING);
10558 /* The new for condition. */
10565 /* The new increment expression. */
10568 tf_warning_or_error);
10571 /* The declaration is initialized with *__begin inside the loop body. */
10574 tf_warning_or_error),
10576 LOOKUP_ONLYCONVERTING);
10579 }
10581 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10582 We need to solve both at the same time because the method used
10583 depends on the existence of members begin or end.
10584 Returns the type deduced for the iterator expression. */
10586 static tree
10588 {
10590 {
10593 }
10596 {
10601 }
10603 {
10604 /* If RANGE is an array, we will use pointer arithmetic. */
10607 range,
10611 }
10612 else
10613 {
10614 /* If it is not an array, we must do a bit of magic. */
10624 tf_warning_or_error);
10627 tf_warning_or_error);
10630 {
10631 /* Use the member functions. */
10634 else
10640 else
10643 }
10644 else
10645 {
10646 /* Use global functions with ADL. */
10653 tf_warning_or_error);
10655 tf_warning_or_error);
10657 tf_warning_or_error);
10659 tf_warning_or_error);
10662 }
10664 /* Last common checks. */
10666 {
10667 /* If one of the expressions is an error do no more checks. */
10670 }
10673 /* Can happen, when, eg, in a template context, Koenig lookup
10674 can't resolve begin/end (c++/58503). */
10676 else
10677 {
10679 /* The unqualified type of the __begin and __end temporaries should
10680 be the same, as required by the multiple auto declaration. */
10686 }
10687 }
10688 }
10690 /* Helper function for cp_parser_perform_range_for_lookup.
10691 Builds a tree for RANGE.IDENTIFIER(). */
10693 static tree
10695 {
10708 tf_warning_or_error);
10711 }
10713 /* Parse an iteration-statement.
10715 iteration-statement:
10716 while ( condition ) statement
10717 do statement while ( expression ) ;
10718 for ( for-init-statement condition [opt] ; expression [opt] )
10719 statement
10721 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10723 static tree
10725 {
10728 tree statement;
10731 /* Peek at the next token. */
10736 /* Remember whether or not we are already within an iteration
10737 statement. */
10740 /* See what kind of keyword it is. */
10743 {
10745 {
10746 tree condition;
10748 /* Begin the while-statement. */
10750 /* Look for the `('. */
10752 /* Parse the condition. */
10755 /* Look for the `)'. */
10757 /* Parse the dependent statement. */
10761 /* We're done with the while-statement. */
10763 }
10767 {
10768 tree expression;
10770 /* Begin the do-statement. */
10772 /* Parse the body of the do-statement. */
10777 /* Look for the `while' keyword. */
10779 /* Look for the `('. */
10781 /* Parse the expression. */
10783 /* We're done with the do-statement. */
10785 /* Look for the `)'. */
10787 /* Look for the `;'. */
10789 }
10793 {
10794 /* Look for the `('. */
10799 /* Look for the `)'. */
10802 /* Parse the body of the for-statement. */
10807 /* We're done with the for-statement. */
10809 }
10816 }
10819 }
10821 /* Parse a for-init-statement or the declarator of a range-based-for.
10822 Returns true if a range-based-for declaration is seen.
10824 for-init-statement:
10825 expression-statement
10826 simple-declaration */
10828 static bool
10830 {
10831 /* If the next token is a `;', then we have an empty
10832 expression-statement. Grammatically, this is also a
10833 simple-declaration, but an invalid one, because it does not
10834 declare anything. Therefore, if we did not handle this case
10835 specially, we would issue an error message about an invalid
10836 declaration. */
10838 {
10844 {
10845 /* N3994 -- for (id : init) ... */
10848 "type-specifier only available with "
10856 }
10858 /* A colon is used in range-based for. */
10861 /* We're going to speculatively look for a declaration, falling back
10862 to an expression, if necessary. */
10864 /* Parse the declaration. */
10867 decl);
10870 {
10871 /* It is a range-for, consume the ':' */
10875 {
10877 "range-based %<for%> loops only available with "
10880 }
10881 }
10882 else
10883 /* The ';' is not consumed yet because we told
10884 cp_parser_simple_declaration not to. */
10889 /* If the tentative parse failed, then we shall need to look for an
10890 expression-statement. */
10891 }
10892 /* If we are here, it is an expression-statement. */
10895 }
10897 /* Parse a jump-statement.
10899 jump-statement:
10900 break ;
10901 continue ;
10902 return expression [opt] ;
10903 return braced-init-list ;
10904 goto identifier ;
10906 GNU extension:
10908 jump-statement:
10909 goto * expression ;
10911 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10913 static tree
10915 {
10921 /* Peek at the next token. */
10926 /* See what kind of keyword it is. */
10929 {
10933 {
10953 }
10959 {
10966 /* Fall through. */
10976 }
10981 {
10982 tree expr;
10986 {
10990 }
10993 else
10994 /* If the next token is a `;', then there is no
10995 expression. */
10997 /* Build the return-statement. */
10999 /* Look for the final `;'. */
11001 }
11007 {
11010 }
11012 /* Create the goto-statement. */
11014 {
11015 /* Issue a warning about this use of a GNU extension. */
11017 /* Consume the '*' token. */
11019 /* Parse the dependent expression. */
11021 }
11022 else
11024 /* Look for the final `;'. */
11031 }
11034 }
11036 /* Parse a declaration-statement.
11038 declaration-statement:
11039 block-declaration */
11041 static void
11043 {
11046 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11049 /* Parse the block-declaration. */
11052 /* Free any declarators allocated. */
11054 }
11056 /* Some dependent statements (like `if (cond) statement'), are
11057 implicitly in their own scope. In other words, if the statement is
11058 a single statement (as opposed to a compound-statement), it is
11059 none-the-less treated as if it were enclosed in braces. Any
11060 declarations appearing in the dependent statement are out of scope
11061 after control passes that point. This function parses a statement,
11062 but ensures that is in its own scope, even if it is not a
11063 compound-statement.
11065 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11066 is a (possibly labeled) if statement which is not enclosed in
11067 braces and has an else clause. This is used to implement
11068 -Wparentheses.
11070 Returns the new statement. */
11072 static tree
11074 {
11075 tree statement;
11080 /* Mark if () ; with a special NOP_EXPR. */
11082 {
11086 }
11087 /* if a compound is opened, we simply parse the statement directly. */
11090 /* If the token is not a `{', then we must take special action. */
11091 else
11092 {
11093 /* Create a compound-statement. */
11095 /* Parse the dependent-statement. */
11097 /* Finish the dummy compound-statement. */
11099 }
11101 /* Return the statement. */
11103 }
11105 /* For some dependent statements (like `while (cond) statement'), we
11106 have already created a scope. Therefore, even if the dependent
11107 statement is a compound-statement, we do not want to create another
11108 scope. */
11110 static void
11112 {
11113 /* If the token is a `{', then we must take special action. */
11116 else
11117 {
11118 /* Avoid calling cp_parser_compound_statement, so that we
11119 don't create a new scope. Do everything else by hand. */
11121 /* If the next keyword is `__label__' we have a label declaration. */
11124 /* Parse an (optional) statement-seq. */
11127 }
11128 }
11130 /* Declarations [gram.dcl.dcl] */
11132 /* Parse an optional declaration-sequence.
11134 declaration-seq:
11135 declaration
11136 declaration-seq declaration */
11138 static void
11140 {
11142 {
11153 {
11154 /* A declaration consisting of a single semicolon is
11155 invalid. Allow it unless we're being pedantic. */
11160 }
11162 /* If we're entering or exiting a region that's implicitly
11163 extern "C", modify the lang context appropriately. */
11165 {
11168 }
11170 {
11173 }
11176 {
11177 /* A top-level declaration can consist solely of a #pragma.
11178 A nested declaration cannot, so this is done here and not
11179 in cp_parser_declaration. (A #pragma at block scope is
11180 handled in cp_parser_statement.) */
11183 }
11185 /* Parse the declaration itself. */
11187 }
11188 }
11190 /* Parse a declaration.
11192 declaration:
11193 block-declaration
11194 function-definition
11195 template-declaration
11196 explicit-instantiation
11197 explicit-specialization
11198 linkage-specification
11199 namespace-definition
11201 GNU extension:
11203 declaration:
11204 __extension__ declaration */
11206 static void
11208 {
11209 cp_token token1;
11210 cp_token token2;
11215 /* Check for the `__extension__' keyword. */
11217 {
11218 /* Parse the qualified declaration. */
11220 /* Restore the PEDANTIC flag. */
11224 }
11226 /* Try to figure out what kind of declaration is present. */
11231 else
11232 {
11235 }
11237 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11240 /* If the next token is `extern' and the following token is a string
11241 literal, then we have a linkage specification. */
11245 /* If the next token is `template', then we have either a template
11246 declaration, an explicit instantiation, or an explicit
11247 specialization. */
11249 {
11250 /* `template <>' indicates a template specialization. */
11254 /* `template <' indicates a template declaration. */
11257 /* Anything else must be an explicit instantiation. */
11258 else
11260 }
11261 /* If the next token is `export', then we have a template
11262 declaration. */
11265 /* If the next token is `extern', 'static' or 'inline' and the one
11266 after that is `template', we have a GNU extended explicit
11267 instantiation directive. */
11274 /* If the next token is `namespace', check for a named or unnamed
11275 namespace definition. */
11281 /* An unnamed namespace definition. */
11285 /* An inline (associated) namespace definition. */
11289 /* Objective-C++ declaration/definition. */
11296 /* We must have either a block declaration or a function
11297 definition. */
11298 else
11299 /* Try to parse a block-declaration, or a function-definition. */
11302 /* Free any declarators allocated. */
11304 }
11306 /* Parse a block-declaration.
11308 block-declaration:
11309 simple-declaration
11310 asm-definition
11311 namespace-alias-definition
11312 using-declaration
11313 using-directive
11315 GNU Extension:
11317 block-declaration:
11318 __extension__ block-declaration
11320 C++0x Extension:
11322 block-declaration:
11323 static_assert-declaration
11325 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11326 part of a declaration-statement. */
11328 static void
11331 {
11335 /* Check for the `__extension__' keyword. */
11337 {
11338 /* Parse the qualified declaration. */
11340 /* Restore the PEDANTIC flag. */
11344 }
11346 /* Peek at the next token to figure out which kind of declaration is
11347 present. */
11350 /* If the next keyword is `asm', we have an asm-definition. */
11352 {
11356 }
11357 /* If the next keyword is `namespace', we have a
11358 namespace-alias-definition. */
11361 /* If the next keyword is `using', we have a
11362 using-declaration, a using-directive, or an alias-declaration. */
11364 {
11369 /* If the token after `using' is `namespace', then we have a
11370 using-directive. */
11374 /* If the second token after 'using' is '=', then we have an
11375 alias-declaration. */
11381 /* Otherwise, it's a using-declaration. */
11382 else
11385 }
11386 /* If the next keyword is `__label__' we have a misplaced label
11387 declaration. */
11389 {
11393 /* If the next token is now a `;', consume it. */
11396 }
11397 /* If the next token is `static_assert' we have a static assertion. */
11400 /* Anything else must be a simple-declaration. */
11401 else
11404 }
11406 /* Parse a simple-declaration.
11408 simple-declaration:
11409 decl-specifier-seq [opt] init-declarator-list [opt] ;
11411 init-declarator-list:
11412 init-declarator
11413 init-declarator-list , init-declarator
11415 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11416 function-definition as a simple-declaration.
11418 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11419 parsed declaration if it is an uninitialized single declarator not followed
11420 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11421 if present, will not be consumed. */
11423 static void
11427 {
11428 cp_decl_specifier_seq decl_specifiers;
11435 /* Defer access checks until we know what is being declared; the
11436 checks for names appearing in the decl-specifier-seq should be
11437 done as if we were in the scope of the thing being declared. */
11440 /* Parse the decl-specifier-seq. We have to keep track of whether
11441 or not the decl-specifier-seq declares a named class or
11442 enumeration type, since that is the only case in which the
11443 init-declarator-list is allowed to be empty.
11445 [dcl.dcl]
11447 In a simple-declaration, the optional init-declarator-list can be
11448 omitted only when declaring a class or enumeration, that is when
11449 the decl-specifier-seq contains either a class-specifier, an
11450 elaborated-type-specifier, or an enum-specifier. */
11452 CP_PARSER_FLAGS_OPTIONAL,
11455 /* We no longer need to defer access checks. */
11458 /* In a block scope, a valid declaration must always have a
11459 decl-specifier-seq. By not trying to parse declarators, we can
11460 resolve the declaration/expression ambiguity more quickly. */
11463 {
11466 }
11468 /* If the next two tokens are both identifiers, the code is
11469 erroneous. The usual cause of this situation is code like:
11471 T t;
11473 where "T" should name a type -- but does not. */
11476 {
11477 /* If parsing tentatively, we should commit; we really are
11478 looking at a declaration. */
11480 /* Give up. */
11482 }
11484 /* If we have seen at least one decl-specifier, and the next token
11485 is not a parenthesis, then we must be looking at a declaration.
11486 (After "int (" we might be looking at a functional cast.) */
11493 /* Keep going until we hit the `;' at the end of the simple
11494 declaration. */
11497 CPP_SEMICOLON))
11498 {
11501 tree decl;
11504 {
11505 /* If we are processing next declarator, coma is expected */
11511 }
11512 else
11515 /* Parse the init-declarator. */
11518 function_definition_allowed_p,
11520 declares_class_or_enum,
11522 maybe_range_for_decl);
11523 /* If an error occurred while parsing tentatively, exit quickly.
11524 (That usually happens when in the body of a function; each
11525 statement is treated as a declaration-statement until proven
11526 otherwise.) */
11529 /* Handle function definitions specially. */
11531 {
11532 /* If the next token is a `,', then we are probably
11533 processing something like:
11535 void f() {}, *p;
11537 which is erroneous. */
11539 {
11542 "mixing"
11544 }
11545 /* Otherwise, we're done with the list of declarators. */
11546 else
11547 {
11550 }
11551 }
11554 /* The next token should be either a `,' or a `;'. */
11556 /* If it's a `,', there are more declarators to come. */
11559 /* If it's a `;', we are done. */
11562 /* Anything else is an error. */
11563 else
11564 {
11565 /* If we have already issued an error message we don't need
11566 to issue another one. */
11570 /* Skip tokens until we reach the end of the statement. */
11572 /* If the next token is now a `;', consume it. */
11576 }
11577 /* After the first time around, a function-definition is not
11578 allowed -- even if it was OK at first. For example:
11580 int i, f() {}
11582 is not valid. */
11584 }
11586 /* Issue an error message if no declarators are present, and the
11587 decl-specifier-seq does not itself declare a class or
11588 enumeration: [dcl.dcl]/3. */
11590 {
11592 {
11596 /* Ensure an error is issued anyway when finish_decltype_type,
11597 called via cp_parser_decl_specifier_seq, returns a class or
11598 an enumeration (c++/51786). */
11601 }
11602 /* Perform any deferred access checks. */
11604 }
11606 /* Consume the `;'. */
11610 done:
11612 }
11614 /* Parse a decl-specifier-seq.
11616 decl-specifier-seq:
11617 decl-specifier-seq [opt] decl-specifier
11618 decl-specifier attribute-specifier-seq [opt] (C++11)
11620 decl-specifier:
11621 storage-class-specifier
11622 type-specifier
11623 function-specifier
11624 friend
11625 typedef
11627 GNU Extension:
11629 decl-specifier:
11630 attributes
11632 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11634 The parser flags FLAGS is used to control type-specifier parsing.
11636 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11637 flags:
11639 1: one of the decl-specifiers is an elaborated-type-specifier
11640 (i.e., a type declaration)
11641 2: one of the decl-specifiers is an enum-specifier or a
11642 class-specifier (i.e., a type definition)
11644 */
11646 static void
11648 cp_parser_flags flags,
11651 {
11655 cp_decl_spec ds;
11657 /* Clear DECL_SPECS. */
11660 /* Assume no class or enumeration type is declared. */
11663 /* Keep reading specifiers until there are no more to read. */
11665 {
11670 /* Peek at the next token. */
11673 /* Save the first token of the decl spec list for error
11674 reporting. */
11677 /* Handle attributes. */
11679 {
11680 /* Parse the attributes. */
11683 /* In a sequence of declaration specifiers, c++11 attributes
11684 appertain to the type that precede them. In that case
11685 [dcl.spec]/1 says:
11687 The attribute-specifier-seq affects the type only for
11688 the declaration it appears in, not other declarations
11689 involving the same type.
11691 But for now let's force the user to position the
11692 attribute either at the beginning of the declaration or
11693 after the declarator-id, which would clearly mean that it
11694 applies to the declarator. */
11696 {
11698 /* The c++11 attribute is at the beginning of the
11699 declaration. It appertains to the entity being
11701 else
11702 {
11704 {
11705 /* This is an attribute following a
11706 class-specifier. */
11711 }
11712 else
11713 {
11714 decl_specs->std_attributes
11716 attrs);
11719 }
11721 }
11722 }
11724 decl_specs->attributes
11726 attrs);
11730 }
11731 /* Assume we will find a decl-specifier keyword. */
11733 /* If the next token is an appropriate keyword, we can simply
11734 add it to the list. */
11736 {
11737 /* decl-specifier:
11738 friend
11739 constexpr */
11742 {
11745 }
11746 else
11747 {
11749 /* Consume the token. */
11751 }
11759 /* function-specifier:
11760 inline
11761 virtual
11762 explicit */
11769 /* decl-specifier:
11770 typedef */
11773 /* Consume the token. */
11775 /* A constructor declarator cannot appear in a typedef. */
11777 /* The "typedef" keyword can only occur in a declaration; we
11778 may as well commit at this point. */
11785 /* storage-class-specifier:
11786 auto
11787 register
11788 static
11789 extern
11790 mutable
11792 GNU Extension:
11793 thread */
11796 {
11797 /* Consume the token. */
11800 /* Complain about `auto' as a storage specifier, if
11801 we're complaining about C++0x compatibility. */
11805 /* Set the storage class anyway. */
11807 token);
11808 }
11809 else
11810 /* C++0x auto type-specifier. */
11818 /* Consume the token. */
11821 token);
11824 /* Consume the token. */
11830 /* We did not yet find a decl-specifier yet. */
11833 }
11843 /* Constructors are a special case. The `S' in `S()' is not a
11844 decl-specifier; it is the beginning of the declarator. */
11845 constructor_p
11846 = (!found_decl_spec
11847 && constructor_possible_p
11848 && (cp_parser_constructor_declarator_p
11851 /* If we don't have a DECL_SPEC yet, then we must be looking at
11852 a type-specifier. */
11854 {
11857 tree type_spec;
11859 type_spec
11861 decl_specs,
11867 /* If this type-specifier referenced a user-defined type
11868 (a typedef, class-name, etc.), then we can't allow any
11869 more such type-specifiers henceforth.
11871 [dcl.spec]
11873 The longest sequence of decl-specifiers that could
11874 possibly be a type name is taken as the
11875 decl-specifier-seq of a declaration. The sequence shall
11876 be self-consistent as described below.
11878 [dcl.type]
11880 As a general rule, at most one type-specifier is allowed
11881 in the complete decl-specifier-seq of a declaration. The
11882 only exceptions are the following:
11884 -- const or volatile can be combined with any other
11885 type-specifier.
11887 -- signed or unsigned can be combined with char, long,
11888 short, or int.
11890 -- ..
11892 Example:
11894 typedef char* Pc;
11895 void g (const int Pc);
11897 Here, Pc is *not* part of the decl-specifier seq; it's
11898 the declarator. Therefore, once we see a type-specifier
11899 (other than a cv-qualifier), we forbid any additional
11900 user-defined types. We *do* still allow things like `int
11901 int' to be considered a decl-specifier-seq, and issue the
11902 error message later. */
11905 /* A constructor declarator cannot follow a type-specifier. */
11907 {
11912 }
11913 }
11915 /* If we still do not have a DECL_SPEC, then there are no more
11916 decl-specifiers. */
11921 /* After we see one decl-specifier, further decl-specifiers are
11922 always optional. */
11924 }
11926 /* Don't allow a friend specifier with a class definition. */
11931 }
11933 /* Parse an (optional) storage-class-specifier.
11935 storage-class-specifier:
11936 auto
11937 register
11938 static
11939 extern
11940 mutable
11942 GNU Extension:
11944 storage-class-specifier:
11945 thread
11947 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11949 static tree
11951 {
11953 {
11957 /* Fall through for C++98. */
11964 /* Consume the token. */
11969 }
11970 }
11972 /* Parse an (optional) function-specifier.
11974 function-specifier:
11975 inline
11976 virtual
11977 explicit
11979 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11980 Updates DECL_SPECS, if it is non-NULL. */
11982 static tree
11985 {
11988 {
11994 /* 14.5.2.3 [temp.mem]
11996 A member function template shall not be virtual. */
11999 else
12009 }
12011 /* Consume the token. */
12013 }
12015 /* Parse a linkage-specification.
12017 linkage-specification:
12018 extern string-literal { declaration-seq [opt] }
12019 extern string-literal declaration */
12021 static void
12023 {
12024 tree linkage;
12026 /* Look for the `extern' keyword. */
12029 /* Look for the string-literal. */
12032 /* Transform the literal into an identifier. If the literal is a
12033 wide-character string, or contains embedded NULs, then we can't
12034 handle it as the user wants. */
12037 {
12039 /* Assume C++ linkage. */
12041 }
12042 else
12045 /* We're now using the new linkage. */
12048 /* If the next token is a `{', then we're using the first
12049 production. */
12051 {
12054 /* Consume the `{' token. */
12056 /* Parse the declarations. */
12058 /* Look for the closing `}'. */
12060 }
12061 /* Otherwise, there's just one declaration. */
12062 else
12063 {
12066 saved_in_unbraced_linkage_specification_p
12070 parser->in_unbraced_linkage_specification_p
12072 }
12074 /* We're done with the linkage-specification. */
12076 }
12078 /* Parse a static_assert-declaration.
12080 static_assert-declaration:
12081 static_assert ( constant-expression , string-literal ) ;
12083 If MEMBER_P, this static_assert is a class member. */
12085 static void
12087 {
12088 tree condition;
12089 tree message;
12091 location_t saved_loc;
12094 /* Peek at the `static_assert' token so we can keep track of exactly
12095 where the static assertion started. */
12099 /* Look for the `static_assert' keyword. */
12101 RT_STATIC_ASSERT))
12104 /* We know we are in a static assertion; commit to any tentative
12105 parse. */
12109 /* Parse the `(' starting the static assertion condition. */
12112 /* Parse the constant-expression. Allow a non-constant expression
12113 here in order to give better diagnostics in finish_static_assert. */
12114 condition =
12119 /* Parse the separating `,'. */
12122 /* Parse the string-literal message. */
12127 /* A `)' completes the static assertion. */
12134 /* A semicolon terminates the declaration. */
12137 /* Complete the static assertion, which may mean either processing
12138 the static assert now or saving it for template instantiation. */
12140 }
12142 /* Parse the expression in decltype ( expression ). */
12144 static tree
12147 {
12149 tree expr;
12151 /* First, try parsing an id-expression. */
12162 {
12165 cp_id_kind idk;
12169 /* Lookup the name we got back from the id-expression. */
12180 {
12181 /* Complete lookup of the id-expression. */
12182 expr = (finish_id_expression
12195 /* We found an id-expression, but it was something that we
12196 should not have found. This is an error, not something
12197 we can recover from, so note that we found an
12198 id-expression and we'll recover as gracefully as
12199 possible. */
12201 }
12206 /* We have an id-expression. */
12208 }
12211 {
12212 /* Abort the id-expression parse. */
12215 /* Parsing tentatively, again. */
12218 /* Parse a class member access. */
12226 /* We have an id-expression. */
12228 }
12231 /* We have parsed the complete id-expression or member access. */
12233 else
12234 {
12235 /* Abort our attempt to parse an id-expression or member access
12236 expression. */
12239 /* Parse a full expression. */
12242 }
12245 }
12247 /* Parse a `decltype' type. Returns the type.
12249 simple-type-specifier:
12250 decltype ( expression )
12251 C++14 proposal:
12252 decltype ( auto ) */
12254 static tree
12256 {
12257 tree expr;
12266 {
12267 /* Already parsed. */
12270 }
12272 /* Look for the `decltype' token. */
12276 /* Parse the opening `('. */
12280 /* decltype (auto) */
12283 {
12290 }
12292 /* Types cannot be defined in a `decltype' expression. Save away the
12293 old message. */
12296 /* And create the new one. */
12297 parser->type_definition_forbidden_message
12300 /* The restrictions on constant-expressions do not apply inside
12301 decltype expressions. */
12302 saved_integral_constant_expression_p
12304 saved_non_integral_constant_expression_p
12308 /* Within a parenthesized expression, a `>' token is always
12309 the greater-than operator. */
12310 saved_greater_than_is_operator_p
12314 /* Do not actually evaluate the expression. */
12317 /* Do not warn about problems with the expression. */
12322 /* Go back to evaluating expressions. */
12326 /* The `>' token might be the end of a template-id or
12327 template-parameter-list now. */
12328 parser->greater_than_is_operator_p
12331 /* Restore the old message and the integral constant expression
12332 flags. */
12334 parser->integral_constant_expression_p
12336 parser->non_integral_constant_expression_p
12339 /* Parse to the closing `)'. */
12341 {
12345 }
12348 tf_warning_or_error);
12350 rewrite:
12351 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12352 it again. */
12359 }
12361 /* Special member functions [gram.special] */
12363 /* Parse a conversion-function-id.
12365 conversion-function-id:
12366 operator conversion-type-id
12368 Returns an IDENTIFIER_NODE representing the operator. */
12370 static tree
12372 {
12373 tree type;
12374 tree saved_scope;
12375 tree saved_qualifying_scope;
12376 tree saved_object_scope;
12379 /* Look for the `operator' token. */
12382 /* When we parse the conversion-type-id, the current scope will be
12383 reset. However, we need that information in able to look up the
12384 conversion function later, so we save it here. */
12388 /* We must enter the scope of the class so that the names of
12389 entities declared within the class are available in the
12390 conversion-type-id. For example, consider:
12392 struct S {
12393 typedef int I;
12394 operator I();
12395 };
12397 S::operator I() { ... }
12399 In order to see that `I' is a type-name in the definition, we
12400 must be in the scope of `S'. */
12403 /* Parse the conversion-type-id. */
12405 /* Leave the scope of the class, if any. */
12408 /* Restore the saved scope. */
12412 /* If the TYPE is invalid, indicate failure. */
12416 }
12418 /* Parse a conversion-type-id:
12420 conversion-type-id:
12421 type-specifier-seq conversion-declarator [opt]
12423 Returns the TYPE specified. */
12425 static tree
12427 {
12428 tree attributes;
12429 cp_decl_specifier_seq type_specifiers;
12431 tree type_specified;
12434 /* Parse the attributes. */
12438 parser->type_definition_forbidden_message
12441 /* Parse the type-specifiers. */
12448 /* If that didn't work, stop. */
12451 /* Parse the conversion-declarator. */
12459 /* Don't give this error when parsing tentatively. This happens to
12460 work because we always parse this definitively once. */
12463 {
12465 {
12468 }
12472 }
12475 }
12477 /* Parse an (optional) conversion-declarator.
12479 conversion-declarator:
12480 ptr-operator conversion-declarator [opt]
12482 */
12486 {
12489 cp_cv_quals cv_quals;
12491 /* We don't know if there's a ptr-operator next, or not. */
12493 /* Try the ptr-operator. */
12496 /* If it worked, look for more conversion-declarators. */
12498 {
12501 /* Parse another optional declarator. */
12504 declarator = cp_parser_make_indirect_declarator
12508 }
12511 }
12513 /* Parse an (optional) ctor-initializer.
12515 ctor-initializer:
12516 : mem-initializer-list
12518 Returns TRUE iff the ctor-initializer was actually present. */
12520 static bool
12522 {
12523 /* If the next token is not a `:', then there is no
12524 ctor-initializer. */
12526 {
12527 /* Do default initialization of any bases and members. */
12532 }
12534 /* Consume the `:' token. */
12536 /* And the mem-initializer-list. */
12540 }
12542 /* Parse a mem-initializer-list.
12544 mem-initializer-list:
12545 mem-initializer ... [opt]
12546 mem-initializer ... [opt] , mem-initializer-list */
12548 static void
12550 {
12555 /* Let the semantic analysis code know that we are starting the
12556 mem-initializer-list. */
12561 /* Loop through the list. */
12563 {
12564 tree mem_initializer;
12567 /* Parse the mem-initializer. */
12569 /* If the next token is a `...', we're expanding member initializers. */
12571 {
12572 /* Consume the `...'. */
12575 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12576 can be expanded but members cannot. */
12579 {
12584 }
12586 /* Construct the pack expansion type. */
12589 }
12592 {
12596 }
12597 /* Look for a target constructor. */
12601 {
12604 {
12608 }
12610 }
12611 /* Add it to the list, unless it was erroneous. */
12613 {
12616 }
12617 /* If the next token is not a `,', we're done. */
12620 /* Consume the `,' token. */
12622 }
12624 /* Perform semantic analysis. */
12627 }
12629 /* Parse a mem-initializer.
12631 mem-initializer:
12632 mem-initializer-id ( expression-list [opt] )
12633 mem-initializer-id braced-init-list
12635 GNU extension:
12637 mem-initializer:
12638 ( expression-list [opt] )
12640 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12641 class) or FIELD_DECL (for a non-static data member) to initialize;
12642 the TREE_VALUE is the expression-list. An empty initialization
12643 list is represented by void_list_node. */
12645 static tree
12647 {
12648 tree mem_initializer_id;
12649 tree expression_list;
12650 tree member;
12653 /* Find out what is being initialized. */
12655 {
12659 }
12660 else
12661 {
12665 }
12671 {
12678 }
12679 else
12680 {
12690 }
12700 }
12702 /* Parse a mem-initializer-id.
12704 mem-initializer-id:
12705 :: [opt] nested-name-specifier [opt] class-name
12706 identifier
12708 Returns a TYPE indicating the class to be initializer for the first
12709 production. Returns an IDENTIFIER_NODE indicating the data member
12710 to be initialized for the second production. */
12712 static tree
12714 {
12718 tree id;
12722 /* `typename' is not allowed in this context ([temp.res]). */
12724 {
12726 "keyword %<typename%> not allowed in this context (a qualified "
12729 }
12730 /* Look for the optional `::' operator. */
12731 global_scope_p
12735 /* Look for the optional nested-name-specifier. The simplest way to
12736 implement:
12738 [temp.res]
12740 The keyword `typename' is not permitted in a base-specifier or
12741 mem-initializer; in these contexts a qualified name that
12742 depends on a template-parameter is implicitly assumed to be a
12743 type name.
12745 is to assume that we have seen the `typename' keyword at this
12746 point. */
12747 nested_name_specifier_p
12756 /* If there is a `::' operator or a nested-name-specifier, then we
12757 are definitely looking for a class-name. */
12762 typename_type,
12766 /* Otherwise, we could also be looking for an ordinary identifier. */
12768 /* Try a class-name. */
12772 none_type,
12776 /* If we found one, we're done. */
12779 /* Otherwise, look for an ordinary identifier. */
12781 }
12783 /* Overloading [gram.over] */
12785 /* Parse an operator-function-id.
12787 operator-function-id:
12788 operator operator
12790 Returns an IDENTIFIER_NODE for the operator which is a
12791 human-readable spelling of the identifier, e.g., `operator +'. */
12793 static tree
12795 {
12796 /* Look for the `operator' keyword. */
12799 /* And then the name of the operator itself. */
12801 }
12803 /* Return an identifier node for a user-defined literal operator.
12804 The suffix identifier is chained to the operator name identifier. */
12806 static tree
12808 {
12809 tree identifier;
12816 }
12818 /* Parse an operator.
12820 operator:
12821 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12822 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12823 || ++ -- , ->* -> () []
12825 GNU Extensions:
12827 operator:
12828 <? >? <?= >?=
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 {
12840 /* Peek at the next token. */
12842 /* Figure out which operator we have. */
12844 {
12846 {
12849 /* The keyword should be either `new' or `delete'. */
12854 else
12857 /* Consume the `new' or `delete' token. */
12860 /* Peek at the next token. */
12862 /* If it's a `[' token then this is the array variant of the
12863 operator. */
12865 {
12866 /* Consume the `[' token. */
12868 /* Look for the `]' token. */
12872 }
12873 /* Otherwise, we have the non-array variant. */
12874 else
12878 }
13025 /* Consume the `('. */
13027 /* Look for the matching `)'. */
13032 /* Consume the `['. */
13034 /* Look for the matching `]'. */
13049 {
13056 /* Consume the string. */
13062 {
13065 }
13066 else
13067 {
13069 /* Look for the suffix identifier. */
13074 {
13078 }
13079 else
13080 {
13083 }
13084 }
13089 {
13092 }
13095 {
13098 }
13100 {
13103 }
13105 }
13108 /* Anything else is an error. */
13110 }
13112 /* If we have selected an identifier, we need to consume the
13113 operator token. */
13116 /* Otherwise, no valid operator name was present. */
13117 else
13118 {
13121 }
13124 }
13126 /* Parse a template-declaration.
13128 template-declaration:
13129 export [opt] template < template-parameter-list > declaration
13131 If MEMBER_P is TRUE, this template-declaration occurs within a
13132 class-specifier.
13134 The grammar rule given by the standard isn't correct. What
13135 is really meant is:
13137 template-declaration:
13138 export [opt] template-parameter-list-seq
13139 decl-specifier-seq [opt] init-declarator [opt] ;
13140 export [opt] template-parameter-list-seq
13141 function-definition
13143 template-parameter-list-seq:
13144 template-parameter-list-seq [opt]
13145 template < template-parameter-list > */
13147 static void
13149 {
13150 /* Check for `export'. */
13152 {
13153 /* Consume the `export' token. */
13155 /* Warn that we do not support `export'. */
13157 }
13160 }
13162 /* Parse a template-parameter-list.
13164 template-parameter-list:
13165 template-parameter
13166 template-parameter-list , template-parameter
13168 Returns a TREE_LIST. Each node represents a template parameter.
13169 The nodes are connected via their TREE_CHAINs. */
13171 static tree
13173 {
13178 /* The loop below parses the template parms. We first need to know
13179 the total number of template parms to be able to compute proper
13180 canonical types of each dependent type. So after the loop, when
13181 we know the total number of template parms,
13182 end_template_parm_list computes the proper canonical types and
13183 fixes up the dependent types accordingly. */
13185 {
13186 tree parameter;
13189 location_t parm_loc;
13191 /* Parse the template-parameter. */
13196 /* Add it to the list. */
13199 parm_loc,
13200 parameter,
13201 is_non_type,
13202 is_parameter_pack);
13203 else
13204 {
13207 }
13209 /* If the next token is not a `,', we're done. */
13212 /* Otherwise, consume the `,' token. */
13214 }
13217 }
13219 /* Parse a template-parameter.
13221 template-parameter:
13222 type-parameter
13223 parameter-declaration
13225 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13226 the parameter. The TREE_PURPOSE is the default value, if any.
13227 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13228 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13229 set to true iff this parameter is a parameter pack. */
13231 static tree
13234 {
13238 tree parm;
13240 /* Assume it is a type parameter or a template parameter. */
13242 /* Assume it not a parameter pack. */
13244 /* Peek at the next token. */
13246 /* If it is `class' or `template', we have a type-parameter. */
13249 /* If it is `class' or `typename' we do not know yet whether it is a
13250 type parameter or a non-type parameter. Consider:
13252 template <typename T, typename T::X X> ...
13254 or:
13256 template <class C, class D*> ...
13258 Here, the first parameter is a type parameter, and the second is
13259 a non-type parameter. We can tell by looking at the token after
13260 the identifier -- if it is a `,', `=', or `>' then we have a type
13261 parameter. */
13263 {
13264 /* Peek at the token after `class' or `typename'. */
13266 /* If it's an ellipsis, we have a template type parameter
13267 pack. */
13270 /* If it's an identifier, skip it. */
13273 /* Now, see if the token looks like the end of a template
13274 parameter. */
13279 }
13281 /* Otherwise, it is a non-type parameter.
13283 [temp.param]
13285 When parsing a default template-argument for a non-type
13286 template-parameter, the first non-nested `>' is taken as the end
13287 of the template parameter-list rather than a greater-than
13288 operator. */
13290 parameter_declarator
13297 /* If the parameter declaration is marked as a parameter pack, set
13298 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13299 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13300 grokdeclarator. */
13303 {
13306 }
13309 {
13310 /* Can happen in some cases of erroneous input (c++/34892). */
13312 /* Consume the `...' for better error recovery. */
13314 }
13315 /* If the next token is an ellipsis, and we don't already have it
13316 marked as a parameter pack, then we have a parameter pack (that
13317 has no declarator). */
13320 && (declarator_can_be_parameter_pack
13322 {
13323 /* Consume the `...'. */
13328 }
13329 /* We might end up with a pack expansion as the type of the non-type
13330 template parameter, in which case this is a non-type template
13331 parameter pack. */
13334 {
13338 }
13341 {
13342 /* Parameter packs cannot have default arguments. However, a
13343 user may try to do so, so we'll parse them and give an
13344 appropriate diagnostic here. */
13348 /* Find the name of the parameter pack. */
13357 else
13361 /* Parse the default argument, but throw away the result. */
13363 }
13373 }
13375 /* Parse a type-parameter.
13377 type-parameter:
13378 class identifier [opt]
13379 class identifier [opt] = type-id
13380 typename identifier [opt]
13381 typename identifier [opt] = type-id
13382 template < template-parameter-list > class identifier [opt]
13383 template < template-parameter-list > class identifier [opt]
13384 = id-expression
13386 GNU Extension (variadic templates):
13388 type-parameter:
13389 class ... identifier [opt]
13390 typename ... identifier [opt]
13392 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13393 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13394 the declaration of the parameter.
13396 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13398 static tree
13400 {
13402 tree parameter;
13404 /* Look for a keyword to tell us what kind of parameter this is. */
13410 {
13413 {
13414 tree identifier;
13415 tree default_argument;
13417 /* If the next token is an ellipsis, we have a template
13418 argument pack. */
13420 {
13421 /* Consume the `...' token. */
13426 }
13428 /* If the next token is an identifier, then it names the
13429 parameter. */
13432 else
13435 /* Create the parameter. */
13438 /* If the next token is an `=', we have a default argument. */
13440 {
13441 /* Consume the `=' token. */
13443 /* Parse the default-argument. */
13447 /* Template parameter packs cannot have default
13448 arguments. */
13450 {
13453 "template parameter pack %qD cannot have a "
13455 else
13457 "template parameter packs cannot have "
13460 }
13462 }
13463 else
13466 /* Create the combined representation of the parameter and the
13467 default argument. */
13469 }
13473 {
13474 tree identifier;
13475 tree default_argument;
13477 /* Look for the `<'. */
13479 /* Parse the template-parameter-list. */
13481 /* Look for the `>'. */
13483 /* Look for the `class' or 'typename' keywords. */
13485 /* If the next token is an ellipsis, we have a template
13486 argument pack. */
13488 {
13489 /* Consume the `...' token. */
13494 }
13495 /* If the next token is an `=', then there is a
13496 default-argument. If the next token is a `>', we are at
13497 the end of the parameter-list. If the next token is a `,',
13498 then we are at the end of this parameter. */
13502 {
13504 /* Treat invalid names as if the parameter were nameless. */
13507 }
13508 else
13511 /* Create the template parameter. */
13513 identifier);
13515 /* If the next token is an `=', then there is a
13516 default-argument. */
13518 {
13521 /* Consume the `='. */
13523 /* Parse the id-expression. */
13525 /* save token before parsing the id-expression, for error
13526 reporting */
13528 default_argument
13536 /* If the id-expression was a template-id that refers to
13537 a template-class, we already have the declaration here,
13538 so no further lookup is needed. */
13539 ;
13540 else
13541 /* Look up the name. */
13542 default_argument
13544 none_type,
13550 /* See if the default argument is valid. */
13551 default_argument
13554 /* Template parameter packs cannot have default
13555 arguments. */
13557 {
13560 "template parameter pack %qD cannot "
13562 identifier);
13563 else
13567 }
13569 }
13570 else
13573 /* Create the combined representation of the parameter and the
13574 default argument. */
13576 }
13582 }
13585 }
13587 /* Parse a template-id.
13589 template-id:
13590 template-name < template-argument-list [opt] >
13592 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13593 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13594 returned. Otherwise, if the template-name names a function, or set
13595 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13596 names a class, returns a TYPE_DECL for the specialization.
13598 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13599 uninstantiated templates. */
13601 static tree
13607 {
13609 tree templ;
13610 tree arguments;
13611 tree template_id;
13618 /* If the next token corresponds to a template-id, there is no need
13619 to reparse it. */
13622 {
13625 /* Get the stored value. */
13627 /* Perform any access checks that were deferred. */
13630 {
13635 tf_warning_or_error);
13636 }
13637 /* Return the stored value. */
13639 }
13641 /* Avoid performing name lookup if there is no possibility of
13642 finding a template-id. */
13645 && !cp_parser_nth_token_starts_template_argument_list_p
13647 {
13650 }
13652 /* Remember where the template-id starts. */
13658 /* Parse the template-name. */
13661 check_dependency_p,
13662 is_declaration,
13663 tag_type,
13666 {
13669 }
13671 /* If we find the sequence `[:' after a template-name, it's probably
13672 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13673 parse correctly the argument list. */
13680 {
13682 /* Change `:' into `::'. */
13684 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13685 CPP_LESS. */
13688 /* Parse the arguments. */
13691 {
13692 /* If we couldn't parse an argument list, then we revert our changes
13693 and return simply an error. Maybe this is not a template-id
13694 after all. */
13699 }
13700 /* Otherwise, emit an error about the invalid digraph, but continue
13701 parsing because we got our argument list. */
13704 {
13707 "%<<:%> is an alternate spelling for %<[%>."
13710 {
13712 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13715 }
13716 }
13717 }
13718 else
13719 {
13720 /* Look for the `<' that starts the template-argument-list. */
13722 {
13725 }
13726 /* Parse the arguments. */
13728 }
13730 /* Build a representation of the specialization. */
13733 TEMPLATE_ID_EXPR,
13737 {
13739 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13740 template (rather than some instantiation thereof) only if
13741 is not nested within some other construct. For example, in
13742 "template <typename T> void f(T) { A<T>::", A<T> is just an
13743 instantiation of A. */
13746 CPP_SCOPE));
13747 template_id
13749 }
13751 {
13753 }
13754 else
13755 {
13756 /* If it's not a class-template or a template-template, it should be
13757 a function-template. */
13763 }
13765 /* If parsing tentatively, replace the sequence of tokens that makes
13766 up the template-id with a CPP_TEMPLATE_ID token. That way,
13767 should we re-parse the token stream, we will not have to repeat
13768 the effort required to do the parse, nor will we issue duplicate
13769 error messages about problems during instantiation of the
13770 template. */
13772 /* Don't do this if we had a parse error in a declarator; re-parsing
13773 might succeed if a name changes meaning (60361). */
13777 {
13780 /* Reset the contents of the START_OF_ID token. */
13782 /* Retrieve any deferred checks. Do not pop this access checks yet
13783 so the memory will not be reclaimed during token replacing below. */
13789 /* Purge all subsequent tokens. */
13792 /* ??? Can we actually assume that, if template_id ==
13793 error_mark_node, we will have issued a diagnostic to the
13794 user, as opposed to simply marking the tentative parse as
13795 failed? */
13798 }
13802 }
13804 /* Parse a template-name.
13806 template-name:
13807 identifier
13809 The standard should actually say:
13811 template-name:
13812 identifier
13813 operator-function-id
13815 A defect report has been filed about this issue.
13817 A conversion-function-id cannot be a template name because they cannot
13818 be part of a template-id. In fact, looking at this code:
13820 a.operator K<int>()
13822 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13823 It is impossible to call a templated conversion-function-id with an
13824 explicit argument list, since the only allowed template parameter is
13825 the type to which it is converting.
13827 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13828 `template' keyword, in a construction like:
13830 T::template f<3>()
13832 In that case `f' is taken to be a template-name, even though there
13833 is no way of knowing for sure.
13835 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13836 name refers to a set of overloaded functions, at least one of which
13837 is a template, or an IDENTIFIER_NODE with the name of the template,
13838 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13839 names are looked up inside uninstantiated templates. */
13841 static tree
13848 {
13849 tree identifier;
13850 tree decl;
13851 tree fns;
13854 /* If the next token is `operator', then we have either an
13855 operator-function-id or a conversion-function-id. */
13857 {
13858 /* We don't know whether we're looking at an
13859 operator-function-id or a conversion-function-id. */
13861 /* Try an operator-function-id. */
13863 /* If that didn't work, try a conversion-function-id. */
13865 {
13868 }
13869 }
13870 /* Look for the identifier. */
13871 else
13874 /* If we didn't find an identifier, we don't have a template-id. */
13878 /* If the name immediately followed the `template' keyword, then it
13879 is a template-name. However, if the next token is not `<', then
13880 we do not treat it as a template-name, since it is not being used
13881 as part of a template-id. This enables us to handle constructs
13882 like:
13884 template <typename T> struct S { S(); };
13885 template <typename T> S<T>::S();
13887 correctly. We would treat `S' as a template -- if it were `S<T>'
13888 -- but we do not if there is no `<'. */
13892 {
13893 /* In a declaration, in a dependent context, we pretend that the
13894 "template" keyword was present in order to improve error
13895 recovery. For example, given:
13897 template <typename T> void f(T::X<int>);
13899 we want to treat "X<int>" as a template-id. */
13901 && !template_keyword_p
13903 && check_dependency_p
13905 /* Do not do this for dtors (or ctors), since they never
13906 need the template keyword before their name. */
13908 {
13911 /* Explain what went wrong. */
13913 identifier);
13916 /* If parsing tentatively, find the location of the "<" token. */
13919 /* Parse the template arguments so that we can issue error
13920 messages about them. */
13923 /* Skip tokens until we find a good place from which to
13924 continue parsing. */
13929 /* If parsing tentatively, permanently remove the
13930 template argument list. That will prevent duplicate
13931 error messages from being issued about the missing
13932 "template" keyword. */
13938 }
13940 /* If the "template" keyword is present, then there is generally
13941 no point in doing name-lookup, so we just return IDENTIFIER.
13942 But, if the qualifying scope is non-dependent then we can
13943 (and must) do name-lookup normally. */
13949 }
13951 /* Look up the name. */
13953 tag_type,
13956 check_dependency_p,
13960 /* If DECL is a template, then the name was a template-name. */
13962 {
13966 }
13967 else
13968 {
13971 /* The standard does not explicitly indicate whether a name that
13972 names a set of overloaded declarations, some of which are
13973 templates, is a template-name. However, such a name should
13974 be a template-name; otherwise, there is no way to form a
13975 template-id for the overloaded templates. */
13983 {
13984 /* The name does not name a template. */
13987 }
13988 }
13990 /* If DECL is dependent, and refers to a function, then just return
13991 its name; we will look it up again during template instantiation. */
13993 {
13997 }
14000 }
14002 /* Parse a template-argument-list.
14004 template-argument-list:
14005 template-argument ... [opt]
14006 template-argument-list , template-argument ... [opt]
14008 Returns a TREE_VEC containing the arguments. */
14010 static tree
14012 {
14017 tree vec;
14024 /* Even if the template-id appears in an integral
14025 constant-expression, the contents of the argument list do
14026 not. */
14032 /* Parse the arguments. */
14033 do
14034 {
14035 tree argument;
14038 /* Consume the comma. */
14041 /* Parse the template-argument. */
14044 /* If the next token is an ellipsis, we're expanding a template
14045 argument pack. */
14047 {
14049 {
14053 }
14054 /* Consume the `...' token. */
14057 /* Make the argument into a TYPE_PACK_EXPANSION or
14058 EXPR_PACK_EXPANSION. */
14060 }
14063 {
14067 {
14070 }
14071 else
14073 }
14075 }
14088 #ifdef ENABLE_CHECKING
14090 #endif
14092 }
14094 /* Parse a template-argument.
14096 template-argument:
14097 assignment-expression
14098 type-id
14099 id-expression
14101 The representation is that of an assignment-expression, type-id, or
14102 id-expression -- except that the qualified id-expression is
14103 evaluated, so that the value returned is either a DECL or an
14104 OVERLOAD.
14106 Although the standard says "assignment-expression", it forbids
14107 throw-expressions or assignments in the template argument.
14108 Therefore, we use "conditional-expression" instead. */
14110 static tree
14112 {
14113 tree argument;
14119 cp_id_kind idk;
14121 /* There's really no way to know what we're looking at, so we just
14122 try each alternative in order.
14124 [temp.arg]
14126 In a template-argument, an ambiguity between a type-id and an
14127 expression is resolved to a type-id, regardless of the form of
14128 the corresponding template-parameter.
14130 Therefore, we try a type-id first. */
14133 /* If there was no error parsing the type-id but the next token is a
14134 '>>', our behavior depends on which dialect of C++ we're
14135 parsing. In C++98, we probably found a typo for '> >'. But there
14136 are type-id which are also valid expressions. For instance:
14138 struct X { int operator >> (int); };
14139 template <int V> struct Foo {};
14140 Foo<X () >> 5> r;
14142 Here 'X()' is a valid type-id of a function type, but the user just
14143 wanted to write the expression "X() >> 5". Thus, we remember that we
14144 found a valid type-id, but we still try to parse the argument as an
14145 expression to see what happens.
14147 In C++0x, the '>>' will be considered two separate '>'
14148 tokens. */
14152 {
14155 }
14156 else
14157 {
14158 /* If the next token isn't a `,' or a `>', then this argument wasn't
14159 really finished. This means that the argument is not a valid
14160 type-id. */
14163 /* If that worked, we're done. */
14166 }
14167 /* We're still not sure what the argument will be. */
14169 /* Try a template. */
14177 /* If the next token isn't a `,' or a `>', then this argument wasn't
14178 really finished. */
14182 {
14183 /* Figure out what is being referred to. If the id-expression
14184 was for a class template specialization, then we will have a
14185 TYPE_DECL at this point. There is no need to do name lookup
14186 at this point in that case. */
14189 none_type,
14198 }
14200 {
14204 }
14205 /* It must be a non-type argument. There permitted cases are given
14206 in [temp.arg.nontype]:
14208 -- an integral constant-expression of integral or enumeration
14209 type; or
14211 -- the name of a non-type template-parameter; or
14213 -- the name of an object or function with external linkage...
14215 -- the address of an object or function with external linkage...
14217 -- a pointer to member... */
14218 /* Look for a non-type template parameter. */
14220 {
14232 }
14234 /* If the next token is "&", the argument must be the address of an
14235 object or function with external linkage. */
14238 {
14241 }
14242 /* See if we might have an id-expression. */
14249 {
14252 address_p,
14259 else
14260 {
14261 tree probe;
14264 {
14265 /* Strip the dereference temporarily. */
14268 }
14270 /* If we're in a template, we represent a qualified-id referring
14271 to a static data member as a SCOPE_REF even if the scope isn't
14272 dependent so that we can check access control later. */
14277 {
14278 /* A variable without external linkage might still be a
14279 valid constant-expression, so no error is issued here
14280 if the external-linkage check fails. */
14283 }
14285 /* All overloaded functions are allowed; if the external
14286 linkage test does not pass, an error will be issued
14287 later. */
14288 ;
14292 /* A pointer-to-member. */
14293 ;
14295 ;
14296 else
14300 {
14303 tf_warning_or_error);
14304 else
14307 }
14308 }
14309 }
14310 /* If the argument started with "&", there are no other valid
14311 alternatives at this point. */
14313 {
14316 }
14318 /* If the argument wasn't successfully parsed as a type-id followed
14319 by '>>', the argument can only be a constant expression now.
14320 Otherwise, we try parsing the constant-expression tentatively,
14321 because the argument could really be a type-id. */
14332 /* We did our best to parse the argument as a non type-id, but that
14333 was the only alternative that matched (albeit with a '>' after
14334 it). We can assume it's just a typo from the user, and a
14335 diagnostic will then be issued. */
14337 }
14339 /* Parse an explicit-instantiation.
14341 explicit-instantiation:
14342 template declaration
14344 Although the standard says `declaration', what it really means is:
14346 explicit-instantiation:
14347 template decl-specifier-seq [opt] declarator [opt] ;
14349 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14350 supposed to be allowed. A defect report has been filed about this
14351 issue.
14353 GNU Extension:
14355 explicit-instantiation:
14356 storage-class-specifier template
14357 decl-specifier-seq [opt] declarator [opt] ;
14358 function-specifier template
14359 decl-specifier-seq [opt] declarator [opt] ; */
14361 static void
14363 {
14365 cp_decl_specifier_seq decl_specifiers;
14370 /* Look for an (optional) storage-class-specifier or
14371 function-specifier. */
14373 {
14374 extension_specifier
14377 extension_specifier
14380 }
14382 /* Look for the `template' keyword. */
14384 /* Let the front end know that we are processing an explicit
14385 instantiation. */
14387 /* [temp.explicit] says that we are supposed to ignore access
14388 control while processing explicit instantiation directives. */
14390 /* Parse a decl-specifier-seq. */
14392 CP_PARSER_FLAGS_OPTIONAL,
14395 /* If there was exactly one decl-specifier, and it declared a class,
14396 and there's no declarator, then we have an explicit type
14397 instantiation. */
14399 {
14400 tree type;
14404 /* Turn access control back on for names used during
14405 template instantiation. */
14410 }
14411 else
14412 {
14414 tree decl;
14416 /* Parse the declarator. */
14417 declarator
14428 {
14431 "explicit instantiation shall not use"
14435 "explicit instantiation shall not use"
14440 /* Turn access control back on for names used during
14441 template instantiation. */
14443 /* Do the explicit instantiation. */
14445 }
14446 else
14447 {
14449 /* Skip the body of the explicit instantiation. */
14451 }
14452 }
14453 /* We're done with the instantiation. */
14459 }
14461 /* Parse an explicit-specialization.
14463 explicit-specialization:
14464 template < > declaration
14466 Although the standard says `declaration', what it really means is:
14468 explicit-specialization:
14469 template <> decl-specifier [opt] init-declarator [opt] ;
14470 template <> function-definition
14471 template <> explicit-specialization
14472 template <> template-declaration */
14474 static void
14476 {
14480 /* Look for the `template' keyword. */
14482 /* Look for the `<'. */
14484 /* Look for the `>'. */
14486 /* We have processed another parameter list. */
14488 /* [temp]
14490 A template ... explicit specialization ... shall not have C
14491 linkage. */
14493 {
14495 /* Give it C++ linkage to avoid confusing other parts of the
14496 front end. */
14499 }
14500 else
14502 /* Let the front end know that we are beginning a specialization. */
14504 {
14507 }
14509 /* If the next keyword is `template', we need to figure out whether
14510 or not we're looking a template-declaration. */
14512 {
14517 else
14519 }
14520 else
14521 /* Parse the dependent declaration. */
14527 /* We're done with the specialization. */
14529 /* For the erroneous case of a template with C linkage, we pushed an
14530 implicit C++ linkage scope; exit that scope now. */
14533 /* We're done with this parameter list. */
14535 }
14537 /* Parse a type-specifier.
14539 type-specifier:
14540 simple-type-specifier
14541 class-specifier
14542 enum-specifier
14543 elaborated-type-specifier
14544 cv-qualifier
14546 GNU Extension:
14548 type-specifier:
14549 __complex__
14551 Returns a representation of the type-specifier. For a
14552 class-specifier, enum-specifier, or elaborated-type-specifier, a
14553 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14555 The parser flags FLAGS is used to control type-specifier parsing.
14557 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14558 in a decl-specifier-seq.
14560 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14561 class-specifier, enum-specifier, or elaborated-type-specifier, then
14562 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14563 if a type is declared; 2 if it is defined. Otherwise, it is set to
14564 zero.
14566 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14567 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14568 is set to FALSE. */
14570 static tree
14572 cp_parser_flags flags,
14577 {
14583 /* Assume this type-specifier does not declare a new type. */
14586 /* And that it does not specify a cv-qualifier. */
14589 /* Peek at the next token. */
14592 /* If we're looking at a keyword, we can use that to guide the
14593 production we choose. */
14596 {
14601 /* Look for the enum-specifier. */
14603 /* If that worked, we're done. */
14605 {
14610 type_spec,
14611 token,
14614 }
14615 else
14618 /* Any of these indicate either a class-specifier, or an
14619 elaborated-type-specifier. */
14626 /* Parse tentatively so that we can back up if we don't find a
14627 class-specifier. */
14629 /* Look for the class-specifier. */
14632 /* If that worked, we're done. */
14634 {
14639 type_spec,
14640 token,
14643 }
14645 /* Fall through. */
14646 elaborated_type_specifier:
14647 /* We're declaring (not defining) a class or enum. */
14651 /* Fall through. */
14653 /* Look for an elaborated-type-specifier. */
14654 type_spec
14655 = (cp_parser_elaborated_type_specifier
14658 is_declaration));
14661 type_spec,
14662 token,
14685 /* The `__complex__' keyword is a GNU extension. */
14691 }
14693 /* Handle simple keywords. */
14695 {
14697 {
14700 }
14702 }
14704 /* If we do not already have a type-specifier, assume we are looking
14705 at a simple-type-specifier. */
14707 decl_specs,
14708 flags);
14710 /* If we didn't find a type-specifier, and a type-specifier was not
14711 optional in this context, issue an error message. */
14713 {
14716 }
14719 }
14721 /* Parse a simple-type-specifier.
14723 simple-type-specifier:
14724 :: [opt] nested-name-specifier [opt] type-name
14725 :: [opt] nested-name-specifier template template-id
14726 char
14727 wchar_t
14728 bool
14729 short
14730 int
14731 long
14732 signed
14733 unsigned
14734 float
14735 double
14736 void
14738 C++0x Extension:
14740 simple-type-specifier:
14741 auto
14742 decltype ( expression )
14743 char16_t
14744 char32_t
14745 __underlying_type ( type-id )
14747 GNU Extension:
14749 simple-type-specifier:
14750 __int128
14751 __typeof__ unary-expression
14752 __typeof__ ( type-id )
14753 __typeof__ ( type-id ) { initializer-list , [opt] }
14755 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14756 appropriately updated. */
14758 static tree
14761 cp_parser_flags flags)
14762 {
14767 /* Peek at the next token. */
14770 /* If we're looking at a keyword, things are easy. */
14772 {
14807 {
14810 }
14839 {
14843 {
14846 "use of %<auto%> in lambda parameter declaration "
14847 "only available with "
14849 }
14852 "use of %<auto%> in parameter declaration "
14853 "only available with "
14855 else
14857 "ISO C++ forbids use of %<auto%> in parameter "
14859 }
14860 else
14865 /* Since DR 743, decltype can either be a simple-type-specifier by
14866 itself or begin a nested-name-specifier. Parsing it will replace
14867 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14868 handling below decide what to do. */
14874 /* Consume the `typeof' token. */
14876 /* Parse the operand to `typeof'. */
14878 /* If it is not already a TYPE, take its type. */
14884 token,
14893 token,
14903 token,
14908 }
14910 /* If token is an already-parsed decltype not followed by ::,
14911 it's a simple-type-specifier. */
14914 {
14917 {
14919 token,
14921 /* Remember that we are handling a decltype in order to
14922 implement the resolution of DR 1510 when the argument
14923 isn't instantiation dependent. */
14925 }
14928 }
14930 /* If the type-specifier was for a built-in type, we're done. */
14932 {
14933 /* Record the type. */
14940 type,
14941 token,
14946 /* Consume the token. */
14949 /* There is no valid C++ program where a non-template type is
14950 followed by a "<". That usually indicates that the user thought
14951 that the type was a template. */
14956 }
14958 /* The type-specifier must be a user-defined type. */
14960 {
14964 /* Don't gobble tokens or issue error messages if this is an
14965 optional type-specifier. */
14969 /* Look for the optional `::' operator. */
14970 global_p
14974 /* Look for the nested-name specifier. */
14975 qualified_p
14983 /* If we have seen a nested-name-specifier, and the next token
14984 is `template', then we are using the template-id production. */
14987 {
14988 /* Look for the template-id. */
14992 none_type,
14994 /* If the template-id did not name a type, we are out of
14995 luck. */
14997 {
15000 }
15001 }
15002 /* Otherwise, look for a type-name. */
15003 else
15005 /* Keep track of all name-lookups performed in class scopes. */
15007 && !global_p
15008 && !qualified_p
15012 /* If it didn't work out, we don't have a TYPE. */
15018 token,
15020 }
15022 /* If we didn't get a type-name, issue an error message. */
15024 {
15027 }
15030 {
15031 /* See if TYPE is an Objective-C type, and if so, parse and
15032 accept any protocol references following it. Do this before
15033 the cp_parser_check_for_invalid_template_id() call, because
15034 Objective-C types can be followed by '<...>' which would
15035 enclose protocol names rather than template arguments, and so
15036 everything is fine. */
15039 {
15043 /* Clobber the "unqualified" type previously entered into
15044 DECL_SPECS with the new, improved protocol-qualified version. */
15049 }
15051 /* There is no valid C++ program where a non-template type is
15052 followed by a "<". That usually indicates that the user
15053 thought that the type was a template. */
15055 none_type,
15057 }
15060 }
15062 /* Parse a type-name.
15064 type-name:
15065 class-name
15066 enum-name
15067 typedef-name
15068 simple-template-id [in c++0x]
15070 enum-name:
15071 identifier
15073 typedef-name:
15074 identifier
15076 Returns a TYPE_DECL for the type. */
15078 static tree
15080 {
15081 tree type_decl;
15083 /* We can't know yet whether it is a class-name or not. */
15085 /* Try a class-name. */
15089 none_type,
15093 /* If it's not a class-name, keep looking. */
15095 {
15097 /* It must be a typedef-name or an enum-name. */
15101 /* It is either a simple-template-id representing an
15102 instantiation of an alias template... */
15106 none_type,
15108 /* Note that this must be an instantiation of an alias template
15109 because [temp.names]/6 says:
15111 A template-id that names an alias template specialization
15112 is a type-name.
15114 Whereas [temp.names]/7 says:
15116 A simple-template-id that names a class template
15117 specialization is a class-name. */
15122 else
15126 /* ... Or a typedef-name or an enum-name. */
15128 }
15131 }
15133 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15135 enum-name:
15136 identifier
15138 typedef-name:
15139 identifier
15141 Returns a TYPE_DECL for the type. */
15143 static tree
15145 {
15146 tree type_decl;
15147 tree identifier;
15154 /* Look up the type-name. */
15161 {
15162 /* See if this is an Objective-C type. */
15167 }
15169 /* Issue an error if we did not find a type-name. */
15171 /* In Objective-C, we have the complication that class names are
15172 normally type names and start declarations (eg, the
15173 "NSObject" in "NSObject *object;"), but can be used in an
15174 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15175 is an expression. So, a classname followed by a dot is not a
15176 valid type-name. */
15179 {
15184 }
15185 /* Remember that the name was used in the definition of the
15186 current class so that we can check later to see if the
15187 meaning would have been different after the class was
15188 entirely defined. */
15194 }
15196 /* Parse an elaborated-type-specifier. Note that the grammar given
15197 here incorporates the resolution to DR68.
15199 elaborated-type-specifier:
15200 class-key :: [opt] nested-name-specifier [opt] identifier
15201 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15202 enum-key :: [opt] nested-name-specifier [opt] identifier
15203 typename :: [opt] nested-name-specifier identifier
15204 typename :: [opt] nested-name-specifier template [opt]
15205 template-id
15207 GNU extension:
15209 elaborated-type-specifier:
15210 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15211 class-key attributes :: [opt] nested-name-specifier [opt]
15212 template [opt] template-id
15213 enum attributes :: [opt] nested-name-specifier [opt] identifier
15215 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15216 declared `friend'. If IS_DECLARATION is TRUE, then this
15217 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15218 something is being declared.
15220 Returns the TYPE specified. */
15222 static tree
15226 {
15228 tree identifier;
15231 tree globalscope;
15234 /* See if we're looking at the `enum' keyword. */
15236 {
15237 /* Consume the `enum' token. */
15239 /* Remember that it's an enumeration type. */
15241 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15242 enums) is used here. */
15245 {
15249 /* Consume the `struct' or `class' and parse it anyway. */
15251 }
15252 /* Parse the attributes. */
15254 }
15255 /* Or, it might be `typename'. */
15257 RID_TYPENAME))
15258 {
15259 /* Consume the `typename' token. */
15261 /* Remember that it's a `typename' type. */
15263 }
15264 /* Otherwise it must be a class-key. */
15265 else
15266 {
15270 /* Parse the attributes. */
15272 }
15274 /* Look for the `::' operator. */
15277 /* Look for the nested-name-specifier. */
15279 {
15284 is_declaration))
15286 }
15287 else
15288 /* Even though `typename' is not present, the proposed resolution
15289 to Core Issue 180 says that in `class A<T>::B', `B' should be
15290 considered a type-name, even if `A<T>' is dependent. */
15295 is_declaration);
15296 /* For everything but enumeration types, consider a template-id.
15297 For an enumeration type, consider only a plain identifier. */
15299 {
15301 tree decl;
15303 /* Allow the `template' keyword. */
15305 /* If we didn't see `template', we don't know if there's a
15306 template-id or not. */
15309 /* Parse the template-id. */
15313 tag_type,
15314 is_declaration);
15315 /* If we didn't find a template-id, look for an ordinary
15316 identifier. */
15318 ;
15319 /* We can get here when cp_parser_template_id, called by
15320 cp_parser_class_name with tag_type == none_type, succeeds
15321 and caches a BASELINK. Then, when called again here,
15322 instead of failing and returning an error_mark_node
15323 returns it (see template/typename17.C in C++11).
15324 ??? Could we diagnose this earlier? */
15326 {
15329 }
15330 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15331 in effect, then we must assume that, upon instantiation, the
15332 template will correspond to a class. */
15336 typename_type,
15338 /* If the `typename' keyword is in effect and DECL is not a type
15339 decl, then type is non existent. */
15341 ;
15347 }
15350 {
15355 {
15358 }
15360 /* For a `typename', we needn't call xref_tag. */
15366 /* Template parameter lists apply only if we are not within a
15367 function parameter list. */
15368 bool template_parm_lists_apply
15377 /* Look up a qualified name in the usual way. */
15379 {
15380 tree decl;
15381 tree ambiguous_decls;
15384 tag_type,
15391 /* If the lookup was ambiguous, an error will already have been
15392 issued. */
15396 /* If we are parsing friend declaration, DECL may be a
15397 TEMPLATE_DECL tree node here. However, we need to check
15398 whether this TEMPLATE_DECL results in valid code. Consider
15399 the following example:
15401 namespace N {
15402 template <class T> class C {};
15403 }
15404 class X {
15405 template <class T> friend class N::C; // #1, valid code
15406 };
15407 template <class T> class Y {
15408 friend class N::C; // #2, invalid code
15409 };
15411 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15412 name lookup of `N::C'. We see that friend declaration must
15413 be template for the code to be valid. Note that
15414 processing_template_decl does not work here since it is
15415 always 1 for the above two cases. */
15417 decl = (cp_parser_maybe_treat_template_as_class
15422 {
15424 identifier,
15427 }
15430 {
15434 allow_template);
15438 }
15440 /* Forward declarations of nested types, such as
15442 class C1::C2;
15443 class C1::C2::C3;
15445 are invalid unless all components preceding the final '::'
15446 are complete. If all enclosing types are complete, these
15447 declarations become merely pointless.
15449 Invalid forward declarations of nested types are errors
15450 caught elsewhere in parsing. Those that are pointless arrive
15451 here. */
15458 }
15459 else
15460 {
15461 /* An elaborated-type-specifier sometimes introduces a new type and
15462 sometimes names an existing type. Normally, the rule is that it
15463 introduces a new type only if there is not an existing type of
15464 the same name already in scope. For example, given:
15466 struct S {};
15467 void f() { struct S s; }
15469 the `struct S' in the body of `f' is the same `struct S' as in
15470 the global scope; the existing definition is used. However, if
15471 there were no global declaration, this would introduce a new
15472 local class named `S'.
15474 An exception to this rule applies to the following code:
15476 namespace N { struct S; }
15478 Here, the elaborated-type-specifier names a new type
15479 unconditionally; even if there is already an `S' in the
15480 containing scope this declaration names a new type.
15481 This exception only applies if the elaborated-type-specifier
15482 forms the complete declaration:
15484 [class.name]
15486 A declaration consisting solely of `class-key identifier ;' is
15487 either a redeclaration of the name in the current scope or a
15488 forward declaration of the identifier as a class name. It
15489 introduces the name into the current scope.
15491 We are in this situation precisely when the next token is a `;'.
15493 An exception to the exception is that a `friend' declaration does
15494 *not* name a new type; i.e., given:
15496 struct S { friend struct T; };
15498 `T' is not a new type in the scope of `S'.
15500 Also, `new struct S' or `sizeof (struct S)' never results in the
15501 definition of a new type; a new type can only be declared in a
15502 declaration context. */
15504 tag_scope ts;
15508 /* Friends have special name lookup rules. */
15512 CPP_SEMICOLON))
15513 /* This is a `class-key identifier ;' */
15515 else
15518 template_p =
15519 (template_parm_lists_apply
15522 /* An unqualified name was used to reference this type, so
15523 there were no qualifying templates. */
15531 }
15532 }
15537 /* Allow attributes on forward declarations of classes. */
15539 {
15549 else
15552 }
15555 {
15556 /* Indicate whether this class was declared as a `class' or as a
15557 `struct'. */
15561 }
15563 /* A "<" cannot follow an elaborated type specifier. If that
15564 happens, the user was probably trying to form a template-id. */
15569 }
15571 /* Parse an enum-specifier.
15573 enum-specifier:
15574 enum-head { enumerator-list [opt] }
15575 enum-head { enumerator-list , } [C++0x]
15577 enum-head:
15578 enum-key identifier [opt] enum-base [opt]
15579 enum-key nested-name-specifier identifier enum-base [opt]
15581 enum-key:
15582 enum
15583 enum class [C++0x]
15584 enum struct [C++0x]
15586 enum-base: [C++0x]
15587 : type-specifier-seq
15589 opaque-enum-specifier:
15590 enum-key identifier enum-base [opt] ;
15592 GNU Extensions:
15593 enum-key attributes[opt] identifier [opt] enum-base [opt]
15594 { enumerator-list [opt] }attributes[opt]
15595 enum-key attributes[opt] identifier [opt] enum-base [opt]
15596 { enumerator-list, }attributes[opt] [C++0x]
15598 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15599 if the token stream isn't an enum-specifier after all. */
15601 static tree
15603 {
15604 tree identifier;
15606 tree prev_scope;
15608 tree attributes;
15621 /* Parse tentatively so that we can back up if we don't find a
15622 enum-specifier. */
15625 /* Caller guarantees that the current token is 'enum', an identifier
15626 possibly follows, and the token after that is an opening brace.
15627 If we don't have an identifier, fabricate an anonymous name for
15628 the enumeration being defined. */
15631 /* Parse the "class" or "struct", which indicates a scoped
15632 enumeration type in C++0x. */
15635 {
15639 /* Consume the `struct' or `class' token. */
15643 }
15647 /* Clear the qualification. */
15652 /* Figure out in what scope the declaration is being placed. */
15658 nested_name_specifier
15666 {
15667 tree name;
15671 enum_type,
15676 input_location);
15678 {
15681 {
15682 /* Are template enums allowed in ISO? */
15686 /* ignore a typename reference, for it will be solved by name
15687 in start_enum. */
15689 }
15690 }
15693 else
15696 }
15697 else
15698 {
15701 else
15702 {
15708 }
15709 }
15712 /* Check for the `:' that denotes a specified underlying type in C++0x.
15713 Note that a ':' could also indicate a bitfield width, however. */
15715 {
15716 cp_decl_specifier_seq type_specifiers;
15718 /* Consume the `:'. */
15721 /* Parse the type-specifier-seq. */
15726 /* At this point this is surely not elaborated type specifier. */
15735 /* If that didn't work, stop. */
15737 {
15743 }
15744 }
15746 /* Look for the `{' but don't consume it yet. */
15748 {
15750 {
15753 {
15756 }
15757 }
15758 /* An opaque-enum-specifier must have a ';' here. */
15761 {
15764 {
15767 }
15768 }
15769 }
15775 {
15777 {
15781 }
15783 {
15785 }
15786 }
15788 /* Issue an error message if type-definitions are forbidden here. */
15791 else
15792 /* Create the new type. We do this before consuming the opening
15793 brace so the enum will be recorded as being on the line of its
15794 tag (or the 'enum' keyword, if there is no tag). */
15798 /* If the next token is not '{' it is an opaque-enum-specifier or an
15799 elaborated-type-specifier. */
15801 {
15805 {
15806 /* The following catches invalid code such as:
15807 enum class S<int>::E { A, B, C }; */
15815 {
15819 nested_name_specifier);
15821 }
15822 /* If that scope does not contain the scope in which the
15823 class was originally declared, the program is invalid. */
15825 nested_name_specifier))
15826 {
15829 "declaration of %qD in namespace %qD which does not "
15832 else
15834 "declaration of %qD in %qD which does not "
15838 }
15839 }
15844 /* Consume the opening brace. */
15851 {
15855 }
15856 else
15857 {
15863 }
15867 /* If the next token is not '}', then there are some enumerators. */
15869 {
15873 }
15874 else
15877 /* Consume the final '}'. */
15883 }
15884 else
15885 {
15886 /* If a ';' follows, then it is an opaque-enum-specifier
15887 and additional restrictions apply. */
15889 {
15896 }
15897 }
15899 /* Look for trailing attributes to apply to this enumeration, and
15900 apply them if appropriate. */
15902 {
15906 trailing_attr,
15908 }
15910 /* Finish up the enumeration. */
15912 {
15917 }
15920 {
15922 {
15925 }
15927 {
15929 }
15930 }
15931 out:
15934 }
15936 /* Parse an enumerator-list. The enumerators all have the indicated
15937 TYPE.
15939 enumerator-list:
15940 enumerator-definition
15941 enumerator-list , enumerator-definition */
15943 static void
15945 {
15947 {
15948 /* Parse an enumerator-definition. */
15951 /* If the next token is not a ',', we've reached the end of
15952 the list. */
15955 /* Otherwise, consume the `,' and keep going. */
15957 /* If the next token is a `}', there is a trailing comma. */
15959 {
15964 }
15965 }
15966 }
15968 /* Parse an enumerator-definition. The enumerator has the indicated
15969 TYPE.
15971 enumerator-definition:
15972 enumerator
15973 enumerator = constant-expression
15975 enumerator:
15976 identifier */
15978 static void
15980 {
15981 tree identifier;
15982 tree value;
15983 location_t loc;
15985 /* Save the input location because we are interested in the location
15986 of the identifier and not the location of the explicit value. */
15989 /* Look for the identifier. */
15994 /* If the next token is an '=', then there is an explicit value. */
15996 {
15997 /* Consume the `=' token. */
15999 /* Parse the value. */
16001 }
16002 else
16005 /* If we are processing a template, make sure the initializer of the
16006 enumerator doesn't contain any bare template parameter pack. */
16010 /* Create the enumerator. */
16012 }
16014 /* Parse a namespace-name.
16016 namespace-name:
16017 original-namespace-name
16018 namespace-alias
16020 Returns the NAMESPACE_DECL for the namespace. */
16022 static tree
16024 {
16025 tree identifier;
16026 tree namespace_decl;
16030 /* Get the name of the namespace. */
16035 /* Look up the identifier in the currently active scope. Look only
16036 for namespaces, due to:
16038 [basic.lookup.udir]
16040 When looking up a namespace-name in a using-directive or alias
16041 definition, only namespace names are considered.
16043 And:
16045 [basic.lookup.qual]
16047 During the lookup of a name preceding the :: scope resolution
16048 operator, object, function, and enumerator names are ignored.
16050 (Note that cp_parser_qualifying_entity only calls this
16051 function if the token after the name is the scope resolution
16052 operator.) */
16054 none_type,
16060 /* If it's not a namespace, issue an error. */
16063 {
16068 }
16071 }
16073 /* Parse a namespace-definition.
16075 namespace-definition:
16076 named-namespace-definition
16077 unnamed-namespace-definition
16079 named-namespace-definition:
16080 original-namespace-definition
16081 extension-namespace-definition
16083 original-namespace-definition:
16084 namespace identifier { namespace-body }
16086 extension-namespace-definition:
16087 namespace original-namespace-name { namespace-body }
16089 unnamed-namespace-definition:
16090 namespace { namespace-body } */
16092 static void
16094 {
16101 {
16105 }
16106 else
16109 /* Look for the `namespace' keyword. */
16112 /* Get the name of the namespace. We do not attempt to distinguish
16113 between an original-namespace-definition and an
16114 extension-namespace-definition at this point. The semantic
16115 analysis routines are responsible for that. */
16118 else
16121 /* Parse any specified attributes. */
16124 /* Look for the `{' to start the namespace. */
16126 /* Start the namespace. */
16129 /* "inline namespace" is equivalent to a stub namespace definition
16130 followed by a strong using directive. */
16132 {
16134 /* Set up namespace association. */
16138 /* Import the contents of the inline namespace. */
16142 }
16146 /* Parse the body of the namespace. */
16152 /* Finish the namespace. */
16154 /* Look for the final `}'. */
16156 }
16158 /* Parse a namespace-body.
16160 namespace-body:
16161 declaration-seq [opt] */
16163 static void
16165 {
16167 }
16169 /* Parse a namespace-alias-definition.
16171 namespace-alias-definition:
16172 namespace identifier = qualified-namespace-specifier ; */
16174 static void
16176 {
16177 tree identifier;
16178 tree namespace_specifier;
16182 /* Look for the `namespace' keyword. */
16184 /* Look for the identifier. */
16188 /* Look for the `=' token. */
16191 {
16193 /* Skip the definition. */
16198 }
16200 /* Look for the qualified-namespace-specifier. */
16201 namespace_specifier
16203 /* Look for the `;' token. */
16206 /* Register the alias in the symbol table. */
16208 }
16210 /* Parse a qualified-namespace-specifier.
16212 qualified-namespace-specifier:
16213 :: [opt] nested-name-specifier [opt] namespace-name
16215 Returns a NAMESPACE_DECL corresponding to the specified
16216 namespace. */
16218 static tree
16220 {
16221 /* Look for the optional `::'. */
16225 /* Look for the optional nested-name-specifier. */
16233 }
16235 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16236 access declaration.
16238 using-declaration:
16239 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16240 using :: unqualified-id ;
16242 access-declaration:
16243 qualified-id ;
16245 */
16247 static bool
16250 {
16254 tree decl;
16255 tree identifier;
16256 tree qscope;
16261 {
16264 }
16265 else
16266 {
16267 /* Look for the `using' keyword. */
16270 /* Peek at the next token. */
16272 /* See if it's `typename'. */
16274 {
16275 /* Remember that we've seen it. */
16277 /* Consume the `typename' token. */
16279 }
16280 }
16282 /* Look for the optional global scope qualification. */
16283 global_scope_p
16288 /* If we saw `typename', or didn't see `::', then there must be a
16289 nested-name-specifier present. */
16291 {
16297 {
16300 }
16301 }
16302 /* Otherwise, we could be in either of the two productions. In that
16303 case, treat the nested-name-specifier as optional. */
16304 else
16316 /* Something has already gone wrong; there's no need to parse
16317 further. Since an error has occurred, the return value of
16318 cp_parser_parse_definitely will be false, as required. */
16322 /* Parse the unqualified-id. */
16330 {
16335 }
16337 /* The function we call to handle a using-declaration is different
16338 depending on what scope we are in. */
16340 ;
16343 /* [namespace.udecl]
16345 A using declaration shall not name a template-id. */
16348 else
16349 {
16351 {
16352 /* Create the USING_DECL. */
16359 {
16362 }
16363 else
16364 /* Add it to the list of members in this class. */
16366 }
16367 else
16368 {
16370 identifier,
16377 {
16380 }
16383 else
16385 }
16386 }
16388 /* Look for the final `;'. */
16393 "access declarations are deprecated "
16394 "in favour of using-declarations; "
16398 }
16400 /* Parse an alias-declaration.
16402 alias-declaration:
16403 using identifier attribute-specifier-seq [opt] = type-id */
16405 static tree
16407 {
16409 location_t id_location;
16411 cp_decl_specifier_seq decl_specs;
16415 /* Look for the `using' keyword. */
16416 cp_token *using_token
16438 /* Now we are going to parse the type-id of the declaration. */
16440 /*
16441 [dcl.type]/3 says:
16443 "A type-specifier-seq shall not define a class or enumeration
16444 unless it appears in the type-id of an alias-declaration (7.1.3) that
16445 is not the declaration of a template-declaration."
16447 In other words, if we currently are in an alias template, the
16448 type-id should not define a type.
16450 So let's set parser->type_definition_forbidden_message in that
16451 case; cp_parser_check_type_definition (called by
16452 cp_parser_class_specifier) will then emit an error if a type is
16453 defined in the type-id. */
16455 {
16459 }
16463 /* Restore the error message if need be. */
16469 {
16472 }
16474 /* A typedef-name can also be introduced by an alias-declaration. The
16475 identifier following the using keyword becomes a typedef-name. It has
16476 the same semantics as if it were introduced by the typedef
16477 specifier. In particular, it does not define a new type and it shall
16478 not appear in the type-id. */
16483 {
16486 ds_attribute,
16487 attrs_token);
16488 }
16490 ds_typedef,
16491 using_token);
16493 ds_alias,
16494 using_token);
16503 else
16514 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16515 added into the symbol table; otherwise, return the TYPE_DECL. */
16519 {
16523 }
16526 }
16528 /* Parse a using-directive.
16530 using-directive:
16531 using namespace :: [opt] nested-name-specifier [opt]
16532 namespace-name ; */
16534 static void
16536 {
16537 tree namespace_decl;
16538 tree attribs;
16540 /* Look for the `using' keyword. */
16542 /* And the `namespace' keyword. */
16544 /* Look for the optional `::' operator. */
16546 /* And the optional nested-name-specifier. */
16552 /* Get the namespace being used. */
16554 /* And any specified attributes. */
16556 /* Update the symbol table. */
16558 /* Look for the final `;'. */
16560 }
16562 /* Parse an asm-definition.
16564 asm-definition:
16565 asm ( string-literal ) ;
16567 GNU Extension:
16569 asm-definition:
16570 asm volatile [opt] ( string-literal ) ;
16571 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16572 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16573 : asm-operand-list [opt] ) ;
16574 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16575 : asm-operand-list [opt]
16576 : asm-clobber-list [opt] ) ;
16577 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16578 : asm-clobber-list [opt]
16579 : asm-goto-list ) ; */
16581 static void
16583 {
16584 tree string;
16589 tree asm_stmt;
16597 /* Look for the `asm' keyword. */
16602 {
16605 }
16607 /* See if the next token is `volatile'. */
16610 {
16611 /* Remember that we saw the `volatile' keyword. */
16613 /* Consume the token. */
16615 }
16619 {
16620 /* Remember that we saw the `goto' keyword. */
16622 /* Consume the token. */
16624 }
16625 /* Look for the opening `('. */
16628 /* Look for the string. */
16631 {
16635 }
16637 /* If we're allowing GNU extensions, check for the extended assembly
16638 syntax. Unfortunately, the `:' tokens need not be separated by
16639 a space in C, and so, for compatibility, we tolerate that here
16640 too. Doing that means that we have to treat the `::' operator as
16641 two `:' tokens. */
16646 {
16651 /* The extended syntax was used. */
16654 /* Look for outputs. */
16656 {
16657 /* Consume the `:'. */
16659 /* Parse the output-operands. */
16661 CPP_COLON)
16663 CPP_SCOPE)
16665 CPP_CLOSE_PAREN)
16671 }
16672 /* If the next token is `::', there are no outputs, and the
16673 next token is the beginning of the inputs. */
16675 /* The inputs are coming next. */
16678 /* Look for inputs. */
16681 {
16682 /* Consume the `:' or `::'. */
16684 /* Parse the output-operands. */
16686 CPP_COLON)
16688 CPP_SCOPE)
16690 CPP_CLOSE_PAREN))
16695 }
16697 /* The clobbers are coming next. */
16700 /* Look for clobbers. */
16703 {
16705 /* Consume the `:' or `::'. */
16707 /* Parse the clobbers. */
16709 CPP_COLON)
16711 CPP_CLOSE_PAREN))
16713 }
16716 /* The labels are coming next. */
16719 /* Look for labels. */
16722 {
16724 /* Consume the `:' or `::'. */
16726 /* Parse the labels. */
16728 }
16732 }
16736 /* Look for the closing `)'. */
16744 {
16745 /* Create the ASM_EXPR. */
16747 {
16750 /* If the extended syntax was not used, mark the ASM_EXPR. */
16752 {
16758 }
16759 }
16760 else
16762 }
16763 }
16765 /* Declarators [gram.dcl.decl] */
16767 /* Parse an init-declarator.
16769 init-declarator:
16770 declarator initializer [opt]
16772 GNU Extension:
16774 init-declarator:
16775 declarator asm-specification [opt] attributes [opt] initializer [opt]
16777 function-definition:
16778 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16779 function-body
16780 decl-specifier-seq [opt] declarator function-try-block
16782 GNU Extension:
16784 function-definition:
16785 __extension__ function-definition
16787 TM Extension:
16789 function-definition:
16790 decl-specifier-seq [opt] declarator function-transaction-block
16792 The DECL_SPECIFIERS apply to this declarator. Returns a
16793 representation of the entity declared. If MEMBER_P is TRUE, then
16794 this declarator appears in a class scope. The new DECL created by
16795 this declarator is returned.
16797 The CHECKS are access checks that should be performed once we know
16798 what entity is being declared (and, therefore, what classes have
16799 befriended it).
16801 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16802 for a function-definition here as well. If the declarator is a
16803 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16804 be TRUE upon return. By that point, the function-definition will
16805 have been completely parsed.
16807 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16808 is FALSE.
16810 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16811 parsed declaration if it is an uninitialized single declarator not followed
16812 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16813 if present, will not be consumed. If returned, this declarator will be
16814 created with SD_INITIALIZED but will not call cp_finish_decl. */
16816 static tree
16825 {
16829 tree prefix_attributes;
16831 tree asm_specification;
16832 tree initializer;
16834 tree scope;
16836 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16837 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16838 "(...)". */
16848 /* Gather the attributes that were provided with the
16849 decl-specifiers. */
16852 /* Assume that this is not the declarator for a function
16853 definition. */
16857 /* Default arguments are only permitted for function parameters. */
16861 /* Defer access checks while parsing the declarator; we cannot know
16862 what names are accessible until we know what is being
16863 declared. */
16866 /* Parse the declarator. */
16868 declarator
16873 /* Gather up the deferred checks. */
16878 /* If the DECLARATOR was erroneous, there's no need to go
16879 further. */
16883 /* Check that the number of template-parameter-lists is OK. */
16893 /* Figure out what scope the entity declared by the DECLARATOR is
16894 located in. `grokdeclarator' sometimes changes the scope, so
16895 we compute it now. */
16898 /* Perform any lookups in the declared type which were thought to be
16899 dependent, but are not in the scope of the declarator. */
16900 decl_specifiers->type
16903 /* If we're allowing GNU extensions, look for an
16904 asm-specification. */
16906 {
16907 /* Look for an asm-specification. */
16910 }
16911 else
16914 /* Look for attributes. */
16918 /* Peek at the next token. */
16924 {
16925 /* Check to see if the token indicates the start of a
16926 function-definition. */
16928 {
16930 {
16931 /* If a function-definition should not appear here, issue an
16932 error message. */
16936 }
16938 location_t func_brace_location
16941 /* Neither attributes nor an asm-specification are allowed
16942 on a function-definition. */
16945 "an asm-specification is not allowed "
16949 "attributes are not allowed "
16951 /* This is a function-definition. */
16954 /* Parse the function definition. */
16957 decl_specifiers,
16958 declarator,
16959 prefix_attributes);
16960 else
16961 decl =
16962 (cp_parser_function_definition_from_specifiers_and_declarator
16966 {
16967 /* This is where the prologue starts... */
16970 }
16973 }
16974 }
16976 {
16977 /* A non-template declaration involving a function parameter list
16978 containing an implicit template parameter will be made into a
16979 template. If the resulting declaration is not going to be an
16980 actual function then finish the template scope here to prevent it.
16981 An error message will be issued once we have a decl to talk about.
16983 FIXME probably we should do type deduction rather than create an
16984 implicit template, but the standard currently doesn't allow it. */
16987 }
16989 /* [dcl.dcl]
16991 Only in function declarations for constructors, destructors, and
16992 type conversions can the decl-specifier-seq be omitted.
16994 We explicitly postpone this check past the point where we handle
16995 function-definitions because we tolerate function-definitions
16996 that are missing their return types in some modes. */
16998 {
17002 }
17004 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17008 {
17016 {
17022 }
17023 }
17024 else
17025 {
17026 /* If the init-declarator isn't initialized and isn't followed by a
17027 `,' or `;', it's not a valid init-declarator. */
17030 {
17033 else
17034 {
17037 }
17038 }
17041 }
17043 /* Because start_decl has side-effects, we should only call it if we
17044 know we're going ahead. By this point, we know that we cannot
17045 possibly be looking at any other construct. */
17048 /* Enter the newly declared entry in the symbol table. If we're
17049 processing a declaration in a class-specifier, we wait until
17050 after processing the initializer. */
17052 {
17059 /* Adjust location of decl if declarator->id_loc is more appropriate:
17060 set, and decl wasn't merged with another decl, in which case its
17061 location would be different from input_location, and more accurate. */
17066 }
17068 /* Enter the SCOPE. That way unqualified names appearing in the
17069 initializer will be looked up in SCOPE. */
17072 /* Perform deferred access control checks, now that we know in which
17073 SCOPE the declared entity resides. */
17075 {
17078 /* If the entity being declared is a function, pretend that we
17079 are in its scope. If it is a `friend', it may have access to
17080 things that would not otherwise be accessible. */
17082 {
17085 }
17087 /* Perform access checks for template parameters. */
17090 /* Perform the access control checks for the declarator and the
17091 decl-specifiers. */
17094 /* Restore the saved value. */
17097 }
17099 /* Parse the initializer. */
17104 {
17106 {
17110 else
17111 {
17112 /* If the declaration was erroneous, we don't really
17113 know what the user intended, so just silently
17114 consume the initializer. */
17122 }
17123 }
17124 else
17125 {
17126 /* We want to record the extra mangling scope for in-class
17127 initializers of class members and initializers of static data
17128 member templates. The former involves deferring
17129 parsing of the initializer until end of class as with default
17130 arguments. So right here we only handle the latter. */
17140 }
17141 }
17143 /* The old parser allows attributes to appear after a parenthesized
17144 initializer. Mark Mitchell proposed removing this functionality
17145 on the GCC mailing lists on 2002-08-13. This parser accepts the
17146 attributes -- but ignores them. */
17153 /* And now complain about a non-function implicit template. */
17158 /* For an in-class declaration, use `grokfield' to create the
17159 declaration. */
17161 {
17163 {
17166 }
17174 }
17176 /* Finish processing the declaration. But, skip member
17177 declarations. */
17179 {
17182 asm_specification,
17183 /* If the initializer is in parentheses, then this is
17184 a direct-initialization, which means that an
17185 `explicit' constructor is OK. Otherwise, an
17186 `explicit' constructor cannot be used. */
17189 }
17192 /* Core issue #226 (C++0x only): A default template-argument
17193 shall not be specified in a friend class template
17194 declaration. */
17203 {
17206 else
17208 }
17211 }
17213 /* Parse a declarator.
17215 declarator:
17216 direct-declarator
17217 ptr-operator declarator
17219 abstract-declarator:
17220 ptr-operator abstract-declarator [opt]
17221 direct-abstract-declarator
17223 GNU Extensions:
17225 declarator:
17226 attributes [opt] direct-declarator
17227 attributes [opt] ptr-operator declarator
17229 abstract-declarator:
17230 attributes [opt] ptr-operator abstract-declarator [opt]
17231 attributes [opt] direct-abstract-declarator
17233 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17234 detect constructor, destructor or conversion operators. It is set
17235 to -1 if the declarator is a name, and +1 if it is a
17236 function. Otherwise it is set to zero. Usually you just want to
17237 test for >0, but internally the negative value is used.
17239 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17240 a decl-specifier-seq unless it declares a constructor, destructor,
17241 or conversion. It might seem that we could check this condition in
17242 semantic analysis, rather than parsing, but that makes it difficult
17243 to handle something like `f()'. We want to notice that there are
17244 no decl-specifiers, and therefore realize that this is an
17245 expression, not a declaration.)
17247 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17248 the declarator is a direct-declarator of the form "(...)".
17250 MEMBER_P is true iff this declarator is a member-declarator.
17252 FRIEND_P is true iff this declarator is a friend. */
17256 cp_parser_declarator_kind dcl_kind,
17260 {
17263 cp_cv_quals cv_quals;
17264 tree class_type;
17267 /* Assume this is not a constructor, destructor, or type-conversion
17268 operator. */
17275 /* Check for the ptr-operator production. */
17277 /* Parse the ptr-operator. */
17283 /* If that worked, then we have a ptr-operator. */
17285 {
17286 /* If a ptr-operator was found, then this declarator was not
17287 parenthesized. */
17290 /* The dependent declarator is optional if we are parsing an
17291 abstract-declarator. */
17295 /* Parse the dependent declarator. */
17300 friend_p);
17302 /* If we are parsing an abstract-declarator, we must handle the
17303 case where the dependent declarator is absent. */
17308 declarator = cp_parser_make_indirect_declarator
17310 }
17311 /* Everything else is a direct-declarator. */
17312 else
17313 {
17316 CPP_OPEN_PAREN);
17318 ctor_dtor_or_conv_p,
17320 }
17325 }
17327 /* Parse a direct-declarator or direct-abstract-declarator.
17329 direct-declarator:
17330 declarator-id
17331 direct-declarator ( parameter-declaration-clause )
17332 cv-qualifier-seq [opt]
17333 ref-qualifier [opt]
17334 exception-specification [opt]
17335 direct-declarator [ constant-expression [opt] ]
17336 ( declarator )
17338 direct-abstract-declarator:
17339 direct-abstract-declarator [opt]
17340 ( parameter-declaration-clause )
17341 cv-qualifier-seq [opt]
17342 ref-qualifier [opt]
17343 exception-specification [opt]
17344 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17345 ( abstract-declarator )
17347 Returns a representation of the declarator. DCL_KIND is
17348 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17349 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17350 we are parsing a direct-declarator. It is
17351 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17352 of ambiguity we prefer an abstract declarator, as per
17353 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17354 as for cp_parser_declarator. */
17358 cp_parser_declarator_kind dcl_kind,
17361 {
17371 {
17372 /* Peek at the next token. */
17375 {
17376 /* This is either a parameter-declaration-clause, or a
17377 parenthesized declarator. When we know we are parsing a
17378 named declarator, it must be a parenthesized declarator
17379 if FIRST is true. For instance, `(int)' is a
17380 parameter-declaration-clause, with an omitted
17381 direct-abstract-declarator. But `((*))', is a
17382 parenthesized abstract declarator. Finally, when T is a
17383 template parameter `(T)' is a
17384 parameter-declaration-clause, and not a parenthesized
17385 named declarator.
17387 We first try and parse a parameter-declaration-clause,
17388 and then try a nested declarator (if FIRST is true).
17390 It is not an error for it not to be a
17391 parameter-declaration-clause, even when FIRST is
17392 false. Consider,
17394 int i (int);
17395 int i (3);
17397 The first is the declaration of a function while the
17398 second is the definition of a variable, including its
17399 initializer.
17401 Having seen only the parenthesis, we cannot know which of
17402 these two alternatives should be selected. Even more
17403 complex are examples like:
17405 int i (int (a));
17406 int i (int (3));
17408 The former is a function-declaration; the latter is a
17409 variable initialization.
17411 Thus again, we try a parameter-declaration-clause, and if
17412 that fails, we back out and return. */
17415 {
17416 tree params;
17419 /* In a member-declarator, the only valid interpretation
17420 of a parenthesis is the start of a
17421 parameter-declaration-clause. (It is invalid to
17422 initialize a static data member with a parenthesized
17423 initializer; only the "=" form of initialization is
17424 permitted.) */
17428 /* Consume the `('. */
17431 {
17432 /* If this is going to be an abstract declarator, we're
17433 in a declarator and we can't have default args. */
17436 }
17440 /* Parse the parameter-declaration-clause. */
17443 /* Consume the `)'. */
17446 /* If all went well, parse the cv-qualifier-seq,
17447 ref-qualifier and the exception-specification. */
17449 {
17450 cp_cv_quals cv_quals;
17451 cp_virt_specifiers virt_specifiers;
17452 cp_ref_qualifier ref_qual;
17453 tree exception_specification;
17454 tree late_return;
17455 tree attrs;
17465 /* Parse the cv-qualifier-seq. */
17467 /* Parse the ref-qualifier. */
17469 /* And the exception-specification. */
17470 exception_specification
17475 /* In here, we handle cases where attribute is used after
17476 the function declaration. For example:
17477 void func (int x) __attribute__((vector(..))); */
17480 {
17484 CPP_SEMICOLON)
17486 CPP_OPEN_BRACE))
17489 ;
17490 else
17492 }
17493 late_return = (cp_parser_late_return_type_opt
17498 /* Parse the virt-specifier-seq. */
17501 /* Create the function-declarator. */
17503 params,
17504 cv_quals,
17505 virt_specifiers,
17506 ref_qual,
17507 exception_specification,
17508 late_return);
17510 /* Any subsequent parameter lists are to do with
17511 return type, so are not those of the declared
17512 function. */
17514 }
17516 /* Remove the function parms from scope. */
17520 /* Repeat the main loop. */
17522 }
17524 /* If this is the first, we can try a parenthesized
17525 declarator. */
17527 {
17533 /* Consume the `('. */
17535 /* Parse the nested declarator. */
17538 declarator
17544 /* Expect a `)'. */
17551 }
17552 /* Otherwise, we must be done. */
17553 else
17555 }
17559 {
17560 /* Parse an array-declarator. */
17569 /* Consume the `['. */
17571 /* Peek at the next token. */
17573 /* If the next token is `]', then there is no
17574 constant-expression. */
17576 {
17578 bounds
17588 {
17589 /* Normally, the array bound must be an integral constant
17590 expression. However, as an extension, we allow VLAs
17591 in function scopes as long as they aren't part of a
17592 parameter declaration. */
17596 }
17599 {
17600 /* Remember this wasn't a constant-expression. */
17603 }
17604 }
17605 else
17607 /* Look for the closing `]'. */
17609 {
17612 }
17617 }
17619 {
17620 {
17621 tree qualifying_scope;
17622 tree unqualified_name;
17623 tree attrs;
17624 special_function_kind sfk;
17629 /* Parse a declarator-id */
17632 {
17635 /* If we see an ellipsis, we should be looking at a
17636 parameter pack. */
17638 {
17639 /* Consume the `...' */
17643 }
17644 }
17647 unqualified_name
17651 {
17655 {
17656 /* Check whether an error occurred. */
17659 /* We already consumed the ellipsis to mark a
17660 parameter pack, but we have no way to report it,
17661 so abort the tentative parse. We will be exiting
17662 immediately anyway. */
17664 }
17665 else
17671 && (qualifying_scope
17673 {
17676 }
17677 }
17682 {
17687 }
17693 {
17694 /* In the declaration of a member of a template class
17695 outside of the class itself, the SCOPE will sometimes
17696 be a TYPENAME_TYPE. For example, given:
17698 template <typename T>
17699 int S<T>::R::i = 3;
17701 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17702 this context, we must resolve S<T>::R to an ordinary
17703 type, rather than a typename type.
17705 The reason we normally avoid resolving TYPENAME_TYPEs
17706 is that a specialization of `S' might render
17707 `S<T>::R' not a type. However, if `S' is
17708 specialized, then this `i' will not be used, so there
17709 is no harm in resolving the types here. */
17710 tree type;
17712 /* Resolve the TYPENAME_TYPE. */
17715 /* If that failed, the declarator is invalid. */
17717 {
17720 "cannot define member of dependent typedef "
17722 else
17727 }
17729 }
17734 {
17735 tree class_type;
17740 else
17744 {
17747 {
17750 {
17754 "use %<%T::%D%> instead of %<%T::%D%> to "
17756 class_type,
17761 }
17762 else
17764 }
17765 else
17766 {
17767 /* We do not attempt to print the declarator
17768 here because we do not have enough
17769 information about its original syntactic
17770 form. */
17774 }
17775 }
17778 {
17784 for an anonymous type, even if the type
17785 got a name for linkage purposes. */
17787 /* Handle correctly (c++/19200):
17789 struct S {
17790 struct T{};
17791 friend void S(T);
17792 };
17794 and also:
17796 namespace N {
17797 void S();
17798 }
17800 struct S {
17801 friend void N::S();
17802 }; */
17803 && !(friend_p
17806 class_type))
17807 {
17810 }
17818 }
17819 }
17821 unqualified_name,
17822 sfk);
17829 }
17831 handle_declarator:;
17834 {
17835 /* Any names that appear after the declarator-id for a
17836 member are looked up in the containing scope. */
17838 {
17839 /* But declarations with qualified-ids can't appear in a
17840 function. */
17844 }
17846 }
17850 /* Default args are only allowed on function
17851 declarations. */
17853 else
17857 }
17858 /* We're done. */
17859 else
17861 }
17863 /* For an abstract declarator, we might wind up with nothing at this
17864 point. That's an error; the declarator is not optional. */
17868 /* If we entered a scope, we must exit it now. */
17876 }
17878 /* Parse a ptr-operator.
17880 ptr-operator:
17881 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17882 * cv-qualifier-seq [opt]
17883 &
17884 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17885 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17887 GNU Extension:
17889 ptr-operator:
17890 & cv-qualifier-seq [opt]
17892 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17893 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17894 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17895 filled in with the TYPE containing the member. *CV_QUALS is
17896 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17897 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17898 Note that the tree codes returned by this function have nothing
17899 to do with the types of trees that will be eventually be created
17900 to represent the pointer or reference type being parsed. They are
17901 just constants with suggestive names. */
17902 static enum tree_code
17907 {
17912 /* Assume that it's not a pointer-to-member. */
17914 /* And that there are no cv-qualifiers. */
17917 /* Peek at the next token. */
17920 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17930 {
17931 /* Consume the `*', `&' or `&&'. */
17934 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17935 `&', if we are allowing GNU extensions. (The only qualifier
17936 that can legally appear after `&' is `restrict', but that is
17937 enforced during semantic analysis. */
17945 }
17946 else
17947 {
17948 /* Try the pointer-to-member case. */
17950 /* Look for the optional `::' operator. */
17953 /* Look for the nested-name specifier. */
17960 /* If we found it, and the next token is a `*', then we are
17961 indeed looking at a pointer-to-member operator. */
17964 {
17965 /* Indicate that the `*' operator was used. */
17973 else
17974 {
17975 /* The type of which the member is a member is given by the
17976 current SCOPE. */
17978 /* The next name will not be qualified. */
17982 /* Look for optional c++11 attributes. */
17986 /* Look for the optional cv-qualifier-seq. */
17988 }
17989 }
17990 /* If that didn't work we don't have a ptr-operator. */
17993 }
17996 }
17998 /* Parse an (optional) cv-qualifier-seq.
18000 cv-qualifier-seq:
18001 cv-qualifier cv-qualifier-seq [opt]
18003 cv-qualifier:
18004 const
18005 volatile
18007 GNU Extension:
18009 cv-qualifier:
18010 __restrict__
18012 Returns a bitmask representing the cv-qualifiers. */
18014 static cp_cv_quals
18016 {
18020 {
18022 cp_cv_quals cv_qualifier;
18024 /* Peek at the next token. */
18026 /* See if it's a cv-qualifier. */
18028 {
18044 }
18050 {
18053 }
18054 else
18055 {
18058 }
18059 }
18062 }
18064 /* Parse an (optional) ref-qualifier
18066 ref-qualifier:
18067 &
18068 &&
18070 Returns cp_ref_qualifier representing ref-qualifier. */
18072 static cp_ref_qualifier
18074 {
18077 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18082 {
18087 {
18099 }
18104 {
18107 }
18108 else
18109 {
18112 }
18113 }
18116 }
18118 /* Parse an (optional) virt-specifier-seq.
18120 virt-specifier-seq:
18121 virt-specifier virt-specifier-seq [opt]
18123 virt-specifier:
18124 override
18125 final
18127 Returns a bitmask representing the virt-specifiers. */
18129 static cp_virt_specifiers
18131 {
18135 {
18137 cp_virt_specifiers virt_specifier;
18139 /* Peek at the next token. */
18141 /* See if it's a virt-specifier-qualifier. */
18145 {
18148 }
18150 {
18153 }
18155 {
18157 }
18158 else
18162 {
18165 }
18166 else
18167 {
18170 }
18171 }
18173 }
18175 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18176 is in scope even though it isn't real. */
18178 void
18180 {
18181 tree this_parm;
18184 {
18185 /* We don't clear this between NSDMIs. Is it already what we want? */
18190 }
18193 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18195 current_class_ref
18198 }
18200 /* Return true iff our current scope is a non-static data member
18201 initializer. */
18203 bool
18205 {
18206 /* We recognize NSDMI context by the context-less 'this' pointer set up
18207 by the function above. */
18211 }
18213 /* Parse a late-specified return type, if any. This is not a separate
18214 non-terminal, but part of a function declarator, which looks like
18216 -> trailing-type-specifier-seq abstract-declarator(opt)
18218 Returns the type indicated by the type-id.
18220 In addition to this this parses any queued up omp declare simd
18221 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18223 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18224 function. */
18226 static tree
18228 cp_cv_quals quals)
18229 {
18233 && declarator
18239 /* Peek at the next token. */
18241 /* A late-specified return type is indicated by an initial '->'. */
18248 {
18249 /* DR 1207: 'this' is in scope in the trailing return type. */
18251 }
18254 {
18255 /* Consume the ->. */
18259 }
18262 declarator->std_attributes
18266 declarator->std_attributes
18271 {
18274 }
18277 }
18279 /* Parse a declarator-id.
18281 declarator-id:
18282 id-expression
18283 :: [opt] nested-name-specifier [opt] type-name
18285 In the `id-expression' case, the value returned is as for
18286 cp_parser_id_expression if the id-expression was an unqualified-id.
18287 If the id-expression was a qualified-id, then a SCOPE_REF is
18288 returned. The first operand is the scope (either a NAMESPACE_DECL
18289 or TREE_TYPE), but the second is still just a representation of an
18290 unqualified-id. */
18292 static tree
18294 {
18295 tree id;
18296 /* The expression must be an id-expression. Assume that qualified
18297 names are the names of types so that:
18299 template <class T>
18300 int S<T>::R::i = 3;
18302 will work; we must treat `S<T>::R' as the name of a type.
18303 Similarly, assume that qualified names are templates, where
18304 required, so that:
18306 template <class T>
18307 int S<T>::R<T>::i = 3;
18309 will work, too. */
18315 optional_p);
18319 }
18321 /* Parse a type-id.
18323 type-id:
18324 type-specifier-seq abstract-declarator [opt]
18326 Returns the TYPE specified. */
18328 static tree
18331 {
18332 cp_decl_specifier_seq type_specifier_seq;
18335 /* Parse the type-specifier-seq. */
18337 is_trailing_return,
18342 /* There might or might not be an abstract declarator. */
18344 /* Look for the declarator. */
18345 abstract_declarator
18350 /* Check to see if there really was a declarator. */
18355 /* None of the valid uses of 'auto' in C++14 involve the type-id
18356 nonterminal, but it is valid in a trailing-return-type. */
18359 {
18360 /* A type-id with type 'auto' is only ok if the abstract declarator
18361 is a function declarator with a late-specified return type. */
18366 else
18367 {
18370 }
18371 }
18374 is_template_arg);
18375 }
18378 {
18380 }
18383 {
18384 tree r;
18386 parser->type_definition_forbidden_message
18391 {
18394 }
18396 }
18399 {
18401 }
18403 /* Parse a type-specifier-seq.
18405 type-specifier-seq:
18406 type-specifier type-specifier-seq [opt]
18408 GNU extension:
18410 type-specifier-seq:
18411 attributes type-specifier-seq [opt]
18413 If IS_DECLARATION is true, we are at the start of a "condition" or
18414 exception-declaration, so we might be followed by a declarator-id.
18416 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18417 i.e. we've just seen "->".
18419 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18421 static void
18426 {
18431 /* Clear the TYPE_SPECIFIER_SEQ. */
18434 /* In the context of a trailing return type, enum E { } is an
18435 elaborated-type-specifier followed by a function-body, not an
18436 enum-specifier. */
18440 /* Parse the type-specifiers and attributes. */
18442 {
18443 tree type_specifier;
18446 /* Check for attributes first. */
18448 {
18453 }
18455 /* record the token of the beginning of the type specifier seq,
18456 for error reporting purposes*/
18460 /* Look for the type-specifier. */
18462 flags,
18463 type_specifier_seq,
18465 NULL,
18468 {
18469 /* If the first type-specifier could not be found, this is not a
18470 type-specifier-seq at all. */
18472 {
18473 /* Set in_declarator_p to avoid skipping to the semicolon. */
18485 }
18486 /* If subsequent type-specifiers could not be found, the
18487 type-specifier-seq is complete. */
18489 }
18492 /* The standard says that a condition can be:
18494 type-specifier-seq declarator = assignment-expression
18496 However, given:
18498 struct S {};
18499 if (int S = ...)
18501 we should treat the "S" as a declarator, not as a
18502 type-specifier. The standard doesn't say that explicitly for
18503 type-specifier-seq, but it does say that for
18504 decl-specifier-seq in an ordinary declaration. Perhaps it
18505 would be clearer just to allow a decl-specifier-seq here, and
18506 then add a semantic restriction that if any decl-specifiers
18507 that are not type-specifiers appear, the program is invalid. */
18510 }
18511 }
18513 /* Return whether the function currently being declared has an associated
18514 template parameter list. */
18516 static bool
18518 {
18531 }
18533 /* Parse a parameter-declaration-clause.
18535 parameter-declaration-clause:
18536 parameter-declaration-list [opt] ... [opt]
18537 parameter-declaration-list , ...
18539 Returns a representation for the parameter declarations. A return
18540 value of NULL indicates a parameter-declaration-clause consisting
18541 only of an ellipsis. */
18543 static tree
18545 {
18546 tree parameters;
18555 parser->auto_is_implicit_function_template_parm_p
18557 }
18563 && !processing_template_parmlist
18569 /* Peek at the next token. */
18571 /* Check for trivial parameter-declaration-clauses. */
18573 {
18574 /* Consume the `...' token. */
18577 }
18579 /* There are no parameters. */
18580 {
18581 #ifndef NO_IMPLICIT_EXTERN_C
18586 else
18587 #endif
18589 }
18590 /* Check for `(void)', too, which is a special case. */
18594 {
18595 /* Consume the `void' token. */
18597 /* There are no parameters. */
18599 }
18601 /* Parse the parameter-declaration-list. */
18603 /* If a parse error occurred while parsing the
18604 parameter-declaration-list, then the entire
18605 parameter-declaration-clause is erroneous. */
18609 /* Peek at the next token. */
18611 /* If it's a `,', the clause should terminate with an ellipsis. */
18613 {
18614 /* Consume the `,'. */
18616 /* Expect an ellipsis. */
18617 ellipsis_p
18619 }
18620 /* It might also be `...' if the optional trailing `,' was
18621 omitted. */
18623 {
18624 /* Consume the `...' token. */
18626 /* And remember that we saw it. */
18628 }
18629 else
18632 /* Finish the parameter list. */
18637 }
18639 /* Parse a parameter-declaration-list.
18641 parameter-declaration-list:
18642 parameter-declaration
18643 parameter-declaration-list , parameter-declaration
18645 Returns a representation of the parameter-declaration-list, as for
18646 cp_parser_parameter_declaration_clause. However, the
18647 `void_list_node' is never appended to the list. Upon return,
18648 *IS_ERROR will be true iff an error occurred. */
18650 static tree
18652 {
18658 /* Assume all will go well. */
18660 /* The special considerations that apply to a function within an
18661 unbraced linkage specifications do not apply to the parameters
18662 to the function. */
18663 saved_in_unbraced_linkage_specification_p
18667 /* Look for more parameters. */
18669 {
18677 /* Parse the parameter. */
18678 parameter
18683 /* We don't know yet if the enclosing context is deprecated, so wait
18684 and warn in grokparms if appropriate. */
18688 {
18689 /* If a function parameter pack was specified and an implicit template
18690 parameter was introduced during cp_parser_parameter_declaration,
18691 change any implicit parameters introduced into packs. */
18695 {
18703 }
18707 PARM,
18710 }
18714 /* If a parse error occurred parsing the parameter declaration,
18715 then the entire parameter-declaration-list is erroneous. */
18717 {
18721 }
18731 {
18735 }
18737 /* Add the new parameter to the list. */
18741 /* Peek at the next token. */
18744 /* These are for Objective-C++ */
18747 /* The parameter-declaration-list is complete. */
18750 {
18753 /* Peek at the next token. */
18755 /* If it's an ellipsis, then the list is complete. */
18758 /* Otherwise, there must be more parameters. Consume the
18759 `,'. */
18761 /* When parsing something like:
18763 int i(float f, double d)
18765 we can tell after seeing the declaration for "f" that we
18766 are not looking at an initialization of a variable "i",
18767 but rather at the declaration of a function "i".
18769 Due to the fact that the parsing of template arguments
18770 (as specified to a template-id) requires backtracking we
18771 cannot use this technique when inside a template argument
18772 list. */
18776 /* However, a parameter-declaration of the form
18777 "float(f)" (which is a valid declaration of a
18778 parameter "f") can also be interpreted as an
18779 expression (the conversion of "f" to "float"). */
18782 }
18783 else
18784 {
18792 }
18793 }
18795 parser->in_unbraced_linkage_specification_p
18798 /* Reset implicit_template_scope if we are about to leave the function
18799 parameter list that introduced it. Note that for out-of-line member
18800 definitions, there will be one or more class scopes before we get to
18801 the template parameter scope. */
18805 {
18809 {
18812 }
18813 }
18816 }
18818 /* Parse a parameter declaration.
18820 parameter-declaration:
18821 decl-specifier-seq ... [opt] declarator
18822 decl-specifier-seq declarator = assignment-expression
18823 decl-specifier-seq ... [opt] abstract-declarator [opt]
18824 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18826 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18827 declares a template parameter. (In that case, a non-nested `>'
18828 token encountered during the parsing of the assignment-expression
18829 is not interpreted as a greater-than operator.)
18831 Returns a representation of the parameter, or NULL if an error
18832 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18833 true iff the declarator is of the form "(p)". */
18839 {
18841 cp_decl_specifier_seq decl_specifiers;
18843 tree default_argument;
18847 /* In a template parameter, `>' is not an operator.
18849 [temp.param]
18851 When parsing a default template-argument for a non-type
18852 template-parameter, the first non-nested `>' is taken as the end
18853 of the template parameter-list rather than a greater-than
18854 operator. */
18856 /* Type definitions may not appear in parameter types. */
18858 parser->type_definition_forbidden_message
18861 /* Parse the declaration-specifiers. */
18863 CP_PARSER_FLAGS_NONE,
18867 /* Complain about missing 'typename' or other invalid type names. */
18872 /* If an error occurred, there's no reason to attempt to parse the
18873 rest of the declaration. */
18875 {
18878 }
18880 /* Peek at the next token. */
18883 /* If the next token is a `)', `,', `=', `>', or `...', then there
18884 is no declarator. However, when variadic templates are enabled,
18885 there may be a declarator following `...'. */
18890 {
18894 }
18895 /* Otherwise, there should be a declarator. */
18896 else
18897 {
18901 /* After seeing a decl-specifier-seq, if the next token is not a
18902 "(", there is no possibility that the code is a valid
18903 expression. Therefore, if parsing tentatively, we commit at
18904 this point. */
18906 /* In an expression context, having seen:
18908 (int((char ...
18910 we cannot be sure whether we are looking at a
18911 function-type (taking a "char" as a parameter) or a cast
18912 of some object of type "char" to "int". */
18918 /* Parse the declarator. */
18921 CP_PARSER_DECLARATOR_EITHER,
18923 parenthesized_p,
18927 /* After the declarator, allow more attributes. */
18928 decl_specifiers.attributes
18931 }
18933 /* If the next token is an ellipsis, and we have not seen a
18934 declarator name, and the type of the declarator contains parameter
18935 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18936 a parameter pack expansion expression. Otherwise, leave the
18937 ellipsis for a C-style variadic function. */
18940 {
18951 {
18952 /* Consume the `...'. */
18956 /* Build a pack expansion type */
18959 else
18961 }
18962 }
18964 /* The restriction on defining new types applies only to the type
18965 of the parameter, not to the default argument. */
18968 /* If the next token is `=', then process a default argument. */
18970 {
18972 /* If we are defining a class, then the tokens that make up the
18973 default argument must be saved and processed later. */
18978 /* Outside of a class definition, we can just parse the
18979 assignment-expression. */
18980 else
18981 default_argument
18985 {
18988 else
18989 {
18991 "default arguments are only "
18994 }
18995 }
18999 {
19000 /* Find the name of the parameter pack. */
19007 template_parm_p
19013 else
19015 template_parm_p
19022 }
19023 }
19024 else
19028 declarator,
19029 default_argument);
19030 }
19032 /* Parse a default argument and return it.
19034 TEMPLATE_PARM_P is true if this is a default argument for a
19035 non-type template parameter. */
19036 static tree
19038 {
19044 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19045 set correctly. */
19048 /* Local variable names (and the `this' keyword) may not
19049 appear in a default argument. */
19052 /* Parse the assignment-expression. */
19057 /* The "this" pointer is not valid in a default argument. */
19059 {
19064 }
19065 default_argument
19067 /* Restore the "this" pointer. */
19069 {
19072 }
19081 }
19083 /* Parse a function-body.
19085 function-body:
19086 compound_statement */
19088 static void
19090 {
19092 }
19094 /* Parse a ctor-initializer-opt followed by a function-body. Return
19095 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19096 is true we are parsing a function-try-block. */
19098 static bool
19101 {
19109 /* Begin the function body. */
19111 /* Parse the optional ctor-initializer. */
19114 /* If we're parsing a constexpr constructor definition, we need
19115 to check that the constructor body is indeed empty. However,
19116 before we get to cp_parser_function_body lot of junk has been
19117 generated, so we can't just check that we have an empty block.
19118 Rather we take a snapshot of the outermost block, and check whether
19119 cp_parser_function_body changed its state. */
19121 {
19125 }
19126 /* Parse the function-body. */
19130 /* Finish the function body. */
19134 }
19136 /* Parse an initializer.
19138 initializer:
19139 = initializer-clause
19140 ( expression-list )
19142 Returns an expression representing the initializer. If no
19143 initializer is present, NULL_TREE is returned.
19145 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19146 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19147 set to TRUE if there is no initializer present. If there is an
19148 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19149 is set to true; otherwise it is set to false. */
19151 static tree
19154 {
19156 tree init;
19158 /* Peek at the next token. */
19161 /* Let our caller know whether or not this initializer was
19162 parenthesized. */
19164 /* Assume that the initializer is constant. */
19168 {
19169 /* Consume the `='. */
19171 /* Parse the initializer-clause. */
19173 }
19175 {
19180 non_constant_p);
19185 }
19187 {
19192 }
19193 else
19194 {
19195 /* Anything else is an error. */
19198 }
19201 }
19203 /* Parse an initializer-clause.
19205 initializer-clause:
19206 assignment-expression
19207 braced-init-list
19209 Returns an expression representing the initializer.
19211 If the `assignment-expression' production is used the value
19212 returned is simply a representation for the expression.
19214 Otherwise, calls cp_parser_braced_list. */
19216 static tree
19218 {
19219 tree initializer;
19221 /* Assume the expression is constant. */
19224 /* If it is not a `{', then we are looking at an
19225 assignment-expression. */
19227 {
19228 initializer
19231 non_constant_p);
19232 }
19233 else
19237 }
19239 /* Parse a brace-enclosed initializer list.
19241 braced-init-list:
19242 { initializer-list , [opt] }
19243 { }
19245 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19246 the elements of the initializer-list (or NULL, if the last
19247 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19248 NULL_TREE. There is no way to detect whether or not the optional
19249 trailing `,' was provided. NON_CONSTANT_P is as for
19250 cp_parser_initializer. */
19252 static tree
19254 {
19255 tree initializer;
19257 /* Consume the `{' token. */
19259 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19261 /* If it's not a `}', then there is a non-trivial initializer. */
19263 {
19264 /* Parse the initializer list. */
19267 /* A trailing `,' token is allowed. */
19270 }
19271 else
19273 /* Now, there should be a trailing `}'. */
19277 }
19279 /* Consume tokens up to, and including, the next non-nested closing `]'.
19280 Returns true iff we found a closing `]'. */
19282 static bool
19284 {
19288 {
19292 {
19295 /* If we've run out of tokens, then there is no closing `]'. */
19304 {
19307 }
19312 }
19314 /* Consume the token. */
19316 }
19317 }
19319 /* Return true if we are looking at an array-designator, false otherwise. */
19321 static bool
19323 {
19324 /* Consume the `['. */
19329 /* Skip tokens until the next token is a closing square bracket.
19330 If we find the closing `]', and the next token is a `=', then
19331 we are looking at an array designator. */
19332 bool array_designator_p
19336 /* Roll back the tokens we skipped. */
19340 }
19342 /* Parse an initializer-list.
19344 initializer-list:
19345 initializer-clause ... [opt]
19346 initializer-list , initializer-clause ... [opt]
19348 GNU Extension:
19350 initializer-list:
19351 designation initializer-clause ...[opt]
19352 initializer-list , designation initializer-clause ...[opt]
19354 designation:
19355 . identifier =
19356 identifier :
19357 [ constant-expression ] =
19359 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19360 for the initializer. If the INDEX of the elt is non-NULL, it is the
19361 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19362 as for cp_parser_initializer. */
19366 {
19369 /* Assume all of the expressions are constant. */
19372 /* Parse the rest of the list. */
19374 {
19376 tree designator;
19377 tree initializer;
19380 /* If the next token is an identifier and the following one is a
19381 colon, we are looking at the GNU designated-initializer
19382 syntax. */
19386 {
19387 /* Warn the user that they are using an extension. */
19390 /* Consume the identifier. */
19392 /* Consume the `:'. */
19394 }
19395 /* Also handle the C99 syntax, '. id ='. */
19400 {
19401 /* Warn the user that they are using an extension. */
19404 /* Consume the `.'. */
19406 /* Consume the identifier. */
19408 /* Consume the `='. */
19410 }
19411 /* Also handle C99 array designators, '[ const ] ='. */
19415 {
19416 /* In C++11, [ could start a lambda-introducer. */
19422 {
19425 }
19426 else
19427 {
19432 }
19438 }
19439 else
19442 /* Parse the initializer. */
19445 /* If any clause is non-constant, so is the entire initializer. */
19449 /* If we have an ellipsis, this is an initializer pack
19450 expansion. */
19452 {
19453 /* Consume the `...'. */
19456 /* Turn the initializer into an initializer expansion. */
19458 }
19460 /* Add it to the vector. */
19463 /* If the next token is not a comma, we have reached the end of
19464 the list. */
19468 /* Peek at the next token. */
19470 /* If the next token is a `}', then we're still done. An
19471 initializer-clause can have a trailing `,' after the
19472 initializer-list and before the closing `}'. */
19476 /* Consume the `,' token. */
19478 }
19481 }
19483 /* Classes [gram.class] */
19485 /* Parse a class-name.
19487 class-name:
19488 identifier
19489 template-id
19491 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19492 to indicate that names looked up in dependent types should be
19493 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19494 keyword has been used to indicate that the name that appears next
19495 is a template. TAG_TYPE indicates the explicit tag given before
19496 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19497 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19498 is the class being defined in a class-head.
19500 Returns the TYPE_DECL representing the class. */
19502 static tree
19510 {
19511 tree decl;
19512 tree scope;
19517 /* All class-names start with an identifier. */
19520 {
19523 }
19525 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19526 to a template-id, so we save it here. */
19531 /* Any name names a type if we're following the `typename' keyword
19532 in a qualified name where the enclosing scope is type-dependent. */
19535 /* Handle the common case (an identifier, but not a template-id)
19536 efficiently. */
19539 {
19543 /* Look for the identifier. */
19547 /* If the next token isn't an identifier, we are certainly not
19548 looking at a class-name. */
19551 /* If we know this is a type-name, there's no need to look it
19552 up. */
19555 else
19556 {
19557 tree ambiguous_decls;
19558 /* If we already know that this lookup is ambiguous, then
19559 we've already issued an error message; there's no reason
19560 to check again. */
19562 {
19565 }
19566 /* If the next token is a `::', then the name must be a type
19567 name.
19569 [basic.lookup.qual]
19571 During the lookup for a name preceding the :: scope
19572 resolution operator, object, function, and enumerator
19573 names are ignored. */
19576 /* Look up the name. */
19578 tag_type,
19581 check_dependency_p,
19585 {
19589 }
19590 }
19591 }
19592 else
19593 {
19594 /* Try a template-id. */
19596 check_dependency_p,
19597 tag_type,
19598 is_declaration);
19601 }
19605 /* If this is a typename, create a TYPENAME_TYPE. */
19607 {
19612 }
19616 /* Check to see that it is really the name of a class. */
19620 /* Situations like this:
19622 template <typename T> struct A {
19623 typename T::template X<int>::I i;
19624 };
19626 are problematic. Is `T::template X<int>' a class-name? The
19627 standard does not seem to be definitive, but there is no other
19628 valid interpretation of the following `::'. Therefore, those
19629 names are considered class-names. */
19630 {
19634 }
19638 /* In Objective-C 2.0, a classname followed by '.' starts a
19639 dot-syntax expression, and it's not a type-name. */
19651 }
19653 /* Parse a class-specifier.
19655 class-specifier:
19656 class-head { member-specification [opt] }
19658 Returns the TREE_TYPE representing the class. */
19660 static tree
19662 {
19663 tree type;
19677 /* Parse the class-head. */
19680 /* If the class-head was a semantic disaster, skip the entire body
19681 of the class. */
19683 {
19687 }
19689 /* Look for the `{'. */
19691 {
19694 }
19698 /* Issue an error message if type-definitions are forbidden here. */
19700 /* Remember that we are defining one more class. */
19702 /* Inside the class, surrounding template-parameter-lists do not
19703 apply. */
19704 saved_num_template_parameter_lists
19707 /* We are not in a function body. */
19710 /* Or in a loop. */
19713 /* Or in a switch. */
19716 /* We are not immediately inside an extern "lang" block. */
19717 saved_in_unbraced_linkage_specification_p
19721 /* Start the class. */
19723 {
19726 }
19730 /* If the type is erroneous, skip the entire body of the class. */
19732 else
19733 /* Parse the member-specification. */
19736 /* Look for the trailing `}'. */
19738 /* Look for trailing attributes to apply to this class. */
19746 /* We've finished a type definition. Check for the common syntax
19747 error of forgetting a semicolon after the definition. We need to
19748 be careful, as we can't just check for not-a-semicolon and be done
19749 with it; the user might have typed:
19751 class X { } c = ...;
19752 class X { } *p = ...;
19754 and so forth. Instead, enumerate all the possible tokens that
19755 might follow this production; if we don't see one of them, then
19756 complain and silently insert the semicolon. */
19757 {
19762 /* Don't try to parse c++11 attributes here. As per the
19763 grammar, that should be a task for
19764 cp_parser_decl_specifier_seq. */
19768 {
19779 /* While it's legal for type qualifiers and storage class
19780 specifiers to follow type definitions in the grammar, only
19781 compiler testsuites contain code like that. Assume that if
19782 we see such code, then what we're really seeing is a case
19783 like:
19785 class X { }
19786 const <type> var = ...;
19788 or
19790 class Y { }
19791 static <type> func (...) ...
19793 i.e. the qualifier or specifier applies to the next
19794 declaration. To do so, however, we need to look ahead one
19795 more token to see if *that* token is a type specifier.
19797 This code could be improved to handle:
19799 class Z { }
19800 static const <type> var = ...; */
19803 {
19806 /* Handling user-defined types here would be nice, but very
19807 tricky. */
19808 want_semicolon
19811 }
19815 }
19817 /* If we don't have a type, then something is very wrong and we
19818 shouldn't try to do anything clever. Likewise for not seeing the
19819 closing brace. */
19821 {
19822 cp_token_position prev
19833 else
19836 /* Unget one token and smash it to look as though we encountered
19837 a semicolon in the input stream. */
19842 }
19843 }
19845 /* If this class is not itself within the scope of another class,
19846 then we need to parse the bodies of all of the queued function
19847 definitions. Note that the queued functions defined in a class
19848 are not always processed immediately following the
19849 class-specifier for that class. Consider:
19851 struct A {
19852 struct B { void f() { sizeof (A); } };
19853 };
19855 If `f' were processed before the processing of `A' were
19856 completed, there would be no way to compute the size of `A'.
19857 Note that the nesting we are interested in here is lexical --
19858 not the semantic nesting given by TYPE_CONTEXT. In particular,
19859 for:
19861 struct A { struct B; };
19862 struct A::B { void f() { } };
19864 there is no need to delay the parsing of `A::B::f'. */
19866 {
19867 tree decl;
19874 /* In a first pass, parse default arguments to the functions.
19875 Then, in a second pass, parse the bodies of the functions.
19876 This two-phased approach handles cases like:
19878 struct S {
19879 void f() { g(); }
19880 void g(int i = 3);
19881 };
19883 */
19885 {
19887 /* If there are default arguments that have not yet been processed,
19888 take care of them now. */
19890 {
19895 }
19896 /* Make sure that any template parameters are in scope. */
19898 /* Parse the default argument expressions. */
19900 /* Remove any template parameters from the symbol table. */
19902 }
19904 /* Now parse any NSDMIs. */
19908 {
19910 {
19915 }
19918 }
19925 /* Now do some post-NSDMI bookkeeping. */
19931 /* Now parse the body of the functions. */
19933 {
19934 /* OpenMP UDRs need to be parsed before all other functions. */
19941 }
19942 else
19946 }
19947 else
19950 /* Put back any saved access checks. */
19953 /* Restore saved state. */
19957 parser->num_template_parameter_lists
19959 parser->in_unbraced_linkage_specification_p
19963 }
19965 static tree
19967 {
19968 tree ret;
19973 }
19975 /* Parse a class-head.
19977 class-head:
19978 class-key identifier [opt] base-clause [opt]
19979 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19980 class-key nested-name-specifier [opt] template-id
19981 base-clause [opt]
19983 class-virt-specifier:
19984 final
19986 GNU Extensions:
19987 class-key attributes identifier [opt] base-clause [opt]
19988 class-key attributes nested-name-specifier identifier base-clause [opt]
19989 class-key attributes nested-name-specifier [opt] template-id
19990 base-clause [opt]
19992 Upon return BASES is initialized to the list of base classes (or
19993 NULL, if there are none) in the same form returned by
19994 cp_parser_base_clause.
19996 Returns the TYPE of the indicated class. Sets
19997 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19998 involving a nested-name-specifier was used, and FALSE otherwise.
20000 Returns error_mark_node if this is not a class-head.
20002 Returns NULL_TREE if the class-head is syntactically valid, but
20003 semantically invalid in a way that means we should skip the entire
20004 body of the class. */
20006 static tree
20009 {
20010 tree nested_name_specifier;
20014 tree attributes;
20015 tree bases;
20025 /* Assume no nested-name-specifier will be present. */
20027 /* Assume no template parameter lists will be used in defining the
20028 type. */
20032 /* Look for the class-key. */
20037 /* Parse the attributes. */
20040 /* If the next token is `::', that is invalid -- but sometimes
20041 people do try to write:
20043 struct ::S {};
20045 Handle this gracefully by accepting the extra qualifier, and then
20046 issuing an error about it later if this really is a
20047 class-head. If it turns out just to be an elaborated type
20048 specifier, remain silent. */
20054 /* Determine the name of the class. Begin by looking for an
20055 optional nested-name-specifier. */
20057 nested_name_specifier
20063 /* If there was a nested-name-specifier, then there *must* be an
20064 identifier. */
20066 {
20068 /* Although the grammar says `identifier', it really means
20069 `class-name' or `template-name'. You are only allowed to
20070 define a class that has already been declared with this
20071 syntax.
20073 The proposed resolution for Core Issue 180 says that wherever
20074 you see `class T::X' you should treat `X' as a type-name.
20076 It is OK to define an inaccessible class; for example:
20078 class A { class B; };
20079 class A::B {};
20081 We do not know if we will see a class-name, or a
20082 template-name. We look for a class-name first, in case the
20083 class-name is a template-id; if we looked for the
20084 template-name first we would stop after the template-name. */
20089 class_type,
20093 /* If that didn't work, ignore the nested-name-specifier. */
20095 {
20101 }
20102 /* If we could not find a corresponding TYPE, treat this
20103 declaration like an unqualified declaration. */
20106 /* Otherwise, count the number of templates used in TYPE and its
20107 containing scopes. */
20108 else
20109 {
20110 tree scope;
20122 }
20123 }
20124 /* Otherwise, the identifier is optional. */
20125 else
20126 {
20127 /* We don't know whether what comes next is a template-id,
20128 an identifier, or nothing at all. */
20130 /* Check for a template-id. */
20135 class_key,
20137 /* If that didn't work, it could still be an identifier. */
20139 {
20141 {
20144 }
20145 else
20147 }
20148 else
20149 {
20152 }
20153 }
20158 {
20160 class_key,
20162 }
20165 /* If it's not a `:' or a `{' then we can't really be looking at a
20166 class-head, since a class-head only appears as part of a
20167 class-specifier. We have to detect this situation before calling
20168 xref_tag, since that has irreversible side-effects. */
20170 {
20174 }
20176 /* At this point, we're going ahead with the class-specifier, even
20177 if some other problem occurs. */
20180 {
20185 }
20186 /* Issue the error about the overly-qualified name now. */
20188 {
20193 }
20195 {
20200 }
20202 {
20203 tree scope;
20205 /* Reject typedef-names in class heads. */
20207 {
20210 type);
20213 }
20215 /* Figure out in what scope the declaration is being placed. */
20217 /* If that scope does not contain the scope in which the
20218 class was originally declared, the program is invalid. */
20220 {
20223 "declaration of %qD in namespace %qD which does not "
20226 else
20232 }
20233 /* [dcl.meaning]
20235 A declarator-id shall not be qualified except for the
20236 definition of a ... nested class outside of its class
20237 ... [or] the definition or explicit instantiation of a
20238 class member of a namespace outside of its namespace. */
20240 {
20245 }
20246 }
20247 /* An explicit-specialization must be preceded by "template <>". If
20248 it is not, try to recover gracefully. */
20252 {
20256 /* Take the same action that would have been taken by
20257 cp_parser_explicit_specialization. */
20260 }
20261 /* There must be no "return" statements between this point and the
20262 end of this function; set "type "to the correct return value and
20263 use "goto done;" to return. */
20264 /* Make sure that the right number of template parameters were
20265 present. */
20269 {
20270 /* If something went wrong, there is no point in even trying to
20271 process the class-definition. */
20274 }
20276 /* Look up the type. */
20278 {
20282 {
20286 }
20287 else
20288 {
20291 }
20294 }
20296 {
20297 tree class_type;
20299 /* Given:
20301 template <typename T> struct S { struct T };
20302 template <typename T> struct S<T>::T { };
20304 we will get a TYPENAME_TYPE when processing the definition of
20305 `S::T'. We need to resolve it to the actual type before we
20306 try to define it. */
20308 {
20313 else
20314 {
20317 }
20318 }
20322 {
20325 }
20328 /* Enter the scope indicated by the nested-name-specifier. */
20330 /* Get the canonical version of this type. */
20332 /* Call push_template_decl if it seems like we should be defining a
20333 template either from the template headers or the type we're
20334 defining, so that we diagnose both extra and missing headers. */
20338 {
20341 {
20344 }
20345 }
20349 }
20351 {
20352 /* If the class was unnamed, create a dummy name. */
20357 }
20359 /* Indicate whether this class was declared as a `class' or as a
20360 `struct'. */
20365 /* If this type was already complete, and we see another definition,
20366 that's an error. */
20368 {
20370 type);
20372 type);
20375 }
20380 {
20381 /* Apply attributes now, before any use of the class as a template
20382 argument in its base list. */
20385 }
20387 /* We will have entered the scope containing the class; the names of
20388 base classes should be looked up in that context. For example:
20390 struct A { struct B {}; struct C; };
20391 struct A::C : B {};
20393 is valid. */
20395 /* Get the list of base-classes, if there is one. */
20397 {
20398 /* PR59482: enter the class scope so that base-specifiers are looked
20399 up correctly. */
20403 /* PR59482: get out of the previously pushed class scope so that the
20404 subsequent pops pop the right thing. */
20407 }
20408 else
20411 /* If we're really defining a class, process the base classes.
20412 If they're invalid, fail. */
20417 done:
20418 /* Leave the scope given by the nested-name-specifier. We will
20419 enter the class scope itself while processing the members. */
20424 {
20427 }
20433 out:
20436 }
20438 /* Parse a class-key.
20440 class-key:
20441 class
20442 struct
20443 union
20445 Returns the kind of class-key specified, or none_type to indicate
20446 error. */
20448 static enum tag_types
20450 {
20454 /* Look for the class-key. */
20459 /* Check to see if the TOKEN is a class-key. */
20464 }
20466 /* Parse a type-parameter-key.
20468 type-parameter-key:
20469 class
20470 typename
20471 */
20473 static void
20475 {
20476 /* Look for the type-parameter-key. */
20480 {
20483 /* typename is not allowed in a template template parameter
20484 by the standard until C++1Z. */
20486 "ISO C++ forbids typename key in template template parameter;"
20488 }
20489 else
20493 }
20495 /* Parse an (optional) member-specification.
20497 member-specification:
20498 member-declaration member-specification [opt]
20499 access-specifier : member-specification [opt] */
20501 static void
20503 {
20505 {
20509 /* Peek at the next token. */
20511 /* If it's a `}', or EOF then we've seen all the members. */
20517 /* See if this token is a keyword. */
20520 {
20524 /* Consume the access-specifier. */
20526 /* Remember which access-specifier is active. */
20528 /* Look for the `:'. */
20533 /* Accept #pragmas at class scope. */
20535 {
20538 }
20540 /* Otherwise, the next construction must be a
20541 member-declaration. */
20543 }
20544 }
20545 }
20547 /* Parse a member-declaration.
20549 member-declaration:
20550 decl-specifier-seq [opt] member-declarator-list [opt] ;
20551 function-definition ; [opt]
20552 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20553 using-declaration
20554 template-declaration
20555 alias-declaration
20557 member-declarator-list:
20558 member-declarator
20559 member-declarator-list , member-declarator
20561 member-declarator:
20562 declarator pure-specifier [opt]
20563 declarator constant-initializer [opt]
20564 identifier [opt] : constant-expression
20566 GNU Extensions:
20568 member-declaration:
20569 __extension__ member-declaration
20571 member-declarator:
20572 declarator attributes [opt] pure-specifier [opt]
20573 declarator attributes [opt] constant-initializer [opt]
20574 identifier [opt] attributes [opt] : constant-expression
20576 C++0x Extensions:
20578 member-declaration:
20579 static_assert-declaration */
20581 static void
20583 {
20584 cp_decl_specifier_seq decl_specifiers;
20585 tree prefix_attributes;
20586 tree decl;
20595 /* Check for the `__extension__' keyword. */
20597 {
20598 /* Recurse. */
20600 /* Restore the old value of the PEDANTIC flag. */
20604 }
20606 /* Check for a template-declaration. */
20608 {
20609 /* An explicit specialization here is an error condition, and we
20610 expect the specialization handler to detect and report this. */
20614 else
20618 }
20620 /* Check for a using-declaration. */
20622 {
20624 {
20625 /* Parse the using-declaration. */
20629 }
20630 else
20631 {
20632 tree decl;
20636 /* Note that if we actually see the '=' token after the
20637 identifier, cp_parser_alias_declaration commits the
20638 tentative parse. In that case, we really expects an
20639 alias-declaration. Otherwise, we expect a using
20640 declaration. */
20641 alias_decl_expected =
20647 else
20651 }
20652 }
20654 /* Check for @defs. */
20656 {
20661 {
20666 }
20668 }
20670 /* If the next token is `static_assert' we have a static assertion. */
20672 {
20675 }
20682 /* Parse the decl-specifier-seq. */
20685 CP_PARSER_FLAGS_OPTIONAL,
20688 /* Check for an invalid type-name. */
20692 /* If there is no declarator, then the decl-specifier-seq should
20693 specify a type. */
20695 {
20696 /* If there was no decl-specifier-seq, and the next token is a
20697 `;', then we have something like:
20699 struct S { ; };
20701 [class.mem]
20703 Each member-declaration shall declare at least one member
20704 name of the class. */
20706 {
20710 }
20711 else
20712 {
20713 tree type;
20715 /* See if this declaration is a friend. */
20717 /* If there were decl-specifiers, check to see if there was
20718 a class-declaration. */
20721 /* Nested classes have already been added to the class, but
20722 a `friend' needs to be explicitly registered. */
20724 {
20725 /* If the `friend' keyword was present, the friend must
20726 be introduced with a class-key. */
20729 "in C++03 a class-key must be used "
20731 /* In this case:
20733 template <typename T> struct A {
20734 friend struct A<T>::B;
20735 };
20737 A<T>::B will be represented by a TYPENAME_TYPE, and
20738 therefore not recognized by check_tag_decl. */
20740 {
20744 }
20747 "friend declaration does not name a class or "
20749 else
20752 }
20753 /* If there is no TYPE, an error message will already have
20754 been issued. */
20756 ;
20757 /* An anonymous aggregate has to be handled specially; such
20758 a declaration really declares a data member (with a
20759 particular type), as opposed to a nested class. */
20761 {
20762 /* C++11 9.5/6. */
20765 "a storage class on an anonymous aggregate "
20768 /* Remove constructors and such from TYPE, now that we
20769 know it is an anonymous aggregate. */
20771 /* And make the corresponding data member. */
20774 /* Add it to the class. */
20776 }
20777 else
20778 cp_parser_check_access_in_redeclaration
20781 }
20782 }
20783 else
20784 {
20787 /* Clear attributes from the decl_specifiers but keep them
20788 around as prefix attributes that apply them to the entity
20789 being declared. */
20793 /* See if these declarations will be friends. */
20796 /* Keep going until we hit the `;' at the end of the
20797 declaration. */
20799 {
20801 tree first_attribute;
20803 /* Peek at the next token. */
20806 /* Check for a bitfield declaration. */
20811 {
20812 tree identifier;
20813 tree width;
20815 /* Get the name of the bitfield. Note that we cannot just
20816 check TOKEN here because it may have been invalidated by
20817 the call to cp_lexer_peek_nth_token above. */
20820 else
20823 /* Consume the `:' token. */
20825 /* Get the width of the bitfield. */
20826 width
20829 /* Look for attributes that apply to the bitfield. */
20831 /* Remember which attributes are prefix attributes and
20832 which are not. */
20834 /* Combine the attributes. */
20837 /* Create the bitfield declaration. */
20840 identifier,
20841 sfk_none)
20844 width,
20845 attributes);
20846 }
20847 else
20848 {
20850 tree initializer;
20851 tree asm_specification;
20854 /* Parse the declarator. */
20855 declarator
20860 friend_p);
20862 /* If something went wrong parsing the declarator, make sure
20863 that we at least consume some tokens. */
20865 {
20866 /* Skip to the end of the statement. */
20868 /* If the next token is not a semicolon, that is
20869 probably because we just skipped over the body of
20870 a function. So, we consume a semicolon if
20871 present, but do not issue an error message if it
20872 is not present. */
20874 CPP_SEMICOLON))
20877 }
20880 cp_parser_check_for_definition_in_return_type
20884 /* Look for an asm-specification. */
20886 /* Look for attributes that apply to the declaration. */
20888 /* Remember which attributes are prefix attributes and
20889 which are not. */
20891 /* Combine the attributes. */
20894 /* If it's an `=', then we have a constant-initializer or a
20895 pure-specifier. It is not correct to parse the
20896 initializer before registering the member declaration
20897 since the member declaration should be in scope while
20898 its initializer is processed. However, the rest of the
20899 front end does not yet provide an interface that allows
20900 us to handle this correctly. */
20902 {
20903 /* In [class.mem]:
20905 A pure-specifier shall be used only in the declaration of
20906 a virtual function.
20908 A member-declarator can contain a constant-initializer
20909 only if it declares a static member of integral or
20910 enumeration type.
20912 Therefore, if the DECLARATOR is for a function, we look
20913 for a pure-specifier; otherwise, we look for a
20914 constant-initializer. When we call `grokfield', it will
20915 perform more stringent semantics checks. */
20927 {
20929 /* Don't require a constant rvalue in C++11, since we
20930 might want a reference constant. We'll enforce
20931 constancy later. */
20933 /* Parse the initializer. */
20936 }
20937 else
20938 /* Parse the initializer. */
20940 }
20943 {
20947 else
20949 }
20950 /* Otherwise, there is no initializer. */
20951 else
20954 /* See if we are probably looking at a function
20955 definition. We are certainly not looking at a
20956 member-declarator. Calling `grokfield' has
20957 side-effects, so we must not do it unless we are sure
20958 that we are looking at a member-declarator. */
20961 {
20962 /* The grammar does not allow a pure-specifier to be
20963 used when a member function is defined. (It is
20964 possible that this fact is an oversight in the
20965 standard, since a pure function may be defined
20966 outside of the class-specifier. */
20972 declarator,
20973 attributes);
20976 /* If the member was not a friend, declare it here. */
20979 /* Peek at the next token. */
20981 /* If the next token is a semicolon, consume it. */
20985 }
20986 else
20989 /* Create the declaration. */
20994 {
20997 else
20999 }
21000 }
21004 /* Reset PREFIX_ATTRIBUTES. */
21010 /* If there is any qualification still in effect, clear it
21011 now; we will be starting fresh with the next declarator. */
21015 /* If it's a `,', then there are more declarators. */
21017 {
21020 {
21024 }
21025 }
21026 /* If the next token isn't a `;', then we have a parse error. */
21028 CPP_SEMICOLON))
21029 {
21030 /* The next token might be a ways away from where the
21031 actual semicolon is missing. Find the previous token
21032 and use that for our error position. */
21037 /* Assume that the user meant to provide a semicolon. If
21038 we were to cp_parser_skip_to_end_of_statement, we might
21039 skip to a semicolon inside a member function definition
21040 and issue nonsensical error messages. */
21042 }
21045 {
21046 /* Add DECL to the list of members. */
21055 /* Add DECL to the queue of NSDMI to be parsed later. */
21057 }
21061 }
21062 }
21065 out:
21067 }
21069 /* Parse a pure-specifier.
21071 pure-specifier:
21072 = 0
21074 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21075 Otherwise, ERROR_MARK_NODE is returned. */
21077 static tree
21079 {
21082 /* Look for the `=' token. */
21085 /* Look for the `0' token. */
21094 /* Accept = default or = delete in c++0x mode. */
21097 {
21100 }
21102 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21104 {
21109 }
21111 {
21114 }
21117 }
21119 /* Parse a constant-initializer.
21121 constant-initializer:
21122 = constant-expression
21124 Returns a representation of the constant-expression. */
21126 static tree
21128 {
21129 /* Look for the `=' token. */
21133 /* It is invalid to write:
21135 struct S { static const int i = { 7 }; };
21137 */
21139 {
21142 /* Consume the opening brace. */
21144 /* Skip the initializer. */
21146 /* Look for the trailing `}'. */
21150 }
21153 }
21155 /* Derived classes [gram.class.derived] */
21157 /* Parse a base-clause.
21159 base-clause:
21160 : base-specifier-list
21162 base-specifier-list:
21163 base-specifier ... [opt]
21164 base-specifier-list , base-specifier ... [opt]
21166 Returns a TREE_LIST representing the base-classes, in the order in
21167 which they were declared. The representation of each node is as
21168 described by cp_parser_base_specifier.
21170 In the case that no bases are specified, this function will return
21171 NULL_TREE, not ERROR_MARK_NODE. */
21173 static tree
21175 {
21178 /* Look for the `:' that begins the list. */
21181 /* Scan the base-specifier-list. */
21183 {
21185 tree base;
21188 /* Look for the base-specifier. */
21190 /* Look for the (optional) ellipsis. */
21192 {
21193 /* Consume the `...'. */
21197 }
21199 /* Add BASE to the front of the list. */
21201 {
21203 /* Make this a pack expansion type. */
21207 {
21210 }
21211 }
21212 /* Peek at the next token. */
21214 /* If it's not a comma, then the list is complete. */
21217 /* Consume the `,'. */
21219 }
21221 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21222 base class had a qualified name. However, the next name that
21223 appears is certainly not qualified. */
21229 }
21231 /* Parse a base-specifier.
21233 base-specifier:
21234 :: [opt] nested-name-specifier [opt] class-name
21235 virtual access-specifier [opt] :: [opt] nested-name-specifier
21236 [opt] class-name
21237 access-specifier virtual [opt] :: [opt] nested-name-specifier
21238 [opt] class-name
21240 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21241 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21242 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21243 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21245 static tree
21247 {
21255 tree type;
21257 /* Process the optional `virtual' and `access-specifier'. */
21259 {
21260 /* Peek at the next token. */
21262 /* Process `virtual'. */
21264 {
21266 /* If `virtual' appears more than once, issue an error. */
21268 {
21272 }
21276 /* Consume the `virtual' token. */
21284 /* If more than one access specifier appears, issue an
21285 error. */
21288 {
21292 }
21296 /* Consume the access-specifier. */
21304 }
21305 }
21306 /* It is not uncommon to see programs mechanically, erroneously, use
21307 the 'typename' keyword to denote (dependent) qualified types
21308 as base classes. */
21310 {
21315 else
21317 "keyword %<typename%> not allowed in this context "
21320 }
21322 /* Look for the optional `::' operator. */
21324 /* Look for the nested-name-specifier. The simplest way to
21325 implement:
21327 [temp.res]
21329 The keyword `typename' is not permitted in a base-specifier or
21330 mem-initializer; in these contexts a qualified name that
21331 depends on a template-parameter is implicitly assumed to be a
21332 type name.
21334 is to pretend that we have seen the `typename' keyword at this
21335 point. */
21339 typename_type,
21341 /* If the base class is given by a qualified name, assume that names
21342 we see are type names or templates, as appropriate. */
21348 /* DR 950 allows decltype as a base-specifier. */
21350 else
21351 {
21352 /* Otherwise, look for the class-name. */
21354 class_scope_p,
21355 template_p,
21356 typename_type,
21361 }
21367 }
21369 /* Exception handling [gram.exception] */
21371 /* Parse an (optional) noexcept-specification.
21373 noexcept-specification:
21374 noexcept ( constant-expression ) [opt]
21376 If no noexcept-specification is present, returns NULL_TREE.
21377 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21378 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21379 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21380 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21381 in which case a boolean condition is returned instead. */
21383 static tree
21388 {
21392 /* Peek at the next token. */
21395 /* Is it a noexcept-specification? */
21397 {
21398 tree expr;
21402 {
21406 {
21407 /* Types may not be defined in an exception-specification. */
21409 parser->type_definition_forbidden_message
21414 /* Restore the saved message. */
21416 }
21417 else
21418 {
21421 }
21424 }
21425 else
21426 {
21430 }
21432 /* We cannot build a noexcept-spec right away because this will check
21433 that expr is a constexpr. */
21436 else
21438 }
21439 else
21441 }
21443 /* Parse an (optional) exception-specification.
21445 exception-specification:
21446 throw ( type-id-list [opt] )
21448 Returns a TREE_LIST representing the exception-specification. The
21449 TREE_VALUE of each node is a type. */
21451 static tree
21453 {
21455 tree type_id_list;
21458 /* Peek at the next token. */
21461 /* Is it a noexcept-specification? */
21467 /* If it's not `throw', then there's no exception-specification. */
21471 #if 0
21472 /* Enable this once a lot of code has transitioned to noexcept? */
21476 #endif
21478 /* Consume the `throw'. */
21481 /* Look for the `('. */
21484 /* Peek at the next token. */
21486 /* If it's not a `)', then there is a type-id-list. */
21488 {
21489 /* Types may not be defined in an exception-specification. */
21491 parser->type_definition_forbidden_message
21493 /* Parse the type-id-list. */
21495 /* Restore the saved message. */
21497 }
21498 else
21501 /* Look for the `)'. */
21505 }
21507 /* Parse an (optional) type-id-list.
21509 type-id-list:
21510 type-id ... [opt]
21511 type-id-list , type-id ... [opt]
21513 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21514 in the order that the types were presented. */
21516 static tree
21518 {
21522 {
21524 tree type;
21526 /* Get the next type-id. */
21528 /* Parse the optional ellipsis. */
21530 {
21531 /* Consume the `...'. */
21534 /* Turn the type into a pack expansion expression. */
21536 }
21537 /* Add it to the list. */
21539 /* Peek at the next token. */
21541 /* If it is not a `,', we are done. */
21544 /* Consume the `,'. */
21546 }
21549 }
21551 /* Parse a try-block.
21553 try-block:
21554 try compound-statement handler-seq */
21556 static tree
21558 {
21559 tree try_block;
21573 }
21575 /* Parse a function-try-block.
21577 function-try-block:
21578 try ctor-initializer [opt] function-body handler-seq */
21580 static bool
21582 {
21583 tree compound_stmt;
21584 tree try_block;
21587 /* Look for the `try' keyword. */
21590 /* Let the rest of the front end know where we are. */
21592 /* Parse the function-body. */
21593 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21595 /* We're done with the `try' part. */
21597 /* Parse the handlers. */
21599 /* We're done with the handlers. */
21603 }
21605 /* Parse a handler-seq.
21607 handler-seq:
21608 handler handler-seq [opt] */
21610 static void
21612 {
21614 {
21617 /* Parse the handler. */
21619 /* Peek at the next token. */
21621 /* If it's not `catch' then there are no more handlers. */
21624 }
21625 }
21627 /* Parse a handler.
21629 handler:
21630 catch ( exception-declaration ) compound-statement */
21632 static void
21634 {
21635 tree handler;
21636 tree declaration;
21646 }
21648 /* Parse an exception-declaration.
21650 exception-declaration:
21651 type-specifier-seq declarator
21652 type-specifier-seq abstract-declarator
21653 type-specifier-seq
21654 ...
21656 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21657 ellipsis variant is used. */
21659 static tree
21661 {
21662 cp_decl_specifier_seq type_specifiers;
21666 /* If it's an ellipsis, it's easy to handle. */
21668 {
21669 /* Consume the `...' token. */
21672 }
21674 /* Types may not be defined in exception-declarations. */
21676 parser->type_definition_forbidden_message
21679 /* Parse the type-specifier-seq. */
21683 /* If it's a `)', then there is no declarator. */
21686 else
21693 /* Restore the saved message. */
21700 }
21702 /* Parse a throw-expression.
21704 throw-expression:
21705 throw assignment-expression [opt]
21707 Returns a THROW_EXPR representing the throw-expression. */
21709 static tree
21711 {
21712 tree expression;
21717 /* Figure out whether or not there is an assignment-expression
21718 following the "throw" keyword. */
21726 else
21730 }
21732 /* GNU Extensions */
21734 /* Parse an (optional) asm-specification.
21736 asm-specification:
21737 asm ( string-literal )
21739 If the asm-specification is present, returns a STRING_CST
21740 corresponding to the string-literal. Otherwise, returns
21741 NULL_TREE. */
21743 static tree
21745 {
21747 tree asm_specification;
21749 /* Peek at the next token. */
21751 /* If the next token isn't the `asm' keyword, then there's no
21752 asm-specification. */
21756 /* Consume the `asm' token. */
21758 /* Look for the `('. */
21761 /* Look for the string-literal. */
21764 /* Look for the `)'. */
21768 }
21770 /* Parse an asm-operand-list.
21772 asm-operand-list:
21773 asm-operand
21774 asm-operand-list , asm-operand
21776 asm-operand:
21777 string-literal ( expression )
21778 [ string-literal ] string-literal ( expression )
21780 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21781 each node is the expression. The TREE_PURPOSE is itself a
21782 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21783 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21784 is a STRING_CST for the string literal before the parenthesis. Returns
21785 ERROR_MARK_NODE if any of the operands are invalid. */
21787 static tree
21789 {
21794 {
21795 tree string_literal;
21796 tree expression;
21797 tree name;
21800 {
21801 /* Consume the `[' token. */
21803 /* Read the operand name. */
21808 /* Look for the closing `]'. */
21810 }
21811 else
21813 /* Look for the string-literal. */
21816 /* Look for the `('. */
21818 /* Parse the expression. */
21820 /* Look for the `)'. */
21828 /* Add this operand to the list. */
21830 expression,
21831 asm_operands);
21832 /* If the next token is not a `,', there are no more
21833 operands. */
21836 /* Consume the `,'. */
21838 }
21841 }
21843 /* Parse an asm-clobber-list.
21845 asm-clobber-list:
21846 string-literal
21847 asm-clobber-list , string-literal
21849 Returns a TREE_LIST, indicating the clobbers in the order that they
21850 appeared. The TREE_VALUE of each node is a STRING_CST. */
21852 static tree
21854 {
21858 {
21859 tree string_literal;
21861 /* Look for the string literal. */
21863 /* Add it to the list. */
21865 /* If the next token is not a `,', then the list is
21866 complete. */
21869 /* Consume the `,' token. */
21871 }
21874 }
21876 /* Parse an asm-label-list.
21878 asm-label-list:
21879 identifier
21880 asm-label-list , identifier
21882 Returns a TREE_LIST, indicating the labels in the order that they
21883 appeared. The TREE_VALUE of each node is a label. */
21885 static tree
21887 {
21891 {
21894 /* Look for the identifier. */
21897 {
21900 {
21906 }
21907 }
21908 /* If the next token is not a `,', then the list is
21909 complete. */
21912 /* Consume the `,' token. */
21914 }
21917 }
21919 /* Return TRUE iff the next tokens in the stream are possibly the
21920 beginning of a GNU extension attribute. */
21922 static bool
21924 {
21926 }
21928 /* Return TRUE iff the next tokens in the stream are possibly the
21929 beginning of a standard C++-11 attribute specifier. */
21931 static bool
21933 {
21935 }
21937 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21938 beginning of a standard C++-11 attribute specifier. */
21940 static bool
21942 {
21950 }
21952 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21953 beginning of a GNU extension attribute. */
21955 static bool
21957 {
21961 }
21963 /* Return true iff the next tokens can be the beginning of either a
21964 GNU attribute list, or a standard C++11 attribute sequence. */
21966 static bool
21968 {
21971 }
21973 /* Return true iff the next Nth tokens can be the beginning of either
21974 a GNU attribute list, or a standard C++11 attribute sequence. */
21976 static bool
21978 {
21981 }
21983 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21984 of GNU attributes, or return NULL. */
21986 static tree
21988 {
21992 }
21994 #define CILK_SIMD_FN_CLAUSE_MASK \
21995 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
21996 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
21997 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
21998 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
21999 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22001 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22002 vector [(<clauses>)] */
22004 static void
22006 {
22010 {
22015 }
22018 {
22021 paren_scope++;
22022 }
22024 {
22027 paren_scope++;
22029 paren_scope--;
22030 /* Do not push the last ')' */
22033 }
22042 }
22044 /* Parse an (optional) series of attributes.
22046 attributes:
22047 attributes attribute
22049 attribute:
22050 __attribute__ (( attribute-list [opt] ))
22052 The return value is as for cp_parser_gnu_attribute_list. */
22054 static tree
22056 {
22060 {
22062 tree attribute_list;
22065 /* Peek at the next token. */
22067 /* If it's not `__attribute__', then we're done. */
22071 /* Consume the `__attribute__' keyword. */
22073 /* Look for the two `(' tokens. */
22077 /* Peek at the next token. */
22080 /* Parse the attribute-list. */
22082 else
22083 /* If the next token is a `)', then there is no attribute
22084 list. */
22087 /* Look for the two `)' tokens. */
22095 /* Add these new attributes to the list. */
22097 }
22100 }
22102 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22103 "__vector" or "__vector__." */
22107 {
22111 }
22113 /* Parse a GNU attribute-list.
22115 attribute-list:
22116 attribute
22117 attribute-list , attribute
22119 attribute:
22120 identifier
22121 identifier ( identifier )
22122 identifier ( identifier , expression-list )
22123 identifier ( expression-list )
22125 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22126 to an attribute. The TREE_PURPOSE of each node is the identifier
22127 indicating which attribute is in use. The TREE_VALUE represents
22128 the arguments, if any. */
22130 static tree
22132 {
22138 {
22140 tree identifier;
22141 tree attribute;
22143 /* Look for the identifier. We also allow keywords here; for
22144 example `__attribute__ ((const))' is legal. */
22148 {
22151 /* Consume the token, but save it since we need it for the
22152 SIMD enabled function parsing. */
22155 /* Save away the identifier that indicates which attribute
22156 this is. */
22158 /* For keywords, use the canonical spelling, not the
22159 parsed identifier. */
22165 /* Peek at the next token. */
22167 /* If it's an `(', then parse the attribute arguments. */
22169 {
22174 {
22177 }
22178 else
22179 vec = cp_parser_parenthesized_expression_list
22185 else
22186 {
22189 }
22190 /* Save the arguments away. */
22192 }
22194 {
22197 }
22200 {
22201 /* Add this attribute to the list. */
22204 }
22207 }
22208 /* Now, look for more attributes. If the next token isn't a
22209 `,', we're done. */
22213 /* Consume the comma and keep going. */
22215 }
22218 /* We built up the list in reverse order. */
22220 }
22222 /* Parse a standard C++11 attribute.
22224 The returned representation is a TREE_LIST which TREE_PURPOSE is
22225 the scoped name of the attribute, and the TREE_VALUE is its
22226 arguments list.
22228 Note that the scoped name of the attribute is itself a TREE_LIST
22229 which TREE_PURPOSE is the namespace of the attribute, and
22230 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22231 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22232 and which TREE_PURPOSE is directly the attribute name.
22234 Clients of the attribute code should use get_attribute_namespace
22235 and get_attribute_name to get the actual namespace and name of
22236 attributes, regardless of their being GNU or C++11 attributes.
22238 attribute:
22239 attribute-token attribute-argument-clause [opt]
22241 attribute-token:
22242 identifier
22243 attribute-scoped-token
22245 attribute-scoped-token:
22246 attribute-namespace :: identifier
22248 attribute-namespace:
22249 identifier
22251 attribute-argument-clause:
22252 ( balanced-token-seq )
22254 balanced-token-seq:
22255 balanced-token [opt]
22256 balanced-token-seq balanced-token
22258 balanced-token:
22259 ( balanced-token-seq )
22260 [ balanced-token-seq ]
22261 { balanced-token-seq }. */
22263 static tree
22265 {
22269 /* First, parse name of the the attribute, a.k.a
22270 attribute-token. */
22287 {
22288 /* We are seeing a scoped attribute token. */
22298 else
22299 {
22303 }
22305 NULL_TREE);
22307 }
22308 else
22309 {
22311 NULL_TREE);
22312 /* C++11 noreturn attribute is equivalent to GNU's. */
22315 /* C++14 deprecated attribute is equivalent to GNU's. */
22317 {
22320 "%<deprecated%> is a C++14 feature;"
22323 }
22324 }
22326 /* Now parse the optional argument clause of the attribute. */
22331 {
22337 /* A GNU attribute that takes an identifier in parameter. */
22340 vec = cp_parser_parenthesized_expression_list
22346 else
22347 {
22350 }
22354 else
22356 }
22359 }
22361 /* Parse a list of standard C++-11 attributes.
22363 attribute-list:
22364 attribute [opt]
22365 attribute-list , attribute[opt]
22366 attribute ...
22367 attribute-list , attribute ...
22368 */
22370 static tree
22372 {
22377 {
22382 {
22385 }
22390 }
22393 }
22395 /* Parse a standard C++-11 attribute specifier.
22397 attribute-specifier:
22398 [ [ attribute-list ] ]
22399 alignment-specifier
22401 alignment-specifier:
22402 alignas ( type-id ... [opt] )
22403 alignas ( alignment-expression ... [opt] ). */
22405 static tree
22407 {
22413 {
22422 else
22423 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22424 when we are sure that we have actually parsed them. */
22426 }
22427 else
22428 {
22429 tree alignas_expr;
22431 /* Look for an alignment-specifier. */
22443 {
22446 }
22452 {
22456 alignas_expr =
22463 }
22466 {
22469 }
22473 /* Build the C++-11 representation of an 'aligned'
22474 attribute. */
22475 attributes =
22479 }
22482 }
22484 /* Parse a standard C++-11 attribute-specifier-seq.
22486 attribute-specifier-seq:
22487 attribute-specifier-seq [opt] attribute-specifier
22488 */
22490 static tree
22492 {
22496 {
22505 }
22509 }
22511 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22512 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22513 current value of the PEDANTIC flag, regardless of whether or not
22514 the `__extension__' keyword is present. The caller is responsible
22515 for restoring the value of the PEDANTIC flag. */
22517 static bool
22519 {
22520 /* Save the old value of the PEDANTIC flag. */
22524 {
22525 /* Consume the `__extension__' token. */
22527 /* We're not being pedantic while the `__extension__' keyword is
22528 in effect. */
22532 }
22535 }
22537 /* Parse a label declaration.
22539 label-declaration:
22540 __label__ label-declarator-seq ;
22542 label-declarator-seq:
22543 identifier , label-declarator-seq
22544 identifier */
22546 static void
22548 {
22549 /* Look for the `__label__' keyword. */
22553 {
22554 tree identifier;
22556 /* Look for an identifier. */
22558 /* If we failed, stop. */
22561 /* Declare it as a label. */
22563 /* If the next token is a `;', stop. */
22566 /* Look for the `,' separating the label declarations. */
22568 }
22570 /* Look for the final `;'. */
22572 }
22574 /* Support Functions */
22576 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22577 NAME should have one of the representations used for an
22578 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22579 is returned. If PARSER->SCOPE is a dependent type, then a
22580 SCOPE_REF is returned.
22582 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22583 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22584 was formed. Abstractly, such entities should not be passed to this
22585 function, because they do not need to be looked up, but it is
22586 simpler to check for this special case here, rather than at the
22587 call-sites.
22589 In cases not explicitly covered above, this function returns a
22590 DECL, OVERLOAD, or baselink representing the result of the lookup.
22591 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22592 is returned.
22594 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22595 (e.g., "struct") that was used. In that case bindings that do not
22596 refer to types are ignored.
22598 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22599 ignored.
22601 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22602 are ignored.
22604 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22605 types.
22607 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22608 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22609 NULL_TREE otherwise. */
22611 static tree
22618 location_t name_location)
22619 {
22620 tree decl;
22623 /* Assume that the lookup will be unambiguous. */
22627 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22628 no longer valid. Note that if we are parsing tentatively, and
22629 the parse fails, OBJECT_TYPE will be automatically restored. */
22635 /* A template-id has already been resolved; there is no lookup to
22636 do. */
22640 {
22644 }
22646 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22647 it should already have been checked to make sure that the name
22648 used matches the type being destroyed. */
22650 {
22651 tree type;
22653 /* Figure out to which type this destructor applies. */
22658 else
22660 /* If that's not a class type, there is no destructor. */
22667 /* If it was a class type, return the destructor. */
22669 }
22671 /* By this point, the NAME should be an ordinary identifier. If
22672 the id-expression was a qualified name, the qualifying scope is
22673 stored in PARSER->SCOPE at this point. */
22676 /* Perform the lookup. */
22678 {
22684 /* If the SCOPE is dependent, the lookup must be deferred until
22685 the template is instantiated -- unless we are explicitly
22686 looking up names in uninstantiated templates. Even then, we
22687 cannot look up the name if the scope is not a class type; it
22688 might, for example, be a template type parameter. */
22693 /* Defer lookup. */
22695 else
22696 {
22699 /* If PARSER->SCOPE is a dependent type, then it must be a
22700 class type, and we must not be checking dependencies;
22701 otherwise, we would have processed this lookup above. So
22702 that PARSER->SCOPE is not considered a dependent base by
22703 lookup_member, we must enter the scope here. */
22707 /* If the PARSER->SCOPE is a template specialization, it
22708 may be instantiated during name lookup. In that case,
22709 errors may be issued. Even if we rollback the current
22710 tentative parse, those errors are valid. */
22715 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22716 lookup result and the nested-name-specifier nominates a class C:
22717 * if the name specified after the nested-name-specifier, when
22718 looked up in C, is the injected-class-name of C (Clause 9), or
22719 * if the name specified after the nested-name-specifier is the
22720 same as the identifier or the simple-template-id's template-
22721 name in the last component of the nested-name-specifier,
22722 the name is instead considered to name the constructor of
22723 class C. [ Note: for example, the constructor is not an
22724 acceptable lookup result in an elaborated-type-specifier so
22725 the constructor would not be used in place of the
22726 injected-class-name. --end note ] Such a constructor name
22727 shall be used only in the declarator-id of a declaration that
22728 names a constructor or in a using-declaration. */
22736 /* If we have a single function from a using decl, pull it out. */
22743 }
22745 /* If the scope is a dependent type and either we deferred lookup or
22746 we did lookup but didn't find the name, rememeber the name. */
22749 {
22751 {
22752 tree type;
22754 /* The resolution to Core Issue 180 says that `struct
22755 A::B' should be considered a type-name, even if `A'
22756 is dependent. */
22761 }
22765 CPP_CLOSE_PAREN)))
22769 else
22772 is_template);
22773 }
22776 }
22778 {
22779 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22780 OBJECT_TYPE is not a class. */
22782 /* If the OBJECT_TYPE is a template specialization, it may
22783 be instantiated during name lookup. In that case, errors
22784 may be issued. Even if we rollback the current tentative
22785 parse, those errors are valid. */
22787 name,
22790 tf_warning_or_error);
22791 else
22795 /* Look it up in the enclosing context. */
22801 }
22802 else
22803 {
22809 }
22811 /* If the lookup failed, let our caller know. */
22815 /* Pull out the template from an injected-class-name (or multiple). */
22819 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22821 {
22824 /* The error message we have to print is too complicated for
22825 cp_parser_error, so we incorporate its actions directly. */
22827 {
22829 name);
22831 }
22833 }
22841 /* If we have resolved the name of a member declaration, check to
22842 see if the declaration is accessible. When the name resolves to
22843 set of overloaded functions, accessibility is checked when
22844 overload resolution is done.
22846 During an explicit instantiation, access is not checked at all,
22847 as per [temp.explicit]. */
22854 }
22856 /* Like cp_parser_lookup_name, but for use in the typical case where
22857 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22858 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22860 static tree
22862 {
22864 none_type,
22869 location);
22870 }
22872 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22873 the current context, return the TYPE_DECL. If TAG_NAME_P is
22874 true, the DECL indicates the class being defined in a class-head,
22875 or declared in an elaborated-type-specifier.
22877 Otherwise, return DECL. */
22879 static tree
22881 {
22882 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22883 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22885 struct A {
22886 template <typename T> struct B;
22887 };
22889 template <typename T> struct A::B {};
22891 Similarly, in an elaborated-type-specifier:
22893 namespace N { struct X{}; }
22895 struct A {
22896 template <typename T> friend struct N::X;
22897 };
22899 However, if the DECL refers to a class type, and we are in
22900 the scope of the class, then the name lookup automatically
22901 finds the TYPE_DECL created by build_self_reference rather
22902 than a TEMPLATE_DECL. For example, in:
22904 template <class T> struct S {
22905 S s;
22906 };
22908 there is no need to handle such case. */
22914 }
22916 /* If too many, or too few, template-parameter lists apply to the
22917 declarator, issue an error message. Returns TRUE if all went well,
22918 and FALSE otherwise. */
22920 static bool
22923 location_t declarator_location)
22924 {
22926 {
22928 {
22936 /* If the DECLARATOR has the form `X<y>' then it uses one
22937 additional level of template parameters. */
22940 return cp_parser_check_template_parameters
22942 }
22957 }
22959 }
22961 /* NUM_TEMPLATES were used in the current declaration. If that is
22962 invalid, return FALSE and issue an error messages. Otherwise,
22963 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22964 declarator and we can print more accurate diagnostics. */
22966 static bool
22969 location_t location,
22971 {
22972 /* If there are the same number of template classes and parameter
22973 lists, that's OK. */
22976 /* If there are more, but only one more, then we are referring to a
22977 member template. That's OK too. */
22980 /* If there are more template classes than parameter lists, we have
22981 something like:
22983 template <class T> void S<T>::R<T>::f (); */
22985 {
22995 else
22998 }
22999 /* Otherwise, there are too many template parameter lists. We have
23000 something like:
23002 template <class T> template <class U> void S::f(); */
23005 }
23007 /* Parse an optional `::' token indicating that the following name is
23008 from the global namespace. If so, PARSER->SCOPE is set to the
23009 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23010 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23011 Returns the new value of PARSER->SCOPE, if the `::' token is
23012 present, and NULL_TREE otherwise. */
23014 static tree
23016 {
23019 /* Peek at the next token. */
23021 /* If we're looking at a `::' token then we're starting from the
23022 global namespace, not our current location. */
23024 {
23025 /* Consume the `::' token. */
23027 /* Set the SCOPE so that we know where to start the lookup. */
23033 }
23035 {
23039 }
23042 }
23044 /* Returns TRUE if the upcoming token sequence is the start of a
23045 constructor declarator. If FRIEND_P is true, the declarator is
23046 preceded by the `friend' specifier. */
23048 static bool
23050 {
23053 tree nested_name_specifier;
23056 /* The common case is that this is not a constructor declarator, so
23057 try to avoid doing lots of work if at all possible. It's not
23058 valid declare a constructor at function scope. */
23061 /* And only certain tokens can begin a constructor declarator. */
23069 /* Parse tentatively; we are going to roll back all of the tokens
23070 consumed here. */
23072 /* Assume that we are looking at a constructor declarator. */
23075 /* Look for the optional `::' operator. */
23078 /* Look for the nested-name-specifier. */
23079 nested_name_specifier
23090 /* Outside of a class-specifier, there must be a
23091 nested-name-specifier. */
23097 /* If we have a class scope, this is easy; DR 147 says that S::S always
23098 names the constructor, and no other qualified name could. */
23101 {
23111 }
23112 /* If we still think that this might be a constructor-declarator,
23113 look for a class-name. */
23115 {
23116 /* If we have:
23118 template <typename T> struct S {
23119 S();
23120 };
23122 we must recognize that the nested `S' names a class. */
23123 tree type_decl;
23127 none_type,
23131 /* If there was no class-name, then this is not a constructor.
23132 Otherwise, if we are in a class-specifier and we aren't
23133 handling a friend declaration, check that its type matches
23134 current_class_type (c++/38313). Note: error_mark_node
23135 is left alone for error recovery purposes. */
23137 && (outside_class_specifier_p
23142 /* If we're still considering a constructor, we have to see a `(',
23143 to begin the parameter-declaration-clause, followed by either a
23144 `)', an `...', or a decl-specifier. We need to check for a
23145 type-specifier to avoid being fooled into thinking that:
23147 S (f) (int);
23149 is a constructor. (It is actually a function named `f' that
23150 takes one parameter (of type `int') and returns a value of type
23151 `S'. */
23159 /* A parameter declaration begins with a decl-specifier,
23160 which is either the "attribute" keyword, a storage class
23161 specifier, or (usually) a type-specifier. */
23163 {
23164 tree type;
23168 /* Names appearing in the type-specifier should be looked up
23169 in the scope of the class. */
23172 else
23173 {
23176 {
23180 {
23183 }
23184 }
23186 }
23188 /* Inside the constructor parameter list, surrounding
23189 template-parameter-lists do not apply. */
23190 saved_num_template_parameter_lists
23194 /* Look for the type-specifier. */
23196 CP_PARSER_FLAGS_NONE,
23202 parser->num_template_parameter_lists
23205 /* Leave the scope of the class. */
23210 }
23211 }
23213 /* We did not really want to consume any tokens. */
23217 }
23219 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23220 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23221 they must be performed once we are in the scope of the function.
23223 Returns the function defined. */
23225 static tree
23226 cp_parser_function_definition_from_specifiers_and_declarator
23229 tree attributes,
23231 {
23232 tree fn;
23235 /* Begin the function-definition. */
23238 /* The things we're about to see are not directly qualified by any
23239 template headers we've seen thus far. */
23242 /* If there were names looked up in the decl-specifier-seq that we
23243 did not check, check them now. We must wait until we are in the
23244 scope of the function to perform the checks, since the function
23245 might be a friend. */
23249 {
23252 }
23255 {
23256 /* Skip the entire function. */
23259 }
23261 {
23262 /* Seen already, skip it. An error message has already been output. */
23266 /* If this is a function from a class, pop the nested class. */
23269 }
23270 else
23271 {
23272 timevar_id_t tv;
23275 else
23281 }
23284 }
23286 /* Parse the part of a function-definition that follows the
23287 declarator. INLINE_P is TRUE iff this function is an inline
23288 function defined within a class-specifier.
23290 Returns the function defined. */
23292 static tree
23295 {
23296 tree fn;
23302 bool fully_implicit_function_template_p
23305 tree implicit_template_parms
23308 cp_binding_level* implicit_template_scope
23314 /* If the next token is `return', then the code may be trying to
23315 make use of the "named return value" extension that G++ used to
23316 support. */
23319 {
23320 /* Consume the `return' keyword. */
23322 /* Look for the identifier that indicates what value is to be
23323 returned. */
23325 /* Issue an error message. */
23328 /* Skip tokens until we reach the start of the function body. */
23330 {
23337 }
23338 }
23339 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23340 anything declared inside `f'. */
23341 saved_in_unbraced_linkage_specification_p
23344 /* Inside the function, surrounding template-parameter-lists do not
23345 apply. */
23346 saved_num_template_parameter_lists
23352 /* If the next token is `try', `__transaction_atomic', or
23353 `__transaction_relaxed`, then we are looking at either function-try-block
23354 or function-transaction-block. Note that all of these include the
23355 function-body. */
23358 RID_TRANSACTION_ATOMIC);
23360 RID_TRANSACTION_RELAXED))
23362 RID_TRANSACTION_RELAXED);
23365 else
23366 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23371 /* Finish the function. */
23374 /* Generate code for it, if necessary. */
23376 /* Restore the saved values. */
23377 parser->in_unbraced_linkage_specification_p
23379 parser->num_template_parameter_lists
23383 parser->fully_implicit_function_template_p
23385 parser->implicit_template_parms
23387 parser->implicit_template_scope
23394 }
23396 /* Parse a template-declaration, assuming that the `export' (and
23397 `extern') keywords, if present, has already been scanned. MEMBER_P
23398 is as for cp_parser_template_declaration. */
23400 static void
23402 {
23405 tree parameter_list;
23410 /* Look for the `template' keyword. */
23415 /* And the `<'. */
23419 {
23420 /* 14.5.2.2 [temp.mem]
23422 A local class shall not have member templates. */
23427 }
23428 /* [temp]
23430 A template ... shall not have C linkage. */
23432 {
23434 /* Give it C++ linkage to avoid confusing other parts of the
23435 front end. */
23438 }
23439 else
23442 /* We cannot perform access checks on the template parameter
23443 declarations until we know what is being declared, just as we
23444 cannot check the decl-specifier list. */
23447 /* If the next token is `>', then we have an invalid
23448 specialization. Rather than complain about an invalid template
23449 parameter, issue an error message here. */
23451 {
23455 }
23456 else
23457 {
23458 /* Parse the template parameters. */
23460 }
23462 /* Get the deferred access checks from the parameter list. These
23463 will be checked once we know what is being declared, as for a
23464 member template the checks must be performed in the scope of the
23465 class containing the member. */
23468 /* Look for the `>'. */
23470 /* We just processed one more parameter list. */
23472 /* If the next token is `template', there are more template
23473 parameters. */
23475 RID_TEMPLATE))
23480 else
23481 {
23482 /* There are no access checks when parsing a template, as we do not
23483 know if a specialization will be a friend. */
23487 checks,
23488 member_p,
23493 /* If this is a member template declaration, let the front
23494 end know. */
23496 {
23501 }
23506 }
23507 /* We are done with the current parameter list. */
23512 /* Finish up. */
23515 /* Check the template arguments for a literal operator template. */
23519 {
23523 else
23524 {
23527 {
23533 }
23535 {
23543 }
23544 else
23546 }
23548 {
23551 " Expected non-type template argument pack <char...>"
23553 decl);
23554 else
23557 decl);
23558 }
23559 }
23560 /* Register member declarations. */
23563 /* For the erroneous case of a template with C linkage, we pushed an
23564 implicit C++ linkage scope; exit that scope now. */
23567 /* If DECL is a function template, we must return to parse it later.
23568 (Even though there is no definition, there might be default
23569 arguments that need handling.) */
23573 }
23575 /* Perform the deferred access checks from a template-parameter-list.
23576 CHECKS is a TREE_LIST of access checks, as returned by
23577 get_deferred_access_checks. */
23579 static void
23580 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23581 {
23585 }
23587 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23588 `function-definition' sequence that follows a template header.
23589 If MEMBER_P is true, this declaration appears in a class scope.
23591 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23592 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23594 static tree
23600 {
23603 cp_decl_specifier_seq decl_specifiers;
23607 /* This function is only used when processing a template
23608 declaration. */
23612 /* Defer access checks until we know what is being declared. */
23615 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23616 alternative. */
23619 CP_PARSER_FLAGS_OPTIONAL,
23625 /* There are no template typedefs. */
23627 {
23631 }
23633 /* Gather up the access checks that occurred the
23634 decl-specifier-seq. */
23637 /* Check for the declaration of a template class. */
23639 {
23641 {
23644 /* In this case:
23646 struct C {
23647 friend template <typename T> struct A<T>::B;
23648 };
23650 A<T>::B will be represented by a TYPENAME_TYPE, and
23651 therefore not recognized by shadow_tag. */
23653 && !decl
23660 else
23663 /* Perform access checks for template parameters. */
23665 }
23666 }
23668 /* Complain about missing 'typename' or other invalid type names. */
23671 {
23672 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23673 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23674 the rest of this declaration. */
23677 }
23679 /* If it's not a template class, try for a template function. If
23680 the next token is a `;', then this declaration does not declare
23681 anything. But, if there were errors in the decl-specifiers, then
23682 the error might well have come from an attempted class-specifier.
23683 In that case, there's no need to warn about a missing declarator. */
23687 {
23690 checks,
23692 member_p,
23693 declares_class_or_enum,
23695 NULL);
23697 /* 7.1.1-1 [dcl.stc]
23699 A storage-class-specifier shall not be specified in an explicit
23700 specialization... */
23702 && explicit_specialization_p
23704 {
23708 }
23712 }
23714 /* Look for a trailing `;' after the declaration. */
23720 out:
23723 /* Clear any current qualification; whatever comes next is the start
23724 of something new. */
23730 }
23732 /* Parse a cast-expression that is not the operand of a unary "&". */
23734 static tree
23736 {
23739 }
23741 /* Parse a functional cast to TYPE. Returns an expression
23742 representing the cast. */
23744 static tree
23746 {
23748 tree expression_list;
23749 tree cast;
23756 {
23764 tf_warning_or_error);
23765 }
23774 else
23775 {
23778 }
23781 tf_warning_or_error);
23782 /* [expr.const]/1: In an integral constant expression "only type
23783 conversions to integral or enumeration type can be used". */
23789 NIC_CONSTRUCTOR))
23792 }
23794 /* Save the tokens that make up the body of a member function defined
23795 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23796 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23797 specifiers applied to the declaration. Returns the FUNCTION_DECL
23798 for the member function. */
23800 static tree
23804 tree attributes)
23805 {
23808 tree fn;
23810 /* Create the FUNCTION_DECL. */
23813 /* If something went badly wrong, bail out now. */
23815 {
23816 /* If there's a function-body, skip it. */
23821 }
23823 /* Remember it, if there default args to post process. */
23826 /* Save away the tokens that make up the body of the
23827 function. */
23829 /* Handle function try blocks. */
23832 /* We can have braced-init-list mem-initializers before the fn body. */
23834 {
23837 {
23838 /* cache_group will stop after an un-nested { } pair, too. */
23842 /* variadic mem-inits have ... after the ')'. */
23845 }
23846 }
23848 /* Handle function try blocks. */
23853 /* Save away the inline definition; we will process it when the
23854 class is complete. */
23858 /* We need to know that this was defined in the class, so that
23859 friend templates are handled correctly. */
23862 /* Add FN to the queue of functions to be parsed later. */
23866 }
23868 /* Save the tokens that make up the in-class initializer for a non-static
23869 data member. Returns a DEFAULT_ARG. */
23871 static tree
23873 {
23875 }
23877 /* Parse a template-argument-list, as well as the trailing ">" (but
23878 not the opening "<"). See cp_parser_template_argument_list for the
23879 return value. */
23881 static tree
23883 {
23884 tree arguments;
23885 tree saved_scope;
23886 tree saved_qualifying_scope;
23887 tree saved_object_scope;
23892 /* [temp.names]
23894 When parsing a template-id, the first non-nested `>' is taken as
23895 the end of the template-argument-list rather than a greater-than
23896 operator. */
23897 saved_greater_than_is_operator_p
23900 /* Parsing the argument list may modify SCOPE, so we save it
23901 here. */
23905 /* We need to evaluate the template arguments, even though this
23906 template-id may be nested within a "sizeof". */
23911 /* Parse the template-argument-list itself. */
23915 else
23917 /* Look for the `>' that ends the template-argument-list. If we find
23918 a '>>' instead, it's probably just a typo. */
23920 {
23922 {
23923 /* In C++0x, a `>>' in a template argument list or cast
23924 expression is considered to be two separate `>'
23925 tokens. So, change the current token to a `>', but don't
23926 consume it: it will be consumed later when the outer
23927 template argument list (or cast expression) is parsed.
23928 Note that this replacement of `>' for `>>' is necessary
23929 even if we are parsing tentatively: in the tentative
23930 case, after calling
23931 cp_parser_enclosed_template_argument_list we will always
23932 throw away all of the template arguments and the first
23933 closing `>', either because the template argument list
23934 was erroneous or because we are replacing those tokens
23935 with a CPP_TEMPLATE_ID token. The second `>' (which will
23936 not have been thrown away) is needed either to close an
23937 outer template argument list or to complete a new-style
23938 cast. */
23941 }
23943 {
23944 /* If we're in a nested template argument list, the '>>' has
23945 to be a typo for '> >'. We emit the error message, but we
23946 continue parsing and we push a '>' as next token, so that
23947 the argument list will be parsed correctly. Note that the
23948 global source location is still on the token before the
23949 '>>', so we need to say explicitly where we want it. */
23955 }
23956 else
23957 {
23958 /* If this is not a nested template argument list, the '>>'
23959 is a typo for '>'. Emit an error message and continue.
23960 Same deal about the token location, but here we can get it
23961 right by consuming the '>>' before issuing the diagnostic. */
23964 "spurious %<>>%>, use %<>%> to terminate "
23966 }
23967 }
23968 else
23970 /* The `>' token might be a greater-than operator again now. */
23971 parser->greater_than_is_operator_p
23973 /* Restore the SAVED_SCOPE. */
23981 }
23983 /* MEMBER_FUNCTION is a member function, or a friend. If default
23984 arguments, or the body of the function have not yet been parsed,
23985 parse them now. */
23987 static void
23989 {
23991 /* If this member is a template, get the underlying
23992 FUNCTION_DECL. */
23996 /* There should not be any class definitions in progress at this
23997 point; the bodies of members are only parsed outside of all class
23998 definitions. */
24000 /* While we're parsing the member functions we might encounter more
24001 classes. We want to handle them right away, but we don't want
24002 them getting mixed up with functions that are currently in the
24003 queue. */
24006 /* Make sure that any template parameters are in scope. */
24009 /* If the body of the function has not yet been parsed, parse it
24010 now. */
24012 {
24013 tree function_scope;
24016 /* The function is no longer pending; we are processing it. */
24021 /* If this is a local class, enter the scope of the containing
24022 function. */
24027 /* Push the body of the function onto the lexer stack. */
24030 /* Let the front end know that we going to be defining this
24031 function. */
24035 /* Don't do access checking if it is a templated function. */
24039 /* #pragma omp declare reduction needs special parsing. */
24041 {
24046 }
24047 else
24048 /* Now, parse the body of the function. */
24055 /* Leave the scope of the containing function. */
24059 }
24061 /* Remove any template parameters from the symbol table. */
24064 /* Restore the queue. */
24067 }
24069 /* If DECL contains any default args, remember it on the unparsed
24070 functions queue. */
24072 static void
24074 {
24075 tree probe;
24078 probe;
24081 {
24085 }
24086 }
24088 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24089 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24090 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24091 from the parameter-type-list. */
24093 static tree
24096 {
24098 tree parsed_arg;
24104 /* Push the saved tokens for the default argument onto the parser's
24105 lexer stack. */
24111 /* Parse the default argument. */
24122 {
24123 /* In a non-template class, check conversions now. In a template,
24124 we'll wait and instantiate these as needed. */
24127 tf_warning_or_error);
24128 else
24130 }
24132 /* If the token stream has not been completely used up, then
24133 there was extra junk after the end of the default
24134 argument. */
24136 {
24139 else
24141 }
24143 /* Revert to the main lexer. */
24147 }
24149 /* FIELD is a non-static data member with an initializer which we saved for
24150 later; parse it now. */
24152 static void
24154 {
24155 tree def;
24162 NULL_TREE);
24168 }
24170 /* FN is a FUNCTION_DECL which may contains a parameter with an
24171 unparsed DEFAULT_ARG. Parse the default args now. This function
24172 assumes that the current scope is the scope in which the default
24173 argument should be processed. */
24175 static void
24177 {
24181 /* While we're parsing the default args, we might (due to the
24182 statement expression extension) encounter more classes. We want
24183 to handle them right away, but we don't want them getting mixed
24184 up with default args that are currently in the queue. */
24187 /* Local variable names (and the `this' keyword) may not appear
24188 in a default argument. */
24199 {
24201 tree parsed_arg;
24203 tree copy;
24210 /* This can happen for a friend declaration for a function
24211 already declared with default arguments. */
24214 parsed_arg
24216 default_arg,
24219 {
24221 }
24225 /* Update any instantiations we've already created. */
24229 }
24233 /* Make sure no default arg is missing. */
24236 /* Restore the state of local_variables_forbidden_p. */
24239 /* Restore the queue. */
24241 }
24243 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24245 sizeof ... ( identifier )
24247 where the 'sizeof' token has already been consumed. */
24249 static tree
24251 {
24252 /* Consume the `...'. */
24259 else
24267 /* The name is not qualified. */
24285 }
24287 /* Parse the operand of `sizeof' (or a similar operator). Returns
24288 either a TYPE or an expression, depending on the form of the
24289 input. The KEYWORD indicates which kind of expression we have
24290 encountered. */
24292 static tree
24294 {
24301 /* If it's a `...', then we are computing the length of a parameter
24302 pack. */
24307 /* Types cannot be defined in a `sizeof' expression. Save away the
24308 old message. */
24310 /* And create the new one. */
24316 /* The restrictions on constant-expressions do not apply inside
24317 sizeof expressions. */
24318 saved_integral_constant_expression_p
24320 saved_non_integral_constant_expression_p
24324 /* Do not actually evaluate the expression. */
24327 /* If it's a `(', then we might be looking at the type-id
24328 construction. */
24330 {
24333 /* We can't be sure yet whether we're looking at a type-id or an
24334 expression. */
24336 /* Note: as a GNU Extension, compound literals are considered
24337 postfix-expressions as they are in C99, so they are valid
24338 arguments to sizeof. See comment in cp_parser_cast_expression
24339 for details. */
24342 else
24343 {
24346 /* Look for the type-id. */
24348 /* Look for the closing `)'. */
24351 }
24353 /* If all went well, then we're done. */
24355 {
24356 cp_decl_specifier_seq decl_specs;
24358 /* Build a trivial decl-specifier-seq. */
24362 /* Call grokdeclarator to figure out what type this is. */
24365 TYPENAME,
24368 }
24369 }
24371 /* If the type-id production did not work out, then we must be
24372 looking at the unary-expression production. */
24376 /* Go back to evaluating expressions. */
24380 /* Free the message we created. */
24382 /* And restore the old one. */
24384 parser->integral_constant_expression_p
24386 parser->non_integral_constant_expression_p
24390 }
24392 /* If the current declaration has no declarator, return true. */
24394 static bool
24396 {
24397 /* If the next token is a `;' or a `,' then there is no
24398 declarator. */
24401 }
24403 /* Update the DECL_SPECS to reflect the storage class indicated by
24404 KEYWORD. */
24406 static void
24411 {
24412 cp_storage_class storage_class;
24415 {
24419 }
24421 {
24424 }
24429 {
24432 }
24435 {
24453 }
24457 /* A storage class specifier cannot be applied alongside a typedef
24458 specifier. If there is a typedef specifier present then set
24459 conflicting_specifiers_p which will trigger an error later
24460 on in grokdeclarator. */
24463 }
24465 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24466 is true, the type is a class or enum definition. */
24468 static void
24470 tree type_spec,
24473 {
24476 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24477 (with, for example, in "typedef int wchar_t;") we remember that
24478 this is what happened. In system headers, we ignore these
24479 declarations so that G++ can work with system headers that are not
24480 C++-safe. */
24482 && !type_definition_p
24492 {
24495 ds_redefined_builtin_type_spec,
24496 token);
24498 {
24502 }
24503 }
24506 else
24507 {
24512 }
24513 }
24515 /* True iff TOKEN is the GNU keyword __thread. */
24517 static bool
24519 {
24522 }
24524 /* Set the location for a declarator specifier and check if it is
24525 duplicated.
24527 DECL_SPECS is the sequence of declarator specifiers onto which to
24528 set the location.
24530 DS is the single declarator specifier to set which location is to
24531 be set onto the existing sequence of declarators.
24533 LOCATION is the location for the declarator specifier to
24534 consider. */
24536 static void
24539 {
24548 {
24552 }
24553 else
24554 {
24556 {
24560 else
24561 {
24564 OPT_Wlong_long,
24566 }
24567 }
24569 {
24574 else
24576 }
24577 else
24578 {
24594 "__complex"
24595 };
24598 }
24599 }
24600 }
24602 /* Return true iff the declarator specifier DS is present in the
24603 sequence of declarator specifiers DECL_SPECS. */
24605 bool
24607 cp_decl_spec ds)
24608 {
24615 }
24617 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24618 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24620 static bool
24622 {
24624 }
24626 /* Issue an error message indicating that TOKEN_DESC was expected.
24627 If KEYWORD is true, it indicated this function is called by
24628 cp_parser_require_keword and the required token can only be
24629 a indicated keyword. */
24631 static void
24633 required_token token_desc,
24635 {
24637 {
24706 }
24708 {
24710 {
24789 }
24790 }
24791 else
24793 }
24797 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24798 issue an error message indicating that TOKEN_DESC was expected.
24800 Returns the token consumed, if the token had the appropriate type.
24801 Otherwise, returns NULL. */
24806 required_token token_desc)
24807 {
24810 else
24811 {
24812 /* Output the MESSAGE -- unless we're parsing tentatively. */
24816 }
24817 }
24819 /* An error message is produced if the next token is not '>'.
24820 All further tokens are skipped until the desired token is
24821 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24823 static void
24825 {
24826 /* Current level of '< ... >'. */
24828 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24831 /* Are we ready, yet? If not, issue error message. */
24835 /* Skip tokens until the desired token is found. */
24837 {
24838 /* Peek at the next token. */
24840 {
24848 /* C++0x views the `>>' operator as two `>' tokens, but
24849 C++98 does not. */
24852 {
24853 /* We've hit a `>>' where the first `>' closes the
24854 template argument list, and the second `>' is
24855 spurious. Just consume the `>>' and stop; we've
24856 already produced at least one error. */
24859 }
24860 /* Fall through for C++0x, so we handle the second `>' in
24861 the `>>'. */
24865 {
24866 /* We've reached the token we want, consume it and stop. */
24869 }
24888 /* The '>' was probably forgotten, don't look further. */
24893 }
24895 /* Consume this token. */
24897 }
24898 }
24900 /* If the next token is the indicated keyword, consume it. Otherwise,
24901 issue an error message indicating that TOKEN_DESC was expected.
24903 Returns the token consumed, if the token had the appropriate type.
24904 Otherwise, returns NULL. */
24909 required_token token_desc)
24910 {
24914 {
24917 }
24920 }
24922 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24923 function-definition. */
24925 static bool
24927 {
24930 /* A ctor-initializer begins with a `:'. */
24932 /* A function-try-block begins with `try'. */
24934 /* A function-transaction-block begins with `__transaction_atomic'
24935 or `__transaction_relaxed'. */
24938 /* The named return value extension begins with `return'. */
24940 }
24942 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24943 definition. */
24945 static bool
24947 {
24954 }
24956 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24957 C++0x) ending a template-argument. */
24959 static bool
24961 {
24969 }
24971 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24972 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24974 static bool
24977 {
24983 /* Check for the sequence `<::' in the original code. It would be lexed as
24984 `[:', where `[' is a digraph, and there is no whitespace before
24985 `:'. */
24987 {
24992 }
24994 }
24996 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24997 or none_type otherwise. */
24999 static enum tag_types
25001 {
25003 {
25013 }
25014 }
25016 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25017 or none_type otherwise or if the token is null. */
25019 static enum tag_types
25021 {
25026 {
25034 }
25035 }
25037 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25039 static void
25041 {
25045 {
25049 type))
25052 }
25053 }
25055 /* Issue an error message if DECL is redeclared with different
25056 access than its original declaration [class.access.spec/3].
25057 This applies to nested classes and nested class templates.
25058 [class.mem/1]. */
25060 static void
25062 {
25071 }
25073 /* Look for the `template' keyword, as a syntactic disambiguator.
25074 Return TRUE iff it is present, in which case it will be
25075 consumed. */
25077 static bool
25079 {
25081 {
25082 /* In C++98 the `template' keyword can only be used within templates;
25083 outside templates the parser can always figure out what is a
25084 template and what is not. In C++11, per the resolution of DR 468,
25085 `template' is allowed in cases where it is not strictly necessary. */
25088 {
25091 "in C++98 %<template%> (as a disambiguator) is only "
25093 /* If this part of the token stream is rescanned, the same
25094 error message would be generated. So, we purge the token
25095 from the stream. */
25098 }
25099 else
25100 {
25101 /* Consume the `template' keyword. */
25104 }
25105 }
25107 }
25109 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25110 set PARSER->SCOPE, and perform other related actions. */
25112 static void
25114 {
25120 /* Get the stored value. */
25122 /* Perform any access checks that were deferred. */
25125 {
25130 }
25131 /* Set the scope from the stored value. */
25135 }
25137 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25138 encounter the end of a block before what we were looking for. */
25140 static bool
25144 {
25146 {
25149 /* Abort a parenthesized expression if we encounter a semicolon. */
25153 /* If we've reached the end of the file, stop. */
25159 /* We've hit the end of an enclosing block, so there's been some
25160 kind of syntax error. */
25163 /* Consume the token. */
25165 /* See if it starts a new group. */
25167 {
25169 /* In theory this should probably check end == '}', but
25170 cp_parser_save_member_function_body needs it to exit
25171 after either '}' or ')' when called with ')'. */
25174 }
25176 {
25180 }
25185 }
25186 }
25188 /* Like above, for caching a default argument or NSDMI. Both of these are
25189 terminated by a non-nested comma, but it can be unclear whether or not a
25190 comma is nested in a template argument list unless we do more parsing.
25191 In order to handle this ambiguity, when we encounter a ',' after a '<'
25192 we try to parse what follows as a parameter-declaration-list (in the
25193 case of a default argument) or a member-declarator (in the case of an
25194 NSDMI). If that succeeds, then we stop caching. */
25196 static tree
25198 {
25203 tree default_argument;
25205 /* Add tokens until we have processed the entire default
25206 argument. We add the range [first_token, token). */
25209 {
25210 /* For list-initialization, this is straightforward. */
25213 }
25215 {
25218 /* Peek at the next token. */
25220 /* What we do depends on what token we have. */
25222 {
25223 /* In valid code, a default argument must be
25224 immediately followed by a `,' `)', or `...'. */
25227 {
25228 /* If we've seen a '<', we might be in a
25229 template-argument-list. Until Core issue 325 is
25230 resolved, we don't know how this situation ought
25231 to be handled, so try to DTRT. We check whether
25232 what comes after the comma is a valid parameter
25233 declaration list. If it is, then the comma ends
25234 the default argument; otherwise the default
25235 argument continues. */
25238 /* Set ITALP so cp_parser_parameter_declaration_list
25239 doesn't decide to commit to this parse. */
25247 {
25254 }
25255 else
25256 {
25260 }
25267 }
25270 /* If we run into a non-nested `;', `}', or `]',
25271 then the code is invalid -- but the default
25272 argument is certainly over. */
25277 /* Handle correctly int n = sizeof ... ( p ); */
25280 /* Update DEPTH, if necessary. */
25295 /* This might be the comparison operator, or it might
25296 start a template argument list. */
25303 /* Fall through for C++0x, which treats the `>>'
25304 operator like two `>' tokens in certain
25305 cases. */
25309 {
25310 /* This might be an operator, or it might close a
25311 template argument list. But if a previous '<'
25312 started a template argument list, this will have
25313 closed it, so we can't be in one anymore. */
25317 }
25320 /* If we run out of tokens, issue an error message. */
25329 /* In these cases, we should look for template-ids.
25330 For example, if the default argument is
25331 `X<int, double>()', we need to do name lookup to
25332 figure out whether or not `X' is a template; if
25333 so, the `,' does not end the default argument.
25335 That is not yet done. */
25340 }
25342 /* If we've reached the end, stop. */
25346 /* Add the token to the token block. */
25348 }
25350 /* Create a DEFAULT_ARG to represent the unparsed default
25351 argument. */
25358 }
25360 /* Begin parsing tentatively. We always save tokens while parsing
25361 tentatively so that if the tentative parsing fails we can restore the
25362 tokens. */
25364 static void
25366 {
25367 /* Enter a new parsing context. */
25369 /* Begin saving tokens. */
25371 /* In order to avoid repetitive access control error messages,
25372 access checks are queued up until we are no longer parsing
25373 tentatively. */
25375 }
25377 /* Commit to the currently active tentative parse. */
25379 static void
25381 {
25385 /* Mark all of the levels as committed. */
25388 {
25395 }
25396 }
25398 /* Commit to the topmost currently active tentative parse.
25400 Note that this function shouldn't be called when there are
25401 irreversible side-effects while in a tentative state. For
25402 example, we shouldn't create a permanent entry in the symbol
25403 table, or issue an error message that might not apply if the
25404 tentative parse is aborted. */
25406 static void
25408 {
25413 {
25421 }
25422 }
25424 /* Abort the currently active tentative parse. All consumed tokens
25425 will be rolled back, and no diagnostics will be issued. */
25427 static void
25429 {
25433 /* Now, pretend that we want to see if the construct was
25434 successfully parsed. */
25436 }
25438 /* Stop parsing tentatively. If a parse error has occurred, restore the
25439 token stream. Otherwise, commit to the tokens we have consumed.
25440 Returns true if no error occurred; false otherwise. */
25442 static bool
25444 {
25448 /* Remember whether or not an error occurred, since we are about to
25449 destroy that information. */
25451 /* Remove the topmost context from the stack. */
25454 /* If no parse errors occurred, commit to the tentative parse. */
25456 {
25457 /* Commit to the tokens read tentatively, unless that was
25458 already done. */
25463 }
25464 /* Otherwise, if errors occurred, roll back our state so that things
25465 are just as they were before we began the tentative parse. */
25466 else
25467 {
25470 }
25471 /* Add the context to the front of the free list. */
25476 }
25478 /* Returns true if we are parsing tentatively and are not committed to
25479 this tentative parse. */
25481 static bool
25483 {
25486 }
25488 /* Returns nonzero iff an error has occurred during the most recent
25489 tentative parse. */
25491 static bool
25493 {
25496 }
25498 /* Returns nonzero if GNU extensions are allowed. */
25500 static bool
25502 {
25504 }
25505 \f
25506 /* Objective-C++ Productions */
25509 /* Parse an Objective-C expression, which feeds into a primary-expression
25510 above.
25512 objc-expression:
25513 objc-message-expression
25514 objc-string-literal
25515 objc-encode-expression
25516 objc-protocol-expression
25517 objc-selector-expression
25519 Returns a tree representation of the expression. */
25521 static tree
25523 {
25524 /* Try to figure out what kind of declaration is present. */
25528 {
25538 {
25550 }
25556 }
25559 }
25561 /* Parse an Objective-C message expression.
25563 objc-message-expression:
25564 [ objc-message-receiver objc-message-args ]
25566 Returns a representation of an Objective-C message. */
25568 static tree
25570 {
25579 }
25581 /* Parse an objc-message-receiver.
25583 objc-message-receiver:
25584 expression
25585 simple-type-specifier
25587 Returns a representation of the type or expression. */
25589 static tree
25591 {
25592 tree rcv;
25594 /* An Objective-C message receiver may be either (1) a type
25595 or (2) an expression. */
25604 CP_PARSER_FLAGS_NONE);
25607 }
25609 /* Parse the arguments and selectors comprising an Objective-C message.
25611 objc-message-args:
25612 objc-selector
25613 objc-selector-args
25614 objc-selector-args , objc-comma-args
25616 objc-selector-args:
25617 objc-selector [opt] : assignment-expression
25618 objc-selector-args objc-selector [opt] : assignment-expression
25620 objc-comma-args:
25621 assignment-expression
25622 objc-comma-args , assignment-expression
25624 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25625 selector arguments and TREE_VALUE containing a list of comma
25626 arguments. */
25628 static tree
25630 {
25636 {
25642 /* Detect if we have a unary selector. */
25651 sel_args
25656 }
25658 /* Handle non-selector arguments, if any. */
25660 {
25661 tree arg;
25666 addl_args
25671 }
25674 {
25677 }
25680 }
25682 /* Parse an Objective-C encode expression.
25684 objc-encode-expression:
25685 @encode objc-typename
25687 Returns an encoded representation of the type argument. */
25689 static tree
25691 {
25692 tree type;
25702 {
25706 }
25708 /* This happens if we find @encode(T) (where T is a template
25709 typename or something dependent on a template typename) when
25710 parsing a template. In that case, we can't compile it
25711 immediately, but we rather create an AT_ENCODE_EXPR which will
25712 need to be instantiated when the template is used.
25713 */
25715 {
25719 }
25722 }
25724 /* Parse an Objective-C @defs expression. */
25726 static tree
25728 {
25729 tree name;
25737 }
25739 /* Parse an Objective-C protocol expression.
25741 objc-protocol-expression:
25742 @protocol ( identifier )
25744 Returns a representation of the protocol expression. */
25746 static tree
25748 {
25749 tree proto;
25757 }
25759 /* Parse an Objective-C selector expression.
25761 objc-selector-expression:
25762 @selector ( objc-method-signature )
25764 objc-method-signature:
25765 objc-selector
25766 objc-selector-seq
25768 objc-selector-seq:
25769 objc-selector :
25770 objc-selector-seq objc-selector :
25772 Returns a representation of the method selector. */
25774 static tree
25776 {
25788 {
25797 {
25798 /* Detect if we have a unary selector. */
25800 {
25803 }
25804 else
25805 {
25807 }
25808 }
25813 {
25814 sel_seq
25817 sel_seq
25820 }
25821 else
25822 sel_seq
25827 }
25829 finish_selector:
25833 }
25835 /* Parse a list of identifiers.
25837 objc-identifier-list:
25838 identifier
25839 objc-identifier-list , identifier
25841 Returns a TREE_LIST of identifier nodes. */
25843 static tree
25845 {
25846 tree identifier;
25847 tree list;
25858 {
25865 identifier));
25867 }
25870 }
25872 /* Parse an Objective-C alias declaration.
25874 objc-alias-declaration:
25875 @compatibility_alias identifier identifier ;
25877 This function registers the alias mapping with the Objective-C front end.
25878 It returns nothing. */
25880 static void
25882 {
25890 }
25892 /* Parse an Objective-C class forward-declaration.
25894 objc-class-declaration:
25895 @class objc-identifier-list ;
25897 The function registers the forward declarations with the Objective-C
25898 front end. It returns nothing. */
25900 static void
25902 {
25905 {
25906 tree id;
25916 else
25918 }
25920 }
25922 /* Parse a list of Objective-C protocol references.
25924 objc-protocol-refs-opt:
25925 objc-protocol-refs [opt]
25927 objc-protocol-refs:
25928 < objc-identifier-list >
25930 Returns a TREE_LIST of identifiers, if any. */
25932 static tree
25934 {
25938 {
25942 }
25945 }
25947 /* Parse a Objective-C visibility specification. */
25949 static void
25951 {
25955 {
25970 }
25972 /* Eat '@private'/'@protected'/'@public'. */
25974 }
25976 /* Parse an Objective-C method type. Return 'true' if it is a class
25977 (+) method, and 'false' if it is an instance (-) method. */
25981 {
25984 else
25986 }
25988 /* Parse an Objective-C protocol qualifier. */
25990 static tree
25992 {
26005 {
26010 }
26013 }
26015 /* Parse an Objective-C typename. */
26017 static tree
26019 {
26023 {
26029 /* An ObjC type name may consist of just protocol qualifiers, in which
26030 case the type shall default to 'id'. */
26032 {
26035 /* If the type could not be parsed, an error has already
26036 been produced. For error recovery, behave as if it had
26037 not been specified, which will use the default type
26038 'id'. */
26040 {
26042 /* We need to skip to the closing parenthesis as
26043 cp_parser_type_id() does not seem to do it for
26044 us. */
26049 }
26050 }
26054 }
26057 }
26059 /* Check to see if TYPE refers to an Objective-C selector name. */
26061 static bool
26063 {
26069 }
26071 /* Parse an Objective-C selector. */
26073 static tree
26075 {
26079 {
26082 }
26084 /* C++ operator names are allowed to appear in ObjC selectors. */
26086 {
26099 }
26100 }
26102 /* Parse an Objective-C params list. */
26104 static tree
26106 {
26112 {
26122 /* Detect if we have a unary selector. */
26125 {
26128 }
26132 {
26133 /* Something went quite wrong. There should be a colon
26134 here, but there is not. Stop parsing parameters. */
26136 }
26138 /* New ObjC allows attributes on parameters too. */
26143 params
26146 type_name,
26147 identifier,
26148 parm_attr));
26151 }
26154 {
26157 }
26159 /* We allow tail attributes for the method. */
26161 {
26169 }
26172 {
26175 }
26177 }
26179 /* Parse the non-keyword Objective-C params. */
26181 static tree
26184 {
26190 {
26192 tree parm;
26198 {
26203 }
26205 /* TODO: parse attributes for tail parameters. */
26214 }
26216 /* We allow tail attributes for the method. */
26218 {
26220 {
26225 }
26226 else
26227 /* We have an error, but parse the attributes, so that we can
26228 carry on. */
26234 }
26237 }
26239 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26241 static void
26243 {
26246 /* If the next token is `extern' and the following token is a string
26247 literal, then we have a linkage specification. */
26249 && cp_parser_is_pure_string_literal
26252 /* Handle #pragma, if any. */
26255 /* Allow stray semicolons. */
26258 /* Mark methods as optional or required, when building protocols. */
26260 {
26263 }
26265 {
26268 }
26271 /* Other stray characters must generate errors. */
26273 {
26277 }
26278 /* Finally, try to parse a block-declaration, or a function-definition. */
26279 else
26281 }
26283 /* Parse a method signature. */
26285 static tree
26287 {
26303 }
26305 static bool
26307 {
26308 tree tattr;
26313 /* If the attributes are followed by a method introducer, this is not allowed.
26314 Dump the attributes and flag the situation. */
26319 /* Otherwise, the attributes introduce some interstitial code, possibly so
26320 rewind to allow that check. */
26323 }
26325 /* Parse an Objective-C method prototype list. */
26327 static void
26329 {
26333 {
26335 {
26340 else
26344 {
26348 }
26351 }
26357 OPT_Wattributes,
26359 else
26360 /* Allow for interspersed non-ObjC++ code. */
26364 }
26368 else
26372 }
26374 /* Parse an Objective-C method definition list. */
26376 static void
26378 {
26382 {
26383 tree meth;
26386 {
26392 else
26397 {
26401 }
26403 NULL_TREE);
26405 /* For historical reasons, we accept an optional semicolon. */
26412 {
26419 }
26420 }
26421 /* The following case will be removed once @synthesize is
26422 completely implemented. */
26433 else
26434 /* Allow for interspersed non-ObjC++ code. */
26438 }
26442 else
26446 }
26448 /* Parse Objective-C ivars. */
26450 static void
26452 {
26463 {
26464 cp_decl_specifier_seq declspecs;
26466 tree prefix_attributes;
26474 CP_PARSER_FLAGS_OPTIONAL,
26478 /* auto, register, static, extern, mutable. */
26480 {
26483 }
26485 /* thread_local. */
26487 {
26490 }
26492 /* typedef. */
26494 {
26497 }
26502 /* Keep going until we hit the `;' at the end of the
26503 declaration. */
26505 {
26510 /* Check for a (possibly unnamed) bitfield declaration. */
26518 {
26519 /* Get the name of the bitfield. */
26522 sfk_none);
26524 eat_colon:
26526 /* Get the width of the bitfield. */
26527 width
26529 }
26530 else
26531 {
26532 /* Parse the declarator. */
26533 declarator
26539 }
26541 /* Look for attributes that apply to the ivar. */
26543 /* Remember which attributes are prefix attributes and
26544 which are not. */
26546 /* Combine the attributes. */
26550 /* Create the bitfield declaration. */
26552 width,
26553 attributes);
26554 else
26559 /* Add the instance variable. */
26563 /* Reset PREFIX_ATTRIBUTES. */
26572 {
26575 }
26577 }
26581 }
26586 /* Do not consume the RID_AT_END, so it will be read again as terminating
26587 the @interface of @implementation. */
26591 /* For historical reasons, we accept an optional semicolon. */
26594 }
26596 /* Parse an Objective-C protocol declaration. */
26598 static void
26600 {
26606 {
26611 }
26613 /* See if we have a forward declaration or a definition. */
26616 /* Try a forward declaration first. */
26618 {
26620 {
26621 tree id;
26631 else
26633 }
26635 }
26637 /* Ok, we got a full-fledged definition (or at least should). */
26638 else
26639 {
26644 }
26645 }
26647 /* Parse an Objective-C superclass or category. */
26649 static void
26654 {
26660 {
26663 }
26665 {
26668 /* If there is no category name, and this is an @interface, we
26669 have a class extension. */
26671 {
26674 }
26675 else
26679 }
26680 }
26682 /* Parse an Objective-C class interface. */
26684 static void
26686 {
26693 {
26694 /* It's hard to recover because even if valid @interface stuff
26695 is to follow, we can't compile it (or validate it) if we
26696 don't even know which class it refers to. Let's assume this
26697 was a stray '@interface' token in the stream and skip it.
26698 */
26700 }
26705 /* We have either a class or a category on our hands. */
26708 else
26709 {
26711 /* Handle instance variable declarations, if any. */
26714 }
26717 }
26719 /* Parse an Objective-C class implementation. */
26721 static void
26723 {
26730 {
26731 /* It's hard to recover because even if valid @implementation
26732 stuff is to follow, we can't compile it (or validate it) if
26733 we don't even know which class it refers to. Let's assume
26734 this was a stray '@implementation' token in the stream and
26735 skip it.
26736 */
26738 }
26742 /* We have either a class or a category on our hands. */
26745 else
26746 {
26748 /* Handle instance variable declarations, if any. */
26751 }
26754 }
26756 /* Consume the @end token and finish off the implementation. */
26758 static void
26760 {
26763 }
26765 /* Parse an Objective-C declaration. */
26767 static void
26769 {
26770 /* Try to figure out what kind of declaration is present. */
26775 {
26791 }
26794 {
26817 }
26818 }
26820 /* Parse an Objective-C try-catch-finally statement.
26822 objc-try-catch-finally-stmt:
26823 @try compound-statement objc-catch-clause-seq [opt]
26824 objc-finally-clause [opt]
26826 objc-catch-clause-seq:
26827 objc-catch-clause objc-catch-clause-seq [opt]
26829 objc-catch-clause:
26830 @catch ( objc-exception-declaration ) compound-statement
26832 objc-finally-clause:
26833 @finally compound-statement
26835 objc-exception-declaration:
26836 parameter-declaration
26837 '...'
26839 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26841 Returns NULL_TREE.
26843 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26844 for C. Keep them in sync. */
26846 static tree
26848 {
26849 location_t location;
26850 tree stmt;
26855 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26856 node, lest it get absorbed into the surrounding block. */
26862 {
26871 {
26872 /* We have "@catch (...)" (where the '...' are literally
26873 what is in the code). Skip the '...'.
26874 parameter_declaration is set to NULL_TREE, and
26875 objc_being_catch_clauses() knows that that means
26876 '...'. */
26879 }
26880 else
26881 {
26882 /* We have "@catch (NSException *exception)" or something
26883 like that. Parse the parameter declaration. */
26887 else
26892 }
26895 else
26896 {
26897 /* If there was no open parenthesis, we are recovering from
26898 an error, and we are trying to figure out what mistake
26899 the user has made. */
26901 /* If there is an immediate closing parenthesis, the user
26902 probably forgot the opening one (ie, they typed "@catch
26903 NSException *e)". Parse the closing parenthesis and keep
26904 going. */
26908 /* If these is no immediate closing parenthesis, the user
26909 probably doesn't know that parenthesis are required at
26910 all (ie, they typed "@catch NSException *e"). So, just
26911 forget about the closing parenthesis and keep going. */
26912 }
26916 }
26918 {
26921 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26922 node, lest it get absorbed into the surrounding block. */
26926 }
26929 }
26931 /* Parse an Objective-C synchronized statement.
26933 objc-synchronized-stmt:
26934 @synchronized ( expression ) compound-statement
26936 Returns NULL_TREE. */
26938 static tree
26940 {
26941 location_t location;
26952 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26953 node, lest it get absorbed into the surrounding block. */
26958 }
26960 /* Parse an Objective-C throw statement.
26962 objc-throw-stmt:
26963 @throw assignment-expression [opt] ;
26965 Returns a constructed '@throw' statement. */
26967 static tree
26969 {
26981 }
26983 /* Parse an Objective-C statement. */
26985 static tree
26987 {
26988 /* Try to figure out what kind of declaration is present. */
26992 {
27003 }
27006 }
27008 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27009 look ahead to see if an objc keyword follows the attributes. This
27010 is to detect the use of prefix attributes on ObjC @interface and
27011 @protocol. */
27013 static bool
27015 {
27020 {
27023 }
27026 }
27028 /* This routine is a minimal replacement for
27029 c_parser_struct_declaration () used when parsing the list of
27030 types/names or ObjC++ properties. For example, when parsing the
27031 code
27033 @property (readonly) int a, b, c;
27035 this function is responsible for parsing "int a, int b, int c" and
27036 returning the declarations as CHAIN of DECLs.
27038 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27039 similar parsing. */
27040 static tree
27042 {
27044 cp_decl_specifier_seq declspecs;
27046 tree prefix_attributes;
27049 CP_PARSER_FLAGS_NONE,
27056 /* auto, register, static, extern, mutable. */
27058 {
27061 }
27063 /* thread_local. */
27065 {
27068 }
27070 /* typedef. */
27072 {
27075 }
27080 /* Keep going until we hit the `;' at the end of the declaration. */
27082 {
27087 /* Parse the declarator. */
27091 /* Look for attributes that apply to the ivar. */
27093 /* Remember which attributes are prefix attributes and
27094 which are not. */
27096 /* Combine the attributes. */
27106 /* Reset PREFIX_ATTRIBUTES. */
27117 {
27120 }
27121 else
27123 }
27125 }
27127 /* Parse an Objective-C @property declaration. The syntax is:
27129 objc-property-declaration:
27130 '@property' objc-property-attributes[opt] struct-declaration ;
27132 objc-property-attributes:
27133 '(' objc-property-attribute-list ')'
27135 objc-property-attribute-list:
27136 objc-property-attribute
27137 objc-property-attribute-list, objc-property-attribute
27139 objc-property-attribute
27140 'getter' = identifier
27141 'setter' = identifier
27142 'readonly'
27143 'readwrite'
27144 'assign'
27145 'retain'
27146 'copy'
27147 'nonatomic'
27149 For example:
27150 @property NSString *name;
27151 @property (readonly) id object;
27152 @property (retain, nonatomic, getter=getTheName) id name;
27153 @property int a, b, c;
27155 PS: This function is identical to
27156 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27157 static void
27159 {
27160 /* The following variables hold the attributes of the properties as
27161 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27162 seen. When we see an attribute, we set them to 'true' (if they
27163 are boolean properties) or to the identifier (if they have an
27164 argument, ie, for getter and setter). Note that here we only
27165 parse the list of attributes, check the syntax and accumulate the
27166 attributes that we find. objc_add_property_declaration() will
27167 then process the information. */
27177 /* 'properties' is the list of properties that we read. Usually a
27178 single one, but maybe more (eg, in "@property int a, b, c;" there
27179 are three). */
27180 tree properties;
27181 location_t loc;
27187 /* Parse the optional attribute list... */
27189 {
27190 /* Eat the '('. */
27194 {
27200 {
27203 }
27207 {
27218 {
27222 else
27227 }
27230 {
27234 }
27236 {
27238 {
27241 }
27242 else
27246 else
27248 }
27249 else
27250 {
27252 {
27255 }
27256 else
27258 }
27264 }
27271 else
27273 }
27275 /* FIXME: "@property (setter, assign);" will generate a spurious
27276 "error: expected ‘)’ before ‘,’ token". This is because
27277 cp_parser_require, unlike the C counterpart, will produce an
27278 error even if we are in error recovery. */
27280 {
27285 }
27286 }
27288 /* ... and the property declaration(s). */
27292 {
27294 /* If the next token is now a `;', consume it. */
27298 }
27302 else
27303 {
27304 /* Comma-separated properties are chained together in
27305 reverse order; add them one by one. */
27314 }
27317 }
27319 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27321 objc-synthesize-declaration:
27322 @synthesize objc-synthesize-identifier-list ;
27324 objc-synthesize-identifier-list:
27325 objc-synthesize-identifier
27326 objc-synthesize-identifier-list, objc-synthesize-identifier
27328 objc-synthesize-identifier
27329 identifier
27330 identifier = identifier
27332 For example:
27333 @synthesize MyProperty;
27334 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27336 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27337 for C. Keep them in sync.
27338 */
27339 static void
27341 {
27343 location_t loc;
27348 {
27352 {
27355 }
27357 {
27361 {
27364 }
27365 }
27366 else
27371 else
27373 }
27376 }
27378 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27380 objc-dynamic-declaration:
27381 @dynamic identifier-list ;
27383 For example:
27384 @dynamic MyProperty;
27385 @dynamic MyProperty, AnotherProperty;
27387 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27388 for C. Keep them in sync.
27389 */
27390 static void
27392 {
27394 location_t loc;
27399 {
27400 tree property;
27403 {
27406 }
27410 else
27412 }
27415 }
27417 \f
27418 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27420 /* Returns name of the next clause.
27421 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27422 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27423 returned and the token is consumed. */
27425 static pragma_omp_clause
27427 {
27439 {
27444 {
27547 }
27548 }
27554 }
27556 /* Validate that a clause of the given type does not already exist. */
27558 static void
27561 {
27562 tree c;
27566 {
27569 }
27570 }
27572 /* OpenMP 2.5:
27573 variable-list:
27574 identifier
27575 variable-list , identifier
27577 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27578 colon). An opening parenthesis will have been consumed by the caller.
27580 If KIND is nonzero, create the appropriate node and install the decl
27581 in OMP_CLAUSE_DECL and add the node to the head of the list.
27583 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27584 return the list created.
27586 COLON can be NULL if only closing parenthesis should end the list,
27587 or pointer to bool which will receive false if the list is terminated
27588 by closing parenthesis or true if the list is terminated by colon. */
27590 static tree
27593 {
27597 {
27600 }
27602 {
27619 {
27621 {
27627 {
27635 parser->colon_corrects_to_scope_p
27639 else
27640 {
27641 /* Look for `:'. */
27645 CPP_CLOSE_SQUARE))
27647 }
27648 /* Look for the closing `]'. */
27650 RT_CLOSE_SQUARE))
27653 }
27657 }
27663 }
27664 else
27667 get_comma:
27671 }
27677 {
27681 }
27684 {
27687 /* Try to resync to an unnested comma. Copied from
27688 cp_parser_parenthesized_expression_list. */
27689 skip_comma:
27698 }
27701 }
27703 /* Similarly, but expect leading and trailing parenthesis. This is a very
27704 common case for omp clauses. */
27706 static tree
27708 {
27712 }
27714 /* OpenMP 3.0:
27715 collapse ( constant-expression ) */
27717 static tree
27719 {
27721 location_t loc;
27722 HOST_WIDE_INT n;
27742 {
27745 }
27753 }
27755 /* OpenMP 2.5:
27756 default ( shared | none ) */
27758 static tree
27760 {
27762 tree c;
27767 {
27772 {
27787 }
27790 }
27791 else
27792 {
27793 invalid_kind:
27795 }
27811 }
27813 /* OpenMP 3.1:
27814 final ( expression ) */
27816 static tree
27818 {
27839 }
27841 /* OpenMP 2.5:
27842 if ( expression ) */
27844 static tree
27846 {
27867 }
27869 /* OpenMP 3.1:
27870 mergeable */
27872 static tree
27875 {
27876 tree c;
27879 location);
27884 }
27886 /* OpenMP 2.5:
27887 nowait */
27889 static tree
27892 {
27893 tree c;
27900 }
27902 /* OpenMP 2.5:
27903 num_threads ( expression ) */
27905 static tree
27907 location_t location)
27908 {
27930 }
27932 /* OpenMP 2.5:
27933 ordered */
27935 static tree
27938 {
27939 tree c;
27947 }
27949 /* OpenMP 2.5:
27950 reduction ( reduction-operator : variable-list )
27952 reduction-operator:
27953 One of: + * - & ^ | && ||
27955 OpenMP 3.1:
27957 reduction-operator:
27958 One of: + * - & ^ | && || min max
27960 OpenMP 4.0:
27962 reduction-operator:
27963 One of: + * - & ^ | && ||
27964 id-expression */
27966 static tree
27968 {
27976 {
27986 }
27990 else
27991 {
28002 {
28032 }
28033 else
28034 {
28036 resync_fail:
28041 }
28042 }
28048 NULL);
28050 {
28053 }
28056 }
28058 /* OpenMP 2.5:
28059 schedule ( schedule-kind )
28060 schedule ( schedule-kind , expression )
28062 schedule-kind:
28063 static | dynamic | guided | runtime | auto */
28065 static tree
28067 {
28076 {
28081 {
28102 }
28103 }
28108 else
28113 {
28128 else
28133 }
28141 invalid_kind:
28143 resync_fail:
28148 }
28150 /* OpenMP 3.0:
28151 untied */
28153 static tree
28156 {
28157 tree c;
28164 }
28166 /* OpenMP 4.0:
28167 inbranch
28168 notinbranch */
28170 static tree
28173 {
28178 }
28180 /* OpenMP 4.0:
28181 parallel
28182 for
28183 sections
28184 taskgroup */
28186 static tree
28190 {
28194 }
28196 /* OpenMP 4.0:
28197 num_teams ( expression ) */
28199 static tree
28201 location_t location)
28202 {
28224 }
28226 /* OpenMP 4.0:
28227 thread_limit ( expression ) */
28229 static tree
28231 location_t location)
28232 {
28254 }
28256 /* OpenMP 4.0:
28257 aligned ( variable-list )
28258 aligned ( variable-list : constant-expression ) */
28260 static tree
28262 {
28273 {
28283 }
28289 }
28291 /* OpenMP 4.0:
28292 linear ( variable-list )
28293 linear ( variable-list : expression ) */
28295 static tree
28298 {
28309 {
28313 {
28316 }
28324 }
28330 }
28332 /* OpenMP 4.0:
28333 safelen ( constant-expression ) */
28335 static tree
28337 location_t location)
28338 {
28359 }
28361 /* OpenMP 4.0:
28362 simdlen ( constant-expression ) */
28364 static tree
28366 location_t location)
28367 {
28388 }
28390 /* OpenMP 4.0:
28391 depend ( depend-kind : variable-list )
28393 depend-kind:
28394 in | out | inout */
28396 static tree
28398 {
28406 {
28416 else
28418 }
28419 else
28427 NULL);
28434 invalid_kind:
28436 resync_fail:
28441 }
28443 /* OpenMP 4.0:
28444 map ( map-kind : variable-list )
28445 map ( variable-list )
28447 map-kind:
28448 alloc | to | from | tofrom */
28450 static tree
28452 {
28461 {
28473 else
28474 {
28480 }
28483 }
28486 NULL);
28492 }
28494 /* OpenMP 4.0:
28495 device ( expression ) */
28497 static tree
28499 location_t location)
28500 {
28522 }
28524 /* OpenMP 4.0:
28525 dist_schedule ( static )
28526 dist_schedule ( static , expression ) */
28528 static tree
28530 location_t location)
28531 {
28544 {
28555 }
28560 location);
28564 invalid_kind:
28566 resync_fail:
28571 }
28573 /* OpenMP 4.0:
28574 proc_bind ( proc-bind-kind )
28576 proc-bind-kind:
28577 master | close | spread */
28579 static tree
28581 location_t location)
28582 {
28583 tree c;
28590 {
28600 else
28602 }
28603 else
28612 location);
28617 invalid_kind:
28619 resync_fail:
28624 }
28626 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28627 is a bitmask in MASK. Return the list of clauses found; the result
28628 of clause default goes in *pdefault. */
28630 static tree
28634 {
28641 {
28642 pragma_omp_clause c_kind;
28653 {
28665 clauses);
28679 clauses);
28688 clauses);
28712 clauses);
28726 clauses);
28743 OMP_CLAUSE_NOTINBRANCH,
28752 {
28753 clause_not_first:
28757 }
28782 clauses);
28787 clauses);
28792 clauses);
28855 }
28860 {
28861 /* Remove the invalid clause(s) from the list to avoid
28862 confusing the rest of the compiler. */
28865 }
28866 }
28867 saw_error:
28868 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
28869 no reason to skip to the end. */
28875 }
28877 /* OpenMP 2.5:
28878 structured-block:
28879 statement
28881 In practice, we're also interested in adding the statement to an
28882 outer node. So it is convenient if we work around the fact that
28883 cp_parser_statement calls add_stmt. */
28885 static unsigned
28887 {
28890 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28891 This preserves the "not within loop or switch" style error messages
28892 for nonsense cases like
28893 void foo() {
28894 #pragma omp single
28895 break;
28896 }
28897 */
28902 }
28904 static void
28906 {
28908 }
28910 static tree
28912 {
28920 }
28922 /* OpenMP 2.5:
28923 # pragma omp atomic new-line
28924 expression-stmt
28926 expression-stmt:
28927 x binop= expr | x++ | ++x | x-- | --x
28928 binop:
28929 +, *, -, /, &, ^, |, <<, >>
28931 where x is an lvalue expression with scalar type.
28933 OpenMP 3.1:
28934 # pragma omp atomic new-line
28935 update-stmt
28937 # pragma omp atomic read new-line
28938 read-stmt
28940 # pragma omp atomic write new-line
28941 write-stmt
28943 # pragma omp atomic update new-line
28944 update-stmt
28946 # pragma omp atomic capture new-line
28947 capture-stmt
28949 # pragma omp atomic capture new-line
28950 capture-block
28952 read-stmt:
28953 v = x
28954 write-stmt:
28955 x = expr
28956 update-stmt:
28957 expression-stmt | x = x binop expr
28958 capture-stmt:
28959 v = expression-stmt
28960 capture-block:
28961 { v = x; update-stmt; } | { update-stmt; v = x; }
28963 OpenMP 4.0:
28964 update-stmt:
28965 expression-stmt | x = x binop expr | x = expr binop x
28966 capture-stmt:
28967 v = update-stmt
28968 capture-block:
28969 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28971 where x and v are lvalue expressions with scalar type. */
28973 static void
28975 {
28983 {
28988 {
28994 }
28995 }
28997 {
29009 else
29013 }
29015 {
29021 {
29026 {
29029 }
29030 }
29031 }
29035 {
29045 else
29050 {
29051 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29052 opcode. */
29057 }
29061 {
29064 }
29065 else
29066 {
29072 }
29075 }
29077 restart:
29081 {
29088 /* FALLTHROUGH */
29098 /* FALLTHROUGH */
29113 /* Undo effects of boolean_increment for post {in,de}crement. */
29115 /* FALLTHRU */
29119 {
29120 /* Undo effects of boolean_increment. */
29122 {
29123 /* This is pre or post increment. */
29128 && !structured_block
29132 }
29133 }
29134 /* FALLTHRU */
29137 {
29172 {
29176 }
29179 {
29185 {
29190 }
29192 {
29203 {
29205 {
29210 }
29211 else
29213 }
29217 }
29220 {
29227 }
29231 }
29235 {
29238 {
29246 }
29248 {
29253 }
29288 }
29299 /* FALLTHROUGH */
29304 }
29311 }
29312 stmt_done:
29314 {
29325 }
29327 {
29330 }
29331 done:
29337 saw_error:
29340 {
29344 {
29348 }
29349 }
29350 }
29353 /* OpenMP 2.5:
29354 # pragma omp barrier new-line */
29356 static void
29358 {
29361 }
29363 /* OpenMP 2.5:
29364 # pragma omp critical [(name)] new-line
29365 structured-block */
29367 static tree
29369 {
29373 {
29385 }
29390 }
29392 /* OpenMP 2.5:
29393 # pragma omp flush flush-vars[opt] new-line
29395 flush-vars:
29396 ( variable-list ) */
29398 static void
29400 {
29406 }
29408 /* Helper function, to parse omp for increment expression. */
29410 static tree
29412 {
29417 {
29420 }
29423 {
29432 /* Fall through: OpenMP disallows NE_EXPR. */
29435 }
29437 /* If decl is an iterator, preserve LHS and RHS of the relational
29438 expr until finish_omp_for. */
29448 }
29450 /* Helper function, to parse omp for increment expression. */
29452 static tree
29454 {
29458 cp_id_kind idk;
29462 {
29470 }
29478 {
29483 }
29490 {
29494 }
29506 do
29507 {
29514 {
29516 {
29519 else
29521 tf_warning_or_error);
29522 }
29523 else
29526 }
29527 }
29531 {
29535 }
29536 else
29540 }
29542 /* Parse the initialization statement of either an OpenMP for loop or
29543 a Cilk Plus for loop.
29545 Return true if the resulting construct should have an
29546 OMP_CLAUSE_PRIVATE added to it. */
29548 static bool
29556 {
29562 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29564 init-expr:
29565 var = lb
29566 integer-type var = lb
29567 random-access-iterator-type var = lb
29568 pointer-type var = lb
29569 */
29570 cp_decl_specifier_seq type_specifiers;
29572 /* First, try to parse as an initialized declaration. See
29573 cp_parser_condition, from whence the bulk of this is copied. */
29580 {
29581 /* If parsing a type specifier seq succeeded, then this
29582 MUST be a initialized declaration. */
29587 CP_PARSER_DECLARATOR_NAMED,
29598 else
29599 {
29609 {
29611 CPP_OPEN_PAREN))
29612 {
29616 else
29619 }
29620 else
29621 /* Trigger an error. */
29626 }
29630 {
29638 {
29641 auto_node);
29646 }
29649 asm_specification,
29650 LOOKUP_ONLYCONVERTING);
29652 {
29655 }
29656 else
29659 }
29660 else
29661 {
29662 /* Consume '='. */
29666 non_class:
29669 else
29672 asm_specification,
29673 LOOKUP_ONLYCONVERTING);
29674 }
29678 }
29679 }
29680 else
29681 {
29682 cp_id_kind idk;
29683 /* If parsing a type specifier sequence failed, then
29684 this MUST be a simple expression. */
29692 && decl
29695 {
29696 tree rhs;
29703 rhs,
29704 tf_warning_or_error));
29706 }
29707 else
29708 {
29713 {
29717 }
29718 }
29719 }
29721 }
29723 /* Parse the restricted form of the for statement allowed by OpenMP. */
29725 static tree
29728 {
29732 location_t loc_first;
29751 {
29754 location_t loc;
29758 {
29761 }
29764 {
29767 }
29776 add_private_clause
29783 {
29786 {
29792 }
29793 else
29795 }
29802 {
29807 {
29811 }
29814 {
29815 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29816 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29821 {
29824 }
29825 else
29826 {
29829 }
29833 }
29834 else
29835 {
29840 }
29841 }
29844 {
29845 tree c;
29847 {
29856 decl);
29860 decl);
29861 }
29863 {
29868 {
29871 }
29872 }
29873 }
29882 {
29883 /* If decl is an iterator, preserve the operator on decl
29884 until finish_omp_for. */
29886 && ((processing_template_decl
29890 else
29894 }
29909 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29910 in between the collapsed for loops to be still considered perfectly
29911 nested. Hopefully the final version clarifies this.
29912 For now handle (multiple) {'s and empty statements. */
29914 do
29915 {
29919 {
29921 bracecount++;
29922 }
29926 else
29927 {
29934 }
29935 }
29939 {
29942 }
29943 }
29945 /* Note that we saved the original contents of this flag when we entered
29946 the structured block, and so we don't need to re-save it here. */
29949 else
29952 /* Note that the grammar doesn't call for a structured block here,
29953 though the loop as a whole is a structured block. */
29960 else
29965 {
29967 {
29969 nbraces--;
29970 }
29973 else
29974 {
29976 {
29979 }
29984 }
29985 }
29992 }
29994 /* Helper function for OpenMP parsing, split clauses and call
29995 finish_omp_clauses on each of the set of clauses afterwards. */
29997 static void
30000 {
30006 }
30008 /* OpenMP 4.0:
30009 #pragma omp simd simd-clause[optseq] new-line
30010 for-loop */
30012 #define OMP_SIMD_CLAUSE_MASK \
30013 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30014 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30015 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30021 static tree
30024 {
30036 {
30039 }
30050 }
30052 /* OpenMP 2.5:
30053 #pragma omp for for-clause[optseq] new-line
30054 for-loop
30056 OpenMP 4.0:
30057 #pragma omp for simd for-simd-clause[optseq] new-line
30058 for-loop */
30060 #define OMP_FOR_CLAUSE_MASK \
30061 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30067 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30070 static tree
30073 {
30084 {
30089 {
30097 cclauses);
30101 cclauses);
30113 }
30114 }
30116 {
30119 }
30124 {
30127 }
30138 }
30140 /* OpenMP 2.5:
30141 # pragma omp master new-line
30142 structured-block */
30144 static tree
30146 {
30150 }
30152 /* OpenMP 2.5:
30153 # pragma omp ordered new-line
30154 structured-block */
30156 static tree
30158 {
30162 }
30164 /* OpenMP 2.5:
30166 section-scope:
30167 { section-sequence }
30169 section-sequence:
30170 section-directive[opt] structured-block
30171 section-sequence section-directive structured-block */
30173 static tree
30175 {
30186 {
30190 }
30193 {
30201 {
30205 }
30207 {
30210 }
30215 }
30226 }
30228 /* OpenMP 2.5:
30229 # pragma omp sections sections-clause[optseq] newline
30230 sections-scope */
30232 #define OMP_SECTIONS_CLAUSE_MASK \
30233 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30234 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30235 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30236 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30237 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30239 static tree
30242 {
30254 {
30257 }
30264 }
30266 /* OpenMP 2.5:
30267 # pragma omp parallel parallel-clause[optseq] new-line
30268 structured-block
30269 # pragma omp parallel for parallel-for-clause[optseq] new-line
30270 structured-block
30271 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30272 structured-block
30274 OpenMP 4.0:
30275 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30276 structured-block */
30278 #define OMP_PARALLEL_CLAUSE_MASK \
30279 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30289 static tree
30292 {
30301 {
30314 block);
30319 }
30321 {
30325 }
30327 {
30330 }
30332 {
30336 {
30346 block);
30349 }
30350 }
30360 }
30362 /* OpenMP 2.5:
30363 # pragma omp single single-clause[optseq] new-line
30364 structured-block */
30366 #define OMP_SINGLE_CLAUSE_MASK \
30367 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30368 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30369 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30370 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30372 static tree
30374 {
30384 }
30386 /* OpenMP 3.0:
30387 # pragma omp task task-clause[optseq] new-line
30388 structured-block */
30390 #define OMP_TASK_CLAUSE_MASK \
30391 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30396 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30397 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30399 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30401 static tree
30403 {
30414 }
30416 /* OpenMP 3.0:
30417 # pragma omp taskwait new-line */
30419 static void
30421 {
30424 }
30426 /* OpenMP 3.1:
30427 # pragma omp taskyield new-line */
30429 static void
30431 {
30434 }
30436 /* OpenMP 4.0:
30437 # pragma omp taskgroup new-line
30438 structured-block */
30440 static tree
30442 {
30446 }
30449 /* OpenMP 2.5:
30450 # pragma omp threadprivate (variable-list) */
30452 static void
30454 {
30455 tree vars;
30461 }
30463 /* OpenMP 4.0:
30464 # pragma omp cancel cancel-clause[optseq] new-line */
30466 #define OMP_CANCEL_CLAUSE_MASK \
30467 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30473 static void
30475 {
30479 }
30481 /* OpenMP 4.0:
30482 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30484 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30485 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30486 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30487 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30488 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30490 static void
30492 {
30493 tree clauses;
30497 {
30502 {
30505 }
30506 }
30508 {
30512 }
30515 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30517 pragma_tok);
30519 }
30521 /* OpenMP 4.0:
30522 #pragma omp distribute distribute-clause[optseq] new-line
30523 for-loop */
30525 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30526 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30531 static tree
30534 {
30543 {
30551 else
30554 {
30560 {
30563 cclauses);
30564 else
30566 cclauses);
30567 }
30572 cclauses);
30573 else
30575 cclauses);
30587 }
30588 }
30590 {
30593 }
30598 {
30601 }
30612 }
30614 /* OpenMP 4.0:
30615 # pragma omp teams teams-clause[optseq] new-line
30616 structured-block */
30618 #define OMP_TEAMS_CLAUSE_MASK \
30619 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30620 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30621 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30622 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30623 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30624 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30625 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30627 static tree
30630 {
30639 {
30643 {
30651 cclauses);
30655 cclauses);
30666 }
30667 }
30669 {
30672 }
30677 {
30680 }
30688 }
30690 /* OpenMP 4.0:
30691 # pragma omp target data target-data-clause[optseq] new-line
30692 structured-block */
30694 #define OMP_TARGET_DATA_CLAUSE_MASK \
30695 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30699 static tree
30701 {
30713 }
30715 /* OpenMP 4.0:
30716 # pragma omp target update target-update-clause[optseq] new-line */
30718 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30719 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30720 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30721 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30722 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30724 static bool
30727 {
30729 {
30731 "%<#pragma omp target update%> may only be "
30735 }
30737 tree clauses
30742 {
30744 "%<#pragma omp target update must contain at least one "
30747 }
30755 }
30757 /* OpenMP 4.0:
30758 # pragma omp target target-clause[optseq] new-line
30759 structured-block */
30761 #define OMP_TARGET_CLAUSE_MASK \
30762 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30764 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30766 static bool
30769 {
30771 {
30775 }
30778 {
30783 {
30791 {
30793 OMP_TARGET_CLAUSE_MASK,
30794 cclauses);
30796 }
30812 }
30814 {
30817 }
30819 {
30823 }
30825 {
30828 }
30829 }
30843 }
30845 /* OpenMP 4.0:
30846 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30848 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30849 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30850 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30856 static void
30859 {
30861 cp_omp_declare_simd_data data;
30863 {
30868 }
30879 {
30883 {
30896 }
30901 "%<#pragma omp declare simd%> not immediately followed by "
30905 }
30906 }
30908 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
30909 This function is modelled similar to the late parsing of omp declare
30910 simd. */
30912 static tree
30914 {
30920 {
30926 }
30928 {
30932 }
30937 {
30944 NULL);
30958 }
30963 }
30965 /* Finalize #pragma omp declare simd clauses after direct declarator has
30966 been parsed, and put that into "omp declare simd" attribute. */
30968 static tree
30970 {
30976 {
30981 }
30986 {
31004 }
31008 }
31011 /* OpenMP 4.0:
31012 # pragma omp declare target new-line
31013 declarations and definitions
31014 # pragma omp end declare target new-line */
31016 static void
31018 {
31021 }
31023 static void
31025 {
31028 {
31031 }
31033 {
31037 {
31040 }
31043 else
31044 {
31048 }
31049 }
31050 else
31051 {
31055 }
31059 "%<#pragma omp end declare target%> without corresponding "
31061 else
31063 }
31065 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
31066 expression and optional initializer clause of
31067 #pragma omp declare reduction. We store the expression(s) as
31068 either 3, 6 or 7 special statements inside of the artificial function's
31069 body. The first two statements are DECL_EXPRs for the artificial
31070 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
31071 expression that uses those variables.
31072 If there was any INITIALIZER clause, this is followed by further statements,
31073 the fourth and fifth statements are DECL_EXPRs for the artificial
31074 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
31075 constructor variant (first token after open paren is not omp_priv),
31076 then the sixth statement is a statement with the function call expression
31077 that uses the OMP_PRIV and optionally OMP_ORIG variable.
31078 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
31079 to initialize the OMP_PRIV artificial variable and there is seventh
31080 statement, a DECL_EXPR of the OMP_PRIV statement again. */
31082 static bool
31084 {
31096 tree combiner;
31111 {
31114 }
31117 {
31124 {
31127 }
31143 {
31147 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
31151 == CPP_CLOSE_PAREN
31154 {
31158 }
31163 }
31164 else
31165 {
31181 {
31186 }
31188 tree arg;
31201 }
31212 }
31218 }
31220 /* OpenMP 4.0
31221 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31222 initializer-clause[opt] new-line
31224 initializer-clause:
31225 initializer (omp_priv initializer)
31226 initializer (function-name (argument-list)) */
31228 static void
31231 {
31241 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
31248 {
31280 }
31292 /* Types may not be defined in declare reduction type list. */
31295 parser->type_definition_forbidden_message
31301 saved_colon_doesnt_start_class_def_p
31306 {
31310 ;
31331 else
31336 else
31338 }
31340 /* Restore the saved message. */
31343 parser->colon_doesnt_start_class_def_p
31348 {
31349 fail:
31352 }
31358 {
31359 tree fntype
31362 NULL_TREE);
31381 {
31386 }
31388 {
31390 {
31399 }
31406 }
31407 else
31408 {
31411 }
31414 else
31417 {
31420 }
31422 {
31425 else
31430 }
31435 else
31436 {
31445 }
31452 }
31456 done:
31457 /* Free any declarators allocated. */
31459 }
31461 /* OpenMP 4.0
31462 #pragma omp declare simd declare-simd-clauses[optseq] new-line
31463 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31464 initializer-clause[opt] new-line
31465 #pragma omp declare target new-line */
31467 static void
31470 {
31472 {
31477 {
31480 context);
31482 }
31485 {
31488 context);
31490 }
31492 {
31495 }
31497 {
31501 }
31502 }
31506 }
31508 /* Main entry point to OpenMP statement pragmas. */
31510 static void
31512 {
31513 tree stmt;
31518 {
31566 }
31570 }
31571 \f
31572 /* Transactional Memory parsing routines. */
31574 /* Parse a transaction attribute.
31576 txn-attribute:
31577 attribute
31578 [ [ identifier ] ]
31580 ??? Simplify this when C++0x bracket attributes are
31581 implemented properly. */
31583 static tree
31585 {
31600 {
31604 /* For keywords, use the canonical spelling,
31605 not the parsed identifier. */
31609 }
31610 else
31614 error1:
31617 }
31619 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31621 transaction-statement:
31622 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31623 compound-statement
31624 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31625 */
31627 static tree
31629 {
31644 else
31645 {
31649 }
31651 /* Parse a noexcept specification. */
31654 /* Keep track if we're in the lexical scope of an outer transaction. */
31666 }
31668 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31670 transaction-expression:
31671 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31672 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31673 */
31675 static tree
31677 {
31702 /* Set this early. This might mean that we allow transaction_cancel in
31703 an expression that we find out later actually has to be a constexpr.
31704 However, we expect that cxx_constant_value will be able to deal with
31705 this; also, if the noexcept has no constexpr, then what we parse next
31706 really is a transaction's body. */
31709 /* Parse a noexcept specification. */
31715 {
31722 }
31723 else
31724 {
31725 /* The only expression that is available got parsed for the noexcept
31726 already. noexcept is true then. */
31729 }
31738 }
31740 /* Parse a function-transaction-block.
31742 function-transaction-block:
31743 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31744 function-body
31745 __transaction_atomic txn-attribute[opt] function-try-block
31746 __transaction_relaxed ctor-initializer[opt] function-body
31747 __transaction_relaxed function-try-block
31748 */
31750 static bool
31752 {
31768 else
31769 {
31773 }
31781 else
31782 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31790 }
31792 /* Parse a __transaction_cancel statement.
31794 cancel-statement:
31795 __transaction_cancel txn-attribute[opt] ;
31796 __transaction_cancel txn-attribute[opt] throw-expression ;
31798 ??? Cancel and throw is not yet implemented. */
31800 static tree
31802 {
31808 RT_TRANSACTION_CANCEL);
31815 /* ??? Parse cancel-and-throw here. */
31820 {
31824 }
31826 {
31830 }
31832 {
31835 {
31841 }
31842 }
31844 {
31848 }
31854 }
31855 \f
31856 /* The parser. */
31860 \f
31861 /* Special handling for the first token or line in the file. The first
31862 thing in the file might be #pragma GCC pch_preprocess, which loads a
31863 PCH file, which is a GC collection point. So we need to handle this
31864 first pragma without benefit of an existing lexer structure.
31866 Always returns one token to the caller in *FIRST_TOKEN. This is
31867 either the true first token of the file, or the first token after
31868 the initial pragma. */
31870 static void
31872 {
31881 {
31888 }
31889 else
31892 /* Skip to the end of the pragma. */
31896 /* Now actually load the PCH file. */
31900 /* Read one more token to return to our caller. We have to do this
31901 after reading the PCH file in, since its pointers have to be
31902 live. */
31904 }
31906 /* Parses the grainsize pragma for the _Cilk_for statement.
31907 Syntax:
31908 #pragma cilk grainsize = <VALUE>. */
31910 static void
31912 {
31914 {
31919 {
31922 }
31924 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
31927 else
31929 "%<#pragma cilk grainsize%> is not followed by "
31932 }
31934 }
31936 /* Normal parsing of a pragma token. Here we can (and must) use the
31937 regular lexer. */
31939 static bool
31941 {
31953 {
31961 {
31971 }
31976 {
31986 }
31991 {
31997 "%<#pragma omp taskwait%> may only be "
32002 }
32007 {
32013 "%<#pragma omp taskyield%> may only be "
32018 }
32023 {
32029 "%<#pragma omp cancel%> may only be "
32034 }
32039 {
32045 "%<#pragma omp cancellation point%> may only be "
32050 }
32088 "%<#pragma omp section%> may only be used in "
32093 {
32100 {
32103 }
32106 }
32110 {
32114 }
32120 {
32124 }
32126 /* Ignore the pragma if Cilk Plus is not enabled. */
32128 {
32131 }
32132 else
32133 {
32137 }
32144 bad_stmt:
32147 }
32151 }
32153 /* The interface the pragma parsers have to the lexer. */
32155 enum cpp_ttype
32157 {
32170 else
32171 {
32175 }
32178 }
32180 \f
32181 /* External interface. */
32183 /* Parse one entire translation unit. */
32185 void
32187 {
32199 }
32201 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
32202 vectorlength clause:
32203 Syntax:
32204 vectorlength ( constant-expression ) */
32206 static tree
32209 {
32211 tree expr;
32212 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
32213 safelen clause. Thus, vectorlength is represented as OMP 4.0
32214 safelen. For SIMD-enabled function it is represented by OMP 4.0
32215 simdlen. */
32218 loc);
32219 else
32221 loc);
32229 /* If expr == error_mark_node, then don't emit any errors nor
32230 create a clause. if any of the above functions returns
32231 error mark node then they would have emitted an error message. */
32233 ;
32241 else
32242 {
32243 tree c;
32245 {
32250 }
32251 else
32252 {
32257 }
32258 }
32263 }
32265 /* Handles the Cilk Plus #pragma simd linear clause.
32266 Syntax:
32267 linear ( simd-linear-variable-list )
32269 simd-linear-variable-list:
32270 simd-linear-variable
32271 simd-linear-variable-list , simd-linear-variable
32273 simd-linear-variable:
32274 id-expression
32275 id-expression : simd-linear-step
32277 simd-linear-step:
32278 conditional-expression */
32280 static tree
32282 {
32288 {
32292 }
32297 {
32300 {
32304 }
32311 {
32315 }
32316 else
32317 {
32321 /* If present, parse the linear step. Otherwise, assume the default
32322 value of 1. */
32324 {
32331 {
32332 /* If an error has occurred, then the whole pragma is
32333 considered ill-formed. Thus, no reason to keep
32334 parsing. */
32337 }
32345 else
32347 "step size must be an integer constant "
32349 }
32351 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
32357 }
32362 else
32363 {
32368 }
32369 }
32373 }
32375 /* Returns the name of the next clause. If the clause is not
32376 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
32377 token is not consumed. Otherwise, the appropriate enum from the
32378 pragma_simd_clause is returned and the token is consumed. */
32380 static pragma_omp_clause
32382 {
32383 pragma_omp_clause clause_type;
32400 else
32405 }
32407 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
32409 static tree
32411 {
32416 {
32417 pragma_omp_clause c_kind;
32424 /* Use the OpenMP 4.0 equivalent function. */
32427 /* Use the OpenMP 4.0 equivalent function. */
32429 clauses);
32431 /* Use the OMP 4.0 equivalent function. */
32433 clauses);
32435 /* Use the OMP 4.0 equivalent function. */
32437 else
32438 {
32442 }
32443 }
32449 else
32451 }
32453 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
32455 static void
32457 {
32464 {
32468 }
32477 }
32479 /* Main entry-point for parsing Cilk Plus _Cilk_for
32480 loops. The return value is error_mark_node
32481 when errors happen and CILK_FOR tree on success. */
32483 static tree
32485 {
32500 else
32506 }
32508 /* Create an identifier for a generic parameter type (a synthesized
32509 template parameter implied by `auto' or a concept identifier). */
32512 static tree
32514 {
32518 }
32520 /* Predicate that behaves as is_auto_or_concept but matches the parent
32521 node of the generic type rather than the generic type itself. This
32522 allows for type transformation in add_implicit_template_parms. */
32526 {
32528 }
32530 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
32531 (creating a new template parameter list if necessary). Returns the newly
32532 created template type parm. */
32534 tree
32536 {
32539 /* We are either continuing a function template that already contains implicit
32540 template parameters, creating a new fully-implicit function template, or
32541 extending an existing explicit function template with implicit template
32542 parameters. */
32550 {
32554 }
32555 else
32556 {
32557 /* Roll back to the existing template parameter scope (in the case of
32558 extending an explicit function template) or introduce a new template
32559 parameter scope ahead of the function parameter scope (or class scope
32560 in the case of out-of-line member definitions). The function scope is
32561 added back after template parameter synthesis below. */
32566 {
32569 }
32571 {
32572 /* If not defining a class, then any class scope is a scope level in
32573 an out-of-line member definition. In this case simply wind back
32574 beyond the first such scope to inject the template parameter list.
32575 Otherwise wind back to the class being defined. The latter can
32576 occur in class member friend declarations such as:
32578 class A {
32579 void foo (auto);
32580 };
32581 class B {
32582 friend void A::foo (auto);
32583 };
32585 The template parameter list synthesized for the friend declaration
32586 must be injected in the scope of 'B'. This can also occur in
32587 erroneous cases such as:
32589 struct A {
32590 struct B {
32591 void foo (auto);
32592 };
32593 void B::foo (auto) {}
32594 };
32596 Here the attempted definition of 'B::foo' within 'A' is ill-formed
32597 but, nevertheless, the template parameter list synthesized for the
32598 declarator should be injected into the scope of 'A' as if the
32599 ill-formed template was specified explicitly. */
32602 {
32605 }
32606 }
32612 {
32613 /* Introduce a new template parameter list for implicit template
32614 parameters. */
32618 parser->implicit_template_scope
32625 }
32626 else
32627 {
32628 /* Synthesize implicit template parameters at the end of the explicit
32629 template parameter list. */
32636 parser->implicit_template_parms
32638 }
32639 }
32641 /* Synthesize a new template parameter and track the current template
32642 parameter chain with implicit_template_parms. */
32646 synth_id);
32647 tree new_parm
32649 input_location,
32656 parser->implicit_template_parms
32658 else
32663 /* If creating a fully implicit function template, start the new implicit
32664 template parameter list with this synthesized type, otherwise grow the
32665 current template parameter list. */
32668 {
32675 }
32676 else
32677 {
32682 }
32687 }
32689 /* Finish the declaration of a fully implicit function template. Such a
32690 template has no explicit template parameter list so has not been through the
32691 normal template head and tail processing. synthesize_implicit_template_parm
32692 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32693 provided if the declaration is a class member such that its template
32694 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32695 form is returned. Otherwise NULL_TREE is returned. */
32697 tree
32699 {
32704 {
32708 }
32718 }