| blob | b8e182af5d765985ffe0ac002dbae255611a492e |
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. */
9828 {
9829 /* Consume the `...' token. */
9835 /* We don't need to emit warnings here, as the common code
9836 will do this for us. */
9837 }
9838 else
9843 else
9846 expr);
9847 }
9851 /* Consume the `default' token. */
9856 else
9861 /* Anything else must be an ordinary label. */
9864 }
9866 /* Require the `:' token. */
9869 /* An ordinary label may optionally be followed by attributes.
9870 However, this is only permitted if the attributes are then
9871 followed by a semicolon. This is because, for backward
9872 compatibility, when parsing
9873 lab: __attribute__ ((unused)) int i;
9874 we want the attribute to attach to "i", not "lab". */
9877 {
9878 tree attrs;
9885 ;
9886 else
9888 }
9894 }
9896 /* Parse an expression-statement.
9898 expression-statement:
9899 expression [opt] ;
9901 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9902 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9903 indicates whether this expression-statement is part of an
9904 expression statement. */
9906 static tree
9908 {
9912 /* If the next token is a ';', then there is no expression
9913 statement. */
9915 {
9919 {
9922 }
9923 }
9925 /* Give a helpful message for "A<T>::type t;" and the like. */
9928 {
9935 {
9936 /* A::A a; */
9941 }
9942 }
9944 /* Consume the final `;'. */
9949 /* This is the final expression statement of a statement
9950 expression. */
9956 }
9958 /* Parse a compound-statement.
9960 compound-statement:
9961 { statement-seq [opt] }
9963 GNU extension:
9965 compound-statement:
9966 { label-declaration-seq [opt] statement-seq [opt] }
9968 label-declaration-seq:
9969 label-declaration
9970 label-declaration-seq label-declaration
9972 Returns a tree representing the statement. */
9974 static tree
9977 {
9978 tree compound_stmt;
9980 /* Consume the `{'. */
9987 /* Begin the compound-statement. */
9989 /* If the next keyword is `__label__' we have a label declaration. */
9992 /* Parse an (optional) statement-seq. */
9994 /* Finish the compound-statement. */
9996 /* Consume the `}'. */
10000 }
10002 /* Parse an (optional) statement-seq.
10004 statement-seq:
10005 statement
10006 statement-seq [opt] statement */
10008 static void
10010 {
10011 /* Scan statements until there aren't any more. */
10013 {
10016 /* If we are looking at a `}', then we have run out of
10017 statements; the same is true if we have reached the end
10018 of file, or have stumbled upon a stray '@end'. */
10025 /* If we are in a compound statement and find 'else' then
10026 something went wrong. */
10028 {
10031 else
10032 {
10035 }
10036 }
10038 /* Parse the statement. */
10040 }
10041 }
10043 /* Parse a selection-statement.
10045 selection-statement:
10046 if ( condition ) statement
10047 if ( condition ) statement else statement
10048 switch ( condition ) statement
10050 Returns the new IF_STMT or SWITCH_STMT.
10052 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10053 is a (possibly labeled) if statement which is not enclosed in
10054 braces and has an else clause. This is used to implement
10055 -Wparentheses. */
10057 static tree
10059 {
10066 /* Peek at the next token. */
10069 /* See what kind of keyword it is. */
10072 {
10075 {
10076 tree statement;
10077 tree condition;
10079 /* Look for the `('. */
10081 {
10084 }
10086 /* Begin the selection-statement. */
10089 else
10092 /* Parse the condition. */
10094 /* Look for the `)'. */
10100 {
10104 /* Add the condition. */
10107 /* Parse the then-clause. */
10111 {
10119 }
10120 else
10126 /* If the next token is `else', parse the else-clause. */
10128 RID_ELSE))
10129 {
10130 /* Consume the `else' keyword. */
10133 /* Parse the else-clause. */
10135 {
10136 location_t loc;
10143 }
10144 else
10149 /* If we are currently parsing a then-clause, then
10150 IF_P will not be NULL. We set it to true to
10151 indicate that this if statement has an else clause.
10152 This may trigger the Wparentheses warning below
10153 when we get back up to the parent if statement. */
10156 }
10157 else
10158 {
10159 /* This if statement does not have an else clause. If
10160 NESTED_IF is true, then the then-clause is an if
10161 statement which does have an else clause. We warn
10162 about the potential ambiguity. */
10165 "suggest explicit braces to avoid ambiguous"
10167 }
10169 /* Now we're all done with the if-statement. */
10171 }
10172 else
10173 {
10177 /* Add the condition. */
10180 /* Parse the body of the switch-statement. */
10189 /* Now we're all done with the switch-statement. */
10191 }
10194 }
10200 }
10201 }
10203 /* Parse a condition.
10205 condition:
10206 expression
10207 type-specifier-seq declarator = initializer-clause
10208 type-specifier-seq declarator braced-init-list
10210 GNU Extension:
10212 condition:
10213 type-specifier-seq declarator asm-specification [opt]
10214 attributes [opt] = assignment-expression
10216 Returns the expression that should be tested. */
10218 static tree
10220 {
10221 cp_decl_specifier_seq type_specifiers;
10225 /* Try the declaration first. */
10227 /* New types are not allowed in the type-specifier-seq for a
10228 condition. */
10230 parser->type_definition_forbidden_message
10232 /* Parse the type-specifier-seq. */
10234 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10237 /* Restore the saved message. */
10239 /* If all is well, we might be looking at a declaration. */
10241 {
10242 tree decl;
10243 tree asm_specification;
10244 tree attributes;
10248 /* Parse the declarator. */
10254 /* Parse the attributes. */
10256 /* Parse the asm-specification. */
10258 /* If the next token is not an `=' or '{', then we might still be
10259 looking at an expression. For example:
10261 if (A(a).x)
10263 looks like a decl-specifier-seq and a declarator -- but then
10264 there is no `=', so this is an expression. */
10269 /* If we did see an `=' or '{', then we are looking at a declaration
10270 for sure. */
10272 {
10273 tree pushed_scope;
10277 /* Create the declaration. */
10283 /* Parse the initializer. */
10285 {
10289 }
10290 else
10291 {
10292 /* Consume the `='. */
10295 }
10299 /* Process the initializer. */
10302 asm_specification,
10303 flags);
10309 }
10310 }
10311 /* If we didn't even get past the declarator successfully, we are
10312 definitely not looking at a declaration. */
10313 else
10316 /* Otherwise, we are looking at an expression. */
10318 }
10320 /* Parses a for-statement or range-for-statement until the closing ')',
10321 not included. */
10323 static tree
10325 {
10329 /* Begin the for-statement. */
10332 /* Parse the initialization. */
10337 else
10339 }
10341 static tree
10343 {
10344 /* Normal for loop */
10347 tree stmt;
10350 /* The for-init-statement has already been parsed in
10351 cp_parser_for_init_statement, so no work is needed here. */
10354 /* If there's a condition, process it. */
10358 {
10362 }
10364 /* Look for the `;'. */
10367 /* If there's an expression, process it. */
10373 }
10375 /* Tries to parse a range-based for-statement:
10377 range-based-for:
10378 decl-specifier-seq declarator : expression
10380 The decl-specifier-seq declarator and the `:' are already parsed by
10381 cp_parser_for_init_statement. If processing_template_decl it returns a
10382 newly created RANGE_FOR_STMT; if not, it is converted to a
10383 regular FOR_STMT. */
10385 static tree
10388 {
10392 {
10395 }
10396 else
10399 /* If in template, STMT is converted to a normal for-statement
10400 at instantiation. If not, it is done just ahead. */
10402 {
10410 /* do_auto_deduction doesn't mess with template init-lists. */
10413 }
10414 else
10415 {
10418 }
10420 }
10422 /* Subroutine of cp_convert_range_for: given the initializer expression,
10423 builds up the range temporary. */
10425 static tree
10427 {
10430 /* Find out the type deduced by the declaration
10431 `auto &&__range = range_expr'. */
10436 /* Create the __range variable. */
10443 }
10445 /* Used by cp_parser_range_for in template context: we aren't going to
10446 do a full conversion yet, but we still need to resolve auto in the
10447 type of the for-range-declaration if present. This is basically
10448 a shortcut version of cp_convert_range_for. */
10450 static void
10452 {
10455 {
10458 iter_type = (cp_parser_perform_range_for_lookup
10461 {
10463 iter_type);
10465 tf_warning_or_error);
10468 }
10469 }
10470 }
10472 /* Converts a range-based for-statement into a normal
10473 for-statement, as per the definition.
10475 for (RANGE_DECL : RANGE_EXPR)
10476 BLOCK
10478 should be equivalent to:
10480 {
10481 auto &&__range = RANGE_EXPR;
10482 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10483 __begin != __end;
10484 ++__begin)
10485 {
10486 RANGE_DECL = *__begin;
10487 BLOCK
10488 }
10489 }
10491 If RANGE_EXPR is an array:
10492 BEGIN_EXPR = __range
10493 END_EXPR = __range + ARRAY_SIZE(__range)
10494 Else if RANGE_EXPR has a member 'begin' or 'end':
10495 BEGIN_EXPR = __range.begin()
10496 END_EXPR = __range.end()
10497 Else:
10498 BEGIN_EXPR = begin(__range)
10499 END_EXPR = end(__range);
10501 If __range has a member 'begin' but not 'end', or vice versa, we must
10502 still use the second alternative (it will surely fail, however).
10503 When calling begin()/end() in the third alternative we must use
10504 argument dependent lookup, but always considering 'std' as an associated
10505 namespace. */
10507 tree
10510 {
10516 /* If an error happened previously do nothing or else a lot of
10517 unhelpful errors would be issued. */
10519 else
10520 {
10521 tree range_temp;
10525 /* Can't bind a reference to an array of runtime bound. */
10527 else
10528 {
10533 LOOKUP_ONLYCONVERTING);
10535 }
10538 }
10540 /* The new for initialization statement. */
10548 LOOKUP_ONLYCONVERTING);
10557 LOOKUP_ONLYCONVERTING);
10561 /* The new for condition. */
10568 /* The new increment expression. */
10571 tf_warning_or_error);
10574 /* The declaration is initialized with *__begin inside the loop body. */
10577 tf_warning_or_error),
10579 LOOKUP_ONLYCONVERTING);
10582 }
10584 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10585 We need to solve both at the same time because the method used
10586 depends on the existence of members begin or end.
10587 Returns the type deduced for the iterator expression. */
10589 static tree
10591 {
10593 {
10596 }
10599 {
10604 }
10606 {
10607 /* If RANGE is an array, we will use pointer arithmetic. */
10610 range,
10614 }
10615 else
10616 {
10617 /* If it is not an array, we must do a bit of magic. */
10627 tf_warning_or_error);
10630 tf_warning_or_error);
10633 {
10634 /* Use the member functions. */
10637 else
10643 else
10646 }
10647 else
10648 {
10649 /* Use global functions with ADL. */
10656 tf_warning_or_error);
10658 tf_warning_or_error);
10660 tf_warning_or_error);
10662 tf_warning_or_error);
10665 }
10667 /* Last common checks. */
10669 {
10670 /* If one of the expressions is an error do no more checks. */
10673 }
10676 /* Can happen, when, eg, in a template context, Koenig lookup
10677 can't resolve begin/end (c++/58503). */
10679 else
10680 {
10682 /* The unqualified type of the __begin and __end temporaries should
10683 be the same, as required by the multiple auto declaration. */
10689 }
10690 }
10691 }
10693 /* Helper function for cp_parser_perform_range_for_lookup.
10694 Builds a tree for RANGE.IDENTIFIER(). */
10696 static tree
10698 {
10711 tf_warning_or_error);
10714 }
10716 /* Parse an iteration-statement.
10718 iteration-statement:
10719 while ( condition ) statement
10720 do statement while ( expression ) ;
10721 for ( for-init-statement condition [opt] ; expression [opt] )
10722 statement
10724 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10726 static tree
10728 {
10731 tree statement;
10734 /* Peek at the next token. */
10739 /* Remember whether or not we are already within an iteration
10740 statement. */
10743 /* See what kind of keyword it is. */
10746 {
10748 {
10749 tree condition;
10751 /* Begin the while-statement. */
10753 /* Look for the `('. */
10755 /* Parse the condition. */
10758 /* Look for the `)'. */
10760 /* Parse the dependent statement. */
10764 /* We're done with the while-statement. */
10766 }
10770 {
10771 tree expression;
10773 /* Begin the do-statement. */
10775 /* Parse the body of the do-statement. */
10780 /* Look for the `while' keyword. */
10782 /* Look for the `('. */
10784 /* Parse the expression. */
10786 /* We're done with the do-statement. */
10788 /* Look for the `)'. */
10790 /* Look for the `;'. */
10792 }
10796 {
10797 /* Look for the `('. */
10802 /* Look for the `)'. */
10805 /* Parse the body of the for-statement. */
10810 /* We're done with the for-statement. */
10812 }
10819 }
10822 }
10824 /* Parse a for-init-statement or the declarator of a range-based-for.
10825 Returns true if a range-based-for declaration is seen.
10827 for-init-statement:
10828 expression-statement
10829 simple-declaration */
10831 static bool
10833 {
10834 /* If the next token is a `;', then we have an empty
10835 expression-statement. Grammatically, this is also a
10836 simple-declaration, but an invalid one, because it does not
10837 declare anything. Therefore, if we did not handle this case
10838 specially, we would issue an error message about an invalid
10839 declaration. */
10841 {
10847 {
10848 /* N3994 -- for (id : init) ... */
10851 "type-specifier only available with "
10859 }
10861 /* A colon is used in range-based for. */
10864 /* We're going to speculatively look for a declaration, falling back
10865 to an expression, if necessary. */
10867 /* Parse the declaration. */
10870 decl);
10873 {
10874 /* It is a range-for, consume the ':' */
10878 {
10880 "range-based %<for%> loops only available with "
10883 }
10884 }
10885 else
10886 /* The ';' is not consumed yet because we told
10887 cp_parser_simple_declaration not to. */
10892 /* If the tentative parse failed, then we shall need to look for an
10893 expression-statement. */
10894 }
10895 /* If we are here, it is an expression-statement. */
10898 }
10900 /* Parse a jump-statement.
10902 jump-statement:
10903 break ;
10904 continue ;
10905 return expression [opt] ;
10906 return braced-init-list ;
10907 goto identifier ;
10909 GNU extension:
10911 jump-statement:
10912 goto * expression ;
10914 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10916 static tree
10918 {
10924 /* Peek at the next token. */
10929 /* See what kind of keyword it is. */
10932 {
10936 {
10956 }
10962 {
10969 /* Fall through. */
10979 }
10984 {
10985 tree expr;
10989 {
10993 }
10996 else
10997 /* If the next token is a `;', then there is no
10998 expression. */
11000 /* Build the return-statement. */
11002 /* Look for the final `;'. */
11004 }
11010 {
11013 }
11015 /* Create the goto-statement. */
11017 {
11018 /* Issue a warning about this use of a GNU extension. */
11020 /* Consume the '*' token. */
11022 /* Parse the dependent expression. */
11024 }
11025 else
11027 /* Look for the final `;'. */
11034 }
11037 }
11039 /* Parse a declaration-statement.
11041 declaration-statement:
11042 block-declaration */
11044 static void
11046 {
11049 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11052 /* Parse the block-declaration. */
11055 /* Free any declarators allocated. */
11057 }
11059 /* Some dependent statements (like `if (cond) statement'), are
11060 implicitly in their own scope. In other words, if the statement is
11061 a single statement (as opposed to a compound-statement), it is
11062 none-the-less treated as if it were enclosed in braces. Any
11063 declarations appearing in the dependent statement are out of scope
11064 after control passes that point. This function parses a statement,
11065 but ensures that is in its own scope, even if it is not a
11066 compound-statement.
11068 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11069 is a (possibly labeled) if statement which is not enclosed in
11070 braces and has an else clause. This is used to implement
11071 -Wparentheses.
11073 Returns the new statement. */
11075 static tree
11077 {
11078 tree statement;
11083 /* Mark if () ; with a special NOP_EXPR. */
11085 {
11089 }
11090 /* if a compound is opened, we simply parse the statement directly. */
11093 /* If the token is not a `{', then we must take special action. */
11094 else
11095 {
11096 /* Create a compound-statement. */
11098 /* Parse the dependent-statement. */
11100 /* Finish the dummy compound-statement. */
11102 }
11104 /* Return the statement. */
11106 }
11108 /* For some dependent statements (like `while (cond) statement'), we
11109 have already created a scope. Therefore, even if the dependent
11110 statement is a compound-statement, we do not want to create another
11111 scope. */
11113 static void
11115 {
11116 /* If the token is a `{', then we must take special action. */
11119 else
11120 {
11121 /* Avoid calling cp_parser_compound_statement, so that we
11122 don't create a new scope. Do everything else by hand. */
11124 /* If the next keyword is `__label__' we have a label declaration. */
11127 /* Parse an (optional) statement-seq. */
11130 }
11131 }
11133 /* Declarations [gram.dcl.dcl] */
11135 /* Parse an optional declaration-sequence.
11137 declaration-seq:
11138 declaration
11139 declaration-seq declaration */
11141 static void
11143 {
11145 {
11156 {
11157 /* A declaration consisting of a single semicolon is
11158 invalid. Allow it unless we're being pedantic. */
11163 }
11165 /* If we're entering or exiting a region that's implicitly
11166 extern "C", modify the lang context appropriately. */
11168 {
11171 }
11173 {
11176 }
11179 {
11180 /* A top-level declaration can consist solely of a #pragma.
11181 A nested declaration cannot, so this is done here and not
11182 in cp_parser_declaration. (A #pragma at block scope is
11183 handled in cp_parser_statement.) */
11186 }
11188 /* Parse the declaration itself. */
11190 }
11191 }
11193 /* Parse a declaration.
11195 declaration:
11196 block-declaration
11197 function-definition
11198 template-declaration
11199 explicit-instantiation
11200 explicit-specialization
11201 linkage-specification
11202 namespace-definition
11204 GNU extension:
11206 declaration:
11207 __extension__ declaration */
11209 static void
11211 {
11212 cp_token token1;
11213 cp_token token2;
11218 /* Check for the `__extension__' keyword. */
11220 {
11221 /* Parse the qualified declaration. */
11223 /* Restore the PEDANTIC flag. */
11227 }
11229 /* Try to figure out what kind of declaration is present. */
11234 else
11235 {
11238 }
11240 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11243 /* If the next token is `extern' and the following token is a string
11244 literal, then we have a linkage specification. */
11248 /* If the next token is `template', then we have either a template
11249 declaration, an explicit instantiation, or an explicit
11250 specialization. */
11252 {
11253 /* `template <>' indicates a template specialization. */
11257 /* `template <' indicates a template declaration. */
11260 /* Anything else must be an explicit instantiation. */
11261 else
11263 }
11264 /* If the next token is `export', then we have a template
11265 declaration. */
11268 /* If the next token is `extern', 'static' or 'inline' and the one
11269 after that is `template', we have a GNU extended explicit
11270 instantiation directive. */
11277 /* If the next token is `namespace', check for a named or unnamed
11278 namespace definition. */
11284 /* An unnamed namespace definition. */
11288 /* An inline (associated) namespace definition. */
11292 /* Objective-C++ declaration/definition. */
11299 /* We must have either a block declaration or a function
11300 definition. */
11301 else
11302 /* Try to parse a block-declaration, or a function-definition. */
11305 /* Free any declarators allocated. */
11307 }
11309 /* Parse a block-declaration.
11311 block-declaration:
11312 simple-declaration
11313 asm-definition
11314 namespace-alias-definition
11315 using-declaration
11316 using-directive
11318 GNU Extension:
11320 block-declaration:
11321 __extension__ block-declaration
11323 C++0x Extension:
11325 block-declaration:
11326 static_assert-declaration
11328 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11329 part of a declaration-statement. */
11331 static void
11334 {
11338 /* Check for the `__extension__' keyword. */
11340 {
11341 /* Parse the qualified declaration. */
11343 /* Restore the PEDANTIC flag. */
11347 }
11349 /* Peek at the next token to figure out which kind of declaration is
11350 present. */
11353 /* If the next keyword is `asm', we have an asm-definition. */
11355 {
11359 }
11360 /* If the next keyword is `namespace', we have a
11361 namespace-alias-definition. */
11364 /* If the next keyword is `using', we have a
11365 using-declaration, a using-directive, or an alias-declaration. */
11367 {
11372 /* If the token after `using' is `namespace', then we have a
11373 using-directive. */
11377 /* If the second token after 'using' is '=', then we have an
11378 alias-declaration. */
11384 /* Otherwise, it's a using-declaration. */
11385 else
11388 }
11389 /* If the next keyword is `__label__' we have a misplaced label
11390 declaration. */
11392 {
11396 /* If the next token is now a `;', consume it. */
11399 }
11400 /* If the next token is `static_assert' we have a static assertion. */
11403 /* Anything else must be a simple-declaration. */
11404 else
11407 }
11409 /* Parse a simple-declaration.
11411 simple-declaration:
11412 decl-specifier-seq [opt] init-declarator-list [opt] ;
11414 init-declarator-list:
11415 init-declarator
11416 init-declarator-list , init-declarator
11418 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11419 function-definition as a simple-declaration.
11421 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11422 parsed declaration if it is an uninitialized single declarator not followed
11423 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11424 if present, will not be consumed. */
11426 static void
11430 {
11431 cp_decl_specifier_seq decl_specifiers;
11438 /* Defer access checks until we know what is being declared; the
11439 checks for names appearing in the decl-specifier-seq should be
11440 done as if we were in the scope of the thing being declared. */
11443 /* Parse the decl-specifier-seq. We have to keep track of whether
11444 or not the decl-specifier-seq declares a named class or
11445 enumeration type, since that is the only case in which the
11446 init-declarator-list is allowed to be empty.
11448 [dcl.dcl]
11450 In a simple-declaration, the optional init-declarator-list can be
11451 omitted only when declaring a class or enumeration, that is when
11452 the decl-specifier-seq contains either a class-specifier, an
11453 elaborated-type-specifier, or an enum-specifier. */
11455 CP_PARSER_FLAGS_OPTIONAL,
11458 /* We no longer need to defer access checks. */
11461 /* In a block scope, a valid declaration must always have a
11462 decl-specifier-seq. By not trying to parse declarators, we can
11463 resolve the declaration/expression ambiguity more quickly. */
11466 {
11469 }
11471 /* If the next two tokens are both identifiers, the code is
11472 erroneous. The usual cause of this situation is code like:
11474 T t;
11476 where "T" should name a type -- but does not. */
11479 {
11480 /* If parsing tentatively, we should commit; we really are
11481 looking at a declaration. */
11483 /* Give up. */
11485 }
11487 /* If we have seen at least one decl-specifier, and the next token
11488 is not a parenthesis, then we must be looking at a declaration.
11489 (After "int (" we might be looking at a functional cast.) */
11496 /* Keep going until we hit the `;' at the end of the simple
11497 declaration. */
11500 CPP_SEMICOLON))
11501 {
11504 tree decl;
11507 {
11508 /* If we are processing next declarator, coma is expected */
11514 }
11515 else
11518 /* Parse the init-declarator. */
11521 function_definition_allowed_p,
11523 declares_class_or_enum,
11525 maybe_range_for_decl);
11526 /* If an error occurred while parsing tentatively, exit quickly.
11527 (That usually happens when in the body of a function; each
11528 statement is treated as a declaration-statement until proven
11529 otherwise.) */
11532 /* Handle function definitions specially. */
11534 {
11535 /* If the next token is a `,', then we are probably
11536 processing something like:
11538 void f() {}, *p;
11540 which is erroneous. */
11542 {
11545 "mixing"
11547 }
11548 /* Otherwise, we're done with the list of declarators. */
11549 else
11550 {
11553 }
11554 }
11557 /* The next token should be either a `,' or a `;'. */
11559 /* If it's a `,', there are more declarators to come. */
11562 /* If it's a `;', we are done. */
11565 /* Anything else is an error. */
11566 else
11567 {
11568 /* If we have already issued an error message we don't need
11569 to issue another one. */
11573 /* Skip tokens until we reach the end of the statement. */
11575 /* If the next token is now a `;', consume it. */
11579 }
11580 /* After the first time around, a function-definition is not
11581 allowed -- even if it was OK at first. For example:
11583 int i, f() {}
11585 is not valid. */
11587 }
11589 /* Issue an error message if no declarators are present, and the
11590 decl-specifier-seq does not itself declare a class or
11591 enumeration: [dcl.dcl]/3. */
11593 {
11595 {
11599 /* Ensure an error is issued anyway when finish_decltype_type,
11600 called via cp_parser_decl_specifier_seq, returns a class or
11601 an enumeration (c++/51786). */
11604 }
11605 /* Perform any deferred access checks. */
11607 }
11609 /* Consume the `;'. */
11613 done:
11615 }
11617 /* Parse a decl-specifier-seq.
11619 decl-specifier-seq:
11620 decl-specifier-seq [opt] decl-specifier
11621 decl-specifier attribute-specifier-seq [opt] (C++11)
11623 decl-specifier:
11624 storage-class-specifier
11625 type-specifier
11626 function-specifier
11627 friend
11628 typedef
11630 GNU Extension:
11632 decl-specifier:
11633 attributes
11635 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11637 The parser flags FLAGS is used to control type-specifier parsing.
11639 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11640 flags:
11642 1: one of the decl-specifiers is an elaborated-type-specifier
11643 (i.e., a type declaration)
11644 2: one of the decl-specifiers is an enum-specifier or a
11645 class-specifier (i.e., a type definition)
11647 */
11649 static void
11651 cp_parser_flags flags,
11654 {
11658 cp_decl_spec ds;
11660 /* Clear DECL_SPECS. */
11663 /* Assume no class or enumeration type is declared. */
11666 /* Keep reading specifiers until there are no more to read. */
11668 {
11673 /* Peek at the next token. */
11676 /* Save the first token of the decl spec list for error
11677 reporting. */
11680 /* Handle attributes. */
11682 {
11683 /* Parse the attributes. */
11686 /* In a sequence of declaration specifiers, c++11 attributes
11687 appertain to the type that precede them. In that case
11688 [dcl.spec]/1 says:
11690 The attribute-specifier-seq affects the type only for
11691 the declaration it appears in, not other declarations
11692 involving the same type.
11694 But for now let's force the user to position the
11695 attribute either at the beginning of the declaration or
11696 after the declarator-id, which would clearly mean that it
11697 applies to the declarator. */
11699 {
11701 /* The c++11 attribute is at the beginning of the
11702 declaration. It appertains to the entity being
11704 else
11705 {
11707 {
11708 /* This is an attribute following a
11709 class-specifier. */
11714 }
11715 else
11716 {
11717 decl_specs->std_attributes
11719 attrs);
11722 }
11724 }
11725 }
11727 decl_specs->attributes
11729 attrs);
11733 }
11734 /* Assume we will find a decl-specifier keyword. */
11736 /* If the next token is an appropriate keyword, we can simply
11737 add it to the list. */
11739 {
11740 /* decl-specifier:
11741 friend
11742 constexpr */
11745 {
11748 }
11749 else
11750 {
11752 /* Consume the token. */
11754 }
11762 /* function-specifier:
11763 inline
11764 virtual
11765 explicit */
11772 /* decl-specifier:
11773 typedef */
11776 /* Consume the token. */
11778 /* A constructor declarator cannot appear in a typedef. */
11780 /* The "typedef" keyword can only occur in a declaration; we
11781 may as well commit at this point. */
11788 /* storage-class-specifier:
11789 auto
11790 register
11791 static
11792 extern
11793 mutable
11795 GNU Extension:
11796 thread */
11799 {
11800 /* Consume the token. */
11803 /* Complain about `auto' as a storage specifier, if
11804 we're complaining about C++0x compatibility. */
11808 /* Set the storage class anyway. */
11810 token);
11811 }
11812 else
11813 /* C++0x auto type-specifier. */
11821 /* Consume the token. */
11824 token);
11827 /* Consume the token. */
11833 /* We did not yet find a decl-specifier yet. */
11836 }
11846 /* Constructors are a special case. The `S' in `S()' is not a
11847 decl-specifier; it is the beginning of the declarator. */
11848 constructor_p
11849 = (!found_decl_spec
11850 && constructor_possible_p
11851 && (cp_parser_constructor_declarator_p
11854 /* If we don't have a DECL_SPEC yet, then we must be looking at
11855 a type-specifier. */
11857 {
11860 tree type_spec;
11862 type_spec
11864 decl_specs,
11870 /* If this type-specifier referenced a user-defined type
11871 (a typedef, class-name, etc.), then we can't allow any
11872 more such type-specifiers henceforth.
11874 [dcl.spec]
11876 The longest sequence of decl-specifiers that could
11877 possibly be a type name is taken as the
11878 decl-specifier-seq of a declaration. The sequence shall
11879 be self-consistent as described below.
11881 [dcl.type]
11883 As a general rule, at most one type-specifier is allowed
11884 in the complete decl-specifier-seq of a declaration. The
11885 only exceptions are the following:
11887 -- const or volatile can be combined with any other
11888 type-specifier.
11890 -- signed or unsigned can be combined with char, long,
11891 short, or int.
11893 -- ..
11895 Example:
11897 typedef char* Pc;
11898 void g (const int Pc);
11900 Here, Pc is *not* part of the decl-specifier seq; it's
11901 the declarator. Therefore, once we see a type-specifier
11902 (other than a cv-qualifier), we forbid any additional
11903 user-defined types. We *do* still allow things like `int
11904 int' to be considered a decl-specifier-seq, and issue the
11905 error message later. */
11908 /* A constructor declarator cannot follow a type-specifier. */
11910 {
11915 }
11916 }
11918 /* If we still do not have a DECL_SPEC, then there are no more
11919 decl-specifiers. */
11924 /* After we see one decl-specifier, further decl-specifiers are
11925 always optional. */
11927 }
11929 /* Don't allow a friend specifier with a class definition. */
11934 }
11936 /* Parse an (optional) storage-class-specifier.
11938 storage-class-specifier:
11939 auto
11940 register
11941 static
11942 extern
11943 mutable
11945 GNU Extension:
11947 storage-class-specifier:
11948 thread
11950 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11952 static tree
11954 {
11956 {
11960 /* Fall through for C++98. */
11967 /* Consume the token. */
11972 }
11973 }
11975 /* Parse an (optional) function-specifier.
11977 function-specifier:
11978 inline
11979 virtual
11980 explicit
11982 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11983 Updates DECL_SPECS, if it is non-NULL. */
11985 static tree
11988 {
11991 {
11997 /* 14.5.2.3 [temp.mem]
11999 A member function template shall not be virtual. */
12002 else
12012 }
12014 /* Consume the token. */
12016 }
12018 /* Parse a linkage-specification.
12020 linkage-specification:
12021 extern string-literal { declaration-seq [opt] }
12022 extern string-literal declaration */
12024 static void
12026 {
12027 tree linkage;
12029 /* Look for the `extern' keyword. */
12032 /* Look for the string-literal. */
12035 /* Transform the literal into an identifier. If the literal is a
12036 wide-character string, or contains embedded NULs, then we can't
12037 handle it as the user wants. */
12040 {
12042 /* Assume C++ linkage. */
12044 }
12045 else
12048 /* We're now using the new linkage. */
12051 /* If the next token is a `{', then we're using the first
12052 production. */
12054 {
12057 /* Consume the `{' token. */
12059 /* Parse the declarations. */
12061 /* Look for the closing `}'. */
12063 }
12064 /* Otherwise, there's just one declaration. */
12065 else
12066 {
12069 saved_in_unbraced_linkage_specification_p
12073 parser->in_unbraced_linkage_specification_p
12075 }
12077 /* We're done with the linkage-specification. */
12079 }
12081 /* Parse a static_assert-declaration.
12083 static_assert-declaration:
12084 static_assert ( constant-expression , string-literal ) ;
12086 If MEMBER_P, this static_assert is a class member. */
12088 static void
12090 {
12091 tree condition;
12092 tree message;
12094 location_t saved_loc;
12097 /* Peek at the `static_assert' token so we can keep track of exactly
12098 where the static assertion started. */
12102 /* Look for the `static_assert' keyword. */
12104 RT_STATIC_ASSERT))
12107 /* We know we are in a static assertion; commit to any tentative
12108 parse. */
12112 /* Parse the `(' starting the static assertion condition. */
12115 /* Parse the constant-expression. Allow a non-constant expression
12116 here in order to give better diagnostics in finish_static_assert. */
12117 condition =
12122 /* Parse the separating `,'. */
12125 /* Parse the string-literal message. */
12130 /* A `)' completes the static assertion. */
12137 /* A semicolon terminates the declaration. */
12140 /* Complete the static assertion, which may mean either processing
12141 the static assert now or saving it for template instantiation. */
12143 }
12145 /* Parse the expression in decltype ( expression ). */
12147 static tree
12150 {
12152 tree expr;
12154 /* First, try parsing an id-expression. */
12165 {
12168 cp_id_kind idk;
12172 /* Lookup the name we got back from the id-expression. */
12183 {
12184 /* Complete lookup of the id-expression. */
12185 expr = (finish_id_expression
12198 /* We found an id-expression, but it was something that we
12199 should not have found. This is an error, not something
12200 we can recover from, so note that we found an
12201 id-expression and we'll recover as gracefully as
12202 possible. */
12204 }
12209 /* We have an id-expression. */
12211 }
12214 {
12215 /* Abort the id-expression parse. */
12218 /* Parsing tentatively, again. */
12221 /* Parse a class member access. */
12229 /* We have an id-expression. */
12231 }
12234 /* We have parsed the complete id-expression or member access. */
12236 else
12237 {
12238 /* Abort our attempt to parse an id-expression or member access
12239 expression. */
12242 /* Parse a full expression. */
12245 }
12248 }
12250 /* Parse a `decltype' type. Returns the type.
12252 simple-type-specifier:
12253 decltype ( expression )
12254 C++14 proposal:
12255 decltype ( auto ) */
12257 static tree
12259 {
12260 tree expr;
12269 {
12270 /* Already parsed. */
12273 }
12275 /* Look for the `decltype' token. */
12279 /* Parse the opening `('. */
12283 /* decltype (auto) */
12286 {
12293 }
12295 /* Types cannot be defined in a `decltype' expression. Save away the
12296 old message. */
12299 /* And create the new one. */
12300 parser->type_definition_forbidden_message
12303 /* The restrictions on constant-expressions do not apply inside
12304 decltype expressions. */
12305 saved_integral_constant_expression_p
12307 saved_non_integral_constant_expression_p
12311 /* Within a parenthesized expression, a `>' token is always
12312 the greater-than operator. */
12313 saved_greater_than_is_operator_p
12317 /* Do not actually evaluate the expression. */
12320 /* Do not warn about problems with the expression. */
12325 /* Go back to evaluating expressions. */
12329 /* The `>' token might be the end of a template-id or
12330 template-parameter-list now. */
12331 parser->greater_than_is_operator_p
12334 /* Restore the old message and the integral constant expression
12335 flags. */
12337 parser->integral_constant_expression_p
12339 parser->non_integral_constant_expression_p
12342 /* Parse to the closing `)'. */
12344 {
12348 }
12351 tf_warning_or_error);
12353 rewrite:
12354 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12355 it again. */
12362 }
12364 /* Special member functions [gram.special] */
12366 /* Parse a conversion-function-id.
12368 conversion-function-id:
12369 operator conversion-type-id
12371 Returns an IDENTIFIER_NODE representing the operator. */
12373 static tree
12375 {
12376 tree type;
12377 tree saved_scope;
12378 tree saved_qualifying_scope;
12379 tree saved_object_scope;
12382 /* Look for the `operator' token. */
12385 /* When we parse the conversion-type-id, the current scope will be
12386 reset. However, we need that information in able to look up the
12387 conversion function later, so we save it here. */
12391 /* We must enter the scope of the class so that the names of
12392 entities declared within the class are available in the
12393 conversion-type-id. For example, consider:
12395 struct S {
12396 typedef int I;
12397 operator I();
12398 };
12400 S::operator I() { ... }
12402 In order to see that `I' is a type-name in the definition, we
12403 must be in the scope of `S'. */
12406 /* Parse the conversion-type-id. */
12408 /* Leave the scope of the class, if any. */
12411 /* Restore the saved scope. */
12415 /* If the TYPE is invalid, indicate failure. */
12419 }
12421 /* Parse a conversion-type-id:
12423 conversion-type-id:
12424 type-specifier-seq conversion-declarator [opt]
12426 Returns the TYPE specified. */
12428 static tree
12430 {
12431 tree attributes;
12432 cp_decl_specifier_seq type_specifiers;
12434 tree type_specified;
12437 /* Parse the attributes. */
12441 parser->type_definition_forbidden_message
12444 /* Parse the type-specifiers. */
12451 /* If that didn't work, stop. */
12454 /* Parse the conversion-declarator. */
12462 /* Don't give this error when parsing tentatively. This happens to
12463 work because we always parse this definitively once. */
12466 {
12468 {
12471 }
12475 }
12478 }
12480 /* Parse an (optional) conversion-declarator.
12482 conversion-declarator:
12483 ptr-operator conversion-declarator [opt]
12485 */
12489 {
12492 cp_cv_quals cv_quals;
12494 /* We don't know if there's a ptr-operator next, or not. */
12496 /* Try the ptr-operator. */
12499 /* If it worked, look for more conversion-declarators. */
12501 {
12504 /* Parse another optional declarator. */
12507 declarator = cp_parser_make_indirect_declarator
12511 }
12514 }
12516 /* Parse an (optional) ctor-initializer.
12518 ctor-initializer:
12519 : mem-initializer-list
12521 Returns TRUE iff the ctor-initializer was actually present. */
12523 static bool
12525 {
12526 /* If the next token is not a `:', then there is no
12527 ctor-initializer. */
12529 {
12530 /* Do default initialization of any bases and members. */
12535 }
12537 /* Consume the `:' token. */
12539 /* And the mem-initializer-list. */
12543 }
12545 /* Parse a mem-initializer-list.
12547 mem-initializer-list:
12548 mem-initializer ... [opt]
12549 mem-initializer ... [opt] , mem-initializer-list */
12551 static void
12553 {
12558 /* Let the semantic analysis code know that we are starting the
12559 mem-initializer-list. */
12564 /* Loop through the list. */
12566 {
12567 tree mem_initializer;
12570 /* Parse the mem-initializer. */
12572 /* If the next token is a `...', we're expanding member initializers. */
12574 {
12575 /* Consume the `...'. */
12578 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12579 can be expanded but members cannot. */
12582 {
12587 }
12589 /* Construct the pack expansion type. */
12592 }
12595 {
12599 }
12600 /* Look for a target constructor. */
12604 {
12607 {
12611 }
12613 }
12614 /* Add it to the list, unless it was erroneous. */
12616 {
12619 }
12620 /* If the next token is not a `,', we're done. */
12623 /* Consume the `,' token. */
12625 }
12627 /* Perform semantic analysis. */
12630 }
12632 /* Parse a mem-initializer.
12634 mem-initializer:
12635 mem-initializer-id ( expression-list [opt] )
12636 mem-initializer-id braced-init-list
12638 GNU extension:
12640 mem-initializer:
12641 ( expression-list [opt] )
12643 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12644 class) or FIELD_DECL (for a non-static data member) to initialize;
12645 the TREE_VALUE is the expression-list. An empty initialization
12646 list is represented by void_list_node. */
12648 static tree
12650 {
12651 tree mem_initializer_id;
12652 tree expression_list;
12653 tree member;
12656 /* Find out what is being initialized. */
12658 {
12662 }
12663 else
12664 {
12668 }
12674 {
12681 }
12682 else
12683 {
12693 }
12703 }
12705 /* Parse a mem-initializer-id.
12707 mem-initializer-id:
12708 :: [opt] nested-name-specifier [opt] class-name
12709 identifier
12711 Returns a TYPE indicating the class to be initializer for the first
12712 production. Returns an IDENTIFIER_NODE indicating the data member
12713 to be initialized for the second production. */
12715 static tree
12717 {
12721 tree id;
12725 /* `typename' is not allowed in this context ([temp.res]). */
12727 {
12729 "keyword %<typename%> not allowed in this context (a qualified "
12732 }
12733 /* Look for the optional `::' operator. */
12734 global_scope_p
12738 /* Look for the optional nested-name-specifier. The simplest way to
12739 implement:
12741 [temp.res]
12743 The keyword `typename' is not permitted in a base-specifier or
12744 mem-initializer; in these contexts a qualified name that
12745 depends on a template-parameter is implicitly assumed to be a
12746 type name.
12748 is to assume that we have seen the `typename' keyword at this
12749 point. */
12750 nested_name_specifier_p
12759 /* If there is a `::' operator or a nested-name-specifier, then we
12760 are definitely looking for a class-name. */
12765 typename_type,
12769 /* Otherwise, we could also be looking for an ordinary identifier. */
12771 /* Try a class-name. */
12775 none_type,
12779 /* If we found one, we're done. */
12782 /* Otherwise, look for an ordinary identifier. */
12784 }
12786 /* Overloading [gram.over] */
12788 /* Parse an operator-function-id.
12790 operator-function-id:
12791 operator operator
12793 Returns an IDENTIFIER_NODE for the operator which is a
12794 human-readable spelling of the identifier, e.g., `operator +'. */
12796 static tree
12798 {
12799 /* Look for the `operator' keyword. */
12802 /* And then the name of the operator itself. */
12804 }
12806 /* Return an identifier node for a user-defined literal operator.
12807 The suffix identifier is chained to the operator name identifier. */
12809 static tree
12811 {
12812 tree identifier;
12819 }
12821 /* Parse an operator.
12823 operator:
12824 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12825 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12826 || ++ -- , ->* -> () []
12828 GNU Extensions:
12830 operator:
12831 <? >? <?= >?=
12833 Returns an IDENTIFIER_NODE for the operator which is a
12834 human-readable spelling of the identifier, e.g., `operator +'. */
12836 static tree
12838 {
12843 /* Peek at the next token. */
12845 /* Figure out which operator we have. */
12847 {
12849 {
12852 /* The keyword should be either `new' or `delete'. */
12857 else
12860 /* Consume the `new' or `delete' token. */
12863 /* Peek at the next token. */
12865 /* If it's a `[' token then this is the array variant of the
12866 operator. */
12868 {
12869 /* Consume the `[' token. */
12871 /* Look for the `]' token. */
12875 }
12876 /* Otherwise, we have the non-array variant. */
12877 else
12881 }
13028 /* Consume the `('. */
13030 /* Look for the matching `)'. */
13035 /* Consume the `['. */
13037 /* Look for the matching `]'. */
13052 {
13059 /* Consume the string. */
13065 {
13068 }
13069 else
13070 {
13072 /* Look for the suffix identifier. */
13077 {
13081 }
13082 else
13083 {
13086 }
13087 }
13092 {
13095 }
13098 {
13101 }
13103 {
13106 }
13108 }
13111 /* Anything else is an error. */
13113 }
13115 /* If we have selected an identifier, we need to consume the
13116 operator token. */
13119 /* Otherwise, no valid operator name was present. */
13120 else
13121 {
13124 }
13127 }
13129 /* Parse a template-declaration.
13131 template-declaration:
13132 export [opt] template < template-parameter-list > declaration
13134 If MEMBER_P is TRUE, this template-declaration occurs within a
13135 class-specifier.
13137 The grammar rule given by the standard isn't correct. What
13138 is really meant is:
13140 template-declaration:
13141 export [opt] template-parameter-list-seq
13142 decl-specifier-seq [opt] init-declarator [opt] ;
13143 export [opt] template-parameter-list-seq
13144 function-definition
13146 template-parameter-list-seq:
13147 template-parameter-list-seq [opt]
13148 template < template-parameter-list > */
13150 static void
13152 {
13153 /* Check for `export'. */
13155 {
13156 /* Consume the `export' token. */
13158 /* Warn that we do not support `export'. */
13160 }
13163 }
13165 /* Parse a template-parameter-list.
13167 template-parameter-list:
13168 template-parameter
13169 template-parameter-list , template-parameter
13171 Returns a TREE_LIST. Each node represents a template parameter.
13172 The nodes are connected via their TREE_CHAINs. */
13174 static tree
13176 {
13181 /* The loop below parses the template parms. We first need to know
13182 the total number of template parms to be able to compute proper
13183 canonical types of each dependent type. So after the loop, when
13184 we know the total number of template parms,
13185 end_template_parm_list computes the proper canonical types and
13186 fixes up the dependent types accordingly. */
13188 {
13189 tree parameter;
13192 location_t parm_loc;
13194 /* Parse the template-parameter. */
13199 /* Add it to the list. */
13202 parm_loc,
13203 parameter,
13204 is_non_type,
13205 is_parameter_pack);
13206 else
13207 {
13210 }
13212 /* If the next token is not a `,', we're done. */
13215 /* Otherwise, consume the `,' token. */
13217 }
13220 }
13222 /* Parse a template-parameter.
13224 template-parameter:
13225 type-parameter
13226 parameter-declaration
13228 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13229 the parameter. The TREE_PURPOSE is the default value, if any.
13230 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13231 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13232 set to true iff this parameter is a parameter pack. */
13234 static tree
13237 {
13241 tree parm;
13243 /* Assume it is a type parameter or a template parameter. */
13245 /* Assume it not a parameter pack. */
13247 /* Peek at the next token. */
13249 /* If it is `class' or `template', we have a type-parameter. */
13252 /* If it is `class' or `typename' we do not know yet whether it is a
13253 type parameter or a non-type parameter. Consider:
13255 template <typename T, typename T::X X> ...
13257 or:
13259 template <class C, class D*> ...
13261 Here, the first parameter is a type parameter, and the second is
13262 a non-type parameter. We can tell by looking at the token after
13263 the identifier -- if it is a `,', `=', or `>' then we have a type
13264 parameter. */
13266 {
13267 /* Peek at the token after `class' or `typename'. */
13269 /* If it's an ellipsis, we have a template type parameter
13270 pack. */
13273 /* If it's an identifier, skip it. */
13276 /* Now, see if the token looks like the end of a template
13277 parameter. */
13282 }
13284 /* Otherwise, it is a non-type parameter.
13286 [temp.param]
13288 When parsing a default template-argument for a non-type
13289 template-parameter, the first non-nested `>' is taken as the end
13290 of the template parameter-list rather than a greater-than
13291 operator. */
13293 parameter_declarator
13300 /* If the parameter declaration is marked as a parameter pack, set
13301 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13302 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13303 grokdeclarator. */
13306 {
13309 }
13312 {
13313 /* Can happen in some cases of erroneous input (c++/34892). */
13315 /* Consume the `...' for better error recovery. */
13317 }
13318 /* If the next token is an ellipsis, and we don't already have it
13319 marked as a parameter pack, then we have a parameter pack (that
13320 has no declarator). */
13323 && (declarator_can_be_parameter_pack
13325 {
13326 /* Consume the `...'. */
13331 }
13332 /* We might end up with a pack expansion as the type of the non-type
13333 template parameter, in which case this is a non-type template
13334 parameter pack. */
13337 {
13341 }
13344 {
13345 /* Parameter packs cannot have default arguments. However, a
13346 user may try to do so, so we'll parse them and give an
13347 appropriate diagnostic here. */
13351 /* Find the name of the parameter pack. */
13360 else
13364 /* Parse the default argument, but throw away the result. */
13366 }
13376 }
13378 /* Parse a type-parameter.
13380 type-parameter:
13381 class identifier [opt]
13382 class identifier [opt] = type-id
13383 typename identifier [opt]
13384 typename identifier [opt] = type-id
13385 template < template-parameter-list > class identifier [opt]
13386 template < template-parameter-list > class identifier [opt]
13387 = id-expression
13389 GNU Extension (variadic templates):
13391 type-parameter:
13392 class ... identifier [opt]
13393 typename ... identifier [opt]
13395 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13396 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13397 the declaration of the parameter.
13399 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13401 static tree
13403 {
13405 tree parameter;
13407 /* Look for a keyword to tell us what kind of parameter this is. */
13413 {
13416 {
13417 tree identifier;
13418 tree default_argument;
13420 /* If the next token is an ellipsis, we have a template
13421 argument pack. */
13423 {
13424 /* Consume the `...' token. */
13429 }
13431 /* If the next token is an identifier, then it names the
13432 parameter. */
13435 else
13438 /* Create the parameter. */
13441 /* If the next token is an `=', we have a default argument. */
13443 {
13444 /* Consume the `=' token. */
13446 /* Parse the default-argument. */
13450 /* Template parameter packs cannot have default
13451 arguments. */
13453 {
13456 "template parameter pack %qD cannot have a "
13458 else
13460 "template parameter packs cannot have "
13463 }
13465 }
13466 else
13469 /* Create the combined representation of the parameter and the
13470 default argument. */
13472 }
13476 {
13477 tree identifier;
13478 tree default_argument;
13480 /* Look for the `<'. */
13482 /* Parse the template-parameter-list. */
13484 /* Look for the `>'. */
13486 /* Look for the `class' or 'typename' keywords. */
13488 /* If the next token is an ellipsis, we have a template
13489 argument pack. */
13491 {
13492 /* Consume the `...' token. */
13497 }
13498 /* If the next token is an `=', then there is a
13499 default-argument. If the next token is a `>', we are at
13500 the end of the parameter-list. If the next token is a `,',
13501 then we are at the end of this parameter. */
13505 {
13507 /* Treat invalid names as if the parameter were nameless. */
13510 }
13511 else
13514 /* Create the template parameter. */
13516 identifier);
13518 /* If the next token is an `=', then there is a
13519 default-argument. */
13521 {
13524 /* Consume the `='. */
13526 /* Parse the id-expression. */
13528 /* save token before parsing the id-expression, for error
13529 reporting */
13531 default_argument
13539 /* If the id-expression was a template-id that refers to
13540 a template-class, we already have the declaration here,
13541 so no further lookup is needed. */
13542 ;
13543 else
13544 /* Look up the name. */
13545 default_argument
13547 none_type,
13553 /* See if the default argument is valid. */
13554 default_argument
13557 /* Template parameter packs cannot have default
13558 arguments. */
13560 {
13563 "template parameter pack %qD cannot "
13565 identifier);
13566 else
13570 }
13572 }
13573 else
13576 /* Create the combined representation of the parameter and the
13577 default argument. */
13579 }
13585 }
13588 }
13590 /* Parse a template-id.
13592 template-id:
13593 template-name < template-argument-list [opt] >
13595 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13596 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13597 returned. Otherwise, if the template-name names a function, or set
13598 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13599 names a class, returns a TYPE_DECL for the specialization.
13601 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13602 uninstantiated templates. */
13604 static tree
13610 {
13612 tree templ;
13613 tree arguments;
13614 tree template_id;
13621 /* If the next token corresponds to a template-id, there is no need
13622 to reparse it. */
13625 {
13628 /* Get the stored value. */
13630 /* Perform any access checks that were deferred. */
13633 {
13638 tf_warning_or_error);
13639 }
13640 /* Return the stored value. */
13642 }
13644 /* Avoid performing name lookup if there is no possibility of
13645 finding a template-id. */
13648 && !cp_parser_nth_token_starts_template_argument_list_p
13650 {
13653 }
13655 /* Remember where the template-id starts. */
13661 /* Parse the template-name. */
13664 check_dependency_p,
13665 is_declaration,
13666 tag_type,
13669 {
13672 }
13674 /* If we find the sequence `[:' after a template-name, it's probably
13675 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13676 parse correctly the argument list. */
13683 {
13685 /* Change `:' into `::'. */
13687 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13688 CPP_LESS. */
13691 /* Parse the arguments. */
13694 {
13695 /* If we couldn't parse an argument list, then we revert our changes
13696 and return simply an error. Maybe this is not a template-id
13697 after all. */
13702 }
13703 /* Otherwise, emit an error about the invalid digraph, but continue
13704 parsing because we got our argument list. */
13707 {
13710 "%<<:%> is an alternate spelling for %<[%>."
13713 {
13715 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13718 }
13719 }
13720 }
13721 else
13722 {
13723 /* Look for the `<' that starts the template-argument-list. */
13725 {
13728 }
13729 /* Parse the arguments. */
13731 }
13733 /* Build a representation of the specialization. */
13736 TEMPLATE_ID_EXPR,
13740 {
13742 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13743 template (rather than some instantiation thereof) only if
13744 is not nested within some other construct. For example, in
13745 "template <typename T> void f(T) { A<T>::", A<T> is just an
13746 instantiation of A. */
13749 CPP_SCOPE));
13750 template_id
13752 }
13754 {
13756 }
13757 else
13758 {
13759 /* If it's not a class-template or a template-template, it should be
13760 a function-template. */
13766 }
13768 /* If parsing tentatively, replace the sequence of tokens that makes
13769 up the template-id with a CPP_TEMPLATE_ID token. That way,
13770 should we re-parse the token stream, we will not have to repeat
13771 the effort required to do the parse, nor will we issue duplicate
13772 error messages about problems during instantiation of the
13773 template. */
13775 /* Don't do this if we had a parse error in a declarator; re-parsing
13776 might succeed if a name changes meaning (60361). */
13780 {
13783 /* Reset the contents of the START_OF_ID token. */
13785 /* Retrieve any deferred checks. Do not pop this access checks yet
13786 so the memory will not be reclaimed during token replacing below. */
13792 /* Purge all subsequent tokens. */
13795 /* ??? Can we actually assume that, if template_id ==
13796 error_mark_node, we will have issued a diagnostic to the
13797 user, as opposed to simply marking the tentative parse as
13798 failed? */
13801 }
13805 }
13807 /* Parse a template-name.
13809 template-name:
13810 identifier
13812 The standard should actually say:
13814 template-name:
13815 identifier
13816 operator-function-id
13818 A defect report has been filed about this issue.
13820 A conversion-function-id cannot be a template name because they cannot
13821 be part of a template-id. In fact, looking at this code:
13823 a.operator K<int>()
13825 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13826 It is impossible to call a templated conversion-function-id with an
13827 explicit argument list, since the only allowed template parameter is
13828 the type to which it is converting.
13830 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13831 `template' keyword, in a construction like:
13833 T::template f<3>()
13835 In that case `f' is taken to be a template-name, even though there
13836 is no way of knowing for sure.
13838 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13839 name refers to a set of overloaded functions, at least one of which
13840 is a template, or an IDENTIFIER_NODE with the name of the template,
13841 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13842 names are looked up inside uninstantiated templates. */
13844 static tree
13851 {
13852 tree identifier;
13853 tree decl;
13854 tree fns;
13857 /* If the next token is `operator', then we have either an
13858 operator-function-id or a conversion-function-id. */
13860 {
13861 /* We don't know whether we're looking at an
13862 operator-function-id or a conversion-function-id. */
13864 /* Try an operator-function-id. */
13866 /* If that didn't work, try a conversion-function-id. */
13868 {
13871 }
13872 }
13873 /* Look for the identifier. */
13874 else
13877 /* If we didn't find an identifier, we don't have a template-id. */
13881 /* If the name immediately followed the `template' keyword, then it
13882 is a template-name. However, if the next token is not `<', then
13883 we do not treat it as a template-name, since it is not being used
13884 as part of a template-id. This enables us to handle constructs
13885 like:
13887 template <typename T> struct S { S(); };
13888 template <typename T> S<T>::S();
13890 correctly. We would treat `S' as a template -- if it were `S<T>'
13891 -- but we do not if there is no `<'. */
13895 {
13896 /* In a declaration, in a dependent context, we pretend that the
13897 "template" keyword was present in order to improve error
13898 recovery. For example, given:
13900 template <typename T> void f(T::X<int>);
13902 we want to treat "X<int>" as a template-id. */
13904 && !template_keyword_p
13906 && check_dependency_p
13908 /* Do not do this for dtors (or ctors), since they never
13909 need the template keyword before their name. */
13911 {
13914 /* Explain what went wrong. */
13916 identifier);
13919 /* If parsing tentatively, find the location of the "<" token. */
13922 /* Parse the template arguments so that we can issue error
13923 messages about them. */
13926 /* Skip tokens until we find a good place from which to
13927 continue parsing. */
13932 /* If parsing tentatively, permanently remove the
13933 template argument list. That will prevent duplicate
13934 error messages from being issued about the missing
13935 "template" keyword. */
13941 }
13943 /* If the "template" keyword is present, then there is generally
13944 no point in doing name-lookup, so we just return IDENTIFIER.
13945 But, if the qualifying scope is non-dependent then we can
13946 (and must) do name-lookup normally. */
13952 }
13954 /* Look up the name. */
13956 tag_type,
13959 check_dependency_p,
13963 /* If DECL is a template, then the name was a template-name. */
13965 {
13969 }
13970 else
13971 {
13974 /* The standard does not explicitly indicate whether a name that
13975 names a set of overloaded declarations, some of which are
13976 templates, is a template-name. However, such a name should
13977 be a template-name; otherwise, there is no way to form a
13978 template-id for the overloaded templates. */
13986 {
13987 /* The name does not name a template. */
13990 }
13991 }
13993 /* If DECL is dependent, and refers to a function, then just return
13994 its name; we will look it up again during template instantiation. */
13996 {
14000 }
14003 }
14005 /* Parse a template-argument-list.
14007 template-argument-list:
14008 template-argument ... [opt]
14009 template-argument-list , template-argument ... [opt]
14011 Returns a TREE_VEC containing the arguments. */
14013 static tree
14015 {
14020 tree vec;
14027 /* Even if the template-id appears in an integral
14028 constant-expression, the contents of the argument list do
14029 not. */
14035 /* Parse the arguments. */
14036 do
14037 {
14038 tree argument;
14041 /* Consume the comma. */
14044 /* Parse the template-argument. */
14047 /* If the next token is an ellipsis, we're expanding a template
14048 argument pack. */
14050 {
14052 {
14056 }
14057 /* Consume the `...' token. */
14060 /* Make the argument into a TYPE_PACK_EXPANSION or
14061 EXPR_PACK_EXPANSION. */
14063 }
14066 {
14070 {
14073 }
14074 else
14076 }
14078 }
14091 #ifdef ENABLE_CHECKING
14093 #endif
14095 }
14097 /* Parse a template-argument.
14099 template-argument:
14100 assignment-expression
14101 type-id
14102 id-expression
14104 The representation is that of an assignment-expression, type-id, or
14105 id-expression -- except that the qualified id-expression is
14106 evaluated, so that the value returned is either a DECL or an
14107 OVERLOAD.
14109 Although the standard says "assignment-expression", it forbids
14110 throw-expressions or assignments in the template argument.
14111 Therefore, we use "conditional-expression" instead. */
14113 static tree
14115 {
14116 tree argument;
14122 cp_id_kind idk;
14124 /* There's really no way to know what we're looking at, so we just
14125 try each alternative in order.
14127 [temp.arg]
14129 In a template-argument, an ambiguity between a type-id and an
14130 expression is resolved to a type-id, regardless of the form of
14131 the corresponding template-parameter.
14133 Therefore, we try a type-id first. */
14136 /* If there was no error parsing the type-id but the next token is a
14137 '>>', our behavior depends on which dialect of C++ we're
14138 parsing. In C++98, we probably found a typo for '> >'. But there
14139 are type-id which are also valid expressions. For instance:
14141 struct X { int operator >> (int); };
14142 template <int V> struct Foo {};
14143 Foo<X () >> 5> r;
14145 Here 'X()' is a valid type-id of a function type, but the user just
14146 wanted to write the expression "X() >> 5". Thus, we remember that we
14147 found a valid type-id, but we still try to parse the argument as an
14148 expression to see what happens.
14150 In C++0x, the '>>' will be considered two separate '>'
14151 tokens. */
14155 {
14158 }
14159 else
14160 {
14161 /* If the next token isn't a `,' or a `>', then this argument wasn't
14162 really finished. This means that the argument is not a valid
14163 type-id. */
14166 /* If that worked, we're done. */
14169 }
14170 /* We're still not sure what the argument will be. */
14172 /* Try a template. */
14180 /* If the next token isn't a `,' or a `>', then this argument wasn't
14181 really finished. */
14185 {
14186 /* Figure out what is being referred to. If the id-expression
14187 was for a class template specialization, then we will have a
14188 TYPE_DECL at this point. There is no need to do name lookup
14189 at this point in that case. */
14192 none_type,
14201 }
14203 {
14207 }
14208 /* It must be a non-type argument. There permitted cases are given
14209 in [temp.arg.nontype]:
14211 -- an integral constant-expression of integral or enumeration
14212 type; or
14214 -- the name of a non-type template-parameter; or
14216 -- the name of an object or function with external linkage...
14218 -- the address of an object or function with external linkage...
14220 -- a pointer to member... */
14221 /* Look for a non-type template parameter. */
14223 {
14235 }
14237 /* If the next token is "&", the argument must be the address of an
14238 object or function with external linkage. */
14241 {
14244 }
14245 /* See if we might have an id-expression. */
14252 {
14255 address_p,
14262 else
14263 {
14264 tree probe;
14267 {
14268 /* Strip the dereference temporarily. */
14271 }
14273 /* If we're in a template, we represent a qualified-id referring
14274 to a static data member as a SCOPE_REF even if the scope isn't
14275 dependent so that we can check access control later. */
14280 {
14281 /* A variable without external linkage might still be a
14282 valid constant-expression, so no error is issued here
14283 if the external-linkage check fails. */
14286 }
14288 /* All overloaded functions are allowed; if the external
14289 linkage test does not pass, an error will be issued
14290 later. */
14291 ;
14295 /* A pointer-to-member. */
14296 ;
14298 ;
14299 else
14303 {
14306 tf_warning_or_error);
14307 else
14310 }
14311 }
14312 }
14313 /* If the argument started with "&", there are no other valid
14314 alternatives at this point. */
14316 {
14319 }
14321 /* If the argument wasn't successfully parsed as a type-id followed
14322 by '>>', the argument can only be a constant expression now.
14323 Otherwise, we try parsing the constant-expression tentatively,
14324 because the argument could really be a type-id. */
14335 /* We did our best to parse the argument as a non type-id, but that
14336 was the only alternative that matched (albeit with a '>' after
14337 it). We can assume it's just a typo from the user, and a
14338 diagnostic will then be issued. */
14340 }
14342 /* Parse an explicit-instantiation.
14344 explicit-instantiation:
14345 template declaration
14347 Although the standard says `declaration', what it really means is:
14349 explicit-instantiation:
14350 template decl-specifier-seq [opt] declarator [opt] ;
14352 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14353 supposed to be allowed. A defect report has been filed about this
14354 issue.
14356 GNU Extension:
14358 explicit-instantiation:
14359 storage-class-specifier template
14360 decl-specifier-seq [opt] declarator [opt] ;
14361 function-specifier template
14362 decl-specifier-seq [opt] declarator [opt] ; */
14364 static void
14366 {
14368 cp_decl_specifier_seq decl_specifiers;
14373 /* Look for an (optional) storage-class-specifier or
14374 function-specifier. */
14376 {
14377 extension_specifier
14380 extension_specifier
14383 }
14385 /* Look for the `template' keyword. */
14387 /* Let the front end know that we are processing an explicit
14388 instantiation. */
14390 /* [temp.explicit] says that we are supposed to ignore access
14391 control while processing explicit instantiation directives. */
14393 /* Parse a decl-specifier-seq. */
14395 CP_PARSER_FLAGS_OPTIONAL,
14398 /* If there was exactly one decl-specifier, and it declared a class,
14399 and there's no declarator, then we have an explicit type
14400 instantiation. */
14402 {
14403 tree type;
14407 /* Turn access control back on for names used during
14408 template instantiation. */
14413 }
14414 else
14415 {
14417 tree decl;
14419 /* Parse the declarator. */
14420 declarator
14431 {
14434 "explicit instantiation shall not use"
14438 "explicit instantiation shall not use"
14443 /* Turn access control back on for names used during
14444 template instantiation. */
14446 /* Do the explicit instantiation. */
14448 }
14449 else
14450 {
14452 /* Skip the body of the explicit instantiation. */
14454 }
14455 }
14456 /* We're done with the instantiation. */
14462 }
14464 /* Parse an explicit-specialization.
14466 explicit-specialization:
14467 template < > declaration
14469 Although the standard says `declaration', what it really means is:
14471 explicit-specialization:
14472 template <> decl-specifier [opt] init-declarator [opt] ;
14473 template <> function-definition
14474 template <> explicit-specialization
14475 template <> template-declaration */
14477 static void
14479 {
14483 /* Look for the `template' keyword. */
14485 /* Look for the `<'. */
14487 /* Look for the `>'. */
14489 /* We have processed another parameter list. */
14491 /* [temp]
14493 A template ... explicit specialization ... shall not have C
14494 linkage. */
14496 {
14498 /* Give it C++ linkage to avoid confusing other parts of the
14499 front end. */
14502 }
14503 else
14505 /* Let the front end know that we are beginning a specialization. */
14507 {
14510 }
14512 /* If the next keyword is `template', we need to figure out whether
14513 or not we're looking a template-declaration. */
14515 {
14520 else
14522 }
14523 else
14524 /* Parse the dependent declaration. */
14530 /* We're done with the specialization. */
14532 /* For the erroneous case of a template with C linkage, we pushed an
14533 implicit C++ linkage scope; exit that scope now. */
14536 /* We're done with this parameter list. */
14538 }
14540 /* Parse a type-specifier.
14542 type-specifier:
14543 simple-type-specifier
14544 class-specifier
14545 enum-specifier
14546 elaborated-type-specifier
14547 cv-qualifier
14549 GNU Extension:
14551 type-specifier:
14552 __complex__
14554 Returns a representation of the type-specifier. For a
14555 class-specifier, enum-specifier, or elaborated-type-specifier, a
14556 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14558 The parser flags FLAGS is used to control type-specifier parsing.
14560 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14561 in a decl-specifier-seq.
14563 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14564 class-specifier, enum-specifier, or elaborated-type-specifier, then
14565 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14566 if a type is declared; 2 if it is defined. Otherwise, it is set to
14567 zero.
14569 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14570 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14571 is set to FALSE. */
14573 static tree
14575 cp_parser_flags flags,
14580 {
14586 /* Assume this type-specifier does not declare a new type. */
14589 /* And that it does not specify a cv-qualifier. */
14592 /* Peek at the next token. */
14595 /* If we're looking at a keyword, we can use that to guide the
14596 production we choose. */
14599 {
14604 /* Look for the enum-specifier. */
14606 /* If that worked, we're done. */
14608 {
14613 type_spec,
14614 token,
14617 }
14618 else
14621 /* Any of these indicate either a class-specifier, or an
14622 elaborated-type-specifier. */
14629 /* Parse tentatively so that we can back up if we don't find a
14630 class-specifier. */
14632 /* Look for the class-specifier. */
14635 /* If that worked, we're done. */
14637 {
14642 type_spec,
14643 token,
14646 }
14648 /* Fall through. */
14649 elaborated_type_specifier:
14650 /* We're declaring (not defining) a class or enum. */
14654 /* Fall through. */
14656 /* Look for an elaborated-type-specifier. */
14657 type_spec
14658 = (cp_parser_elaborated_type_specifier
14661 is_declaration));
14664 type_spec,
14665 token,
14688 /* The `__complex__' keyword is a GNU extension. */
14694 }
14696 /* Handle simple keywords. */
14698 {
14700 {
14703 }
14705 }
14707 /* If we do not already have a type-specifier, assume we are looking
14708 at a simple-type-specifier. */
14710 decl_specs,
14711 flags);
14713 /* If we didn't find a type-specifier, and a type-specifier was not
14714 optional in this context, issue an error message. */
14716 {
14719 }
14722 }
14724 /* Parse a simple-type-specifier.
14726 simple-type-specifier:
14727 :: [opt] nested-name-specifier [opt] type-name
14728 :: [opt] nested-name-specifier template template-id
14729 char
14730 wchar_t
14731 bool
14732 short
14733 int
14734 long
14735 signed
14736 unsigned
14737 float
14738 double
14739 void
14741 C++0x Extension:
14743 simple-type-specifier:
14744 auto
14745 decltype ( expression )
14746 char16_t
14747 char32_t
14748 __underlying_type ( type-id )
14750 GNU Extension:
14752 simple-type-specifier:
14753 __int128
14754 __typeof__ unary-expression
14755 __typeof__ ( type-id )
14756 __typeof__ ( type-id ) { initializer-list , [opt] }
14758 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14759 appropriately updated. */
14761 static tree
14764 cp_parser_flags flags)
14765 {
14770 /* Peek at the next token. */
14773 /* If we're looking at a keyword, things are easy. */
14775 {
14810 {
14813 }
14842 {
14846 {
14849 "use of %<auto%> in lambda parameter declaration "
14850 "only available with "
14852 }
14855 "use of %<auto%> in parameter declaration "
14856 "only available with "
14858 else
14860 "ISO C++ forbids use of %<auto%> in parameter "
14862 }
14863 else
14868 /* Since DR 743, decltype can either be a simple-type-specifier by
14869 itself or begin a nested-name-specifier. Parsing it will replace
14870 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14871 handling below decide what to do. */
14877 /* Consume the `typeof' token. */
14879 /* Parse the operand to `typeof'. */
14881 /* If it is not already a TYPE, take its type. */
14887 token,
14896 token,
14906 token,
14911 }
14913 /* If token is an already-parsed decltype not followed by ::,
14914 it's a simple-type-specifier. */
14917 {
14920 {
14922 token,
14924 /* Remember that we are handling a decltype in order to
14925 implement the resolution of DR 1510 when the argument
14926 isn't instantiation dependent. */
14928 }
14931 }
14933 /* If the type-specifier was for a built-in type, we're done. */
14935 {
14936 /* Record the type. */
14943 type,
14944 token,
14949 /* Consume the token. */
14952 /* There is no valid C++ program where a non-template type is
14953 followed by a "<". That usually indicates that the user thought
14954 that the type was a template. */
14959 }
14961 /* The type-specifier must be a user-defined type. */
14963 {
14967 /* Don't gobble tokens or issue error messages if this is an
14968 optional type-specifier. */
14972 /* Look for the optional `::' operator. */
14973 global_p
14977 /* Look for the nested-name specifier. */
14978 qualified_p
14986 /* If we have seen a nested-name-specifier, and the next token
14987 is `template', then we are using the template-id production. */
14990 {
14991 /* Look for the template-id. */
14995 none_type,
14997 /* If the template-id did not name a type, we are out of
14998 luck. */
15000 {
15003 }
15004 }
15005 /* Otherwise, look for a type-name. */
15006 else
15008 /* Keep track of all name-lookups performed in class scopes. */
15010 && !global_p
15011 && !qualified_p
15015 /* If it didn't work out, we don't have a TYPE. */
15021 token,
15023 }
15025 /* If we didn't get a type-name, issue an error message. */
15027 {
15030 }
15033 {
15034 /* See if TYPE is an Objective-C type, and if so, parse and
15035 accept any protocol references following it. Do this before
15036 the cp_parser_check_for_invalid_template_id() call, because
15037 Objective-C types can be followed by '<...>' which would
15038 enclose protocol names rather than template arguments, and so
15039 everything is fine. */
15042 {
15046 /* Clobber the "unqualified" type previously entered into
15047 DECL_SPECS with the new, improved protocol-qualified version. */
15052 }
15054 /* There is no valid C++ program where a non-template type is
15055 followed by a "<". That usually indicates that the user
15056 thought that the type was a template. */
15058 none_type,
15060 }
15063 }
15065 /* Parse a type-name.
15067 type-name:
15068 class-name
15069 enum-name
15070 typedef-name
15071 simple-template-id [in c++0x]
15073 enum-name:
15074 identifier
15076 typedef-name:
15077 identifier
15079 Returns a TYPE_DECL for the type. */
15081 static tree
15083 {
15084 tree type_decl;
15086 /* We can't know yet whether it is a class-name or not. */
15088 /* Try a class-name. */
15092 none_type,
15096 /* If it's not a class-name, keep looking. */
15098 {
15100 /* It must be a typedef-name or an enum-name. */
15104 /* It is either a simple-template-id representing an
15105 instantiation of an alias template... */
15109 none_type,
15111 /* Note that this must be an instantiation of an alias template
15112 because [temp.names]/6 says:
15114 A template-id that names an alias template specialization
15115 is a type-name.
15117 Whereas [temp.names]/7 says:
15119 A simple-template-id that names a class template
15120 specialization is a class-name. */
15125 else
15129 /* ... Or a typedef-name or an enum-name. */
15131 }
15134 }
15136 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15138 enum-name:
15139 identifier
15141 typedef-name:
15142 identifier
15144 Returns a TYPE_DECL for the type. */
15146 static tree
15148 {
15149 tree type_decl;
15150 tree identifier;
15157 /* Look up the type-name. */
15164 {
15165 /* See if this is an Objective-C type. */
15170 }
15172 /* Issue an error if we did not find a type-name. */
15174 /* In Objective-C, we have the complication that class names are
15175 normally type names and start declarations (eg, the
15176 "NSObject" in "NSObject *object;"), but can be used in an
15177 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15178 is an expression. So, a classname followed by a dot is not a
15179 valid type-name. */
15182 {
15187 }
15188 /* Remember that the name was used in the definition of the
15189 current class so that we can check later to see if the
15190 meaning would have been different after the class was
15191 entirely defined. */
15197 }
15199 /* Parse an elaborated-type-specifier. Note that the grammar given
15200 here incorporates the resolution to DR68.
15202 elaborated-type-specifier:
15203 class-key :: [opt] nested-name-specifier [opt] identifier
15204 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15205 enum-key :: [opt] nested-name-specifier [opt] identifier
15206 typename :: [opt] nested-name-specifier identifier
15207 typename :: [opt] nested-name-specifier template [opt]
15208 template-id
15210 GNU extension:
15212 elaborated-type-specifier:
15213 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15214 class-key attributes :: [opt] nested-name-specifier [opt]
15215 template [opt] template-id
15216 enum attributes :: [opt] nested-name-specifier [opt] identifier
15218 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15219 declared `friend'. If IS_DECLARATION is TRUE, then this
15220 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15221 something is being declared.
15223 Returns the TYPE specified. */
15225 static tree
15229 {
15231 tree identifier;
15234 tree globalscope;
15237 /* See if we're looking at the `enum' keyword. */
15239 {
15240 /* Consume the `enum' token. */
15242 /* Remember that it's an enumeration type. */
15244 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15245 enums) is used here. */
15248 {
15252 /* Consume the `struct' or `class' and parse it anyway. */
15254 }
15255 /* Parse the attributes. */
15257 }
15258 /* Or, it might be `typename'. */
15260 RID_TYPENAME))
15261 {
15262 /* Consume the `typename' token. */
15264 /* Remember that it's a `typename' type. */
15266 }
15267 /* Otherwise it must be a class-key. */
15268 else
15269 {
15273 /* Parse the attributes. */
15275 }
15277 /* Look for the `::' operator. */
15280 /* Look for the nested-name-specifier. */
15282 {
15287 is_declaration))
15289 }
15290 else
15291 /* Even though `typename' is not present, the proposed resolution
15292 to Core Issue 180 says that in `class A<T>::B', `B' should be
15293 considered a type-name, even if `A<T>' is dependent. */
15298 is_declaration);
15299 /* For everything but enumeration types, consider a template-id.
15300 For an enumeration type, consider only a plain identifier. */
15302 {
15304 tree decl;
15306 /* Allow the `template' keyword. */
15308 /* If we didn't see `template', we don't know if there's a
15309 template-id or not. */
15312 /* Parse the template-id. */
15316 tag_type,
15317 is_declaration);
15318 /* If we didn't find a template-id, look for an ordinary
15319 identifier. */
15321 ;
15322 /* We can get here when cp_parser_template_id, called by
15323 cp_parser_class_name with tag_type == none_type, succeeds
15324 and caches a BASELINK. Then, when called again here,
15325 instead of failing and returning an error_mark_node
15326 returns it (see template/typename17.C in C++11).
15327 ??? Could we diagnose this earlier? */
15329 {
15332 }
15333 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15334 in effect, then we must assume that, upon instantiation, the
15335 template will correspond to a class. */
15339 typename_type,
15341 /* If the `typename' keyword is in effect and DECL is not a type
15342 decl, then type is non existent. */
15344 ;
15350 }
15353 {
15358 {
15361 }
15363 /* For a `typename', we needn't call xref_tag. */
15369 /* Template parameter lists apply only if we are not within a
15370 function parameter list. */
15371 bool template_parm_lists_apply
15380 /* Look up a qualified name in the usual way. */
15382 {
15383 tree decl;
15384 tree ambiguous_decls;
15387 tag_type,
15394 /* If the lookup was ambiguous, an error will already have been
15395 issued. */
15399 /* If we are parsing friend declaration, DECL may be a
15400 TEMPLATE_DECL tree node here. However, we need to check
15401 whether this TEMPLATE_DECL results in valid code. Consider
15402 the following example:
15404 namespace N {
15405 template <class T> class C {};
15406 }
15407 class X {
15408 template <class T> friend class N::C; // #1, valid code
15409 };
15410 template <class T> class Y {
15411 friend class N::C; // #2, invalid code
15412 };
15414 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15415 name lookup of `N::C'. We see that friend declaration must
15416 be template for the code to be valid. Note that
15417 processing_template_decl does not work here since it is
15418 always 1 for the above two cases. */
15420 decl = (cp_parser_maybe_treat_template_as_class
15425 {
15427 identifier,
15430 }
15433 {
15437 allow_template);
15441 }
15443 /* Forward declarations of nested types, such as
15445 class C1::C2;
15446 class C1::C2::C3;
15448 are invalid unless all components preceding the final '::'
15449 are complete. If all enclosing types are complete, these
15450 declarations become merely pointless.
15452 Invalid forward declarations of nested types are errors
15453 caught elsewhere in parsing. Those that are pointless arrive
15454 here. */
15461 }
15462 else
15463 {
15464 /* An elaborated-type-specifier sometimes introduces a new type and
15465 sometimes names an existing type. Normally, the rule is that it
15466 introduces a new type only if there is not an existing type of
15467 the same name already in scope. For example, given:
15469 struct S {};
15470 void f() { struct S s; }
15472 the `struct S' in the body of `f' is the same `struct S' as in
15473 the global scope; the existing definition is used. However, if
15474 there were no global declaration, this would introduce a new
15475 local class named `S'.
15477 An exception to this rule applies to the following code:
15479 namespace N { struct S; }
15481 Here, the elaborated-type-specifier names a new type
15482 unconditionally; even if there is already an `S' in the
15483 containing scope this declaration names a new type.
15484 This exception only applies if the elaborated-type-specifier
15485 forms the complete declaration:
15487 [class.name]
15489 A declaration consisting solely of `class-key identifier ;' is
15490 either a redeclaration of the name in the current scope or a
15491 forward declaration of the identifier as a class name. It
15492 introduces the name into the current scope.
15494 We are in this situation precisely when the next token is a `;'.
15496 An exception to the exception is that a `friend' declaration does
15497 *not* name a new type; i.e., given:
15499 struct S { friend struct T; };
15501 `T' is not a new type in the scope of `S'.
15503 Also, `new struct S' or `sizeof (struct S)' never results in the
15504 definition of a new type; a new type can only be declared in a
15505 declaration context. */
15507 tag_scope ts;
15511 /* Friends have special name lookup rules. */
15515 CPP_SEMICOLON))
15516 /* This is a `class-key identifier ;' */
15518 else
15521 template_p =
15522 (template_parm_lists_apply
15525 /* An unqualified name was used to reference this type, so
15526 there were no qualifying templates. */
15534 }
15535 }
15540 /* Allow attributes on forward declarations of classes. */
15542 {
15552 else
15555 }
15558 {
15559 /* Indicate whether this class was declared as a `class' or as a
15560 `struct'. */
15564 }
15566 /* A "<" cannot follow an elaborated type specifier. If that
15567 happens, the user was probably trying to form a template-id. */
15572 }
15574 /* Parse an enum-specifier.
15576 enum-specifier:
15577 enum-head { enumerator-list [opt] }
15578 enum-head { enumerator-list , } [C++0x]
15580 enum-head:
15581 enum-key identifier [opt] enum-base [opt]
15582 enum-key nested-name-specifier identifier enum-base [opt]
15584 enum-key:
15585 enum
15586 enum class [C++0x]
15587 enum struct [C++0x]
15589 enum-base: [C++0x]
15590 : type-specifier-seq
15592 opaque-enum-specifier:
15593 enum-key identifier enum-base [opt] ;
15595 GNU Extensions:
15596 enum-key attributes[opt] identifier [opt] enum-base [opt]
15597 { enumerator-list [opt] }attributes[opt]
15598 enum-key attributes[opt] identifier [opt] enum-base [opt]
15599 { enumerator-list, }attributes[opt] [C++0x]
15601 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15602 if the token stream isn't an enum-specifier after all. */
15604 static tree
15606 {
15607 tree identifier;
15609 tree prev_scope;
15611 tree attributes;
15624 /* Parse tentatively so that we can back up if we don't find a
15625 enum-specifier. */
15628 /* Caller guarantees that the current token is 'enum', an identifier
15629 possibly follows, and the token after that is an opening brace.
15630 If we don't have an identifier, fabricate an anonymous name for
15631 the enumeration being defined. */
15634 /* Parse the "class" or "struct", which indicates a scoped
15635 enumeration type in C++0x. */
15638 {
15642 /* Consume the `struct' or `class' token. */
15646 }
15650 /* Clear the qualification. */
15655 /* Figure out in what scope the declaration is being placed. */
15661 nested_name_specifier
15669 {
15670 tree name;
15674 enum_type,
15679 input_location);
15681 {
15684 {
15685 /* Are template enums allowed in ISO? */
15689 /* ignore a typename reference, for it will be solved by name
15690 in start_enum. */
15692 }
15693 }
15696 else
15699 }
15700 else
15701 {
15704 else
15705 {
15711 }
15712 }
15715 /* Check for the `:' that denotes a specified underlying type in C++0x.
15716 Note that a ':' could also indicate a bitfield width, however. */
15718 {
15719 cp_decl_specifier_seq type_specifiers;
15721 /* Consume the `:'. */
15724 /* Parse the type-specifier-seq. */
15729 /* At this point this is surely not elaborated type specifier. */
15738 /* If that didn't work, stop. */
15740 {
15746 }
15747 }
15749 /* Look for the `{' but don't consume it yet. */
15751 {
15753 {
15756 {
15759 }
15760 }
15761 /* An opaque-enum-specifier must have a ';' here. */
15764 {
15767 {
15770 }
15771 }
15772 }
15778 {
15780 {
15784 }
15786 {
15788 }
15789 }
15791 /* Issue an error message if type-definitions are forbidden here. */
15794 else
15795 /* Create the new type. We do this before consuming the opening
15796 brace so the enum will be recorded as being on the line of its
15797 tag (or the 'enum' keyword, if there is no tag). */
15801 /* If the next token is not '{' it is an opaque-enum-specifier or an
15802 elaborated-type-specifier. */
15804 {
15808 {
15809 /* The following catches invalid code such as:
15810 enum class S<int>::E { A, B, C }; */
15818 {
15822 nested_name_specifier);
15824 }
15825 /* If that scope does not contain the scope in which the
15826 class was originally declared, the program is invalid. */
15828 nested_name_specifier))
15829 {
15832 "declaration of %qD in namespace %qD which does not "
15835 else
15837 "declaration of %qD in %qD which does not "
15841 }
15842 }
15847 /* Consume the opening brace. */
15854 {
15858 }
15859 else
15860 {
15866 }
15870 /* If the next token is not '}', then there are some enumerators. */
15872 {
15876 }
15877 else
15880 /* Consume the final '}'. */
15886 }
15887 else
15888 {
15889 /* If a ';' follows, then it is an opaque-enum-specifier
15890 and additional restrictions apply. */
15892 {
15899 }
15900 }
15902 /* Look for trailing attributes to apply to this enumeration, and
15903 apply them if appropriate. */
15905 {
15909 trailing_attr,
15911 }
15913 /* Finish up the enumeration. */
15915 {
15920 }
15923 {
15925 {
15928 }
15930 {
15932 }
15933 }
15934 out:
15937 }
15939 /* Parse an enumerator-list. The enumerators all have the indicated
15940 TYPE.
15942 enumerator-list:
15943 enumerator-definition
15944 enumerator-list , enumerator-definition */
15946 static void
15948 {
15950 {
15951 /* Parse an enumerator-definition. */
15954 /* If the next token is not a ',', we've reached the end of
15955 the list. */
15958 /* Otherwise, consume the `,' and keep going. */
15960 /* If the next token is a `}', there is a trailing comma. */
15962 {
15967 }
15968 }
15969 }
15971 /* Parse an enumerator-definition. The enumerator has the indicated
15972 TYPE.
15974 enumerator-definition:
15975 enumerator
15976 enumerator = constant-expression
15978 enumerator:
15979 identifier */
15981 static void
15983 {
15984 tree identifier;
15985 tree value;
15986 location_t loc;
15988 /* Save the input location because we are interested in the location
15989 of the identifier and not the location of the explicit value. */
15992 /* Look for the identifier. */
15997 /* If the next token is an '=', then there is an explicit value. */
15999 {
16000 /* Consume the `=' token. */
16002 /* Parse the value. */
16004 }
16005 else
16008 /* If we are processing a template, make sure the initializer of the
16009 enumerator doesn't contain any bare template parameter pack. */
16013 /* Create the enumerator. */
16015 }
16017 /* Parse a namespace-name.
16019 namespace-name:
16020 original-namespace-name
16021 namespace-alias
16023 Returns the NAMESPACE_DECL for the namespace. */
16025 static tree
16027 {
16028 tree identifier;
16029 tree namespace_decl;
16033 /* Get the name of the namespace. */
16038 /* Look up the identifier in the currently active scope. Look only
16039 for namespaces, due to:
16041 [basic.lookup.udir]
16043 When looking up a namespace-name in a using-directive or alias
16044 definition, only namespace names are considered.
16046 And:
16048 [basic.lookup.qual]
16050 During the lookup of a name preceding the :: scope resolution
16051 operator, object, function, and enumerator names are ignored.
16053 (Note that cp_parser_qualifying_entity only calls this
16054 function if the token after the name is the scope resolution
16055 operator.) */
16057 none_type,
16063 /* If it's not a namespace, issue an error. */
16066 {
16071 }
16074 }
16076 /* Parse a namespace-definition.
16078 namespace-definition:
16079 named-namespace-definition
16080 unnamed-namespace-definition
16082 named-namespace-definition:
16083 original-namespace-definition
16084 extension-namespace-definition
16086 original-namespace-definition:
16087 namespace identifier { namespace-body }
16089 extension-namespace-definition:
16090 namespace original-namespace-name { namespace-body }
16092 unnamed-namespace-definition:
16093 namespace { namespace-body } */
16095 static void
16097 {
16104 {
16108 }
16109 else
16112 /* Look for the `namespace' keyword. */
16115 /* Get the name of the namespace. We do not attempt to distinguish
16116 between an original-namespace-definition and an
16117 extension-namespace-definition at this point. The semantic
16118 analysis routines are responsible for that. */
16121 else
16124 /* Parse any specified attributes. */
16127 /* Look for the `{' to start the namespace. */
16129 /* Start the namespace. */
16132 /* "inline namespace" is equivalent to a stub namespace definition
16133 followed by a strong using directive. */
16135 {
16137 /* Set up namespace association. */
16141 /* Import the contents of the inline namespace. */
16145 }
16149 /* Parse the body of the namespace. */
16155 /* Finish the namespace. */
16157 /* Look for the final `}'. */
16159 }
16161 /* Parse a namespace-body.
16163 namespace-body:
16164 declaration-seq [opt] */
16166 static void
16168 {
16170 }
16172 /* Parse a namespace-alias-definition.
16174 namespace-alias-definition:
16175 namespace identifier = qualified-namespace-specifier ; */
16177 static void
16179 {
16180 tree identifier;
16181 tree namespace_specifier;
16185 /* Look for the `namespace' keyword. */
16187 /* Look for the identifier. */
16191 /* Look for the `=' token. */
16194 {
16196 /* Skip the definition. */
16201 }
16203 /* Look for the qualified-namespace-specifier. */
16204 namespace_specifier
16206 /* Look for the `;' token. */
16209 /* Register the alias in the symbol table. */
16211 }
16213 /* Parse a qualified-namespace-specifier.
16215 qualified-namespace-specifier:
16216 :: [opt] nested-name-specifier [opt] namespace-name
16218 Returns a NAMESPACE_DECL corresponding to the specified
16219 namespace. */
16221 static tree
16223 {
16224 /* Look for the optional `::'. */
16228 /* Look for the optional nested-name-specifier. */
16236 }
16238 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16239 access declaration.
16241 using-declaration:
16242 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16243 using :: unqualified-id ;
16245 access-declaration:
16246 qualified-id ;
16248 */
16250 static bool
16253 {
16257 tree decl;
16258 tree identifier;
16259 tree qscope;
16264 {
16267 }
16268 else
16269 {
16270 /* Look for the `using' keyword. */
16273 /* Peek at the next token. */
16275 /* See if it's `typename'. */
16277 {
16278 /* Remember that we've seen it. */
16280 /* Consume the `typename' token. */
16282 }
16283 }
16285 /* Look for the optional global scope qualification. */
16286 global_scope_p
16291 /* If we saw `typename', or didn't see `::', then there must be a
16292 nested-name-specifier present. */
16294 {
16300 {
16303 }
16304 }
16305 /* Otherwise, we could be in either of the two productions. In that
16306 case, treat the nested-name-specifier as optional. */
16307 else
16319 /* Something has already gone wrong; there's no need to parse
16320 further. Since an error has occurred, the return value of
16321 cp_parser_parse_definitely will be false, as required. */
16325 /* Parse the unqualified-id. */
16333 {
16338 }
16340 /* The function we call to handle a using-declaration is different
16341 depending on what scope we are in. */
16343 ;
16346 /* [namespace.udecl]
16348 A using declaration shall not name a template-id. */
16351 else
16352 {
16354 {
16355 /* Create the USING_DECL. */
16362 {
16365 }
16366 else
16367 /* Add it to the list of members in this class. */
16369 }
16370 else
16371 {
16373 identifier,
16380 {
16383 }
16386 else
16388 }
16389 }
16391 /* Look for the final `;'. */
16396 "access declarations are deprecated "
16397 "in favour of using-declarations; "
16401 }
16403 /* Parse an alias-declaration.
16405 alias-declaration:
16406 using identifier attribute-specifier-seq [opt] = type-id */
16408 static tree
16410 {
16412 location_t id_location;
16414 cp_decl_specifier_seq decl_specs;
16418 /* Look for the `using' keyword. */
16419 cp_token *using_token
16441 /* Now we are going to parse the type-id of the declaration. */
16443 /*
16444 [dcl.type]/3 says:
16446 "A type-specifier-seq shall not define a class or enumeration
16447 unless it appears in the type-id of an alias-declaration (7.1.3) that
16448 is not the declaration of a template-declaration."
16450 In other words, if we currently are in an alias template, the
16451 type-id should not define a type.
16453 So let's set parser->type_definition_forbidden_message in that
16454 case; cp_parser_check_type_definition (called by
16455 cp_parser_class_specifier) will then emit an error if a type is
16456 defined in the type-id. */
16458 {
16462 }
16466 /* Restore the error message if need be. */
16472 {
16475 }
16477 /* A typedef-name can also be introduced by an alias-declaration. The
16478 identifier following the using keyword becomes a typedef-name. It has
16479 the same semantics as if it were introduced by the typedef
16480 specifier. In particular, it does not define a new type and it shall
16481 not appear in the type-id. */
16486 {
16489 ds_attribute,
16490 attrs_token);
16491 }
16493 ds_typedef,
16494 using_token);
16496 ds_alias,
16497 using_token);
16506 else
16517 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16518 added into the symbol table; otherwise, return the TYPE_DECL. */
16522 {
16526 }
16529 }
16531 /* Parse a using-directive.
16533 using-directive:
16534 using namespace :: [opt] nested-name-specifier [opt]
16535 namespace-name ; */
16537 static void
16539 {
16540 tree namespace_decl;
16541 tree attribs;
16543 /* Look for the `using' keyword. */
16545 /* And the `namespace' keyword. */
16547 /* Look for the optional `::' operator. */
16549 /* And the optional nested-name-specifier. */
16555 /* Get the namespace being used. */
16557 /* And any specified attributes. */
16559 /* Update the symbol table. */
16561 /* Look for the final `;'. */
16563 }
16565 /* Parse an asm-definition.
16567 asm-definition:
16568 asm ( string-literal ) ;
16570 GNU Extension:
16572 asm-definition:
16573 asm volatile [opt] ( string-literal ) ;
16574 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16575 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16576 : asm-operand-list [opt] ) ;
16577 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16578 : asm-operand-list [opt]
16579 : asm-clobber-list [opt] ) ;
16580 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16581 : asm-clobber-list [opt]
16582 : asm-goto-list ) ; */
16584 static void
16586 {
16587 tree string;
16592 tree asm_stmt;
16600 /* Look for the `asm' keyword. */
16605 {
16608 }
16610 /* See if the next token is `volatile'. */
16613 {
16614 /* Remember that we saw the `volatile' keyword. */
16616 /* Consume the token. */
16618 }
16622 {
16623 /* Remember that we saw the `goto' keyword. */
16625 /* Consume the token. */
16627 }
16628 /* Look for the opening `('. */
16631 /* Look for the string. */
16634 {
16638 }
16640 /* If we're allowing GNU extensions, check for the extended assembly
16641 syntax. Unfortunately, the `:' tokens need not be separated by
16642 a space in C, and so, for compatibility, we tolerate that here
16643 too. Doing that means that we have to treat the `::' operator as
16644 two `:' tokens. */
16649 {
16654 /* The extended syntax was used. */
16657 /* Look for outputs. */
16659 {
16660 /* Consume the `:'. */
16662 /* Parse the output-operands. */
16664 CPP_COLON)
16666 CPP_SCOPE)
16668 CPP_CLOSE_PAREN)
16674 }
16675 /* If the next token is `::', there are no outputs, and the
16676 next token is the beginning of the inputs. */
16678 /* The inputs are coming next. */
16681 /* Look for inputs. */
16684 {
16685 /* Consume the `:' or `::'. */
16687 /* Parse the output-operands. */
16689 CPP_COLON)
16691 CPP_SCOPE)
16693 CPP_CLOSE_PAREN))
16698 }
16700 /* The clobbers are coming next. */
16703 /* Look for clobbers. */
16706 {
16708 /* Consume the `:' or `::'. */
16710 /* Parse the clobbers. */
16712 CPP_COLON)
16714 CPP_CLOSE_PAREN))
16716 }
16719 /* The labels are coming next. */
16722 /* Look for labels. */
16725 {
16727 /* Consume the `:' or `::'. */
16729 /* Parse the labels. */
16731 }
16735 }
16739 /* Look for the closing `)'. */
16747 {
16748 /* Create the ASM_EXPR. */
16750 {
16753 /* If the extended syntax was not used, mark the ASM_EXPR. */
16755 {
16761 }
16762 }
16763 else
16765 }
16766 }
16768 /* Declarators [gram.dcl.decl] */
16770 /* Parse an init-declarator.
16772 init-declarator:
16773 declarator initializer [opt]
16775 GNU Extension:
16777 init-declarator:
16778 declarator asm-specification [opt] attributes [opt] initializer [opt]
16780 function-definition:
16781 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16782 function-body
16783 decl-specifier-seq [opt] declarator function-try-block
16785 GNU Extension:
16787 function-definition:
16788 __extension__ function-definition
16790 TM Extension:
16792 function-definition:
16793 decl-specifier-seq [opt] declarator function-transaction-block
16795 The DECL_SPECIFIERS apply to this declarator. Returns a
16796 representation of the entity declared. If MEMBER_P is TRUE, then
16797 this declarator appears in a class scope. The new DECL created by
16798 this declarator is returned.
16800 The CHECKS are access checks that should be performed once we know
16801 what entity is being declared (and, therefore, what classes have
16802 befriended it).
16804 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16805 for a function-definition here as well. If the declarator is a
16806 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16807 be TRUE upon return. By that point, the function-definition will
16808 have been completely parsed.
16810 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16811 is FALSE.
16813 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16814 parsed declaration if it is an uninitialized single declarator not followed
16815 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16816 if present, will not be consumed. If returned, this declarator will be
16817 created with SD_INITIALIZED but will not call cp_finish_decl. */
16819 static tree
16828 {
16832 tree prefix_attributes;
16834 tree asm_specification;
16835 tree initializer;
16837 tree scope;
16839 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16840 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16841 "(...)". */
16851 /* Gather the attributes that were provided with the
16852 decl-specifiers. */
16855 /* Assume that this is not the declarator for a function
16856 definition. */
16860 /* Default arguments are only permitted for function parameters. */
16864 /* Defer access checks while parsing the declarator; we cannot know
16865 what names are accessible until we know what is being
16866 declared. */
16869 /* Parse the declarator. */
16871 declarator
16876 /* Gather up the deferred checks. */
16881 /* If the DECLARATOR was erroneous, there's no need to go
16882 further. */
16886 /* Check that the number of template-parameter-lists is OK. */
16896 /* Figure out what scope the entity declared by the DECLARATOR is
16897 located in. `grokdeclarator' sometimes changes the scope, so
16898 we compute it now. */
16901 /* Perform any lookups in the declared type which were thought to be
16902 dependent, but are not in the scope of the declarator. */
16903 decl_specifiers->type
16906 /* If we're allowing GNU extensions, look for an
16907 asm-specification. */
16909 {
16910 /* Look for an asm-specification. */
16913 }
16914 else
16917 /* Look for attributes. */
16921 /* Peek at the next token. */
16927 {
16928 /* Check to see if the token indicates the start of a
16929 function-definition. */
16931 {
16933 {
16934 /* If a function-definition should not appear here, issue an
16935 error message. */
16939 }
16941 location_t func_brace_location
16944 /* Neither attributes nor an asm-specification are allowed
16945 on a function-definition. */
16948 "an asm-specification is not allowed "
16952 "attributes are not allowed "
16954 /* This is a function-definition. */
16957 /* Parse the function definition. */
16960 decl_specifiers,
16961 declarator,
16962 prefix_attributes);
16963 else
16964 decl =
16965 (cp_parser_function_definition_from_specifiers_and_declarator
16969 {
16970 /* This is where the prologue starts... */
16973 }
16976 }
16977 }
16979 {
16980 /* A non-template declaration involving a function parameter list
16981 containing an implicit template parameter will be made into a
16982 template. If the resulting declaration is not going to be an
16983 actual function then finish the template scope here to prevent it.
16984 An error message will be issued once we have a decl to talk about.
16986 FIXME probably we should do type deduction rather than create an
16987 implicit template, but the standard currently doesn't allow it. */
16990 }
16992 /* [dcl.dcl]
16994 Only in function declarations for constructors, destructors, and
16995 type conversions can the decl-specifier-seq be omitted.
16997 We explicitly postpone this check past the point where we handle
16998 function-definitions because we tolerate function-definitions
16999 that are missing their return types in some modes. */
17001 {
17005 }
17007 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17011 {
17019 {
17025 }
17026 }
17027 else
17028 {
17029 /* If the init-declarator isn't initialized and isn't followed by a
17030 `,' or `;', it's not a valid init-declarator. */
17033 {
17036 else
17037 {
17040 }
17041 }
17044 }
17046 /* Because start_decl has side-effects, we should only call it if we
17047 know we're going ahead. By this point, we know that we cannot
17048 possibly be looking at any other construct. */
17051 /* Enter the newly declared entry in the symbol table. If we're
17052 processing a declaration in a class-specifier, we wait until
17053 after processing the initializer. */
17055 {
17062 /* Adjust location of decl if declarator->id_loc is more appropriate:
17063 set, and decl wasn't merged with another decl, in which case its
17064 location would be different from input_location, and more accurate. */
17069 }
17071 /* Enter the SCOPE. That way unqualified names appearing in the
17072 initializer will be looked up in SCOPE. */
17075 /* Perform deferred access control checks, now that we know in which
17076 SCOPE the declared entity resides. */
17078 {
17081 /* If the entity being declared is a function, pretend that we
17082 are in its scope. If it is a `friend', it may have access to
17083 things that would not otherwise be accessible. */
17085 {
17088 }
17090 /* Perform access checks for template parameters. */
17093 /* Perform the access control checks for the declarator and the
17094 decl-specifiers. */
17097 /* Restore the saved value. */
17100 }
17102 /* Parse the initializer. */
17107 {
17109 {
17113 else
17114 {
17115 /* If the declaration was erroneous, we don't really
17116 know what the user intended, so just silently
17117 consume the initializer. */
17125 }
17126 }
17127 else
17128 {
17129 /* We want to record the extra mangling scope for in-class
17130 initializers of class members and initializers of static data
17131 member templates. The former involves deferring
17132 parsing of the initializer until end of class as with default
17133 arguments. So right here we only handle the latter. */
17143 }
17144 }
17146 /* The old parser allows attributes to appear after a parenthesized
17147 initializer. Mark Mitchell proposed removing this functionality
17148 on the GCC mailing lists on 2002-08-13. This parser accepts the
17149 attributes -- but ignores them. */
17156 /* And now complain about a non-function implicit template. */
17161 /* For an in-class declaration, use `grokfield' to create the
17162 declaration. */
17164 {
17166 {
17169 }
17177 }
17179 /* Finish processing the declaration. But, skip member
17180 declarations. */
17182 {
17185 asm_specification,
17186 /* If the initializer is in parentheses, then this is
17187 a direct-initialization, which means that an
17188 `explicit' constructor is OK. Otherwise, an
17189 `explicit' constructor cannot be used. */
17192 }
17195 /* Core issue #226 (C++0x only): A default template-argument
17196 shall not be specified in a friend class template
17197 declaration. */
17206 {
17209 else
17211 }
17214 }
17216 /* Parse a declarator.
17218 declarator:
17219 direct-declarator
17220 ptr-operator declarator
17222 abstract-declarator:
17223 ptr-operator abstract-declarator [opt]
17224 direct-abstract-declarator
17226 GNU Extensions:
17228 declarator:
17229 attributes [opt] direct-declarator
17230 attributes [opt] ptr-operator declarator
17232 abstract-declarator:
17233 attributes [opt] ptr-operator abstract-declarator [opt]
17234 attributes [opt] direct-abstract-declarator
17236 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17237 detect constructor, destructor or conversion operators. It is set
17238 to -1 if the declarator is a name, and +1 if it is a
17239 function. Otherwise it is set to zero. Usually you just want to
17240 test for >0, but internally the negative value is used.
17242 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17243 a decl-specifier-seq unless it declares a constructor, destructor,
17244 or conversion. It might seem that we could check this condition in
17245 semantic analysis, rather than parsing, but that makes it difficult
17246 to handle something like `f()'. We want to notice that there are
17247 no decl-specifiers, and therefore realize that this is an
17248 expression, not a declaration.)
17250 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17251 the declarator is a direct-declarator of the form "(...)".
17253 MEMBER_P is true iff this declarator is a member-declarator.
17255 FRIEND_P is true iff this declarator is a friend. */
17259 cp_parser_declarator_kind dcl_kind,
17263 {
17266 cp_cv_quals cv_quals;
17267 tree class_type;
17270 /* Assume this is not a constructor, destructor, or type-conversion
17271 operator. */
17278 /* Check for the ptr-operator production. */
17280 /* Parse the ptr-operator. */
17286 /* If that worked, then we have a ptr-operator. */
17288 {
17289 /* If a ptr-operator was found, then this declarator was not
17290 parenthesized. */
17293 /* The dependent declarator is optional if we are parsing an
17294 abstract-declarator. */
17298 /* Parse the dependent declarator. */
17303 friend_p);
17305 /* If we are parsing an abstract-declarator, we must handle the
17306 case where the dependent declarator is absent. */
17311 declarator = cp_parser_make_indirect_declarator
17313 }
17314 /* Everything else is a direct-declarator. */
17315 else
17316 {
17319 CPP_OPEN_PAREN);
17321 ctor_dtor_or_conv_p,
17323 }
17328 }
17330 /* Parse a direct-declarator or direct-abstract-declarator.
17332 direct-declarator:
17333 declarator-id
17334 direct-declarator ( parameter-declaration-clause )
17335 cv-qualifier-seq [opt]
17336 ref-qualifier [opt]
17337 exception-specification [opt]
17338 direct-declarator [ constant-expression [opt] ]
17339 ( declarator )
17341 direct-abstract-declarator:
17342 direct-abstract-declarator [opt]
17343 ( parameter-declaration-clause )
17344 cv-qualifier-seq [opt]
17345 ref-qualifier [opt]
17346 exception-specification [opt]
17347 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17348 ( abstract-declarator )
17350 Returns a representation of the declarator. DCL_KIND is
17351 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17352 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17353 we are parsing a direct-declarator. It is
17354 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17355 of ambiguity we prefer an abstract declarator, as per
17356 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17357 as for cp_parser_declarator. */
17361 cp_parser_declarator_kind dcl_kind,
17364 {
17374 {
17375 /* Peek at the next token. */
17378 {
17379 /* This is either a parameter-declaration-clause, or a
17380 parenthesized declarator. When we know we are parsing a
17381 named declarator, it must be a parenthesized declarator
17382 if FIRST is true. For instance, `(int)' is a
17383 parameter-declaration-clause, with an omitted
17384 direct-abstract-declarator. But `((*))', is a
17385 parenthesized abstract declarator. Finally, when T is a
17386 template parameter `(T)' is a
17387 parameter-declaration-clause, and not a parenthesized
17388 named declarator.
17390 We first try and parse a parameter-declaration-clause,
17391 and then try a nested declarator (if FIRST is true).
17393 It is not an error for it not to be a
17394 parameter-declaration-clause, even when FIRST is
17395 false. Consider,
17397 int i (int);
17398 int i (3);
17400 The first is the declaration of a function while the
17401 second is the definition of a variable, including its
17402 initializer.
17404 Having seen only the parenthesis, we cannot know which of
17405 these two alternatives should be selected. Even more
17406 complex are examples like:
17408 int i (int (a));
17409 int i (int (3));
17411 The former is a function-declaration; the latter is a
17412 variable initialization.
17414 Thus again, we try a parameter-declaration-clause, and if
17415 that fails, we back out and return. */
17418 {
17419 tree params;
17422 /* In a member-declarator, the only valid interpretation
17423 of a parenthesis is the start of a
17424 parameter-declaration-clause. (It is invalid to
17425 initialize a static data member with a parenthesized
17426 initializer; only the "=" form of initialization is
17427 permitted.) */
17431 /* Consume the `('. */
17434 {
17435 /* If this is going to be an abstract declarator, we're
17436 in a declarator and we can't have default args. */
17439 }
17443 /* Parse the parameter-declaration-clause. */
17446 /* Consume the `)'. */
17449 /* If all went well, parse the cv-qualifier-seq,
17450 ref-qualifier and the exception-specification. */
17452 {
17453 cp_cv_quals cv_quals;
17454 cp_virt_specifiers virt_specifiers;
17455 cp_ref_qualifier ref_qual;
17456 tree exception_specification;
17457 tree late_return;
17458 tree attrs;
17468 /* Parse the cv-qualifier-seq. */
17470 /* Parse the ref-qualifier. */
17472 /* And the exception-specification. */
17473 exception_specification
17478 /* In here, we handle cases where attribute is used after
17479 the function declaration. For example:
17480 void func (int x) __attribute__((vector(..))); */
17483 {
17487 CPP_SEMICOLON)
17489 CPP_OPEN_BRACE))
17492 ;
17493 else
17495 }
17496 late_return = (cp_parser_late_return_type_opt
17501 /* Parse the virt-specifier-seq. */
17504 /* Create the function-declarator. */
17506 params,
17507 cv_quals,
17508 virt_specifiers,
17509 ref_qual,
17510 exception_specification,
17511 late_return);
17513 /* Any subsequent parameter lists are to do with
17514 return type, so are not those of the declared
17515 function. */
17517 }
17519 /* Remove the function parms from scope. */
17523 /* Repeat the main loop. */
17525 }
17527 /* If this is the first, we can try a parenthesized
17528 declarator. */
17530 {
17536 /* Consume the `('. */
17538 /* Parse the nested declarator. */
17541 declarator
17547 /* Expect a `)'. */
17554 }
17555 /* Otherwise, we must be done. */
17556 else
17558 }
17562 {
17563 /* Parse an array-declarator. */
17572 /* Consume the `['. */
17574 /* Peek at the next token. */
17576 /* If the next token is `]', then there is no
17577 constant-expression. */
17579 {
17581 bounds
17591 {
17592 /* Normally, the array bound must be an integral constant
17593 expression. However, as an extension, we allow VLAs
17594 in function scopes as long as they aren't part of a
17595 parameter declaration. */
17599 }
17602 {
17603 /* Remember this wasn't a constant-expression. */
17606 }
17607 }
17608 else
17610 /* Look for the closing `]'. */
17612 {
17615 }
17620 }
17622 {
17623 {
17624 tree qualifying_scope;
17625 tree unqualified_name;
17626 tree attrs;
17627 special_function_kind sfk;
17632 /* Parse a declarator-id */
17635 {
17638 /* If we see an ellipsis, we should be looking at a
17639 parameter pack. */
17641 {
17642 /* Consume the `...' */
17646 }
17647 }
17650 unqualified_name
17654 {
17658 {
17659 /* Check whether an error occurred. */
17662 /* We already consumed the ellipsis to mark a
17663 parameter pack, but we have no way to report it,
17664 so abort the tentative parse. We will be exiting
17665 immediately anyway. */
17667 }
17668 else
17674 && (qualifying_scope
17676 {
17679 }
17680 }
17685 {
17690 }
17696 {
17697 /* In the declaration of a member of a template class
17698 outside of the class itself, the SCOPE will sometimes
17699 be a TYPENAME_TYPE. For example, given:
17701 template <typename T>
17702 int S<T>::R::i = 3;
17704 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17705 this context, we must resolve S<T>::R to an ordinary
17706 type, rather than a typename type.
17708 The reason we normally avoid resolving TYPENAME_TYPEs
17709 is that a specialization of `S' might render
17710 `S<T>::R' not a type. However, if `S' is
17711 specialized, then this `i' will not be used, so there
17712 is no harm in resolving the types here. */
17713 tree type;
17715 /* Resolve the TYPENAME_TYPE. */
17718 /* If that failed, the declarator is invalid. */
17720 {
17723 "cannot define member of dependent typedef "
17725 else
17730 }
17732 }
17737 {
17738 tree class_type;
17743 else
17747 {
17750 {
17753 {
17757 "use %<%T::%D%> instead of %<%T::%D%> to "
17759 class_type,
17764 }
17765 else
17767 }
17768 else
17769 {
17770 /* We do not attempt to print the declarator
17771 here because we do not have enough
17772 information about its original syntactic
17773 form. */
17777 }
17778 }
17781 {
17787 for an anonymous type, even if the type
17788 got a name for linkage purposes. */
17790 /* Handle correctly (c++/19200):
17792 struct S {
17793 struct T{};
17794 friend void S(T);
17795 };
17797 and also:
17799 namespace N {
17800 void S();
17801 }
17803 struct S {
17804 friend void N::S();
17805 }; */
17806 && !(friend_p
17809 class_type))
17810 {
17813 }
17821 }
17822 }
17824 unqualified_name,
17825 sfk);
17832 }
17834 handle_declarator:;
17837 {
17838 /* Any names that appear after the declarator-id for a
17839 member are looked up in the containing scope. */
17841 {
17842 /* But declarations with qualified-ids can't appear in a
17843 function. */
17847 }
17849 }
17853 /* Default args are only allowed on function
17854 declarations. */
17856 else
17860 }
17861 /* We're done. */
17862 else
17864 }
17866 /* For an abstract declarator, we might wind up with nothing at this
17867 point. That's an error; the declarator is not optional. */
17871 /* If we entered a scope, we must exit it now. */
17879 }
17881 /* Parse a ptr-operator.
17883 ptr-operator:
17884 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17885 * cv-qualifier-seq [opt]
17886 &
17887 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17888 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17890 GNU Extension:
17892 ptr-operator:
17893 & cv-qualifier-seq [opt]
17895 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17896 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17897 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17898 filled in with the TYPE containing the member. *CV_QUALS is
17899 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17900 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17901 Note that the tree codes returned by this function have nothing
17902 to do with the types of trees that will be eventually be created
17903 to represent the pointer or reference type being parsed. They are
17904 just constants with suggestive names. */
17905 static enum tree_code
17910 {
17915 /* Assume that it's not a pointer-to-member. */
17917 /* And that there are no cv-qualifiers. */
17920 /* Peek at the next token. */
17923 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17933 {
17934 /* Consume the `*', `&' or `&&'. */
17937 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17938 `&', if we are allowing GNU extensions. (The only qualifier
17939 that can legally appear after `&' is `restrict', but that is
17940 enforced during semantic analysis. */
17948 }
17949 else
17950 {
17951 /* Try the pointer-to-member case. */
17953 /* Look for the optional `::' operator. */
17956 /* Look for the nested-name specifier. */
17963 /* If we found it, and the next token is a `*', then we are
17964 indeed looking at a pointer-to-member operator. */
17967 {
17968 /* Indicate that the `*' operator was used. */
17976 else
17977 {
17978 /* The type of which the member is a member is given by the
17979 current SCOPE. */
17981 /* The next name will not be qualified. */
17985 /* Look for optional c++11 attributes. */
17989 /* Look for the optional cv-qualifier-seq. */
17991 }
17992 }
17993 /* If that didn't work we don't have a ptr-operator. */
17996 }
17999 }
18001 /* Parse an (optional) cv-qualifier-seq.
18003 cv-qualifier-seq:
18004 cv-qualifier cv-qualifier-seq [opt]
18006 cv-qualifier:
18007 const
18008 volatile
18010 GNU Extension:
18012 cv-qualifier:
18013 __restrict__
18015 Returns a bitmask representing the cv-qualifiers. */
18017 static cp_cv_quals
18019 {
18023 {
18025 cp_cv_quals cv_qualifier;
18027 /* Peek at the next token. */
18029 /* See if it's a cv-qualifier. */
18031 {
18047 }
18053 {
18056 }
18057 else
18058 {
18061 }
18062 }
18065 }
18067 /* Parse an (optional) ref-qualifier
18069 ref-qualifier:
18070 &
18071 &&
18073 Returns cp_ref_qualifier representing ref-qualifier. */
18075 static cp_ref_qualifier
18077 {
18080 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18085 {
18090 {
18102 }
18107 {
18110 }
18111 else
18112 {
18115 }
18116 }
18119 }
18121 /* Parse an (optional) virt-specifier-seq.
18123 virt-specifier-seq:
18124 virt-specifier virt-specifier-seq [opt]
18126 virt-specifier:
18127 override
18128 final
18130 Returns a bitmask representing the virt-specifiers. */
18132 static cp_virt_specifiers
18134 {
18138 {
18140 cp_virt_specifiers virt_specifier;
18142 /* Peek at the next token. */
18144 /* See if it's a virt-specifier-qualifier. */
18148 {
18151 }
18153 {
18156 }
18158 {
18160 }
18161 else
18165 {
18168 }
18169 else
18170 {
18173 }
18174 }
18176 }
18178 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18179 is in scope even though it isn't real. */
18181 void
18183 {
18184 tree this_parm;
18187 {
18188 /* We don't clear this between NSDMIs. Is it already what we want? */
18193 }
18196 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18198 current_class_ref
18201 }
18203 /* Return true iff our current scope is a non-static data member
18204 initializer. */
18206 bool
18208 {
18209 /* We recognize NSDMI context by the context-less 'this' pointer set up
18210 by the function above. */
18214 }
18216 /* Parse a late-specified return type, if any. This is not a separate
18217 non-terminal, but part of a function declarator, which looks like
18219 -> trailing-type-specifier-seq abstract-declarator(opt)
18221 Returns the type indicated by the type-id.
18223 In addition to this this parses any queued up omp declare simd
18224 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18226 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18227 function. */
18229 static tree
18231 cp_cv_quals quals)
18232 {
18236 && declarator
18242 /* Peek at the next token. */
18244 /* A late-specified return type is indicated by an initial '->'. */
18251 {
18252 /* DR 1207: 'this' is in scope in the trailing return type. */
18254 }
18257 {
18258 /* Consume the ->. */
18262 }
18265 declarator->std_attributes
18269 declarator->std_attributes
18274 {
18277 }
18280 }
18282 /* Parse a declarator-id.
18284 declarator-id:
18285 id-expression
18286 :: [opt] nested-name-specifier [opt] type-name
18288 In the `id-expression' case, the value returned is as for
18289 cp_parser_id_expression if the id-expression was an unqualified-id.
18290 If the id-expression was a qualified-id, then a SCOPE_REF is
18291 returned. The first operand is the scope (either a NAMESPACE_DECL
18292 or TREE_TYPE), but the second is still just a representation of an
18293 unqualified-id. */
18295 static tree
18297 {
18298 tree id;
18299 /* The expression must be an id-expression. Assume that qualified
18300 names are the names of types so that:
18302 template <class T>
18303 int S<T>::R::i = 3;
18305 will work; we must treat `S<T>::R' as the name of a type.
18306 Similarly, assume that qualified names are templates, where
18307 required, so that:
18309 template <class T>
18310 int S<T>::R<T>::i = 3;
18312 will work, too. */
18318 optional_p);
18322 }
18324 /* Parse a type-id.
18326 type-id:
18327 type-specifier-seq abstract-declarator [opt]
18329 Returns the TYPE specified. */
18331 static tree
18334 {
18335 cp_decl_specifier_seq type_specifier_seq;
18338 /* Parse the type-specifier-seq. */
18340 is_trailing_return,
18345 /* There might or might not be an abstract declarator. */
18347 /* Look for the declarator. */
18348 abstract_declarator
18353 /* Check to see if there really was a declarator. */
18358 /* None of the valid uses of 'auto' in C++14 involve the type-id
18359 nonterminal, but it is valid in a trailing-return-type. */
18362 {
18363 /* A type-id with type 'auto' is only ok if the abstract declarator
18364 is a function declarator with a late-specified return type. */
18369 else
18370 {
18373 }
18374 }
18377 is_template_arg);
18378 }
18381 {
18383 }
18386 {
18387 tree r;
18389 parser->type_definition_forbidden_message
18394 {
18397 }
18399 }
18402 {
18404 }
18406 /* Parse a type-specifier-seq.
18408 type-specifier-seq:
18409 type-specifier type-specifier-seq [opt]
18411 GNU extension:
18413 type-specifier-seq:
18414 attributes type-specifier-seq [opt]
18416 If IS_DECLARATION is true, we are at the start of a "condition" or
18417 exception-declaration, so we might be followed by a declarator-id.
18419 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18420 i.e. we've just seen "->".
18422 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18424 static void
18429 {
18434 /* Clear the TYPE_SPECIFIER_SEQ. */
18437 /* In the context of a trailing return type, enum E { } is an
18438 elaborated-type-specifier followed by a function-body, not an
18439 enum-specifier. */
18443 /* Parse the type-specifiers and attributes. */
18445 {
18446 tree type_specifier;
18449 /* Check for attributes first. */
18451 {
18456 }
18458 /* record the token of the beginning of the type specifier seq,
18459 for error reporting purposes*/
18463 /* Look for the type-specifier. */
18465 flags,
18466 type_specifier_seq,
18468 NULL,
18471 {
18472 /* If the first type-specifier could not be found, this is not a
18473 type-specifier-seq at all. */
18475 {
18476 /* Set in_declarator_p to avoid skipping to the semicolon. */
18488 }
18489 /* If subsequent type-specifiers could not be found, the
18490 type-specifier-seq is complete. */
18492 }
18495 /* The standard says that a condition can be:
18497 type-specifier-seq declarator = assignment-expression
18499 However, given:
18501 struct S {};
18502 if (int S = ...)
18504 we should treat the "S" as a declarator, not as a
18505 type-specifier. The standard doesn't say that explicitly for
18506 type-specifier-seq, but it does say that for
18507 decl-specifier-seq in an ordinary declaration. Perhaps it
18508 would be clearer just to allow a decl-specifier-seq here, and
18509 then add a semantic restriction that if any decl-specifiers
18510 that are not type-specifiers appear, the program is invalid. */
18513 }
18514 }
18516 /* Return whether the function currently being declared has an associated
18517 template parameter list. */
18519 static bool
18521 {
18534 }
18536 /* Parse a parameter-declaration-clause.
18538 parameter-declaration-clause:
18539 parameter-declaration-list [opt] ... [opt]
18540 parameter-declaration-list , ...
18542 Returns a representation for the parameter declarations. A return
18543 value of NULL indicates a parameter-declaration-clause consisting
18544 only of an ellipsis. */
18546 static tree
18548 {
18549 tree parameters;
18558 parser->auto_is_implicit_function_template_parm_p
18560 }
18566 && !processing_template_parmlist
18572 /* Peek at the next token. */
18574 /* Check for trivial parameter-declaration-clauses. */
18576 {
18577 /* Consume the `...' token. */
18580 }
18582 /* There are no parameters. */
18583 {
18584 #ifndef NO_IMPLICIT_EXTERN_C
18589 else
18590 #endif
18592 }
18593 /* Check for `(void)', too, which is a special case. */
18597 {
18598 /* Consume the `void' token. */
18600 /* There are no parameters. */
18602 }
18604 /* Parse the parameter-declaration-list. */
18606 /* If a parse error occurred while parsing the
18607 parameter-declaration-list, then the entire
18608 parameter-declaration-clause is erroneous. */
18612 /* Peek at the next token. */
18614 /* If it's a `,', the clause should terminate with an ellipsis. */
18616 {
18617 /* Consume the `,'. */
18619 /* Expect an ellipsis. */
18620 ellipsis_p
18622 }
18623 /* It might also be `...' if the optional trailing `,' was
18624 omitted. */
18626 {
18627 /* Consume the `...' token. */
18629 /* And remember that we saw it. */
18631 }
18632 else
18635 /* Finish the parameter list. */
18640 }
18642 /* Parse a parameter-declaration-list.
18644 parameter-declaration-list:
18645 parameter-declaration
18646 parameter-declaration-list , parameter-declaration
18648 Returns a representation of the parameter-declaration-list, as for
18649 cp_parser_parameter_declaration_clause. However, the
18650 `void_list_node' is never appended to the list. Upon return,
18651 *IS_ERROR will be true iff an error occurred. */
18653 static tree
18655 {
18661 /* Assume all will go well. */
18663 /* The special considerations that apply to a function within an
18664 unbraced linkage specifications do not apply to the parameters
18665 to the function. */
18666 saved_in_unbraced_linkage_specification_p
18670 /* Look for more parameters. */
18672 {
18680 /* Parse the parameter. */
18681 parameter
18686 /* We don't know yet if the enclosing context is deprecated, so wait
18687 and warn in grokparms if appropriate. */
18691 {
18692 /* If a function parameter pack was specified and an implicit template
18693 parameter was introduced during cp_parser_parameter_declaration,
18694 change any implicit parameters introduced into packs. */
18698 {
18706 }
18710 PARM,
18713 }
18717 /* If a parse error occurred parsing the parameter declaration,
18718 then the entire parameter-declaration-list is erroneous. */
18720 {
18724 }
18734 {
18738 }
18740 /* Add the new parameter to the list. */
18744 /* Peek at the next token. */
18747 /* These are for Objective-C++ */
18750 /* The parameter-declaration-list is complete. */
18753 {
18756 /* Peek at the next token. */
18758 /* If it's an ellipsis, then the list is complete. */
18761 /* Otherwise, there must be more parameters. Consume the
18762 `,'. */
18764 /* When parsing something like:
18766 int i(float f, double d)
18768 we can tell after seeing the declaration for "f" that we
18769 are not looking at an initialization of a variable "i",
18770 but rather at the declaration of a function "i".
18772 Due to the fact that the parsing of template arguments
18773 (as specified to a template-id) requires backtracking we
18774 cannot use this technique when inside a template argument
18775 list. */
18779 /* However, a parameter-declaration of the form
18780 "float(f)" (which is a valid declaration of a
18781 parameter "f") can also be interpreted as an
18782 expression (the conversion of "f" to "float"). */
18785 }
18786 else
18787 {
18795 }
18796 }
18798 parser->in_unbraced_linkage_specification_p
18801 /* Reset implicit_template_scope if we are about to leave the function
18802 parameter list that introduced it. Note that for out-of-line member
18803 definitions, there will be one or more class scopes before we get to
18804 the template parameter scope. */
18808 {
18812 {
18815 }
18816 }
18819 }
18821 /* Parse a parameter declaration.
18823 parameter-declaration:
18824 decl-specifier-seq ... [opt] declarator
18825 decl-specifier-seq declarator = assignment-expression
18826 decl-specifier-seq ... [opt] abstract-declarator [opt]
18827 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18829 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18830 declares a template parameter. (In that case, a non-nested `>'
18831 token encountered during the parsing of the assignment-expression
18832 is not interpreted as a greater-than operator.)
18834 Returns a representation of the parameter, or NULL if an error
18835 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18836 true iff the declarator is of the form "(p)". */
18842 {
18844 cp_decl_specifier_seq decl_specifiers;
18846 tree default_argument;
18850 /* In a template parameter, `>' is not an operator.
18852 [temp.param]
18854 When parsing a default template-argument for a non-type
18855 template-parameter, the first non-nested `>' is taken as the end
18856 of the template parameter-list rather than a greater-than
18857 operator. */
18859 /* Type definitions may not appear in parameter types. */
18861 parser->type_definition_forbidden_message
18864 /* Parse the declaration-specifiers. */
18866 CP_PARSER_FLAGS_NONE,
18870 /* Complain about missing 'typename' or other invalid type names. */
18875 /* If an error occurred, there's no reason to attempt to parse the
18876 rest of the declaration. */
18878 {
18881 }
18883 /* Peek at the next token. */
18886 /* If the next token is a `)', `,', `=', `>', or `...', then there
18887 is no declarator. However, when variadic templates are enabled,
18888 there may be a declarator following `...'. */
18893 {
18897 }
18898 /* Otherwise, there should be a declarator. */
18899 else
18900 {
18904 /* After seeing a decl-specifier-seq, if the next token is not a
18905 "(", there is no possibility that the code is a valid
18906 expression. Therefore, if parsing tentatively, we commit at
18907 this point. */
18909 /* In an expression context, having seen:
18911 (int((char ...
18913 we cannot be sure whether we are looking at a
18914 function-type (taking a "char" as a parameter) or a cast
18915 of some object of type "char" to "int". */
18921 /* Parse the declarator. */
18924 CP_PARSER_DECLARATOR_EITHER,
18926 parenthesized_p,
18930 /* After the declarator, allow more attributes. */
18931 decl_specifiers.attributes
18934 }
18936 /* If the next token is an ellipsis, and we have not seen a
18937 declarator name, and the type of the declarator contains parameter
18938 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18939 a parameter pack expansion expression. Otherwise, leave the
18940 ellipsis for a C-style variadic function. */
18943 {
18954 {
18955 /* Consume the `...'. */
18959 /* Build a pack expansion type */
18962 else
18964 }
18965 }
18967 /* The restriction on defining new types applies only to the type
18968 of the parameter, not to the default argument. */
18971 /* If the next token is `=', then process a default argument. */
18973 {
18975 /* If we are defining a class, then the tokens that make up the
18976 default argument must be saved and processed later. */
18981 /* Outside of a class definition, we can just parse the
18982 assignment-expression. */
18983 else
18984 default_argument
18988 {
18991 else
18992 {
18994 "default arguments are only "
18997 }
18998 }
19002 {
19003 /* Find the name of the parameter pack. */
19010 template_parm_p
19016 else
19018 template_parm_p
19025 }
19026 }
19027 else
19031 declarator,
19032 default_argument);
19033 }
19035 /* Parse a default argument and return it.
19037 TEMPLATE_PARM_P is true if this is a default argument for a
19038 non-type template parameter. */
19039 static tree
19041 {
19047 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19048 set correctly. */
19051 /* Local variable names (and the `this' keyword) may not
19052 appear in a default argument. */
19055 /* Parse the assignment-expression. */
19060 /* The "this" pointer is not valid in a default argument. */
19062 {
19067 }
19068 default_argument
19070 /* Restore the "this" pointer. */
19072 {
19075 }
19084 }
19086 /* Parse a function-body.
19088 function-body:
19089 compound_statement */
19091 static void
19093 {
19095 }
19097 /* Parse a ctor-initializer-opt followed by a function-body. Return
19098 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19099 is true we are parsing a function-try-block. */
19101 static bool
19104 {
19112 /* Begin the function body. */
19114 /* Parse the optional ctor-initializer. */
19117 /* If we're parsing a constexpr constructor definition, we need
19118 to check that the constructor body is indeed empty. However,
19119 before we get to cp_parser_function_body lot of junk has been
19120 generated, so we can't just check that we have an empty block.
19121 Rather we take a snapshot of the outermost block, and check whether
19122 cp_parser_function_body changed its state. */
19124 {
19128 }
19129 /* Parse the function-body. */
19133 /* Finish the function body. */
19137 }
19139 /* Parse an initializer.
19141 initializer:
19142 = initializer-clause
19143 ( expression-list )
19145 Returns an expression representing the initializer. If no
19146 initializer is present, NULL_TREE is returned.
19148 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19149 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19150 set to TRUE if there is no initializer present. If there is an
19151 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19152 is set to true; otherwise it is set to false. */
19154 static tree
19157 {
19159 tree init;
19161 /* Peek at the next token. */
19164 /* Let our caller know whether or not this initializer was
19165 parenthesized. */
19167 /* Assume that the initializer is constant. */
19171 {
19172 /* Consume the `='. */
19174 /* Parse the initializer-clause. */
19176 }
19178 {
19183 non_constant_p);
19188 }
19190 {
19195 }
19196 else
19197 {
19198 /* Anything else is an error. */
19201 }
19204 }
19206 /* Parse an initializer-clause.
19208 initializer-clause:
19209 assignment-expression
19210 braced-init-list
19212 Returns an expression representing the initializer.
19214 If the `assignment-expression' production is used the value
19215 returned is simply a representation for the expression.
19217 Otherwise, calls cp_parser_braced_list. */
19219 static tree
19221 {
19222 tree initializer;
19224 /* Assume the expression is constant. */
19227 /* If it is not a `{', then we are looking at an
19228 assignment-expression. */
19230 {
19231 initializer
19234 non_constant_p);
19235 }
19236 else
19240 }
19242 /* Parse a brace-enclosed initializer list.
19244 braced-init-list:
19245 { initializer-list , [opt] }
19246 { }
19248 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19249 the elements of the initializer-list (or NULL, if the last
19250 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19251 NULL_TREE. There is no way to detect whether or not the optional
19252 trailing `,' was provided. NON_CONSTANT_P is as for
19253 cp_parser_initializer. */
19255 static tree
19257 {
19258 tree initializer;
19260 /* Consume the `{' token. */
19262 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19264 /* If it's not a `}', then there is a non-trivial initializer. */
19266 {
19267 /* Parse the initializer list. */
19270 /* A trailing `,' token is allowed. */
19273 }
19274 else
19276 /* Now, there should be a trailing `}'. */
19280 }
19282 /* Consume tokens up to, and including, the next non-nested closing `]'.
19283 Returns true iff we found a closing `]'. */
19285 static bool
19287 {
19291 {
19295 {
19298 /* If we've run out of tokens, then there is no closing `]'. */
19307 {
19310 }
19315 }
19317 /* Consume the token. */
19319 }
19320 }
19322 /* Return true if we are looking at an array-designator, false otherwise. */
19324 static bool
19326 {
19327 /* Consume the `['. */
19332 /* Skip tokens until the next token is a closing square bracket.
19333 If we find the closing `]', and the next token is a `=', then
19334 we are looking at an array designator. */
19335 bool array_designator_p
19339 /* Roll back the tokens we skipped. */
19343 }
19345 /* Parse an initializer-list.
19347 initializer-list:
19348 initializer-clause ... [opt]
19349 initializer-list , initializer-clause ... [opt]
19351 GNU Extension:
19353 initializer-list:
19354 designation initializer-clause ...[opt]
19355 initializer-list , designation initializer-clause ...[opt]
19357 designation:
19358 . identifier =
19359 identifier :
19360 [ constant-expression ] =
19362 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19363 for the initializer. If the INDEX of the elt is non-NULL, it is the
19364 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19365 as for cp_parser_initializer. */
19369 {
19372 /* Assume all of the expressions are constant. */
19375 /* Parse the rest of the list. */
19377 {
19379 tree designator;
19380 tree initializer;
19383 /* If the next token is an identifier and the following one is a
19384 colon, we are looking at the GNU designated-initializer
19385 syntax. */
19389 {
19390 /* Warn the user that they are using an extension. */
19393 /* Consume the identifier. */
19395 /* Consume the `:'. */
19397 }
19398 /* Also handle the C99 syntax, '. id ='. */
19403 {
19404 /* Warn the user that they are using an extension. */
19407 /* Consume the `.'. */
19409 /* Consume the identifier. */
19411 /* Consume the `='. */
19413 }
19414 /* Also handle C99 array designators, '[ const ] ='. */
19418 {
19419 /* In C++11, [ could start a lambda-introducer. */
19425 {
19428 }
19429 else
19430 {
19435 }
19441 }
19442 else
19445 /* Parse the initializer. */
19448 /* If any clause is non-constant, so is the entire initializer. */
19452 /* If we have an ellipsis, this is an initializer pack
19453 expansion. */
19455 {
19456 /* Consume the `...'. */
19459 /* Turn the initializer into an initializer expansion. */
19461 }
19463 /* Add it to the vector. */
19466 /* If the next token is not a comma, we have reached the end of
19467 the list. */
19471 /* Peek at the next token. */
19473 /* If the next token is a `}', then we're still done. An
19474 initializer-clause can have a trailing `,' after the
19475 initializer-list and before the closing `}'. */
19479 /* Consume the `,' token. */
19481 }
19484 }
19486 /* Classes [gram.class] */
19488 /* Parse a class-name.
19490 class-name:
19491 identifier
19492 template-id
19494 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19495 to indicate that names looked up in dependent types should be
19496 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19497 keyword has been used to indicate that the name that appears next
19498 is a template. TAG_TYPE indicates the explicit tag given before
19499 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19500 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19501 is the class being defined in a class-head.
19503 Returns the TYPE_DECL representing the class. */
19505 static tree
19513 {
19514 tree decl;
19515 tree scope;
19520 /* All class-names start with an identifier. */
19523 {
19526 }
19528 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19529 to a template-id, so we save it here. */
19534 /* Any name names a type if we're following the `typename' keyword
19535 in a qualified name where the enclosing scope is type-dependent. */
19538 /* Handle the common case (an identifier, but not a template-id)
19539 efficiently. */
19542 {
19546 /* Look for the identifier. */
19550 /* If the next token isn't an identifier, we are certainly not
19551 looking at a class-name. */
19554 /* If we know this is a type-name, there's no need to look it
19555 up. */
19558 else
19559 {
19560 tree ambiguous_decls;
19561 /* If we already know that this lookup is ambiguous, then
19562 we've already issued an error message; there's no reason
19563 to check again. */
19565 {
19568 }
19569 /* If the next token is a `::', then the name must be a type
19570 name.
19572 [basic.lookup.qual]
19574 During the lookup for a name preceding the :: scope
19575 resolution operator, object, function, and enumerator
19576 names are ignored. */
19579 /* Look up the name. */
19581 tag_type,
19584 check_dependency_p,
19588 {
19592 }
19593 }
19594 }
19595 else
19596 {
19597 /* Try a template-id. */
19599 check_dependency_p,
19600 tag_type,
19601 is_declaration);
19604 }
19608 /* If this is a typename, create a TYPENAME_TYPE. */
19610 {
19615 }
19619 /* Check to see that it is really the name of a class. */
19623 /* Situations like this:
19625 template <typename T> struct A {
19626 typename T::template X<int>::I i;
19627 };
19629 are problematic. Is `T::template X<int>' a class-name? The
19630 standard does not seem to be definitive, but there is no other
19631 valid interpretation of the following `::'. Therefore, those
19632 names are considered class-names. */
19633 {
19637 }
19641 /* In Objective-C 2.0, a classname followed by '.' starts a
19642 dot-syntax expression, and it's not a type-name. */
19654 }
19656 /* Parse a class-specifier.
19658 class-specifier:
19659 class-head { member-specification [opt] }
19661 Returns the TREE_TYPE representing the class. */
19663 static tree
19665 {
19666 tree type;
19680 /* Parse the class-head. */
19683 /* If the class-head was a semantic disaster, skip the entire body
19684 of the class. */
19686 {
19690 }
19692 /* Look for the `{'. */
19694 {
19697 }
19701 /* Issue an error message if type-definitions are forbidden here. */
19703 /* Remember that we are defining one more class. */
19705 /* Inside the class, surrounding template-parameter-lists do not
19706 apply. */
19707 saved_num_template_parameter_lists
19710 /* We are not in a function body. */
19713 /* Or in a loop. */
19716 /* Or in a switch. */
19719 /* We are not immediately inside an extern "lang" block. */
19720 saved_in_unbraced_linkage_specification_p
19724 /* Start the class. */
19726 {
19729 }
19733 /* If the type is erroneous, skip the entire body of the class. */
19735 else
19736 /* Parse the member-specification. */
19739 /* Look for the trailing `}'. */
19741 /* Look for trailing attributes to apply to this class. */
19749 /* We've finished a type definition. Check for the common syntax
19750 error of forgetting a semicolon after the definition. We need to
19751 be careful, as we can't just check for not-a-semicolon and be done
19752 with it; the user might have typed:
19754 class X { } c = ...;
19755 class X { } *p = ...;
19757 and so forth. Instead, enumerate all the possible tokens that
19758 might follow this production; if we don't see one of them, then
19759 complain and silently insert the semicolon. */
19760 {
19765 /* Don't try to parse c++11 attributes here. As per the
19766 grammar, that should be a task for
19767 cp_parser_decl_specifier_seq. */
19771 {
19782 /* While it's legal for type qualifiers and storage class
19783 specifiers to follow type definitions in the grammar, only
19784 compiler testsuites contain code like that. Assume that if
19785 we see such code, then what we're really seeing is a case
19786 like:
19788 class X { }
19789 const <type> var = ...;
19791 or
19793 class Y { }
19794 static <type> func (...) ...
19796 i.e. the qualifier or specifier applies to the next
19797 declaration. To do so, however, we need to look ahead one
19798 more token to see if *that* token is a type specifier.
19800 This code could be improved to handle:
19802 class Z { }
19803 static const <type> var = ...; */
19806 {
19809 /* Handling user-defined types here would be nice, but very
19810 tricky. */
19811 want_semicolon
19814 }
19818 }
19820 /* If we don't have a type, then something is very wrong and we
19821 shouldn't try to do anything clever. Likewise for not seeing the
19822 closing brace. */
19824 {
19825 cp_token_position prev
19836 else
19839 /* Unget one token and smash it to look as though we encountered
19840 a semicolon in the input stream. */
19845 }
19846 }
19848 /* If this class is not itself within the scope of another class,
19849 then we need to parse the bodies of all of the queued function
19850 definitions. Note that the queued functions defined in a class
19851 are not always processed immediately following the
19852 class-specifier for that class. Consider:
19854 struct A {
19855 struct B { void f() { sizeof (A); } };
19856 };
19858 If `f' were processed before the processing of `A' were
19859 completed, there would be no way to compute the size of `A'.
19860 Note that the nesting we are interested in here is lexical --
19861 not the semantic nesting given by TYPE_CONTEXT. In particular,
19862 for:
19864 struct A { struct B; };
19865 struct A::B { void f() { } };
19867 there is no need to delay the parsing of `A::B::f'. */
19869 {
19870 tree decl;
19877 /* In a first pass, parse default arguments to the functions.
19878 Then, in a second pass, parse the bodies of the functions.
19879 This two-phased approach handles cases like:
19881 struct S {
19882 void f() { g(); }
19883 void g(int i = 3);
19884 };
19886 */
19888 {
19890 /* If there are default arguments that have not yet been processed,
19891 take care of them now. */
19893 {
19898 }
19899 /* Make sure that any template parameters are in scope. */
19901 /* Parse the default argument expressions. */
19903 /* Remove any template parameters from the symbol table. */
19905 }
19907 /* Now parse any NSDMIs. */
19911 {
19913 {
19918 }
19921 }
19928 /* Now do some post-NSDMI bookkeeping. */
19934 /* Now parse the body of the functions. */
19936 {
19937 /* OpenMP UDRs need to be parsed before all other functions. */
19944 }
19945 else
19949 }
19950 else
19953 /* Put back any saved access checks. */
19956 /* Restore saved state. */
19960 parser->num_template_parameter_lists
19962 parser->in_unbraced_linkage_specification_p
19966 }
19968 static tree
19970 {
19971 tree ret;
19976 }
19978 /* Parse a class-head.
19980 class-head:
19981 class-key identifier [opt] base-clause [opt]
19982 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19983 class-key nested-name-specifier [opt] template-id
19984 base-clause [opt]
19986 class-virt-specifier:
19987 final
19989 GNU Extensions:
19990 class-key attributes identifier [opt] base-clause [opt]
19991 class-key attributes nested-name-specifier identifier base-clause [opt]
19992 class-key attributes nested-name-specifier [opt] template-id
19993 base-clause [opt]
19995 Upon return BASES is initialized to the list of base classes (or
19996 NULL, if there are none) in the same form returned by
19997 cp_parser_base_clause.
19999 Returns the TYPE of the indicated class. Sets
20000 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20001 involving a nested-name-specifier was used, and FALSE otherwise.
20003 Returns error_mark_node if this is not a class-head.
20005 Returns NULL_TREE if the class-head is syntactically valid, but
20006 semantically invalid in a way that means we should skip the entire
20007 body of the class. */
20009 static tree
20012 {
20013 tree nested_name_specifier;
20017 tree attributes;
20018 tree bases;
20028 /* Assume no nested-name-specifier will be present. */
20030 /* Assume no template parameter lists will be used in defining the
20031 type. */
20035 /* Look for the class-key. */
20040 /* Parse the attributes. */
20043 /* If the next token is `::', that is invalid -- but sometimes
20044 people do try to write:
20046 struct ::S {};
20048 Handle this gracefully by accepting the extra qualifier, and then
20049 issuing an error about it later if this really is a
20050 class-head. If it turns out just to be an elaborated type
20051 specifier, remain silent. */
20057 /* Determine the name of the class. Begin by looking for an
20058 optional nested-name-specifier. */
20060 nested_name_specifier
20066 /* If there was a nested-name-specifier, then there *must* be an
20067 identifier. */
20069 {
20071 /* Although the grammar says `identifier', it really means
20072 `class-name' or `template-name'. You are only allowed to
20073 define a class that has already been declared with this
20074 syntax.
20076 The proposed resolution for Core Issue 180 says that wherever
20077 you see `class T::X' you should treat `X' as a type-name.
20079 It is OK to define an inaccessible class; for example:
20081 class A { class B; };
20082 class A::B {};
20084 We do not know if we will see a class-name, or a
20085 template-name. We look for a class-name first, in case the
20086 class-name is a template-id; if we looked for the
20087 template-name first we would stop after the template-name. */
20092 class_type,
20096 /* If that didn't work, ignore the nested-name-specifier. */
20098 {
20104 }
20105 /* If we could not find a corresponding TYPE, treat this
20106 declaration like an unqualified declaration. */
20109 /* Otherwise, count the number of templates used in TYPE and its
20110 containing scopes. */
20111 else
20112 {
20113 tree scope;
20125 }
20126 }
20127 /* Otherwise, the identifier is optional. */
20128 else
20129 {
20130 /* We don't know whether what comes next is a template-id,
20131 an identifier, or nothing at all. */
20133 /* Check for a template-id. */
20138 class_key,
20140 /* If that didn't work, it could still be an identifier. */
20142 {
20144 {
20147 }
20148 else
20150 }
20151 else
20152 {
20155 }
20156 }
20161 {
20163 class_key,
20165 }
20168 /* If it's not a `:' or a `{' then we can't really be looking at a
20169 class-head, since a class-head only appears as part of a
20170 class-specifier. We have to detect this situation before calling
20171 xref_tag, since that has irreversible side-effects. */
20173 {
20177 }
20179 /* At this point, we're going ahead with the class-specifier, even
20180 if some other problem occurs. */
20183 {
20188 }
20189 /* Issue the error about the overly-qualified name now. */
20191 {
20196 }
20198 {
20203 }
20205 {
20206 tree scope;
20208 /* Reject typedef-names in class heads. */
20210 {
20213 type);
20216 }
20218 /* Figure out in what scope the declaration is being placed. */
20220 /* If that scope does not contain the scope in which the
20221 class was originally declared, the program is invalid. */
20223 {
20226 "declaration of %qD in namespace %qD which does not "
20229 else
20235 }
20236 /* [dcl.meaning]
20238 A declarator-id shall not be qualified except for the
20239 definition of a ... nested class outside of its class
20240 ... [or] the definition or explicit instantiation of a
20241 class member of a namespace outside of its namespace. */
20243 {
20248 }
20249 }
20250 /* An explicit-specialization must be preceded by "template <>". If
20251 it is not, try to recover gracefully. */
20255 {
20259 /* Take the same action that would have been taken by
20260 cp_parser_explicit_specialization. */
20263 }
20264 /* There must be no "return" statements between this point and the
20265 end of this function; set "type "to the correct return value and
20266 use "goto done;" to return. */
20267 /* Make sure that the right number of template parameters were
20268 present. */
20272 {
20273 /* If something went wrong, there is no point in even trying to
20274 process the class-definition. */
20277 }
20279 /* Look up the type. */
20281 {
20285 {
20289 }
20290 else
20291 {
20294 }
20297 }
20299 {
20300 tree class_type;
20302 /* Given:
20304 template <typename T> struct S { struct T };
20305 template <typename T> struct S<T>::T { };
20307 we will get a TYPENAME_TYPE when processing the definition of
20308 `S::T'. We need to resolve it to the actual type before we
20309 try to define it. */
20311 {
20316 else
20317 {
20320 }
20321 }
20325 {
20328 }
20331 /* Enter the scope indicated by the nested-name-specifier. */
20333 /* Get the canonical version of this type. */
20335 /* Call push_template_decl if it seems like we should be defining a
20336 template either from the template headers or the type we're
20337 defining, so that we diagnose both extra and missing headers. */
20341 {
20344 {
20347 }
20348 }
20352 }
20354 {
20355 /* If the class was unnamed, create a dummy name. */
20360 }
20362 /* Indicate whether this class was declared as a `class' or as a
20363 `struct'. */
20368 /* If this type was already complete, and we see another definition,
20369 that's an error. */
20371 {
20373 type);
20375 type);
20378 }
20383 {
20384 /* Apply attributes now, before any use of the class as a template
20385 argument in its base list. */
20388 }
20390 /* We will have entered the scope containing the class; the names of
20391 base classes should be looked up in that context. For example:
20393 struct A { struct B {}; struct C; };
20394 struct A::C : B {};
20396 is valid. */
20398 /* Get the list of base-classes, if there is one. */
20400 {
20401 /* PR59482: enter the class scope so that base-specifiers are looked
20402 up correctly. */
20406 /* PR59482: get out of the previously pushed class scope so that the
20407 subsequent pops pop the right thing. */
20410 }
20411 else
20414 /* If we're really defining a class, process the base classes.
20415 If they're invalid, fail. */
20420 done:
20421 /* Leave the scope given by the nested-name-specifier. We will
20422 enter the class scope itself while processing the members. */
20427 {
20430 }
20436 out:
20439 }
20441 /* Parse a class-key.
20443 class-key:
20444 class
20445 struct
20446 union
20448 Returns the kind of class-key specified, or none_type to indicate
20449 error. */
20451 static enum tag_types
20453 {
20457 /* Look for the class-key. */
20462 /* Check to see if the TOKEN is a class-key. */
20467 }
20469 /* Parse a type-parameter-key.
20471 type-parameter-key:
20472 class
20473 typename
20474 */
20476 static void
20478 {
20479 /* Look for the type-parameter-key. */
20483 {
20486 /* typename is not allowed in a template template parameter
20487 by the standard until C++1Z. */
20489 "ISO C++ forbids typename key in template template parameter;"
20491 }
20492 else
20496 }
20498 /* Parse an (optional) member-specification.
20500 member-specification:
20501 member-declaration member-specification [opt]
20502 access-specifier : member-specification [opt] */
20504 static void
20506 {
20508 {
20512 /* Peek at the next token. */
20514 /* If it's a `}', or EOF then we've seen all the members. */
20520 /* See if this token is a keyword. */
20523 {
20527 /* Consume the access-specifier. */
20529 /* Remember which access-specifier is active. */
20531 /* Look for the `:'. */
20536 /* Accept #pragmas at class scope. */
20538 {
20541 }
20543 /* Otherwise, the next construction must be a
20544 member-declaration. */
20546 }
20547 }
20548 }
20550 /* Parse a member-declaration.
20552 member-declaration:
20553 decl-specifier-seq [opt] member-declarator-list [opt] ;
20554 function-definition ; [opt]
20555 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20556 using-declaration
20557 template-declaration
20558 alias-declaration
20560 member-declarator-list:
20561 member-declarator
20562 member-declarator-list , member-declarator
20564 member-declarator:
20565 declarator pure-specifier [opt]
20566 declarator constant-initializer [opt]
20567 identifier [opt] : constant-expression
20569 GNU Extensions:
20571 member-declaration:
20572 __extension__ member-declaration
20574 member-declarator:
20575 declarator attributes [opt] pure-specifier [opt]
20576 declarator attributes [opt] constant-initializer [opt]
20577 identifier [opt] attributes [opt] : constant-expression
20579 C++0x Extensions:
20581 member-declaration:
20582 static_assert-declaration */
20584 static void
20586 {
20587 cp_decl_specifier_seq decl_specifiers;
20588 tree prefix_attributes;
20589 tree decl;
20598 /* Check for the `__extension__' keyword. */
20600 {
20601 /* Recurse. */
20603 /* Restore the old value of the PEDANTIC flag. */
20607 }
20609 /* Check for a template-declaration. */
20611 {
20612 /* An explicit specialization here is an error condition, and we
20613 expect the specialization handler to detect and report this. */
20617 else
20621 }
20623 /* Check for a using-declaration. */
20625 {
20627 {
20628 /* Parse the using-declaration. */
20632 }
20633 else
20634 {
20635 tree decl;
20639 /* Note that if we actually see the '=' token after the
20640 identifier, cp_parser_alias_declaration commits the
20641 tentative parse. In that case, we really expects an
20642 alias-declaration. Otherwise, we expect a using
20643 declaration. */
20644 alias_decl_expected =
20650 else
20654 }
20655 }
20657 /* Check for @defs. */
20659 {
20664 {
20669 }
20671 }
20673 /* If the next token is `static_assert' we have a static assertion. */
20675 {
20678 }
20685 /* Parse the decl-specifier-seq. */
20688 CP_PARSER_FLAGS_OPTIONAL,
20691 /* Check for an invalid type-name. */
20695 /* If there is no declarator, then the decl-specifier-seq should
20696 specify a type. */
20698 {
20699 /* If there was no decl-specifier-seq, and the next token is a
20700 `;', then we have something like:
20702 struct S { ; };
20704 [class.mem]
20706 Each member-declaration shall declare at least one member
20707 name of the class. */
20709 {
20713 }
20714 else
20715 {
20716 tree type;
20718 /* See if this declaration is a friend. */
20720 /* If there were decl-specifiers, check to see if there was
20721 a class-declaration. */
20724 /* Nested classes have already been added to the class, but
20725 a `friend' needs to be explicitly registered. */
20727 {
20728 /* If the `friend' keyword was present, the friend must
20729 be introduced with a class-key. */
20732 "in C++03 a class-key must be used "
20734 /* In this case:
20736 template <typename T> struct A {
20737 friend struct A<T>::B;
20738 };
20740 A<T>::B will be represented by a TYPENAME_TYPE, and
20741 therefore not recognized by check_tag_decl. */
20743 {
20747 }
20750 "friend declaration does not name a class or "
20752 else
20755 }
20756 /* If there is no TYPE, an error message will already have
20757 been issued. */
20759 ;
20760 /* An anonymous aggregate has to be handled specially; such
20761 a declaration really declares a data member (with a
20762 particular type), as opposed to a nested class. */
20764 {
20765 /* C++11 9.5/6. */
20768 "a storage class on an anonymous aggregate "
20771 /* Remove constructors and such from TYPE, now that we
20772 know it is an anonymous aggregate. */
20774 /* And make the corresponding data member. */
20777 /* Add it to the class. */
20779 }
20780 else
20781 cp_parser_check_access_in_redeclaration
20784 }
20785 }
20786 else
20787 {
20790 /* Clear attributes from the decl_specifiers but keep them
20791 around as prefix attributes that apply them to the entity
20792 being declared. */
20796 /* See if these declarations will be friends. */
20799 /* Keep going until we hit the `;' at the end of the
20800 declaration. */
20802 {
20804 tree first_attribute;
20806 /* Peek at the next token. */
20809 /* Check for a bitfield declaration. */
20814 {
20815 tree identifier;
20816 tree width;
20818 /* Get the name of the bitfield. Note that we cannot just
20819 check TOKEN here because it may have been invalidated by
20820 the call to cp_lexer_peek_nth_token above. */
20823 else
20826 /* Consume the `:' token. */
20828 /* Get the width of the bitfield. */
20829 width
20832 /* Look for attributes that apply to the bitfield. */
20834 /* Remember which attributes are prefix attributes and
20835 which are not. */
20837 /* Combine the attributes. */
20840 /* Create the bitfield declaration. */
20843 identifier,
20844 sfk_none)
20847 width,
20848 attributes);
20849 }
20850 else
20851 {
20853 tree initializer;
20854 tree asm_specification;
20857 /* Parse the declarator. */
20858 declarator
20863 friend_p);
20865 /* If something went wrong parsing the declarator, make sure
20866 that we at least consume some tokens. */
20868 {
20869 /* Skip to the end of the statement. */
20871 /* If the next token is not a semicolon, that is
20872 probably because we just skipped over the body of
20873 a function. So, we consume a semicolon if
20874 present, but do not issue an error message if it
20875 is not present. */
20877 CPP_SEMICOLON))
20880 }
20883 cp_parser_check_for_definition_in_return_type
20887 /* Look for an asm-specification. */
20889 /* Look for attributes that apply to the declaration. */
20891 /* Remember which attributes are prefix attributes and
20892 which are not. */
20894 /* Combine the attributes. */
20897 /* If it's an `=', then we have a constant-initializer or a
20898 pure-specifier. It is not correct to parse the
20899 initializer before registering the member declaration
20900 since the member declaration should be in scope while
20901 its initializer is processed. However, the rest of the
20902 front end does not yet provide an interface that allows
20903 us to handle this correctly. */
20905 {
20906 /* In [class.mem]:
20908 A pure-specifier shall be used only in the declaration of
20909 a virtual function.
20911 A member-declarator can contain a constant-initializer
20912 only if it declares a static member of integral or
20913 enumeration type.
20915 Therefore, if the DECLARATOR is for a function, we look
20916 for a pure-specifier; otherwise, we look for a
20917 constant-initializer. When we call `grokfield', it will
20918 perform more stringent semantics checks. */
20930 {
20932 /* Don't require a constant rvalue in C++11, since we
20933 might want a reference constant. We'll enforce
20934 constancy later. */
20936 /* Parse the initializer. */
20939 }
20940 else
20941 /* Parse the initializer. */
20943 }
20946 {
20950 else
20952 }
20953 /* Otherwise, there is no initializer. */
20954 else
20957 /* See if we are probably looking at a function
20958 definition. We are certainly not looking at a
20959 member-declarator. Calling `grokfield' has
20960 side-effects, so we must not do it unless we are sure
20961 that we are looking at a member-declarator. */
20964 {
20965 /* The grammar does not allow a pure-specifier to be
20966 used when a member function is defined. (It is
20967 possible that this fact is an oversight in the
20968 standard, since a pure function may be defined
20969 outside of the class-specifier. */
20975 declarator,
20976 attributes);
20979 /* If the member was not a friend, declare it here. */
20982 /* Peek at the next token. */
20984 /* If the next token is a semicolon, consume it. */
20988 }
20989 else
20992 /* Create the declaration. */
20997 {
21000 else
21002 }
21003 }
21007 /* Reset PREFIX_ATTRIBUTES. */
21013 /* If there is any qualification still in effect, clear it
21014 now; we will be starting fresh with the next declarator. */
21018 /* If it's a `,', then there are more declarators. */
21020 {
21023 {
21027 }
21028 }
21029 /* If the next token isn't a `;', then we have a parse error. */
21031 CPP_SEMICOLON))
21032 {
21033 /* The next token might be a ways away from where the
21034 actual semicolon is missing. Find the previous token
21035 and use that for our error position. */
21040 /* Assume that the user meant to provide a semicolon. If
21041 we were to cp_parser_skip_to_end_of_statement, we might
21042 skip to a semicolon inside a member function definition
21043 and issue nonsensical error messages. */
21045 }
21048 {
21049 /* Add DECL to the list of members. */
21058 /* Add DECL to the queue of NSDMI to be parsed later. */
21060 }
21064 }
21065 }
21068 out:
21070 }
21072 /* Parse a pure-specifier.
21074 pure-specifier:
21075 = 0
21077 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21078 Otherwise, ERROR_MARK_NODE is returned. */
21080 static tree
21082 {
21085 /* Look for the `=' token. */
21088 /* Look for the `0' token. */
21097 /* Accept = default or = delete in c++0x mode. */
21100 {
21103 }
21105 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21107 {
21112 }
21114 {
21117 }
21120 }
21122 /* Parse a constant-initializer.
21124 constant-initializer:
21125 = constant-expression
21127 Returns a representation of the constant-expression. */
21129 static tree
21131 {
21132 /* Look for the `=' token. */
21136 /* It is invalid to write:
21138 struct S { static const int i = { 7 }; };
21140 */
21142 {
21145 /* Consume the opening brace. */
21147 /* Skip the initializer. */
21149 /* Look for the trailing `}'. */
21153 }
21156 }
21158 /* Derived classes [gram.class.derived] */
21160 /* Parse a base-clause.
21162 base-clause:
21163 : base-specifier-list
21165 base-specifier-list:
21166 base-specifier ... [opt]
21167 base-specifier-list , base-specifier ... [opt]
21169 Returns a TREE_LIST representing the base-classes, in the order in
21170 which they were declared. The representation of each node is as
21171 described by cp_parser_base_specifier.
21173 In the case that no bases are specified, this function will return
21174 NULL_TREE, not ERROR_MARK_NODE. */
21176 static tree
21178 {
21181 /* Look for the `:' that begins the list. */
21184 /* Scan the base-specifier-list. */
21186 {
21188 tree base;
21191 /* Look for the base-specifier. */
21193 /* Look for the (optional) ellipsis. */
21195 {
21196 /* Consume the `...'. */
21200 }
21202 /* Add BASE to the front of the list. */
21204 {
21206 /* Make this a pack expansion type. */
21210 {
21213 }
21214 }
21215 /* Peek at the next token. */
21217 /* If it's not a comma, then the list is complete. */
21220 /* Consume the `,'. */
21222 }
21224 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21225 base class had a qualified name. However, the next name that
21226 appears is certainly not qualified. */
21232 }
21234 /* Parse a base-specifier.
21236 base-specifier:
21237 :: [opt] nested-name-specifier [opt] class-name
21238 virtual access-specifier [opt] :: [opt] nested-name-specifier
21239 [opt] class-name
21240 access-specifier virtual [opt] :: [opt] nested-name-specifier
21241 [opt] class-name
21243 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21244 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21245 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21246 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21248 static tree
21250 {
21258 tree type;
21260 /* Process the optional `virtual' and `access-specifier'. */
21262 {
21263 /* Peek at the next token. */
21265 /* Process `virtual'. */
21267 {
21269 /* If `virtual' appears more than once, issue an error. */
21271 {
21275 }
21279 /* Consume the `virtual' token. */
21287 /* If more than one access specifier appears, issue an
21288 error. */
21291 {
21295 }
21299 /* Consume the access-specifier. */
21307 }
21308 }
21309 /* It is not uncommon to see programs mechanically, erroneously, use
21310 the 'typename' keyword to denote (dependent) qualified types
21311 as base classes. */
21313 {
21318 else
21320 "keyword %<typename%> not allowed in this context "
21323 }
21325 /* Look for the optional `::' operator. */
21327 /* Look for the nested-name-specifier. The simplest way to
21328 implement:
21330 [temp.res]
21332 The keyword `typename' is not permitted in a base-specifier or
21333 mem-initializer; in these contexts a qualified name that
21334 depends on a template-parameter is implicitly assumed to be a
21335 type name.
21337 is to pretend that we have seen the `typename' keyword at this
21338 point. */
21342 typename_type,
21344 /* If the base class is given by a qualified name, assume that names
21345 we see are type names or templates, as appropriate. */
21351 /* DR 950 allows decltype as a base-specifier. */
21353 else
21354 {
21355 /* Otherwise, look for the class-name. */
21357 class_scope_p,
21358 template_p,
21359 typename_type,
21364 }
21370 }
21372 /* Exception handling [gram.exception] */
21374 /* Parse an (optional) noexcept-specification.
21376 noexcept-specification:
21377 noexcept ( constant-expression ) [opt]
21379 If no noexcept-specification is present, returns NULL_TREE.
21380 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21381 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21382 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21383 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21384 in which case a boolean condition is returned instead. */
21386 static tree
21391 {
21395 /* Peek at the next token. */
21398 /* Is it a noexcept-specification? */
21400 {
21401 tree expr;
21405 {
21409 {
21410 /* Types may not be defined in an exception-specification. */
21412 parser->type_definition_forbidden_message
21417 /* Restore the saved message. */
21419 }
21420 else
21421 {
21424 }
21427 }
21428 else
21429 {
21433 }
21435 /* We cannot build a noexcept-spec right away because this will check
21436 that expr is a constexpr. */
21439 else
21441 }
21442 else
21444 }
21446 /* Parse an (optional) exception-specification.
21448 exception-specification:
21449 throw ( type-id-list [opt] )
21451 Returns a TREE_LIST representing the exception-specification. The
21452 TREE_VALUE of each node is a type. */
21454 static tree
21456 {
21458 tree type_id_list;
21461 /* Peek at the next token. */
21464 /* Is it a noexcept-specification? */
21470 /* If it's not `throw', then there's no exception-specification. */
21474 #if 0
21475 /* Enable this once a lot of code has transitioned to noexcept? */
21479 #endif
21481 /* Consume the `throw'. */
21484 /* Look for the `('. */
21487 /* Peek at the next token. */
21489 /* If it's not a `)', then there is a type-id-list. */
21491 {
21492 /* Types may not be defined in an exception-specification. */
21494 parser->type_definition_forbidden_message
21496 /* Parse the type-id-list. */
21498 /* Restore the saved message. */
21500 }
21501 else
21504 /* Look for the `)'. */
21508 }
21510 /* Parse an (optional) type-id-list.
21512 type-id-list:
21513 type-id ... [opt]
21514 type-id-list , type-id ... [opt]
21516 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21517 in the order that the types were presented. */
21519 static tree
21521 {
21525 {
21527 tree type;
21529 /* Get the next type-id. */
21531 /* Parse the optional ellipsis. */
21533 {
21534 /* Consume the `...'. */
21537 /* Turn the type into a pack expansion expression. */
21539 }
21540 /* Add it to the list. */
21542 /* Peek at the next token. */
21544 /* If it is not a `,', we are done. */
21547 /* Consume the `,'. */
21549 }
21552 }
21554 /* Parse a try-block.
21556 try-block:
21557 try compound-statement handler-seq */
21559 static tree
21561 {
21562 tree try_block;
21576 }
21578 /* Parse a function-try-block.
21580 function-try-block:
21581 try ctor-initializer [opt] function-body handler-seq */
21583 static bool
21585 {
21586 tree compound_stmt;
21587 tree try_block;
21590 /* Look for the `try' keyword. */
21593 /* Let the rest of the front end know where we are. */
21595 /* Parse the function-body. */
21596 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21598 /* We're done with the `try' part. */
21600 /* Parse the handlers. */
21602 /* We're done with the handlers. */
21606 }
21608 /* Parse a handler-seq.
21610 handler-seq:
21611 handler handler-seq [opt] */
21613 static void
21615 {
21617 {
21620 /* Parse the handler. */
21622 /* Peek at the next token. */
21624 /* If it's not `catch' then there are no more handlers. */
21627 }
21628 }
21630 /* Parse a handler.
21632 handler:
21633 catch ( exception-declaration ) compound-statement */
21635 static void
21637 {
21638 tree handler;
21639 tree declaration;
21649 }
21651 /* Parse an exception-declaration.
21653 exception-declaration:
21654 type-specifier-seq declarator
21655 type-specifier-seq abstract-declarator
21656 type-specifier-seq
21657 ...
21659 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21660 ellipsis variant is used. */
21662 static tree
21664 {
21665 cp_decl_specifier_seq type_specifiers;
21669 /* If it's an ellipsis, it's easy to handle. */
21671 {
21672 /* Consume the `...' token. */
21675 }
21677 /* Types may not be defined in exception-declarations. */
21679 parser->type_definition_forbidden_message
21682 /* Parse the type-specifier-seq. */
21686 /* If it's a `)', then there is no declarator. */
21689 else
21696 /* Restore the saved message. */
21703 }
21705 /* Parse a throw-expression.
21707 throw-expression:
21708 throw assignment-expression [opt]
21710 Returns a THROW_EXPR representing the throw-expression. */
21712 static tree
21714 {
21715 tree expression;
21720 /* Figure out whether or not there is an assignment-expression
21721 following the "throw" keyword. */
21729 else
21733 }
21735 /* GNU Extensions */
21737 /* Parse an (optional) asm-specification.
21739 asm-specification:
21740 asm ( string-literal )
21742 If the asm-specification is present, returns a STRING_CST
21743 corresponding to the string-literal. Otherwise, returns
21744 NULL_TREE. */
21746 static tree
21748 {
21750 tree asm_specification;
21752 /* Peek at the next token. */
21754 /* If the next token isn't the `asm' keyword, then there's no
21755 asm-specification. */
21759 /* Consume the `asm' token. */
21761 /* Look for the `('. */
21764 /* Look for the string-literal. */
21767 /* Look for the `)'. */
21771 }
21773 /* Parse an asm-operand-list.
21775 asm-operand-list:
21776 asm-operand
21777 asm-operand-list , asm-operand
21779 asm-operand:
21780 string-literal ( expression )
21781 [ string-literal ] string-literal ( expression )
21783 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21784 each node is the expression. The TREE_PURPOSE is itself a
21785 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21786 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21787 is a STRING_CST for the string literal before the parenthesis. Returns
21788 ERROR_MARK_NODE if any of the operands are invalid. */
21790 static tree
21792 {
21797 {
21798 tree string_literal;
21799 tree expression;
21800 tree name;
21803 {
21804 /* Consume the `[' token. */
21806 /* Read the operand name. */
21811 /* Look for the closing `]'. */
21813 }
21814 else
21816 /* Look for the string-literal. */
21819 /* Look for the `('. */
21821 /* Parse the expression. */
21823 /* Look for the `)'. */
21831 /* Add this operand to the list. */
21833 expression,
21834 asm_operands);
21835 /* If the next token is not a `,', there are no more
21836 operands. */
21839 /* Consume the `,'. */
21841 }
21844 }
21846 /* Parse an asm-clobber-list.
21848 asm-clobber-list:
21849 string-literal
21850 asm-clobber-list , string-literal
21852 Returns a TREE_LIST, indicating the clobbers in the order that they
21853 appeared. The TREE_VALUE of each node is a STRING_CST. */
21855 static tree
21857 {
21861 {
21862 tree string_literal;
21864 /* Look for the string literal. */
21866 /* Add it to the list. */
21868 /* If the next token is not a `,', then the list is
21869 complete. */
21872 /* Consume the `,' token. */
21874 }
21877 }
21879 /* Parse an asm-label-list.
21881 asm-label-list:
21882 identifier
21883 asm-label-list , identifier
21885 Returns a TREE_LIST, indicating the labels in the order that they
21886 appeared. The TREE_VALUE of each node is a label. */
21888 static tree
21890 {
21894 {
21897 /* Look for the identifier. */
21900 {
21903 {
21909 }
21910 }
21911 /* If the next token is not a `,', then the list is
21912 complete. */
21915 /* Consume the `,' token. */
21917 }
21920 }
21922 /* Return TRUE iff the next tokens in the stream are possibly the
21923 beginning of a GNU extension attribute. */
21925 static bool
21927 {
21929 }
21931 /* Return TRUE iff the next tokens in the stream are possibly the
21932 beginning of a standard C++-11 attribute specifier. */
21934 static bool
21936 {
21938 }
21940 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21941 beginning of a standard C++-11 attribute specifier. */
21943 static bool
21945 {
21953 }
21955 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21956 beginning of a GNU extension attribute. */
21958 static bool
21960 {
21964 }
21966 /* Return true iff the next tokens can be the beginning of either a
21967 GNU attribute list, or a standard C++11 attribute sequence. */
21969 static bool
21971 {
21974 }
21976 /* Return true iff the next Nth tokens can be the beginning of either
21977 a GNU attribute list, or a standard C++11 attribute sequence. */
21979 static bool
21981 {
21984 }
21986 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21987 of GNU attributes, or return NULL. */
21989 static tree
21991 {
21995 }
21997 #define CILK_SIMD_FN_CLAUSE_MASK \
21998 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
21999 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22000 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22001 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22002 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22004 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22005 vector [(<clauses>)] */
22007 static void
22009 {
22013 {
22018 }
22021 {
22024 paren_scope++;
22025 }
22027 {
22030 paren_scope++;
22032 paren_scope--;
22033 /* Do not push the last ')' */
22036 }
22045 }
22047 /* Parse an (optional) series of attributes.
22049 attributes:
22050 attributes attribute
22052 attribute:
22053 __attribute__ (( attribute-list [opt] ))
22055 The return value is as for cp_parser_gnu_attribute_list. */
22057 static tree
22059 {
22063 {
22065 tree attribute_list;
22068 /* Peek at the next token. */
22070 /* If it's not `__attribute__', then we're done. */
22074 /* Consume the `__attribute__' keyword. */
22076 /* Look for the two `(' tokens. */
22080 /* Peek at the next token. */
22083 /* Parse the attribute-list. */
22085 else
22086 /* If the next token is a `)', then there is no attribute
22087 list. */
22090 /* Look for the two `)' tokens. */
22098 /* Add these new attributes to the list. */
22100 }
22103 }
22105 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22106 "__vector" or "__vector__." */
22110 {
22114 }
22116 /* Parse a GNU attribute-list.
22118 attribute-list:
22119 attribute
22120 attribute-list , attribute
22122 attribute:
22123 identifier
22124 identifier ( identifier )
22125 identifier ( identifier , expression-list )
22126 identifier ( expression-list )
22128 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22129 to an attribute. The TREE_PURPOSE of each node is the identifier
22130 indicating which attribute is in use. The TREE_VALUE represents
22131 the arguments, if any. */
22133 static tree
22135 {
22141 {
22143 tree identifier;
22144 tree attribute;
22146 /* Look for the identifier. We also allow keywords here; for
22147 example `__attribute__ ((const))' is legal. */
22151 {
22154 /* Consume the token, but save it since we need it for the
22155 SIMD enabled function parsing. */
22158 /* Save away the identifier that indicates which attribute
22159 this is. */
22161 /* For keywords, use the canonical spelling, not the
22162 parsed identifier. */
22168 /* Peek at the next token. */
22170 /* If it's an `(', then parse the attribute arguments. */
22172 {
22177 {
22180 }
22181 else
22182 vec = cp_parser_parenthesized_expression_list
22188 else
22189 {
22192 }
22193 /* Save the arguments away. */
22195 }
22197 {
22200 }
22203 {
22204 /* Add this attribute to the list. */
22207 }
22210 }
22211 /* Now, look for more attributes. If the next token isn't a
22212 `,', we're done. */
22216 /* Consume the comma and keep going. */
22218 }
22221 /* We built up the list in reverse order. */
22223 }
22225 /* Parse a standard C++11 attribute.
22227 The returned representation is a TREE_LIST which TREE_PURPOSE is
22228 the scoped name of the attribute, and the TREE_VALUE is its
22229 arguments list.
22231 Note that the scoped name of the attribute is itself a TREE_LIST
22232 which TREE_PURPOSE is the namespace of the attribute, and
22233 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22234 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22235 and which TREE_PURPOSE is directly the attribute name.
22237 Clients of the attribute code should use get_attribute_namespace
22238 and get_attribute_name to get the actual namespace and name of
22239 attributes, regardless of their being GNU or C++11 attributes.
22241 attribute:
22242 attribute-token attribute-argument-clause [opt]
22244 attribute-token:
22245 identifier
22246 attribute-scoped-token
22248 attribute-scoped-token:
22249 attribute-namespace :: identifier
22251 attribute-namespace:
22252 identifier
22254 attribute-argument-clause:
22255 ( balanced-token-seq )
22257 balanced-token-seq:
22258 balanced-token [opt]
22259 balanced-token-seq balanced-token
22261 balanced-token:
22262 ( balanced-token-seq )
22263 [ balanced-token-seq ]
22264 { balanced-token-seq }. */
22266 static tree
22268 {
22272 /* First, parse name of the the attribute, a.k.a
22273 attribute-token. */
22290 {
22291 /* We are seeing a scoped attribute token. */
22301 else
22302 {
22306 }
22308 NULL_TREE);
22310 }
22311 else
22312 {
22314 NULL_TREE);
22315 /* C++11 noreturn attribute is equivalent to GNU's. */
22318 /* C++14 deprecated attribute is equivalent to GNU's. */
22320 {
22323 "%<deprecated%> is a C++14 feature;"
22326 }
22327 }
22329 /* Now parse the optional argument clause of the attribute. */
22334 {
22340 /* A GNU attribute that takes an identifier in parameter. */
22343 vec = cp_parser_parenthesized_expression_list
22349 else
22350 {
22353 }
22357 else
22359 }
22362 }
22364 /* Parse a list of standard C++-11 attributes.
22366 attribute-list:
22367 attribute [opt]
22368 attribute-list , attribute[opt]
22369 attribute ...
22370 attribute-list , attribute ...
22371 */
22373 static tree
22375 {
22380 {
22385 {
22388 }
22393 }
22396 }
22398 /* Parse a standard C++-11 attribute specifier.
22400 attribute-specifier:
22401 [ [ attribute-list ] ]
22402 alignment-specifier
22404 alignment-specifier:
22405 alignas ( type-id ... [opt] )
22406 alignas ( alignment-expression ... [opt] ). */
22408 static tree
22410 {
22416 {
22425 else
22426 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22427 when we are sure that we have actually parsed them. */
22429 }
22430 else
22431 {
22432 tree alignas_expr;
22434 /* Look for an alignment-specifier. */
22446 {
22449 }
22455 {
22459 alignas_expr =
22466 }
22469 {
22472 }
22476 /* Build the C++-11 representation of an 'aligned'
22477 attribute. */
22478 attributes =
22482 }
22485 }
22487 /* Parse a standard C++-11 attribute-specifier-seq.
22489 attribute-specifier-seq:
22490 attribute-specifier-seq [opt] attribute-specifier
22491 */
22493 static tree
22495 {
22499 {
22508 }
22512 }
22514 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22515 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22516 current value of the PEDANTIC flag, regardless of whether or not
22517 the `__extension__' keyword is present. The caller is responsible
22518 for restoring the value of the PEDANTIC flag. */
22520 static bool
22522 {
22523 /* Save the old value of the PEDANTIC flag. */
22527 {
22528 /* Consume the `__extension__' token. */
22530 /* We're not being pedantic while the `__extension__' keyword is
22531 in effect. */
22535 }
22538 }
22540 /* Parse a label declaration.
22542 label-declaration:
22543 __label__ label-declarator-seq ;
22545 label-declarator-seq:
22546 identifier , label-declarator-seq
22547 identifier */
22549 static void
22551 {
22552 /* Look for the `__label__' keyword. */
22556 {
22557 tree identifier;
22559 /* Look for an identifier. */
22561 /* If we failed, stop. */
22564 /* Declare it as a label. */
22566 /* If the next token is a `;', stop. */
22569 /* Look for the `,' separating the label declarations. */
22571 }
22573 /* Look for the final `;'. */
22575 }
22577 /* Support Functions */
22579 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22580 NAME should have one of the representations used for an
22581 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22582 is returned. If PARSER->SCOPE is a dependent type, then a
22583 SCOPE_REF is returned.
22585 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22586 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22587 was formed. Abstractly, such entities should not be passed to this
22588 function, because they do not need to be looked up, but it is
22589 simpler to check for this special case here, rather than at the
22590 call-sites.
22592 In cases not explicitly covered above, this function returns a
22593 DECL, OVERLOAD, or baselink representing the result of the lookup.
22594 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22595 is returned.
22597 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22598 (e.g., "struct") that was used. In that case bindings that do not
22599 refer to types are ignored.
22601 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22602 ignored.
22604 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22605 are ignored.
22607 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22608 types.
22610 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22611 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22612 NULL_TREE otherwise. */
22614 static tree
22621 location_t name_location)
22622 {
22623 tree decl;
22626 /* Assume that the lookup will be unambiguous. */
22630 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22631 no longer valid. Note that if we are parsing tentatively, and
22632 the parse fails, OBJECT_TYPE will be automatically restored. */
22638 /* A template-id has already been resolved; there is no lookup to
22639 do. */
22643 {
22647 }
22649 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22650 it should already have been checked to make sure that the name
22651 used matches the type being destroyed. */
22653 {
22654 tree type;
22656 /* Figure out to which type this destructor applies. */
22661 else
22663 /* If that's not a class type, there is no destructor. */
22670 /* If it was a class type, return the destructor. */
22672 }
22674 /* By this point, the NAME should be an ordinary identifier. If
22675 the id-expression was a qualified name, the qualifying scope is
22676 stored in PARSER->SCOPE at this point. */
22679 /* Perform the lookup. */
22681 {
22687 /* If the SCOPE is dependent, the lookup must be deferred until
22688 the template is instantiated -- unless we are explicitly
22689 looking up names in uninstantiated templates. Even then, we
22690 cannot look up the name if the scope is not a class type; it
22691 might, for example, be a template type parameter. */
22696 /* Defer lookup. */
22698 else
22699 {
22702 /* If PARSER->SCOPE is a dependent type, then it must be a
22703 class type, and we must not be checking dependencies;
22704 otherwise, we would have processed this lookup above. So
22705 that PARSER->SCOPE is not considered a dependent base by
22706 lookup_member, we must enter the scope here. */
22710 /* If the PARSER->SCOPE is a template specialization, it
22711 may be instantiated during name lookup. In that case,
22712 errors may be issued. Even if we rollback the current
22713 tentative parse, those errors are valid. */
22718 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22719 lookup result and the nested-name-specifier nominates a class C:
22720 * if the name specified after the nested-name-specifier, when
22721 looked up in C, is the injected-class-name of C (Clause 9), or
22722 * if the name specified after the nested-name-specifier is the
22723 same as the identifier or the simple-template-id's template-
22724 name in the last component of the nested-name-specifier,
22725 the name is instead considered to name the constructor of
22726 class C. [ Note: for example, the constructor is not an
22727 acceptable lookup result in an elaborated-type-specifier so
22728 the constructor would not be used in place of the
22729 injected-class-name. --end note ] Such a constructor name
22730 shall be used only in the declarator-id of a declaration that
22731 names a constructor or in a using-declaration. */
22739 /* If we have a single function from a using decl, pull it out. */
22746 }
22748 /* If the scope is a dependent type and either we deferred lookup or
22749 we did lookup but didn't find the name, rememeber the name. */
22752 {
22754 {
22755 tree type;
22757 /* The resolution to Core Issue 180 says that `struct
22758 A::B' should be considered a type-name, even if `A'
22759 is dependent. */
22764 }
22768 CPP_CLOSE_PAREN)))
22772 else
22775 is_template);
22776 }
22779 }
22781 {
22782 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22783 OBJECT_TYPE is not a class. */
22785 /* If the OBJECT_TYPE is a template specialization, it may
22786 be instantiated during name lookup. In that case, errors
22787 may be issued. Even if we rollback the current tentative
22788 parse, those errors are valid. */
22790 name,
22793 tf_warning_or_error);
22794 else
22798 /* Look it up in the enclosing context. */
22804 }
22805 else
22806 {
22812 }
22814 /* If the lookup failed, let our caller know. */
22818 /* Pull out the template from an injected-class-name (or multiple). */
22822 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22824 {
22827 /* The error message we have to print is too complicated for
22828 cp_parser_error, so we incorporate its actions directly. */
22830 {
22832 name);
22834 }
22836 }
22844 /* If we have resolved the name of a member declaration, check to
22845 see if the declaration is accessible. When the name resolves to
22846 set of overloaded functions, accessibility is checked when
22847 overload resolution is done.
22849 During an explicit instantiation, access is not checked at all,
22850 as per [temp.explicit]. */
22857 }
22859 /* Like cp_parser_lookup_name, but for use in the typical case where
22860 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22861 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22863 static tree
22865 {
22867 none_type,
22872 location);
22873 }
22875 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22876 the current context, return the TYPE_DECL. If TAG_NAME_P is
22877 true, the DECL indicates the class being defined in a class-head,
22878 or declared in an elaborated-type-specifier.
22880 Otherwise, return DECL. */
22882 static tree
22884 {
22885 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22886 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22888 struct A {
22889 template <typename T> struct B;
22890 };
22892 template <typename T> struct A::B {};
22894 Similarly, in an elaborated-type-specifier:
22896 namespace N { struct X{}; }
22898 struct A {
22899 template <typename T> friend struct N::X;
22900 };
22902 However, if the DECL refers to a class type, and we are in
22903 the scope of the class, then the name lookup automatically
22904 finds the TYPE_DECL created by build_self_reference rather
22905 than a TEMPLATE_DECL. For example, in:
22907 template <class T> struct S {
22908 S s;
22909 };
22911 there is no need to handle such case. */
22917 }
22919 /* If too many, or too few, template-parameter lists apply to the
22920 declarator, issue an error message. Returns TRUE if all went well,
22921 and FALSE otherwise. */
22923 static bool
22926 location_t declarator_location)
22927 {
22929 {
22931 {
22939 /* If the DECLARATOR has the form `X<y>' then it uses one
22940 additional level of template parameters. */
22943 return cp_parser_check_template_parameters
22945 }
22960 }
22962 }
22964 /* NUM_TEMPLATES were used in the current declaration. If that is
22965 invalid, return FALSE and issue an error messages. Otherwise,
22966 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22967 declarator and we can print more accurate diagnostics. */
22969 static bool
22972 location_t location,
22974 {
22975 /* If there are the same number of template classes and parameter
22976 lists, that's OK. */
22979 /* If there are more, but only one more, then we are referring to a
22980 member template. That's OK too. */
22983 /* If there are more template classes than parameter lists, we have
22984 something like:
22986 template <class T> void S<T>::R<T>::f (); */
22988 {
22998 else
23001 }
23002 /* Otherwise, there are too many template parameter lists. We have
23003 something like:
23005 template <class T> template <class U> void S::f(); */
23008 }
23010 /* Parse an optional `::' token indicating that the following name is
23011 from the global namespace. If so, PARSER->SCOPE is set to the
23012 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23013 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23014 Returns the new value of PARSER->SCOPE, if the `::' token is
23015 present, and NULL_TREE otherwise. */
23017 static tree
23019 {
23022 /* Peek at the next token. */
23024 /* If we're looking at a `::' token then we're starting from the
23025 global namespace, not our current location. */
23027 {
23028 /* Consume the `::' token. */
23030 /* Set the SCOPE so that we know where to start the lookup. */
23036 }
23038 {
23042 }
23045 }
23047 /* Returns TRUE if the upcoming token sequence is the start of a
23048 constructor declarator. If FRIEND_P is true, the declarator is
23049 preceded by the `friend' specifier. */
23051 static bool
23053 {
23056 tree nested_name_specifier;
23059 /* The common case is that this is not a constructor declarator, so
23060 try to avoid doing lots of work if at all possible. It's not
23061 valid declare a constructor at function scope. */
23064 /* And only certain tokens can begin a constructor declarator. */
23072 /* Parse tentatively; we are going to roll back all of the tokens
23073 consumed here. */
23075 /* Assume that we are looking at a constructor declarator. */
23078 /* Look for the optional `::' operator. */
23081 /* Look for the nested-name-specifier. */
23082 nested_name_specifier
23093 /* Outside of a class-specifier, there must be a
23094 nested-name-specifier. */
23100 /* If we have a class scope, this is easy; DR 147 says that S::S always
23101 names the constructor, and no other qualified name could. */
23104 {
23114 }
23115 /* If we still think that this might be a constructor-declarator,
23116 look for a class-name. */
23118 {
23119 /* If we have:
23121 template <typename T> struct S {
23122 S();
23123 };
23125 we must recognize that the nested `S' names a class. */
23126 tree type_decl;
23130 none_type,
23134 /* If there was no class-name, then this is not a constructor.
23135 Otherwise, if we are in a class-specifier and we aren't
23136 handling a friend declaration, check that its type matches
23137 current_class_type (c++/38313). Note: error_mark_node
23138 is left alone for error recovery purposes. */
23140 && (outside_class_specifier_p
23145 /* If we're still considering a constructor, we have to see a `(',
23146 to begin the parameter-declaration-clause, followed by either a
23147 `)', an `...', or a decl-specifier. We need to check for a
23148 type-specifier to avoid being fooled into thinking that:
23150 S (f) (int);
23152 is a constructor. (It is actually a function named `f' that
23153 takes one parameter (of type `int') and returns a value of type
23154 `S'. */
23162 /* A parameter declaration begins with a decl-specifier,
23163 which is either the "attribute" keyword, a storage class
23164 specifier, or (usually) a type-specifier. */
23166 {
23167 tree type;
23171 /* Names appearing in the type-specifier should be looked up
23172 in the scope of the class. */
23175 else
23176 {
23179 {
23183 {
23186 }
23187 }
23189 }
23191 /* Inside the constructor parameter list, surrounding
23192 template-parameter-lists do not apply. */
23193 saved_num_template_parameter_lists
23197 /* Look for the type-specifier. */
23199 CP_PARSER_FLAGS_NONE,
23205 parser->num_template_parameter_lists
23208 /* Leave the scope of the class. */
23213 }
23214 }
23216 /* We did not really want to consume any tokens. */
23220 }
23222 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23223 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23224 they must be performed once we are in the scope of the function.
23226 Returns the function defined. */
23228 static tree
23229 cp_parser_function_definition_from_specifiers_and_declarator
23232 tree attributes,
23234 {
23235 tree fn;
23238 /* Begin the function-definition. */
23241 /* The things we're about to see are not directly qualified by any
23242 template headers we've seen thus far. */
23245 /* If there were names looked up in the decl-specifier-seq that we
23246 did not check, check them now. We must wait until we are in the
23247 scope of the function to perform the checks, since the function
23248 might be a friend. */
23252 {
23255 }
23258 {
23259 /* Skip the entire function. */
23262 }
23264 {
23265 /* Seen already, skip it. An error message has already been output. */
23269 /* If this is a function from a class, pop the nested class. */
23272 }
23273 else
23274 {
23275 timevar_id_t tv;
23278 else
23284 }
23287 }
23289 /* Parse the part of a function-definition that follows the
23290 declarator. INLINE_P is TRUE iff this function is an inline
23291 function defined within a class-specifier.
23293 Returns the function defined. */
23295 static tree
23298 {
23299 tree fn;
23305 bool fully_implicit_function_template_p
23308 tree implicit_template_parms
23311 cp_binding_level* implicit_template_scope
23317 /* If the next token is `return', then the code may be trying to
23318 make use of the "named return value" extension that G++ used to
23319 support. */
23322 {
23323 /* Consume the `return' keyword. */
23325 /* Look for the identifier that indicates what value is to be
23326 returned. */
23328 /* Issue an error message. */
23331 /* Skip tokens until we reach the start of the function body. */
23333 {
23340 }
23341 }
23342 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23343 anything declared inside `f'. */
23344 saved_in_unbraced_linkage_specification_p
23347 /* Inside the function, surrounding template-parameter-lists do not
23348 apply. */
23349 saved_num_template_parameter_lists
23355 /* If the next token is `try', `__transaction_atomic', or
23356 `__transaction_relaxed`, then we are looking at either function-try-block
23357 or function-transaction-block. Note that all of these include the
23358 function-body. */
23361 RID_TRANSACTION_ATOMIC);
23363 RID_TRANSACTION_RELAXED))
23365 RID_TRANSACTION_RELAXED);
23368 else
23369 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23374 /* Finish the function. */
23377 /* Generate code for it, if necessary. */
23379 /* Restore the saved values. */
23380 parser->in_unbraced_linkage_specification_p
23382 parser->num_template_parameter_lists
23386 parser->fully_implicit_function_template_p
23388 parser->implicit_template_parms
23390 parser->implicit_template_scope
23397 }
23399 /* Parse a template-declaration, assuming that the `export' (and
23400 `extern') keywords, if present, has already been scanned. MEMBER_P
23401 is as for cp_parser_template_declaration. */
23403 static void
23405 {
23408 tree parameter_list;
23413 /* Look for the `template' keyword. */
23418 /* And the `<'. */
23422 {
23423 /* 14.5.2.2 [temp.mem]
23425 A local class shall not have member templates. */
23430 }
23431 /* [temp]
23433 A template ... shall not have C linkage. */
23435 {
23437 /* Give it C++ linkage to avoid confusing other parts of the
23438 front end. */
23441 }
23442 else
23445 /* We cannot perform access checks on the template parameter
23446 declarations until we know what is being declared, just as we
23447 cannot check the decl-specifier list. */
23450 /* If the next token is `>', then we have an invalid
23451 specialization. Rather than complain about an invalid template
23452 parameter, issue an error message here. */
23454 {
23458 }
23459 else
23460 {
23461 /* Parse the template parameters. */
23463 }
23465 /* Get the deferred access checks from the parameter list. These
23466 will be checked once we know what is being declared, as for a
23467 member template the checks must be performed in the scope of the
23468 class containing the member. */
23471 /* Look for the `>'. */
23473 /* We just processed one more parameter list. */
23475 /* If the next token is `template', there are more template
23476 parameters. */
23478 RID_TEMPLATE))
23483 else
23484 {
23485 /* There are no access checks when parsing a template, as we do not
23486 know if a specialization will be a friend. */
23490 checks,
23491 member_p,
23496 /* If this is a member template declaration, let the front
23497 end know. */
23499 {
23504 }
23509 }
23510 /* We are done with the current parameter list. */
23515 /* Finish up. */
23518 /* Check the template arguments for a literal operator template. */
23522 {
23526 else
23527 {
23530 {
23536 }
23538 {
23546 }
23547 else
23549 }
23551 {
23554 " Expected non-type template argument pack <char...>"
23556 decl);
23557 else
23560 decl);
23561 }
23562 }
23563 /* Register member declarations. */
23566 /* For the erroneous case of a template with C linkage, we pushed an
23567 implicit C++ linkage scope; exit that scope now. */
23570 /* If DECL is a function template, we must return to parse it later.
23571 (Even though there is no definition, there might be default
23572 arguments that need handling.) */
23576 }
23578 /* Perform the deferred access checks from a template-parameter-list.
23579 CHECKS is a TREE_LIST of access checks, as returned by
23580 get_deferred_access_checks. */
23582 static void
23583 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23584 {
23588 }
23590 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23591 `function-definition' sequence that follows a template header.
23592 If MEMBER_P is true, this declaration appears in a class scope.
23594 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23595 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23597 static tree
23603 {
23606 cp_decl_specifier_seq decl_specifiers;
23610 /* This function is only used when processing a template
23611 declaration. */
23615 /* Defer access checks until we know what is being declared. */
23618 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23619 alternative. */
23622 CP_PARSER_FLAGS_OPTIONAL,
23628 /* There are no template typedefs. */
23630 {
23634 }
23636 /* Gather up the access checks that occurred the
23637 decl-specifier-seq. */
23640 /* Check for the declaration of a template class. */
23642 {
23644 {
23647 /* In this case:
23649 struct C {
23650 friend template <typename T> struct A<T>::B;
23651 };
23653 A<T>::B will be represented by a TYPENAME_TYPE, and
23654 therefore not recognized by shadow_tag. */
23656 && !decl
23663 else
23666 /* Perform access checks for template parameters. */
23668 }
23669 }
23671 /* Complain about missing 'typename' or other invalid type names. */
23674 {
23675 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23676 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23677 the rest of this declaration. */
23680 }
23682 /* If it's not a template class, try for a template function. If
23683 the next token is a `;', then this declaration does not declare
23684 anything. But, if there were errors in the decl-specifiers, then
23685 the error might well have come from an attempted class-specifier.
23686 In that case, there's no need to warn about a missing declarator. */
23690 {
23693 checks,
23695 member_p,
23696 declares_class_or_enum,
23698 NULL);
23700 /* 7.1.1-1 [dcl.stc]
23702 A storage-class-specifier shall not be specified in an explicit
23703 specialization... */
23705 && explicit_specialization_p
23707 {
23711 }
23715 }
23717 /* Look for a trailing `;' after the declaration. */
23723 out:
23726 /* Clear any current qualification; whatever comes next is the start
23727 of something new. */
23733 }
23735 /* Parse a cast-expression that is not the operand of a unary "&". */
23737 static tree
23739 {
23742 }
23744 /* Parse a functional cast to TYPE. Returns an expression
23745 representing the cast. */
23747 static tree
23749 {
23751 tree expression_list;
23752 tree cast;
23759 {
23767 tf_warning_or_error);
23768 }
23777 else
23778 {
23781 }
23784 tf_warning_or_error);
23785 /* [expr.const]/1: In an integral constant expression "only type
23786 conversions to integral or enumeration type can be used". */
23792 NIC_CONSTRUCTOR))
23795 }
23797 /* Save the tokens that make up the body of a member function defined
23798 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23799 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23800 specifiers applied to the declaration. Returns the FUNCTION_DECL
23801 for the member function. */
23803 static tree
23807 tree attributes)
23808 {
23811 tree fn;
23813 /* Create the FUNCTION_DECL. */
23816 /* If something went badly wrong, bail out now. */
23818 {
23819 /* If there's a function-body, skip it. */
23824 }
23826 /* Remember it, if there default args to post process. */
23829 /* Save away the tokens that make up the body of the
23830 function. */
23832 /* Handle function try blocks. */
23835 /* We can have braced-init-list mem-initializers before the fn body. */
23837 {
23840 {
23841 /* cache_group will stop after an un-nested { } pair, too. */
23845 /* variadic mem-inits have ... after the ')'. */
23848 }
23849 }
23851 /* Handle function try blocks. */
23856 /* Save away the inline definition; we will process it when the
23857 class is complete. */
23861 /* We need to know that this was defined in the class, so that
23862 friend templates are handled correctly. */
23865 /* Add FN to the queue of functions to be parsed later. */
23869 }
23871 /* Save the tokens that make up the in-class initializer for a non-static
23872 data member. Returns a DEFAULT_ARG. */
23874 static tree
23876 {
23878 }
23880 /* Parse a template-argument-list, as well as the trailing ">" (but
23881 not the opening "<"). See cp_parser_template_argument_list for the
23882 return value. */
23884 static tree
23886 {
23887 tree arguments;
23888 tree saved_scope;
23889 tree saved_qualifying_scope;
23890 tree saved_object_scope;
23895 /* [temp.names]
23897 When parsing a template-id, the first non-nested `>' is taken as
23898 the end of the template-argument-list rather than a greater-than
23899 operator. */
23900 saved_greater_than_is_operator_p
23903 /* Parsing the argument list may modify SCOPE, so we save it
23904 here. */
23908 /* We need to evaluate the template arguments, even though this
23909 template-id may be nested within a "sizeof". */
23914 /* Parse the template-argument-list itself. */
23918 else
23920 /* Look for the `>' that ends the template-argument-list. If we find
23921 a '>>' instead, it's probably just a typo. */
23923 {
23925 {
23926 /* In C++0x, a `>>' in a template argument list or cast
23927 expression is considered to be two separate `>'
23928 tokens. So, change the current token to a `>', but don't
23929 consume it: it will be consumed later when the outer
23930 template argument list (or cast expression) is parsed.
23931 Note that this replacement of `>' for `>>' is necessary
23932 even if we are parsing tentatively: in the tentative
23933 case, after calling
23934 cp_parser_enclosed_template_argument_list we will always
23935 throw away all of the template arguments and the first
23936 closing `>', either because the template argument list
23937 was erroneous or because we are replacing those tokens
23938 with a CPP_TEMPLATE_ID token. The second `>' (which will
23939 not have been thrown away) is needed either to close an
23940 outer template argument list or to complete a new-style
23941 cast. */
23944 }
23946 {
23947 /* If we're in a nested template argument list, the '>>' has
23948 to be a typo for '> >'. We emit the error message, but we
23949 continue parsing and we push a '>' as next token, so that
23950 the argument list will be parsed correctly. Note that the
23951 global source location is still on the token before the
23952 '>>', so we need to say explicitly where we want it. */
23958 }
23959 else
23960 {
23961 /* If this is not a nested template argument list, the '>>'
23962 is a typo for '>'. Emit an error message and continue.
23963 Same deal about the token location, but here we can get it
23964 right by consuming the '>>' before issuing the diagnostic. */
23967 "spurious %<>>%>, use %<>%> to terminate "
23969 }
23970 }
23971 else
23973 /* The `>' token might be a greater-than operator again now. */
23974 parser->greater_than_is_operator_p
23976 /* Restore the SAVED_SCOPE. */
23984 }
23986 /* MEMBER_FUNCTION is a member function, or a friend. If default
23987 arguments, or the body of the function have not yet been parsed,
23988 parse them now. */
23990 static void
23992 {
23994 /* If this member is a template, get the underlying
23995 FUNCTION_DECL. */
23999 /* There should not be any class definitions in progress at this
24000 point; the bodies of members are only parsed outside of all class
24001 definitions. */
24003 /* While we're parsing the member functions we might encounter more
24004 classes. We want to handle them right away, but we don't want
24005 them getting mixed up with functions that are currently in the
24006 queue. */
24009 /* Make sure that any template parameters are in scope. */
24012 /* If the body of the function has not yet been parsed, parse it
24013 now. */
24015 {
24016 tree function_scope;
24019 /* The function is no longer pending; we are processing it. */
24024 /* If this is a local class, enter the scope of the containing
24025 function. */
24030 /* Push the body of the function onto the lexer stack. */
24033 /* Let the front end know that we going to be defining this
24034 function. */
24038 /* Don't do access checking if it is a templated function. */
24042 /* #pragma omp declare reduction needs special parsing. */
24044 {
24049 }
24050 else
24051 /* Now, parse the body of the function. */
24058 /* Leave the scope of the containing function. */
24062 }
24064 /* Remove any template parameters from the symbol table. */
24067 /* Restore the queue. */
24070 }
24072 /* If DECL contains any default args, remember it on the unparsed
24073 functions queue. */
24075 static void
24077 {
24078 tree probe;
24081 probe;
24084 {
24088 }
24089 }
24091 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24092 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24093 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24094 from the parameter-type-list. */
24096 static tree
24099 {
24101 tree parsed_arg;
24107 /* Push the saved tokens for the default argument onto the parser's
24108 lexer stack. */
24114 /* Parse the default argument. */
24125 {
24126 /* In a non-template class, check conversions now. In a template,
24127 we'll wait and instantiate these as needed. */
24130 tf_warning_or_error);
24131 else
24133 }
24135 /* If the token stream has not been completely used up, then
24136 there was extra junk after the end of the default
24137 argument. */
24139 {
24142 else
24144 }
24146 /* Revert to the main lexer. */
24150 }
24152 /* FIELD is a non-static data member with an initializer which we saved for
24153 later; parse it now. */
24155 static void
24157 {
24158 tree def;
24165 NULL_TREE);
24171 }
24173 /* FN is a FUNCTION_DECL which may contains a parameter with an
24174 unparsed DEFAULT_ARG. Parse the default args now. This function
24175 assumes that the current scope is the scope in which the default
24176 argument should be processed. */
24178 static void
24180 {
24184 /* While we're parsing the default args, we might (due to the
24185 statement expression extension) encounter more classes. We want
24186 to handle them right away, but we don't want them getting mixed
24187 up with default args that are currently in the queue. */
24190 /* Local variable names (and the `this' keyword) may not appear
24191 in a default argument. */
24202 {
24204 tree parsed_arg;
24206 tree copy;
24213 /* This can happen for a friend declaration for a function
24214 already declared with default arguments. */
24217 parsed_arg
24219 default_arg,
24222 {
24224 }
24228 /* Update any instantiations we've already created. */
24232 }
24236 /* Make sure no default arg is missing. */
24239 /* Restore the state of local_variables_forbidden_p. */
24242 /* Restore the queue. */
24244 }
24246 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24248 sizeof ... ( identifier )
24250 where the 'sizeof' token has already been consumed. */
24252 static tree
24254 {
24255 /* Consume the `...'. */
24262 else
24270 /* The name is not qualified. */
24288 }
24290 /* Parse the operand of `sizeof' (or a similar operator). Returns
24291 either a TYPE or an expression, depending on the form of the
24292 input. The KEYWORD indicates which kind of expression we have
24293 encountered. */
24295 static tree
24297 {
24304 /* If it's a `...', then we are computing the length of a parameter
24305 pack. */
24310 /* Types cannot be defined in a `sizeof' expression. Save away the
24311 old message. */
24313 /* And create the new one. */
24319 /* The restrictions on constant-expressions do not apply inside
24320 sizeof expressions. */
24321 saved_integral_constant_expression_p
24323 saved_non_integral_constant_expression_p
24327 /* Do not actually evaluate the expression. */
24330 /* If it's a `(', then we might be looking at the type-id
24331 construction. */
24333 {
24336 /* We can't be sure yet whether we're looking at a type-id or an
24337 expression. */
24339 /* Note: as a GNU Extension, compound literals are considered
24340 postfix-expressions as they are in C99, so they are valid
24341 arguments to sizeof. See comment in cp_parser_cast_expression
24342 for details. */
24345 else
24346 {
24349 /* Look for the type-id. */
24351 /* Look for the closing `)'. */
24354 }
24356 /* If all went well, then we're done. */
24358 {
24359 cp_decl_specifier_seq decl_specs;
24361 /* Build a trivial decl-specifier-seq. */
24365 /* Call grokdeclarator to figure out what type this is. */
24368 TYPENAME,
24371 }
24372 }
24374 /* If the type-id production did not work out, then we must be
24375 looking at the unary-expression production. */
24379 /* Go back to evaluating expressions. */
24383 /* Free the message we created. */
24385 /* And restore the old one. */
24387 parser->integral_constant_expression_p
24389 parser->non_integral_constant_expression_p
24393 }
24395 /* If the current declaration has no declarator, return true. */
24397 static bool
24399 {
24400 /* If the next token is a `;' or a `,' then there is no
24401 declarator. */
24404 }
24406 /* Update the DECL_SPECS to reflect the storage class indicated by
24407 KEYWORD. */
24409 static void
24414 {
24415 cp_storage_class storage_class;
24418 {
24422 }
24424 {
24427 }
24432 {
24435 }
24438 {
24456 }
24460 /* A storage class specifier cannot be applied alongside a typedef
24461 specifier. If there is a typedef specifier present then set
24462 conflicting_specifiers_p which will trigger an error later
24463 on in grokdeclarator. */
24466 }
24468 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24469 is true, the type is a class or enum definition. */
24471 static void
24473 tree type_spec,
24476 {
24479 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24480 (with, for example, in "typedef int wchar_t;") we remember that
24481 this is what happened. In system headers, we ignore these
24482 declarations so that G++ can work with system headers that are not
24483 C++-safe. */
24485 && !type_definition_p
24495 {
24498 ds_redefined_builtin_type_spec,
24499 token);
24501 {
24505 }
24506 }
24509 else
24510 {
24515 }
24516 }
24518 /* True iff TOKEN is the GNU keyword __thread. */
24520 static bool
24522 {
24525 }
24527 /* Set the location for a declarator specifier and check if it is
24528 duplicated.
24530 DECL_SPECS is the sequence of declarator specifiers onto which to
24531 set the location.
24533 DS is the single declarator specifier to set which location is to
24534 be set onto the existing sequence of declarators.
24536 LOCATION is the location for the declarator specifier to
24537 consider. */
24539 static void
24542 {
24551 {
24555 }
24556 else
24557 {
24559 {
24563 else
24564 {
24567 OPT_Wlong_long,
24569 }
24570 }
24572 {
24577 else
24579 }
24580 else
24581 {
24597 "__complex"
24598 };
24601 }
24602 }
24603 }
24605 /* Return true iff the declarator specifier DS is present in the
24606 sequence of declarator specifiers DECL_SPECS. */
24608 bool
24610 cp_decl_spec ds)
24611 {
24618 }
24620 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24621 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24623 static bool
24625 {
24627 }
24629 /* Issue an error message indicating that TOKEN_DESC was expected.
24630 If KEYWORD is true, it indicated this function is called by
24631 cp_parser_require_keword and the required token can only be
24632 a indicated keyword. */
24634 static void
24636 required_token token_desc,
24638 {
24640 {
24709 }
24711 {
24713 {
24792 }
24793 }
24794 else
24796 }
24800 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24801 issue an error message indicating that TOKEN_DESC was expected.
24803 Returns the token consumed, if the token had the appropriate type.
24804 Otherwise, returns NULL. */
24809 required_token token_desc)
24810 {
24813 else
24814 {
24815 /* Output the MESSAGE -- unless we're parsing tentatively. */
24819 }
24820 }
24822 /* An error message is produced if the next token is not '>'.
24823 All further tokens are skipped until the desired token is
24824 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24826 static void
24828 {
24829 /* Current level of '< ... >'. */
24831 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24834 /* Are we ready, yet? If not, issue error message. */
24838 /* Skip tokens until the desired token is found. */
24840 {
24841 /* Peek at the next token. */
24843 {
24851 /* C++0x views the `>>' operator as two `>' tokens, but
24852 C++98 does not. */
24855 {
24856 /* We've hit a `>>' where the first `>' closes the
24857 template argument list, and the second `>' is
24858 spurious. Just consume the `>>' and stop; we've
24859 already produced at least one error. */
24862 }
24863 /* Fall through for C++0x, so we handle the second `>' in
24864 the `>>'. */
24868 {
24869 /* We've reached the token we want, consume it and stop. */
24872 }
24891 /* The '>' was probably forgotten, don't look further. */
24896 }
24898 /* Consume this token. */
24900 }
24901 }
24903 /* If the next token is the indicated keyword, consume it. Otherwise,
24904 issue an error message indicating that TOKEN_DESC was expected.
24906 Returns the token consumed, if the token had the appropriate type.
24907 Otherwise, returns NULL. */
24912 required_token token_desc)
24913 {
24917 {
24920 }
24923 }
24925 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24926 function-definition. */
24928 static bool
24930 {
24933 /* A ctor-initializer begins with a `:'. */
24935 /* A function-try-block begins with `try'. */
24937 /* A function-transaction-block begins with `__transaction_atomic'
24938 or `__transaction_relaxed'. */
24941 /* The named return value extension begins with `return'. */
24943 }
24945 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24946 definition. */
24948 static bool
24950 {
24957 }
24959 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24960 C++0x) ending a template-argument. */
24962 static bool
24964 {
24972 }
24974 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24975 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24977 static bool
24980 {
24986 /* Check for the sequence `<::' in the original code. It would be lexed as
24987 `[:', where `[' is a digraph, and there is no whitespace before
24988 `:'. */
24990 {
24995 }
24997 }
24999 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25000 or none_type otherwise. */
25002 static enum tag_types
25004 {
25006 {
25016 }
25017 }
25019 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25020 or none_type otherwise or if the token is null. */
25022 static enum tag_types
25024 {
25029 {
25037 }
25038 }
25040 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25042 static void
25044 {
25048 {
25052 type))
25055 }
25056 }
25058 /* Issue an error message if DECL is redeclared with different
25059 access than its original declaration [class.access.spec/3].
25060 This applies to nested classes and nested class templates.
25061 [class.mem/1]. */
25063 static void
25065 {
25074 }
25076 /* Look for the `template' keyword, as a syntactic disambiguator.
25077 Return TRUE iff it is present, in which case it will be
25078 consumed. */
25080 static bool
25082 {
25084 {
25085 /* In C++98 the `template' keyword can only be used within templates;
25086 outside templates the parser can always figure out what is a
25087 template and what is not. In C++11, per the resolution of DR 468,
25088 `template' is allowed in cases where it is not strictly necessary. */
25091 {
25094 "in C++98 %<template%> (as a disambiguator) is only "
25096 /* If this part of the token stream is rescanned, the same
25097 error message would be generated. So, we purge the token
25098 from the stream. */
25101 }
25102 else
25103 {
25104 /* Consume the `template' keyword. */
25107 }
25108 }
25110 }
25112 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25113 set PARSER->SCOPE, and perform other related actions. */
25115 static void
25117 {
25123 /* Get the stored value. */
25125 /* Perform any access checks that were deferred. */
25128 {
25133 }
25134 /* Set the scope from the stored value. */
25138 }
25140 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25141 encounter the end of a block before what we were looking for. */
25143 static bool
25147 {
25149 {
25152 /* Abort a parenthesized expression if we encounter a semicolon. */
25156 /* If we've reached the end of the file, stop. */
25162 /* We've hit the end of an enclosing block, so there's been some
25163 kind of syntax error. */
25166 /* Consume the token. */
25168 /* See if it starts a new group. */
25170 {
25172 /* In theory this should probably check end == '}', but
25173 cp_parser_save_member_function_body needs it to exit
25174 after either '}' or ')' when called with ')'. */
25177 }
25179 {
25183 }
25188 }
25189 }
25191 /* Like above, for caching a default argument or NSDMI. Both of these are
25192 terminated by a non-nested comma, but it can be unclear whether or not a
25193 comma is nested in a template argument list unless we do more parsing.
25194 In order to handle this ambiguity, when we encounter a ',' after a '<'
25195 we try to parse what follows as a parameter-declaration-list (in the
25196 case of a default argument) or a member-declarator (in the case of an
25197 NSDMI). If that succeeds, then we stop caching. */
25199 static tree
25201 {
25206 tree default_argument;
25208 /* Add tokens until we have processed the entire default
25209 argument. We add the range [first_token, token). */
25212 {
25213 /* For list-initialization, this is straightforward. */
25216 }
25218 {
25221 /* Peek at the next token. */
25223 /* What we do depends on what token we have. */
25225 {
25226 /* In valid code, a default argument must be
25227 immediately followed by a `,' `)', or `...'. */
25230 {
25231 /* If we've seen a '<', we might be in a
25232 template-argument-list. Until Core issue 325 is
25233 resolved, we don't know how this situation ought
25234 to be handled, so try to DTRT. We check whether
25235 what comes after the comma is a valid parameter
25236 declaration list. If it is, then the comma ends
25237 the default argument; otherwise the default
25238 argument continues. */
25241 /* Set ITALP so cp_parser_parameter_declaration_list
25242 doesn't decide to commit to this parse. */
25250 {
25257 }
25258 else
25259 {
25263 }
25270 }
25273 /* If we run into a non-nested `;', `}', or `]',
25274 then the code is invalid -- but the default
25275 argument is certainly over. */
25280 /* Handle correctly int n = sizeof ... ( p ); */
25283 /* Update DEPTH, if necessary. */
25298 /* This might be the comparison operator, or it might
25299 start a template argument list. */
25306 /* Fall through for C++0x, which treats the `>>'
25307 operator like two `>' tokens in certain
25308 cases. */
25312 {
25313 /* This might be an operator, or it might close a
25314 template argument list. But if a previous '<'
25315 started a template argument list, this will have
25316 closed it, so we can't be in one anymore. */
25320 }
25323 /* If we run out of tokens, issue an error message. */
25332 /* In these cases, we should look for template-ids.
25333 For example, if the default argument is
25334 `X<int, double>()', we need to do name lookup to
25335 figure out whether or not `X' is a template; if
25336 so, the `,' does not end the default argument.
25338 That is not yet done. */
25343 }
25345 /* If we've reached the end, stop. */
25349 /* Add the token to the token block. */
25351 }
25353 /* Create a DEFAULT_ARG to represent the unparsed default
25354 argument. */
25361 }
25363 /* Begin parsing tentatively. We always save tokens while parsing
25364 tentatively so that if the tentative parsing fails we can restore the
25365 tokens. */
25367 static void
25369 {
25370 /* Enter a new parsing context. */
25372 /* Begin saving tokens. */
25374 /* In order to avoid repetitive access control error messages,
25375 access checks are queued up until we are no longer parsing
25376 tentatively. */
25378 }
25380 /* Commit to the currently active tentative parse. */
25382 static void
25384 {
25388 /* Mark all of the levels as committed. */
25391 {
25398 }
25399 }
25401 /* Commit to the topmost currently active tentative parse.
25403 Note that this function shouldn't be called when there are
25404 irreversible side-effects while in a tentative state. For
25405 example, we shouldn't create a permanent entry in the symbol
25406 table, or issue an error message that might not apply if the
25407 tentative parse is aborted. */
25409 static void
25411 {
25416 {
25424 }
25425 }
25427 /* Abort the currently active tentative parse. All consumed tokens
25428 will be rolled back, and no diagnostics will be issued. */
25430 static void
25432 {
25436 /* Now, pretend that we want to see if the construct was
25437 successfully parsed. */
25439 }
25441 /* Stop parsing tentatively. If a parse error has occurred, restore the
25442 token stream. Otherwise, commit to the tokens we have consumed.
25443 Returns true if no error occurred; false otherwise. */
25445 static bool
25447 {
25451 /* Remember whether or not an error occurred, since we are about to
25452 destroy that information. */
25454 /* Remove the topmost context from the stack. */
25457 /* If no parse errors occurred, commit to the tentative parse. */
25459 {
25460 /* Commit to the tokens read tentatively, unless that was
25461 already done. */
25466 }
25467 /* Otherwise, if errors occurred, roll back our state so that things
25468 are just as they were before we began the tentative parse. */
25469 else
25470 {
25473 }
25474 /* Add the context to the front of the free list. */
25479 }
25481 /* Returns true if we are parsing tentatively and are not committed to
25482 this tentative parse. */
25484 static bool
25486 {
25489 }
25491 /* Returns nonzero iff an error has occurred during the most recent
25492 tentative parse. */
25494 static bool
25496 {
25499 }
25501 /* Returns nonzero if GNU extensions are allowed. */
25503 static bool
25505 {
25507 }
25508 \f
25509 /* Objective-C++ Productions */
25512 /* Parse an Objective-C expression, which feeds into a primary-expression
25513 above.
25515 objc-expression:
25516 objc-message-expression
25517 objc-string-literal
25518 objc-encode-expression
25519 objc-protocol-expression
25520 objc-selector-expression
25522 Returns a tree representation of the expression. */
25524 static tree
25526 {
25527 /* Try to figure out what kind of declaration is present. */
25531 {
25541 {
25553 }
25559 }
25562 }
25564 /* Parse an Objective-C message expression.
25566 objc-message-expression:
25567 [ objc-message-receiver objc-message-args ]
25569 Returns a representation of an Objective-C message. */
25571 static tree
25573 {
25582 }
25584 /* Parse an objc-message-receiver.
25586 objc-message-receiver:
25587 expression
25588 simple-type-specifier
25590 Returns a representation of the type or expression. */
25592 static tree
25594 {
25595 tree rcv;
25597 /* An Objective-C message receiver may be either (1) a type
25598 or (2) an expression. */
25607 CP_PARSER_FLAGS_NONE);
25610 }
25612 /* Parse the arguments and selectors comprising an Objective-C message.
25614 objc-message-args:
25615 objc-selector
25616 objc-selector-args
25617 objc-selector-args , objc-comma-args
25619 objc-selector-args:
25620 objc-selector [opt] : assignment-expression
25621 objc-selector-args objc-selector [opt] : assignment-expression
25623 objc-comma-args:
25624 assignment-expression
25625 objc-comma-args , assignment-expression
25627 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25628 selector arguments and TREE_VALUE containing a list of comma
25629 arguments. */
25631 static tree
25633 {
25639 {
25645 /* Detect if we have a unary selector. */
25654 sel_args
25659 }
25661 /* Handle non-selector arguments, if any. */
25663 {
25664 tree arg;
25669 addl_args
25674 }
25677 {
25680 }
25683 }
25685 /* Parse an Objective-C encode expression.
25687 objc-encode-expression:
25688 @encode objc-typename
25690 Returns an encoded representation of the type argument. */
25692 static tree
25694 {
25695 tree type;
25705 {
25709 }
25711 /* This happens if we find @encode(T) (where T is a template
25712 typename or something dependent on a template typename) when
25713 parsing a template. In that case, we can't compile it
25714 immediately, but we rather create an AT_ENCODE_EXPR which will
25715 need to be instantiated when the template is used.
25716 */
25718 {
25722 }
25725 }
25727 /* Parse an Objective-C @defs expression. */
25729 static tree
25731 {
25732 tree name;
25740 }
25742 /* Parse an Objective-C protocol expression.
25744 objc-protocol-expression:
25745 @protocol ( identifier )
25747 Returns a representation of the protocol expression. */
25749 static tree
25751 {
25752 tree proto;
25760 }
25762 /* Parse an Objective-C selector expression.
25764 objc-selector-expression:
25765 @selector ( objc-method-signature )
25767 objc-method-signature:
25768 objc-selector
25769 objc-selector-seq
25771 objc-selector-seq:
25772 objc-selector :
25773 objc-selector-seq objc-selector :
25775 Returns a representation of the method selector. */
25777 static tree
25779 {
25791 {
25800 {
25801 /* Detect if we have a unary selector. */
25803 {
25806 }
25807 else
25808 {
25810 }
25811 }
25816 {
25817 sel_seq
25820 sel_seq
25823 }
25824 else
25825 sel_seq
25830 }
25832 finish_selector:
25836 }
25838 /* Parse a list of identifiers.
25840 objc-identifier-list:
25841 identifier
25842 objc-identifier-list , identifier
25844 Returns a TREE_LIST of identifier nodes. */
25846 static tree
25848 {
25849 tree identifier;
25850 tree list;
25861 {
25868 identifier));
25870 }
25873 }
25875 /* Parse an Objective-C alias declaration.
25877 objc-alias-declaration:
25878 @compatibility_alias identifier identifier ;
25880 This function registers the alias mapping with the Objective-C front end.
25881 It returns nothing. */
25883 static void
25885 {
25893 }
25895 /* Parse an Objective-C class forward-declaration.
25897 objc-class-declaration:
25898 @class objc-identifier-list ;
25900 The function registers the forward declarations with the Objective-C
25901 front end. It returns nothing. */
25903 static void
25905 {
25908 {
25909 tree id;
25919 else
25921 }
25923 }
25925 /* Parse a list of Objective-C protocol references.
25927 objc-protocol-refs-opt:
25928 objc-protocol-refs [opt]
25930 objc-protocol-refs:
25931 < objc-identifier-list >
25933 Returns a TREE_LIST of identifiers, if any. */
25935 static tree
25937 {
25941 {
25945 }
25948 }
25950 /* Parse a Objective-C visibility specification. */
25952 static void
25954 {
25958 {
25973 }
25975 /* Eat '@private'/'@protected'/'@public'. */
25977 }
25979 /* Parse an Objective-C method type. Return 'true' if it is a class
25980 (+) method, and 'false' if it is an instance (-) method. */
25984 {
25987 else
25989 }
25991 /* Parse an Objective-C protocol qualifier. */
25993 static tree
25995 {
26008 {
26013 }
26016 }
26018 /* Parse an Objective-C typename. */
26020 static tree
26022 {
26026 {
26032 /* An ObjC type name may consist of just protocol qualifiers, in which
26033 case the type shall default to 'id'. */
26035 {
26038 /* If the type could not be parsed, an error has already
26039 been produced. For error recovery, behave as if it had
26040 not been specified, which will use the default type
26041 'id'. */
26043 {
26045 /* We need to skip to the closing parenthesis as
26046 cp_parser_type_id() does not seem to do it for
26047 us. */
26052 }
26053 }
26057 }
26060 }
26062 /* Check to see if TYPE refers to an Objective-C selector name. */
26064 static bool
26066 {
26072 }
26074 /* Parse an Objective-C selector. */
26076 static tree
26078 {
26082 {
26085 }
26087 /* C++ operator names are allowed to appear in ObjC selectors. */
26089 {
26102 }
26103 }
26105 /* Parse an Objective-C params list. */
26107 static tree
26109 {
26115 {
26125 /* Detect if we have a unary selector. */
26128 {
26131 }
26135 {
26136 /* Something went quite wrong. There should be a colon
26137 here, but there is not. Stop parsing parameters. */
26139 }
26141 /* New ObjC allows attributes on parameters too. */
26146 params
26149 type_name,
26150 identifier,
26151 parm_attr));
26154 }
26157 {
26160 }
26162 /* We allow tail attributes for the method. */
26164 {
26172 }
26175 {
26178 }
26180 }
26182 /* Parse the non-keyword Objective-C params. */
26184 static tree
26187 {
26193 {
26195 tree parm;
26201 {
26206 }
26208 /* TODO: parse attributes for tail parameters. */
26217 }
26219 /* We allow tail attributes for the method. */
26221 {
26223 {
26228 }
26229 else
26230 /* We have an error, but parse the attributes, so that we can
26231 carry on. */
26237 }
26240 }
26242 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26244 static void
26246 {
26249 /* If the next token is `extern' and the following token is a string
26250 literal, then we have a linkage specification. */
26252 && cp_parser_is_pure_string_literal
26255 /* Handle #pragma, if any. */
26258 /* Allow stray semicolons. */
26261 /* Mark methods as optional or required, when building protocols. */
26263 {
26266 }
26268 {
26271 }
26274 /* Other stray characters must generate errors. */
26276 {
26280 }
26281 /* Finally, try to parse a block-declaration, or a function-definition. */
26282 else
26284 }
26286 /* Parse a method signature. */
26288 static tree
26290 {
26306 }
26308 static bool
26310 {
26311 tree tattr;
26316 /* If the attributes are followed by a method introducer, this is not allowed.
26317 Dump the attributes and flag the situation. */
26322 /* Otherwise, the attributes introduce some interstitial code, possibly so
26323 rewind to allow that check. */
26326 }
26328 /* Parse an Objective-C method prototype list. */
26330 static void
26332 {
26336 {
26338 {
26343 else
26347 {
26351 }
26354 }
26360 OPT_Wattributes,
26362 else
26363 /* Allow for interspersed non-ObjC++ code. */
26367 }
26371 else
26375 }
26377 /* Parse an Objective-C method definition list. */
26379 static void
26381 {
26385 {
26386 tree meth;
26389 {
26395 else
26400 {
26404 }
26406 NULL_TREE);
26408 /* For historical reasons, we accept an optional semicolon. */
26415 {
26422 }
26423 }
26424 /* The following case will be removed once @synthesize is
26425 completely implemented. */
26436 else
26437 /* Allow for interspersed non-ObjC++ code. */
26441 }
26445 else
26449 }
26451 /* Parse Objective-C ivars. */
26453 static void
26455 {
26466 {
26467 cp_decl_specifier_seq declspecs;
26469 tree prefix_attributes;
26477 CP_PARSER_FLAGS_OPTIONAL,
26481 /* auto, register, static, extern, mutable. */
26483 {
26486 }
26488 /* thread_local. */
26490 {
26493 }
26495 /* typedef. */
26497 {
26500 }
26505 /* Keep going until we hit the `;' at the end of the
26506 declaration. */
26508 {
26513 /* Check for a (possibly unnamed) bitfield declaration. */
26521 {
26522 /* Get the name of the bitfield. */
26525 sfk_none);
26527 eat_colon:
26529 /* Get the width of the bitfield. */
26530 width
26532 }
26533 else
26534 {
26535 /* Parse the declarator. */
26536 declarator
26542 }
26544 /* Look for attributes that apply to the ivar. */
26546 /* Remember which attributes are prefix attributes and
26547 which are not. */
26549 /* Combine the attributes. */
26553 /* Create the bitfield declaration. */
26555 width,
26556 attributes);
26557 else
26562 /* Add the instance variable. */
26566 /* Reset PREFIX_ATTRIBUTES. */
26575 {
26578 }
26580 }
26584 }
26589 /* Do not consume the RID_AT_END, so it will be read again as terminating
26590 the @interface of @implementation. */
26594 /* For historical reasons, we accept an optional semicolon. */
26597 }
26599 /* Parse an Objective-C protocol declaration. */
26601 static void
26603 {
26609 {
26614 }
26616 /* See if we have a forward declaration or a definition. */
26619 /* Try a forward declaration first. */
26621 {
26623 {
26624 tree id;
26634 else
26636 }
26638 }
26640 /* Ok, we got a full-fledged definition (or at least should). */
26641 else
26642 {
26647 }
26648 }
26650 /* Parse an Objective-C superclass or category. */
26652 static void
26657 {
26663 {
26666 }
26668 {
26671 /* If there is no category name, and this is an @interface, we
26672 have a class extension. */
26674 {
26677 }
26678 else
26682 }
26683 }
26685 /* Parse an Objective-C class interface. */
26687 static void
26689 {
26696 {
26697 /* It's hard to recover because even if valid @interface stuff
26698 is to follow, we can't compile it (or validate it) if we
26699 don't even know which class it refers to. Let's assume this
26700 was a stray '@interface' token in the stream and skip it.
26701 */
26703 }
26708 /* We have either a class or a category on our hands. */
26711 else
26712 {
26714 /* Handle instance variable declarations, if any. */
26717 }
26720 }
26722 /* Parse an Objective-C class implementation. */
26724 static void
26726 {
26733 {
26734 /* It's hard to recover because even if valid @implementation
26735 stuff is to follow, we can't compile it (or validate it) if
26736 we don't even know which class it refers to. Let's assume
26737 this was a stray '@implementation' token in the stream and
26738 skip it.
26739 */
26741 }
26745 /* We have either a class or a category on our hands. */
26748 else
26749 {
26751 /* Handle instance variable declarations, if any. */
26754 }
26757 }
26759 /* Consume the @end token and finish off the implementation. */
26761 static void
26763 {
26766 }
26768 /* Parse an Objective-C declaration. */
26770 static void
26772 {
26773 /* Try to figure out what kind of declaration is present. */
26778 {
26794 }
26797 {
26820 }
26821 }
26823 /* Parse an Objective-C try-catch-finally statement.
26825 objc-try-catch-finally-stmt:
26826 @try compound-statement objc-catch-clause-seq [opt]
26827 objc-finally-clause [opt]
26829 objc-catch-clause-seq:
26830 objc-catch-clause objc-catch-clause-seq [opt]
26832 objc-catch-clause:
26833 @catch ( objc-exception-declaration ) compound-statement
26835 objc-finally-clause:
26836 @finally compound-statement
26838 objc-exception-declaration:
26839 parameter-declaration
26840 '...'
26842 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26844 Returns NULL_TREE.
26846 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26847 for C. Keep them in sync. */
26849 static tree
26851 {
26852 location_t location;
26853 tree stmt;
26858 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26859 node, lest it get absorbed into the surrounding block. */
26865 {
26874 {
26875 /* We have "@catch (...)" (where the '...' are literally
26876 what is in the code). Skip the '...'.
26877 parameter_declaration is set to NULL_TREE, and
26878 objc_being_catch_clauses() knows that that means
26879 '...'. */
26882 }
26883 else
26884 {
26885 /* We have "@catch (NSException *exception)" or something
26886 like that. Parse the parameter declaration. */
26890 else
26895 }
26898 else
26899 {
26900 /* If there was no open parenthesis, we are recovering from
26901 an error, and we are trying to figure out what mistake
26902 the user has made. */
26904 /* If there is an immediate closing parenthesis, the user
26905 probably forgot the opening one (ie, they typed "@catch
26906 NSException *e)". Parse the closing parenthesis and keep
26907 going. */
26911 /* If these is no immediate closing parenthesis, the user
26912 probably doesn't know that parenthesis are required at
26913 all (ie, they typed "@catch NSException *e"). So, just
26914 forget about the closing parenthesis and keep going. */
26915 }
26919 }
26921 {
26924 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26925 node, lest it get absorbed into the surrounding block. */
26929 }
26932 }
26934 /* Parse an Objective-C synchronized statement.
26936 objc-synchronized-stmt:
26937 @synchronized ( expression ) compound-statement
26939 Returns NULL_TREE. */
26941 static tree
26943 {
26944 location_t location;
26955 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26956 node, lest it get absorbed into the surrounding block. */
26961 }
26963 /* Parse an Objective-C throw statement.
26965 objc-throw-stmt:
26966 @throw assignment-expression [opt] ;
26968 Returns a constructed '@throw' statement. */
26970 static tree
26972 {
26984 }
26986 /* Parse an Objective-C statement. */
26988 static tree
26990 {
26991 /* Try to figure out what kind of declaration is present. */
26995 {
27006 }
27009 }
27011 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27012 look ahead to see if an objc keyword follows the attributes. This
27013 is to detect the use of prefix attributes on ObjC @interface and
27014 @protocol. */
27016 static bool
27018 {
27023 {
27026 }
27029 }
27031 /* This routine is a minimal replacement for
27032 c_parser_struct_declaration () used when parsing the list of
27033 types/names or ObjC++ properties. For example, when parsing the
27034 code
27036 @property (readonly) int a, b, c;
27038 this function is responsible for parsing "int a, int b, int c" and
27039 returning the declarations as CHAIN of DECLs.
27041 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27042 similar parsing. */
27043 static tree
27045 {
27047 cp_decl_specifier_seq declspecs;
27049 tree prefix_attributes;
27052 CP_PARSER_FLAGS_NONE,
27059 /* auto, register, static, extern, mutable. */
27061 {
27064 }
27066 /* thread_local. */
27068 {
27071 }
27073 /* typedef. */
27075 {
27078 }
27083 /* Keep going until we hit the `;' at the end of the declaration. */
27085 {
27090 /* Parse the declarator. */
27094 /* Look for attributes that apply to the ivar. */
27096 /* Remember which attributes are prefix attributes and
27097 which are not. */
27099 /* Combine the attributes. */
27109 /* Reset PREFIX_ATTRIBUTES. */
27120 {
27123 }
27124 else
27126 }
27128 }
27130 /* Parse an Objective-C @property declaration. The syntax is:
27132 objc-property-declaration:
27133 '@property' objc-property-attributes[opt] struct-declaration ;
27135 objc-property-attributes:
27136 '(' objc-property-attribute-list ')'
27138 objc-property-attribute-list:
27139 objc-property-attribute
27140 objc-property-attribute-list, objc-property-attribute
27142 objc-property-attribute
27143 'getter' = identifier
27144 'setter' = identifier
27145 'readonly'
27146 'readwrite'
27147 'assign'
27148 'retain'
27149 'copy'
27150 'nonatomic'
27152 For example:
27153 @property NSString *name;
27154 @property (readonly) id object;
27155 @property (retain, nonatomic, getter=getTheName) id name;
27156 @property int a, b, c;
27158 PS: This function is identical to
27159 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27160 static void
27162 {
27163 /* The following variables hold the attributes of the properties as
27164 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27165 seen. When we see an attribute, we set them to 'true' (if they
27166 are boolean properties) or to the identifier (if they have an
27167 argument, ie, for getter and setter). Note that here we only
27168 parse the list of attributes, check the syntax and accumulate the
27169 attributes that we find. objc_add_property_declaration() will
27170 then process the information. */
27180 /* 'properties' is the list of properties that we read. Usually a
27181 single one, but maybe more (eg, in "@property int a, b, c;" there
27182 are three). */
27183 tree properties;
27184 location_t loc;
27190 /* Parse the optional attribute list... */
27192 {
27193 /* Eat the '('. */
27197 {
27203 {
27206 }
27210 {
27221 {
27225 else
27230 }
27233 {
27237 }
27239 {
27241 {
27244 }
27245 else
27249 else
27251 }
27252 else
27253 {
27255 {
27258 }
27259 else
27261 }
27267 }
27274 else
27276 }
27278 /* FIXME: "@property (setter, assign);" will generate a spurious
27279 "error: expected ‘)’ before ‘,’ token". This is because
27280 cp_parser_require, unlike the C counterpart, will produce an
27281 error even if we are in error recovery. */
27283 {
27288 }
27289 }
27291 /* ... and the property declaration(s). */
27295 {
27297 /* If the next token is now a `;', consume it. */
27301 }
27305 else
27306 {
27307 /* Comma-separated properties are chained together in
27308 reverse order; add them one by one. */
27317 }
27320 }
27322 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27324 objc-synthesize-declaration:
27325 @synthesize objc-synthesize-identifier-list ;
27327 objc-synthesize-identifier-list:
27328 objc-synthesize-identifier
27329 objc-synthesize-identifier-list, objc-synthesize-identifier
27331 objc-synthesize-identifier
27332 identifier
27333 identifier = identifier
27335 For example:
27336 @synthesize MyProperty;
27337 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27339 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27340 for C. Keep them in sync.
27341 */
27342 static void
27344 {
27346 location_t loc;
27351 {
27355 {
27358 }
27360 {
27364 {
27367 }
27368 }
27369 else
27374 else
27376 }
27379 }
27381 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27383 objc-dynamic-declaration:
27384 @dynamic identifier-list ;
27386 For example:
27387 @dynamic MyProperty;
27388 @dynamic MyProperty, AnotherProperty;
27390 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27391 for C. Keep them in sync.
27392 */
27393 static void
27395 {
27397 location_t loc;
27402 {
27403 tree property;
27406 {
27409 }
27413 else
27415 }
27418 }
27420 \f
27421 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27423 /* Returns name of the next clause.
27424 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27425 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27426 returned and the token is consumed. */
27428 static pragma_omp_clause
27430 {
27442 {
27447 {
27550 }
27551 }
27557 }
27559 /* Validate that a clause of the given type does not already exist. */
27561 static void
27564 {
27565 tree c;
27569 {
27572 }
27573 }
27575 /* OpenMP 2.5:
27576 variable-list:
27577 identifier
27578 variable-list , identifier
27580 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27581 colon). An opening parenthesis will have been consumed by the caller.
27583 If KIND is nonzero, create the appropriate node and install the decl
27584 in OMP_CLAUSE_DECL and add the node to the head of the list.
27586 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27587 return the list created.
27589 COLON can be NULL if only closing parenthesis should end the list,
27590 or pointer to bool which will receive false if the list is terminated
27591 by closing parenthesis or true if the list is terminated by colon. */
27593 static tree
27596 {
27600 {
27603 }
27605 {
27622 {
27624 {
27630 {
27638 parser->colon_corrects_to_scope_p
27642 else
27643 {
27644 /* Look for `:'. */
27648 CPP_CLOSE_SQUARE))
27650 }
27651 /* Look for the closing `]'. */
27653 RT_CLOSE_SQUARE))
27656 }
27660 }
27666 }
27667 else
27670 get_comma:
27674 }
27680 {
27684 }
27687 {
27690 /* Try to resync to an unnested comma. Copied from
27691 cp_parser_parenthesized_expression_list. */
27692 skip_comma:
27701 }
27704 }
27706 /* Similarly, but expect leading and trailing parenthesis. This is a very
27707 common case for omp clauses. */
27709 static tree
27711 {
27715 }
27717 /* OpenMP 3.0:
27718 collapse ( constant-expression ) */
27720 static tree
27722 {
27724 location_t loc;
27725 HOST_WIDE_INT n;
27745 {
27748 }
27756 }
27758 /* OpenMP 2.5:
27759 default ( shared | none ) */
27761 static tree
27763 {
27765 tree c;
27770 {
27775 {
27790 }
27793 }
27794 else
27795 {
27796 invalid_kind:
27798 }
27814 }
27816 /* OpenMP 3.1:
27817 final ( expression ) */
27819 static tree
27821 {
27842 }
27844 /* OpenMP 2.5:
27845 if ( expression ) */
27847 static tree
27849 {
27870 }
27872 /* OpenMP 3.1:
27873 mergeable */
27875 static tree
27878 {
27879 tree c;
27882 location);
27887 }
27889 /* OpenMP 2.5:
27890 nowait */
27892 static tree
27895 {
27896 tree c;
27903 }
27905 /* OpenMP 2.5:
27906 num_threads ( expression ) */
27908 static tree
27910 location_t location)
27911 {
27933 }
27935 /* OpenMP 2.5:
27936 ordered */
27938 static tree
27941 {
27942 tree c;
27950 }
27952 /* OpenMP 2.5:
27953 reduction ( reduction-operator : variable-list )
27955 reduction-operator:
27956 One of: + * - & ^ | && ||
27958 OpenMP 3.1:
27960 reduction-operator:
27961 One of: + * - & ^ | && || min max
27963 OpenMP 4.0:
27965 reduction-operator:
27966 One of: + * - & ^ | && ||
27967 id-expression */
27969 static tree
27971 {
27979 {
27989 }
27993 else
27994 {
28005 {
28035 }
28036 else
28037 {
28039 resync_fail:
28044 }
28045 }
28051 NULL);
28053 {
28056 }
28059 }
28061 /* OpenMP 2.5:
28062 schedule ( schedule-kind )
28063 schedule ( schedule-kind , expression )
28065 schedule-kind:
28066 static | dynamic | guided | runtime | auto */
28068 static tree
28070 {
28079 {
28084 {
28105 }
28106 }
28111 else
28116 {
28131 else
28136 }
28144 invalid_kind:
28146 resync_fail:
28151 }
28153 /* OpenMP 3.0:
28154 untied */
28156 static tree
28159 {
28160 tree c;
28167 }
28169 /* OpenMP 4.0:
28170 inbranch
28171 notinbranch */
28173 static tree
28176 {
28181 }
28183 /* OpenMP 4.0:
28184 parallel
28185 for
28186 sections
28187 taskgroup */
28189 static tree
28193 {
28197 }
28199 /* OpenMP 4.0:
28200 num_teams ( expression ) */
28202 static tree
28204 location_t location)
28205 {
28227 }
28229 /* OpenMP 4.0:
28230 thread_limit ( expression ) */
28232 static tree
28234 location_t location)
28235 {
28257 }
28259 /* OpenMP 4.0:
28260 aligned ( variable-list )
28261 aligned ( variable-list : constant-expression ) */
28263 static tree
28265 {
28276 {
28286 }
28292 }
28294 /* OpenMP 4.0:
28295 linear ( variable-list )
28296 linear ( variable-list : expression ) */
28298 static tree
28301 {
28312 {
28316 {
28319 }
28327 }
28333 }
28335 /* OpenMP 4.0:
28336 safelen ( constant-expression ) */
28338 static tree
28340 location_t location)
28341 {
28362 }
28364 /* OpenMP 4.0:
28365 simdlen ( constant-expression ) */
28367 static tree
28369 location_t location)
28370 {
28391 }
28393 /* OpenMP 4.0:
28394 depend ( depend-kind : variable-list )
28396 depend-kind:
28397 in | out | inout */
28399 static tree
28401 {
28409 {
28419 else
28421 }
28422 else
28430 NULL);
28437 invalid_kind:
28439 resync_fail:
28444 }
28446 /* OpenMP 4.0:
28447 map ( map-kind : variable-list )
28448 map ( variable-list )
28450 map-kind:
28451 alloc | to | from | tofrom */
28453 static tree
28455 {
28464 {
28476 else
28477 {
28483 }
28486 }
28489 NULL);
28495 }
28497 /* OpenMP 4.0:
28498 device ( expression ) */
28500 static tree
28502 location_t location)
28503 {
28525 }
28527 /* OpenMP 4.0:
28528 dist_schedule ( static )
28529 dist_schedule ( static , expression ) */
28531 static tree
28533 location_t location)
28534 {
28547 {
28558 }
28563 location);
28567 invalid_kind:
28569 resync_fail:
28574 }
28576 /* OpenMP 4.0:
28577 proc_bind ( proc-bind-kind )
28579 proc-bind-kind:
28580 master | close | spread */
28582 static tree
28584 location_t location)
28585 {
28586 tree c;
28593 {
28603 else
28605 }
28606 else
28615 location);
28620 invalid_kind:
28622 resync_fail:
28627 }
28629 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28630 is a bitmask in MASK. Return the list of clauses found; the result
28631 of clause default goes in *pdefault. */
28633 static tree
28637 {
28644 {
28645 pragma_omp_clause c_kind;
28656 {
28668 clauses);
28682 clauses);
28691 clauses);
28715 clauses);
28729 clauses);
28746 OMP_CLAUSE_NOTINBRANCH,
28755 {
28756 clause_not_first:
28760 }
28785 clauses);
28790 clauses);
28795 clauses);
28858 }
28863 {
28864 /* Remove the invalid clause(s) from the list to avoid
28865 confusing the rest of the compiler. */
28868 }
28869 }
28870 saw_error:
28871 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
28872 no reason to skip to the end. */
28878 }
28880 /* OpenMP 2.5:
28881 structured-block:
28882 statement
28884 In practice, we're also interested in adding the statement to an
28885 outer node. So it is convenient if we work around the fact that
28886 cp_parser_statement calls add_stmt. */
28888 static unsigned
28890 {
28893 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28894 This preserves the "not within loop or switch" style error messages
28895 for nonsense cases like
28896 void foo() {
28897 #pragma omp single
28898 break;
28899 }
28900 */
28905 }
28907 static void
28909 {
28911 }
28913 static tree
28915 {
28923 }
28925 /* OpenMP 2.5:
28926 # pragma omp atomic new-line
28927 expression-stmt
28929 expression-stmt:
28930 x binop= expr | x++ | ++x | x-- | --x
28931 binop:
28932 +, *, -, /, &, ^, |, <<, >>
28934 where x is an lvalue expression with scalar type.
28936 OpenMP 3.1:
28937 # pragma omp atomic new-line
28938 update-stmt
28940 # pragma omp atomic read new-line
28941 read-stmt
28943 # pragma omp atomic write new-line
28944 write-stmt
28946 # pragma omp atomic update new-line
28947 update-stmt
28949 # pragma omp atomic capture new-line
28950 capture-stmt
28952 # pragma omp atomic capture new-line
28953 capture-block
28955 read-stmt:
28956 v = x
28957 write-stmt:
28958 x = expr
28959 update-stmt:
28960 expression-stmt | x = x binop expr
28961 capture-stmt:
28962 v = expression-stmt
28963 capture-block:
28964 { v = x; update-stmt; } | { update-stmt; v = x; }
28966 OpenMP 4.0:
28967 update-stmt:
28968 expression-stmt | x = x binop expr | x = expr binop x
28969 capture-stmt:
28970 v = update-stmt
28971 capture-block:
28972 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28974 where x and v are lvalue expressions with scalar type. */
28976 static void
28978 {
28986 {
28991 {
28997 }
28998 }
29000 {
29012 else
29016 }
29018 {
29024 {
29029 {
29032 }
29033 }
29034 }
29038 {
29048 else
29053 {
29054 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29055 opcode. */
29060 }
29064 {
29067 }
29068 else
29069 {
29075 }
29078 }
29080 restart:
29084 {
29091 /* FALLTHROUGH */
29101 /* FALLTHROUGH */
29116 /* Undo effects of boolean_increment for post {in,de}crement. */
29118 /* FALLTHRU */
29122 {
29123 /* Undo effects of boolean_increment. */
29125 {
29126 /* This is pre or post increment. */
29131 && !structured_block
29135 }
29136 }
29137 /* FALLTHRU */
29140 {
29175 {
29179 }
29182 {
29188 {
29193 }
29195 {
29206 {
29208 {
29213 }
29214 else
29216 }
29220 }
29223 {
29230 }
29234 }
29238 {
29241 {
29249 }
29251 {
29256 }
29291 }
29302 /* FALLTHROUGH */
29307 }
29314 }
29315 stmt_done:
29317 {
29328 }
29330 {
29333 }
29334 done:
29340 saw_error:
29343 {
29347 {
29351 }
29352 }
29353 }
29356 /* OpenMP 2.5:
29357 # pragma omp barrier new-line */
29359 static void
29361 {
29364 }
29366 /* OpenMP 2.5:
29367 # pragma omp critical [(name)] new-line
29368 structured-block */
29370 static tree
29372 {
29376 {
29388 }
29393 }
29395 /* OpenMP 2.5:
29396 # pragma omp flush flush-vars[opt] new-line
29398 flush-vars:
29399 ( variable-list ) */
29401 static void
29403 {
29409 }
29411 /* Helper function, to parse omp for increment expression. */
29413 static tree
29415 {
29420 {
29423 }
29426 {
29435 /* Fall through: OpenMP disallows NE_EXPR. */
29438 }
29440 /* If decl is an iterator, preserve LHS and RHS of the relational
29441 expr until finish_omp_for. */
29451 }
29453 /* Helper function, to parse omp for increment expression. */
29455 static tree
29457 {
29461 cp_id_kind idk;
29465 {
29473 }
29481 {
29486 }
29493 {
29497 }
29509 do
29510 {
29517 {
29519 {
29522 else
29524 tf_warning_or_error);
29525 }
29526 else
29529 }
29530 }
29534 {
29538 }
29539 else
29543 }
29545 /* Parse the initialization statement of either an OpenMP for loop or
29546 a Cilk Plus for loop.
29548 Return true if the resulting construct should have an
29549 OMP_CLAUSE_PRIVATE added to it. */
29551 static bool
29559 {
29565 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29567 init-expr:
29568 var = lb
29569 integer-type var = lb
29570 random-access-iterator-type var = lb
29571 pointer-type var = lb
29572 */
29573 cp_decl_specifier_seq type_specifiers;
29575 /* First, try to parse as an initialized declaration. See
29576 cp_parser_condition, from whence the bulk of this is copied. */
29583 {
29584 /* If parsing a type specifier seq succeeded, then this
29585 MUST be a initialized declaration. */
29590 CP_PARSER_DECLARATOR_NAMED,
29601 else
29602 {
29612 {
29614 CPP_OPEN_PAREN))
29615 {
29619 else
29622 }
29623 else
29624 /* Trigger an error. */
29629 }
29633 {
29641 {
29644 auto_node);
29649 }
29652 asm_specification,
29653 LOOKUP_ONLYCONVERTING);
29655 {
29658 }
29659 else
29662 }
29663 else
29664 {
29665 /* Consume '='. */
29669 non_class:
29672 else
29675 asm_specification,
29676 LOOKUP_ONLYCONVERTING);
29677 }
29681 }
29682 }
29683 else
29684 {
29685 cp_id_kind idk;
29686 /* If parsing a type specifier sequence failed, then
29687 this MUST be a simple expression. */
29695 && decl
29698 {
29699 tree rhs;
29706 rhs,
29707 tf_warning_or_error));
29709 }
29710 else
29711 {
29716 {
29720 }
29721 }
29722 }
29724 }
29726 /* Parse the restricted form of the for statement allowed by OpenMP. */
29728 static tree
29731 {
29735 location_t loc_first;
29754 {
29757 location_t loc;
29761 {
29764 }
29767 {
29770 }
29779 add_private_clause
29786 {
29789 {
29795 }
29796 else
29798 }
29805 {
29810 {
29814 }
29817 {
29818 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29819 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29824 {
29827 }
29828 else
29829 {
29832 }
29836 }
29837 else
29838 {
29843 }
29844 }
29847 {
29848 tree c;
29850 {
29859 decl);
29863 decl);
29864 }
29866 {
29871 {
29874 }
29875 }
29876 }
29885 {
29886 /* If decl is an iterator, preserve the operator on decl
29887 until finish_omp_for. */
29889 && ((processing_template_decl
29893 else
29897 }
29912 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29913 in between the collapsed for loops to be still considered perfectly
29914 nested. Hopefully the final version clarifies this.
29915 For now handle (multiple) {'s and empty statements. */
29917 do
29918 {
29922 {
29924 bracecount++;
29925 }
29929 else
29930 {
29937 }
29938 }
29942 {
29945 }
29946 }
29948 /* Note that we saved the original contents of this flag when we entered
29949 the structured block, and so we don't need to re-save it here. */
29952 else
29955 /* Note that the grammar doesn't call for a structured block here,
29956 though the loop as a whole is a structured block. */
29963 else
29968 {
29970 {
29972 nbraces--;
29973 }
29976 else
29977 {
29979 {
29982 }
29987 }
29988 }
29995 }
29997 /* Helper function for OpenMP parsing, split clauses and call
29998 finish_omp_clauses on each of the set of clauses afterwards. */
30000 static void
30003 {
30009 }
30011 /* OpenMP 4.0:
30012 #pragma omp simd simd-clause[optseq] new-line
30013 for-loop */
30015 #define OMP_SIMD_CLAUSE_MASK \
30016 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30020 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30021 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30022 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30024 static tree
30027 {
30039 {
30042 }
30053 }
30055 /* OpenMP 2.5:
30056 #pragma omp for for-clause[optseq] new-line
30057 for-loop
30059 OpenMP 4.0:
30060 #pragma omp for simd for-simd-clause[optseq] new-line
30061 for-loop */
30063 #define OMP_FOR_CLAUSE_MASK \
30064 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30067 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30073 static tree
30076 {
30087 {
30092 {
30100 cclauses);
30104 cclauses);
30116 }
30117 }
30119 {
30122 }
30127 {
30130 }
30141 }
30143 /* OpenMP 2.5:
30144 # pragma omp master new-line
30145 structured-block */
30147 static tree
30149 {
30153 }
30155 /* OpenMP 2.5:
30156 # pragma omp ordered new-line
30157 structured-block */
30159 static tree
30161 {
30165 }
30167 /* OpenMP 2.5:
30169 section-scope:
30170 { section-sequence }
30172 section-sequence:
30173 section-directive[opt] structured-block
30174 section-sequence section-directive structured-block */
30176 static tree
30178 {
30189 {
30193 }
30196 {
30204 {
30208 }
30210 {
30213 }
30218 }
30229 }
30231 /* OpenMP 2.5:
30232 # pragma omp sections sections-clause[optseq] newline
30233 sections-scope */
30235 #define OMP_SECTIONS_CLAUSE_MASK \
30236 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30237 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30238 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30239 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30240 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30242 static tree
30245 {
30257 {
30260 }
30267 }
30269 /* OpenMP 2.5:
30270 # pragma omp parallel parallel-clause[optseq] new-line
30271 structured-block
30272 # pragma omp parallel for parallel-for-clause[optseq] new-line
30273 structured-block
30274 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
30275 structured-block
30277 OpenMP 4.0:
30278 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
30279 structured-block */
30281 #define OMP_PARALLEL_CLAUSE_MASK \
30282 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30292 static tree
30295 {
30304 {
30317 block);
30322 }
30324 {
30328 }
30330 {
30333 }
30335 {
30339 {
30349 block);
30352 }
30353 }
30363 }
30365 /* OpenMP 2.5:
30366 # pragma omp single single-clause[optseq] new-line
30367 structured-block */
30369 #define OMP_SINGLE_CLAUSE_MASK \
30370 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30371 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30372 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30373 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30375 static tree
30377 {
30387 }
30389 /* OpenMP 3.0:
30390 # pragma omp task task-clause[optseq] new-line
30391 structured-block */
30393 #define OMP_TASK_CLAUSE_MASK \
30394 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30396 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30397 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30399 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30400 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30401 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30402 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30404 static tree
30406 {
30417 }
30419 /* OpenMP 3.0:
30420 # pragma omp taskwait new-line */
30422 static void
30424 {
30427 }
30429 /* OpenMP 3.1:
30430 # pragma omp taskyield new-line */
30432 static void
30434 {
30437 }
30439 /* OpenMP 4.0:
30440 # pragma omp taskgroup new-line
30441 structured-block */
30443 static tree
30445 {
30449 }
30452 /* OpenMP 2.5:
30453 # pragma omp threadprivate (variable-list) */
30455 static void
30457 {
30458 tree vars;
30464 }
30466 /* OpenMP 4.0:
30467 # pragma omp cancel cancel-clause[optseq] new-line */
30469 #define OMP_CANCEL_CLAUSE_MASK \
30470 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30473 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30474 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30476 static void
30478 {
30482 }
30484 /* OpenMP 4.0:
30485 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30487 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30488 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30489 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30490 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30493 static void
30495 {
30496 tree clauses;
30500 {
30505 {
30508 }
30509 }
30511 {
30515 }
30518 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30520 pragma_tok);
30522 }
30524 /* OpenMP 4.0:
30525 #pragma omp distribute distribute-clause[optseq] new-line
30526 for-loop */
30528 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30529 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30530 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30531 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30532 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30534 static tree
30537 {
30546 {
30554 else
30557 {
30563 {
30566 cclauses);
30567 else
30569 cclauses);
30570 }
30575 cclauses);
30576 else
30578 cclauses);
30590 }
30591 }
30593 {
30596 }
30601 {
30604 }
30615 }
30617 /* OpenMP 4.0:
30618 # pragma omp teams teams-clause[optseq] new-line
30619 structured-block */
30621 #define OMP_TEAMS_CLAUSE_MASK \
30622 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30623 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30624 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30625 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30627 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30628 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30630 static tree
30633 {
30642 {
30646 {
30654 cclauses);
30658 cclauses);
30669 }
30670 }
30672 {
30675 }
30680 {
30683 }
30691 }
30693 /* OpenMP 4.0:
30694 # pragma omp target data target-data-clause[optseq] new-line
30695 structured-block */
30697 #define OMP_TARGET_DATA_CLAUSE_MASK \
30698 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30702 static tree
30704 {
30716 }
30718 /* OpenMP 4.0:
30719 # pragma omp target update target-update-clause[optseq] new-line */
30721 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30722 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30724 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30725 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30727 static bool
30730 {
30732 {
30734 "%<#pragma omp target update%> may only be "
30738 }
30740 tree clauses
30745 {
30747 "%<#pragma omp target update must contain at least one "
30750 }
30758 }
30760 /* OpenMP 4.0:
30761 # pragma omp target target-clause[optseq] new-line
30762 structured-block */
30764 #define OMP_TARGET_CLAUSE_MASK \
30765 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30766 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30767 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30769 static bool
30772 {
30774 {
30778 }
30781 {
30786 {
30794 {
30796 OMP_TARGET_CLAUSE_MASK,
30797 cclauses);
30799 }
30815 }
30817 {
30820 }
30822 {
30826 }
30828 {
30831 }
30832 }
30846 }
30848 /* OpenMP 4.0:
30849 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30851 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30852 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30859 static void
30862 {
30864 cp_omp_declare_simd_data data;
30866 {
30871 }
30882 {
30886 {
30899 }
30904 "%<#pragma omp declare simd%> not immediately followed by "
30908 }
30909 }
30911 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
30912 This function is modelled similar to the late parsing of omp declare
30913 simd. */
30915 static tree
30917 {
30923 {
30929 }
30931 {
30935 }
30940 {
30947 NULL);
30961 }
30966 }
30968 /* Finalize #pragma omp declare simd clauses after direct declarator has
30969 been parsed, and put that into "omp declare simd" attribute. */
30971 static tree
30973 {
30979 {
30984 }
30989 {
31007 }
31011 }
31014 /* OpenMP 4.0:
31015 # pragma omp declare target new-line
31016 declarations and definitions
31017 # pragma omp end declare target new-line */
31019 static void
31021 {
31024 }
31026 static void
31028 {
31031 {
31034 }
31036 {
31040 {
31043 }
31046 else
31047 {
31051 }
31052 }
31053 else
31054 {
31058 }
31062 "%<#pragma omp end declare target%> without corresponding "
31064 else
31066 }
31068 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
31069 expression and optional initializer clause of
31070 #pragma omp declare reduction. We store the expression(s) as
31071 either 3, 6 or 7 special statements inside of the artificial function's
31072 body. The first two statements are DECL_EXPRs for the artificial
31073 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
31074 expression that uses those variables.
31075 If there was any INITIALIZER clause, this is followed by further statements,
31076 the fourth and fifth statements are DECL_EXPRs for the artificial
31077 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
31078 constructor variant (first token after open paren is not omp_priv),
31079 then the sixth statement is a statement with the function call expression
31080 that uses the OMP_PRIV and optionally OMP_ORIG variable.
31081 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
31082 to initialize the OMP_PRIV artificial variable and there is seventh
31083 statement, a DECL_EXPR of the OMP_PRIV statement again. */
31085 static bool
31087 {
31099 tree combiner;
31114 {
31117 }
31120 {
31127 {
31130 }
31146 {
31150 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
31154 == CPP_CLOSE_PAREN
31157 {
31161 }
31166 }
31167 else
31168 {
31184 {
31189 }
31191 tree arg;
31204 }
31215 }
31221 }
31223 /* OpenMP 4.0
31224 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31225 initializer-clause[opt] new-line
31227 initializer-clause:
31228 initializer (omp_priv initializer)
31229 initializer (function-name (argument-list)) */
31231 static void
31234 {
31244 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
31251 {
31283 }
31295 /* Types may not be defined in declare reduction type list. */
31298 parser->type_definition_forbidden_message
31304 saved_colon_doesnt_start_class_def_p
31309 {
31313 ;
31334 else
31339 else
31341 }
31343 /* Restore the saved message. */
31346 parser->colon_doesnt_start_class_def_p
31351 {
31352 fail:
31355 }
31361 {
31362 tree fntype
31365 NULL_TREE);
31384 {
31389 }
31391 {
31393 {
31402 }
31409 }
31410 else
31411 {
31414 }
31417 else
31420 {
31423 }
31425 {
31428 else
31433 }
31438 else
31439 {
31448 }
31455 }
31459 done:
31460 /* Free any declarators allocated. */
31462 }
31464 /* OpenMP 4.0
31465 #pragma omp declare simd declare-simd-clauses[optseq] new-line
31466 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31467 initializer-clause[opt] new-line
31468 #pragma omp declare target new-line */
31470 static void
31473 {
31475 {
31480 {
31483 context);
31485 }
31488 {
31491 context);
31493 }
31495 {
31498 }
31500 {
31504 }
31505 }
31509 }
31511 /* Main entry point to OpenMP statement pragmas. */
31513 static void
31515 {
31516 tree stmt;
31521 {
31569 }
31573 }
31574 \f
31575 /* Transactional Memory parsing routines. */
31577 /* Parse a transaction attribute.
31579 txn-attribute:
31580 attribute
31581 [ [ identifier ] ]
31583 ??? Simplify this when C++0x bracket attributes are
31584 implemented properly. */
31586 static tree
31588 {
31603 {
31607 /* For keywords, use the canonical spelling,
31608 not the parsed identifier. */
31612 }
31613 else
31617 error1:
31620 }
31622 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31624 transaction-statement:
31625 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31626 compound-statement
31627 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31628 */
31630 static tree
31632 {
31647 else
31648 {
31652 }
31654 /* Parse a noexcept specification. */
31657 /* Keep track if we're in the lexical scope of an outer transaction. */
31669 }
31671 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31673 transaction-expression:
31674 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31675 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31676 */
31678 static tree
31680 {
31705 /* Set this early. This might mean that we allow transaction_cancel in
31706 an expression that we find out later actually has to be a constexpr.
31707 However, we expect that cxx_constant_value will be able to deal with
31708 this; also, if the noexcept has no constexpr, then what we parse next
31709 really is a transaction's body. */
31712 /* Parse a noexcept specification. */
31718 {
31725 }
31726 else
31727 {
31728 /* The only expression that is available got parsed for the noexcept
31729 already. noexcept is true then. */
31732 }
31741 }
31743 /* Parse a function-transaction-block.
31745 function-transaction-block:
31746 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31747 function-body
31748 __transaction_atomic txn-attribute[opt] function-try-block
31749 __transaction_relaxed ctor-initializer[opt] function-body
31750 __transaction_relaxed function-try-block
31751 */
31753 static bool
31755 {
31771 else
31772 {
31776 }
31784 else
31785 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31793 }
31795 /* Parse a __transaction_cancel statement.
31797 cancel-statement:
31798 __transaction_cancel txn-attribute[opt] ;
31799 __transaction_cancel txn-attribute[opt] throw-expression ;
31801 ??? Cancel and throw is not yet implemented. */
31803 static tree
31805 {
31811 RT_TRANSACTION_CANCEL);
31818 /* ??? Parse cancel-and-throw here. */
31823 {
31827 }
31829 {
31833 }
31835 {
31838 {
31844 }
31845 }
31847 {
31851 }
31857 }
31858 \f
31859 /* The parser. */
31863 \f
31864 /* Special handling for the first token or line in the file. The first
31865 thing in the file might be #pragma GCC pch_preprocess, which loads a
31866 PCH file, which is a GC collection point. So we need to handle this
31867 first pragma without benefit of an existing lexer structure.
31869 Always returns one token to the caller in *FIRST_TOKEN. This is
31870 either the true first token of the file, or the first token after
31871 the initial pragma. */
31873 static void
31875 {
31884 {
31891 }
31892 else
31895 /* Skip to the end of the pragma. */
31899 /* Now actually load the PCH file. */
31903 /* Read one more token to return to our caller. We have to do this
31904 after reading the PCH file in, since its pointers have to be
31905 live. */
31907 }
31909 /* Parses the grainsize pragma for the _Cilk_for statement.
31910 Syntax:
31911 #pragma cilk grainsize = <VALUE>. */
31913 static void
31915 {
31917 {
31922 {
31925 }
31927 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
31930 else
31932 "%<#pragma cilk grainsize%> is not followed by "
31935 }
31937 }
31939 /* Normal parsing of a pragma token. Here we can (and must) use the
31940 regular lexer. */
31942 static bool
31944 {
31956 {
31964 {
31974 }
31979 {
31989 }
31994 {
32000 "%<#pragma omp taskwait%> may only be "
32005 }
32010 {
32016 "%<#pragma omp taskyield%> may only be "
32021 }
32026 {
32032 "%<#pragma omp cancel%> may only be "
32037 }
32042 {
32048 "%<#pragma omp cancellation point%> may only be "
32053 }
32091 "%<#pragma omp section%> may only be used in "
32096 {
32103 {
32106 }
32109 }
32113 {
32117 }
32123 {
32127 }
32129 /* Ignore the pragma if Cilk Plus is not enabled. */
32131 {
32134 }
32135 else
32136 {
32140 }
32147 bad_stmt:
32150 }
32154 }
32156 /* The interface the pragma parsers have to the lexer. */
32158 enum cpp_ttype
32160 {
32173 else
32174 {
32178 }
32181 }
32183 \f
32184 /* External interface. */
32186 /* Parse one entire translation unit. */
32188 void
32190 {
32202 }
32204 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
32205 vectorlength clause:
32206 Syntax:
32207 vectorlength ( constant-expression ) */
32209 static tree
32212 {
32214 tree expr;
32215 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
32216 safelen clause. Thus, vectorlength is represented as OMP 4.0
32217 safelen. For SIMD-enabled function it is represented by OMP 4.0
32218 simdlen. */
32221 loc);
32222 else
32224 loc);
32232 /* If expr == error_mark_node, then don't emit any errors nor
32233 create a clause. if any of the above functions returns
32234 error mark node then they would have emitted an error message. */
32236 ;
32244 else
32245 {
32246 tree c;
32248 {
32253 }
32254 else
32255 {
32260 }
32261 }
32266 }
32268 /* Handles the Cilk Plus #pragma simd linear clause.
32269 Syntax:
32270 linear ( simd-linear-variable-list )
32272 simd-linear-variable-list:
32273 simd-linear-variable
32274 simd-linear-variable-list , simd-linear-variable
32276 simd-linear-variable:
32277 id-expression
32278 id-expression : simd-linear-step
32280 simd-linear-step:
32281 conditional-expression */
32283 static tree
32285 {
32291 {
32295 }
32300 {
32303 {
32307 }
32314 {
32318 }
32319 else
32320 {
32324 /* If present, parse the linear step. Otherwise, assume the default
32325 value of 1. */
32327 {
32334 {
32335 /* If an error has occurred, then the whole pragma is
32336 considered ill-formed. Thus, no reason to keep
32337 parsing. */
32340 }
32348 else
32350 "step size must be an integer constant "
32352 }
32354 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
32360 }
32365 else
32366 {
32371 }
32372 }
32376 }
32378 /* Returns the name of the next clause. If the clause is not
32379 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
32380 token is not consumed. Otherwise, the appropriate enum from the
32381 pragma_simd_clause is returned and the token is consumed. */
32383 static pragma_omp_clause
32385 {
32386 pragma_omp_clause clause_type;
32403 else
32408 }
32410 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
32412 static tree
32414 {
32419 {
32420 pragma_omp_clause c_kind;
32427 /* Use the OpenMP 4.0 equivalent function. */
32430 /* Use the OpenMP 4.0 equivalent function. */
32432 clauses);
32434 /* Use the OMP 4.0 equivalent function. */
32436 clauses);
32438 /* Use the OMP 4.0 equivalent function. */
32440 else
32441 {
32445 }
32446 }
32452 else
32454 }
32456 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
32458 static void
32460 {
32467 {
32471 }
32480 }
32482 /* Main entry-point for parsing Cilk Plus _Cilk_for
32483 loops. The return value is error_mark_node
32484 when errors happen and CILK_FOR tree on success. */
32486 static tree
32488 {
32503 else
32509 }
32511 /* Create an identifier for a generic parameter type (a synthesized
32512 template parameter implied by `auto' or a concept identifier). */
32515 static tree
32517 {
32521 }
32523 /* Predicate that behaves as is_auto_or_concept but matches the parent
32524 node of the generic type rather than the generic type itself. This
32525 allows for type transformation in add_implicit_template_parms. */
32529 {
32531 }
32533 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
32534 (creating a new template parameter list if necessary). Returns the newly
32535 created template type parm. */
32537 tree
32539 {
32542 /* We are either continuing a function template that already contains implicit
32543 template parameters, creating a new fully-implicit function template, or
32544 extending an existing explicit function template with implicit template
32545 parameters. */
32553 {
32557 }
32558 else
32559 {
32560 /* Roll back to the existing template parameter scope (in the case of
32561 extending an explicit function template) or introduce a new template
32562 parameter scope ahead of the function parameter scope (or class scope
32563 in the case of out-of-line member definitions). The function scope is
32564 added back after template parameter synthesis below. */
32569 {
32572 }
32574 {
32575 /* If not defining a class, then any class scope is a scope level in
32576 an out-of-line member definition. In this case simply wind back
32577 beyond the first such scope to inject the template parameter list.
32578 Otherwise wind back to the class being defined. The latter can
32579 occur in class member friend declarations such as:
32581 class A {
32582 void foo (auto);
32583 };
32584 class B {
32585 friend void A::foo (auto);
32586 };
32588 The template parameter list synthesized for the friend declaration
32589 must be injected in the scope of 'B'. This can also occur in
32590 erroneous cases such as:
32592 struct A {
32593 struct B {
32594 void foo (auto);
32595 };
32596 void B::foo (auto) {}
32597 };
32599 Here the attempted definition of 'B::foo' within 'A' is ill-formed
32600 but, nevertheless, the template parameter list synthesized for the
32601 declarator should be injected into the scope of 'A' as if the
32602 ill-formed template was specified explicitly. */
32605 {
32608 }
32609 }
32615 {
32616 /* Introduce a new template parameter list for implicit template
32617 parameters. */
32621 parser->implicit_template_scope
32628 }
32629 else
32630 {
32631 /* Synthesize implicit template parameters at the end of the explicit
32632 template parameter list. */
32639 parser->implicit_template_parms
32641 }
32642 }
32644 /* Synthesize a new template parameter and track the current template
32645 parameter chain with implicit_template_parms. */
32649 synth_id);
32650 tree new_parm
32652 input_location,
32659 parser->implicit_template_parms
32661 else
32666 /* If creating a fully implicit function template, start the new implicit
32667 template parameter list with this synthesized type, otherwise grow the
32668 current template parameter list. */
32671 {
32678 }
32679 else
32680 {
32685 }
32690 }
32692 /* Finish the declaration of a fully implicit function template. Such a
32693 template has no explicit template parameter list so has not been through the
32694 normal template head and tail processing. synthesize_implicit_template_parm
32695 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32696 provided if the declaration is a class member such that its template
32697 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32698 form is returned. Otherwise NULL_TREE is returned. */
32700 tree
32702 {
32707 {
32711 }
32721 }